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.
We consider a class of multiuser optimization problems in which user interactions are seen through congestion cost functions or coupling constraints. Our primary emphasis lies on the convergence and error analysis of distributed algorithms in which users communicate through aggregate user information. Traditional implementations are reliant on strong convexity assumptions, require coordination across...
In this paper we propose centralized feedback control laws for mobile sensor networks so that sensor trajectories cover a given domain as uniformly as possible. The design of the feedback law is based on a measure for uniformity of the trajectories given as a distance between a certain delta-like distribution on the trajectories and a desired probability distribution. The design of control is of Lyapunov-type...
Under grid environment, a resource discovery mechanism could dramatically affect both performance and efficiency of the system. Currently, however, since most models of grid discovery are centralized, keyword based matching ones, outcomes of discovery could seldom cater customers' needs. This paper puts forward a grid resource discovery model (GRDM) based on formal ontology semantics (FOS) by analyzing...
This paper considers the problem of constructing smoothing spline surfaces recursively each time when a new set of data is observed. The spline surfaces are constituted by employing normalized uniform B-splines as the basis functions. Then, based on the basic problem of optimal smoothing splines and an idea of recursive least squares method, we develop a recursive design algorithm of optimal smoothing...
We consider a distributed multi-agent network system where the goal is to minimize an objective function that can be written as the sum of component functions, each of which is known partially (with stochastic errors) to a specific network agent. We propose an asynchronous algorithm that is motivated by random gossip schemes where each agent has a local Poisson clock. At each tick of its local clock,...
In this paper we consider the problem of constructing a distributed feedback law to achieve synchronization for a group of k agents whose states evolve on SO(n) and which exchange only partial state information along communication links. The partial state information is given by the action of the state on reference vectors in ??n. We propose a gradient based control law which achieves exponential...
In this paper, some improvements, including the pyramid frame in image scale space, key point locating method for the SIFT (scale invariant feature transform) algorithm, are developed. In view of the characteristic of plant images, the calculating strategy is also improved. With the improved SIFT algorithm, features in plant images are effectively extracted, and matched with BBF (Best Bin First) algorithm...
Determining all candidate keys is important step in designing relational database. Familiar algorithms are generally time-consuming and are not easy to get complete result. In this paper we transform the problem into counterpart one in logic algebra and solve it effectively and fully by using Karnaugh map. Q-M method can replace Karnaugh map effectively in the case of greater number of attributes.
The aim of test paper composing is to compose an optimization test paper that satisfies the parameters which the user inputs, so the test paper composing problem is a classical multi-objective linear programming problem. After analyzing the mathematical model of the test paper composing problem, this paper converted part of the restricting conditions of test paper composing problem to objective function,...
Discernibility matrix method is an important method to design algorithm for computing the core based on information entropy. In this method, the core is found by discovering all discernibility elements of discernibility matrix. So this method is very time consuming. To improve the efficient of computing the core based on information entropy, the core of the simplified decision which is the same as...
Applying triangulation theory of the Van der laan-Talman algorithm, an improved genetic algorithm is proposed to solve optimal problems in this paper. The algorithm operates on a simplicial subdivision of searching space and generates the integer labels at the vertices, and then crossover operators and increasing dimension operators relying on the integer labels are designed. In this case, whether...
Recent advances in systems of networked sensors have set the stage for smart environments which will have wide-ranging applications from intelligent wildlife monitoring to social applications such as health and elderly care service provisioning. Perhaps the most natural problem in sensor systems is the ??efficient?? propagation of a sensed local event. In order to address this problem, the notion...
When a task is received by an agent organization in multi-agent system (MAS), it should be partitioned into multiple subtasks which will be assigned to suitable agents to be pursued. A goal model of autonomous agent organization (GMAAO) is proposed in which a trigger mechanism of event is added to the traditional "AND/OR" task decomposition tree to deal with the event-driven feature of MAS,...
In this paper a new sequential niche algorithm for locating all solutions in multimodal optimization problems is introduced. The algorithm combines crowding with searching-valley function to keep the diversity of population efficiently. The sequential process proceeds to search for additional extrema. Unlike other algorithms the efficiency of this sequential niche genetic algorithm is not highly sensitive...
Image holes can be a direct refection of digital image complexity. We propose a hole counting formula for binary images which is the microscopical exhibition of image hole nature. Based on image Euler Number formula, the formula is proved and a new approach is proposed to count image holes. Our intensive experiments show the correctness of the hole counting formula and the feasibility of the approach.
Most previous sequential mining algorithms have the following two main drawbacks: On one hand, all sequential patterns are treated uniformly while sequential patterns have different importance. On the other hand, most of the sequence mining algorithms still generate an exponentially large number of sequential patterns when a minimum support is lowered. In this paper, a weighted closed sequential pattern...
Association rules mining is an important research topic in data mining and knowledge discovery. Traditional algorithms for mining association rules are built on the binary attributes databases, which has three limitations. Firstly, it cannot concern quantitative attributes; secondly, only the positive association rules are discovered; thirdly, it treat each item with the same significance although...
This paper presents reports a design and development of the interactive map using Scalable Vector Graphics (SVG) that can be used to find the shortest path. Using our interactive map, the user will be able to set the route or path to the desired location. If that path is congested, the map will find the second shortest path to the user. In the usability study, we have tested the map with the mean...
Frequent patterns discovery is a core functionality used in many mining tasks and large broad application. In this paper, we present a new algorithm, VMUDG, for vertical mining of frequent itemsets. The proposed algorithm adapts a new efficient approach that classifies all frequent 2-itemsets into separate groups according to their diffsets. Using these groups, the proposed algorithm offers three...
In this paper we propose a new cover traffic generation algorithm for flow-based anonymity systems and compare it with other algorithms from the literature. Our algorithm is based on four ideas: fixed time rounds, flow classification with different protection methods for different classes, protection depending on the potential cost and finally, use of history. Simulation results show that our solution...
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.