Search

In distributed network algorithms, network flooding algorithm is considered one of the simplest and most fundamental algorithms. This research specifies the basic synchronous memory-less network flooding algorithm where nodes on the network don’t have memory, for any fixed size of network, in Linear Temporal Logic. The specification can be customized to any single network topology or class of topologies. A specification of the termination problem is formulated and used to compare different topologies for earlier termination. This research gives a worked example of one topology resulting in earlier termination than another, for which we perform a formal verification using the model checker NuSMV

In the paper, synchronization of coupled neural networks with delayed impulses is investigated. In order to overcome the difficulty that time delays can be flexible and even larger than impulsive interval, we propose a new method of average impulsive delay (AID). By the methods of average impulsive interval (AII) and AID, some sufficient synchronization criteria for coupled neural networks with delayed impulses are obtained. We prove that the time delay in impulses can play double roles, namely, it may desynchronize a synchronous network or synchronize a nonsynchronized network. Moreover, a unified relationship is established among AII, AID and rate coefficients of the impulsive dynamical network such that the network is globally exponentially synchronized (GES). Further, we discuss the case that time delays in impulses may be unbounded, which has not been considered in existing results. Finally, two examples are presented to demonstrate the validity of the derived results.

This paper studies the heart's oscillation model to separate fetal and maternal ECGs from abdominal recordings. To this aim, two phases are designed. A Modified version of the Duffing-Van der Pol oscillator is considered a computational heart model in the modeling phase. To evaluate the interaction effects of the maternal and fetal heart and the differences and features of the fetal heart structure, the fetal heart model is Modified based on the maternal heart model. A non-identical network is employed as an interactive network of the mother and the fetus's heart. Then the degree of the network synchronization is measured with the help of a pattern synchronization index of the non-identical network. An attempt is made to separate the fetal signal from the mother's in abdominal signals in the separation phase. Two problem-solving approaches are explained; the step-by-step mode that calculates the signal at any given moment and the construction of general equations. These approaches end up calculating the variables, which stand for maternal and fetal signal. That makes it possible to achieve the separation of maternal and fetal ECGs.

We have considered the features of DVB-T2 synchronous network operation and present results of an experimental study of broadcasting network in the Yaroslavl region of the Russian Federation. After adjusting the necessary parameters of a single-frequency network of three transmitters, it was revealed that not all set-top boxes decode the signal correctly. Based on measurements using the created laboratory setup, a number of digital TV set-top boxes that do not provide the quality of DVB-T2 signal reception in synchronous networks were determined. Residents of these local areas received recommendations on the preferred types of receiving equipment used.

Byzantine fault-tolerant (BFT) protocols allow a group of replicas to come to a consensus even when some of the replicas are Byzantine faulty. There exist multiple BFT protocols to securely tolerate an optimal number of faults $t$ under different network settings. However, if the number of faults $f$ exceeds $t$ then security could be violated. In this paper we mathematically formalize the study of forensic support of BFT protocols: we aim to identify (with cryptographic integrity) as many of the malicious replicas as possible and in as a distributed manner as possible. Our main result is that forensic support of BFT protocols depends heavily on minor implementation details that do not affect the protocol's security or complexity. Focusing on popular BFT protocols (PBFT, HotStuff, Algorand) we exactly characterize their forensic support, showing that there exist minor variants of each protocol for which the forensic supports vary widely. We show strong forensic support capability of LibraBFT, the consensus protocol of Diem cryptocurrency; our lightweight forensic module implemented on a Diem client is open-sourced and is under active consideration for deployment in Diem. Finally, we show that all secure BFT protocols designed for $2t+1$ replicas communicating over a synchronous network forensic support are inherently nonexistent; this impossibility result holds for all BFT protocols and even if one has access to the states of all replicas (including Byzantine ones).

