Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (7)
- Physical Sciences and Mathematics (7)
- Algebra (2)
- Artificial Intelligence and Robotics (2)
- Electrical and Computer Engineering (2)
-
- Logic and Foundations (2)
- Mathematics (2)
- Numerical Analysis and Scientific Computing (2)
- Operations Research, Systems Engineering and Industrial Engineering (2)
- Other Computer Engineering (2)
- Other Computer Sciences (2)
- Other Mathematics (2)
- Systems Science (2)
- Administrative Law (1)
- Business (1)
- Business Administration, Management, and Operations (1)
- Communication (1)
- Communication Technology and New Media (1)
- Communications Law (1)
- Computer Law (1)
- Digital Communications and Networking (1)
- Law (1)
- Organizations Law (1)
- Public Affairs, Public Policy and Public Administration (1)
- Science and Technology Law (1)
- Science and Technology Policy (1)
- Science and Technology Studies (1)
- Social and Behavioral Sciences (1)
- Institution
- Publication
- Publication Type
Articles 1 - 9 of 9
Full-Text Articles in Computer Engineering
Mocmin: Convex Inferring Of Modular Low-Rank Contact Networks Over Covid Diffusion Data, Emre Sefer
Mocmin: Convex Inferring Of Modular Low-Rank Contact Networks Over Covid Diffusion Data, Emre Sefer
Turkish Journal of Electrical Engineering and Computer Sciences
SEIR (which consists of susceptible, exposed, infected, and recovered states) is a common diffusion model which could model different disease propagation dynamics across various domains such as influenza and COVID diffusion. As a motivation, across these domains, observing the node states is relatively easier than observing the network edges over which the diffusion is taking place, or it may not even be possible to observe the underlying network. This paper focuses on the problem of predicting modular low-rank human contact network edges only if a SEIR diffusion dynamics spreading among the human on their contact network can be observed. Such …
A New Network-Based Community Detection Algorithm For Disjoint Communities, Peli̇n Çeti̇n, Şahi̇n Emrah Amrahov
A New Network-Based Community Detection Algorithm For Disjoint Communities, Peli̇n Çeti̇n, Şahi̇n Emrah Amrahov
Turkish Journal of Electrical Engineering and Computer Sciences
A community is a group of people that shares something in common. The definition of the community can be generalized as things that have common properties. By using this definition, community detection can be used to solve different problems in various areas. In this study, we propose a new network-based community detection algorithm that can work on different types of datasets. The proposed algorithm works on unweighted graphs and determines the weight by using cosine similarity. We apply a bottom-up approach and find the disjoint communities. First, we accept each node as an independent community. Then, the merging process is …
Hierarchical Agglomerative Community Detection Algorithm Based On Similarity Modularity, Wenwei Zhan, Jingke Xi, Zhixiao Wang
Hierarchical Agglomerative Community Detection Algorithm Based On Similarity Modularity, Wenwei Zhan, Jingke Xi, Zhixiao Wang
Journal of System Simulation
Abstract: Fast Unfolding is a hierarchical community detection algorithm based on modularity. It runs very fast, but the accuracy needs to be improved. Because the algorithm adopts traditional modularity to merger communities, it only considers node link information and ignores the neighbor nodes. Therefore, two nodes that have common neighbors and weak link information may not be merged, thus affecting the accuracy. In view of the shortcomings, a hierarchical agglomerative community detection algorithm based on similarity modularity was proposed through introducing optimized similarity to improve the modularity. It adopts NMI as the accuracy measurement. Experiments on the real network …
Clustering Method Based On Graph Data Model And Reliability Detection, Yanyun Cheng, Huisong Bian, Changsheng Bian
Clustering Method Based On Graph Data Model And Reliability Detection, Yanyun Cheng, Huisong Bian, Changsheng Bian
Journal of System Simulation
Abstract: For the data in feature space, traditional clustering algorithm can take clustering analysis directly. High-dimensional spatial data cannot achieve intuitive and effective graphical visualization of clustering results in 2D plane. Graph data can clearly reflect the similarity relationship between objects. According to the distance of the data objects, the feature space data are modeled as graph data by iteration. Cluster analysis based on modularity is carried out on the modeling graph data. The two-dimensional visualization of non-spherical-shape distribution data cluster and result is achieved. The concept of credibility of the clustering result is proposed, and a method is proposed, …
Mapcom Self-Service Portal, Kelsey Bullock, Viet Nguyen, Alvenia Weathers
Mapcom Self-Service Portal, Kelsey Bullock, Viet Nguyen, Alvenia Weathers
Capstone Design Expo Posters
Mapcom Systems is a software development firm that primarily serves small, rural telecommunications companies. The company is widely recognized for developing M4 Solutions, a visual operations platform that allows service providers to manage their workforce. Our team was tasked with the design and implementation of a self-service portal to be used by the customers of these telecommunications companies. The application would allow customers to easily manage their accounts, including creating and managing trouble tickets, communicating with their assigned technician, and viewing their scheduled appointments. Additionally, it would be offered across three different platforms: Web, Android, and iOS. In order to …
A Faster Version Of Louvain Method For Community Detection For Efficient Modeling And Analytics Of Cyber Systems, Sunanda Vivek Shanbhaq
A Faster Version Of Louvain Method For Community Detection For Efficient Modeling And Analytics Of Cyber Systems, Sunanda Vivek Shanbhaq
Open Access Theses
Cyber networks are complex networks with various hosts forming the entities of the network and the communication between them forming the edges of the network. Most cyber networks exhibit a community structure. A community is a group of nodes that are densely connected with each other as compared to other nodes in the network. Representing an IP network in the form of communities helps in viewing the network from different levels of granularity and makes the visualization of the network cleaner and more pleasing to the eye. This will help significantly in cyber attack detection in large scale cyber networks. …
Multi-Type Display Calculus For Dynamic Epistemic Logic, Sabine Frittella, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano, Vlasta Sikimić
Multi-Type Display Calculus For Dynamic Epistemic Logic, Sabine Frittella, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano, Vlasta Sikimić
Engineering Faculty Articles and Research
In the present paper, we introduce a multi-type display calculus for dynamic epistemic logic, which we refer to as Dynamic Calculus. The displayapproach is suitable to modularly chart the space of dynamic epistemic logics on weaker-than-classical propositional base. The presence of types endows the language of the Dynamic Calculus with additional expressivity, allows for a smooth proof-theoretic treatment, and paves the way towards a general methodology for the design of proof systems for the generality of dynamic logics, and certainly beyond dynamic epistemic logic. We prove that the Dynamic Calculus adequately captures Baltag-Moss-Solecki’s dynamic epistemic logic, and enjoys Belnap-style cut …
Product Life Cycle Theory And The Maturation Of The Internet, Christopher S. Yoo
Product Life Cycle Theory And The Maturation Of The Internet, Christopher S. Yoo
All Faculty Scholarship
Much of the recent debate over Internet policy has focused on the permissibility of business practices that are becoming increasingly common, such as new forms of network management, prioritization, pricing, and strategic partnerships. This Essay analyzes these developments through the lens of the management literature on the product life cycle, dominant designs, technological trajectories and design hierarchies, and the role of complementary assets in determining industry structure. This analysis suggests that many of these business practices may represent nothing more than a reflection of how the nature of competition changes as industries mature. This in turn suggests that network neutrality …
Definability, Canonical Models, And Compactness For Finitary Coalgebraic Modal Logic, Alexander Kurz, Dirk Pattinson
Definability, Canonical Models, And Compactness For Finitary Coalgebraic Modal Logic, Alexander Kurz, Dirk Pattinson
Engineering Faculty Articles and Research
This paper studies coalgebras from the perspective of the finitary observations that can be made of their behaviours. Based on the terminal sequence, notions of finitary behaviours and finitary predicates are introduced. A category Behω(T) of coalgebras with morphisms preserving finitary behaviours is defined. We then investigate definability and compactness for finitary coalgebraic modal logic, show that the final object in Behω(T) generalises the notion of a canonical model in modal logic, and study the topology induced on a coalgebra by the finitary part of the terminal sequence.