Добірка наукової літератури з теми "Distributed nodes"

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Distributed nodes".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Distributed nodes"

1

Sundaram, Shreyas, and Bahman Gharesifard. "Distributed Optimization Under Adversarial Nodes." IEEE Transactions on Automatic Control 64, no. 3 (March 2019): 1063–76. http://dx.doi.org/10.1109/tac.2018.2836919.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Krechowicz, Adam. "Content-aware data distribution over cluster nodes." Intelligent Data Analysis 25, no. 4 (July 9, 2021): 907–27. http://dx.doi.org/10.3233/ida-205360.

Повний текст джерела
Анотація:
Proper data items distribution may seriously improve the performance of data processing in distributed environment. However, typical datastorage systems as well as distributed computational frameworks do not pay special attention to that aspect. In this paper author introduces two custom data items addressing methods for distributed datastorage on the example of Scalable Distributed Two-Layer Datastore. The basic idea of those methods is to preserve that data items stored on the same cluster node are similar to each other following concepts of data clustering. Still, most of the data clustering mechanisms have serious problem with data scalability which is a severe limitation in Big Data applications. The proposed methods allow to efficiently distribute data set over a set of buckets. As it was shown by the experimental results, all proposed methods generate good results efficiently in comparison to traditional clustering techniques like k-means, agglomerative and birch clustering. Distributed environment experiments shown that proper data distribution can seriously improve the effectiveness of Big Data processing.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Joy T, Thushara, and Sruthy Manmadhan. "Reallocation of Load in Nodes of Distributed File Systems." International Journal of Scientific Research 3, no. 5 (June 1, 2012): 274–75. http://dx.doi.org/10.15373/22778179/may2014/84.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Ye, Chong Yang, and Yi Zhuang. "An Improved Dynamic Trust Model for Distributed System." Advanced Materials Research 1046 (October 2014): 500–503. http://dx.doi.org/10.4028/www.scientific.net/amr.1046.500.

Повний текст джерела
Анотація:
The parallel, sharing and high speed distributed system has become the mainstream of current system architecture, the characteristics of uncentralized management makes more and more people take flexible operations. However, as the nodes in the system are not bound by a central server and resource sharing is a node’s voluntary behavior, the traditional centralized mechanism is not suitable for large-scale distributed system. Aiming at this problem, this paper proposes an improved dynamic trust model for distributed system (IDTrust) to quantify and evaluate the credible degree between nodes. The analysis and simulation results show that the effectiveness of contain malicious nodes and the security aspects of IDTrust are superior to those of current typical methods.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

de Bruin, Marcel G. "Interpolation on non-uniformly distributed nodes." Nonlinear Analysis: Theory, Methods & Applications 47, no. 3 (August 2001): 1931–40. http://dx.doi.org/10.1016/s0362-546x(01)00322-4.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Gargaro, Anthony. "Virtual nodes/distributed systems working group." ACM SIGAda Ada Letters X, no. 4 (March 1990): 66–77. http://dx.doi.org/10.1145/91360.91372.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Yang, Chun Xi, Chao Sun, Sha Fan, and Ning Wu. "Cluster-Gossip Based Distributed Kalman Consensus Filter Algorithm with Energy Efficiency." Applied Mechanics and Materials 667 (October 2014): 291–99. http://dx.doi.org/10.4028/www.scientific.net/amm.667.291.

Повний текст джерела
Анотація:
According to these constrains that wireless sensor networks are composed of many wireless nodes with limited power, a new energy efficient cluster-based distributed consensus kalman filtering algorithm is proposed in this paper. In this algorithm, each cluster contains a cluster-head and some member nodes where the cluster-head is used to fuse data which come from member nodes and consensus process between neighbor cluster-head. This clustering method divide wireless sensor networks into two classes of networks: cluster units network and cluster-heads network. In this way, numbers of information transmission among nodes are reduced efficiently and communication distances among nodes are also shortened. As a result, node’s energy in wireless sensor network can be saved greatly. Moreover, Gossip algorithm is introduced to deal with the consensus problem between cluster-heads for improving power consumption and the convergence analysis for the algorithm which is given by applying to graph theory and matrix theory. Finally, a simulation example is given to show the effectively of our method.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Xu, Bao, and Yong Feng Ju. "Distributed Coverage-Hole Repair Algorithm towards Nodes Failure in Wireless Sensor Networks." Applied Mechanics and Materials 135-136 (October 2011): 464–69. http://dx.doi.org/10.4028/www.scientific.net/amm.135-136.464.