Device-to-device (D2D) communication, an emerging form of wireless communication, has attracted considerable attention, but an efficient synchronization protocol has not yet been developed. This has crucial implications for public safety applications that lack sufficient network infrastructure. In the public safety applications, the cellular network may not be available or fully functional when the base stations are malfunctioned or destroyed due to disasters, such as an earthquake, a tsunami, or an attack. One of the major features of D2D is to provide a self-organized communication network for emergency use. In this paper, we develop a synchronization protocol to assist mobile devices in a target area in establishing a synchronized network for public safety applications. The signal-to-interference-plus-noise ratio-based synchronization protocol proposed accounts for the dynamic physical layer reception effect, and its algorithm can efficiently designate D2D devices to assist in forwarding timing signals, thereby enhancing the coverage of the synchronous network. More importantly, our synchronization protocol and its algorithm may assist D2D devices in dynamically changing their state to adapt to the variant wireless channel conditions and dynamic topology of the network. In the simulation results, we show that the proposed synchronization protocol enabled more than 90% of the D2D devices to successfully synchronize with the network, whereas only 75% of D2D devices successfully synchronized with the network through the legacy synchronization protocol.

Perfectly-secure verifiable secret sharing (VSS) and multi-party computation (MPC) protocols in asynchronous network tolerate only at most one-fourth of corruption, while their counterparts in synchronous network sustain against at most one-third corruption. Moreover property-wise, synchronous protocols provide much stronger guarantees than the asynchronous counterparts. Taking note of the fact that asynchronous network is more realistic on one hand and on the other, synchrony of a network has positive impact on several aspects of distributed protocols including properties and fault-tolerance, we explore the power of hybrid networks that combines best of both the worlds by supporting a few synchronous rounds at the onset of a protocol execution, before turning to asynchronous mode. In hybrid networks, we investigate various feasibility questions pertaining to protocols giving guarantees attainable in synchronous and asynchronous networks. For the asynchronous protocols in hybrid networks, we hope to leverage the initial synchronous rounds to bridge the gap in the fault-tolerance with the synchronous protocols under minimal synchrony assumption. We ask the following fundamental question of both theoretical and practical importance: What is the minimum number of initial synchronous rounds necessary and sufficient in a hybrid network to construct asynchronous perfectly-secure VSS and MPC protocols with the fault-tolerance of synchronous protocols? On the positive note, we show that the answer is one for VSS which is clearly optimal. Notably no broadcast oracle is invoked in the synchronous round of our proposed VSS protocol. On the negative side, we prove that one synchronous round is not enough for MPC, putting MPC on a higher pedestal than VSS in terms of difficulty. For synchronous protocols in hybrid networks, we hope to save on the synchronous rounds leveraging conveniently the available asynchronous phase. We settle the question for VSS in the negative showing that three rounds that are known to be necessary (and sufficient) for VSS in synchronous networks, are also required in hybrid networks. VSS being a special case of MPC, the lower bound holds true for MPC. We match the lower bound with a three-round protocol. Notably, synchronous MPC with cryptographic security is known to be achievable in hybrid networks with one synchronous round.

We consider leader election and spanning tree construction problems in a synchronous network. Protocols are designed under the assumption that nodes in the network have identifiers but the size of an identifier is unlimited. We present fast protocols with runtime O(D log L+L), where L is the size of the minimal identifier and D is the network diameter.

A group of n players wants to run a distributed protocol ρ over a network where communication occurs via private point-to-point channels. Unfortunately, an adversary, who knows P, is able to maliciously flip bits on the channels. Can we efficiently simulate ρ in the presence of such an adversary? We show that this is possible, even when L, the number of bits sent in ρ, and T, the number of bits flipped by the adversary are not known in advance. In particular, we show how to create a robust version of ρ, ρ' such that 1) ρ' fails with probability at most δ, for any δ > 0; and 2) ρ' sends O (L + T) bits, where the O notation hides a log(nL/δ) term multiplying L. Critically, our result requires that ρ be a protocol that runs correctly in an asynchronous network; in contrast, our protocol ρ' must run in a synchronous network. Additionally, we show how to improve this result when the average message size is not constant. In particular, we show how to create a protocol ρ' that sends O(L(1 + (1/α) log(nL/δ)) + T) bits, where α is the average message size. This new ρ' is adaptive in that it does not require a priori knowledge of α. We note that if α is Ω (log(nL/δ)), then this improved algorithm sends only O(L + T) bits, and is therefore within a constant factor of optimal.

