Power consumption is one of the most important problems for wireless sensor networks because of the battery limitation in each sensor. This paper presents an ant colony optimization- (ACO-) based routing algorithm to ...
详细信息
We provide a detailed analysis of the Lossy Difference Aggregator, a recently developed data structure for measuring latency in a router environment where packet losses can occur. Our analysis provides stronger perfor...
详细信息
We provide a detailed analysis of the Lossy Difference Aggregator, a recently developed data structure for measuring latency in a router environment where packet losses can occur. Our analysis provides stronger performance bounds than those given originally, and leads us to a model for how to optimize the parameters for the data structure when the loss rate is not known in advance by using competitive analysis.
Recent developments with Self-Organizing Maps (SOMs) produced methods capable of clustering graph structured data onto a fixed dimensional display space. These methods have been applied successfully to a number of ben...
详细信息
ISBN:
(纸本)9782874190445
Recent developments with Self-Organizing Maps (SOMs) produced methods capable of clustering graph structured data onto a fixed dimensional display space. These methods have been applied successfully to a number of benchmark problems and produced state-of-the-art results. This paper discusses a limitation of the most powerful version of these SOMs, known as probability measure graph SOMs (PMGraphSOMs), viz., the sparsity induced by processing a large number of small graphs, which prevents a successful application of PMGraphSOM to such problems. An approach using the idea of compactifying the generated state space to address this sparsity problem is proposed. An application to an established benchmark problem, viz., the Mutag dataset in toxicology will show that the proposed method is effective when dealing with a large number of small graphs. Hence, this work fills a gap between the processing of a number of small graphs, and the processing of densely connected graphs using PMGraphSOMs.
Line segment detection is widely used in image process and recognition field. Conventional Hough Transform (CHT) is one of the popular techniques to detect lines accurately. Randomized Hough Transform (RHT) decreases ...
详细信息
Line segment detection is widely used in image process and recognition field. Conventional Hough Transform (CHT) is one of the popular techniques to detect lines accurately. Randomized Hough Transform (RHT) decreases the huge computation of CHT, but the random samples produce large invalid samples, so it increases the time and space complexities. Another disadvantage of RHT is that some important line properties, such as line length, the start and end positions of the detected line, can not be gotten directly. This paper proposes an improved RHT algorithm to decrease the invalid samples by finding the relation between the improved chain code direction and line points. The neighbour point distances are computed to segment lines so as to retrieve the line length and positions. Experiment showed this improved algorithm can detect and locate the line segments faster and more precise than RHT in the Cartesian coordinate system, especially for the noisy-image and complicated image with lots of connected regions.
We develop, analyze, and simulate a physical model of Li+ -ion conduction inside polyethylene oxide (PEO) helical tubes, which are the solvent of LiI salt. The current is due to diffusion and electric interactions wit...
详细信息
It has been recently shown that in the case of scattering by a perfect electric conductor, it is possible to have a convergent Method of Auxiliary Sources (MAS) field due to divergent MAS currents. These conclusions a...
详细信息
In this paper, we study the stability of a networked control system involving signal quantization with finitely many levels and a bounded number of consecutive packet-dropouts. To compensate for the effect of packet-d...
详细信息
In this paper, we study the stability of a networked control system involving signal quantization with finitely many levels and a bounded number of consecutive packet-dropouts. To compensate for the effect of packet-dropouts, the controller-encoder sends a packet which contains possible quantized control inputs for finite future steps. At the receiving end, i.e., at the plant actuator side, a buffer decides the actuator input based on the received data. The buffer has memory which is overwritten whenever it receives a packet from the controller. Within this setting, we derive a sufficient condition on quantization parameters for achieving small ℓ ∞ signal ℓ ∞ stability of the feedback system. The stability condition is characterized in terms of the number of quantization levels of the quantizer.
This paper deals with the routing optimization in IPV6 networks. It's the key processes of traffic engineering and network planning. Routing optimization provides a means to balance the traffic load in the network...
详细信息
ISBN:
(纸本)9781424462483;9780769540412
This paper deals with the routing optimization in IPV6 networks. It's the key processes of traffic engineering and network planning. Routing optimization provides a means to balance the traffic load in the network with the goal to improve the quality of service. The main objective of our routing optimization procedures is the minimization of the end-to-end delay, which is the total time of an individual packet to transfer from source to destination node. By optimized one of router's functions, this function is the packet classification. This work is done modify the packet classification operation in the router architecture by making it based on two tuples (source address and flow label) instead of the regular five tuples to classify the coming packets. Finally, to test and compare the performance of our algorithm, we used the network simulator NS-2,version 2.29. The simulation results indicate that the proposed algorithm indeed helps to minimize the end-to-end delay as a result of router optimization.
The exact solion solutions are constructed by applying the (G'/G)-expansion method for a nonlinear Vakhnenko system. The soliton controls are investigated. The three shape types of the solitons could directly depe...
详细信息
ISBN:
(纸本)9787894631046
The exact solion solutions are constructed by applying the (G'/G)-expansion method for a nonlinear Vakhnenko system. The soliton controls are investigated. The three shape types of the solitons could directly depend on the parameter p, q and β with the Vakhnenko system.
暂无评论