Повний текст джерела
Анотація:
In order to preserve the coverage and ensure the efficiency of Wireless Sensor Networks (WSNs), a distributed coverage-hole repair algorithm towards nodes failure is proposed in this paper. Every node has a energy threshold, if node’s energy is lower than its threshold, it sends a failure message to the nearest node and appoints it as the head node, the head node consideres all the neighbors of the failure node are preparatory boundary nodes at first, then judges every preparatory boundary nodes whether be a non-boundary node through the intersection angle with the failure node. In the last, the head node activates the redundant node within the sensing range of failure node which has the most boundary nodes as neighbor nodes. Analyzes and simulation on Matlab platform indicate that this algorithm has a low time complexity and the repair efficiency has a grate relation with node density and node sensing radius.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Teykhrib, Anton Pavlovich. "Data transmission in Hybrid Distributed Environment." International Journal of Electrical and Computer Engineering (IJECE) 6, no. 6 (December 1, 2016): 2989. http://dx.doi.org/10.11591/ijece.v6i6.12129.

Повний текст джерела
Анотація:
<p>This article discusses a hybrid distributed environment including two levels of nodes: the first level which has high quality channels between the nodes, and the second one in which the nodes are directly involved in communication and the communication is performed through the first-level nodes. For the indicated distribution scheme, the questions of selection of the best path between the first-level nodes are solved based on such communication channel characteristics as delay in packet transmission, jitter in transmission, packet loss in transmission, and choosing a method for data transmission through the selected best path: protocols of transport and network layers have been compared, and the use of network layer has been preferred.</p>
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Teykhrib, Anton Pavlovich. "Data transmission in Hybrid Distributed Environment." International Journal of Electrical and Computer Engineering (IJECE) 6, no. 6 (December 1, 2016): 2989. http://dx.doi.org/10.11591/ijece.v6i6.pp2989-2993.

Повний текст джерела
Анотація:
<p>This article discusses a hybrid distributed environment including two levels of nodes: the first level which has high quality channels between the nodes, and the second one in which the nodes are directly involved in communication and the communication is performed through the first-level nodes. For the indicated distribution scheme, the questions of selection of the best path between the first-level nodes are solved based on such communication channel characteristics as delay in packet transmission, jitter in transmission, packet loss in transmission, and choosing a method for data transmission through the selected best path: protocols of transport and network layers have been compared, and the use of network layer has been preferred.</p>
Стилі APA, Harvard, Vancouver, ISO та ін.

Дисертації з теми "Distributed nodes"

1

Guardalben, Lucas. "Communication between nodes for autonomic and distributed management." Doctoral thesis, Universidade de Aveiro, 2014. http://hdl.handle.net/10773/12877.

Повний текст джерела
Анотація:
Doutoramento conjunto MAPi em Informática
Over the last decade, the most widespread approaches for traditional management were based on the Simple Network Management Protocol (SNMP) or Common Management Information Protocol (CMIP). However, they both have several problems in terms of scalability, due to their centralization characteristics. Although the distributed management approaches exhibit better performance in terms of scalability, they still underperform regarding communication costs, autonomy, extensibility, exibility, robustness, and cooperation between network nodes. The cooperation between network nodes normally requires excessive overheads for synchronization and dissemination of management information in the network. For emerging dynamic and large-scale networking environments, as envisioned in Next Generation Networks (NGNs), exponential growth in the number of network devices and mobile communications and application demands is expected. Thus, a high degree of management automation is an important requirement, along with new mechanisms that promote it optimally and e ciently, taking into account the need for high cooperation between the nodes. Current approaches for self and autonomic management allow the network administrator to manage large areas, performing fast reaction and e ciently facing unexpected problems. The management functionalities should be delegated to a self-organized plane operating within the network, that decrease the network complexity and the control information ow, as opposed to centralized or external servers. This Thesis aims to propose and develop a communication framework for distributed network management which integrates a set of mechanisms for initial communication, exchange of management information, network (re) organization and data dissemination, attempting to meet the autonomic and distributed management requirements posed by NGNs. The mechanisms are lightweight and portable, and they can operate in di erent hardware architectures and include all the requirements to maintain the basis for an e cient communication between nodes in order to ensure autonomic network management. Moreover, those mechanisms were explored in diverse network conditions and events, such as device and link errors, di erent tra c/network loads and requirements. The results obtained through simulation and real experimentation show that the proposed mechanisms provide a lower convergence time, smaller overhead impact in the network, faster dissemination of management information, increase stability and quality of the nodes associations, and enable the support for e cient data information delivery in comparison to the base mechanisms analyzed. Finally, all mechanisms for communication between nodes proposed in this Thesis, that support and distribute the management information and network control functionalities, were devised and developed to operate in completely decentralized scenarios.
Durante a última década, protocolos como Simple Network Management Protocol (SNMP) ou Common Management Information Protocol (CMIP) foram as abordagens mais comuns para a gestão tradicional de redes. Essas abordagens têm vários problemas em termos de escalabilidade, devido às suas características de centralização. Apresentando um melhor desempenho em termos de escalabilidade, as abordagens de gestão distribuída, por sua vez, são vantajosas nesse sentido, mas também apresentam uma série de desvantagens acerca do custo elevado de comunicação, autonomia, extensibilidade, exibilidade, robustez e cooperação entre os nós da rede. A cooperação entre os nós presentes na rede é normalmente a principal causa de sobrecarga na rede, uma vez que necessita de colectar, sincronizar e disseminar as informações de gestão para todos os nós nela presentes. Em ambientes dinâmicos, como é o caso das redes atuais e futuras, espera-se um crescimento exponencial no número de dispositivos, associado a um grau elevado de mobilidade dos mesmos na rede. Assim, o grau elevado de funções de automatiza ção da gestão da rede é uma exigência primordial, bem como o desenvolvimento de novos mecanismos e técnicas que permitam essa comunicação de forma optimizada e e ciente. Tendo em conta a necessidade de elevada cooperação entre os elementos da rede, as abordagens atuais para a gestão autonómica permitem que o administrador possa gerir grandes áreas de forma rápida e e ciente frente a problemas inesperados, visando diminuir a complexidade da rede e o uxo de informações de controlo nela gerados. Nas gestões autonómicas a delegação de operações da rede é suportada por um plano auto-organizado e não dependente de servidores centralizados ou externos. Com base nos tipos de gestão e desa os acima apresentados, esta Tese tem como principal objetivo propor e desenvolver um conjunto de mecanismos necessários para a criação de uma infra-estrutura de comunicação entre nós, na tentativa de satisfazer as exigências da gestão auton ómica e distribuída apresentadas pelas redes de futura geração. Nesse sentido, mecanismos especí cos incluindo inicialização e descoberta dos elementos da rede, troca de informação de gestão, (re) organização da rede e disseminação de dados foram elaborados e explorados em diversas condições e eventos, tais como: falhas de ligação, diferentes cargas de tráfego e exigências de rede. Para além disso, os mecanismos desenvolvidos são leves e portáveis, ou seja, podem operar em diferentes arquitecturas de hardware e contemplam todos os requisitos necessários para manter a base de comunicação e ciente entre os elementos da rede. Os resultados obtidos através de simulações e experiências reais comprovam que os mecanismos propostos apresentam um tempo de convergência menor para descoberta e troca de informação, um menor impacto na sobrecarga da rede, disseminação mais rápida da informação de gestão, aumento da estabilidade e a qualidade das ligações entre os nós e entrega e ciente de informações de dados em comparação com os mecanismos base analisados. Finalmente, todos os mecanismos desenvolvidos que fazem parte da infrastrutura de comunicação proposta foram concebidos e desenvolvidos para operar em cenários completamente descentralizados.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Celik, Guner Dincer. "Distributed MAC protocol for networks with multipacket reception capability and spatially distributed nodes." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/40523.

