100 resultados para Placement of router nodes


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Hyperbranched polyethers having poly(ethylene glycol) (PEG) segments at their molecular periphery were prepared by a simple procedure wherein an AB2 type monomer was melt-polycondensed with an A-type monomer, namely, heptaethylene glycol monomethyl ether. The presence of a large number of PEG units at the termini rendered a lower critical solution temperature (LCST) to these copolymers, above which they precipitated out of an aqueous solution. In an effort to understand the effect of various molecular structural parameters on their LCST, the length of the hydrophobic spacer segment within the hyperbranched core and the extent of PEGylation were varied. Additionally, linear analogues that incorporates pendant PEG segments were also prepared and comparison of their LCST with that of the hyperbranched analogue clearly revealed that hyperbranched topology leads to a substantial increase in the LCST, highlighting the importance of the peripheral placement of the PEG units.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this paper, we are concerned with algorithms for scheduling the sensing activity of sensor nodes that are deployed to sense/measure point-targets in wireless sensor networks using information coverage. Defining a set of sensors which collectively can sense a target accurately as an information cover, we propose an algorithm to obtain Disjoint Set of Information Covers (DSIC), which achieves longer network life compared to the set of covers obtained using an Exhaustive-Greedy-Equalized Heuristic (EGEH) algorithm proposed recently in the literature. We also present a detailed complexity comparison between the DSIC and EGEH algorithms.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The goal of this study is the multi-mode structural vibration control in the composite fin-tip of an aircraft. Structural model of the composite fin-tip with surface bonded piezoelectric actuators is developed using the finite element method. The finite element model is updated experimentally to reflect the natural frequencies and mode shapes accurately. A model order reduction technique is employed for reducing the finite element structural matrices before developing the controller. Particle swarm based evolutionary optimization technique is used for optimal placement of piezoelectric patch actuators and accelerometer sensors to suppress vibration. H{infty} based active vibration controllers are designed directly in the discrete domain and implemented using dSpace® (DS-1005) electronic signal processing boards. Significant vibration suppression in the multiple bending modes of interest is experimentally demonstrated for sinusoidal and band limited white noise forcing functions.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this article we study the one-dimensional random geometric (random interval) graph when the location of the nodes are independent and exponentially distributed. We derive exact results and limit theorems for the connectivity and other properties associated with this random graph. We show that the asymptotic properties of a graph with a truncated exponential distribution can be obtained using the exponential random geometric graph. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