Best Paper Award; International audience; We study the number of rounds needed to solve consensus in a synchronous network G where at most t nodes may fail by crashing. This problem has been thoroughly studied when G is a complete graph, but very little is known when G is arbitrary. We define a notion of radius that considers all ways in which t nodes may crash, and present an algorithm that solves consensus in radius rounds. Then we derive a lower bound showing that our algorithm is optimal for vertex-transitive graphs, among oblivious algorithms.

A group of n players wants to run a distributed protocol ℘ over a network where communication occurs via private point-to-point channels. Can we efficiently simulate ℘ in the presence of an adversary who knows ℘ and is able to maliciously flip bits on the channels? We show that this is possible, even when L, the number of bits sent in ℘, the average message size α in ℘, and T, the number of bits flipped by the adversary are not known in advance. In particular, we show how to create a robust version of ℘, ℘ such that 1) ℘' fails with probability at most δ, for any δ>0; and 2) ℘' sends O( L (1 + (1/α) log (n L/δ)) + T) bits. We note that if α is Ω (log (n L/δ), then ℘ sends only O(L+T) bits, and is therefore within a constant factor of optimal. Critically, our result requires that ℘ runs correctly in an asynchronous network and our protocol ℘ must run in a synchronous network.

Istanbul Byzantine Fault Tolerance (IBFT) is one of a family of proof-of-authority (PoA) blockchain consensus protocols designed to ensure immediate finality. We partially analyse the correctness of IBFT and show that the protocol does not guarantee Byzantine-fault-tolerant liveness when operating on a partially synchronous network.

We study the problem of decentralized monitoring of stream runtime verification specifications. Decentralized monitoring uses dis- tributed monitors that communicate via a synchronous network, a com- munication setting common in many cyber-physical systems like auto- motive CPSs. Previous approaches to decentralized monitoring were re- stricted to logics like LTL logics that provide Boolean verdicts. We solve here the decentralized monitoring problem for the more general setting of stream runtime verification. Additionally, our solution handles net- work topologies while previous decentralize monitoring works assumed that every pair of nodes can communicate directly. We also introduce a novel property on specifications, called decentralized efficient moni- torability, that guarantees that the online monitoring can be performed with bounded resources. Finally, we report the results of an empiri- cal evaluation of an implementation and compare the expressive power and efficiency against state-of-the-art decentralized monitoring tools like Themis.

Typically, protocols for Byzantine agreement (BA) are designed to run in either a synchronous network (where all messages are guaranteed to be delivered within some known time \(\varDelta \) from when they are sent) or an asynchronous network (where messages may be arbitrarily delayed). Protocols designed for synchronous networks are generally insecure if the network in which they run does not ensure synchrony; protocols designed for asynchronous networks are (of course) secure in a synchronous setting as well, but in that case tolerate a lower fraction of faults than would have been possible if synchrony had been assumed from the start.

Background Systems biology takes a holistic approach by handling biomolecules and their interactions as big systems. Network based approach has emerged as a natural way to model these systems with the idea of representing biomolecules as nodes and their interactions as edges. Very often the input data come from various sorts of omics analyses. Those resulting networks sometimes describe a wide range of aspects, for example different experiment conditions, species, tissue types, stimulating factors, mutants, or simply distinct interaction features of the same network produced by different algorithms. For these scenarios, synchronous visualization of more than one distinct network is an excellent mean to explore all the relevant networks efficiently. In addition, complementary analysis methods are needed and they should work in a workflow manner in order to gain maximal biological insights. Results In order to address the aforementioned needs, we have developed a Synchronous Network Data Integration (SyNDI) framework. This framework contains SyncVis, a Cytoscape application for user-friendly synchronous and simultaneous visualization of multiple biological networks, and it is seamlessly integrated with other bioinformatics tools via the Galaxy platform. We demonstrated the functionality and usability of the framework with three biological examples - we analyzed the distinct connectivity of plasma metabolites in networks associated with high or low latent cardiovascular disease risk; deeper insights were obtained from a few similar inflammatory response pathways in Staphylococcus aureus infection common to human and mouse; and regulatory motifs which have not been reported associated with transcriptional adaptations of Mycobacterium tuberculosis were identified. Conclusions Our SyNDI framework couples synchronous network visualization seamlessly with additional bioinformatics tools. The user can easily tailor the framework for his/her needs by adding new tools and datasets to the Galaxy platform. Electronic supplementary material The online version of this article (10.1186/s12859-018-2426-5) contains supplementary material, which is available to authorized users.

Climate changes bring problems related to nature evolutions. Global warming has an impact on sea level, weather patterns, and wild life. A number of national and international organizations are developing research programs in these directions, including threats on cultures and insect proliferation. Monitoring these phenomena, observing consequences, elaborating counteracted strategies are critical for the economy and society.The initial motivation of this work was the understanding of change impacts in the Mekong Delta region. From there, automatic observation tools were designed with a real time information system able to integrate environmental measures, then to support knowledge production.Tracking environment evolutions is distributed sensing, which can be the association of efficient sensors and radio communications, operated under the control of an information system. Sensing insects is very complex due to their diversity and dispersion. However, this is feasible in the case of intensive agricultural production as it is the case of rice, having a small number of pests. An automatic vision observatory is proposed to observe the main threats for the rice, as an evolution of manual light traps. Radio communication weaves these observatories into a network with connection to databases storing measures and possible counteractions. An example observatory has a fisheye camera and insect counting algorithms for the BPH practical case in Vietnam.By considering the observation system as an input for an abstract machine, and considering decision and actions taken as a possible control on the environment, we obtain a framework for knowledge elaboration that can be useful in lots of other situations.; Les changements climatiques ont des impacts considérables sur le temps, les océans et les rivages, la vie sauvage. Ils amènent des problèmes désormais considérés comme majeurs par les gouvernements et organisations internationales. Ces efforts ont fourni un cadre à cette thèse, qui propose de procéder en boucle fermée de l’observation d’insectes ravageurs, avec des centaines de capteurs en réseau ("light traps"), au système d’information, et enfin à des décisions de lutte, manuelles ou automatiques. Le point d’appui pratique est la conception d’un système de comptage d’insectes proliférant dans les cultures de riz (BPH). L’abstraction que nous développons est celle d’une machine environnementale de grande taille, distribuée, qui capte et synthétise l’information, élabore des connaissances, et prend des décisions. Autour de cette abstraction, nous avons élaboré un système de vision "fisheye" effectuant le comptage des insectes. Nous proposons un système d’information géographique directement connecté au réseau de capteurs. Le couplage direct, "cyber-physique", entre les systèmes d’information et l’observation de l’environnement à échelle régionale est une nouveauté transposable, qui permet de comprendre et contrôler quantité d’évolutions.

Climate changes bring problems related to nature evolutions. Global warming has an impact on sea level, weather patterns, and wild life. A number of national and international organizations are developing research programs in these directions, including threats on cultures and insect proliferation. Monitoring these phenomena, observing consequences, elaborating counteracted strategies are critical for the economy and society.The initial motivation of this work was the understanding of change impacts in the Mekong Delta region. From there, automatic observation tools were designed with a real time information system able to integrate environmental measures, then to support knowledge production.Tracking environment evolutions is distributed sensing, which can be the association of efficient sensors and radio communications, operated under the control of an information system. Sensing insects is very complex due to their diversity and dispersion. However, this is feasible in the case of intensive agricultural production as it is the case of rice, having a small number of pests. An automatic vision observatory is proposed to observe the main threats for the rice, as an evolution of manual light traps. Radio communication weaves these observatories into a network with connection to databases storing measures and possible counteractions. An example observatory has a fisheye camera and insect counting algorithms for the BPH practical case in Vietnam.By considering the observation system as an input for an abstract machine, and considering decision and actions taken as a possible control on the environment, we obtain a framework for knowledge elaboration that can be useful in lots of other situations.; Les changements climatiques ont des impacts considérables sur le temps, les océans et les rivages, la vie sauvage. Ils amènent des problèmes désormais considérés comme majeurs par les gouvernements et organisations internationales. Ces efforts ont fourni un cadre à cette thèse, qui propose de procéder en boucle fermée de l’observation d’insectes ravageurs, avec des centaines de capteurs en réseau ("light traps"), au système d’information, et enfin à des décisions de lutte, manuelles ou automatiques. Le point d’appui pratique est la conception d’un système de comptage d’insectes proliférant dans les cultures de riz (BPH). L’abstraction que nous développons est celle d’une machine environnementale de grande taille, distribuée, qui capte et synthétise l’information, élabore des connaissances, et prend des décisions. Autour de cette abstraction, nous avons élaboré un système de vision "fisheye" effectuant le comptage des insectes. Nous proposons un système d’information géographique directement connecté au réseau de capteurs. Le couplage direct, "cyber-physique", entre les systèmes d’information et l’observation de l’environnement à échelle régionale est une nouveauté transposable, qui permet de comprendre et contrôler quantité d’évolutions.

The Industrial Internet of Things (IIoTs) is creating a new world which incorporates machine learning, sensor data, and machine-to-machine (M2M) communications. In IIoTs, the length of the transmission delay is one of the pivotal performance because dilatory communication will cause heavy losses to industrial applications. In this paper, a learning-based synchronous (LS) approach from forwarding nodes is proposed to reduce the delay for IIoTs. In an asynchronous Media Access Control protocol, when senders need to send data, they always require to wait for their corresponding receiver to wake up. Thus, the delay here is greater than in the synchronous network. However, the synchronization cost of the whole network is enormous, and it is difficult to maintain. Therefore, LS mechanism uses a partial synchronization approach to reduce synchronization costs while effectively reducing delay. In LS approach, instead of synchronizing the nodes in the entire network, only sender nodes and part of the nodes in their forwarding node set are synchronized by self-learning methods, and accurate synchronization is not required here. Thus, the delay can be effectively reduced under the low cost. Secondly, the nodes near sink maintain the original duty cycle, while the nodes in the regions away from the sink use their remaining energy and perform synchronization operations, so as not to damage the network lifetime. Finally, because the synchronization in this paper is based on different synchronization periods among different nodes, it can improve the network performance by reducing the conflict between simultaneous data transmission. The theoretical analysis results show that compared with the previous approach FFSC, LS approach can reduce the end-to-end delay by 5.13–11.64% and increase the energy efficiency by 14.29–17.53% under the same lifetime with a more balanced energy utilization.

This article presents a system stability assessment for an academic representation of the electric power system of Paraguana (Venezuela), by considering the asynchronous wind generators and the synchronous generators. The synchronous network is robust in some cases, and weak in other cases, depending on the connection or not to the National Electric Power Grid. Two cases of induction generators are analyzed: a) without control, like now they are; b) doubly-fed induction generators. Results show the relationship between the wind generation penetration and the power system stability, and the differences in the dynamic behavior of the power system by considering the two types of analyzed induction wind generators.

