scholarly journals DDR-Coin: An Efficient Probabilistic Distributed Trigger Counting Algorithm

Sensors ◽  
2020 ◽  
Vol 20 (22) ◽  
pp. 6446
Author(s):  
Seokhyun Kim ◽  
Yongsu Park
Keyword(s):  
Global Change ◽  
Distributed System ◽  
Mathematical Analysis ◽  
Exact Algorithm ◽  
Experimental Results ◽  
Monitoring Systems ◽  
Message Complexity ◽  
Whole Number ◽  
Negligible Probability ◽  
Counting Algorithm

A distributed trigger counting (DTC) problem is to detect w triggers in the distributed system consisting of n nodes. DTC algorithms can be used for monitoring systems using sensors to detect a significant global change. When designing an efficient DTC algorithm, the following goals should be considered; minimizing the whole number of exchanged messages used for counting triggers and even distribution of communication loads among nodes. In this paper, we present an efficient DTC algorithm, DDR-coin (Deterministic Detection of Randomly generated coins). The message complexity—the total number of exchanged messages—of DDR-coin is O(nlogn(w/n)) in average. MaxRcvLoad—the maximum number of received messages to detect w triggers in each node—is O(logn(w/n)) on average. DDR-coin is not an exact algorithm; even though w triggers are received by the n nodes, it can fail to raise an alarm with a negligible probability. However, DDR-coin is more efficient than exact DTC algorithms on average and the gap between those is increased for larger n. We implemented the prototype of the proposed scheme using NetLogo 6.1.1. We confirmed that experimental results are close to our mathematical analysis. Compared with the previous schemes—TreeFill, CoinRand, and RingRand— DDR-coin shows smaller message complexity and MaxRcvLoad.

Young’s Experiment on Slits with an Angle Between Them

2014 ◽  
Vol 9 (2) ◽  
pp. 173-179
Author(s):  
Anton Bogomyagkov ◽  
Viktor Dorokhov ◽  
Oleg Meshkov ◽  
Aleksandr Polygalov ◽  
Alexey Shcheglov
Keyword(s):  
Experimental Data ◽  
Interference Pattern ◽  
Intensity Distribution ◽  
Mathematical Analysis ◽  
Theoretical Calculations ◽  
Experimental Results ◽  
Digital Data ◽  
Hyperbolic Function ◽  
Standard Laboratory ◽  
Arbitrary Angle

Here are proposed a modified version of Young’s experiment on slits with an arbitrary angle between them. Also here performed mathematical analysis of the proposed scheme, showing that the intensity distribution can be approximated by a hyperbolic function. Experimental data confirm theoretical calculations. Analysis of the experimental results has conducted using two different methods of processing the digital data of the interference pattern. Theoretical calculations and experimental results established a nontrivial fact, that the interference patterns for slits with different, but symmetrical respect to 90° angles have the same intensity distribution. This experiment may be used as a standard laboratory work in University on optics workshop

Application Design of CAN Bus (CANOpen) for Rotary Screen Printing Machine

2011 ◽  
Vol 84-85 ◽  
pp. 447-451
Author(s):  
Xue Juan Kang ◽  
Jun Feng Jing ◽  
Jia Kun Li ◽  
Qing He
Keyword(s):  
Conduction Band ◽  
Distributed System ◽  
Screen Printing ◽  
Can Bus ◽  
Experimental Results ◽  
Hardware Platform ◽  
Synchronous Control ◽  
Distributed Structure ◽  
Structure Scheme ◽  
Printing Machine

The background of this paper is Rotary Screen Printing Machine(RSPM),and the paper need to resolve the printing flower dislocation phenomenon caused by synchronization between each motor, and by the synchronization between rotary screen motor and the conduction band. The paper presented overall scheme, and analyzed, designed and realized synchronous control arithmetic design based on system hardware platform. Through some related experimental results proved that the distributed system based on CAN bus(CANOpen protocol) worked stably, each motor transmitted independently and could run synchronously , and the results verified the correctness and feasibility of distributed structure scheme used for RSPM system.

An Exact Algorithm for Finding K-Biclique Vertex Partitions of Bipartites

2013 ◽  
Vol 710 ◽  
pp. 687-691
Author(s):  
Pei Qiang Liu
Keyword(s):  
Data Mining ◽  
Information Security ◽  
Computational Biology ◽  
Exact Algorithm ◽  
Experimental Results ◽  
Sufficient Condition ◽  
Partition Problem ◽  
Fast Speed ◽  
Vertex Partition ◽  
Vertex Partitions

Biclustering has been extensively studied in many fields such as data mining, e-commerce, computational biology, information security, etc. Problems of finding bicliques in bipartite, which are variants of biclustering, have received much attention in recent years due to its importance for biclustering. The k-biclique vertex partition problem proposed by Bein et al. is one of finding bicliques problems in bipartite. Its aim is to find k bicliques (kk) such that each vertex of the bipartite occurs in exactly one member of these bicliques. First, we give a sufficient condition of the k-biclique vertex partition problem. Moreover, we present an exact algorithm for finding k-biclique vertex partitions of a bipartite. Finally, we propose a method to generate simulated datasets used to test the algorithm. Experimental results on simulated datasets show that the algorithm can find k-biclique vertex partitions of a bipartite with relatively fast speed.

