Letteratura scientifica selezionata sul tema "SUPER NODE"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al tema "SUPER NODE".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Articoli di riviste sul tema "SUPER NODE"
He, Yong. "A Localization Algorithm of Nodes Based on Hypersphere Granular Computing in Wireless Sensor Networks". Advanced Materials Research 998-999 (luglio 2014): 1390–93. http://dx.doi.org/10.4028/www.scientific.net/amr.998-999.1390.
Testo completoDE LA TORRE, PILAR, RAYMOND GREENLAW e TERESA M. PRZYTYCKA. "OPTIMAL TREE RANKING IS IN $\mathcal{NC}$". Parallel Processing Letters 02, n. 01 (marzo 1992): 31–41. http://dx.doi.org/10.1142/s0129626492000155.
Testo completoGe, Jun Wei, Yan Feng Wang e Yi Qiu Fang. "Research on P2P Resources Search Algorithm Based on Cloud Computing". Advanced Materials Research 765-767 (settembre 2013): 1533–36. http://dx.doi.org/10.4028/www.scientific.net/amr.765-767.1533.
Testo completoZhao, Bo Wen. "Monitoring Technological Analysis of Communication Network Platform". Applied Mechanics and Materials 687-691 (novembre 2014): 2630–34. http://dx.doi.org/10.4028/www.scientific.net/amm.687-691.2630.
Testo completoFu, Yu-Hsiang, Chung-Yuan Huang e Chuen-Tsai Sun. "Identifying Super-Spreader Nodes in Complex Networks". Mathematical Problems in Engineering 2015 (2015): 1–8. http://dx.doi.org/10.1155/2015/675713.
Testo completoSong, Pan. "A Topology Structure Control Algorithm of Wireless Sensor Network by Using Small World Model". Applied Mechanics and Materials 325-326 (giugno 2013): 1023–27. http://dx.doi.org/10.4028/www.scientific.net/amm.325-326.1023.
Testo completoKarakatsanis, A., H. Olofsson, P. Stålberg, L. Bergkvist, S. Abdsaleh e F. Wärnberg. "Simplifying Logistics and Avoiding the Unnecessary in Patients With Breast Cancer Undergoing Sentinel Node Biopsy. A Prospective Feasibility Trial of the Preoperative Injection of Super Paramagnetic Iron Oxide Nanoparticles". Scandinavian Journal of Surgery 107, n. 2 (13 novembre 2017): 130–37. http://dx.doi.org/10.1177/1457496917738867.
Testo completoDelchev, Grozi. "The Influence of Late Treatment with Antibroadleaved Herbicides during Stem Elongation Stage of Durum Wheat on Sowing Characteristics of Seeds". АГРОЗНАЊЕ 19, n. 3 (10 dicembre 2018): 155. http://dx.doi.org/10.7251/agren1803155d.
Testo completoXu, Jie, e Wei Ding. "Rough Estimator Based Asynchronous Distributed Super Points Detection on High Speed Network Edge". Algorithms 14, n. 10 (25 settembre 2021): 277. http://dx.doi.org/10.3390/a14100277.
Testo completoBoonklurb, Ratinan, Authawich Narissayaporn e Sirirat Singhun. "Super edge-magic labeling of -node -uniform hyperpaths and -node -uniform hypercycles". AKCE International Journal of Graphs and Combinatorics 13, n. 3 (1 dicembre 2016): 218–29. http://dx.doi.org/10.1016/j.akcej.2016.06.011.
Testo completoTesi sul tema "SUPER NODE"
Carvalho, Júnior Carlos Alberto Tenório de. "Desenvolvimento de uma nova ferramenta CAD para o estudo de compatibilidade eletromagnética usando Transmission-Line Matrix - John’s Super Node (TLM-JSN)". reponame:Repositório Institucional da UnB, 2006. http://repositorio.unb.br/handle/10482/6901.
Testo completoSubmitted by Thaíza da Silva Santos (thaiza28@hotmail.com) on 2011-02-11T01:23:35Z No. of bitstreams: 1 2006_CarlosAlbertoTenorioCarvalhoJunior.pdf: 2629276 bytes, checksum: bcaf33b03adf4a0a77745682f35bcf90 (MD5)
Approved for entry into archive by Daniel Ribeiro(daniel@bce.unb.br) on 2011-02-16T01:04:02Z (GMT) No. of bitstreams: 1 2006_CarlosAlbertoTenorioCarvalhoJunior.pdf: 2629276 bytes, checksum: bcaf33b03adf4a0a77745682f35bcf90 (MD5)
Made available in DSpace on 2011-02-16T01:04:02Z (GMT). No. of bitstreams: 1 2006_CarlosAlbertoTenorioCarvalhoJunior.pdf: 2629276 bytes, checksum: bcaf33b03adf4a0a77745682f35bcf90 (MD5)
Este trabalho apresenta um novo conceito para a aceleração do método TLM bidimensional (TLM-2D). A técnica baseia-se na utilização de saltos controlados no passo de tempo em conjunto com a redução de ordem de modelo, obtendo assim um processamento mais rápido. Estes saltos são numericamente estáveis e podem resultar em considerável redução na utilização do processador. Para tornar o método mais eficiente emprega-se a redução de ordem de modelo por meio da decomposição de Schur ou via decomposição em autovalores, utilizando a transformada Z. Além disso, apresenta-se aplicações da envoltória complexa na modelagem numérica utilizando o método TLM-JSN (Transmission Line Matrix - John´s Super Node) e adaptação da técnica de diakópticas na modelagem TLMJSN. A metodologia é validada através de comparações com o método TLM convencional, mediante o cálculo de diversas estruturas. _________________________________________________________________________________ ABSTRACT
This work presents a new concept for the acceleration of the TLM method. The technique is based on the use of controlled timestep jumps together with model order reduction. This results in faster processing. These jumps are numerically stable and can result in considerable computational savings. The method can be optimized through model order reduction using Schur decomposition or through Z-transform eigenvalue decomposition. In addittion, this work presents the application of the complex envelope in TLM-JSN (Transmission-Line Matrix - John’s Super Node) together with the appllication of diakoptics techniques. The methodology is validated through comparisons with the method TLM conventional, by the calculation of several structures.
Sumer, Simon Alexander [Verfasser], e Gudrun A. [Akademischer Betreuer] Rappold. "Deciphering the role of SHOX2 in atrial fibrillation and sinus node dysfunction / Simon Alexander Sumer ; Betreuer: Gudrun A. Rappold". Heidelberg : Universitätsbibliothek Heidelberg, 2020. http://d-nb.info/1222978032/34.
Testo completoSumer, Simon [Verfasser], e Gudrun A. [Akademischer Betreuer] Rappold. "Deciphering the role of SHOX2 in atrial fibrillation and sinus node dysfunction / Simon Alexander Sumer ; Betreuer: Gudrun A. Rappold". Heidelberg : Universitätsbibliothek Heidelberg, 2020. http://d-nb.info/1222978032/34.
Testo completoTzeng, Zhi-Hong, e 曾至鴻. "Super Node Selection for IP Communication System". Thesis, 2006. http://ndltd.ncl.edu.tw/handle/04454655194567970826.
Testo completo國立交通大學
資訊科學與工程研究所
94
Many Peer-to-Peer (P2P) systems take advantage of a subset of the peers that have better capability (sufficient network bandwidth, high computation power, more disk space, etc.) to enhance the quality and/or the functionalities of the services provided. These special peers are often referred to as super nodes. On the IP communication platform developed at Internet Communication Lab, NCTU, we utilized super nodes to help users in determining whether they are behind NAT (Network Address Translator) and in punching through the NAT. In certain conditions, users behind NAT need a super node to relay media streams for communication with others. If the relay super node is far from the communicating pair, it may impair the voice quality. In the thesis, we propose a greedy algorithm to search super nodes which are close to the end-users. Therefore, it can reduce unnecessary relaying delay between the users and the super node. In addition, we adopt a hierarchy structure to reduce network traffic in performing our super node selection algorithm. Finally, we evaluate our algorithm using computer simulation. The simulation results indicate that super nodes selected by our algorithm are indeed close to the end-users.
KUMAR, ANIL. "SPATIAL CORRELATION MODELS ANALYSIS FOR WIRELESS SENSOR NETWORK". Thesis, 2016. http://dspace.dtu.ac.in:8080/jspui/handle/repository/14839.
Testo completoKo, Hsuen-Ling, e 柯學嶺. "An Efficient Peer-to-Peer Network Exploiting Super Node and Distributed Hash Table Properties". Thesis, 2003. http://ndltd.ncl.edu.tw/handle/81956166765966032076.
Testo completo國立臺灣大學
電機工程學研究所
91
The technique of Distributed Hash Table (DHT) has become a fundamental part to build peer to peer overlay networks. It provides routing and location algorithms, and each node over the network has equal responsibilities that store a part of information about other nodes and help route the lookup message to the target node. However, these approaches did not consider the heterogeneous nature and the asymmetric property. Because each node has different properties in computing power, storage space, and network bandwidth, therefore their contributions are asymmetric. This paper presents Japster, an improved approach to P2P networks, which selects a portion of high capability machines that will stay on the network for a long period to be super nodes for routing accelerator, making all lookup operation finish quickly in three hops. Japster combines DHT and the concept of super nodes to make a good infrastructure with efficiency, self-adaptation and fault-tolerance, scalability, and load-balance.
Guo, T. "Real-time analytics for complex structure data". Thesis, 2015. http://hdl.handle.net/10453/38990.
Testo completoThe advancement of data acquisition and analysis technology has resulted in many real-world data being dynamic and containing rich content and structured information. More specifically, with the fast development of information technology, many current real-world data are always featured with dynamic changes, such as new instances, new nodes and edges, and modifications to the node content. Different from traditional data, which are represented as feature vectors, data with complex relationships are often represented as graphs to denote the content of the data entries and their structural relationships, where instances (nodes) are not only characterized by the content but are also subject to dependency relationships. Plus, real-time availability is one of outstanding features of today’s data. Real-time analytics is dynamic analysis and reporting based on data entered into a system before the actual time of use. Real-time analytics emphasizes on deriving immediate knowledge from dynamic data sources, such as data streams, and knowledge discovery and pattern mining are facing complex, dynamic data sources. However, how to combine structure information and node content information for accurate and real-time data mining is still a big challenge. Accordingly, this thesis focuses on real-time analytics for complex structure data. We explore instance correlation in complex structure data and utilises it to make mining tasks more accurate and applicable. To be specific, our objective is to combine node correlation with node content and utilize them for three different tasks, including (1) graph stream classification, (2) super-graph classification and clustering, and (3) streaming network node classification. Understanding the role of structured patterns for graph classification: the thesis introduces existing works on data mining from an complex structured perspective. Then we propose a graph factorization-based fine-grained representation model, where the main objective is to use linear combinations of a set of discriminative cliques to represent graphs for learning. The optimization-oriented factorization approach ensures minimum information loss for graph representation, and also avoids the expensive sub-graph isomorphism validation process. Based on this idea, we propose a novel framework for fast graph stream classification. A new structure data classification algorithm: The second method introduces a new super-graph classification and clustering problem. Due to the inherent complex structure representation, all existing graph classification methods cannot be applied to super-graph classification. In the thesis, we propose a weighted random walk kernel which calculates the similarity between two super-graphs by assessing (a) the similarity between super-nodes of the super-graphs, and (b) the common walks of the super-graphs. Our key contribution is: (1) a new super-node and super-graph structure to enrich existing graph representation for real-world applications; (2) a weighted random walk kernel considering node and structure similarities between graphs; (3) a mixed-similarity considering structured content inside super-nodes and structural dependency between super-nodes; and (4) an effective kernel-based super-graph classification method with sound theoretical basis. Empirical studies show that the proposed methods significantly outperform the state-of-the-art methods. Real-time analytics framework for dynamic complex structure data: For streaming networks, the essential challenge is to properly capture the dynamic evolution of the node content and node interactions in order to support node classification. While streaming networks are dynamically evolving, for a short temporal period, a subset of salient features are essentially tied to the network content and structures, and therefore can be used to characterize the network for classification. To achieve this goal, we propose to carry out streaming network feature selection (SNF) from the network, and use selected features as gauge to classify unlabeled nodes. A Laplacian based quality criterion is proposed to guide the node classification, where the Laplacian matrix is generated based on node labels and network topology structures. Node classification is achieved by finding the class label that results in the minimal gauging value with respect to the selected features. By frequently updating the features selected from the network, node classification can quickly adapt to the changes in the network for maximal performance gain. Experiments and comparisons on real-world networks demonstrate that SNOC is able to capture dynamics in the network structures and node content, and outperforms baseline approaches with significant performance gain.
Quéro, Yann-Cédric. "La gouvernance nodale de la sécurité locale". Thèse, 2015. http://hdl.handle.net/1866/13591.
Testo completoWei, Bin-Jou, e 魏彬洲. "Construct Super Nodes to Improve the Performance of SIP in the NEMO". Thesis, 2007. http://ndltd.ncl.edu.tw/handle/76824294526433198749.
Testo completo國立嘉義大學
資訊工程學系研究所
95
The purpose of this paper is to integrate the SIP and Nested Mobile Network. We design the Mobile Router in the Mobile Network not only supports routing mechanism but also supports functions of the SIP Proxy, Registrar Server, and the Location Server. Then the Mobile Node can register to administrator with its own URI. When the Mobile Node establishes the session with other nodes, the Mobile Router can be the SIP Proxy for the Mobile Node. In this paper, we propose an approach called Construct Super Node which can optimize the route of the local mobile network and improve the performance of the SIP in the NEMO.
Lin, Shang-Ching, e 林上清. "Hedging Strategies of Structured Note Issuer-A Case Study of Unlimited Upside Potential Note on A Super-Financial-7 Taiwan Stock Basket Issued by Calyon Bank". Thesis, 2008. http://ndltd.ncl.edu.tw/handle/04474568074250944975.
Testo completo輔仁大學
金融研究所
96
Structured notes mostly are composite of zero-coupon bond and various kinds of options. Past researchers focused more on pricing of embedded options than on dynamic hedging. This essay practically explores the differences between various hedging strategies. This case study explored the hedging methodologies of equity-linked rainbow minimum options embedded in 3-year equity-linked note issued by Calyon Bank in 2003 and linked to the performance of basket of Taiwan’s 7 selected financial holding company’s stocks. This essay figures out the theoretical value with the existing closed-form solution and the individual partial delta of the worst linked targets regarding a range of evaluating timing at the same time. The hedging operates based on the presumptive results above and then the actual revenues of the structured note issuer are analyzed in terms of different hedging strategies. The empirical study found that with limitations on short position, quarterly rebalance hedging strategy would perform better than monthly and semi-annually rebalancing hedging strategy. But, without short limitation, monthly rebalance hedging strategy would outperform other hedging strategy. Besides, issuer could get more benefit if hedge with financial index future instead of cash position.
Libri sul tema "SUPER NODE"
Super smart information strategies: Write it down. Ann Arbor, Mich: Cherry Lake Pub., 2010.
Cerca il testo completoValerio, Joe. Second to none: The relentless drive and impossible dream of the Super Bowl Bills. Chicago, Illinois: Triumph Books, 2014.
Cerca il testo completoGuitmond. La "verità" dell'Eucaristia: De corporis et sanguis Christi veritate : edizione bilingue con traduzione a fronte : introduzione, sommari e note di sommari di commento al testo. Napoli: Edizioni Scientifiche Italiane, 1995.
Cerca il testo completobiscuit, cookie. Super Bomberman Note Book. Independently Published, 2020.
Cerca il testo completoAl-Tabbaa, Hasan. Super Value Thought Note Pad ! Independently Published, 2018.
Cerca il testo completokarawia, ibrahim. Justice League Note Book: Super Heroes Note Book. Independently Published, 2021.
Cerca il testo completoGogol, Nikolai Vasilevich. The Nose [EasyRead Super Large 20pt Edition]. ReadHowYouWant.com, 2007.
Cerca il testo completoQuotes, Notebook. My Super Duper Ideas: Note All the Ongoing Super Duper Ideas in Your Head ! Independently Published, 2019.
Cerca il testo completoBradley, Richard. Bradley's New 21 Super Hits for Big Note Piano. Alfred Publishing Company, 1995.
Cerca il testo completoCapitoli di libri sul tema "SUPER NODE"
Dadhich, Khushboo, e Devika Kataria. "Effect of Channel Slot Time on Performance of IEEE 802.15.6-Based Medical Body Area Network". In Communications in Computer and Information Science, 376–85. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-28180-8_25.
Testo completoJun, Guo, e Chen Chen. "A Hybrid P2P Model of a Super-Node Functional Division". In Advances in Intelligent and Soft Computing, 675–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-03718-4_83.
Testo completoTakahashi, Shigeru, Hajime Tokuda, Hiroshi Matsushige, Atsushi Takenaka, Makoto Kato e Norimasa Watanabe. "Evaluation of Super Extensive Lymph Node Dissection (R4) for Advanced Gastric Cancer". In Recent Advances in Management of Digestive Cancers, 297–99. Tokyo: Springer Japan, 1993. http://dx.doi.org/10.1007/978-4-431-68252-3_74.
Testo completoKandaswamy, K. V. "High Gain Super-Lift Converters for Multi-node Connected Low-Output Transducers". In Advances in Automation, Signal Processing, Instrumentation, and Control, 2089–95. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-15-8221-9_194.
Testo completoUgryumova, M. V., e W. H. A. Schilders. "Stability and Passivity of the Super Node Algorithm for EM Modeling of IC’s". In Scientific Computing in Electrical Engineering SCEE 2008, 531–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12294-1_65.
Testo completoKhan, Ajab, e Reiko Heckel. "Evaluating Super Node Selection and Load Balancing in P2P VoIP Networks Using Stochastic Graph Transformation". In E-Business and Telecommunications, 60–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-35755-8_5.
Testo completoBremler-Barr, Anat, e Ran Goldschmidt. "On the Stability of Skype Super Nodes". In Traffic Monitoring and Analysis, 86–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20305-3_8.
Testo completoTomita, K. "Note on a Super-Horizon-Scale Inhomogeneous Cosmological Model". In Astrophysical Applications of Gravitational Lensing, 25–26. Dordrecht: Springer Netherlands, 1996. http://dx.doi.org/10.1007/978-94-009-0221-3_6.
Testo completoZainal Abidin, Husna, Aarni Tuomi e Elina Moreira Kares. "Older Adults’ Perceptions of Digital Cultural Tourism in ‘Super-Aged’ Nations: The Case of Finland and Japan". In Information and Communication Technologies in Tourism 2023, 361–66. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-25752-0_41.
Testo completoWahid, Abdul, Dongkyun Kim e Kyungshik Lim. "A Multi-layered Routing Protocol for UWSNs Using Super Nodes". In Communication and Networking, 258–67. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-27201-1_29.
Testo completoAtti di convegni sul tema "SUPER NODE"
Mekouar, Loubna, Muna Bader e Fatna Belqasmi. "The Super-Node Topology in Collaborative Learning". In SIGITE '21: The 22nd Annual Conference on Information Technology Education. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3450329.3476846.
Testo completoMekouar, Loubna, Fatna Belqasmi e Muna Bader. "Super-Node Topology for Effective Students’ Advising". In 2022 IEEE World Engineering Education Conference (EDUNINE). IEEE, 2022. http://dx.doi.org/10.1109/edunine53672.2022.9782366.
Testo completoWang, Shuling, Shoubao Yang, Kai Shen e Lihua Xie. "A Super Node Selecting Mechanism Based on AHP". In 2008 Seventh International Conference on Grid and Cooperative Computing (GCC). IEEE, 2008. http://dx.doi.org/10.1109/gcc.2008.87.
Testo completoZuo, Ming. "A Super-Node Interconnection Method Base on the Memory Centric". In 2010 2nd International Workshop on Database Technology and Applications (DBTA). IEEE, 2010. http://dx.doi.org/10.1109/dbta.2010.5658950.
Testo completoWang, Run-Liu, e Yun-Hui Yi. "Mobile IP Multicast Routing Algorithm by Using Super Node Set". In 2012 Fourth International Conference on Computational and Information Sciences (ICCIS). IEEE, 2012. http://dx.doi.org/10.1109/iccis.2012.184.
Testo completoZhang, Xiaolu, Qingchao Cai e Xuejie Zhang. "An Efficient Super-Node-Based Regional Lookup Algorithm in Chord". In 2009 WRI World Congress on Computer Science and Information Engineering. IEEE, 2009. http://dx.doi.org/10.1109/csie.2009.986.
Testo completoMekouar, Loubna, Fatna Belqasmi e Muna Bader. "Super-Node Topology in Collaborative Learning: Concrete Examples and Benefits". In 2021 IEEE International Conference on Engineering, Technology & Education (TALE). IEEE, 2021. http://dx.doi.org/10.1109/tale52509.2021.9678790.
Testo completoXiao, Xianjian, Tanghuai Fan, Huibin Wang e Lizhong Xu. "Design and Implementation of Hardware Fusion Technology for Super Sink Node". In 2009 International Conference on Networks Security, Wireless Communications and Trusted Computing (NSWCTC). IEEE, 2009. http://dx.doi.org/10.1109/nswctc.2009.81.
Testo completoUdupa, H. Nagaraja, Asheesh Shah e Ravishankar Kamath. "Power system Vertical Division State Estimation (VDSE) application to super node area". In 2016 International conference on Signal Processing, Communication, Power and Embedded System (SCOPES). IEEE, 2016. http://dx.doi.org/10.1109/scopes.2016.7955652.
Testo completoGhimire, Jagadish, Mehdi Mani, Teerapat Sanguankotchakorn e Noel Crespi. "Self-connectivity estimation for super node overlay creation in ad-hoc networks". In 2010 17th International Conference on Telecommunications (ICT 2010). IEEE, 2010. http://dx.doi.org/10.1109/ictel.2010.5478804.
Testo completoRapporti di organizzazioni sul tema "SUPER NODE"
Wu, Y., K. W. Tam, F. Li e M. M. Zen. A Note on Estimating The Number of Super Imposed Exponential Signals by the Cross-Validation Approach. Fort Belvoir, VA: Defense Technical Information Center, agosto 1999. http://dx.doi.org/10.21236/ada369860.
Testo completoLi, Xuejiao, Cong Wang, Xiukun Hou e Ye Tao. Diagnostic accuracy of ultrasound superb microvascular imaging for lymph nodes: A protocol for systematic review and meta analysis. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, luglio 2020. http://dx.doi.org/10.37766/inplasy2020.7.0133.
Testo completo