The signal system is an important part of the modern high-volume, high-density rail transit automatic control system, ensuring the safety of trains and passengers, and plays an important role in the high-speed and orderly operation of trains. The paper introduces the latest development and latest requirements of the synchronous network technology of the rail transit communication system; proposes the construction strategy of the urban rail transit network level synchronization network based on the Beidou satellite navigation system; improves the localization rate of the system and realizes the line network level.

GABA (γ-aminobutyric acid) is the primary inhibitory neurotransmitter in the adult brain. Studies on GABAergic cells have focused almost exclusively on local interneurons neglecting those inhibitory neurons projecting to different brain areas, the 'long-range GABAergic cells'. This review focuses on some common features and peculiarities of 'corticofugal' and 'corticopetal' GABAergic cells. Similarly to their local counterpart, long-range GABAergic cells show immunohistochemical diversity and contact locally both excitatory and inhibitory cells. Distally, long-range GABAergic cells often target other inhibitory neurons. This feature endows them with the ability to control remote target areas via disinhibition. On the basis of few functional studies that investigated their participation in synchronous network activity, we propose that long-range GABAergic neurons play a critical role in the temporal coordination of neuronal activity in distant brain areas.

We consider the problem of making distributed computations robust to noise, in particular to worst-case (adversarial) corruptions of messages. We give a general distributed interactive coding scheme which simulates any asynchronous distributed protocol while tolerating an optimal corruption of a $$\varTheta (1/n)$$ fraction of all messages and incurring a moderate blowup of $$O(n\log ^2 n)$$ in the communication complexity. Our result is the first fully distributed interactive coding scheme in which the topology of the communication network is not known in advance. Prior work required either a coordinating node to be connected to all other nodes in the network or assumed a synchronous network in which all nodes already know the complete topology of the network.

