Thematische Bibliographien / SUPER NODE

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „SUPER NODE“

Autor: Grafiati

Veröffentlicht am 11. September 2023

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "SUPER NODE" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "SUPER NODE"

He, Yong. „A Localization Algorithm of Nodes Based on Hypersphere Granular Computing in Wireless Sensor Networks“. Advanced Materials Research 998-999 (Juli 2014): 1390–93. http://dx.doi.org/10.4028/www.scientific.net/amr.998-999.1390.

Der volle Inhalt der Quelle

Annotation:

This paper proposes a node localization algorithm based on super chondritic calculation, super chondritic calculation scanning of a training set is able to complete the training process, the training has characteristics of fast, the problem of node localization for wireless sensor networks. Firstly, according to the related parameter information for the location of wireless sensor nodes, a multi input, multi output problem of training set, and then through the methods of grid division, location area, the original training set into the classification of multi input, single output training set, the super chondritic algorithm by scanning training, in order to get the relevant parameters, and the estimation of the unknown node location. Simulation results show that the proposed algorithm has better positioning accuracy.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

DE LA TORRE, PILAR, RAYMOND GREENLAW und TERESA M. PRZYTYCKA. „OPTIMAL TREE RANKING IS IN $\mathcal{NC}$“. Parallel Processing Letters 02, Nr. 01 (März 1992): 31–41. http://dx.doi.org/10.1142/s0129626492000155.

Der volle Inhalt der Quelle

Annotation:

This paper places the optimal tree ranking problem in [Formula: see text]. A ranking is a labeling of the nodes with natural numbers such that if nodes u and v have the same label then there exists another node with a greater label on the path between them. An optimal ranking is a ranking in which the largest label assigned to any node is as small as possible among all rankings. An O(n) sequential algorithm is known. Researchers have speculated that this problem is P-complete. We show that for an n-node tree, one can compute an optimal ranking in O( log n) time using n2/ log n CREW PRAM processors. In fact, our ranking is super critical in that the label assigned to each node is absolutely as small as possible. We achieve these results by showing that a more general problem, which we call the super critical numbering problem, is in [Formula: see text]. No [Formula: see text] algorithm for the super critical tree ranking problem, approximate or otherwise, was previously known; the only known [Formula: see text] algorithm for optimal tree ranking was an approximate one.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ge, Jun Wei, Yan Feng Wang und Yi Qiu Fang. „Research on P2P Resources Search Algorithm Based on Cloud Computing“. Advanced Materials Research 765-767 (September 2013): 1533–36. http://dx.doi.org/10.4028/www.scientific.net/amr.765-767.1533.

Der volle Inhalt der Quelle

Annotation:

This paper puts forward a model combined cloud computing and P2P, and then achieves chord resource search algorithm in the model. Because chord algorithm one hand, does not consider the problem of node heterogeneity, on the other hand, its routing table has large redundant information. So chord algorithm is improved from the two areas, and last MRC-chord is proposed. The algorithm first defines that the nodes of the same geographical form a ring, and in each ring, the node with strongest overall performance is selected to be super cloud node, all of the super cloud nodes form the master ring , then improves routing table. Experimental results show that: the improved algorithm can reduce average routing hops and average network delay effectively, so improves the efficiency of resource search.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zhao, Bo Wen. „Monitoring Technological Analysis of Communication Network Platform“. Applied Mechanics and Materials 687-691 (November 2014): 2630–34. http://dx.doi.org/10.4028/www.scientific.net/amm.687-691.2630.

Der volle Inhalt der Quelle

Annotation:

Node virtual network platform is designed and realized in allusion to node administration application scenarios in cloud computing, and distributed database and virtual network model with dynamic network features are put forward; nodes build node network through self-discovery packet and provide ability of addressing capability through built-in database engine. In the environment of super-large scale, node degree influences the whole virtual network platform. Through test, this platform can meet the needs of dynamic condition of application node brought by the explosive application request.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fu, Yu-Hsiang, Chung-Yuan Huang und 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.

Der volle Inhalt der Quelle

Annotation:

Identifying the most influential individuals spreading information or infectious diseases can assist or hinder information dissemination, product exposure, and contagious disease detection. Hub nodes, high betweenness nodes, high closeness nodes, and highk-shell nodes have been identified as good initial spreaders, but efforts to use node diversity within network structures to measure spreading ability are few. Here we describe a two-step framework that combines global diversity and local features to identify the most influential network nodes. Results from susceptible-infected-recovered epidemic simulations indicate that our proposed method performs well and stably in single initial spreader scenarios associated with various complex network datasets.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Song, Pan. „A Topology Structure Control Algorithm of Wireless Sensor Network by Using Small World Model“. Applied Mechanics and Materials 325-326 (Juni 2013): 1023–27. http://dx.doi.org/10.4028/www.scientific.net/amm.325-326.1023.