An ad hoc network is composed of mobile nodes without any infrastructure. Recent trends in applications of mobile ad hoc networks rely on increased group oriented services. Hence multicast support is critical for ad hoc networks. We also need to provide service differentiation schemes for different group of users. An efficient application layer multicast (APPMULTICAST) solution suitable for low mobility applications in MANET environment has been proposed in [10]. In this paper, we present an improved application layer multicast solution suitable for medium mobility applications in MANET environment. We define multicast groups with low priority and high priority and incorporate a two level service differentiation scheme. We use network layer support to build the overlay topology closer to the actual network topology. We try to maximize Packet Delivery Ratio. Through simulations we show that the control overhead for our algorithm is within acceptable limit and it achieves acceptable Packet Delivery Ratio for medium mobility applications.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Thermodynamic analysis of carbohydrate binding by Artocarpus integrifolia (jackfruit) agglutinin (jacalin) shows that, among monosaccharides, Me alpha GalNAc (methyl-alpha-N-acetylgalactosamine) is the strongest binding ligand. Despite its strong affinity for Me alpha GalNAc and Me alpha Gal, the lectin binds very poorly when Gal and GalNAc are in alpha-linkage with other sugars such as in A- and B-blood-group trisaccharides, Gal alpha 1-3Gal and Gal alpha 1-4Gal. These binding properties are explained by considering the thermodynamic parameters in conjunction with the minimum energy conformations of these sugars. It binds to Gal beta 1-3GalNAc alpha Me with 2800-fold stronger affinity over Gal beta 1-3GalNAc beta Me. It does not bind to asialo-GM1 (monosialoganglioside) oligosaccharide. Moreover, it binds to Gal beta 1-3GalNAc alpha Ser, the authentic T (Thomsen-Friedenreich)-antigen, with about 2.5-fold greater affinity as compared with Gal beta 1-3GalNAc. Asialoglycophorin A was found to be about 169,333 times stronger an inhibitor than Gal beta 1-3GalNAc. The present study thus reveals the exquisite specificity of A. integrifolia lectin for the T-antigen. Appreciable binding of disaccharides Glc beta 1-3GalNAc and GlcNAc beta 1-3Gal and the very poor binding of beta-linked disaccharides, which instead of Gal and GalNAc contain other sugars at the reducing end, underscore the important contribution made by Gal and GalNAc at the reducing end for recognition by the lectin. The ligand-structure-dependent alterations of the c.d. spectrum in the tertiary structural region of the protein allows the placement of various sugar units in the combining region of the lectin. These studies suggest that the primary subsite (subsite A) can accommodate only Gal or GalNAc or alpha-linked Gal or GalNAc, whereas the secondary subsite (subsite B) can associate either with GalNAc beta Me or Gal beta Me. Considering these factors a likely arrangement for various disaccharides in the binding site of the lectin is proposed. Its exquisite specificity for the authentic T-antigen, Gal beta 1-3GalNAc alpha Ser, together with its virtual non-binding to A- and B-blood-group antigens, Gal beta 1-3GalNAc beta Me and asialo-GM1 should make A. integrifolia lectin a valuable probe for monitoring the expression of T-antigen on cell surfaces.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The complex web of interactions between the host immune system and the pathogen determines the outcome of any infection. A computational model of this interaction network, which encodes complex interplay among host and bacterial components, forms a useful basis for improving the understanding of pathogenesis, in filling knowledge gaps and consequently to identify strategies to counter the disease. We have built an extensive model of the Mycobacterium tuberculosis host-pathogen interactome, consisting of 75 nodes corresponding to host and pathogen molecules, cells, cellular states or processes. Vaccination effects, clearance efficiencies due to drugs and growth rates have also been encoded in the model. The system is modelled as a Boolean network. Virtual deletion experiments, multiple parameter scans and analysis of the system's response to perturbations, indicate that disabling processes such as phagocytosis and phagolysosome fusion or cytokines such as TNF-alpha and IFN-gamma, greatly impaired bacterial clearance, while removing cytokines such as IL-10 alongside bacterial defence proteins such as SapM greatly favour clearance. Simulations indicate a high propensity of the pathogen to persist under different conditions.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The complex web of interactions between the host immune system and the pathogen determines the outcome of any infection. A computational model of this interaction network, which encodes complex interplay among host and bacterial components, forms a useful basis for improving the understanding of pathogenesis, in filling knowledge gaps and consequently to identify strategies to counter the disease. We have built an extensive model of the Mycobacterium tuberculosis host-pathogen interactome, consisting of 75 nodes corresponding to host and pathogen molecules, cells, cellular states or processes. Vaccination effects, clearance efficiencies due to drugs and growth rates have also been encoded in the model. The system is modelled as a Boolean network. Virtual deletion experiments, multiple parameter scans and analysis of the system's response to perturbations, indicate that disabling processes such as phagocytosis and phagolysosome fusion or cytokines such as TNF-alpha and IFN-gamma, greatly impaired bacterial clearance, while removing cytokines such as IL-10 alongside bacterial defence proteins such as SapM greatly favour clearance. Simulations indicate a high propensity of the pathogen to persist under different conditions.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Relay selection for cooperative communications has attracted considerable research interest recently. While several criteria have been proposed for selecting one or more relays and analyzed, mechanisms that perform the selection in a distributed manner have received relatively less attention. In this paper, we analyze a splitting algorithm for selecting the single best relay amongst a known number of active nodes in a cooperative network. We develop new and exact asymptotic analysis for computing the average number of slots required to resolve the best relay. We then propose and analyze a new algorithm that addresses the general problem of selecting the best Q >= 1 relays. Regardless of the number of relays, the algorithm selects the best two relays within 4.406 slots and the best three within 6.491 slots, on average. Our analysis also brings out an intimate relationship between multiple access selection and multiple access control algorithms.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

We propose a novel algorithm for placement of standard cells in VLSI circuits based on an analogy of this problem with neural networks. By employing some of the organising principles of these nets, we have attempted to improve the behaviour of the bipartitioning method as proposed by Kernighan and Lin. Our algorithm yields better quality placements compared with the above method, and also makes the final placement independent of the initial partition.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The study of electrochemical reduction of Cu(II)-EDTA system by phase sensitive a.c. impedance method at dropping mercury electrode reveals several interesting features. The complex plane polarograms exhibit loop like shape in contrast to the classical zinc ion reduction where crest like shape is found. Again, the relative placement of peaks of in-phase and quadrature components, and the relative placement of portions before and after the peaks of complex plane polarograms are different from that of zinc ion reduction. The complex plane plots suggest that electrochemical reduction of Cu-EDTA is charge transfer controlled.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Our study concerns an important current problem, that of diffusion of information in social networks. This problem has received significant attention from the Internet research community in the recent times, driven by many potential applications such as viral marketing and sales promotions. In this paper, we focus on the target set selection problem, which involves discovering a small subset of influential players in a given social network, to perform a certain task of information diffusion. The target set selection problem manifests in two forms: 1) top-k nodes problem and 2) lambda-coverage problem. In the top-k nodes problem, we are required to find a set of k key nodes that would maximize the number of nodes being influenced in the network. The lambda-coverage problem is concerned with finding a set of k key nodes having minimal size that can influence a given percentage lambda of the nodes in the entire network. We propose a new way of solving these problems using the concept of Shapley value which is a well known solution concept in cooperative game theory. Our approach leads to algorithms which we call the ShaPley value-based Influential Nodes (SPINs) algorithms for solving the top-k nodes problem and the lambda-coverage problem. We compare the performance of the proposed SPIN algorithms with well known algorithms in the literature. Through extensive experimentation on four synthetically generated random graphs and six real-world data sets (Celegans, Jazz, NIPS coauthorship data set, Netscience data set, High-Energy Physics data set, and Political Books data set), we show that the proposed SPIN approach is more powerful and computationally efficient. Note to Practitioners-In recent times, social networks have received a high level of attention due to their proven ability in improving the performance of web search, recommendations in collaborative filtering systems, spreading a technology in the market using viral marketing techniques, etc. It is well known that the interpersonal relationships (or ties or links) between individuals cause change or improvement in the social system because the decisions made by individuals are influenced heavily by the behavior of their neighbors. An interesting and key problem in social networks is to discover the most influential nodes in the social network which can influence other nodes in the social network in a strong and deep way. This problem is called the target set selection problem and has two variants: 1) the top-k nodes problem, where we are required to identify a set of k influential nodes that maximize the number of nodes being influenced in the network and 2) the lambda-coverage problem which involves finding a set of influential nodes having minimum size that can influence a given percentage lambda of the nodes in the entire network. There are many existing algorithms in the literature for solving these problems. In this paper, we propose a new algorithm which is based on a novel interpretation of information diffusion in a social network as a cooperative game. Using this analogy, we develop an algorithm based on the Shapley value of the underlying cooperative game. The proposed algorithm outperforms the existing algorithms in terms of generality or computational complexity or both. Our results are validated through extensive experimentation on both synthetically generated and real-world data sets.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

