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.
There are some shortcomings in the delay tolerant network (DTN) routing algorithm, such as low message delivery rate, low network efficiency and high cost in the satellite network. In order to solve the problem above, this paper proposes a limited copy algorithm MPWLC based on service probability. In MPWLC, not only is the number of copies limited, but the storage resources of the satellite are also...
The instability of wireless links makes the choice of forwarding nodes have too many possibilities in opportunistic routing. In this paper, the Markov decision process (MDP) is used to model the whole packet forwarding process from the source node to the destination node, which facilitates making reasonable decisions when the sender selects the forwarding nodes. By solving a finite-state MDP problem,...
This paper introduces a novel layout-style with a reasonable generation algorithm for MOS analog modules in order to guarantee complete routing and perfect matching of devices. The introduced layout-style is applicable to a variety of essential MOS analog circuits. To the transistor layout, we introduce a symmetrical row-based structure where all transistors are transformed to matched pairs by duplicating...
We address layout generation of on-chip matched capacitors with the high relative accuracy. Our twisted common-centroid pattern of unit capacitors consider the post-placement routability as well as reduce a systematic mismatch induced by process gradient. We apply this algorithm to the layout design of an SAR-ADC circuit. Compared with the common spiral capacitor array, our generation method (1) produces...
In the existing works, a Kalman filter with recursive covariance estimation (KF-RCE) was proposed by Bo Feng et al. to sequentially estimating process noise covariance matrix. However, there may be a singular matrix existed in the KF-RCE algorithm, which would lead to unreasonable system state estimation in the system initial stage. In this paper, a threshold-based Kalman filter with recursive covariance...
As a tradeoff of GEO and LEO, MEO satellite system has more acceptable service performance and it is more appropriate to provide global mobile communications. A MEO satellite system model communicating according to time slots is constructed in the paper. Moreover, in order to improve comprehensive performance of the network, a novel routing algorithm applying Time Evolving Graph based on Pairing Heap...
A 330,000 gate field programmable gate array (FPGA) VS12C fabricated on 0.2μm full-depletion silicon-on-insulator (FD SOI) process is presented and the test results indicate this chip has the lower power and higher tolerance to radiation compared with Xilinx radiation-hardened XQVR300 chip implemented on 0.22μm epitaxial silicon. This paper demonstrates the benefit of the FD SOI technology on low...
Particle swarm optimization (PSO) algorithms are now being practiced for more than a decade and have been extended to solve various types of optimization problems. However, straightforward application of PSO suffers from premature convergence and lacks of intensification around the local best locations. In this paper, we propose a new particle swarm optimization strategy, namely, particle swarm optimization...
Massive parallel computing performed on many-core Network-on-Chips (NoCs) is the future of the computing. One feasible approach to implement parallel computing is to deploy multiple applications on the NoC simultaneously. In this paper, we propose a multi-application mapping method starting with the application mapping which finds a region on the NoC for each application and then task mapping which...
Considering that nodes move in wireless ad hoc networks, network topology and node locations change. A single transmission power can not meet mobile ad hoc networks. This paper proposes transmission power optimization algorithm based on various nearest-neighbor distances algorithm. Transmission node is informed of neighbor node locations in its maximum transmission range through network location management...
Along with the improvement of cloud technologies, we envision that thousands of web applications whether owned by individuals or enterprises will be migrated into cloud. These web applications share the cloud resources while require different quality of service guarantees and management policies. It is challenging while with abundant innovation opportunities given the easy and dynamic provisioning...
Resource discovery is a key component of P2P network. The resource discovery algorithm complexities of classic models, such as Chord and Pastry, are always equal or even bigger than O(logN), which means while the network scale increasing, the time delay will also increase rapidly without a ceiling. In this paper, we present a new P2P network model for resource discovery. Firstly, we take location-aware...
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.