The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
To stay on the cutting edge, Web services ought to adapt themselves to the evolving business requirements and the changing environments. For a long-running service choreography, its member services may need to evolve even at run-time. However, inconsistencies or spurious results (e.g., unspecified receptions and deadlocks) may occur if these services evolve dynamically in an uncoordinated manner....
Automatic train regulation (ATR) dominates the service quality, transport capacity, and energy usage of a metro-line operation. The train regulator aims to maximize the schedule/headway adherence while minimizing the energy consumption. This paper presents a traffic-energy model to characterize the complicated dynamics with regard to the traffic and the energy consumption of a metro line, and devises...
As the complexity of under the condition of large-scaled resource-constrained multi-project duration optimization problems, it is difficult to give its analysis solution. With the network technology in this paper, taking the minimum number of the multi-project weighted duration as the goal, then establish a mathematical model for the optimization problem. In view of the basic cellular automaton topological...
Clos networks provide the theoretically optimal solution to build high-radix switches. This paper proposes a novel asynchronous routing algorithm for general asynchronous three-stage Clos networks. As the major sub-algorithm controlling the first two stages, the asynchronous dispatching algorithm outperforms the synchronous concurrent round-robin dispatching algorithm in behaviour level simulations...
The resource distribution in P2P network has an obvious scale free character. Using this inherent character to design resource search strategy is great significant for improving searching efficiency and reducing the costs. We analyze the scale free distribution character in P2P network, and propose a reliable random walk search algorithm to achieve high and reliable search efficiency through forwarding...
Huge amounts of data are available in large-scale networks of autonomous data sources dispersed over a wide area. Data mining is an essential technology for obtaining hidden and valuable knowledge from these networked data sources. In this paper, we investigate clustering, one of the most important data mining tasks, in one of such networked computing environments, i.e., Peer-to-Peer (P2P) network...
In the past decades, many algorithms with the goal of achieving energy efficiency have been proposed for scheduling real-time tasks. Due to a lack of a unified testing framework, most of them were evaluated via simulations under their own experimental scenarios. However, finding their performance in real processors is essential if these algorithms are to be used in practice. In this paper, we design...
Due to shrinking transistor geometries, on-chip circuits are becoming vulnerable to errors, but at the same time on-chip networks are required to provide reliable services over unreliable physical interconnects. A connection oriented stochastic routing (COSR) algorithm has been used on one NoC platform that provides excellent fault-tolerance and dynamic reconfiguration capability. A probability model...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.