There are many network topology designs that have emerged to fulfill the growing need for networks to provide a robust platform for a wide range of applications like running businesses and managing emergencies. Amongst the most famous network topology designs are star network, mesh network, hexagonal network, honeycomb network, etc. In a star network, a central computer is linked with various terminals and other computers over point-to-point lines. The other computers and terminals are directly connected to the central computer but (...) not to one another. As such, any failure in the central computer will result in a failure of the entire network and computers in star network will not be able to communicate. The star topology design can be represented by a graph where vertices represent the computer nodes and edges represent the links between the computer nodes. In this paper, we study the vertex-edge-based topological descriptor for a newly designed hexagon star network. (shrink)

Metaphysical graphical structuralism is the view that at some fundamental level the world is a mathematical graph of nodes and edges. Randall Dipert has advanced a graphical structuralist theory of fundamental particulars and Alexander Bird has advanced a graphical structuralist theory of fundamental properties. David Oderberg has posed a powerful challenge to graphical structuralism: that it entails the absurd inexistence of the world or the absurd cessation of all change. In this paper I defend graphical structuralism. A sharper (...) formulation, some theorems about such structures, and careful attention to the interaction of metaphysical and mathematical features, shows that the absurdities depend on assumptions that are not essential to the view and brings to light a surprising fact about the necessary structure of fundamental properties. (shrink)

We point out some connections between existence of homogenous sets for certain edge colorings and existence of branches in certain trees. As a consequence, we get that any locally additive coloring (a notion introduced in the paper) of a cardinal κ has a homogeneous set of size κ provided that the number of colors μ satisfies. Another result is that an uncountable cardinal κ is weakly compact if and only if κ is regular, has the tree property, and for each (...) there exists such that every tree of height μ with λ nodes has less than branches. (shrink)

Precision agriculture is a breakthrough in digital farming technology, which facilitates the application of precise and exact amount of input level of water and fertilizer to the crop at the required time for increasing the yield. Since agriculture relies on direct rainfall than irrigation and the prediction of rainfall date is easily available from web source, the integration of rainfall prediction with precision agriculture helps to regulate the water consumption in farms. In this work, an edge computing model is developed (...) for predicting soil moisture in real time and managing the water usage in accordance with rain prediction. A soil moisture prediction hybrid algorithm has been developed that revolves around the decision-making techniques with live environmental parameters including weather parameters for the prediction of soil moisture through the impact of precipitation. Numerous algorithms with the combination of regression + clustering are estimated, and it is inferred that XGBoost + k-means outperforms other algorithmic combinations that is deployed in edge model. This model is used as an intermediary between the end IoT devices and cloud that results in the saving of computationally intensive processing performed on cloud servers. The servers located on a local edge network perform the developed algorithmic computations. Avoiding transmission over the cloud results in significant latency, response time, and computation power savings and therefore increases the efficiency of data transfer. The proposed edge computing model is implemented in Raspberry Pi as an edge, Heroku as cloud, and edge nodes as the combination of Pi with actuators and sensors. The monitored data from Pi are stored in MongoDB webserver that is controlled by Web dashboard. Finally, the developed model is implemented in cloud and edge where the edge server implementation performs better in terms of latency, bandwidth, throughput, response time, and CPU memory usage. (shrink)

In recent years, while extensive researches on various networks properties have been proposed and accomplished, little has been proposed and done on network robustness and node vulnerability assessment under cascades in directed large-scale online community networks. In essential, an online directed social network is a group-centered and information spread-dominated online platform which is very different from the traditional undirected social network. Some further research studies have indicated that the online social network has high robustness to random removals of nodes (...) but fails to the intentional attacks, particularly to those attacks based on node betweenness or node directed coefficient. To explore on the robustness of directed social network, in this article, we have proposed two novel node centralities of ITG and I M p v. These two new centrality models are designed to capture this cascading effect in directed online social networks. Furthermore, we also propose a new and highly efficient computing method based on iterations for I M p v. Then, with the abundant experiments on the synthetic signed network and real-life networks derived from directed online social media and directed human mobile phone calling network, it has been proved that our ITG and I M p v based on directed social network robustness and node vulnerability assessment method is more accurate, efficient, and faster than several traditional centrality methods such as degree and betweenness. And we also have proposed the solid reasoning and proof process of iteration times k in computation of I M p v. To the best knowledge of us, our research has drawn some new light on the leading edge of robustness on the directed social network. (shrink)

Online social network services have brought a kind of new lifestyle to the world that is parallel to people’s daily offline activities. Social network analysis provides a useful perspective on a range of social computing applications. Social interaction on the Web includes both positive and negative relationships, which is certainly important to social networks. The authors of this article found that the accuracy of the signs of links in the underlying social networks can be predicted. The trust that other users (...) impart on a node is an important attribute of networks. In this article, the authors present a model to compute the prestige of nodes in a trust-based network. The model is based on the idea that trustworthy nodes weigh more. To fulfill this task, the authors first attempt to infer the attitude of one user toward another by predicting signed edges in networks. Then, the authors propose an algorithm to compute the prestige and trustworthiness where the edge weight denotes the trust score. To prove the algorithm’s effectiveness, the authors conducted experiments on the public dataset. Theoretical analysis and experimental results show that this method is efficient and effective. (shrink)

