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.
Given a graph G = (V, E) with real-valued edge weights, the problem of correlation k-clustering with pre-clustered items is to extend a k-clustering of distinguished vertices of G (pre-clustered items) to partition all the vertices into clusters so as to minimize the total absolute weight of cut positive edges and uncut negative edges. This problem for general graphs is APX-complete. A polynomial...
The problem of estimating node positions in sensor networks and multi agent formations has been extensively studied in the last decade for the purpose of enabling self-configurable and autonomous systems. A typical scenario involves the nodes to estimate their locations using relative measurements from neighbors. When full relative positions (coordinates or, equivalently, range and angle) between...
This paper presents a computationally efficient model predictive control algorithm applicable for linear time varying systems with bounded disturbances. The proposed algorithm is based on the use of an optimized dynamic terminal control law that makes a good control performance possible with an online optimization over relatively smaller horizon lengths. In particular, the use of a dynamic terminal...
Multiple-input multiple-output (MIMO) systems assisted by multiple relays with single antenna are considered. The signal transmission consists of two phases. In the first phase, the source node broadcasts the vector symbols to all relays, then all relays forward the symbols multiplied by gain parameters to the destination simultaneously. Unlike the case of full cooperation among relays such as a single...
An adjoint network sensitivity based incremental power pad optimization approach is proposed. The power grid is formulated as a linear network of resistive elements. Sensitivity of power pads due to the grid elements is computed. An overall cost metric is then formulated in conjuntion with IR drop. This metric is then used to refine a prior optimized source location incrementally, while meeting the...
Recently, using mobile gateway(s) as a mechanical data carries emerges as a promising approach to prolong sensor network lifetime and relaying information in partitioned network. These mobile gateways, which move in pre-determined paths, visit the sensors to upload their data. As the sensors data generation rate for different sensors may vary based on their locations, sensors need to be visited at...
A dynamic matrix control with PID structure (PID-DMC) is derived by adding proportion, integral and differential structure to the conventional cost function. However the complicated inversion computation of higher dimensional matrix is involved in the PID-DMC and it restrains the on-line application. This paper is devoted to decreasing computational complexity by exploring its internal mechanism and...
Creating replicas of frequently accessed data objects across a read intensive network can lead to reduced communication cost and end-user response time. On the contrary, data replication in the presence of writes incurs extra cost due to multiple updates. The selection of data objects and servers requires solving a constraint optimization problem, which is NP-complete in general. A majority of the...
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.