This study describes a binary integer programming model for mutually-operating fixed and mobile sensors in water distribution systems. The proposed method applies a deterministic optimization scheme for maximizing the...
详细信息
This study describes a binary integer programming model for mutually-operating fixed and mobile sensors in water distribution systems. The proposed method applies a deterministic optimization scheme for maximizing the monitored volume within network clusters. For a given budget, the model determines the ratio of mobile sensors to fixed sensors along with their placement and release strategies. Through assessing the benefit of placing each fixed sensor and the time and location of mobile sensors release, the combination of fixed and mobile sensors is determined. Utilizing mobile sensors for water quality monitoring is still in its infancy. Such sensors are equipped with self-powered sensing, sampling, data acquisition, and wireless transmission units. The model initiates with the combined operation of mobile and fixed sensors. It then explores the benefits of mobile sensors compared to fixed. The two battle of the water sensor networks ( BWSN) are utilized for demonstrating the model's capabilities. Mobile sensors are found to be beneficial to water distribution system monitoring when operated in conjunction with static sensors. (C) 2015 American Society of Civil Engineers.
With recent advances in consumer electronics and the increasingly urgent need for public security, camera networks have evolved from their early role of providing simple and static monitoring to current complex system...
详细信息
With recent advances in consumer electronics and the increasingly urgent need for public security, camera networks have evolved from their early role of providing simple and static monitoring to current complex systems capable of obtaining extensive video information for intelligent processing, such as target localization, identification, and tracking. In all cases, it is of vital importance that the optimal camera configuration (i.e., optimal location, orientation, etc.) is determined before cameras are deployed as a suboptimal placement solution will adversely affect intelligent video surveillance and video analytic algorithms. The optimal configuration may also provide substantial savings on the total number of cameras required to achieve the same level of utility. In this article, we examine most, if not all, of the recent approaches (post 2000) addressing camera placement in a structured manner. We believe that our work can serve as a first point of entry for readers wishing to start researching into this area or engineers who need to design a camera system in practice. To this end, we attempt to provide a complete study of relevant formulation strategies and brief introductions to most commonly used optimization techniques by researchers in this field. We hope our work to be inspirational to spark new ideas in the field.
This paper presents a general formulation for a minimum cost data association problem which associates data features via one-to-one, m-to-one and one-to-n links with minimum total cost of the links. A motivating examp...
详细信息
This paper presents a general formulation for a minimum cost data association problem which associates data features via one-to-one, m-to-one and one-to-n links with minimum total cost of the links. A motivating example is a problem of tracking multiple interacting nanoparticles imaged on video frames, where particles can aggregate into one particle or a particle can be split into multiple particles. Many existing multitarget tracking methods are capable of tracking non-interacting targets or tracking interacting targets of restricted degrees of interactions. The proposed formulation solves a multitarget tracking problem for general degrees of inter-object interactions. The formulation is in the form of a binary integer programming problem. We propose a polynomial time solution approach that can obtain a good relaxation solution of the binary integer programming, so the approach can be applied for multitarget tracking problems of a moderate size (for hundreds of targets over tens of time frames). The resulting solution is always integral and obtains a better duality gap than the simple linear relaxation solution of the corresponding problem. The proposed method was validated through applications to simulated multitarget tracking problems and a real multitarget tracking problem.
Problem solving in design is one of the main studied topic of research, and especially methods for problem solving. Generally, two kinds of methods are differentiated, those dedicated to routine design, and those focu...
详细信息
Problem solving in design is one of the main studied topic of research, and especially methods for problem solving. Generally, two kinds of methods are differentiated, those dedicated to routine design, and those focused on inventive design. The authors aim at linking the two approaches and building a continuum between both. Thus they studied the link and direct extraction of contradictions out of experiments. To do so they built a generic model of contradictions, the generalized system of contradictions (GSC). This paper proposes an algorithm for identifying and extracting generalized physical contradictions (GPCs), a part of the GSC, from experiments. First, the authors' design methodology to build the continuum from optimization till invention is introduced. The notion of GSC is presented and the focus is made on the notion of GPC. This one is described through binary integer programming and an algorithm is proposed in order to identify and extract complete set of generalized technical contradictions from experiments concerning the inventive problem.
The growing demand for video streaming is straining the current Internet, and mandating a novel approach to future Internet paradigms. The advent of Information-Centric Networks (ICN) promises a novel architecture for...
详细信息
ISBN:
(纸本)9781467364324
The growing demand for video streaming is straining the current Internet, and mandating a novel approach to future Internet paradigms. The advent of Information-Centric Networks (ICN) promises a novel architecture for addressing this exponential growth in data-intensive services, of which video streaming is projected to dominate (in traffic size). In this paper, we present a novel strategy in ICNs for adaptive caching of variable video contents tailored to different sizes and bit rates. Our objective is to achieve optimal video caching to reduce access time for the maximal requested bit rate for every user. At its core, our approach capitalizes on a rigorous delay analysis and potentiates maximal serviceability for each user. We incorporate predictors for requested video objects based on a popularity index (Zipf distribution). In our proposed model, named DASCache, we present delay queuing analysis for cached objects, providing a cap on expected delay in accessing video content. In DASCache, we present a binary integer programming (BIP) formulation for the cache assignment problem, which operates in rounds based on changes in content requests and popularity scores. DASCache reacts to changes in network dynamics that impact bit rate choices by heterogeneous users and enables users to stream videos, maximizing Quality of Experience (QoE). To evaluate the performance of DASCache, in contrast to current benchmarks in video caching, we present an elaborate performance evaluation carried out on ndnSIM, over NS-3.
This paper presents a PMU (phasor measurement unit) placement algorithm that gives the optimal PMU placement location and minimum number of PMUs for any electric network while considering different approaches. Complet...
详细信息
ISBN:
(纸本)9781467373890
This paper presents a PMU (phasor measurement unit) placement algorithm that gives the optimal PMU placement location and minimum number of PMUs for any electric network while considering different approaches. Complete observability, complete observability with N - 1 redundancy, different depths of unobservability, multi-stage sequential placement, real-time monitoring of critical buses are the various PMU placement approaches considered in this paper. The required input for the proposed algorithm is system information and other key aspects like locations of existing PMUs, locations unsuitable for PMU placement, and knowledge of critical buses. binary integer programming is used to find the respective PMU placement location and minimum number of PMUs. The algorithm is tested on IEEE 39-bus system, IEEE 118-bus system, and IEEE 300-bus system. The results suggest that the algorithm can be used on any power system network and the suitable PMU placement approach can be implemented for application.
For the Internet of Things in smart home environments, the smart gateway is the key component to collect/disseminate information from/to various sensors/actuators. In this study we investigate the smart gateway deploy...
详细信息
ISBN:
(纸本)9781479987511
For the Internet of Things in smart home environments, the smart gateway is the key component to collect/disseminate information from/to various sensors/actuators. In this study we investigate the smart gateway deployment problem in smart home environments. This problem is formulated as a constrained optimization problem with the objective to minimize the deployment cost subject to the constraints that all service areas should be covered. The smart gateway deployment problem under consideration is formulated as a binary integer programming problem. We solve it by the branch and bound method which could effectively reduce the complexity.
A Mathematical model is proposed for an offline version of a scheduling problem. The problem comprises various types of jobs (or tasks) with deadlines to be accomplished and various types of resources, whose availabil...
详细信息
A Mathematical model is proposed for an offline version of a scheduling problem. The problem comprises various types of jobs (or tasks) with deadlines to be accomplished and various types of resources, whose availability is not continuous and described by a resource calendar, to be used to accomplish the jobs. Further the scheduling must be optimum and must comply various constraints. The proposed model is a typical binary integer programming problem for the scheduling problem subject to various constraints and hence it could be solved using the techniques of binary integer programming. One heuristic method is also discussed to solve the scheduling problem.
The growing demand for video streaming is straining the current Internet, and mandating a novel approach to future Internet paradigms. The advent of Information-Centric Networks (ICN) promises a novel architecture for...
详细信息
ISBN:
(纸本)9781467364300
The growing demand for video streaming is straining the current Internet, and mandating a novel approach to future Internet paradigms. The advent of Information-Centric Networks (ICN) promises a novel architecture for addressing this exponential growth in data-intensive services, of which video streaming is projected to dominate (in traffic size). In this paper, we present a novel strategy in ICNs for adaptive caching of variable video contents tailored to different sizes and bit rates. Our objective is to achieve optimal video caching to reduce access time for the maximal requested bit rate for every user. At its core, our approach capitalizes on a rigorous delay analysis and potentiates maximal serviceability for each user. We incorporate predictors for requested video objects based on a popularity index (Zipf distribution). In our proposed model, named DASCache, we present delay queuing analysis for cached objects, providing a cap on expected delay in accessing video content. In DASCache, we present a binary integer programming (BIP) formulation for the cache assignment problem, which operates in rounds based on changes in content requests and popularity scores. DASCache reacts to changes in network dynamics that impact bit rate choices by heterogeneous users and enables users to stream videos, maximizing Quality of Experience (QoE). To evaluate the performance of DASCache, in contrast to current benchmarks in video caching, we present an elaborate performance evaluation carried out on ndnSIM, over NS-3.
This paper presents a PMU (phasor measurement unit) placement algorithm that gives the optimal PMU placement location and minimum number of PMUs for any electric network while considering different approaches. Complet...
详细信息
ISBN:
(纸本)9781467373906
This paper presents a PMU (phasor measurement unit) placement algorithm that gives the optimal PMU placement location and minimum number of PMUs for any electric network while considering different approaches. Complete observability, complete observability with N-1 redundancy, different depths of unobservability, multi-stage sequential placement, real-time monitoring of critical buses are the various PMU placement approaches considered in this paper. The required input for the proposed algorithm is system information and other key aspects like locations of existing PMUs, locations unsuitable for PMU placement, and knowledge of critical buses. binary integer programming is used to find the respective PMU placement location and minimum number of PMUs. The algorithm is tested on IEEE 39-bus system, IEEE 118-bus system, and IEEE 300-bus system. The results suggest that the algorithm can be used on any power system network and the suitable PMU placement approach can be implemented for application.
暂无评论