We propose a novel true random number generator using mouse movement and a one-dimensional chaotic map. We utilize the x-coordinate of the mouse movement to be the length of an iteration segment of our TRNs and the y-...
详细信息
We propose a novel true random number generator using mouse movement and a one-dimensional chaotic map. We utilize the x-coordinate of the mouse movement to be the length of an iteration segment of our TRNs and the y-coordinate to be the initial value of this iteration segment. And, when it iterates, we perturb the parameter with the real value produced by the TRNG itself. And we find that the TRNG we proposed conquers several flaws of some former mouse-based TRNGs. At last we take experiments and test the randomness of our algorithm with the NIST statistical test suite;results illustrate that our TRNG is suitable to produce true random numbers (TRNs) on universal personal computers (PCs).
The present paper proposes a new method for analytical modelling multiservice networks with implemented traffic overflow mechanisms. The basis for the proposed method is a special two-dimensional convolution algorithm...
详细信息
The present paper proposes a new method for analytical modelling multiservice networks with implemented traffic overflow mechanisms. The basis for the proposed method is a special two-dimensional convolution algorithm that enables determination of the occupancy distribution and the blocking probability in network systems in which traffic streams of individual classes can be serviced by both primary and alternative resources. The algorithm worked out by the authors makes it possible to model systems with any type of traffic offered to primary resources. In order to estimate the accuracy of the proposed method, the analytical results of blocking probabilities in selected networks with traffic overflow have been compared with simulation data.
Time interleaving is one of the most efficient techniques employed in high-speed sampling systems. However, the frequency response mismatch among different channels will create distortion tones that degrade the system...
详细信息
Time interleaving is one of the most efficient techniques employed in high-speed sampling systems. However, the frequency response mismatch among different channels will create distortion tones that degrade the system performance. In this paper, a self-adaptive frequency response mismatch compensation method is presented, where the design of compensation filter is optimized with a self-adapting strategy. This digital postprocessing technique realizes the compensation of frequency response effectively and also the increase of the digital bandwidth of the acquisition system. MATLAB-based simulation and an actual two-channel acquisition system test verify the effectiveness of the algorithm.
With the development of novel RGB-D visual sensors, data association has been a basic problem in 3D Visual Simultaneous Localization and Mapping (VSLAM). To solve the problem, a VSLAM algorithm based on Multiple Itera...
详细信息
With the development of novel RGB-D visual sensors, data association has been a basic problem in 3D Visual Simultaneous Localization and Mapping (VSLAM). To solve the problem, a VSLAM algorithm based on Multiple Iterative Closest Point (MICP) is presented. By using both RGB and depth information obtained from RGB-D camera, 3D models of indoor environment can be reconstructed, which provide extensive knowledge for mobile robots to accomplish tasks such as VSLAM and Human-Robot Interaction. Due to the limited views of RGB-D camera, additional information about the camera pose is needed. In this paper, the motion of the RGB-D camera is estimated by a motion capture system after a calibration process. Based on the estimated pose, the MICP algorithm is used to improve the alignment. A Kinect mobile robot which is running Robot Operating System and the motion capture system has been used for experiments. Experiment results show that not only the proposed VSLAM algorithm achieved good accuracy and reliability, but also the 3D map can be generated in real time.
Although the scheduling problem of the uplink transmission in the IEEE 802.16 broadband wireless access network is extensively discussed, most of the results are limited to the quality of service (QoS) upon throughput...
详细信息
Although the scheduling problem of the uplink transmission in the IEEE 802.16 broadband wireless access network is extensively discussed, most of the results are limited to the quality of service (QoS) upon throughput and delay requirement. But as in practice only limited wireless resources are made available, a fairness-based scheduling upon each connection's QoS provides better outcomes. In this study, the authors propose a new fair uplink scheduling for real-time polling service and non-real-time polling service with the proportional sharing of excess bandwidth of the network. To implement the proposed fair scheduling that satisfies the delay requirement and full bandwidth utilisation, the authors introduce the rate control algorithm. With the proposed scheduling, we guarantee the fairness, delay requirement and full bandwidth utilisation which are not fully achieved in the existing results.
In this paper we present dart throwing algorithms to generate maximal Poisson disk point sets directly on 3D surfaces. We optimize dart throwing by efficiently excluding areas of the domain that are already covered by...
详细信息
In this paper we present dart throwing algorithms to generate maximal Poisson disk point sets directly on 3D surfaces. We optimize dart throwing by efficiently excluding areas of the domain that are already covered by existing darts. In the case of triangle meshes, our algorithm shows dramatic speed improvement over comparable sampling methods. The simplicity of our basic algorithm naturally extends to the sampling of other surface types, including spheres, NURBS, subdivision surfaces, and implicits. We further extend the method to handle variable density points, and the placement of arbitrary ellipsoids without overlap. Finally, we demonstrate how to adapt our algorithm to work with geodesic instead of Euclidean distance. Applications for our method include fur modeling, the placement of mosaic tiles and polygon remeshing.
Optimizing highway alignment requires a versatile set of cost functions and an efficient search method to achieve the best design. Because of numerous highway design considerations, this issue is classified as a const...
详细信息
Optimizing highway alignment requires a versatile set of cost functions and an efficient search method to achieve the best design. Because of numerous highway design considerations, this issue is classified as a constrained problem. Moreover, because of the infinite number of possible solutions for the problem and the continuous search space, highway alignment optimization is a complex problem. In this study, a customized particle swarm optimization algorithm was used to search for a near-optimal highway alignment, which is a compound of several tangents, consisting of circular (for horizontal design) and parabolic (for vertical alignment) curves. The selected highway alignment should meet the constraints of highway design while minimizing total cost as the objective function. The model uses geographical information system (GIS) maps as an efficient and fast way to calculate right-of-way costs, earthwork costs, and any other spatial information and constraints that should be implemented in the design process. The efficiency of the algorithm was verified through a case study using an artificial map as the study region. Finally, we applied the algorithm to a real-world example and the results were compared with the alignment found by traditional methods.
Optimum algorithm for digital assays treats chemical compartments as bits of probabilistic information and arranges these bits in a fractional positional system. Maximization of information gain reduces, by orders of ...
详细信息
Optimum algorithm for digital assays treats chemical compartments as bits of probabilistic information and arranges these bits in a fractional positional system. Maximization of information gain reduces, by orders of magnitude, the number of partitions required to achieve the requested dynamic range and precision of the assay. The method simplifies the execution of digital analytical methods providing for more accessible use of absolute quantization in research and in diagnostics.
An efficient algorithm is presented for computing discrete or continuous cubic smoothing splines with uniformly spaced and uniformly weighted measurements. The algorithm computes both the spline values and the general...
详细信息
An efficient algorithm is presented for computing discrete or continuous cubic smoothing splines with uniformly spaced and uniformly weighted measurements. The algorithm computes both the spline values and the generalized cross-validation score. Execution time and memory use are reduced by carefully exploiting the problem's rich structure, The frequency domain properties of the steady-state cubic spline smoother are also examined. (C) 2008 Elsevier B.V. All rights reserved.
Despite the reported effectiveness of analytical algorithms in facility layout planning, a detailed literature survey suggests a lack of new analytical methods in recent years. This paper focuses on open space facilit...
详细信息
Despite the reported effectiveness of analytical algorithms in facility layout planning, a detailed literature survey suggests a lack of new analytical methods in recent years. This paper focuses on open space facilities layout planning that involves modules with constant aspect ratios. We propose a construction-cum-improvement algorithm involving a novel combination of a boundary search-based heuristic placement and steepest descent-based analytical improvement. In the construction phase, the algorithm places a new module at the optimal location on the boundary of a previously constructed cluster of modules. In the improvement phase, the algorithm alternates between boundary search and steepest descent moves until it converges to a local optimum. Experiments with well-known test problems indicate that the proposed algorithm produced solutions superior both to published results and to those produced by VIP-PLANOPT, a popular, oft-cited and commercially available layout planning and optimisation software.
暂无评论