Auswahl der wissenschaftlichen Literatur zum Thema „Euclidean networks“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Euclidean networks" 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 "Euclidean networks"
Xuan, Qi, Xiaodi Ma, Chenbo Fu, Hui Dong, Guijun Zhang und Li Yu. „Heterogeneous multidimensional scaling for complex networks“. International Journal of Modern Physics C 26, Nr. 02 (Februar 2015): 1550023. http://dx.doi.org/10.1142/s0129183115500230.
Der volle Inhalt der QuelleXing, Chenjie, Yuan Zhou, Yinan Peng, Jieke Hao und Shuoshi Li. „Specific Emitter Identification Based on Ensemble Neural Network and Signal Graph“. Applied Sciences 12, Nr. 11 (28.05.2022): 5496. http://dx.doi.org/10.3390/app12115496.
Der volle Inhalt der QuelleHuang, Shao-Lun, Changho Suh und Lizhong Zheng. „Euclidean Information Theory of Networks“. IEEE Transactions on Information Theory 61, Nr. 12 (Dezember 2015): 6795–814. http://dx.doi.org/10.1109/tit.2015.2484066.
Der volle Inhalt der QuelleCarlsson, John Gunnar, und Fan Jia. „Euclidean Hub-and-Spoke Networks“. Operations Research 61, Nr. 6 (Dezember 2013): 1360–82. http://dx.doi.org/10.1287/opre.2013.1219.
Der volle Inhalt der QuelleWu, Wei, Guangmin Hu und Fucai Yu. „An Unsupervised Learning Method for Attributed Network Based on Non-Euclidean Geometry“. Symmetry 13, Nr. 5 (19.05.2021): 905. http://dx.doi.org/10.3390/sym13050905.
Der volle Inhalt der QuelleXu, Xinzheng, Xiaoyang Zhao, Meng Wei und Zhongnian Li. „A comprehensive review of graph convolutional networks: approaches and applications“. Electronic Research Archive 31, Nr. 7 (2023): 4185–215. http://dx.doi.org/10.3934/era.2023213.
Der volle Inhalt der QuelleLiang, Fan, Cheng Qian, Wei Yu, David Griffith und Nada Golmie. „Survey of Graph Neural Networks and Applications“. Wireless Communications and Mobile Computing 2022 (28.07.2022): 1–18. http://dx.doi.org/10.1155/2022/9261537.
Der volle Inhalt der QuelleGao, Baojian, Xiaoning Zhao, Jun Wang und Xiaojiang Chen. „Decomposition Based Localization for Anisotropic Sensor Networks“. International Journal of Distributed Sensor Networks 2015 (2015): 1–16. http://dx.doi.org/10.1155/2015/805061.
Der volle Inhalt der QuelleTrietsch, Dan. „Augmenting Euclidean Networks—the Steiner Case“. SIAM Journal on Applied Mathematics 45, Nr. 5 (Oktober 1985): 855–60. http://dx.doi.org/10.1137/0145051.
Der volle Inhalt der QuelleKartun-Giles, Alexander, Suhanya Jayaprakasam und Sunwoo Kim. „Euclidean Matchings in Ultra-Dense Networks“. IEEE Communications Letters 22, Nr. 6 (Juni 2018): 1216–19. http://dx.doi.org/10.1109/lcomm.2018.2799207.
Der volle Inhalt der QuelleDissertationen zum Thema "Euclidean networks"
Grafström, Amanda. „Hur biodiversitet på ekosystemnivå skiljer sig mellan olika habitat“. Thesis, Linköpings universitet, Institutionen för fysik, kemi och biologi, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-108429.
Der volle Inhalt der QuelleHuang, Shao-Lun Ph D. Massachusetts Institute of Technology. „Euclidean network information theory“. Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/84888.
Der volle Inhalt der QuelleCataloged from PDF version of thesis.
Includes bibliographical references (pages 121-123).
Many network information theory problems face the similar difficulty of single letterization. We argue that this is due to the lack of a geometric structure on the space of probability distributions. In this thesis, we develop such a structure by assuming that the distributions of interest are all close to each other. Under this assumption, the Kullback-Leibler (K-L) divergence is reduced to the squared Euclidean metric in an Euclidean space. In addition, we construct the notion of coordinate and inner product, which will facilitate solving communication problems. We will present the application of this approach to the point-to-point channels, general broadcast channels (BC), multiple access channels (MAC) with common sources, interference channels, and multi-hop layered communication networks without or with feedback. It can be shown that with this approach, information theory problems, such as the single-letterization, can be reduced to some linear algebra problems. Solving these linear algebra problems, we will show that for the general broadcast channels, transmitting the common message to receivers can be formulated as the trade-off between linear systems. We also provide an example to visualize this trade-off in a geometric way. For the MAC with common sources, we observe a coherent combining gain due to the cooperation between transmitters, and this gain can be obtained quantitively by applying our technique. In addition, the developments of the broadcast channels and multiple access channels suggest a trade-off relation between generating common messages for multiple users and transmitting them as the common sources to exploit the coherent combining gain, when optimizing the throughputs of communication networks. To study the structure of this trade-off and understand its role in optimizing the network throughput, we construct a deterministic model by our local approach that captures the critical channel parameters and well models the network. With this deterministic model, for multi-hop layered networks, we analyze the optimal network throughputs, and illustrate what kinds of common messages should be generated to achieve the optimal throughputs. Our results provide the insight of how users in a network should cooperate with each other to transmit information efficiently.
by Shao-Lun Huang.
Ph.D.
Gomes, Tânia Tenório. „Rede ARTMAP Euclidiana utilizada na solução do problema de previsão de cargas elétricas“. Universidade Estadual Paulista (UNESP), 2017. http://hdl.handle.net/11449/152580.
Der volle Inhalt der QuelleApproved for entry into archive by Cristina Alexandra de Godoy null (cristina@adm.feis.unesp.br) on 2018-01-24T11:18:07Z (GMT) No. of bitstreams: 1 gomes_tt_me_ilha.pdf: 2284683 bytes, checksum: 58edd8d14052f9f162a3d091782c28c3 (MD5)
Made available in DSpace on 2018-01-24T11:18:07Z (GMT). No. of bitstreams: 1 gomes_tt_me_ilha.pdf: 2284683 bytes, checksum: 58edd8d14052f9f162a3d091782c28c3 (MD5) Previous issue date: 2017-12-22
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
A geração e distribuição de energia elétrica fazem parte de um vasto esquema no setor elétrico de cada país, tornando-se cada vez mais necessário criar alternativas para minimizar seu custo. Realizar a previsão de cargas elétricas de forma precisa garante uma infraestrutura mais eficiente e confiável para planejamento e operação do sistema elétrico. A proposta deste trabalho é realizar a previsão de carga elétrica global a curto prazo, utilizando uma técnica que forneça uma boa precisão, seja confiável e de baixo custo computacional. Portanto, foi utilizada a rede neural artificial ARTMAP Euclidiana, que é baseada na Teoria da Ressonância Adaptativa. Com objetivo de analisar a eficiência da metodologia proposta foram realizados 3 casos com diferentes horizontes de treinamento, sendo calculado o erro percentual médio. Os dados utilizados para as simulações são de uma companhia elétrica espanhola. O principal objetivo deste trabalho é aplicar a rede neural ARTMAP Euclidiana na previsão de cargas elétricas 24 horas à frente e para validar e verificar se esta rede é uma boa ferramenta para este tipo de estudo foi utilizada a rede neural ARTMAP Fuzzy com os mesmos dados empregados na rede ARTMAP Euclidiana como critério de comparação para comprovar a eficiência da rede neural ARTMAP Euclidiana.
Generation and distribution of electrical energy are very important for the development of the countries and it is necessary to create alternatives to minimize the costs. Electrical load forecasting must be realized precisely to assure a reliable and secure operation of the electrical system. The proposal of this work is to realize the short term global electrical load forecasting using a technique with good precision and reliable and with low computational cost. Thus, the Euclidian ARTMAP neural network was used which is also based on the adaptive resonance theory. Three different cases with different horizons were used for training and the percentual error is calculated. The data are from a Spanish company. The main objective is to apply the Euclidian ARTMAP neural network to forecast the loads 24 hours ahead. The results are compared with the traditional Fuzzy ARTMAP neural network using the same data and the comparison is effectuated evaluating the MAPE (mean absolute percentual error).
Bassi, Regiane Denise Solgon. „Identicação inteligente de patologias no trato vocal“. Universidade de São Paulo, 2014. http://www.teses.usp.br/teses/disponiveis/18/18153/tde-14032014-080118/.
Der volle Inhalt der QuelleBased on examinations such as laryngoscopy, which is considered an invasive and uncomfortable procedure, diagnosis have been performed aiming at the detection of larynx pathologies. Usually, this type of test is carried out upon medical request and when the speech changes are notable or are causing pain. At this point, the disease is possibly at an advanced degree, complicating its treatment. In order to perform a computational pre-diagnosis of such conditions, this work proposes a noninvasive technique in which three classifiers are tested and compared: the Euclidean distance, the RBF Neural Network with the Gaussian kernel and RBF Neural Network with a modified Gaussian kernel. Tests carried out with a database of normal voices and those affected by various pathologies demonstrate the effectiveness of the technique that may even be implemented to work in real time.
Eriksson, Björn. „Biodiversity at the ecosystem level : structural variation among food webs in temperate and tropical areas“. Thesis, Linköpings universitet, Biologi, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-108120.
Der volle Inhalt der QuelleKharchenko, Natalia. „Lattice algorithms and lattice-based cryptography“. Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS337.
Der volle Inhalt der QuelleLattice-based cryptography is a field of research that studies the construction of tools for secure communication based on hard lattice problems. Lattice-based cryptography is one of the most promising candidates for secure post-quantum communication. This thesis studies algorithms for solving hard lattice problems and their application to the evaluation of the security of cryptosystems. In the first part, we introduce a new family of lattice sieving algorithms called cylindrical sieving. Heuristic sieving is currently the fastest approach to solve central lattice problems: SVP and CVP. We show that cylindrical sieving can outperform existing sieving algorithms in some cases, namely, that it is more efficient for solving SVP for lattices with small prime volume and for solving the closest vector problem with preprocessing (CVPP). In the second part of the thesis, we improve the dual attack originally used to estimate the security of the Fast Fully Homomorphic Encryption scheme over Torus (TFHE). We hybridize the dual attack with the search for the secret key part. As TFHE uses binary keys, the search part of the attack can be performed efficiently by exploiting the recursive structure of the search space. We compare our attack with other existing techniques for solving LWE and show that the security level of the TFHE scheme should be updated according to the new attack
Collet, François. „Short scale study of 4-simplex assembly with curvature, in euclidean Loop Quantum Gravity“. Thesis, Aix-Marseille, 2016. http://www.theses.fr/2016AIXM4076/document.
Der volle Inhalt der QuelleA study of symmetrical assembly of three euclidean 4-simplices in classical, Regge and quantum geometry. We study the geometric properties and especially the presence of curvature. We show that classical and Regge geometry of the assembly have curvature which evolves in function of its boundary parameters. For the quantum geometry, a euclidean version of EPRL model is used with a convenient value of the Barbero-Immirzi parameter to define the transition amplitude of the assembly and its components. A C++ code is design for compute the amplitudes and study numerically the quantum geometry. We show that a classical geometry, with curvature, emerges already at low spin. We also recognize the appearance of the degenerate configurations and their effects on the expected geometry
Shepherd, Matthew. „Green Space Access in Scottish Cities : GIS Analysis of Accessibility in Scotland's Four Largest Cities“. Thesis, Umeå universitet, Institutionen för geografi, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-159783.
Der volle Inhalt der QuelleBaghaee, Sajjad. „Identification And Localization On A Wireless Magnetic Sensor Network“. Master's thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12614447/index.pdf.
Der volle Inhalt der QuelleIbrahim, Amin Abdurahman. „Detecting and preventing the electronic transmission of illicit images“. Thesis, UOIT, 2009. http://hdl.handle.net/10155/23.
Der volle Inhalt der QuelleBücher zum Thema "Euclidean networks"
Henderson, Andrea. Algebra. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198809982.003.0003.
Der volle Inhalt der QuelleCoolen, A. C. C., A. Annibale und E. S. Roberts. Specific constructions. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198709893.003.0009.
Der volle Inhalt der QuelleBuchteile zum Thema "Euclidean networks"
de Souza, Renata M. C. R., und Telmo de M. Silva Filho. „Optimized Learning Vector Quantization Classifier with an Adaptive Euclidean Distance“. In Artificial Neural Networks – ICANN 2009, 799–806. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04274-4_82.
Der volle Inhalt der QuelleLee, Sanghwan, Zhi-Li Zhang, Sambit Sahu, Debanjan Saha und Mukund Srinivasan. „Fundamental Effects of Clustering on the Euclidean Embedding of Internet Hosts“. In NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet, 890–901. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-72606-7_76.
Der volle Inhalt der QuelleDai, Qionghai, und Yue Gao. „Neural Networks on Hypergraph“. In Artificial Intelligence: Foundations, Theory, and Algorithms, 121–43. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-0185-2_7.
Der volle Inhalt der QuelleYoung, Jonathan, Du Lei und Andrea Mechelli. „Discriminative Log-Euclidean Kernels for Learning on Brain Networks“. In Connectomics in NeuroImaging, 25–34. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-67159-8_4.
Der volle Inhalt der QuelleRokka Chhetri, Sujit, und Mohammad Abdullah Al Faruque. „Non-euclidean Data-Driven Modeling Using Graph Convolutional Neural Networks“. In Data-Driven Modeling of Cyber-Physical Systems using Side-Channel Analysis, 185–207. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-37962-9_9.
Der volle Inhalt der QuelleHeindl, Christoph. „py-microdots: Position Encoding in the Euclidean Plane Based on the Anoto Codec“. In Lecture Notes in Networks and Systems, 219–35. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37963-5_16.
Der volle Inhalt der QuellePopa, Cosmin Radu. „A New FGMOST Euclidean Distance Computational Circuit Based on Algebraic Mean of the Input Potentials“. In Artificial Neural Networks – ICANN 2009, 459–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04274-4_48.
Der volle Inhalt der QuellePurohit, G. N., Seema Verma und Usha Sharma. „Application of Euclidean Distance Power Graphs in Localization of Sensor Networks“. In Communications in Computer and Information Science, 367–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-17881-8_35.
Der volle Inhalt der QuelleDemiryurek, Ugur, Farnoush Banaei-Kashani und Cyrus Shahabi. „Efficient Continuous Nearest Neighbor Query in Spatial Networks Using Euclidean Restriction“. In Advances in Spatial and Temporal Databases, 25–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02982-0_5.
Der volle Inhalt der QuelleRodríguez, Sara Inés Rizo, und Francisco de Assis Tenorio de Carvalho. „Fuzzy Clustering Algorithm Based on Adaptive Euclidean Distance and Entropy Regularization for Interval-Valued Data“. In Artificial Neural Networks and Machine Learning – ICANN 2018, 695–705. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-01418-6_68.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Euclidean networks"
Huang, Shao-Lun, Changho Suh und Lizhong Zheng. „Euclidean information theory of networks“. In 2013 IEEE International Symposium on Information Theory (ISIT). IEEE, 2013. http://dx.doi.org/10.1109/isit.2013.6620335.
Der volle Inhalt der QuelleZhu, Hongbing, Chengdong Pu, Kei Eguchi und Jinguang Gu. „Euclidean Particle Swarm Optimization“. In 2009 Second International Conference on Intelligent Networks and Intelligent Systems (ICINIS). IEEE, 2009. http://dx.doi.org/10.1109/icinis.2009.171.
Der volle Inhalt der QuelleLi, Wentao, Min Gao, Wenge Rong, Junhao Wen, Qingyu Xiong, Ruixi Jia und Tong Dou. „Social recommendation using Euclidean embedding“. In 2017 International Joint Conference on Neural Networks (IJCNN). IEEE, 2017. http://dx.doi.org/10.1109/ijcnn.2017.7965906.
Der volle Inhalt der QuelleCelińska-Kopczyńska, Dorota, und Eryk Kopczyński. „Non-Euclidean Self-Organizing Maps“. In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/269.
Der volle Inhalt der QuelleYin, Xunrui, Yan Wang, Xin Wang, Xiangyang Xue und Zongpeng Li. „Min-cost multicast networks in Euclidean space“. In 2012 IEEE International Symposium on Information Theory - ISIT. IEEE, 2012. http://dx.doi.org/10.1109/isit.2012.6283071.
Der volle Inhalt der QuelleAfrasiyabi, Arman, Diaa Badawi, Baris Nasir, Ozan Yildi, Fatios T. Yarman Vural und A. Enis Cetin. „Non-Euclidean Vector Product for Neural Networks“. In ICASSP 2018 - 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2018. http://dx.doi.org/10.1109/icassp.2018.8461709.
Der volle Inhalt der QuelleCostrell, Sarah, Subhrajit Bhattacharya und Robert Ghrist. „Reconstruction of Euclidean embeddings in dense networks“. In 2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP). IEEE, 2016. http://dx.doi.org/10.1109/globalsip.2016.7905872.
Der volle Inhalt der QuelleDavydov, Alexander, Anton V. Proskurnikov und Francesco Bullo. „Non-Euclidean Contractivity of Recurrent Neural Networks“. In 2022 American Control Conference (ACC). IEEE, 2022. http://dx.doi.org/10.23919/acc53348.2022.9867357.
Der volle Inhalt der QuelleMalik, Muhammad Ammar, und Moonsoo Kang. „Euclidean distance based label noise cleaning“. In 2017 Ninth International Conference on Ubiquitous and Future Networks (ICUFN). IEEE, 2017. http://dx.doi.org/10.1109/icufn.2017.7993783.
Der volle Inhalt der QuelleKhatir, Mehrdad, Nurendra Choudhary, Sutanay Choudhury, Khushbu Agarwal und Chandan K. Reddy. „A Unification Framework for Euclidean and Hyperbolic Graph Neural Networks“. In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/431.
Der volle Inhalt der Quelle