The network-based cooperative information spreading is a widely existing phenomenon in the real world. For instance, the spreading of disease outbreak news and disease prevention information often coexist and interact with each other on the Internet. Promoting the cooperative spreading of information in network-based systems is a subject of great importance in both theoretical and practical perspectives. However, very limited attention has been paid to this specific research area so far. In this study, we propose an effective approach for identifying (...) the influential latent edges which, if added to the original network, can promote the cooperative susceptible-infected-recovered dynamics. To be specific, we first obtain the probabilities of each nodes being in different node states by the message-passing approach. Then, based on the state probabilities of nodes obtained, we come up with an indicator, which incorporates both the information of network topology and the co-SIR dynamics, to measure the influence of each latent edge in promoting the co-SIR dynamics. Thus, the most influential latent edges can be located after ranking all the latent edges according to their quantified influence. We verify the rationality and superiority of the proposed indicator in identifying the influential latent edges of both synthetic and real-world networks by extensive numerical simulations. This study provides an effective approach to identify the influential latent edges for promoting the network-based co-SIR information spreading model and offers inspirations for further research on intervening the cooperative spreading dynamics from the perspective of performing network structural perturbations. (shrink)

With the rapid development of information age, various social groups and corresponding institutions are producing a large amount of information data every day. For such huge data storage and identification, in order to manage such data more efficiently and reasonably, traditional semantic similarity algorithm emerges. However, the accuracy of the traditional semantic similarity algorithm is relatively low, and the convergence of corresponding algorithm is poor. Based on this problem, this paper starts with the conceptual structure of language, analyzes the depth (...) of language structure and the distance between nodes, and analyzes the two levels as the starting point. For the information of a specific data resource description frame type, the weight of interconnected edges is used for impact analysis so as to realize the semantic similarity impact analysis of all information data. Based on the above improvements, this paper also systematically establishes the data information modeling process based on language conceptual structure and establishes the corresponding model. In the experimental part, the improved algorithm is simulated and analyzed. The simulation results show that compared with the traditional algorithm, the algorithm has obvious accuracy improvement. (shrink)

The second volume of “Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond” presents a deep exploration of the progress in uncertain combinatorics through innovative methodologies like graphization, hyperization, and uncertainization. This volume integrates foundational concepts from fuzzy, neutrosophic, soft, and rough set theory, among others, to further advance the field. Combinatorics and set theory, two central pillars of mathematics, focus on counting, arrangement, and the study of collections under defined rules. Combinatorics excels in handling (...) uncertainty, while set theory has evolved with concepts such as fuzzy and neutrosophic sets, which enable the modeling of complex real-world uncertainties by addressing truth, indeterminacy, and falsehood. These advancements, when combined with graph theory, give rise to novel forms of uncertain sets in "graphized" structures, including hypergraphs and superhypergraphs. Innovations such as Neutrosophic Oversets, Undersets, and Offsets, as well as the Nonstandard Real Set, build upon traditional graph concepts, pushing both theoretical and practical boundaries. The synthesis of combinatorics, set theory, and graph theory in this volume provides a robust framework for addressing the complexities and uncertainties inherent in both mathematical and real-world systems, paving the way for future research and application. In the first chapter, “A Review of the Hierarchy of Plithogenic, Neutrosophic, and Fuzzy Graphs: Survey and Applications”, the authors investigate the interrelationships among various graph classes, including Plithogenic graphs, and explore other related structures. Graph theory, a fundamental branch of mathematics, focuses on networks of nodes and edges, studying their paths, structures, and properties. A Fuzzy Graph extends this concept by assigning a membership degree between 0 and 1 to each edge and vertex, representing the level of uncertainty. The Turiyam Neutrosophic Graph is introduced as an extension of both Neutrosophic and Fuzzy Graphs, while Plithogenic graphs offer a potent method for managing uncertainty. The second chapter, “Review of Some Superhypergraph Classes: Directed, Bidirected, Soft, and Rough”, examines advanced graph structures such as directed superhypergraphs, bidirected hypergraphs, soft superhypergraphs, and rough superhypergraphs. Classical graph classes include undirected graphs, where edges lack orientation, and directed graphs, where edges have specific directions. Recent innovations, including bidirected graphs, have sparked ongoing research and significant advancements in the field. Soft Sets and their extension to Soft Graphs provide a flexible framework for managing uncertainty, while Rough Sets and Rough Graphs address uncertainty by using lower and upper approximations to handle imprecise data. Hypergraphs generalize traditional graphs by allowing edges, or hyperedges, to connect more than two vertices. Superhypergraphs further extend this by allowing both vertices and edges to represent subsets, facilitating the modeling of hierarchical and group-based relationships. The third chapter, “Survey of Intersection Graphs, Fuzzy Graphs, and Neutrosophic Graphs”, explores the intersection graph models within the realms of Fuzzy Graphs, Intuitionistic Fuzzy Graphs, Neutrosophic Graphs, Turiyam Neutrosophic Graphs, and Plithogenic Graphs. The chapter highlights their mathematical properties and interrelationships, reflecting the growing number of graph classes being developed in these areas. Intersection graphs, such as Unit Square Graphs, Circle Graphs, and Ray Intersection Graphs, are crucial for understanding complex graph structures in uncertain environments. The fourth chapter, “Fundamental Computational Problems and Algorithms for SuperHyperGraphs”, addresses optimization problems within the SuperHypergraph framework, such as the SuperHypergraph Partition Problem, Reachability, and Minimum Spanning SuperHypertree. The chapter also adapts classical problems like the Traveling Salesman Problem and the Chinese Postman Problem to the SuperHypergraph context, exploring how hypergraphs, which allow hyperedges to connect more than two vertices, can be used to solve complex hierarchical and relational problems. The fifth chapter, “A Short Note on the Basic Graph Construction Algorithm for Plithogenic Graphs”, delves into algorithms designed for Plithogenic Graphs and Intuitionistic Plithogenic Graphs, analyzing their complexity and validity. Plithogenic Graphs model multi-valued attributes by incorporating membership and contradiction functions, offering a nuanced representation of complex relationships. The sixth chapter, “Short Note of Bunch Graph in Fuzzy, Neutrosophic, and Plithogenic Graphs”, generalizes traditional graph theory by representing nodes as groups (bunches) rather than individual entities. This approach enables the modeling of both competition and collaboration within a network. The chapter explores various uncertain models of bunch graphs, including Fuzzy Graphs, Neutrosophic Graphs, Turiyam Neutrosophic Graphs, and Plithogenic Graphs. In the seventh chapter, “A Reconsideration of Advanced Concepts in Neutrosophic Graphs: Smart, Zero Divisor, Layered, Weak, Semi, and Chemical Graphs”, the authors extend several fuzzy graph classes to Neutrosophic graphs and analyze their properties. Neutrosophic Graphs, a generalization of fuzzy graphs, incorporate degrees of truth, indeterminacy, and falsity to model uncertainty more effectively. The eighth chapter, “Short Note of Even-Hole-Graph for Uncertain Graph”, focuses on Even-Hole-Free and Meyniel Graphs analyzed within the frameworks of Fuzzy, Neutrosophic, Turiyam Neutrosophic, and Plithogenic Graphs. The study investigates the structure of these graphs, with an emphasis on their implications for uncertainty modeling. The ninth chapter, “Survey of Planar and Outerplanar Graphs in Fuzzy and Neutrosophic Graphs”, explores planar and outerplanar graphs, as well as apex graphs, within the contexts of fuzzy, neutrosophic, Turiyam Neutrosophic, and plithogenic graphs. The chapter examines how these types of graphs are used to model uncertain parameters and relationships in mathematical and real-world systems. The tenth chapter, “General Plithogenic Soft Rough Graphs and Some Related Graph Classes”, introduces and explores new concepts such as Turiyam Neutrosophic Soft Graphs and General Plithogenic Soft Graphs. The chapter also examines models of uncertain graphs, including Fuzzy, Intuitionistic Fuzzy, Neutrosophic, and Plithogenic Graphs, all designed to handle uncertainty in diverse contexts. The eleventh chapter, “Survey of Trees, Forests, and Paths in Fuzzy and Neutrosophic Graphs”, provides a comprehensive study of Trees, Forests, and Paths within the framework of Fuzzy and Neutrosophic Graphs. This chapter focuses on classifying and analyzing graph structures like trees and paths in uncertain environments, contributing to the ongoing development of graph theory in the context of uncertainty. (shrink)