Повний текст джерела
Анотація:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.
Includes bibliographical references (p. 123-127).
The physical layer of future wireless networks will be based on novel radio technologies such as Ultra-Wideband (UWB) and Multiple-Input Multiple-Output (MIMO). One of the important capabilities of such technologies is the ability to capture a few packets simultaneously. This capability has the potential to improve the performance of the MAC layer. However, we show that in networks with spatially distributed nodes, reusing MAC protocols originally designed for narrow-band systems (e.g., CSMA/CA) is inefficient. It is well known that when networks with spatially distributed nodes operate with such MAC protocols, the channel may be captured by nodes that are near the destination. We show that when the physical layer enables multi-packet reception, the negative implications of reusing the legacy protocols include not only such unfairness but also a significant throughput reduction. We present a number of simple alternative backoff mechanisms that attempt to overcome the throughput reduction phenomenon. We evaluate the performance of these mechanisms via exact analysis, approximations, and simulation, thereby demonstrating that they usually outperform the legacy backoff mechanisms. We then discuss the implications of the results on developing realistic MAC protocols for networks with a multi-packet reception capability and in particular for UWB networks.
by Guner Dincer Celik.
S.M.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Muralidharan, Gautam. "On the distributed revocation of nodes in sensor networks." College Park, Md. : University of Maryland, 2004. http://hdl.handle.net/1903/164.

Повний текст джерела
Анотація:
Thesis (M.S.) -- University of Maryland, College Park, 2004.
Thesis research directed by: Dept. of Electrical and Computer Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Brasileiro, Francisco Vilar. "Constructing fail-controlled nodes for distributed systems : a software approach." Thesis, University of Newcastle Upon Tyne, 1995. http://hdl.handle.net/10443/1971.

