Synchronization, retiming and time-division multiplexing of an asynchronous 10 gigabit NRZ Ethernet packet to Terabit Ethernet

DEFF Research Database (Denmark)

Hu, Hao; Laguardia Areal, Janaina; Mulvad, Hans Christian Hansen

2011-01-01

An asynchronous 10 Gb/s Ethernet packet with maximum packet size of 1518 bytes is synchronized and retimed to a master clock with 200 kHz frequency offset using a time lens. The NRZ packet is simultaneously converted into an RZ packet, then further pulse compressed to a FWHM of 400 fs and finally...... time-division multiplexed with a serial 1.28 Tb/s signal including a vacant time slot, thus forming a 1.29 Tb/s time-division multiplexed serial signal. Error-free performance of synchronizing, retiming, time-division multiplexing to a Terabit data stream and finally demultiplexing back to 10 Gb...

A class of convergent neural network dynamics

Science.gov (United States)

Fiedler, Bernold; Gedeon, Tomáš

1998-01-01

We consider a class of systems of differential equations in Rn which exhibits convergent dynamics. We find a Lyapunov function and show that every bounded trajectory converges to the set of equilibria. Our result generalizes the results of Cohen and Grossberg (1983) for convergent neural networks. It replaces the symmetry assumption on the matrix of weights by the assumption on the structure of the connections in the neural network. We prove the convergence result also for a large class of Lotka-Volterra systems. These are naturally defined on the closed positive orthant. We show that there are no heteroclinic cycles on the boundary of the positive orthant for the systems in this class.

Recent developments in Lambda networking

Science.gov (United States)

de Laat, C.; Grosso, P.

About 6 years ago the first baby-steps were made on opening up dark fiber and DWDM infrastructure for direct use by ISP's after the transformation of the old style Telecom sector into a market driven business. Since then Lambda workshops, community groups like GLIF and a number of experiments have led to many implementations of hybrid national research and education networks and lightpath-based circuit exchanges as pioneered by SURFnet in GigaPort and NetherLight in collaboration with StarLight in Chicago and Canarie in Canada. This article looks back on those developments, describes some current open issues and research developments and proposes a concept of terabit networking.

Classes of feedforward neural networks and their circuit complexity

NARCIS (Netherlands)

Shawe-Taylor, John S.; Anthony, Martin H.G.; Kern, Walter

1992-01-01

This paper aims to place neural networks in the context of boolean circuit complexity. We define appropriate classes of feedforward neural networks with specified fan-in, accuracy of computation and depth and using techniques of communication complexity proceed to show that the classes fit into a

Towards Terabit Carrier Ethernet and Energy Efficient Optical Transport Networks

DEFF Research Database (Denmark)

Rasmussen, Anders

This thesis focuses on the challenges of scaling current network node technology to support connection speeds of 100Gbps and beyond. Out of the many exiting aspects of reaching this goal, the main scope of this thesis is to investigate packet processing (address lookup and scheduling), forward....... The more advanced schemes also require more complex calculations to process each bit. This thesis will investigate how both the standard OTN FEC as well as more advanced FEC schemes can be implemented for 100G and above operation. As the networks are expanded to run at increasingly higher speeds...... error correction and energy efficiency. Scheduling and address lookup are key functions and potential bottle necks in high speed network nodes, as the minimum packet/frame sizes in both the popular Ethernet protocol, as well as the Internet Protocol (IP) still remains constant (84B and 40B, respectively...

Open Problems in Network-aware Data Management in Exa-scale Computing and Terabit Networking Era

Energy Technology Data Exchange (ETDEWEB)

Balman, Mehmet; Byna, Surendra

2011-12-06

Accessing and managing large amounts of data is a great challenge in collaborative computing environments where resources and users are geographically distributed. Recent advances in network technology led to next-generation high-performance networks, allowing high-bandwidth connectivity. Efficient use of the network infrastructure is necessary in order to address the increasing data and compute requirements of large-scale applications. We discuss several open problems, evaluate emerging trends, and articulate our perspectives in network-aware data management.

Mapping the social class structure: From occupational mobility to social class categories using network analysis

DEFF Research Database (Denmark)

Toubøl, Jonas; Larsen, Anton Grau

2017-01-01

This article develops a new explorative method for deriving social class categories from patterns of occupational mobility. In line with Max Weber, our research is based on the notion that, if class boundaries do not inhibit social mobility then the class categories are of little value. Thus......, unlike dominant, theoretically defined class schemes, this article derives social class categories from observed patterns in a mobility network covering intra-generational mobility. The network is based on a mobility table of 109 occupational categories tied together by 1,590,834 job shifts on the Danish...... labour market 2001–2007. The number of categories are reduced from 109 to 34 by applying a new clustering algorithm specifically designed for the study of mobility tables (MONECA). These intra-generational social class categories are related to the central discussions of gender, income, education...

Hidden Connectivity in Networks with Vulnerable Classes of Nodes

Directory of Open Access Journals (Sweden)

Sebastian M. Krause

2016-10-01

Full Text Available In many complex systems representable as networks, nodes can be separated into different classes. Often these classes can be linked to a mutually shared vulnerability. Shared vulnerabilities may be due to a shared eavesdropper or correlated failures. In this paper, we show the impact of shared vulnerabilities on robust connectivity and how the heterogeneity of node classes can be exploited to maintain functionality by utilizing multiple paths. Percolation is the field of statistical physics that is generally used to analyze connectivity in complex networks, but in its existing forms, it cannot treat the heterogeneity of multiple vulnerable classes. To analyze the connectivity under these constraints, we describe each class as a color and develop a “color-avoiding” percolation. We present an analytic theory for random networks and a numerical algorithm for all networks, with which we can determine which nodes are color-avoiding connected and whether the maximal set percolates in the system. We find that the interaction of topology and color distribution implies a rich critical behavior, with critical values and critical exponents depending both on the topology and on the color distribution. Applying our physics-based theory to the Internet, we show how color-avoiding percolation can be used as the basis for new topologically aware secure communication protocols. Beyond applications to cybersecurity, our framework reveals a new layer of hidden structure in a wide range of natural and technological systems.

Group composition and network structure in school classes : a multilevel application of the p* model

NARCIS (Netherlands)

Lubbers, Miranda J.

2003-01-01

This paper describes the structure of social networks of students within school classes and examines differences in network structure between classes. In order to examine the network structure within school classes, we focused in particular on the principle of homophily, i.e. the tendency that

Global synchronization of a class of delayed complex networks

International Nuclear Information System (INIS)

Li Ping; Yi Zhang; Zhang Lei

2006-01-01

Global synchronization of a class of complex networks with time-varying delays is investigated in this paper. Some sufficient conditions are derived. These conditions show that the synchronization of delayed complex networks can be determined by their topologies. In addition, these conditions are simply represented in terms of the networks coupling matrix and are easy to be checked. A typical example of complex networks with chaotic nodes is employed to illustrate the obtained global synchronization results

Machine Learning-Assisted Network Inference Approach to Identify a New Class of Genes that Coordinate the Functionality of Cancer Networks.

Science.gov (United States)

Ghanat Bari, Mehrab; Ung, Choong Yong; Zhang, Cheng; Zhu, Shizhen; Li, Hu

2017-08-01

Emerging evidence indicates the existence of a new class of cancer genes that act as "signal linkers" coordinating oncogenic signals between mutated and differentially expressed genes. While frequently mutated oncogenes and differentially expressed genes, which we term Class I cancer genes, are readily detected by most analytical tools, the new class of cancer-related genes, i.e., Class II, escape detection because they are neither mutated nor differentially expressed. Given this hypothesis, we developed a Machine Learning-Assisted Network Inference (MALANI) algorithm, which assesses all genes regardless of expression or mutational status in the context of cancer etiology. We used 8807 expression arrays, corresponding to 9 cancer types, to build more than 2 × 10 8 Support Vector Machine (SVM) models for reconstructing a cancer network. We found that ~3% of ~19,000 not differentially expressed genes are Class II cancer gene candidates. Some Class II genes that we found, such as SLC19A1 and ATAD3B, have been recently reported to associate with cancer outcomes. To our knowledge, this is the first study that utilizes both machine learning and network biology approaches to uncover Class II cancer genes in coordinating functionality in cancer networks and will illuminate our understanding of how genes are modulated in a tissue-specific network contribute to tumorigenesis and therapy development.

All optical OFDM transmission for passive optical networks

Science.gov (United States)

Kachare, Nitin; Ashik T., J.; Bai, K. Kalyani; Kumar, D. Sriram

2017-06-01

This paper demonstrates the idea of data transmission at a very higher rate (Tbits/s) through optical fibers in a passive optical network using the most efficient data transmission technique widely used in wireless communication that is orthogonal frequency division multiplexing. With an increase in internet users, data traffic has also increased significantly and the current dense wavelength division multiplexing (DWDM) systems may not support the next generation passive optical networks (PONs) requirements. The approach discussed in this paper allows to increase the downstream data rate per user and extend the standard single-mode fiber reach for future long-haul applications. All-optical OFDM is a promising solution for terabit per second capable single wavelength transmission, with high spectral efficiency and high tolerance to chromatic dispersion.

High-speed and high-fidelity system and method for collecting network traffic

Science.gov (United States)

Weigle, Eric H [Los Alamos, NM

2010-08-24

A system is provided for the high-speed and high-fidelity collection of network traffic. The system can collect traffic at gigabit-per-second (Gbps) speeds, scale to terabit-per-second (Tbps) speeds, and support additional functions such as real-time network intrusion detection. The present system uses a dedicated operating system for traffic collection to maximize efficiency, scalability, and performance. A scalable infrastructure and apparatus for the present system is provided by splitting the work performed on one host onto multiple hosts. The present system simultaneously addresses the issues of scalability, performance, cost, and adaptability with respect to network monitoring, collection, and other network tasks. In addition to high-speed and high-fidelity network collection, the present system provides a flexible infrastructure to perform virtually any function at high speeds such as real-time network intrusion detection and wide-area network emulation for research purposes.

PRED-CLASS: cascading neural networks for generalized protein classification and genome-wide applications

OpenAIRE

Pasquier, Claude; Promponas, Vasilis; Hamodrakas, Stavros

2009-01-01

International audience; A cascading system of hierarchical, artificial neural networks (named PRED-CLASS) is presented for the generalized classification of proteins into four distinct classes-transmembrane, fibrous, globular, and mixed-from information solely encoded in their amino acid sequences. The architecture of the individual component networks is kept very simple, reducing the number of free parameters (network synaptic weights) for faster training, improved generalization, and the av...

Who influences white working-class boys’ higher education decision-making process? the role of social networks

OpenAIRE

McLellan, Ruth

2013-01-01

The study illuminates the influence of social networks on the HE decision-making process of white working-class boys. The impact of gender, race and social class social characteristics on white working-class boys HE decision-making is assessed. In addition, how white working-class boys define and discuss the membership of their social network, together with the phenomenon of social network influence on white working-class boys’ decision-making about HE at Key Stage 4.The expansive literature ...

Networking for English Literature Class: Cooperative Learning in Chinese Context

Science.gov (United States)

Li, Huiyin

2017-01-01

This action research was conducted to investigate the efficacy of networking, an adjusted cooperative learning method employed in an English literature class for non-English majors in China. Questionnaire was administered online anonymously to college students after a 14-week cooperative learning in literature class in a Chinese university, aiming…

Bidirectional selection between two classes in complex social networks.

Science.gov (United States)

Zhou, Bin; He, Zhe; Jiang, Luo-Luo; Wang, Nian-Xin; Wang, Bing-Hong

2014-12-19

The bidirectional selection between two classes widely emerges in various social lives, such as commercial trading and mate choosing. Until now, the discussions on bidirectional selection in structured human society are quite limited. We demonstrated theoretically that the rate of successfully matching is affected greatly by individuals' neighborhoods in social networks, regardless of the type of networks. Furthermore, it is found that the high average degree of networks contributes to increasing rates of successful matches. The matching performance in different types of networks has been quantitatively investigated, revealing that the small-world networks reinforces the matching rate more than scale-free networks at given average degree. In addition, our analysis is consistent with the modeling result, which provides the theoretical understanding of underlying mechanisms of matching in complex networks.

PRED-CLASS: cascading neural networks for generalized protein classification and genome-wide applications.

Science.gov (United States)

Pasquier, C; Promponas, V J; Hamodrakas, S J

2001-08-15

A cascading system of hierarchical, artificial neural networks (named PRED-CLASS) is presented for the generalized classification of proteins into four distinct classes-transmembrane, fibrous, globular, and mixed-from information solely encoded in their amino acid sequences. The architecture of the individual component networks is kept very simple, reducing the number of free parameters (network synaptic weights) for faster training, improved generalization, and the avoidance of data overfitting. Capturing information from as few as 50 protein sequences spread among the four target classes (6 transmembrane, 10 fibrous, 13 globular, and 17 mixed), PRED-CLASS was able to obtain 371 correct predictions out of a set of 387 proteins (success rate approximately 96%) unambiguously assigned into one of the target classes. The application of PRED-CLASS to several test sets and complete proteomes of several organisms demonstrates that such a method could serve as a valuable tool in the annotation of genomic open reading frames with no functional assignment or as a preliminary step in fold recognition and ab initio structure prediction methods. Detailed results obtained for various data sets and completed genomes, along with a web sever running the PRED-CLASS algorithm, can be accessed over the World Wide Web at http://o2.biol.uoa.gr/PRED-CLASS.

Model reduction of detailed-balanced reaction networks by clustering linkage classes

NARCIS (Netherlands)

Rao, Shodhan; Jayawardhana, Bayu; van der Schaft, Abraham; Findeisen, Rolf; Bullinger, Eric; Balsa-Canto, Eva; Bernaerts, Kristel

2016-01-01

We propose a model reduction method that involves sequential application of clustering of linkage classes and Kron reduction. This approach is specifically useful for chemical reaction networks with each linkage class having less number of reactions. In case of detailed balanced chemical reaction

High-performance flat data center network architecture based on scalable and flow-controlled optical switching system

Science.gov (United States)

Calabretta, Nicola; Miao, Wang; Dorren, Harm

2016-03-01

Traffic in data centers networks (DCNs) is steadily growing to support various applications and virtualization technologies. Multi-tenancy enabling efficient resource utilization is considered as a key requirement for the next generation DCs resulting from the growing demands for services and applications. Virtualization mechanisms and technologies can leverage statistical multiplexing and fast switch reconfiguration to further extend the DC efficiency and agility. We present a novel high performance flat DCN employing bufferless and distributed fast (sub-microsecond) optical switches with wavelength, space, and time switching operation. The fast optical switches can enhance the performance of the DCNs by providing large-capacity switching capability and efficiently sharing the data plane resources by exploiting statistical multiplexing. Benefiting from the Software-Defined Networking (SDN) control of the optical switches, virtual DCNs can be flexibly created and reconfigured by the DCN provider. Numerical and experimental investigations of the DCN based on the fast optical switches show the successful setup of virtual network slices for intra-data center interconnections. Experimental results to assess the DCN performance in terms of latency and packet loss show less than 10^-5 packet loss and 640ns end-to-end latency with 0.4 load and 16- packet size buffer. Numerical investigation on the performance of the systems when the port number of the optical switch is scaled to 32x32 system indicate that more than 1000 ToRs each with Terabit/s interface can be interconnected providing a Petabit/s capacity. The roadmap to photonic integration of large port optical switches will be also presented.

LADS: Optimizing Data Transfers using Layout-Aware Data Scheduling

Energy Technology Data Exchange (ETDEWEB)

Kim, Youngjae [ORNL; Atchley, Scott [ORNL; Vallee, Geoffroy R [ORNL; Shipman, Galen M [ORNL

2015-01-01

While future terabit networks hold the promise of signifi- cantly improving big-data motion among geographically distributed data centers, significant challenges must be overcome even on today s 100 gigabit networks to real- ize end-to-end performance. Multiple bottlenecks exist along the end-to-end path from source to sink. Data stor- age infrastructure at both the source and sink and its in- terplay with the wide-area network are increasingly the bottleneck to achieving high performance. In this paper, we identify the issues that lead to congestion on the path of an end-to-end data transfer in the terabit network en- vironment, and we present a new bulk data movement framework called LADS for terabit networks. LADS ex- ploits the underlying storage layout at each endpoint to maximize throughput without negatively impacting the performance of shared storage resources for other users. LADS also uses the Common Communication Interface (CCI) in lieu of the sockets interface to use zero-copy, OS-bypass hardware when available. It can further im- prove data transfer performance under congestion on the end systems using buffering at the source using flash storage. With our evaluations, we show that LADS can avoid congested storage elements within the shared stor- age resource, improving I/O bandwidth, and data transfer rates across the high speed networks.

Service Class Resource Management For Green Wireless-Optical Broadband Access NetworksWOBAN

Directory of Open Access Journals (Sweden)

SRUTHY.S

2015-08-01

Full Text Available Abstract-Broadband access networks have become an essential part of worldwide communication systems because of the exponential growth of broadband services such as video on demand high definition TV internet protocol TV and video conferencing. Exponential growth in the volume of wireless data boosted by the growing popularity of mobile devices such as smartphone and tablets has forced the telecommunication industries to rethink the way networks are currently designed and to focus on the development of high-capacity mobile broadband networks. In response to this challenge researchers have been working toward the development of an integrated wireless optical broadband access network. Two major candidate technologies which are currently known for their high capacity as well as quality of service QoS for multimedia traffic are passive optical networks PON and fourth generation 4G wireless networks. PON is a wired access technology well known for its cost efficiency and high capacity whereas 4G is a wireless broadband access technology which has achieved broad market acceptance because of its ease of deployment ability to offer mobility and its cost efficiency. Integration of PON and 4G technologies in the form of wireless-optical broadband access networks offers advantages such as extension of networks in rural areas support for mobile broadband services and quick deployment of broadband networks. These two technologies however have different design architectures for handling broadband services that require quality of service. For example 4G networks use traffic classification for supporting different QoS demands whereas the PON architecture has no such mechanism to differentiate between types of traffic. These two technologies also differ in their power saving mechanisms. Propose a service class mapping for the integrated PON-4G network which is based on the MG1 queuing model and class-based power saving mechanism which significantly improves the

ICE-Based Custom Full-Mesh Network for the CHIME High Bandwidth Radio Astronomy Correlator

Science.gov (United States)

Bandura, K.; Cliche, J. F.; Dobbs, M. A.; Gilbert, A. J.; Ittah, D.; Mena Parra, J.; Smecher, G.

2016-03-01

New generation radio interferometers encode signals from thousands of antenna feeds across large bandwidth. Channelizing and correlating this data requires networking capabilities that can handle unprecedented data rates with reasonable cost. The Canadian Hydrogen Intensity Mapping Experiment (CHIME) correlator processes 8-bits from N=2,048 digitizer inputs across 400MHz of bandwidth. Measured in N2× bandwidth, it is the largest radio correlator that is currently commissioning. Its digital back-end must exchange and reorganize the 6.6terabit/s produced by its 128 digitizing and channelizing nodes, and feed it to the 256 graphics processing unit (GPU) node spatial correlator in a way that each node obtains data from all digitizer inputs but across a small fraction of the bandwidth (i.e. ‘corner-turn’). In order to maximize performance and reliability of the corner-turn system while minimizing cost, a custom networking solution has been implemented. The system makes use of Field Programmable Gate Array (FPGA) transceivers to implement direct, passive copper, full-mesh, high speed serial connections between sixteen circuit boards in a crate, to exchange data between crates, and to offload the data to a cluster of 256 GPU nodes using standard 10Gbit/s Ethernet links. The GPU nodes complete the corner-turn by combining data from all crates and then computing visibilities. Eye diagrams and frame error counters confirm error-free operation of the corner-turn network in both the currently operating CHIME Pathfinder telescope (a prototype for the full CHIME telescope) and a representative fraction of the full CHIME hardware providing an end-to-end system validation. An analysis of an equivalent corner-turn system built with Ethernet switches instead of custom passive data links is provided.

Linear matrix inequality approach to exponential synchronization of a class of chaotic neural networks with time-varying delays

Science.gov (United States)

Wu, Wei; Cui, Bao-Tong

2007-07-01

In this paper, a synchronization scheme for a class of chaotic neural networks with time-varying delays is presented. This class of chaotic neural networks covers several well-known neural networks, such as Hopfield neural networks, cellular neural networks, and bidirectional associative memory networks. The obtained criteria are expressed in terms of linear matrix inequalities, thus they can be efficiently verified. A comparison between our results and the previous results shows that our results are less restrictive.

Network Monitoring as a Streaming Analytics Problem

KAUST Repository

Gupta, Arpit

2016-11-02

Programmable switches make it easier to perform flexible network monitoring queries at line rate, and scalable stream processors make it possible to fuse data streams to answer more sophisticated queries about the network in real-time. Unfortunately, processing such network monitoring queries at high traffic rates requires both the switches and the stream processors to filter the traffic iteratively and adaptively so as to extract only that traffic that is of interest to the query at hand. Others have network monitoring in the context of streaming; yet, previous work has not closed the loop in a way that allows network operators to perform streaming analytics for network monitoring applications at scale. To achieve this objective, Sonata allows operators to express a network monitoring query by considering each packet as a tuple and efficiently partitioning each query between the switches and the stream processor through iterative refinement. Sonata extracts only the traffic that pertains to each query, ensuring that the stream processor can scale traffic rates of several terabits per second. We show with a simple example query involving DNS reflection attacks and traffic traces from one of the world\\'s largest IXPs that Sonata can capture 95% of all traffic pertaining to the query, while reducing the overall data rate by a factor of about 400 and the number of required counters by four orders of magnitude. Copyright 2016 ACM.

Co-Ethnic Network, Social Class, and Heritage Language Maintenance among Chinese Immigrant Families

Science.gov (United States)

Zhang, Donghui

2012-01-01

This ethnographic study investigated heritage language maintenance among two distinct groups of Chinese immigrant families (Mandarin and Fujianese) from the social network perspective. The results indicated that a co-ethnic network could be a double-edged sword, which works differently on children from different social classes. While the Mandarin…

A Framework for Supporting Survivability, Network Planning and Cross-Layer Optimization in Future Multi-Domain Terabit Networks

Energy Technology Data Exchange (ETDEWEB)

Baldin, Ilya [Renaissance Computing Inst. (RENCI), Chapel Hill, NC (United States); Huang, Shu [Renaissance Computing Inst. (RENCI), Chapel Hill, NC (United States); Gopidi, Rajesh [Univ. of North Carolina, Chapel Hill, NC (United States)

2015-01-28

This final project report describes the accomplishments, products and publications from the award. It includes the overview of the project goals to devise a framework for managing resources in multi-domain, multi-layer networks, as well the details of the mathematical problem formulation and the description of the prototype built to prove the concept.

Exponential convergence for a class of delayed cellular neural networks with time-varying coefficients

International Nuclear Information System (INIS)

Liu Bingwen

2008-01-01

In this Letter, we consider a class of delayed cellular neural networks with time-varying coefficients. By applying Lyapunov functional method and differential inequality techniques, we establish new results to ensure that all solutions of the networks converge exponentially to zero point

Regular Network Class Features Enhancement Using an Evolutionary Synthesis Algorithm

Directory of Open Access Journals (Sweden)

O. G. Monahov

2014-01-01

Full Text Available This paper investigates a solution of the optimization problem concerning the construction of diameter-optimal regular networks (graphs. Regular networks are of practical interest as the graph-theoretical models of reliable communication networks of parallel supercomputer systems, as a basis of the structure in a model of small world in optical and neural networks. It presents a new class of parametrically described regular networks - hypercirculant networks (graphs. An approach that uses evolutionary algorithms for the automatic generation of parametric descriptions of optimal hypercirculant networks is developed. Synthesis of optimal hypercirculant networks is based on the optimal circulant networks with smaller degree of nodes. To construct optimal hypercirculant networks is used a template of circulant network from the known optimal families of circulant networks with desired number of nodes and with smaller degree of nodes. Thus, a generating set of the circulant network is used as a generating subset of the hypercirculant network, and the missing generators are synthesized by means of the evolutionary algorithm, which is carrying out minimization of diameter (average diameter of networks. A comparative analysis of the structural characteristics of hypercirculant, toroidal, and circulant networks is conducted. The advantage hypercirculant networks under such structural characteristics, as diameter, average diameter, and the width of bisection, with comparable costs of the number of nodes and the number of connections is demonstrated. It should be noted the advantage of hypercirculant networks of dimension three over four higher-dimensional tori. Thus, the optimization of hypercirculant networks of dimension three is more efficient than the introduction of an additional dimension for the corresponding toroidal structures. The paper also notes the best structural parameters of hypercirculant networks in comparison with iBT-networks previously

Nonlinear Silicon Photonic Signal Processing Devices for Future Optical Networks

Directory of Open Access Journals (Sweden)

Cosimo Lacava

2017-01-01

Full Text Available In this paper, we present a review on silicon-based nonlinear devices for all optical nonlinear processing of complex telecommunication signals. We discuss some recent developments achieved by our research group, through extensive collaborations with academic partners across Europe, on optical signal processing using silicon-germanium and amorphous silicon based waveguides as well as novel materials such as silicon rich silicon nitride and tantalum pentoxide. We review the performance of four wave mixing wavelength conversion applied on complex signals such as Differential Phase Shift Keying (DPSK, Quadrature Phase Shift Keying (QPSK, 16-Quadrature Amplitude Modulation (QAM and 64-QAM that dramatically enhance the telecom signal spectral efficiency, paving the way to next generation terabit all-optical networks.

Two classes of bipartite networks: nested biological and social systems.

Science.gov (United States)

Burgos, Enrique; Ceva, Horacio; Hernández, Laura; Perazzo, R P J; Devoto, Mariano; Medan, Diego

2008-10-01

Bipartite graphs have received some attention in the study of social networks and of biological mutualistic systems. A generalization of a previous model is presented, that evolves the topology of the graph in order to optimally account for a given contact preference rule between the two guilds of the network. As a result, social and biological graphs are classified as belonging to two clearly different classes. Projected graphs, linking the agents of only one guild, are obtained from the original bipartite graph. The corresponding evolution of its statistical properties is also studied. An example of a biological mutualistic network is analyzed in detail, and it is found that the model provides a very good fitting of all the main statistical features. The model also provides a proper qualitative description of the same features observed in social webs, suggesting the possible reasons underlying the difference in the organization of these two kinds of bipartite networks.

Structural properties and complexity of a new network class: Collatz step graphs.

Directory of Open Access Journals (Sweden)

Frank Emmert-Streib

Full Text Available In this paper, we introduce a biologically inspired model to generate complex networks. In contrast to many other construction procedures for growing networks introduced so far, our method generates networks from one-dimensional symbol sequences that are related to the so called Collatz problem from number theory. The major purpose of the present paper is, first, to derive a symbol sequence from the Collatz problem, we call the step sequence, and investigate its structural properties. Second, we introduce a construction procedure for growing networks that is based on these step sequences. Third, we investigate the structural properties of this new network class including their finite scaling and asymptotic behavior of their complexity, average shortest path lengths and clustering coefficients. Interestingly, in contrast to many other network models including the small-world network from Watts & Strogatz, we find that CS graphs become 'smaller' with an increasing size.

The ASCI Network for SC '99: A Step on the Path to a 100 Gigabit Per Second Supercomputing Network

Energy Technology Data Exchange (ETDEWEB)

PRATT,THOMAS J.; TARMAN,THOMAS D.; MARTINEZ,LUIS M.; MILLER,MARC M.; ADAMS,ROGER L.; CHEN,HELEN Y.; BRANDT,JAMES M.; WYCKOFF,PETER S.

2000-07-24

This document highlights the Discom{sup 2}'s Distance computing and communication team activities at the 1999 Supercomputing conference in Portland, Oregon. This conference is sponsored by the IEEE and ACM. Sandia, Lawrence Livermore and Los Alamos National laboratories have participated in this conference for eleven years. For the last four years the three laboratories have come together at the conference under the DOE's ASCI, Accelerated Strategic Computing Initiatives rubric. Communication support for the ASCI exhibit is provided by the ASCI DISCOM{sup 2} project. The DISCOM{sup 2} communication team uses this forum to demonstrate and focus communication and networking developments within the community. At SC 99, DISCOM built a prototype of the next generation ASCI network demonstrated remote clustering techniques, demonstrated the capabilities of the emerging Terabit Routers products, demonstrated the latest technologies for delivering visualization data to the scientific users, and demonstrated the latest in encryption methods including IP VPN technologies and ATM encryption research. The authors also coordinated the other production networking activities within the booth and between their demonstration partners on the exhibit floor. This paper documents those accomplishments, discusses the details of their implementation, and describes how these demonstrations support Sandia's overall strategies in ASCI networking.

Emergent inequality and self-organized social classes in a network of power and frustration.

Science.gov (United States)

Mahault, Benoit; Saxena, Avadh; Nisoli, Cristiano

2017-01-01

We propose a simple agent-based model on a network to conceptualize the allocation of limited wealth among more abundant expectations at the interplay of power, frustration, and initiative. Concepts imported from the statistical physics of frustrated systems in and out of equilibrium allow us to compare subjective measures of frustration and satisfaction to collective measures of fairness in wealth distribution, such as the Lorenz curve and the Gini index. We find that a completely libertarian, law-of-the-jungle setting, where every agent can acquire wealth from or lose wealth to anybody else invariably leads to a complete polarization of the distribution of wealth vs. opportunity. This picture is however dramatically ameliorated when hard constraints are imposed over agents in the form of a limiting network of transactions. There, an out of equilibrium dynamics of the networks, based on a competition between power and frustration in the decision-making of agents, leads to network coevolution. The ratio of power and frustration controls different dynamical regimes separated by kinetic transitions and characterized by drastically different values of equality. It also leads, for proper values of social initiative, to the emergence of three self-organized social classes, lower, middle, and upper class. Their dynamics, which appears mostly controlled by the middle class, drives a cyclical regime of dramatic social changes.

Multi-stability and almost periodic solutions of a class of recurrent neural networks

International Nuclear Information System (INIS)

Liu Yiguang; You Zhisheng

2007-01-01

This paper studies multi-stability, existence of almost periodic solutions of a class of recurrent neural networks with bounded activation functions. After introducing a sufficient condition insuring multi-stability, many criteria guaranteeing existence of almost periodic solutions are derived using Mawhin's coincidence degree theory. All the criteria are constructed without assuming the activation functions are smooth, monotonic or Lipschitz continuous, and that the networks contains periodic variables (such as periodic coefficients, periodic inputs or periodic activation functions), so all criteria can be easily extended to fit many concrete forms of neural networks such as Hopfield neural networks, or cellular neural networks, etc. Finally, all kinds of simulations are employed to illustrate the criteria

A Bell inequality for a class of multilocal ring networks

Science.gov (United States)

Frey, Michael

2017-11-01

Quantum networks with independent sources of entanglement (hidden variables) and nodes that execute joint quantum measurements can create strong quantum correlations spanning the breadth of the network. Understanding of these correlations has to the present been limited to standard Bell experiments with one source of shared randomness, bilocal arrangements having two local sources of shared randomness, and multilocal networks with tree topologies. We introduce here a class of quantum networks with ring topologies comprised of subsystems each with its own internally shared source of randomness. We prove a Bell inequality for these networks, and to demonstrate violations of this inequality, we focus on ring networks with three-qubit subsystems. Three qubits are capable of two non-equivalent types of entanglement, GHZ and W-type. For rings of any number N of three-qubit subsystems, our inequality is violated when the subsystems are each internally GHZ-entangled. This violation is consistently stronger when N is even. This quantitative even-odd difference for GHZ entanglement becomes extreme in the case of W-type entanglement. When the ring size N is even, the presence of W-type entanglement is successfully detected; when N is odd, the inequality consistently fails to detect its presence.

Intelligent Broadcasting in Mobile Ad Hoc Networks: Three Classes of Adaptive Protocols

Directory of Open Access Journals (Sweden)

Michael D. Colagrosso

2006-11-01

Full Text Available Because adaptability greatly improves the performance of a broadcast protocol, we identify three ways in which machine learning can be applied to broadcasting in a mobile ad hoc network (MANET. We chose broadcasting because it functions as a foundation of MANET communication. Unicast, multicast, and geocast protocols utilize broadcasting as a building block, providing important control and route establishment functionality. Therefore, any improvements to the process of broadcasting can be immediately realized by higher-level MANET functionality and applications. While efficient broadcast protocols have been proposed, no single broadcasting protocol works well in all possible MANET conditions. Furthermore, protocols tend to fail catastrophically in severe network environments. Our three classes of adaptive protocols are pure machine learning, intra-protocol learning, and inter-protocol learning. In the pure machine learning approach, we exhibit a new approach to the design of a broadcast protocol: the decision of whether to rebroadcast a packet is cast as a classification problem. Each mobile node (MN builds a classifier and trains it on data collected from the network environment. Using intra-protocol learning, each MN consults a simple machine model for the optimal value of one of its free parameters. Lastly, in inter-protocol learning, MNs learn to switch between different broadcasting protocols based on network conditions. For each class of learning method, we create a prototypical protocol and examine its performance in simulation.

Intelligent Broadcasting in Mobile Ad Hoc Networks: Three Classes of Adaptive Protocols

Directory of Open Access Journals (Sweden)

Colagrosso Michael D

2007-01-01

Full Text Available Because adaptability greatly improves the performance of a broadcast protocol, we identify three ways in which machine learning can be applied to broadcasting in a mobile ad hoc network (MANET. We chose broadcasting because it functions as a foundation of MANET communication. Unicast, multicast, and geocast protocols utilize broadcasting as a building block, providing important control and route establishment functionality. Therefore, any improvements to the process of broadcasting can be immediately realized by higher-level MANET functionality and applications. While efficient broadcast protocols have been proposed, no single broadcasting protocol works well in all possible MANET conditions. Furthermore, protocols tend to fail catastrophically in severe network environments. Our three classes of adaptive protocols are pure machine learning, intra-protocol learning, and inter-protocol learning. In the pure machine learning approach, we exhibit a new approach to the design of a broadcast protocol: the decision of whether to rebroadcast a packet is cast as a classification problem. Each mobile node (MN builds a classifier and trains it on data collected from the network environment. Using intra-protocol learning, each MN consults a simple machine model for the optimal value of one of its free parameters. Lastly, in inter-protocol learning, MNs learn to switch between different broadcasting protocols based on network conditions. For each class of learning method, we create a prototypical protocol and examine its performance in simulation.

Link predication based on matrix factorization by fusion of multi class organizations of the network

OpenAIRE

Jiao, Pengfei; Cai, Fei; Feng, Yiding; Wang, Wenjun

2017-01-01

Link predication aims at forecasting the latent or unobserved edges in the complex networks and has a wide range of applications in reality. Almost existing methods and models only take advantage of one class organization of the networks, which always lose important information hidden in other organizations of the network. In this paper, we propose a link predication framework which makes the best of the structure of networks in different level of organizations based on nonnegative matrix fac...

"LUDO" - Kids playing Distributed Denial of Service

NARCIS (Netherlands)

Steinberger, Jessica; Cardoso de Santanna, José Jair; Spatharas, E.; Amler, H.; Breuer, N.; Graul, K.; Kuhnert, B.; Piontek, U.; Sperotto, Anna; Baier, H.; Pras, Aiko; Bergström, Johan; Hórvath, Gyöngyi; Schofield, Brook

2016-01-01

Distributed denial of service attacks pose a serious threat to the availability of the network infrastructures and services. GE̿ANT, the pan-European network with terabit capacities witnesses close to hundreds of DDoS attacks on a daily basis. The reason is that DDoS attacks are getting larger, more

CNN-BLPred: a Convolutional neural network based predictor for β-Lactamases (BL) and their classes.

Science.gov (United States)

White, Clarence; Ismail, Hamid D; Saigo, Hiroto; Kc, Dukka B

2017-12-28

The β-Lactamase (BL) enzyme family is an important class of enzymes that plays a key role in bacterial resistance to antibiotics. As the newly identified number of BL enzymes is increasing daily, it is imperative to develop a computational tool to classify the newly identified BL enzymes into one of its classes. There are two types of classification of BL enzymes: Molecular Classification and Functional Classification. Existing computational methods only address Molecular Classification and the performance of these existing methods is unsatisfactory. We addressed the unsatisfactory performance of the existing methods by implementing a Deep Learning approach called Convolutional Neural Network (CNN). We developed CNN-BLPred, an approach for the classification of BL proteins. The CNN-BLPred uses Gradient Boosted Feature Selection (GBFS) in order to select the ideal feature set for each BL classification. Based on the rigorous benchmarking of CCN-BLPred using both leave-one-out cross-validation and independent test sets, CCN-BLPred performed better than the other existing algorithms. Compared with other architectures of CNN, Recurrent Neural Network, and Random Forest, the simple CNN architecture with only one convolutional layer performs the best. After feature extraction, we were able to remove ~95% of the 10,912 features using Gradient Boosted Trees. During 10-fold cross validation, we increased the accuracy of the classic BL predictions by 7%. We also increased the accuracy of Class A, Class B, Class C, and Class D performance by an average of 25.64%. The independent test results followed a similar trend. We implemented a deep learning algorithm known as Convolutional Neural Network (CNN) to develop a classifier for BL classification. Combined with feature selection on an exhaustive feature set and using balancing method such as Random Oversampling (ROS), Random Undersampling (RUS) and Synthetic Minority Oversampling Technique (SMOTE), CNN-BLPred performs

Brain anatomical networks in world class gymnasts: a DTI tractography study.

Science.gov (United States)

Wang, Bin; Fan, Yuanyuan; Lu, Min; Li, Shumei; Song, Zheng; Peng, Xiaoling; Zhang, Ruibin; Lin, Qixiang; He, Yong; Wang, Jun; Huang, Ruiwang

2013-01-15

The excellent motor skills of world class gymnasts amaze everyone. People marvel at the way they precisely control their movements and wonder how the brain structure and function of these elite athletes differ from those of non-athletes. In this study, we acquired diffusion images from thirteen world class gymnasts and fourteen matched controls, constructed their anatomical networks, and calculated the topological properties of each network based on graph theory. From a connectivity-based analysis, we found that most of the edges with increased connection density in the champions were linked to brain regions that are located in the sensorimotor, attentional, and default-mode systems. From graph-based metrics, we detected significantly greater global and local efficiency but shorter characteristic path length in the anatomical networks of the champions compared with the controls. Moreover, in the champions we found a significantly higher nodal degree and greater regional efficiency in several brain regions that correspond to motor and attention functions. These included the left precentral gyrus, left postcentral gyrus, right anterior cingulate gyrus and temporal lobes. In addition, we revealed an increase in the mean fractional anisotropy of the corticospinal tract in the champions, possibly in response to long-term gymnastic training. Our study indicates that neuroanatomical adaptations and plastic changes occur in gymnasts' brain anatomical networks either in response to long-term intensive gymnastic training or as an innate predisposition or both. Our findings may help to explain gymnastic skills at the highest levels of performance and aid in understanding the neural mechanisms that distinguish expert gymnasts from novices. Copyright © 2012 Elsevier Inc. All rights reserved.

Ethnic Segregation in Friendship Networks : Studies of its Determinants in English, German, Dutch, and Swedish School Classes

NARCIS (Netherlands)

Smith, S.

2015-01-01

Adolescent interethnic friendship is an important indicator of social cohesion in multi-ethnic societies. Therefore, this dissertation examines individual, network, and contextual explanations for ethnic segregation in adolescent friendship networks in school classes. More specifically, the

Networking to build a world-class bioenergy industry in British Columbia

Energy Technology Data Exchange (ETDEWEB)

Weedon, M. [BC Bioenergy Network, Vancouver, BC (Canada)

2009-07-01

This presentation described the role of the BC Bioenergy Network and its goal of maximizing the value of biomass resources in British Columbia (BC) and developing a world-class bioenergy industry in the province. Established in March 2008 with $25 million in funding from the BC government, the BC Bioenergy Network is an industry-led association that promotes the development of near-term bioenergy technologies and demonstration of new bioenergy technologies that are environmentally appropriate for the province of BC. The following technology areas require funding support: solid wood residues, pulp and paper residues, harvesting and pelleting, agriculture residues, municipal wastewater, municipal landfill waste, municipal solid waste, and community heating-electricity greenhouse systems. This presentation demonstrated that BC is well positioned to become a major player in the global bioenergy sector, as it has one of the largest forested areas in the world, and is a leader in biomass to value-added wood products. The opportunities, challenges, and requirements to build a world class bioenergy industry in British Columbia were discussed along with successful Canadian, US, and European collaborations with industry, research, and government. tabs., figs.

Social network cohesion in school classes promotes prosocial behavior.

Science.gov (United States)

van den Bos, Wouter; Crone, Eveline A; Meuwese, Rosa; Güroğlu, Berna

2018-01-01

Adolescence is a key period of social development at the end of which individuals are expected to take on adult social roles. The school class, as the most salient peer group, becomes the prime environment that impacts social development during adolescence. Using social network analyses, we investigated how individual and group level features are related to prosocial behavior and social capital (generalized trust). We mapped the social networks within 22 classrooms of adolescents aged between 12 and 18 years (N = 611), and collected data on social behaviors towards peers. Our results indicate that individuals with high centrality show both higher levels of prosocial behavior and relational aggression. Importantly, greater social cohesion in the classroom was associated with (1) reduced levels of antisocial behavior towards peers and (2) increased generalized trust. These results provide novel insights in the relationship between social structure and social behavior, and stress the importance of the school environment in the development of not only intellectual but also social capital.

Social network cohesion in school classes promotes prosocial behavior

Science.gov (United States)

Crone, Eveline A.; Meuwese, Rosa; Güroğlu, Berna

2018-01-01

Adolescence is a key period of social development at the end of which individuals are expected to take on adult social roles. The school class, as the most salient peer group, becomes the prime environment that impacts social development during adolescence. Using social network analyses, we investigated how individual and group level features are related to prosocial behavior and social capital (generalized trust). We mapped the social networks within 22 classrooms of adolescents aged between 12 and 18 years (N = 611), and collected data on social behaviors towards peers. Our results indicate that individuals with high centrality show both higher levels of prosocial behavior and relational aggression. Importantly, greater social cohesion in the classroom was associated with (1) reduced levels of antisocial behavior towards peers and (2) increased generalized trust. These results provide novel insights in the relationship between social structure and social behavior, and stress the importance of the school environment in the development of not only intellectual but also social capital. PMID:29617405

Globally exponential stability condition of a class of neural networks with time-varying delays

International Nuclear Information System (INIS)

Liao, T.-L.; Yan, J.-J.; Cheng, C.-J.; Hwang, C.-C.

2005-01-01

In this Letter, the globally exponential stability for a class of neural networks including Hopfield neural networks and cellular neural networks with time-varying delays is investigated. Based on the Lyapunov stability method, a novel and less conservative exponential stability condition is derived. The condition is delay-dependent and easily applied only by checking the Hamiltonian matrix with no eigenvalues on the imaginary axis instead of directly solving an algebraic Riccati equation. Furthermore, the exponential stability degree is more easily assigned than those reported in the literature. Some examples are given to demonstrate validity and excellence of the presented stability condition herein

Fuzzy Counter Propagation Neural Network Control for a Class of Nonlinear Dynamical Systems.

Science.gov (United States)

Sakhre, Vandana; Jain, Sanjeev; Sapkal, Vilas S; Agarwal, Dev P

2015-01-01

Fuzzy Counter Propagation Neural Network (FCPN) controller design is developed, for a class of nonlinear dynamical systems. In this process, the weight connecting between the instar and outstar, that is, input-hidden and hidden-output layer, respectively, is adjusted by using Fuzzy Competitive Learning (FCL). FCL paradigm adopts the principle of learning, which is used to calculate Best Matched Node (BMN) which is proposed. This strategy offers a robust control of nonlinear dynamical systems. FCPN is compared with the existing network like Dynamic Network (DN) and Back Propagation Network (BPN) on the basis of Mean Absolute Error (MAE), Mean Square Error (MSE), Best Fit Rate (BFR), and so forth. It envisages that the proposed FCPN gives better results than DN and BPN. The effectiveness of the proposed FCPN algorithms is demonstrated through simulations of four nonlinear dynamical systems and multiple input and single output (MISO) and a single input and single output (SISO) gas furnace Box-Jenkins time series data.

Fuzzy Counter Propagation Neural Network Control for a Class of Nonlinear Dynamical Systems

Directory of Open Access Journals (Sweden)

Vandana Sakhre

2015-01-01

Full Text Available Fuzzy Counter Propagation Neural Network (FCPN controller design is developed, for a class of nonlinear dynamical systems. In this process, the weight connecting between the instar and outstar, that is, input-hidden and hidden-output layer, respectively, is adjusted by using Fuzzy Competitive Learning (FCL. FCL paradigm adopts the principle of learning, which is used to calculate Best Matched Node (BMN which is proposed. This strategy offers a robust control of nonlinear dynamical systems. FCPN is compared with the existing network like Dynamic Network (DN and Back Propagation Network (BPN on the basis of Mean Absolute Error (MAE, Mean Square Error (MSE, Best Fit Rate (BFR, and so forth. It envisages that the proposed FCPN gives better results than DN and BPN. The effectiveness of the proposed FCPN algorithms is demonstrated through simulations of four nonlinear dynamical systems and multiple input and single output (MISO and a single input and single output (SISO gas furnace Box-Jenkins time series data.

Race, Class, and Religious Differences in the Social Networks of Children and Their Parents

Science.gov (United States)

Hunter, Andrea G.; Friend, Christian A.; Williams-Wheeler, Meeshay; Fletcher, Anne C.

2012-01-01

The study is a qualitative investigation of mothers' perspectives about and their role in negotiating and developing intergenerational closure across race, class, and religious differences and their management of children's diverse friendships. Black and White mothers (n = 25) of third graders were interviewed about social networks, children's…

Friendship networks of inner-city adults: a latent class analysis and multi-level regression of supporter types and the association of supporter latent class membership with supporter and recipient drug use.

Science.gov (United States)

Bohnert, Amy S B; German, Danielle; Knowlton, Amy R; Latkin, Carl A

2010-03-01

Social support is a multi-dimensional construct that is important to drug use cessation. The present study identified types of supportive friends among the social network members in a community-based sample and examined the relationship of supporter-type classes with supporter, recipient, and supporter-recipient relationship characteristics. We hypothesized that the most supportive network members and their support recipients would be less likely to be current heroin/cocaine users. Participants (n=1453) were recruited from low-income neighborhoods with a high prevalence of drug use. Participants identified their friends via a network inventory, and all nominated friends were included in a latent class analysis and grouped based on their probability of providing seven types of support. These latent classes were included as the dependent variable in a multi-level regression of supporter drug use, recipient drug use, and other characteristics. The best-fitting latent class model identified five support patterns: friends who provided Little/No Support, Low/Moderate Support, High Support, Socialization Support, and Financial Support. In bivariate models, friends in the High, Low/Moderate, and Financial Support were less likely to use heroin or cocaine and had less conflict with and were more trusted by the support recipient than friends in the Low/No Support class. Individuals with supporters in those same support classes compared to the Low/No Support class were less likely to use heroin or cocaine, or to be homeless or female. Multivariable models suggested similar trends. Those with current heroin/cocaine use were less likely to provide or receive comprehensive support from friends. Published by Elsevier Ireland Ltd.

The Educational Use of Facebook as a Social Networking Site in Animal Physiology Classes

Science.gov (United States)

Köseoglu, Pinar; Mercan, Gamze

2016-01-01

This study aims at performing a sample application of the educational use of Facebook as a social networking site in Animal Physiology classes, and to determine student's' views on the application. The research sample was composed of 29 third year undergraduate students attending the Biology Education Department of Hacettepe University. The…

Enhanced Gain in Slow-Light Photonic Crystal Waveguides with Embedded Quantum Dots

DEFF Research Database (Denmark)

Ek, Sara; Hansen, Per Lunnemann; Semenova, Elizaveta

2011-01-01

We experimentally demonstrate enhanced gain in the slow-light regime of quantum dot photonic crystal waveguide slabs. These are promising results for future compact devices for terabit/s communication, such as compact optical amplifiers and mode-locked lasers.......We experimentally demonstrate enhanced gain in the slow-light regime of quantum dot photonic crystal waveguide slabs. These are promising results for future compact devices for terabit/s communication, such as compact optical amplifiers and mode-locked lasers....

Trenched raised cosine FMF for differential mode delay management in next generation optical networks

Science.gov (United States)

Chebaane, Saleh; Fathallah, Habib; Seleem, Hussein; Machhout, Mohsen

2018-02-01

Dispersion management in few mode fiber (FMF) technology is crucial to support the upcoming standard that reaches 400 Gbps and Terabit/s per wavelength. Recently in Chebaane et al. (2016), we defined two potential differential mode delay (DMD) management strategies, namely sawtooth and triangular. Moreover we proposed a novel parametric refractive index profile for FMF, referred as raised cosine (RC) profile. In this article, we improve and optimize the RC profile design by including additional shaping parameters, in order to obtain much more attractive dispersion characteristics. Our improved design enabled to obtain a zero DMD (z-DMD), strong positive DMD (p-DMD) and near-zero DMD (nz-DMD) for six-mode fiber, all appropriate for dispersion management in FMF system. In addition, we propose a positive DMD (p-DMD) fiber designs for both, four-mode fiber (4-FMF) and six-mode fiber (6-FMF), respectively, having particularly attractive dispersion characteristics.

Dynamics of a class of cellular neural networks with time-varying delays

International Nuclear Information System (INIS)

Huang Lihong; Huang Chuangxia; Liu Bingwen

2005-01-01

Employing Brouwer's fixed point theorem, matrix theory, a continuation theorem of the coincidence degree and inequality analysis, the authors make a further investigation of a class of cellular neural networks with delays (DCNNs) in this Letter. A family of sufficient conditions are given for checking global exponential stability and the existence of periodic solutions of DCNNs. These results have important leading significance in the design and applications of globally stable DCNNs and periodic oscillatory DCNNs. Our results extend and improve some earlier publications

Phase transitions in scale-free neural networks: Departure from the standard mean-field universality class

International Nuclear Information System (INIS)

Aldana, Maximino; Larralde, Hernan

2004-01-01

We investigate the nature of the phase transition from an ordered to a disordered state that occurs in a family of neural network models with noise. These models are closely related to the majority voter model, where a ferromagneticlike interaction between the elements prevails. Each member of the family is distinguished by the network topology, which is determined by the probability distribution of the number of incoming links. We show that for homogeneous random topologies, the phase transition belongs to the standard mean-field universality class, characterized by the order parameter exponent β=1/2. However, for scale-free networks we obtain phase transition exponents ranging from 1/2 to infinity. Furthermore, we show the existence of a phase transition even for values of the scale-free exponent in the interval (1.5,2], where the average network connectivity diverges

Robust exponential stability and domains of attraction in a class of interval neural networks

International Nuclear Information System (INIS)

Yang Xiaofan; Liao Xiaofeng; Bai Sen; Evans, David J

2005-01-01

This paper addresses robust exponential stability as well as domains of attraction in a class of interval neural networks. A sufficient condition for an equilibrium point to be exponentially stable is established. And an estimate on the domains of attraction of exponentially stable equilibrium points is presented. Both the condition and the estimate are formulated in terms of the parameter intervals, the neurons' activation functions and the equilibrium point. Hence, they are easily checkable. In addition, our results neither depend on monotonicity of the activation functions nor on coupling conditions between the neurons. Consequently, these results are of practical importance in evaluating the performance of interval associative memory networks

Delay-range-dependent exponential H∞ synchronization of a class of delayed neural networks

International Nuclear Information System (INIS)

Karimi, Hamid Reza; Maass, Peter

2009-01-01

This article aims to present a multiple delayed state-feedback control design for exponential H ∞ synchronization problem of a class of delayed neural networks with multiple time-varying discrete delays. On the basis of the drive-response concept and by introducing a descriptor technique and using Lyapunov-Krasovskii functional, new delay-range-dependent sufficient conditions for exponential H ∞ synchronization of the drive-response structure of neural networks are driven in terms of linear matrix inequalities (LMIs). The explicit expression of the controller gain matrices are parameterized based on the solvability conditions such that the drive system and the response system can be exponentially synchronized. A numerical example is included to illustrate the applicability of the proposed design method.

We are all ordinary people : Perceptions of class and class differences in personal relationships

NARCIS (Netherlands)

Van Eijk, G.

2009-01-01

This paper examines people’s perceptions of class and class differences—in general and with regard to personal relationships. Data from an original survey on personal networks (n=195) shows that most people think they are middle class, although many lower class respondents classify themselves as

Link predication based on matrix factorization by fusion of multi class organizations of the network.

Science.gov (United States)

Jiao, Pengfei; Cai, Fei; Feng, Yiding; Wang, Wenjun

2017-08-21

Link predication aims at forecasting the latent or unobserved edges in the complex networks and has a wide range of applications in reality. Almost existing methods and models only take advantage of one class organization of the networks, which always lose important information hidden in other organizations of the network. In this paper, we propose a link predication framework which makes the best of the structure of networks in different level of organizations based on nonnegative matrix factorization, which is called NMF 3 here. We first map the observed network into another space by kernel functions, which could get the different order organizations. Then we combine the adjacency matrix of the network with one of other organizations, which makes us obtain the objective function of our framework for link predication based on the nonnegative matrix factorization. Third, we derive an iterative algorithm to optimize the objective function, which converges to a local optimum, and we propose a fast optimization strategy for large networks. Lastly, we test the proposed framework based on two kernel functions on a series of real world networks under different sizes of training set, and the experimental results show the feasibility, effectiveness, and competitiveness of the proposed framework.

A Reduced Switch Voltage Stress Class E Power Amplifier Using Harmonic Control Network

OpenAIRE

Ali Reza Zirak; Sobhan Roshani

2016-01-01

In this paper, a harmonic control network (HCN) is presented to reduce the voltage stress (maximum MOSFET voltage) of the class E power amplifier (PA). Effects of the HCN on the amplifier specifications are investigated. The results show that the proposed HCN affects several specifications of the amplifier, such as drain voltage, switch current, output power capability (Cp factor), and drain impedance. The output power capability of the presented amplifier is also improved, compared with the ...

Asymptotic stability and disturbance attenuation properties for a class of networked control systems

Institute of Scientific and Technical Information of China (English)

无

2006-01-01

In this paper, stability and disturbance attenuation issues for a class of Networked Control Systems (NCSs)under uncertain access delay and packet dropout effects are considered. Our aim is to find conditions on the delay and packet dropout rate, under which the system stability and H∞ disturbance attenuation properties are preserved to a desired level. The basic idea in this paper is to formulate such Networked Control System as a discrete-time switched system. Then the NCSs' stability and performance problems can be reduced to the corresponding problems for switched systems, which have been studied for decades and for which a number of results are available in the literature. The techniques in this paper are based on recent progress in the discrete-time switched systems and piecewise Lyapunov functions.

Robust FDI for a Class of Nonlinear Networked Systems with ROQs

Directory of Open Access Journals (Sweden)

An-quan Sun

2014-01-01

Full Text Available This paper considers the robust fault detection and isolation (FDI problem for a class of nonlinear networked systems (NSs with randomly occurring quantisations (ROQs. After vector augmentation, Lyapunov function is introduced to ensure the asymptotically mean-square stability of fault detection system. By transforming the quantisation effects into sector-bounded parameter uncertainties, sufficient conditions ensuring the existence of fault detection filter are proposed, which can reduce the difference between output residuals and fault signals as small as possible under H∞ framework. Finally, an example linearized from a vehicle system is introduced to show the efficiency of the proposed fault detection filter.

NN-align. An artificial neural network-based alignment algorithm for MHC class II peptide binding prediction

DEFF Research Database (Denmark)

Nielsen, Morten; Lund, Ole

2009-01-01

this binding event. RESULTS: Here, we present a novel artificial neural network-based method, NN-align that allows for simultaneous identification of the MHC class II binding core and binding affinity. NN-align is trained using a novel training algorithm that allows for correction of bias in the training data...

Artificial neural networks applied for soil class prediction in mountainous landscape of the Serra do Mar¹

Directory of Open Access Journals (Sweden)

Braz Calderano Filho

2014-12-01

Full Text Available Soil information is needed for managing the agricultural environment. The aim of this study was to apply artificial neural networks (ANNs for the prediction of soil classes using orbital remote sensing products, terrain attributes derived from a digital elevation model and local geology information as data sources. This approach to digital soil mapping was evaluated in an area with a high degree of lithologic diversity in the Serra do Mar. The neural network simulator used in this study was JavaNNS and the backpropagation learning algorithm. For soil class prediction, different combinations of the selected discriminant variables were tested: elevation, declivity, aspect, curvature, curvature plan, curvature profile, topographic index, solar radiation, LS topographic factor, local geology information, and clay mineral indices, iron oxides and the normalized difference vegetation index (NDVI derived from an image of a Landsat-7 Enhanced Thematic Mapper Plus (ETM+ sensor. With the tested sets, best results were obtained when all discriminant variables were associated with geological information (overall accuracy 93.2 - 95.6 %, Kappa index 0.924 - 0.951, for set 13. Excluding the variable profile curvature (set 12, overall accuracy ranged from 93.9 to 95.4 % and the Kappa index from 0.932 to 0.948. The maps based on the neural network classifier were consistent and similar to conventional soil maps drawn for the study area, although with more spatial details. The results show the potential of ANNs for soil class prediction in mountainous areas with lithological diversity.

A training rule which guarantees finite-region stability for a class of closed-loop neural-network control systems.

Science.gov (United States)

Kuntanapreeda, S; Fullmer, R R

1996-01-01

A training method for a class of neural network controllers is presented which guarantees closed-loop system stability. The controllers are assumed to be nonlinear, feedforward, sampled-data, full-state regulators implemented as single hidden-layer neural networks. The controlled systems must be locally hermitian and observable. Stability of the closed-loop system is demonstrated by determining a Lyapunov function, which can be used to identify a finite stability region about the regulator point.

Green provisioning of the traffic partition grooming in robust, reconfigurable and heterogeneous optical networks

Science.gov (United States)

Hou, Weigang; Yu, Yao; Song, Qingyang; Gong, Xiaoxue

2013-01-01

In recent years, various high-speed network architectures have been widespread deployed. Dense Wavelength Division Multiplexing (DWDM) has gained favor as a terabit solution. The optical circuit switching has also been provided for "sub-rate" aggregation. Such that, the granular types of demands tend to be diverse and must be evaluated. However, current dedicated optical networks do not offer sufficient flexibility to satisfy the requirements of demands with such wide range of granularities. The traffic grooming becomes a power-efficient one only when it does not utilize the aggregation of Coarse-Granularity (CG) demands. The waveband switching merely provides port-cost-effective connections for CG demands regardless of fine-granularity ones. Consequently, in this paper, we devise a heterogeneous grooming method called traffic partition grooming. It combines the power efficiency advantage of the traffic grooming under fine-granularity environment and the port savings advantage of the waveband switching under coarse-granularity environment to provide green provisioning. In addition, the optical virtual topology self-reconfigures along with various optimization objectives variation and has the robustness to determine the pre-unknown information. This paper is also the first work on investigating the issue of Robust, Reconfigurable and Heterogeneous Optical Networking (R2HON). The effective green provisioning and OPEX savings of our R2HON have been demonstrated by numerical simulations.

More Opportunities than Wealth: Inequality and Emergent Social Classes in a Network of Power and Frustration

Science.gov (United States)

Nisoli, Cristiano; Mahault, Benoit; Saxena, Avadh

We introduce a minimal agent-based model to qualitatively conceptualize the allocation of limited wealth among more abundant opportunities. There the interplay of power, satisfaction and frustration determines the distribution, concentration, and inequality of wealth. Our framework allows us to compare subjective measures of frustration and satisfaction to collective measures of fairness in wealth distribution, such as the Lorenz curve and the Gini index. We find that a completely libertarian, law-of-the-jungle setting, where every agent can acquire wealth from, or lose wealth to, anybody else invariably leads to large inequality. The picture is however dramatically modified when hard constraints are imposed over agents, and they are limited to share wealth with neighbors on a network. We address dynamical societies via an out of equilibrium coevolution of the network, driven by a competition between power and frustration. The ratio between power and frustration controls different dynamical regimes separated by kinetic transitions and characterized by drastically different values of the indices of equality. In particular, it leads to the emergence of three self-organized social classes, lower, middle, and upper class, whose interactions drive a cyclical regime.

On skein relations in class S theories

International Nuclear Information System (INIS)

Tachikawa, Yuji; Watanabe, Noriaki

2015-01-01

Loop operators of a class S theory arise from networks on the corresponding Riemann surface, and their operator product expansions are given in terms of the skein relations, that we describe in detail in the case of class S theories of type A. As two applications, we explicitly determine networks corresponding to dyonic loops of N=4SU(3) super Yang-Mills, and compute the superconformal index of a nontrivial network operator of the T 3 theory.

NN-align. An artificial neural network-based alignment algorithm for MHC class II peptide binding prediction

Directory of Open Access Journals (Sweden)

Lund Ole

2009-09-01

Full Text Available Abstract Background The major histocompatibility complex (MHC molecule plays a central role in controlling the adaptive immune response to infections. MHC class I molecules present peptides derived from intracellular proteins to cytotoxic T cells, whereas MHC class II molecules stimulate cellular and humoral immunity through presentation of extracellularly derived peptides to helper T cells. Identification of which peptides will bind a given MHC molecule is thus of great importance for the understanding of host-pathogen interactions, and large efforts have been placed in developing algorithms capable of predicting this binding event. Results Here, we present a novel artificial neural network-based method, NN-align that allows for simultaneous identification of the MHC class II binding core and binding affinity. NN-align is trained using a novel training algorithm that allows for correction of bias in the training data due to redundant binding core representation. Incorporation of information about the residues flanking the peptide-binding core is shown to significantly improve the prediction accuracy. The method is evaluated on a large-scale benchmark consisting of six independent data sets covering 14 human MHC class II alleles, and is demonstrated to outperform other state-of-the-art MHC class II prediction methods. Conclusion The NN-align method is competitive with the state-of-the-art MHC class II peptide binding prediction algorithms. The method is publicly available at http://www.cbs.dtu.dk/services/NetMHCII-2.0.

Virtualized Network Control (VNC)

Energy Technology Data Exchange (ETDEWEB)

Lehman, Thomas [Univ. of Southern California, Los Angeles, CA (United States); Guok, Chin [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Ghani, Nasir [Univ. of New Mexico, Albuquerque, NM (United States)

2013-01-31

The focus of this project was on the development of a "Network Service Plane" as an abstraction model for the control and provisioning of multi-layer networks. The primary motivation for this work were the requirements of next generation networked applications which will need to access advanced networking as a first class resource at the same level as compute and storage resources. A new class of "Intelligent Network Services" were defined in order to facilitate the integration of advanced network services into application specific workflows. This new class of network services are intended to enable real-time interaction between the application co-scheduling algorithms and the network for the purposes of workflow planning, real-time resource availability identification, scheduling, and provisioning actions.

Understanding Intra-Class Knowledge Inside CNN

OpenAIRE

Wei, Donglai; Zhou, Bolei; Torrabla, Antonio; Freeman, William

2015-01-01

Convolutional Neural Network (CNN) has been successful in image recognition tasks, and recent works shed lights on how CNN separates different classes with the learned inter-class knowledge through visualization. In this work, we instead visualize the intra-class knowledge inside CNN to better understand how an object class is represented in the fully-connected layers. To invert the intra-class knowledge into more interpretable images, we propose a non-parametric patch prior upon previous CNN...

Sending Learning Pills to Mobile Devices in Class to Enhance Student Performance and Motivation in Network Services Configuration Courses

Science.gov (United States)

Munoz-Organero, M.; Munoz-Merino, P. J.; Kloos, C. D.

2012-01-01

Teaching electrical and computer software engineers how to configure network services normally requires the detailed presentation of many configuration commands and their numerous parameters. Students tend to find it difficult to maintain acceptable levels of motivation. In many cases, this results in their not attending classes and not dedicating…

Social class shapes the form and function of relationships and selves.

Science.gov (United States)

Carey, Rebecca M; Markus, Hazel Rose

2017-12-01

Social class shapes relational realities, which in turn situate and structure different selves and their associated psychological tendencies. We first briefly review how higher class contexts tend to foster independent models of self and lower class contexts tend to foster interdependent models of self. We then consider how these independent and interdependent models of self are situated in and adapted to different social class-driven relational realities. We review research demonstrating that in lower social class contexts, social networks tend to be small, dense, homogenous and strongly connected. Ties in these networks provide the bonding capital that is key for survival and that promotes the interdependence between self and other(s). In higher social class contexts, social networks tend to be large, far-reaching, diverse and loosely connected. Ties in these networks provide the bridging capital that is key for achieving personal goals and that promotes an independence of self from other. We conclude that understanding and addressing issues tied to social class and inequality requires understanding the form and function of relationships across class contexts. Copyright © 2017 Elsevier Ltd. All rights reserved.

Applications of neural network prediction of conformational states for small peptides from spectra and of fold classes

DEFF Research Database (Denmark)

Bohr, Henrik; Røgen, Peter; Jalkanen, Karl J.

2001-01-01

but already at this stage they could be compared with reasonable agreements to experiments. The neural networks are shown to be good in distinguishing the different conformers of the small alanine peptides. especially when in the gas phase. Also the task of predicting protein fold-classes, defined from line...... to construct vibrational spectra for each of the conformational states with low energy. From the spectra, neural networks could be trained to distinguish between the various states and thus be able to generate a larger set of relevant structures and their relation to secondary structures of the peptides....... The calculations were done both with solvent atoms (up to ten water molecules) and without, and hence the neural networks could be used to monitor the influence of the solvent on hydrogen bond formation. The calculations at this stage only involved very short peptide fragments of a few alanine amino acids...

Ab initio and template-based prediction of multi-class distance maps by two-dimensional recursive neural networks

Directory of Open Access Journals (Sweden)

Martin Alberto JM

2009-01-01

Full Text Available Abstract Background Prediction of protein structures from their sequences is still one of the open grand challenges of computational biology. Some approaches to protein structure prediction, especially ab initio ones, rely to some extent on the prediction of residue contact maps. Residue contact map predictions have been assessed at the CASP competition for several years now. Although it has been shown that exact contact maps generally yield correct three-dimensional structures, this is true only at a relatively low resolution (3–4 Å from the native structure. Another known weakness of contact maps is that they are generally predicted ab initio, that is not exploiting information about potential homologues of known structure. Results We introduce a new class of distance restraints for protein structures: multi-class distance maps. We show that Cα trace reconstructions based on 4-class native maps are significantly better than those from residue contact maps. We then build two predictors of 4-class maps based on recursive neural networks: one ab initio, or relying on the sequence and on evolutionary information; one template-based, or in which homology information to known structures is provided as a further input. We show that virtually any level of sequence similarity to structural templates (down to less than 10% yields more accurate 4-class maps than the ab initio predictor. We show that template-based predictions by recursive neural networks are consistently better than the best template and than a number of combinations of the best available templates. We also extract binary residue contact maps at an 8 Å threshold (as per CASP assessment from the 4-class predictors and show that the template-based version is also more accurate than the best template and consistently better than the ab initio one, down to very low levels of sequence identity to structural templates. Furthermore, we test both ab-initio and template-based 8 �

A Comparison of Geographic Information Systems, Complex Networks, and Other Models for Analyzing Transportation Network Topologies

Science.gov (United States)

Alexandrov, Natalia (Technical Monitor); Kuby, Michael; Tierney, Sean; Roberts, Tyler; Upchurch, Christopher

2005-01-01

This report reviews six classes of models that are used for studying transportation network topologies. The report is motivated by two main questions. First, what can the "new science" of complex networks (scale-free, small-world networks) contribute to our understanding of transport network structure, compared to more traditional methods? Second, how can geographic information systems (GIS) contribute to studying transport networks? The report defines terms that can be used to classify different kinds of models by their function, composition, mechanism, spatial and temporal dimensions, certainty, linearity, and resolution. Six broad classes of models for analyzing transport network topologies are then explored: GIS; static graph theory; complex networks; mathematical programming; simulation; and agent-based modeling. Each class of models is defined and classified according to the attributes introduced earlier. The paper identifies some typical types of research questions about network structure that have been addressed by each class of model in the literature.

A single network adaptive critic (SNAC) architecture for optimal control synthesis for a class of nonlinear systems.

Science.gov (United States)

Padhi, Radhakant; Unnikrishnan, Nishant; Wang, Xiaohua; Balakrishnan, S N

2006-12-01

Even though dynamic programming offers an optimal control solution in a state feedback form, the method is overwhelmed by computational and storage requirements. Approximate dynamic programming implemented with an Adaptive Critic (AC) neural network structure has evolved as a powerful alternative technique that obviates the need for excessive computations and storage requirements in solving optimal control problems. In this paper, an improvement to the AC architecture, called the "Single Network Adaptive Critic (SNAC)" is presented. This approach is applicable to a wide class of nonlinear systems where the optimal control (stationary) equation can be explicitly expressed in terms of the state and costate variables. The selection of this terminology is guided by the fact that it eliminates the use of one neural network (namely the action network) that is part of a typical dual network AC setup. As a consequence, the SNAC architecture offers three potential advantages: a simpler architecture, lesser computational load and elimination of the approximation error associated with the eliminated network. In order to demonstrate these benefits and the control synthesis technique using SNAC, two problems have been solved with the AC and SNAC approaches and their computational performances are compared. One of these problems is a real-life Micro-Electro-Mechanical-system (MEMS) problem, which demonstrates that the SNAC technique is applicable to complex engineering systems.

A latent class analysis of friendship network types and their predictors in the second half of life.

Science.gov (United States)

Miche, Martina; Huxhold, Oliver; Stevens, Nan L

2013-07-01

Friendships contribute uniquely to well-being in (late) adulthood. However, studies on friendship often ignore interindividual differences in friendship patterns. The aim of this study was to investigate such differences including their predictors. The study builds on Matthews's qualitative model of friendship styles. Matthews distinguished 3 approaches to friendship differing by number of friends, duration of friendships, and emotional closeness. We used latent class analysis to identify friendship network types in a sample of middle-aged and older adults aged 40-85 years (N = 1,876). Data came from the German Aging Survey (DEAS). Our analysis revealed 4 distinct friendship network types that were in high congruence with Matthews's typology. We identified these as a discerning style, which focuses on few close relationships, an independent style, which refrains from close engagements, and 2 acquisitive styles that both acquire new friends across their whole life course but differ regarding the emotional closeness of their friendships. Socioeconomic status, gender, health, and network-disturbing and network-sustaining variables predicted affiliations with network types. We argue that future studies should consider a holistic view of friendships in order to better understand the association between friendships and well-being in the second half of life.

The Terabit/s Super-Fragment Builder and Trigger Throttling System for the Compact Muon Solenoid Experiment at CERN

CERN Document Server

Bauer, Gerry; Boyer, Vincent; Branson, James; Brett, Angela; Cano, Eric; Carboni, Andrea; Ciganek, Marek; Cittolin, Sergio; Erhan, Samim; Gigi, Dominique; Glege, Frank; Gómez-Reino, Robert; Gulmini, Michele; Gutíerrez-Mlot, Esteban; Gutleber, Johannes; Jacobs, Claude; Kim, Jin Cheol; Klute, Markus; Lipeles, Elliot; Lopez-Perez, Juan Antonio; Maron, Gaetano; Meijers, Frans; Meschi, Emilio; Moser, Roland; Murray, Steven; Oh, Alexander; Orsini, Luciano; Paus, Christoph; Petrucci, Andrea; Pieri, Marco; Pollet, Lucien; Rácz, Attila; Sakulin, Hannes; Sani, Matteo; Schieferdecker, Philipp; Schwick, Christoph; Sumorok, Konstanty; Suzuki, Ichiro; Tsirigkas, Dimitrios

2007-01-01

The Data Acquisition System of the Compact Muon Solenoid experiment at the Large Hadron Collider reads out event fragments of an average size of 2 kilobytes from around 650 detector front-ends at a rate of up to 100 kHz. The first stage of event-building is performed by the Super-Fragment Builder employing custom-built electronics and a Myrinet optical network. It reduces the number of fragments by one order of magnitude, thereby greatly decreasing the requirements for the subsequent event-assembly stage. By providing fast feedback from any of the front-ends to the trigger, the Trigger Throttling System prevents buffer overflows in the front-end electronics due to variations in the size and rate of events or due to back-pressure from the down-stream event-building and processing. This paper reports on new performance measurements and on the recent successful integration of a scaled-down setup of the described system with the trigger and with front-ends of all major sub-detectors. The on-going commissioning of...

A novel one-class SVM based negative data sampling method for reconstructing proteome-wide HTLV-human protein interaction networks.

Science.gov (United States)

Mei, Suyu; Zhu, Hao

2015-01-26

Protein-protein interaction (PPI) prediction is generally treated as a problem of binary classification wherein negative data sampling is still an open problem to be addressed. The commonly used random sampling is prone to yield less representative negative data with considerable false negatives. Meanwhile rational constraints are seldom exerted on model selection to reduce the risk of false positive predictions for most of the existing computational methods. In this work, we propose a novel negative data sampling method based on one-class SVM (support vector machine, SVM) to predict proteome-wide protein interactions between HTLV retrovirus and Homo sapiens, wherein one-class SVM is used to choose reliable and representative negative data, and two-class SVM is used to yield proteome-wide outcomes as predictive feedback for rational model selection. Computational results suggest that one-class SVM is more suited to be used as negative data sampling method than two-class PPI predictor, and the predictive feedback constrained model selection helps to yield a rational predictive model that reduces the risk of false positive predictions. Some predictions have been validated by the recent literature. Lastly, gene ontology based clustering of the predicted PPI networks is conducted to provide valuable cues for the pathogenesis of HTLV retrovirus.

Are Ghanaian Diaspora Middle Class? Linking Middle Class to ...

African Journals Online (AJOL)

2015-06-24

Jun 24, 2015 ... Enfin, nous analyserons l'influence de cette élite dans le .... In other words, many people who are considered middle class, sometimes in a month ..... the same area, will in future help my children to have a network of friends .... Ghanaian politics since 1992, where the ruling party does not win an election to.

Network cohesion

OpenAIRE

Cavalcanti, Tiago Vanderlei; Giannitsarou, Chrysi; Johnson, CR

2017-01-01

We define a measure of network cohesion and show how it arises naturally in a broad class of dynamic models of endogenous perpetual growth with network externalities. Via a standard growth model, we show why network cohesion is crucial for conditional convergence and explain that as cohesion increases, convergence is faster. We prove properties of network cohesion and define a network aggregator that preserves network cohesion.

Social and content aware One-Class recommendation of papers in scientific social networks.

Science.gov (United States)

Wang, Gang; He, XiRan; Ishuga, Carolyne Isigi

2017-01-01

With the rapid development of information technology, scientific social networks (SSNs) have become the fastest and most convenient way for researchers to communicate with each other. Many published papers are shared via SSNs every day, resulting in the problem of information overload. How to appropriately recommend personalized and highly valuable papers for researchers is becoming more urgent. However, when recommending papers in SSNs, only a small amount of positive instances are available, leaving a vast amount of unlabelled data, in which negative instances and potential unseen positive instances are mixed together, which naturally belongs to One-Class Collaborative Filtering (OCCF) problem. Therefore, considering the extreme data imbalance and data sparsity of this OCCF problem, a hybrid approach of Social and Content aware One-class Recommendation of Papers in SSNs, termed SCORP, is proposed in this study. Unlike previous approaches recommended to address the OCCF problem, social information, which has been proved playing a significant role in performing recommendations in many domains, is applied in both the profiling of content-based filtering and the collaborative filtering to achieve superior recommendations. To verify the effectiveness of the proposed SCORP approach, a real-life dataset from CiteULike was employed. The experimental results demonstrate that the proposed approach is superior to all of the compared approaches, thus providing a more effective method for recommending papers in SSNs.

Advanced time and wavelength division multiplexing for metropolitan area optical data communication networks

Science.gov (United States)

Watford, M.; DeCusatis, C.

2005-09-01

With the advent of new regulations governing the protection and recovery of sensitive business data, including the Sarbanes-Oxley Act, there has been a renewed interest in business continuity and disaster recovery applications for metropolitan area networks. Specifically, there has been a need for more efficient bandwidth utilization and lower cost per channel to facilitate mirroring of multi-terabit data bases. These applications have further blurred the boundary between metropolitan and wide area networks, with synchronous disaster recovery applications running up to 100 km and asynchronous solutions extending to 300 km or more. In this paper, we discuss recent enhancements in the Nortel Optical Metro 5200 Dense Wavelength Division Multiplexing (DWDM) platform, including features recently qualified for data communication applications such as Metro Mirror, Global Mirror, and Geographically Distributed Parallel Sysplex (GDPS). Using a 10 Gigabit/second (Gbit/s) backbone, this solution transports significantly more Fibre Channel protocol traffic with up to five times greater hardware density in the same physical package. This is also among the first platforms to utilize forward error correction (FEC) on the aggregate signals to improve bit error rate (BER) performance beyond industry standards. When combined with encapsulation into wide area network protocols, the use of FEC can compensate for impairments in BER across a service provider infrastructure without impacting application level performance. Design and implementation of these features will be discussed, including results from experimental test beds which validate these solutions for a number of applications. Future extensions of this environment will also be considered, including ways to provide configurable bandwidth on demand, mitigate Fibre Channel buffer credit management issues, and support for other GDPS protocols.

An Overview of a Class of Clock Synchronization Algorithms for Wireless Sensor Networks: A Statistical Signal Processing Perspective

Directory of Open Access Journals (Sweden)

Xu Wang

2015-08-01

Full Text Available Recently, wireless sensor networks (WSNs have drawn great interest due to their outstanding monitoring and management potential in medical, environmental and industrial applications. Most of the applications that employ WSNs demand all of the sensor nodes to run on a common time scale, a requirement that highlights the importance of clock synchronization. The clock synchronization problem in WSNs is inherently related to parameter estimation. The accuracy of clock synchronization algorithms depends essentially on the statistical properties of the parameter estimation algorithms. Recently, studies dedicated to the estimation of synchronization parameters, such as clock offset and skew, have begun to emerge in the literature. The aim of this article is to provide an overview of the state-of-the-art clock synchronization algorithms for WSNs from a statistical signal processing point of view. This article focuses on describing the key features of the class of clock synchronization algorithms that exploit the traditional two-way message (signal exchange mechanism. Upon introducing the two-way message exchange mechanism, the main clock offset estimation algorithms for pairwise synchronization of sensor nodes are first reviewed, and their performance is compared. The class of fully-distributed clock offset estimation algorithms for network-wide synchronization is then surveyed. The paper concludes with a list of open research problems pertaining to clock synchronization of WSNs.

Collective network routing

Science.gov (United States)

Hoenicke, Dirk

2014-12-02

Disclosed are a unified method and apparatus to classify, route, and process injected data packets into a network so as to belong to a plurality of logical networks, each implementing a specific flow of data on top of a common physical network. The method allows to locally identify collectives of packets for local processing, such as the computation of the sum, difference, maximum, minimum, or other logical operations among the identified packet collective. Packets are injected together with a class-attribute and an opcode attribute. Network routers, employing the described method, use the packet attributes to look-up the class-specific route information from a local route table, which contains the local incoming and outgoing directions as part of the specifically implemented global data flow of the particular virtual network.

Herding Complex Networks

KAUST Repository

Ruf, Sebastian F.; Egersted, Magnus; Shamma, Jeff S.

2018-01-01

the ability to drive a system to a specific set in the state space, was recently introduced as an alternative network control notion. This paper considers the application of herdability to the study of complex networks. The herdability of a class of networked

Prototype-Incorporated Emotional Neural Network.

Science.gov (United States)

Oyedotun, Oyebade K; Khashman, Adnan

2017-08-15

Artificial neural networks (ANNs) aim to simulate the biological neural activities. Interestingly, many ''engineering'' prospects in ANN have relied on motivations from cognition and psychology studies. So far, two important learning theories that have been subject of active research are the prototype and adaptive learning theories. The learning rules employed for ANNs can be related to adaptive learning theory, where several examples of the different classes in a task are supplied to the network for adjusting internal parameters. Conversely, the prototype-learning theory uses prototypes (representative examples); usually, one prototype per class of the different classes contained in the task. These prototypes are supplied for systematic matching with new examples so that class association can be achieved. In this paper, we propose and implement a novel neural network algorithm based on modifying the emotional neural network (EmNN) model to unify the prototype- and adaptive-learning theories. We refer to our new model as ``prototype-incorporated EmNN''. Furthermore, we apply the proposed model to two real-life challenging tasks, namely, static hand-gesture recognition and face recognition, and compare the result to those obtained using the popular back-propagation neural network (BPNN), emotional BPNN (EmNN), deep networks, an exemplar classification model, and k-nearest neighbor.

Slow-light enhancement of spontaneous emission in active photonic crystal waveguides

DEFF Research Database (Denmark)

Ek, Sara; Chen, Yaohui; Semenova, Elizaveta

2012-01-01

Photonic crystal defect waveguides with embedded active layers containing single or multiple quantum wells or quantum dots have been fabricated. Spontaneous emission spectra are enhanced close to the bandedge, consistently with the enhancement of gain by slow light effects. These are promising...... results for future compact devices for terabit/s communication, such as miniaturised semiconductor optical amplifiers and mode-locked lasers....

A family of quantization based piecewise linear filter networks

DEFF Research Database (Denmark)

Sørensen, John Aasted

1992-01-01

A family of quantization-based piecewise linear filter networks is proposed. For stationary signals, a filter network from this family is a generalization of the classical Wiener filter with an input signal and a desired response. The construction of the filter network is based on quantization...... of the input signal x(n) into quantization classes. With each quantization class is associated a linear filter. The filtering at time n is carried out by the filter belonging to the actual quantization class of x(n ) and the filters belonging to the neighbor quantization classes of x(n) (regularization......). This construction leads to a three-layer filter network. The first layer consists of the quantization class filters for the input signal. The second layer carries out the regularization between neighbor quantization classes, and the third layer constitutes a decision of quantization class from where the resulting...

Adaptive Learning in Weighted Network Games

NARCIS (Netherlands)

Bayer, Péter; Herings, P. Jean-Jacques; Peeters, Ronald; Thuijsman, Frank

2017-01-01

This paper studies adaptive learning in the class of weighted network games. This class of games includes applications like research and development within interlinked firms, crime within social networks, the economics of pollution, and defense expenditures within allied nations. We show that for

Percolation and epidemics in random clustered networks

Science.gov (United States)

Miller, Joel C.

2009-08-01

The social networks that infectious diseases spread along are typically clustered. Because of the close relation between percolation and epidemic spread, the behavior of percolation in such networks gives insight into infectious disease dynamics. A number of authors have studied percolation or epidemics in clustered networks, but the networks often contain preferential contacts in high degree nodes. We introduce a class of random clustered networks and a class of random unclustered networks with the same preferential mixing. Percolation in the clustered networks reduces the component sizes and increases the epidemic threshold compared to the unclustered networks.

A high-efficiency low-voltage class-E PA for IoT applications in sub-1 GHz frequency range

Science.gov (United States)

Zhou, Chenyi; Lu, Zhenghao; Gu, Jiangmin; Yu, Xiaopeng

2017-10-01

We present and propose a complete and iterative integrated-circuit and electro-magnetic (EM) co-design methodology and procedure for a low-voltage sub-1 GHz class-E PA. The presented class-E PA consists of the on-chip power transistor, the on-chip gate driving circuits, the off-chip tunable LC load network and the off-chip LC ladder low pass filter. The design methodology includes an explicit design equation based circuit components values' analysis and numerical derivation, output power targeted transistor size and low pass filter design, and power efficiency oriented design optimization. The proposed design procedure includes the power efficiency oriented LC network tuning, the detailed circuit/EM co-simulation plan on integrated circuit level, package level and PCB level to ensure an accurate simulation to measurement match and first pass design success. The proposed PA is targeted to achieve more than 15 dBm output power delivery and 40% power efficiency at 433 MHz frequency band with 1.5 V low voltage supply. The LC load network is designed to be off-chip for the purpose of easy tuning and optimization. The same circuit can be extended to all sub-1 GHz applications with the same tuning and optimization on the load network at different frequencies. The amplifier is implemented in 0.13 μm CMOS technology with a core area occupation of 400 μm by 300 μm. Measurement results showed that it provided power delivery of 16.42 dBm at antenna with efficiency of 40.6%. A harmonics suppression of 44 dBc is achieved, making it suitable for massive deployment of IoT devices. Project supported by the National Natural Science Foundation of China (No. 61574125) and the Industry Innovation Project of Suzhou City of China (No. SYG201641).

The structural dynamics of social class.

Science.gov (United States)

Kraus, Michael W; Park, Jun Won

2017-12-01

Individual agency accounts of social class persist in society and even in psychological science despite clear evidence for the role of social structures. This article argues that social class is defined by the structural dynamics of society. Specifically, access to powerful networks, groups, and institutions, and inequalities in wealth and other economic resources shape proximal social environments that influence how individuals express their internal states and motivations. An account of social class that highlights the means by which structures shape and are shaped by individuals guides our understanding of how people move up or down in the social class hierarchy, and provides a framework for interpreting neuroscience studies, experimental paradigms, and approaches that attempt to intervene on social class disparities. Copyright © 2017 Elsevier Ltd. All rights reserved.

Complex networks for data-driven medicine: the case of Class III dentoskeletal disharmony

International Nuclear Information System (INIS)

Scala, A; Auconi, P; Scazzocchio, M; Caldarelli, G; McNamara, JA; Franchi, L

2014-01-01

In the last decade, the availability of innovative algorithms derived from complexity theory has inspired the development of highly detailed models in various fields, including physics, biology, ecology, economy, and medicine. Due to the availability of novel and ever more sophisticated diagnostic procedures, all biomedical disciplines face the problem of using the increasing amount of information concerning each patient to improve diagnosis and prevention. In particular, in the discipline of orthodontics the current diagnostic approach based on clinical and radiographic data is problematic due to the complexity of craniofacial features and to the numerous interacting co-dependent skeletal and dentoalveolar components. In this study, we demonstrate the capability of computational methods such as network analysis and module detection to extract organizing principles in 70 patients with excessive mandibular skeletal protrusion with underbite, a condition known in orthodontics as Class III malocclusion. Our results could possibly constitute a template framework for organising the increasing amount of medical data available for patients’ diagnosis. (paper)

Gapped sequence alignment using artificial neural networks: application to the MHC class I system

DEFF Research Database (Denmark)

Andreatta, Massimo; Nielsen, Morten

2016-01-01

. On this relatively simple system, we developed a sequence alignment method based on artificial neural networks that allows insertions and deletions in the alignment. Results: We show that prediction methods based on alignments that include insertions and deletions have significantly higher performance than methods...... trained on peptides of single lengths. Also, we illustrate how the location of deletions can aid the interpretation of the modes of binding of the peptide-MHC, as in the case of long peptides bulging out of the MHC groove or protruding at either terminus. Finally, we demonstrate that the method can learn...... the length profile of different MHC molecules, and quantified the reduction of the experimental effort required to identify potential epitopes using our prediction algorithm. Availability and implementation: The NetMHC-4.0 method for the prediction of peptide-MHC class I binding affinity using gapped...

The Internet drag race

CERN Document Server

Fitchard, Kevin

2004-01-01

The Internet2 consortium members from California Institute of Technology and CERN developed effective fiber optic network, sending data upto 11,000 kilometers between Caltech's LA laboratories and CERN's campus in Geneva at a rate of 6.25 Gb/s. The 68,431 terabit- meters per second data transfer was accomplished using the IPv4 protocols that power the public Internet. Network run by Internet2, called Abilene maintains the highest capacities in the world, connecting dozens of GigaPOP's with OC-192c 10 Gb/s Ip backbone. The member institutions of Internet2 keep Abilene 10% to 15% full, but the researchers also use the network as a base for the latest Internet technologies and experiments, which include development of IPv6. (Edited abstract).

Quantized, piecewise linear filter network

DEFF Research Database (Denmark)

Sørensen, John Aasted

1993-01-01

A quantization based piecewise linear filter network is defined. A method for the training of this network based on local approximation in the input space is devised. The training is carried out by repeatedly alternating between vector quantization of the training set into quantization classes...... and equalization of the quantization classes linear filter mean square training errors. The equalization of the mean square training errors is carried out by adapting the boundaries between neighbor quantization classes such that the differences in mean square training errors are reduced...

Google in a Quantum Network

Science.gov (United States)

Paparo, Giuseppe

2013-03-01

In we introduce the characterization of a class of quantum PageRank algorithms in a scenario in which some kind of quantum network is realizable out of the current classical internet web, but no quantum computer is yet available. This class of algorithms represents a quantization of the PageRank protocol currently employed to list web pages according to their importance. The PageRank algorithm's ranking ability has been instrumental to give structure to the web. This class of algorithms may be able to rank nodes in a quantum network. Furthermore, in this class, we have found an instance of this class of quantum protocols that outperforms its classical counterpart and may break the classical hierarchy of web pages depending on the topology of the web.

Inferring general relations between network characteristics from specific network ensembles.

Science.gov (United States)

Cardanobile, Stefano; Pernice, Volker; Deger, Moritz; Rotter, Stefan

2012-01-01

Different network models have been suggested for the topology underlying complex interactions in natural systems. These models are aimed at replicating specific statistical features encountered in real-world networks. However, it is rarely considered to which degree the results obtained for one particular network class can be extrapolated to real-world networks. We address this issue by comparing different classical and more recently developed network models with respect to their ability to generate networks with large structural variability. In particular, we consider the statistical constraints which the respective construction scheme imposes on the generated networks. After having identified the most variable networks, we address the issue of which constraints are common to all network classes and are thus suitable candidates for being generic statistical laws of complex networks. In fact, we find that generic, not model-related dependencies between different network characteristics do exist. This makes it possible to infer global features from local ones using regression models trained on networks with high generalization power. Our results confirm and extend previous findings regarding the synchronization properties of neural networks. Our method seems especially relevant for large networks, which are difficult to map completely, like the neural networks in the brain. The structure of such large networks cannot be fully sampled with the present technology. Our approach provides a method to estimate global properties of under-sampled networks in good approximation. Finally, we demonstrate on three different data sets (C. elegans neuronal network, R. prowazekii metabolic network, and a network of synonyms extracted from Roget's Thesaurus) that real-world networks have statistical relations compatible with those obtained using regression models.

A class Hierarchical, object-oriented approach to virtual memory management

Science.gov (United States)

Russo, Vincent F.; Campbell, Roy H.; Johnston, Gary M.

1989-01-01

The Choices family of operating systems exploits class hierarchies and object-oriented programming to facilitate the construction of customized operating systems for shared memory and networked multiprocessors. The software is being used in the Tapestry laboratory to study the performance of algorithms, mechanisms, and policies for parallel systems. Described here are the architectural design and class hierarchy of the Choices virtual memory management system. The software and hardware mechanisms and policies of a virtual memory system implement a memory hierarchy that exploits the trade-off between response times and storage capacities. In Choices, the notion of a memory hierarchy is captured by abstract classes. Concrete subclasses of those abstractions implement a virtual address space, segmentation, paging, physical memory management, secondary storage, and remote (that is, networked) storage. Captured in the notion of a memory hierarchy are classes that represent memory objects. These classes provide a storage mechanism that contains encapsulated data and have methods to read or write the memory object. Each of these classes provides specializations to represent the memory hierarchy.

A network approach to orthodontic diagnosis.

Science.gov (United States)

Auconi, P; Caldarelli, G; Scala, A; Ierardo, G; Polimeni, A

2011-11-01

Network analysis, a recent advancement in complexity science, enables understanding of the properties of complex biological processes characterized by the interaction, adaptive regulation, and coordination of a large number of participating components. We applied network analysis to orthodontics to detect and visualize the most interconnected clinical, radiographic, and functional data pertaining to the orofacial system. The sample consisted of 104 individuals from 7 to 13 years of age in the mixed dentition phase without previous orthodontic intervention. The subjects were divided according to skeletal class; their clinical, radiographic, and functional features were represented as vertices (nodes) and links (edges) connecting them. Class II subjects exhibited few highly connected orthodontic features (hubs), while Class III patients showed a more compact network structure characterized by strong co-occurrence of normal and abnormal clinical, functional, and radiological features. Restricting our analysis to the highest correlations, we identified critical peculiarities of Class II and Class III malocclusions. The topology of the dentofacial system obtained by network analysis could allow orthodontists to visually evaluate and anticipate the co-occurrence of auxological anomalies during individual craniofacial growth and possibly localize reactive sites for a therapeutic approach to malocclusion. © 2011 John Wiley & Sons A/S.

A 32 terabit/s data acquisition from mostly COTS components

CERN Document Server

Schwemmer, Rainer

2015-01-01

The Large Hadron Collider beauty (LHCb) data acquisition after 2019 will need to perform event-building at an aggregated band-width of 32 Tbit/s. Apart from the technological challenges described in various papers also at this conference, the key challenge is to come up with an architecture which minimises the cost, while providing a system which can be maintained by a small team for a long time and which scales well. In this paper we present the analyses we have been doing to minimise the cost, the R&D topics we derived from that and how we combined all this into a coherent proposal which allows us to come up with a system which not only today fits the budgetary constraints of LHCb, but also will allow profiting from any main-stream technological development. We achieve this by aligning our system needs as much as possible to data-centre mass-market commercial of the shelf (COTS) products; by minimising the number of optical interconnects and by optimising the physical layout of the system. This system r...

Latent class analysis of diagnostic science assessment data using Bayesian networks

Science.gov (United States)

Steedle, Jeffrey Thomas

2008-10-01

Diagnostic science assessments seek to draw inferences about student understanding by eliciting evidence about the mental models that underlie students' reasoning about physical systems. Measurement techniques for analyzing data from such assessments embody one of two contrasting assessment programs: learning progressions and facet-based assessments. Learning progressions assume that students have coherent theories that they apply systematically across different problem contexts. In contrast, the facet approach makes no such assumption, so students should not be expected to reason systematically across different problem contexts. A systematic comparison of these two approaches is of great practical value to assessment programs such as the National Assessment of Educational Progress as they seek to incorporate small clusters of related items in their tests for the purpose of measuring depth of understanding. This dissertation describes an investigation comparing learning progression and facet models. Data comprised student responses to small clusters of multiple-choice diagnostic science items focusing on narrow aspects of understanding of Newtonian mechanics. Latent class analysis was employed using Bayesian networks in order to model the relationship between students' science understanding and item responses. Separate models reflecting the assumptions of the learning progression and facet approaches were fit to the data. The technical qualities of inferences about student understanding resulting from the two models were compared in order to determine if either modeling approach was more appropriate. Specifically, models were compared on model-data fit, diagnostic reliability, diagnostic certainty, and predictive accuracy. In addition, the effects of test length were evaluated for both models in order to inform the number of items required to obtain adequately reliable latent class diagnoses. Lastly, changes in student understanding over time were studied with a

Two-phase deep convolutional neural network for reducing class skewness in histopathological images based breast cancer detection.

Science.gov (United States)

Wahab, Noorul; Khan, Asifullah; Lee, Yeon Soo

2017-06-01

Different types of breast cancer are affecting lives of women across the world. Common types include Ductal carcinoma in situ (DCIS), Invasive ductal carcinoma (IDC), Tubular carcinoma, Medullary carcinoma, and Invasive lobular carcinoma (ILC). While detecting cancer, one important factor is mitotic count - showing how rapidly the cells are dividing. But the class imbalance problem, due to the small number of mitotic nuclei in comparison to the overwhelming number of non-mitotic nuclei, affects the performance of classification models. This work presents a two-phase model to mitigate the class biasness issue while classifying mitotic and non-mitotic nuclei in breast cancer histopathology images through a deep convolutional neural network (CNN). First, nuclei are segmented out using blue ratio and global binary thresholding. In Phase-1 a CNN is then trained on the segmented out 80×80 pixel patches based on a standard dataset. Hard non-mitotic examples are identified and augmented; mitotic examples are oversampled by rotation and flipping; whereas non-mitotic examples are undersampled by blue ratio histogram based k-means clustering. Based on this information from Phase-1, the dataset is modified for Phase-2 in order to reduce the effects of class imbalance. The proposed CNN architecture and data balancing technique yielded an F-measure of 0.79, and outperformed all the methods relying on specific handcrafted features, as well as those using a combination of handcrafted and CNN-generated features. Copyright © 2017 Elsevier Ltd. All rights reserved.

Connectivity in the yeast cell cycle transcription network: inferences from neural networks.

Directory of Open Access Journals (Sweden)

Christopher E Hart

2006-12-01

Full Text Available A current challenge is to develop computational approaches to infer gene network regulatory relationships based on multiple types of large-scale functional genomic data. We find that single-layer feed-forward artificial neural network (ANN models can effectively discover gene network structure by integrating global in vivo protein:DNA interaction data (ChIP/Array with genome-wide microarray RNA data. We test this on the yeast cell cycle transcription network, which is composed of several hundred genes with phase-specific RNA outputs. These ANNs were robust to noise in data and to a variety of perturbations. They reliably identified and ranked 10 of 12 known major cell cycle factors at the top of a set of 204, based on a sum-of-squared weights metric. Comparative analysis of motif occurrences among multiple yeast species independently confirmed relationships inferred from ANN weights analysis. ANN models can capitalize on properties of biological gene networks that other kinds of models do not. ANNs naturally take advantage of patterns of absence, as well as presence, of factor binding associated with specific expression output; they are easily subjected to in silico "mutation" to uncover biological redundancies; and they can use the full range of factor binding values. A prominent feature of cell cycle ANNs suggested an analogous property might exist in the biological network. This postulated that "network-local discrimination" occurs when regulatory connections (here between MBF and target genes are explicitly disfavored in one network module (G2, relative to others and to the class of genes outside the mitotic network. If correct, this predicts that MBF motifs will be significantly depleted from the discriminated class and that the discrimination will persist through evolution. Analysis of distantly related Schizosaccharomyces pombe confirmed this, suggesting that network-local discrimination is real and complements well-known enrichment of

Nonbinary Tree-Based Phylogenetic Networks.

Science.gov (United States)

Jetten, Laura; van Iersel, Leo

2018-01-01

Rooted phylogenetic networks are used to describe evolutionary histories that contain non-treelike evolutionary events such as hybridization and horizontal gene transfer. In some cases, such histories can be described by a phylogenetic base-tree with additional linking arcs, which can, for example, represent gene transfer events. Such phylogenetic networks are called tree-based. Here, we consider two possible generalizations of this concept to nonbinary networks, which we call tree-based and strictly-tree-based nonbinary phylogenetic networks. We give simple graph-theoretic characterizations of tree-based and strictly-tree-based nonbinary phylogenetic networks. Moreover, we show for each of these two classes that it can be decided in polynomial time whether a given network is contained in the class. Our approach also provides a new view on tree-based binary phylogenetic networks. Finally, we discuss two examples of nonbinary phylogenetic networks in biology and show how our results can be applied to them.

Synchronization Control for a Class of Discrete-Time Dynamical Networks With Packet Dropouts: A Coding-Decoding-Based Approach.

Science.gov (United States)

Wang, Licheng; Wang, Zidong; Han, Qing-Long; Wei, Guoliang

2017-09-06

The synchronization control problem is investigated for a class of discrete-time dynamical networks with packet dropouts via a coding-decoding-based approach. The data is transmitted through digital communication channels and only the sequence of finite coded signals is sent to the controller. A series of mutually independent Bernoulli distributed random variables is utilized to model the packet dropout phenomenon occurring in the transmissions of coded signals. The purpose of the addressed synchronization control problem is to design a suitable coding-decoding procedure for each node, based on which an efficient decoder-based control protocol is developed to guarantee that the closed-loop network achieves the desired synchronization performance. By applying a modified uniform quantization approach and the Kronecker product technique, criteria for ensuring the detectability of the dynamical network are established by means of the size of the coding alphabet, the coding period and the probability information of packet dropouts. Subsequently, by resorting to the input-to-state stability theory, the desired controller parameter is obtained in terms of the solutions to a certain set of inequality constraints which can be solved effectively via available software packages. Finally, two simulation examples are provided to demonstrate the effectiveness of the obtained results.

Network cohesion

OpenAIRE

Cavalcanti, Tiago V. V.; Giannitsarou, Chryssi; Johnson, Charles R.

2016-01-01

This is the final version of the article. It first appeared from Springer via http://dx.doi.org/10.1007/s00199-016-0992-1 We define a measure of network cohesion and show how it arises naturally in a broad class of dynamic models of endogenous perpetual growth with network externalities. Via a standard growth model, we show why network cohesion is crucial for conditional convergence and explain that as cohesion increases, convergence is faster. We prove properties of network cohesion and d...

Educational commitment and social networking: The power of informal networks

Science.gov (United States)

Zwolak, Justyna P.; Zwolak, Michael; Brewe, Eric

2018-06-01

The lack of an engaging pedagogy and the highly competitive atmosphere in introductory science courses tend to discourage students from pursuing science, technology, engineering, and mathematics (STEM) majors. Once in a STEM field, academic and social integration has been long thought to be important for students' persistence. Yet, it is rarely investigated. In particular, the relative impact of in-class and out-of-class interactions remains an open issue. Here, we demonstrate that, surprisingly, for students whose grades fall in the "middle of the pack," the out-of-class network is the most significant predictor of persistence. To do so, we use logistic regression combined with Akaike's information criterion to assess in- and out-of-class networks, grades, and other factors. For students with grades at the very top (and bottom), final grade, unsurprisingly, is the best predictor of persistence—these students are likely already committed (or simply restricted from continuing) so they persist (or drop out). For intermediate grades, though, only out-of-class closeness—a measure of one's immersion in the network—helps predict persistence. This does not negate the need for in-class ties. However, it suggests that, in this cohort, only students that get past the convenient in-class interactions and start forming strong bonds outside of class are or become committed to their studies. Since many students are lost through attrition, our results suggest practical routes for increasing students' persistence in STEM majors.

Implementability of two-qubit unitary operations over the butterfly network and the ladder network with free classical communication

Energy Technology Data Exchange (ETDEWEB)

Akibue, Seiseki [Department of Physics, Graduate School of Science, The University of Tokyo, Tokyo (Japan); Murao, Mio [Department of Physics, Graduate School of Science, The University of Tokyo, Tokyo, Japan and NanoQuine, The University of Tokyo, Tokyo (Japan)

2014-12-04

We investigate distributed implementation of two-qubit unitary operations over two primitive networks, the butterfly network and the ladder network, as a first step to apply network coding for quantum computation. By classifying two-qubit unitary operations in terms of the Kraus-Cirac number, the number of non-zero parameters describing the global part of two-qubit unitary operations, we analyze which class of two-qubit unitary operations is implementable over these networks with free classical communication. For the butterfly network, we show that two classes of two-qubit unitary operations, which contain all Clifford, controlled-unitary and matchgate operations, are implementable over the network. For the ladder network, we show that two-qubit unitary operations are implementable over the network if and only if their Kraus-Cirac number do not exceed the number of the bridges of the ladder.

Implementability of two-qubit unitary operations over the butterfly network and the ladder network with free classical communication

International Nuclear Information System (INIS)

Akibue, Seiseki; Murao, Mio

2014-01-01

We investigate distributed implementation of two-qubit unitary operations over two primitive networks, the butterfly network and the ladder network, as a first step to apply network coding for quantum computation. By classifying two-qubit unitary operations in terms of the Kraus-Cirac number, the number of non-zero parameters describing the global part of two-qubit unitary operations, we analyze which class of two-qubit unitary operations is implementable over these networks with free classical communication. For the butterfly network, we show that two classes of two-qubit unitary operations, which contain all Clifford, controlled-unitary and matchgate operations, are implementable over the network. For the ladder network, we show that two-qubit unitary operations are implementable over the network if and only if their Kraus-Cirac number do not exceed the number of the bridges of the ladder

Therese: presentation of the project

Energy Technology Data Exchange (ETDEWEB)

Pendibidu, J M

1982-05-01

Therese (Terabit Reseau) is a project built around a powerful local network with high transmission speed. A lot of goodies have been incorporated to the product in order that it can be used as a general multi-purpose tool in such areas as software engineering, artificial intelligence, robotics, office automation, VLSI design, fundamental mechanics, theoretical physics, applied mathematics, computer assisted education, high speed satellite communications, performance evaluation, general system theory, reliability, high resolution graphics, public messages, private messages, fast Fourier transform, personal computing, image processing, etc. 11 references.

Social Class and School Music

Science.gov (United States)

Bates, Vincent C.

2012-01-01

This article takes a practical look at social class in school music by exploring the manifestations and impact of three of its dimensions: financial resources, cultural practices, and social networks. Three suggestions are discussed: provide a free and equal music education for all students, understand and respect each student's cultural…

Introduction

Science.gov (United States)

Callegati, Franco; Aracil, Javier; López, Víctor

At the present time, optical transmission systems are capable of sending data over hundreds of wavelengths on a single fiber thanks to dense wavelength division multiplexing (DWDM) technologies, reaching bit rates on the order of gigabits per second per wavelength and terabits per second per fiber. In the last decade the availability of such a huge bandwidth caused transport networks to be considered as having infinite capacity. The recent massive deployment of Asymmetric Digital Subscriber Line (ADSL) and broadband wireless access solutions, as well as the outburst of new multimedia network services (such as Skype, YouTube, Joost, etc.) caused a significant increase of end user traffic and bandwidth demands. Therefore, the apparently “infinite” capacity of optical networks appears much more “finite” today, despite the latest developments in photonic transmission.

Self-organization of social hierarchy on interaction networks

International Nuclear Information System (INIS)

Fujie, Ryo; Odagaki, Takashi

2011-01-01

In order to examine the effects of interaction network structures on the self-organization of social hierarchy, we introduce the agent-based model: each individual as on a node of a network has its own power and its internal state changes by fighting with its neighbors and relaxation. We adopt three different networks: regular lattice, small-world network and scale-free network. For the regular lattice, we find the emergence of classes distinguished by the internal state. The transition points where each class emerges are determined analytically, and we show that each class is characterized by the local ranking relative to their neighbors. We also find that the antiferromagnetic-like configuration emerges just above the critical point. For the heterogeneous networks, individuals become winners (or losers) in descending order of the number of their links. By using mean-field analysis, we reveal that the transition point is determined by the maximum degree and the degree distribution in its neighbors

Adaptive neural network backstepping control for a class of uncertain fractional-order chaotic systems with unknown backlash-like hysteresis

Energy Technology Data Exchange (ETDEWEB)

Wu, Yimin [School of Mathematics and Statistics, Suzhou University, Suzhou 234000 (China); Lv, Hui, E-mail: lvhui207@gmail.com [Department of Applied Mathematics, Huainan Normal University, Huainan 232038 (China)

2016-08-15

In this paper, we consider the control problem of a class of uncertain fractional-order chaotic systems preceded by unknown backlash-like hysteresis nonlinearities based on backstepping control algorithm. We model the hysteresis by using a differential equation. Based on the fractional Lyapunov stability criterion and the backstepping algorithm procedures, an adaptive neural network controller is driven. No knowledge of the upper bound of the disturbance and system uncertainty is required in our controller, and the asymptotical convergence of the tracking error can be guaranteed. Finally, we give two simulation examples to confirm our theoretical results.

Intelligent sensor networks the integration of sensor networks, signal processing and machine learning

CERN Document Server

Hu, Fei

2012-01-01

Although governments worldwide have invested significantly in intelligent sensor network research and applications, few books cover intelligent sensor networks from a machine learning and signal processing perspective. Filling this void, Intelligent Sensor Networks: The Integration of Sensor Networks, Signal Processing and Machine Learning focuses on the close integration of sensing, networking, and smart signal processing via machine learning. Based on the world-class research of award-winning authors, the book provides a firm grounding in the fundamentals of intelligent sensor networks, incl

Pinning adaptive synchronization of a class of uncertain complex dynamical networks with multi-link against network deterioration

International Nuclear Information System (INIS)

Li, Lixiang; Li, Weiwei; Kurths, Jürgen; Luo, Qun; Yang, Yixian; Li, Shudong

2015-01-01

For the reason that the uncertain complex dynamic network with multi-link is quite close to various practical networks, there is superiority in the fields of research and application. In this paper, we focus upon pinning adaptive synchronization for uncertain complex dynamic networks with multi-link against network deterioration. The pinning approach can be applied to adapt uncertain coupling factors of deteriorated networks which can compensate effects of uncertainty. Several new synchronization criterions for networks with multi-link are derived, which ensure the synchronized states to be local or global stable with uncertainty and deterioration. Results of simulation are shown to demonstrate the feasibility and usefulness of our method

Power Efficient Service Differentiation Based on Traffic-Aware Survivable Elastic Optical Networks

DEFF Research Database (Denmark)

Turus, Ioan; Fagertun, Anna Manolova; Dittmann, Lars

2014-01-01

This study assesses the feasible energy savings whendefining different service classes based on protection schemesincore optical networks.Wepropose a dedicated energy savingstrategy for each of the service classes in order to minimize theoverall power consumption of the network.Four Classes of Se...... while for the proposed approach the difference in power consumption is almost negligible.Moreover, incase of the proposed approach,silver serviceclass can benefit for superior quality of service compared to the gold service class, due to the grooming mechanism.......This study assesses the feasible energy savings whendefining different service classes based on protection schemesincore optical networks.Wepropose a dedicated energy savingstrategy for each of the service classes in order to minimize theoverall power consumption of the network.Four Classes...... the sleep-mode capability of the opto-electronic devices as well as the elastic data-rateadaptation based on symbol-rate and modulation-format re-configurations. The results show that in the baseline approach the power consumption is strongly dependent on the ratio between the different service classes...

Association and Centrality in Criminal Networks

DEFF Research Database (Denmark)

Petersen, Rasmus Rosenqvist

Network-based techniques are widely used in criminal investigations because patterns of association are actionable and understandable. Existing network models with nodes as first class entities and their related measures (e.g., social networks and centrality measures) are unable to capture...

Credal Sum-Product Networks

NARCIS (Netherlands)

Maua, Denis Deratani; Cozman, Fabio Gagli; Conaty, Diarmaid; de Campos, Cassio P.

2017-01-01

Sum-product networks are a relatively new and increasingly popular class of (precise) probabilistic graphical models that allow for marginal inference with polynomial effort. As with other probabilistic models, sum-product networks are often learned from data and used to perform classification.

Classification of protein fold classes by knot theory and prediction of folds by neural networks: A combined theoretical and experimental approach

DEFF Research Database (Denmark)

Ramnarayan, K.; Bohr, Henrik; Jalkanen, Karl J.

2008-01-01

We present different means of classifying protein structure. One is made rigorous by mathematical knot invariants that coincide reasonably well with ordinary graphical fold classification and another classification is by packing analysis. Furthermore when constructing our mathematical fold...... classifications, we utilize standard neural network methods for predicting protein fold classes from amino acid sequences. We also make an analysis of the redundancy of the structural classifications in relation to function and ligand binding. Finally we advocate the use of combining the measurement of the VA...

26 Tbit s-1 line-rate super-channel transmission utilizing all-optical fast Fourier transform processing

Science.gov (United States)

Hillerkuss, D.; Schmogrow, R.; Schellinger, T.; Jordan, M.; Winter, M.; Huber, G.; Vallaitis, T.; Bonk, R.; Kleinow, P.; Frey, F.; Roeger, M.; Koenig, S.; Ludwig, A.; Marculescu, A.; Li, J.; Hoh, M.; Dreschmann, M.; Meyer, J.; Ben Ezra, S.; Narkiss, N.; Nebendahl, B.; Parmigiani, F.; Petropoulos, P.; Resan, B.; Oehler, A.; Weingarten, K.; Ellermeyer, T.; Lutz, J.; Moeller, M.; Huebner, M.; Becker, J.; Koos, C.; Freude, W.; Leuthold, J.

2011-06-01

Optical transmission systems with terabit per second (Tbit s-1) single-channel line rates no longer seem to be too far-fetched. New services such as cloud computing, three-dimensional high-definition television and virtual-reality applications require unprecedented optical channel bandwidths. These high-capacity optical channels, however, are fed from lower-bitrate signals. The question then is whether the lower-bitrate tributary information can viably, energy-efficiently and effortlessly be encoded to and extracted from terabit per second data streams. We demonstrate an optical fast Fourier transform scheme that provides the necessary computing power to encode lower-bitrate tributaries into 10.8 and 26.0 Tbit s-1 line-rate orthogonal frequency-division multiplexing (OFDM) data streams and to decode them from fibre-transmitted OFDM data streams. Experiments show the feasibility and ease of handling terabit per second data with low energy consumption. To the best of our knowledge, this is the largest line rate ever encoded onto a single light source.

Stability and stabilisation of a class of networked dynamic systems

Science.gov (United States)

Liu, H. B.; Wang, D. Q.

2018-04-01

We investigate the stability and stabilisation of a linear time invariant networked heterogeneous system with arbitrarily connected subsystems. A new linear matrix inequality based sufficient and necessary condition for the stability is derived, based on which the stabilisation is provided. The obtained conditions efficiently utilise the block-diagonal characteristic of system parameter matrices and the sparseness of subsystem connection matrix. Moreover, a sufficient condition only dependent on each individual subsystem is also presented for the stabilisation of the networked systems with a large scale. Numerical simulations show that these conditions are computationally valid in the analysis and synthesis of a large-scale networked system.

Role models for complex networks

Science.gov (United States)

Reichardt, J.; White, D. R.

2007-11-01

We present a framework for automatically decomposing (“block-modeling”) the functional classes of agents within a complex network. These classes are represented by the nodes of an image graph (“block model”) depicting the main patterns of connectivity and thus functional roles in the network. Using a first principles approach, we derive a measure for the fit of a network to any given image graph allowing objective hypothesis testing. From the properties of an optimal fit, we derive how to find the best fitting image graph directly from the network and present a criterion to avoid overfitting. The method can handle both two-mode and one-mode data, directed and undirected as well as weighted networks and allows for different types of links to be dealt with simultaneously. It is non-parametric and computationally efficient. The concepts of structural equivalence and modularity are found as special cases of our approach. We apply our method to the world trade network and analyze the roles individual countries play in the global economy.

Event-based state estimation for a class of complex networks with time-varying delays: A comparison principle approach

Energy Technology Data Exchange (ETDEWEB)

Zhang, Wenbing [Department of Mathematics, Yangzhou University, Yangzhou 225002 (China); Wang, Zidong [Department of Computer Science, Brunel University London, Uxbridge, Middlesex, UB8 3PH (United Kingdom); Liu, Yurong, E-mail: yrliu@yzu.edu.cn [Department of Mathematics, Yangzhou University, Yangzhou 225002 (China); Communication Systems and Networks (CSN) Research Group, Faculty of Engineering, King Abdulaziz University, Jeddah 21589 (Saudi Arabia); Ding, Derui [Shanghai Key Lab of Modern Optical System, Department of Control Science and Engineering, University of Shanghai for Science and Technology, Shanghai 200093 (China); Alsaadi, Fuad E. [Communication Systems and Networks (CSN) Research Group, Faculty of Engineering, King Abdulaziz University, Jeddah 21589 (Saudi Arabia)

2017-01-05

The paper is concerned with the state estimation problem for a class of time-delayed complex networks with event-triggering communication protocol. A novel event generator function, which is dependent not only on the measurement output but also on a predefined positive constant, is proposed with hope to reduce the communication burden. A new concept of exponentially ultimate boundedness is provided to quantify the estimation performance. By means of the comparison principle, some sufficient conditions are obtained to guarantee that the estimation error is exponentially ultimately bounded, and then the estimator gains are obtained in terms of the solution of certain matrix inequalities. Furthermore, a rigorous proof is proposed to show that the designed triggering condition is free of the Zeno behavior. Finally, a numerical example is given to illustrate the effectiveness of the proposed event-based estimator. - Highlights: • An event-triggered estimator is designed for complex networks with time-varying delays. • A novel event generator function is proposed to reduce the communication burden. • The comparison principle is utilized to derive the sufficient conditions. • The designed triggering condition is shown to be free of the Zeno behavior.

Application of photonics in next generation telecommunication satellites payloads

Science.gov (United States)

Anzalchi, J.; Inigo, P.; Roy, B.

2017-11-01

Next generation broadband telecommunication satellites are required to provide very high data throughput using complex multibeam architectures. These high throughput `Terabit/s' Satellites will incorporate payloads with very large quantity of conventional RF equipment, co-axial cables, waveguides, harnesses and ancillary equipment, making the Assembly, Integration and Test (AIT) very complex. Use of `RF over Fiber' and associated photonics equipment can make the process of AIT much simpler with the added benefit of significant reduction in number of payload equipment and inherent payload mass.

Signal-regulated systems and networks

CSIR Research Space (South Africa)

Van Zyl, TL

2010-07-01

Full Text Available The article presents the use of signal regulatory networks (SRNs), a biologically inspired model based on gene regulatory networks. SRNs are a way of understanding a class of self-organizing IT systems, signal-regulated systems (SRSs). This article...

Asynchronous networks: modularization of dynamics theorem

Science.gov (United States)

Bick, Christian; Field, Michael

2017-02-01

Building on the first part of this paper, we develop the theory of functional asynchronous networks. We show that a large class of functional asynchronous networks can be (uniquely) represented as feedforward networks connecting events or dynamical modules. For these networks we can give a complete description of the network function in terms of the function of the events comprising the network: the modularization of dynamics theorem. We give examples to illustrate the main results.

A fuzzy Hopfield neural network for medical image segmentation

International Nuclear Information System (INIS)

Lin, J.S.; Cheng, K.S.; Mao, C.W.

1996-01-01

In this paper, an unsupervised parallel segmentation approach using a fuzzy Hopfield neural network (FHNN) is proposed. The main purpose is to embed fuzzy clustering into neural networks so that on-line learning and parallel implementation for medical image segmentation are feasible. The idea is to cast a clustering problem as a minimization problem where the criteria for the optimum segmentation is chosen as the minimization of the Euclidean distance between samples to class centers. In order to generate feasible results, a fuzzy c-means clustering strategy is included in the Hopfield neural network to eliminate the need of finding weighting factors in the energy function, which is formulated and based on a basic concept commonly used in pattern classification, called the within-class scatter matrix principle. The suggested fuzzy c-means clustering strategy has also been proven to be convergent and to allow the network to learn more effectively than the conventional Hopfield neural network. The fuzzy Hopfield neural network based on the within-class scatter matrix shows the promising results in comparison with the hard c-means method

Binary Stochastic Representations for Large Multi-class Classification

KAUST Repository

Gerald, Thomas; Baskiotis, Nicolas; Denoyer, Ludovic

2017-01-01

Classification with a large number of classes is a key problem in machine learning and corresponds to many real-world applications like tagging of images or textual documents in social networks. If one-vs-all methods usually reach top performance

On Tree-Based Phylogenetic Networks.

Science.gov (United States)

Zhang, Louxin

2016-07-01

A large class of phylogenetic networks can be obtained from trees by the addition of horizontal edges between the tree edges. These networks are called tree-based networks. We present a simple necessary and sufficient condition for tree-based networks and prove that a universal tree-based network exists for any number of taxa that contains as its base every phylogenetic tree on the same set of taxa. This answers two problems posted by Francis and Steel recently. A byproduct is a computer program for generating random binary phylogenetic networks under the uniform distribution model.

Global Elite as Transnational Capitalist Class

Directory of Open Access Journals (Sweden)

Lukáš Kantor

2017-01-01

Full Text Available As a contribution to the burgeoning field of multidisciplinary globalization studies, this article evaluates how IR grand theories can conceptualize the phenomenon of global elite. It compares and synthesizes (neoliberalism, constructivism, feminism and neo-Marxism. Liberal approaches use the analytical tool of transnational actors or transnational networks. In constructivist’s perspective, part of global elite falls into the category of epistemic community. Feminists offer the term Davos Men. Neo-Marxist conceptualization revolves around the notion of transnational capitalist class. The paper concludes that neo-Marxist IR theory best accounts for the global elite and therefore, the debates on the transnational capitalist class are thoroughly and critically reviewed.

Class, Kinship Density, and Conjugal Role Segregation.

Science.gov (United States)

Hill, Malcolm D.

1988-01-01

Studied conjugal role segregation in 150 married women from intact families in working-class community. Found that, although involvement in dense kinship networks was associated with conjugal role segregation, respondents' attitudes toward marital roles and phase of family cycle when young children were present were more powerful predictors of…

Supervised neural network modeling: an empirical investigation into learning from imbalanced data with labeling errors.

Science.gov (United States)

Khoshgoftaar, Taghi M; Van Hulse, Jason; Napolitano, Amri

2010-05-01

Neural network algorithms such as multilayer perceptrons (MLPs) and radial basis function networks (RBFNets) have been used to construct learners which exhibit strong predictive performance. Two data related issues that can have a detrimental impact on supervised learning initiatives are class imbalance and labeling errors (or class noise). Imbalanced data can make it more difficult for the neural network learning algorithms to distinguish between examples of the various classes, and class noise can lead to the formulation of incorrect hypotheses. Both class imbalance and labeling errors are pervasive problems encountered in a wide variety of application domains. Many studies have been performed to investigate these problems in isolation, but few have focused on their combined effects. This study presents a comprehensive empirical investigation using neural network algorithms to learn from imbalanced data with labeling errors. In particular, the first component of our study investigates the impact of class noise and class imbalance on two common neural network learning algorithms, while the second component considers the ability of data sampling (which is commonly used to address the issue of class imbalance) to improve their performances. Our results, for which over two million models were trained and evaluated, show that conclusions drawn using the more commonly studied C4.5 classifier may not apply when using neural networks.

Cooperation-Controlled Learning for Explicit Class Structure in Self-Organizing Maps

Science.gov (United States)

Kamimura, Ryotaro

2014-01-01

We attempt to demonstrate the effectiveness of multiple points of view toward neural networks. By restricting ourselves to two points of view of a neuron, we propose a new type of information-theoretic method called “cooperation-controlled learning.” In this method, individual and collective neurons are distinguished from one another, and we suppose that the characteristics of individual and collective neurons are different. To implement individual and collective neurons, we prepare two networks, namely, cooperative and uncooperative networks. The roles of these networks and the roles of individual and collective neurons are controlled by the cooperation parameter. As the parameter is increased, the role of cooperative networks becomes more important in learning, and the characteristics of collective neurons become more dominant. On the other hand, when the parameter is small, individual neurons play a more important role. We applied the method to the automobile and housing data from the machine learning database and examined whether explicit class boundaries could be obtained. Experimental results showed that cooperation-controlled learning, in particular taking into account information on input units, could be used to produce clearer class structure than conventional self-organizing maps. PMID:25309950

Cooperation-Controlled Learning for Explicit Class Structure in Self-Organizing Maps

Directory of Open Access Journals (Sweden)

Ryotaro Kamimura

2014-01-01

Full Text Available We attempt to demonstrate the effectiveness of multiple points of view toward neural networks. By restricting ourselves to two points of view of a neuron, we propose a new type of information-theoretic method called “cooperation-controlled learning.” In this method, individual and collective neurons are distinguished from one another, and we suppose that the characteristics of individual and collective neurons are different. To implement individual and collective neurons, we prepare two networks, namely, cooperative and uncooperative networks. The roles of these networks and the roles of individual and collective neurons are controlled by the cooperation parameter. As the parameter is increased, the role of cooperative networks becomes more important in learning, and the characteristics of collective neurons become more dominant. On the other hand, when the parameter is small, individual neurons play a more important role. We applied the method to the automobile and housing data from the machine learning database and examined whether explicit class boundaries could be obtained. Experimental results showed that cooperation-controlled learning, in particular taking into account information on input units, could be used to produce clearer class structure than conventional self-organizing maps.

PERCEPÇÕES DOS ALUNOS COM DEFICIÊNCIA INTELECTUAL SOBRE SUA MATRÍCULA NA CLASSE ESPECIAL E CLASSE COMUM. INTELLECTUALLY DISABLED STUDENTS’ PERCEPTIONS ABOUT THEIR ENROLLMENT IN SPECIAL CLASSES AND COMMON CLASSES

Directory of Open Access Journals (Sweden)

Mendes, Enicéia Gonçalves

2011-11-01

Full Text Available Tendo em vista a necessidade de avaliar e monitorar as práticas advindas da política da inclusão escolar em nosso país, principalmente por meio da opinião e percepção dos principais atores envolvidos neste processo, que são os alunos, o objetivo deste estudo é identificar as percepções de alunos com deficiência intelectual egressos de classe/escola especial e matriculados na classe comum de uma escola regular a respeito da classe/escola especial e o seu lugar de preferência para frequentar. O estudo foi desenvolvido numa cidade de médio porte do interior do estado de São Paulo e no total participaram 10 alunos com deficiência intelectual egressos de três escolas da rede de ensino municipal. Os resultados indicam que os alunos, apesar da experiência positiva na classe/escola especial, têm preferência pela matrícula na classe comum o que evidencia impacto positivo da política da inclusão escolar e também da necessidade de ouvirmos os estudantes para avaliarmos as práticas de inclusão escolar desenvolvidas.There is a need to assess and monitor the school inclusion policy and the uses deriving from it. This can be done primarily through the opinion and perception of the people involved in this process, the students. The objective of this study is to identify the perception of students with intellectual disability from special classes/schools and classmates from the current common classes about their opinion of special classes/schools and the place they chose to attend. The study was made in three schools of the municipal network of a midsize city in the state of São Paulo and ten students with intellectual disabilities from special classes/schools took part in it. The results show that the students, despite the positive experience in the special classes/schools, prefer to attend the regular classes, showing a positive impact of inclusion policy and also the need of listening to the students in order to evaluate the

Distribution of shortest path lengths in a class of node duplication network models

Science.gov (United States)

Steinbock, Chanania; Biham, Ofer; Katzav, Eytan

2017-09-01

We present analytical results for the distribution of shortest path lengths (DSPL) in a network growth model which evolves by node duplication (ND). The model captures essential properties of the structure and growth dynamics of social networks, acquaintance networks, and scientific citation networks, where duplication mechanisms play a major role. Starting from an initial seed network, at each time step a random node, referred to as a mother node, is selected for duplication. Its daughter node is added to the network, forming a link to the mother node, and with probability p to each one of its neighbors. The degree distribution of the resulting network turns out to follow a power-law distribution, thus the ND network is a scale-free network. To calculate the DSPL we derive a master equation for the time evolution of the probability Pt(L =ℓ ) , ℓ =1 ,2 ,⋯ , where L is the distance between a pair of nodes and t is the time. Finding an exact analytical solution of the master equation, we obtain a closed form expression for Pt(L =ℓ ) . The mean distance 〈L〉 t and the diameter Δt are found to scale like lnt , namely, the ND network is a small-world network. The variance of the DSPL is also found to scale like lnt . Interestingly, the mean distance and the diameter exhibit properties of a small-world network, rather than the ultrasmall-world network behavior observed in other scale-free networks, in which 〈L〉 t˜lnlnt .

Towards structural controllability of local-world networks

International Nuclear Information System (INIS)

Sun, Shiwen; Ma, Yilin; Wu, Yafang; Wang, Li; Xia, Chengyi

2016-01-01

Controlling complex networks is of vital importance in science and engineering. Meanwhile, local-world effect is an important ingredient which should be taken into consideration in the complete description of real-world complex systems. In this letter, structural controllability of a class of local-world networks is investigated. Through extensive numerical simulations, firstly, effects of local world size M and network size N on structural controllability are examined. For local-world networks with sparse topological configuration, compared to network size, local-world size can induce stronger influence on controllability, however, for dense networks, controllability is greatly affected by network size and local-world effect can be neglected. Secondly, relationships between controllability and topological properties are analyzed. Lastly, the robustness of local-world networks under targeted attacks regarding structural controllability is discussed. These results can help to deepen the understanding of structural complexity and connectivity patterns of complex systems. - Highlights: • Structural controllability of a class of local-world networks is investigated. • For sparse local-world networks, compared to network size, local-world size can bring stronger influence on controllability. • For dense networks, controllability is greatly affected by network size and the effect of local-world size can be neglected. • Structural controllability against targeted node attacks is discussed.

Towards structural controllability of local-world networks

Energy Technology Data Exchange (ETDEWEB)

Sun, Shiwen, E-mail: sunsw80@126.com [Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin 300384 (China); Key Laboratory of Computer Vision and System (Tianjin University of Technology), Ministry of Education, Tianjin 300384 (China); Ma, Yilin; Wu, Yafang; Wang, Li; Xia, Chengyi [Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin 300384 (China); Key Laboratory of Computer Vision and System (Tianjin University of Technology), Ministry of Education, Tianjin 300384 (China)

2016-05-20

Controlling complex networks is of vital importance in science and engineering. Meanwhile, local-world effect is an important ingredient which should be taken into consideration in the complete description of real-world complex systems. In this letter, structural controllability of a class of local-world networks is investigated. Through extensive numerical simulations, firstly, effects of local world size M and network size N on structural controllability are examined. For local-world networks with sparse topological configuration, compared to network size, local-world size can induce stronger influence on controllability, however, for dense networks, controllability is greatly affected by network size and local-world effect can be neglected. Secondly, relationships between controllability and topological properties are analyzed. Lastly, the robustness of local-world networks under targeted attacks regarding structural controllability is discussed. These results can help to deepen the understanding of structural complexity and connectivity patterns of complex systems. - Highlights: • Structural controllability of a class of local-world networks is investigated. • For sparse local-world networks, compared to network size, local-world size can bring stronger influence on controllability. • For dense networks, controllability is greatly affected by network size and the effect of local-world size can be neglected. • Structural controllability against targeted node attacks is discussed.

Inferring anatomical therapeutic chemical (ATC) class of drugs using shortest path and random walk with restart algorithms.

Science.gov (United States)

Chen, Lei; Liu, Tao; Zhao, Xian

2018-06-01

The anatomical therapeutic chemical (ATC) classification system is a widely accepted drug classification scheme. This system comprises five levels and includes several classes in each level. Drugs are classified into classes according to their therapeutic effects and characteristics. The first level includes 14 main classes. In this study, we proposed two network-based models to infer novel potential chemicals deemed to belong in the first level of ATC classification. To build these models, two large chemical networks were constructed using the chemical-chemical interaction information retrieved from the Search Tool for Interactions of Chemicals (STITCH). Two classic network algorithms, shortest path (SP) and random walk with restart (RWR) algorithms, were executed on the corresponding network to mine novel chemicals for each ATC class using the validated drugs in a class as seed nodes. Then, the obtained chemicals yielded by these two algorithms were further evaluated by a permutation test and an association test. The former can exclude chemicals produced by the structure of the network, i.e., false positive discoveries. By contrast, the latter identifies the most important chemicals that have strong associations with the ATC class. Comparisons indicated that the two models can provide quite dissimilar results, suggesting that the results yielded by one model can be essential supplements for those obtained by the other model. In addition, several representative inferred chemicals were analyzed to confirm the reliability of the results generated by the two models. This article is part of a Special Issue entitled: Accelerating Precision Medicine through Genetic and Genomic Big Data Analysis edited by Yudong Cai & Tao Huang. Copyright © 2017 Elsevier B.V. All rights reserved.

Modified-hybrid optical neural network filter for multiple object recognition within cluttered scenes

Science.gov (United States)

Kypraios, Ioannis; Young, Rupert C. D.; Chatwin, Chris R.

2009-08-01

Motivated by the non-linear interpolation and generalization abilities of the hybrid optical neural network filter between the reference and non-reference images of the true-class object we designed the modifiedhybrid optical neural network filter. We applied an optical mask to the hybrid optical neural network's filter input. The mask was built with the constant weight connections of a randomly chosen image included in the training set. The resulted design of the modified-hybrid optical neural network filter is optimized for performing best in cluttered scenes of the true-class object. Due to the shift invariance properties inherited by its correlator unit the filter can accommodate multiple objects of the same class to be detected within an input cluttered image. Additionally, the architecture of the neural network unit of the general hybrid optical neural network filter allows the recognition of multiple objects of different classes within the input cluttered image by modifying the output layer of the unit. We test the modified-hybrid optical neural network filter for multiple objects of the same and of different classes' recognition within cluttered input images and video sequences of cluttered scenes. The filter is shown to exhibit with a single pass over the input data simultaneously out-of-plane rotation, shift invariance and good clutter tolerance. It is able to successfully detect and classify correctly the true-class objects within background clutter for which there has been no previous training.

Folding and unfolding phylogenetic trees and networks.

Science.gov (United States)

Huber, Katharina T; Moulton, Vincent; Steel, Mike; Wu, Taoyang

2016-12-01

Phylogenetic networks are rooted, labelled directed acyclic graphswhich are commonly used to represent reticulate evolution. There is a close relationship between phylogenetic networks and multi-labelled trees (MUL-trees). Indeed, any phylogenetic network N can be "unfolded" to obtain a MUL-tree U(N) and, conversely, a MUL-tree T can in certain circumstances be "folded" to obtain aphylogenetic network F(T) that exhibits T. In this paper, we study properties of the operations U and F in more detail. In particular, we introduce the class of stable networks, phylogenetic networks N for which F(U(N)) is isomorphic to N, characterise such networks, and show that they are related to the well-known class of tree-sibling networks. We also explore how the concept of displaying a tree in a network N can be related to displaying the tree in the MUL-tree U(N). To do this, we develop aphylogenetic analogue of graph fibrations. This allows us to view U(N) as the analogue of the universal cover of a digraph, and to establish a close connection between displaying trees in U(N) and reconciling phylogenetic trees with networks.

Web Page Classification Method Using Neural Networks

Science.gov (United States)

Selamat, Ali; Omatu, Sigeru; Yanagimoto, Hidekazu; Fujinaka, Toru; Yoshioka, Michifumi

Automatic categorization is the only viable method to deal with the scaling problem of the World Wide Web (WWW). In this paper, we propose a news web page classification method (WPCM). The WPCM uses a neural network with inputs obtained by both the principal components and class profile-based features (CPBF). Each news web page is represented by the term-weighting scheme. As the number of unique words in the collection set is big, the principal component analysis (PCA) has been used to select the most relevant features for the classification. Then the final output of the PCA is combined with the feature vectors from the class-profile which contains the most regular words in each class before feeding them to the neural networks. We have manually selected the most regular words that exist in each class and weighted them using an entropy weighting scheme. The fixed number of regular words from each class will be used as a feature vectors together with the reduced principal components from the PCA. These feature vectors are then used as the input to the neural networks for classification. The experimental evaluation demonstrates that the WPCM method provides acceptable classification accuracy with the sports news datasets.

Recurrent-Neural-Network-Based Multivariable Adaptive Control for a Class of Nonlinear Dynamic Systems With Time-Varying Delay.

Science.gov (United States)

Hwang, Chih-Lyang; Jan, Chau

2016-02-01

At the beginning, an approximate nonlinear autoregressive moving average (NARMA) model is employed to represent a class of multivariable nonlinear dynamic systems with time-varying delay. It is known that the disadvantages of robust control for the NARMA model are as follows: 1) suitable control parameters for larger time delay are more sensitive to achieving desirable performance; 2) it only deals with bounded uncertainty; and 3) the nominal NARMA model must be learned in advance. Due to the dynamic feature of the NARMA model, a recurrent neural network (RNN) is online applied to learn it. However, the system performance becomes deteriorated due to the poor learning of the larger variation of system vector functions. In this situation, a simple network is employed to compensate the upper bound of the residue caused by the linear parameterization of the approximation error of RNN. An e -modification learning law with a projection for weight matrix is applied to guarantee its boundedness without persistent excitation. Under suitable conditions, the semiglobally ultimately bounded tracking with the boundedness of estimated weight matrix is obtained by the proposed RNN-based multivariable adaptive control. Finally, simulations are presented to verify the effectiveness and robustness of the proposed control.

The Effect of Teachers' Social Networks on Teaching Practices and Class Composition

Science.gov (United States)

Kim, Chong Min

2011-01-01

Central to this dissertation was an examination of the role teachers' social networks play in schools as living organizations through three studies. The first study investigated the impact of teachers' social networks on teaching practices. Recent evidence suggests that teachers' social networks have a significant effect on teachers' norms,…

Antagonistic Phenomena in Network Dynamics

Science.gov (United States)

Motter, Adilson E.; Timme, Marc

2018-03-01

Recent research on the network modeling of complex systems has led to a convenient representation of numerous natural, social, and engineered systems that are now recognized as networks of interacting parts. Such systems can exhibit a wealth of phenomena that not only cannot be anticipated from merely examining their parts, as per the textbook definition of complexity, but also challenge intuition even when considered in the context of what is now known in network science. Here, we review the recent literature on two major classes of such phenomena that have far-reaching implications: (a) antagonistic responses to changes of states or parameters and (b) coexistence of seemingly incongruous behaviors or properties - both deriving from the collective and inherently decentralized nature of the dynamics. They include effects as diverse as negative compressibility in engineered materials, rescue interactions in biological networks, negative resistance in fluid networks, and the Braess paradox occurring across transport and supply networks. They also include remote synchronization, chimera states, and the converse of symmetry breaking in brain, power-grid, and oscillator networks as well as remote control in biological and bioinspired systems. By offering a unified view of these various scenarios, we suggest that they are representative of a yet broader class of unprecedented network phenomena that ought to be revealed and explained by future research.

Self-organization towards optimally interdependent networks by means of coevolution

International Nuclear Information System (INIS)

Wang, Zhen; Szolnoki, Attila; Perc, Matjaž

2014-01-01

Coevolution between strategy and network structure is established as a means to arrive at the optimal conditions needed to resolve social dilemmas. Yet recent research has highlighted that the interdependence between networks may be just as important as the structure of an individual network. We therefore introduce the coevolution of strategy and network interdependence to see whether this can give rise to elevated levels of cooperation in the prisoner's dilemma game. We show that the interdependence between networks self-organizes so as to yield optimal conditions for the evolution of cooperation. Even under extremely adverse conditions, cooperators can prevail where on isolated networks they would perish. This is due to the spontaneous emergence of a two-class society, with only the upper class being allowed to control and take advantage of the interdependence. Spatial patterns reveal that cooperators, once arriving at the upper class, are much more competent than defectors in sustaining compact clusters of followers. Indeed, the asymmetric exploitation of interdependence confers to them a strong evolutionary advantage that may resolve even the toughest of social dilemmas. (paper)

Mapping Koch curves into scale-free small-world networks

International Nuclear Information System (INIS)

Zhang Zhongzhi; Gao Shuyang; Zhou Shuigeng; Chen Lichao; Zhang Hongjuan; Guan Jihong

2010-01-01

The class of Koch fractals is one of the most interesting families of fractals, and the study of complex networks is a central issue in the scientific community. In this paper, inspired by the famous Koch fractals, we propose a mapping technique converting Koch fractals into a family of deterministic networks called Koch networks. This novel class of networks incorporates some key properties characterizing a majority of real-life networked systems-a power-law distribution with exponent in the range between 2 and 3, a high clustering coefficient, a small diameter and average path length and degree correlations. Besides, we enumerate the exact numbers of spanning trees, spanning forests and connected spanning subgraphs in the networks. All these features are obtained exactly according to the proposed generation algorithm of the networks considered. The network representation approach could be used to investigate the complexity of some real-world systems from the perspective of complex networks.

Robust synchronization of a class of chaotic networks

Czech Academy of Sciences Publication Activity Database

Čelikovský, Sergej; Lynnyk, Volodymyr; Chen, G.

2013-01-01

Roč. 350, č. 10 (2013), s. 2936-2948 ISSN 0016-0032 R&D Projects: GA ČR(CZ) GAP103/12/1794 Institutional support: RVO:67985556 Keywords : generalized Lorenz system * robust synchronization * dynamical complex network Subject RIV: BC - Control Systems Theory Impact factor: 2.260, year: 2013 http://library.utia.cas.cz/separaty/2013/TR/celikovsky-0398127.pdf

Bond percolation on a class of correlated and clustered random graphs

International Nuclear Information System (INIS)

Allard, A; Hébert-Dufresne, L; Noël, P-A; Marceau, V; Dubé, L J

2012-01-01

We introduce a formalism for computing bond percolation properties of a class of correlated and clustered random graphs. This class of graphs is a generalization of the configuration model where nodes of different types are connected via different types of hyperedges, edges that can link more than two nodes. We argue that the multitype approach coupled with the use of clustered hyperedges can reproduce a wide spectrum of complex patterns, and thus enhances our capability to model real complex networks. As an illustration of this claim, we use our formalism to highlight unusual behaviours of the size and composition of the components (small and giant) in a synthetic, albeit realistic, social network. (paper)

Morphological neural networks

Energy Technology Data Exchange (ETDEWEB)

Ritter, G.X.; Sussner, P. [Univ. of Florida, Gainesville, FL (United States)

1996-12-31

The theory of artificial neural networks has been successfully applied to a wide variety of pattern recognition problems. In this theory, the first step in computing the next state of a neuron or in performing the next layer neural network computation involves the linear operation of multiplying neural values by their synaptic strengths and adding the results. Thresholding usually follows the linear operation in order to provide for nonlinearity of the network. In this paper we introduce a novel class of neural networks, called morphological neural networks, in which the operations of multiplication and addition are replaced by addition and maximum (or minimum), respectively. By taking the maximum (or minimum) of sums instead of the sum of products, morphological network computation is nonlinear before thresholding. As a consequence, the properties of morphological neural networks are drastically different than those of traditional neural network models. In this paper we consider some of these differences and provide some particular examples of morphological neural network.

Prediction of proteasome cleavage motifs by neural networks

DEFF Research Database (Denmark)

Kesimir, C.; Nussbaum, A.K.; Schild, H.

2002-01-01

physiological conditions. Our algorithm has been trained not only on in vitro data, but also on MHC Class I ligand data, which reflect a combination of immunoproteasome and constitutive proteasome specificity. This feature, together with the use of neural networks, a non-linear classification technique, make...... the prediction of MHC Class I ligand boundaries more accurate: 65% of the cleavage sites and 85% of the non-cleavage sites are correctly determined. Moreover, we show that the neural networks trained on the constitutive proteasome data learns a specificity that differs from that of the networks trained on MHC...

Cost-Effective Class-Imbalance Aware CNN for Vehicle Localization and Categorization in High Resolution Aerial Images

Directory of Open Access Journals (Sweden)

Feimo Li

2017-05-01

Full Text Available Joint vehicle localization and categorization in high resolution aerial images can provide useful information for applications such as traffic flow structure analysis. To maintain sufficient features to recognize small-scaled vehicles, a regions with convolutional neural network features (R-CNN -like detection structure is employed. In this setting, cascaded localization error can be averted by equally treating the negatives and differently typed positives as a multi-class classification task, but the problem of class-imbalance remains. To address this issue, a cost-effective network extension scheme is proposed. In it, the correlated convolution and connection costs during extension are reduced by feature map selection and bi-partite main-side network construction, which are realized with the assistance of a novel feature map class-importance measurement and a new class-imbalance sensitive main-side loss function. By using an image classification dataset established from a set of traditional real-colored aerial images with 0.13 m ground sampling distance which are taken from the height of 1000 m by an imaging system composed of non-metric cameras, the effectiveness of the proposed network extension is verified by comparing with its similarly shaped strong counter-parts. Experiments show an equivalent or better performance, while requiring the least parameter and memory overheads are required.

On Nakhleh's metric for reduced phylogenetic networks

OpenAIRE

Cardona, Gabriel; Llabrés, Mercè; Rosselló, Francesc; Valiente Feruglio, Gabriel Alejandro

2009-01-01

We prove that Nakhleh’s metric for reduced phylogenetic networks is also a metric on the classes of tree-child phylogenetic networks, semibinary tree-sibling time consistent phylogenetic networks, and multilabeled phylogenetic trees. We also prove that it separates distinguishable phylogenetic networks. In this way, it becomes the strongest dissimilarity measure for phylogenetic networks available so far. Furthermore, we propose a generalization of that metric that separates arbitrary phyl...

Transforming phylogenetic networks: Moving beyond tree space

OpenAIRE

Huber, Katharina T.; Moulton, Vincent; Wu, Taoyang

2016-01-01

Phylogenetic networks are a generalization of phylogenetic trees that are used to represent reticulate evolution. Unrooted phylogenetic networks form a special class of such networks, which naturally generalize unrooted phylogenetic trees. In this paper we define two operations on unrooted phylogenetic networks, one of which is a generalization of the well-known nearest-neighbor interchange (NNI) operation on phylogenetic trees. We show that any unrooted phylogenetic network can be transforme...

Utilization of Social Media in Marketing Classes

Science.gov (United States)

Allen, Charlotte

2013-01-01

The goal of this paper is to highlight how instructors may integrate the different social media into various marketing classes. The paper will address the major social networks, and then follow with discussions of microblogging, media sites, and social gaming. Given that there is a great deal of research highlighting the effectiveness of utilizing…

Cultural expressions of social class and their implications for group-related beliefs and behaviors

OpenAIRE

Rheinschmidt-Same, Michelle; Becker, Julia; Kraus, Michael

2017-01-01

In the wake of the Great Recession, rising inequality has increased social class disparities between people in society. In this research, we examine how differences in social class shape unique patterns of cultural expression, and how these cultural expressions affirm ingroup beliefs. In Study 1 (N=113), we provide evidence that cultural expressions of social class on an online social network can signal the social class of targets: by simply viewing the cultural practices of individuals captu...

Maximum entropy networks are more controllable than preferential attachment networks

International Nuclear Information System (INIS)

Hou, Lvlin; Small, Michael; Lao, Songyang

2014-01-01

A maximum entropy (ME) method to generate typical scale-free networks has been recently introduced. We investigate the controllability of ME networks and Barabási–Albert preferential attachment networks. Our experimental results show that ME networks are significantly more easily controlled than BA networks of the same size and the same degree distribution. Moreover, the control profiles are used to provide insight into control properties of both classes of network. We identify and classify the driver nodes and analyze the connectivity of their neighbors. We find that driver nodes in ME networks have fewer mutual neighbors and that their neighbors have lower average degree. We conclude that the properties of the neighbors of driver node sensitively affect the network controllability. Hence, subtle and important structural differences exist between BA networks and typical scale-free networks of the same degree distribution. - Highlights: • The controllability of maximum entropy (ME) and Barabási–Albert (BA) networks is investigated. • ME networks are significantly more easily controlled than BA networks of the same degree distribution. • The properties of the neighbors of driver node sensitively affect the network controllability. • Subtle and important structural differences exist between BA networks and typical scale-free networks

Digital optical feeder links system for broadband geostationary satellite

Science.gov (United States)

Poulenard, Sylvain; Mège, Alexandre; Fuchs, Christian; Perlot, Nicolas; Riedi, Jerome; Perdigues, Josep

2017-02-01

An optical link based on a multiplex of wavelengths at 1.55μm is foreseen to be a valuable solution for the feeder link of the next generation of high-throughput geostationary satellite. The main satellite operator specifications for such link are an availability of 99.9% over the year, a capacity around 500Gbit/s and to be bent-pipe. Optical ground station networks connected to Terabit/s terrestrial fibers are proposed. The availability of the optical feeder link is simulated over 5 years based on a state-of-the-art cloud mask data bank and an atmospheric turbulence strength model. Yearly and seasonal optical feeder link availabilities are derived and discussed. On-ground and on-board terminals are designed to be compliant with 10Gbit/s per optical channel data rate taking into account adaptive optic systems to mitigate the impact of atmospheric turbulences on single-mode optical fiber receivers. The forward and return transmission chains, concept and implementation, are described. These are based on a digital transparent on-off keying optical link with digitalization of the DVB-S2 and DVB-RCS signals prior to the transmission, and a forward error correcting code. In addition, the satellite architecture is described taking into account optical and radiofrequency payloads as well as their interfaces.

Discriminating lysosomal membrane protein types using dynamic neural network.

Science.gov (United States)

Tripathi, Vijay; Gupta, Dwijendra Kumar

2014-01-01

This work presents a dynamic artificial neural network methodology, which classifies the proteins into their classes from their sequences alone: the lysosomal membrane protein classes and the various other membranes protein classes. In this paper, neural networks-based lysosomal-associated membrane protein type prediction system is proposed. Different protein sequence representations are fused to extract the features of a protein sequence, which includes seven feature sets; amino acid (AA) composition, sequence length, hydrophobic group, electronic group, sum of hydrophobicity, R-group, and dipeptide composition. To reduce the dimensionality of the large feature vector, we applied the principal component analysis. The probabilistic neural network, generalized regression neural network, and Elman regression neural network (RNN) are used as classifiers and compared with layer recurrent network (LRN), a dynamic network. The dynamic networks have memory, i.e. its output depends not only on the input but the previous outputs also. Thus, the accuracy of LRN classifier among all other artificial neural networks comes out to be the highest. The overall accuracy of jackknife cross-validation is 93.2% for the data-set. These predicted results suggest that the method can be effectively applied to discriminate lysosomal associated membrane proteins from other membrane proteins (Type-I, Outer membrane proteins, GPI-Anchored) and Globular proteins, and it also indicates that the protein sequence representation can better reflect the core feature of membrane proteins than the classical AA composition.

Epidemics on interconnected networks

Science.gov (United States)

Dickison, Mark; Havlin, S.; Stanley, H. E.

2012-06-01

Populations are seldom completely isolated from their environment. Individuals in a particular geographic or social region may be considered a distinct network due to strong local ties but will also interact with individuals in other networks. We study the susceptible-infected-recovered process on interconnected network systems and find two distinct regimes. In strongly coupled network systems, epidemics occur simultaneously across the entire system at a critical infection strength βc, below which the disease does not spread. In contrast, in weakly coupled network systems, a mixed phase exists below βc of the coupled network system, where an epidemic occurs in one network but does not spread to the coupled network. We derive an expression for the network and disease parameters that allow this mixed phase and verify it numerically. Public health implications of communities comprising these two classes of network systems are also mentioned.

Evidence for the additions of clustered interacting nodes during the evolution of protein interaction networks from network motifs

Directory of Open Access Journals (Sweden)

Guo Hao

2011-05-01

Full Text Available Abstract Background High-throughput screens have revealed large-scale protein interaction networks defining most cellular functions. How the proteins were added to the protein interaction network during its growth is a basic and important issue. Network motifs represent the simplest building blocks of cellular machines and are of biological significance. Results Here we study the evolution of protein interaction networks from the perspective of network motifs. We find that in current protein interaction networks, proteins of the same age class tend to form motifs and such co-origins of motif constituents are affected by their topologies and biological functions. Further, we find that the proteins within motifs whose constituents are of the same age class tend to be densely interconnected, co-evolve and share the same biological functions, and these motifs tend to be within protein complexes. Conclusions Our findings provide novel evidence for the hypothesis of the additions of clustered interacting nodes and point out network motifs, especially the motifs with the dense topology and specific function may play important roles during this process. Our results suggest functional constraints may be the underlying driving force for such additions of clustered interacting nodes.

Forecasting craniofacial growth in individuals with class III malocclusion by computational modelling.

Science.gov (United States)

Auconi, Pietro; Scazzocchio, Marco; Defraia, Efisio; McNamara, James A; Franchi, Lorenzo

2014-04-01

To develop a mathematical model that adequately represented the pattern of craniofacial growth in class III subject consistently, with the goal of using this information to make growth predictions that could be amenable to longitudinal verification and clinical use. A combination of computational techniques (i.e. Fuzzy clustering and Network analysis) was applied to cephalometric data derived from 429 untreated growing female patients with class III malocclusion to visualize craniofacial growth dynamics and correlations. Four age groups of subjects were examined individually: from 7 to 9 years of age, from 10 to 12 years, from 13 to 14 years, and from 15 to 17 years. The connections between pathway components of class III craniofacial growth can be visualized from Network profiles. Fuzzy clustering analysis was able to define further growth patterns and coherences of the traditionally reported dentoskeletal characteristics of this structural imbalance. Craniofacial growth can be visualized as a biological, space-constraint-based optimization process; the prediction of individual growth trajectories depends on the rate of membership to a specific 'winner' cluster, i.e. on a specific individual growth strategy. The reliability of the information thus gained was tested to forecast craniofacial growth of 28 untreated female class III subjects followed longitudinally. The combination of Fuzzy clustering and Network algorithms allowed the development of principles for combining multiple auxological cephalometric features into a joint global model and to predict the individual risk of the facial pattern imbalance during growth.

Stabilizing weighted complex networks

International Nuclear Information System (INIS)

Xiang Linying; Chen Zengqiang; Liu Zhongxin; Chen Fei; Yuan Zhuzhi

2007-01-01

Real networks often consist of local units which interact with each other via asymmetric and heterogeneous connections. In this paper, the V-stability problem is investigated for a class of asymmetric weighted coupled networks with nonidentical node dynamics, which includes the unweighted network as a special case. Pinning control is suggested to stabilize such a coupled network. The complicated stabilization problem is reduced to measuring the semi-negative property of the characteristic matrix which embodies not only the network topology, but also the node self-dynamics and the control gains. It is found that network stabilizability depends critically on the second largest eigenvalue of the characteristic matrix. The smaller the second largest eigenvalue is, the more the network is pinning controllable. Numerical simulations of two representative networks composed of non-chaotic systems and chaotic systems, respectively, are shown for illustration and verification

Neural Networks in R Using the Stuttgart Neural Network Simulator: RSNNS

Directory of Open Access Journals (Sweden)

Christopher Bergmeir

2012-01-01

Full Text Available Neural networks are important standard machine learning procedures for classification and regression. We describe the R package RSNNS that provides a convenient interface to the popular Stuttgart Neural Network Simulator SNNS. The main features are (a encapsulation of the relevant SNNS parts in a C++ class, for sequential and parallel usage of different networks, (b accessibility of all of the SNNSalgorithmic functionality from R using a low-level interface, and (c a high-level interface for convenient, R-style usage of many standard neural network procedures. The package also includes functions for visualization and analysis of the models and the training procedures, as well as functions for data input/output from/to the original SNNSfile formats.

Dissociable intrinsic functional networks support noun-object and verb-action processing.

Science.gov (United States)

Yang, Huichao; Lin, Qixiang; Han, Zaizhu; Li, Hongyu; Song, Luping; Chen, Lingjuan; He, Yong; Bi, Yanchao

2017-12-01

The processing mechanism of verbs-actions and nouns-objects is a central topic of language research, with robust evidence for behavioral dissociation. The neural basis for these two major word and/or conceptual classes, however, remains controversial. Two experiments were conducted to study this question from the network perspective. Experiment 1 found that nodes of the same class, obtained through task-evoked brain imaging meta-analyses, were more strongly connected with each other than nodes of different classes during resting-state, forming segregated network modules. Experiment 2 examined the behavioral relevance of these intrinsic networks using data from 88 brain-damaged patients, finding that across patients the relative strength of functional connectivity of the two networks significantly correlated with the noun-object vs. verb-action relative behavioral performances. In summary, we found that verbs-actions and nouns-objects are supported by separable intrinsic functional networks and that the integrity of such networks accounts for the relative noun-object- and verb-action-selective deficits. Copyright © 2017 Elsevier Inc. All rights reserved.

Classification of ion mobility spectra by functional groups using neural networks

Science.gov (United States)

Bell, S.; Nazarov, E.; Wang, Y. F.; Eiceman, G. A.

1999-01-01

Neural networks were trained using whole ion mobility spectra from a standardized database of 3137 spectra for 204 chemicals at various concentrations. Performance of the network was measured by the success of classification into ten chemical classes. Eleven stages for evaluation of spectra and of spectral pre-processing were employed and minimums established for response thresholds and spectral purity. After optimization of the database, network, and pre-processing routines, the fraction of successful classifications by functional group was 0.91 throughout a range of concentrations. Network classification relied on a combination of features, including drift times, number of peaks, relative intensities, and other factors apparently including peak shape. The network was opportunistic, exploiting different features within different chemical classes. Application of neural networks in a two-tier design where chemicals were first identified by class and then individually eliminated all but one false positive out of 161 test spectra. These findings establish that ion mobility spectra, even with low resolution instrumentation, contain sufficient detail to permit the development of automated identification systems.

Anatomy and histology as socially networked learning environments: some preliminary findings.

Science.gov (United States)

Hafferty, Frederic W; Castellani, Brian; Hafferty, Philip K; Pawlina, Wojciech

2013-09-01

An exploratory study to better understand the "networked" life of the medical school as a learning environment. In a recent academic year, the authors gathered data during two six-week blocks of a sequential histology and anatomy course at a U.S. medical college. An eight-item questionnaire captured different dimensions of student interactions. The student cohort/network was 48 first-year medical students. Using social network analysis (SNA), the authors focused on (1) the initial structure and the evolution of informal class networks over time, (2) how informal class networks compare to formal in-class small-group assignments in influencing student information gathering, and (3) how peer assignment of professionalism role model status is shaped more by informal than formal ties. In examining these latter two issues, the authors explored not only how formal group assignment persisted over time but also how it functioned to prevent the tendency for groupings based on gender or ethnicity. The study revealed an evolving dynamic between the formal small-group learning structure of the course blocks and the emergence of informal student networks. For example, whereas formal group membership did influence in-class questions and did prevent formation of groups of like gender and ethnicity, outside-class questions and professionalism were influenced more by informal group ties where gender and, to a much lesser extent, ethnicity influence student information gathering. The richness of these preliminary findings suggests that SNA may be a useful tool in examining an array of medical student learning encounters.

Deep neural network convolution (NNC) for three-class classification of diffuse lung disease opacities in high-resolution CT (HRCT): consolidation, ground-glass opacity (GGO), and normal opacity

Science.gov (United States)

Hashimoto, Noriaki; Suzuki, Kenji; Liu, Junchi; Hirano, Yasushi; MacMahon, Heber; Kido, Shoji

2018-02-01

Consolidation and ground-glass opacity (GGO) are two major types of opacities associated with diffuse lung diseases. Accurate detection and classification of such opacities are crucially important in the diagnosis of lung diseases, but the process is subjective, and suffers from interobserver variability. Our study purpose was to develop a deep neural network convolution (NNC) system for distinguishing among consolidation, GGO, and normal lung tissue in high-resolution CT (HRCT). We developed ensemble of two deep NNC models, each of which was composed of neural network regression (NNR) with an input layer, a convolution layer, a fully-connected hidden layer, and a fully-connected output layer followed by a thresholding layer. The output layer of each NNC provided a map for the likelihood of being each corresponding lung opacity of interest. The two NNC models in the ensemble were connected in a class-selection layer. We trained our NNC ensemble with pairs of input 2D axial slices and "teaching" probability maps for the corresponding lung opacity, which were obtained by combining three radiologists' annotations. We randomly selected 10 and 40 slices from HRCT scans of 172 patients for each class as a training and test set, respectively. Our NNC ensemble achieved an area under the receiver-operating-characteristic (ROC) curve (AUC) of 0.981 and 0.958 in distinction of consolidation and GGO, respectively, from normal opacity, yielding a classification accuracy of 93.3% among 3 classes. Thus, our deep-NNC-based system for classifying diffuse lung diseases achieved high accuracies for classification of consolidation, GGO, and normal opacity.

On the number of different dynamics in Boolean networks with deterministic update schedules.

Science.gov (United States)

Aracena, J; Demongeot, J; Fanchon, E; Montalva, M

2013-04-01

Deterministic Boolean networks are a type of discrete dynamical systems widely used in the modeling of genetic networks. The dynamics of such systems is characterized by the local activation functions and the update schedule, i.e., the order in which the nodes are updated. In this paper, we address the problem of knowing the different dynamics of a Boolean network when the update schedule is changed. We begin by proving that the problem of the existence of a pair of update schedules with different dynamics is NP-complete. However, we show that certain structural properties of the interaction diagraph are sufficient for guaranteeing distinct dynamics of a network. In [1] the authors define equivalence classes which have the property that all the update schedules of a given class yield the same dynamics. In order to determine the dynamics associated to a network, we develop an algorithm to efficiently enumerate the above equivalence classes by selecting a representative update schedule for each class with a minimum number of blocks. Finally, we run this algorithm on the well known Arabidopsis thaliana network to determine the full spectrum of its different dynamics. Copyright © 2013 Elsevier Inc. All rights reserved.

Inferring modules from human protein interactome classes

Directory of Open Access Journals (Sweden)

Chaurasia Gautam

2010-07-01

Full Text Available Abstract Background The integration of protein-protein interaction networks derived from high-throughput screening approaches and complementary sources is a key topic in systems biology. Although integration of protein interaction data is conventionally performed, the effects of this procedure on the result of network analyses has not been examined yet. In particular, in order to optimize the fusion of heterogeneous interaction datasets, it is crucial to consider not only their degree of coverage and accuracy, but also their mutual dependencies and additional salient features. Results We examined this issue based on the analysis of modules detected by network clustering methods applied to both integrated and individual (disaggregated data sources, which we call interactome classes. Due to class diversity, we deal with variable dependencies of data features arising from structural specificities and biases, but also from possible overlaps. Since highly connected regions of the human interactome may point to potential protein complexes, we have focused on the concept of modularity, and elucidated the detection power of module extraction algorithms by independent validations based on GO, MIPS and KEGG. From the combination of protein interactions with gene expressions, a confidence scoring scheme has been proposed before proceeding via GO with further classification in permanent and transient modules. Conclusions Disaggregated interactomes are shown to be informative for inferring modularity, thus contributing to perform an effective integrative analysis. Validation of the extracted modules by multiple annotation allows for the assessment of confidence measures assigned to the modules in a protein pathway context. Notably, the proposed multilayer confidence scheme can be used for network calibration by enabling a transition from unweighted to weighted interactomes based on biological evidence.

Neural network classification of gamma-ray bursts

International Nuclear Information System (INIS)

Balastegui, A.; Canal, R.

2005-01-01

From a cluster analysis it appeared that a three-class classification of GRBs could be preferable to just the classic separation of short/hard and long/soft GRBs (Balastegui A., Ruiz-Lapuente, P. and Canal, R. MNRAS 328 (2001) 283). A new classification of GRBs obtained via a neural network is presented, with a short/hard class, an intermediate-duration/soft class, and a long/soft class, the latter being a brighter and more inhomogeneous class than the intermediate duration one. A possible physical meaning of this new classification is also outlined

Technological Developments in Networking, Education and Automation

CERN Document Server

Elleithy, Khaled; Iskander, Magued; Kapila, Vikram; Karim, Mohammad A; Mahmood, Ausif

2010-01-01

"Technological Developments in Networking, Education and Automation" includes a set of rigorously reviewed world-class manuscripts addressing and detailing state-of-the-art research projects in the following areas: Computer Networks: Access Technologies, Medium Access Control, Network architectures and Equipment, Optical Networks and Switching, Telecommunication Technology, and Ultra Wideband Communications. Engineering Education and Online Learning: including development of courses and systems for engineering, technical and liberal studies programs; online laboratories; intelligent

Critical Node Location in De Bruijn Networks

Science.gov (United States)

2016-10-01

algorithms that are normally time- consuming perform exceptionally well on de Bruijn networks. This class of networks has yet to be considered from an...tolerant networks, peer-to-peer networks, amongst others. Because of their unique properties, many algorithms that are normally time- consuming perform...a quadratic binary equation, each higher order term must be replaced with several new variables. While this is possible, it is a time- consuming and

Report on the achievements in fiscal 1998 on research and development related to the next generation ultra high speed communication node technology; 1998 nendo jisedai chokosoku tsushin nodo gijutsu ni kakawaru kenkyu kaihatsu seika hokokusho

Energy Technology Data Exchange (ETDEWEB)

NONE

2000-03-01

Research and development has been performed on a new system COPM that links signals from LAN to an ultra high speed network of tera-bit class, and on the element technology required thereon. This paper summarizes the achievements. The transmission system using the COPM modulates beam signals by using image signals of 155 mega-bits per second; compresses the modulated beam pulse strings as much as sixteen times to transmit the light pulse as the light pulse of 2.5 giga-bits per second; and the pulses are expanded again at the receiver side to demodulate them into electric signal to project them as images on a TV screen. This demonstration was performed successfully. In addition, in order to mitigate the problems in raising the compression rate only in the beam zone, a proposal was made on a hybrid type compression device that combines the electric compression with the compression in the beam zone in series. As a result, it was shown that compression of up to about 10 giga-bit per second is possible in the electric zone by using an electric memory. Further research and development has been advanced on the element technologies, and the initial objective has been nearly achieved. (NEDO)

Direct lifts of coupled cell networks

Science.gov (United States)

Dias, A. P. S.; Moreira, C. S.

2018-04-01

In networks of dynamical systems, there are spaces defined in terms of equalities of cell coordinates which are flow-invariant under any dynamical system that has a form consistent with the given underlying network structure—the network synchrony subspaces. Given a network and one of its synchrony subspaces, any system with a form consistent with the network, restricted to the synchrony subspace, defines a new system which is consistent with a smaller network, called the quotient network of the original network by the synchrony subspace. Moreover, any system associated with the quotient can be interpreted as the restriction to the synchrony subspace of a system associated with the original network. We call the larger network a lift of the smaller network, and a lift can be interpreted as a result of the cellular splitting of the smaller network. In this paper, we address the question of the uniqueness in this lifting process in terms of the networks’ topologies. A lift G of a given network Q is said to be direct when there are no intermediate lifts of Q between them. We provide necessary and sufficient conditions for a lift of a general network to be direct. Our results characterize direct lifts using the subnetworks of all splitting cells of Q and of all split cells of G. We show that G is a direct lift of Q if and only if either the split subnetwork is a direct lift or consists of two copies of the splitting subnetwork. These results are then applied to the class of regular uniform networks and to the special classes of ring networks and acyclic networks. We also illustrate that one of the applications of our results is to the lifting bifurcation problem.

Mining Functional Modules in Heterogeneous Biological Networks Using Multiplex PageRank Approach.

Science.gov (United States)

Li, Jun; Zhao, Patrick X

2016-01-01

Identification of functional modules/sub-networks in large-scale biological networks is one of the important research challenges in current bioinformatics and systems biology. Approaches have been developed to identify functional modules in single-class biological networks; however, methods for systematically and interactively mining multiple classes of heterogeneous biological networks are lacking. In this paper, we present a novel algorithm (called mPageRank) that utilizes the Multiplex PageRank approach to mine functional modules from two classes of biological networks. We demonstrate the capabilities of our approach by successfully mining functional biological modules through integrating expression-based gene-gene association networks and protein-protein interaction networks. We first compared the performance of our method with that of other methods using simulated data. We then applied our method to identify the cell division cycle related functional module and plant signaling defense-related functional module in the model plant Arabidopsis thaliana. Our results demonstrated that the mPageRank method is effective for mining sub-networks in both expression-based gene-gene association networks and protein-protein interaction networks, and has the potential to be adapted for the discovery of functional modules/sub-networks in other heterogeneous biological networks. The mPageRank executable program, source code, the datasets and results of the presented two case studies are publicly and freely available at http://plantgrn.noble.org/MPageRank/.

To Enhance Collaborative Learning and Practice Network Knowledge with a Virtualization Laboratory and Online Synchronous Discussion

Science.gov (United States)

Hwang, Wu-Yuin; Kongcharoen, Chaknarin; Ghinea, Gheorghita

2014-01-01

Recently, various computer networking courses have included additional laboratory classes in order to enhance students' learning achievement. However, these classes need to establish a suitable laboratory where each student can connect network devices to configure and test functions within different network topologies. In this case, the Linux…

Adaptive Fault-Tolerant Synchronization Control of a Class of Complex Dynamical Networks With General Input Distribution Matrices and Actuator Faults.

Science.gov (United States)

Li, Xiao-Jian; Yang, Guang-Hong

2017-03-01

This paper is concerned with the problem of adaptive fault-tolerant synchronization control of a class of complex dynamical networks (CDNs) with actuator faults and unknown coupling weights. The considered input distribution matrix is assumed to be an arbitrary matrix, instead of a unit one. Within this framework, an adaptive fault-tolerant controller is designed to achieve synchronization for the CDN. Moreover, a convex combination technique and an important graph theory result are developed, such that the rigorous convergence analysis of synchronization errors can be conducted. In particular, it is shown that the proposed fault-tolerant synchronization control approach is valid for the CDN with both time-invariant and time-varying coupling weights. Finally, two simulation examples are provided to validate the effectiveness of the theoretical results.

Network-Oblivious Algorithms

DEFF Research Database (Denmark)

Bilardi, Gianfranco; Pietracaprina, Andrea; Pucci, Geppino

2016-01-01

A framework is proposed for the design and analysis of network-oblivious algorithms, namely algorithms that can run unchanged, yet efficiently, on a variety of machines characterized by different degrees of parallelism and communication capabilities. The framework prescribes that a network......-oblivious algorithm be specified on a parallel model of computation where the only parameter is the problem’s input size, and then evaluated on a model with two parameters, capturing parallelism granularity and communication latency. It is shown that for a wide class of network-oblivious algorithms, optimality...... of cache hierarchies, to the realm of parallel computation. Its effectiveness is illustrated by providing optimal network-oblivious algorithms for a number of key problems. Some limitations of the oblivious approach are also discussed....

Search in spatial scale-free networks

International Nuclear Information System (INIS)

Thadakamalla, H P; Albert, R; Kumara, S R T

2007-01-01

We study the decentralized search problem in a family of parameterized spatial network models that are heterogeneous in node degree. We investigate several algorithms and illustrate that some of these algorithms exploit the heterogeneity in the network to find short paths by using only local information. In addition, we demonstrate that the spatial network model belongs to a classof searchable networks for a wide range of parameter space. Further, we test these algorithms on the US airline network which belongs to this class of networks and demonstrate that searchability is a generic property of the US airline network. These results provide insights on designing the structure of distributed networks that need effective decentralized search algorithms

Hidden neural networks

DEFF Research Database (Denmark)

Krogh, Anders Stærmose; Riis, Søren Kamaric

1999-01-01

A general framework for hybrids of hidden Markov models (HMMs) and neural networks (NNs) called hidden neural networks (HNNs) is described. The article begins by reviewing standard HMMs and estimation by conditional maximum likelihood, which is used by the HNN. In the HNN, the usual HMM probability...... parameters are replaced by the outputs of state-specific neural networks. As opposed to many other hybrids, the HNN is normalized globally and therefore has a valid probabilistic interpretation. All parameters in the HNN are estimated simultaneously according to the discriminative conditional maximum...... likelihood criterion. The HNN can be viewed as an undirected probabilistic independence network (a graphical model), where the neural networks provide a compact representation of the clique functions. An evaluation of the HNN on the task of recognizing broad phoneme classes in the TIMIT database shows clear...

Classification of conductance traces with recurrent neural networks

Science.gov (United States)

Lauritzen, Kasper P.; Magyarkuti, András; Balogh, Zoltán; Halbritter, András; Solomon, Gemma C.

2018-02-01

We present a new automated method for structural classification of the traces obtained in break junction experiments. Using recurrent neural networks trained on the traces of minimal cross-sectional area in molecular dynamics simulations, we successfully separate the traces into two classes: point contact or nanowire. This is done without any assumptions about the expected features of each class. The trained neural network is applied to experimental break junction conductance traces, and it separates the classes as well as the previously used experimental methods. The effect of using partial conductance traces is explored, and we show that the method performs equally well using full or partial traces (as long as the trace just prior to breaking is included). When only the initial part of the trace is included, the results are still better than random chance. Finally, we show that the neural network classification method can be used to classify experimental conductance traces without using simulated results for training, but instead training the network on a few representative experimental traces. This offers a tool to recognize some characteristic motifs of the traces, which can be hard to find by simple data selection algorithms.

Topological properties of complex networks in protein structures

Science.gov (United States)

Kim, Kyungsik; Jung, Jae-Won; Min, Seungsik

2014-03-01

We study topological properties of networks in structural classification of proteins. We model the native-state protein structure as a network made of its constituent amino-acids and their interactions. We treat four structural classes of proteins composed predominantly of α helices and β sheets and consider several proteins from each of these classes whose sizes range from amino acids of the Protein Data Bank. Particularly, we simulate and analyze the network metrics such as the mean degree, the probability distribution of degree, the clustering coefficient, the characteristic path length, the local efficiency, and the cost. This work was supported by the KMAR and DP under Grant WISE project (153-3100-3133-302-350).

Stochastic actor-oriented models for network change

NARCIS (Netherlands)

Snijders, T.A.B.

1996-01-01

A class of models is proposed for longitudinal network data. These models are along the lines of methodological individualism: actors use heuristics to try to achieve their individual goals, subject to constraints. The current network structure is among these constraints. The models are continuous

Settings in Social Networks : a Measurement Model

NARCIS (Netherlands)

Schweinberger, Michael; Snijders, Tom A.B.

2003-01-01

A class of statistical models is proposed that aims to recover latent settings structures in social networks. Settings may be regarded as clusters of vertices. The measurement model is based on two assumptions. (1) The observed network is generated by hierarchically nested latent transitive

Dynamic Trust Management for Mobile Networks and Its Applications

Science.gov (United States)

Bao, Fenye

2013-01-01

Trust management in mobile networks is challenging due to dynamically changing network environments and the lack of a centralized trusted authority. In this dissertation research, we "design" and "validate" a class of dynamic trust management protocols for mobile networks, and demonstrate the utility of dynamic trust management…

Statistical analysis of longitudinal network data with changing composition

NARCIS (Netherlands)

Huisman, M; Snijders, TAB; Snijders, Tom A.B.

2003-01-01

Markov chains can be used for the modeling of complex longitudinal network data. One class of probability models to model the evolution of social networks are stochastic actor-oriented models for network change proposed by Snijders. These models are continuous-time Markov chain models that are

Google in a quantum network.

Science.gov (United States)

Paparo, G D; Martin-Delgado, M A

2012-01-01

We introduce the characterization of a class of quantum PageRank algorithms in a scenario in which some kind of quantum network is realizable out of the current classical internet web, but no quantum computer is yet available. This class represents a quantization of the PageRank protocol currently employed to list web pages according to their importance. We have found an instance of this class of quantum protocols that outperforms its classical counterpart and may break the classical hierarchy of web pages depending on the topology of the web.

Providing end-to-end QoS for multimedia applications in 3G wireless networks

Science.gov (United States)

Guo, Katherine; Rangarajan, Samapth; Siddiqui, M. A.; Paul, Sanjoy

2003-11-01

As the usage of wireless packet data services increases, wireless carriers today are faced with the challenge of offering multimedia applications with QoS requirements within current 3G data networks. End-to-end QoS requires support at the application, network, link and medium access control (MAC) layers. We discuss existing CDMA2000 network architecture and show its shortcomings that prevent supporting multiple classes of traffic at the Radio Access Network (RAN). We then propose changes in RAN within the standards framework that enable support for multiple traffic classes. In addition, we discuss how Session Initiation Protocol (SIP) can be augmented with QoS signaling for supporting end-to-end QoS. We also review state of the art scheduling algorithms at the base station and provide possible extensions to these algorithms to support different classes of traffic as well as different classes of users.

PI3K class II α regulates δ-opioid receptor export from the trans-Golgi network.

Science.gov (United States)

Shiwarski, Daniel J; Darr, Marlena; Telmer, Cheryl A; Bruchez, Marcel P; Puthenveedu, Manojkumar A

2017-08-01

The interplay between signaling and trafficking by G protein-coupled receptors (GPCRs) has focused mainly on endocytic trafficking. Whether and how surface delivery of newly synthesized GPCRs is regulated by extracellular signals is less understood. Here we define a signaling-regulated checkpoint at the trans -Golgi network (TGN) that controls the surface delivery of the delta opioid receptor (δR). In PC12 cells, inhibition of phosphoinositide-3 kinase (PI3K) activity blocked export of newly synthesized δR from the Golgi and delivery to the cell surface, similar to treatment with nerve growth factor (NGF). Depletion of class II phosphoinositide-3 kinase α (PI3K C2A), but not inhibition of class I PI3K, blocked δR export to comparable levels and attenuated δR-mediated cAMP inhibition. NGF treatment displaced PI3K C2A from the Golgi and optogenetic recruitment of the PI3K C2A kinase domain to the TGN-induced δR export downstream of NGF. Of importance, PI3K C2A expression promotes export of endogenous δR in primary trigeminal ganglion neurons. Taken together, our results identify PI3K C2A as being required and sufficient for δR export and surface delivery in neuronal cells and suggest that it could be a key modulator of a novel Golgi export checkpoint that coordinates GPCR delivery to the surface. © 2017 Shiwarski et al. This article is distributed by The American Society for Cell Biology under license from the author(s). Two months after publication it is available to the public under an Attribution–Noncommercial–Share Alike 3.0 Unported Creative Commons License (http://creativecommons.org/licenses/by-nc-sa/3.0).

Functional asynchronous networks: Factorization of dynamics and function

Directory of Open Access Journals (Sweden)

Bick Christian

2016-01-01

Full Text Available In this note we describe the theory of functional asynchronous networks and one of the main results, the Modularization of Dynamics Theorem, which for a large class of functional asynchronous networks gives a factorization of dynamics in terms of constituent subnetworks. For these networks we can give a complete description of the network function in terms of the function of the events comprising the network and thereby answer a question originally raised by Alon in the context of biological networks.

Inferring network structure from cascades

Science.gov (United States)

Ghonge, Sushrut; Vural, Dervis Can

2017-07-01

Many physical, biological, and social phenomena can be described by cascades taking place on a network. Often, the activity can be empirically observed, but not the underlying network of interactions. In this paper we offer three topological methods to infer the structure of any directed network given a set of cascade arrival times. Our formulas hold for a very general class of models where the activation probability of a node is a generic function of its degree and the number of its active neighbors. We report high success rates for synthetic and real networks, for several different cascade models.

Herding Complex Networks

KAUST Repository

Ruf, Sebastian F.

2018-04-12

The problem of controlling complex networks is of interest to disciplines ranging from biology to swarm robotics. However, controllability can be too strict a condition, failing to capture a range of desirable behaviors. Herdability, which describes the ability to drive a system to a specific set in the state space, was recently introduced as an alternative network control notion. This paper considers the application of herdability to the study of complex networks. The herdability of a class of networked systems is investigated and two problems related to ensuring system herdability are explored. The first is the input addition problem, which investigates which nodes in a network should receive inputs to ensure that the system is herdable. The second is a related problem of selecting the best single node from which to herd the network, in the case that a single node is guaranteed to make the system is herdable. In order to select the best herding node, a novel control energy based herdability centrality measure is introduced.

TTEthernet for Integrated Spacecraft Networks

Science.gov (United States)

Loveless, Andrew

2015-01-01

determinism required by real-time spacecraft applications. Even with modern advancements, the uncoordinated (i.e. event-driven) nature of Ethernet communication unavoidably leads to message contention within network switches. The arbitration process used to resolve such conflicts introduces variation in the time it takes for messages to be forwarded. TTEthernet1 introduces decentralized clock synchronization to switched Ethernet, enabling message transmission according to a time-triggered (TT) paradigm. A network planning tool is used to allocate each device a finite amount of time in which it may transmit a frame. Each time slot is repeated sequentially to form a periodic communication schedule that is then loaded onto each TTEthernet device (e.g. switches and end systems). Each network participant references the synchronized time in order to dispatch messages at predetermined instances. This schedule guarantees that no contention exists between time-triggered Ethernet frames in the network switches, therefore eliminating the need for arbitration (and the timing variation it causes). Besides time-triggered messaging, TTEthernet networks may provide two additional traffic classes to support communication of different criticality levels. In the rate-constrained (RC) traffic class, the frame payload size and rate of transmission along each communication channel are limited to predetermined maximums. The network switches can therefore be configured to accommodate the known worst-case traffic pattern, and buffer overflows can be eliminated. The best-effort (BE) traffic class behaves akin to classical Ethernet. No guarantees are provided regarding transmission latency or successful message delivery. TTEthernet coordinates transmission of all three traffic classes over the same physical connections, therefore accommodating the full spectrum of traffic criticality levels required in IMA architectures. Common computing platforms (e.g. LRUs) can share networking resources in such a

Cheias de Charme (Full of Charm The working class in cyberculture paradise

Directory of Open Access Journals (Sweden)

Gisela Grangeiro da Silva Castro

2012-12-01

Full Text Available Given the leadership of Rede Globo in the Brazilian media scene, this paper aims to analyze marketing strategies present in the telenovela Cheias de Charme (Full of Charm in order to elicit interaction with internet social networks. The telenovela takes part in the social pedagogy, especially aimed at the audience stratum for whom television is the main source of daily leisure. Cheias de Charme focuses on class C portraying domestic workers as main characters. In today’s complex communication ecosystem, we highlight the growing access of lower income classes to digital media and the relevance of the Brazilians in digital social networks. By examining this example of transmedia storytelling we discuss today’s striking HYBRIDIZATION between communication, consumption and entertainment.

Covering #SAE: A Mobile Reporting Class's Changing Patterns of Interaction on Twitter over Time

Science.gov (United States)

Jones, Julie

2015-01-01

This study examined the social network that emerged on Twitter surrounding a mobile reporting class as they covered a national breaking news event. The work introduces pedagogical strategies that enhance students' learning opportunities. Through NodeXL and social network cluster analysis, six groups emerged from the Twitter interactions tied to…

Hidden neural networks: application to speech recognition

DEFF Research Database (Denmark)

Riis, Søren Kamaric

1998-01-01

We evaluate the hidden neural network HMM/NN hybrid on two speech recognition benchmark tasks; (1) task independent isolated word recognition on the Phonebook database, and (2) recognition of broad phoneme classes in continuous speech from the TIMIT database. It is shown how hidden neural networks...

Introduction into bi-partite networks in python

OpenAIRE

Kasberger, Stefan

2016-01-01

This essay and the related computation delivers a comprehensive introduction into the concept of bipartite networks, a class of networks whose nodes are divided into two sets and only the connection between two nodes in different sets is allowed (Easley and Kleinberg, 2010). The analysis and visualization is done in the programming language Python and offers easy to understand first steps in both fields, network analyses and python programming. As data a collaboration network of github users ...

Neural network modeling of associative memory: Beyond the Hopfield model

Science.gov (United States)

Dasgupta, Chandan

1992-07-01

A number of neural network models, in which fixed-point and limit-cycle attractors of the underlying dynamics are used to store and associatively recall information, are described. In the first class of models, a hierarchical structure is used to store an exponentially large number of strongly correlated memories. The second class of models uses limit cycles to store and retrieve individual memories. A neurobiologically plausible network that generates low-amplitude periodic variations of activity, similar to the oscillations observed in electroencephalographic recordings, is also described. Results obtained from analytic and numerical studies of the properties of these networks are discussed.

Adaptive Neural Control for a Class of Outputs Time-Delay Nonlinear Systems

Directory of Open Access Journals (Sweden)

Ruliang Wang

2012-01-01

Full Text Available This paper considers an adaptive neural control for a class of outputs time-delay nonlinear systems with perturbed or no. Based on RBF neural networks, the radius basis function (RBF neural networks is employed to estimate the unknown continuous functions. The proposed control guarantees that all closed-loop signals remain bounded. The simulation results demonstrate the effectiveness of the proposed control scheme.

Light Manipulation in Metallic Nanowire Networks with Functional Connectivity

KAUST Repository

Galinski, Henning; Fratalocchi, Andrea; Dö beli, Max; Capasso, Federico

2016-01-01

Guided by ideas from complex systems, a new class of network metamaterials is introduced for light manipulation, which are based on the functional connectivity among heterogeneous subwavelength components arranged in complex networks. The model

Intrusion Detection System Using Deep Neural Network for In-Vehicle Network Security.

Directory of Open Access Journals (Sweden)

Min-Joo Kang

Full Text Available A novel intrusion detection system (IDS using a deep neural network (DNN is proposed to enhance the security of in-vehicular network. The parameters building the DNN structure are trained with probability-based feature vectors that are extracted from the in-vehicular network packets. For a given packet, the DNN provides the probability of each class discriminating normal and attack packets, and, thus the sensor can identify any malicious attack to the vehicle. As compared to the traditional artificial neural network applied to the IDS, the proposed technique adopts recent advances in deep learning studies such as initializing the parameters through the unsupervised pre-training of deep belief networks (DBN, therefore improving the detection accuracy. It is demonstrated with experimental results that the proposed technique can provide a real-time response to the attack with a significantly improved detection ratio in controller area network (CAN bus.

Intrusion Detection System Using Deep Neural Network for In-Vehicle Network Security.

Science.gov (United States)

Kang, Min-Joo; Kang, Je-Won

2016-01-01

A novel intrusion detection system (IDS) using a deep neural network (DNN) is proposed to enhance the security of in-vehicular network. The parameters building the DNN structure are trained with probability-based feature vectors that are extracted from the in-vehicular network packets. For a given packet, the DNN provides the probability of each class discriminating normal and attack packets, and, thus the sensor can identify any malicious attack to the vehicle. As compared to the traditional artificial neural network applied to the IDS, the proposed technique adopts recent advances in deep learning studies such as initializing the parameters through the unsupervised pre-training of deep belief networks (DBN), therefore improving the detection accuracy. It is demonstrated with experimental results that the proposed technique can provide a real-time response to the attack with a significantly improved detection ratio in controller area network (CAN) bus.

Observer-Based Controller Design for a Class of Nonlinear Networked Control Systems with Random Time-Delays Modeled by Markov Chains

Directory of Open Access Journals (Sweden)

Yanfeng Wang

2017-01-01

Full Text Available This paper investigates the observer-based controller design problem for a class of nonlinear networked control systems with random time-delays. The nonlinearity is assumed to satisfy a global Lipschitz condition and two dependent Markov chains are employed to describe the time-delay from sensor to controller (S-C delay and the time-delay from controller to actuator (C-A delay, respectively. The transition probabilities of S-C delay and C-A delay are both assumed to be partly inaccessible. Sufficient conditions on the stochastic stability for the closed-loop systems are obtained by constructing proper Lyapunov functional. The methods of calculating the controller and the observer gain matrix are also given. Two numerical examples are used to illustrate the effectiveness of the proposed method.

Phase-space networks of geometrically frustrated systems.

Science.gov (United States)

Han, Yilong

2009-11-01

We illustrate a network approach to the phase-space study by using two geometrical frustration models: antiferromagnet on triangular lattice and square ice. Their highly degenerated ground states are mapped as discrete networks such that the quantitative network analysis can be applied to phase-space studies. The resulting phase spaces share some comon features and establish a class of complex networks with unique Gaussian spectral densities. Although phase-space networks are heterogeneously connected, the systems are still ergodic due to the random Poisson processes. This network approach can be generalized to phase spaces of some other complex systems.

Recruitment dynamics in adaptive social networks

Science.gov (United States)

Shkarayev, Maxim S.; Schwartz, Ira B.; Shaw, Leah B.

2013-06-01

We model recruitment in adaptive social networks in the presence of birth and death processes. Recruitment is characterized by nodes changing their status to that of the recruiting class as a result of contact with recruiting nodes. Only a susceptible subset of nodes can be recruited. The recruiting individuals may adapt their connections in order to improve recruitment capabilities, thus changing the network structure adaptively. We derive a mean-field theory to predict the dependence of the growth threshold of the recruiting class on the adaptation parameter. Furthermore, we investigate the effect of adaptation on the recruitment level, as well as on network topology. The theoretical predictions are compared with direct simulations of the full system. We identify two parameter regimes with qualitatively different bifurcation diagrams depending on whether nodes become susceptible frequently (multiple times in their lifetime) or rarely (much less than once per lifetime).

Recruitment dynamics in adaptive social networks

International Nuclear Information System (INIS)

Shkarayev, Maxim S; Shaw, Leah B; Schwartz, Ira B

2013-01-01

We model recruitment in adaptive social networks in the presence of birth and death processes. Recruitment is characterized by nodes changing their status to that of the recruiting class as a result of contact with recruiting nodes. Only a susceptible subset of nodes can be recruited. The recruiting individuals may adapt their connections in order to improve recruitment capabilities, thus changing the network structure adaptively. We derive a mean-field theory to predict the dependence of the growth threshold of the recruiting class on the adaptation parameter. Furthermore, we investigate the effect of adaptation on the recruitment level, as well as on network topology. The theoretical predictions are compared with direct simulations of the full system. We identify two parameter regimes with qualitatively different bifurcation diagrams depending on whether nodes become susceptible frequently (multiple times in their lifetime) or rarely (much less than once per lifetime). (paper)

Defect networks and supersymmetric loop operators

Energy Technology Data Exchange (ETDEWEB)

Bullimore, Mathew [Perimeter Institute for Theoretical Physics, 31 Caroline Street North, Waterloo, ON N2L 2Y5 (Canada)

2015-02-10

We consider topological defect networks with junctions in A{sub N−1} Toda CFT and the connection to supersymmetric loop operators in N=2 theories of class S on a four-sphere. Correlation functions in the presence of topological defect networks are computed by exploiting the monodromy of conformal blocks, generalising the notion of a Verlinde operator. Concentrating on a class of topological defects in A{sub 2} Toda theory, we find that the Verlinde operators generate an algebra whose structure is determined by a set of generalised skein relations that encode the representation theory of a quantum group. In the second half of the paper, we explore the dictionary between topological defect networks and supersymmetric loop operators in the N=2{sup ∗} theory by comparing to exact localisation computations. In this context, the the generalised skein relations are related to the operator product expansion of loop operators.

The application of neural network for the advancement of the eddy current testing

International Nuclear Information System (INIS)

Sakai, T.; Soneda, N.

1996-01-01

All the steam generator (SG) tubes of Japanese pressurized water reactors (PWRs) are inspected by the eddy current testing (ECT) method in every annual scheduled inspection. Here, a neural network system to estimate the class and size of defects from signals obtained by the eddy current testing (ECT) method has been developed. A trajectory of ECT signal is characterized by four representative parameters, and totally eight parameters obtained from two trajectories by different AC current frequencies are used as input parameters for neutral networks. A probabilistic descent method is employed to minimize the error at the learning process of neural networks. It is indicated that using multiple neutral networks which are separately responsible to each class of defects is effective to the improvement of their estimation accuracy. And, it is demonstrated that the neural network system which the authors developed can estimate the class and size of defects from unlearned trajectories with high accuracy

An Agenda for Research on Work and Class in the Post-socialist World

DEFF Research Database (Denmark)

Morris, Jeremy

2017-01-01

) greater confrontation of the one-sided discourse on class in these societies and the academy itself (a class blindness of research). 2) The value in studying postsocialist societies both comparatively to Global North and South, and as an intermediate positioning for worker exploitation and responses...... in global capitalism. 3) To achieve the first two agenda items a more grounded methodological approach proceeding from the lived experience of class and work is proposed. Current research on social networks, memory studies and personhood, the informal economy, deindustrialization, and the ‘domestication...

A reconstruction problem for a class of phylogenetic networks with lateral gene transfers.

Science.gov (United States)

Cardona, Gabriel; Pons, Joan Carles; Rosselló, Francesc

2015-01-01

Lateral, or Horizontal, Gene Transfers are a type of asymmetric evolutionary events where genetic material is transferred from one species to another. In this paper we consider LGT networks, a general model of phylogenetic networks with lateral gene transfers which consist, roughly, of a principal rooted tree with its leaves labelled on a set of taxa, and a set of extra secondary arcs between nodes in this tree representing lateral gene transfers. An LGT network gives rise in a natural way to a principal phylogenetic subtree and a set of secondary phylogenetic subtrees, which, roughly, represent, respectively, the main line of evolution of most genes and the secondary lines of evolution through lateral gene transfers. We introduce a set of simple conditions on an LGT network that guarantee that its principal and secondary phylogenetic subtrees are pairwise different and that these subtrees determine, up to isomorphism, the LGT network. We then give an algorithm that, given a set of pairwise different phylogenetic trees [Formula: see text] on the same set of taxa, outputs, when it exists, the LGT network that satisfies these conditions and such that its principal phylogenetic tree is [Formula: see text] and its secondary phylogenetic trees are [Formula: see text].

VSAT communications networks - An overview

Science.gov (United States)

Chakraborty, D.

1988-05-01

The very-small-aperture-terminal (VSAT) fixed satellite communication network is a star network in which many dispersed micro terminals attempt to send data in a packet form through a random access/time-division multiple-access (RA/TDMA) satellite channel with transmission delay. The basic concept of the VSAT and its service potential are discussed. Two classes of traffic are addressed, namely, business-oriented low-rate-data traffic and bulk data traffic of corporate networks. Satellite access, throughput, and delay are considered. The size of the network population that can be served in an RA/TDMA environment is calculated. User protocols are examined. A typical VSAT business scenario is described.

A hybrid approach for predicting promiscuous MHC class I restricted ...

Indian Academy of Sciences (India)

Prakash

2006-09-15

Sep 15, 2006 ... with existing MHC binder prediction methods for alleles studied by both ... in locating the promiscuous MHC binding regions from antigen sequence. ... Artificial neural network; MHC class I alleles; promiscuous binders; ... this problem by developing methods for prediction for ... In case equal number of.

Artificial organic networks artificial intelligence based on carbon networks

CERN Document Server

Ponce-Espinosa, Hiram; Molina, Arturo

2014-01-01

This monograph describes the synthesis and use of biologically-inspired artificial hydrocarbon networks (AHNs) for approximation models associated with machine learning and a novel computational algorithm with which to exploit them. The reader is first introduced to various kinds of algorithms designed to deal with approximation problems and then, via some conventional ideas of organic chemistry, to the creation and characterization of artificial organic networks and AHNs in particular. The advantages of using organic networks are discussed with the rules to be followed to adapt the network to its objectives. Graph theory is used as the basis of the necessary formalism. Simulated and experimental examples of the use of fuzzy logic and genetic algorithms with organic neural networks are presented and a number of modeling problems suitable for treatment by AHNs are described: ·        approximation; ·        inference; ·        clustering; ·        control; ·        class...

Semantic Analysis of Virtual Classes and Nested Classes

DEFF Research Database (Denmark)

Madsen, Ole Lehrmann

1999-01-01

Virtual classes and nested classes are distinguishing features of BETA. Nested classes originated from Simula, but until recently they have not been part of main stream object- oriented languages. C++ has a restricted form of nested classes and they were included in Java 1.1. Virtual classes...... classes and parameterized classes have been made. Although virtual classes and nested classes have been used in BETA for more than a decade, their implementation has not been published. The purpose of this paper is to contribute to the understanding of virtual classes and nested classes by presenting...

Named data networking-based smart home

OpenAIRE

Syed Hassan Ahmed; Dongkyun Kim

2016-01-01

Named data networking (NDN) treats content/data as a “first class citizen” of the network by giving it a “name”. This content “name” is used to retrieve any information, unlike in device-centric networks (i.e., the current Internet), which depend on physical IP addresses. Meanwhile, the smart home concept has been gaining attention in academia and industries; various low-cost embedded devices are considered that can sense, process, store, and communicate data autonomously. In this paper, we s...

Collective network for computer structures

Science.gov (United States)

Blumrich, Matthias A [Ridgefield, CT; Coteus, Paul W [Yorktown Heights, NY; Chen, Dong [Croton On Hudson, NY; Gara, Alan [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Hoenicke, Dirk [Ossining, NY; Takken, Todd E [Brewster, NY; Steinmacher-Burow, Burkhard D [Wernau, DE; Vranas, Pavlos M [Bedford Hills, NY

2011-08-16

A system and method for enabling high-speed, low-latency global collective communications among interconnected processing nodes. The global collective network optimally enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices ate included that interconnect the nodes of the network via links to facilitate performance of low-latency global processing operations at nodes of the virtual network and class structures. The global collective network may be configured to provide global barrier and interrupt functionality in asynchronous or synchronized manner. When implemented in a massively-parallel supercomputing structure, the global collective network is physically and logically partitionable according to needs of a processing algorithm.

On the behaviour of classes of min-max-plus systems

NARCIS (Netherlands)

Soto y Koelemeijer, G.

2003-01-01

Discrete Event Systems are systems, the time evolution of which can be described by the occurence of events. Well-known examples of DESs are manufacturing systems and transportation networks. An important class of DESs can be described by the so-called (max,+) algebra, in which, compared to the

Genetic adaptation of the antibacterial human innate immunity network.

Science.gov (United States)

Casals, Ferran; Sikora, Martin; Laayouni, Hafid; Montanucci, Ludovica; Muntasell, Aura; Lazarus, Ross; Calafell, Francesc; Awadalla, Philip; Netea, Mihai G; Bertranpetit, Jaume

2011-07-11

Pathogens have represented an important selective force during the adaptation of modern human populations to changing social and other environmental conditions. The evolution of the immune system has therefore been influenced by these pressures. Genomic scans have revealed that immune system is one of the functions enriched with genes under adaptive selection. Here, we describe how the innate immune system has responded to these challenges, through the analysis of resequencing data for 132 innate immunity genes in two human populations. Results are interpreted in the context of the functional and interaction networks defined by these genes. Nucleotide diversity is lower in the adaptors and modulators functional classes, and is negatively correlated with the centrality of the proteins within the interaction network. We also produced a list of candidate genes under positive or balancing selection in each population detected by neutrality tests and showed that some functional classes are preferential targets for selection. We found evidence that the role of each gene in the network conditions the capacity to evolve or their evolvability: genes at the core of the network are more constrained, while adaptation mostly occurred at particular positions at the network edges. Interestingly, the functional classes containing most of the genes with signatures of balancing selection are involved in autoinflammatory and autoimmune diseases, suggesting a counterbalance between the beneficial and deleterious effects of the immune response.

Exponential stability of Cohen-Grossberg neural networks with a general class of activation functions

International Nuclear Information System (INIS)

Wan Anhua; Wang Miansen; Peng Jigen; Qiao Hong

2006-01-01

In this Letter, the dynamics of Cohen-Grossberg neural networks model are investigated. The activation functions are only assumed to be Lipschitz continuous, which provide a much wider application domain for neural networks than the previous results. By means of the extended nonlinear measure approach, new and relaxed sufficient conditions for the existence, uniqueness and global exponential stability of equilibrium of the neural networks are obtained. Moreover, an estimate for the exponential convergence rate of the neural networks is precisely characterized. Our results improve those existing ones

Dynamics of domain wall networks with junctions

International Nuclear Information System (INIS)

Avelino, P. P.; Oliveira, J. C. R. E.; Martins, C. J. A. P.; Menezes, J.; Menezes, R.

2008-01-01

We use a combination of analytic tools and an extensive set of the largest and most accurate three-dimensional field theory numerical simulations to study the dynamics of domain wall networks with junctions. We build upon our previous work and consider a class of models which, in the limit of large number N of coupled scalar fields, approaches the so-called ''ideal'' model (in terms of its potential to lead to network frustration). We consider values of N between N=2 and N=20, and a range of cosmological epochs, and we also compare this class of models with other toy models used in the past. In all cases we find compelling evidence for a gradual approach to scaling, strongly supporting our no-frustration conjecture. We also discuss the various possible types of junctions (including cases where there is a hierarchy of them) and their roles in the dynamics of the network. Finally, we provide a cosmological Zel'dovich-type bound on the energy scale of this kind of defect network: it must be lower than 10 keV.

Self-organized critical neural networks

International Nuclear Information System (INIS)

Bornholdt, Stefan; Roehl, Torsten

2003-01-01

A mechanism for self-organization of the degree of connectivity in model neural networks is studied. Network connectivity is regulated locally on the basis of an order parameter of the global dynamics, which is estimated from an observable at the single synapse level. This principle is studied in a two-dimensional neural network with randomly wired asymmetric weights. In this class of networks, network connectivity is closely related to a phase transition between ordered and disordered dynamics. A slow topology change is imposed on the network through a local rewiring rule motivated by activity-dependent synaptic development: Neighbor neurons whose activity is correlated, on average develop a new connection while uncorrelated neighbors tend to disconnect. As a result, robust self-organization of the network towards the order disorder transition occurs. Convergence is independent of initial conditions, robust against thermal noise, and does not require fine tuning of parameters

Bayesian latent feature modeling for modeling bipartite networks with overlapping groups

DEFF Research Database (Denmark)

Jørgensen, Philip H.; Mørup, Morten; Schmidt, Mikkel Nørgaard

2016-01-01

Bi-partite networks are commonly modelled using latent class or latent feature models. Whereas the existing latent class models admit marginalization of parameters specifying the strength of interaction between groups, existing latent feature models do not admit analytical marginalization...... by the notion of community structure such that the edge density within groups is higher than between groups. Our model further assumes that entities can have different propensities of generating links in one of the modes. The proposed framework is contrasted on both synthetic and real bi-partite networks...... feature representations in bipartite networks provides a new framework for accounting for structure in bi-partite networks using binary latent feature representations providing interpretable representations that well characterize structure as quantified by link prediction....

Robust classification using mixtures of dependency networks

DEFF Research Database (Denmark)

Gámez, José A.; Mateo, Juan L.; Nielsen, Thomas Dyhre

2008-01-01

Dependency networks have previously been proposed as alternatives to e.g. Bayesian networks by supporting fast algorithms for automatic learning. Recently dependency networks have also been proposed as classification models, but as with e.g. general probabilistic inference, the reported speed......-ups are often obtained at the expense of accuracy. In this paper we try to address this issue through the use of mixtures of dependency networks. To reduce learning time and improve robustness when dealing with data sparse classes, we outline methods for reusing calculations across mixture components. Finally...

Adaptive Networks Theory, Models and Applications

CERN Document Server

Gross, Thilo

2009-01-01

With adaptive, complex networks, the evolution of the network topology and the dynamical processes on the network are equally important and often fundamentally entangled. Recent research has shown that such networks can exhibit a plethora of new phenomena which are ultimately required to describe many real-world networks. Some of those phenomena include robust self-organization towards dynamical criticality, formation of complex global topologies based on simple, local rules, and the spontaneous division of "labor" in which an initially homogenous population of network nodes self-organizes into functionally distinct classes. These are just a few. This book is a state-of-the-art survey of those unique networks. In it, leading researchers set out to define the future scope and direction of some of the most advanced developments in the vast field of complex network science and its applications.

Heterogeneous Associations of Second-Graders' Learning in Robotics Class

Science.gov (United States)

Cho, Eunji; Lee, Kyunghwa; Cherniak, Shara; Jung, Sung Eun

2017-01-01

Drawing on Latour's (Reassembling the social: an introduction to actor--network-theory, Oxford University Press, New York, 2005), this manuscript discusses a study of a robotics class in a public, Title I elementary school. Compared with theoretical frameworks (e.g., constructivism and constructionism) dominant in the field of early childhood…

Synapse:neural network for predict power consumption: users guide

Energy Technology Data Exchange (ETDEWEB)

Muller, C; Mangeas, M; Perrot, N

1994-08-01

SYNAPSE is forecasting tool designed to predict power consumption in metropolitan France on the half hour time scale. Some characteristics distinguish this forecasting model from those which already exist. In particular, it is composed of numerous neural networks. The idea for using many neural networks arises from past tests. These tests showed us that a single neural network is not able to solve the problem correctly. From this result, we decided to perform unsupervised classification of the 24 consumption curves. From this classification, six classes appeared, linked with the weekdays: Mondays, Tuesdays, Wednesdays, Thursdays, Fridays, Saturdays, Sundays, holidays and bridge days. For each class and for each half hour, two multilayer perceptrons are built. The two of them forecast the power for one particular half hour, and for a day including one of the determined class. The input of these two network are different: the first one (short time forecasting) includes the powers for the most recent half hour and relative power of the previous day; the second (medium time forecasting) includes only the relative power of the previous day. A process connects the results of every networks and allows one to forecast more than one half-hour in advance. In this process, short time forecasting networks and medium time forecasting networks are used differently. The first kind of neural networks gives good results on the scale of one day. The second one gives good forecasts for the next predicted powers. In this note, the organization of the SYNAPSE program is detailed, and the user`s menu is described. This first version of synapse works and should allow the APC group to evaluate its utility. (authors). 6 refs., 2 appends.

Bounded-Degree Approximations of Stochastic Networks

Energy Technology Data Exchange (ETDEWEB)

Quinn, Christopher J.; Pinar, Ali; Kiyavash, Negar

2017-06-01

We propose algorithms to approximate directed information graphs. Directed information graphs are probabilistic graphical models that depict causal dependencies between stochastic processes in a network. The proposed algorithms identify optimal and near-optimal approximations in terms of Kullback-Leibler divergence. The user-chosen sparsity trades off the quality of the approximation against visual conciseness and computational tractability. One class of approximations contains graphs with speci ed in-degrees. Another class additionally requires that the graph is connected. For both classes, we propose algorithms to identify the optimal approximations and also near-optimal approximations, using a novel relaxation of submodularity. We also propose algorithms to identify the r-best approximations among these classes, enabling robust decision making.

Learning-parameter adjustment in neural networks

Science.gov (United States)

Heskes, Tom M.; Kappen, Bert

1992-06-01

We present a learning-parameter adjustment algorithm, valid for a large class of learning rules in neural-network literature. The algorithm follows directly from a consideration of the statistics of the weights in the network. The characteristic behavior of the algorithm is calculated, both in a fixed and a changing environment. A simple example, Widrow-Hoff learning for statistical classification, serves as an illustration.

Modular analysis of biological networks.

Science.gov (United States)

Kaltenbach, Hans-Michael; Stelling, Jörg

2012-01-01

The analysis of complex biological networks has traditionally relied on decomposition into smaller, semi-autonomous units such as individual signaling pathways. With the increased scope of systems biology (models), rational approaches to modularization have become an important topic. With increasing acceptance of de facto modularity in biology, widely different definitions of what constitutes a module have sparked controversies. Here, we therefore review prominent classes of modular approaches based on formal network representations. Despite some promising research directions, several important theoretical challenges remain open on the way to formal, function-centered modular decompositions for dynamic biological networks.

Light Manipulation in Metallic Nanowire Networks with Functional Connectivity

KAUST Repository

Galinski, Henning

2016-12-27

Guided by ideas from complex systems, a new class of network metamaterials is introduced for light manipulation, which are based on the functional connectivity among heterogeneous subwavelength components arranged in complex networks. The model system is a nanonetwork formed by dealloying a metallic thin film. The connectivity of the network is deterministically controlled, enabling the formation of tunable absorbing states.

Cultural Ecosystem of Creative Place: Creative Class, Creative Networks and Participation in Culture

Directory of Open Access Journals (Sweden)

Anders-Morawska Justyna

2017-06-01

Full Text Available The scope of this paper is to conceptualise a data-based research framework for the role of creative networks in cultural exchange. Participation in culture measured as audience per 1000 residents and expenditures on culture-related activities were analysed in relation to such territorial assets as accessibility to creative infrastructure, the economic status of residents, the governance networks of civil society, and cultural capital. The results indicate how accessibility, governance networks, and cultural capital contribute to participation measured via audience indicators while a low poverty rate has explanatory value with respect to expenditures on culture.

Synchronization on effective networks

International Nuclear Information System (INIS)

Zhou Tao; Zhao Ming; Zhou Changsong

2010-01-01

The study of network synchronization has attracted increasing attentionrecently. In this paper, we strictly define a class of networks, namely effective networks, which are synchronizable and orientable networks. We can prove that all the effective networks with the same size have the same spectra, and are of the best synchronizability according to the master stability analysis. However, it is found that the synchronization time for different effective networks can be quite different. Further analysis shows that the key ingredient affecting the synchronization time is the maximal depth of an effective network: the larger depth results in a longer synchronization time. The secondary factor is the number of links. The increasing number of links connecting nodes in the same layer (horizontal links) will lead to longer synchronization time, whereas the increasing number of links connecting nodes in neighboring layers (vertical links) will accelerate the synchronization. Our analysis of the relationship between the structure and synchronization properties of the original and effective networks shows that the purely directed effective network can provide an approximation of the original weighted network with normalized input strength. Our findings provide insights into the roles of depth, horizontal and vertical links in the synchronizing process, and suggest that the spectral analysis is helpful yet insufficient for the comprehensive understanding of network synchronization.

Synchronization on effective networks

Energy Technology Data Exchange (ETDEWEB)

Zhou Tao [Web Sciences Center, University of Electronic Science and Technology of China, Chengdu 610054 (China); Zhao Ming [Department of Modern Physics, University of Science and Technology of China, Hefei 230026 (China); Zhou Changsong, E-mail: cszhou@hkbu.edu.h [Department of Physics, Hong Kong Baptist University, Kowloon Tong (Hong Kong)

2010-04-15

The study of network synchronization has attracted increasing attentionrecently. In this paper, we strictly define a class of networks, namely effective networks, which are synchronizable and orientable networks. We can prove that all the effective networks with the same size have the same spectra, and are of the best synchronizability according to the master stability analysis. However, it is found that the synchronization time for different effective networks can be quite different. Further analysis shows that the key ingredient affecting the synchronization time is the maximal depth of an effective network: the larger depth results in a longer synchronization time. The secondary factor is the number of links. The increasing number of links connecting nodes in the same layer (horizontal links) will lead to longer synchronization time, whereas the increasing number of links connecting nodes in neighboring layers (vertical links) will accelerate the synchronization. Our analysis of the relationship between the structure and synchronization properties of the original and effective networks shows that the purely directed effective network can provide an approximation of the original weighted network with normalized input strength. Our findings provide insights into the roles of depth, horizontal and vertical links in the synchronizing process, and suggest that the spectral analysis is helpful yet insufficient for the comprehensive understanding of network synchronization.

A neural networks application for the study of the influence of transport conditions on the working performance

Science.gov (United States)

Anghel, D.-C.; Ene, A.; Ştirbu, C.; Sicoe, G.

2017-10-01

This paper presents a study about the factors that influence the working performances of workers in the automotive industry. These factors regard mainly the transportations conditions, taking into account the fact that a large number of workers live in places that are far away of the enterprise. The quantitative data obtained from this study will be generalized by using a neural network, software simulated. The neural network is able to estimate the performance of workers even for the combinations of input factors that had been not recorded by the study. The experimental data obtained from the study will be divided in two classes. The first class that contains approximately 80% of data will be used by the Java software for the training of the neural network. The weights resulted from the training process will be saved in a text file. The other class that contains the rest of the 20% of experimental data will be used to validate the neural network. The training and the validation of the networks are performed in a Java software (TrainAndValidate java class). We designed another java class, Test.java that will be used with new input data, for new situations. The experimental data collected from the study. The software that simulated the neural network. The software that estimates the working performance, when new situations are met. This application is useful for human resources department of an enterprise. The output results are not quantitative. They are qualitative (from low performance to high performance, divided in five classes).

Distributed Event-Based Set-Membership Filtering for a Class of Nonlinear Systems With Sensor Saturations Over Sensor Networks.

Science.gov (United States)

Ma, Lifeng; Wang, Zidong; Lam, Hak-Keung; Kyriakoulis, Nikos

2017-11-01

In this paper, the distributed set-membership filtering problem is investigated for a class of discrete time-varying system with an event-based communication mechanism over sensor networks. The system under consideration is subject to sector-bounded nonlinearity, unknown but bounded noises and sensor saturations. Each intelligent sensing node transmits the data to its neighbors only when certain triggering condition is violated. By means of a set of recursive matrix inequalities, sufficient conditions are derived for the existence of the desired distributed event-based filter which is capable of confining the system state in certain ellipsoidal regions centered at the estimates. Within the established theoretical framework, two additional optimization problems are formulated: one is to seek the minimal ellipsoids (in the sense of matrix trace) for the best filtering performance, and the other is to maximize the triggering threshold so as to reduce the triggering frequency with satisfactory filtering performance. A numerically attractive chaos algorithm is employed to solve the optimization problems. Finally, an illustrative example is presented to demonstrate the effectiveness and applicability of the proposed algorithm.

Childhood Trauma, Social Networks, and the Mental Health of Adult Survivors.

Science.gov (United States)

Schneider, F David; Loveland Cook, Cynthia A; Salas, Joanne; Scherrer, Jeffrey; Cleveland, Ivy N; Burge, Sandra K

2017-03-01

The purpose of this study was to investigate the relationship of childhood trauma to the quality of social networks and health outcomes later in adulthood. Data were obtained from a convenience sample of 254 adults seen in one of 10 primary care clinics in the state of Texas. Standardized measures of adverse childhood experiences (ACEs), stressful and supportive social relationships, medical conditions, anxiety, depression, and health-related quality of life were administered. Using latent class analysis, subjects were assigned to one of four ACE classes: (a) minimal childhood abuse (56%), (b) physical/verbal abuse of both child and mother with household alcohol abuse (13%), (c) verbal and physical abuse of child with household mental illness (12%), and (d) verbal abuse only (19%). Statistically significant differences across the four ACE classes were found for mental health outcomes in adulthood. Although respondents who were physically and verbally abused as children reported compromised mental health, this was particularly true for those who witnessed physical abuse of their mother. A similar relationship between ACE class and physical health was not found. The quality of adult social networks partly accounted for the relationship between ACE classes and mental health outcomes. Respondents exposed to ACEs with more supportive social networks as adults had diminished odds of reporting poor mental health. Conversely, increasing numbers of stressful social relationships contributed to adverse mental health outcomes. Although efforts to prevent childhood trauma remain a critical priority, the treatment of adult survivors needs to expand its focus on both strengthening social networks and decreasing the negative effects of stressful ones.

Class hierarchical test case generation algorithm based on expanded EMDPN model

Institute of Scientific and Technical Information of China (English)

LI Jun-yi; GONG Hong-fang; HU Ji-ping; ZOU Bei-ji; SUN Jia-guang

2006-01-01

A new model of event and message driven Petri network(EMDPN) based on the characteristic of class interaction for messages passing between two objects was extended. Using EMDPN interaction graph, a class hierarchical test-case generation algorithm with cooperated paths (copaths) was proposed, which can be used to solve the problems resulting from the class inheritance mechanism encountered in object-oriented software testing such as oracle, message transfer errors, and unreachable statement. Finally, the testing sufficiency was analyzed with the ordered sequence testing criterion(OSC). The results indicate that the test cases stemmed from newly proposed automatic algorithm of copaths generation satisfies synchronization message sequences testing criteria, therefore the proposed new algorithm of copaths generation has a good coverage rate.

Using Personal Portable Devices as Learning Tools in the English Class

Directory of Open Access Journals (Sweden)

Luz Edith Herrera Díaz

2014-10-01

Full Text Available A group of university students used a variety of personal portable devices (cellphones, tablets, laptops, and netbooks which distracted them in English class. This qualitative action research aimed to implement activities entailing the use of such devices and to learn their impact on students’ learning and the use of English in class. Thus, a series of applications was used to promote the use of these devices for the benefit of the English as a Foreign Language class. These applications included a learning management system that resembled a social network, a live interaction application, and an online dictionary. It was found that students were able to productively use these devices as learning tools plus they expressed comfort and interest in using them.

Stabilization of model-based networked control systems

Energy Technology Data Exchange (ETDEWEB)

Miranda, Francisco [CIDMA, Universidade de Aveiro, Aveiro (Portugal); Instituto Politécnico de Viana do Castelo, Viana do Castelo (Portugal); Abreu, Carlos [Instituto Politécnico de Viana do Castelo, Viana do Castelo (Portugal); CMEMS-UMINHO, Universidade do Minho, Braga (Portugal); Mendes, Paulo M. [CMEMS-UMINHO, Universidade do Minho, Braga (Portugal)

2016-06-08

A class of networked control systems called Model-Based Networked Control Systems (MB-NCSs) is considered. Stabilization of MB-NCSs is studied using feedback controls and simulation of stabilization for different feedbacks is made with the purpose to reduce the network trafic. The feedback control input is applied in a compensated model of the plant that approximates the plant dynamics and stabilizes the plant even under slow network conditions. Conditions for global exponential stabilizability and for the choosing of a feedback control input for a given constant time between the information moments of the network are derived. An optimal control problem to obtain an optimal feedback control is also presented.

Class prediction for high-dimensional class-imbalanced data

Directory of Open Access Journals (Sweden)

Lusa Lara

2010-10-01

Full Text Available Abstract Background The goal of class prediction studies is to develop rules to accurately predict the class membership of new samples. The rules are derived using the values of the variables available for each subject: the main characteristic of high-dimensional data is that the number of variables greatly exceeds the number of samples. Frequently the classifiers are developed using class-imbalanced data, i.e., data sets where the number of samples in each class is not equal. Standard classification methods used on class-imbalanced data often produce classifiers that do not accurately predict the minority class; the prediction is biased towards the majority class. In this paper we investigate if the high-dimensionality poses additional challenges when dealing with class-imbalanced prediction. We evaluate the performance of six types of classifiers on class-imbalanced data, using simulated data and a publicly available data set from a breast cancer gene-expression microarray study. We also investigate the effectiveness of some strategies that are available to overcome the effect of class imbalance. Results Our results show that the evaluated classifiers are highly sensitive to class imbalance and that variable selection introduces an additional bias towards classification into the majority class. Most new samples are assigned to the majority class from the training set, unless the difference between the classes is very large. As a consequence, the class-specific predictive accuracies differ considerably. When the class imbalance is not too severe, down-sizing and asymmetric bagging embedding variable selection work well, while over-sampling does not. Variable normalization can further worsen the performance of the classifiers. Conclusions Our results show that matching the prevalence of the classes in training and test set does not guarantee good performance of classifiers and that the problems related to classification with class

Personality and personal network type

NARCIS (Netherlands)

Doeven-Eggens, Lilian; De Fruyt, Filip; Hendriks, A. A. Jolijn; Bosker, Roel J.; Van der Werf, Margaretha P. C.

2008-01-01

The association between personality and personal relationships is mostly studied within dyadic relationships. We examined these variables within the context of personal network types. We used Latent Class Analysis to identify groups Of Students with similar role relationships with three focal

Genetic adaptation of the antibacterial human innate immunity network

Directory of Open Access Journals (Sweden)

Lazarus Ross

2011-07-01

Full Text Available Abstract Background Pathogens have represented an important selective force during the adaptation of modern human populations to changing social and other environmental conditions. The evolution of the immune system has therefore been influenced by these pressures. Genomic scans have revealed that immune system is one of the functions enriched with genes under adaptive selection. Results Here, we describe how the innate immune system has responded to these challenges, through the analysis of resequencing data for 132 innate immunity genes in two human populations. Results are interpreted in the context of the functional and interaction networks defined by these genes. Nucleotide diversity is lower in the adaptors and modulators functional classes, and is negatively correlated with the centrality of the proteins within the interaction network. We also produced a list of candidate genes under positive or balancing selection in each population detected by neutrality tests and showed that some functional classes are preferential targets for selection. Conclusions We found evidence that the role of each gene in the network conditions the capacity to evolve or their evolvability: genes at the core of the network are more constrained, while adaptation mostly occurred at particular positions at the network edges. Interestingly, the functional classes containing most of the genes with signatures of balancing selection are involved in autoinflammatory and autoimmune diseases, suggesting a counterbalance between the beneficial and deleterious effects of the immune response.

WiMAX network performance monitoring & optimization

DEFF Research Database (Denmark)

Zhang, Qi; Dam, H

2008-01-01

frequency reuse, capacity planning, proper network dimensioning, multi-class data services and so on. Furthermore, as a small operator we also want to reduce the demand for sophisticated technicians and man labour hours. To meet these critical demands, we design a generic integrated network performance......In this paper we present our WiMAX (worldwide interoperability for microwave access) network performance monitoring and optimization solution. As a new and small WiMAX network operator, there are many demanding issues that we have to deal with, such as limited available frequency resource, tight...... this integrated network performance monitoring and optimization system in our WiMAX networks. This integrated monitoring and optimization system has such good flexibility and scalability that individual function component can be used by other operators with special needs and more advanced function components can...

Eukaryotic genomes may exhibit up to 10 generic classes of gene promoters

Directory of Open Access Journals (Sweden)

Gagniuc Paul

2012-09-01

Full Text Available Abstract Background The main function of gene promoters appears to be the integration of different gene products in their biological pathways in order to maintain homeostasis. Generally, promoters have been classified in two major classes, namely TATA and CpG. Nevertheless, many genes using the same combinatorial formation of transcription factors have different gene expression patterns. Accordingly, we tried to ask ourselves some fundamental questions: Why certain genes have an overall predisposition for higher gene expression levels than others? What causes such a predisposition? Is there a structural relationship of these sequences in different tissues? Is there a strong phylogenetic relationship between promoters of closely related species? Results In order to gain valuable insights into different promoter regions, we obtained a series of image-based patterns which allowed us to identify 10 generic classes of promoters. A comprehensive analysis was undertaken for promoter sequences from Arabidopsis thaliana, Drosophila melanogaster, Homo sapiens and Oryza sativa, and a more extensive analysis of tissue-specific promoters in humans. We observed a clear preference for these species to use certain classes of promoters for specific biological processes. Moreover, in humans, we found that different tissues use distinct classes of promoters, reflecting an emerging promoter network. Depending on the tissue type, comparisons made between these classes of promoters reveal a complementarity between their patterns whereas some other classes of promoters have been observed to occur in competition. Furthermore, we also noticed the existence of some transitional states between these classes of promoters that may explain certain evolutionary mechanisms, which suggest a possible predisposition for specific levels of gene expression and perhaps for a different number of factors responsible for triggering gene expression. Our conclusions are based on

MIMO Communication for Cellular Networks

CERN Document Server

Huang, Howard; Venkatesan, Sivarama

2012-01-01

As the theoretical foundations of multiple-antenna techniques evolve and as these multiple-input multiple-output (MIMO) techniques become essential for providing high data rates in wireless systems, there is a growing need to understand the performance limits of MIMO in practical networks. To address this need, MIMO Communication for Cellular Networks presents a systematic description of MIMO technology classes and a framework for MIMO system design that takes into account the essential physical-layer features of practical cellular networks. In contrast to works that focus on the theoretical performance of abstract MIMO channels, MIMO Communication for Cellular Networks emphasizes the practical performance of realistic MIMO systems. A unified set of system simulation results highlights relative performance gains of different MIMO techniques and provides insights into how best to use multiple antennas in cellular networks under various conditions. MIMO Communication for Cellular Networks describes single-user,...

Maximizing synchronizability of duplex networks

Science.gov (United States)

Wei, Xiang; Emenheiser, Jeffrey; Wu, Xiaoqun; Lu, Jun-an; D'Souza, Raissa M.

2018-01-01

We study the synchronizability of duplex networks formed by two randomly generated network layers with different patterns of interlayer node connections. According to the master stability function, we use the smallest nonzero eigenvalue and the eigenratio between the largest and the second smallest eigenvalues of supra-Laplacian matrices to characterize synchronizability on various duplexes. We find that the interlayer linking weight and linking fraction have a profound impact on synchronizability of duplex networks. The increasingly large inter-layer coupling weight is found to cause either decreasing or constant synchronizability for different classes of network dynamics. In addition, negative node degree correlation across interlayer links outperforms positive degree correlation when most interlayer links are present. The reverse is true when a few interlayer links are present. The numerical results and understanding based on these representative duplex networks are illustrative and instructive for building insights into maximizing synchronizability of more realistic multiplex networks.

Bifurcation analysis on a generalized recurrent neural network with two interconnected three-neuron components

International Nuclear Information System (INIS)

Hajihosseini, Amirhossein; Maleki, Farzaneh; Rokni Lamooki, Gholam Reza

2011-01-01

Highlights: → We construct a recurrent neural network by generalizing a specific n-neuron network. → Several codimension 1 and 2 bifurcations take place in the newly constructed network. → The newly constructed network has higher capabilities to learn periodic signals. → The normal form theorem is applied to investigate dynamics of the network. → A series of bifurcation diagrams is given to support theoretical results. - Abstract: A class of recurrent neural networks is constructed by generalizing a specific class of n-neuron networks. It is shown that the newly constructed network experiences generic pitchfork and Hopf codimension one bifurcations. It is also proved that the emergence of generic Bogdanov-Takens, pitchfork-Hopf and Hopf-Hopf codimension two, and the degenerate Bogdanov-Takens bifurcation points in the parameter space is possible due to the intersections of codimension one bifurcation curves. The occurrence of bifurcations of higher codimensions significantly increases the capability of the newly constructed recurrent neural network to learn broader families of periodic signals.

A network dynamics approach to chemical reaction networks

Science.gov (United States)

van der Schaft, A. J.; Rao, S.; Jayawardhana, B.

2016-04-01

A treatment of a chemical reaction network theory is given from the perspective of nonlinear network dynamics, in particular of consensus dynamics. By starting from the complex-balanced assumption, the reaction dynamics governed by mass action kinetics can be rewritten into a form which allows for a very simple derivation of a number of key results in the chemical reaction network theory, and which directly relates to the thermodynamics and port-Hamiltonian formulation of the system. Central in this formulation is the definition of a balanced Laplacian matrix on the graph of chemical complexes together with a resulting fundamental inequality. This immediately leads to the characterisation of the set of equilibria and their stability. Furthermore, the assumption of complex balancedness is revisited from the point of view of Kirchhoff's matrix tree theorem. Both the form of the dynamics and the deduced behaviour are very similar to consensus dynamics, and provide additional perspectives to the latter. Finally, using the classical idea of extending the graph of chemical complexes by a 'zero' complex, a complete steady-state stability analysis of mass action kinetics reaction networks with constant inflows and mass action kinetics outflows is given, and a unified framework is provided for structure-preserving model reduction of this important class of open reaction networks.

Observability of Automata Networks: Fixed and Switching Cases.

Science.gov (United States)

Li, Rui; Hong, Yiguang; Wang, Xingyuan

2018-04-01

Automata networks are a class of fully discrete dynamical systems, which have received considerable interest in various different areas. This brief addresses the observability of automata networks and switched automata networks in a unified framework, and proposes simple necessary and sufficient conditions for observability. The results are achieved by employing methods from symbolic computation, and are suited for implementation using computer algebra systems. Several examples are presented to demonstrate the application of the results.

Robustness analysis of uncertain dynamical neural networks with multiple time delays.

Science.gov (United States)

Senan, Sibel

2015-10-01

This paper studies the problem of global robust asymptotic stability of the equilibrium point for the class of dynamical neural networks with multiple time delays with respect to the class of slope-bounded activation functions and in the presence of the uncertainties of system parameters of the considered neural network model. By using an appropriate Lyapunov functional and exploiting the properties of the homeomorphism mapping theorem, we derive a new sufficient condition for the existence, uniqueness and global robust asymptotic stability of the equilibrium point for the class of neural networks with multiple time delays. The obtained stability condition basically relies on testing some relationships imposed on the interconnection matrices of the neural system, which can be easily verified by using some certain properties of matrices. An instructive numerical example is also given to illustrate the applicability of our result and show the advantages of this new condition over the previously reported corresponding results. Copyright © 2015 Elsevier Ltd. All rights reserved.

Categorical Tensor Network States

Directory of Open Access Journals (Sweden)

Jacob D. Biamonte

2011-12-01

Full Text Available We examine the use of string diagrams and the mathematics of category theory in the description of quantum states by tensor networks. This approach lead to a unification of several ideas, as well as several results and methods that have not previously appeared in either side of the literature. Our approach enabled the development of a tensor network framework allowing a solution to the quantum decomposition problem which has several appealing features. Specifically, given an n-body quantum state |ψ〉, we present a new and general method to factor |ψ〉 into a tensor network of clearly defined building blocks. We use the solution to expose a previously unknown and large class of quantum states which we prove can be sampled efficiently and exactly. This general framework of categorical tensor network states, where a combination of generic and algebraically defined tensors appear, enhances the theory of tensor network states.

Airplane detection in remote sensing images using convolutional neural networks

Science.gov (United States)

Ouyang, Chao; Chen, Zhong; Zhang, Feng; Zhang, Yifei

2018-03-01

Airplane detection in remote sensing images remains a challenging problem and has also been taking a great interest to researchers. In this paper we propose an effective method to detect airplanes in remote sensing images using convolutional neural networks. Deep learning methods show greater advantages than the traditional methods with the rise of deep neural networks in target detection, and we give an explanation why this happens. To improve the performance on detection of airplane, we combine a region proposal algorithm with convolutional neural networks. And in the training phase, we divide the background into multi classes rather than one class, which can reduce false alarms. Our experimental results show that the proposed method is effective and robust in detecting airplane.

Optical storage networking

Science.gov (United States)

Mohr, Ulrich

2001-11-01

For efficient business continuance and backup of mission- critical data an inter-site storage network is required. Where traditional telecommunications costs are prohibitive for all but the largest organizations, there is an opportunity for regional carries to deliver an innovative storage service. This session reveals how a combination of optical networking and protocol-aware SAN gateways can provide an extended storage networking platform with the lowest cost of ownership and the highest possible degree of reliability, security and availability. Companies of every size, with mainframe and open-systems environments, can afford to use this integrated service. Three mayor applications are explained; channel extension, Network Attached Storage (NAS), Storage Area Networks (SAN) and how optical networks address the specific requirements. One advantage of DWDM is the ability for protocols such as ESCON, Fibre Channel, ATM and Gigabit Ethernet, to be transported natively and simultaneously across a single fiber pair, and the ability to multiplex many individual fiber pairs over a single pair, thereby reducing fiber cost and recovering fiber pairs already in use. An optical storage network enables a new class of service providers, Storage Service Providers (SSP) aiming to deliver value to the enterprise by managing storage, backup, replication and restoration as an outsourced service.

77 FR 60680 - Development of the Nationwide Interoperable Public Safety Broadband Network

Science.gov (United States)

2012-10-04

... public comment on the conceptual network architecture presentation made at the FirstNet Board of... business plan considerations. NTIA also seeks comment on the general concept of how to develop applications... network based on a single, nationwide network architecture called for under the Middle Class Tax Relief...

Arrival first queueing networks with applications in kanban production systems

NARCIS (Netherlands)

Boucherie, R.J.; Chao, X.; Miyazawa, M.

2001-01-01

In this paper we introduce a new class of queueing networks called {\\it arrival first networks}. We characterise its transition rates and derive the relationship between arrival rules, linear partial balance equations, and product form stationary distributions. This model is motivated by production

Arrival first queueing networks with applications in kanban production systems

NARCIS (Netherlands)

Boucherie, Richardus J.; Chao, X.; Miyazawa, M.

2003-01-01

In this paper, we introduce a new class of queueing networks called arrival first networks. We characterise its transition rates and derive the relationship between arrival rules, linear partial balance equations, and product form stationary distributions. This model is motivated by production

Domain wall networks on solitons

International Nuclear Information System (INIS)

Sutcliffe, Paul

2003-01-01

Domain wall networks on the surface of a soliton are studied in a simple theory. It consists of two complex scalar fields, in 3+1 dimensions, with a global U(1)xZ n symmetry, where n>2. Solutions are computed numerically in which one of the fields forms a Q ball and the other field forms a network of domain walls localized on the surface of the Q ball. Examples are presented in which the domain walls lie along the edges of a spherical polyhedron, forming junctions at its vertices. It is explained why only a small restricted class of polyhedra can arise as domain wall networks

Turbofan engine diagnostics neuron network size optimization method which takes into account overlaerning effect

Directory of Open Access Journals (Sweden)

О.С. Якушенко

2010-01-01

Full Text Available  The article is devoted to the problem of gas turbine engine (GTE technical state class automatic recognition with operation parameters by neuron networks. The one of main problems for creation the neuron networks is determination of their optimal structures size (amount of layers in network and count of neurons in each layer.The method of neuron network size optimization intended for classification of GTE technical state is considered in the article. Optimization is cared out with taking into account of overlearning effect possibility when a learning network loses property of generalization and begins strictly describing educational data set. To determinate a moment when overlearning effect is appeared in learning neuron network the method  of three data sets is used. The method is based on the comparison of recognition quality parameters changes which were calculated during recognition of educational and control data sets. As the moment when network overlearning effect is appeared the moment when control data set recognition quality begins deteriorating but educational data set recognition quality continues still improving is used. To determinate this moment learning process periodically is terminated and simulation of network with education and control data sets is fulfilled. The optimization of two-, three- and four-layer networks is conducted and some results of optimization are shown. Also the extended educational set is created and shown. The set describes 16 GTE technical state classes and each class is represented with 200 points (200 possible technical state class realizations instead of 20 points using in the former articles. It was done to increase representativeness of data set.In the article the algorithm of optimization is considered and some results which were obtained with it are shown. The results of experiments were analyzed to determinate most optimal neuron network structure. This structure provides most high-quality GTE

Attacks on public telephone networks: technologies and challenges

Science.gov (United States)

Kosloff, T.; Moore, Tyler; Keller, J.; Manes, Gavin W.; Shenoi, Sujeet

2003-09-01

Signaling System 7 (SS7) is vital to signaling and control in America's public telephone networks. This paper describes a class of attacks on SS7 networks involving the insertion of malicious signaling messages via compromised SS7 network components. Three attacks are discussed in detail: IAM flood attacks, redirection attacks and point code spoofing attacks. Depending on their scale of execution, these attacks can produce effects ranging from network congestion to service disruption. Methods for detecting these denial-of-service attacks and mitigating their effects are also presented.

Combining neural networks for protein secondary structure prediction

DEFF Research Database (Denmark)

Riis, Søren Kamaric

1995-01-01

In this paper structured neural networks are applied to the problem of predicting the secondary structure of proteins. A hierarchical approach is used where specialized neural networks are designed for each structural class and then combined using another neural network. The submodels are designed...... by using a priori knowledge of the mapping between protein building blocks and the secondary structure and by using weight sharing. Since none of the individual networks have more than 600 adjustable weights over-fitting is avoided. When ensembles of specialized experts are combined the performance...

THESEUS: A wavelength division multiplexed/microwave subcarrier multiplexed optical network, its ATM switch applications and device requirements

Science.gov (United States)

Xin, Wei

1997-10-01

A Terabit Hybrid Electro-optical /underline[Se]lf- routing Ultrafast Switch (THESEUS) has been proposed. It is a self-routing wavelength division multiplexed (WDM) / microwave subcarrier multiplexed (SCM) asynchronous transfer mode (ATM) switch for the multirate ATM networks. It has potential to be extended to a large ATM switch as 1000 x 1000 without internal blocking. Among the advantages of the hybrid implementation are flexibility in service upgrade, relaxed tolerances on optical filtering, protocol simplification and less processing overhead. For a small ATM switch, the subcarrier can be used as output buffers to solve output contention. A mathematical analysis was conducted to evaluate different buffer configurations. A testbed has been successfully constructed. Multirate binary data streams have been switched through the testbed and error free reception ([<]10-9 bit error rate) has been achieved. A simple, intuitive theoretical model has been developed to describe the heterodyne optical beat interference. A new concept of interference time and interference length has been introduced. An experimental confirmation has been conducted. The experimental results match the model very well. It shows that a large portion of optical bandwidth is wasted due to the beat interference. Based on the model, several improvement approaches have been proposed. The photo-generated carrier lifetime of silicon germanium has been measured using time-resolved reflectivity measurement. Via oxygen ion implantation, the carrier lifetime has been reduced to as short as 1 ps, corresponding to 1 THz of photodetector bandwidth. It has also been shown that copper dopants act as recombination centers in the silicon germanium.

Dependent Classes

DEFF Research Database (Denmark)

Gasiunas, Vaidas; Mezini, Mira; Ostermann, Klaus

2007-01-01

of dependent classes and a machine-checked type soundness proof in Isabelle/HOL [29], the first of this kind for a language with virtual classes and path-dependent types. [29] T.Nipkow, L.C. Poulson, and M. Wenzel. Isabelle/HOL -- A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS, Springer, 2002......Virtual classes allow nested classes to be refined in subclasses. In this way nested classes can be seen as dependent abstractions of the objects of the enclosing classes. Expressing dependency via nesting, however, has two limitations: Abstractions that depend on more than one object cannot...... be modeled and a class must know all classes that depend on its objects. This paper presents dependent classes, a generalization of virtual classes that expresses similar semantics by parameterization rather than by nesting. This increases expressivity of class variations as well as the flexibility...

Conversational Networking: Why the Teacher Gets Most of the Lines.

Science.gov (United States)

Thompson, Diane P.

1988-01-01

Describes the use of the English Natural Form Instruction (ENFI) computer conferencing system to teach language skills in college writing classes at Northern Virginia Community College. Highlights include local area networks; discourse processing; interactive writing; the teacher's role; textual analysis of writing by two classes; and other…

Structural factoring approach for analyzing stochastic networks

Science.gov (United States)

Hayhurst, Kelly J.; Shier, Douglas R.

1991-01-01

The problem of finding the distribution of the shortest path length through a stochastic network is investigated. A general algorithm for determining the exact distribution of the shortest path length is developed based on the concept of conditional factoring, in which a directed, stochastic network is decomposed into an equivalent set of smaller, generally less complex subnetworks. Several network constructs are identified and exploited to reduce significantly the computational effort required to solve a network problem relative to complete enumeration. This algorithm can be applied to two important classes of stochastic path problems: determining the critical path distribution for acyclic networks and the exact two-terminal reliability for probabilistic networks. Computational experience with the algorithm was encouraging and allowed the exact solution of networks that have been previously analyzed only by approximation techniques.

Standard representation and unified stability analysis for dynamic artificial neural network models.

Science.gov (United States)

Kim, Kwang-Ki K; Patrón, Ernesto Ríos; Braatz, Richard D

2018-02-01

An overview is provided of dynamic artificial neural network models (DANNs) for nonlinear dynamical system identification and control problems, and convex stability conditions are proposed that are less conservative than past results. The three most popular classes of dynamic artificial neural network models are described, with their mathematical representations and architectures followed by transformations based on their block diagrams that are convenient for stability and performance analyses. Classes of nonlinear dynamical systems that are universally approximated by such models are characterized, which include rigorous upper bounds on the approximation errors. A unified framework and linear matrix inequality-based stability conditions are described for different classes of dynamic artificial neural network models that take additional information into account such as local slope restrictions and whether the nonlinearities within the DANNs are odd. A theoretical example shows reduced conservatism obtained by the conditions. Copyright © 2017. Published by Elsevier Ltd.

NeuroCharter: A Neural Networks Software to Visually Discover the Effects and Contributions between Interrelated Features

Directory of Open Access Journals (Sweden)

Mohammad N. Elnesr

2017-09-01

Full Text Available NeuroCharter is an open-source software that helps in prediction problems in scientific research through artificial neural networks. The program is designed mainly for researchers who focus on details of the neural-network’s parameters, in addition to easy reuse of the trained network. The program outputs almost all the necessary graphs regarding the network and features contributions and relative outputs for both numeric and categorical features. The program was implemented in Python 2.7.11 and is open sourced for reuse and future development. The program consists of four main classes, one for the neural networks calculation, one for data manipulation, one for plotting the neural network, and the main class that manages and links the other classes. The source code and some experimental data are freely available at the GitHub code repository http://j.mp/NeuroCharter.   Funding Statement: The project was financially supported by King Saud University, Vice Deanship of Research Chairs.

Managing Network Partitions in Structured P2P Networks

Science.gov (United States)

Shafaat, Tallat M.; Ghodsi, Ali; Haridi, Seif

Structured overlay networks form a major class of peer-to-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-scale distributed system is destined to face network partitions. Consequently, the problem of network partitions and mergers is highly related to fault-tolerance and self-management in large-scale systems. This makes it a crucial requirement for building any structured peer-to-peer systems to be resilient to network partitions. Although the problem of network partitions and mergers is highly related to fault-tolerance and self-management in large-scale systems, it has hardly been studied in the context of structured peer-to-peer systems. Structured overlays have mainly been studied under churn (frequent joins/failures), which as a side effect solves the problem of network partitions, as it is similar to massive node failures. Yet, the crucial aspect of network mergers has been ignored. In fact, it has been claimed that ring-based structured overlay networks, which constitute the majority of the structured overlays, are intrinsically ill-suited for merging rings. In this chapter, we motivate the problem of network partitions and mergers in structured overlays. We discuss how a structured overlay can automatically detect a network partition and merger. We present an algorithm for merging multiple similar ring-based overlays when the underlying network merges. We examine the solution in dynamic conditions, showing how our solution is resilient to churn during the merger, something widely believed to be difficult or impossible. We evaluate the algorithm for various scenarios and show that even when falsely detecting a merger, the algorithm quickly terminates and does not clutter the network with many messages. The algorithm is flexible as the tradeoff between message complexity and time complexity can be adjusted by a parameter.

From biological and social network metaphors to coupled bio-social wireless networks

Science.gov (United States)

Barrett, Christopher L.; Eubank, Stephen; Anil Kumar, V.S.; Marathe, Madhav V.

2010-01-01

Biological and social analogies have been long applied to complex systems. Inspiration has been drawn from biological solutions to solve problems in engineering products and systems, ranging from Velcro to camouflage to robotics to adaptive and learning computing methods. In this paper, we present an overview of recent advances in understanding biological systems as networks and use this understanding to design and analyse wireless communication networks. We expand on two applications, namely cognitive sensing and control and wireless epidemiology. We discuss how our work in these two applications is motivated by biological metaphors. We believe that recent advances in computing and communications coupled with advances in health and social sciences raise the possibility of studying coupled bio-social communication networks. We argue that we can better utilise the advances in our understanding of one class of networks to better our understanding of the other. PMID:21643462

Anomaly detection for medical images based on a one-class classification

Science.gov (United States)

Wei, Qi; Ren, Yinhao; Hou, Rui; Shi, Bibo; Lo, Joseph Y.; Carin, Lawrence

2018-02-01

Detecting an anomaly such as a malignant tumor or a nodule from medical images including mammogram, CT or PET images is still an ongoing research problem drawing a lot of attention with applications in medical diagnosis. A conventional way to address this is to learn a discriminative model using training datasets of negative and positive samples. The learned model can be used to classify a testing sample into a positive or negative class. However, in medical applications, the high unbalance between negative and positive samples poses a difficulty for learning algorithms, as they will be biased towards the majority group, i.e., the negative one. To address this imbalanced data issue as well as leverage the huge amount of negative samples, i.e., normal medical images, we propose to learn an unsupervised model to characterize the negative class. To make the learned model more flexible and extendable for medical images of different scales, we have designed an autoencoder based on a deep neural network to characterize the negative patches decomposed from large medical images. A testing image is decomposed into patches and then fed into the learned autoencoder to reconstruct these patches themselves. The reconstruction error of one patch is used to classify this patch into a binary class, i.e., a positive or a negative one, leading to a one-class classifier. The positive patches highlight the suspicious areas containing anomalies in a large medical image. The proposed method has been tested on InBreast dataset and achieves an AUC of 0.84. The main contribution of our work can be summarized as follows. 1) The proposed one-class learning requires only data from one class, i.e., the negative data; 2) The patch-based learning makes the proposed method scalable to images of different sizes and helps avoid the large scale problem for medical images; 3) The training of the proposed deep convolutional neural network (DCNN) based auto-encoder is fast and stable.

Sport, how people choose it: A network analysis approach.

Science.gov (United States)

Ferreri, Luca; Ivaldi, Marco; Daolio, Fabio; Giacobini, Mario; Rainoldi, Alberto; Tomassini, Marco

2015-01-01

In order to investigate the behaviour of athletes in choosing sports, we analyse data from part of the We-Sport database, a vertical social network that links athletes through sports. In particular, we explore connections between people sharing common sports and the role of age and gender by applying "network science" approaches and methods. The results show a disassortative tendency of athletes in choosing sports, a negative correlation between age and number of chosen sports and a positive correlation between age of connected athletes. Some interesting patterns of connection between age classes are depicted. In addition, we propose a method to classify sports, based on the analyses of the behaviour of people practising them. Thanks to this brand new classifications, we highlight the links of class of sports and their unexpected features. We emphasise some gender dependency affinity in choosing sport classes.

Neuromorphic photonic networks using silicon photonic weight banks.

Science.gov (United States)

Tait, Alexander N; de Lima, Thomas Ferreira; Zhou, Ellen; Wu, Allie X; Nahmias, Mitchell A; Shastri, Bhavin J; Prucnal, Paul R

2017-08-07

Photonic systems for high-performance information processing have attracted renewed interest. Neuromorphic silicon photonics has the potential to integrate processing functions that vastly exceed the capabilities of electronics. We report first observations of a recurrent silicon photonic neural network, in which connections are configured by microring weight banks. A mathematical isomorphism between the silicon photonic circuit and a continuous neural network model is demonstrated through dynamical bifurcation analysis. Exploiting this isomorphism, a simulated 24-node silicon photonic neural network is programmed using "neural compiler" to solve a differential system emulation task. A 294-fold acceleration against a conventional benchmark is predicted. We also propose and derive power consumption analysis for modulator-class neurons that, as opposed to laser-class neurons, are compatible with silicon photonic platforms. At increased scale, Neuromorphic silicon photonics could access new regimes of ultrafast information processing for radio, control, and scientific computing.

"When You See a Normal Person …": Social Class and Friendship Networks among Teenage Students

Science.gov (United States)

Papapolydorou, Maria

2014-01-01

This paper draws on social capital theory to discuss the way social class plays out in the friendships of teenage students. Based on data from individual interviews and focus groups with 75 students in four London secondary schools, it is suggested that students tend to form friendships with people who belong to the same social-class background as…

75 FR 73861 - Change in Rates and Classes of General Applicability for Competitive Products

Science.gov (United States)

2010-11-29

... percent for parcels picked up at a return Network Distribution Center (RNDC) and 8.0 percent for parcels... Part III Postal Service Change in Rates and Classes of General Applicability for Competitive...; [[Page 73862

SOCIAL NETWORKING IN PHYSICAL EDUCATION: Undergraduate Students’ Views on Ning

Directory of Open Access Journals (Sweden)

Gülfem SEZEN BALCIKANLI

2012-04-01

Full Text Available It was the aim of this study to investigate physical education undergraduate students’ views on the use of social networking, one of the most typical representations of Web 2.0 technologies. In order to do so, the researcher, who was the instructor of the class, entitled “Fair Play Education in Sport”, introduced Ning and its educational aspects to her students with a 50-minute presentation prior to the study. Following this, the students were encouraged to use this networking for 15 weeks in parallel with their class. During this application, the researcher helped the students to make the best use of Ning in educational settings. Upon the implementation, the researcher interviewed the students (n=19 in five groups on the basis of the questions prepared and piloted earlier. The interviews demonstrated that the students enjoyed using social networking in educational settings. The findings of the study were the following: Increasing student-student and teacher-student interaction, enhancing student motivation and classroom climate, sharing materials with the instructor and students, making use of students’ interests and needs, and making learning process more interesting and permanent. The research concluded that social networking could be used in PE classes effectively.

A unified view on weakly correlated recurrent networks

Directory of Open Access Journals (Sweden)

Dmytro eGrytskyy

2013-10-01

Full Text Available The diversity of neuron models used in contemporary theoretical neuroscience to investigate specific properties of covariances in the spiking activity raises the question how these models relate to each other. In particular it is hard to distinguish between generic properties of covariances and peculiarities due to the abstracted model. Here we present a unified view on pairwise covariances in recurrent networks in the irregular regime. We consider the binary neuron model, the leaky integrate-and-fire model, and the Hawkes process. We show that linear approximation maps each of these models to either of two classes of linear rate models, including the Ornstein-Uhlenbeck process as a special case. The distinction between both classes is the location of additive noise in the rate dynamics, which is located on the output side for spiking models and on the input side for the binary model. Both classes allow closed form solutions for the covariance. For output noise it separates into an echo term and a term due to correlated input. The unified framework enables us to transfer results between models. For example, we generalize the binary model and the Hawkes process to the situation with synaptic conduction delays and simplify derivations for established results. Our approach is applicable to general network structures and suitable for the calculation of population averages. The derived averages are exact for fixed out-degree network architectures and approximate for fixed in-degree. We demonstrate how taking into account fluctuations in the linearization procedure increases the accuracy of the effective theory and we explain the class dependent differences between covariances in the time and the frequency domain. Finally we show that the oscillatory instability emerging in networks of integrate-and-fire models with delayed inhibitory feedback is a model-invariant feature: the same structure of poles in the complex frequency plane determines the

The Laplacian spectrum of neural networks

Science.gov (United States)

de Lange, Siemon C.; de Reus, Marcel A.; van den Heuvel, Martijn P.

2014-01-01

The brain is a complex network of neural interactions, both at the microscopic and macroscopic level. Graph theory is well suited to examine the global network architecture of these neural networks. Many popular graph metrics, however, encode average properties of individual network elements. Complementing these “conventional” graph metrics, the eigenvalue spectrum of the normalized Laplacian describes a network's structure directly at a systems level, without referring to individual nodes or connections. In this paper, the Laplacian spectra of the macroscopic anatomical neuronal networks of the macaque and cat, and the microscopic network of the Caenorhabditis elegans were examined. Consistent with conventional graph metrics, analysis of the Laplacian spectra revealed an integrative community structure in neural brain networks. Extending previous findings of overlap of network attributes across species, similarity of the Laplacian spectra across the cat, macaque and C. elegans neural networks suggests a certain level of consistency in the overall architecture of the anatomical neural networks of these species. Our results further suggest a specific network class for neural networks, distinct from conceptual small-world and scale-free models as well as several empirical networks. PMID:24454286

Networks of Cells and Petri Nets

OpenAIRE

Bernardini, Francesco; Gheorgue, Marian; Margenstern, Maurice; Verlan, Sergey

2007-01-01

We introduce a new class of P systems, called networks of cells, with rules allowing several cells to simultaneously interact with each other in order to produce some new objects inside some other output cells. We define different types of behavior for networks of cells by considering alternative strategies for the application of the rules: sequential application, free parallelism, maximal parallelism, locally-maximal parallelism and minimal parallelism. We devise a way for tra...

Optical protocols for advanced spacecraft networks

Science.gov (United States)

Bergman, Larry A.

1991-01-01

Most present day fiber optic networks are in fact extensions of copper wire networks. As a result, their speed is still limited by electronics even though optics is capable of running three orders of magnitude faster. Also, the fact that photons do not interact with one another (as electrons do) provides optical communication systems with some unique properties or new functionality that is not readily taken advantage of with conventional approaches. Some of the motivation for implementing network protocols in the optical domain, a few possible approaches including optical code-division multiple-access (CDMA), and how this class of networks can extend the technology life cycle of the Space Station Freedom (SSF) with increased performance and functionality are described.

Optical protocols for advanced spacecraft networks

Science.gov (United States)

Bergman, Larry A.

1991-09-01

Most present day fiber optic networks are in fact extensions of copper wire networks. As a result, their speed is still limited by electronics even though optics is capable of running three orders of magnitude faster. Also, the fact that photons do not interact with one another (as electrons do) provides optical communication systems with some unique properties or new functionality that is not readily taken advantage of with conventional approaches. Some of the motivation for implementing network protocols in the optical domain, a few possible approaches including optical code-division multiple-access (CDMA), and how this class of networks can extend the technology life cycle of the Space Station Freedom (SSF) with increased performance and functionality are described.

A non-penalty recurrent neural network for solving a class of constrained optimization problems.

Science.gov (United States)

Hosseini, Alireza

2016-01-01

In this paper, we explain a methodology to analyze convergence of some differential inclusion-based neural networks for solving nonsmooth optimization problems. For a general differential inclusion, we show that if its right hand-side set valued map satisfies some conditions, then solution trajectory of the differential inclusion converges to optimal solution set of its corresponding in optimization problem. Based on the obtained methodology, we introduce a new recurrent neural network for solving nonsmooth optimization problems. Objective function does not need to be convex on R(n) nor does the new neural network model require any penalty parameter. We compare our new method with some penalty-based and non-penalty based models. Moreover for differentiable cases, we implement circuit diagram of the new neural network. Copyright © 2015 Elsevier Ltd. All rights reserved.

Evolution of Cooperation in Social Dilemmas on Complex Networks

Science.gov (United States)

Iyer, Swami; Killingback, Timothy

2016-01-01

Cooperation in social dilemmas is essential for the functioning of systems at multiple levels of complexity, from the simplest biological organisms to the most sophisticated human societies. Cooperation, although widespread, is fundamentally challenging to explain evolutionarily, since natural selection typically favors selfish behavior which is not socially optimal. Here we study the evolution of cooperation in three exemplars of key social dilemmas, representing the prisoner’s dilemma, hawk-dove and coordination classes of games, in structured populations defined by complex networks. Using individual-based simulations of the games on model and empirical networks, we give a detailed comparative study of the effects of the structural properties of a network, such as its average degree, variance in degree distribution, clustering coefficient, and assortativity coefficient, on the promotion of cooperative behavior in all three classes of games. PMID:26928428

Neural network for nonsmooth pseudoconvex optimization with general convex constraints.

Science.gov (United States)

Bian, Wei; Ma, Litao; Qin, Sitian; Xue, Xiaoping

2018-05-01

In this paper, a one-layer recurrent neural network is proposed for solving a class of nonsmooth, pseudoconvex optimization problems with general convex constraints. Based on the smoothing method, we construct a new regularization function, which does not depend on any information of the feasible region. Thanks to the special structure of the regularization function, we prove the global existence, uniqueness and "slow solution" character of the state of the proposed neural network. Moreover, the state solution of the proposed network is proved to be convergent to the feasible region in finite time and to the optimal solution set of the related optimization problem subsequently. In particular, the convergence of the state to an exact optimal solution is also considered in this paper. Numerical examples with simulation results are given to show the efficiency and good characteristics of the proposed network. In addition, some preliminary theoretical analysis and application of the proposed network for a wider class of dynamic portfolio optimization are included. Copyright © 2018 Elsevier Ltd. All rights reserved.

Detection and Mapping of Land Use and Land Cover Classes of a ...

African Journals Online (AJOL)

FIRST LADY

Cover Classes of a Developing City in Southeastern. Region of Nigeria .... The emergence of small and medium sized agro-husbandry industries in the peripheral, semi- ..... lack of spatial specialization a hindrance to integrated land management and development .... Journal of Applied Sciences Asian Network for Scientific ...

Global stability of discrete-time recurrent neural networks with impulse effects

International Nuclear Information System (INIS)

Zhou, L; Li, C; Wan, J

2008-01-01

This paper formulates and studies a class of discrete-time recurrent neural networks with impulse effects. A stability criterion, which characterizes the effects of impulse and stability property of the corresponding impulse-free networks on the stability of the impulsive networks in an aggregate form, is established. Two simplified and numerically tractable criteria are also provided

Convolutional Neural Network for Histopathological Analysis of Osteosarcoma.

Science.gov (United States)

Mishra, Rashika; Daescu, Ovidiu; Leavey, Patrick; Rakheja, Dinesh; Sengupta, Anita

2018-03-01

Pathologists often deal with high complexity and sometimes disagreement over osteosarcoma tumor classification due to cellular heterogeneity in the dataset. Segmentation and classification of histology tissue in H&E stained tumor image datasets is a challenging task because of intra-class variations, inter-class similarity, crowded context, and noisy data. In recent years, deep learning approaches have led to encouraging results in breast cancer and prostate cancer analysis. In this article, we propose convolutional neural network (CNN) as a tool to improve efficiency and accuracy of osteosarcoma tumor classification into tumor classes (viable tumor, necrosis) versus nontumor. The proposed CNN architecture contains eight learned layers: three sets of stacked two convolutional layers interspersed with max pooling layers for feature extraction and two fully connected layers with data augmentation strategies to boost performance. The use of a neural network results in higher accuracy of average 92% for the classification. We compare the proposed architecture with three existing and proven CNN architectures for image classification: AlexNet, LeNet, and VGGNet. We also provide a pipeline to calculate percentage necrosis in a given whole slide image. We conclude that the use of neural networks can assure both high accuracy and efficiency in osteosarcoma classification.

Providing QoS guarantee in 3G wireless networks

Science.gov (United States)

Chuah, MooiChoo; Huang, Min; Kumar, Suresh

2001-07-01

The third generation networks and services present opportunities to offer multimedia applications and services that meet end-to-end quality of service requirements. In this article, we present UMTS QoS architecture and its requirements. This includes the definition of QoS parameters, traffic classes, the end-to-end data delivery model, and the mapping of end-to-end services to the services provided by the network elements of the UMTS. End-to-end QoS of a user flow is achieved by the combination of the QoS control over UMTS Domain and the IP core Network. In the Third Generation Wireless network, UMTS bearer service manager is responsible to manage radio and transport resources to QoS-enabled applications. The UMTS bearer service consists of the Radio Access Bearer Service between Mobile Terminal and SGSN and Core Network bearer service between SGSN and GGSN. The Radio Access Bearer Service is further realized by the Radio Bearer Service (mostly air interface) and Iu bearer service. For the 3G air interface, one can provide differentiated QoS via intelligent burst allocation scheme, adaptive spreading factor control and weighted fair queueing scheduling algorithms. Next, we discuss the requirements for the transport technologies in the radio access network to provide differentiated QoS to multiple classes of traffic. We discuss both ATM based and IP based transport solutions. Last but not least, we discuss how QoS mechanism is provided in the core network to ensure e2e quality of service requirements. We discuss how mobile terminals that use RSVP as QoS signaling mechanisms can be are supported in the 3G network which may implement only IETF diffserv mechanism. . We discuss how one can map UMTS QoS classes with IETF diffserv code points. We also discuss 2G/3G handover scenarios and how the 2G/3G QoS parameters can be mapped.

Anti-synchronization control of BAM memristive neural networks with multiple proportional delays and stochastic perturbations

Science.gov (United States)

Wang, Weiping; Yuan, Manman; Luo, Xiong; Liu, Linlin; Zhang, Yao

2018-01-01

Proportional delay is a class of unbounded time-varying delay. A class of bidirectional associative memory (BAM) memristive neural networks with multiple proportional delays is concerned in this paper. First, we propose the model of BAM memristive neural networks with multiple proportional delays and stochastic perturbations. Furthermore, by choosing suitable nonlinear variable transformations, the BAM memristive neural networks with multiple proportional delays can be transformed into the BAM memristive neural networks with constant delays. Based on the drive-response system concept, differential inclusions theory and Lyapunov stability theory, some anti-synchronization criteria are obtained. Finally, the effectiveness of proposed criteria are demonstrated through numerical examples.

Content-Based Multi-Channel Network Coding Algorithm in the Millimeter-Wave Sensor Network

Directory of Open Access Journals (Sweden)

Kai Lin

2016-07-01

Full Text Available With the development of wireless technology, the widespread use of 5G is already an irreversible trend, and millimeter-wave sensor networks are becoming more and more common. However, due to the high degree of complexity and bandwidth bottlenecks, the millimeter-wave sensor network still faces numerous problems. In this paper, we propose a novel content-based multi-channel network coding algorithm, which uses the functions of data fusion, multi-channel and network coding to improve the data transmission; the algorithm is referred to as content-based multi-channel network coding (CMNC. The CMNC algorithm provides a fusion-driven model based on the Dempster-Shafer (D-S evidence theory to classify the sensor nodes into different classes according to the data content. By using the result of the classification, the CMNC algorithm also provides the channel assignment strategy and uses network coding to further improve the quality of data transmission in the millimeter-wave sensor network. Extensive simulations are carried out and compared to other methods. Our simulation results show that the proposed CMNC algorithm can effectively improve the quality of data transmission and has better performance than the compared methods.

Global dissipativity of continuous-time recurrent neural networks with time delay

International Nuclear Information System (INIS)

Liao Xiaoxin; Wang Jun

2003-01-01

This paper addresses the global dissipativity of a general class of continuous-time recurrent neural networks. First, the concepts of global dissipation and global exponential dissipation are defined and elaborated. Next, the sets of global dissipativity and global exponentially dissipativity are characterized using the parameters of recurrent neural network models. In particular, it is shown that the Hopfield network and cellular neural networks with or without time delays are dissipative systems

Social networks: Evolving graphs with memory dependent edges

Science.gov (United States)

Grindrod, Peter; Parsons, Mark

2011-10-01

The plethora of digital communication technologies, and their mass take up, has resulted in a wealth of interest in social network data collection and analysis in recent years. Within many such networks the interactions are transient: thus those networks evolve over time. In this paper we introduce a class of models for such networks using evolving graphs with memory dependent edges, which may appear and disappear according to their recent history. We consider time discrete and time continuous variants of the model. We consider the long term asymptotic behaviour as a function of parameters controlling the memory dependence. In particular we show that such networks may continue evolving forever, or else may quench and become static (containing immortal and/or extinct edges). This depends on the existence or otherwise of certain infinite products and series involving age dependent model parameters. We show how to differentiate between the alternatives based on a finite set of observations. To test these ideas we show how model parameters may be calibrated based on limited samples of time dependent data, and we apply these concepts to three real networks: summary data on mobile phone use from a developing region; online social-business network data from China; and disaggregated mobile phone communications data from a reality mining experiment in the US. In each case we show that there is evidence for memory dependent dynamics, such as that embodied within the class of models proposed here.

Network-based analysis of software change propagation.

Science.gov (United States)

Wang, Rongcun; Huang, Rubing; Qu, Binbin

2014-01-01

The object-oriented software systems frequently evolve to meet new change requirements. Understanding the characteristics of changes aids testers and system designers to improve the quality of softwares. Identifying important modules becomes a key issue in the process of evolution. In this context, a novel network-based approach is proposed to comprehensively investigate change distributions and the correlation between centrality measures and the scope of change propagation. First, software dependency networks are constructed at class level. And then, the number of times of cochanges among classes is minded from software repositories. According to the dependency relationships and the number of times of cochanges among classes, the scope of change propagation is calculated. Using Spearman rank correlation analyzes the correlation between centrality measures and the scope of change propagation. Three case studies on java open source software projects Findbugs, Hibernate, and Spring are conducted to research the characteristics of change propagation. Experimental results show that (i) change distribution is very uneven; (ii) PageRank, Degree, and CIRank are significantly correlated to the scope of change propagation. Particularly, CIRank shows higher correlation coefficient, which suggests it can be a more useful indicator for measuring the scope of change propagation of classes in object-oriented software system.

Network approaches for expert decisions in sports.

Science.gov (United States)

Glöckner, Andreas; Heinen, Thomas; Johnson, Joseph G; Raab, Markus

2012-04-01

This paper focuses on a model comparison to explain choices based on gaze behavior via simulation procedures. We tested two classes of models, a parallel constraint satisfaction (PCS) artificial neuronal network model and an accumulator model in a handball decision-making task from a lab experiment. Both models predict action in an option-generation task in which options can be chosen from the perspective of a playmaker in handball (i.e., passing to another player or shooting at the goal). Model simulations are based on a dataset of generated options together with gaze behavior measurements from 74 expert handball players for 22 pieces of video footage. We implemented both classes of models as deterministic vs. probabilistic models including and excluding fitted parameters. Results indicated that both classes of models can fit and predict participants' initially generated options based on gaze behavior data, and that overall, the classes of models performed about equally well. Early fixations were thereby particularly predictive for choices. We conclude that the analyses of complex environments via network approaches can be successfully applied to the field of experts' decision making in sports and provide perspectives for further theoretical developments. Copyright © 2011 Elsevier B.V. All rights reserved.

Spatial prisoner's dilemma optimally played in small-world networks

International Nuclear Information System (INIS)

Masuda, Naoki; Aihara, Kazuyuki

2003-01-01

Cooperation is commonly found in ecological and social systems even when it apparently seems that individuals can benefit from selfish behavior. We investigate how cooperation emerges with the spatial prisoner's dilemma played in a class of networks ranging from regular lattices to random networks. We find that, among these networks, small-world topology is the optimal structure when we take into account the speed at which cooperative behavior propagates. Our results may explain why the small-world properties are self-organized in real networks

Optical fibers with low nonlinearity and low polarization-mode dispersion for terabit communications

Science.gov (United States)

Baghdadi, J. A.; Safaai-Jazi, A.; Hattori, H. T.

2001-07-01

Refractive-index nonlinearities have negligible effect on the performance of short-haul fiber-optic communication links utilizing electronic repeaters. However, in long links, nonlinearities can cause severe signal degradations. To mitigate nonlinear effects, a new generation of fibers, referred to as large effective-area fibers, have been introduced in recent years. This paper reviews the latest research and development work on these fibers conducted by several research groups around the world. Attention is focused on a class of large effective-area fibers that are based on a depressed-core multiple-cladding design. Another important issue in long-haul and high capacity fiber optic systems is the polarization-mode dispersion (PMD) which has been recognized as a serious limiting factor. In this paper, an improved fiber design is proposed which, in addition to providing large effective-area and low bending loss, eliminates PMD due to elliptical deformation in the single-mode wavelength region. Furthermore, this design is allowed to provide a small chromatic dispersion about few ps/ nm km , in order to overcome four-wave mixing effects.

Object recognition with hierarchical discriminant saliency networks.

Science.gov (United States)

Han, Sunhyoung; Vasconcelos, Nuno

2014-01-01

The benefits of integrating attention and object recognition are investigated. While attention is frequently modeled as a pre-processor for recognition, we investigate the hypothesis that attention is an intrinsic component of recognition and vice-versa. This hypothesis is tested with a recognition model, the hierarchical discriminant saliency network (HDSN), whose layers are top-down saliency detectors, tuned for a visual class according to the principles of discriminant saliency. As a model of neural computation, the HDSN has two possible implementations. In a biologically plausible implementation, all layers comply with the standard neurophysiological model of visual cortex, with sub-layers of simple and complex units that implement a combination of filtering, divisive normalization, pooling, and non-linearities. In a convolutional neural network implementation, all layers are convolutional and implement a combination of filtering, rectification, and pooling. The rectification is performed with a parametric extension of the now popular rectified linear units (ReLUs), whose parameters can be tuned for the detection of target object classes. This enables a number of functional enhancements over neural network models that lack a connection to saliency, including optimal feature denoising mechanisms for recognition, modulation of saliency responses by the discriminant power of the underlying features, and the ability to detect both feature presence and absence. In either implementation, each layer has a precise statistical interpretation, and all parameters are tuned by statistical learning. Each saliency detection layer learns more discriminant saliency templates than its predecessors and higher layers have larger pooling fields. This enables the HDSN to simultaneously achieve high selectivity to target object classes and invariance. The performance of the network in saliency and object recognition tasks is compared to those of models from the biological and

Statistical and machine learning approaches for network analysis

CERN Document Server

Dehmer, Matthias

2012-01-01

Explore the multidisciplinary nature of complex networks through machine learning techniques Statistical and Machine Learning Approaches for Network Analysis provides an accessible framework for structurally analyzing graphs by bringing together known and novel approaches on graph classes and graph measures for classification. By providing different approaches based on experimental data, the book uniquely sets itself apart from the current literature by exploring the application of machine learning techniques to various types of complex networks. Comprised of chapters written by internation

Neural Networks for protein Structure Prediction

DEFF Research Database (Denmark)

Bohr, Henrik

1998-01-01

This is a review about neural network applications in bioinformatics. Especially the applications to protein structure prediction, e.g. prediction of secondary structures, prediction of surface structure, fold class recognition and prediction of the 3-dimensional structure of protein backbones...

Class size versus class composition

DEFF Research Database (Denmark)

Jones, Sam

Raising schooling quality in low-income countries is a pressing challenge. Substantial research has considered the impact of cutting class sizes on skills acquisition. Considerably less attention has been given to the extent to which peer effects, which refer to class composition, also may affect...... bias from omitted variables, the preferred IV results indicate considerable negative effects due to larger class sizes and larger numbers of overage-for-grade peers. The latter, driven by the highly prevalent practices of grade repetition and academic redshirting, should be considered an important...

Robust adaptive fuzzy neural tracking control for a class of unknown ...

Indian Academy of Sciences (India)

In this paper, an adaptive fuzzy neural controller (AFNC) for a class of unknown chaotic systems is proposed. The proposed AFNC is comprised of a fuzzy neural controller and a robust controller. The fuzzy neural controller including a fuzzy neural network identifier (FNNI) is the principal controller. The FNNI is used for ...

Examining the Distribution, Modularity, and Community Structure in Article Networks for Systematic Reviews.

Science.gov (United States)

Ji, Xiaonan; Machiraju, Raghu; Ritter, Alan; Yen, Po-Yin

2015-01-01

Systematic reviews (SRs) provide high quality evidence for clinical practice, but the article screening process is time and labor intensive. As SRs aim to identify relevant articles with a specific scope, we propose that a pre-defined article relationship, using similarity metrics, could accelerate this process. In this study, we established the article relationship using MEDLINE element similarities and visualized the article network with the Force Atlas layout. We also analyzed the article networks with graph diameter, closeness centrality, and module classes. The results revealed the distribution of articles and found that included articles tended to aggregate together in some module classes, providing further evidence of the existence of strong relationships among included articles. This approach can be utilized to facilitate the articles selection process through early identification of these dominant module classes. We are optimistic that the use of article network visualization can help better SR work prioritization.

Social Class Dialogues and the Fostering of Class Consciousness

Science.gov (United States)

Madden, Meredith

2015-01-01

How do critical pedagogies promote undergraduate students' awareness of social class, social class identity, and social class inequalities in education? How do undergraduate students experience class consciousness-raising in the intergroup dialogue classroom? This qualitative study explores undergraduate students' class consciousness-raising in an…

Introduction to Concepts in Artificial Neural Networks

Science.gov (United States)

Niebur, Dagmar

1995-01-01

This introduction to artificial neural networks summarizes some basic concepts of computational neuroscience and the resulting models of artificial neurons. The terminology of biological and artificial neurons, biological and machine learning and neural processing is introduced. The concepts of supervised and unsupervised learning are explained with examples from the power system area. Finally, a taxonomy of different types of neurons and different classes of artificial neural networks is presented.

Betweenness in time dependent networks

International Nuclear Information System (INIS)

Alsayed, Ahmad; Higham, Desmond J.

2015-01-01

The concept of betweenness has given rise to a very useful class of network centrality measures. Loosely, betweenness quantifies the level of importance of a node in terms of its propensity to act as an intermediary when messages are passed around the network. In this work we generalize a walk-based betweenness measure to the case of time-dependent networks, such as those arising in telecommunications and on-line social media. We also introduce a new kind of betweenness measure, temporal betweenness, which quantifies the importance of a time-point. We illustrate the effectiveness of these new measures on synthetic examples, and also give results on real data sets involving voice call, email and Twitter

The automated ground network system

Science.gov (United States)

Smith, Miles T.; Militch, Peter N.

1993-01-01

The primary goal of the Automated Ground Network System (AGNS) project is to reduce Ground Network (GN) station life-cycle costs. To accomplish this goal, the AGNS project will employ an object-oriented approach to develop a new infrastructure that will permit continuous application of new technologies and methodologies to the Ground Network's class of problems. The AGNS project is a Total Quality (TQ) project. Through use of an open collaborative development environment, developers and users will have equal input into the end-to-end design and development process. This will permit direct user input and feedback and will enable rapid prototyping for requirements clarification. This paper describes the AGNS objectives, operations concept, and proposed design.

Language Choice & Global Learning Networks

Directory of Open Access Journals (Sweden)

Dennis Sayers

1995-05-01

Full Text Available How can other languages be used in conjunction with English to further intercultural and multilingual learning when teachers and students participate in computer-based global learning networks? Two portraits are presented of multilingual activities in the Orillas and I*EARN learning networks, and are discussed as examples of the principal modalities of communication employed in networking projects between distant classes. Next, an important historical precedent --the social controversy which accompanied the introduction of telephone technology at the end of the last century-- is examined in terms of its implications for language choice in contemporary classroom telecomputing projects. Finally, recommendations are offered to guide decision making concerning the role of language choice in promoting collaborative critical inquiry.

Exponential Synchronization of Uncertain Complex Dynamical Networks with Delay Coupling

International Nuclear Information System (INIS)

Wang Lifu; Kong Zhi; Jing Yuanwei

2010-01-01

This paper studies the global exponential synchronization of uncertain complex delayed dynamical networks. The network model considered is general dynamical delay networks with unknown network structure and unknown coupling functions but bounded. Novel delay-dependent linear controllers are designed via the Lyapunov stability theory. Especially, it is shown that the controlled networks are globally exponentially synchronized with a given convergence rate. An example of typical dynamical network of this class, having the Lorenz system at each node, has been used to demonstrate and verify the novel design proposed. And, the numerical simulation results show the effectiveness of proposed synchronization approaches. (general)

Describing three-class task performance: three-class linear discriminant analysis and three-class ROC analysis

Science.gov (United States)

He, Xin; Frey, Eric C.

2007-03-01

Binary ROC analysis has solid decision-theoretic foundations and a close relationship to linear discriminant analysis (LDA). In particular, for the case of Gaussian equal covariance input data, the area under the ROC curve (AUC) value has a direct relationship to the Hotelling trace. Many attempts have been made to extend binary classification methods to multi-class. For example, Fukunaga extended binary LDA to obtain multi-class LDA, which uses the multi-class Hotelling trace as a figure-of-merit, and we have previously developed a three-class ROC analysis method. This work explores the relationship between conventional multi-class LDA and three-class ROC analysis. First, we developed a linear observer, the three-class Hotelling observer (3-HO). For Gaussian equal covariance data, the 3- HO provides equivalent performance to the three-class ideal observer and, under less strict conditions, maximizes the signal to noise ratio for classification of all pairs of the three classes simultaneously. The 3-HO templates are not the eigenvectors obtained from multi-class LDA. Second, we show that the three-class Hotelling trace, which is the figureof- merit in the conventional three-class extension of LDA, has significant limitations. Third, we demonstrate that, under certain conditions, there is a linear relationship between the eigenvectors obtained from multi-class LDA and 3-HO templates. We conclude that the 3-HO based on decision theory has advantages both in its decision theoretic background and in the usefulness of its figure-of-merit. Additionally, there exists the possibility of interpreting the two linear features extracted by the conventional extension of LDA from a decision theoretic point of view.

Preclusion of switch behavior in reaction networks with mass-action kinetics

DEFF Research Database (Denmark)

Feliu, Elisenda; Wiuf, C.

2012-01-01

We study networks taken with mass-action kinetics and provide a Jacobian criterion that applies to an arbitrary network to preclude the existence of multiple positive steady states within any stoichiometric class for any choice of rate constants. We are concerned with the characterization...... precludes the existence of degenerate steady states. Further, we relate injectivity of a network to that of the network obtained by adding outflow, or degradation, reactions for all species....

Robust network topologies for generating switch-like cellular responses.

Directory of Open Access Journals (Sweden)

Najaf A Shah

2011-06-01

Full Text Available Signaling networks that convert graded stimuli into binary, all-or-none cellular responses are critical in processes ranging from cell-cycle control to lineage commitment. To exhaustively enumerate topologies that exhibit this switch-like behavior, we simulated all possible two- and three-component networks on random parameter sets, and assessed the resulting response profiles for both steepness (ultrasensitivity and extent of memory (bistability. Simulations were used to study purely enzymatic networks, purely transcriptional networks, and hybrid enzymatic/transcriptional networks, and the topologies in each class were rank ordered by parametric robustness (i.e., the percentage of applied parameter sets exhibiting ultrasensitivity or bistability. Results reveal that the distribution of network robustness is highly skewed, with the most robust topologies clustering into a small number of motifs. Hybrid networks are the most robust in generating ultrasensitivity (up to 28% and bistability (up to 18%; strikingly, a purely transcriptional framework is the most fragile in generating either ultrasensitive (up to 3% or bistable (up to 1% responses. The disparity in robustness among the network classes is due in part to zero-order ultrasensitivity, an enzyme-specific phenomenon, which repeatedly emerges as a particularly robust mechanism for generating nonlinearity and can act as a building block for switch-like responses. We also highlight experimentally studied examples of topologies enabling switching behavior, in both native and synthetic systems, that rank highly in our simulations. This unbiased approach for identifying topologies capable of a given response may be useful in discovering new natural motifs and in designing robust synthetic gene networks.

Social affiliation in same-class and cross-class interactions.

Science.gov (United States)

Côté, Stéphane; Kraus, Michael W; Carpenter, Nichelle C; Piff, Paul K; Beermann, Ursula; Keltner, Dacher

2017-02-01

Historically high levels of economic inequality likely have important consequences for relationships between people of the same and different social class backgrounds. Here, we test the prediction that social affiliation among same-class partners is stronger at the extremes of the class spectrum, given that these groups are highly distinctive and most separated from others by institutional and economic forces. An internal meta-analysis of 4 studies (N = 723) provided support for this hypothesis. Participant and partner social class were interactively, rather than additively, associated with social affiliation, indexed by affiliative behaviors and emotions during structured laboratory interactions and in daily life. Further, response surface analyses revealed that paired upper or lower class partners generally affiliated more than average-class pairs. Analyses with separate class indices suggested that these patterns are driven more by parental income and subjective social class than by parental education. The findings illuminate the dynamics of same- and cross-class interactions, revealing that not all same-class interactions feature the same degree of affiliation. They also reveal the importance of studying social class from an intergroup perspective. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

A Review on Sensor Network Issues and Robotics

Directory of Open Access Journals (Sweden)

Ji Hyoung Ryu

2015-01-01

Full Text Available The interaction of distributed robotics and wireless sensor networks has led to the creation of mobile sensor networks. There has been an increasing interest in building mobile sensor networks and they are the favored class of WSNs in which mobility plays a key role in the execution of an application. More and more researches focus on development of mobile wireless sensor networks (MWSNs due to its favorable advantages and applications. In WSNs robotics can play a crucial role, and integrating static nodes with mobile robots enhances the capabilities of both types of devices and enables new applications. In this paper we present an overview on mobile sensor networks in robotics and vice versa and robotic sensor network applications.

Learning Bayesian networks for discrete data

KAUST Repository

Liang, Faming

2009-02-01

Bayesian networks have received much attention in the recent literature. In this article, we propose an approach to learn Bayesian networks using the stochastic approximation Monte Carlo (SAMC) algorithm. Our approach has two nice features. Firstly, it possesses the self-adjusting mechanism and thus avoids essentially the local-trap problem suffered by conventional MCMC simulation-based approaches in learning Bayesian networks. Secondly, it falls into the class of dynamic importance sampling algorithms; the network features can be inferred by dynamically weighted averaging the samples generated in the learning process, and the resulting estimates can have much lower variation than the single model-based estimates. The numerical results indicate that our approach can mix much faster over the space of Bayesian networks than the conventional MCMC simulation-based approaches. © 2008 Elsevier B.V. All rights reserved.

Rational function systems and electrical networks with multiparameters

CERN Document Server

Lu, KaiSheng

2012-01-01

To overcome the problems of system theory and network theory over real field, this book uses matrices over the field F(z) of rational functions in multiparameters describing coefficient matrices of systems and networks and makes systems and network description over F(z) and researches their structural properties: reducible condition of a class of matrices over F(z) and their characteristic polynomial; type1 matrix and two basic properties; variable replacement conditions for independent parameters; structural controllability and observability of linear systems over F(z); separability, reducibi

Named data networking-based smart home

Directory of Open Access Journals (Sweden)

Syed Hassan Ahmed

2016-09-01

Full Text Available Named data networking (NDN treats content/data as a “first class citizen” of the network by giving it a “name”. This content “name” is used to retrieve any information, unlike in device-centric networks (i.e., the current Internet, which depend on physical IP addresses. Meanwhile, the smart home concept has been gaining attention in academia and industries; various low-cost embedded devices are considered that can sense, process, store, and communicate data autonomously. In this paper, we study NDN in the context of smart-home communications, discuss the preliminary evaluations, and describe the future challenges of applying NDN in smart-home applications.

Classification of networks of automata by dynamical mean field theory

International Nuclear Information System (INIS)

Burda, Z.; Jurkiewicz, J.; Flyvbjerg, H.

1990-01-01

Dynamical mean field theory is used to classify the 2 24 =65,536 different networks of binary automata on a square lattice with nearest neighbour interactions. Application of mean field theory gives 700 different mean field classes, which fall in seven classes of different asymptotic dynamics characterized by fixed points and two-cycles. (orig.)

A Java class library for accessing Cadplan data

International Nuclear Information System (INIS)

Zagler, Norbert

2008-01-01

A Java class library was developed to be able to access the data of the treatment planning system Varian Cadplan which was decommissioned in 2005. The library reads and encapsulates the most important patient data. It facilitates creating viewing software for CT slices, contours and isodoses. Keeping alive old Cadplan hardware is no longer necessary. The files can be stored on any server in the network of a department and they can be accessed from any workstation capable of running Java software. (orig.)

Overexpression of the class D MADS-box gene Sl-AGL11 impacts fleshy tissue differentiation and structure in tomato fruits

Science.gov (United States)

MADS-box transcription factors are key elements of the genetic networks controlling flower and fruit development. Among these, the class D clade are involved in seed, ovule, and funiculus development. The tomato genome comprises two class D genes, Sl-AGL11 and Sl-MBP3, both displaying high expressio...

Real-time network traffic classification technique for wireless local area networks based on compressed sensing

Science.gov (United States)

Balouchestani, Mohammadreza

2017-05-01

Network traffic or data traffic in a Wireless Local Area Network (WLAN) is the amount of network packets moving across a wireless network from each wireless node to another wireless node, which provide the load of sampling in a wireless network. WLAN's Network traffic is the main component for network traffic measurement, network traffic control and simulation. Traffic classification technique is an essential tool for improving the Quality of Service (QoS) in different wireless networks in the complex applications such as local area networks, wireless local area networks, wireless personal area networks, wireless metropolitan area networks, and wide area networks. Network traffic classification is also an essential component in the products for QoS control in different wireless network systems and applications. Classifying network traffic in a WLAN allows to see what kinds of traffic we have in each part of the network, organize the various kinds of network traffic in each path into different classes in each path, and generate network traffic matrix in order to Identify and organize network traffic which is an important key for improving the QoS feature. To achieve effective network traffic classification, Real-time Network Traffic Classification (RNTC) algorithm for WLANs based on Compressed Sensing (CS) is presented in this paper. The fundamental goal of this algorithm is to solve difficult wireless network management problems. The proposed architecture allows reducing False Detection Rate (FDR) to 25% and Packet Delay (PD) to 15 %. The proposed architecture is also increased 10 % accuracy of wireless transmission, which provides a good background for establishing high quality wireless local area networks.

Finding a Place To Stand: Negotiating the Spatial Configuration of the Networked Computer Classroom.

Science.gov (United States)

Kent-Drury, Roxanne

1998-01-01

Theorizes the spatial dynamics of both traditional and Internet-networked classrooms to reveal that both exhibit indeterminate spatial characteristics, but that network connectivity renders this indeterminacy visible. Argues that networked classrooms need not be disorienting, if students recreate a center by designing a class Web site, creating…

Emergence of robustness in networks of networks

Science.gov (United States)

Roth, Kevin; Morone, Flaviano; Min, Byungjoon; Makse, Hernán A.

2017-06-01

A model of interdependent networks of networks (NONs) was introduced recently [Proc. Natl. Acad. Sci. (USA) 114, 3849 (2017), 10.1073/pnas.1620808114] in the context of brain activation to identify the neural collective influencers in the brain NON. Here we investigate the emergence of robustness in such a model, and we develop an approach to derive an exact expression for the random percolation transition in Erdös-Rényi NONs of this kind. Analytical calculations are in agreement with numerical simulations, and highlight the robustness of the NON against random node failures, which thus presents a new robust universality class of NONs. The key aspect of this robust NON model is that a node can be activated even if it does not belong to the giant mutually connected component, thus allowing the NON to be built from below the percolation threshold, which is not possible in previous models of interdependent networks. Interestingly, the phase diagram of the model unveils particular patterns of interconnectivity for which the NON is most vulnerable, thereby marking the boundary above which the robustness of the system improves with increasing dependency connections.

Automatic target recognition using a feature-based optical neural network

Science.gov (United States)

Chao, Tien-Hsin

1992-01-01

An optical neural network based upon the Neocognitron paradigm (K. Fukushima et al. 1983) is introduced. A novel aspect of the architectural design is shift-invariant multichannel Fourier optical correlation within each processing layer. Multilayer processing is achieved by iteratively feeding back the output of the feature correlator to the input spatial light modulator and updating the Fourier filters. By training the neural net with characteristic features extracted from the target images, successful pattern recognition with intra-class fault tolerance and inter-class discrimination is achieved. A detailed system description is provided. Experimental demonstration of a two-layer neural network for space objects discrimination is also presented.

Reliability Demands in FTTH Access Networks

DEFF Research Database (Denmark)

Pedersen, Jens Myrup; Knudsen, Thomas Phillip; Madsen, Ole Brun

2004-01-01

In this paper reliability and bandwidth demands of existing, new and expected classes of applications running over Fiber To The Home (FTTH) networks to private users and small enterprises are analyzed and discussed. Certain applications such as home security and telemedicine are likely to require...

Reliability Demands in FTTH Access Networks

DEFF Research Database (Denmark)

Pedersen, Jens Myrup; Knudsen, Thomas Phillip; Madsen, Ole Brun

2005-01-01

In this paper reliability and bandwidth demands of existing, new and expected classes of applications running over Fiber To The Home (FTTH) networks to private users and small enterprises are analysed and discussed. Certain applications such as home security and telemedicine are likely to require...

On synchronized regions of discrete-time complex dynamical networks

International Nuclear Information System (INIS)

Duan Zhisheng; Chen Guanrong

2011-01-01

In this paper, the local synchronization of discrete-time complex networks is studied. First, it is shown that for any natural number n, there exists a discrete-time network which has at least left floor n/2 right floor +1 disconnected synchronized regions for local synchronization, which implies the possibility of intermittent synchronization behaviors. Different from the continuous-time networks, the existence of an unbounded synchronized region is impossible for discrete-time networks. The convexity of the synchronized regions is also characterized based on the stability of a class of matrix pencils, which is useful for enlarging the stability region so as to improve the network synchronizability.

Exploring social class: voices of inter-class couples.

Science.gov (United States)

McDowell, Teresa; Melendez-Rhodes, Tatiana; Althusius, Erin; Hergic, Sara; Sleeman, Gillian; Ton, Nicky Kieu My; Zimpfer-Bak, A J

2013-01-01

Social class is not often discussed or examined in-depth in couple and family therapy research and literature even though social class shapes familial relationships and is considered an important variable in marital satisfaction. In this qualitative study, we explored the perceptions of eight couples who made lasting commitments across class lines by asking them about the impact of their social class backgrounds on their relationships. Three categories of themes emerged including: (a) differences and similarities in values and attitudes toward education, work, money, and class awareness/classism, (b) relationship issues involving families of origin, friends, and class-based couple conflict, and (c) differences in economic resources, social capital and privileges/opportunities. Implications for assessment and treatment of couples are included. © 2012 American Association for Marriage and Family Therapy.

Mobile ad hoc networking the cutting edge directions

CERN Document Server

Basagni, Stefano; Giordano, Silvia; Stojmenovic, Ivan

2013-01-01

""An excellent book for those who are interested in learning the current status of research and development . . . [and] who want to get a comprehensive overview of the current state-of-the-art.""-E-Streams This book provides up-to-date information on research and development in the rapidly growing area of networks based on the multihop ad hoc networking paradigm. It reviews all classes of networks that have successfully adopted this paradigm, pointing out how they penetrated the mass market and sparked breakthrough research. Covering both physical issues and applica

Analysis of CBRP for UDP and TCP Traffic-Classes to measure throughput in MANETs

Directory of Open Access Journals (Sweden)

Hardeep Singh Rayait

2013-01-01

Full Text Available In this paper, we analyse the throughput of both TCP and UDP traffic classes for cluster based routing protocol for mobile ad hoc network. It uses clustering structure to improve throughput , decrease average end-to-end delay and improve the average packet delivery ratio. We simulate our routing protocol for nodes running the IEEE802.11 MAC for analysis of throughput for both UDP and TCP traffic classes. The application layer protocol used for UDP is CBR and for TCP is FTP.

Spread of epidemic disease on networks

Science.gov (United States)

Newman, M. E.

2002-07-01

The study of social networks, and in particular the spread of disease on networks, has attracted considerable recent attention in the physics community. In this paper, we show that a large class of standard epidemiological models, the so-called susceptible/infective/removed (SIR) models can be solved exactly on a wide variety of networks. In addition to the standard but unrealistic case of fixed infectiveness time and fixed and uncorrelated probability of transmission between all pairs of individuals, we solve cases in which times and probabilities are nonuniform and correlated. We also consider one simple case of an epidemic in a structured population, that of a sexually transmitted disease in a population divided into men and women. We confirm the correctness of our exact solutions with numerical simulations of SIR epidemics on networks.

Temporal motifs in time-dependent networks

International Nuclear Information System (INIS)

Kovanen, Lauri; Karsai, Márton; Kaski, Kimmo; Kertész, János; Saramäki, Jari

2011-01-01

Temporal networks are commonly used to represent systems where connections between elements are active only for restricted periods of time, such as telecommunication, neural signal processing, biochemical reaction and human social interaction networks. We introduce the framework of temporal motifs to study the mesoscale topological–temporal structure of temporal networks in which the events of nodes do not overlap in time. Temporal motifs are classes of similar event sequences, where the similarity refers not only to topology but also to the temporal order of the events. We provide a mapping from event sequences to coloured directed graphs that enables an efficient algorithm for identifying temporal motifs. We discuss some aspects of temporal motifs, including causality and null models, and present basic statistics of temporal motifs in a large mobile call network

Global asymptotic stability of delayed Cohen-Grossberg neural networks

International Nuclear Information System (INIS)

Wu Wei; Cui Baotong; Huang Min

2007-01-01

In this letter, the global asymptotic stability of a class of Cohen-Grossberg neural networks with time-varying delays is discussed. A new set of sufficient conditions for the neural networks are proposed to guarantee the global asymptotic convergence. Our criteria represent an extension of the existing results in literatures. An example is also presented to compare our results with the previous results

Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution.

Science.gov (United States)

Francis, Andrew; Moulton, Vincent

2018-06-07

Phylogenetic networks are an extension of phylogenetic trees which are used to represent evolutionary histories in which reticulation events (such as recombination and hybridization) have occurred. A central question for such networks is that of identifiability, which essentially asks under what circumstances can we reliably identify the phylogenetic network that gave rise to the observed data? Recently, identifiability results have appeared for networks relative to a model of sequence evolution that generalizes the standard Markov models used for phylogenetic trees. However, these results are quite limited in terms of the complexity of the networks that are considered. In this paper, by introducing an alternative probabilistic model for evolution along a network that is based on some ground-breaking work by Thatte for pedigrees, we are able to obtain an identifiability result for a much larger class of phylogenetic networks (essentially the class of so-called tree-child networks). To prove our main theorem, we derive some new results for identifying tree-child networks combinatorially, and then adapt some techniques developed by Thatte for pedigrees to show that our combinatorial results imply identifiability in the probabilistic setting. We hope that the introduction of our new model for networks could lead to new approaches to reliably construct phylogenetic networks. Copyright © 2018 Elsevier Ltd. All rights reserved.

Information Assurance in Networked Enterprises: MICSS Class Experiments and Industry Survey Analysis

National Research Council Canada - National Science Library

Ray, Parbati

2001-01-01

.... The surveys give an insight into how inter-networked companies use their ERP systems, whet their current policies maybe with respect to information management, and what their security and assurance problems maybe...

Satellite communications network design and analysis

CERN Document Server

Jo, Kenneth Y

2011-01-01

This authoritative book provides a thorough understanding of the fundamental concepts of satellite communications (SATCOM) network design and performance assessments. You find discussions on a wide class of SATCOM networks using satellites as core components, as well as coverage key applications in the field. This in-depth resource presents a broad range of critical topics, from geosynchronous Earth orbiting (GEO) satellites and direct broadcast satellite systems, to low Earth orbiting (LEO) satellites, radio standards and protocols.This invaluable reference explains the many specific uses of

Marketing Career Speed Networking: A Classroom Event to Foster Career Awareness

Science.gov (United States)

Buff, Cheryl L.; O'Connor, Suzanne

2012-01-01

This paper describes the design, implementation, and evaluation of a marketing career speed networking event held during class time in two sections of the consumer behavior class. The event was coordinated through a partnering effort with marketing faculty and the college's Career Center. A total of 57 students participated in the event, providing…

Intrusion detection model using fusion of chi-square feature selection and multi class SVM

Directory of Open Access Journals (Sweden)

Ikram Sumaiya Thaseen

2017-10-01

Full Text Available Intrusion detection is a promising area of research in the domain of security with the rapid development of internet in everyday life. Many intrusion detection systems (IDS employ a sole classifier algorithm for classifying network traffic as normal or abnormal. Due to the large amount of data, these sole classifier models fail to achieve a high attack detection rate with reduced false alarm rate. However by applying dimensionality reduction, data can be efficiently reduced to an optimal set of attributes without loss of information and then classified accurately using a multi class modeling technique for identifying the different network attacks. In this paper, we propose an intrusion detection model using chi-square feature selection and multi class support vector machine (SVM. A parameter tuning technique is adopted for optimization of Radial Basis Function kernel parameter namely gamma represented by ‘ϒ’ and over fitting constant ‘C’. These are the two important parameters required for the SVM model. The main idea behind this model is to construct a multi class SVM which has not been adopted for IDS so far to decrease the training and testing time and increase the individual classification accuracy of the network attacks. The investigational results on NSL-KDD dataset which is an enhanced version of KDDCup 1999 dataset shows that our proposed approach results in a better detection rate and reduced false alarm rate. An experimentation on the computational time required for training and testing is also carried out for usage in time critical applications.

Differential Neural Networks for Identification and Filtering in Nonlinear Dynamic Games

Directory of Open Access Journals (Sweden)

Emmanuel García

2014-01-01

Full Text Available This paper deals with the problem of identifying and filtering a class of continuous-time nonlinear dynamic games (nonlinear differential games subject to additive and undesired deterministic perturbations. Moreover, the mathematical model of this class is completely unknown with the exception of the control actions of each player, and even though the deterministic noises are known, their power (or their effect is not. Therefore, two differential neural networks are designed in order to obtain a feedback (perfect state information pattern for the mentioned class of games. In this way, the stability conditions for two state identification errors and for a filtering error are established, the upper bounds of these errors are obtained, and two new learning laws for each neural network are suggested. Finally, an illustrating example shows the applicability of this approach.

Pinning impulsive control algorithms for complex network

Energy Technology Data Exchange (ETDEWEB)

Sun, Wen [School of Information and Mathematics, Yangtze University, Jingzhou 434023 (China); Lü, Jinhu [Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190 (China); Chen, Shihua [College of Mathematics and Statistics, Wuhan University, Wuhan 430072 (China); Yu, Xinghuo [School of Electrical and Computer Engineering, RMIT University, Melbourne VIC 3001 (Australia)

2014-03-15

In this paper, we further investigate the synchronization of complex dynamical network via pinning control in which a selection of nodes are controlled at discrete times. Different from most existing work, the pinning control algorithms utilize only the impulsive signals at discrete time instants, which may greatly improve the communication channel efficiency and reduce control cost. Two classes of algorithms are designed, one for strongly connected complex network and another for non-strongly connected complex network. It is suggested that in the strongly connected network with suitable coupling strength, a single controller at any one of the network's nodes can always pin the network to its homogeneous solution. In the non-strongly connected case, the location and minimum number of nodes needed to pin the network are determined by the Frobenius normal form of the coupling matrix. In addition, the coupling matrix is not necessarily symmetric or irreducible. Illustrative examples are then given to validate the proposed pinning impulsive control algorithms.

Pinning impulsive control algorithms for complex network

International Nuclear Information System (INIS)

Sun, Wen; Lü, Jinhu; Chen, Shihua; Yu, Xinghuo

2014-01-01

In this paper, we further investigate the synchronization of complex dynamical network via pinning control in which a selection of nodes are controlled at discrete times. Different from most existing work, the pinning control algorithms utilize only the impulsive signals at discrete time instants, which may greatly improve the communication channel efficiency and reduce control cost. Two classes of algorithms are designed, one for strongly connected complex network and another for non-strongly connected complex network. It is suggested that in the strongly connected network with suitable coupling strength, a single controller at any one of the network's nodes can always pin the network to its homogeneous solution. In the non-strongly connected case, the location and minimum number of nodes needed to pin the network are determined by the Frobenius normal form of the coupling matrix. In addition, the coupling matrix is not necessarily symmetric or irreducible. Illustrative examples are then given to validate the proposed pinning impulsive control algorithms

Algorithmic Complexity and Reprogrammability of Chemical Structure Networks

KAUST Repository

Zenil, Hector; Kiani, Narsis A.; Shang, Ming-mei; Tegner, Jesper

2018-01-01

Here we address the challenge of profiling causal properties and tracking the transformation of chemical compounds from an algorithmic perspective. We explore the potential of applying a computational interventional calculus based on the principles of algorithmic probability to chemical structure networks. We profile the sensitivity of the elements and covalent bonds in a chemical structure network algorithmically, asking whether reprogrammability affords information about thermodynamic and chemical processes involved in the transformation of different compound classes. We arrive at numerical results suggesting a correspondence between some physical, structural and functional properties. Our methods are capable of separating chemical classes that reflect functional and natural differences without considering any information about atomic and molecular properties. We conclude that these methods, with their links to chemoinformatics via algorithmic, probability hold promise for future research.

Algorithmic Complexity and Reprogrammability of Chemical Structure Networks

KAUST Repository

Zenil, Hector

2018-02-16

Here we address the challenge of profiling causal properties and tracking the transformation of chemical compounds from an algorithmic perspective. We explore the potential of applying a computational interventional calculus based on the principles of algorithmic probability to chemical structure networks. We profile the sensitivity of the elements and covalent bonds in a chemical structure network algorithmically, asking whether reprogrammability affords information about thermodynamic and chemical processes involved in the transformation of different compound classes. We arrive at numerical results suggesting a correspondence between some physical, structural and functional properties. Our methods are capable of separating chemical classes that reflect functional and natural differences without considering any information about atomic and molecular properties. We conclude that these methods, with their links to chemoinformatics via algorithmic, probability hold promise for future research.

Algorithmic Complexity and Reprogrammability of Chemical Structure Networks

KAUST Repository

Zenil, Hector

2018-04-02

Here we address the challenge of profiling causal properties and tracking the transformation of chemical compounds from an algorithmic perspective. We explore the potential of applying a computational interventional calculus based on the principles of algorithmic probability to chemical structure networks. We profile the sensitivity of the elements and covalent bonds in a chemical structure network algorithmically, asking whether reprogrammability affords information about thermodynamic and chemical processes involved in the transformation of different compound classes. We arrive at numerical results suggesting a correspondence between some physical, structural and functional properties. Our methods are capable of separating chemical classes that reflect functional and natural differences without considering any information about atomic and molecular properties. We conclude that these methods, with their links to chemoinformatics via algorithmic, probability hold promise for future research.

Class impressions : Higher social class elicits lower prosociality

NARCIS (Netherlands)

Van Doesum, Niels J.; Tybur, Joshua M.; Van Lange, Paul A.M.

2017-01-01

Social class predicts numerous important life outcomes and social orientations. To date, literature has mainly examined how an individual's own class shapes interactions with others. But how prosocially do people treat others they perceive as coming from lower, middle, or higher social classes?

Stochastic cycle selection in active flow networks

Science.gov (United States)

Woodhouse, Francis; Forrow, Aden; Fawcett, Joanna; Dunkel, Jorn

2016-11-01

Active biological flow networks pervade nature and span a wide range of scales, from arterial blood vessels and bronchial mucus transport in humans to bacterial flow through porous media or plasmodial shuttle streaming in slime molds. Despite their ubiquity, little is known about the self-organization principles that govern flow statistics in such non-equilibrium networks. By connecting concepts from lattice field theory, graph theory and transition rate theory, we show how topology controls dynamics in a generic model for actively driven flow on a network. Through theoretical and numerical analysis we identify symmetry-based rules to classify and predict the selection statistics of complex flow cycles from the network topology. Our conceptual framework is applicable to a broad class of biological and non-biological far-from-equilibrium networks, including actively controlled information flows, and establishes a new correspondence between active flow networks and generalized ice-type models.

Designing real-time systems based on mono-master Profibus-DP networks

OpenAIRE

Monforte, Salvatore; Alves, Mário; Vasques, Francisco; Tovar, Eduardo

2000-01-01

Profibus networks are widely used as the communication infrastructure for supporting distributed computer-controlled applications. Most of the times, these applications impose strict real-time requirements. Profibus-DP has gradually become the preferred Profibus application profile. It is usually implemented as a mono-master Profibus network, and is optimised for speed and efficiency. The aim of this paper is to analyse the real-time behaviour of this class of Profibus networks...

Boost.Asio C++ network programming

CERN Document Server

Torjo, John

2013-01-01

What you want is an easy level of abstraction, which is just what this book provides in conjunction with Boost.Asio. Switching to Boost.Asio is just a few extra #include directives away, with the help of this practical and engaging guide.This book is great for developers that need to do network programming, who don't want to delve into the complicated issues of a raw networking API. You should be familiar with core Boost concepts, such as smart pointers and shared_from_this, resource classes (noncopyable), functors and boost::bind, boost mutexes, and the boost date/time library. Readers should

Epidemic spreading on heterogeneous networks with identical infectivity

International Nuclear Information System (INIS)

Yang, Rui; Wang, Bing-Hong; Ren, Jie; Bai, Wen-Jie; Shi, Zhi-Wen; Wang, Wen-Xu; Zhou, Tao

2007-01-01

In this Letter, we propose a modified susceptible-infected-recovered (SIR) model, in which each node is assigned with an identical capability of active contacts, A, at each time step. In contrast to the previous studies, we find that on scale-free networks, the density of the recovered individuals in the present model shows a threshold behavior. We obtain the analytical results using the mean-field theory and find that the threshold value equals 1/A, indicating that the threshold value is independent of the topology of the underlying network. The simulations agree well with the analytic results. Furthermore, we study the time behavior of the epidemic propagation and find a hierarchical dynamics with three plateaus. Once the highly connected hubs are reached, the infection pervades almost the whole network in a progressive cascade across smaller degree classes. Then, after the previously infected hubs are recovered, the disease can only propagate to the class of smallest degree till the infected individuals are all recovered. The present results could be of practical importance in the setup of dynamic control strategies

Automatic Detection of Respiratory Events During Sleep Using Bidirectional LSTM Networks

DEFF Research Database (Denmark)

Jacobsen, K. P.; Olesen, Alexander Neergaard; Trap, L.

2018-01-01

seconds overlap. Two models were developed based on bidirectional long short-term memory (bLSTM) neural networks: 1)a two-class model for classification of windows as “normal” or “event”, and 2)a four-class model for classification as “normal”, “obstructive”, “central”, or “mixed”. 1882 subjects were used...

Stability results for stochastic delayed recurrent neural networks with discrete and distributed delays

Science.gov (United States)

Chen, Guiling; Li, Dingshi; Shi, Lin; van Gaans, Onno; Verduyn Lunel, Sjoerd

2018-03-01

We present new conditions for asymptotic stability and exponential stability of a class of stochastic recurrent neural networks with discrete and distributed time varying delays. Our approach is based on the method using fixed point theory, which do not resort to any Liapunov function or Liapunov functional. Our results neither require the boundedness, monotonicity and differentiability of the activation functions nor differentiability of the time varying delays. In particular, a class of neural networks without stochastic perturbations is also considered. Examples are given to illustrate our main results.

Arithmetic functions in torus and tree networks

Science.gov (United States)

Bhanot, Gyan; Blumrich, Matthias A.; Chen, Dong; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Steinmacher-Burow, Burkhard D.; Vranas, Pavlos M.

2007-12-25

Methods and systems for performing arithmetic functions. In accordance with a first aspect of the invention, methods and apparatus are provided, working in conjunction of software algorithms and hardware implementation of class network routing, to achieve a very significant reduction in the time required for global arithmetic operation on the torus. Therefore, it leads to greater scalability of applications running on large parallel machines. The invention involves three steps in improving the efficiency and accuracy of global operations: (1) Ensuring, when necessary, that all the nodes do the global operation on the data in the same order and so obtain a unique answer, independent of roundoff error; (2) Using the topology of the torus to minimize the number of hops and the bidirectional capabilities of the network to reduce the number of time steps in the data transfer operation to an absolute minimum; and (3) Using class function routing to reduce latency in the data transfer. With the method of this invention, every single element is injected into the network only once and it will be stored and forwarded without any further software overhead. In accordance with a second aspect of the invention, methods and systems are provided to efficiently implement global arithmetic operations on a network that supports the global combining operations. The latency of doing such global operations are greatly reduced by using these methods.

Pronouns and identity: A case study from a 1930s working-class community

Directory of Open Access Journals (Sweden)

Timmis Ivor

2015-03-01

Full Text Available This article investigates the relationship between certain pronoun uses and identity in a 1930s working class community. It is based on a corpus of informal conversations drawn from the Mass-Observation archive, a sociological and anthropological study of the Bolton (UK working class at this time. The article argues that certain pronoun uses in the corpus can only be explained as homophoric reference, a kind of reference which depends on implicit agreement about the intended referent of the pronoun. The article then discusses the basis on which this implicit agreement could operate: shared culture and knowledge and a tight network of social relations. In the conclusion, two particular questions are raised: 1 How far can the homophoric reference described be related to social class? 2 When does (dialect grammar become pragmatics?

Performance Enhancements of UMTS networks using end-to-end QoS provisioning

DEFF Research Database (Denmark)

Wang, Haibo; Prasad, Devendra; Teyeb, Oumer

2005-01-01

This paper investigates the end-to-end(E2E) quality of service(QoS) provisioning approaches for UMTS networks together with DiffServ IP network. The effort was put on QoS classes mapping from DiffServ to UMTS, Access Control(AC), buffering and scheduling optimization. The DiffServ Code Point (DSCP......) was utilized in the whole UMTS QoS provisioning to differentiate different type of traffics. The overall algorithm was optimized to guarantee the E2E QoS parameters of each service class, especially for realtime applications, as well as to improve the bandwidth utilization. Simulation shows that the enhanced...

Track classification within wireless sensor network

Science.gov (United States)

Doumerc, Robin; Pannetier, Benjamin; Moras, Julien; Dezert, Jean; Canevet, Loic

2017-05-01

In this paper, we present our study on track classification by taking into account environmental information and target estimated states. The tracker uses several motion model adapted to different target dynamics (pedestrian, ground vehicle and SUAV, i.e. small unmanned aerial vehicle) and works in centralized architecture. The main idea is to explore both: classification given by heterogeneous sensors and classification obtained with our fusion module. The fusion module, presented in his paper, provides a class on each track according to track location, velocity and associated uncertainty. To model the likelihood on each class, a fuzzy approach is used considering constraints on target capability to move in the environment. Then the evidential reasoning approach based on Dempster-Shafer Theory (DST) is used to perform a time integration of this classifier output. The fusion rules are tested and compared on real data obtained with our wireless sensor network.In order to handle realistic ground target tracking scenarios, we use an autonomous smart computer deposited in the surveillance area. After the calibration step of the heterogeneous sensor network, our system is able to handle real data from a wireless ground sensor network. The performance of this system is evaluated in a real exercise for intelligence operation ("hunter hunt" scenario).

Corporate Social Networks Applied in the Classroom

Directory of Open Access Journals (Sweden)

Hugo de Juan-Jordán

2016-10-01

This study also tries to propose some guidelines and best practices obtained as a result of the experience of use and the adoption of social networks in class in order to improve the learning process and innovate in the methodology applied to education.

Cisco Networking Academy Program for high school students: Formative & summative evaluation

Science.gov (United States)

Cranford-Wesley, Deanne

This study examined the effectiveness of the Cisco Network Technology Program in enhancing students' technology skills as measured by classroom strategies, student motivation, student attitude, and student learning. Qualitative and quantitative methods were utilized to determine the effectiveness of this program. The study focused on two 11th grade classrooms at Hamtramck High School. Hamtramck, an inner-city community located in Detroit, is racially and ethnically diverse. The majority of students speak English as a second language; more than 20 languages are represented in the school district. More than 70% of the students are considered to be economically at risk. Few students have computers at home, and their access to the few computers at school is limited. Purposive sampling was conducted for this study. The sample consisted of 40 students, all of whom were trained in Cisco Networking Technologies. The researcher examined viable learning strategies in teaching a Cisco Networking class that focused on a web-based approach. Findings revealed that the Cisco Networking Academy Program was an excellent vehicle for teaching networking skills and, therefore, helping to enhance computer skills for the participating students. However, only a limited number of students were able to participate in the program, due to limited computer labs and lack of qualified teaching personnel. In addition, the cumbersome technical language posed an obstacle to students' success in networking. Laboratory assignments were preferred by 90% of the students over lecture and PowerPoint presentations. Practical applications, lab projects, interactive assignments, PowerPoint presentations, lectures, discussions, readings, research, and assessment all helped to increase student learning and proficiency and to enrich the classroom experience. Classroom strategies are crucial to student success in the networking program. Equipment must be updated and utilized to ensure that students are

Emergence, evolution and scaling of online social networks.

Science.gov (United States)

Wang, Le-Zhi; Huang, Zi-Gang; Rong, Zhi-Hai; Wang, Xiao-Fan; Lai, Ying-Cheng

2014-01-01

Online social networks have become increasingly ubiquitous and understanding their structural, dynamical, and scaling properties not only is of fundamental interest but also has a broad range of applications. Such networks can be extremely dynamic, generated almost instantaneously by, for example, breaking-news items. We investigate a common class of online social networks, the user-user retweeting networks, by analyzing the empirical data collected from Sina Weibo (a massive twitter-like microblogging social network in China) with respect to the topic of the 2011 Japan earthquake. We uncover a number of algebraic scaling relations governing the growth and structure of the network and develop a probabilistic model that captures the basic dynamical features of the system. The model is capable of reproducing all the empirical results. Our analysis not only reveals the basic mechanisms underlying the dynamics of the retweeting networks, but also provides general insights into the control of information spreading on such networks.

Emergence, evolution and scaling of online social networks.

Directory of Open Access Journals (Sweden)

Le-Zhi Wang

Full Text Available Online social networks have become increasingly ubiquitous and understanding their structural, dynamical, and scaling properties not only is of fundamental interest but also has a broad range of applications. Such networks can be extremely dynamic, generated almost instantaneously by, for example, breaking-news items. We investigate a common class of online social networks, the user-user retweeting networks, by analyzing the empirical data collected from Sina Weibo (a massive twitter-like microblogging social network in China with respect to the topic of the 2011 Japan earthquake. We uncover a number of algebraic scaling relations governing the growth and structure of the network and develop a probabilistic model that captures the basic dynamical features of the system. The model is capable of reproducing all the empirical results. Our analysis not only reveals the basic mechanisms underlying the dynamics of the retweeting networks, but also provides general insights into the control of information spreading on such networks.

Community Structure in Online Collegiate Social Networks

Science.gov (United States)

Traud, Amanda; Kelsic, Eric; Mucha, Peter; Porter, Mason

2009-03-01

Online social networking sites have become increasingly popular with college students. The networks we studied are defined through ``friendships'' indicated by Facebook users from UNC, Oklahoma, Caltech, Georgetown, and Princeton. We apply the tools of network science to study the Facebook networks from these five different universities at a single point in time. We investigate each single-institution network's community structure, which we obtain through partitioning the graph using an eigenvector method. We use both graphical and quantitative tools, including pair-counting methods, which we interpret through statistical analysis and permutation tests to measure the correlations between the network communities and a set of characteristics given by each user (residence, class year, major, and high school). We also analyze the single gender subsets of these networks, and the impact of missing demographical data. Our study allows us to compare the online social networks for the five schools as well as infer differences in offline social interactions. At the schools studied, we were able to define which characteristics of the Facebook users correlate best with friendships.

RxClass

Data.gov (United States)

U.S. Department of Health & Human Services — The RxClass Browser is a web application for exploring and navigating through the class hierarchies to find the RxNorm drug members associated with each class....

Optimal Control of Interdependent Epidemics in Complex Networks

OpenAIRE

Chen, Juntao; Zhang, Rui; Zhu, Quanyan

2017-01-01

Optimal control of interdependent epidemics spreading over complex networks is a critical issue. We first establish a framework to capture the coupling between two epidemics, and then analyze the system's equilibrium states by categorizing them into three classes, and deriving their stability conditions. The designed control strategy globally optimizes the trade-off between the control cost and the severity of epidemics in the network. A gradient descent algorithm based on a fixed point itera...

A growing social network model in geographical space

Science.gov (United States)

Antonioni, Alberto; Tomassini, Marco

2017-09-01

In this work we propose a new model for the generation of social networks that includes their often ignored spatial aspects. The model is a growing one and links are created either taking space into account, or disregarding space and only considering the degree of target nodes. These two effects can be mixed linearly in arbitrary proportions through a parameter. We numerically show that for a given range of the combination parameter, and for given mean degree, the generated network class shares many important statistical features with those observed in actual social networks, including the spatial dependence of connections. Moreover, we show that the model provides a good qualitative fit to some measured social networks.

Using Facebook Groups to Encourage Science Discussions in a Large-Enrollment Biology Class

Science.gov (United States)

Pai, Aditi; McGinnis, Gene; Bryant, Dana; Cole, Megan; Kovacs, Jennifer; Stovall, Kyndra; Lee, Mark

2017-01-01

This case study reports the instructional development, impact, and lessons learned regarding the use of Facebook as an educational tool within a large enrollment Biology class at Spelman College (Atlanta, GA). We describe the use of this social networking site to (a) engage students in active scientific discussions, (b) build community within the…

Pinning Control Strategy of Multicommunity Structure Networks

Directory of Open Access Journals (Sweden)

Chao Ding

2017-01-01

Full Text Available In order to investigate the effects of community structure on synchronization, a pinning control strategy is researched in a class of complex networks with community structure in this paper. A feedback control law is designed based on the network community structure information. The stability condition is given and proved by using Lyapunov stability theory. Our research shows that as to community structure networks, there being a threshold hT≈5, when coupling strength bellows this threshold, the stronger coupling strength corresponds to higher synchronizability; vice versa, the stronger coupling strength brings lower synchronizability. In addition the synchronizability of overlapping and nonoverlapping community structure networks was simulated and analyzed; while the nodes were controlled randomly and intensively, the results show that intensive control strategy is better than the random one. The network will reach synchronization easily when the node with largest betweenness was controlled. Furthermore, four difference networks’ synchronizability, such as Barabási-Albert network, Watts-Strogatz network, Erdös-Rényi network, and community structure network, are simulated; the research shows that the community structure network is more easily synchronized under the same control strength.

Transforming phylogenetic networks: Moving beyond tree space.

Science.gov (United States)

Huber, Katharina T; Moulton, Vincent; Wu, Taoyang

2016-09-07

Phylogenetic networks are a generalization of phylogenetic trees that are used to represent reticulate evolution. Unrooted phylogenetic networks form a special class of such networks, which naturally generalize unrooted phylogenetic trees. In this paper we define two operations on unrooted phylogenetic networks, one of which is a generalization of the well-known nearest-neighbor interchange (NNI) operation on phylogenetic trees. We show that any unrooted phylogenetic network can be transformed into any other such network using only these operations. This generalizes the well-known fact that any phylogenetic tree can be transformed into any other such tree using only NNI operations. It also allows us to define a generalization of tree space and to define some new metrics on unrooted phylogenetic networks. To prove our main results, we employ some fascinating new connections between phylogenetic networks and cubic graphs that we have recently discovered. Our results should be useful in developing new strategies to search for optimal phylogenetic networks, a topic that has recently generated some interest in the literature, as well as for providing new ways to compare networks. Copyright © 2016 Elsevier Ltd. All rights reserved.

Recurrent neural network for non-smooth convex optimization problems with application to the identification of genetic regulatory networks.

Science.gov (United States)

Cheng, Long; Hou, Zeng-Guang; Lin, Yingzi; Tan, Min; Zhang, Wenjun Chris; Wu, Fang-Xiang

2011-05-01

A recurrent neural network is proposed for solving the non-smooth convex optimization problem with the convex inequality and linear equality constraints. Since the objective function and inequality constraints may not be smooth, the Clarke's generalized gradients of the objective function and inequality constraints are employed to describe the dynamics of the proposed neural network. It is proved that the equilibrium point set of the proposed neural network is equivalent to the optimal solution of the original optimization problem by using the Lagrangian saddle-point theorem. Under weak conditions, the proposed neural network is proved to be stable, and the state of the neural network is convergent to one of its equilibrium points. Compared with the existing neural network models for non-smooth optimization problems, the proposed neural network can deal with a larger class of constraints and is not based on the penalty method. Finally, the proposed neural network is used to solve the identification problem of genetic regulatory networks, which can be transformed into a non-smooth convex optimization problem. The simulation results show the satisfactory identification accuracy, which demonstrates the effectiveness and efficiency of the proposed approach.

Bridging humans via agent networks

International Nuclear Information System (INIS)

Ishida, Toru

1994-01-01

Recent drastic advance in telecommunication networks enabled the human organization of new class, teleorganization, which differ from any existing organization in that the organization which is easy to create by using telecommunication networks is virtual and remote, that people can join multiple organizations simultaneously, and that the organization can involve people who may not know each other. In order to enjoy the recent advance in telecommunication, the agent networks to help people organize themselves are needed. In this paper, an architecture of agent networks, in which each agent learns the preference or the utility functioin of the owner, and acts on behalf of the owner in maintaining the organization, is proposed. When an agent networks supports a human organization, the conventional human interface is divided into personal and social interfaces. The functionalities of the social interface in teleconferencing and telelearning were investigated. In both cases, the existence of B-ISDN is assumed, and the extension to the business meeting scheduling using personal handy phone (PHS) networks with personal digital assistant (PDA) terminals is expected. These circumstances are described. Mutual selection protocols (MSP) and their dynamic properties are explained. (K.I.)

Classification of brain compartments and head injury lesions by neural networks applied to MRI

International Nuclear Information System (INIS)

Kischell, E.R.; Kehtarnavaz, N.; Hillman, G.R.; Levin, H.; Lilly, M.; Kent, T.A.

1995-01-01

An automatic, neural network-based approach was applied to segment normal brain compartments and lesions on MR images. Two supervised networks, backpropagation (BPN) and counterpropagation, and two unsupervised networks, Kohonen learning vector quantizer and analog adaptive resonance theory, were trained on registered T2-weighted and proton density images. The classes of interest were background, gray matter, white matter, cerebrospinal fluid, macrocystic encephalomalacia, gliosis, and 'unknown'. A comprehensive feature vector was chosen to discriminate these classes. The BPN combined with feature conditioning, multiple discriminant analysis followed by Hotelling transform, produced the most accurate and consistent classification results. Classifications of normal brain compartments were generally in agreement with expert interpretation of the images. Macrocystic encephalomalacia and gliosis were recognized and, except around the periphery, classified in agreement with the clinician's report used to train the neural network. (orig.)

Classification of brain compartments and head injury lesions by neural networks applied to MRI

Energy Technology Data Exchange (ETDEWEB)

Kischell, E R [Dept. of Electrical Engineering, Texas A and M Univ., College Station, TX (United States); Kehtarnavaz, N [Dept. of Electrical Engineering, Texas A and M Univ., College Station, TX (United States); Hillman, G R [Dept. of Pharmacology, Univ. of Texas Medical Branch, Galveston, TX (United States); Levin, H [Dept. of Neurosurgery, Univ. of Texas Medical Branch, Galveston, TX (United States); Lilly, M [Dept. of Neurosurgery, Univ. of Texas Medical Branch, Galveston, TX (United States); Kent, T A [Dept. of Neurology and Psychiatry, Univ. of Texas Medical Branch, Galveston, TX (United States)

1995-10-01

An automatic, neural network-based approach was applied to segment normal brain compartments and lesions on MR images. Two supervised networks, backpropagation (BPN) and counterpropagation, and two unsupervised networks, Kohonen learning vector quantizer and analog adaptive resonance theory, were trained on registered T2-weighted and proton density images. The classes of interest were background, gray matter, white matter, cerebrospinal fluid, macrocystic encephalomalacia, gliosis, and `unknown`. A comprehensive feature vector was chosen to discriminate these classes. The BPN combined with feature conditioning, multiple discriminant analysis followed by Hotelling transform, produced the most accurate and consistent classification results. Classifications of normal brain compartments were generally in agreement with expert interpretation of the images. Macrocystic encephalomalacia and gliosis were recognized and, except around the periphery, classified in agreement with the clinician`s report used to train the neural network. (orig.)

Neural Networks through Shared Maps in Mobile Devices

Directory of Open Access Journals (Sweden)

William Raveane

2014-12-01

Full Text Available We introduce a hybrid system composed of a convolutional neural network and a discrete graphical model for image recognition. This system improves upon traditional sliding window techniques for analysis of an image larger than the training data by effectively processing the full input scene through the neural network in less time. The final result is then inferred from the neural network output through energy minimization to reach a more precize localization than what traditional maximum value class comparisons yield. These results are apt for applying this process in a mobile device for real time image recognition.

Laboratory Experiments for Network Security Instruction

Science.gov (United States)

Brustoloni, Jose Carlos

2006-01-01

We describe a sequence of five experiments on network security that cast students successively in the roles of computer user, programmer, and system administrator. Unlike experiments described in several previous papers, these experiments avoid placing students in the role of attacker. Each experiment starts with an in-class demonstration of an…

Type Families with Class, Type Classes with Family

DEFF Research Database (Denmark)

Serrano, Alejandro; Hage, Jurriaan; Bahr, Patrick

2015-01-01

Type classes and type families are key ingredients in Haskell programming. Type classes were introduced to deal with ad-hoc polymorphism, although with the introduction of functional dependencies, their use expanded to type-level programming. Type families also allow encoding type-level functions......, now as rewrite rules. This paper looks at the interplay of type classes and type families, and how to deal with shortcomings in both of them. Furthermore, we show how to use families to simulate classes at the type level. However, type families alone are not enough for simulating a central feature...... of type classes: elaboration, that is, generating code from the derivation of a rewriting. We look at ways to solve this problem in current Haskell, and propose an extension to allow elaboration during the rewriting phase....

Methods and procedures for the verification and validation of artificial neural networks

CERN Document Server

Taylor, Brian J

2006-01-01

Neural networks are members of a class of software that have the potential to enable intelligent computational systems capable of simulating characteristics of biological thinking and learning. This volume introduces some of the methods and techniques used for the verification and validation of neural networks and adaptive systems.

Network Unfolding Map by Vertex-Edge Dynamics Modeling.

Science.gov (United States)

Verri, Filipe Alves Neto; Urio, Paulo Roberto; Zhao, Liang

2018-02-01

The emergence of collective dynamics in neural networks is a mechanism of the animal and human brain for information processing. In this paper, we develop a computational technique using distributed processing elements in a complex network, which are called particles, to solve semisupervised learning problems. Three actions govern the particles' dynamics: generation, walking, and absorption. Labeled vertices generate new particles that compete against rival particles for edge domination. Active particles randomly walk in the network until they are absorbed by either a rival vertex or an edge currently dominated by rival particles. The result from the model evolution consists of sets of edges arranged by the label dominance. Each set tends to form a connected subnetwork to represent a data class. Although the intrinsic dynamics of the model is a stochastic one, we prove that there exists a deterministic version with largely reduced computational complexity; specifically, with linear growth. Furthermore, the edge domination process corresponds to an unfolding map in such way that edges "stretch" and "shrink" according to the vertex-edge dynamics. Consequently, the unfolding effect summarizes the relevant relationships between vertices and the uncovered data classes. The proposed model captures important details of connectivity patterns over the vertex-edge dynamics evolution, in contrast to the previous approaches, which focused on only vertex or only edge dynamics. Computer simulations reveal that the new model can identify nonlinear features in both real and artificial data, including boundaries between distinct classes and overlapping structures of data.

DEPRIVATION, CLASS AND IDENTITY ISSUE IN CONTEMPORARY TURKISH CINEMA

Directory of Open Access Journals (Sweden)

Neşe Kaplan

2016-01-01

Full Text Available New economy–politics and globalization have not only been changing the structure of class but the representation of identities as well. New social roles are reproduced and also criticized by the means of cultural production in which media and cinema instruments included. In past, the class structure and attachment to identities were effected by modernization process; in a similar way; in the current state of modernization, the new cultural sphere shaped by global communication networks and global consumption attitudes have been alternating the class structure and attachment to identity. With this context, this study analyzed some contemporary social realistic films (Zerre, Araf, Köksüz, Yozgat Blues to understand how the position of individual changes within its role with herself and its relation to social institutions through a critical approach towards the dimensions of culture and economy-politics of the change. The aim is to start a discussion over cinema, about the effect of cultural change on class and representation of identity. The theoretic frame enlightening the change of the relation of the individual with her work, family, and society was built with the help of critical works. The economy-politics result of the globalization phenomenon has isolated the individual and detached her from its position, subject of politics. The structure of class has changed, the attachment to identity has weakened. The desperation of individual belonging to nothing, is a subject of cinema as well. The isolation and the deprivation of the new individual emerges as the very “violence” itself in the fantastic world of cinema.

Spontaneous ad hoc mobile cloud computing network.

Science.gov (United States)

Lacuesta, Raquel; Lloret, Jaime; Sendra, Sandra; Peñalver, Lourdes

2014-01-01

Cloud computing helps users and companies to share computing resources instead of having local servers or personal devices to handle the applications. Smart devices are becoming one of the main information processing devices. Their computing features are reaching levels that let them create a mobile cloud computing network. But sometimes they are not able to create it and collaborate actively in the cloud because it is difficult for them to build easily a spontaneous network and configure its parameters. For this reason, in this paper, we are going to present the design and deployment of a spontaneous ad hoc mobile cloud computing network. In order to perform it, we have developed a trusted algorithm that is able to manage the activity of the nodes when they join and leave the network. The paper shows the network procedures and classes that have been designed. Our simulation results using Castalia show that our proposal presents a good efficiency and network performance even by using high number of nodes.

Artificial neural network approach for estimation of surface specific ...

Indian Academy of Sciences (India)

R. Narasimhan (Krishtel eMaging) 1461 1996 Oct 15 13:05:22

Meteorology and Oceanography Group, Space Applications Centre (ISRO), Ahmedabad 380 015, India. Microwave .... Total number of Qa observations in the sample-I dataset. techniques ... class of networks consists of multiple layers of com-.

Exponential stability of neural networks with asymmetric connection weights

International Nuclear Information System (INIS)

Yang Jinxiang; Zhong Shouming

2007-01-01

This paper investigates the exponential stability of a class of neural networks with asymmetric connection weights. By dividing the network state variables into various parts according to the characters of the neural networks, some new sufficient conditions of exponential stability are derived via constructing a Lyapunov function and using the method of the variation of constant. The new conditions are associated with the initial values and are described by some blocks of the interconnection matrix, and do not depend on other blocks. Examples are given to further illustrate the theory

Hidden Neural Networks: A Framework for HMM/NN Hybrids

DEFF Research Database (Denmark)

Riis, Søren Kamaric; Krogh, Anders Stærmose

1997-01-01

This paper presents a general framework for hybrids of hidden Markov models (HMM) and neural networks (NN). In the new framework called hidden neural networks (HNN) the usual HMM probability parameters are replaced by neural network outputs. To ensure a probabilistic interpretation the HNN is nor...... HMMs on TIMIT continuous speech recognition benchmarks. On the task of recognizing five broad phoneme classes an accuracy of 84% is obtained compared to 76% for a standard HMM. Additionally, we report a preliminary result of 69% accuracy on the TIMIT 39 phoneme task...

Combined principal component preprocessing and n-tuple neural networks for improved classification

DEFF Research Database (Denmark)

Høskuldsson, Agnar; Linneberg, Christian

2000-01-01

We present a combined principal component analysis/neural network scheme for classification. The data used to illustrate the method consist of spectral fluorescence recordings from seven different production facilities, and the task is to relate an unknown sample to one of these seven factories....... The data are first preprocessed by performing an individual principal component analysis on each of the seven groups of data. The components found are then used for classifying the data, but instead of making a single multiclass classifier, we follow the ideas of turning a multiclass problem into a number...... of two-class problems. For each possible pair of classes we further apply a transformation to the calculated principal components in order to increase the separation between the classes. Finally we apply the so-called n-tuple neural network to the transformed data in order to give the classification...

Critical cooperation range to improve spatial network robustness.

Directory of Open Access Journals (Sweden)

Vitor H P Louzada

Full Text Available A robust worldwide air-transportation network (WAN is one that minimizes the number of stranded passengers under a sequence of airport closures. Building on top of this realistic example, here we address how spatial network robustness can profit from cooperation between local actors. We swap a series of links within a certain distance, a cooperation range, while following typical constraints of spatially embedded networks. We find that the network robustness is only improved above a critical cooperation range. Such improvement can be described in the framework of a continuum transition, where the critical exponents depend on the spatial correlation of connected nodes. For the WAN we show that, except for Australia, all continental networks fall into the same universality class. Practical implications of this result are also discussed.

Modeling the spread of vector-borne diseases on bipartite networks.

Directory of Open Access Journals (Sweden)

Donal Bisanzio

Full Text Available BACKGROUND: Vector-borne diseases for which transmission occurs exclusively between vectors and hosts can be modeled as spreading on a bipartite network. METHODOLOGY/PRINCIPAL FINDINGS: In such models the spreading of the disease strongly depends on the degree distribution of the two classes of nodes. It is sufficient for one of the classes to have a scale-free degree distribution with a slow enough decay for the network to have asymptotically vanishing epidemic threshold. Data on the distribution of Ixodes ricinus ticks on mice and lizards from two independent studies are well described by a scale-free distribution compatible with an asymptotically vanishing epidemic threshold. The commonly used negative binomial, instead, cannot describe the right tail of the empirical distribution. CONCLUSIONS/SIGNIFICANCE: The extreme aggregation of vectors on hosts, described by the power-law decay of the degree distribution, makes the epidemic threshold decrease with the size of the network and vanish asymptotically.

A network Airline Revenue Management Framework Based on Deccomposition by Origins ans Destinations

NARCIS (Netherlands)

Birbil, S.I.; Frenk, J.B.G.; Gromicho Dos Santos, J.A.; Zhang, Shuzhong

2014-01-01

We propose a framework for solving airline revenue management problems on large networks, where the main concern is to allocate the flight leg capacities to customer requests under fixed class fares. This framework is based on a mathematical programming model that decomposes the network into

Network-Behavior Dynamics in Bullying and Defending : A Multilevel Network Analysis of Single-Grade versus Multi-Grade Classes

NARCIS (Netherlands)

Rambaran, Johannes; McFarland, Daniel; Veenstra, David

2017-01-01

The social networks in which children participate in are strongly associated with their involvement in bullying and defending (Juvonen & Graham, 2014; Salmivalli, 2010). It is likely that peer effects – referring to selection and influence processes – explain this association. Children seek out

Predicting cryptic links in host-parasite networks.

Directory of Open Access Journals (Sweden)

Tad Dallas

2017-05-01

Full Text Available Networks are a way to represent interactions among one (e.g., social networks or more (e.g., plant-pollinator networks classes of nodes. The ability to predict likely, but unobserved, interactions has generated a great deal of interest, and is sometimes referred to as the link prediction problem. However, most studies of link prediction have focused on social networks, and have assumed a completely censused network. In biological networks, it is unlikely that all interactions are censused, and ignoring incomplete detection of interactions may lead to biased or incorrect conclusions. Previous attempts to predict network interactions have relied on known properties of network structure, making the approach sensitive to observation errors. This is an obvious shortcoming, as networks are dynamic, and sometimes not well sampled, leading to incomplete detection of links. Here, we develop an algorithm to predict missing links based on conditional probability estimation and associated, node-level features. We validate this algorithm on simulated data, and then apply it to a desert small mammal host-parasite network. Our approach achieves high accuracy on simulated and observed data, providing a simple method to accurately predict missing links in networks without relying on prior knowledge about network structure.

Visionary network 2030. Technology vision for future distribution network

International Nuclear Information System (INIS)

Kumpulainen, L.; Laaksonen, H.; Komulainen, R.

2006-11-01

Objective of this research was to create the long term vision of a distribution network technology to be used for the near future rebuild and necessary R and D efforts. Present status of the grid was briefly handled and created scenarios for the operational environment changes and available technology International view was used for getting familiar with the present solutions and future expectations in other countries. Centralised power generation is supposed to form the majority, but also the distributed generation will play more and more important role, which is hard to predict due to the uncertainty of the development of the regulation. Higher reliability and safety in major faults are expected from the future network with the reasonable costs. Impact of the climate change and impregnant using restrictions cause difficulties especially for the overhead lines in the forests. In the rural network also the ageing is the problem. For the urban networks the land usage and environmental issues get more challenging and the network reinforcement is necessary due to the increased use of electricity. As a result several technical solutions are available. Additions to the technology today, several new solutions were introduced. Important solutions in the future network are supposed to be the wide range of underground cable, high degree utilisation of the communication and network automation solutions, considerable shorter protection zones and new layout solution. In a long run the islanding enabled by the distributed energy systems and totally new network structures and solutions based on power electronics are supposed to improve the power quality and profitability. Separate quality classes in network design principally are also supposed to be approved. Getting into the vision needs also the Roadmap project, which coordinates and focuses the development of the industry. So the limited national development resources can be effectively utilised. A coordinated national

End-to-end network models encompassing terrestrial, wireless, and satellite components

Science.gov (United States)

Boyarko, Chandler L.; Britton, John S.; Flores, Phil E.; Lambert, Charles B.; Pendzick, John M.; Ryan, Christopher M.; Shankman, Gordon L.; Williams, Ramon P.

2004-08-01

Development of network models that reflect true end-to-end architectures such as the Transformational Communications Architecture need to encompass terrestrial, wireless and satellite component to truly represent all of the complexities in a world wide communications network. Use of best-in-class tools including OPNET, Satellite Tool Kit (STK), Popkin System Architect and their well known XML-friendly definitions, such as OPNET Modeler's Data Type Description (DTD), or socket-based data transfer modules, such as STK/Connect, enable the sharing of data between applications for more rapid development of end-to-end system architectures and a more complete system design. By sharing the results of and integrating best-in-class tools we are able to (1) promote sharing of data, (2) enhance the fidelity of our results and (3) allow network and application performance to be viewed in the context of the entire enterprise and its processes.

Neutral theory of chemical reaction networks

International Nuclear Information System (INIS)

Lee, Sang Hoon; Holme, Petter; Minnhagen, Petter; Bernhardsson, Sebastian; Kim, Beom Jun

2012-01-01

To what extent do the characteristic features of a chemical reaction network reflect its purpose and function? In general, one argues that correlations between specific features and specific functions are key to understanding a complex structure. However, specific features may sometimes be neutral and uncorrelated with any system-specific purpose, function or causal chain. Such neutral features are caused by chance and randomness. Here we compare two classes of chemical networks: one that has been subjected to biological evolution (the chemical reaction network of metabolism in living cells) and one that has not (the atmospheric planetary chemical reaction networks). Their degree distributions are shown to share the very same neutral system-independent features. The shape of the broad distributions is to a large extent controlled by a single parameter, the network size. From this perspective, there is little difference between atmospheric and metabolic networks; they are just different sizes of the same random assembling network. In other words, the shape of the degree distribution is a neutral characteristic feature and has no functional or evolutionary implications in itself; it is not a matter of life and death. (paper)

Multi-class geospatial object detection based on a position-sensitive balancing framework for high spatial resolution remote sensing imagery

Science.gov (United States)

Zhong, Yanfei; Han, Xiaobing; Zhang, Liangpei

2018-04-01

Multi-class geospatial object detection from high spatial resolution (HSR) remote sensing imagery is attracting increasing attention in a wide range of object-related civil and engineering applications. However, the distribution of objects in HSR remote sensing imagery is location-variable and complicated, and how to accurately detect the objects in HSR remote sensing imagery is a critical problem. Due to the powerful feature extraction and representation capability of deep learning, the deep learning based region proposal generation and object detection integrated framework has greatly promoted the performance of multi-class geospatial object detection for HSR remote sensing imagery. However, due to the translation caused by the convolution operation in the convolutional neural network (CNN), although the performance of the classification stage is seldom influenced, the localization accuracies of the predicted bounding boxes in the detection stage are easily influenced. The dilemma between translation-invariance in the classification stage and translation-variance in the object detection stage has not been addressed for HSR remote sensing imagery, and causes position accuracy problems for multi-class geospatial object detection with region proposal generation and object detection. In order to further improve the performance of the region proposal generation and object detection integrated framework for HSR remote sensing imagery object detection, a position-sensitive balancing (PSB) framework is proposed in this paper for multi-class geospatial object detection from HSR remote sensing imagery. The proposed PSB framework takes full advantage of the fully convolutional network (FCN), on the basis of a residual network, and adopts the PSB framework to solve the dilemma between translation-invariance in the classification stage and translation-variance in the object detection stage. In addition, a pre-training mechanism is utilized to accelerate the training procedure

Neural network-based model reference adaptive control system.

Science.gov (United States)

Patino, H D; Liu, D

2000-01-01

In this paper, an approach to model reference adaptive control based on neural networks is proposed and analyzed for a class of first-order continuous-time nonlinear dynamical systems. The controller structure can employ either a radial basis function network or a feedforward neural network to compensate adaptively the nonlinearities in the plant. A stable controller-parameter adjustment mechanism, which is determined using the Lyapunov theory, is constructed using a sigma-modification-type updating law. The evaluation of control error in terms of the neural network learning error is performed. That is, the control error converges asymptotically to a neighborhood of zero, whose size is evaluated and depends on the approximation error of the neural network. In the design and analysis of neural network-based control systems, it is important to take into account the neural network learning error and its influence on the control error of the plant. Simulation results showing the feasibility and performance of the proposed approach are given.

A DUAL NETWORK MODEL OF INTERLOCKING DIRECTORATES

Directory of Open Access Journals (Sweden)

Humphry Hung

2003-01-01

Full Text Available The article proposes an integrative framework for the study of interlocking directorates by using an approach that encompasses the concepts of multiple networks and resource endowment. This serves to integrate the traditional views of interorganizational linkages and intra-class cohesion. Through appropriate strategic analysis of relevant resource endowment of internal environment and external networks of organizations and corporate elites, this article argues that the selection of directors, if used effectively, can be adopted as a strategic device to enhance the corporation's overall performance.

Origin of Peer Influence in Social Networks

Science.gov (United States)

Pinheiro, Flávio L.; Santos, Marta D.; Santos, Francisco C.; Pacheco, Jorge M.

2014-03-01

Social networks pervade our everyday lives: we interact, influence, and are influenced by our friends and acquaintances. With the advent of the World Wide Web, large amounts of data on social networks have become available, allowing the quantitative analysis of the distribution of information on them, including behavioral traits and fads. Recent studies of correlations among members of a social network, who exhibit the same trait, have shown that individuals influence not only their direct contacts but also friends' friends, up to a network distance extending beyond their closest peers. Here, we show how such patterns of correlations between peers emerge in networked populations. We use standard models (yet reflecting intrinsically different mechanisms) of information spreading to argue that empirically observed patterns of correlation among peers emerge naturally from a wide range of dynamics, being essentially independent of the type of information, on how it spreads, and even on the class of underlying network that interconnects individuals. Finally, we show that the sparser and clustered the network, the more far reaching the influence of each individual will be.

Transport Network Technologies – Study and Testing

DEFF Research Database (Denmark)

Bozorgebrahimi, K.; Channegowda, M.; Colmenero, A.

Following on from the theoretical research into Carrier Class Transport Network Technologies (CCTNTs) documented in DJ1.1.1, this report describes the extensive testing performed by JRA1 Task 1. The tests covered EoMPLS, Ethernet OAM, Synchronous Ethernet, PBB-TE, MPLS-TP, OTN and GMPLS...

Identification of Abnormal System Noise Temperature Patterns in Deep Space Network Antennas Using Neural Network Trained Fuzzy Logic

Science.gov (United States)

Lu, Thomas; Pham, Timothy; Liao, Jason

2011-01-01

This paper presents the development of a fuzzy logic function trained by an artificial neural network to classify the system noise temperature (SNT) of antennas in the NASA Deep Space Network (DSN). The SNT data were classified into normal, marginal, and abnormal classes. The irregular SNT pattern was further correlated with link margin and weather data. A reasonably good correlation is detected among high SNT, low link margin and the effect of bad weather; however we also saw some unexpected non-correlations which merit further study in the future.

Measuring Social Capital among First-Generation and Non-First-Generation, Working-Class, White Males

Science.gov (United States)

Moschetti, Roxanne; Hudley, Cynthia

2008-01-01

Social capital is a useful theory for understanding the experiences of working class, first-generation college students. Social capital is the value of a relationship that provides support and assistance in a given social situation. According to social capital theory, networks of relationships can aid students in managing an otherwise unfamiliar…

Reconstructing Genetic Regulatory Networks Using Two-Step Algorithms with the Differential Equation Models of Neural Networks.

Science.gov (United States)

Chen, Chi-Kan

2017-07-26

The identification of genetic regulatory networks (GRNs) provides insights into complex cellular processes. A class of recurrent neural networks (RNNs) captures the dynamics of GRN. Algorithms combining the RNN and machine learning schemes were proposed to reconstruct small-scale GRNs using gene expression time series. We present new GRN reconstruction methods with neural networks. The RNN is extended to a class of recurrent multilayer perceptrons (RMLPs) with latent nodes. Our methods contain two steps: the edge rank assignment step and the network construction step. The former assigns ranks to all possible edges by a recursive procedure based on the estimated weights of wires of RNN/RMLP (RE RNN /RE RMLP ), and the latter constructs a network consisting of top-ranked edges under which the optimized RNN simulates the gene expression time series. The particle swarm optimization (PSO) is applied to optimize the parameters of RNNs and RMLPs in a two-step algorithm. The proposed RE RNN -RNN and RE RMLP -RNN algorithms are tested on synthetic and experimental gene expression time series of small GRNs of about 10 genes. The experimental time series are from the studies of yeast cell cycle regulated genes and E. coli DNA repair genes. The unstable estimation of RNN using experimental time series having limited data points can lead to fairly arbitrary predicted GRNs. Our methods incorporate RNN and RMLP into a two-step structure learning procedure. Results show that the RE RMLP using the RMLP with a suitable number of latent nodes to reduce the parameter dimension often result in more accurate edge ranks than the RE RNN using the regularized RNN on short simulated time series. Combining by a weighted majority voting rule the networks derived by the RE RMLP -RNN using different numbers of latent nodes in step one to infer the GRN, the method performs consistently and outperforms published algorithms for GRN reconstruction on most benchmark time series. The framework of two

Social Network Misuse in the Classroom and Its Impact on Male Student Motivation in UAE Tertiary Education

Directory of Open Access Journals (Sweden)

Sultan A. Alkaabi

2017-08-01

Full Text Available This paper presents data obtained from focus groups conducted to investigate male students’ experiences in higher education in the United Arab Emirates. Among the issues discussed by students was the impact of social networks addiction on student motivation and this paper focuses on that issue. Thirteen focus groups were conducted with 83 English as a Foreign Language male students at four government campuses including United Arab Emirates University at Al Ain Campus, Higher College of Technology at Ras Al-Khaima Campus, and two campuses (Abu Dhabi and Dubai of Zayed University. Students access social network sites for both educational and non-educational aspects. Students spoke about their experiences and how social network addiction influenced their academic motivation to study. The resulting themes from the focus groups show that social network addiction has had an impact on student class performance and in some cases led to class failure. Recommendation for better class management and intervention programs are suggested to policy makers and instructors to foster a better student learning experience.

Logarithmic r-θ mapping for hybrid optical neural network filter for multiple objects recognition within cluttered scenes

Science.gov (United States)

Kypraios, Ioannis; Young, Rupert C. D.; Chatwin, Chris R.; Birch, Phil M.

2009-04-01

θThe window unit in the design of the complex logarithmic r-θ mapping for hybrid optical neural network filter can allow multiple objects of the same class to be detected within the input image. Additionally, the architecture of the neural network unit of the complex logarithmic r-θ mapping for hybrid optical neural network filter becomes attractive for accommodating the recognition of multiple objects of different classes within the input image by modifying the output layer of the unit. We test the overall filter for multiple objects of the same and of different classes' recognition within cluttered input images and video sequences of cluttered scenes. Logarithmic r-θ mapping for hybrid optical neural network filter is shown to exhibit with a single pass over the input data simultaneously in-plane rotation, out-of-plane rotation, scale, log r-θ map translation and shift invariance, and good clutter tolerance by recognizing correctly the different objects within the cluttered scenes. We record in our results additional extracted information from the cluttered scenes about the objects' relative position, scale and in-plane rotation.

47 CFR 73.6017 - Digital Class A TV station protection of Class A TV and digital Class A TV stations.

Science.gov (United States)

2010-10-01

... 47 Telecommunication 4 2010-10-01 2010-10-01 false Digital Class A TV station protection of Class A TV and digital Class A TV stations. 73.6017 Section 73.6017 Telecommunication FEDERAL... Broadcast Stations § 73.6017 Digital Class A TV station protection of Class A TV and digital Class A TV...

Modeling and Analysis of New Products Diffusion on Heterogeneous Networks

Directory of Open Access Journals (Sweden)

Shuping Li

2014-01-01

Full Text Available We present a heterogeneous networks model with the awareness stage and the decision-making stage to explain the process of new products diffusion. If mass media is neglected in the decision-making stage, there is a threshold whether the innovation diffusion is successful or not, or else it is proved that the network model has at least one positive equilibrium. For networks with the power-law degree distribution, numerical simulations confirm analytical results, and also at the same time, by numerical analysis of the influence of the network structure and persuasive advertisements on the density of adopters, we give two different products propagation strategies for two classes of nodes in scale-free networks.

Interspecific Competition Underlying Mutualistic Networks

Science.gov (United States)

Maeng, Seong Eun; Lee, Jae Woo; Lee, Deok-Sun

2012-03-01

Multiple classes of interactions may exist affecting one another in a given system. For the mutualistic networks of plants and pollinating animals, it has been known that the degree distribution is broad but often deviates from power-law form more significantly for plants than animals. To illuminate the origin of such asymmetry, we study a model network in which links are assigned under generalized preferential-selection rules between two groups of nodes and find the sensitive dependence of the resulting connectivity pattern on the model parameters. The nonlinearity of preferential selection can come from interspecific interactions among animals and among plants. The model-based analysis of real-world mutualistic networks suggests that a new animal determines its partners not only by their abundance but also under the competition with existing animal species, which leads to the stretched-exponential degree distributions of plants.

Modulation for emergent networks: serotonin and dopamine.

Science.gov (United States)

Weng, Juyang; Paslaski, Stephen; Daly, James; VanDam, Courtland; Brown, Jacob

2013-05-01

In autonomous learning, value-sensitive experiences can improve the efficiency of learning. A learning network needs be motivated so that the limited computational resources and the limited lifetime are devoted to events that are of high value for the agent to compete in its environment. The neuromodulatory system of the brain is mainly responsible for developing such a motivation system. Although reinforcement learning has been extensively studied, many existing models are symbolic whose internal nodes or modules have preset meanings. Neural networks have been used to automatically generate internal emergent representations. However, modeling an emergent motivational system for neural networks is still a great challenge. By emergent, we mean that the internal representations emerge autonomously through interactions with the external environments. This work proposes a generic emergent modulatory system for emergent networks, which includes two subsystems - the serotonin system and the dopamine system. The former signals a large class of stimuli that are intrinsically aversive (e.g., stress or pain). The latter signals a large class of stimuli that are intrinsically appetitive (e.g., pleasure or sweet). We experimented with this motivational system for two settings. The first is a visual recognition setting to investigate how such a system can learn through interactions with a teacher, who does not directly give answers, but only punishments and rewards. The second is a setting for wandering in the presence of a friend and a foe. Copyright © 2012 Elsevier Ltd. All rights reserved.

Class and ideological orientations revisited: an exploration of class-based mechanisms.

Science.gov (United States)

Bengtsson, Mattias; Berglund, Tomas; Oskarson, Maria

2013-12-01

Studies of the relationship between class position and political outlooks still only have a limited understanding of the class-related mechanisms that matter for ideological orientations. This article presents a comprehensive analysis of the mechanisms that link class position and left/right and authoritarian/libertarian orientations. Besides main factors such as income, career prospects, job security, education, class origin and class identification, the significance of work-related factors such as work autonomy, working in a team, a physically demanding job and a mentally demanding job is studied. The findings are based on a survey specifically designed for this purpose and collected in Sweden in 2008/2009. A great deal of the association between class position and left/right orientations is explained by socio-economic conditions; different classes sympathize with policies that will benefit them economically. Another important factor is class identification. Work-related factors also have relevance, but the effect of class position on left/right orientations works mainly through the remuneration system. Class position is also related to authoritarian/libertarian orientations. However, this relationship is less explained by socio-economic position per se, but is rather an effect of the educational system and its allocation of the workforce into different class positions. It also turns out that work-related factors do not explain the class effects; however, a physically demanding job shows a unique effect. Overall, our findings suggest that besides factors such as class position, income, education and class identification, we need to consider work-related aspects to derive a more complete understanding of the distribution of ideological orientations in Western societies. © London School of Economics and Political Science 2013.

Dynamics-based centrality for directed networks.

Science.gov (United States)

Masuda, Naoki; Kori, Hiroshi

2010-11-01

Determining the relative importance of nodes in directed networks is important in, for example, ranking websites, publications, and sports teams, and for understanding signal flows in systems biology. A prevailing centrality measure in this respect is the PageRank. In this work, we focus on another class of centrality derived from the Laplacian of the network. We extend the Laplacian-based centrality, which has mainly been applied to strongly connected networks, to the case of general directed networks such that we can quantitatively compare arbitrary nodes. Toward this end, we adopt the idea used in the PageRank to introduce global connectivity between all the pairs of nodes with a certain strength. Numerical simulations are carried out on some networks. We also offer interpretations of the Laplacian-based centrality for general directed networks in terms of various dynamical and structural properties of networks. Importantly, the Laplacian-based centrality defined as the stationary density of the continuous-time random walk with random jumps is shown to be equivalent to the absorption probability of the random walk with sinks at each node but without random jumps. Similarly, the proposed centrality represents the importance of nodes in dynamics on the original network supplied with sinks but not with random jumps.

What Is Middle Class about the Middle Classes around the World?

OpenAIRE

Abhijit V. Banerjee; Esther Duflo

2008-01-01

We expect a lot from the middle classes. At least three distinct arguments about the special economic role of the middle class are traditionally made. In one, new entrepreneurs armed with a capacity and a tolerance for delayed gratification emerge from the middle class and create employment and productivity growth for the rest of society. In a second, perhaps more conventional view, the middle class is primarily a source of vital inputs for the entrepreneurial class: it is their "middle class...

Distributed Network Protocols

Science.gov (United States)

1980-07-01

MONITORING AGENCY NAME & ADDRESS(II different from Controlting Office) IS. SECURITY CLASS. (of this report) S Office of Naval Research Unclassified...All protocols are extended to networks with changing. topology. S80 8 4 246 DD0I iA 1473 EDITION OF INOV 65 IS OBSOLETE 8 0 24 SECURITY CLASSIFICATION...to the netowrk . f) Each node knows its adjacent links, but not necessarily the identity of its neighbors, i.e. the nodes at the other end of the links

Integration of Continuous-Time Dynamics in a Spiking Neural Network Simulator

Directory of Open Access Journals (Sweden)

Jan Hahne

2017-05-01

Full Text Available Contemporary modeling approaches to the dynamics of neural networks include two important classes of models: biologically grounded spiking neuron models and functionally inspired rate-based units. We present a unified simulation framework that supports the combination of the two for multi-scale modeling, enables the quantitative validation of mean-field approaches by spiking network simulations, and provides an increase in reliability by usage of the same simulation code and the same network model specifications for both model classes. While most spiking simulations rely on the communication of discrete events, rate models require time-continuous interactions between neurons. Exploiting the conceptual similarity to the inclusion of gap junctions in spiking network simulations, we arrive at a reference implementation of instantaneous and delayed interactions between rate-based models in a spiking network simulator. The separation of rate dynamics from the general connection and communication infrastructure ensures flexibility of the framework. In addition to the standard implementation we present an iterative approach based on waveform-relaxation techniques to reduce communication and increase performance for large-scale simulations of rate-based models with instantaneous interactions. Finally we demonstrate the broad applicability of the framework by considering various examples from the literature, ranging from random networks to neural-field models. The study provides the prerequisite for interactions between rate-based and spiking models in a joint simulation.

Integration of Continuous-Time Dynamics in a Spiking Neural Network Simulator.

Science.gov (United States)

Hahne, Jan; Dahmen, David; Schuecker, Jannis; Frommer, Andreas; Bolten, Matthias; Helias, Moritz; Diesmann, Markus

2017-01-01

Contemporary modeling approaches to the dynamics of neural networks include two important classes of models: biologically grounded spiking neuron models and functionally inspired rate-based units. We present a unified simulation framework that supports the combination of the two for multi-scale modeling, enables the quantitative validation of mean-field approaches by spiking network simulations, and provides an increase in reliability by usage of the same simulation code and the same network model specifications for both model classes. While most spiking simulations rely on the communication of discrete events, rate models require time-continuous interactions between neurons. Exploiting the conceptual similarity to the inclusion of gap junctions in spiking network simulations, we arrive at a reference implementation of instantaneous and delayed interactions between rate-based models in a spiking network simulator. The separation of rate dynamics from the general connection and communication infrastructure ensures flexibility of the framework. In addition to the standard implementation we present an iterative approach based on waveform-relaxation techniques to reduce communication and increase performance for large-scale simulations of rate-based models with instantaneous interactions. Finally we demonstrate the broad applicability of the framework by considering various examples from the literature, ranging from random networks to neural-field models. The study provides the prerequisite for interactions between rate-based and spiking models in a joint simulation.

A Virtual Class Calculus

DEFF Research Database (Denmark)

Ernst, Erik; Ostermann, Klaus; Cook, William Randall

2006-01-01

Virtual classes are class-valued attributes of objects. Like virtual methods, virtual classes are defined in an object's class and may be redefined within subclasses. They resemble inner classes, which are also defined within a class, but virtual classes are accessed through object instances...... model for virtual classes has been a long-standing open question. This paper presents a virtual class calculus, vc, that captures the essence of virtual classes in these full-fledged programming languages. The key contributions of the paper are a formalization of the dynamic and static semantics of vc...

Sustainable Performance in Energy Harvesting - Wireless Sensor Networks

DEFF Research Database (Denmark)

Fafoutis, Xenofon; Di Mauro, Alessio; Dragoni, Nicola

2013-01-01

In this practical demo we illustrate the concept of "sustainable performance" in Energy-Harvesting Wireless Sensor Networks (EH-WSNs). In particular, for different classes of applications and under several energy harvesting scenarios, we show how it is possible to have sustainable performance when...

Network Design in Reverse Logistics: A Quantitative Model

NARCIS (Netherlands)

Krikke, H.R.; Kooij, E.J.; Schuur, Peter; Speranza, M. Grazia; Stähly, Paul

1999-01-01

The introduction of (extended) producer responsibility forces Original Equipment Manufacturers to solve entirely new managerial problems. One of the issues concerns the physical design of the reverse logistic network, which is a problem that fits into the class of facility-location problems. Since

Sustained oscillations, irregular firing and chaotic dynamics in hierarchical modular networks with mixtures of electrophysiological cell types

Directory of Open Access Journals (Sweden)

Petar eTomov

2014-09-01

Full Text Available The cerebral cortex exhibits neural activity even in the absence of externalstimuli. This self-sustained activity is characterized by irregular firing ofindividual neurons and population oscillations with a broad frequency range.Questions that arise in this context, are: What are the mechanismsresponsible for the existence of neuronal spiking activity in the cortexwithout external input? Do these mechanisms depend on the structural organization of the cortical connections? Do they depend onintrinsic characteristics of the cortical neurons? To approach the answers to these questions, we have used computer simulations of cortical network models. Our networks have hierarchical modular architecture and are composedof combinations of neuron models that reproduce the firing behavior of the five main cortical electrophysiological cell classes: regular spiking (RS, chattering (CH, intrinsically bursting (IB, low threshold spiking (LTS and fast spiking (FS. The population of excitatory neurons is built of RS cells(always present and either CH or IB cells. Inhibitoryneurons belong to the same class, either LTS or FS. Long-lived self-sustained activity states in our networksimulations display irregular single neuron firing and oscillatoryactivity similar to experimentally measured ones. The duration of self-sustained activity strongly depends on the initial conditions,suggesting a transient chaotic regime. Extensive analysis of the self-sustainedactivity states showed that their lifetime expectancy increases with the numberof network modules and is favored when the network is composed of excitatory neurons of the RS and CH classes combined with inhibitory neurons of the LTS class. These results indicate that the existence and properties of the self-sustained cortical activity states depend on both the topology of the network and the neuronal mixture that comprises the network.

Inferring a Drive-Response Network from Time Series of Topological Measures in Complex Networks with Transfer Entropy

Directory of Open Access Journals (Sweden)

Xinbo Ai

2014-11-01

Full Text Available Topological measures are crucial to describe, classify and understand complex networks. Lots of measures are proposed to characterize specific features of specific networks, but the relationships among these measures remain unclear. Taking into account that pulling networks from different domains together for statistical analysis might provide incorrect conclusions, we conduct our investigation with data observed from the same network in the form of simultaneously measured time series. We synthesize a transfer entropy-based framework to quantify the relationships among topological measures, and then to provide a holistic scenario of these measures by inferring a drive-response network. Techniques from Symbolic Transfer Entropy, Effective Transfer Entropy, and Partial Transfer Entropy are synthesized to deal with challenges such as time series being non-stationary, finite sample effects and indirect effects. We resort to kernel density estimation to assess significance of the results based on surrogate data. The framework is applied to study 20 measures across 2779 records in the Technology Exchange Network, and the results are consistent with some existing knowledge. With the drive-response network, we evaluate the influence of each measure by calculating its strength, and cluster them into three classes, i.e., driving measures, responding measures and standalone measures, according to the network communities.

Analysis of complex networks using aggressive abstraction.

Energy Technology Data Exchange (ETDEWEB)

Colbaugh, Richard; Glass, Kristin.; Willard, Gerald

2008-10-01

This paper presents a new methodology for analyzing complex networks in which the network of interest is first abstracted to a much simpler (but equivalent) representation, the required analysis is performed using the abstraction, and analytic conclusions are then mapped back to the original network and interpreted there. We begin by identifying a broad and important class of complex networks which admit abstractions that are simultaneously dramatically simplifying and property preserving we call these aggressive abstractions -- and which can therefore be analyzed using the proposed approach. We then introduce and develop two forms of aggressive abstraction: 1.) finite state abstraction, in which dynamical networks with uncountable state spaces are modeled using finite state systems, and 2.) onedimensional abstraction, whereby high dimensional network dynamics are captured in a meaningful way using a single scalar variable. In each case, the property preserving nature of the abstraction process is rigorously established and efficient algorithms are presented for computing the abstraction. The considerable potential of the proposed approach to complex networks analysis is illustrated through case studies involving vulnerability analysis of technological networks and predictive analysis for social processes.

On the dynamics of a gene regulatory network

International Nuclear Information System (INIS)

Grammaticos, B; Carstea, A S; Ramani, A

2006-01-01

We examine the dynamics of a network of genes focusing on a periodic chain of genes, of arbitrary length. We show that within a given class of sigmoids representing the equilibrium probability of the binding of the RNA polymerase to the core promoter, the system possesses a single stable fixed point. By slightly modifying the sigmoid, introducing 'stiffer' forms, we show that it is possible to find network configurations exhibiting bistable behaviour. Our results do not depend crucially on the length of the chain considered: calculations with finite chains lead to similar results. However, a realistic study of regulatory genetic networks would require the consideration of more complex topologies and interactions

Structural Observability and Sensor Node Selection for Complex Networks Governed by Nonlinear Balance Equations

NARCIS (Netherlands)

Kawano, Yu; Cao, Ming

2017-01-01

We define and then study the structural observability for a class of complex networks whose dynamics are governed by the nonlinear balance equations. Although related notions of observability of such complex networks have been studied before and in particular, necessary conditions have been reported