Multilingual Semantics in the Request-Service Matchmaking

2006 ◽  
Author(s):  
Alexandra Galatescu
Keyword(s):  
Request Service

Extending data-driven model of software with software change request service

2018 ◽  
Vol 12 (8-9) ◽  
pp. 982-1006 ◽  
Author(s):  
Zeljko Stojanov ◽  
Dalibor Dobrilovic ◽  
Jelena Stojanov
Keyword(s):  
Data Driven ◽  
Software Change ◽  
Request Service

scholarly journals CaLRS: A Critical-Aware Shared LLC Request Scheduling Algorithm on GPGPU

2015 ◽  
Vol 2015 ◽  
pp. 1-10
Author(s):  
Jianliang Ma ◽  
Jinglei Meng ◽  
Tianzhou Chen ◽  
Minghui Wu
Keyword(s):  
Scheduling Algorithm ◽  
Global Memory ◽  
Request Sequence ◽  
Thread Level Parallelism ◽  
Level Parallelism ◽  
Memory Request ◽  
Request Service

Ultra high thread-level parallelism in modern GPUs usually introduces numerous memory requests simultaneously. So there are always plenty of memory requests waiting at each bank of the shared LLC (L2 in this paper) and global memory. For global memory, various schedulers have already been developed to adjust the request sequence. But we find few work has ever focused on the service sequence on the shared LLC. We measured that a big number of GPU applications always queue at LLC bank for services, which provide opportunity to optimize the service order on LLC. Through adjusting the GPU memory request service order, we can improve the schedulability of SM. So we proposed a critical-aware shared LLC request scheduling algorithm (CaLRS) in this paper. The priority representative of memory request is critical for CaLRS. We use the number of memory requests that originate from the same warp but have not been serviced when they arrive at the shared LLC bank to represent the criticality of each warp. Experiments show that the proposed scheme can boost the SM schedulability effectively by promoting the scheduling priority of the memory requests with high criticality and improves the performance of GPU indirectly.

Distributed Mobile Services and Interfaces for People Suffering from Cognitive Deficits

2009 ◽  
pp. 1069-1079
Author(s):  
Sylvain Giroux ◽  
Hélène Pigot ◽  
Jean-François Moreau ◽  
Jean-Pierre Savary
Keyword(s):  
Mobile Devices ◽  
Mobile Device ◽  
Cognitive Deficits ◽  
Mobile Services ◽  
Information Gathering ◽  
The Other ◽  
Cognitively Impaired ◽  
Ecological Information ◽  
Impaired People ◽  
Request Service

The mobile device presented here is designed to offer several services to enhance autonomy, security, and communication for the cognitively impaired people and their caregivers. Two mobile devices are linked through a server; one is dedicated to the patient, the other one to the caregivers. The services fill three functions for patients: a simplified reminder, an assistance request service, and an ecological information gathering service. Three services are available for the caregiver: monitoring patients’ADLs, informing system and colleagues of an intervention, and planning patients’ ADLs.

scholarly journals Algorithms and time complexity of the request-service problem

2008 ◽  
Vol 20 (2) ◽  
pp. 180-193
Author(s):  
Chunmei Liu ◽  
Legand Burge ◽  
Ajoni Blake
Keyword(s):  
Time Complexity ◽  
Request Service

Automatic Speech Recognition Applications: A Study of Methods for Defining Command Vocabularies

1995 ◽  
Vol 39 (3) ◽  
pp. 203-207
Author(s):  
Roger B. Garberg
Keyword(s):  
Speech Recognition ◽  
Data Collection ◽  
Automatic Speech Recognition ◽  
Service Operations ◽  
Critical Dimension ◽  
Data Collection And Analysis ◽  
Cognitive Activities ◽  
Time Required ◽  
Request Service ◽  
Divide Attention