Повний текст джерела
Анотація:
Designing and implementing distributed systems which continue to provide specified services in the presence of processing site and communication failures is a difficult task. To facilitate their development, distributed systems have been built assuming that their underlying hardware components are Jail-controlled, i.e. present a well defined failure mode. However, if conventional hardware cannot provide the assumed failure mode, there is a need to build processing sites or nodes, and communication infra-structure that present the fail-controlled behaviour assumed. Coupling a number of redundant processors within a replicated node is a well known way of constructing fail-controlled nodes. Computation is replicated and executed simultaneously at each processor, and by employing suitable validation techniques to the outputs generated by processors (e.g. majority voting, comparison), outputs from faulty processors can be prevented from appearing at the application level. One way of constructing replicated nodes is by introducing hardwired mechanisms to couple replicated processors with specialised validation hardware circuits. Processors are tightly synchronised at the clock cycle level, and have their outputs validated by a reliable validation hardware. Another approach is to use software mechanisms to perform synchronisation of processors and validation of the outputs. The main advantage of hardware based nodes is the minimum performance overhead incurred. However, the introduction of special circuits may increase the complexity of the design tremendously. Further, every new microprocessor architecture requires considerable redesign overhead. Software based nodes do not present these problems, on the other hand, they introduce much bigger performance overheads to the system. In this thesis we investigate alternative ways of constructing efficient fail-controlled, software based replicated nodes. In particular, we present much more efficient order protocols, which are necessary for the implementation of these nodes. Our protocols, unlike others published to date, do not require processors' physical clocks to be explicitly synchronised. The main contribution of this thesis is the precise definition of the semantics of a software based Jail-silent node, along with its efficient design, implementation and performance evaluation.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Davis, Jesse, Ron Kyker, and Nina Berry. "DESCRIPTION AND ANALYSIS OF A FLEXIBLE HARDWARE ARCHITECTURE FOR EVENT-DRIVEN DISTRIBUTED SENSOR NETWORK NODES." International Foundation for Telemetering, 2003. http://hdl.handle.net/10150/605356.

Повний текст джерела
Анотація:
International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada
A particular engineering aspect of distributed sensor networks that has not received adequate attention is the system level hardware architecture of the individual nodes of the network. A novel hardware architecture based on an idea of task specific modular computing is proposed to provide for both the high flexibility and low power consumption required for distributed sensing solutions. The power consumption of the architecture is mathematically analyzed against a traditional approach, and guidelines are developed for application scenarios that would benefit from using this new design.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Baleshan, Tharunie. "Analysis of distributed beamforming in cooperative communications network with phase shifter based smart antenna nodes." Thesis, Queensland University of Technology, 2015. https://eprints.qut.edu.au/84539/1/Tharunie_Baleshan_Thesis.pdf.

Повний текст джерела
Анотація:
This research study investigates the application of phase shifter-based smart antenna system in distributed beamforming. It examines the way to optimise the transmit power by jointly maximising the directivity of the array antennas and the weight vector for distributed beamforming. This research study concludes that maximising directivity can lead to better transmit power minimisation compared to maximising field intensity. This study also concludes that signal to noise power ratio maximisation subject to a power constraint and power minimisation subject to a signal to noise power ratio constraint yield the same results.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Mercado, Albert. "Exploring data sharing between geographically distributed mobile and fixed nodes supporting Extended Maritime Interdiction Operations (EMIO)." Thesis, Monterey, Calif. : Naval Postgraduate School, 2008. http://bosun.nps.edu/uhtbin/hyperion-image.exe/08Jun%5FMercado.pdf.

Повний текст джерела
Анотація:
Thesis (M.S. in Information Systems and Operations)--Naval Postgraduate School, June 2008.
Thesis Advisor(s): Bordetsky, Alex. "June 2008." Description based on title screen as viewed on August 26, 2008. Includes bibliographical references (p. 103-106). Also available in print.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Engel, Andreas [Verfasser], Andreas [Akademischer Betreuer] Koch, and Christian [Akademischer Betreuer] Hochberger. "A Heterogeneous System Architecture for Low-Power Wireless Sensor Nodes in Compute-Intensive Distributed Applications / Andreas Engel ; Andreas Koch, Christian Hochberger." Darmstadt : Universitäts- und Landesbibliothek Darmstadt, 2016. http://d-nb.info/1120585090/34.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Wertlen, Ronald. "A P2P middleware design for digital access nodes in marginalised rural areas." Thesis, University of Fort Hare, 2010. http://hdl.handle.net/10353/254.

