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.
In order to eliminate accident, reduce congestion and improve the efficiency of the traffic circle, three effective and feasible methods are proposed.As an example,the traffic circle flow of the circle in Xiamen China is simulated by these methods above using VISSIM soft.The results of simulation show that three methods applied to different traffic flow each,then we did further simulations to the...
Based on the analysis of the standard Particle Swarm Optimization and the characteristic of typical multi-intersection for urban trunk road, a traffic flow forecasting model using dynamic recursion neural network is presented. The feature of this network is that the output of the hidden layer connects to the input of itself through the delay and storage of the context layer. The method of self-connection...
Three applications in wireless networks where model-free stochastic learning is applicable, are discussed. The learning based optimization problems are formulated and simulation results are presented. Some open issues are also discussed.
The ever changing demands on computational resources has information systems managers looking for solutions that are more flexible. Using a ldquobigger boxrdquo that has more and faster processors and permanent storage or more random access memory (RAM) is not a viable solution as the system usage patterns vary. In order for a system to handle the peak load adequately, it will go underutilized much...
In this paper, we study bandwidth management of a wireless/optical based access/metro network in support of voice and data services. For voice services, we use a finite state Markov Chain to estimate the blocking probability of voice circuits over an Adaptive modulation and coding wireless channel, as a function of the channel parameters. For data services, we evaluate a rate matching and a buffer...
This paper addresses adaptive channel estimation for time-varying mobile wireless channels with nonstationary statistics. We presents a reduced complexity adaptive channel estimator based on a set membership filtering approach known as the Optimal Bounding Ellipsoid (OBE) algorithm. To exploit time and frequency domain correlation properties of the channel in an efficient low-complexity way, we allow...
In this paper, we propose an adaptive pacing scheme at the link layer for IEEE 802.11 based multihop wireless networks. Our objective is to improve the performance of higher layer protocols without any modifications to them. Our adaptive pacing scheme estimates the four-hop transmission delay in the network path without incurring any additional overheads, and accordingly paces the packets to reduce...
A conflict of multiplicity k occurs when k stations transmit simultaneously to a multiple access channel. As a result, all stations receive feedback indicating whether k is 0, 1, or is ≥ 2. If k = 1 the transmission succeeds, whereas if k ≥ 2 all the transmissions fail. In general, no a priori information about k is available. We present and analyze an algorithm that enables the conflicting stations...
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.