Der volle Inhalt der Quelle

Annotation:

The small world network has higher convergence coefficient and shorter average path length. This paper introduce small world theory to the wireless sensor network, and propose a topology control algorithm of wireless sensor network based on NW small world network model. The design of algorithm is hierarchical, which include formation of super node ring, common node join clusters, maintenance the load balance of common node in cluster, and maintenance the super node ring when super node is failure. The experiment shows that the topology control algorithm has the characteristics of small world network, the network connectivity is good, and the lifetime of wireless sensor network is prolonged.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Karakatsanis, A., H. Olofsson, P. Stålberg, L. Bergkvist, S. Abdsaleh und 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, Nr. 2 (13.11.2017): 130–37. http://dx.doi.org/10.1177/1457496917738867.

Der volle Inhalt der Quelle

Annotation:

Purpose: Sentinel node is routinely localized with the intraoperative use of a radioactive tracer, involving challenging logistics. Super paramagnetic iron oxide nanoparticle is a non-radioactive tracer with comparable performance that could allow for preoperative localization, would simplify the procedure, and possibly be of value in axillary mapping before neoadjuvant treatment. The current trial aimed to determine the a priori hypothesis that the injection of super paramagnetic iron oxide nanoparticles in the preoperative period for the localization of the sentinel node is feasible. Methods: This is a prospective feasibility trial, conducted from 9 September 2014 to 22 October 2014 at Uppsala University Hospital. In all, 12 consecutive patients with primary breast cancer planned for resection of the primary and sentinel node biopsy were recruited. Super paramagnetic iron oxide nanoparticles were injected in the preoperative visit in the outpatient clinic. The radioactive tracer (99mTc) and the blue dye were injected perioperatively in standard fashion. A volunteer was injected with super paramagnetic iron oxide nanoparticles to follow the decline in the magnetic signal in the sentinel node over time. The primary outcome was successful sentinel node detection. Results: Super paramagnetic iron oxide nanoparticles’ detection after preoperative injection (3–15 days) was successful in all cases (100%). In the volunteer, axillary signal was presented for 4 weeks. No adverse effects were noted. Conclusion and relevance: Preoperative super paramagnetic iron oxide nanoparticles’ injection is feasible and leads to successful detection of the sentinel node. That may lead to simplified logistics as well as the identification, sampling, and marking of the sentinel node in patients planned for neoadjuvant treatment.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Delchev, Grozi. „The Influence of Late Treatment with Antibroadleaved Herbicides during Stem Elongation Stage of Durum Wheat on Sowing Characteristics of Seeds“. АГРОЗНАЊЕ 19, Nr. 3 (10.12.2018): 155. http://dx.doi.org/10.7251/agren1803155d.

Der volle Inhalt der Quelle

Annotation:

The aim of this investigation was to establish the changes of sowing properties of durum wheat seeds and the quantity of waste grain due to the influence of 20 antibroadleaved herbicides, which were applied during the 1st, the 2nd, and the 3rd stem node stages of durum wheat. During the 1st stem node stage of durum wheat none of the herbicides included in the investigation had negative effect on sowing characteristics of durum wheat seeds. During the 2nd and the 3rd stem node stages of durum wheat herbicides such as Arat, Biathlon, Derby super, Mustang, Secator, Lintur, Akurat, and Akurat extra can be used in seed production crops of durum wheat. During the 1st stem node stage of durum wheat the antibroadleaved herbicides Arat, Biathlon, Derby super, Mustang, Weedmaster, Secator, Lintur, Akurat, Akurat extra, Eagle, Starane, Sanafen, Dicotex, and Herby can be used. These herbicides do not have negative influence on grain yield. During the 2nd stem node stage of durum wheat the herbicides Arat, Biathlon, Derby super, Mustang, Secator, Lintur, Akurat, Akurat extra, Starane, Dicotex, and Herby can be used. During the 3rd stem node stage of durum wheat only the herbicides Arat, Biathlon, Derby super, Secator, Lintur, Akurat, Akurat extra, and Starane can be used.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Xu, Jie, und Wei Ding. „Rough Estimator Based Asynchronous Distributed Super Points Detection on High Speed Network Edge“. Algorithms 14, Nr. 10 (25.09.2021): 277. http://dx.doi.org/10.3390/a14100277.

Der volle Inhalt der Quelle

Annotation:

Super points detection plays an important role in network research and application. With the increase of network scale, distributed super points detection has become a hot research topic. The key point of super points detection in a multi-node distributed environment is how to reduce communication overhead. Therefore, this paper proposes a three-stage communication algorithm to detect super points in a distributed environment, Rough Estimator based Asynchronous Distributed super points detection algorithm (READ). READ uses a lightweight estimator, the Rough Estimator (RE), which is fast in computation and takes less memory to generate candidate super points. Meanwhile, the famous Linear Estimator (LE) is applied to accurately estimate the cardinality of each candidate super point, so as to detect the super point correctly. In READ, each node scans IP address pairs asynchronously. When reaching the time window boundary, READ starts three-stage communication to detect the super point. This paper proves that the accuracy of READ in a distributed environment is no less than that in the single-node environment. Four groups of 10 Gb/s and 40 Gb/s real-world high-speed network traffic are used to test READ. The experimental results show that READ not only has high accuracy in a distributed environment, but also has less than 5% of communication burden compared with existing algorithms.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Boonklurb, Ratinan, Authawich Narissayaporn und Sirirat Singhun. „Super edge-magic labeling of -node -uniform hyperpaths and -node -uniform hypercycles“. AKCE International Journal of Graphs and Combinatorics 13, Nr. 3 (01.12.2016): 218–29. http://dx.doi.org/10.1016/j.akcej.2016.06.011.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "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.

Der volle Inhalt der Quelle

Annotation:

Tese (doutorado)—Universidade de Brasília, Faculdade de Tecnologia, Departamento de Engenharia Elétrica, 2006.
Submitted 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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sumer, Simon Alexander [Verfasser], und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sumer, Simon [Verfasser], und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Tzeng, Zhi-Hong, und 曾至鴻. „Super Node Selection for IP Communication System“. Thesis, 2006. http://ndltd.ncl.edu.tw/handle/04454655194567970826.

Der volle Inhalt der Quelle

Annotation:

碩士
國立交通大學
資訊科學與工程研究所
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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

KUMAR, ANIL. „SPATIAL CORRELATION MODELS ANALYSIS FOR WIRELESS SENSOR NETWORK“. Thesis, 2016. http://dspace.dtu.ac.in:8080/jspui/handle/repository/14839.

Der volle Inhalt der Quelle

Annotation:

Wireless sensor networks (WSN) are deployed very densely so that accurate monitoring can be achieved in many applications. For example, the deployment density can be as high as 20 nodes/m3[1]. As sensor nodes are deployed with high density, the information observed and transmitted by sensor nodes in an area at the time an event is occurred is spatially correlated. It means there is spatial correlation in the sensors observations. The spatial correlation along with collaborative nature of the Wireless sensor networks (WSN) has potential advantages in designing energy-efficient models of Communication protocols. There exists a spatial correlation function[7], which describes correlation characteristics of information sensed by sensor nodes, which is related to location and coverage model of sensor nodes. This paper presents a study of various cluster head selection algorithms and proposes an energy efficient model for wireless sensor network by exploiting spatial correlation among various sensor nodes of the network. Firstly, study the behavior of wireless sensor network without spatial correlation. Secondly, we divide entire wireless sensor network into clusters assuming spatial correlation among the observations within the nodes of a cluster. One of the nodes of the cluster is considered as Cluster Head (CH) on random selection and sends the observation to Base Station (BS). In last part of analysis we make one of the Cluster Head (CH) as super Node (SN) that aggregates observations from all Cluster Head (CHs) and sends information to Base Station (BS). Finally, based on the above analysis and their results we propose an energy efficient model for wireless sensor network.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ko, Hsuen-Ling, und 柯學嶺. „An Efficient Peer-to-Peer Network Exploiting Super Node and Distributed Hash Table Properties“. Thesis, 2003. http://ndltd.ncl.edu.tw/handle/81956166765966032076.

Der volle Inhalt der Quelle

Annotation:

碩士
國立臺灣大學
電機工程學研究所
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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Guo, T. „Real-time analytics for complex structure data“. Thesis, 2015. http://hdl.handle.net/10453/38990.

Der volle Inhalt der Quelle

Annotation:

University of Technology Sydney. Faculty of Engineering and Information Technology.
The 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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Quéro, Yann-Cédric. „La gouvernance nodale de la sécurité locale“. Thèse, 2015. http://hdl.handle.net/1866/13591.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wei, Bin-Jou, und 魏彬洲. „Construct Super Nodes to Improve the Performance of SIP in the NEMO“. Thesis, 2007. http://ndltd.ncl.edu.tw/handle/76824294526433198749.

Der volle Inhalt der Quelle

Annotation:

碩士
國立嘉義大學
資訊工程學系研究所
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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lin, Shang-Ching, und 林上清. „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.

Der volle Inhalt der Quelle

Annotation:

碩士
輔仁大學
金融研究所
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.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bücher zum Thema "SUPER NODE"

Super smart information strategies: Write it down. Ann Arbor, Mich: Cherry Lake Pub., 2010.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Valerio, Joe. Second to none: The relentless drive and impossible dream of the Super Bowl Bills. Chicago, Illinois: Triumph Books, 2014.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Guitmond. 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.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

biscuit, cookie. Super Bomberman Note Book. Independently Published, 2020.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Al-Tabbaa, Hasan. Super Value Thought Note Pad ! Independently Published, 2018.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sharma, Hemant. Superb Note Book. Independently Published, 2022.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

karawia, ibrahim. Justice League Note Book: Super Heroes Note Book. Independently Published, 2021.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Gogol, Nikolai Vasilevich. The Nose [EasyRead Super Large 20pt Edition]. ReadHowYouWant.com, 2007.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Quotes, Notebook. My Super Duper Ideas: Note All the Ongoing Super Duper Ideas in Your Head ! Independently Published, 2019.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bradley, Richard. Bradley's New 21 Super Hits for Big Note Piano. Alfred Publishing Company, 1995.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "SUPER NODE"

Dadhich, Khushboo, und 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.

Der volle Inhalt der Quelle

Annotation:

AbstractThe IEEE 802.15.6 standard is an emerging technology that supports low data rate, short-range wireless communication. Medical Body Area Networks (MBAN) are a special type of wireless communication where multiple sensor nodes are deployed on the human body to measure vital parameters. The data is sent by the nodes to a coordinator, the latter aggregates the data and sends it to a central server using standard protocols. The coordinator allows the nodes to access the channel using different access modes-beacon mode with the super frame, non-beacon mode with super frame and non-beacon mode without super frame. The standard allows different user priorities to be assigned to the nodes. The nodes may access the channel using scheduling done by the coordinator (scheduled access) or may randomly access the channel using the CSMA/CA (for narrowband PHY) or Slotted Aloha for UltraWideBand (UWB PHY) protocols. In this work we have conducted an analytical study to understand the performance parameters of different user priority nodes using CSMA/CA protocol and operating in the Beacon access mode with super frame boundaries. Parameters like the probability of successful transmission (reliability) which in turn depend on the probability of packet drop due to channel access failure and the probability of failure due to insufficient time slot available have been studied. This study reveals that once a channel is assessed by a node, then the probability of sufficient time slot of 60% yields the best packet transmission probability. The successful delivery of the packet also depends on back off counter. Markov chain models for nodes with different priorities have been developed using backoff stage and backoff counter as parameters.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jun, Guo, und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Takahashi, Shigeru, Hajime Tokuda, Hiroshi Matsushige, Atsushi Takenaka, Makoto Kato und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kandaswamy, 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ugryumova, M. V., und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Khan, Ajab, und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bremler-Barr, Anat, und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Tomita, 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zainal Abidin, Husna, Aarni Tuomi und 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.

Der volle Inhalt der Quelle

Annotation:

AbstractOlder adults have been recognized as a key tourist segment for cultural tourism. Despite the growing population of older adults, limited research have explored their experiences and needs within digital cultural experiences. Therefore, this research note takes on an exploratory approach in understanding older adults’ perceptions towards digital cultural experiences in the context of two ‘super-aged’ nations: Finland and Japan. The findings illustrate that differences do exist, and that Finnish older adults are found to be more open to technology-use in the context of digital cultural experiences than their Japanese counterparts. Implications for e-tourism research and management are discussed.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wahid, Abdul, Dongkyun Kim und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "SUPER NODE"

Mekouar, Loubna, Muna Bader und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mekouar, Loubna, Fatna Belqasmi und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wang, Shuling, Shoubao Yang, Kai Shen und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zuo, 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wang, Run-Liu, und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zhang, Xiaolu, Qingchao Cai und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mekouar, Loubna, Fatna Belqasmi und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Xiao, Xianjian, Tanghuai Fan, Huibin Wang und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Udupa, H. Nagaraja, Asheesh Shah und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ghimire, Jagadish, Mehdi Mani, Teerapat Sanguankotchakorn und 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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "SUPER NODE"

Wu, Y., K. W. Tam, F. Li und 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, August 1999. http://dx.doi.org/10.21236/ada369860.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Li, Xuejiao, Cong Wang, Xiukun Hou und 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, Juli 2020. http://dx.doi.org/10.37766/inplasy2020.7.0133.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!