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.
Recently, DCS-cast has shown an advantage in accommodating heterogeneous users over wireless networks by combining SoftCast and Distributed Compressed Sensing (DCS). However, DCS-cast's efficiency is not actually high due to its ignorance of the temporal correlation in each packet at the encoder. This paper proposes an improved scheme named DCT-DCS-cast that removes such temporal correlation through...
With the rapid development of cloud computing, data center's resource management has become a critical component in its business model. CPU, memory and network in a data center have many effective partitioning methods among the virtual machines that could offer high-efficiency, enhanced fairness and performance guarantee. However, in existing software based virtualization architecture (e.g., Xen),...
Multi-Target assignment is an important tactical factor of BVR (Beyond Visual Range) air combat. Based on the analysis of the basic Shuffled Frog Leaping Algorithm (SFLA), an Improved Discrete Shuffled Frog Leaping Algorithm is proposed to solve the problem of multi-target assignment in BVR air combat. The threat evaluation function and the multi-target assignment model of BVR air combat are established...
Stochastic Clustering Auctions (SCAs) constitute a class of cooperative auction methods that enable improvement of the global cost of the task allocations obtained with fast greedy algorithms. Prior research had developed Contracts Sequencing Algorithms (CSAs) that are deterministic and enable transfers, swaps, and other types of contracts between team members. In contrast to CSAs, SCAs use stochastic...
SIMD architectures are less efficient for applications with the diverse control-flow behavior, which can be mainly attributed to the requirement of the identical control-flow. In this paper, we propose a novel instruction shuffle scheme that features an efficient control-flow handling mechanism. The cornerstones are composed of a shuffle source instruction buffer array and an instruction shuffle unit...
As the amount of services and users is increasing rapidly, the traditional optical network is evolved to multi-layer and multi-domain optical networks. A key research point in such a distributed environment is how to scheduling various resources effectively. For this reason, a parallel scheduling strategy for heterogeneous resources in multi-domain optical networks was proposed in this paper. Proposed...
It will be shown that the global cost of the task allocations obtained with fast greedy algorithms can be improved upon by using a class of auction methods called Stochastic Clustering Auctions (SCAs). SCAs use stochastic transfers or swaps between the task clusters assigned to each team member, allow both uphill and downhill cost movements, and rely on simulated annealing. The choice of a key annealing...
Maximum likelihood linear regression (MLLR) has been a popular speaker adaptation method for many years. In this paper, we investigate a generalization of MLLR using nonlinear regression. Specifically, kernel regression is applied with appropriate regularization to determine the transformation matrix in MLLR for fast speaker adaptation. The proposed method, called maximum penalized likelihood kernel...
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.