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.
A visibility-culling-based geometric rendering algorithm is proposed in this paper so as to visualize large-scale particle data efficiently. In the algorithm, the particles are culled based on their visibility at two granularities. All data patches beyond the OpenGL view frustum are firstly thrown away as a coarse culling. And then, the remaining particles will be judged their visibility based on...
Wash trade refers to the activities of traders who utilise deliberately designed collusive transactions to increase the trading volumes for creating active market impression. Wash trade can be damaging to the proper functioning and integrity of capital markets. Existing work focuses on collusive clique detections based on certain assumptions of trading behaviours. Effective approaches for analysing...
For charging station network with mixed operation mode, only adequate parking spaces and replaced battery can meet vehicles' charging requirements. However, the number of distributed batteries is very large in the whole network. Optimal distribution of batteries in charging station network is of great importance to ensure the normal operation of station network and greatly reduce the cost of manpower,...
For selection of controlled variables (CVs) in self-optimizing control, various criteria have been proposed in the literature. These criteria are derived based on local linearization of the process model and the necessary conditions of optimality (NCO) at a nominally optimal operating point. Recently, a novel CV selection framework has been proposed by Ye et al. [1] by converting the CV selection...
The scale of some datasets generated by simulations on tens of thousands of cores are gigabyte or larger per output step. It is imperative that efficient coupling of these simulations and parallel visualization. Therefore, a patch-based parallel I/O strategy has been designed and implemented in JASMIN. These programs reconstructed or developed on JASMIN can write plotting data in many files. These...
In this paper, a parallel ray-casting volume rendering algorithm based on adaptive sampling is presented for visualizing TB-scale time-varying scientific data. The algorithm samples a data field adaptively according to its inner variation, and thus sets sampling points only in important positions. In order to integrate adaptive sampling into the parallel rendering framework, an efficient method is...
Currently, large-scale scientific and engineering simulation has reached terabyte scale, and the resulting time-varying volume data present great challenges to GPU-based volume rendering. Because huge data can not be fully loaded into the GPU memory, real-time data exchange between disk and memory is inevitable, which greatly reduces volume rendering frame rates. This paper presents a novel GPU-accelerated...
This paper deals with the motion planning for the structure configuration of Modular self-reconfigurable Robotic System based cellular automata, which consists of a large number of autonomous robotic units called " cells." we present an approach to the self-reconfiguration problem where the initial configuration is transform to the desired configuration, the algorithms are inspired by cellular...
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.