his paper studies the problem of designing a logical topology over a wavelength-routed all-optical network (AON) physical topology, The physical topology consists of the nodes and fiber links in the network, On an AON physical topology, we can set up lightpaths between pairs of nodes, where a lightpath represents a direct optical connection without any intermediate electronics, The set of lightpaths along with the nodes constitutes the logical topology, For a given network physical topology and traffic pattern (relative traffic distribution among the source-destination pairs), our objective is to design the logical topology and the routing algorithm on that topology so as to minimize the network congestion while constraining the average delay seen by a source-destination pair and the amount of processing required at the nodes (degree of the logical topology), We will see that ignoring the delay constraints can result in fairly convoluted logical topologies with very long delays, On the other hand, in all our examples, imposing it results in a minimal increase in congestion, While the number of wavelengths required to imbed the resulting logical topology on the physical all optical topology is also a constraint in general, we find that in many cases of interest this number can be quite small, We formulate the combined logical topology design and routing problem described above (ignoring the constraint on the number of available wavelengths) as a mixed integer linear programming problem which we then solve for a number of cases of a six-node network, Since this programming problem is computationally intractable for larger networks, we split it into two subproblems: logical topology design, which is computationally hard and will probably require heuristic algorithms, and routing, which can be solved by a linear program, We then compare the performance of several heuristic topology design algorithms (that do take wavelength assignment constraints into account) against that of randomly generated topologies, as well as lower bounds derived in the paper.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This paper looks at the complexity of four different incremental problems. The following are the problems considered: (1) Interval partitioning of a flow graph (2) Breadth first search (BFS) of a directed graph (3) Lexicographic depth first search (DFS) of a directed graph (4) Constructing the postorder listing of the nodes of a binary tree. The last problem arises out of the need for incrementally computing the Sethi-Ullman (SU) ordering [1] of the subtrees of a tree after it has undergone changes of a given type. These problems are among those that claimed our attention in the process of our designing algorithmic techniques for incremental code generation. BFS and DFS have certainly numerous other applications, but as far as our work is concerned, incremental code generation is the common thread linking these problems. The study of the complexity of these problems is done from two different perspectives. In [2] is given the theory of incremental relative lower bounds (IRLB). We use this theory to derive the IRLBs of the first three problems. Then we use the notion of a bounded incremental algorithm [4] to prove the unboundedness of the fourth problem with respect to the locally persistent model of computation. Possibly, the lower bound result for lexicographic DFS is the most interesting. In [5] the author considers lexicographic DFS to be a problem for which the incremental version may require the recomputation of the entire solution from scratch. In that sense, our IRLB result provides further evidence for this possibility with the proviso that the incremental DFS algorithms considered be ones that do not require too much of preprocessing.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This paper compares and analyzes the performance of distributed cophasing techniques for uplink transmission over wireless sensor networks. We focus on a time-division duplexing approach, and exploit the channel reciprocity to reduce the channel feedback requirement. We consider periodic broadcast of known pilot symbols by the fusion center (FC), and maximum likelihood estimation of the channel by the sensor nodes for the subsequent uplink cophasing transmission. We assume carrier and phase synchronization across the participating nodes for analytical tractability. We study binary signaling over frequency-flat fading channels, and quantify the system performance such as the expected gains in the received signal-to-noise ratio (SNR) and the average probability of error at the FC, as a function of the number of sensor nodes and the pilot overhead. Our results show that a modest amount of accumulated pilot SNR is sufficient to realize a large fraction of the maximum possible beamforming gain. We also investigate the performance gains obtained by censoring transmission at the sensors based on the estimated channel state, and the benefits obtained by using maximum ratio transmission (MRT) and truncated channel inversion (TCI) at the sensors in addition to cophasing transmission. Simulation results corroborate the theoretical expressions and show the relative performance benefits offered by the various schemes.