Повний текст джерела
Анотація:
This thesis addresses software design within the field of Information and Communications Technology for Development (ICTD). Specifically, it makes a case for the design and development of software which is custom-made for the context of marginalised rural areas (MRAs). One of the main aims of any ICTD project is sustainability and such sustainability is particularly difficult in MRAs because of the high costs of projects located there. Most literature on ICTD projects focuses on other factors, such as management, regulations, social and community issues when discussing this issue. Technical matters are often down-played or ignored entirely. This thesis argues that MRAs exhibit unique technical characteristics and that by understanding these characteristics, one can possibly design more cost-effective software. One specific characteristic is described and addressed in this thesis – a characteristic we describe here for the first time and call a network island. Further analysis of the literature generates a picture of a distributed network of access nodes (DANs) within such network islands, which are connected by high speed networks and are able to share resources and stimulate usage of technology by offering a wide range of services. This thesis attempts to design a fitting middleware platform for such a context, which would achieve the following aims: i) allow software developers to create solutions for the context more efficiently (correctly, rapidly); ii) stimulate product managers and business owners to create innovative software products more easily (cost-effectively). A given in the context of this thesis is that the software should use free/libre open source software (FLOSS) – good arguments do also exist for the use of FLOSS. A review of useful FLOSS frameworks is undertaken and several of these are examined in an applied part of the thesis, to see how useful they may be. They form the basis for a walking skeleton implementation of the proposed middleware. The Spring framework is the basis for experiments, along with Spring-Webservices, JMX and PHP 5’s web service capabilities. This thesis builds on three years of work at the Siyakhula Living Lab (SLL), an experimental testbed in a MRA in the Mbashe district of the Eastern Cape of South Africa. Several existing products are deployed at the SLL in the fields of eCommerce, eGovernment and eLearning. Requirements specifications are engineered from a variety of sources, including interviews, mailing lists, the author’s experience as a supervisor at the SLL, and a review of the existing SLL products. Future products are also investigated, as the thesis considers current trends in ICTD. Use cases are also derived and listed. Most of the use cases are concerned with management functions of DANs that can be automated, so that operators of DANs can focus on their core business and not on technology. Using the UML Components methodology, the thesis then proceeds to design a middleware component architecture that is derived from the requirements specification. The process proceeds step-by-step, so that the reader can follow how business rules, operations and interfaces are derived from the use cases. Ultimately, the business rules, interfaces and operations are related to business logic, system interfaces and operations that are situated in specific components. The components in turn are derived from the business information model, that is derived from the business concepts that were initially used to describe the context for the requirements engineering. In this way, a logical method for software design is applied to the problem domain to methodically derive a software design for a middleware solution. The thesis tests the design by considering possible weaknesses in the design. The network aspect is tested by interpolating from formal assumptions about the nature of the context. The data access layer is also identified as a possible bottleneck. We suggest the use of fast indexing methods instead of relational databases to maintain flexibility and efficiency of the data layer. Lessons learned from the exercise are discussed, within the context of the author’s experience in software development teams, as well as in ICTD projects. This synthesis of information leads to warnings about the psychology of middleware development. We note that the ICTD domain is a particularly difficult one with regards to software development as business requirements are not usually clearly formulated and developers do not have the requisite domain knowledge. In conclusion, the core arguments of the thesis are recounted in a bullet form, to lay bare the reasoning behind this work. Novel aspects of the work are also highlighted. They include the description of a network island, and aspects of the DAN middleware requirements engineering and design. Future steps for work based on this thesis are mapped out and open problems relating to this research are touched upon.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Shen, Guowei [Verfasser], Reiner [Akademischer Betreuer] Thomä, Jörn [Gutachter] Thielecke, and Günther [Gutachter] Schäfer. "Localization of Active Nodes within Distributed UWB Sensor Networks in Multipath Environments / Guowei Shen ; Gutachter: Jörn Thielecke, Günther Schäfer ; Betreuer: Reiner Thomä." Ilmenau : TU Ilmenau, 2012. http://d-nb.info/1178185621/34.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Книги з теми "Distributed nodes"

1

Keeler, James David. Notes on implementation of sparsely distributed memory. [Moffett Field, Calif.?]: Research Institute for Advanced Computer Science, NASA Ames Research Center, 1986.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Bunch, Chris. Lymphadenopathy. Edited by Patrick Davey and David Sprigings. Oxford University Press, 2018. http://dx.doi.org/10.1093/med/9780199568741.003.0036.

Повний текст джерела
Анотація:
Lymph nodes are small, bean-shaped structures generally a few millimetres in size, distributed widely throughout the body and assuming a major role in the immune system. Peripheral lymph nodes are not normally palpable except in thin individuals. Enlargement of lymph nodes is called lymphadenopathy. It is important to distinguish between reactive lymphadenopathy, which is usually an appropriate response to infection or inflammation, and malignant or neoplastic lymphadenopathy.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Distributed Computing Lecture Notes in Computer Science. Springer, 2011.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Cooperative Information Agents: First International Workshop, CIA'97, Kiel, Germany, February 26-28, 1997, Proceedings (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence). Springer, 1997.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Caha, Pavel. Notes on Insertion in Distributed Morphology and Nanosyntax. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190876746.003.0002.

Повний текст джерела
Анотація:
This chapter considers two questions that many people ask themselves (or should ask themselves). What is actually the difference between Nanosyntax (NS, Starke, 2009) and Distributed Morphology (DM, Halle and Marantz, 1993)? And which one of them is right? These questions remain as important now as they were some 15 years ago, when Michal Starke introduced the basics of the NS theory. Despite the fact that several written sources on NS have been available since 2007, there is still a lot of confusion about what NS actually is, and how NS and DM compare to each other. The present paper is an attempt to clear things up.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Drira, Khalil, Andrea Martelli, and Thierry Villemur. Cooperative Environments for Distributed Systems Engineering: The Distributed Systems Environment Report (Lecture Notes in Computer Science). Springer, 2002.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

(Editor), Sacha Krakowiak, and Santosh Shrivastava (Editor), eds. Advances in Distributed Systems: Advanced Distributed Computing: From Algorithms to Systems (Lecture Notes in Computer Science). Springer, 2000.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

(Editor), André Schiper, Alex A. Shvartsman (Editor), Hakim Weatherspoon (Editor), and Ben Y. Zhao (Editor), eds. Future Directions in Distributed Computing: Research and Position Papers (Lecture Notes in Computer Science). Springer, 2003.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

