330 resultados para Malicious nodes
Resumo:
The research in software science has so far been concentrated on three measures of program complexity: (a) software effort; (b) cyclomatic complexity; and (c) program knots. In this paper we propose a measure of the logical complexity of programs in terms of the variable dependency of sequence of computations, inductive effort in writing loops and complexity of data structures. The proposed complexity mensure is described with the aid of a graph which exhibits diagrammatically the dependence of a computation at a node upon the computation of other (earlier) nodes. Complexity measures of several example programs have been computed and the related issues have been discussed. The paper also describes the role played by data structures in deciding the program complexity.
Resumo:
The paper presents a method for transmission loss charge allocation in deregulated power systems based on Relative Electrical Distance (RED) concept. Based on RED between the generator and load nodes and the predefined bilateral power contracts, charge evaluation is carried out. Generally through some power exchange mechanism a set of bilateral contracts are determined that facilitate bilateral agreements between the generation and distribution entities. In this paper the possible charges incurred in meeting loads like generation charge, transmission charge and charge due to losses are evaluated. Case studies have been carried out on a few practical equivalent systems. Due to space limitation results for a sample 5 bus system are presented considering ideal load/generation power contracts and deviated load/generation power contracts. Extensive numerical testing indicates that the proposed allocation scheme produces loss allocations that are appropriate and that behave in a physically reasonable manner.
Resumo:
Onboard spacecraft computing system is a case of a functionally distributed system that requires continuous interaction among the nodes to control the operations at different nodes. A simple and reliable protocol is desired for such an application. This paper discusses a formal approach to specify the computing system with respect to some important issues encountered in the design and development of a protocol for the onboard distributed system. The issues considered in this paper are concurrency, exclusiveness and sequencing relationships among the various processes at different nodes. A 6-tuple model is developed for the precise specification of the system. The model also enables us to check the consistency of specification and deadlock caused due to improper specification. An example is given to illustrate the use of the proposed methodology for a typical spacecraft configuration. Although the theory is motivated by a specific application the same may be applied to other distributed computing system such as those encountered in process control industries, power plant control and other similar environments.
Resumo:
Structural and rheological features of a series of molecular hydrogels formed by synthetic bile salt analogues have been scrutinized. Among seven gelators, two are neutral compounds, while the others are cationic systems among which one is a tripodal steroid derivative. Despite the fact that the chemical structures are closely related, the variety of physical characteristics is extremely large in the structures of the connected fibers (either plain cylinders or ribbons), in the dynamical modes for stress relaxation of the associated SAFINs, in the scaling laws of the shear elasticity (typical of either cellular solids or fractal floc-like assemblies), in the micron-scale texture and the distribution of ordered domains (spherulites, crystallites) embedded in a random mesh, in the type of nodal zones (either crystalline-like, fiber entanglements, or bundles), in the evolution of the distribution and morphology of fibers and nodes, and in the sensitivity to added salt. SANS appears to be a suitable technique to infer all geometrical parameters defining the fibers, their interaction modes, and the volume fraction of nodes in a SAFIN. The tripodal system is particularly singular in the series and exhibits viscosity overshoots at the startup of shear flows, an “umbrella-like” molecular packing mode involving three molecules per cross section of fiber, and scattering correlation peaks revealing the ordering and overlap of 1d self-assembled polyelectrolyte species.
Resumo:
Mesh topologies are important for large-scale peer-to-peer systems that use low-power transceivers. The Quality of Service (QoS) in such systems is known to decrease as the scale increases. We present a scalable approach for dissemination that exploits all the shortest paths between a pair of nodes and improves the QoS. Despite th presence of multiple shortest paths in a system, we show that these paths cannot be exploited by spreading the messages over the paths in a simple round-robin manner; nodes along one of these paths will always handle more messages than the nodes along the other paths. We characterize the set of shortest paths between a pair of nodes in regular mesh topologies and derive rules, using this characterization, to effectively spread the messages over all the available paths. These rules ensure that all the nodes that are at the same distance from the source handle roughly the same number of messages. By modeling the multihop propagation in the mesh topology as a multistage queuing network, we present simulation results from a variety of scenarios that include link failures and propagation irregularities to reflect real-world characteristics. Our method achieves improved QoS in all these scenarios.
Resumo:
Excised shoot tips of Cuscuta reflexa Roxb. (dodder), a rootless and leafless angiospermic plant parasite, were cultured in vitro for the study of the control of lateral bud development by the apex. In a chemically defined medium lacking hormones, the basal bud alone developed into a shoot. The addition of coconut milk to the growth medium induced the activation of multiple lateral buds, but only a single bud developed further into a shoot. The decapitation of this shoot induced the development of another shoot and the process could be repeated. This showed the controlling effect of the apex in correlative control of bud development. Application of indole-3-acetic acid to the shoot tip explant delayed the development of the lateral bud. Gibberellic acid A3 induced a marked elongation growth of the explant and reinforced apical dominance. The direct application of cytokinin to an inhibited bud relieved it from apical dominance. A basipetally decreasing concentration gradient of auxin may prevail at the nodes. Bud outgrowth is probably stimulated by cytokinin produced locally in the bud.
Resumo:
Packet forwarding is a memory-intensive application requiring multiple accesses through a trie structure. With the requirement to process packets at line rates, high-performance routers need to forward millions of packets every second with each packet needing up to seven memory accesses. Earlier work shows that a single cache for the nodes of a trie can reduce the number of external memory accesses. It is observed that the locality characteristics of the level-one nodes of a trie are significantly different from those of lower level nodes. Hence, we propose a heterogeneously segmented cache architecture (HSCA) which uses separate caches for level-one and lower level nodes, each with carefully chosen sizes. Besides reducing misses, segmenting the cache allows us to focus on optimizing the more frequently accessed level-one node segment. We find that due to the nonuniform distribution of nodes among cache sets, the level-one nodes cache is susceptible t high conflict misses. We reduce conflict misses by introducing a novel two-level mapping-based cache placement framework. We also propose an elegant way to fit the modified placement function into the cache organization with minimal increase in access time. Further, we propose an attribute preserving trace generation methodology which emulates real traces and can generate traces with varying locality. Performanc results reveal that our HSCA scheme results in a 32 percent speedup in average memory access time over a unified nodes cache. Also, HSC outperforms IHARC, a cache for lookup results, with as high as a 10-fold speedup in average memory access time. Two-level mappin further enhances the performance of the base HSCA by up to 13 percent leading to an overall improvement of up to 40 percent over the unified scheme.
Resumo:
The assumption of nodes in a cooperative communication relay network operating in synchronous fashion is often unrealistic. In the present paper we consider two different models of asynchronous operation in cooperative-diversity networks experiencing slow fading and examine the corresponding diversity-multiplexing tradeoffs (DMT). For both models, we propose protocols and distributed space-time codes that asymptotically achieve the transmit diversity bound for all multiplexing gains and for number of relays N >= 2.
Resumo:
In developing countries high rate of growth in demand of electric energy is felt, and so the addition of new generating units becomes necessary. In deregulated power systems private generating stations are encouraged to add new generations. Finding the appropriate location of new generator to be installed can be obtained by running repeated power flows, carrying system studies like analyzing the voltage profile, voltage stability, loss analysis etc. In this paper a new methodology is proposed which will mainly consider the existing network topology into account. A concept of T-index is introduced in this paper, which considers the electrical distances between generator and load nodes.This index is used for ranking significant new generation expansion locations and also indicates the amount of permissible generations that can be installed at these new locations. This concept facilitates for the medium and long term planning of power generation expansions within the available transmission corridors. Studies carried out on a sample 7-bus system, EHV equivalent 24-bus system and IEEE 39 bus system are presented for illustration purpose.
Resumo:
Activation of macrophages by interferon gamma (IFN- ) and the subsequent production of nitric oxide (NO) are critical for the host defence against Salmonella enterica serovar Typhimurium infection. We report here the inhibition of IFN- -induced NO production in RAW264.7 macrophages infected with wild-type Salmonella. This phenomenon was shown to be dependent on the nirC gene, which encodes a potential nitrite transporter. We observed a higher NO output from IFN- -treated macrophages infected with a nirC mutant of Salmonella. The nirC mutant also showed significantly decreased intracellular proliferation in a NO-dependent manner in activated RAW264.7 macrophages and in liver, spleen and secondary lymph nodes of mice, which was restored by complementing the gene in trans. Under acidified nitrite stress, a twofold more pronounced NO-mediated repression of SPI2 was observed in the nirC knockout strain compared to the wild-type. This enhanced SPI2 repression in the nirC knockout led to a higher level of STAT-1 phosphorylation and inducible nitric oxide synthase (iNOS) expression than seen with the wild-type strain. In iNOS knockout mice, the organ load of the nirC knockout strain was similar to that of the wild-type strain, indicating that the mutant is exclusively sensitive to the host nitrosative stress. Taken together, these results reveal that intracellular Salmonella evade killing in activated macrophages by downregulating IFN- -induced NO production, and they highlight the critical role of nirC as a virulence gene.
Resumo:
An interactive graphics package for modeling with Petri Nets has been implemented. It uses the VT-11 graphics terminal supported on the PDP-11/35 computer to draw, execute, analyze, edit and redraw a Petri Net. Each of the above mentioned tasks can be performed by selecting appropriate items from a menu displayed on the screen. Petri Nets with a reasonably large number of nodes can be created and analyzed using this package. The number of nodes supported may be increased by making simple changes in the program. Being interactive, the program seeks information from the user after displaying appropriate messages on the terminal. After completing the Petri Net, it may be executed step by step and the changes in the number of tokens may be observed on the screen, at each place. Some properties of Petri Nets like safety, boundedness, conservation and redundancy can be checked using this package. This package can be used very effectively for modeling asynchronous (concurrent) systems with Petri Nets and simulating the model by “graphical execution.”
Resumo:
The remarkable geological and evolutionary history of peninsular India has generated much interest in the patterns and processes that might have shaped the current distributions of its endemic biota. In this regard the Out of India hypothesis, which proposes that rafting peninsular India carried Gondwanan forms to Asia after the break-up of Gondwana super continent, has gained prominence. Here we have reviewed molecular studies undertaken on a range of taxa of supposedly Gondwanan origin to better understand the Out-of-India scenario. This re-evaluation of published molecular studies indicates that there is mounting evidence supporting Out-of-India scenario for various Asian taxa. Nevertheless, in many studies the evidence is inconclusive due to lack of information on the age of relevant nodes. Studies also indicate that not all Gondwanan forms of peninsular India dispersed out of India. Many of these ancient lineages are confined to peninsular India and therefore are relict Gondwanan lineages. Additionally for some taxa an Into India rather than Out-of-India scenario better explains their current distribution. To identify the Out-of-India component of Asian biota it is imperative that we understand the complex biogeographical history of India. To this end, we propose three oversimplified yet explicit phylogenetic predictions. These predictions can be tested through the use of molecular phylogenetic tools in conjunction with palaeontological and geological data.
Resumo:
Gastrointestinal infections with Salmonella enterica serovars have different clinical outcomes that range from localized inflammation to a life-threatening systemic disease in the case of typhoid fever. Using a mouse model of systemic salmonellosis, we investigated the contribution of neutrophils to the innate immune defense against Salmonella after oral infection. Neutrophil infiltration was dependent on the bacterial burden in various infected organs (Peyer's patches, mesenteric lymph nodes, spleen, and liver). However, the massive infiltration of neutrophils did not allow clearance of an infection with wild-type Salmonella, presumably due to protection of intracellular Salmonella against neutrophil activities. A Salmonella mutant strain deficient in Salmonella pathogenicity island 2 (SPI2) was able to infect systemic sites, but its replication was highly restricted and it did not cause detectable attraction of neutrophils. Neutrophil depletion by antibody treatment of mice did not restore the virulence of SPI2 or auxotrophic mutant strains, supporting the hypothesis that attenuation of the strains is not due to greater susceptibility to neutrophil killing. Our observations reveal that neutrophils have completely different roles during systemic salmonellosis and localized gastrointestinal infections. In the latter conditions, rapid neutrophil attraction efficiently prevents the spread of the pathogen, whereas the neutrophil influx is delayed during systemic infections and cannot protect against lethal bacteremia.
Resumo:
We study a scheduling problem in a wireless network where vehicles are used as store-and-forward relays, a situation that might arise, for example, in practical rural communication networks. A fixed source node wants to transfer a file to a fixed destination node, located beyond its communication range. In the absence of any infrastructure connecting the two nodes, we consider the possibility of communication using vehicles passing by. Vehicles arrive at the source node at renewal instants and are known to travel towards the destination node with average speed v sampled from a given probability distribution. Th source node communicates data packets (or fragments) of the file to the destination node using these vehicles as relays. We assume that the vehicles communicate with the source node and the destination node only, and hence, every packet communication involves two hops. In this setup, we study the source node's sequential decision problem of transferring packets of the file to vehicles as they pass by, with the objective of minimizing delay in the network. We study both the finite file size case and the infinite file size case. In the finite file size case, we aim to minimize the expected file transfer delay, i.e. expected value of the maximum of the packet sojourn times. In the infinite file size case, we study the average packet delay minimization problem as well as the optimal tradeoff achievable between the average queueing delay at the source node buffer and the average transit delay in the relay vehicle.
Resumo:
We extend the modeling heuristic of (Harsha et al. 2006. In IEEE IWQoS 06, pp 178 - 187) to evaluate the performance of an IEEE 802.11e infrastructure network carrying packet telephone calls, streaming video sessions and TCP controlled file downloads, using Enhanced Distributed Channel Access (EDCA). We identify the time boundaries of activities on the channel (called channel slot boundaries) and derive a Markov Renewal Process of the contending nodes on these epochs. This is achieved by the use of attempt probabilities of the contending nodes as those obtained from the saturation fixed point analysis of (Ramaiyan et al. 2005. In Proceedings ACM Sigmetrics, `05. Journal version accepted for publication in IEEE TON). Regenerative analysis on this MRP yields the desired steady state performance measures. We then use the MRP model to develop an effective bandwidth approach for obtaining a bound on the size of the buffer required at the video queue of the AP, such that the streaming video packet loss probability is kept to less than 1%. The results obtained match well with simulations using the network simulator, ns-2. We find that, with the default IEEE 802.11e EDCA parameters for access categories AC 1, AC 2 and AC 3, the voice call capacity decreases if even one streaming video session and one TCP file download are initiated by some wireless station. Subsequently, reducing the voice calls increases the video downlink stream throughput by 0.38 Mbps and file download capacity by 0.14 Mbps, for every voice call (for the 11 Mbps PHY). We find that a buffer size of 75KB is sufficient to ensure that the video packet loss probability at the QAP is within 1%.