| 词汇 | example_english_server |
| 释义 | Examples of serverThese examples are from corpora and from sources on the web. Any opinions in the examples do not represent the opinion of the Cambridge Dictionary editors or of Cambridge University Press or its licensors. We now review the previous research on queuing systems with flexible, failureprone servers and contrast this work with our results. The optimal control of a two-stage tandem queueing system with flexible servers. Searches using a variety of protein domain servers available on the web failed to ascribe any functional significance to this region. Consequently, we performed two sets of numerical experiments aimed at determining the structure of the optimal policy for systems with three unreliable servers. Our results indicate that, for these systems, the structure of the optimal policy remains unchanged when the servers are subject to failures. We consider a polling system where a group of an infinite number of servers visits sequentially a set of queues. Under policies pi2 and p i02, the roles of servers i1 and i2 are reversed (as described earlier). There exist standard log entry formats produced by the popular servers, and software available which processes the log files to produce reports. I thus had many more interactions with both servers and kitchen workers than with actual bar customers. The service times, lifetimes, and repair times of all servers are independent and exponentially distributed random variables. Similarly, the optimal policy for systems with two stations and two reliable servers also appears to be optimal when the two servers are unreliable. Consider a replicated database in which the processes of a group form a set of distributed servers. There is also much research on the optimal use of flexible servers in tandem systems with holding costs. We will refer to the polling instant of queue i as the moment when the servers enter that queue. More specifically, we show that when the servers are generalists, any nonidling policy is optimal, irrespective of the reliability of the servers. Similarly, there is much of work in the literature on queues with unreliable servers. We now evaluate the performance of these heuristics in tandem lines with failure-prone servers. Our focus is on systems with generalist servers who are equally skilled at all tasks, but we also consider systems with arbitrary service rates. The same assertion holds for plot (a) (the first set of numerical experiments) when the number of servers is odd. Observe that, under this strategy, the servers also visit the queues that are empty at the beginning of the cycle. However, they only considered the allocation of the flexible servers and assumed that their service rates do not depend on the station. However, these articles do not focus on the case where some servers are dedicated to specific stations. Note that the counterintuitive behavior described in this paragraph can also occur when the servers are all generalists. The key component in this framework is a central hub, which mediates the interaction among various servers that realize different dialog system components. The cluster includes all the servers and the load balancing mechanism. Because the bartender making drinks for servers worked right next to the wait station, interactions between servers and the bartender were quite frequent. Hosts may become servers and servers may become managers. Low bandwidth installations can be run on servers with very modest specifications. However, animation and videos can take a considerable amount of time to download even with fast university servers and networks. The toolkit also provides utility agents such as name servers and visualizers. Such places are libraries of a new kind, which can deal with servers, databases, listening devices and annotation tools. On the other hand, if the servers are not humans, failures could refer to the instances such as breakdowns and maintenance. There is a significant amount of literature on queues with flexible servers. Second, we assume that all servers incur operating costs, different for each station, during the time they work. Thus, the optimal policy is of threshold type both when the servers are always available and also when they might fail. We conjecture that the structure of the optimal policy remains unchanged when the servers are subject to failures. We study the dynamic assignment of servers to stations in such systems with the goal of maximizing the long-run average throughput. In recent years, there has been a growing interest in queues with flexible servers. On the other hand, most of the articles that have considered the optimal assignment of servers to multiple interconnected queues focus on minimizing holding costs. Composing two servers with this property should compose the specifications, meaning both servers will make progress. The template also calls servers to transmit data between the two language systems. Furthermore, making minor modifications to a few time-critical components improved performance to a level acceptable for anything but the most heavily loaded web servers. The recognition, multimodal integration, and backend servers can reside either on the device or be made available over a wireless network. The uppertier is composed by well-connected and powerful servers, and the lower-tier, in contrast, consists of clients with limited computational resources, which are temporarily available. However, there are further reasons for these two servers to exhibit different behaviour in certain type environments. In this example, the server's choice to pass the directive off to the bartender may result from the face-threatening nature of this specific request. An interesting task could be the identification of a minimal set of servers that ensures the connectivity of a set of computers. As servants pulling commands are operationally indistinguishable from servers acting upon clients' requests, they can be used as emulators for servers. Continuously running servers cannot allow memory leaks, and therefore processing dynamic data using atoms requires atom garbage collection. Our numerical results indicate that these heuristic policies yield good throughput performance even when servers are subject to failures. Most of those are run from university servers and a large majority are student-run. Elements of imperative programming are needed in applications such as web servers, or to provide efficient implementations of well-known algorithms, such as many graph algorithms. Anonymity in electronic communications can be achieved through anonymous remailer servers. Existing middleware such as application servers can meet many of these needs. Typically, servers have one form of access, while clients require a different form. The following proposition provides sufficient conditions under which it is desirable to reverse the roles of servers i1 and i2 in these two cases. 2, where s* is the optimal switch point for the corresponding system with reliable servers. Then there exists an optimal policy that either idles all flexible servers or assigns them all to a single station. Therefore, it is optimal to either idle or use all flexible servers. Expulsion and scheduling control for multiclass queues with heterogenous servers. Note that in such a case, customers enjoy a positive consumer surplus and the server's objective differs from the social objective. The model consists of a set of s parallel, identical servers and a finite queue (waiting line). Restaurant bartenders are responsible for making drinks both for customers at the bar and for servers waiting on customers dining in the restaurant. To reduce this problem, a small runtime type checker was included as part of our servers to check the parameters of each service. Our objective is to characterize an allocation strategy for the flexible servers that minimizes the expected average cost. We study the dynamic assignment of servers to stations with the goal of maximizing the long-run average throughput. First, assume that only one of the servers is subject to failures. There are s 1 servers in the system available to serve the customers. They also propose that clients develop proofs of access using these application-specific logics and send them to servers to validate. Using special purpose servers may be interesting because the approach possibly allows greater functionality. In the reactive layer, a network of servers offers basic system skills that are grouped within the servers according to functional togetherness. The fourth subsection compares the results and draws conclusions on the effect of the assumptions on the server's expected profit. In many of these applications, as well as in most polling models, it is customary to control the amount of service given to each queue during the server's visit. Thus, when the dedicated servers are generalists, one would like to balance the service rates at the two stations (this is not correct in general, as was shown earlier). We generalize this result and prove that any nonidling policy (in which servers idle only when they are down) is still optimal when the servers are subject to failures. Secure certificates authenticate trusted servers. The value 1 is returned when the name servers for the two threads choose the same name, while the run-time error occurs if they choose different names. Imagine a query interface that allows a user to enter a query on any host to any one of these query servers, which may be on another host. The busy period in this queue is the time from an arrival that makes all c servers busy to the first time when only c 2 1 servers are busy. The authors show that the probability of interest is concave as a function of the number of servers, if the latter is strictly greater than the offered load. The blocking behaviour of the operations is achieved on the client's side by message blocking and on the server's side by the use of thread_wait/1. One manager frequently had parties at her house that were initially open to the entire restaurant staff, although they were primarily attended by servers and other managers. Both the server's state and the agent's state change after completion of the payment transaction. When such an e-mail is detected, the attached image is automatically saved onto the remote server's hard drive from where it may be accessed by the image-processing software. In this case, the image transmitted by the mobile phone is saved directly onto the server's hard drive. The main threat to scalability is the availability of alignment servers. The only centralized components are directories and alignment servers. Communication between the mobile devices and centralized servers may not be possible at certain times, but local communication may still be a possibility. Object servers contain that knowledge, which is shared and manipulated by agents. On the left side, lexical form for the input surface form serverlarda (in the servers) has a single violation coming out of the rule transducer. The servers depart from that central point and move to the following queue that will be served. We assume exponential service times, linear holding costs, and operating costs incurred by the servers at rates proportional to their speeds. Under conditions that ensure the optimality of nonidling policies, we show that the optimal allocation of flexible servers is determined by a transition-monotone policy. We consider two-stage tandem queuing systems with dedicated servers in each station and flexible servers that can serve in both stations. In their model, they assumed that processing requirements are the same in both stations, so actual processing times depend on the servers' speeds. However, we now consider a special case in which we can specify the allocation of the dedicated servers. When the servers are generalists, we were able to completely characterize the optimal policy in almost all cases. Upon arrival, a customer is addressed by one of the available servers, if any. Customers in queue 1 have priority over customers in queue 2 in the sense that servers are handling customers belonging to queue 1 first. These examples are from corpora and from sources on the web. Any opinions in the examples do not represent the opinion of the Cambridge Dictionary editors or of Cambridge University Press or its licensors. |
反思网英语在线翻译词典收录了377474条英语词汇在线翻译词条，基本涵盖了全部常用英语词汇的中英文双语翻译及用法，是英语学习的有利工具。