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.
An Integral sliding mode control algorithm for a class of unmatched uncertain system is proposed in this paper. In order to make that the perturbation is minimal, the perturbation is provided into two parts by projection matrix--the matched and unmatched perturbation. It is also shown that when the minimum is attained and the resulting perturbation is not amplified. The controller design uses integral...
With the development of web search engines, the concern on real-time performance of Top-k queries has attracted more and more attention. The author studies implement of classic algorithm No Random Access Algorithm in order to optimize performance of Top-k queries on GPU. We give a novel GPU algorithm by using the features of CUDA's programming model. Experiment results show that an implementation...
Parallel efficiency is always a fundamental research field in high performance computing. This paper focuses on parallel computing at high performance computing cluster with CASTEP program, discusses multi-core parallel efficiency in CASTEP, and analyses the influence of the main calculation parameters upon total CPU time and memory usage in case study, such as CPU cores(CPUs), cutoff energy, k-point,...
In this paper, we develop acceleration strategies for option pricing with non-linear Backward Stochastic Differential Equation (BSDE), which appears as a robust and valuable tool in financial markets. An efficient binomial lattice based method is adopted to solve the BSDE numerically. In order to reduce the global memory access frequency, the kernel invocation is avoided to be performed on each time...
The file system for the Cloud Storage usually use the distributed structure which store the metadata and the user data respectively. The I/O nodes get the management information of file from the specific metadata server through the networks. Under this mode, the metadata server should be the performance bottleneck of the whole system when huge number nodes or the heavy workloads in Cloud Storage....
Critical real time system must run under high dependable environment which guarantees a high level of reliability and security. Fault tolerance and security technique has played an important role in building such environment. In this paper, we provide an improved technique to schedule such tasks with high reliability and security requirement on high dependable distributed real time system. First,...
According to the characteristics of multi-core architectures and binary storage property of integer sequence, this paper proposes an efficient thread-level parallel algorithm for sorting integer sequence on multi-core computers. The algorithm divides the input integer sequence to several data blocks in main memory and distributes these blocks into the shared L2 cache and private L1 cache respectively,...
A complicated class-cluster is transformed into several test blocks, and these test blocks are assigned to the processing cores on multi-core computer. Each processing core executes in parallel multiple threads to handle some test blocks. The relationship among classes in each block is represented by relational pairs, and the mutation program for each relational pair is generated by applying µJava...
The Min-Min problem of finding a disjoint-path pair with the length of the shorter path minimized is known to be NP-hard in general graphs. However, it remains an open problem whether the Min-Min problem is NP-hard in some special graph such as planar graphs. In this paper, for an st-outerplanar graph G = (V;E) which is a special planar graph that can be drawn in the plane with source vertex s and...
Multiple independent spanning trees have applications to fault tolerance and data broadcasting in distributed networks. There is a conjecture on independent spanning trees: any n-connected graph has n independent spanning trees rooted at an arbitrary vertex. The conjecture has been confirmed only for n-connected graphs with n=4, and it is still open for arbitrary n-connected graphs when n ≥ 5. In...
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.