In this work, we study unconditionally-secure multi-party computation (MPC) tolerating \(t < n/3\) corruptions, where n is the total number of parties involved. In this setting, it is well known that if the underlying network is completely asynchronous, then one can achieve only statistical security; moreover it is impossible to ensure input provision and consider inputs of all the honest parties. The best known statistically-secure asynchronous MPC (AMPC) with \(t

We consider a high density of sensors randomly placed in a geographical area for event monitoring. The monitoring regions of the sensors may have significant overlap, and a subset of the sensors can be turned off to conserve energy, thereby increasing the lifetime of the monitoring network. Prior work in this area does not consider the event dynamics. In this paper, we show that knowledge about the event dynamics can be exploited for significant energy savings, by putting the sensors on a periodic on/off schedule. We discuss energy-aware optimization of the periodic schedule for the cases of an synchronous and a asynchronous network. To reduce the overhead of global synchronization, we further consider a spectrum of regionally synchronous networks where the size of the synchronization region is specifiable. Under the periodic scheduling, coordinated sleep by the sensors can be applied orthogonally to minimize the redundancy of coverage and further improve the energy efficiency. We consider the interactions between the periodic scheduling and coordinated sleep. We show that the asynchronous network exceeds any regionally synchronous network in the coverage intensity, thereby increasing the effectiveness of the event capture, though the opportunities for coordinated sleep decreases as the synchronization region gets smaller. When the sensor density is high, the asynchronous network with coordinated sleep can achieve extremely good event capture performance while being highly energy efficient.

In duty-cycled wireless sensor networks (WSNs) for stochastic event monitoring, existing efforts are mainly concentrated on energy-efficient scheduling of sensor nodes to guarantee the coverage performance, ignoring another crucial issue of connectivity. The connectivity problem is extremely challenging in the duty-cycled WSNs due to the fact that the link connections between nodes are transient thus unstable. In this paper, we propose a new kind of network, partitioned synchronous network, to jointly address the coverage and connectivity problem. We analyze the coverage and connectivity performances of partitioned synchronous network and compare them with those of existing asynchronous network. We perform extensive simulations to demonstrate that the proposed partitioned synchronous network has a better connectivity performance than that of asynchronous network, while coverage performances of two types of networks are close.

This paper presents an evaluation of the impact of the so-called operating system (OS) latencies on the performance of a synchronous network based on global time coordination. The concept of end-to-end latency was first defined by extending the concept of latency used to evaluate the performance of real-time systems and the end-to-end latency provided by a general-purpose OS was measured as a benchmark. Finally, real-time techniques were used to reduce the worst-case values of such a latency, showing how a gateway between synchronous and asynchronous networks can be implemented by using commercial-off-the-shelf hardware and a proper software stack (based on a real-time version of Linux). The use of a real-time OS is still a nontrivial task, which requires experience and the analysis of the specific application to devise the proper techniques to be applied. This work dissects the problem of OS-to-network data transfer (and vice versa) identifying the key sources of latencies and delay jitter, and solving each problem with the application of a proper technique. Copyright © 2011 John Wiley & Sons, Ltd.

In many engineering applications, the time coordination of geographically separated events is of fundamental importance, as in digital telecommunications and integrated digital circuits. Mutually connected (MC) networks are very good candidates for some new types of application, such as wireless sensor networks. This paper presents a study on the behavior of MC networks of digital phase-locked loops (DPLLs). Analytical results are derived showing that, even for static networks without delays, different synchronous states may exist for the network. An upper bound for the number of such states is also presented. Numerical simulations are used to show the following results: (i) the synchronization precision in MC DPLLs networks; (ii) the existence of synchronous states for the network does not guarantee its achievement and (iii) different synchronous states may be achieved for different initial conditions. These results are important in the neural computation context, as in this case, each synchronous state may be associated to a different analog memory information.

Several patterns of coherent activity have been described in developing cortical structures, thus providing a general framework for network maturation. A detailed timely description of network patterns at circuit and cell levels is essential for the understanding of pathogenic processes occurring during brain development. Disturbances in the expression timetable of this pattern sequence are very likely to affect network maturation. This review focuses on the maturation of coherent activity patterns in developing neocortical structures. It emphasizes the intrinsic and synaptic cellular properties that are unique to the immature neocortex and, in particular, the critical role played by extracellular glutamate in controlling network excitability and triggering synchronous network waves of activity.

The interplay between inhibition and excitation is at the core of cortical network activity. In many cortices, including auditory cortex (ACx), interactions between excitatory and inhibitory neurons generate synchronous network gamma oscillations (30–70 Hz). Here, we show that differences in the connection patterns and synaptic properties of excitatory–inhibitory microcircuits permit the spatial extent of network inputs to modulate the magnitude of gamma oscillations. Simultaneous multiple whole-cell recordings from connected fast-spiking interneurons and pyramidal cells in L2/3 of mouse ACx slices revealed that for intersomatic distances B-mediated inhibition in RC pairs was weaker than in nRC pairs. Simulations with a network model that incorporated these features showed strong, gamma band oscillations only when the network inputs were confined to a small area. These findings suggest a novel mechanism by which oscillatory activity can be modulated by adjusting the spatial distribution of afferent input.

In the 1-in port model, every vertex of a synchronous network can receive each time unit at most one message. We consider simultaneous broadcasting of multiple messages from the same source in such networks with an additional restriction that every received message can be sent out to neighbors only in the next time unit and never to already informed vertex. We use a general concept of level-disjoint partitions developed for this scenario. Here we introduce a subgraph extension technique for efficient spreading information within this concept. Surprisingly, this approach with so called biwheels leads to simultaneous broadcasting of optimal number of messages on a wide class of graphs in optimal time. In particular, we provide tight results for bipartite tori, meshes, hypercubes. Several problems and conjectures are proposed.

We study the renaming problem in a fully connected synchronous network with Byzantine failures. We show that when the original namespace of the processors is unbounded, this problem cannot be solved in an a priori bounded number of rounds for \(t\geq(n+n\textrm{ mod }3)/3\) , where n is the size of the network and t is the number of failures. On the other hand, for n > 3t, we present a Byzantine renaming algorithm that runs in O(lg n) rounds. In addition, we present a fast, efficient strong renaming algorithm for n > t, which runs in \(O(n lg^{2}\lceil N_{0}/n\rceil)\) rounds, where N0 is the value of the highest identifier among all the correct processors.

International audience; The paper proposes a new approach to model an insect surveillance network as synchronous network systems, systems consist of components running simultaneously. In the network, insects and surrounding environments compose a physical system of which executions proceed concurrently in synchronous rounds. This system is synchronized with a synchronous wireless sensor network, the observation network. The simulation of the case study Brown Planthoppers surveillance network in the Mekong Delta provides some useful information in managing pest insects as well as emerges the roles of wireless sensor network in monitoring environments.

During even the most quiescent behavioral periods, the cortex and thalamus express rich spontaneous activity in the form of slow (

The motor cortex generates synchronous network oscillations at frequencies between 7 and 14 Hz during disinhibition or low [Mg 2+ ]o buffers, but the underlying mechanisms are poorly understood. These oscillations, termed here ∼10 Hz oscillations, are generated by a purely excitatory network of interconnected pyramidal cells because they are robust in the absence of GABAergic transmission. It is likely that specific voltage-dependent currents expressed in those cells contribute to the generation of ∼10 Hz oscillations. We tested the effects of different drugs known to suppress certain voltage-dependent currents. The results revealed that drugs that suppress the low-threshold calcium current and the hyperpolarization-activated cation current are not critically involved in the generation of ∼10 Hz oscillations. Interestingly, drugs known to suppress the persistent sodium current abolished ∼10 Hz oscillations. Furthermore, blockers of K + channels had significant effects on the oscillations. In particular, blockers of the M-current abolished the oscillations. Also, blockers of both non-inactivating and slowly inactivating voltage-dependent K + currents abolished ∼10 Hz oscillations. The results indicate that specific voltage-dependent non-inactivating K + currents, such as the M-current, and persistent sodium currents are critically involved in generating ∼10 Hz oscillations of excitatory motor cortex networks.