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 caching model is proposed to accelerate the I/O speed between disks and FPGA devices in the conditions of reconfigurable computing. Especially the speed of FPGA processing is much larger than the RAID reading rate. The accelerating strategy is based on LRU-MRU replacement, adding physical address factors at the same time. In the case of two-cache application mode, the accelerating strategy, according...
In this article history of Algol 68, USSR research groups implementing this language and it's impact on the programming as a whole in USSR are described. Algol 68 Working Group headed by academician Andrey Ershov was organized. This group had meetings 4-5 times a year in different USSR cities where Russian terminology, practical questions of translation technique, etc were discussed. History of A68LGU...
In artificial intelligence field, dynamic optimization problem under uncertain environment has always been a main topic and been widely researched these years. How to find the optimal solution around the goals to be solved is the key problem. As a typical case of uncertainty environment, maze has an important research value. In this paper we design a complex maze of random scene simulation system...
Traveling salesman Problem (TSP) is a classical NP-hard problem and has been extensively studied in literature. Eliminating the cross paths, which commonly exist in approximate solutions to large scale TSP, can effectively improve the quality of the solutions. Through studying the impact of cross paths on the cost of a loop, in this paper we develop a method to detect and dismantle cross paths, and...
Random number generators (RNGs) are one of the key tools necessary for statistical analysis and optimization methods such as Monte Carlo, particle swarm optimization (PSO) and the genetic algorithm. Various pseudo and true RNGs are available today, and they provide sufficient randomness. Unfortunately, they generate data that do not always represent the required distribution accurately, especially...
After teaching and observing students for several years, we hypothesize that learning programming is difficult for students who cannot imagine concretely how a computer works, or the process by which the CPU accesses memory and I/O via the bus according to coded programs. In this paper, we discuss why we believe it is important for programing education to help students understand how a computer works...
Reform of university courses layout is an important part in university education reform. The content and time for any course should be improved based on different students and their educational background. At the same time, relationship among different courses should also be optimized. Because of some reasons, there is no enough good guide for the current courses reform. We take advantage of evolution...
Public transportation is not only a significant symbol of the urban modernization, but also an optimal approach of solving urban crowded traffic problem. The bus route search algorithm is the key technical query system. This paper mainly discusses an algorithm based on set theory and proposes technological flow of transfer algorithm. An improved plan is presented. The algorithm is simple and effective,...
Power consumption plays a vital role in modern nanometer IC design. Clocking takes a foremost part of total chip power. Clock power can reduce by replacing a number of flip-flops with Multi-bit flip-flops. This paper proposes a efficient technique for designing a multi-bit flip-flop. It has main three approaches. After identifying the mergeable flip-flops, the combination of flip-flop table provided...
As the reasoning aspects and the knowledge based processing capabilities of RDF (Resource Description Framework) have been widely adopted in W3C Recommendation, the ontology layer and query languages of the Semantic Web stack achieve a certain level of maturity. There exists an increasing need for high performance, read-only semantic analysis for the massive RDF data. In this demo we will present...
The WEB HITS algorithm was based on data acquisition modules for vast data collection. The algorithm is typical in using the Web link structure excavation to establish data bindings between the page links to improve the linked structure. This paper suggests another acquisition module to improve the HITS algorithm, and it also had been practiced and applied through the government website platform.
Constraint optimization exists in many natural-computation applications, including neural and evolutionary computations. A key observation on the constraints of many of these application problems is that they are highly structured and involve variables with strong spatial or temporal locality. Based on this observation, large-scale problems in these applications can be partitioned by their constraints...
The quality of the repaired image will be directly influenced by the error accumulation of initial repaired for the target block in the exemplar-based algorithm. According to analysis of the pixel's surrounding image features, a new algorithm which joint structure characteristics and color differences is proposed in this paper. This algorithm considers the color differences and structure characteristics...
This paper proposes a mechanism for tracing I/O operations and their corresponding physical access on the storage servers in a parallel file system, then it guides data re-striping on the storage servers for handling complex physical access cases. To put this framework to work, we first figured out the way to map logical I/O operations on the client side to physical I/O access on the storage server...
This paper describes an option how to detect a desired Java code snippet in a large number of Java source files. The scripting language Scripthon is used to describe the desired section. Next, from this piece, an abstract tree is created, and it is compared to the other trees which are created from the Java source codes. The Java Compiler API is used to obtain the trees from the Java source codes.
We propose a general framework to analyze incentives for user cooperation, and characterize the tradeoff between fairness and efficiency for cooperative networks. More specifically, we define the incentive region as a set of action profiles that provides cooperation benefits to all users and focus on the optimization of efficiency and fairness within this region. We introduce a linear resource allocation...
This paper proposes an interactive method to solve optimization problems with an unknown objective function. In daily life, we as human beings solve practical optimization problems without using numerical information and find a promising solution for them according to our preference. We aim to develop a mathematical method to solve the problems in which only qualitative information about the objective...
This paper presents a modified bee colony optimization (BCO) by pattern reduction to reduce the computation time, called BCOPR. Although BCO was robustness optimization, but likes the other algorithm for solving optimization problem, BCO has many reduncation computations on its convergence process, as a consequence, it will more computation time. Two operators are developed to BCOPR in this paper...
In this paper, we analyze termination of multipath linear loop programs by combining the trial difference method and calculation of loop complexity upper bound. Though this method is not complete, it is useful to verify termination of multipath linear loop programs, because it is practical and it is very easy to implement.
In the course of textbook management, we should make the leavings of textbook in the warehouse to remain as minimum as possible in order to reduce the unnecessary loss. In this paper, Boolean optimization model of this problem is established, and the machinery algorithm is given. Thereby the optimum strategy of handing out textbook is realized.
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.