Neuroscientists are able to detect physical changes in information entropy in the available neurodata. However, the information paradigm is inadequate to describe fully nervous dynamics and mental activities such as perception. This paper suggests explanations to neural dynamics that provide an alternative to thermodynamic and information accounts. We recall the Banach–Tarski paradox, which informally states that when pieces of a ball are moved and rotated without changing their shape, a synergy between two balls of the same volume is achieved instead (...) of the original one. We show how and why BTP might display this physical and biological synergy meaningfully, making it possible to model nervous activities. The anatomical and functional structure of the central nervous system’s nodes and edges makes it possible to perform a sequence of moves inside the connectome that doubles the amount of available cortical oscillations. In particular, a BTP-based mechanism permits scale-invariant nervous oscillations to amplify and propagate towards widely separated brain areas. Paraphrasing the BTP’s definition, we could state that: when a few components of a self-similar nervous oscillation are moved and rotated throughout the cortical connectome, two self-similar oscillations are achieved instead of the original one. Furthermore, based on topological structures, we illustrate how, counterintuitively, the amplification of scale-free oscillations does not require information transfer. (shrink)

Resolving the challenge of flight delays caused by air traffic congestion renders it necessary to explore the mode of congestion propagation. By applying complex network theory, this article establishes a complex network structure where airspace sectors act as nodes, and the edges represent traffic flow relationships between sectors. In addition, a cascading failure model is proposed to analyze the airspace sector network’s invulnerability. The critical threshold and the sector abnormality rate are determined according to the cascading failure measurement (...) indexes. Based on the remaining capacity of sector nodes, two optimization strategies are proposed: adjacent load redistribution strategy and local load redistribution strategy. The simulation results demonstrate that the local load redistribution strategy greatly improves the airspace sector network’s invulnerability to cascading failure. (shrink)

A well-developed perspective in the study of urban systems is that cities are complex systems that manifest as networks of interdependent economic units. These units might be occupations, industries, labor skills, patent technologies, etc. Much research has focused on describing the nature of these networks, quantifying their links, and suggesting applications for policymakers. In this paper, we examine the US skill network, focusing on the relationship between network centrality and economic performance. Here, nodes are represented by individual labor skills, (...) and edge weights are derived from the colocation pattern of skill pairs among 384 US metropolitan statistical areas. The centrality of skills, using three centrality measures, is then aggregated to the occupational and metropolitan level. We find that occupations with higher skill centrality are associated with greater annual salaries, and metropolitan areas with higher skill centrality have higher productivity rates. Overall, these results suggest that the application of traditional network metrics to this view of cities as complex networks can offer new insights into the dynamics of regional economies. (shrink)