Phoneme-based automatic speech recognition (ASR) technology enables designers to easily create custom command words or phrases that users can employ to request service operations. In this paper, I report results from two experiments concerning important dimensions of these ASR command vocabularies, including command naturalness/appropriateness and command recallability. Ease of recall is a critical dimension for assessing ASR commands used in multi-step applications since service subscribers may be engaged in several different cognitive activities that divide attention. Yet techniques for measuring command recallability can be difficult to implement owing to the time required for data collection and analysis. Results of these studies indicate the the dimension of command “naturalness” and memorability are closely related: under appropriate conditions, the simple procedures associated with measuring command naturalness or appropriateness can predict retrievability of command expressions.

scholarly journals On optimal stochastic jumps in multi server queue with impatient customers via stochastic control

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Ali Delavarkhalafi
Keyword(s):  
Optimal Control ◽  
Complete Information ◽  
Queuing System ◽  
Arrival Process ◽  
Impatient Customers ◽  
Time Intervals ◽  
Poisson Arrival ◽  
Server Queue ◽  
Multi Server ◽  
Request Service

<p style='text-indent:20px;'>In this paper, a queuing system as multi server queue, in which customers have a deadline and they request service from a random number of identical severs, is considered. Indeed there are stochastic jumps, in which the time intervals between successive jumps are independent and exponentially distributed. These jumps will be occurred due to a new arrival or situation change of servers. Therefore the queuing system can be controlled by restricting arrivals as well as rate of service for obtaining optimal stochastic jumps. Our model consists of a single queue with infinity capacity and multi server for a Poisson arrival process. This processes contains deterministic rate <inline-formula><tex-math id="M1">\begin{document}$ \lambda(t) $\end{document}</tex-math></inline-formula> and exponential service processes with <inline-formula><tex-math id="M2">\begin{document}$ \mu $\end{document}</tex-math></inline-formula> rate. In this case relevant customers have exponential deadlines until beginning of their service. Our contribution is to extend the Ittimakin and Kao's results to queueing system with impatient customers. We also formulate the aforementioned problem with complete information as a stochastic optimal control. This optimal control law is found through dynamic programming.</p>

scholarly journals Evaluation of firewall performance when ranging a filtration rule set

2021 ◽  
Vol 29 (3) ◽  
pp. 230-241
Author(s):  
Anatoly Y. Botvinko ◽  
Konstantin E. Samouylov
Keyword(s):  
Information Flow ◽  
Computing System ◽  
Logical Structure ◽  
Simulation Modelling ◽  
Service Discipline ◽  
The Matrix ◽  
Filtering Efficiency ◽  
Rule Set ◽  
Modelling Methods ◽  
Request Service

This article is a continuation of a number of works devoted to evaluation of probabilistic-temporal characteristics of firewalls when ranging a filtration rule set. This work considers a problem of the decrease in the information flow filtering efficiency. The problem emerged due to the use of a sequential scheme for checking the compliance of packets with the rules, as well as due to heterogeneity and variability of network traffic. The order of rules is non-optimal, and this, in the high-dimensional list, significantly influences the firewall performance and also may cause a considerable time delay and variation in values of packet service time, which is essentially important for the stable functioning of multimedia protocols. One of the ways to prevent decrease in the performance is to range a rule set according to the characteristics of the incoming information flows. In this work, the problems to be solved are: determination and analysis of an average filtering time for the traffic of main transmitting networks; and assessing the effectiveness of ranging the rules. A method for ranging a filtration rule set is proposed, and a queuing system with a complex request service discipline is built. A certain order is used to describe how requests are processed in the system. This order includes the execution of operations with incoming packets and the logical structure of filtration rule set. These are the elements of information flow processing in the firewall. Such level of detailing is not complete, but it is sufficient for creating a model. The QS characteristics are obtained with the help of simulation modelling methods in the Simulink environment of the matrix computing system MATLAB. Based on the analysis of the results obtained, we made conclusions about the possibility of increasing the firewall performance by ranging the filtration rules for those traffic scripts that are close to real ones.

Sign in / Sign up

Export Citation Format

Share Document