(Editor), P. G. Spirakis, S. Toueg (Editor), greece International Workshop on Distributed Algorithms 1991 Delphoi (Corporate Author), and L. Kirousis (Editor), eds. Distributed Algorithms: 5th International Workshop : Proceedings (Lecture Notes in Computer Science). Springer, 1992.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Distributed Computing and Internet Technology Lecture Notes in Computer Science. Springer, 2008.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "Distributed nodes"

1

Mitchell, John C., and Vanessa Teague. "Autonomous Nodes and Distributed Mechanisms." In Software Security — Theories and Systems, 58–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-36532-x_5.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Mohamed, Aboulwafa, and Enneya Nourddine. "Improving Throughput for Mobile Nodes." In Distributed Sensing and Intelligent Systems, 439–46. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-64258-7_38.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

De Meo, Pasquale, Fabrizio Messina, Domenico Rosaci, and Giuseppe M. L. Sarné. "Improving Grid Nodes Coalitions by Using Reputation." In Intelligent Distributed Computing VIII, 137–46. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-10422-5_15.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Markovich, Natalia M., and Maxim S. Ryzhov. "Leader Nodes in Communities for Information Spreading." In Distributed Computer and Communication Networks, 475–84. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-66471-8_36.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Ruan, Li, Jinbing Peng, Limin Xiao, and Mingfa Zhu. "Distributed Virtual Machine Monitor for Distributed Cloud Computing Nodes Integration." In Grid and Pervasive Computing, 23–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38027-3_3.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Zhang, Youtao, Jun Yang, Lingling Jin, and Weijia Li. "Locating Compromised Sensor Nodes Through Incremental Hashing Authentication." In Distributed Computing in Sensor Systems, 321–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11776178_20.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Liu, Zhenhua, Hongbo Liu, Wenyuan Xu, and Yingying Chen. "Wireless Jamming Localization by Exploiting Nodes’ Hearing Ranges." In Distributed Computing in Sensor Systems, 348–61. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13651-1_25.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Deshmukh, Shyam, Jagannath Aghav, K. Thirupathi Rao, and B. Thirumala Rao. "Avoiding Slow Running Nodes in Distributed Systems." In Lecture Notes in Networks and Systems, 411–20. Singapore: Springer Singapore, 2017. http://dx.doi.org/10.1007/978-981-10-3226-4_41.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Afsarmanesh, Hamideh, Ammar Benabdelkader, and L. O. Hertzberger. "Cooperative Information Management for Distributed Production Nodes." In Globalization of Manufacturing in the Digital Communications Era of the 21st Century, 13–27. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-0-387-35351-7_2.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Mahendran, Veeramani, Thammana Praveen, and C. Siva Ram Murthy. "Buffer Dimensioning of Delay-Tolerant Network Nodes - A Large Deviations Approach." In Distributed Computing and Networking, 502–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-25959-3_37.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Distributed nodes"

1

Noursadeghi, Elaheh, and Ioannis Raptis. "Full-Order Distributed Fault Diagnosis for Large-Scale Nonlinear Stochastic Systems." In ASME 2015 Dynamic Systems and Control Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/dscc2015-9927.

Повний текст джерела
Анотація:
This paper deals with the problem of designing a distributed fault detection and isolation algorithm for nonlinear large-scale systems that are subjected to multiple fault modes. To solve this problem, a network of detection nodes is deployed to monitor the monolithic system. Each node consists of an estimator with partial observation of the system’s state. The local estimator executes a distributed variation of the particle filtering algorithm; that process the local sensor measurements and the fault progression model of the system. In addition, each node communicates with its neighbors by sharing pre-processed information. The communication topology is defined using graph theoretic tools. The information fusion between the neighboring nodes is performed by a distributed average consensus algorithm to ensure the agreement on the value of the local estimates. The simulation results demonstrate the efficiency of the proposed approach.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Liu, Guoliang, and Guohui Tian. "Distributed camera network with naive nodes." In 2016 Chinese Control and Decision Conference (CCDC). IEEE, 2016. http://dx.doi.org/10.1109/ccdc.2016.7531568.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Gargaro, Anthony. "Virtual nodes/distributed systems working group." In the third international workshop. New York, New York, USA: ACM Press, 1989. http://dx.doi.org/10.1145/91354.91372.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Silaghi, Gheorghe Cosmin, Filipe Araujo, Luis Moura Silva, Patricio Domingues, and Alvaro E. Arenas. "Defeating colluding nodes in Desktop Grid computing platforms." In Distributed Processing Symposium (IPDPS). IEEE, 2008. http://dx.doi.org/10.1109/ipdps.2008.4536440.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Qiu, Yi, Changfu You, Haiying Qi, and Xuchang Xu. "Improvement of Searching Nodes Arithmetic in Meshfree Method." In ASME/JSME 2003 4th Joint Fluids Summer Engineering Conference. ASMEDC, 2003. http://dx.doi.org/10.1115/fedsm2003-45533.