We study repeated normal form games where the number of players is large. We argue that it is interesting to look at such games as being divided into subgames, each of which we call a neighbourhood. The structure of such a game is given by a graph G whose nodes are players and edges denote visibility. The neighbourhoods are maximal cliques in G. The game proceeds in rounds where in each round the players of every clique X of (...) G play a strategic form game among each other. A player at a node v strategises based on what she can observe, i.e., the strategies and the outcomes in the previous round of the players at vertices adjacent to v. Based on this, the player may switch strategies in the same neighbourhood, or migrate to another neighbourhood.We are interested in addressing questions regarding the eventual stability of such games. We incrementally impose constraints on the ‘types’ of the players. First, we look at players who are unconstrained in their strategising abilities, in that, players who may use unbounded memory. We then consider the case of memoryless players. We show that in both these cases the eventual stability of the game can be characterised in terms of potentials. We then introduce a simple modal logic in which the types of the players can be specified. We show that when the players play according to these specified types, it can be effectively decided whether the game stabilises. Finally, we look at the important heuristic of imitation. Simple imitative strategies can be specified in the logic introduced by us. We show that in a population of optimisers and imitators, we can decide how ‘worse-off’ the imitators are by playing imitative strategies rather than optimal ones. (shrink)

From the Philosophies journal program, one of the main aims of the journal is to help establish a new unity in diversity in human knowledge, which would include both “Wissen” (i.e., “Wissenschaft”) and “sc¯ıre” (i.e., “science”). As is known, “Wissenshaft” (the pursuit of knowledge, learning, and scholarship) is a broader concept of knowledge than “science”, as it involves all kinds of knowledge,including philosophy, and not exclusively knowledge in the form of directly testable explanations and predictions. The broader notion of scholarship (...) incorporates an understanding and articulation of the role of the learner and the process of the growth of knowledge and its development, rather than only the final product and its verification and validation. In other words, it is a form of knowledge that is inclusive of both short-term and long-term perspectives; it is local and global, critical and hypothetical (speculative), breaking new ground. This new synthesis or rather re-connection of knowledge is expected to resonate with basic human value systems, including cultural values. Since knowledge tends to spontaneously fragment while it grows, we take existing diversity as a resource and a starting point for a new synthesis. The idea of broad, inclusive knowledge is in fact not so new. From the beginning, natural philosophy included all contemporary knowledge about nature. Newton was a natural philosopher, as were Bohr, Einstein, Prigogine, Weizsäcker, and Wheeler—to name but a few. Today, the unifying picture of the natural/physical world is sorely missing among the isolated silos of particular scientific domains, each with its own specific ontologies, methodologies, and epistemologies. From the profound need for connected and common knowledge, new trends towards synthesis have emerged in the last decades. One major theme is complexity, especially when applied to biology or medicine, which helps us to grasp the importance of connectedness between present-day disparate pieces of knowledge—frameworks, theories, approaches, etc. Related to this is the emergence of network science, which studies structures of nodes (actors) and edges as connections between them. This book is connecting work on contemporary natural philosophy and its connections with existing philosophies, sciences and other knowledge fields. (shrink)

In this study, we propose a way to link the scholarly contents of scientific papers by constructing a knowledge graph based on the semantic organization of argumentation units and relations in scientific papers. We carried out an argumentation graph data model aimed at linking multiple discourses, and also developed a semantic annotation platform for scientific papers and an argumentation graph visualization system. A construction experiment was performed using 12 articles. The final argumentation graph has 1,262 nodes and 1,628 (...) class='Hi'>edges, including 1,628 intra-article relations and 190 inter-article relations. Knowledge evolution representation, strategic reading, and automatic abstracting use cases are presented to demonstrate the application of the argumentation graph. In contrast to existing knowledge graphs used in academic fields, the argumentation graph better supports the organization and representation of scientific paper content and can be used as data infrastructure in scientific knowledge retrieval, reorganization, reasoning, and evolution. Moreover, it supports automatic abstract and strategic reading. (shrink)

In a complex network, each edge has different functions on controllability of the whole network. A network may be out of control due to failure or attack of some specific edges. Bridges are a kind of key edges whose removal will disconnect a network and increase connected components. Here, we investigate the effects of removing bridges on controllability of network. Various strategies, including random deletion of edges, deletion based on betweenness centrality, and deletion based on degree of (...) source or target nodes, are used to compare with the effect of removing bridges. It is found that the removing bridges strategy is more efficient on reducing controllability than the other strategies of removing edges for ER networks and scale-free networks. In addition, we also found the controllability robustness under edge attack is related to the average degree of complex networks. Therefore, we propose two optimization strategies based on bridges to improve the controllability robustness of complex networks against attacks. The effectiveness of the proposed strategies is demonstrated by simulation results of some model networks. These results are helpful for people to understand and control spreading processes of epidemic across different paths. (shrink)

Though complex networks have been widely applied in the research of chemistry, there is hardly any introduction about the establishment of networks using chemical bonds. In this paper, we consider chemical elements as a system linked by chemical bonds and create the undirected chemical bond network by abstracting nodes from elements and undirected edges from bonds. Connectivity, heterogeneity, small world and disassortativity of this network show the macro structural rationality of this system. The degree and k-order neighbors of (...) an element, which represent the micro topology of this network, can be used to measure its chemical reactivity and detect how many kinds of compounds it can form. The similarity between two elements is measured by the Jaccard index and the VOS mapping technique, results of which are similar to well-known similarities between elements shown by the periodic table. The establishment and topological analysis of this network provide another way to understand and study elements and bonds, and more chemical properties of elements and bonds can be studied by complex networks. (shrink)