scholarly journals A Range-Based Algorithm for Autonomous Navigation of an Aerial Drone to Approach and Follow a Herd of Cattle

Sensors ◽  
2021 ◽  
Vol 21 (21) ◽  
pp. 7218
Author(s):  
Manaram Gnanasekera ◽  
Jay Katupitiya ◽  
Andrey V. Savkin ◽  
A.H.T. Eranga De De Silva
Keyword(s):  
Sliding Mode Control ◽  
Mathematical Analysis ◽  
Autonomous Navigation ◽  
Sliding Mode ◽  
Rate Of Change ◽  
Measurement Noise ◽  
Experimental Results ◽  
Primary Motivation ◽  
Range Measurements ◽  
Robust Sensing

This paper proposes an algorithm that will allow an autonomous aerial drone to approach and follow a steady or moving herd of cattle using only range measurements. The algorithm is also insensitive to the complexity of the herd’s movement and the measurement noise. Once arrived at the herd of cattle, the aerial drone can follow it to a desired destination. The primary motivation for the development of this algorithm is to use simple, inexpensive and robust sensing hence range sensors. The algorithm does not depend on the accuracy of the range measurements, rather the rate of change of range measurements. The proposed method is based on sliding mode control which provides robustness. A mathematical analysis, simulations and experimental results with a real aerial drone are presented to demonstrate the effectiveness of the proposed method.

scholarly journals A Study on the Convergence of Family Particle Swarm Optimization

2017 ◽  
Vol 2017 ◽  
pp. 1-14
Author(s):  
Zhenzhou An ◽  
Xiaoyan Wang ◽  
Xinling Shi
Keyword(s):  
Particle Swarm Optimization ◽  
Mathematical Analysis ◽  
Particle Trajectory ◽  
Particle Swarm ◽  
Experimental Results ◽  
Control Parameters ◽  
Swarm Optimization ◽  
Special Model ◽  
Position Sequence ◽  
The Family

The sociological concept of family has been introduced in the particle swarm optimization (PSO) and the family PSO (FPSO) has been proposed, in which the particle swarm consisted of different families, each family consisted of different members, and there were different constraint relationships between family members. To further study the sensitivity of FPSO to the control parameters, this paper proposed a special model of FPSO and analyzed the convergence of FPSO theoretically. This model offered a new view to research the particle trajectory and divided the position sequence of particle into the even and odd subsequences. By mathematical analysis, the condition of two subsequences convergence was obtained and the related convergent theories and corollaries were proved. Simulations for benchmark functions showed that the convergence behavior of model and experimental results provided a valuable guideline for selecting control parameters.

Effects of selection and migration on geotactic and phototactic behaviour of Drosophila . III

1972 ◽  
Vol 180 (1058) ◽  
pp. 21-41 ◽  
Keyword(s):  
Mathematical Analysis ◽  
Experimental Results ◽  
Drosophila Pseudoobscura ◽  
Sharp Reduction ◽  
And Migration ◽  
Genetic Homeostasis ◽  
Phototactic Behaviour

Three kinds of experiments on the behaviour of Drosophila pseudoobscura with respect to light (phototaxis) and gravity (geotaxis) are described. First, populations were subjected to arti­ficial selection, and responded by becoming positively, or negatively, phototactic or geotactic. When the selection was discontinued, the populations showed the effects of genetic homeo­stasis - they gradually converged and became similar in behaviour. Secondly, positive and negative populations were made to exchange unselected migrants. They converged towards identical behaviours, but the points of convergence were influenced by genetic homeostasis. Thirdly, populations being selected towards positively, or towards negativity, received in every generation phenotypically positive or negative immigrants from a population which was not itself being selected. These migrants caused a sharp reduction of the selection effectiveness in the receiving populations. Mathematical analysis of the experimental results was made to estimate the homeostatic points (i. e. the values towards which the populations are homeostatically driven), and homeostatic strengths (homeostatic heritabilities). The strengths turned out to be between 0.05 and 0.07, close to the values of realized heritabilities derived from the present and previously reported experiments.

Mathematical Analysis of Swell Pressure With Time for Partly Saturated Clays

1968 ◽  
Vol 5 (4) ◽  
pp. 217-224 ◽  
Author(s):  
R Baker ◽  
G Kassiff
Keyword(s):  
Mathematical Analysis ◽  
Simple Expression ◽  
Dissipation Function ◽  
Experimental Results ◽  
Pressure Function ◽  
Consolidation Process ◽  
Definition Of ◽  
Mathematical Derivation ◽  
Swell Pressure

Experimental results of swell pressure under complete inundation show that the curve of pressure against log of time has a typical reversed S shape, similar to that of consolidation. No endeavour, however, has been made to explain this behaviour theoretically.The paper deals with the mathematical derivation of the swell pressure function and the definition of the parameters involved. Under certain simplified assumptions, it is shown that the dissipation of the suction during a swelling test is proportional to the development of the swell pressure and that the dissipation function is mathematically identical with that of the consolidation process. The solution of this function yielded a rather simple expression for the swell pressure, which agrees with values obtained when the clay is saturated and results in a fraction of the initial suction when the clay is partly saturated.

Sign in / Sign up

Export Citation Format

Share Document