Повний текст джерела
Анотація:
In numerical simulation with meshfree method, it is necessary to search nodes that are needed. In dealing with complex problems, there must be a great number of nodes distributed in computational domain. If a conventional Node-Searching method is used here, it will be a burdensome task for the computer. So this paper proposes a new numerical arithmetic, Domain-Dividing method, which means that the domain can be divided into several subdomains. With this method, we can search only those corresponding subdomains instead of the entire domain for nodes. This paper adopts the Node-Searching arithmetic to simulate the inviscid potential flow over a cylinder, and it is found that with the increase of the nodes in domain, the computational time of meshfree method is increasingly longer than that of finite element method, but compared with meshfree method using conventional Node-Searching method, the arithmetic proposed in this paper can reduce much more time for searching nodes.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Aluko, Oladotun, and Anton Kolonin. "Studying the Applicability of Proof of Reputation(PoR) as an Alternative Consensus Mechanism for Distributed Ledger Systems." In 2nd International Conference on Blockchain and Internet of Things (BIoT 2021). AIRCC Publishing Corporation, 2021. http://dx.doi.org/10.5121/csit.2021.110804.

Повний текст джерела
Анотація:
Blockchains combine several other technologies like cryptography, networking, and incentive mechanisms in order to support the creation, validation, and recording of transactions between participating nodes. A blockchain system relies on a consensus algorithm to determine the shared state among distributed nodes. An important component underlying any blockchainbased system is its consensus mechanism, which determines the characteristics of the overall system. This thesis proposes a reputation-based consensus mechanism for blockchain-based systems which we term Proof-of-Reputation(PoR) that uses the liquid rank algorithm where the reputation of a node is calculated by blending the normalized ratings by other nodes in the network for a given period with the reputation values of the nodes giving the ratings. The nodes with the highest reputation values eventually become part of the consensus group that determines the state of the blockchain.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Iqbal, Muhammad Ozair, Ammar Mahmood, Muhammad Mahboob Ur Rahman, and Qammer H. Abbasi. "Distributed Beamforming with Wirelessly Powered Relay Nodes." In 2017 IEEE 85th Vehicular Technology Conference (VTC Spring). IEEE, 2017. http://dx.doi.org/10.1109/vtcspring.2017.8108316.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Hemed, Tzoof, Nitai Lavie, and Roman Kaplan. "Distributed Deep Learning on Wimpy Smartphone Nodes." In 2018 IEEE International Conference on the Science of Electrical Engineering in Israel (ICSEE). IEEE, 2018. http://dx.doi.org/10.1109/icsee.2018.8646195.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Georgiev, Vasil, and Hristo Hristov. "Local Monitoring Granularity in Distributed Systems Nodes." In 2019 International conference on Creative Business for Smart and Sustainable Growth (CREBUS). IEEE, 2019. http://dx.doi.org/10.1109/crebus.2019.8840042.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Sundaram, Shreyas, and Bahman Gharesifard. "Consensus-based distributed optimization with malicious nodes." In 2015 53rd Annual Allerton Conference on Communication, Control and Computing (Allerton). IEEE, 2015. http://dx.doi.org/10.1109/allerton.2015.7447011.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Distributed nodes"

1

Mecimore, Ivan, Chuck D. Creusere, and Bion John Merchant. Distributed video coding for arrays of remote sensing nodes : final report. Office of Scientific and Technical Information (OSTI), June 2010. http://dx.doi.org/10.2172/992327.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Bhattacharya, Arnab, Sri Nikhil Gourisetti, Jacob Hansen, William Hofer, Karanjit Kalsi, Soumya Kundu, Jianming Lian, et al. Incentive-Based Control and Coordination of Distributed Energy Resources (NODES Final Report). Office of Scientific and Technical Information (OSTI), May 2019. http://dx.doi.org/10.2172/1713066.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Nooshabadi, Saeid. ADAPTable Sensor Systems Phase 2. Topic 2: Reusable Core Software. Distributed Synchronization Software for the Sensor Nodes. Fort Belvoir, VA: Defense Technical Information Center, March 2015. http://dx.doi.org/10.21236/ada619961.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Riggs, William, Vipul Vyas, and Menka Sethi. Blockchain and Distributed Autonomous Community Ecosystems: Opportunities to Democratize Finance and Delivery of Transport, Housing, Urban Greening and Community Infrastructure. Mineta Transportation Institute, July 2022. http://dx.doi.org/10.31979/mti.2022.2165.