Reasoning and change over inconsistent knowledge bases is of utmost relevance in areas like medicine and law. Argumentation may bring the possibility to cope with both problems. Firstly, by constructing an argumentation framework from the inconsistent KB, we can decide whether to accept or reject a certain claim through the interplay among arguments and counterarguments. Secondly, by handling dynamics of arguments of the AF, we might deal with the dynamics of knowledge of the underlying inconsistent KB. Dynamics of arguments has (...) recently attracted attention and although some approaches have been proposed, a full axiomatization within the theory of belief revision was still missing. A revision arises when we want the argumentation semantics to accept an argument. Argument Theory Change encloses the revision operators that modify the AF by analyzing dialectical trees—arguments as nodes and attacks as edges—as the adopted argumentation semantics. In this article, we present a simple approach to ATC based on propositional KBs. This allows to manage change of inconsistent KBs by relying upon classical belief revision, although contrary to it, consistency restoration of the KB is avoided. Subsequently, a set of rationality postulates adapted to argumentation is given, and finally, the proposed model of change is related to the postulates through the corresponding representation theorem. Though we focus on propositional logic, the results can be easily extended to more expressive formalisms such as first-order logic and description logics, to handle evolution of ontologies. (shrink)

Our scientific theories, like our cognitive structures in general, consist of propositions linked by evidential, explanatory, probabilistic, and logical connections. Those theoretical webs ‘impinge on the world at their edges,’ subject to a continuing barrage of incoming evidence. Our credences in the various elements of those structures change in response to that continuing barrage of evidence, as do the perceived connections between them. Here we model scientific theories as Bayesian nets, with credences at nodes and conditional links between (...) them modelled as conditional probabilities. We update those networks, in terms of both credences at nodes and conditional probabilities at links, through a temporal barrage of random incoming evidence. Robust patterns of punctuated equilibrium, suggestive of ‘normal science’ alternating with ‘paradigm shifts,’ emerge prominently in that change dynamics. The suggestion is that at least some of the phenomena at the core of the Kuhnian tradition are predictable in the typical dynamics of scientific theory change captured as Bayesian nets under even a random evidence barrage. (shrink)

Life history theory is a fruitful source of testable hypotheses about human individual differences. However, this field of study is beset by unresolved debates about basic concepts and methods. One of these controversies concerns the usefulness of instruments that purport to tap a unidimensional life history factor based on a set of self-reported personality, social, and attitudinal variables. Here, we take a novel approach to analyzing the psychometrics of two variants of the Arizona Life History Battery: the Mini-K and the (...) K-SF-42. Psychological network analysis generates models in which psychological variables comprise the nodes of a network, while partial correlation coefficients between these variables comprise the edges of the network. Centrality indices operationalize each node’s importance based on the pattern of the connections in which that node plays a role. Because childhood environments are hypothesized to influence adult LH, we tested the hypothesis that among the Mini-K items, and the K-SF-42 scales, those that tap relationships with parents are central to the networks constructed from these instruments. In an MTurk sample and an undergraduate sample that completed the Mini-K, and an MTurk sample that completed the K-SF-42, this hypothesis was falsified. Indeed, the “relationships with parents” items were among the most peripheral in all three networks. We propose that network analysis, as an alternative to latent variable modeling, offers considerable potential to test hypotheses about the input-output mappings of specific evolved psychological mechanisms. (shrink)

The problem of stability in population dynamics concerns many domains of application in demography, biology, mechanics and mathematics. The problem is highly generic and independent of the population considered (human, animals, molecules,…). We give in this paper some examples of population dynamics concerning nucleic acids interacting through direct nucleic binding with small or cyclic RNAs acting on mRNAs or tRNAs as translation factors or through protein complexes expressed by genes and linked to DNA as transcription factors. The networks made of (...) these interactions between nucleic acids (considered respectively as edges and nodes of their interaction graph) are complex, but exhibit simple emergent asymptotic behaviours, when time tends to infinity, called attractors. We show that the quantity called attractor entropy plays a crucial role in the study of the stability and robustness of such genetic networks. (shrink)

When conversing and collaborating in everyday situations, people naturally and interactively align their behaviors with each other across various communication channels, including speech, gesture, posture, and gaze. Having access to a partner's referential gaze behavior has been shown to be particularly important in achieving collaborative outcomes, but the process in which people's gaze behaviors unfold over the course of an interaction and become tightly coordinated is not well understood. In this paper, we present work to develop a deeper and more (...) nuanced understanding of coordinated referential gaze in collaborating dyads. We recruited 13 dyads to participate in a collaborative sandwich-making task and used dual mobile eye tracking to synchronously record each participant's gaze behavior. We used a relatively new analysis technique—epistemic network analysis—to jointly model the gaze behaviors of both conversational participants. In this analysis, network nodes represent gaze targets for each participant, and edge strengths convey the likelihood of simultaneous gaze to the connected target nodes during a given time-slice. We divided collaborative task sequences into discrete phases to examine how the networks of shared gaze evolved over longer time windows. We conducted three separate analyses of the data to reveal (1) properties and patterns of how gaze coordination unfolds throughout an interaction sequence, (2) optimal time lags of gaze alignment within a dyad at different phases of the interaction, and (3) differences in gaze coordination patterns for interaction sequences that lead to breakdowns and repairs. In addition to contributing to the growing body of knowledge on the coordination of gaze behaviors in joint activities, this work has implications for the design of future technologies that engage in situated interactions with human users. (shrink)

