Search results for " network"
showing 10 items of 6428 documents
Dissipativity-Based Small-Gain Theorems for Stochastic Network Systems
2016
In this paper, some small-gain theorems are proposed for stochastic network systems which describe large-scale systems with interconnections, uncertainties and random disturbances. By the aid of conditional dissipativity and showing times of stochastic interval, small-gain conditions proposed for the deterministic case are extended to the stochastic case. When some design parameters are tunable in practice, we invaginate a simpler method to verify small-gain condition by selecting one subsystem as a monitor. Compared with the existing results, the existence-and-uniqueness of solution and ultimate uniform boundedness of input are removed from requirements of input-to-state stability and smal…
Nonlinear statistical retrieval of surface emissivity from IASI data
2017
Emissivity is one of the most important parameters to improve the determination of the troposphere properties (thermodynamic properties, aerosols and trace gases concentration) and it is essential to estimate the radiative budget. With the second generation of infrared sounders, we can estimate emissivity spectra at high spectral resolution, which gives us a global view and long-term monitoring of continental surfaces. Statistically, this is an ill-posed retrieval problem, with as many output variables as inputs. We here propose nonlinear multi-output statistical regression based on kernel methods to estimate spectral emissivity given the radiances. Kernel methods can cope with high-dimensi…
An Artificial Bee Colony Approach for Classification of Remote Sensing Imagery
2018
This paper presents a novel Artificial Bee Colony (ABC) approach for supervised classification of remote sensing images. One proposes to apply an ABC algorithm to optimize the coefficients of the set of polynomial discriminant functions. We have experimented the proposed ABC-based classifier algorithm for a Landsat 7 ETM+ image database, evaluating the influence of the ABC model parameters on the classifier performances. Such ABC model parameters are: numbers of employed/onlooker/scout bees, number of epochs, and polynomial degree. One has compared the best ABC classifier Overall Accuracy (OA) with the performances obtained using a set of benchmark classifiers (NN, NP, RBF, and SVM). The re…
PolyACO+: a multi-level polygon-based ant colony optimisation classifier
2017
Ant Colony Optimisation for classification has mostly been limited to rule based approaches where artificial ants walk on datasets in order to extract rules from the trends in the data, and hybrid approaches which attempt to boost the performance of existing classifiers through guided feature reductions or parameter optimisations. A recent notable example that is distinct from the mainstream approaches is PolyACO, which is a proof of concept polygon-based classifier that resorts to ant colony optimisation as a technique to create multi-edged polygons as class separators. Despite possessing some promise, PolyACO has some significant limitations, most notably, the fact of supporting classific…
Aesthetic considerations for the min-max K-Windy Rural Postman Problem
2017
[EN] The aesthetic quality of routes is a feature of route planning that is of practical importance, but receives relatively little attention in the literature. Several practitioners have pointed out that the visual appeal of a proposed set of routes can have a strong influence on the willingness of a client to accept or reject a specific routing plan. While some work has analyzed algorithmic performance relative to traditional min-sum or min-max objective functions and aesthetic objective functions, we are not aware of any work that has considered a multi-objective approach. This work considers a multi-objective variant of the Min-Max K-Vehicles Windy Rural Postman Problem, discusses sever…
The minimum mean cycle-canceling algorithm for linear programs
2022
Abstract This paper presents the properties of the minimum mean cycle-canceling algorithm for solving linear programming models. Originally designed for solving network flow problems for which it runs in strongly polynomial time, most of its properties are preserved. This is at the price of adapting the fundamental decomposition theorem of a network flow solution together with various definitions: that of a cycle and the way to calculate its cost, the residual problem, and the improvement factor at the end of a phase. We also use the primal and dual necessary and sufficient optimality conditions stated on the residual problem for establishing the pricing step giving its name to the algorith…
Rough Set Theory for Optimization of Packet Management Mechanism in IP Routers
2020
Bandwidth and consequently optimum overall efficiency of network system relies greatly on mechanism of packet management in IP routers. Our research objective is to implement rough set theory to minimizing number of the network system attributes responsible for decision making in selection of those packets, which improve its transmission. Such an approach is called priority queuing system model, as we assign priority to the packets selected, following rough set theory. Regardless of the file format, for all the routers, packets are transmitted in sequence one-by-one. Nonetheless, quality of streaming data largely depends on how much the packet loss is minimized, or eliminated at all, if pos…
Combined column-and-row-generation for the optimal communication spanning tree problem
2018
Abstract This paper considers the exact solution of the optimal communication spanning tree problem (OCSTP), which can be described as follows: Given an undirected graph with transportation costs on every edge and communication requirements for all pairs of vertices, the OCSTP seeks for a spanning tree that minimizes the sum of the communication costs between all pairs of vertices, where the communication cost of a pair of vertices is defined as their communication requirement multiplied by the transportation cost of the unique tree path that connects the two vertices. Two types of compact formulations for OCSTP were presented in the literature. The first one is a four-index model based on …
Secure and efficient verification for data aggregation in wireless sensor networks
2017
Summary The Internet of Things (IoT) concept is, and will be, one of the most interesting topics in the field of Information and Communications Technology. Covering a wide range of applications, wireless sensor networks (WSNs) can play an important role in IoT by seamless integration among thousands of sensors. The benefits of using WSN in IoT include the integrity, scalability, robustness, and easiness in deployment. In WSNs, data aggregation is a famous technique, which, on one hand, plays an essential role in energy preservation and, on the other hand, makes the network prone to different kinds of attacks. The detection of false data injection and impersonation attacks is one of the majo…
Subjective Logic-Based In-Network Data Processing for Trust Management in Collocated and Distributed Wireless Sensor Networks
2018
While analyzing an explosive amount of data collected in today’s wireless sensor networks (WSNs), the redundant information in the sensed data needs to be handled. In-network data processing is a technique which can eliminate or reduce such redundancy, leading to minimized resource consumption. On the other hand, trust management techniques establish trust relationships among nodes and detect unreliable nodes. In this paper, we propose two novel in-network data processing schemes for trust management in static WSNs. The first scheme targets at networks, where sensor nodes are closely collocated to report the same event. Considering both spatial and temporal correlations, this scheme generat…