scispace - formally typeset
Search or ask a question
Topic

Network theory

About: Network theory is a research topic. Over the lifetime, 2257 publications have been published within this topic receiving 109864 citations.


Papers
More filters
Proceedings ArticleDOI
Qingyu Zou1, Jing Bai1, Liyun Xing1, Baisheng Liu1, Zhenxiong Zhou1 
27 Jul 2016
TL;DR: An exhaustive topological analysis of the teaching evaluation network of “VC++ program design” course, focusing on the statistical characterization of degree and closeness centrality is presented.
Abstract: Under the perspectives of network science and modern educational science, the complex network model is a better tool for teaching evaluation then the context of traditional evaluation methods, whose potential mainly unexplored yet. In this work, we propose a new method to construct teaching evaluation network model based on complex network theory. Furthermore, the proposed method is evaluated on the “VC++ program design” course. We present an exhaustive topological analysis of the teaching evaluation network of “VC++ program design” course, focusing on the statistical characterization of degree and closeness centrality. The results demonstrate that the vast majority of students received similar learning outcomes, while there is a small received excellent learning outcomes. These results are the same as the practical situation. We believe that the newly assembled model, which is a weight complex network, can provide valuable hints of teaching evaluation.

1 citations

01 Jan 1992
TL;DR: It is shown that any such propositional network default theory can be compiled in polynomial time into a classical propositional theory such that the set of models of the latter coincides with theSet of extensions of the former.
Abstract: Author(s): Ben-Eliyahu, Rachel; Dechter, Rina | Abstract: This paper focuses on network default theories. Etherington [Etherington, 1987] has established a correspondence between inheritance networks with exceptions and a subset of Reiters default logic called network default theories, thus providing a formal semantics and a notion of correct inference for such networks. We show that any such propositional network default theory can be compiled in polynomial time into a classical propositional theory such that the set of models of the latter coincides with the set of extensions of the former. We then show how constraint satisfaction techniques can be used to compute extensions and to identify tractable network default theories. For any propositional network theory, our algorithms compute all its extensions and verifies if a given conclusion is in one or all extensions.

1 citations

Journal Article
Jia Chun-xu1
TL;DR: The structure of central community of urban public traffic network of Lanzhou was analyzed with this method and its result indicated that the central community would play a central role in the whole network.
Abstract: By using combined method of degree centrality and flow-between centrality,the degree centrality and flow-between centrality of the nodes were computed first and then,the geometric center of the network and the node with the most routing through it in course of transmission of information and substances or energies on the network would be obtainedTaking these two indices as a whole into consideration,the nodes with these two indices of comparatively large magnitude were obtainedTherefore,the central community on the network could be discovered from among these and neighboring nodes by using CPM discovery algorithm of central communityBy using this method,the relatively "important" community of the network could be found and this would have certain significance for analysis of the spreading mechanism on the complex network,and successive failureFinally,the structure of central community of urban public traffic network of Lanzhou was analyzed with this method and its result indicated that the central community would play a central role in the whole network

1 citations

Reference EntryDOI
15 Feb 2011
TL;DR: The classical exponential networks of Jackson and Gordon and Newell and their successor networks and extensions in network theory are described and some networks with additional features that broaden the range of applicability of the networks are described.
Abstract: We describe the classical exponential networks of Jackson and Gordon and Newell and their successor networks and extensions in network theory. The characterizing feature of these networks is the product form steady-state distribution for the joint queue length process, which we evaluate in detail. We characterize passage time behavior for customers traversing the networks or parts of it. This relies on finding the distributions, which characterizes the situation when such a passage commences. We sketch typical algorithmic methods to efficiently compute performance indices for the networks in steady state. Finally, we describe some networks with additional features that broaden the range of applicability of the networks. Keywords: meanvalue analysis; arrival theorem; routing; multiserver queues; Gordon–Newell network; sojourn time distribution; steady-state analysis; product form distribution

1 citations


Network Information
Related Topics (5)
Empirical research
51.3K papers, 1.9M citations
73% related
Competitive advantage
46.6K papers, 1.5M citations
71% related
Supply chain
84.1K papers, 1.7M citations
71% related
Organizational learning
32.6K papers, 1.6M citations
70% related
Cluster analysis
146.5K papers, 2.9M citations
70% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202319
202240
202175
2020109
201989
2018115