With the growth of online commerce, companies have created virtual communities where users can create posts and reply to posts about the company’s products. VCs can be represented as networks, with users as nodes and relationships between users as edges. Information propagates through edges. In VC studies, it is important to know how the number of topics concerning the product grows over time and what network features make a user more influential than others in the information-spreading process. (...) The existing literature has not provided a quantitative method with which to determine key points during the topic emergence process. Also, few researchers have considered the link between multilayer physical features and the nodes’ spreading influence. In this paper, we present two new ideas to enrich network theory as applied to VCs: a novel application of an adjusted coefficient of determination to topic growth and an adjustment to the Jaccard coefficient to measure the connection between two users. A two-layer network model was first used to study the spread of topics through a VC. A random forest method was then applied to rank various factors that might determine an individual user’s importance in topic spreading through a VC. Our research provides insightful ways for enterprises to mine information from VCs. (shrink)

The role of automated or semiautomated social media accounts, commonly known as “bots,” in social and political processes has gained significant scholarly attention. The current body of research discusses how bots can be designed to achieve specific purposes as well as instances of unexpected negative outcomes of such use. We suggest that the interplay between social media affordances and user practices can result in incidental effects from automated agents. We examined a Twitter network data set with 1,782 nodes and (...) 5,640 edges to demonstrate the engagement and outreach of a retweeting bot called Siripalabot that was popular among Sri Lankan Twitter users. The bot served the simple function of retweeting tweets with hashtags #SriLanka and #lk to its follower network. However, the co-use of #Sri Lanka and/or #lk with #PresPollSL, a hashtag used to discuss politics related to Sri Lanka’s presidential election in 2015, resulted in the bot incidentally amplifying the political voice of less engaged actors. The analysis demonstrated that the bot dominated the network in terms of engagement (out-degree) and the ability to connect distant clusters of actors (betweenness centrality) while more traditional actors, such as the main election candidates and news accounts, indicated more prestige (in-degree) and power (eigenvector centrality). We suggest that the study of automated agents should include designer intentions, the design and behavior of automated agents, user expectations, as well as unintended and incidental effects of interaction. (shrink)

Let G V, E be a simple undirected complete graph with vertex and edge sets V and E, respectively. In this paper, we consider the degree-constrained k -minimum spanning tree problem which consists of finding a minimum cost subtree of G formed with at least k vertices of V where the degree of each vertex is less than or equal to an integer value d ≤ k − 2. In particular, in this paper, we consider degree values of d ∈ (...) 2,3. Notice that DC k MST generalizes both the classical degree-constrained and k -minimum spanning tree problems simultaneously. In particular, when d = 2, it reduces to a k -Hamiltonian path problem. Application domains where DC k MST can be adapted or directly utilized include backbone network structures in telecommunications, facility location, and transportation networks, to name a few. It is easy to see from the literature that the DC k MST problem has not been studied in depth so far. Thus, our main contributions in this paper can be highlighted as follows. We propose three mixed-integer linear programming models for the DC k MST problem and derive for each one an equivalent counterpart by using the handshaking lemma. Then, we further propose ant colony optimization and variable neighborhood search algorithms. Each proposed ACO and VNS method is also compared with another variant of it which is obtained while embedding a Q-learning strategy. We also propose a pure Q-learning algorithm that is competitive with the ACO ones. Finally, we conduct substantial numerical experiments using benchmark input graph instances from TSPLIB and randomly generated ones with uniform and Euclidean distance costs with up to 400 nodes. Our numerical results indicate that the proposed models and algorithms allow obtaining optimal and near-optimal solutions, respectively. Moreover, we report better solutions than CPLEX for the large-size instances. Ultimately, the empirical evidence shows that the proposed Q-learning strategies can bring considerable improvements. (shrink)

Viewing the language of modal logic as a language for describing directed graphs, a natural type of directed graph to study modally is one where the nodes are sets and the edge relation is the subset or superset relation. A well-known example from the literature on intuitionistic logic is the class of Medvedev frames $\langle W,R\rangle$ where $W$ is the set of nonempty subsets of some nonempty finite set $S$, and $xRy$ iff $x\supseteq y$, or more liberally, where $\langle (...) W,R\rangle$ is isomorphic as a directed graph to $\langle \wp(S)\setminus\{\emptyset\},\supseteq\rangle$. Prucnal [32] proved that the modal logic of Medvedev frames is not finitely axiomatizable. Here we continue the study of Medvedev frames with extended modal languages. Our results concern definability. We show that the class of Medvedev frames is definable by a formula in the language of tense logic, i.e., with a converse modality for quantifying over supersets in Medvedev frames, extended with any one of the following standard devices: nominals (for naming nodes), a difference modality (for quantifying over those $y$ such that $x\not= y$), or a complement modality (for quantifying over those $y$ such that $x\not\supseteq y$). It follows that either the logic of Medvedev frames in one of these tense languages is finitely axiomatizable---which would answer the open question of whether Medvedev's [31] "logic of finite problems'' is decidable---or else the minimal logics in these languages extended with our defining formulas are the beginnings of infinite sequences of frame-incomplete logics. (shrink)

In this paper, the optimization of the enterprise HR information system is studied based on IoT first-off technology, the system demand phase is analysed, and the edge control system is designed and built. The hardware and software system and edge node management platform are implemented first, and then the communication scenarios between the edge layer of the system and the sensing layer, the edge layer, and the cloud layer are analysed, and the business type-driven link selection algorithm and the northbound (...) multilink switching algorithm are designed and implemented, respectively, to guarantee the communication reliability between different layers of the system. Based on the implementation of the above functions, the edge control system can meet the intelligence, expandability, and security requirements of IoT applications. An in-depth investigation and research are launched mainly on the enterprise demand to determine the functional requirements and performance requirements of the enterprise and to achieve the basic logical structure; in the system design phase, the system architecture and other aspects of the design are realized. According to the conditions of the system function structure, a number of system module functions are designed in detail. The system is composed of the following modules, namely, personnel change management, organization management, and salary and benefits management. The system consists of the following modules, namely, personnel change management, organization management, compensation and benefits management, and personnel information management. The system modules run through the process of human resource management; in the system implementation stage, the system coding and page operation are realized based on the development tools and software development techniques. The system finally achieves the system design objectives and is put on a trial operation to meet its actual business requirements. (shrink)

The emergence of the virtual network enterprise represents a dynamic response to the crisis of the vertical bureaucracy type of business organisation. However, its key performance criteria—interconnectedness and consistency—pose tremendous challenges as the completion of the distributed tasks of the network must be integrated across the barriers of missing face-to-face clues and cultural differences. The social integration of the virtual network involves the creation of identities of the participating nodes, the building of trust between them, and the sharing of (...) tacit and explicit knowledge among them. The conventional organisation already doing well in these areas seems to have an edge when going virtual. The paper argues that the whole question of management and control must be reconsidered due to the particular circumstances in the ‘Network Society’. The paper outlines a suggestion for an exploratory, socio-technical research approach combining the dimensions of context, subject and action with the twin objectives of contributing to the enhancement of collaborative capabilities in virtual teams as well as improving the insights into the nature of virtual work. (shrink)

A graph-theoretic account of fibring of logics is developed, capitalizing on the interleaving characteristics of fibring at the linguistic, semantic and proof levels. Fibring of two signatures is seen as a multi-graph (m-graph) where the nodes and the m-edges include the sorts and the constructors of the signatures at hand. Fibring of two models is a multi-graph (m-graph) where the nodes and the m-edges are the values and the operations in the models, respectively. Fibring of two (...) deductive systems is an m-graph whose nodes are language expressions and the m-edges represent the inference rules of the two original systems. The sobriety of the approach is confirmed by proving that all the fibring notions are universal constructions. This graph-theoretic view is general enough to accommodate very different fibrings of propositional based logics encompassing logics with non-deterministic semantics, logics with an algebraic semantics, logics with partial semantics and substructural logics, among others. Soundness and weak completeness are proved to be preserved under very general conditions. Strong completeness is also shown to be preserved under tighter conditions. In this setting, the collapsing problem appearing in several combinations of logic systems can be avoided. (shrink)

The Benefits and Potential Harms of Genetic Testing for Huntington's Disease: A Case Study Content Type Journal Article Pages 14-19 Authors Kathryn Edge, BSC, Rheumatic Diseases Centre, CSB, Hope Hospital, The University of Manchester, Stott Lane, Salford M6 8HD, England Journal Human Reproduction & Genetic Ethics Online ISSN 2043-0469 Print ISSN 1028-7825 Journal Volume Volume 14 Journal Issue Volume 14, Number 2 / 2008.

Scientists have attempted several times to define the notion of complexity. A proper definition uses elements of three sets: a set of sites, as set of connections, and a set of nodes coincides with the set. Sites and connections can be translated into terms of graph theory as vertices and edges, which enables to consider complexity as an associated graph.Thus complexity of a system (or a structure) will be defined as the number of possible figures and aspects which (...) are obtained by combining vertices and edges. Complexity is the product of two factors, the first factor is tied to the combination of nodes called mutability and the second is tied to the combination of edges called liability. (shrink)

In this article, I attempt to answer the famous analyses of Benjamin Constant and Isaiah Berlin that the Classical Athenian Democracy had no conception of negative, individual, freedom. I do this by excavating an Athenian democratic concept of individual liberty from Classical Athenian texts. I go on to show that, whilst this has notable links to the later neo-Classical idea of freedom (excavated by the work of Quentin Skinner and Philip Pettit), there are also a number of important differences. This (...) means that we should perhaps stop arguing over whether there are one, or two, or three, concepts of freedom, but investigate instead (and, then, apply, in contemporary political philosophy) different historical uses of the word `'liberty' (as here), though these, interestingly, might well contain a similar basic meaning (of non-interference). (shrink)

«A genuine literary treatment of the soul» is what Eugenio Massa called the brief section of Egidio of Viterbo’s Sentences Commentary that he published in 1954. What Massa published is Egidio’s discussion of part of Peter Lombard’s third distinction in Book I, which bears the title «De imagine et similitudine Trinitatis in anima humana». The main topic at so early a place in the Sentences is not, strictly speaking, the human soul but the divine Trinity. The point of departure is (...) Lombard’s consideration of the soul as analogous to the Trinity; and behind that connection lies Augustine, who presented the soul as an image of the Trinity because he saw in the soul a unity and simplicity of substance but also Platonism’s tripartite divisions. These include, for example, the appetitive, emotional, and rational functions, from the Republic, and Augustine’s subdivision of the rational functions into memory, understanding, and will. This connection between Trinity and human soul, however, gave commentators excellent opportunities not only for theology, discourse about God, but also for psychology, the study of the soul. Descriptions of the human soul initially offered in the theological context became important in their own right. According to Massa, in light of the soul’s being created in God’s image, Egidio was able to make human dignity the major theme even at this early point in the commentary. (shrink)

The author writes:In this project I set out to provide an answer to two fundamental questions of political philosophy. How can human beings live together, in conditions of co-operation over time, enjoying what Immanuel Kant famously called ‘perpetual peace’? And how much individual freedom can we expect to enjoy, and to what degree can we expect that individual freedom to be equal, whilst engaged in the enterprise described by the first question? These may be age-old questions, but I aim, in (...) this project, to offer a new approach to answering them.In part one of this project, I aim to provide a groundwork upon which an answer to these questions can be built. I argue, contrary to much contemporary political philosophy, that the answers to these questions should not be provided by our representatives, a monarch, the elite, or by a process of philosophical abstraction but, instead, by each of us. That is to say, by you, me and everyone else together. Part one argues not only why it should be each of us who are to be engaged in this enterprise, but it also argues on behalf of a number of changes which might support us in this ongoing, and doubtless difficult, human project. I begin by arguing that, if we are to attempt to provide a genuine answer to how much individual freedom we should each be alloted in human society over time, this means that we must begin with the concept of freedom itself which, in turn, means detaching it from the philosophical and epistemological baggage it tends to carry in everyday language. (shrink)

The author writes:In this project I set out to provide an answer to two fundamental questions of political philosophy. How can human beings live together, in conditions of co-operation over time, enjoying what Immanuel Kant famously called ‘perpetual peace’? And how much individual freedom can we expect to enjoy, and to what degree can we expect that individual freedom to be equal, whilst engaged in the enterprise described by the first question? These may be age-old questions, but I aim, in (...) this project, to offer a new approach to answering them.In part two of this project, I aim to actually provide my own answer to the two fundamental questions with which I began and according to the structure I outline in Liberty. Which is to say, this is the answer I provide to you to judge regarding how successfully it answers those age old political questions. In short, I argue that these are the changes in actual, material, human conditions - the necessary set of ‘alterable human practices’ to borrow a phrase of Isaiah Berlin’s - required to create an enduring, desirable and just ‘perpetual peace’ on earth. In other words, this is not, in Kant’s phrase, a ‘philosophical sketch’ on how perpetual peace might be attained, but, by focusing on the everyday, material, relationships and conditions which create and foster conflict and injustice across the globe today, I hope to provide a ‘material sketch’ as to how human beings might live in successfully together in conditions of peaceful cooperation and freedom over time. (shrink)

This piece extends Edward Casey’s meditations on the notion of place. Here he specifically looks at “limitrophic” phenomena, including the U.S.-Mexico border as a means for thinking between edge and limit, place and voice.

Although much evidence indicates that young infants perceive unitary objects by analyzing patterns of motion, infantsÕ abilities to perceive object unity by analyzing Gestalt properties and by integrating distinct views of an object over time are in dispute. To address these controversies, four experiments investigated adultsÕ and infantsÕ perception of the unity of a center-occluded, moving rod with misaligned visible edges. Both alignment information and depth information affected adultsÕ and infantsÕ perception of object unity in similar ways, and infants (...) perceived object unity by integrating information about object features over time. However, infants perceived a moving, misaligned, three-dimensional object as indeterminate in its connectedness, whereas adults perceived it as connected behind the occluder. These findings indicate that the effectiveness of common motion in specifying unified surfaces across an occluder is reduced by misalignment of edges. Alignment information enhances perception of object unity either by serving directly as information for unity or by optimizing the detectability of motion-carried information for unity. In addition, young infants are able to retain information about edge orientation over short intervals in determining connectedness via a process of spatiotemporal integration. Ó 2003 Elsevier Science (USA). All rights reserved. (shrink)

The subject of this article is Neil Jordan's film The Crying Game. Released in 1992, it was widely received as a film that challenged stereotypes in relation to both the IRA and questions of race, sexuality and desire. This article calls into question such a radical reading by analysing the way in which Jude the IRA woman is represented. Through a feminist deconstruction, the article proposes that the character of Jude can be seen to represent both national and international anxieties (...) concerning contemporary masculine and feminine subject positions. The article plots this by investigating how the film deals with the specifics of gender and Irish nationalism. It then moves on to consider how these specifics can be seen to articulate international postmodern concerns about contemporary gender identities. (shrink)

Our paper examines the impact of the intersection of cultural and gender identity on moral reasoning. Much research has been done on gender differences in moral thinking/reasoning, and increasingly research has also examined cultural differences in moral thinking. In agreement with a number of scholars we support the following claims about culture, moral reasoning, and concepts of self: concepts of self and approaches to moral reasoning are connected, concepts of self are differing by gender and culture, moral reasoning differs by (...) gender and culture. We propose that philosophy, particularly moral philosophy, follow the lead of psychology and strive to be as inclusive as possible by including the full range of human diversity and experience. For philosophers, this would mean embracing – indeed, starting from – a multicultural, feminist approach to moral theories and questions; this approach would not only be sensitive to gender and cultural bias, but also offer an alternative model to the paradigmatic rational, autonomous, independent agent of traditional moral theory. The implications of this go far beyond moral reasoning, but also have implications for other areas of philosophy as well, such as recent work in philosophy of mind on the idea of extended cognition. (shrink)

I shall compare two views of legal concepts: as nodes in inferential nets and as categories in an ontology (a conceptual architecture). Firstly, I shall introduce the inferential approach, consider its implications, and distinguish the mere possession of an inferentially defined concept from the belief in the concept’s applicability, which also involves the acceptance of the concept’s constitutive inferences. For making this distinction, the inferential and eliminative analysis of legal concepts proposed by Alf Ross will be connected to the (...) views on theoretical concepts in science advanced by Frank Ramsey and Rudolf Carnap. Consequently, the mere comprehension of a legal concept will be distinguished from the application of the concept to a particular legal system, since application presupposes a doctrinal commitment, namely, the belief that the inferences constituting the concept hold in that system. Then, I shall consider how concepts can be characterised by defining the corresponding terms and placing them within an ontology. Finally, I shall argue that there is a tension between the inferential and the ontological approach, but that both need to be taken into account, to capture the meaning and the cognitive function of legal concepts. (shrink)