Letteratura scientifica selezionata sul tema "Attachment network"
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 "Attachment network".
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 "Attachment network"
Haryono, Haryono, Mukhtar Mukhtar, Titik Sumarti, Didin S. Damanhuri e Sofyan Sjaf. "Embeddedness of Economic Actions in the Social Network: Study among of Local Genuine Entrepreneurship in Cirebon, West Java". JSW (Jurnal Sosiologi Walisongo) 6, n. 1 (30 aprile 2022): 29–42. http://dx.doi.org/10.21580/jsw.2022.6.1.8023.
Testo completoGillath, Omri, Gery C. Karantzas e Emre Selcuk. "A Net of Friends: Investigating Friendship by Integrating Attachment Theory and Social Network Analysis". Personality and Social Psychology Bulletin 43, n. 11 (24 luglio 2017): 1546–65. http://dx.doi.org/10.1177/0146167217719731.
Testo completoTameirão, Cinthya Rocha, Sérgio Fernando Loureiro Rezende e Luciana Pereira de Assis. "Ligação Preferencial e Aptidão na Evolução da Rede de Filmes Brasileiros". Organizações & Sociedade 28, n. 99 (dicembre 2021): 888–916. http://dx.doi.org/10.1590/1984-92302021v28n9907pt.
Testo completoSiew, Cynthia S. Q., e Michael S. Vitevitch. "Investigating the Influence of Inverse Preferential Attachment on Network Development". Entropy 22, n. 9 (15 settembre 2020): 1029. http://dx.doi.org/10.3390/e22091029.
Testo completoAdam, Diyawu Rahman, Kwame Simpe Ofori, Abednego Feehi Okoe e Henry Boateng. "Effects of structural and bonding-based attachment on brand loyalty". African Journal of Economic and Management Studies 9, n. 3 (3 settembre 2018): 305–18. http://dx.doi.org/10.1108/ajems-10-2017-0252.
Testo completoScharfe, Elaine. "Hitting the bull’s eye: Attachment representations and the organization of social networks". Interpersona: An International Journal on Personal Relationships 14, n. 1 (2 luglio 2020): 15–27. http://dx.doi.org/10.5964/ijpr.v14i1.3919.
Testo completoRak, Rafał, e Ewa Rak. "The Fractional Preferential Attachment Scale-Free Network Model". Entropy 22, n. 5 (29 aprile 2020): 509. http://dx.doi.org/10.3390/e22050509.
Testo completoANTUNOVIĆ, TONĆI, ELCHANAN MOSSEL e MIKLÓS Z. RÁCZ. "Coexistence in Preferential Attachment Networks". Combinatorics, Probability and Computing 25, n. 6 (9 febbraio 2016): 797–822. http://dx.doi.org/10.1017/s0963548315000383.
Testo completoTameirão, Cinthya Rocha, Sérgio Fernando Loureiro Rezende e Luciana Pereira de Assis. "Preferential Attachment and Fitness in the Evolution of the Brazilian Film Network". Organizações & Sociedade 28, n. 99 (dicembre 2021): 888–916. http://dx.doi.org/10.1590/1984-92302021v28n9907en.
Testo completoShang, Yilun. "Limit of a nonpreferential attachment multitype network model". International Journal of Modern Physics B 31, n. 05 (9 febbraio 2017): 1750026. http://dx.doi.org/10.1142/s0217979217500266.
Testo completoTesi sul tema "Attachment network"
Belinkov, Yonatan. "Neural network architectures for Prepositional Phrase attachment disambiguation". Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/91147.
Testo completoThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
25
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 41-44).
This thesis addresses the problem of Prepositional Phrase (PP) attachment disambiguation, a key challenge in syntactic parsing. In natural language sentences, a PP may often be attached to several possible candidates. While humans can usually identify the correct candidate successfully, syntactic parsers are known to have high error rated on this kind of construction. This work explores the use of compositional models of meaning in choosing the correct attachment location. The compositional model is defined using a recursive neural network. Word vector representations are obtained from large amounts of raw text and fed into the neural network. The vectors are first forward propagated up the network in order to create a composite representation, which is used to score all possible candidates. In training, errors are back-propagated down the network such that the composition matrix is updated from the supervised data. Several possible neural architectures are designed and experimentally tested in both English and Arabic data sets. As a comparative system, we offer a learning-to-rank algorithm based on an SVM classifier which has access to a wide range of features. The performance of this system is compared to the compositional models.
by Yonatan Belinkov.
S.M. in Computer Science and Engineering
Ouellette, David M. "The Social Network and Attachment Bases of Loneliness". VCU Scholars Compass, 2004. http://scholarscompass.vcu.edu/etd/949.
Testo completoAbdelzaher, Ahmed F. "Identifying Parameters for Robust Network Growth using Attachment Kernels: A case study on directed and undirected networks". VCU Scholars Compass, 2016. http://scholarscompass.vcu.edu/etd/4481.
Testo completoTsipenyuk, Gregory. "Evaluation of decentralized email architecture and social network analysis based on email attachment sharing". Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/273963.
Testo completoZheng, Huanyang. "SOCIAL NETWORK ARCHITECTURES AND APPLICATIONS". Diss., Temple University Libraries, 2017. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/470889.
Testo completoPh.D.
Rather than being randomly wired together, the components of complex network systems are recently reported to represent a scale-free architecture, in which the node degree distribution follows power-law. While social networks are scale-free, it is natural to utilize their structural properties in some social network applications. As a result, this dissertation explores social network architectures, and in turn, leverages these architectures to facilitate some influence and information propagation applications. Social network architectures are analyzed in two different aspects. The first aspect focuses on the node degree snowballing effects (i.e., degree growth effects) in social networks, which is based on an age-sensitive preferential attachment model. The impact of the initial links is explored, in terms of accelerating the node degree snowballing effects. The second aspect focuses on Nested Scale-Free Architectures (NSFAs) for social networks. The scale-free architecture is a classic concept, which means that the node degree distribution follows the power-law distribution. `Nested' indicates that the scale-free architecture is preserved when low-degree nodes and their associated connections are iteratively removed. NSFA has a bounded hierarchy. Based on the social network structure, this dissertation explores two influence propagation applications for the Social Influence Maximization Problem (SIMP). The first application is a friend recommendation strategy with the perspective of social influence maximization. For the system provider, the objective is to recommend a fixed number of new friends to a given user, such that the given user can maximize his/her social influence through making new friends. This problem is proved to be NP-hard by reduction from the SIMP. A greedy friend recommendation algorithm with an approximation ratio of $1-e^{-1}$ is proposed. The second application studies the SIMP with the crowd influence, which is NP-hard, monotone, non-submodular, and inapproximable in general graphs. However, since user connections in Online Social Networks (OSNs) are not random, approximations can be obtained by leveraging the structural properties of OSNs. The modularity, denoted by $\Delta$, is proposed to measure to what degree this problem violates the submodularity. Two approximation algorithms are proposed with ratios of $\frac{1}{\Delta+2}$ and $1-e^{-1/(\Delta+1)}$, respectively. Beside the influence propagation applications, this dissertation further explores three different information propagation applications. The first application is a social network quarantine strategy, which can eliminate epidemic outbreaks with minimal isolation costs. This problem is NP-hard. An approximation algorithm with a ratio of 2 is proposed through utilizing the problem properties of feasibility and minimality. The second application is a rating prediction scheme, called DynFluid, based on the fluid dynamics. DynFluid analogizes the rating reference among the users in OSNs to the fluid flow among containers. The third application is an information cascade prediction framework: given the social current cascade and social topology, the number of propagated users at a future time slot is predicted. To reduce prediction time complexities, the spatiotemporal cascade information (a larger size of data) is decomposed to user characteristics (a smaller size of data) for subsequent predictions. All these three applications are based on the social network structure.
Temple University--Theses
Ouellette, David M. "Shadows on the Cave Wall: The Cognitive Accuracy of Social Network Perception". VCU Scholars Compass, 2008. http://hdl.handle.net/10156/2249.
Testo completoBerg, Junker Maria Constance. "Neural correlates of romantic love and romantic attachment". Thesis, Högskolan i Skövde, Institutionen för biovetenskap, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-16055.
Testo completoWoolford, Brittany. "Adolescent's Social Networking Use and Its Relationship to Attachment and Mental Health". Thesis, University of North Texas, 2016. https://digital.library.unt.edu/ark:/67531/metadc955025/.
Testo completoDabkowski, Matthew Francis. "Using Network Science to Estimate the Cost of Architectural Growth". Diss., The University of Arizona, 2016. http://hdl.handle.net/10150/612431.
Testo completoUnderwood, Heather, e hjocat@bigpond com. "Who goes there? : demographics, personality and attachment style of those involved in internet affairs". Swinburne University of Technology, 2005. http://adt.lib.swin.edu.au./public/adt-VSWT20051124.091812.
Testo completoLibri sul tema "Attachment network"
Sinclair, Elizabeth Afua. Attachment and separation within the extended family network. Uxbridge: Brunel University, 1993.
Cerca il testo completoWang, Lu, Kaishun Wu e Mounir Hamdi. Attachment Transmission in Wireless Networks. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-04909-0.
Testo completoInternational Business Machines Corporation. International Technical Support Organization, a cura di. IBM TS3500 tape library with System Z attachment: A practical guide to Enterprise tape drives and TS3500 tape automation. 4a ed. [Poughkeepsie, NY]: IBM, International Technical Support Organization, 2008.
Cerca il testo completoIEEE Computer Society. Technical Committee on Computer Communications. e American National Standards Institute, a cura di. Supplements to Carrier sense multiple access with collision detection (CSMA/CD) access method and physical layer specifications: ANSI/IEEE 802.3a-1988, medium attachment unit and baseband medium specifications, type 10BASE2 (section 10) ... : IEEE standards for local area networks. New York, NY, USA: Institute of Electrical and Electronics Engineers, 1987.
Cerca il testo completoInstitute, American National Standards. Supplements to Carrier sense multiple access with collision detection (CSMA/CD) access method and physical layer specifications: ANSI/IEEE 802.3a-1988, medium attachment unit and baseband medium specifications, type 10BASE2 (section 10) ... : IEEEstandards for local area networks. New York, NY, USA: Institute of Electrical and Electronics Engineers, 1987.
Cerca il testo completoNewman, Mark. Models of network formation. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198805090.003.0013.
Testo completoCoolen, A. C. C., A. Annibale e E. S. Roberts. Network growth algorithms. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198709893.003.0008.
Testo completoAttachment Transmission in Wireless Networks. Springer International Publishing AG, 2014.
Cerca il testo completoWu, Kaishun, Lu Wang e Mounir Hamdi. Attachment Transmission in Wireless Networks. Springer London, Limited, 2014.
Cerca il testo completoTavecchio, L. W. C., e M. H. van IJzendoorn. Attachment in Social Networks: Contributions to the Bowlby-Ainsworth Attachment Theory. Elsevier Science & Technology Books, 1987.
Cerca il testo completoCapitoli di libri sul tema "Attachment network"
Dereich, Steffen. "The Rank-One and the Preferential Attachment Paradigm". In Network Science, 43–58. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-26814-5_4.
Testo completoGillath, Omri, e Gery Karantzas. "Insights into the Formation of Attachment Bonds from a Social Network Perspective". In Bases of Adult Attachment, 131–56. New York, NY: Springer New York, 2015. http://dx.doi.org/10.1007/978-1-4614-9622-9_7.
Testo completoHermans, Audrey, Selma Muhammad e Jan Treur. "An Adaptive Network Model of Attachment Theory". In Computational Science – ICCS 2021, 462–75. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-77967-2_39.
Testo completoArdickas, Daumilas, e Mindaugas Bloznelis. "Clustering Coefficient of a Preferred Attachment Affiliation Network". In Lecture Notes in Computer Science, 82–95. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-48478-1_6.
Testo completoYang, Yang, Shuyuan Jin, Yang Zuo e Jin Xu. "Online Social Network Model Based on Local Preferential Attachment". In Web Technologies and Applications, 35–46. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11119-3_4.
Testo completoAzadbakht, Keyvan, Nikolaos Bezirgiannis e Frank S. de Boer. "Distributed Network Generation Based on Preferential Attachment in ABS". In SOFSEM 2017: Theory and Practice of Computer Science, 103–15. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-51963-0_9.
Testo completoShang, Rang-An, Yu-Chen Chen e Je-Wei Chang. "Individual Attachment Style, Self-disclosure, and How People use Social Network". In Communications in Computer and Information Science, 45–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-48319-0_4.
Testo completoAbbasi, Alireza, e Liaquat Hossain. "Investigating Attachment Behavior of Nodes during Evolution of a Complex Social Network:". In Knowlege-Based and Intelligent Information and Engineering Systems, 256–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23863-5_26.
Testo completoShera, Shailendra Singh, Shraddha Sahu e Rathindra Mohan Banik. "Artificial Neural Network Modeling to Predict Bacterial Attachment on Composite Biopolymeric Scaffold". In Advances in Polymer Sciences and Technology, 65–74. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-2568-7_7.
Testo completoMarkovich, Natalia M., e Udo R. Krieger. "The PageRank Vector of a Scale-Free Web Network Growing by Preferential Attachment". In Lecture Notes in Computer Science, 24–31. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92507-9_3.
Testo completoAtti di convegni sul tema "Attachment network"
Rinta-aho, Teemu, Rui Campos, Andras Mehes, Ulrike Meyer, Joachim Sachs e Goran Selander. "Ambient Network Attachment". In 2007 16th IST Mobile and Wireless Communications Summit. IEEE, 2007. http://dx.doi.org/10.1109/istmwc.2007.4299184.
Testo completoSosnowska, Jadwiga, e Oskar Skibski. "Attachment Centrality for Weighted Graphs". In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/59.
Testo completoAtwood, James, Bruno Ribeiro e Don Towsley. "Efficient network generation under general preferential attachment". In the 23rd International Conference. New York, New York, USA: ACM Press, 2014. http://dx.doi.org/10.1145/2567948.2579357.
Testo completoKjallman, J. "Attachment to a Native Publish/Subscribe Network". In 2009 IEEE International Conference on Communications Workshops. IEEE, 2009. http://dx.doi.org/10.1109/iccw.2009.5207971.
Testo completoMiao Li, Hui Wang e Jiahai Yang. "Flattening and preferential attachment in the internet evolution". In 2012 14th Asia-Pacific Network Operations and Management Symposium (APNOMS). IEEE, 2012. http://dx.doi.org/10.1109/apnoms.2012.6356080.
Testo completoCloteaux, Brian, e Vladimir Marbukh. "SIS Contagion Avoidance on a Network Growing by Preferential Attachment". In the 2nd Joint International Workshop. New York, New York, USA: ACM Press, 2019. http://dx.doi.org/10.1145/3327964.3328502.
Testo completoChoi, Jin Seek. "Signaling and Control Requirements of Network Attachment Control Function for NGN". In COIN-NGNCON 2006 - The Joint International Conference on Optical Internet and Next Generation Network. IEEE, 2006. http://dx.doi.org/10.1109/coinngncon.2006.4454499.
Testo completoBhattacharya, Arpita, Sourav Das, Avijit Gayen e Nilotpal Chakraborty. "HAP: Hierarchical attachment process for mobile nodes in nested network mobility". In 2017 IEEE Region 10 Symposium (TENSYMP). IEEE, 2017. http://dx.doi.org/10.1109/tenconspring.2017.8070047.
Testo completoLiu, Chang, Junhong Guo, Peiqiang Liu e Wangmin Cai. "Identifying protein complexes based on core-attachment from weighted dynamic network". In International Conference on Cloud Computing, Internet of Things, and Computer Applications, a cura di Warwick Powell e Amr Tolba. SPIE, 2022. http://dx.doi.org/10.1117/12.2642635.
Testo completoChen, Yaoran, Yuanyuan Zhu, Ming Zhong e Juan Liu. "COMNA: Core-attachment based protein complex detection via multiple network alignment". In 2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM). IEEE, 2021. http://dx.doi.org/10.1109/bibm52615.2021.9669342.
Testo completoRapporti di organizzazioni sul tema "Attachment network"
Aboba, B., J. Carlson e S. Cheshire. Detecting Network Attachment in IPv4 (DNAv4). RFC Editor, marzo 2006. http://dx.doi.org/10.17487/rfc4436.
Testo completoDaley, G. Goals of Detecting Network Attachment in IPv6. RFC Editor, agosto 2005. http://dx.doi.org/10.17487/rfc4135.
Testo completoKrishnan, S., e G. Daley. Simple Procedures for Detecting Network Attachment in IPv6. RFC Editor, novembre 2010. http://dx.doi.org/10.17487/rfc6059.
Testo completoMontavont, N., E. Njedjou e S. Veerepalli. Link-Layer Event Notifications for Detecting Network Attachments. A cura di S. Krishnan e A. Yegin. RFC Editor, agosto 2007. http://dx.doi.org/10.17487/rfc4957.
Testo completoChen-Zion, Ayal, e James Rauch. History Dependence, Cohort Attachment, and Job Referrals in Networks of Close Relationships. Cambridge, MA: National Bureau of Economic Research, ottobre 2019. http://dx.doi.org/10.3386/w26358.
Testo completoPerumalla, Kalyan S., e Maksudul Alam. Generating Billion-Edge Scale-Free Networks in Seconds: Performance Study of a Novel GPU-based Preferential Attachment Model. Office of Scientific and Technical Information (OSTI), ottobre 2017. http://dx.doi.org/10.2172/1399438.
Testo completo