Повний текст джерела
Анотація:
This report investigates and develops specifications for using blockchain and distributed organizations to enable decentralized delivery and finance of urban infrastructure. The project explores use cases, including: providing urban greening, street or transit infrastructure; services for street beautification, cleaning and weed or graffiti abatement; potential ways of resource allocation ADU; permitting and land allocation; and homeless housing. It establishes a general process flow for this blockchain architecture, which involves: 1) the creation of blocks (transactions); 2) sending these blocks to nodes (users) on the network for an action (mining) and then validation that that action has taken place; and 3) then adding the block to the blockchain. These processes involve the potential for creating new economic value for cities and neighborhoods through proof-of-work, which can be issued through a token (possibly a graphic non-fungible token), certificate, or possible financial reward. We find that encouraging trading of assets at the local level can enable the creation of value that could be translated into sustainable “mining actions” that could eventually provide the economic backstop and basis for new local investment mechanisms or currencies (e.g., local cryptocurrency). These processes also provide an innovative local, distributed funding mechanism for transportation, housing and other civic infrastructure.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Stenberg, M., and S. Barth. Distributed Node Consensus Protocol. RFC Editor, April 2016. http://dx.doi.org/10.17487/rfc7787.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Hall, R. C. The Product Data Network and Distributed Data System: Node configuration. Office of Scientific and Technical Information (OSTI), July 1989. http://dx.doi.org/10.2172/6024742.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Ravindran, T. K. Sundari. A study of user perspectives on the diaphragm in an urban Indian setting. Population Council, 1995. http://dx.doi.org/10.31899/rh1995.1032.

Повний текст джерела
Анотація:
This study attempted to examine user perspectives regarding the desirability of the diaphragm as a contraceptive method when included among other methods distributed freely through a family planning (FP) clinic. It sought to introduce on an experimental basis, the diaphragm into an ongoing and well-established FP clinic to increase contraceptive choice. This was primarily a qualitative study aimed at understanding women's perceptions about the risks and benefits, the reasons for use of the diaphragm, and the practical difficulties of using it effectively. It also studied the influence of service delivery factors in acceptance of this method. The study was part of a larger project of the Gender, Reproductive Health, and Population Policies research program. Information dissemination on diaphragms and other contraceptive methods was part of a comprehensive community outreach program on reproductive health education. Based on the information provided and use of the diaphragm over a month women perceived the key advantages to be the absence of side effects and the facility of need-based use. In addition, as this report notes, the diaphragm answered the needs of women who wished to space as well those who wished to limit the number of children.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Megersa, Kelbesa. Financial Inclusion in a Refugee Response. Institute of Development Studies, August 2021. http://dx.doi.org/10.19088/k4d.2021.122.

Повний текст джерела
Анотація:
The growing scope, frequency, and complexity of forced displacement, both inside and outside of countries, has pushed donors and other development groups to rethink their approaches to humanitarian crises, particularly on refugee response. Financial inclusion is widely regarded as a particularly critical tool that development organisations can employ to mitigate the catastrophic impact of humanitarian crises on refugees. Financial inclusion would provide a wide range of financial products – such as savings, remittances, loans, and insurance – to both refugees and citizens of host countries, which are critical for disadvantaged populations seeking to mitigate shocks, acquire assets, and support local economic development. Changes in how humanitarian aid is distributed are opening the path for greater financial inclusion. Donors and humanitarian organisations are shifting away from emergency cash transfers and toward digital payments via electronic cards. This opens new opportunities to connect refugees and displaced people to a bigger pool of financial services. This rapid literature review summarises the available evidence on toolkits that assist the response by humanitarian and development agencies to financial inclusion of refugees. In addition to the documents defined explicitly as “toolkits”, it also includes reports and online articles which contain useful guidance, since there were few “toolkits” available. Generally, there is lack of resources that directly address the query, i.e., “financial inclusion” in a “refugee response” context. Although there is a growing literature and evidence on the financial inclusion theme, much of it does not directly relate to refugees. Furthermore, most guidance notes and toolkits prepared for refugee response by humanitarian/development agencies do not directly and explicitly deal with financial inclusion, but rather focus on operational and programming issues of wider relief responses. The review is presented as an annotated bibliography format and includes toolkits, guidance notes, technical reports, and online articles by humanitarian and international development agencies.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Honduras: Marketing new reproductive health services is cost-effective. Population Council, 2001. http://dx.doi.org/10.31899/rh2001.1012.

Повний текст джерела
Анотація:
In 1999, the Honduran Ministry of Health (MOH) revised national guidelines on women’s health services delivery to allow nurse auxiliaries to insert IUDs, give DMPA injections, and take Pap smears. This policy change addresses low contraceptive use among rural women and reflects findings from a 1998 Population Council study that showed that nurse auxiliaries can safely and successfully provide these services. Under the previous guidelines, rural women had limited access to long-term family planning methods. In 2000, the Population Council and the MOH assessed the effectiveness and cost of using a simple leaflet, distributed by nurse auxiliaries, to market the new services. Nurse auxiliaries at the experimental centers received 500 leaflets to distribute. They gave daily ten-minute talks about the services and asked each woman at the clinic to distribute five leaflets to friends and neighbors. This brief notes that the use of ten-minute talks and leaflets to advertise availability of IUD insertions, DMPA injections, and Pap smears increased use of the services at an affordable cost. The marketing efforts will be expanded to clinics where nurse auxiliaries have been trained to provide these services.
Стилі APA, Harvard, Vancouver, ISO та ін.
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії