Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
National Research Council Canada - National Science Library
Royset, Johannes O; Wood, R. K
2006-01-01
...." In this problem, an "interdictor" seeks to interdict (destroy) a set of arcs in a capacitated network that are Pareto-optimal with respect to two objectives, minimizing total interdiction cost and minimizing maximum flow...
Shortest-Path Network Interdiction
National Research Council Canada - National Science Library
Israeli, Eltan; Wood, R. K
2002-01-01
We study the problem of interdicting the arcs in a network in order to maximize the shortest s-t path length "Interdiction" is an attack on an arc that destroys the arc or increases its effective length...
Energy Technology Data Exchange (ETDEWEB)
Pan, Feng [Los Alamos National Laboratory; Kasiviswanathan, Shiva [Los Alamos National Laboratory
2010-01-01
In the matrix interdiction problem, a real-valued matrix and an integer k is given. The objective is to remove k columns such that the sum over all rows of the maximum entry in each row is minimized. This combinatorial problem is closely related to bipartite network interdiction problem which can be applied to prioritize the border checkpoints in order to minimize the probability that an adversary can successfully cross the border. After introducing the matrix interdiction problem, we will prove the problem is NP-hard, and even NP-hard to approximate with an additive n{gamma} factor for a fixed constant {gamma}. We also present an algorithm for this problem that achieves a factor of (n-k) mUltiplicative approximation ratio.
Decentralized Network Interdiction Games
2015-12-31
AFRL-AFOSR-VA-TR-2016-0169 Decentralized Network Interdiction Games Andrew Liu PURDUE UNIVERSITY Final Report 01/13/2016 DISTRIBUTION A: Distribution...Interdiction Games 5a. CONTRACT NUMBER N/A 5b. GRANT NUMBER FA9550-12-1-0275 5c. PROGRAM ELEMENT NUMBER N/A 6. AUTHOR(S) Andrew L. Liu (PI...project established the theoretical and computational foundation for a new class of games , termed as the multi-interdictor network games (MINGs
Constrained Graph Optimization: Interdiction and Preservation Problems
Energy Technology Data Exchange (ETDEWEB)
Schild, Aaron V [Los Alamos National Laboratory
2012-07-30
The maximum flow, shortest path, and maximum matching problems are a set of basic graph problems that are critical in theoretical computer science and applications. Constrained graph optimization, a variation of these basic graph problems involving modification of the underlying graph, is equally important but sometimes significantly harder. In particular, one can explore these optimization problems with additional cost constraints. In the preservation case, the optimizer has a budget to preserve vertices or edges of a graph, preventing them from being deleted. The optimizer wants to find the best set of preserved edges/vertices in which the cost constraints are satisfied and the basic graph problems are optimized. For example, in shortest path preservation, the optimizer wants to find a set of edges/vertices within which the shortest path between two predetermined points is smallest. In interdiction problems, one deletes vertices or edges from the graph with a particular cost in order to impede the basic graph problems as much as possible (for example, delete edges/vertices to maximize the shortest path between two predetermined vertices). Applications of preservation problems include optimal road maintenance, power grid maintenance, and job scheduling, while interdiction problems are related to drug trafficking prevention, network stability assessment, and counterterrorism. Computational hardness results are presented, along with heuristic methods for approximating solutions to the matching interdiction problem. Also, efficient algorithms are presented for special cases of graphs, including on planar graphs. The graphs in many of the listed applications are planar, so these algorithms have important practical implications.
Modeling Network Interdiction Tasks
2015-09-17
allow professionals and families to stay in touch through voice or video calls. Power grids provide electricity to homes , offices, and recreational...instances using IBMr ILOGr CPLEXr Optimization Studio V12.6. For each instance, two solutions are deter- mined. First, the MNDP-a model is solved with no...three values: 0.25, 0.50, or 0.75. The DMP-a model is solved for the various random network instances using IBMr ILOGr CPLEXr Optimization Studio V12.6
Network interdiction and stochastic integer programming
2003-01-01
On March 15, 2002 we held a workshop on network interdiction and the more general problem of stochastic mixed integer programming at the University of California, Davis. Jesús De Loera and I co-chaired the event, which included presentations of on-going research and discussion. At the workshop, we decided to produce a volume of timely work on the topics. This volume is the result. Each chapter represents state-of-the-art research and all of them were refereed by leading investigators in the respective fields. Problems - sociated with protecting and attacking computer, transportation, and social networks gain importance as the world becomes more dep- dent on interconnected systems. Optimization models that address the stochastic nature of these problems are an important part of the research agenda. This work relies on recent efforts to provide methods for - dressing stochastic mixed integer programs. The book is organized with interdiction papers first and the stochastic programming papers in the second part....
Synthesis, Interdiction, and Protection of Layered Networks
2009-09-01
and explore social networks. [124] In addition, the field of operations research has incorporated many of these techniques and developed the foundation...to be discussed in Section 2.3.7.3. Because different aspects of this foundation are explored , various subsets are dis- cussed including multiojective...National Strategy to Secure Cyberspace which was reviewed in Section 2.2.8.2. Infrastructures are geographically interdependent if they are in close spacial
Optimal interdiction of unreactive Markovian evaders
Energy Technology Data Exchange (ETDEWEB)
Hagberg, Aric [Los Alamos National Laboratory; Pan, Feng [Los Alamos National Laboratory; Gutfraind, Alex [CORNELL UNIV.
2009-01-01
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdiction. the task of the interdictor is to find a set of edges in a weighted network such that the removal of those edges would increase the cost to an evader of traveling on a path through the network. Our work is motivated by cases in which the evader has incomplete information about the network or lacks planning time or computational power, e.g. when authorities set up roadblocks to catch bank robbers, the criminals do not know all the roadblock locations or the best path to use for their escape. We introduce a model of network interdiction in which the motion of one or more evaders is described by Markov processes on a network and the evaders are assumed not to react to interdiction decisions. The interdiction objective is to find a node or set. of size at most B, that maximizes the probability of capturing the evaders. We prove that similar to the classical formulation this interdiction problem is NP-hard. But unlike the classical problem our interdiction problem is submodular and the optimal solution can be approximated within 1-lie using a greedy algorithm. Additionally. we exploit submodularity to introduce a priority evaluation strategy that speeds up the greedy algorithm by orders of magnitude. Taken together the results bring closer the goal of finding realistic solutions to the interdiction problem on global-scale networks.
Interdiction of a Markovian evader
Energy Technology Data Exchange (ETDEWEB)
Hagberg, Aric [Los Alamos National Laboratory; Izraelevitz, David [Los Alamos National Laboratory; Pan, Feng [Los Alamos National Laboratory; Gutfraind, Alexander [CORNELL UNIV
2008-01-01
Network interdiction is a combinatorial optimization problem on an activity network arising in a number of important security-related applications. It is classically formulated as a bilevel maximin problem representing an 'interdictor' and an 'evader'. The evader tries to move from a source node to the target node along the shortest or safest path while the interdictor attempts to frustrate this motion by cutting edges or nodes. The interdiction objective is to find the optimal set of edges to cut given that there is a finite interdiction budget and the interdictor must move first. We reformulate the interdiction problem for stochastic evaders by introducing a model in which the evader follows a Markovian random walk guided by the least-cost path to the target. This model can represent incomplete knowledge about the evader and the graph as well as partial interdiction. We formulate the optimization problem for this model and show how, by exploiting topological ordering of the nodes, one can achieve an order-of-magnitude speedup in computing the objective function. We also introduce an evader-motion-based heuristic that can significantly improve solution quality by providing a global view of the network to approximation methods.
2015-03-01
biometric data collection. Capture role- player mock biometric data including finger prints, iris scans, and facial recognition photos. (MOC training...boarded vessel used the SEEK II to collect biometrics including fingerprints, iris scans, and facial recognition photos. Following system setup and...MARITIME INFORMATION DOMINANCE: OPTIMIZING TACTICAL NETWORK FOR BIOMETRIC DATA SHARING IN MARITIME INTERDICTION OPERATIONS by Adam R. Sinsel
Sanjab, Anibal; Saad, Walid; Başar, Tamer
2017-01-01
The use of unmanned aerial vehicles (UAVs) as delivery systems of online goods is rapidly becoming a global norm, as corroborated by Amazon's "Prime Air" and Google's "Project Wing" projects. However, the real-world deployment of such drone delivery systems faces many cyber-physical security challenges. In this paper, a novel mathematical framework for analyzing and enhancing the security of drone delivery systems is introduced. In this regard, a zero-sum network interdiction game is formulat...
Network-Centric Maritime Radiation Awareness and Interdiction Experiments: C2 Experimentation
Energy Technology Data Exchange (ETDEWEB)
Bordetsky, A; Dougan, A D; Nekoogar, F
2006-08-07
The paper addresses technological and operational challenges of developing a global plug-and-play Maritime Domain Security testbed for the Global War on Terrorism mission. This joint NPS-LLNL project is based on the NPS Tactical Network Topology (TNT) composed of long-haul OFDM networks combined with self-forming wireless mesh links to air, surface, ground, and underwater unmanned vehicles. This long-haul network is combined with ultra-wideband (UWB) communications systems for wireless communications in harsh radio propagation channels. LLNL's UWB communication prototypes are designed to overcome shortcomings of the present narrowband communications systems in heavy metallic and constricted corridors inside ships. In the center of our discussion are networking solutions for the Maritime Interdiction Operation (MIO) Experiments in which geographically distributed command centers and subject matter experts collaborate with the Boarding Party in real time to facilitate situational understanding and course of action selection. The most recent experiment conducted via the testbed extension to the Alameda Island exercised several key technologies aimed at improving MIO. These technologies included UWB communications from within the ship to Boarding Party leader sending data files and pictures, advanced radiation detection equipment for search and identification, biometric equipment to record and send fingerprint files to facilitate rapid positive identification of crew members, and the latest updates of the NPS Tactical Network Topology facilitating reachback to LLNL, Biometric Fusion Center, USCG, and DTRA experts.
Disrupting Cocaine Trafficking Networks: Interdicting a Combined Social-Functional Network Model
2016-03-01
changing strategic environment, a new operational-strategic approach for countering drug trafficking from Latin America is warranted—one that seeks...interdiction assets, this thesis suggests that a different operational-strategic approach for countering drug trafficking from Latin America is... America and Mexico is multi-modal, but these are not separated due to the common geography of the routes. Importation across the U.S.-Mexico border is
2016-09-09
Combat creates demands on fielded forces and speeds consumption of vital war materiel. This in turn increases the effectiveness of interdiction...they may be forced to use up stockpiles reserved for ongoing or future operations. Second, high consumption drives an enemy to use more direct...rail yards, harbors, and airfields. If forces or supplies are critically needed at the front, the enemy may not have the luxury of dispersing them
Maritime Interdiction Operations Small Craft Detection
Dougan, A.; Trombino, D.; Bordetsky, A.; Dunlop, W.
2010-01-01
The Naval Postgraduate School has been conducting Tactical Network Topology (TNT) Maritime Interdiction Operations (MIO) experiments with Lawrence Livermore National Laboratory (LLNL) since early in 2005. In this work, we are investigating cutting edge technology to evaluate use of networks, advanced sensors and collaborative technology for globally-supported maritime interdiction operations. Some examples of our research include communications in harsh environments, ...
Evader Interdiction and Collateral Damage
Energy Technology Data Exchange (ETDEWEB)
Gutfraind, Alexander [Los Alamos National Laboratory
2011-01-01
In network interdiction problems, evaders (hostile agents or data packets) are moving through a network towards their targets and we wish to choose sensor placement locations in order to intercept them before they reach their destinations. Sensor locations should be chosen economically, balancing security gains with cost, including the inconvenience sensors inflict upon innocent travelers. We give optimal sensor allocation algorithms for several classes of special graphs and hardness and optimal approximation results for general graphs, including for deterministic or Markov chain-based and oblivious or reactive evaders. In a similar-sounding but much different problem setting posed by [10] where the innocent travelers can also be reactive, we again give optimal algorithms for special cases and hardness and (essentially) optimal approximation results on general graphs.
Maritime drug interdiction in international law
Kruit, P.J.J. van der
2007-01-01
The study focuses on the interdiction of trafficking in illicit drugs at sea as one part of the general problem of illicit drug trafficking. More specifically, the study focuses on the legal framework for the interdiction of illicit maritime drug trafficking under international law. Firstly, the
The Threshold Shortest Path Interdiction Problem for Critical Infrastructure Resilience Analysis
2017-09-01
changes as a result of damage sustained by the system. The ability tomodel and analyze these networks and evaluate the impact to operations caused 2 by...offered in the past by pizza delivery stores. A pizza parlor provides a delivery service to people living within a certain range from the restaurant ...disruptions that are outside of the pizza parlor’s control. Given this data, the owner of the restaurant can make decisions on offering the guarantee
Ad-Hoc Sensor Networks for Maritime Interdiction Operations and Regional Security
2012-09-01
15 Figure 6. Multi-hop relay in a network (Image from Nomadic Technologies website...the militia in Somalia ), or individual crews refuse to comply with international law and threaten security and peace, not only in a particular...difficult. An example is a smart buoy node in a sea area: the lifetime of that node depends on the battery life or fuel cell, thus the minimization of
Bicriteria network design problems
Energy Technology Data Exchange (ETDEWEB)
Marathe, M.V.; Ravi, R.; Sundaram, R.; Ravi, S.S.; Rosenkrantz, D.J.; Hunt, H.B. III
1994-12-31
We study several bicriteria network design problems phrased as follows: given an undirected graph and two minimization objectives with a budget specified on one objective, find a subgraph satisfying certain connectivity requirements that minimizes the second objective subject to the budget on the first. Define an ({alpha}, {beta})-approximation algorithm as a polynomial-time algorithm that produces a solution in which the first objective value is at most {alpha} times the budget, and the second objective value is at most {alpha} times the minimum cost of a network obeying the budget oil the first objective. We, present the first approximation algorithms for bicriteria problems obtained by combining classical minimization objectives such as the total edge cost of the network, the diameter of the network and a weighted generalization of the maximum degree of any node in the network. We first develop some formalism related to bicriteria problems that leads to a clean way to state bicriteria approximation results. Secondly, when the two objectives are similar but only differ based on the cost function under which they are computed we present a general parametric search technique that yields approximation algorithms by reducing the problem to one of minimizing a single objective of the same type. Thirdly, we present an O(log n, log n)-approximation algorithm for finding a diameter-constrained minimum cost spanning tree of an undirected graph on n nodes generalizing the notion of shallow, light trees and light approximate shortest-path trees that have been studied before. Finally, for the class of treewidth-bounded graphs, we provide pseudopolynomial-time algorithms for a number of bicriteria problems using dynamic programming. These pseudopolynomial-time algorithms can be converted to fully polynomial-time approximation schemes using a scaling technique.
Two Runway Interdiction Problems (Revisited)
2011-09-01
shape, 6 EAF—Rectangle enclosing AF with sides ELR, EWR , 1 ELR—Length of rectangle EAF, ELR = LR + 2A, 1 EWR —Width of rectangle EAF, EWR = WR+ 2A, 1 F...by a rectangle, EAF, with dimensions (ELR x EWR ), where ELR = LR + 2A, and EWR = WR+ 2A, so that AF is damaged if and only if the bomb’s hit point is
CAS, interdiction, and attack helicopters
Groenke, Andrew S.
2005-01-01
Within days of a major failed strike by attack helicopters during Operation Iraqi Freedom (OIF) analysts were questioning the value of such platforms on the modern battlefield. As OIF moved from combat to stability operations, helicopter losses from enemy action actually increased seemingly strengthening the argument of those who see the helicopter as unsuitable to some combat operations. Attack helicopter operations have diverged into two distinct categories, interdiction and close air sup...
Unity of Command and Interdiction
1994-07-01
all Allied air forces in late February of 1943. The Northwest Africa Tactical Air Force under RAF Vice Air Marshal Sir Arthur Coningham provided the...US armies met stiff air attack from IXth, XIXth, and RAF aircraft on 7 August that halted the initial advance and contributed to a German withdrawal...for interdiction, long range and large payload." AirLand Battle and Deep Operations There is an old story of Custer departing for Little Big Horn and
Networks in social policy problems
Scotti, marco
2012-01-01
Network science is the key to managing social communities, designing the structure of efficient organizations and planning for sustainable development. This book applies network science to contemporary social policy problems. In the first part, tools of diffusion and team design are deployed to challenges in adoption of ideas and the management of creativity. Ideas, unlike information, are generated and adopted in networks of personal ties. Chapters in the second part tackle problems of power and malfeasance in political and business organizations, where mechanisms in accessing and controlling informal networks often outweigh formal processes. The third part uses ideas from biology and physics to understand global economic and financial crises, ecological depletion and challenges to energy security. Ideal for researchers and policy makers involved in social network analysis, business strategy and economic policy, it deals with issues ranging from what makes public advisories effective to how networks influenc...
Interdicting a Nuclear-Weapons Project
National Research Council Canada - National Science Library
Brown, Gerald; Carlyle, Matthew; Harney, Robert; Skroch, Eric; Wood, Kevin
2007-01-01
.... We develop and solve a max-min model that identifies resource-limited interdiction actions that maximally delay completion time of the proliferator's weapons project, given that the proliferator will...
Energy Technology Data Exchange (ETDEWEB)
Santhi, Nandakishore [Los Alamos National Laboratory; Pan, Feng [Los Alamos National Laboratory
2010-10-19
Several scenarios exist in the modern interconnected world which call for an efficient network interdiction algorithm. Applications are varied, including various monitoring and load shedding applications on large smart energy grids, computer network security, preventing the spread of Internet worms and malware, policing international smuggling networks, and controlling the spread of diseases. In this paper we consider some natural network optimization questions related to the budget constrained interdiction problem over general graphs, specifically focusing on the sensor/switch placement problem for large-scale energy grids. Many of these questions turn out to be computationally hard to tackle. We present a particular form of the interdiction question which is practically relevant and which we show as computationally tractable. A polynomial-time algorithm will be presented for solving this problem.
Optimized passive sonar placement to allow improved interdiction
Johnson, Bruce A.; Matthews, Cameron
2016-05-01
The Art Gallery Problem (AGP) is the name given to a constrained optimization problem meant to determine the maximum amount of sensor coverage while utilizing the minimum number of resources. The AGP is significant because a common issue among surveillance and interdiction systems is obtaining an understanding of the optimal position of sensors and weapons in advance of enemy combatant maneuvers. The implication that an optimal position for a sensor to observe an event or for a weapon to engage a target autonomously is usually very clear after the target has passed, but for autonomous systems the solution must at least be conjectured in advance for deployment purposes. This abstract applies the AGP as a means to solve where best to place underwater sensor nodes such that the amount of information acquired about a covered area is maximized while the number of resources used to gain that information is minimized. By phrasing the ISR/interdiction problem this way, the issue is addressed as an instance of the AGP. The AGP is a member of a set of computational problems designated as nondeterministic polynomial-time (NP)-hard. As a member of this set, the AGP shares its members' defining feature, namely that no one has proven that there exists a deterministic algorithm providing a computationally-tractable solution to the AGP within a finite amount of time. At best an algorithm meant to solve the AGP can asymptotically approach perfect coverage with minimal resource usage but providing perfect coverage would either break the minimal resource usage constraint or require an exponentially-growing amount of time. No perfectly-optimal solution yet exists to the AGP, however, approximately optimal solutions to the AGP can approach complete area or barrier coverage while simultaneously minimizing the number of sensors and weapons utilized. A minimal number of underwater sensor nodes deployed can greatly increase the Mean Time Between Operational Failure (MTBOF) and logistical
Problem Lokalitas dalam Bisnis Radio Network
Directory of Open Access Journals (Sweden)
- Rahayu
2006-03-01
Full Text Available The emergence of radio network has some consequencies. These relate to the ownership of the network, problems of locality and threads to democracy. Some may view that the networks have strengthened the position of radio. The others believe that the netwrok risks the local power in Indonesia. This article explores the problems of the radio networks in Indonesia, especially when dealing with the local elements.
Controller placement problem in industrial networks
Macián Ribera, Sergi
2016-01-01
SDN is the new trend in networks, for next Mobile and optical networks. Dimensioning, design and optimization of Software Defined Optical Networks. To be done at Technical University Munich (TUM) In this work the Controller Placement Problem (CPP) for SDN architecture is studied when it is applied to industrial networks. En este trabajo se estudia el problema CPP (controller placement problem) para la arquitectura SDN, aplicado a redes industriales. En aquest treball s'estudia el pro...
Networks in Social Policy Problems
Vedres, Balázs; Scotti, Marco
2012-08-01
1. Introduction M. Scotti and B. Vedres; Part I. Information, Collaboration, Innovation: The Creative Power of Networks: 2. Dissemination of health information within social networks C. Dhanjal, S. Blanchemanche, S. Clemençon, A. Rona-Tas and F. Rossi; 3. Scientific teams and networks change the face of knowledge creation S. Wuchty, J. Spiro, B. F. Jones and B. Uzzi; 4. Structural folds: the innovative potential of overlapping groups B. Vedres and D. Stark; 5. Team formation and performance on nanoHub: a network selection challenge in scientific communities D. Margolin, K. Ognyanova, M. Huang, Y. Huang and N. Contractor; Part II. Influence, Capture, Corruption: Networks Perspectives on Policy Institutions: 6. Modes of coordination of collective action: what actors in policy making? M. Diani; 7. Why skewed distributions of pay for executives is the cause of much grief: puzzles and few answers so far B. Kogut and J.-S. Yang; 8. Networks of institutional capture: a case of business in the State apparatus E. Lazega and L. Mounier; 9. The social and institutional structure of corruption: some typical network configurations of corruption transactions in Hungary Z. Szántó, I. J. Tóth and S. Varga; Part III. Crisis, Extinction, World System Change: Network Dynamics on a Large Scale: 10. How creative elements help the recovery of networks after crisis: lessons from biology A. Mihalik, A. S. Kaposi, I. A. Kovács, T. Nánási, R. Palotai, Á. Rák, M. S. Szalay-Beko and P. Csermely; 11. Networks and globalization policies D. R. White; 12. Network science in ecology: the structure of ecological communities and the biodiversity question A. Bodini, S. Allesina and C. Bondavalli; 13. Supply security in the European natural gas pipeline network M. Scotti and B. Vedres; 14. Conclusions and outlook A.-L. Barabási; Index.
Integrated network design and scheduling problems :
Energy Technology Data Exchange (ETDEWEB)
Nurre, Sarah G.; Carlson, Jeffrey J.
2014-01-01
We consider the class of integrated network design and scheduling problems. These problems focus on selecting and scheduling operations that will change the characteristics of a network, while being speci cally concerned with the performance of the network over time. Motivating applications of INDS problems include infrastructure restoration after extreme events and building humanitarian distribution supply chains. While similar models have been proposed, no one has performed an extensive review of INDS problems from their complexity, network and scheduling characteristics, information, and solution methods. We examine INDS problems under a parallel identical machine scheduling environment where the performance of the network is evaluated by solving classic network optimization problems. We classify that all considered INDS problems as NP-Hard and propose a novel heuristic dispatching rule algorithm that selects and schedules sets of arcs based on their interactions in the network. We present computational analysis based on realistic data sets representing the infrastructures of coastal New Hanover County, North Carolina, lower Manhattan, New York, and a realistic arti cial community CLARC County. These tests demonstrate the importance of a dispatching rule to arrive at near-optimal solutions during real-time decision making activities. We extend INDS problems to incorporate release dates which represent the earliest an operation can be performed and exible release dates through the introduction of specialized machine(s) that can perform work to move the release date earlier in time. An online optimization setting is explored where the release date of a component is not known.
Cascading Effects of Fuel Network Interdiction
2015-03-26
amongst the Allied Armies during this period are still debated by historians (Yergin, 1992: 386-388). The Suez Crisis in 1956 demonstrated the...liability of reliance on petroleum tanker maritime traffic during the Egyptian seizure of the Suez Canal. More significantly, this crisis also provided...Yergin, 1992: 496). The net impact of this aspect of the Suez conflict was the demonstration of global dependency 3 on petroleum stock supplies
Neural Network Solves "Traveling-Salesman" Problem
Thakoor, Anilkumar P.; Moopenn, Alexander W.
1990-01-01
Experimental electronic neural network solves "traveling-salesman" problem. Plans round trip of minimum distance among N cities, visiting every city once and only once (without backtracking). This problem is paradigm of many problems of global optimization (e.g., routing or allocation of resources) occuring in industry, business, and government. Applied to large number of cities (or resources), circuits of this kind expected to solve problem faster and more cheaply.
Generalized network improvement and packing problems
Holzhauser, Michael
2016-01-01
Michael Holzhauser discusses generalizations of well-known network flow and packing problems by additional or modified side constraints. By exploiting the inherent connection between the two problem classes, the author investigates the complexity and approximability of several novel network flow and packing problems and presents combinatorial solution and approximation algorithms. Contents Fractional Packing and Parametric Search Frameworks Budget-Constrained Minimum Cost Flows: The Continuous Case Budget-Constrained Minimum Cost Flows: The Discrete Case Generalized Processing Networks Convex Generalized Flows Target Groups Researchers and students in the fields of mathematics, computer science, and economics Practitioners in operations research and logistics The Author Dr. Michael Holzhauser studied computer science at the University of Kaiserslautern and is now a research fellow in the Optimization Research Group at the Department of Mathematics of the University of Kaiserslautern.
75 FR 67011 - Continuation of U.S. Drug Interdiction Assistance to the Government of Colombia
2010-11-01
..., 2010 Continuation of U.S. Drug Interdiction Assistance to the Government of Colombia Memorandum for the..., with respect to Colombia, that (1) interdiction of aircraft reasonably suspected to be primarily...
2011-07-19
... Information Collection; Smuggling, Interdiction, and Trade Compliance Program; Smuggling Form AGENCY: Animal... Inspection Service's intention to initiate an information collection to support our smuggling, interdiction... (202) 690-2817 before coming. FOR FURTHER INFORMATION CONTACT: For information on the smuggling...
The Generalized Fixed-Charge Network Design Problem
DEFF Research Database (Denmark)
Thomadsen, Tommy; Stidsen, Thomas K.
2007-01-01
In this paper we present the generalized fixed-charge network design (GFCND) problem. The GFCND problem is an instance of the so-called generalized network design problems. In such problems, clusters instead of nodes have to be interconnected by a network. The network interconnecting the clusters...... is a fixed-charge network, and thus the GFCND problem generalizes the fixed-charge network design problem. The GFCND problem is related to the more general problem of designing hierarchical telecommunication networks. A mixed integer programming model is described and a branch-cut-and-price algorithm...... is implemented. Violated constraints and variables with negative reduced costs are found using enumeration. The algorithm is capable of obtaining optimal solutions for problems with up to 30 clusters and up to 300 nodes. This is possible, since the linear programming relaxation bound is very tight...
77 FR 50557 - Continuation of U.S. Drug Interdiction Assistance to the Government of Colombia
2012-08-21
...--Continuation of U.S. Drug Interdiction Assistance to the Government of Colombia #0; #0; #0; Presidential..., 2012 Continuation of U.S. Drug Interdiction Assistance to the Government of Colombia Memorandum for the... hereby certify, with respect to Colombia, that: (1) interdiction of aircraft reasonably suspected to be...
Unsupervised neural networks for solving Troesch's problem
Muhammad, Asif Zahoor Raja
2014-01-01
In this study, stochastic computational intelligence techniques are presented for the solution of Troesch's boundary value problem. The proposed stochastic solvers use the competency of a feed-forward artificial neural network for mathematical modeling of the problem in an unsupervised manner, whereas the learning of unknown parameters is made with local and global optimization methods as well as their combinations. Genetic algorithm (GA) and pattern search (PS) techniques are used as the global search methods and the interior point method (IPM) is used for an efficient local search. The combination of techniques like GA hybridized with IPM (GA-IPM) and PS hybridized with IPM (PS-IPM) are also applied to solve different forms of the equation. A comparison of the proposed results obtained from GA, PS, IPM, PS-IPM and GA-IPM has been made with the standard solutions including well known analytic techniques of the Adomian decomposition method, the variational iterational method and the homotopy perturbation method. The reliability and effectiveness of the proposed schemes, in term of accuracy and convergence, are evaluated from the results of statistical analysis based on sufficiently large independent runs.
Social Network Interdiction: Reducing the Capabilities of a Terrorist Network
2010-04-01
al-Shibh 3. Hani Hanjour 4. Nawaf Alhazmi 5. Abdul Aziz Alomari 6. Khalid Almihdhar 7. Ahmed Alghamdi 8. Salem Alhazmi 9. Majed Moqed...10. Yazid Sufaat 11. Ahmed Al-Hada 12. Hamza Alghamdi 13. Saeed Alghamdi 14. Ahmed Alnami 15. Mohamed Abdi
Solving Hub Network Problem Using Genetic Algorithm
Directory of Open Access Journals (Sweden)
Mursyid Hasan Basri
2012-01-01
Full Text Available This paper addresses a network problem that described as follows. There are n ports that interact, and p of those will be designated as hubs. All hubs are fully interconnected. Each spoke will be allocated to only one of available hubs. Direct connection between two spokes is allowed only if they are allocated to the same hub. The latter is a distinct characteristic that differs it from pure hub-and-spoke system. In case of pure hub-and-spoke system, direct connection between two spokes is not allowed. The problem is where to locate hub ports and to which hub a spoke should be allocated so that total transportation cost is minimum. In the first model, there are some additional aspects are taken into consideration in order to achieve a better representation of the problem. The first, weekly service should be accomplished. Secondly, various vessel types should be considered. The last, a concept of inter-hub discount factor is introduced. Regarding the last aspect, it represents cost reduction factor at hub ports due to economies of scale. In practice, it is common that the cost rate for inter-hub movement is less than the cost rate for movement between hub and origin/destination. In this first model, inter-hub discount factor is assumed independent with amount of flows on inter-hub links (denoted as flow-independent discount policy. The results indicated that the patterns of enlargement of container ship size, to some degree, are similar with those in Kurokawa study. However, with regard to hub locations, the results have not represented the real practice. In the proposed model, unsatisfactory result on hub locations is addressed. One aspect that could possibly be improved to find better hub locations is inter-hub discount factor. Then inter-hub discount factor is assumed to depend on amount of inter-hub flows (denoted as flow-dependent discount policy. There are two discount functions examined in this paper. Both functions are characterized by
Inverse kinematics problem in robotics using neural networks
Choi, Benjamin B.; Lawrence, Charles
1992-01-01
In this paper, Multilayer Feedforward Networks are applied to the robot inverse kinematic problem. The networks are trained with endeffector position and joint angles. After training, performance is measured by having the network generate joint angles for arbitrary endeffector trajectories. A 3-degree-of-freedom (DOF) spatial manipulator is used for the study. It is found that neural networks provide a simple and effective way to both model the manipulator inverse kinematics and circumvent the problems associated with algorithmic solution methods.
Solving network design problems via decomposition, aggregation and approximation
Bärmann, Andreas
2016-01-01
Andreas Bärmann develops novel approaches for the solution of network design problems as they arise in various contexts of applied optimization. At the example of an optimal expansion of the German railway network until 2030, the author derives a tailor-made decomposition technique for multi-period network design problems. Next, he develops a general framework for the solution of network design problems via aggregation of the underlying graph structure. This approach is shown to save much computation time as compared to standard techniques. Finally, the author devises a modelling framework for the approximation of the robust counterpart under ellipsoidal uncertainty, an often-studied case in the literature. Each of these three approaches opens up a fascinating branch of research which promises a better theoretical understanding of the problem and an increasing range of solvable application settings at the same time. Contents Decomposition for Multi-Period Network Design Solving Network Design Problems via Ag...
PRIVACY PROTECTION PROBLEMS IN SOCIAL NETWORKS
OKUR, M. Cudi
2011-01-01
Protecting privacy has become a major concern for most social network users because of increased difficulties of controlling the online data. This article presents an assessment of the common privacy related risks of social networking sites. Open and hidden privacy risks of active and passive online profiles are examined and increasing share of social networking in these phenomena is discussed. Inadequacy of available legal and institutional protection is demonstrated and the effectiveness of...
A Methodology For Measuring Resilience in a Satellite-Based Communication Network
2014-03-27
continuous multicommodity flow network interdiction problems.” IIE Transactions , 39:1, 15-26. April 2007. http://dx.doi.org/10.1080/07408170600729192... Transactions on Power Systems: Volume 20, Number 2. May 2005 Bard, Jonathan. “Practical Bilevel Optimization: Algorithms and Applications...Salmeron, Javier & Kevin Wood, Ross Baldick. “Analysis of Electric Grid Security Under Terrorist Threat”. IEEE Transactions on Power Systems, Vol. 19
Information Dissemination Through Networking In Nigeria: Problems ...
African Journals Online (AJOL)
Information dissemination is an important element in teaching and research around the world. Dissemination of information through electronic networking has transformed the conduct of research and teaching in institutions and organizations. Electronic networks are offering researchers a wide range of opportunities in ...
Secure Wireless Sensor Networks: Problems and Solutions
Directory of Open Access Journals (Sweden)
Fei Hu
2003-08-01
Full Text Available As sensor networks edge closer towards wide-spread deployment, security issues become a central concern. So far, the main research focus has been on making sensor networks feasible and useful, and less emphasis was placed on security. This paper analyzes security challenges in wireless sensor networks and summarizes key issues that should be solved for achieving the ad hoc security. It gives an overview of the current state of solutions on such key issues as secure routing, prevention of denial-of-service and key management service. We also present some secure methods to achieve security in wireless sensor networks. Finally we present our integrated approach to securing sensor networks.
Network Monitoring as a Streaming Analytics Problem
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.
L’interdiction des armes chimiques dans la tourmente
Barmet, Céline; Thränert, Oliver
2017-01-01
La Convention sur l’interdiction des armes chimiques est un acquis politique majeur en matière de désarmement international. Pourtant, ses États parties sont de plus en plus divisés. Les armes chimiques pourraient, en parallèle, regagner du terrain grâce aux derniers progrès scientifiques. ISSN:2296-0228
Pricing and Capacity Planning Problems in Energy Transmission Networks
DEFF Research Database (Denmark)
Villumsen, Jonas Christoffer
and transmission pricing problems in energy transmission networks. Although the modelling framework applies to energy networks in general, most of the applications discussed concern the transmission of electricity. A number of the problems presented involves transmission switching, which allows the operator...... of an electricity transmission network to switch lines in and out in an operational context in order to optimise the network flow. We show that transmission switching in systems with large-scale wind power may alleviate network congestions and reduce curtailment of wind power leading to higher utilisation...... of installed wind power capacity. We present formulations of — and efficient solution methods for— the transmission line capacity expansion problem and the unit commitment problem with transmission switching. We also show that transmission switching may radically change the optimal line capacity expansion...
Decomposition method for zonal resource allocation problems in telecommunication networks
Konnov, I. V.; Kashuba, A. Yu
2016-11-01
We consider problems of optimal resource allocation in telecommunication networks. We first give an optimization formulation for the case where the network manager aims to distribute some homogeneous resource (bandwidth) among users of one region with quadratic charge and fee functions and present simple and efficient solution methods. Next, we consider a more general problem for a provider of a wireless communication network divided into zones (clusters) with common capacity constraints. We obtain a convex quadratic optimization problem involving capacity and balance constraints. By using the dual Lagrangian method with respect to the capacity constraint, we suggest to reduce the initial problem to a single-dimensional optimization problem, but calculation of the cost function value leads to independent solution of zonal problems, which coincide with the above single region problem. Some results of computational experiments confirm the applicability of the new methods.
A Generalized Orienteering Problem for Optimal Search and Interdiction Planning
2013-09-01
stochastic prots. IIE Transactions 40(4) 406421. Jin, Y., Y. Liao, A. A. Minai, M. M. Polycarpou. 2006. Balancing search and target response in...cooperative unmanned aerial vehicle (UAV) teams. IEEE transactions on systems man and cybernetics Part B Cybernetics a publication of the IEEE Systems
A Survey of Coverage Problems in Wireless Sensor Networks
Directory of Open Access Journals (Sweden)
Junbin LIANG
2014-01-01
Full Text Available Coverage problem is an important issue in wireless sensor networks, which has a great impact on the performance of wireless sensor networks. Given a sensor network, the coverage problem is to determine how well the sensing field is monitored or tracked by sensors. In this paper, we classify the coverage problem into three categories: area coverage, target coverage, and barrier coverage, give detailed description of different algorithms belong to these three categories. Moreover, we specify the advantages and disadvantages of the existing classic algorithms, which can give a useful direction in this area.
Problem solving for wireless sensor networks
Garcia-Hernando, Ana-Belen; Lopez-Navarro, Juan-Manuel; Prayati, Aggeliki; Redondo-Lopez, Luis
2008-01-01
Wireless Sensor Networks (WSN) is an area of huge research interest, attracting substantial attention from industry and academia for its enormous potential and its inherent challenges. This reader-friendly text delivers a comprehensive review of the developments related to the important technological issues in WSN.
Robust p-median problem in changing networks
Directory of Open Access Journals (Sweden)
Štefan PEŠKO
2015-09-01
Full Text Available The robust p-median problem in changing networks is a version of known discrete p-median problem in network with uncertain edge lengths where uncertainty is characterised by given interval. The uncertainty in edge lengths may appear in travel time along the edges in any network location problem. Several possible future scenarios with respect to the lengths of edges are presented. The planner will want a strategy of positioning p medians that will be working “as well as possible" over the future scenarios. We present MILP formulation of the problem and the solution method based on exchange MILP heuristic. The cluster of each median is presented by rooted tree with the median as root. The performance of the proposed heuristic is compared to the optimal solution found via Gurobi solver for MILP models through some illustrative instances of Slovak road network in Žilina.
Network capacity with probit-based stochastic user equilibrium problem.
Lu, Lili; Wang, Jian; Zheng, Pengjun; Wang, Wei
2017-01-01
Among different stochastic user equilibrium (SUE) traffic assignment models, the Logit-based stochastic user equilibrium (SUE) is extensively investigated by researchers. It is constantly formulated as the low-level problem to describe the drivers' route choice behavior in bi-level problems such as network design, toll optimization et al. The Probit-based SUE model receives far less attention compared with Logit-based model albeit the assignment result is more consistent with drivers' behavior. It is well-known that due to the identical and irrelevant alternative (IIA) assumption, the Logit-based SUE model is incapable to deal with route overlapping problem and cannot account for perception variance with respect to trips. This paper aims to explore the network capacity with Probit-based traffic assignment model and investigate the differences of it is with Logit-based SUE traffic assignment models. The network capacity is formulated as a bi-level programming where the up-level program is to maximize the network capacity through optimizing input parameters (O-D multiplies and signal splits) while the low-level program is the Logit-based or Probit-based SUE problem formulated to model the drivers' route choice. A heuristic algorithm based on sensitivity analysis of SUE problem is detailed presented to solve the proposed bi-level program. Three numerical example networks are used to discuss the differences of network capacity between Logit-based SUE constraint and Probit-based SUE constraint. This study finds that while the network capacity show different results between Probit-based SUE and Logit-based SUE constraints, the variation pattern of network capacity with respect to increased level of travelers' information for general network under the two type of SUE problems is the same, and with certain level of travelers' information, both of them can achieve the same maximum network capacity.
An Electromagnetic Interference Problem via the Mains Distribution Networks
Directory of Open Access Journals (Sweden)
BUZDUGAN, M. I.
2007-11-01
Full Text Available The paper presents an electromagnetic interference problem, due to the proximity of two radio broadcasting stations which injected especially common mode conducted emissions over the maximal limits specified by the national regulations in the public low voltage mains network. These emissions determined the malfunction of the gas heating centrals Themaclassic Saunier Duval installed in the area. The problem was solved by the retro fitting of an extra EMI filter for the mains network, as presented in the paper.
Cellular neural networks for the stereo matching problem
Energy Technology Data Exchange (ETDEWEB)
Taraglio, S. [ENEA, Centro Ricerche Casaccia, Rome (Italy). Dipt. Innovazione; Zanela, A. [Rome Univ. `La Sapienza` (Italy). Dipt. di Fisica
1997-03-01
The applicability of the Cellular Neural Network (CNN) paradigm to the problem of recovering information on the tridimensional structure of the environment is investigated. The approach proposed is the stereo matching of video images. The starting point of this work is the Zhou-Chellappa neural network implementation for the same problem. The CNN based system we present here yields the same results as the previous approach, but without the many existing drawbacks.
Problems in the Deployment of Learning Networks In Small Organizations
Shankle, Dean E.; Shankle, Jeremy P.
2006-01-01
Please, cite this publication as: Shankle, D.E., & Shankle, J.P. (2006). Problems in the Deployment of Learning Networks In Small Organizations. Proceedings of International Workshop in Learning Networks for Lifelong Competence Development, TENCompetence Conference. March 30th-31st, Sofia, Bulgaria:
Solving constraint satisfaction problems with networks of spiking neurons
Directory of Open Access Journals (Sweden)
Zeno eJonke
2016-03-01
Full Text Available Network of neurons in the brain apply – unlike processors in our current generation ofcomputer hardware – an event-based processing strategy, where short pulses (spikes areemitted sparsely by neurons to signal the occurrence of an event at a particular point intime. Such spike-based computations promise to be substantially more power-efficient thantraditional clocked processing schemes. However it turned out to be surprisingly difficult todesign networks of spiking neurons that can solve difficult computational problems on the levelof single spikes (rather than rates of spikes. We present here a new method for designingnetworks of spiking neurons via an energy function. Furthermore we show how the energyfunction of a network of stochastically firing neurons can be shaped in a quite transparentmanner by composing the networks of simple stereotypical network motifs. We show that thisdesign approach enables networks of spiking neurons to produce approximate solutions todifficult (NP-hard constraint satisfaction problems from the domains of planning/optimizationand verification/logical inference. The resulting networks employ noise as a computationalresource. Nevertheless the timing of spikes (rather than just spike rates plays an essential rolein their computations. Furthermore, networks of spiking neurons carry out for the Traveling Salesman Problem a more efficient stochastic search for good solutions compared with stochastic artificial neural networks (Boltzmann machines and Gibbs sampling.
Analysis of feeder bus network design and scheduling problems.
Almasi, Mohammad Hadi; Mirzapour Mounes, Sina; Koting, Suhana; Karim, Mohamed Rehan
2014-01-01
A growing concern for public transit is its inability to shift passenger's mode from private to public transport. In order to overcome this problem, a more developed feeder bus network and matched schedules will play important roles. The present paper aims to review some of the studies performed on Feeder Bus Network Design and Scheduling Problem (FNDSP) based on three distinctive parts of the FNDSP setup, namely, problem description, problem characteristics, and solution approaches. The problems consist of different subproblems including data preparation, feeder bus network design, route generation, and feeder bus scheduling. Subsequently, descriptive analysis and classification of previous works are presented to highlight the main characteristics and solution methods. Finally, some of the issues and trends for future research are identified. This paper is targeted at dealing with the FNDSP to exhibit strategic and tactical goals and also contributes to the unification of the field which might be a useful complement to the few existing reviews.
Analysing Stagecoach Network Problem Using Dynamic ...
African Journals Online (AJOL)
In this paper we present a recursive dynamic programming algorithm for solving the stagecoach problem. The algorithm is computationally more efficient than the first method as it obtains its minimum total cost using the suboptimal policies of the different stages without computing the cost of all the routes. By the dynamic ...
Hub location problems in transportation networks
DEFF Research Database (Denmark)
Gelareh, Shahin; Nickel, Stefan
2011-01-01
. While the existing state-of-the-art MIP solvers fail to solve even small size instances of problem, our accelerated and efficient primal (Benders) decomposition solves larger ones. In addition, a very efficient greedy heuristic, proven to be capable of obtaining high quality solutions, is proposed. We...
Energy Technology Data Exchange (ETDEWEB)
Saeger, Kevin J [Los Alamos National Laboratory; Cuellar, Leticia [Los Alamos National Laboratory
2010-10-28
Nuclear weapons proliferation is an existing and growing worldwide problem. To help with devising strategies and supporting decisions to interdict the transport of nuclear material, we developed the Pathway Analysis, Threat Response and Interdiction Options Tool (PATRIOT) that provides an analytical approach for evaluating the probability that an adversary smuggling radioactive or special nuclear material will be detected during transit. We incorporate a global, multi-modal transportation network, explicit representation of designed and serendipitous detection opportunities, and multiple threat devices, material types, and shielding levels. This paper presents the general structure of PATRIOT, all focuses on the theoretical framework used to model the reliabilities of all network components that are used to predict the most likely pathways to the target.
Energy Technology Data Exchange (ETDEWEB)
Saeger, Kevin J [Los Alamos National Laboratory; Cuellar, Leticia [Los Alamos National Laboratory
2010-01-01
Nuclear weapons proliferation is an existing and growing worldwide problem. To help with devising strategies and supporting decisions to interdict the transport of nuclear material, we developed the Pathway Analysis, Threat Response and Interdiction Options Tool (PATRIOT) that provides an analytical approach for evaluating the probability that an adversary smuggling radioactive or special nuclear material will be detected during transit. We incorporate a global, multi-modal transportation network, explicit representation of designed and serendipitous detection opportunities, and multiple threat devices, material types, and shielding levels. This paper presents the general structure of PATRIOT, and focuses on the theoretical framework used to model the reliabilities of all network components that are used to predict the most likely pathways to the target.
A matheuristic for the liner shipping network design problem
DEFF Research Database (Denmark)
Brouer, Berit Dangaard; Desaulniers, Guy
2012-01-01
We present a matheuristic, an integer programming based heuristic, for the Liner Shipping Network Design Problem. The heuristic applies a greedy construction heuristic based on an interpretation of the liner shipping network design problem as a multiple quadratic knapsack problem. The construction...... heuristic is combined with an improvement heuristic with a neighborhood defined by the solution space of a mixed integer program. The mixed integer program optimizes the removal and insertion of several port calls on a liner shipping service. The objective function is based on evaluation functions...
Topics on data transmission problem in software definition network
Gao, Wei; Liang, Li; Xu, Tianwei; Gan, Jianhou
2017-08-01
In normal computer networks, the data transmission between two sites go through the shortest path between two corresponding vertices. However, in the setting of software definition network (SDN), it should monitor the network traffic flow in each site and channel timely, and the data transmission path between two sites in SDN should consider the congestion in current networks. Hence, the difference of available data transmission theory between normal computer network and software definition network is that we should consider the prohibit graph structures in SDN, and these forbidden subgraphs represent the sites and channels in which data can't be passed by the serious congestion. Inspired by theoretical analysis of an available data transmission in SDN, we consider some computational problems from the perspective of the graph theory. Several results determined in the paper imply the sufficient conditions of data transmission in SDN in the various graph settings.
The Network Completion Problem: Inferring Missing Nodes and Edges in Networks
Energy Technology Data Exchange (ETDEWEB)
Kim, M; Leskovec, J
2011-11-14
Network structures, such as social networks, web graphs and networks from systems biology, play important roles in many areas of science and our everyday lives. In order to study the networks one needs to first collect reliable large scale network data. While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomplete with nodes and edges missing. Commonly, only a part of the network can be observed and we would like to infer the unobserved part of the network. We address this issue by studying the Network Completion Problem: Given a network with missing nodes and edges, can we complete the missing part? We cast the problem in the Expectation Maximization (EM) framework where we use the observed part of the network to fit a model of network structure, and then we estimate the missing part of the network using the model, re-estimate the parameters and so on. We combine the EM with the Kronecker graphs model and design a scalable Metropolized Gibbs sampling approach that allows for the estimation of the model parameters as well as the inference about missing nodes and edges of the network. Experiments on synthetic and several real-world networks show that our approach can effectively recover the network even when about half of the nodes in the network are missing. Our algorithm outperforms not only classical link-prediction approaches but also the state of the art Stochastic block modeling approach. Furthermore, our algorithm easily scales to networks with tens of thousands of nodes.
Neural network for solving convex quadratic bilevel programming problems.
He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie
2014-03-01
In this paper, using the idea of successive approximation, we propose a neural network to solve convex quadratic bilevel programming problems (CQBPPs), which is modeled by a nonautonomous differential inclusion. Different from the existing neural network for CQBPP, the model has the least number of state variables and simple structure. Based on the theory of nonsmooth analysis, differential inclusions and Lyapunov-like method, the limit equilibrium points sequence of the proposed neural networks can approximately converge to an optimal solution of CQBPP under certain conditions. Finally, simulation results on two numerical examples and the portfolio selection problem show the effectiveness and performance of the proposed neural network. Copyright © 2013 Elsevier Ltd. All rights reserved.
Intelligence Collection Targeting and Interdiction of Dark Networks
2014-06-01
examples of terrorist technological communications countered by a baseline of NTM collection with OSINT and HUMINT only serving as enablers or...he visits while traveling as an ostensible tourist ( OSINT ) would be useful.54 In summary, Sims’s observation not only enforce the strategic
Social networking sites: an adjunctive treatment modality for psychological problems.
Menon, Indu S; Sharma, Manoj Kumar; Chandra, Prabha S; Thennarasu, K
2014-07-01
Social networking is seen as a way to enhance social support and feeling of well-being. The present work explores the potentials of social networking sites as an adjunctive treatment modality for initiating treatment contact as well as for managing psychological problems. Interview schedule, Facebook intensity questionnaire were administered on 28 subjects with a combination of 18 males and 10 females. They were taken from the in-patient and out-patient psychiatry setting of the hospital. Facebook was the most popular sites and used to seek emotional support on the basis of the frequent updates of emotional content that users put in their profile; reconciliations, escape from the problems or to manage the loneliness; getting information about illness and its treatment and interaction with experts and also manifested as problematic use. It has implications for developing social networking based adjunctive treatment modality for psychological problems.
Sub-problem Optimization With Regression and Neural Network Approximators
Guptill, James D.; Hopkins, Dale A.; Patnaik, Surya N.
2003-01-01
Design optimization of large systems can be attempted through a sub-problem strategy. In this strategy, the original problem is divided into a number of smaller problems that are clustered together to obtain a sequence of sub-problems. Solution to the large problem is attempted iteratively through repeated solutions to the modest sub-problems. This strategy is applicable to structures and to multidisciplinary systems. For structures, clustering the substructures generates the sequence of sub-problems. For a multidisciplinary system, individual disciplines, accounting for coupling, can be considered as sub-problems. A sub-problem, if required, can be further broken down to accommodate sub-disciplines. The sub-problem strategy is being implemented into the NASA design optimization test bed, referred to as "CometBoards." Neural network and regression approximators are employed for reanalysis and sensitivity analysis calculations at the sub-problem level. The strategy has been implemented in sequential as well as parallel computational environments. This strategy, which attempts to alleviate algorithmic and reanalysis deficiencies, has the potential to become a powerful design tool. However, several issues have to be addressed before its full potential can be harnessed. This paper illustrates the strategy and addresses some issues.
Client-Centered Problem-Solving Networks in Complex Organizations.
Tucker, Charles; Hanna, Michael
Employees in different kinds of organizations were surveyed for their perceptions of their companies' client and operational problem-solving networks. The individuals came from a manufacturing firm, a community college, a telephone company, a farmers' cooperative, and a hospital. Interviews were conducted with those people reporting numerous…
Countervailing Social Network Influences on Problem Behaviors among Homeless Youth
Rice, Eric; Stein, Judith A.; Milburn, Norweeta
2008-01-01
The impact of countervailing social network influences (i.e., pro-social, anti-social or HIV risk peers) on problem behaviors (i.e., HIV drug risk, HIV sex risk or anti-social behaviors) among 696 homeless youth was assessed using structural equation modeling. Results revealed that older youth were less likely to report having pro-social peers and…
Evolving neural networks for strategic decision-making problems.
Kohl, Nate; Miikkulainen, Risto
2009-04-01
Evolution of neural networks, or neuroevolution, has been a successful approach to many low-level control problems such as pole balancing, vehicle control, and collision warning. However, certain types of problems-such as those involving strategic decision-making-have remained difficult for neuroevolution to solve. This paper evaluates the hypothesis that such problems are difficult because they are fractured: The correct action varies discontinuously as the agent moves from state to state. A method for measuring fracture using the concept of function variation is proposed and, based on this concept, two methods for dealing with fracture are examined: neurons with local receptive fields, and refinement based on a cascaded network architecture. Experiments in several benchmark domains are performed to evaluate how different levels of fracture affect the performance of neuroevolution methods, demonstrating that these two modifications improve performance significantly. These results form a promising starting point for expanding neuroevolution to strategic tasks.
Subgradient-based neural networks for nonsmooth nonconvex optimization problems.
Bian, Wei; Xue, Xiaoping
2009-06-01
This paper presents a subgradient-based neural network to solve a nonsmooth nonconvex optimization problem with a nonsmooth nonconvex objective function, a class of affine equality constraints, and a class of nonsmooth convex inequality constraints. The proposed neural network is modeled with a differential inclusion. Under a suitable assumption on the constraint set and a proper assumption on the objective function, it is proved that for a sufficiently large penalty parameter, there exists a unique global solution to the neural network and the trajectory of the network can reach the feasible region in finite time and stay there thereafter. It is proved that the trajectory of the neural network converges to the set which consists of the equilibrium points of the neural network, and coincides with the set which consists of the critical points of the objective function in the feasible region. A condition is given to ensure the convergence to the equilibrium point set in finite time. Moreover, under suitable assumptions, the coincidence between the solution to the differential inclusion and the "slow solution" of it is also proved. Furthermore, three typical examples are given to present the effectiveness of the theoretic results obtained in this paper and the good performance of the proposed neural network.
76 FR 53299 - Continuation of U.S. Drug Interdiction Assistance to the Government of Colombia
2011-08-25
... Interdiction Assistance to the Government of Colombia Memorandum for the Secretary of State the Secretary of... for Fiscal Year 1995, as amended (22 U.S.C. 2291-4), I hereby certify, with respect to Colombia, that...
Counterproliferation Strategy: The Role of Preventive War, Preventive Strikes, and Interdiction
National Research Council Canada - National Science Library
Rak, Claire
2003-01-01
This thesis analyzes the potential effectiveness of preventive war, preventive strikes, and interdiction as tools for the United States to counter the proliferation of weapons of mass destruction (WMD...
AMP-Inspired Deep Networks for Sparse Linear Inverse Problems
Borgerding, Mark; Schniter, Philip; Rangan, Sundeep
2017-08-01
Deep learning has gained great popularity due to its widespread success on many inference problems. We consider the application of deep learning to the sparse linear inverse problem, where one seeks to recover a sparse signal from a few noisy linear measurements. In this paper, we propose two novel neural-network architectures that decouple prediction errors across layers in the same way that the approximate message passing (AMP) algorithms decouple them across iterations: through Onsager correction. First, we propose a "learned AMP" network that significantly improves upon Gregor and LeCun's "learned ISTA." Second, inspired by the recently proposed "vector AMP" (VAMP) algorithm, we propose a "learned VAMP" network that offers increased robustness to deviations in the measurement matrix from i.i.d. Gaussian. In both cases, we jointly learn the linear transforms and scalar nonlinearities of the network. Interestingly, with i.i.d. signals, the linear transforms and scalar nonlinearities prescribed by the VAMP algorithm coincide with the values learned through back-propagation, leading to an intuitive interpretation of learned VAMP. Finally, we apply our methods to two problems from 5G wireless communications: compressive random access and massive-MIMO channel estimation.
A Formal Model and Verification Problems for Software Defined Networks
Directory of Open Access Journals (Sweden)
V. A. Zakharov
2013-01-01
Full Text Available Software-defined networking (SDN is an approach to building computer networks that separate and abstract data planes and control planes of these systems. In a SDN a centralized controller manages a distributed set of switches. A set of open commands for packet forwarding and flow-table updating was defined in the form of a protocol known as OpenFlow. In this paper we describe an abstract formal model of SDN, introduce a tentative language for specification of SDN forwarding policies, and set up formally model-checking problems for SDN.
Deep Convolutional Neural Network for Inverse Problems in Imaging.
Jin, Kyong Hwan; McCann, Michael T; Froustey, Emmanuel; Unser, Michael
2017-06-15
In this paper, we propose a novel deep convolutional neural network (CNN)-based algorithm for solving ill-posed inverse problems. Regularized iterative algorithms have emerged as the standard approach to ill-posed inverse problems in the past few decades. These methods produce excellent results, but can be challenging to deploy in practice due to factors including the high computational cost of the forward and adjoint operators and the difficulty of hyper parameter selection. The starting point of our work is the observation that unrolled iterative methods have the form of a CNN (filtering followed by point-wise nonlinearity) when the normal operator ( H*H where H* is the adjoint of the forward imaging operator, H ) of the forward model is a convolution. Based on this observation, we propose using direct inversion followed by a CNN to solve normal-convolutional inverse problems. The direct inversion encapsulates the physical model of the system, but leads to artifacts when the problem is ill-posed; the CNN combines multiresolution decomposition and residual learning in order to learn to remove these artifacts while preserving image structure. We demonstrate the performance of the proposed network in sparse-view reconstruction (down to 50 views) on parallel beam X-ray computed tomography in synthetic phantoms as well as in real experimental sinograms. The proposed network outperforms total variation-regularized iterative reconstruction for the more realistic phantoms and requires less than a second to reconstruct a 512 x 512 image on the GPU.
Deep Convolutional Neural Network for Inverse Problems in Imaging
Jin, Kyong Hwan; McCann, Michael T.; Froustey, Emmanuel; Unser, Michael
2017-09-01
In this paper, we propose a novel deep convolutional neural network (CNN)-based algorithm for solving ill-posed inverse problems. Regularized iterative algorithms have emerged as the standard approach to ill-posed inverse problems in the past few decades. These methods produce excellent results, but can be challenging to deploy in practice due to factors including the high computational cost of the forward and adjoint operators and the difficulty of hyper parameter selection. The starting point of our work is the observation that unrolled iterative methods have the form of a CNN (filtering followed by point-wise non-linearity) when the normal operator (H*H, the adjoint of H times H) of the forward model is a convolution. Based on this observation, we propose using direct inversion followed by a CNN to solve normal-convolutional inverse problems. The direct inversion encapsulates the physical model of the system, but leads to artifacts when the problem is ill-posed; the CNN combines multiresolution decomposition and residual learning in order to learn to remove these artifacts while preserving image structure. We demonstrate the performance of the proposed network in sparse-view reconstruction (down to 50 views) on parallel beam X-ray computed tomography in synthetic phantoms as well as in real experimental sinograms. The proposed network outperforms total variation-regularized iterative reconstruction for the more realistic phantoms and requires less than a second to reconstruct a 512 x 512 image on GPU.
A simulated annealing approach for redesigning a warehouse network problem
Khairuddin, Rozieana; Marlizawati Zainuddin, Zaitul; Jiun, Gan Jia
2017-09-01
Now a day, several companies consider downsizing their distribution networks in ways that involve consolidation or phase-out of some of their current warehousing facilities due to the increasing competition, mounting cost pressure and taking advantage on the economies of scale. Consequently, the changes on economic situation after a certain period of time require an adjustment on the network model in order to get the optimal cost under the current economic conditions. This paper aimed to develop a mixed-integer linear programming model for a two-echelon warehouse network redesign problem with capacitated plant and uncapacitated warehouses. The main contribution of this study is considering capacity constraint for existing warehouses. A Simulated Annealing algorithm is proposed to tackle with the proposed model. The numerical solution showed the model and method of solution proposed was practical.
Problems of Using Femtocells in Public Cellular Networks
Directory of Open Access Journals (Sweden)
Karolis Žvinys
2013-05-01
Full Text Available This paper analyses the use of femtocells connected into a single macro network infrastructure. Different problems and possible solutions were discussed. The paper is focused on two separate benefits, which HNB could bring an operator and user. Femtocells are especially appealing due to the freedom of installation, increased macro network capacity, femto zone rates and etc. They provide users with better service quality, including voice service and higher throughput; while operators can reduce their network deployment expenditures. On the other hand, unplanned deployment, mobility issues and different types of user groups can cause a headache both for operators and customers. The analysis demonstrated that the majority of features of femtocells from the operator’s point of view were positive. Looking from the user’s point of view, most of shortcomings are difficult to remove. Positive and negative features both for operators and clients are presented in the HNB model.Article in Lithuanian
Applying DNA computation to intractable problems in social network analysis.
Chen, Rick C S; Yang, Stephen J H
2010-09-01
From ancient times to the present day, social networks have played an important role in the formation of various organizations for a range of social behaviors. As such, social networks inherently describe the complicated relationships between elements around the world. Based on mathematical graph theory, social network analysis (SNA) has been developed in and applied to various fields such as Web 2.0 for Web applications and product developments in industries, etc. However, some definitions of SNA, such as finding a clique, N-clique, N-clan, N-club and K-plex, are NP-complete problems, which are not easily solved via traditional computer architecture. These challenges have restricted the uses of SNA. This paper provides DNA-computing-based approaches with inherently high information density and massive parallelism. Using these approaches, we aim to solve the three primary problems of social networks: N-clique, N-clan, and N-club. Their accuracy and feasible time complexities discussed in the paper will demonstrate that DNA computing can be used to facilitate the development of SNA. Copyright 2010 Elsevier Ireland Ltd. All rights reserved.
Kinetic Transition Networks for the Thomson Problem and Smale's Seventh Problem
Mehta, Dhagash; Chen, Jianxu; Chen, Danny Z.; Kusumaatmaja, Halim; Wales, David J.
2016-07-01
The Thomson problem, arrangement of identical charges on the surface of a sphere, has found many applications in physics, chemistry and biology. Here, we show that the energy landscape of the Thomson problem for N particles with N =132 , 135, 138, 141, 144, 147, and 150 is single funneled, characteristic of a structure-seeking organization where the global minimum is easily accessible. Algorithmically, constructing starting points close to the global minimum of such a potential with spherical constraints is one of Smale's 18 unsolved problems in mathematics for the 21st century because it is important in the solution of univariate and bivariate random polynomial equations. By analyzing the kinetic transition networks, we show that a randomly chosen minimum is, in fact, always "close" to the global minimum in terms of the number of transition states that separate them, a characteristic of small world networks.
Neural network for regression problems with reduced training sets.
Bataineh, Mohammad; Marler, Timothy
2017-11-01
Although they are powerful and successful in many applications, artificial neural networks (ANNs) typically do not perform well with complex problems that have a limited number of training cases. Often, collecting additional training data may not be feasible or may be costly. Thus, this work presents a new radial-basis network (RBN) design that overcomes the limitations of using ANNs to accurately model regression problems with minimal training data. This new design involves a multi-stage training process that couples an orthogonal least squares (OLS) technique with gradient-based optimization. New termination criteria are also introduced to improve accuracy. In addition, the algorithms are designed to require minimal heuristic parameters, thus improving ease of use and consistency in performance. The proposed approach is tested with experimental and practical regression problems, and the results are compared with those from typical network models. The results show that the new design demonstrates improved accuracy with reduced dependence on the amount of training data. As demonstrated, this new ANN provides a platform for approximating potentially slow but high-fidelity computational models, and thus fostering inter-model connectivity and multi-scale modeling. Copyright © 2017 Elsevier Ltd. All rights reserved.
Address Translation Problems in IMS Based Next Generation Networks
Directory of Open Access Journals (Sweden)
Balazs Godor
2006-01-01
Full Text Available The development of packed based multimedia networks reached a turning point when the ITU-T and the ETSIhave incorporated the IMS to the NGN. With the fast development of mobile communication more and more services andcontent are available. In contrast with fix network telephony both the services and the devices are personalized in the “mobileworld”. Services, known from the Internet - like e-mail, chat, browsing, presence, etc. – are already available via mobiledevices as well. The IMS originally wanted to exploit both the benefits of mobile networks and the fancy services of theInternet. But today it is already more than that. IMS is the core of the next generation telecommunication networks and abasis for fix-mobile convergent services. The fact however that IMS was originally a “mobile” standard, where IPv6 was notoddity generated some problems for the fix networks, where IPv4 is used. In this article I give an overview of these problemsand mention some solutions as well.
Complex network problems in physics, computer science and biology
Cojocaru, Radu Ionut
There is a close relation between physics and mathematics and the exchange of ideas between these two sciences are well established. However until few years ago there was no such a close relation between physics and computer science. Even more, only recently biologists started to use methods and tools from statistical physics in order to study the behavior of complex system. In this thesis we concentrate on applying and analyzing several methods borrowed from computer science to biology and also we use methods from statistical physics in solving hard problems from computer science. In recent years physicists have been interested in studying the behavior of complex networks. Physics is an experimental science in which theoretical predictions are compared to experiments. In this definition, the term prediction plays a very important role: although the system is complex, it is still possible to get predictions for its behavior, but these predictions are of a probabilistic nature. Spin glasses, lattice gases or the Potts model are a few examples of complex systems in physics. Spin glasses and many frustrated antiferromagnets map exactly to computer science problems in the NP-hard class defined in Chapter 1. In Chapter 1 we discuss a common result from artificial intelligence (AI) which shows that there are some problems which are NP-complete, with the implication that these problems are difficult to solve. We introduce a few well known hard problems from computer science (Satisfiability, Coloring, Vertex Cover together with Maximum Independent Set and Number Partitioning) and then discuss their mapping to problems from physics. In Chapter 2 we provide a short review of combinatorial optimization algorithms and their applications to ground state problems in disordered systems. We discuss the cavity method initially developed for studying the Sherrington-Kirkpatrick model of spin glasses. We extend this model to the study of a specific case of spin glass on the Bethe
Towards overcoming the Monte Carlo sign problem with tensor networks
Energy Technology Data Exchange (ETDEWEB)
Banuls, Mari Carmen; Cirac, J. Ignacio; Kuehn, Stefan [Max-Planck-Institut fuer Quantenoptik (MPQ), Garching (Germany); Cichy, Krzysztof [Frankfurt Univ. (Germany). Inst. fuer Theoretische Physik; Adam Mickiewicz Univ., Poznan (Poland). Faculty of Physics; Jansen, Karl [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC; Saito, Hana [AISIN AW Co., Ltd., Aichi (Japan)
2016-11-15
The study of lattice gauge theories with Monte Carlo simulations is hindered by the infamous sign problem that appears under certain circumstances, in particular at non-zero chemical potential. So far, there is no universal method to overcome this problem. However, recent years brought a new class of non-perturbative Hamiltonian techniques named tensor networks, where the sign problem is absent. In previous work, we have demonstrated that this approach, in particular matrix product states in 1+1 dimensions, can be used to perform precise calculations in a lattice gauge theory, the massless and massive Schwinger model. We have computed the mass spectrum of this theory, its thermal properties and real-time dynamics. In this work, we review these results and we extend our calculations to the case of two flavours and non-zero chemical potential. We are able to reliably reproduce known analytical results for this model, thus demonstrating that tensor networks can tackle the sign problem of a lattice gauge theory at finite density.
Stochastic Optimization for Network-Constrained Power System Scheduling Problem
Directory of Open Access Journals (Sweden)
D. F. Teshome
2015-01-01
Full Text Available The stochastic nature of demand and wind generation has a considerable effect on solving the scheduling problem of a modern power system. Network constraints such as power flow equations and transmission capacities also need to be considered for a comprehensive approach to model renewable energy integration and analyze generation system flexibility. Firstly, this paper accounts for the stochastic inputs in such a way that the uncertainties are modeled as normally distributed forecast errors. The forecast errors are then superimposed on the outputs of load and wind forecasting tools. Secondly, it efficiently models the network constraints and tests an iterative algorithm and a piecewise linear approximation for representing transmission losses in mixed integer linear programming (MILP. It also integrates load shedding according to priority factors set by the system operator. Moreover, the different interactions among stochastic programming, network constraints, and prioritized load shedding are thoroughly investigated in the paper. The stochastic model is tested on a power system adopted from Jeju Island, South Korea. Results demonstrate the impact of wind speed variability and network constraints on the flexibility of the generation system. Further analysis shows the effect of loss modeling approaches on total cost, accuracy, computational time, and memory requirement.
A recurrent neural network for solving bilevel linear programming problem.
He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie; Huang, Junjian
2014-04-01
In this brief, based on the method of penalty functions, a recurrent neural network (NN) modeled by means of a differential inclusion is proposed for solving the bilevel linear programming problem (BLPP). Compared with the existing NNs for BLPP, the model has the least number of state variables and simple structure. Using nonsmooth analysis, the theory of differential inclusions, and Lyapunov-like method, the equilibrium point sequence of the proposed NNs can approximately converge to an optimal solution of BLPP under certain conditions. Finally, the numerical simulations of a supply chain distribution model have shown excellent performance of the proposed recurrent NNs.
Identifying Demand Responses to Illegal Drug Supply Interdictions.
Cunningham, Scott; Finlay, Keith
2016-10-01
Successful supply-side interdictions into illegal drug markets are predicated on the responsiveness of drug prices to enforcement and the price elasticity of demand for addictive drugs. We present causal estimates that targeted interventions aimed at methamphetamine input markets ('precursor control') can temporarily increase retail street prices, but methamphetamine consumption is weakly responsive to higher drug prices. After the supply interventions, purity-adjusted prices increased then quickly returned to pre-treatment levels within 6-12 months, demonstrating the short-term effects of precursor control. The price elasticity of methamphetamine demand is -0.13 to -0.21 for self-admitted drug treatment admissions and between -0.24 and -0.28 for hospital inpatient admissions. We find some evidence of a positive cross-price effect for cocaine, but we do not find robust evidence that increases in methamphetamine prices increased heroin, alcohol, or marijuana drug use. This study can inform policy discussions regarding other synthesized drugs, including illicit use of pharmaceuticals. Copyright © 2015 John Wiley & Sons, Ltd. Copyright © 2015 John Wiley & Sons, Ltd.
Mental Health, School Problems, and Social Networks: Modeling Urban Adolescent Substance Use
Mason, Michael J.
2010-01-01
This study tested a mediation model of the relationship with school problems, social network quality, and substance use with a primary care sample of 301 urban adolescents. It was theorized that social network quality (level of risk or protection in network) would mediate the effects of school problems, accounting for internalizing problems and…
Artificial neural networks in high voltage transmission line problems
Ekonomou, L.; Kontargyri, V. T.; Kourtesi, St.; Maris, T. I.; Stathopulos, I. A.
2007-07-01
According to the literature high voltage transmission line problems are faced using conventional analytical methods, which include in most cases empirical and/or approximating equations. Artificial intelligence and more specifically artificial neural networks (ANN) are addressed in this work, in order to give accurate solutions to high voltage transmission line problems using in the calculations only actual field data. Two different case studies are studied, i.e., the estimation of critical flashover voltage on polluted insulators and the estimation of lightning performance of high voltage transmission lines. ANN models are developed and are tested on operating high voltage transmission lines and polluted insulators, producing very satisfactory results. These two ANN models can be used in electrical engineers' studies aiming at the more effective protection of high voltage equipment.
Convolutional Neural Networks for Inverse Problems in Imaging: A Review
McCann, Michael T.; Jin, Kyong Hwan; Unser, Michael
2017-11-01
In this survey paper, we review recent uses of convolution neural networks (CNNs) to solve inverse problems in imaging. It has recently become feasible to train deep CNNs on large databases of images, and they have shown outstanding performance on object classification and segmentation tasks. Motivated by these successes, researchers have begun to apply CNNs to the resolution of inverse problems such as denoising, deconvolution, super-resolution, and medical image reconstruction, and they have started to report improvements over state-of-the-art methods, including sparsity-based techniques such as compressed sensing. Here, we review the recent experimental work in these areas, with a focus on the critical design decisions: Where does the training data come from? What is the architecture of the CNN? and How is the learning problem formulated and solved? We also bring together a few key theoretical papers that offer perspective on why CNNs are appropriate for inverse problems and point to some next steps in the field.
Route Selection Problem Based on Hopfield Neural Network
Directory of Open Access Journals (Sweden)
N. Kojic
2013-12-01
Full Text Available Transport network is a key factor of economic, social and every other form of development in the region and the state itself. One of the main conditions for transport network development is the construction of new routes. Often, the construction of regional roads is dominant, since the design and construction in urban areas is quite limited. The process of analysis and planning the new roads is a complex process that depends on many factors (the physical characteristics of the terrain, the economic situation, political decisions, environmental impact, etc. and can take several months. These factors directly or indirectly affect the final solution, and in combination with project limitations and requirements, sometimes can be mutually opposed. In this paper, we present one software solution that aims to find Pareto optimal path for preliminary design of the new roadway. The proposed algorithm is based on many different factors (physical and social with the ability of their increase. This solution is implemented using Hopfield's neural network, as a kind of artificial intelligence, which has shown very good results for solving complex optimization problems.
Rules Placement Problem in OpenFlow Networks: a Survey
Nguyen, Xuan Nam; Saucez, Damien; Barakat, Chadi; Turletti, Thierry
2016-01-01
International audience; Software-Defined Networking (SDN) abstracts low- level network functionalities to simplify network management and reduce costs. The OpenFlow protocol implements the SDN concept by abstracting network communications as flows to be processed by network elements. In OpenFlow, the high-level policies are translated into network primitives called rules that are distributed over the network. While the abstraction offered by OpenFlow allows to potentially implement any policy...
A Hub Location Problem with Fully Interconnected Backbone and Access Networks
DEFF Research Database (Denmark)
Thomadsen, Tommy; Larsen, Jesper
2007-01-01
This paper considers the design of two-layered fully interconnected networks. A two-layered network consists of clusters of nodes, each defining an access network and a backbone network. We consider the integrated problem of determining the access networks and the backbone network simultaneously...... problems. We obtain superior bounds using the column generation approach than with the linear programming relaxation. The column generation method is therefore developed into an exact approach using the Branch-and-Price framework. With this approach we are able to solve problems consisting of up to 25...
Enhancement of a model for Large-scale Airline Network Planning Problems
Kölker, K.; Lopes dos Santos, B.F.; Lütjens, K.
2016-01-01
The main focus of this study is to solve the network planning problem based on passenger decision criteria including the preferred departure time and travel time for a real-sized airline network. For this purpose, a model of the integrated network planning problem is formulated including scheduling
Sensitivity analysis of linear programming problem through a recurrent neural network
Das, Raja
2017-11-01
In this paper we study the recurrent neural network for solving linear programming problems. To achieve optimality in accuracy and also in computational effort, an algorithm is presented. We investigate the sensitivity analysis of linear programming problem through the neural network. A detailed example is also presented to demonstrate the performance of the recurrent neural network.
76 FR 70635 - Provision of U.S. Drug Interdiction Assistance to the Government of Brazil
2011-11-15
... in illicit drug trafficking in that country's airspace is necessary because of the extraordinary threat posed by illicit drug trafficking to the national security of that country; and (2) that country..., 2011 Provision of U.S. Drug Interdiction Assistance to the Government of Brazil Memorandum for the...
78 FR 62951 - Provision of U.S. Drug Interdiction Assistance to the Government of Brazil
2013-10-22
... in illicit drug trafficking in that country's airspace is necessary because of the extraordinary threat posed by illicit drug trafficking to the national security of that country; and (2) that country...--Provision of U.S. Drug Interdiction Assistance to the Government of Brazil #0; #0; #0; Presidential...
3 CFR - Continuation of U.S. Drug Interdiction Assistance to the Government of Colombia
2010-01-01
... the Government of Colombia Presidential Documents Other Presidential Documents Presidential... of Colombia Memorandum for the Secretary of State the Secretary of Defense Pursuant to the authority... (22 U.S.C. 2291-4), I hereby certify, with respect to Colombia, that (1) interdiction of aircraft...
2012-06-08
sometimes reaches coffee and papaya fields, serving to destroy legitimate crops as well as illicit fields (Miller 2010, 7). Additionally, there is...part dedicated partners in the war on drugs, and their willingness and ability to assist in interdiction events is evidenced by the clusters of
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.
Game Theoretic Solutions to Cyber Attack and Network Defense Problems
National Research Council Canada - National Science Library
Shen, Dan; Chen, Genshe; Cruz, Jr., , Jose B; Blasch, Erik; Kruger, Martin
2007-01-01
.... The protection and defense against cyber attacks to computer network is becoming inadequate as the hacker knowledge sophisticates and as the network and each computer system become more complex...
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.
DEFF Research Database (Denmark)
Karsten, Christian Vad; Pisinger, David; Røpke, Stefan
2015-01-01
The multi-commodity network flow problem is an important sub-problem in several heuristics and exact methods for designing route networks for container ships. The sub-problem decides how cargoes should be transported through the network provided by shipping routes. This paper studies the multi......-commodity network flow problem with transit time constraints which puts limits on the duration of the transit of the commodities through the network. It is shown that for the particular application it does not increase the solution time to include the transit time constraints and that including the transit time...... is essential to offer customers a competitive product. © 2015 Elsevier Ltd. All rights reserved....
Weinstock, Jeremiah; Burton, Steve; Rash, Carla J; Moran, Sheila; Biller, Warren; Krudelbach, Norman; Phoenix, Natalie; Morasco, Benjamin J
2011-06-01
Gambling help-lines are an essential access point, or frontline resource, for treatment seeking. This study investigated treatment engagement after calling a gambling help-line. From 2000-2007 over 2,900 unique callers were offered an in-person assessment appointment. Logistic regression analyses assessed predictors of (a) accepting the referral to the in-person assessment appointment and (b) attending the in-person assessment appointment. Over 76% of callers accepted the referral and 55% of all callers attended the in-person assessment appointment. This treatment engagement rate is higher than typically found for other help-lines. Demographic factors and clinical factors such as gender, severity of gambling problems, amount of gambling debt, and coercion by legal and social networks predicted engagement in treatment. Programmatic factors such as offering an appointment within 72 hr also aided treatment engagement. Results suggest gambling help-lines can be a convenient and confidential way for many individuals with gambling problems to access gambling-specific treatment. Alternative services such as telephone counseling may be beneficial for those who do not engage in treatment. (PsycINFO Database Record (c) 2011 APA, all rights reserved).
Visualization of protein interaction networks: problems and solutions.
Agapito, Giuseppe; Guzzi, Pietro Hiram; Cannataro, Mario
2013-01-01
Visualization concerns the representation of data visually and is an important task in scientific research. Protein-protein interactions (PPI) are discovered using either wet lab techniques, such mass spectrometry, or in silico predictions tools, resulting in large collections of interactions stored in specialized databases. The set of all interactions of an organism forms a protein-protein interaction network (PIN) and is an important tool for studying the behaviour of the cell machinery. Since graphic representation of PINs may highlight important substructures, e.g. protein complexes, visualization is more and more used to study the underlying graph structure of PINs. Although graphs are well known data structures, there are different open problems regarding PINs visualization: the high number of nodes and connections, the heterogeneity of nodes (proteins) and edges (interactions), the possibility to annotate proteins and interactions with biological information extracted by ontologies (e.g. Gene Ontology) that enriches the PINs with semantic information, but complicates their visualization. In these last years many software tools for the visualization of PINs have been developed. Initially thought for visualization only, some of them have been successively enriched with new functions for PPI data management and PIN analysis. The paper analyzes the main software tools for PINs visualization considering four main criteria: (i) technology, i.e. availability/license of the software and supported OS (Operating System) platforms; (ii) interoperability, i.e. ability to import/export networks in various formats, ability to export data in a graphic format, extensibility of the system, e.g. through plug-ins; (iii) visualization, i.e. supported layout and rendering algorithms and availability of parallel implementation; (iv) analysis, i.e. availability of network analysis functions, such as clustering or mining of the graph, and the possibility to interact with external
Wismans, Luc Johannes Josephus; van Berkum, Eric C.; Bliemer, M.C.J.
2014-01-01
Optimization of externalities and accessibility using dynamic traffic management measures on a strategic level is a specific example of solving a multi-objective network design problem. Solving this optimization problem is time consuming, because heuristics like evolutionary multi objective
A new neural network model for solving random interval linear programming problems.
Arjmandzadeh, Ziba; Safi, Mohammadreza; Nazemi, Alireza
2017-05-01
This paper presents a neural network model for solving random interval linear programming problems. The original problem involving random interval variable coefficients is first transformed into an equivalent convex second order cone programming problem. A neural network model is then constructed for solving the obtained convex second order cone problem. Employing Lyapunov function approach, it is also shown that the proposed neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact satisfactory solution of the original problem. Several illustrative examples are solved in support of this technique. Copyright © 2017 Elsevier Ltd. All rights reserved.
A Bi-Projection Neural Network for Solving Constrained Quadratic Optimization Problems.
Xia, Youshen; Wang, Jun
2016-02-01
In this paper, a bi-projection neural network for solving a class of constrained quadratic optimization problems is proposed. It is proved that the proposed neural network is globally stable in the sense of Lyapunov, and the output trajectory of the proposed neural network will converge globally to an optimal solution. Compared with existing projection neural networks (PNNs), the proposed neural network has a very small model size owing to its bi-projection structure. Furthermore, an application to data fusion shows that the proposed neural network is very effective. Numerical results demonstrate that the proposed neural network is much faster than the existing PNNs.
Directory of Open Access Journals (Sweden)
Jiao-Hong Yi
2016-01-01
Full Text Available Probabilistic neural network has successfully solved all kinds of engineering problems in various fields since it is proposed. In probabilistic neural network, Spread has great influence on its performance, and probabilistic neural network will generate bad prediction results if it is improperly selected. It is difficult to select the optimal manually. In this article, a variant of probabilistic neural network with self-adaptive strategy, called self-adaptive probabilistic neural network, is proposed. In self-adaptive probabilistic neural network, Spread can be self-adaptively adjusted and selected and then the best selected Spread is used to guide the self-adaptive probabilistic neural network train and test. In addition, two simplified strategies are incorporated into the proposed self-adaptive probabilistic neural network with the aim of further improving its performance and then two versions of simplified self-adaptive probabilistic neural network (simplified self-adaptive probabilistic neural networks 1 and 2 are proposed. The variants of self-adaptive probabilistic neural networks are further applied to solve the transformer fault diagnosis problem. By comparing them with basic probabilistic neural network, and the traditional back propagation, extreme learning machine, general regression neural network, and self-adaptive extreme learning machine, the results have experimentally proven that self-adaptive probabilistic neural networks have a more accurate prediction and better generalization performance when addressing the transformer fault diagnosis problem.
N.H. Luong (Ngoc Hoang); J.A. La Poutré (Han); P.A.N. Bosman (Peter)
2015-01-01
htmlabstractThis paper tackles the Distribution Network Expansion Planning (DNEP) problem that has to be solved by distribution network operators to decide which, where, and/or when enhancements to electricity networks should be introduced to satisfy the future power demands. We compare two
N.H. Luong (Ngoc Hoang); J.A. La Poutré (Han); P.A.N. Bosman (Peter)
2017-01-01
textabstractThis article tackles the Distribution Network Expansion Planning (DNEP) problem that has to be solved by distribution network operators to decide which, where, and/or when enhancements to electricity networks should be introd uced to satisfy the future power demands. Because of many
Neural networks art: solving problems with multiple solutions and new teaching algorithm.
Dmitrienko, V D; Zakovorotnyi, A Yu; Leonov, S Yu; Khavina, I P
2014-01-01
A new discrete neural networks adaptive resonance theory (ART), which allows solving problems with multiple solutions, is developed. New algorithms neural networks teaching ART to prevent degradation and reproduction classes at training noisy input data is developed. Proposed learning algorithms discrete ART networks, allowing obtaining different classification methods of input.
Hu, Xiaolin; Wang, Jun
2006-11-01
In recent years, a recurrent neural network called projection neural network was proposed for solving monotone variational inequalities and related convex optimization problems. In this paper, we show that the projection neural network can also be used to solve pseudomonotone variational inequalities and related pseudoconvex optimization problems. Under various pseudomonotonicity conditions and other conditions, the projection neural network is proved to be stable in the sense of Lyapunov and globally convergent, globally asymptotically stable, and globally exponentially stable. Since monotonicity is a special case of pseudomononicity, the projection neural network can be applied to solve a broader class of constrained optimization problems related to variational inequalities. Moreover, a new concept, called componentwise pseudomononicity, different from pseudomononicity in general, is introduced. Under this new concept, two stability results of the projection neural network for solving variational inequalities are also obtained. Finally, numerical examples show the effectiveness and performance of the projection neural network.
Kim, Jeong-Nam
2018-01-01
This special issue of Health Communication compiles 10 articles to laud the promise and yet confront the problems in the digital networked information society related to public health. We present this anthology of symphony and cacophony of lay individuals' communicative actions in a digital networked information society. The collection of problems and promise of the new digital world may be a cornerstone joining two worlds-pre- and postdigital network society-and we hope this special issue will help better shape our future states of public health.
Effective teaming of airborne and ground assets for surveillance and interdiction
Muratore, Mark J.
2010-01-01
Approved for public release; distribution is unlimited As Unmanned Aerial Vehicles (UAVs) become more prevalent on the battlefield, ground forces will have to increasingly rely on them for intelligence, surveillance, and reconnaissance (ISR), as well as target marking, and overwatch operations. The Situational Awareness for Surveillance and Interdiction Operations (SASIO) simulation analysis tool uses Design of Experiments (DOX) to study of aspects of UAV surveillance characteristics in co...
Second-order design problem in the Ancona geodetic network
Energy Technology Data Exchange (ETDEWEB)
Baldi, P.; Ferrari, G. (Bologna Univ. (Italy). Ist. di Geofisica); Postpischl, D.; Unguendoli, M. (Bologna Univ. (Italy). Ist. di Topografia, Geodesia e Geofisica Mineraria)
In this note an examination is made of the control network installed in the Ancona area in 1975 for seismotectonic studies. From an analysis of the network there arises the possibility of achieving a considerable improvement in the results by considering a plan of work derived from the a prior analysis of the covariance matrix and improving the atmospheric data fo the correction of electronic distance measurements, by the use of meteorological balloons.
Solving the RWA Problem in WDM Optical Networks Using the BCO Meta-Heuristic
Directory of Open Access Journals (Sweden)
V. S. Aćimović-Raspopović
2010-06-01
Full Text Available This paper researches the routing and wavelength assignment (RWA problem in wavelength routed optical WDM networks with the wavelength conversion capability at different network nodes. We studied the static case in which all connection requests are known in advance, thus a routing decision can be made based on the complete knowledge of the traffic to be served by the network. The Bee Colony Optimization (BCO metaheuristic is applied to solve the RWA problem. We carried out a comprehensive simulation study of the performance of the proposed BCORWA algorithm for different network topologies and traffic scenarios. The obtained simulation results are analyzed and compared.
Bilevel programming problems theory, algorithms and applications to energy networks
Dempe, Stephan; Pérez-Valdés, Gerardo A; Kalashnykova, Nataliya; Kalashnikova, Nataliya
2015-01-01
This book describes recent theoretical findings relevant to bilevel programming in general, and in mixed-integer bilevel programming in particular. It describes recent applications in energy problems, such as the stochastic bilevel optimization approaches used in the natural gas industry. New algorithms for solving linear and mixed-integer bilevel programming problems are presented and explained.
A matheuristic for the liner shipping network design problem
DEFF Research Database (Denmark)
Brouer, Berit Dangaard; Desaulniers, Guy; Pisinger, David
the available fleet of container vessels. The cargo transports make extensive use of transshipments between routes and the number of transshipments of the cargo flow is decisive for network profitability. Computational results are reported for the benchmark suite LINER-LIB 2012 following the industry standard...... of weekly departures on every schedule. The heuristic shows overall good performance and is able to find high quality solutions within competitive execution times. The matheuristic can also be applied as a decision support tool to improve an existing network by optimizing on a designated subset...
Energy Technology Data Exchange (ETDEWEB)
Cottrell, R.Les; Logg, Connie; Chhaparia, Mahesh; /SLAC; Grigoriev, Maxim; /Fermilab; Haro, Felipe; /Chile U., Catolica; Nazir, Fawad; /NUST, Rawalpindi; Sandford, Mark
2006-01-25
End-to-End fault and performance problems detection in wide area production networks is becoming increasingly hard as the complexity of the paths, the diversity of the performance, and dependency on the network increase. Several monitoring infrastructures are built to monitor different network metrics and collect monitoring information from thousands of hosts around the globe. Typically there are hundreds to thousands of time-series plots of network metrics which need to be looked at to identify network performance problems or anomalous variations in the traffic. Furthermore, most commercial products rely on a comparison with user configured static thresholds and often require access to SNMP-MIB information, to which a typical end-user does not usually have access. In our paper we propose new techniques to detect network performance problems proactively in close to realtime and we do not rely on static thresholds and SNMP-MIB information. We describe and compare the use of several different algorithms that we have implemented to detect persistent network problems using anomalous variations analysis in real end-to-end Internet performance measurements. We also provide methods and/or guidance for how to set the user settable parameters. The measurements are based on active probes running on 40 production network paths with bottlenecks varying from 0.5Mbits/s to 1000Mbit/s. For well behaved data (no missed measurements and no very large outliers) with small seasonal changes most algorithms identify similar events. We compare the algorithms' robustness with respect to false positives and missed events especially when there are large seasonal effects in the data. Our proposed techniques cover a wide variety of network paths and traffic patterns. We also discuss the applicability of the algorithms in terms of their intuitiveness, their speed of execution as implemented, and areas of applicability. Our encouraging results compare and evaluate the accuracy of our
Qin, Sitian; Yang, Xiudong; Xue, Xiaoping; Song, Jiahui
2017-10-01
Pseudoconvex optimization problem, as an important nonconvex optimization problem, plays an important role in scientific and engineering applications. In this paper, a recurrent one-layer neural network is proposed for solving the pseudoconvex optimization problem with equality and inequality constraints. It is proved that from any initial state, the state of the proposed neural network reaches the feasible region in finite time and stays there thereafter. It is also proved that the state of the proposed neural network is convergent to an optimal solution of the related problem. Compared with the related existing recurrent neural networks for the pseudoconvex optimization problems, the proposed neural network in this paper does not need the penalty parameters and has a better convergence. Meanwhile, the proposed neural network is used to solve three nonsmooth optimization problems, and we make some detailed comparisons with the known related conclusions. In the end, some numerical examples are provided to illustrate the effectiveness of the performance of the proposed neural network.
Design and Optimisation Problems in Wireless Sensor Networks
Indian Academy of Sciences (India)
Premkumar Karumbu,1.05 ECE,,+91-9448227167
2010-11-14
Nov 14, 2010 ... Recent motivation: event detection in wireless sensor networks. The classical model does not account for many practical aspects. Sleep-wake scheduling of sensors (cost for making observations). Optimal detection with sleep-wake scheduling: [Infocom 2008]. Transient change: The event occurs and then ...
Wavelength and fiber assignment problems on avionic networks
DEFF Research Database (Denmark)
Zhang, Jiang; An, Yi; Berger, Michael Stübert
2011-01-01
system isolation requirements on the networks with shorter span traffics will not greatly increase the wavelength consumption and it will grow faster after the isolation constrains being larger up to certain scale. Regarding the traffics with longer span, the system isolation constrains slowly cause...
A recurrent neural network for solving a class of generalized convex optimization problems.
Hosseini, Alireza; Wang, Jun; Hosseini, S Mohammad
2013-08-01
In this paper, we propose a penalty-based recurrent neural network for solving a class of constrained optimization problems with generalized convex objective functions. The model has a simple structure described by using a differential inclusion. It is also applicable for any nonsmooth optimization problem with affine equality and convex inequality constraints, provided that the objective function is regular and pseudoconvex on feasible region of the problem. It is proven herein that the state vector of the proposed neural network globally converges to and stays thereafter in the feasible region in finite time, and converges to the optimal solution set of the problem. Copyright © 2013 Elsevier Ltd. All rights reserved.
National Research Council Canada - National Science Library
Sutopo, Wahyudi; Erliza, Ayu; Heryansyah, Arien
2016-01-01
.... The network design problem is used to implement supply chain collaboration. In the buying and selling process, sharing information between buyer and supplier are important to obtain a transaction decision...
Optimal locations for a class of nonlinear, single-facility location problems on a network.
Shier, D R; Dearing, P M
1983-01-01
This paper investigates a class of single-facility location problems on an arbitrary network. Necessary and sufficient conditions are obtained for characterizing locally optimal locations with respect to a certain nonlinear objective function. This approach produces a number of new results for locating a facility on an arbitrary network, and in addition it unifies several known results for the special case of tree networks. It also suggests algorithmic procedures for obtaining such optimal locations.
On the existence of efficient solutions to vector optimization problem of traffic flow on network
Directory of Open Access Journals (Sweden)
T. A. Bozhanova
2009-09-01
Full Text Available We studied traffic flow models in vector-valued optimization statement where the flow is controlled at the nodes of network. We considered the case when an objective mapping possesses a weakened property of upper semicontinuity and made no assumptions on the interior of the ordering cone. The sufficient conditions for the existence of efficient controls of the traffic problems are derived. The existence of efficient solutions of vector optimization problem for traffic flow on network are also proved.
On the existence of efficient solutions to vector optimization problem of traffic flow on network
T. A. Bozhanova
2009-01-01
We studied traffic flow models in vector-valued optimization statement where the flow is controlled at the nodes of network. We considered the case when an objective mapping possesses a weakened property of upper semicontinuity and made no assumptions on the interior of the ordering cone. The sufficient conditions for the existence of efficient controls of the traffic problems are derived. The existence of efficient solutions of vector optimization problem for traffic flow on network are also...
A Note on the Art of Network Design Problems | Osagiede | Journal ...
African Journals Online (AJOL)
In this study, we describe some Network Design Problems (NDPs) as well as the network flowbased improvement algorithm for neighbourhood search defined by cycles. The main part of the study is structured around the formulation of the expected duration of stay in the educational system as a NDP. The fundamental ...
Brands, Ties; van Berkum, Eric C.
2014-01-01
The optimization of infrastructure planning in a multimodal network is defined as a multi-objective network design problem, with accessibility, use of urban space by parking, operating deficit and climate impact as objectives. Decision variables are the location of park and ride facilities, train
The Problem of Finding the Maximal Multiple Flow in the Divisible Network and its Special Cases
Directory of Open Access Journals (Sweden)
A. V. Smirnov
2015-01-01
Full Text Available In the article the problem of ﬁnding the maximal multiple ﬂow in the network of any natural multiplicity k is studied. There are arcs of three types: ordinary arcs, multiple arcs and multi-arcs. Each multiple and multi-arc is a union of k linked arcs, which are adjusted with each other. The network constructing rules are described. The deﬁnitions of a divisible network and some associated subjects are stated. The important property of the divisible network is that every divisible network can be partitioned into k parts, which are adjusted on the linked arcs of each multiple and multi-arc. Each part is the ordinary transportation network. The main results of the article are the following subclasses of the problem of ﬁnding the maximal multiple ﬂow in the divisible network. 1. The divisible networks with the multi-arc constraints. Assume that only one vertex is the ending vertex for a multi-arc in k −1 network parts. In this case the problem can be solved in a polynomial time. 2. The divisible networks with the weak multi-arc constraints. Assume that only one vertex is the ending vertex for a multi-arc in s network parts (1 ≤ s < k − 1 and other parts have at least two such vertices. In that case the multiplicity of the multiple ﬂow problem can be decreased to k − s. 3. The divisible network of the parallel structure. Assume that the divisible network component, which consists of all multiple arcs, can be partitioned into subcomponents, each of them containing exactly one vertex-beginning of a multi-arc. Suppose that intersection of each pair of subcomponents is the only vertex-network source x0. If k = 2, the maximal ﬂow problem can be solved in a polynomial time. If k ≥ 3, the problem is NP-complete. The algorithms for each polynomial subclass are suggested. Also, the multiplicity decreasing algorithm for the divisible network with weak multi-arc constraints is formulated.
Adolescent problem behavior in school : the role of peer networks
Geven, S.A.J.
2016-01-01
Adolescence is a notable period during which a considerable share of students tends to engage in problem behavior in school. Students for example skip class, fail to do their best in school, or have serious arguments with their teachers. A student’s decision to engage in such behavior is not usually
A Network Centrality Method for the Rating Problem
2015-01-01
We propose a new method for aggregating the information of multiple users rating multiple items. Our approach is based on the network relations induced between items by the rating activity of the users. Our method correlates better than the simple average with respect to the original rankings of the users, and besides, it is computationally more efficient than other methods proposed in the literature. Moreover, our method is able to discount the information that would be obtained adding to the system additional users with a systematically biased rating activity. PMID:25830502
The Effects Of Disruptive Technology On Project Interdiction
2016-12-01
state of the art in personal privacy and anonymity is changing every day [11], [12]. 6 Disruptive technologies like cryptology and the blockchain ...only parties to be threatened by implementations of blockchain technology. Brooklyn-based software developer ConsenSys aims to provide the same...services as Google, utilizing a distributed network of computers that synchronizes information exchange via a blockchain implementation known as Ethereum
Neural network for solving Nash equilibrium problem in application of multiuser power control.
He, Xing; Yu, Junzhi; Huang, Tingwen; Li, Chuandong; Li, Chaojie
2014-09-01
In this paper, based on an equivalent mixed linear complementarity problem, we propose a neural network to solve multiuser power control optimization problems (MPCOP), which is modeled as the noncooperative Nash game in modern digital subscriber line (DSL). If the channel crosstalk coefficients matrix is positive semidefinite, it is shown that the proposed neural network is stable in the sense of Lyapunov and global convergence to a Nash equilibrium, and the Nash equilibrium is unique if the channel crosstalk coefficients matrix is positive definite. Finally, simulation results on two numerical examples show the effectiveness and performance of the proposed neural network. Copyright © 2014 Elsevier Ltd. All rights reserved.
Innovation, imitation, and problem-solving in a networked group.
Wisdom, Thomas N; Goldstone, Robert L
2011-04-01
We implemented a problem-solving task in which groups of participants simultaneously played a simple innovation game in a complex problem space, with score feedback provided after each of a number of rounds. Each participant in a group was allowed to view and imitate the guesses of others during the game. The results showed the use of social learning strategies previously studied in other species, and demonstrated benefits of social learning and nonlinear effects of group size on strategy and performance. Rather than simply encouraging conformity, groups provided information to each individual about the distribution of useful innovations in the problem space. Imitation facilitated innovation rather than displacing it, because the former allowed good solutions to be propagated and preserved for further cumulative innovations in the group. Participants generally improved their solutions through the use of fairly conservative strategies, such as changing only a small portion of one's solution at a time, and tending to imitate solutions similar to one's own. Changes in these strategies over time had the effect of making solutions increasingly entrenched, both at individual and group levels. These results showed evidence of nonlinear dynamics in the decentralization of innovation, the emergence of group phenomena from complex interactions of individual efforts, stigmergy in the use of social information, and dynamic tradeoffs between exploration and exploitation of solutions. These results also support the idea that innovation and creativity can be recognized at the group level even when group members are generally cautious and imitative.
A STATISTICAL CORRELATION TECHNIQUE AND A NEURAL-NETWORK FOR THE MOTION CORRESPONDENCE PROBLEM
VANDEEMTER, JH; MASTEBROEK, HAK
A statistical correlation technique (SCT) and two variants of a neural network are presented to solve the motion correspondence problem. Solutions of the motion correspondence problem aim to maintain the identities of individuated elements as they move. In a preprocessing stage, two snapshots of a
Dynamic Network Design Problem under Demand Uncertainty: An Adjustable Robust Optimization Approach
Directory of Open Access Journals (Sweden)
Hua Sun
2014-01-01
Full Text Available This paper develops an adjustable robust optimization approach for a network design problem explicitly incorporating traffic dynamics and demand uncertainty. In particular, a cell transmission model based network design problem of linear programming type is considered to describe dynamic traffic flows, and a polyhedral uncertainty set is used to characterize the demand uncertainty. The major contribution of this paper is to formulate such an adjustable robust network design problem as a tractable linear programming model and justify the model which is less conservative by comparing its solution performance with the robust solution from the usual robust model. The numerical results using one network from the literature demonstrate the modeling advantage of the adjustable robust optimization and provided strategic managerial insights for enacting capacity expansion policies under demand uncertainty.
Assessment of network inference methods: how to cope with an underdetermined problem.
Directory of Open Access Journals (Sweden)
Caroline Siegenthaler
Full Text Available The inference of biological networks is an active research area in the field of systems biology. The number of network inference algorithms has grown tremendously in the last decade, underlining the importance of a fair assessment and comparison among these methods. Current assessments of the performance of an inference method typically involve the application of the algorithm to benchmark datasets and the comparison of the network predictions against the gold standard or reference networks. While the network inference problem is often deemed underdetermined, implying that the inference problem does not have a (unique solution, the consequences of such an attribute have not been rigorously taken into consideration. Here, we propose a new procedure for assessing the performance of gene regulatory network (GRN inference methods. The procedure takes into account the underdetermined nature of the inference problem, in which gene regulatory interactions that are inferable or non-inferable are determined based on causal inference. The assessment relies on a new definition of the confusion matrix, which excludes errors associated with non-inferable gene regulations. For demonstration purposes, the proposed assessment procedure is applied to the DREAM 4 In Silico Network Challenge. The results show a marked change in the ranking of participating methods when taking network inferability into account.
A two-layer recurrent neural network for nonsmooth convex optimization problems.
Qin, Sitian; Xue, Xiaoping
2015-06-01
In this paper, a two-layer recurrent neural network is proposed to solve the nonsmooth convex optimization problem subject to convex inequality and linear equality constraints. Compared with existing neural network models, the proposed neural network has a low model complexity and avoids penalty parameters. It is proved that from any initial point, the state of the proposed neural network reaches the equality feasible region in finite time and stays there thereafter. Moreover, the state is unique if the initial point lies in the equality feasible region. The equilibrium point set of the proposed neural network is proved to be equivalent to the Karush-Kuhn-Tucker optimality set of the original optimization problem. It is further proved that the equilibrium point of the proposed neural network is stable in the sense of Lyapunov. Moreover, from any initial point, the state is proved to be convergent to an equilibrium point of the proposed neural network. Finally, as applications, the proposed neural network is used to solve nonlinear convex programming with linear constraints and L1 -norm minimization problems.
A service flow model for the liner shipping network design problem
DEFF Research Database (Denmark)
Plum, Christian Edinger Munk; Pisinger, David; Sigurd, Mikkel M.
2014-01-01
Global liner shipping is a competitive industry, requiring liner carriers to carefully deploy their vessels efficiently to construct a cost competitive network. This paper presents a novel compact formulation of the liner shipping network design problem (LSNDP) based on service flows...... of the network and a penalty for not flowed cargo. The model can be used to design liner shipping networks to utilize a container carrier’s assets efficiently and to investigate possible scenarios of changed market conditions. The model is solved as a Mixed Integer Program. Results are presented for the two...
A network centrality method for the rating problem
Li, Yongli; Wu, Chong
2014-01-01
We propose a new method for aggregating the information of multiple reviewers rating multiple products. Our approach is based on the network relations induced between products by the rating activity of the reviewers. We show that our method is algorithmically implementable even for large numbers of both products and consumers, as is the case for many online sites. Moreover, comparing it with the simple average, which is mostly used in practice, and with other methods previously proposed in the literature, it performs very well under various dimension, proving itself to be an optimal trade--off between computational efficiency, accordance with the reviewers original orderings, and robustness with respect to the inclusion of systematically biased reports.
DEFF Research Database (Denmark)
Cetin, Bilge Kartal; Prasad, Neeli R.; Prasad, Ramjee
2011-01-01
protocols, and the energy model for transmission. In this paper, we tackle the routing challenge for maximum lifetime of the sensor network. We introduce a novel linear programming approach to the maximum lifetime routing problem. To the best of our knowledge, this is the first mathematical programming...... of the maximum lifetime routing problem that considers the operation modes of the node. Solution of the linear programming gives the upper analytical bound for the network lifetime. In order to illustrate teh application of the optimization model, we solved teh problem for different parameter settings...
A Branch and Cut algorithm for the container shipping network design problem
DEFF Research Database (Denmark)
Reinhardt, Line Blander; Pisinger, David
2012-01-01
programming model minimizing the overall cost. To better reflect the real-life situation we take into account the cost of transhipment, a heterogeneous fleet, route dependant capacities, and butterfly routes. To the best of our knowledge it is the first time an exact solution method to the problem considers......The network design problem in liner shipping is of increasing importance in a strongly competitive market where potential cost reductions can influence market share and profits significantly. In this paper the network design and fleet assignment problems are combined into a mixed integer linear...
Barbarosou, Maria P; Maratos, Nicholas G
2008-10-01
In this paper, a recurrent neural network for both convex and nonconvex equality-constrained optimization problems is proposed, which makes use of a cost gradient projection onto the tangent space of the constraints. The proposed neural network constructs a generically nonfeasible trajectory, satisfying the constraints only as t --> infinity. Local convergence results are given that do not assume convexity of the optimization problem to be solved. Global convergence results are established for convex optimization problems. An exponential convergence rate is shown to hold both for the convex case and the nonconvex case. Numerical results indicate that the proposed method is efficient and accurate.
A Branch and Cut algorithm for the container shipping network design problem
DEFF Research Database (Denmark)
Reinhardt, Line Blander; Kallehauge, Brian; Pisinger, David
The network design problem in liner shipping is of increasing importance in a strongly competitive market where potential cost reductions can influence market share and profits significantly. In this paper the network design and fleet assignment problems are combined into a mixed integer linear...... programming model minimizing the overall cost. To better reflect the real-life situation we take into account the cost of transhipment, a heterogeneous fleet, route dependant capacities, and butterfly routes. To the best of our knowledge it is the first time an exact solution method to the problem considers...
Electronic neural network for solving traveling salesman and similar global optimization problems
Thakoor, Anilkumar P. (Inventor); Moopenn, Alexander W. (Inventor); Duong, Tuan A. (Inventor); Eberhardt, Silvio P. (Inventor)
1993-01-01
This invention is a novel high-speed neural network based processor for solving the 'traveling salesman' and other global optimization problems. It comprises a novel hybrid architecture employing a binary synaptic array whose embodiment incorporates the fixed rules of the problem, such as the number of cities to be visited. The array is prompted by analog voltages representing variables such as distances. The processor incorporates two interconnected feedback networks, each of which solves part of the problem independently and simultaneously, yet which exchange information dynamically.
The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
Directory of Open Access Journals (Sweden)
Maria A. Fonoberova
2005-05-01
Full Text Available The dynamic version of the minimum cost multicommodity flow problem that generalizes the static minimum cost multicommodity flow problem is formulated and studied. This dynamic problem is considered on directed networks with a set of commodities, time-varying capacities, fixed transit times on arcs, and a given time horizon. We assume that cost functions, defined on edges, are nonlinear and depend on time and flow and the demand function also depends on time. The corresponding algorithm, based on reducing the dynamic problem to a static problem on a time-expanded network, to solve the minimum cost dynamic multicommodity flow problem is proposed and some details concerning its complexity are discussed. Mathematics Subject Classification 2000: 90B10, 90C35, 90C27.
On the Integrated Job Scheduling and Constrained Network Routing Problem
DEFF Research Database (Denmark)
Gamst, Mette
This paper examines the NP-hard problem of scheduling a number of jobs on a finite set of machines such that the overall profit of executed jobs is maximized. Each job demands a number of resources, which must be sent to the executing machine via constrained paths. Furthermore, two resource demand...... transmissions cannot use the same edge in the same time period. An exact solution approach based on Dantzig-Wolfe decomposition is proposed along with several heuristics. The methods are computationally evaluated on test instances arising from telecommunications with up to 500 jobs and 500 machines. Results...
Pricing and Capacity Planning Problems in Energy Transmission Networks
Villumsen, Jonas Christoffer; Clausen, Jens; Pisinger, David
2011-01-01
Effektiv brug af energi er et stadig vigtigere emne. Miljø-og klima problemer samt bekymring for forsyningssikkerhed har gjort vedvarende energikilder til et reelt alternativ til traditionelle energikilder. Men den fluktuerende karakter af for eksempel vind- og solenergi nødvendiggør en radikal ændring i den m°ade vi planlægger og driver energisystemer. Et andet paradigmeskift, som begyndte i 1990’erne for el-systemer er markedsderegulering, hvilket har ført til en række forskellige markedsst...
Optimality problem of network topology in stocks market analysis
Djauhari, Maman Abdurachman; Gan, Siew Lee
2015-02-01
Since its introduction fifteen years ago, minimal spanning tree has become an indispensible tool in econophysics. It is to filter the important economic information contained in a complex system of financial markets' commodities. Here we show that, in general, that tool is not optimal in terms of topological properties. Consequently, the economic interpretation of the filtered information might be misleading. To overcome that non-optimality problem, a set of criteria and a selection procedure of an optimal minimal spanning tree will be developed. By using New York Stock Exchange data, the advantages of the proposed method will be illustrated in terms of the power-law of degree distribution.
Directory of Open Access Journals (Sweden)
Chih-Chiang Lin
2010-01-01
Full Text Available The broadcast scheduling problem (BSP in packet radio networks is a well-known NP-complete combinatorial optimization problem. The broadcast scheduling avoids packet collisions by allowing only one node transmission in each collision domain of a time division multiple access (TDMA network. It also improves the transmission utilization by assigning one transmission time slot to one or more nodes; thus, each node transmits at least once in each time frame. An optimum transmission schedule could minimize the length of a time frame while minimizing the number of idle nodes. In this paper, we propose a new iterated local search (ILS algorithm that consists of two special perturbation and local search operators to solve the BSPs. Computational experiments are applied to benchmark data sets and randomly generated problem instances. The experimental results show that our ILS approach is effective in solving the problems with only a few runtimes, even for very large networks with 2,500 nodes.
Agarwal, Mukul
2010-01-01
Consider a scenerio where various users want to communicate with each other over an unknown network to within a fidelity criterion. Thus, there are various users. Each user has a source that it wants to send to another user to within some distortion level. We abstract this problem as that of universal communication of random sources over networks to within a distortion criterion. We compute ta universally reliably achievable region for a set of networks where networks in the set are defined in terms of end to end distortion that they achieve for transmission of independent signals between various nodes assuming that there is common randomness between sender and corresponding receiver. Using this, we provide results for when communication of independent signals to within particular fidelity criteria is possible in terms of when reliable communication is possible. Using this, we show that when the sources at the various nodes are independent of each other, it is sufficient to consider separation architectures: ...
The Coverage Problem in Video-Based Wireless Sensor Networks: A Survey
Directory of Open Access Journals (Sweden)
Luiz Affonso Guedes
2010-09-01
Full Text Available Wireless sensor networks typically consist of a great number of tiny low-cost electronic devices with limited sensing and computing capabilities which cooperatively communicate to collect some kind of information from an area of interest. When wireless nodes of such networks are equipped with a low-power camera, visual data can be retrieved, facilitating a new set of novel applications. The nature of video-based wireless sensor networks demands new algorithms and solutions, since traditional wireless sensor networks approaches are not feasible or even efficient for that specialized communication scenario. The coverage problem is a crucial issue of wireless sensor networks, requiring specific solutions when video-based sensors are employed. In this paper, it is surveyed the state of the art of this particular issue, regarding strategies, algorithms and general computational solutions. Open research areas are also discussed, envisaging promising investigation considering coverage in video-based wireless sensor networks.
The coverage problem in video-based wireless sensor networks: a survey.
Costa, Daniel G; Guedes, Luiz Affonso
2010-01-01
Wireless sensor networks typically consist of a great number of tiny low-cost electronic devices with limited sensing and computing capabilities which cooperatively communicate to collect some kind of information from an area of interest. When wireless nodes of such networks are equipped with a low-power camera, visual data can be retrieved, facilitating a new set of novel applications. The nature of video-based wireless sensor networks demands new algorithms and solutions, since traditional wireless sensor networks approaches are not feasible or even efficient for that specialized communication scenario. The coverage problem is a crucial issue of wireless sensor networks, requiring specific solutions when video-based sensors are employed. In this paper, it is surveyed the state of the art of this particular issue, regarding strategies, algorithms and general computational solutions. Open research areas are also discussed, envisaging promising investigation considering coverage in video-based wireless sensor networks.
Practical Solutions for Harmonics Problems Produced in the Distribution Networks
Directory of Open Access Journals (Sweden)
A. F. Zobaa
2006-03-01
Full Text Available Harmonic distortion on the power system is a modern concern due to the technological advances in silicon technology as it presents an increased non-linear loading of the power system. The effects of harmonics are well known: customers could experience major production losses due to the loss of supply as an example, on the other hand, harmonic load currents cause the utility to supply a higher real energy input then the actual real power needed to maintain a plant’s production at a certain level. The utility carries the extra transmission losses due to the harmonic currents. Different solutions will be reviewed as concepts for solving certain types of problems related to power quality. Both theoretical and a case study are presented.
Directory of Open Access Journals (Sweden)
Shuhei Kimura
Full Text Available The inference of a genetic network is a problem in which mutual interactions among genes are inferred from time-series of gene expression levels. While a number of models have been proposed to describe genetic networks, this study focuses on a mathematical model proposed by Vohradský. Because of its advantageous features, several researchers have proposed the inference methods based on Vohradský's model. When trying to analyze large-scale networks consisting of dozens of genes, however, these methods must solve high-dimensional non-linear function optimization problems. In order to resolve the difficulty of estimating the parameters of the Vohradský's model, this study proposes a new method that defines the problem as several two-dimensional function optimization problems. Through numerical experiments on artificial genetic network inference problems, we showed that, although the computation time of the proposed method is not the shortest, the method has the ability to estimate parameters of Vohradský's models more effectively with sufficiently short computation times. This study then applied the proposed method to an actual inference problem of the bacterial SOS DNA repair system, and succeeded in finding several reasonable regulations.
Harmony search optimization algorithm for a novel transportation problem in a consolidation network
Davod Hosseini, Seyed; Akbarpour Shirazi, Mohsen; Taghi Fatemi Ghomi, Seyed Mohammad
2014-11-01
This article presents a new harmony search optimization algorithm to solve a novel integer programming model developed for a consolidation network. In this network, a set of vehicles is used to transport goods from suppliers to their corresponding customers via two transportation systems: direct shipment and milk run logistics. The objective of this problem is to minimize the total shipping cost in the network, so it tries to reduce the number of required vehicles using an efficient vehicle routing strategy in the solution approach. Solving several numerical examples confirms that the proposed solution approach based on the harmony search algorithm performs much better than CPLEX in reducing both the shipping cost in the network and computational time requirement, especially for realistic size problem instances.
Fault-tolerance of a neural network solving the traveling salesman problem
Protzel, P.; Palumbo, D.; Arras, M.
1989-01-01
This study presents the results of a fault-injection experiment that stimulates a neural network solving the Traveling Salesman Problem (TSP). The network is based on a modified version of Hopfield's and Tank's original method. We define a performance characteristic for the TSP that allows an overall assessment of the solution quality for different city-distributions and problem sizes. Five different 10-, 20-, and 30- city cases are sued for the injection of up to 13 simultaneous stuck-at-0 and stuck-at-1 faults. The results of more than 4000 simulation-runs show the extreme fault-tolerance of the network, especially with respect to stuck-at-0 faults. One possible explanation for the overall surprising result is the redundancy of the problem representation.
Directory of Open Access Journals (Sweden)
Caixian Sun
2014-01-01
Full Text Available This paper is devoted to the average consensus problems in directed networks of agents with unknown control direction. In this paper, by using Nussbaum function techniques and Laplacian matrix, novel average consensus protocols are designed for multiagent systems with unknown control direction in the cases of directed networks with fixed and switching topology. In the case of switching topology, the disagreement vector is utilized. Finally, simulation is provided to demonstrate the effectiveness of our results.
DOE Network 2025: Network Research Problems and Challenges for DOE Scientists. Workshop Report
Energy Technology Data Exchange (ETDEWEB)
None, None
2016-02-01
The growing investments in large science instruments and supercomputers by the US Department of Energy (DOE) hold enormous promise for accelerating the scientific discovery process. They facilitate unprecedented collaborations of geographically dispersed teams of scientists that use these resources. These collaborations critically depend on the production, sharing, moving, and management of, as well as interactive access to, large, complex data sets at sites dispersed across the country and around the globe. In particular, they call for significant enhancements in network capacities to sustain large data volumes and, equally important, the capabilities to collaboratively access the data across computing, storage, and instrument facilities by science users and automated scripts and systems. Improvements in network backbone capacities of several orders of magnitude are essential to meet these challenges, in particular, to support exascale initiatives. Yet, raw network speed represents only a part of the solution. Indeed, the speed must be matched by network and transport layer protocols and higher layer tools that scale in ways that aggregate, compose, and integrate the disparate subsystems into a complete science ecosystem. Just as important, agile monitoring and management services need to be developed to operate the network at peak performance levels. Finally, these solutions must be made an integral part of the production facilities by using sound approaches to develop, deploy, diagnose, operate, and maintain them over the science infrastructure.
The problem of colliding networks and its relation to cell fusion and cancer.
Koulakov, Alexei A; Lazebnik, Yuri
2012-11-07
Cell fusion, a process that merges two or more cells into one, is required for normal development and has been explored as a tool for stem cell therapy. It has also been proposed that cell fusion causes cancer and contributes to its progression. These functions rely on a poorly understood ability of cell fusion to create new cell types. We suggest that this ability can be understood by considering cells as attractor networks whose basic property is to adopt a set of distinct, stable, self-maintaining states called attractors. According to this view, fusion of two cell types is a collision of two networks that have adopted distinct attractors. To learn how these networks reach a consensus, we model cell fusion computationally. To do so, we simulate patterns of gene activities using a formalism developed to simulate patterns of memory in neural networks. We find that the hybrid networks can assume attractors that are unrelated to parental attractors, implying that cell fusion can create new cell types by nearly instantaneously moving cells between attractors. We also show that hybrid networks are prone to assume spurious attractors, which are emergent and sporadic network states. This finding means that cell fusion can produce abnormal cell types, including cancerous types, by placing cells into normally inaccessible spurious states. Finally, we suggest that the problem of colliding networks has general significance in many processes represented by attractor networks, including biological, social, and political phenomena. Copyright © 2012 Biophysical Society. Published by Elsevier Inc. All rights reserved.
Problem-Solving Methods for the Prospective Development of Urban Power Distribution Network
Directory of Open Access Journals (Sweden)
A. P. Karpenko
2014-01-01
Full Text Available This article succeeds the former A. P. K nko’ and A. I. Kuzmina’ ubl t on titled "A mathematical model of urban distribution electro-network considering its future development" (electronic scientific and technical magazine "Science and education" No. 5, 2014.The article offers a model of urban power distribution network as a set of transformer and distribution substations and cable lines. All elements of the network and new consumers are determined owing to vectors of parameters consistent with them.A problem of the urban power distribution network design, taking into account a prospective development of the city, is presented as a problem of discrete programming. It is in deciding on the optimal option to connect new consumers to the power supply network, on the number and sites to build new substations, and on the option to include them in the power supply network.Two methods, namely a reduction method for a set the nested tasks of global minimization and a decomposition method are offered to solve the problem.In reduction method the problem of prospective development of power supply network breaks into three subtasks of smaller dimension: a subtask to define the number and sites of new transformer and distribution substations, a subtask to define the option to connect new consumers to the power supply network, and a subtask to include new substations in the power supply network. The vector of the varied parameters is broken into three subvectors consistent with the subtasks. Each subtask is solved using an area of admissible vector values of the varied parameters at the fixed components of the subvectors obtained when solving the higher subtasks.In decomposition method the task is presented as a set of three, similar to reduction method, reductions of subtasks and a problem of coordination. The problem of coordination specifies a sequence of the subtasks solution, defines the moment of calculation termination. Coordination is realized by
Nasertdinova, A. D.; Bochkarev, V. V.
2017-11-01
Deep neural networks with a large number of parameters are a powerful tool for solving problems of pattern recognition, prediction and classification. Nevertheless, overfitting remains a serious problem in the use of such networks. A method of solving the problem of overfitting is proposed in this article. This method is based on reducing the number of independent parameters of a neural network model using the principal component analysis, and can be implemented using existing libraries of neural computing. The algorithm was tested on the problem of recognition of handwritten symbols from the MNIST database, as well as on the task of predicting time series (rows of the average monthly number of sunspots and series of the Lorentz system were used). It is shown that the application of the principal component analysis enables reducing the number of parameters of the neural network model when the results are good. The average error rate for the recognition of handwritten figures from the MNIST database was 1.12% (which is comparable to the results obtained using the "Deep training" methods), while the number of parameters of the neural network can be reduced to 130 times.
A Matheuristic for the Liner Shipping Network Design Problem with Transit Time Restrictions
DEFF Research Database (Denmark)
Brouer, Berit Dangaard; Desaulniers, Guy; Karsten, Christian Vad
2015-01-01
We present a mathematical model for the liner shipping network design problem with transit time restrictions on the cargo flow. We extend an existing matheuristic for the liner shipping network design problem to consider transit time restrictions. The matheuristic is an improvement heuristic, where...... an integer program is solved iteratively as a move operator in a large-scale neighborhood search. To assess the effects of insertions/removals of port calls, flow and revenue changes are estimated for relevant commodities along with an estimation of the change in the vessel cost. Computational results...
Multi-objective optimization model and evolutional solution of network node matching problem
Yao, Xiangjuan; Gong, Dunwei; Wang, Peipei; Chen, Lina
2017-10-01
In reality, many systems can be abstracted as a network. The research results show that there are close relations between different networks. How to find out the corresponding relationship between the nodes of different networks, i.e. the node matching problem, is a topic worthy of further study. The existing network node matching methods often use a single criteria to measure the matching precision of two networks, therefore may obtain inaccurate results. In fact, the matching accuracy of two networks can be measured using different structural information, so as to improve the reliability and accuracy of the matching method. In view of this, this paper establishes a multi-objective optimization model of network node matching problem in which the matching accuracy is measured by multiple criteria. When using evolutionary algorithm to solve the model, the multiple objectives are unified into a fitness function. The experimental results show that this method can obtain better matching accuracy than single-objective method and the random method while using less running time.
Link-prediction to tackle the boundary specification problem in social network surveys
De Wilde, Philippe; Buarque de Lima-Neto, Fernando
2017-01-01
Diffusion processes in social networks often cause the emergence of global phenomena from individual behavior within a society. The study of those global phenomena and the simulation of those diffusion processes frequently require a good model of the global network. However, survey data and data from online sources are often restricted to single social groups or features, such as age groups, single schools, companies, or interest groups. Hence, a modeling approach is required that extrapolates the locally restricted data to a global network model. We tackle this Missing Data Problem using Link-Prediction techniques from social network research, network generation techniques from the area of Social Simulation, as well as a combination of both. We found that techniques employing less information may be more adequate to solve this problem, especially when data granularity is an issue. We validated the network models created with our techniques on a number of real-world networks, investigating degree distributions as well as the likelihood of links given the geographical distance between two nodes. PMID:28426826
A hybrid model for multi-objective capacitated facility location network design problem
Directory of Open Access Journals (Sweden)
Mohammad saeed JabalAmeli
2011-01-01
Full Text Available One of the primary concerns on many traditional capacitated facility location/network problems is to consider transportation and setup facilities in one single objective function. This simple assumption may lead to misleading solutions since the cost of transportation is normally considered for a short period time and, obviously, the higher cost of setting up the facilities may reduce the importance of the transportation cost/network. In this paper, we introduce capacitated facility location/network design problem (CFLNDP with two separate objective functions in forms of multi-objective with limited capacity. The proposed model is solved using a new hybrid algorithm where there are two stages. In the first stage, locations of facilities and design of fundamental network are determined and in the second stage demands are allocated to the facilities. The resulted multi-objective problem is solved using Lexicography method for a well-known example from the literature with 21 node instances. We study the behaviour of the resulted problem under different scenarios in order to gain insight into the behaviour of the model in response to changes in key problem parameters.
Directory of Open Access Journals (Sweden)
Masoud Rabbani
2017-02-01
Full Text Available Nowadays, fiber-optic due to having greater bandwidth and being more efficient compared with other similar technologies, are counted as one the most important tools for data transfer. In this article, an integrated mathematical model for a three-level fiber-optic distribution network with consideration of simultaneous backbone and local access networks is presented in which the backbone network is a ring and the access networks has a star-star topology. The aim of the model is to determine the location of the central offices and splitters, how connections are made between central offices, and allocation of each demand node to a splitter or central office in a way that the wiring cost of fiber optical and concentrator installation are minimized. Moreover, each user’s desired bandwidth should be provided efficiently. Then, the proposed model is validated by GAMS software in small-sized problems, afterwards the model is solved by two meta-heuristic methods including differential evolution (DE and genetic algorithm (GA in large-scaled problems and the results of two algorithms are compared with respect to computational time and objective function obtained value. Finally, a sensitivity analysis is provided. Keyword: Fiber-optic, telecommunication network, hub-location, passive splitter, three-level network.
Interaction Network Estimation: Predicting Problem-Solving Diversity in Interactive Environments
Eagle, Michael; Hicks, Drew; Barnes, Tiffany
2015-01-01
Intelligent tutoring systems and computer aided learning environments aimed at developing problem solving produce large amounts of transactional data which make it a challenge for both researchers and educators to understand how students work within the environment. Researchers have modeled student-tutor interactions using complex networks in…
A Novel Biobjective Risk-Based Model for Stochastic Air Traffic Network Flow Optimization Problem.
Cai, Kaiquan; Jia, Yaoguang; Zhu, Yanbo; Xiao, Mingming
2015-01-01
Network-wide air traffic flow management (ATFM) is an effective way to alleviate demand-capacity imbalances globally and thereafter reduce airspace congestion and flight delays. The conventional ATFM models assume the capacities of airports or airspace sectors are all predetermined. However, the capacity uncertainties due to the dynamics of convective weather may make the deterministic ATFM measures impractical. This paper investigates the stochastic air traffic network flow optimization (SATNFO) problem, which is formulated as a weighted biobjective 0-1 integer programming model. In order to evaluate the effect of capacity uncertainties on ATFM, the operational risk is modeled via probabilistic risk assessment and introduced as an extra objective in SATNFO problem. Computation experiments using real-world air traffic network data associated with simulated weather data show that presented model has far less constraints compared to stochastic model with nonanticipative constraints, which means our proposed model reduces the computation complexity.
Solving the Weighted Constraint Satisfaction Problems Via the Neural Network Approach
Directory of Open Access Journals (Sweden)
Khalid Haddouch
2016-09-01
Full Text Available A wide variety of real world optimization problems can be modelled as Weighted Constraint Satisfaction Problems (WCSPs. In this paper, we model this problem in terms of in original 0-1 quadratic programming subject to leaner constraints. View it performance, we use the continuous Hopfield network to solve the obtained model basing on original energy function. To validate our model, we solve several instance of benchmarking WCSP. In this regard, our approach recognizes the optimal solution of the said instances.
Directory of Open Access Journals (Sweden)
Botond Molnár
Full Text Available There has been a long history of using neural networks for combinatorial optimization and constraint satisfaction problems. Symmetric Hopfield networks and similar approaches use steepest descent dynamics, and they always converge to the closest local minimum of the energy landscape. For finding global minima additional parameter-sensitive techniques are used, such as classical simulated annealing or the so-called chaotic simulated annealing, which induces chaotic dynamics by addition of extra terms to the energy landscape. Here we show that asymmetric continuous-time neural networks can solve constraint satisfaction problems without getting trapped in non-solution attractors. We concentrate on a model solving Boolean satisfiability (k-SAT, which is a quintessential NP-complete problem. There is a one-to-one correspondence between the stable fixed points of the neural network and the k-SAT solutions and we present numerical evidence that limit cycles may also be avoided by appropriately choosing the parameters of the model. This optimal parameter region is fairly independent of the size and hardness of instances, this way parameters can be chosen independently of the properties of problems and no tuning is required during the dynamical process. The model is similar to cellular neural networks already used in CNN computers. On an analog device solving a SAT problem would take a single operation: the connection weights are determined by the k-SAT instance and starting from any initial condition the system searches until finding a solution. In this new approach transient chaotic behavior appears as a natural consequence of optimization hardness and not as an externally induced effect.
PROACTIVE APPROACH TO THE INCIDENT AND PROBLEM MANAGEMENT IN COMMUNICATION NETWORKS
Directory of Open Access Journals (Sweden)
Vjeran Strahonja
2007-06-01
Full Text Available Proactive approach to communication network maintenance has the capability of enhancing the integrity and reliability of communication networks, as well as of reducing maintenance costs and overall number of incidents. This paper presents approaches to problem and incident prevention with the help of root-cause analysis, aligning that with the goal to foresee software performance. Implementation of proactive approach requires recognition of enterprise's current level of maintenance better insights into available approaches and tools, as well as their comparison, interoperability, integration and further development. The approach we are proposing and elaborating in this paper lies on the construction of a metamodel of the problem management of information technology, particularly the proactive problem management. The metamodel is derived from the original ITIL specification and presented in an object-oriented fashion by using structure (class diagrams conform to UML notation. Based on current research, appropriate metrics based on the concept of Key Performance Indicators is suggested.
Method of Geometric Connected Disk Cover Problem for UAV realy network deployment
Directory of Open Access Journals (Sweden)
Chuang Liu
2017-01-01
Full Text Available Aiming at the problem of the effective connectivity of a large number of mobile combat units in the future aeronautic swarm operation, this paper proposes an idea of using UAV(Unmanned Aerial Vehicle to build, and studies the deployment of the network. User coverage and network connectivity are important for a relay network planning which are studied separately in traditional ways. In order to effectively combine these two factors while the network’s survivability is taken into account. Firstly, the concept of node aggregation degree is proposed. Secondly, a performance evaluation parameter for UAV relay network is proposed based on node aggregation degree, then analyzes the lack of deterministic deployment and presents one a PSO (VFA-PSO deployment algorithm based on virtual force. Finally, compared with the existing algorithms, the validity and stability of the algorithm are verified. The experimental results show that the VFA-PSO algorithm can effectively improve the network coverage and the survivability of the network under the premise of ensuring the network connectivity, and has better deployment effect.
A Very Large Area Network (VLAN) knowledge-base applied to space communication problems
Zander, Carol S.
1988-01-01
This paper first describes a hierarchical model for very large area networks (VLAN). Space communication problems whose solution could profit by the model are discussed and then an enhanced version of this model incorporating the knowledge needed for the missile detection-destruction problem is presented. A satellite network or VLAN is a network which includes at least one satellite. Due to the complexity, a compromise between fully centralized and fully distributed network management has been adopted. Network nodes are assigned to a physically localized group, called a partition. Partitions consist of groups of cell nodes with one cell node acting as the organizer or master, called the Group Master (GM). Coordinating the group masters is a Partition Master (PM). Knowledge is also distributed hierarchically existing in at least two nodes. Each satellite node has a back-up earth node. Knowledge must be distributed in such a way so as to minimize information loss when a node fails. Thus the model is hierarchical both physically and informationally.
Tight bounds on the size of neural networks for classification problems
Energy Technology Data Exchange (ETDEWEB)
Beiu, V. [Los Alamos National Lab., NM (United States); Pauw, T. de [Universite Catholique de Louvain, Louvain-la-Neuve (Belgium). Dept. de Mathematique
1997-06-01
This paper relies on the entropy of a data-set (i.e., number-of-bits) to prove tight bounds on the size of neural networks solving a classification problem. First, based on a sequence of geometrical steps, the authors constructively compute an upper bound of O(mn) on the number-of-bits for a given data-set - here m is the number of examples and n is the number of dimensions (i.e., R{sup n}). This result is used further in a nonconstructive way to bound the size of neural networks which correctly classify that data-set.
A note on the consensus finding problem in communication networks with switching topologies
Haskovec, Jan
2014-05-07
In this note, we discuss the problem of consensus finding in communication networks of agents with dynamically switching topologies. In particular, we consider the case of directed networks with unbalanced matrices of communication rates. We formulate sufficient conditions for consensus finding in terms of strong connectivity of the underlying directed graphs and prove that, given these conditions, consensus is found asymptotically. Moreover, we show that this consensus is an emergent property of the system, being encoded in its dynamics and not just an invariant of its initial configuration. © 2014 © 2014 Taylor & Francis.
Fortuin, Janna; van Geel, Mitch; Vedder, Paul
2015-04-01
Adolescents who like each other may become more similar to each other with regard to internalizing and externalizing problems, though it is not yet clear which social mechanisms explain these similarities. In this longitudinal study, we analyzed four mechanisms that may explain similarity in adolescent peer networks with regard to externalizing and internalizing problems: selection, socialization, avoidance and withdrawal. At three moments during one school-year, we asked 542 adolescents (8th grade, M-age = 13.3 years, 51 % female) to report who they liked in their classroom, and their own internalizing and externalizing problems. Adolescents tend to prefer peers who have similar externalizing problem scores, but no significant selection effect was found for internalizing problems. Adolescents who share the same group of friends socialize each other and then become more similar with respect to externalizing problems, but not with respect to internalizing problems. We found no significant effects for avoidance or withdrawal. Adolescents may choose to belong to a peer group that is similar to them in terms of externalizing problem behaviors, and through peer group socialization (e.g., enticing, modelling, mimicking, and peer pressure) become more similar to that group over time.
Lin, Yi-Kuei; Yeh, Cheng-Ta
2013-03-01
Many real-life systems, such as computer systems, manufacturing systems and logistics systems, are modelled as stochastic-flow networks (SFNs) to evaluate network reliability. Here, network reliability, defined as the probability that the network successfully transmits d units of data/commodity from an origin to a destination, is a performance indicator of the systems. Network reliability maximization is a particular objective, but is costly for many system supervisors. This article solves the multi-objective problem of reliability maximization and cost minimization by finding the optimal component assignment for SFN, in which a set of multi-state components is ready to be assigned to the network. A two-stage approach integrating Non-dominated Sorting Genetic Algorithm II and simple additive weighting are proposed to solve this problem, where network reliability is evaluated in terms of minimal paths and recursive sum of disjoint products. Several practical examples related to computer networks are utilized to demonstrate the proposed approach.
Directory of Open Access Journals (Sweden)
Fuller Jeffrey
2012-06-01
Full Text Available Abstract Background While participatory social network analysis can help health service partnerships to solve problems, little is known about its acceptability in cross-cultural settings. We conducted two case studies of chronic illness service partnerships in 2007 and 2008 to determine whether participatory research incorporating social network analysis is acceptable for problem-solving in Australian Aboriginal health service delivery. Methods Local research groups comprising 13–19 partnership staff, policy officers and community members were established at each of two sites to guide the research and to reflect and act on the findings. Network and work practice surveys were conducted with 42 staff, and the results were fed back to the research groups. At the end of the project, 19 informants at the two sites were interviewed, and the researchers conducted critical reflection. The effectiveness and acceptability of the participatory social network method were determined quantitatively and qualitatively. Results Participants in both local research groups considered that the network survey had accurately described the links between workers related to the exchange of clinical and cultural information, team care relationships, involvement in service management and planning and involvement in policy development. This revealed the function of the teams and the roles of workers in each partnership. Aboriginal workers had a high number of direct links in the exchange of cultural information, illustrating their role as the cultural resource, whereas they had fewer direct links with other network members on clinical information exchange and team care. The problem of their current and future roles was discussed inside and outside the local research groups. According to the interview informants the participatory network analysis had opened the way for problem-solving by “putting issues on the table”. While there were confronting and ethically
Hybrid genetic algorithm in the Hopfield network for maximum 2-satisfiability problem
Kasihmuddin, Mohd Shareduwan Mohd; Sathasivam, Saratha; Mansor, Mohd. Asyraf
2017-08-01
Heuristic method was designed for finding optimal solution more quickly compared to classical methods which are too complex to comprehend. In this study, a hybrid approach that utilizes Hopfield network and genetic algorithm in doing maximum 2-Satisfiability problem (MAX-2SAT) was proposed. Hopfield neural network was used to minimize logical inconsistency in interpretations of logic clauses or program. Genetic algorithm (GA) has pioneered the implementation of methods that exploit the idea of combination and reproduce a better solution. The simulation incorporated with and without genetic algorithm will be examined by using Microsoft Visual 2013 C++ Express software. The performance of both searching techniques in doing MAX-2SAT was evaluate based on global minima ratio, ratio of satisfied clause and computation time. The result obtained form the computer simulation demonstrates the effectiveness and acceleration features of genetic algorithm in doing MAX-2SAT in Hopfield network.
Directory of Open Access Journals (Sweden)
N.R.Yusupbekov
2014-07-01
Full Text Available This paper provides a new approach for solving a problem of modeling and structural syntheses of information networks of automated control systems by applying fuzzy sets theory, fuzzy logic and genetic algorithms. The procedure of formalizing structural syntheses of multi-level dispersed information networks of automated control systems is proposed. Also, the paper proposes a conceptual model of evolutionary syntheses based on genetic algorithms, which do not require additional information about the characteristics and features of target function. Modified genetic operators of crossover, mutation and algorithms of evolutionary syntheses of information networks systems are developed. Finally, the results of computational experiments on researching the influence of probability of the use of crossover and mutation operators, method of choosing parental pairs, and the size of initial population on the speed and precision of final results are provided.
A PSO based Artificial Neural Network approach for short term unit commitment problem
Directory of Open Access Journals (Sweden)
AFTAB AHMAD
2010-10-01
Full Text Available Unit commitment (UC is a non-linear, large scale, complex, mixed-integer combinatorial constrained optimization problem. This paper proposes, a new hybrid approach for generating unit commitment schedules using swarm intelligence learning rule based neural network. The training data has been generated using dynamic programming for machines without valve point effects and using genetic algorithm for machines with valve point effects. A set of load patterns as inputs and the corresponding unit generation schedules as outputs are used to train the network. The neural network fine tunes the best results to the desired targets. The proposed approach has been validated for three thermal machines with valve point effects and without valve point effects. The results are compared with the approaches available in the literature. The PSO-ANN trained model gives better results which show the promise of the proposed methodology.
Abdulghafoor, O. B.; Shaat, M. M. R.; Ismail, M.; Nordin, R.; Yuwono, T.; Alwahedy, O. N. A.
2017-05-01
In this paper, the problem of resource allocation in OFDM-based downlink cognitive radio (CR) networks has been proposed. The purpose of this research is to decrease the computational complexity of the resource allocation algorithm for downlink CR network while concerning the interference constraint of primary network. The objective has been secured by adopting pricing scheme to develop power allocation algorithm with the following concerns: (i) reducing the complexity of the proposed algorithm and (ii) providing firm power control to the interference introduced to primary users (PUs). The performance of the proposed algorithm is tested for OFDM- CRNs. The simulation results show that the performance of the proposed algorithm approached the performance of the optimal algorithm at a lower computational complexity, i.e., O(NlogN), which makes the proposed algorithm suitable for more practical applications.
The free boundary problem describing information diffusion in online social networks
Lei, Chengxia; Lin, Zhigui; Wang, Haiyan
In this paper we consider a free boundary problem for a reaction-diffusion logistic equation with a time-dependent growth rate. Such a problem arises in the modeling of information diffusion in online social networks, with the free boundary representing the spreading front of news among users. We present several sharp thresholds for information diffusion that either lasts forever or suspends in finite time. In the former case, we give the asymptotic spreading speed which is determined by a corresponding elliptic equation.
The Technical Problems of Anti-theft Diagnostics in a Traction Network
Mikulski, Jerzy; Młynczak, Jakub
2012-02-01
The paper presents an analysis of traction lines theft in the Katowice division of the Railroad Development Company (Zakład Linii Kolejowych - ZLK) as well as the principles for the anti-theft protection system, currently in development. The problem of theft is a very important issue concerning the safety of rail transportation. It is also a significant economic problem, as the cost of recreating a stolen network is very high. Moreover, the Administrator of the infrastructure bears the cost of compensation for any delays in train schedules.
PROBLEM OF INTERNET COMMUNICATION OF UPPER SECONDARY SCHOOL PUPILS IN ELECTRONIC SOCIAL NETWORKS
Directory of Open Access Journals (Sweden)
Olga E. Konevshchynska
2017-09-01
Full Text Available The article deals with the problem of Internet communication of upper secondary school pupils during interpersonal communication in electronic social networks. The actuality is proved, the system analysis of the psychological and pedagogical, educational-methodical literature of the researched problem is carried out. External written Internet speaking is considered as an important factor in the communication culture of the individual. It has been determined that high level of Internet communication of both students and teachers in the process of interpersonal communication in electronic social networks are important aspects of raising the level of media culture, media information competence of the individual. Also, these ones are necessary requirements of the information society to fulfill project-oriented, educational-cognitive and effective innovative activity in educational practice.
The Bilevel Design Problem for Communication Networks on Trains: Model, Algorithm, and Verification
Directory of Open Access Journals (Sweden)
Yin Tian
2014-01-01
Full Text Available This paper proposes a novel method to solve the problem of train communication network design. Firstly, we put forward a general description of such problem. Then, taking advantage of the bilevel programming theory, we created the cost-reliability-delay model (CRD model that consisted of two parts: the physical topology part aimed at obtaining the networks with the maximum reliability under constrained cost, while the logical topology part focused on the communication paths yielding minimum delay based on the physical topology delivered from upper level. We also suggested a method to solve the CRD model, which combined the genetic algorithm and the Floyd-Warshall algorithm. Finally, we used a practical example to verify the accuracy and the effectiveness of the CRD model and further applied the novel method on a train with six carriages.
A Bayesian network approach to the database search problem in criminal proceedings
2012-01-01
Background The ‘database search problem’, that is, the strengthening of a case - in terms of probative value - against an individual who is found as a result of a database search, has been approached during the last two decades with substantial mathematical analyses, accompanied by lively debate and centrally opposing conclusions. This represents a challenging obstacle in teaching but also hinders a balanced and coherent discussion of the topic within the wider scientific and legal community. This paper revisits and tracks the associated mathematical analyses in terms of Bayesian networks. Their derivation and discussion for capturing probabilistic arguments that explain the database search problem are outlined in detail. The resulting Bayesian networks offer a distinct view on the main debated issues, along with further clarity. Methods As a general framework for representing and analyzing formal arguments in probabilistic reasoning about uncertain target propositions (that is, whether or not a given individual is the source of a crime stain), this paper relies on graphical probability models, in particular, Bayesian networks. This graphical probability modeling approach is used to capture, within a single model, a series of key variables, such as the number of individuals in a database, the size of the population of potential crime stain sources, and the rarity of the corresponding analytical characteristics in a relevant population. Results This paper demonstrates the feasibility of deriving Bayesian network structures for analyzing, representing, and tracking the database search problem. The output of the proposed models can be shown to agree with existing but exclusively formulaic approaches. Conclusions The proposed Bayesian networks allow one to capture and analyze the currently most well-supported but reputedly counter-intuitive and difficult solution to the database search problem in a way that goes beyond the traditional, purely formulaic expressions
The analysis of split graphs in social networks based on the K-Cardinality assignment problem
Belik, Ivan
2014-01-01
In terms of social networks, split graphs correspond to the variety of interpersonal and intergroup relations. In this paper we analyse the interaction between the cliques (socially strong and trusty groups) and the independent sets (fragmented and non-connected groups of people) as the basic components of any split graph. Based on the Semi-Lagrangean relaxation for the k-cardinality assignment problem, we show the way of minimizing the socially risky interactions between the cliques and the ...
The analysis of split graphs in social networks based on the K-Cardinality assignment problem
Belik, Ivan
2014-01-01
In terms of social networks, split graphs correspond to the variety of interpersonal and intergroup relations. In this paper we analyse the interaction between the cliques (socially strong and trusty groups) and the independent sets (fragmented and non-connected groups of people) as the basic components of any split graph. Based on the Semi-Lagrangean relaxation for the kcardinality assignment problem, we show the way of minimizing the socially risky interactions between the cl...
Li, Ming; Miao, Chunyan; Leung, Cyril
2015-12-04
Coverage control is one of the most fundamental issues in directional sensor networks. In this paper, the coverage optimization problem in a directional sensor network is formulated as a multi-objective optimization problem. It takes into account the coverage rate of the network, the number of working sensor nodes and the connectivity of the network. The coverage problem considered in this paper is characterized by the geographical irregularity of the sensed events and heterogeneity of the sensor nodes in terms of sensing radius, field of angle and communication radius. To solve this multi-objective problem, we introduce a learning automata-based coral reef algorithm for adaptive parameter selection and use a novel Tchebycheff decomposition method to decompose the multi-objective problem into a single-objective problem. Simulation results show the consistent superiority of the proposed algorithm over alternative approaches.
Bao, Xu; Li, Haijian; Qin, Lingqiao; Xu, Dongwei; Ran, Bin; Rong, Jian
2016-10-27
To obtain adequate traffic information, the density of traffic sensors should be sufficiently high to cover the entire transportation network. However, deploying sensors densely over the entire network may not be realistic for practical applications due to the budgetary constraints of traffic management agencies. This paper describes several possible spatial distributions of traffic information credibility and proposes corresponding different sensor information credibility functions to describe these spatial distribution properties. A maximum benefit model and its simplified model are proposed to solve the traffic sensor location problem. The relationships between the benefit and the number of sensors are formulated with different sensor information credibility functions. Next, expanding models and algorithms in analytic results are performed. For each case, the maximum benefit, the optimal number and spacing of sensors are obtained and the analytic formulations of the optimal sensor locations are derived as well. Finally, a numerical example is proposed to verify the validity and availability of the proposed models for solving a network sensor location problem. The results show that the optimal number of sensors of segments with different model parameters in an entire freeway network can be calculated. Besides, it can also be concluded that the optimal sensor spacing is independent of end restrictions but dependent on the values of model parameters that represent the physical conditions of sensors and roads.
Directory of Open Access Journals (Sweden)
Dorin Matei
2014-08-01
Full Text Available The changes in the Romanian civil law aimed the issue of tort liability, i.e. the liability of parents for the infringements committed by their children and those placed under judicial interdiction, issues that we will develop within this paper. Without the stated ambition to exhaust the subject, the research aims at a rigorous contribution to the presentation, in the well-known context of the new civil regulations entered into force on 1 October 20112. Therefore we analyze the provisions of Article 1372 of the Civil Code which, over its three paragraphs, develops the hypothesis of assuming the liability of the parents and other categories of respondents for the illegal acts committed by minors or placed under judicial interdiction. We specify that this form of vicarious liability is established as an effective guarantor of the one called to respond, ensuring by the law to repair the damage caused to the victim.
An Effective Recommender Algorithm for Cold-Start Problem in Academic Social Networks
Directory of Open Access Journals (Sweden)
Vala Ali Rohani
2014-01-01
Full Text Available Abundance of information in recent years has become a serious challenge for web users. Recommender systems (RSs have been often utilized to alleviate this issue. RSs prune large information spaces to recommend the most relevant items to users by considering their preferences. Nonetheless, in situations where users or items have few opinions, the recommendations cannot be made properly. This notable shortcoming in practical RSs is called cold-start problem. In the present study, we propose a novel approach to address this problem by incorporating social networking features. Coined as enhanced content-based algorithm using social networking (ECSN, the proposed algorithm considers the submitted ratings of faculty mates and friends besides user’s own preferences. The effectiveness of ECSN algorithm was evaluated by implementing it in MyExpert, a newly designed academic social network (ASN for academics in Malaysia. Real feedbacks from live interactions of MyExpert users with the recommended items are recorded for 12 consecutive weeks in which four different algorithms, namely, random, collaborative, content-based, and ECSN were applied every three weeks. The empirical results show significant performance of ECSN in mitigating the cold-start problem besides improving the prediction accuracy of recommendations when compared with other studied recommender algorithms.
Barnett, Nancy P; Ott, Miles Q; Clark, Melissa A
2014-12-01
Peer associations are influential for substance use among college students, but relatively few investigations have been conducted on the social network characteristics that are associated with problematic alcohol use in college. This study investigated the association between network characteristics of prestige, expansiveness, and reciprocity and alcohol use variables in a college residence hall network. Undergraduate students in 1 residence hall (N = 129; 51.9% female; 48.1% non-Hispanic White; 84.5% first-year) reported on their alcohol use and alcohol-related problems in the past semester and nominated up to 10 residence hall peers who were important to them. Network autocorrelation modeling evaluated the association between 5 network variables reflecting prestige (indegree and betweenness centrality), expansiveness (outdegree), and relationship agreement (indegree reciprocity and outdegree reciprocity) and 3 indicators of alcohol use (drinks per week, number of heavy drinking days, number of alcohol problems). Moderation by gender of the associations between network characteristics and alcohol variables was also investigated. Models controlled for demographics and network autocorrelation. A higher outdegree and higher betweenness centrality within the residence hall network were significantly related to the number of heavy drinking days and number of alcohol problems, respectively. Higher indegree and higher betweenness centrality were associated with more alcohol problems for women when alcohol use was controlled. Having higher prestige and indicating oneself as having more friends in a college residential network may convey alcohol-related risks, with some risks higher for women.
A Multi-Stage Reverse Logistics Network Problem by Using Hybrid Priority-Based Genetic Algorithm
Lee, Jeong-Eun; Gen, Mitsuo; Rhee, Kyong-Gu
Today remanufacturing problem is one of the most important problems regarding to the environmental aspects of the recovery of used products and materials. Therefore, the reverse logistics is gaining become power and great potential for winning consumers in a more competitive context in the future. This paper considers the multi-stage reverse Logistics Network Problem (m-rLNP) while minimizing the total cost, which involves reverse logistics shipping cost and fixed cost of opening the disassembly centers and processing centers. In this study, we first formulate the m-rLNP model as a three-stage logistics network model. Following for solving this problem, we propose a Genetic Algorithm pri (GA) with priority-based encoding method consisting of two stages, and introduce a new crossover operator called Weight Mapping Crossover (WMX). Additionally also a heuristic approach is applied in the 3rd stage to ship of materials from processing center to manufacturer. Finally numerical experiments with various scales of the m-rLNP models demonstrate the effectiveness and efficiency of our approach by comparing with the recent researches.
Urbanoski, Karen; van Mierlo, Trevor; Cunningham, John
2016-08-22
This study contributes to emerging literature on online health networks by modeling communication patterns between members of a moderated online support group for problem drinking. Using social network analysis, we described members' patterns of joint participation in threads, parsing out the role of site moderators, and explored differences in member characteristics by network position. Posts made to the online support group of Alcohol Help Centre during 2013 were structured as a two-mode network of members (n = 205) connected via threads (n = 506). Metrics included degree centrality, clique membership, and tie strength. The network consisted of one component and no cliques of members, although most made few posts and a small number communicated only with the site's moderators. Highly active members were older and tended to have started posting prior to 2013. The distribution of members across threads varied from threads containing posts by one member to others that connected multiple members. Moderators accounted for sizable proportions of the connectivity between both members and threads. After 5 years of operation, the AHC online support group appears to be fairly cohesive and stable, in the sense that there were no isolated subnetworks comprised of specific types of members or devoted to specific topics. Participation and connectedness at the member-level was varied, however, and tended to be low on average. The moderators were among the most central in the network, although there were also members who emerged as central and dedicated contributors to the online discussions across topics. Study findings highlight a number of areas for consideration by online support group developers and managers.
A time-delay neural network for solving time-dependent shortest path problem.
Huang, Wei; Yan, Chunwang; Wang, Jinsong; Wang, Wei
2017-06-01
This paper concerns the time-dependent shortest path problem, which is difficult to come up with global optimal solution by means of classical shortest path approaches such as Dijkstra, and pulse-coupled neural network (PCNN). In this study, we propose a time-delay neural network (TDNN) framework that comes with the globally optimal solution when solving the time-dependent shortest path problem. The underlying idea of TDNN comes from the following mechanism: the shortest path depends on the earliest auto-wave (from start node) that arrives at the destination node. In the design of TDNN, each node on a network is considered as a neuron, which comes in the form of two units: time-window unit and auto-wave unit. Time-window unit is used to generate auto-wave in each time window, while auto-wave unit is exploited here to update the state of auto-wave. Whether or not an auto-wave leaves a node (neuron) depends on the state of auto-wave. The evaluation of the performance of the proposed approach was carried out based on online public Cordeau instances and New York Road instances. The proposed TDNN was also compared with the quality of classical approaches such as Dijkstra and PCNN. Copyright © 2017 Elsevier Ltd. All rights reserved.
Fairness problems at the media access level for high-speed networks
Maly, Kurt J.; Zhang, L.; Game, David
1990-01-01
Most lower speed (approx. 10 Mbps) local area networks use adaptive or random access protocols like Ethernet. Others at higher speed use demand assignment like token or slotted rings. These include Cambridge ring and electronic token ring systems. Fairness issues in representatives of such protocols are discussed. In particular, Fiber Distributed Data Interface (FDDI) was selected as a demand access protocol using tokens, Carrier Sensed Multiple Access/Ring Network (CSMA/RN) a random access protocol, and Distributed Queue Dual Bus (DQDB) a demand access protocol using reservations. Fairness at the media access level was the focus, i.e., attaining access or being excessively delayed when a message is queued to be sent as a function of network location. Within that framework, the essential fairness of FDDI was observed along with severe fairness problems in DQDB and some problems for CSMA/RN. Several modifications were investigated and their ameliorative effect is shown. Finally, a unified presentation which allows comparisons of the three protocols' fairness when normalized to their capacity is given.
Directory of Open Access Journals (Sweden)
Madleňák Radovan
2016-09-01
Full Text Available The article deals with the optimizing the postal transportation network with two different optimizing methods. The research adopted in this article uses allocation models within graph theory to obtain results for addressed optimization problem. The article presents and compares two types of these models: p-median and uncapacitated fixed charge facility location model. The aim of p-median model is to find the location of P facilities in network, serving all demands in a way ensuring the average transport cost to be minimal. Fixed charge location model approach the issue of facility location based on minimizing the overall costs of implementation of selected variants. The latter this two models are subsequently applied on the postal network to determine the optimal location of postal facilities. These two models are adopted in the condition of large country with area above 300 000 km2. The Italy was chosen as a typical country that fits this condition. The underlying infrastructure of Italy is represented by simplified model of a postal network, abstracted by a graph G = (V, E, c, w.
Mikami, Amori Yee; Szwedo, David E.; Allen, Joseph P.; Evans, Meredyth A.; Hare, Amanda L.
2010-01-01
This study examined online communication on social networking web pages in a longitudinal sample of 92 youths (39 male, 53 female). Participants' social and behavioral adjustment was assessed when they were ages 13–14 years and again at ages 20–22 years. At ages 20–22 years, participants' social networking website use and indicators of friendship quality on their web pages were coded by observers. Results suggested that youths who had been better adjusted at ages 13–14 years were more likely to be using social networking web pages at ages 20–22 years, after statistically controlling for age, gender, ethnicity, and parental income. Overall, youths' patterns of peer relationships, friendship quality, and behavioral adjustment at ages 13–14 years and at ages 20–22 years predicted similar qualities of interaction and problem behavior on their social networking websites at ages 20–22 years. Findings are consistent with developmental theory asserting that youths display cross-situational continuity in their social behaviors and suggest that the conceptualization of continuity may be extended into the online domain. PMID:20053005
Directory of Open Access Journals (Sweden)
R. Rajakumar
2017-01-01
Full Text Available Seyedali Mirjalili et al. (2014 introduced a completely unique metaheuristic technique particularly grey wolf optimization (GWO. This algorithm mimics the social behavior of grey wolves whereas it follows the leadership hierarchy and attacking strategy. The rising issue in wireless sensor network (WSN is localization problem. The objective of this problem is to search out the geographical position of unknown nodes with the help of anchor nodes in WSN. In this work, GWO algorithm is incorporated to spot the correct position of unknown nodes, so as to handle the node localization problem. The proposed work is implemented using MATLAB 8.2 whereas nodes are deployed in a random location within the desired network area. The parameters like computation time, percentage of localized node, and minimum localization error measures are utilized to analyse the potency of GWO rule with other variants of metaheuristics algorithms such as particle swarm optimization (PSO and modified bat algorithm (MBA. The observed results convey that the GWO provides promising results compared to the PSO and MBA in terms of the quick convergence rate and success rate.
Directory of Open Access Journals (Sweden)
Wahyudi Sutopo
2016-12-01
Full Text Available In recent years, the rising competitive environment with shorter product life cycles and high customization forces industries to increase their flexibility, speed up their response, and enhance concurrent engineering designs. To integrate these prospects, supply chain collaboration becomes a pertinent strategy for industries to strengthen their competitiveness. The network design problem is used to implement supply chain collaboration. In the buying and selling process, sharing information between buyer and supplier are important to obtain a transaction decision. The optimimum supply chain profit can be identified by mathematical model of network design problem. The Mathematical Model takes into consideration the uncertainity in negotiation of supply chain, transportation problems, and locationallocation of products from supplier to buyer in the planning based on the time value of money. The results show that the model can be used to optimize the supply chain profit. The supplier gets a profit because income were received in the initial contract, while the buyer profit comes from lower pay.
GNU Oflox: an academic software for the minimal cost network flow problem
Directory of Open Access Journals (Sweden)
Andrés M. Sajo-Castelli
2013-07-01
Full Text Available We present an open-source software package written for GNU Octave. The software is an implementation of the Simplex algorithm for the minimal cost network flow problem oriented towards the academic environment. The implementation supports the use of Big-M and Phase I/Phase II methods and it can also start from a given feasible solution. Flexibility of the package's output configuration provides many attractive possibilities. The outputs are plain editable \\LaTeX\\ files that can be modified and orchestrated to fit most academic needs. It can be used in examination materials, homework assignments or even form part of a project. The format used to describe the network is the DIMACS min file format to which a simple extension was added in order to support the description of feasible trees in the file.
INTERCONNECTING NETWORKS WITH DIFFERENT LEVELS OF SECURITY – A PRESENT NATO PROBLEM
Directory of Open Access Journals (Sweden)
LIVIU TATOMIR
2016-07-01
Full Text Available A situation often met in the Romanian Armed Forces in recent years is the need for interconnecting two networks (domains with different levels of classification. Considering that the Romanian armed troops are involved in numerous missions with NATO partners, solutions, already implemented across the organization, are considered to be applied in domestic systems, also. This paper presents the solutions adopted by NATO in order to solve the problem of cross -domains interconnections. We present the maturity level reached by these solutions and the possibility of implementing these solutions in the Romanian Armed Forces, with or without specific adaptation to our own rules and regulations. The goal is to use a NATO already proved solution to our national classified networks.
Application of Set Covering Location Problem for Organizing the Public Postal Network
Directory of Open Access Journals (Sweden)
Dragana Šarac
2016-08-01
Full Text Available Most countries of the European Union ensure certain obligations (criteria which universal service providers must meet to ensure the realization of the universal service. These criteria vary from country to country, giving their own choice of an optimal model for the density of the postal network. Such postal network of the operator providing universal postal service must be organized so that post offices are accessible at the optimal distance from the user. This paper presents two different approaches. The first one is based on the population criteria determined in the previous study. The second one is new, a general method created to determine the minimum number of postal unit applications of Set Covering Location Problem. The authors apply both methods on real data collected from the Serbian municipalities and finally, compare the obtained results.
An Integrated Approach for Reliable Facility Location/Network Design Problem with Link Disruption
Directory of Open Access Journals (Sweden)
Davood Shishebori
2015-05-01
Full Text Available Proposing a robust designed facility location is one of the most effective ways to hedge against unexpected disruptions and failures in a transportation network system. This paper considers the combined facility location/network design problem with regard to transportation link disruptions and develops a mixed integer linear programming formulation to model it. With respect to the probability of link disruptions, the objective function of the model minimizes the total costs, including location costs, link construction costs and also the expected transportation costs. An efficient hybrid algorithm based on LP relaxation and variable neighbourhood search metaheuristic is developed in order to solve the mathematical model. Numerical results demonstrate that the proposed hybrid algorithm has suitable efficiency in terms of duration of solution time and determining excellent solution quality.
Gujarathi, Ashish M.; Purohit, S.; Srikanth, B.
2015-06-01
Detailed working principle of jumping gene adaptation of differential evolution (DE-JGa) is presented. The performance of the DE-JGa algorithm is compared with the performance of differential evolution (DE) and modified DE (MDE) by applying these algorithms on industrial problems. In this study Reactor network design (RND) problem is solved using DE, MDE, and DE-JGa algorithms: These industrial processes are highly nonlinear and complex with reference to optimal operating conditions with many equality and inequality constraints. Extensive computational comparisons have been made for all the chemical engineering problems considered. The results obtained in the present study show that DE-JGa algorithm outperforms the other algorithms (DE and MDE). Several comparisons are made among the algorithms with regard to the number of function evaluations (NFE)/CPU- time required to find the global optimum. The standard deviation and the variance values obtained using DE-JGa, DE and MDE algorithms also show that the DE-JGa algorithm gives consistent set of results for the majority of the test problems and the industrial real world problems.
Melvin Ballera; Ismail Ateya Lukandu; Abdalla Radwan
2013-01-01
This paper examines the use of social network media at three aspects in African and Libyan perspective. Firstly, to use social network media as an open network learning environment that provide service for interaction necessary for learners to support socialization and collaboration during problem solving. Secondly, to use social media as a tool to support blended learning in e-learning system and encourage non-native English students to express their ideas and fill the gap of communication p...
Hsu, Ching-Kun; Hwang, Gwo-Jen; Chuang, Chien-Wen; Chang, Chih-Kai
2012-01-01
Owing to the popularity of computers and computer networks, fostering the web-based problem-solving ability of students has become an important educational objective in recent years. This study attempted to compare the effects of using selected and open network resources on students' intentions with regard to their information system usage by…
Achieving full connectivity of sites in the multiperiod reserve network design problem
Jafari, Nahid; Nuse, Bryan L.; Moore, Clinton; Dilkina, Bistra; Hepinstall-Cymerman, Jeffrey
2017-01-01
The conservation reserve design problem is a challenge to solve because of the spatial and temporal nature of the problem, uncertainties in the decision process, and the possibility of alternative conservation actions for any given land parcel. Conservation agencies tasked with reserve design may benefit from a dynamic decision system that provides tactical guidance for short-term decision opportunities while maintaining focus on a long-term objective of assembling the best set of protected areas possible. To plan cost-effective conservation over time under time-varying action costs and budget, we propose a multi-period mixed integer programming model for the budget-constrained selection of fully connected sites. The objective is to maximize a summed conservation value over all network parcels at the end of the planning horizon. The originality of this work is in achieving full spatial connectivity of the selected sites during the schedule of conservation actions.
A Branch-and-Price Approach to the Feeder Network Design Problem
DEFF Research Database (Denmark)
Santini, Alberto; Plum, Christian Edinger Munk; Røpke, Stefan
2017-01-01
In this paper we consider the problem of designing a container liner shipping feeder network. The designer has to choose which port to serve during many rotations that start and end at a central hub. Many operational characteristics are considered, such as variable leg-by-leg speeds and cargo tra....... These insights were obtained by means of an analysis where scenarios are generated varying internal and external conditions, such as fuel costs and port demands....... transit times. Realistic instances are generated from the LinerLib benchmark suite. The problem is solved with a branch-and-price algorithm, which can solve most instances to optimality within one hour. The results also provide insights on the cost structure and desirable features of optimal routes...
On Algorithms for Nonlinear Minimax and Min-Max-Min Problems and Their Efficiency
2011-03-01
tolerancing and tuning problem (Tits, 1985), geometric facility location problem (Cardinal & Langerman, 2006), and net- work interdiction problem (Martin...Langerman, S. (2006). Min-max-min geometric facility location problems. In Proc. of the European workshop on computational geometry (EWCG06), pp. 149...centering, tolerancing , and tuning problem. J. Optimization Theory and Applications, 45, 487–494. 149 Tomlab (2009). User’s guide for TOMLAB/CPLEX v12.1
Fernández Caballero, Juan Carlos; Martínez, Francisco José; Hervás, César; Gutiérrez, Pedro Antonio
2010-05-01
This paper proposes a multiclassification algorithm using multilayer perceptron neural network models. It tries to boost two conflicting main objectives of multiclassifiers: a high correct classification rate level and a high classification rate for each class. This last objective is not usually optimized in classification, but is considered here given the need to obtain high precision in each class in real problems. To solve this machine learning problem, we use a Pareto-based multiobjective optimization methodology based on a memetic evolutionary algorithm. We consider a memetic Pareto evolutionary approach based on the NSGA2 evolutionary algorithm (MPENSGA2). Once the Pareto front is built, two strategies or automatic individual selection are used: the best model in accuracy and the best model in sensitivity (extremes in the Pareto front). These methodologies are applied to solve 17 classification benchmark problems obtained from the University of California at Irvine (UCI) repository and one complex real classification problem. The models obtained show high accuracy and a high classification rate for each class.
Using Stochastic Spiking Neural Networks on SpiNNaker to Solve Constraint Satisfaction Problems
Fonseca Guerra, Gabriel A.; Furber, Steve B.
2017-01-01
Constraint satisfaction problems (CSP) are at the core of numerous scientific and technological applications. However, CSPs belong to the NP-complete complexity class, for which the existence (or not) of efficient algorithms remains a major unsolved question in computational complexity theory. In the face of this fundamental difficulty heuristics and approximation methods are used to approach instances of NP (e.g., decision and hard optimization problems). The human brain efficiently handles CSPs both in perception and behavior using spiking neural networks (SNNs), and recent studies have demonstrated that the noise embedded within an SNN can be used as a computational resource to solve CSPs. Here, we provide a software framework for the implementation of such noisy neural solvers on the SpiNNaker massively parallel neuromorphic hardware, further demonstrating their potential to implement a stochastic search that solves instances of P and NP problems expressed as CSPs. This facilitates the exploration of new optimization strategies and the understanding of the computational abilities of SNNs. We demonstrate the basic principles of the framework by solving difficult instances of the Sudoku puzzle and of the map color problem, and explore its application to spin glasses. The solver works as a stochastic dynamical system, which is attracted by the configuration that solves the CSP. The noise allows an optimal exploration of the space of configurations, looking for the satisfiability of all the constraints; if applied discontinuously, it can also force the system to leap to a new random configuration effectively causing a restart.
Using Stochastic Spiking Neural Networks on SpiNNaker to Solve Constraint Satisfaction Problems
Directory of Open Access Journals (Sweden)
Gabriel A. Fonseca Guerra
2017-12-01
Full Text Available Constraint satisfaction problems (CSP are at the core of numerous scientific and technological applications. However, CSPs belong to the NP-complete complexity class, for which the existence (or not of efficient algorithms remains a major unsolved question in computational complexity theory. In the face of this fundamental difficulty heuristics and approximation methods are used to approach instances of NP (e.g., decision and hard optimization problems. The human brain efficiently handles CSPs both in perception and behavior using spiking neural networks (SNNs, and recent studies have demonstrated that the noise embedded within an SNN can be used as a computational resource to solve CSPs. Here, we provide a software framework for the implementation of such noisy neural solvers on the SpiNNaker massively parallel neuromorphic hardware, further demonstrating their potential to implement a stochastic search that solves instances of P and NP problems expressed as CSPs. This facilitates the exploration of new optimization strategies and the understanding of the computational abilities of SNNs. We demonstrate the basic principles of the framework by solving difficult instances of the Sudoku puzzle and of the map color problem, and explore its application to spin glasses. The solver works as a stochastic dynamical system, which is attracted by the configuration that solves the CSP. The noise allows an optimal exploration of the space of configurations, looking for the satisfiability of all the constraints; if applied discontinuously, it can also force the system to leap to a new random configuration effectively causing a restart.
Problem of Channel Utilization and Merging Flows in Buffered Optical Burst Switching Networks
Directory of Open Access Journals (Sweden)
Milos Kozak
2013-01-01
Full Text Available In the paper authors verify two problems of methods of operational research in optical burst switching. The first problem is at edge node, related to the medium access delay. The second problem is at an intermediate node related to buffering delay. A correction coefficient K of transmission speed is obtained from the first analysis. It is used in to provide a full-featured link of nominal data rate. Simulations of the second problem reveal interesting results. It is not viable to prepare routing and wavelength assignment based on end-to-end delay, i.e. link's length or number of hops, as commonly used in other frameworks (OCS, Ethernet, IP, etc. nowadays. Other parameters such as buffering probability must be taken into consideration as well. Based on the buffering probability an estimation of the number of optical/electrical converters can be made. This paper concentrates important traffic constraints of buffered optical burst switching. It allows authors to prepare optimization algorithms for regenerators placement in CAROBS networks using methods of operational research.
Directory of Open Access Journals (Sweden)
Mi Gan
2014-01-01
Full Text Available The multiproduct two-layer supply chain is very common in various industries. In this paper, we introduce a possible modeling and algorithms to solve a multiproduct two-layer supply chain network design problem. The decisions involved are the DCs location and capacity design decision and the initial distribution planning decision. First we describe the problem and give a mixed integer programming (MIP model; such problem is NP-hard and it is not easy to reduce the complexity. Inspired by it, we develop a transformation mechanism of relaxing the fixed cost and adding some virtual nodes and arcs to the original network. Thus, a network flow problem (NFP corresponding to the original problem has been formulated. Given that we could solve the NFP as a minimal cost flow problem. The solution procedures and network simplex algorithm (INS are discussed. To verify the effectiveness and efficiency of the model and algorithms, the performance measure experimental has been conducted. The experiments and result showed that comparing with MIP model solved by genetic algorithm (GA and Benders, decomposition algorithm (BD the NFP model and INS are also effective and even more efficient for both small-scale and large-scale problems.
AN EVOLUTIONARY ALGORITHM FOR CHANNEL ASSIGNMENT PROBLEM IN WIRELESS MOBILE NETWORKS
Directory of Open Access Journals (Sweden)
Yee Shin Chia
2012-12-01
Full Text Available The channel assignment problem in wireless mobile network is the assignment of appropriate frequency spectrum to incoming calls while maintaining a satisfactory level of electromagnetic compatibility (EMC constraints. An effective channel assignment strategy is important due to the limited capacity of frequency spectrum in wireless mobile network. Most of the existing channel assignment strategies are based on deterministic methods. In this paper, an adaptive genetic algorithm (GA based channel assignment strategy is introduced for resource management and to reduce the effect of EMC interferences. The most significant advantage of the proposed optimization method is its capability to handle both the reassignment of channels for existing calls as well as the allocation of channel to a new incoming call in an adaptive process to maximize the utility of the limited resources. It is capable to adapt the population size to the number of eligible channels for a particular cell upon new call arrivals to achieve reasonable convergence speed. The MATLAB simulation on a 49-cells network model for both uniform and nonuniform call traffic distributions showed that the proposed channel optimization method can always achieve a lower average new incoming call blocking probability compared to the deterministic based channel assignment strategy.
Zhang, Yin; Wei, Zhiyuan; Zhang, Yinping; Wang, Xin
2017-12-01
Urban heating in northern China accounts for 40% of total building energy usage. In central heating systems, heat is often transferred from heat source to users by the heat network where several heat exchangers are installed at heat source, substations and terminals respectively. For given overall heating capacity and heat source temperature, increasing the terminal fluid temperature is an effective way to improve the thermal performance of such cascade heat exchange network for energy saving. In this paper, the mathematical optimization model of the cascade heat exchange network with three-stage heat exchangers in series is established. Aim at maximizing the cold fluid temperature for given hot fluid temperature and overall heating capacity, the optimal heat exchange area distribution and the medium fluids' flow rates are determined through inverse problem and variation method. The preliminary results show that the heat exchange areas should be distributed equally for each heat exchanger. It also indicates that in order to improve the thermal performance of the whole system, more heat exchange areas should be allocated to the heat exchanger where flow rate difference between two fluids is relatively small. This work is important for guiding the optimization design of practical cascade heating systems.
Sampasa-Kanyinga, H; Hamilton, H A
2015-11-01
Previous research has suggested an association between the use of social networking sites (SNSs) and mental health problems such as psychological distress, suicidal ideation and attempts in adolescents. However, little is known about the factors that might mediate these relationships. The present study examined the link between the use of social networking sites and psychological distress, suicidal ideation and suicide attempts, and tested the mediating role of cyberbullying victimization on these associations in adolescents. The sample consisted of a group of 11-to-20-year-old individuals (n=5126, 48% females; mean±SD age: 15.2±1.9 years) who completed the mental health portion of the Ontario Student Drug Use and Health Survey (OSDUHS) in 2013. Multiple logistic regression analyses were used to test the mediation models. After adjustment for age, sex, ethnicity, subjective socioeconomic status (SES), and parental education, use of SNSs was associated with psychological distress (adjusted odds ratio, 95% confidence interval=2.03, 1.22-3.37), suicidal ideation (3.44, 1.54-7.66) and attempts (5.10, 1.45-17.88). Cyberbullying victimization was found to fully mediate the relationships between the use of SNSs with psychological distress and attempts; whereas, it partially mediated the link between the use of SNSs and suicidal ideation. Findings provide supporting evidence that addressing cyberbullying victimization and the use of SNSs among adolescents may help reduce the risk of mental health problems. Copyright © 2015 Elsevier Masson SAS. All rights reserved.
An MPCC Formulation and Its Smooth Solution Algorithm for Continuous Network Design Problem
Directory of Open Access Journals (Sweden)
Guangmin Wang
2017-12-01
Full Text Available Continuous network design problem (CNDP is searching for a transportation network configuration to minimize the sum of the total system travel time and the investment cost of link capacity expansions by considering that the travellers follow a traditional Wardrop user equilibrium (UE to choose their routes. In this paper, the CNDP model can be formulated as mathematical programs with complementarity constraints (MPCC by describing UE as a non-linear complementarity problem (NCP. To address the difficulty resulting from complementarity constraints in MPCC, they are substituted by the Fischer-Burmeister (FB function, which can be smoothed by the introduction of the smoothing parameter. Therefore, the MPCC can be transformed into a well-behaved non-linear program (NLP by replacing the complementarity constraints with a smooth equation. Consequently, the solver such as LINDOGLOBAL in GAMS can be used to solve the smooth approximate NLP to obtain the solution to MPCC for modelling CNDP. The numerical experiments on the example from the literature demonstrate that the proposed algorithm is feasible.
A novel constructive-optimizer neural network for the traveling salesman problem.
Saadatmand-Tarzjan, Mahdi; Khademi, Morteza; Akbarzadeh-T, Mohammad-R; Moghaddam, Hamid Abrishami
2007-08-01
In this paper, a novel constructive-optimizer neural network (CONN) is proposed for the traveling salesman problem (TSP). CONN uses a feedback structure similar to Hopfield-type neural networks and a competitive training algorithm similar to the Kohonen-type self-organizing maps (K-SOMs). Consequently, CONN is composed of a constructive part, which grows the tour and an optimizer part to optimize it. In the training algorithm, an initial tour is created first and introduced to CONN. Then, it is trained in the constructive phase for adding a number of cities to the tour. Next, the training algorithm switches to the optimizer phase for optimizing the current tour by displacing the tour cities. After convergence in this phase, the training algorithm switches to the constructive phase anew and is continued until all cities are added to the tour. Furthermore, we investigate a relationship between the number of TSP cities and the number of cities to be added in each constructive phase. CONN was tested on nine sets of benchmark TSPs from TSPLIB to demonstrate its performance and efficiency. It performed better than several typical Neural networks (NNs), including KNIES_TSP_Local, KNIES_TSP_Global, Budinich's SOM, Co-Adaptive Net, and multivalued Hopfield network as wall as computationally comparable variants of the simulated annealing algorithm, in terms of both CPU time and accuracy. Furthermore, CONN converged considerably faster than expanding SOM and evolved integrated SOM and generated shorter tours compared to KNIES_DECOMPOSE. Although CONN is not yet comparable in terms of accuracy with some sophisticated computationally intensive algorithms, it converges significantly faster than they do. Generally speaking, CONN provides the best compromise between CPU time and accuracy among currently reported NNs for TSP.
Directory of Open Access Journals (Sweden)
Hai-Ling Bi
2016-01-01
Full Text Available Hubs disruptions are taken into account in design of a resilient power projection network. The problem is tackled from a multiple criteria decision-making (MCDM perspective. Not only the network cost in normal state is considered, but also the cost in the worst-case situation is taken into account. A biobjective and trilevel integer programming model is proposed using game theory. Moreover, we develop a metaheuristic based on tabu search and shortest path algorithm for the resolution of the complex model. Computational example indicates that making tradeoffs between the performances of the network in different situations is helpful for designing a resilient network.
Cerebellum-inspired neural network solution of the inverse kinematics problem.
Asadi-Eydivand, Mitra; Ebadzadeh, Mohammad Mehdi; Solati-Hashjin, Mehran; Darlot, Christian; Abu Osman, Noor Azuan
2015-12-01
The demand today for more complex robots that have manipulators with higher degrees of freedom is increasing because of technological advances. Obtaining the precise movement for a desired trajectory or a sequence of arm and positions requires the computation of the inverse kinematic (IK) function, which is a major problem in robotics. The solution of the IK problem leads robots to the precise position and orientation of their end-effector. We developed a bioinspired solution comparable with the cerebellar anatomy and function to solve the said problem. The proposed model is stable under all conditions merely by parameter determination, in contrast to recursive model-based solutions, which remain stable only under certain conditions. We modified the proposed model for the simple two-segmented arm to prove the feasibility of the model under a basic condition. A fuzzy neural network through its learning method was used to compute the parameters of the system. Simulation results show the practical feasibility and efficiency of the proposed model in robotics. The main advantage of the proposed model is its generalizability and potential use in any robot.
Solving ill-posed inverse problems using iterative deep neural networks
Adler, Jonas; Öktem, Ozan
2017-12-01
We propose a partially learned approach for the solution of ill-posed inverse problems with not necessarily linear forward operators. The method builds on ideas from classical regularisation theory and recent advances in deep learning to perform learning while making use of prior information about the inverse problem encoded in the forward operator, noise model and a regularising functional. The method results in a gradient-like iterative scheme, where the ‘gradient’ component is learned using a convolutional network that includes the gradients of the data discrepancy and regulariser as input in each iteration. We present results of such a partially learned gradient scheme on a non-linear tomographic inversion problem with simulated data from both the Sheep-Logan phantom as well as a head CT. The outcome is compared against filtered backprojection and total variation reconstruction and the proposed method provides a 5.4 dB PSNR improvement over the total variation reconstruction while being significantly faster, giving reconstructions of 512 × 512 pixel images in about 0.4 s using a single graphics processing unit (GPU).
A framework to approach problems of forensic anthropology using complex networks
Caridi, Inés; Dorso, Claudio O.; Gallo, Pablo; Somigliana, Carlos
2011-05-01
We have developed a method to analyze and interpret emerging structures in a set of data which lacks some information. It has been conceived to be applied to the problem of getting information about people who disappeared in the Argentine state of Tucumán from 1974 to 1981. Even if the military dictatorship formally started in Argentina had begun in 1976 and lasted until 1983, the disappearance and assassination of people began some months earlier. During this period several circuits of Illegal Detention Centres (IDC) were set up in different locations all over the country. In these secret centres, disappeared people were illegally kept without any sort of constitutional guarantees, and later assassinated. Even today, the final destination of most of the disappeared people’s remains is still unknown. The fundamental hypothesis in this work is that a group of people with the same political affiliation whose disappearances were closely related in time and space shared the same place of captivity (the same IDC or circuit of IDCs). This hypothesis makes sense when applied to the systematic method of repression and disappearances which was actually launched in Tucumán, Argentina (2007) [11]. In this work, the missing individuals are identified as nodes on a network and connections are established among them based on the individuals’ attributes while they were alive, by using rules to link them. In order to determine which rules are the most effective in defining the network, we use other kind of knowledge available in this problem: previous results from the anthropological point of view (based on other sources of information, both oral and written, historical and anthropological data, etc.); and information about the place (one or more IDCs) where some people were kept during their captivity. For these best rules, a prediction about these people’s possible destination is assigned (one or more IDCs where they could have been kept), and the success of the
Network Design for Reliability and Resilience to Attack
2014-03-01
nuclear smuggling interdiction, IIE Transactions , vol. 39, no. 1, pp. 314, Jan. 2007. [31] L. V. Snyder, M. P. Scaparra, M. S. Daskin, and R. L. Church...complexity of network reliability analysis: An overview, IEEE Transactions on Reliability, vol. 35, no. 3, pp. 230239, Aug. 1986. [12] L. G. Valiant, The...Kanturska, J.-D. Schmöcker, and A. Fonzone, Attacker-defender models and road network vulnerability. Philosophical transactions . Series A, Math
Export dynamics as an optimal growth problem in the network of global economy
Caraglio, Michele; Stella, Attilio L
2016-01-01
We analyze export data aggregated at world global level of 219 classes of products over a period of 39 years. Our main goal is to set up a dynamical model to identify and quantify plausible mechanisms by which the evolutions of the various exports affect each other. This is pursued through a stochastic differential description, partly inspired by approaches used in population dynamics or directed polymers in random media. We outline a complex network of transfer rates which describes how resources are shifted between different product classes, and determines how casual favorable conditions for one export can spread to the other ones. A calibration procedure allows to fit four free model-parameters such that the dynamical evolution becomes consistent with the average growth, the fluctuations, and the ranking of the export values observed in real data. Growth crucially depends on the balance between maintaining and shifting resources to different exports, like in an explore-exploit problem. Remarkably, the cali...
On Application of Least-delay Variation Problem in Ethernet Networks Using SDN Concept
Directory of Open Access Journals (Sweden)
Tomas Hegr
2016-01-01
Full Text Available The goal of this paper is to present an application idea of SDN in Smart Grids, particularly, in the area of L2 multicast as defined by IEC 61850-9-2. Authors propose an Integer Linear Formulation (ILP dealing with a Least-Delay-Variation multicast forwarding problem that has a potential to utilize Ethernet networks in a new way. The proposed ILP formulation is numerically evaluated on random graph topologies and results are compared to a shortest path tree approach that is traditionally a product of Spanning Tree Protocols. Results confirm the correctness of the ILP formulation and illustrate dependency of a solution quality on the selected graph models, especially, in a case of scale-free topologies.
Energy Technology Data Exchange (ETDEWEB)
Carlson, K.E.; Ransom, V.H.; Roth, P.A.
1987-03-01
The ATHENA (Advanced Thermal Hydraulic Energy Network Analyzer) code has been developed to perform transient simulation of the thermal hydraulic systems that may be found in fusion reactors, space reactors, and other advanced systems. As an assessment of current capability the code was applied to a number of physical problems, both conceptual and actual experiments. Results indicate that the numerical solution to the basic conservation equations is technically sound, and that generally good agreement can be obtained when modeling relevant hydrodynamic experiments. The assessment also demonstrates basic fusion system modeling capability and verifies compatibility of the code with both CDC and CRAY mainframes. Areas where improvements could be made include constitutive modeling, which describes the interfacial exchange term. 13 refs., 84 figs.
Jayawickreme, Nuwan; Mootoo, Candace; Fountain, Christine; Rasmussen, Andrew; Jayawickreme, Eranda; Bertuccio, Rebecca F
2017-10-01
A growing body of literature indicates that the mental distress experienced by survivors of war is a function of both experienced trauma and stressful life events. However, the majority of these studies are limited in that they 1) employ models of psychological distress that emphasize underlying latent constructs and do not allow researchers to examine the unique associations between particular symptoms and various stressors; and 2) use one or more measures that were not developed for that particular context and thus may exclude key traumas, stressful life events and symptoms of psychopathology. The current study addresses both these limitations by 1) using a novel conceptual model, network analysis, which assumes that symptoms covary with each other not because they stem from a latent construct, but rather because they represent meaningful relationships between the symptoms; and 2) employing a locally developed measure of experienced trauma, stressful life problems and symptoms of psychopathology. Over the course of 2009-2011, 337 survivors of the Sri Lankan civil war were administered the Penn-RESIST-Peradeniya War Problems Questionnaire (PRPWPQ). Network analysis revealed that symptoms of psychopathology, problems pertaining to lack of basic needs, and social problems were central to the network relative to experienced trauma and other types of problems. After controlling for shared associations, social problems in particular were the most central, significantly more so than traumatic events and family problems. Several particular traumatic events, stressful life events and symptoms of psychopathology that were central to the network were also identified. Discussion emphasizes the utility of such network models to researchers and practitioners determining how to spend limited resources in the most impactful way possible. Copyright © 2017 Elsevier Ltd. All rights reserved.
Tabu search methods for multicommodity capcitated fixed charge network design problem
Energy Technology Data Exchange (ETDEWEB)
Crainic, T.; Farvolden, J.; Gendreau, M.; Soriano, P.
1994-12-31
We address the fixed charge capacitated multicommodity network flow problem with linear costs and no additional side constraints, and present two solution approaches based on the tabu search metaheuristic. In the first case, the search is conducted by exploring the space of the design (integer) variables, while neighbors are evaluated and moves are selected via a capacitated multicommodity minimum cost network flow subproblem. The second approach integrates simplex pivoting rules into a tabu search framework. Here, the search explores the space of flow path variables when all design arcs are open, by using column generation to obtain new variables, and pivoting to determine and evaluate the neighbors of any given solution. Adapting this idea within our tabu search framework represents an interesting challenge, since several of the standard assumptions upon which column generation schemes are based are no longer verified. In particular, the monotonic decrease of the objective function value is no longer ensured, and both variable and fixed costs characterize arcs. On the other hand, the precise definition and generation of the tabu search neighborhoods in a column generation context poses an additional challenge, linked particularly to the description and identification of path variables. We describe the various components, implementation challenges and behaviour of each of the two algorithms, and compare their computational and solution quality performance. Comparisons with known bounding procedures will be presented as well.
Kimura, Shuhei; Sato, Masanao; Okada-Hatakeyama, Mariko
2013-01-01
The inference of a genetic network is a problem in which mutual interactions among genes are inferred from time-series of gene expression levels. While a number of models have been proposed to describe genetic networks, this study focuses on a mathematical model proposed by Vohradský. Because of its advantageous features, several researchers have proposed the inference methods based on Vohradský's model. When trying to analyze large-scale networks consisting of dozens of genes, however, these methods must solve high-dimensional non-linear function optimization problems. In order to resolve the difficulty of estimating the parameters of the Vohradský's model, this study proposes a new method that defines the problem as several two-dimensional function optimization problems. Through numerical experiments on artificial genetic network inference problems, we showed that, although the computation time of the proposed method is not the shortest, the method has the ability to estimate parameters of Vohradský's models more effectively with sufficiently short computation times. This study then applied the proposed method to an actual inference problem of the bacterial SOS DNA repair system, and succeeded in finding several reasonable regulations.
Osgood, D Wayne; Feinberg, Mark E; Ragan, Daniel T
2015-08-01
Seeking to reduce problematic peer influence is a prominent theme of programs to prevent adolescent problem behavior. To support the refinement of this aspect of prevention programming, we examined peer influence and selection processes for three problem behaviors (delinquency, alcohol use, and smoking). We assessed not only the overall strengths of these peer processes, but also their consistency versus variability across settings. We used dynamic stochastic actor-based models to analyze five waves of friendship network data across sixth through ninth grades for a large sample of U.S. adolescents. Our sample included two successive grade cohorts of youth in 26 school districts participating in the PROSPER study, yielding 51 longitudinal social networks based on respondents' friendship nominations. For all three self-reported antisocial behaviors, we found evidence of both peer influence and selection processes tied to antisocial behavior. There was little reliable variance in these processes across the networks, suggesting that the statistical imprecision of the peer influence and selection estimates in previous studies likely accounts for inconsistencies in results. Adolescent friendship networks play a strong role in shaping problem behavior, but problem behaviors also inform friendship choices. In addition to preferring friends with similar levels of problem behavior, adolescents tend to choose friends who engage in problem behaviors, thus creating broader diffusion.
Walker, Sandra; Kennedy, Anne; Vassilev, Ivaylo; Rogers, Anne
2017-10-10
Social network processes impact on the genesis and management of mental health problems. There is currently less understanding of the way people negotiate networked relationships in times of crisis compared to how they manage at other times. This paper explores the patterns and nature of personal network involvement at times of crises and how these may differ from day-to-day networks of recovery and maintenance. Semi-structured interviews with 25 participants with a diagnosis of long-term mental health (MH) problems drawn from recovery settings in the south of England. Interviews centred on personal network mapping of members and resources providing support. The mapping interviews explored the work of network members and changes in times of crisis. Interviews were recorded, transcribed and analysed using a framework analysis. Three key themes were identified: the fluidity of network relationality between crisis and recovery; isolation as a means of crises management; leaning towards peer support. Personal network input retreated at times of crisis often as result of "ejection" from the network by participants who used self-isolation as a personal management strategy in an attempt to deal with crises. Peer support is considered useful during a crisis, whilst the role of services was viewed with some ambiguity. Social networks membership, and type and depth of involvement, is subject to change between times of crisis and everyday support. This has implications for managing mental health in terms of engaging with network support differently in times of crises versus recovery and everyday living. © 2017 The Authors Health Expectations Published by John Wiley & Sons Ltd.
Traveling salesman problems with PageRank Distance on complex networks reveal community structure
Jiang, Zhongzhou; Liu, Jing; Wang, Shuai
2016-12-01
In this paper, we propose a new algorithm for community detection problems (CDPs) based on traveling salesman problems (TSPs), labeled as TSP-CDA. Since TSPs need to find a tour with minimum cost, cities close to each other are usually clustered in the tour. This inspired us to model CDPs as TSPs by taking each vertex as a city. Then, in the final tour, the vertices in the same community tend to cluster together, and the community structure can be obtained by cutting the tour into a couple of paths. There are two challenges. The first is to define a suitable distance between each pair of vertices which can reflect the probability that they belong to the same community. The second is to design a suitable strategy to cut the final tour into paths which can form communities. In TSP-CDA, we deal with these two challenges by defining a PageRank Distance and an automatic threshold-based cutting strategy. The PageRank Distance is designed with the intrinsic properties of CDPs in mind, and can be calculated efficiently. In the experiments, benchmark networks with 1000-10,000 nodes and varying structures are used to test the performance of TSP-CDA. A comparison is also made between TSP-CDA and two well-established community detection algorithms. The results show that TSP-CDA can find accurate community structure efficiently and outperforms the two existing algorithms.
Directory of Open Access Journals (Sweden)
M.A. Murray–Lasso.
2010-01-01
Full Text Available The connection matrix of oriented graphs and a generalization introduced by Gondran and Minoux to solve a great variety of path problems, including various optimization problems (maximize or minimize lengths, minimum capacity, probability, etc., ennumeration of paths, path counting, and connection. To achieve this the matrix components are treated as elements of an algebraic structure called semiring or diod (an extension of a monoid. The possibilities of using MATLAB for handling the matrices are explored and listings of educational programs (not for production runs are provided. The purpose is to rescue a topic which has not become very popular due, in the authors opinion, to the fact that the originators Gondran and Minoux (Ref. 3 have treated the topic in a very abstract manner, oriented to mathematicians and difficult to grasp by engineers. In this article the topics are treated informally and illustrative examples are given (something that Ref. 3 does not provide in great detail as well as listings in the MATLAB language. The topic is ammenable to extensions and it is possible to design educational computerized projects for learning important network topics with very wide applications.
Duan, Peibo; Zhang, Changsheng; Mao, Guoqiang; Zhang, Bin
2017-09-22
User association has emerged as a distributed resource allocation problem in the heterogeneous networks (HetNets). Although an approximate solution is obtainable using the approaches like combinatorial optimization and game theory-based schemes, these techniques can be easily trapped in local optima. Furthermore, the lack of exploring the relation between the quality of the solution and the parameters in the HetNet [e.g., the number of users and base stations (BSs)], at what levels, impairs the practicability of deploying these approaches in a real world environment. To address these issues, this paper investigates how to model the problem as a distributed constraint optimization problem (DCOP) from the point of the view of the multiagent system. More specifically, we develop two models named each connection as variable (ECAV) and each BS and user as variable (EBUAV). Hereinafter, we propose a DCOP solver which not only sets up the model in a distributed way but also enables us to efficiently obtain the solution by means of a complete DCOP algorithm based on distributed message-passing. Naturally, both theoretical analysis and simulation show that different qualitative solutions can be obtained in terms of an introduced parameter η which has a close relation with the parameters in the HetNet. It is also apparent that there is 6% improvement on the throughput by the DCOP solver comparing with other counterparts when η=3. Particularly, it demonstrates up to 18% increase in the ability to make BSs service more users when the number of users is above 200 while the available resource blocks (RBs) are limited. In addition, it appears that the distribution of RBs allocated to users by BSs is better with the variation of the volume of RBs at the macro BS.
Energy Technology Data Exchange (ETDEWEB)
Mubayi, V.
1995-05-01
The consequences of severe accidents at nuclear power plants can be limited by various protective actions, including emergency responses and long-term measures, to reduce exposures of affected populations. Each of these protective actions involve costs to society. The costs of the long-term protective actions depend on the criterion adopted for the allowable level of long-term exposure. This criterion, called the ``long term interdiction limit,`` is expressed in terms of the projected dose to an individual over a certain time period from the long-term exposure pathways. The two measures of offsite consequences, latent cancers and costs, are inversely related and the choice of an interdiction limit is, in effect, a trade-off between these two measures. By monetizing the health effects (through ascribing a monetary value to life lost), the costs of the two consequence measures vary with the interdiction limit, the health effect costs increasing as the limit is relaxed and the protective action costs decreasing. The minimum of the total cost curve can be used to calculate an optimal long term interdiction limit. The calculation of such an optimal limit is presented for each of five US nuclear power plants which were analyzed for severe accident risk in the NUREG-1150 program by the Nuclear Regulatory Commission.
Possel, B.; Wismans, Luc Johannes Josephus; van Berkum, Eric C.; Bliemer, M.C.J.
2016-01-01
Incorporation of externalities in the Multi-Objective Network Design Problem (MO NDP) as objectives is an important step in designing sustainable networks. In this research the problem is defined as a bi-level optimization problem in which minimizing externalities are the objectives and link types
Zainudin, Suhaila; Arif, Shereena M.
2017-01-01
Gene regulatory network (GRN) reconstruction is the process of identifying regulatory gene interactions from experimental data through computational analysis. One of the main reasons for the reduced performance of previous GRN methods had been inaccurate prediction of cascade motifs. Cascade error is defined as the wrong prediction of cascade motifs, where an indirect interaction is misinterpreted as a direct interaction. Despite the active research on various GRN prediction methods, the discussion on specific methods to solve problems related to cascade errors is still lacking. In fact, the experiments conducted by the past studies were not specifically geared towards proving the ability of GRN prediction methods in avoiding the occurrences of cascade errors. Hence, this research aims to propose Multiple Linear Regression (MLR) to infer GRN from gene expression data and to avoid wrongly inferring of an indirect interaction (A → B → C) as a direct interaction (A → C). Since the number of observations of the real experiment datasets was far less than the number of predictors, some predictors were eliminated by extracting the random subnetworks from global interaction networks via an established extraction method. In addition, the experiment was extended to assess the effectiveness of MLR in dealing with cascade error by using a novel experimental procedure that had been proposed in this work. The experiment revealed that the number of cascade errors had been very minimal. Apart from that, the Belsley collinearity test proved that multicollinearity did affect the datasets used in this experiment greatly. All the tested subnetworks obtained satisfactory results, with AUROC values above 0.5. PMID:28250767
Salleh, Faridah Hani Mohamed; Zainudin, Suhaila; Arif, Shereena M
2017-01-01
Gene regulatory network (GRN) reconstruction is the process of identifying regulatory gene interactions from experimental data through computational analysis. One of the main reasons for the reduced performance of previous GRN methods had been inaccurate prediction of cascade motifs. Cascade error is defined as the wrong prediction of cascade motifs, where an indirect interaction is misinterpreted as a direct interaction. Despite the active research on various GRN prediction methods, the discussion on specific methods to solve problems related to cascade errors is still lacking. In fact, the experiments conducted by the past studies were not specifically geared towards proving the ability of GRN prediction methods in avoiding the occurrences of cascade errors. Hence, this research aims to propose Multiple Linear Regression (MLR) to infer GRN from gene expression data and to avoid wrongly inferring of an indirect interaction (A → B → C) as a direct interaction (A → C). Since the number of observations of the real experiment datasets was far less than the number of predictors, some predictors were eliminated by extracting the random subnetworks from global interaction networks via an established extraction method. In addition, the experiment was extended to assess the effectiveness of MLR in dealing with cascade error by using a novel experimental procedure that had been proposed in this work. The experiment revealed that the number of cascade errors had been very minimal. Apart from that, the Belsley collinearity test proved that multicollinearity did affect the datasets used in this experiment greatly. All the tested subnetworks obtained satisfactory results, with AUROC values above 0.5.
Directory of Open Access Journals (Sweden)
Faridah Hani Mohamed Salleh
2017-01-01
Full Text Available Gene regulatory network (GRN reconstruction is the process of identifying regulatory gene interactions from experimental data through computational analysis. One of the main reasons for the reduced performance of previous GRN methods had been inaccurate prediction of cascade motifs. Cascade error is defined as the wrong prediction of cascade motifs, where an indirect interaction is misinterpreted as a direct interaction. Despite the active research on various GRN prediction methods, the discussion on specific methods to solve problems related to cascade errors is still lacking. In fact, the experiments conducted by the past studies were not specifically geared towards proving the ability of GRN prediction methods in avoiding the occurrences of cascade errors. Hence, this research aims to propose Multiple Linear Regression (MLR to infer GRN from gene expression data and to avoid wrongly inferring of an indirect interaction (A → B → C as a direct interaction (A → C. Since the number of observations of the real experiment datasets was far less than the number of predictors, some predictors were eliminated by extracting the random subnetworks from global interaction networks via an established extraction method. In addition, the experiment was extended to assess the effectiveness of MLR in dealing with cascade error by using a novel experimental procedure that had been proposed in this work. The experiment revealed that the number of cascade errors had been very minimal. Apart from that, the Belsley collinearity test proved that multicollinearity did affect the datasets used in this experiment greatly. All the tested subnetworks obtained satisfactory results, with AUROC values above 0.5.
Budinich, M
1996-02-15
Unsupervised learning applied to an unstructured neural network can give approximate solutions to the traveling salesman problem. For 50 cities in the plane this algorithm performs like the elastic net of Durbin and Willshaw (1987) and it improves when increasing the number of cities to get better than simulated annealing for problems with more than 500 cities. In all the tests this algorithm requires a fraction of the time taken by simulated annealing.
Nathoo, Arif N; Goldhoff, Patricia; Quattrochi, James J
2005-08-01
This study sought to assess the introduction of a web-based innovation in medical education that complements traditional problem-based learning curricula. Utilizing the case method as its fundamental educational approach, the Interactive Case-based Online Network (ICON) allows students to interact with each other, faculty and a virtual patient in difficult neurological cases. Given the paucity of available metrics to benchmark online systems, we complement user perceptions with data on system utilization. We describe a case study of distinct, small group tutorials over 2 years as part of the Human Nervous System and Behavior (HNSB) course at the Harvard Medical School. Participating students and faculty were interviewed following completion of the course and their utilization of the system was recorded and examined. Students each spent 3.2+/-1.3 h (mean+/-SD) through 8.6+/-2.8 accessions per week using ICON outside of required tutorial time. Faculty each spent 4.8+/-3.4 h through 16.6+/-8.9 accessions per week on ICON. Students identified real-time engagement, stronger relationships with faculty, increased accountability to the tutorial group and self-selected pace as the most beneficial characteristics of the ICON-based tutorial in comparison to traditional problem based learning (PBL) tutorials. Faculty identified enhanced collaboration with students and more realistic student experiences as the most beneficial characteristics. Both students and faculty reported that limitations of ICON included increased time investment for faculty and increased reliance on good faculty mentorship. This is the first study of the ICON learning system in undergraduate medical education, a platform designed to facilitate collaboration outside of the classroom. Data on user perceptions and system utilization suggest that both faculty and students chose to adopt this online learning system as a means for collaboration. The study also outlines future avenues for research in assessing
Shorikov, A. F.; Butsenko, E. V.
2017-10-01
This paper discusses the problem of multicriterial adaptive optimization the control of investment projects in the presence of several technologies. On the basis of network modeling proposed a new economic and mathematical model and a method for solving the problem of multicriterial adaptive optimization the control of investment projects in the presence of several technologies. Network economic and mathematical modeling allows you to determine the optimal time and calendar schedule for the implementation of the investment project and serves as an instrument to increase the economic potential and competitiveness of the enterprise. On a meaningful practical example, the processes of forming network models are shown, including the definition of the sequence of actions of a particular investment projecting process, the network-based work schedules are constructed. The calculation of the parameters of network models is carried out. Optimal (critical) paths have been formed and the optimal time for implementing the chosen technologies of the investment project has been calculated. It also shows the selection of the optimal technology from a set of possible technologies for project implementation, taking into account the time and cost of the work. The proposed model and method for solving the problem of managing investment projects can serve as a basis for the development, creation and application of appropriate computer information systems to support the adoption of managerial decisions by business people.
A path based model for a green liner shipping network design problem
DEFF Research Database (Denmark)
Jepsen, Mads Kehlet; Brouer, Berit Dangaard; Plum, Christian Edinger Munk
2011-01-01
Liner shipping networks are the backbone of international trade providing low transportation cost, which is a major driver of globalization. These networks are under constant pressure to deliver capacity, cost effectiveness and environmentally conscious transport solutions. This article proposes...
Cloud Model-Based Artificial Immune Network for Complex Optimization Problem
Wang, Mingan; Li, Jianming; Guo, Dongliang
2017-01-01
This paper proposes an artificial immune network based on cloud model (AINet-CM) for complex function optimization problems. Three key immune operators—cloning, mutation, and suppression—are redesigned with the help of the cloud model. To be specific, an increasing half cloud-based cloning operator is used to adjust the dynamic clone multipliers of antibodies, an asymmetrical cloud-based mutation operator is used to control the adaptive evolution of antibodies, and a normal similarity cloud-based suppressor is used to keep the diversity of the antibody population. To quicken the searching convergence, a dynamic searching step length strategy is adopted. For comparative study, a series of numerical simulations are arranged between AINet-CM and the other three artificial immune systems, that is, opt-aiNet, IA-AIS, and AAIS-2S. Furthermore, two industrial applications—finite impulse response (FIR) filter design and proportional-integral-differential (PID) controller tuning—are investigated and the results demonstrate the potential searching capability and practical value of the proposed AINet-CM algorithm. PMID:28630620
PRIMARY IMMUNODEFICIENCY: STATUS OF A PROBLEM TODAY. RUSSIAN NETWORK OF JMF-CENTERS
Directory of Open Access Journals (Sweden)
E. A. Latysheva
2013-01-01
Full Text Available The problems of primary immunodeficiency in Russia and the ways of solving of them are discussed in the article. Primary immunodeficiency is a group of rare diseases, so awareness of this pathology in the medical community and among patients is very low. This leads to late diagnosis and inadequate treatment of patients with such conditions. The result of the late beginning of treatment is early development of disability, and the high mortality rate of patients, as well as the high costs of the treatment of complications of primary immunodeficiency and sick-leave certificates for the government. Today in time and adequate therapy allows patients not only to reach adulthood without signs of disability, and to lead an active way of life, but to have healthy children. Given the high cost of therapy in many countries, the issue of providing patients with life-saving drugs remains unresolved. The global practice is to involve social organizations and funds. One of the foundations supporting educational programs, development of laboratories and research in the field of primary immunodeficiency is the Foundation of the Jeffrey Modell. A network of centres for primary immunodeficiency supported by the Jeffrey Modell Foundation (JMF-centers has started its functioning over the territory of the Russian Federation since 2011 in order to improve diagnostics and treatment of patients with primary immunodeficiency. A brief description of activity of these centers is presented in the article.
Inverse and direct problems of optics: usage of artificial neural networks
Abrukov, Victor S.; Pavlov, Roman I.; Malinin, Gennadiy I.
2004-08-01
We describe an application of artificial neural networks (ANN) for solving of inverse and direct problems of optics. Using the ANN we calculate local and integral characteristics of object by means of incomplete set of data that characterize optical images. Possibilities of usage the only one value of a function of signal intensity distributionn in a plane of a registration for full determination of distribution of local characteristics in an object are shown. It is very important for optical fiber sensors, smart sensors and MEMS. Examples of ANN usage for a case of object with a cylindrical symmetry in a field of interferometry are presented. Results obtained show that determination of object local and integral characteristics can be perform very much simpler than by means of standard procedures and numerical approaches for signal processing, reduction and analysis. The ANN can allow also to solve number of tasks that could not be solved by means of usual approaches. In prospects, this method can be used for creation of automated systems for diagnostics, testing and control in various fields of scientific and applied research as well as in industry.
Cloud Model-Based Artificial Immune Network for Complex Optimization Problem
Directory of Open Access Journals (Sweden)
Mingan Wang
2017-01-01
Full Text Available This paper proposes an artificial immune network based on cloud model (AINet-CM for complex function optimization problems. Three key immune operators—cloning, mutation, and suppression—are redesigned with the help of the cloud model. To be specific, an increasing half cloud-based cloning operator is used to adjust the dynamic clone multipliers of antibodies, an asymmetrical cloud-based mutation operator is used to control the adaptive evolution of antibodies, and a normal similarity cloud-based suppressor is used to keep the diversity of the antibody population. To quicken the searching convergence, a dynamic searching step length strategy is adopted. For comparative study, a series of numerical simulations are arranged between AINet-CM and the other three artificial immune systems, that is, opt-aiNet, IA-AIS, and AAIS-2S. Furthermore, two industrial applications—finite impulse response (FIR filter design and proportional-integral-differential (PID controller tuning—are investigated and the results demonstrate the potential searching capability and practical value of the proposed AINet-CM algorithm.
Data Mining and Privacy of Social Network Sites' Users: Implications of the Data Mining Problem.
Al-Saggaf, Yeslam; Islam, Md Zahidul
2015-08-01
This paper explores the potential of data mining as a technique that could be used by malicious data miners to threaten the privacy of social network sites (SNS) users. It applies a data mining algorithm to a real dataset to provide empirically-based evidence of the ease with which characteristics about the SNS users can be discovered and used in a way that could invade their privacy. One major contribution of this article is the use of the decision forest data mining algorithm (SysFor) to the context of SNS, which does not only build a decision tree but rather a forest allowing the exploration of more logic rules from a dataset. One logic rule that SysFor built in this study, for example, revealed that anyone having a profile picture showing just the face or a picture showing a family is less likely to be lonely. Another contribution of this article is the discussion of the implications of the data mining problem for governments, businesses, developers and the SNS users themselves.
Cloud Model-Based Artificial Immune Network for Complex Optimization Problem.
Wang, Mingan; Feng, Shuo; Li, Jianming; Li, Zhonghua; Xue, Yu; Guo, Dongliang
2017-01-01
This paper proposes an artificial immune network based on cloud model (AINet-CM) for complex function optimization problems. Three key immune operators-cloning, mutation, and suppression-are redesigned with the help of the cloud model. To be specific, an increasing half cloud-based cloning operator is used to adjust the dynamic clone multipliers of antibodies, an asymmetrical cloud-based mutation operator is used to control the adaptive evolution of antibodies, and a normal similarity cloud-based suppressor is used to keep the diversity of the antibody population. To quicken the searching convergence, a dynamic searching step length strategy is adopted. For comparative study, a series of numerical simulations are arranged between AINet-CM and the other three artificial immune systems, that is, opt-aiNet, IA-AIS, and AAIS-2S. Furthermore, two industrial applications-finite impulse response (FIR) filter design and proportional-integral-differential (PID) controller tuning-are investigated and the results demonstrate the potential searching capability and practical value of the proposed AINet-CM algorithm.
Mushkin, I.; Solomon, S.
2017-10-01
We study the inverse contagion problem (ICP). As opposed to the direct contagion problem, in which the network structure is known and the question is when each node will be contaminated, in the inverse problem the links of the network are unknown but a sequence of contagion histories (the times when each node was contaminated) is observed. We consider two versions of the ICP: The strong problem (SICP), which is the reconstruction of the network and has been studied before, and the weak problem (WICP), which requires "only" the prediction (at each time step) of the nodes that will be contaminated at the next time step (this is often the real life situation in which a contagion is observed and predictions are made in real time). Moreover, our focus is on analyzing the increasing accuracy of the solution, as a function of the number of contagion histories already observed. For simplicity, we discuss the simplest (deterministic and synchronous) contagion dynamics and the simplest solution algorithm, which we have applied to different network types. The main result of this paper is that the complex problem of the convergence of the ICP for a network can be reduced to an individual property of pairs of nodes: the "false link difficulty". By definition, given a pair of unlinked nodes i and j, the difficulty of the false link (i,j) is the probability that in a random contagion history, the nodes i and j are not contaminated at the same time step (or at consecutive time steps). In other words, the "false link difficulty" of a non-existing network link is the probability that the observations during a random contagion history would not rule out that link. This probability is relatively straightforward to calculate, and in most instances relies only on the relative positions of the two nodes (i,j) and not on the entire network structure. We have observed the distribution of false link difficulty for various network types, estimated it theoretically and confronted it
Directory of Open Access Journals (Sweden)
Suprayogi Suprayogi
2016-12-01
Full Text Available This paper considers a location problem in a supply chain network. The problem addressed in this paper is motivated by an initiative to develop an efficient supply chain network for supporting the agricultural activities. The supply chain network consists of regions, warehouses, distribution centers, plants, and markets. The products include a set of inbound products and a set of outbound products. In this paper, definitions of the inbound and outbound products are seen from the region’s point of view. The inbound product is the product demanded by regions and produced by plants which flows on a sequence of the following entities: plants, distribution centers, warehouses, and regions. The outbound product is the product demanded by markets and produced by regions and it flows on a sequence of the following entities: regions, warehouses, and markets. The problem deals with determining locations of the warehouses and the distribution centers to be opened and shipment quantities associated with all links on the network that minimizes the total cost. The problem can be considered as a strategic supply chain network problem. A solution approach based on genetic algorithm (GA is proposed. The proposed GA is examined using hypothetical instances and its results are compared to the solution obtained by solving the mixed integer linear programming (MILP model. The comparison shows that there is a small gap (0.23%, on average between the proposed GA and MILP model in terms of the total cost. The proposed GA consistently provides solutions with least total cost. In terms of total cost, based on the experiment, it is demonstrated that coefficients of variation are closed to 0.
Directory of Open Access Journals (Sweden)
V. A. Sednin
2009-01-01
Full Text Available The paper presents a problem statement, a developed mathematical model and proposed algorithm for solving optimization of capital investments in modernization (introduction of automatic controlsystems of thermal processes of large systems of centralized heat supply which are based on application of network model.The formulated problem refers to the problems of combinatory (discrete optimization. Methods of «branches and boundaries» or dynamic programming are applied nowadays for solving problems of this type. These methods are not considered as universal ones because they greatly depend on description of solution feasible area. As a result of it it is not possible to develop a universal software for solving any assignments which can be formulated as problems of combinatory optimization.The presented network model of the investigated problem does not have above-mentioned disadvantages and an algorithm is proposed for solving this problem which admits a simple programming realization.
Nourifar, Raheleh; Mahdavi, Iraj; Mahdavi-Amiri, Nezam; Paydar, Mohammad Mahdi
2017-09-01
Decentralized supply chain management is found to be significantly relevant in today's competitive markets. Production and distribution planning is posed as an important optimization problem in supply chain networks. Here, we propose a multi-period decentralized supply chain network model with uncertainty. The imprecision related to uncertain parameters like demand and price of the final product is appropriated with stochastic and fuzzy numbers. We provide mathematical formulation of the problem as a bi-level mixed integer linear programming model. Due to problem's convolution, a structure to solve is developed that incorporates a novel heuristic algorithm based on Kth-best algorithm, fuzzy approach and chance constraint approach. Ultimately, a numerical example is constructed and worked through to demonstrate applicability of the optimization model. A sensitivity analysis is also made.
Energy Technology Data Exchange (ETDEWEB)
Harvey, D.
2000-10-01
In developing the standards for the fibre optics Gigabit Ethernet network, the IEEE Committee 802.3z discovered certain problems involved with the 62.5 microns multi-mode fibres when employed at a wave-length of 850 nanometers. When looking for an explanation, it was discovered that equipment which conform to the Gigabit Ethernet standards utilize a laser for generating the light required for conveying information over the fibre optics network. The design of the 62.5 micron fibre contains certain impurities about the core of the fibre which reduces the light transmission. The result is no light , no information transmission through the core, and considerably reduced signal transmission towards the periphery of the fibre. Corning Corporation and other manufacturers of fibre optics came to the rescue by developing fibres specifically for the Gigabit Ethernet network. Corning, for example, manufactures four different varieties of optical fibres which are either 50 microns or 62.5 microns thick and operate optimally at a wavelength of 850 nanometers but at different distances ranging from 300 m to 600 m. The advantage of the different varieties of optical fibres is a matter of cost; since not all equipment requires the highest transmission distance to function properly, the ability to choose optical fibres that are optimal at a given level reduces the cost of the network. 1 tab., 1 fig.
The application of deep confidence network in the problem of image recognition
Directory of Open Access Journals (Sweden)
Chumachenko О.І.
2016-12-01
Full Text Available In order to study the concept of deep learning, in particular the substitution of multilayer perceptron on the corresponding network of deep confidence, computer simulations of the learning process to test voters was carried out. Multi-layer perceptron has been replaced by a network of deep confidence, consisting of successive limited Boltzmann machines. After training of a network of deep confidence algorithm of layer-wise training it was found that the use of networks of deep confidence greatly improves the accuracy of multilayer perceptron training by method of reverse distribution errors.
Directory of Open Access Journals (Sweden)
Julien Maheut
2013-07-01
Full Text Available Purpose: The purpose of this paper is to present an algorithm that solves the supply network configuration and operations scheduling problem in a mass customization company that faces alternative operations for one specific tool machine order in a multiplant context. Design/methodology/approach: To achieve this objective, the supply chain network configuration and operations scheduling problem is presented. A model based on stroke graphs allows the design of an algorithm that enumerates all the feasible solutions. The algorithm considers the arrival of a new customized order proposal which has to be inserted into a scheduled program. A selection function is then used to choose the solutions to be simulated in a specific simulation tool implemented in a Decision Support System. Findings and Originality/value: The algorithm itself proves efficient to find all feasible solutions when alternative operations must be considered. The stroke structure is successfully used to schedule operations when considering more than one manufacturing and supply option in each step. Research limitations/implications: This paper includes only the algorithm structure for a one-by-one, sequenced introduction of new products into the list of units to be manufactured. Therefore, the lotsizing process is done on a lot-per-lot basis. Moreover, the validation analysis is done through a case study and no generalization can be done without risk. Practical implications: The result of this research would help stakeholders to determine all the feasible and practical solutions for their problem. It would also allow to assessing the total costs and delivery times of each solution. Moreover, the Decision Support System proves useful to assess alternative solutions. Originality/value: This research offers a simple algorithm that helps solve the supply network configuration problem and, simultaneously, the scheduling problem by considering alternative operations. The proposed system
The anatomy of urban social networks and its implications in the searchability problem
Herrera-Yagüe, C.; Schneider, C. M.; Couronné, T.; Smoreda, Z.; Benito, R. M.; Zufiria, P. J.; González, M. C.
2015-01-01
The appearance of large geolocated communication datasets has recently increased our understanding of how social networks relate to their physical space. However, many recurrently reported properties, such as the spatial clustering of network communities, have not yet been systematically tested at different scales. In this work we analyze the social network structure of over 25 million phone users from three countries at three different scales: country, provinces and cities. We consistently find that this last urban scenario presents significant differences to common knowledge about social networks. First, the emergence of a giant component in the network seems to be controlled by whether or not the network spans over the entire urban border, almost independently of the population or geographic extension of the city. Second, urban communities are much less geographically clustered than expected. These two findings shed new light on the widely-studied searchability in self-organized networks. By exhaustive simulation of decentralized search strategies we conclude that urban networks are searchable not through geographical proximity as their country-wide counterparts, but through an homophily-driven community structure. PMID:26035529
Research on Intellectual Property Right Problems of Peer-to-Peer Networks.
Dong, Ying; Li, Mingshu; Chen, Meizhang; Zheng, Shengli
2002-01-01
Discusses digital intellectual property rights relating to peer-to-peer networks, using Napster as an example. Suggests anti-piracy solutions to prevent litigation and considers how libraries can develop potential service models using peer-to-peer networks, including the development of personal libraries on the Internet, interlibrary loan,…
Directory of Open Access Journals (Sweden)
Enrique Castillo
2015-01-01
Full Text Available A state-of-the-art review of flow observability, estimation, and prediction problems in traffic networks is performed. Since mathematical optimization provides a general framework for all of them, an integrated approach is used to perform the analysis of these problems and consider them as different optimization problems whose data, variables, constraints, and objective functions are the main elements that characterize the problems proposed by different authors. For example, counted, scanned or “a priori” data are the most common data sources; conservation laws, flow nonnegativity, link capacity, flow definition, observation, flow propagation, and specific model requirements form the most common constraints; and least squares, likelihood, possible relative error, mean absolute relative error, and so forth constitute the bases for the objective functions or metrics. The high number of possible combinations of these elements justifies the existence of a wide collection of methods for analyzing static and dynamic situations.
Energy Technology Data Exchange (ETDEWEB)
Ozkan, Semra; Dincer, Salih [Department of Chemical Engineering, Chemical-Metallurgical Faculty, Yildiz Technical University, Davutpasa Kampusu, No 127, 34210 Esenler, Istanbul (Turkey)
2001-12-01
In this work, the methods used in pinch design were applied to a heat exchanger network with the aid of an improved problem algorithm table. This table enables one to compose composite and grand composite curves in a simplified way. A user friendly computer code entitled DarboTEK, compiled by using Visual Basic 3.0, was developed for the design of integrated heat exchanger networks and estimation of related capital costs. Based on the data obtained from the TUPRAS petroleum refinery at Izmit, a retrofit design of heat exchanger networks was accomplished using DarboTEK. An investment of 3,576,627 dollars is needed which will be paid back in 1.69 years simply by energy conservation due to heat integration. (Author)
Data-Intensive Cloud Service Provision for Research Institutes: the Network Connectivity Problem
Cass, Tony; CERN. Geneva. IT Department
2016-01-01
Much effort (and money) has been invested in recent years to ensure that academic and research sites are well interconnected with high-capacity networks that, in most cases, span national and continental boundaries. However, these dedicated research and education networks, whether national (NRENs) or trans-continental (RENs), frequently have Acceptable Use Policies (AUPs) that restrict their use by commercial entities, notably Cloud Service Providers (CSPs). After a brief summary of the issues involved, we describe three approaches to removing the network connectivity barrier that threatens to limit the ability of academic and research institutions to profit effectively from services offered by CSPs.
Energy Technology Data Exchange (ETDEWEB)
Sauget, M
2007-12-15
This research is about the application of neural networks used in the external radiotherapy domain. The goal is to elaborate a new evaluating system for the radiation dose distributions in heterogeneous environments. The al objective of this work is to build a complete tool kit to evaluate the optimal treatment planning. My st research point is about the conception of an incremental learning algorithm. The interest of my work is to combine different optimizations specialized in the function interpolation and to propose a new algorithm allowing to change the neural network architecture during the learning phase. This algorithm allows to minimise the al size of the neural network while keeping a good accuracy. The second part of my research is to parallelize the previous incremental learning algorithm. The goal of that work is to increase the speed of the learning step as well as the size of the learned dataset needed in a clinical case. For that, our incremental learning algorithm presents an original data decomposition with overlapping, together with a fault tolerance mechanism. My last research point is about a fast and accurate algorithm computing the radiation dose deposit in any heterogeneous environment. At the present time, the existing solutions used are not optimal. The fast solution are not accurate and do not give an optimal treatment planning. On the other hand, the accurate solutions are far too slow to be used in a clinical context. Our algorithm answers to this problem by bringing rapidity and accuracy. The concept is to use a neural network adequately learned together with a mechanism taking into account the environment changes. The advantages of this algorithm is to avoid the use of a complex physical code while keeping a good accuracy and reasonable computation times. (author)
Libraries and Networks in Transition: Problems and Prospects for the 1980's.
De Gennaro, Richard
1981-01-01
Discusses the possible effects of library automation and networking on standards of catalog accuracy, catalog maintenance, circulation control, and other processes, and describes the mission of the Research Libraries Group (RLG), a consortium of 25 research libraries. (FM)
Directory of Open Access Journals (Sweden)
Sophie Nadal
2009-09-01
Full Text Available La législation sociale est sujette à de vigoureuses critiques. Parmi elles, il en est une qui revient de façon récurrente : les interdictions faites à l’employeur (et partant les obstacles mis à la libre entreprise seraient excessives et trop nombreuses. Par delà la perception courante, la notion d’interdiction - et particulièrement sa définition - est particulièrement délicate à cerner. Le point invite donc à la réflexion : comment caractériser en droit du travail les règles supportant des interdictions adressées à l’employeur ? Comment peut-on les comprendre ? Tels sont les questionnements qui nourrissent le propos.Social legislation is subject to varied and vigorous criticisms. Among them perhaps the most frequent is that prohibitions imposed on the employer (which as such constitute obstacles to free enterprise are considered excessive and too numerous. Beyond its common understanding, the prohibition concept – and especially its definition – is extremely difficult to circumscribe. This difficulty calls for reflection: how should labour law characterise the rules supporting prohibitions imposed to the employer? How should they be understood? These are the questions discussed in this paper.
Isak Shabani; Betim Cico; Agni Dika
2012-01-01
In this paper, we have presented an algorithm for data synchronization based on Web Services (WS), which allows software applications to work well on both configurations Online and "Offline", in the absence of the network. For this purpose is in use Electronic Student Management System (ESMS) at University of Prishtina (UP) with the appropriate module. Since the use of ESMS, because of a uncertain supply of electricity, disconnecting the network and for other reasons which are not under the c...
Oshri, Assaf; Himelboim, Itai; Kwon, Josephine A; Sutton, Tara E; Mackillop, James
2015-11-01
The aim of the present study was to examine the links between severities of child abuse (physical vs. sexual), and alcohol use versus problems via social media (Facebook) peer connection structures. A total of 318 undergraduate female students at a public university in the United States reported severity of child abuse experiences and current alcohol use and problems. Social network data were obtained directly from the individuals' Facebook network. Severity of childhood physical abuse was positively linked to alcohol use and problems via eigenvector centrality, whereas severity of childhood sexual abuse was negatively linked to alcohol use and problems via clustering coefficient. Childhood physical and sexual abuse were linked positively and negatively, respectively, to online social network patterns associated with alcohol use and problems. The study suggests the potential utility of these online network patterns as risk indices and ultimately using social media as a platform for targeted preventive interventions.
Dorado-Moreno, Manuel; Pérez-Ortiz, María; Gutiérrez, Pedro A; Ciria, Rubén; Briceño, Javier; Hervás-Martínez, César
2017-03-01
Create an efficient decision-support model to assist medical experts in the process of organ allocation in liver transplantation. The mathematical model proposed here uses different sources of information to predict the probability of organ survival at different thresholds for each donor-recipient pair considered. Currently, this decision is mainly based on the Model for End-stage Liver Disease, which depends only on the severity of the recipient and obviates donor-recipient compatibility. We therefore propose to use information concerning the donor, the recipient and the surgery, with the objective of allocating the organ correctly. The database consists of information concerning transplants conducted in 7 different Spanish hospitals and the King's College Hospital (United Kingdom). The state of the patients is followed up for 12 months. We propose to treat the problem as an ordinal classification one, where we predict the organ survival at different thresholds: less than 15 days, between 15 and 90 days, between 90 and 365 days and more than 365 days. This discretization is intended to produce finer-grain survival information (compared with the common binary approach). However, it results in a highly imbalanced dataset in which more than 85% of cases belong to the last class. To solve this, we combine two approaches, a cost-sensitive evolutionary ordinal artificial neural network (ANN) (in which we propose to incorporate dynamic weights to make more emphasis on the worst classified classes) and an ordinal over-sampling technique (which adds virtual patterns to the minority classes and thus alleviates the imbalanced nature of the dataset). The results obtained by our proposal are promising and satisfactory, considering the overall accuracy, the ordering of the classes and the sensitivity of minority classes. In this sense, both the dynamic costs and the over-sampling technique improve the base results of the considered ANN-based method. Comparing our model with
Civaner, Murat
2008-01-01
The promotional activities of pharmaceutical companies are becoming an increasingly hot topic among healthcare workers and the general public. There are many studies in the literature claiming that drug promotion may lead to ethical problems, irrational use of medication, and increased costs, as well as negative effects on the patient-physician relationship and the medical profession. When considering that healthcare workers generally acquire their knowledge from the pharmaceutical industry, the problems mentioned, which are indeed of paramount importance, and the need for effective and sustainable interventions are clearly revealed. Many kinds of interventions have been recommended by various authorities and studies in order to prevent the kinds of problems mentioned above, including training healthcare workers, publishing professional codes to serve as guidelines about which professional values should be protected and how to cope with different situations in relationship to the pharmaceutical industry, or applying the business ethics codes of the pharmaceutical companies. Studies that assessed the effectiveness of different interventions, however, revealed that educating healthcare workers about marketing methods and state regulations are the only effective interventions. In this article, after defining the problem, a proposed national network for drug information is to decrease the negative effects of drug promotion and to promote the rational choice of medicines is described. According to the World Health Organization, rational use of medicine is the most effective, safe, applicable/suitable, and, lastly, the most cost effective option. A national network that will gather drug information by compiling evidence-based knowledge and taking rational use of medicine measures into account should be established. It should transmit information to all healthcare workers in a fast, equal, up to date, easily accessible, and free way. The network should also support
DEFF Research Database (Denmark)
Quaglia, Alberto; Sarup, Bent; Sin, Gürkan
2013-01-01
structure for efficient formulation of enterprise-wide optimization problems is presented. Through the integration of the described data structure in our synthesis and design framework, the problem formulation workflow is automated in a software tool, reducing time and resources needed to formulate large...
DEFF Research Database (Denmark)
Gamst, M.
2014-01-01
arrived at the machine. Furthermore, two resource demand transmissions cannot use the same edge in the same time period. The problem has application in grid computing, where a number of geographically distributed machines work together for solving large problems. The machines are connected through...
Problems associated with the use of social networks--a pilot study.
Szczegielniak, Anna; Pałka, Karol; Krysta, Krzysztof
2013-09-01
The definition of addiction is that it is an acquired, strong need to perform a specific activity or continued use of mood alerting substances. Increasing discussion about the development of Internet addiction, which like other addictions, have their roots in depression, impaired assessment esteem and social anxiety shows that it affects all users of the global network, regardless of gender or age. The aim of the study was to assess the impact of social networking on the ongoing behavior of respondents- the first step of a study on the possibility of dependence on social networks. The study was based on an authors questionnaire placed on popular polish websites on February 2013. Questions related to the types and frequency of specific activities undertaken by the private profiles of users. The study involved 221 respondents, 193 questionnaires were filled in completely and correctly, without missing any questions. 83.24% admitted to using social networking sites, 16.76% indicated that they never had their own profile. An overwhelming number of respondents are a member of Facebook (79.17%), specialized portals related to their profession or work were used by only 13.89%, Our-class (6.25%) and Twitter was a primary portal for one person only. Nobody marked a participation in dating services. There is a big difference between the addiction to the Internet and addictions existing within the Internet; the same pattern applies to social networking. There is a need to recognize the "social networking" for a particular activity, irrespective of Facebook, Twitter and Nasza-Klasa, which are commercial products.
Bellingeri, Michele; Agliari, Elena; Cassi, Davide
2015-10-01
The best strategy to immunize a complex network is usually evaluated in terms of the percolation threshold, i.e. the number of vaccine doses which make the largest connected cluster (LCC) vanish. The strategy inducing the minimum percolation threshold represents the optimal way to immunize the network. Here we show that the efficacy of the immunization strategies can change during the immunization process. This means that, if the number of doses is limited, the best strategy is not necessarily the one leading to the smallest percolation threshold. This outcome should warn about the adoption of global measures in order to evaluate the best immunization strategy.
A greedy construction heuristic for the liner service network design problem
DEFF Research Database (Denmark)
Brouer, Berit Dangaard
is challenging due to the size of a global liner shipping operation and due to the hub-and-spoke network design, where a high percentage of the total cargo is transshipped. We present the first construction heuristic for large scale instances of the LSN-DP. The heuristic is able to find a solution for a real...
Pavlásek, J
1998-12-01
A hypothesis is presented that coherent oscillatory discharges of spatially distributed neuronal groups (the supposed binding mechanism) are the result of the convergence of stimulus-dependent activity in modality-specific afferent pathways with oscillatory activity generated in unspecific sensory systems. This view is supported by simulation experiments on model networks.
Analyzing the Interdiction of Sea-Borne Threats Using Simulation Optimization
2007-03-01
approach problems. Heuristics is considered a form of “ cognitive strategy”, a departure from systematic problem solving using tractable...WHEC) Appendix B: USCG Study Assets 68 HH-60 Jayhawk HH-65 Dolphin 110 ft WPB Patrol Boat 69 Appendix C: Matlab Code
2012-09-13
supplier selection problem. 3.1 Introduction Multi-objective decision analysis (MODA) and multi-criteria decision making ( MCDM ) are very popular decision...xiv I. Introduction ...52 3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 3.2 Decision
Directory of Open Access Journals (Sweden)
Osmar Viera Carcache
2017-03-01
Full Text Available This paper presents a computational proposal for the solution of the Cell Planning Problem. The importance of this problem in the area of Telecommunications imposes it as a reference in the search for new methods of optimization. Due to the complexity of the problem, this work uses a discrete relaxation and proposes a mathematical model for the application of the Meta-heuristic Ant Colony Optimization (ACO. For the analysis of the results, 5 instances of the problem of different sizes were selected and the Ants System (AS algorithm was applied. The results show that the proposal efficiently explores the search space, finding the optimal solution for each instance with a relatively low computational cost. These results are compared with 3 evolutionary alternatives of international reference that have been applied to the same study instances, showing a significant improvement by our proposal.
Directory of Open Access Journals (Sweden)
Ali Salmasnia
2012-01-01
Full Text Available An important problem encountered in product or process design is the setting of process variables to meet a required specification of quality characteristics (response variables, called a multiple response optimization (MRO problem. Common optimization approaches often begin with estimating the relationship between the response variable with the process variables. Among these methods, response surface methodology (RSM, due to simplicity, has attracted most attention in recent years. However, in many manufacturing cases, on one hand, the relationship between the response variables with respect to the process variables is far too complex to be efficiently estimated; on the other hand, solving such an optimization problem with accurate techniques is associated with problem. Alternative approach presented in this paper is to use artificial neural network to estimate response functions and meet heuristic algorithms in process optimization. In addition, the proposed approach uses the Taguchi robust parameter design to overcome the common limitation of the existing multiple response approaches, which typically ignore the dispersion effect of the responses. The paper presents a case study to illustrate the effectiveness of the proposed intelligent framework for tackling multiple response optimization problems.
2015-06-03
suspect the crew unloaded a cargo of cocaine before fleeing.21 In March 2006, the Calabrian mafia ordered a shipment of nine tons of cocaine (retail...August 14, 2006, http://news.bbc.co.uk/2/hi/europe/4792075.stm (accessed December 23, 2014). 22 Nick Pisa, "Drug cops foil mafia plot to smuggle...accessed on September 5, 2014). Pisa, Nick "Drug cops foil mafia plot to smuggle $870m of cocaine by submarine." Drug News Vault. March 30, 2006. http
2009-09-01
10/100 Base T Ports SECURITY Static and Dynamic WEP Encryption 40- and 104-bit (RC4) Encryption WPA 802.1x – EAP-TLS, EAP-TTLS, PEAP, TKIP... Encryption Standard BOQ Bachelor Officer Quarters C2 Command and Control C4ISR Command, Control, Communications, Computers, Intelligence, Surveillance...information and traffic exchanged over the VPN tunnel is encrypted . VPN software encrypts and decrypts the data transmitted between clients and must
Solving the Dynamic Correlation Problem of the Susceptible-Infected-Susceptible Model on Networks
Cai, Chao-Ran; Chen, Michael Z Q; Holme, Petter; Guan, Jian-Yue
2016-01-01
The Susceptible-Infected-Susceptible model is a canonical model for emerging disease outbreaks. Such outbreaks are naturally modeled as taking place on networks. A theoretical challenge in network epidemiology is the dynamic correlations coming from that if one node is occupied, or infected (for disease spreading models), then its neighbors are likely to be occupied. By combining two theoretical approaches---the heterogeneous mean-field theory and the effective degree method---we are able to include these correlations in an analytical solution of the SIS model. We derive accurate expressions for the average prevalence (fraction of infected) and epidemic threshold. We also discuss how to generalize the approach to a larger class of stochastic population models.
Reliable Path Selection Problem in Uncertain Traffic Network after Natural Disaster
Directory of Open Access Journals (Sweden)
Jing Wang
2013-01-01
Full Text Available After natural disaster, especially for large-scale disasters and affected areas, vast relief materials are often needed. In the meantime, the traffic networks are always of uncertainty because of the disaster. In this paper, we assume that the edges in the network are either connected or blocked, and the connection probability of each edge is known. In order to ensure the arrival of these supplies at the affected areas, it is important to select a reliable path. A reliable path selection model is formulated, and two algorithms for solving this model are presented. Then, adjustable reliable path selection model is proposed when the edge of the selected reliable path is broken. And the corresponding algorithms are shown to be efficient both theoretically and numerically.
[IT safety in medical networks--current problems and approach to solutions].
Pommerening, K
2000-01-01
Designers and users of medical networks have to face strong requirements for data protection and security. Professional discretion and data protection laws allow the transfer of or access to patient data only in a therapeutic context. These data should also be protected from the network provider. Patients should be safe from any harm by faulty data or buggy procedures. On the other hand the security of the most used software products gets worse and worse. The use of the internet endangers more and more the integrity of the user's computer. The security requirements can be met only through strict care in planning, building, and configuring the infrastructure. Some concrete recommendations and guiding principles can immediately be realized. If these recommendations are followed, the internet can be of immense value for health care.
User Matching with Relation to the Stable Marriage Problem in Cognitive Radio Networks
Hamza, Doha R.
2017-03-20
We consider a network comprised of multiple primary users (PUs) and multiple secondary users (SUs), where the SUs seek access to a set of orthogonal channels each occupied by one PU. Only one SU is allowed to coexist with a given PU. We propose a distributed matching algorithm to pair the network users, where a Stackelberg game model is assumed for the interaction between the paired PU and SU. The selected secondary is given access in exchange for monetary compensation to the primary. The PU optimizes the interference price it charges to a given SU and the power allocation to maintain communication. The SU optimizes its power demand so as to maximize its utility. Our algorithm provides a unique stable matching. Numerical results indicate the advantage of the proposed algorithm over other reference schemes.
Leveraging socially networked mobile ICT platforms for the last-mile delivery problem.
Suh, Kyo; Smith, Timothy; Linhoff, Michelle
2012-09-04
Increasing numbers of people are managing their social networks on mobile information and communication technology (ICT) platforms. This study materializes these social relationships by leveraging spatial and networked information for sharing excess capacity to reduce the environmental impacts associated with "last-mile" package delivery systems from online purchases, particularly in low population density settings. Alternative package pickup location systems (PLS), such as a kiosk on a public transit platform or in a grocery store, have been suggested as effective strategies for reducing package travel miles and greenhouse gas emissions, compared to current door-to-door delivery models (CDS). However, our results suggest that a pickup location delivery system operating in a suburban setting may actually increase travel miles and emissions. Only once a social network is employed to assist in package pickup (SPLS) are significant reductions in the last-mile delivery distance and carbon emissions observed across both urban and suburban settings. Implications for logistics management's decades-long focus on improving efficiencies of dedicated distribution systems through specialization, as well as for public policy targeting carbon emissions of the transport sector are discussed.
Directory of Open Access Journals (Sweden)
Lin Liu
2010-01-01
Full Text Available Cognitive radio (CR is a technology to implement opportunistic spectrum sharing to improve the spectrum utilization. However, there exists a hidden-node problem, which can be a big challenge to solve especially when the primary receiver is passive listening. We aim to provide a solution to the hidden-node problem for passive-listening receiver based on cooperation of multiple CRs. Specifically, we consider a cooperative GPS-enabled cognitive network. Once the existence of PU is detected, a localization algorithm will be employed to first estimate the path loss model for the environment based on backpropagation method and then to locate the position of PU. Finally, a disable region is identified taking into account the communication range of both the PU and the CR. The CRs within the disabled region are prohibited to transmit in order to avoid interfering with the primary receiver. Both analysis and simulation results are provided.
A neural-network-based approach to the double traveling salesman problem.
Plebe, Alessio; Anile, Angelo Marcello
2002-02-01
The double traveling salesman problem is a variation of the basic traveling salesman problem where targets can be reached by two salespersons operating in parallel. The real problem addressed by this work concerns the optimization of the harvest sequence for the two independent arms of a fruit-harvesting robot. This application poses further constraints, like a collision-avoidance function. The proposed solution is based on a self-organizing map structure, initialized with as many artificial neurons as the number of targets to be reached. One of the key components of the process is the combination of competitive relaxation with a mechanism for deleting and creating artificial neurons. Moreover, in the competitive relaxation process, information about the trajectory connecting the neurons is combined with the distance of neurons from the target. This strategy prevents tangles in the trajectory and collisions between the two tours. Results of tests indicate that the proposed approach is efficient and reliable for harvest sequence planning. Moreover, the enhancements added to the pure self-organizing map concept are of wider importance, as proved by a traveling salesman problem version of the program, simplified from the double version for comparison.
DEFF Research Database (Denmark)
Quaglia, Alberto; Gargalo, Carina L.; Chairakwongsa, Siwanat
2015-01-01
The developments obtained in recent years in the field of mathematical programming considerably reduced the computational time and resources needed to solve large and complex Mixed Integer Non Linear Programming (MINLP) problems. Nevertheless, the application of these methods in industrial practi...
ACTUAL PROBLEMS ABOUT IMPROVEMENT CAR FLEETS TO ABROAD THROUGH THE UKRAINIAN NETWORKS
Directory of Open Access Journals (Sweden)
Yu. M. Hermaniuk
2010-12-01
Full Text Available The article describes the basic problems of organization of international transit transportations. A statistical analysis of wagon delays at border stations has been done. Also some conclusions on the necessity of developing a mathematical model of pushing on the transit streams of wagons on the railway system in Ukraine have been done using the method of simulative modeling.
Sripada, Rebecca K; Bohnert, Amy S B; Teo, Alan R; Levine, Debra S; Pfeiffer, Paul N; Bowersox, Nicholas W; Mizruchi, Mark S; Chermack, Stephen T; Ganoczy, Dara; Walters, Heather; Valenstein, Marcia
2015-09-01
Low social support and small social network size have been associated with a variety of negative mental health outcomes, while their impact on mental health services use is less clear. To date, few studies have examined these associations in National Guard service members, where frequency of mental health problems is high, social support may come from military as well as other sources, and services use may be suboptimal. Surveys were administered to 1448 recently returned National Guard members. Multivariable regression models assessed the associations between social support characteristics, probable mental health conditions, and service utilization. In bivariate analyses, large social network size, high social network diversity, high perceived social support, and high military unit support were each associated with lower likelihood of having a probable mental health condition (p social support (OR .90, CI .88-.92) and high unit support (OR .96, CI .94-.97) continued to be significantly associated with lower likelihood of mental health conditions. Two social support measures were associated with lower likelihood of receiving mental health services in bivariate analyses, but were not significant in adjusted models. General social support and military-specific support were robustly associated with reduced mental health symptoms in National Guard members. Policy makers, military leaders, and clinicians should attend to service members' level of support from both the community and their units and continue efforts to bolster these supports. Other strategies, such as focused outreach, may be needed to bring National Guard members with need into mental health care.
Supply chain network design problem for a new market opportunity in an agile manufacturing system
Babazadeh, Reza; Razmi, Jafar; Ghodsi, Reza
2012-08-01
The characteristics of today's competitive environment, such as the speed with which products are designed, manufactured, and distributed, and the need for higher responsiveness and lower operational cost, are forcing companies to search for innovative ways to do business. The concept of agile manufacturing has been proposed in response to these challenges for companies. This paper copes with the strategic and tactical level decisions in agile supply chain network design. An efficient mixed-integer linear programming model that is able to consider the key characteristics of agile supply chain such as direct shipments, outsourcing, different transportation modes, discount, alliance (process and information integration) between opened facilities, and maximum waiting time of customers for deliveries is developed. In addition, in the proposed model, the capacity of facilities is determined as decision variables, which are often assumed to be fixed. Computational results illustrate that the proposed model can be applied as a power tool in agile supply chain network design as well as in the integration of strategic decisions with tactical decisions.
PROBLEM OF ECOLOGICAL NETWORK DEVELOPMENT IN BIG CITIES, USING MOSCOW AS AN EXAMPLE
Directory of Open Access Journals (Sweden)
Boyko Valeriya Mikhaylovna
2014-09-01
Full Text Available Creating stable system of protected areas in the city is practically impossible. The optimal way out of this situation is, to our mind, connected with such ecosystem management strategy that ensures spontaneous development of preserved natural ecosystems with simultaneous effective urban planting. It should be noted that the problems of the recreational ecosystem exploitation, despite many years of research, are not fully solved, and, considering recreation in urban protected areas, especially in the city, get a new trend. It seems reasonable nowadays to try to shuffle off the burden of active recreation from forest ecosystems on buffer zones. These zones should be specially created or restored because of carrying out projects on ecological rehabilitation, planted areas or natural planted areas. For the staff of the protected area system it creates additional opportunities for shifting of forces in the solution of other problems on maintaining and restoring biodiversity.
SET COVER PROBLEM OF COVERAGE PLANNING IN LTE-ADVANCED RELAY NETWORKS
Fan-Hsun Tseng; Li-Der Chou; Han-Chieh Chao; Wei-Jen Yu
2014-01-01
Various mobile devices are developing rapidly in contemporary society, such as smart phones and tablet PCs. Users are able to acquire different multimedia services through wireless communication anytime and anywhere. However, the increased demand also gives rise to a problem of insufficient bandwidth. Therefore, a fourth generation mobile telecommunications (4G) technology was proposed and widely investigated. One of the popular technologies is Long Term Evolution Advanced (LTE-Advanced), whi...
Mulder, Samuel A; Wunsch, Donald C
2003-01-01
The Traveling Salesman Problem (TSP) is a very hard optimization problem in the field of operations research. It has been shown to be NP-complete, and is an often-used benchmark for new optimization techniques. One of the main challenges with this problem is that standard, non-AI heuristic approaches such as the Lin-Kernighan algorithm (LK) and the chained LK variant are currently very effective and in wide use for the common fully connected, Euclidean variant that is considered here. This paper presents an algorithm that uses adaptive resonance theory (ART) in combination with a variation of the Lin-Kernighan local optimization algorithm to solve very large instances of the TSP. The primary advantage of this algorithm over traditional LK and chained-LK approaches is the increased scalability and parallelism allowed by the divide-and-conquer clustering paradigm. Tours obtained by the algorithm are lower quality, but scaling is much better and there is a high potential for increasing performance using parallel hardware.
Energy Technology Data Exchange (ETDEWEB)
Marcondes, Eduardo; Goldbarg, Elizabeth; Goldbarg, Marco; Cunha, Thatiana [Universidade Federal do Rio Grande do Norte (UFRN), Natal, RN (Brazil)
2008-07-01
A major problem about the planning of production in refinery is the determination of what should be done in each stage of production as a horizon of time. Among such problems, distribution of oil products through networks of pipelines is a very significant problem because of its economic importance. In this work, a problem of distribution of oil through a network of pipelines is modeled. The network studied is a simplification of a real network. There are several restrictions to be met, such as limits of storage, transmission or receipt of limits and limitations of transport. The model is adopted bi-goal where you want to minimize the fragmentation and the time of transmission, given the restrictions of demand and storage capacity. Whereas the occupancy rate of networks is increasingly high, is of great importance optimize its use. In this work, the technique of optimization by Cloud of particles is applied to the problem of distribution of oil products by networks of pipelines. (author)
Taxi pooling in New York City: a network-based approach to social sharing problems
Santi, Paolo; Szell, Michael; Sobolevsky, Stanislav; Strogatz, Steven; Ratti, Carlo
2013-01-01
Taxi services are a vital part of urban transportation, and a major contributor to traffic congestion and air pollution causing substantial adverse effects on human health. Sharing taxi trips is a possible way of reducing the negative impact of taxi services on cities, but this comes at the expense of passenger discomfort in terms of a longer travel time. Due to computational challenges, taxi sharing has traditionally been approached on small scales, such as within airport perimeters, or with dynamical ad-hoc heuristics. However, a mathematical framework for the systematic understanding of the tradeoff between collective benefits of sharing and individual passenger discomfort is lacking. Here we introduce the notion of shareability network which allows us to model the collective benefits of sharing as a function of passenger inconvenience, and to efficiently compute optimal sharing strategies on massive datasets. We apply this framework to a dataset of millions of taxi trips taken in New York City, showing th...
A hybrid model using decision tree and neural network for credit scoring problem
Directory of Open Access Journals (Sweden)
Amir Arzy Soltan
2012-08-01
Full Text Available Nowadays credit scoring is an important issue for financial and monetary organizations that has substantial impact on reduction of customer attraction risks. Identification of high risk customer can reduce finished cost. An accurate classification of customer and low type 1 and type 2 errors have been investigated in many studies. The primary objective of this paper is to develop a new method, which chooses the best neural network architecture based on one column hidden layer MLP, multiple columns hidden layers MLP, RBFN and decision trees and ensembling them with voting methods. The proposed method of this paper is run on an Australian credit data and a private bank in Iran called Export Development Bank of Iran and the results are used for making solution in low customer attraction risks.
Simply Coded Evolutionary Artificial Neural Networks on a Mobile Robot Control Problem
Katada, Yoshiaki; Hidaka, Takuya
One of the advantages of evolutionary robotics over other approaches in embodied cognitive science would be its parallel population search. Due to the population search, it takes a long time to evaluate all robot in a real environment. Thus, such techniques as to shorten the time are required for real robots to evolve in a real environment. This paper proposes to use simply coded evolutionary artificial neural networks for mobile robot control to make genetic search space as small as possible and investigates the performance of them using simulated and real robots. Two types of genetic algorithm (GA) are employed, one is the standard GA and the other is an extended GA, to achieve higher final fitnesses. The results suggest the benefits of the proposed method.
Huerta Molina,José Miguel; Rodríguez Diez,Javier
2012-01-01
La operis novi nuntiatio romana evolucionó de ser una prohibición particular realizada por la parte agraviada en contra del constructor, hasta convertirse en sí misma en la forma de inicio de un procedimiento jurisdiccional. La legislación española decimonónica (y, a través de su influencia, el Código de Procedimiento Civil chileno) estableció un juicio interdictal que permite una dilatada y a menudo injustificada suspensión de las obras, lo que condujo al abuso de este instrumento procesal....
Energy Technology Data Exchange (ETDEWEB)
Sharma, Bhupesh, E-mail: drbhupeshresearch@gmail.com; Sharma, P.M.
2013-11-15
Arsenic toxicity has been reported to damage all the major organs including the brain and vasculature. Dementia including Alzheimer's disease (AD) and vascular dementia (VaD) are posing greater risk to the world population as it is now increasing at a faster rate. We have investigated the role of sodium butyrate, a selective histone deacetylase (HDAC) inhibitor and aminoguanidine, a selective inducible nitric oxide synthase (iNOS) inhibitor in pharmacological interdiction of arsenic toxicity induced vascular endothelial dysfunction and dementia in rats. Arsenic toxicity was done by administering arsenic drinking water to rats. Morris water-maze (MWM) test was used for assessment of learning and memory. Endothelial function was assessed using student physiograph. Oxidative stress (aortic superoxide anion, serum and brain thiobarbituric acid reactive species, brain glutathione) and nitric oxide levels (serum nitrite/nitrate) were also measured. Arsenic treated rats have shown impairment of endothelial function, learning and memory, reduction in serum nitrite/nitrate and brain GSH levels along with increase in serum and brain TBARS. Sodium butyrate as well as aminoguanidine significantly convalesce arsenic induced impairment of learning, memory, endothelial function, and alterations in various biochemical parameters. It may be concluded that arsenic induces endothelial dysfunction and dementia, whereas, sodium butyrate, a HDAC inhibitor as well as aminoguanidine, a selective iNOS inhibitor may be considered as potential agents for the management of arsenic induced endothelial dysfunction and dementia. - Highlights: • As has induced endothelial dysfunction (Edf) and vascular dementia (VaD). • As has increased oxidative stress, AChE activity and decreased serum NO. • Inhibitors of HDAC and iNOS have attenuated As induced Edf and VaD. • Both the inhibitors have attenuated As induced biochemical changes. • Inhibitor of HDAC and iNOS has shown good potential
Maupome, G; McConnell, W R; Perry, B L
2016-12-01
To examine the influence of collectivist orientation (often called familismo when applied to the Latino sub-group in the United States) in oral health discussion networks. Through respondent-driven sampling and face-to-face interviews, we identified respondents' (egos) personal social network members (alters). Egos stated whom they talked with about oral health, and how often they discussed dental problems in the preceding 12 months. An urban community of adult Mexican-American immigrants in the Midwest United States. We interviewed 332 egos (90% born in Mexico); egos named an average of 3.9 alters in their networks, 1,299 in total. We applied egocentric network methods to examine the ego, alter, and network variables that characterize health discussion networks. Kin were most often leveraged when dental problems arose; egos relied on individuals whom they perceive to have better knowledge about dental matters. However, reliance on knowledgeable alters decreased among egos with greater behavioral acculturation. This paper developed a network-based conceptualization of familismo. We describe the structure of oral health networks, including kin, fictive kin, peers, and health professionals, and examine how networks and acculturation help shape oral health among these Mexican-Americans.
Directory of Open Access Journals (Sweden)
E. E. Tsiropoulou
2016-06-01
Full Text Available In this paper a joint resource allocation problem is studied in a multi-service Single Carrier FDMA (SC-FDMA wireless network. Mobile users request various services with different Quality of Service (QoS characteristics and they determine in a distributed and non-cooperative manner a joint subcarrier and power allocation towards fulfilling their QoS prerequisites. Initially, a well-designed utility function is formulated to appropriately represent users’ diverse QoS prerequisites with respect to their requested service. The subcarriers allocation problem is solved based on a multilateral bargaining model, where users are able to select different discount factors to enter the bargaining game, thus better expressing their different needs in system resources with respect to their requested service. The subcarriers mapping is realized based either on the localized SC-FDMA method where the subcarriers are sequentially allocated to the users or the distributed SC-FDMA via considering the maximum channel gain policy, where each subcarrier is allocated to the user with the maximum channel gain. Given the subcarriers assignment, an optimization problem with respect to users’ uplink transmission power is formulated and solved, in order to determine the optimal power allocation per subcarrier assigned to each user. Finally, the performance of the proposed framework is evaluated via modeling and simulation and extensive numerical results are presented.
Grover, Jeff
2016-01-01
This book is an extension of the author’s first book and serves as a guide and manual on how to specify and compute 2-, 3-, & 4-Event Bayesian Belief Networks (BBN). It walks the learner through the steps of fitting and solving fifty BBN numerically, using mathematical proof. The author wrote this book primarily for naïve learners and professionals, with a proof-based academic rigor. The author's first book on this topic, a primer introducing learners to the basic complexities and nuances associated with learning Bayes’ theory and inverse probability for the first time, was meant for non-statisticians unfamiliar with the theorem - as is this book. This new book expands upon that approach and is meant to be a prescriptive guide for building BBN and executive decision-making for students and professionals; intended so that decision-makers can invest their time and start using this inductive reasoning principle in their decision-making processes. It highlights the utility of an algorithm that served as ...
Directory of Open Access Journals (Sweden)
Jiuping Xu
2012-01-01
Full Text Available The aim of this study is to deal with a minimum cost network flow problem (MCNFP in a large-scale construction project using a nonlinear multiobjective bilevel model with birandom variables. The main target of the upper level is to minimize both direct and transportation time costs. The target of the lower level is to minimize transportation costs. After an analysis of the birandom variables, an expectation multiobjective bilevel programming model with chance constraints is formulated to incorporate decision makers’ preferences. To solve the identified special conditions, an equivalent crisp model is proposed with an additional multiobjective bilevel particle swarm optimization (MOBLPSO developed to solve the model. The Shuibuya Hydropower Project is used as a real-world example to verify the proposed approach. Results and analysis are presented to highlight the performances of the MOBLPSO, which is very effective and efficient compared to a genetic algorithm and a simulated annealing algorithm.
da Silva, Aleksandra do Socorro; de Brito, Silvana Rossy; Vijaykumar, Nandamudi Lankalapalli; da Rocha, Cláudio Alex Jorge; Monteiro, Maurílio de Abreu; Costa, João Crisóstomo Weyl Albuquerque; Francês, Carlos Renato Lisboa
2016-01-01
The published literature reveals several arguments concerning the strategic importance of information and communication technology (ICT) interventions for developing countries where the digital divide is a challenge. Large-scale ICT interventions can be an option for countries whose regions, both urban and rural, present a high number of digitally excluded people. Our goal was to monitor and identify problems in interventions aimed at certification for a large number of participants in different geographical regions. Our case study is the training at the Telecentros.BR, a program created in Brazil to install telecenters and certify individuals to use ICT resources. We propose an approach that applies social network analysis and mining techniques to data collected from Telecentros.BR dataset and from the socioeconomics and telecommunications infrastructure indicators of the participants' municipalities. We found that (i) the analysis of interactions in different time periods reflects the objectives of each phase of training, highlighting the increased density in the phase in which participants develop and disseminate their projects; (ii) analysis according to the roles of participants (i.e., tutors or community members) reveals that the interactions were influenced by the center (or region) to which the participant belongs (that is, a community contained mainly members of the same region and always with the presence of tutors, contradicting expectations of the training project, which aimed for intense collaboration of the participants, regardless of the geographic region); (iii) the social network of participants influences the success of the training: that is, given evidence that the degree of the community member is in the highest range, the probability of this individual concluding the training is 0.689; (iv) the North region presented the lowest probability of participant certification, whereas the Northeast, which served municipalities with similar
Directory of Open Access Journals (Sweden)
Aleksandra do Socorro da Silva
Full Text Available The published literature reveals several arguments concerning the strategic importance of information and communication technology (ICT interventions for developing countries where the digital divide is a challenge. Large-scale ICT interventions can be an option for countries whose regions, both urban and rural, present a high number of digitally excluded people. Our goal was to monitor and identify problems in interventions aimed at certification for a large number of participants in different geographical regions. Our case study is the training at the Telecentros.BR, a program created in Brazil to install telecenters and certify individuals to use ICT resources. We propose an approach that applies social network analysis and mining techniques to data collected from Telecentros.BR dataset and from the socioeconomics and telecommunications infrastructure indicators of the participants' municipalities. We found that (i the analysis of interactions in different time periods reflects the objectives of each phase of training, highlighting the increased density in the phase in which participants develop and disseminate their projects; (ii analysis according to the roles of participants (i.e., tutors or community members reveals that the interactions were influenced by the center (or region to which the participant belongs (that is, a community contained mainly members of the same region and always with the presence of tutors, contradicting expectations of the training project, which aimed for intense collaboration of the participants, regardless of the geographic region; (iii the social network of participants influences the success of the training: that is, given evidence that the degree of the community member is in the highest range, the probability of this individual concluding the training is 0.689; (iv the North region presented the lowest probability of participant certification, whereas the Northeast, which served municipalities with similar
Hutchinson, Delyse M; Rapee, Ronald M
2007-07-01
This study examined the role of friendship networks and peer influences in body image concern, dietary restraint, extreme weight loss behaviours (EWLBs) and binge eating in a large community sample of young adolescent females. Based on girls' self-reported friendship groups, social network analysis was used to identify 173 friendship cliques. Results indicated that clique members shared similar scores on measures of dieting, EWLB and binge eating, but not body image concern. Average clique scores for dieting, EWLB and binge eating, were also correlated significantly with clique averages on measures of perceived peer influence, body mass index and psychological variables. Multiple regression analyses indicated that perceived peer influences in weight-related attitudes and behaviours were predictive of individual girls' level of body image concern, dieting, EWLB use and binge eating. Notably, an individual girl's dieting and EWLB use could be predicted from her friends' respective dieting and EWLB scores. Findings highlight the significance of the peer environment in body image and eating problems during early adolescence.
Directory of Open Access Journals (Sweden)
M. Dharmalingam
2014-10-01
Full Text Available Contract Bridge is an intellectual game which motivates multiple skills and application of prior experience and knowledge, as no player knows accurately what moves other players are capable of making. The Bridge is a game played in the presence of imperfect information, yet its strategies must be well formulated, since the outcome at any intermediate stage is solely based on the choices made during the immediately preceding phase. In this paper, we train an Artificial Neural Network architecture using sample deals and use it to estimate the number of tricks to be taken by one pair of bridge players, which is the main challenge in the Double Dummy Bridge Problem. We focus on Back Propagation Neural Network Architecture with Back Propagation Algorithm with Sigmoidal transfer functions. We used two approaches namely, High – Card Point Count System and Distribution Point Method during the bidding phase of Contract Bridge. We experimented with two sigmoidal transfer functions namely, Log Sigmoid transfer function and the Hyperbolic Tangent Sigmoid function. Results reveal that the later performs better giving lower mean squared error on the output.
KANOWITH-KLEIN, SUSAN; STAVE, MEL; STEVENS, RON; CASILLAS, ADRIAN M.
2001-01-01
Educators emphasize the importance of problem solving that enables students to apply current knowledge and understanding in new ways to previously unencountered situations. Yet few methods are available to visualize and then assess such skills in a rapid and efficient way. Using a software system that can generate a picture (i.e., map) of students’ strategies in solving problems, we investigated methods to classify problem-solving strategies of high school students who were studying infectious and noninfectious diseases. Using maps that indicated items students accessed to solve a software simulation as well as the sequence in which items were accessed, we developed a rubric to score the quality of the student performances and also applied artificial neural network technology to cluster student performances into groups of related strategies. Furthermore, we established that a relationship existed between the rubric and neural network results, suggesting that the quality of a problem-solving strategy could be predicted from the cluster of performances in which it was assigned by the network. Using artificial neural networks to assess students’ problem-solving strategies has the potential to permit the investigation of the problem-solving performances of hundreds of students at a time and provide teachers with a valuable intervention tool capable of identifying content areas in which students have specific misunderstandings, gaps in learning, or misconceptions. PMID:23653541
Directory of Open Access Journals (Sweden)
Cícero Pereira Alencar
2016-08-01
Full Text Available This article discusses the legal and social impact of the internalization, within the Brazilian law, of the Convention on the Rights of Persons with Disabilities (CRPD, 2008 and its regulations - through the Brazilian Law on the Inclusion of Persons with Disabilities (LBI. The focus of the analysis is the recognition of the legal capacity and the effectiveness of the human rights of persons with disabilities and their impact on legal institutions of guardianship and civil interdiction. To this end, a bibliographical and documentary research was conducted and, based on the theory of social justice, by Martha C. Nussbaum, embedded on the concept of capacity, as well as the critical theory of human rights, by Joaquín Herrera Flores. Our goal was to investigate whether the Brazilian Courts of Appeal had applied the CRPD. In theory, the higher the observance of the Convention, the greater the recognition of the autonomy and legal capacity of persons with disabilities; and thus lower the number of the cases of civil interdiction. The results obtained from the analysis of the data from the Court of Appeal of the state of Minas Gerais, from the period of 2010-2014, indicate findings on the opposite direction.
Protéger la santé grâce à l’interdiction Prohibitions as Means of protecting Health
Directory of Open Access Journals (Sweden)
Claudine Viard
2009-09-01
Full Text Available L’édiction d’interdictions est un outil juridique que les autorités publiques utilisent couramment dans le but de protéger la santé. Des moyens importants en recherche doivent être mis en œuvre pour prouver la nocivité des produits ou d’activités qui ont été préalablement autorisés. Mais avant d’interdire, les obstacles à lever sont nombreux, car les produits et activités en cause ont une utilité, des sociétés importantes en vivent. C’est pourquoi, l’interdiction doit être aménagée, et les acteurs économiques être parfois indemnisés.Public authorities often resort to various forms of prohibition as means of protecting health. First, research has to be carried out in order to prove the harmful effects of previously authorised substances or activities. But before prohibiting these substances and activities, many obstacles have to be overcome. Indeed dangerous activities and products are usually useful in some respect, and large and successful companies make important profit out of them. This is why prohibition have to be worked out so as to allow a compensation of the loss suffered by economic actors.
Directory of Open Access Journals (Sweden)
J. J. Escudero-Garzás
2017-01-01
Full Text Available The trend in wireless networks is that several wireless radio access technologies (RATs coexist in the same area, forming heterogeneous networks in which the users may connect to any of the available RATs. The problem of associating a user to the most suitable RAT, known as network selection problem (NSP, is of capital importance for the satisfaction of the users in these emerging environments. However, also the satisfaction of the operator is important in this scenario. In this work, we propose that a connection may be served by more than one RAT by using multi-RAT terminals. We formulate the NSP with multiple RAT association based on utility functions that take into consideration both user’s satisfaction and provider’s satisfaction. As users are characterized according to their expected quality of service, our results exhaustively analyze the influence of the user’s profile, along with the network topology and the type of applications served.
Directory of Open Access Journals (Sweden)
Wen-Xiang Wu
2014-01-01
Full Text Available The cost-based system optimum problem in networks with continuously distributed value of time is formulated as a path-based form, which cannot be solved by the Frank-Wolfe algorithm. In light of magnitude improvement in the availability of computer memory in recent years, path-based algorithms have been regarded as a viable approach for traffic assignment problems with reasonably large network sizes. We develop a path-based gradient projection algorithm for solving the cost-based system optimum model, based on Goldstein-Levitin-Polyak method which has been successfully applied to solve standard user equilibrium and system optimum problems. The Sioux Falls network tested is used to verify the effectiveness of the algorithm.
Directory of Open Access Journals (Sweden)
D. V. Ageyev
2016-05-01
Full Text Available The problem of dynamic route selection and wavelengths assignment in WDM networks is solved. This problem is important in WDM network management when requests are serviced for short-term connection installation and excess traffic is transferred. The proposed solution method is heuristic and is an improvement of the previously known method by taking into account the influence of four-wave mixing and using the new metric for finding the routes prospective for application. This makes it possible to reduce the probability of blocking calls during the connections at the average of 13% and the value of Q factor at 0.812.
Directory of Open Access Journals (Sweden)
Chao Lu
2016-01-01
Full Text Available This paper is concerned with the scheduling of Electrical Multiple Units (EMUs under the condition of their utilization on one sector or within several interacting sectors. Based on the introduction of the train connection graph which describes the possible connection relationship between trains, the integer programming model of EMU circulation planning is constructed. In order to analyzing the resolution of the model, a heuristic which shares the characteristics with the existing methods is introduced first. This method consists of two stages: one is a greedy strategy to construct a feasible circulation plan fragment, and another is to apply a stochastic disturbance to it to generate a whole feasible solution or get a new feasible solution. Then, an exact branch and bound method which is based on graph designing is proposed. Due to the complexity, the lower bound is computed through a polynomial approximation algorithm which is a modification from the one solving the degree constraint minimum 1-tree problem. Then, a branching strategy is designed to cope with the maintenance constraints. Finally, we report extensive computational results on a railway corridor in which the sectors possess the basic feature of railway networks.
Energy Technology Data Exchange (ETDEWEB)
Castro, Paulo Alexandre de; Souza, Thaianne Lopes de [Universidade Federal de Goias (UFG), Catalao, GO (Brazil)
2011-07-01
Full text. What the Brazilian soccer championship, Hollywood actors, the network of the Internet, the spread of viruses and electric distribution network have in common? Until less than two decade ago, the answer would be 'nothing' or 'almost nothing'. However, the answer today to this same question is 'all' or 'almost all'. The answer to these questions and more can be found through a sub-area of statistical physics | called science of complex networks that has been used to approach and study the most diverse natural and non-natural systems, such as systems/social networks, information, technological or biological. In this work we study the distribution network of electric power in Brazil (DEEB), from a perspective of complex networks, where we associate stations and/or substations with a network of vertices and the links between the vertices we associate with the transmission lines. We are doing too a comparative study with the best-known models of complex networks, such as Erdoes-Renyi, Configuration Model and Barabasi-Albert, and then we compare with results obtained in real electrical distribution networks. Based on this information, we do a comparative analysis using the following variables: connectivity distribution, diameter, clustering coefficient, which are frequently used in studies of complex networks. We emphasize that the main objective of this study is to analyze the robustness of the network DEEB, and then propose alternatives for network connectivity, which may contribute to the increase of robustness in maintenance projects and/or expansion of the network, in other words our goal is to make the network to proof the blackouts or improve the endurance the network against the blackouts. For this purpose, we use information from the structural properties of networks, computer modeling and simulation. (author)
Custer, B; Janssen, M P; Hubben, G; Vermeulen, M; van Hulst, M
2017-08-01
Most countries test donations for HIV, HCV and HBV using serology with or without nucleic acid testing (NAT). Cost-utility analyses provide information on the relative value of different screening options. The aim of this project was to develop an open access risk assessment and cost-utility analysis web-tool for assessing HIV, HCV and HBV screening options (http://www.isbtweb.org/working-parties/transfusion-transmitted-infectious-diseases/). An analysis for six countries (Brazil, Ghana, the Netherlands, South Africa, Thailand and USA) was conducted. Four strategies; (1) antibody assays (Abs) for HIV and HCV + HBsAg, (2) antibody assays that include antigens for HIV and HCV (Combo) + HBsAg, (3) NAT in minipools of variable size (MP NAT) and (4) individual donation (ID) NAT can be evaluated using the tool. Country-specific data on donors, donation testing results, recipient outcomes and costs are entered using the online interface. Results obtained include the number infections interdicted using each screening options, and the (incremental and average) cost-utility of the options. In each of the six countries evaluated, the use of antibody assays is cost effective or even cost saving. NAT has varying cost-utility depending on the setting, and where adopted, the incremental cost-utility exceeds any previously defined or proposed threshold in each country. The web-tool allows an assessment of infectious units interdicted and value for money of different testing strategies. Regardless of gross national income (GNI) per capita, countries appear willing to dedicate healthcare resources to blood supply safety in excess of that for other sectors of health care. © 2017 International Society of Blood Transfusion.
Le Roux, Jay
2016-04-01
Soil erosion not only involves the loss of fertile topsoil but is also coupled with sedimentation of dams, a double barrel problem in semi-arid regions where water scarcity is frequent. Due to increasing water requirements in South Africa, the Department of Water and Sanitation is planning water resource development in the Mzimvubu River Catchment, which is the only large river network in the country without a dam. Two dams are planned including a large irrigation dam and a hydropower dam. However, previous soil erosion studies indicate that large parts of the catchment is severely eroded. Previous studies, nonetheless, used mapping and modelling techniques that represent only a selection of erosion processes and provide insufficient information about the sediment yield. This study maps and models the sediment yield comprehensively by means of two approaches over a five-year timeframe between 2007 and 2012. Sediment yield contribution from sheet-rill erosion was modelled with ArcSWAT (a graphical user interface for SWAT in a GIS), whereas gully erosion contributions were estimated using time-series mapping with SPOT 5 imagery followed by gully-derived sediment yield modelling in a GIS. Integration of the sheet-rill and gully results produced a total sediment yield map, with an average of 5 300 t km-2 y-1. Importantly, the annual average sediment yield of the areas where the irrigation dam and hydropower dam will be built is around 20 000 t km-2 y-1. Without catchment rehabilitation, the life expectancy of the irrigation dam and hydropower dam could be 50 and 40 years respectively.
Mowbray, Orion
2014-01-01
Many individuals wait until alcohol use becomes severe before treatment is sought. However, social networks, or the number of social groups an individual belongs to, may play a moderating role in this relationship. Logistic regression examined the interaction of alcohol consumption and social networks as a predictor of treatment utilization while adjusting for sociodemographic and clinical variables among 1,433 lifetime alcohol-dependent respondents from wave 2 of the National Epidemiologic Survey on Alcohol Related Conditions (NESARC). Results showed that social networks moderate the relationship between alcohol consumption and treatment utilization such that for individuals with few network ties, the relationship between alcohol consumption and treatment utilization was diminished, compared to the relationship between alcohol consumption and treatment utilization for individuals with many network ties. Findings offer insight into how social networks, at times, can influence individuals to pursue treatment, while at other times, influence individuals to stay out of treatment, or seek treatment substitutes. PMID:24462223
Hansen, T. M.; Cordua, K. S.
2017-12-01
Probabilistically formulated inverse problems can be solved using Monte Carlo-based sampling methods. In principle, both advanced prior information, based on for example, complex geostatistical models and non-linear forward models can be considered using such methods. However, Monte Carlo methods may be associated with huge computational costs that, in practice, limit their application. This is not least due to the computational requirements related to solving the forward problem, where the physical forward response of some earth model has to be evaluated. Here, it is suggested to replace a numerical complex evaluation of the forward problem, with a trained neural network that can be evaluated very fast. This will introduce a modeling error that is quantified probabilistically such that it can be accounted for during inversion. This allows a very fast and efficient Monte Carlo sampling of the solution to an inverse problem. We demonstrate the methodology for first arrival traveltime inversion of crosshole ground penetrating radar data. An accurate forward model, based on 2-D full-waveform modeling followed by automatic traveltime picking, is replaced by a fast neural network. This provides a sampling algorithm three orders of magnitude faster than using the accurate and computationally expensive forward model, and also considerably faster and more accurate (i.e. with better resolution), than commonly used approximate forward models. The methodology has the potential to dramatically change the complexity of non-linear and non-Gaussian inverse problems that have to be solved using Monte Carlo sampling techniques.
National Research Council Canada - National Science Library
Tatyana Alekseevna Serezhko; Zhanna Sergeyevna Kokhan
2017-01-01
Purpose. In article the possibility of the organization of communication of teachers of the higher school with students on social networks for increase in efficiency of educational process and self-education...
Mowbray, Orion
2014-01-01
Many individuals wait until alcohol use becomes severe before treatment is sought. However, social networks, or the number of social groups an individual belongs to, may play a moderating role in this relationship. Logistic regression examined the interaction of alcohol consumption and social networks as a predictor of treatment utilization while adjusting for sociodemographic and clinical variables among 1,433 lifetime alcohol-dependent respondents from wave 2 of the National Epidemiologic Survey on Alcohol Related Conditions (NESARC). Results showed that social networks moderate the relationship between alcohol consumption and treatment utilization such that for individuals with few network ties, the relationship between alcohol consumption and treatment utilization was diminished, compared to the relationship between alcohol consumption and treatment utilization for individuals with many network ties. Findings offer insight into how social networks, at times, can influence individuals to pursue treatment, while at other times, influence individuals to stay out of treatment, or seek treatment substitutes. Copyright © 2014 Elsevier Inc. All rights reserved.
Directory of Open Access Journals (Sweden)
Milton Crispim dos Santos
2016-11-01
Full Text Available The objective of this study is to apply MASP in the logistics area of a supermarket belonging to a Large Retail Network, initially identifying existing problems in the company’s logistics and then solving the most severe problems according to the above mentioned tool. The research was a qualitative and exploratory case study. The data collection tool used was a questionnaire with 10 open-ended and closed-ended questions, which was distributed to 31 research subjects, composed of employees who occupy positions of management and leadership in 16 sectors of the supermarket. The results of the research identified 11 problems in logistics , with the most relevant being excess stock, which was addressed by the MASP tool through the implementation of 8 steps, aided by other quality tools already established in the literature.
Ryan, Nicholas P; Catroppa, Cathy; Beare, Richard; Silk, Timothy J; Crossley, Louise; Beauchamp, Miriam H; Yeates, Keith Owen; Anderson, Vicki A
2016-04-01
Childhood and adolescence coincide with rapid maturation and synaptic reorganization of distributed neural networks that underlie complex cognitive-affective behaviors. These regions, referred to collectively as the 'social brain network' (SBN) are commonly vulnerable to disruption from pediatric traumatic brain injury (TBI); however, the mechanisms that link morphological changes in the SBN to behavior problems in this population remain unclear. In 98 children and adolescents with mild to severe TBI, we acquired 3D T1-weighted MRIs at 2-8 weeks post-injury. For comparison, 33 typically developing controls of similar age, sex and education were scanned. All participants were assessed on measures of Theory of Mind (ToM) at 6 months post-injury and parents provided ratings of behavior problems at 24-months post-injury. Severe TBI was associated with volumetric reductions in the overall SBN package, as well as regional gray matter structural change in multiple component regions of the SBN. When compared with TD controls and children with milder injuries, the severe TBI group had significantly poorer ToM, which was associated with more frequent behavior problems and abnormal SBN morphology. Mediation analysis indicated that impaired theory of mind mediated the prospective relationship between abnormal SBN morphology and more frequent chronic behavior problems. Our findings suggest that sub-acute alterations in SBN morphology indirectly contribute to long-term behavior problems via their influence on ToM. Volumetric change in the SBN and its putative hub regions may represent useful imaging biomarkers for prediction of post-acute social cognitive impairment, which may in turn elevate risk for chronic behavior problems. © The Author (2016). Published by Oxford University Press. For Permissions, please email: journals.permissions@oup.com.
Directory of Open Access Journals (Sweden)
Benas Brunalas
2015-02-01
Full Text Available The two scientific perspectives that compete in social sciences – positivism and postpositivism – present two different perceptions of the realities and their interpretations. The logic of the two different positions perceives identity and the ratio of structure to a unit differently. From positivist perspective, the dominating statements propose that preconceived and ‘stationary’ structures, the states of units of structures and identities exist, whereas post-positivism approach suggests that a circulation of units, structures and identities is a constant action.An aspiration to strictly conform to the logic of one or the other scientific paradigm, while forming ontological and epistemological positions, leads to dead-end, and the initial aspiration of a scientific theory – practical benefit – remains unfulfilled. A way out of this ‘theoretical maze’ is assisted by propositions of scientific realism, which allows combining positions, while adjusting the attitudes of positivism and post-positivism which look contradictory from a standpoint. These propositions follow subjectivistic ontology; however, they deny the fact that it necessarily has to implicate positivistic epistemology. By using the statements of scientific realism, the article justifies a transitional way between the two camps (positivism and post-positivism, while arguing that only by integrating different positions, the research of identity that points to practice is possible. This is especially relevant during the analysis of the structure and the ratio of the structure to a unit.The article holds an attitude that a network society, which has a fresh quality and highlights a double-sided relationship of the structure and a unit of the structure, has been developing in the 21st century. The specific structure of the network is a decentralized structure, which power center can be perceived as an actual network’s self-regulating mode, which ‘indicates’ and
DEFF Research Database (Denmark)
Lerche Nielsen, Jørgen; Andreasen, Lars Birch
2012-01-01
This paper focuses on how learner engagement can be facilitated through use of social media and communication technologies. The discussions are based on the Danish Master’s Programme of ICT and Learning (MIL), where students study in groups within a networked learning structure. The paper reflect...... on the challenges for students as both independent and interconnected learners.......This paper focuses on how learner engagement can be facilitated through use of social media and communication technologies. The discussions are based on the Danish Master’s Programme of ICT and Learning (MIL), where students study in groups within a networked learning structure. The paper reflects...
Kishi, Reiko; Horikawa, Naoko
2004-02-01
Concerning associations between the social support network and physical health of the elderly, longitudinal studies have been conducted using various measurement indexes. The studies indicated that the support network influences on physical function and life expectancy. In this study we compared research papers from Japan and elsewhere that appeared after 1980, from the viewpoint of 1) social support effects, and 2) social network effects, to examine potential problems in the future. The main knowledge obtained was that the receipt of emotional support, wide network size, and participation in social activities reduced the risk of early death and decrease in physical function of elderly people. Sex differences were indicated, and in many cases, the effects were more remarkable in men than women. In addition the positive influence of receiving help from a support network, a major subject of conventional research, the effects of offering help to others and negative findings were also examined. It has been indicated that participation in volunteer groups and offer of support to other people can prevent decrease in physical function or early death. As negative effects, improper instrumental support rather disturbs the mental and physical independence of elderly people. As future issues, it is necessary to focus on both positive/negative and receipt/offer effects of support network, and to clarify how to provide example which best match the life of elderly people by comparing sexes and regions. It is also important to actually apply the knowledge gained from observational studies to prevent the elderly from becoming a condition requiring care, and to develop intervention studies which can increase the social contacts of elderly people at the same time as conducting health education and medical treatment.
Introduction to neural networks
James, Frederick E
1994-02-02
1. Introduction and overview of Artificial Neural Networks. 2,3. The Feed-forward Network as an inverse Problem, and results on the computational complexity of network training. 4.Physics applications of neural networks.
Directory of Open Access Journals (Sweden)
Yu Zhang
2014-01-01
Full Text Available We consider an ad hoc Floyd-A∗ algorithm to determine the a priori least-time itinerary from an origin to a destination given an initial time in an urban scheduled public transport (USPT network. The network is bimodal (i.e., USPT lines and walking and time dependent. The modified USPT network model results in more reasonable itinerary results. An itinerary is connected through a sequence of time-label arcs. The proposed Floyd-A∗ algorithm is composed of two procedures designated as Itinerary Finder and Cost Estimator. The A∗-based Itinerary Finder determines the time-dependent, least-time itinerary in real time, aided by the heuristic information precomputed by the Floyd-based Cost Estimator, where a strategy is formed to preestimate the time-dependent arc travel time as an associated static lower bound. The Floyd-A∗ algorithm is proven to guarantee optimality in theory and, demonstrated through a real-world example in Shenyang City USPT network to be more efficient than previous procedures. The computational experiments also reveal the time-dependent nature of the least-time itinerary. In the premise that lines run punctually, “just boarding” and “just missing” cases are identified.
Elzen, Boelem; Enserink, Bert; Enserink, B.; Smit, Willem A.
1996-01-01
This paper is motivated by a desire to deal with the problematic aspects of technical development. To achieve this, we need a new approach to the analysis of socio-technical change. In this paper we develop such an approach, called the `Socio-Technical Networks' (STN) approach. The basic concepts of
Fazayeli, Saeed; Eydi, Alireza; Kamalabadi, Isa Nakhai
2017-07-01
Nowadays, organizations have to compete with different competitors in regional, national and international levels, so they have to improve their competition capabilities to survive against competitors. Undertaking activities on a global scale requires a proper distribution system which could take advantages of different transportation modes. Accordingly, the present paper addresses a location-routing problem on multimodal transportation network. The introduced problem follows four objectives simultaneously which form main contribution of the paper; determining multimodal routes between supplier and distribution centers, locating mode changing facilities, locating distribution centers, and determining product delivery tours from the distribution centers to retailers. An integer linear programming is presented for the problem, and a genetic algorithm with a new chromosome structure proposed to solve the problem. Proposed chromosome structure consists of two different parts for multimodal transportation and location-routing parts of the model. Based on published data in the literature, two numerical cases with different sizes generated and solved. Also, different cost scenarios designed to better analyze model and algorithm performance. Results show that algorithm can effectively solve large-size problems within a reasonable time which GAMS software failed to reach an optimal solution even within much longer times.
Dolenko, T. A.; Burikov, S. A.; Vervald, E. N.; Efitorov, A. O.; Laptinskiy, K. A.; Sarmanova, O. E.; Dolenko, S. A.
2017-02-01
Elaboration of methods for the control of biochemical reactions with deoxyribonucleic acid (DNA) strands is necessary for the solution of one of the basic problems in the creation of biocomputers—improvement in the reliability of molecular DNA computing. In this paper, the results of the solution of the four-parameter inverse problem of laser Raman spectroscopy—the determination of the type and concentration of each of the DNA nitrogenous bases in multi-component solutions—are presented.
“Q-Feed”—An Effective Solution for the Free-Riding Problem in Unstructured P2P Networks
Directory of Open Access Journals (Sweden)
Sabu M. Thampi
2010-01-01
Full Text Available This paper presents a solution for reducing the ill effects of free-riders in decentralised unstructured P2P networks. An autonomous replication scheme is proposed to improve the availability and enhance system performance. Q-learning is widely employed in different situations to improve the accuracy in decision making by each peer. Based on the performance of neighbours of a peer, every neighbour is awarded different levels of ranks. At the same time a low-performing node is allowed to improve its rank in different ways. Simulation results show that Q-learning-based free riding control mechanism effectively limits the services received by free-riders and also encourages the low-performing neighbours to improve their position. The popular files are autonomously replicated to nodes possessing required parameters. Due to this improvement of quantity of popular files, free riders are given opportunity to lift their position for active participation in the network for sharing files. Q-feed effectively manages queries from free riders and reduces network traffic significantly.
Krioukov, Dmitri; Kitsak, Maksim; Sinkovits, Robert S; Rideout, David; Meyer, David; Boguñá, Marián
2012-01-01
Prediction and control of the dynamics of complex networks is a central problem in network science. Structural and dynamical similarities of different real networks suggest that some universal laws might accurately describe the dynamics of these networks, albeit the nature and common origin of such laws remain elusive. Here we show that the causal network representing the large-scale structure of spacetime in our accelerating universe is a power-law graph with strong clustering, similar to many complex networks such as the Internet, social, or biological networks. We prove that this structural similarity is a consequence of the asymptotic equivalence between the large-scale growth dynamics of complex networks and causal networks. This equivalence suggests that unexpectedly similar laws govern the dynamics of complex networks and spacetime in the universe, with implications to network science and cosmology.
Krioukov, Dmitri; Kitsak, Maksim; Sinkovits, Robert S.; Rideout, David; Meyer, David; Boguñá, Marián
2012-01-01
Prediction and control of the dynamics of complex networks is a central problem in network science. Structural and dynamical similarities of different real networks suggest that some universal laws might accurately describe the dynamics of these networks, albeit the nature and common origin of such laws remain elusive. Here we show that the causal network representing the large-scale structure of spacetime in our accelerating universe is a power-law graph with strong clustering, similar to many complex networks such as the Internet, social, or biological networks. We prove that this structural similarity is a consequence of the asymptotic equivalence between the large-scale growth dynamics of complex networks and causal networks. This equivalence suggests that unexpectedly similar laws govern the dynamics of complex networks and spacetime in the universe, with implications to network science and cosmology. PMID:23162688
Olssøn, Ingrid; Dahl, Alv A
2012-08-01
The aim of the study was to explore the associations between the presence of avoidant personality problems (APPs) and 5 areas of impairment: demography, somatic issues, mental health, lifestyle, and social issues. Avoidant personality problem was defined by confirmation of the 2 avoidant personality disorder items of the Iowa Personality Disorder Screen and and the Social Phobia Inventory (SPIN) short version (MINI-SPIN) screening assessment for generalized social anxiety disorder sum score of 6 or more. The questionnaires were administered in a Norwegian population survey (the Oslo Health Study-HUBRO). Cases consisted of 280 individuals with APP and 5 randomly selected controls without APP (n = 1400). The APP group more frequently reported living alone, lower level of education, and lower income than controls. Poor self-rated health, presence of somatic disease, muscular pain, frequent use of analgesics, and visits at a general practitioner were significantly more common in the APP group than among controls. The APP group had significantly higher proportion of caseness of mental distress, low general self-efficacy, and insomnia, and this result held up in multivariate analyses. The APP group showed statistically significant higher proportions of physical inactivity, obesity, daily smoking, and alcohol problems compared with controls. As for social impairment, a significantly higher proportion of the APP group reported "not having enough good friends," "high powerlessness," and low community activism, and the 2 former variables held up in multivariate analyses. In this population-based study, we found that high levels of APP, defined closely to avoidant personality disorder, were significantly associated with demographic, somatic, and mental impairment; low general self-efficacy; and insomnia affecting work ability. In addition, APP showed associations with negative lifestyle, alcohol problems, and social impairment reporting lack of good friends and lack of
Fairbank, Michael; Li, Shuhui; Fu, Xingang; Alonso, Eduardo; Wunsch, Donald
2014-01-01
We present a recurrent neural-network (RNN) controller designed to solve the tracking problem for control systems. We demonstrate that a major difficulty in training any RNN is the problem of exploding gradients, and we propose a solution to this in the case of tracking problems, by introducing a stabilization matrix and by using carefully constrained context units. This solution allows us to achieve consistently lower training errors, and hence allows us to more easily introduce adaptive capabilities. The resulting RNN is one that has been trained off-line to be rapidly adaptive to changing plant conditions and changing tracking targets. The case study we use is a renewable-energy generator application; that of producing an efficient controller for a three-phase grid-connected converter. The controller we produce can cope with the random variation of system parameters and fluctuating grid voltages. It produces tracking control with almost instantaneous response to changing reference states, and virtually zero oscillation. This compares very favorably to the classical proportional integrator (PI) controllers, which we show produce a much slower response and settling time. In addition, the RNN we propose exhibits better learning stability and convergence properties, and can exhibit faster adaptation, than has been achieved with adaptive critic designs. Copyright © 2013 Elsevier Ltd. All rights reserved.
Directory of Open Access Journals (Sweden)
Bisheng He
2014-01-01
Full Text Available A time-space network based optimization method is designed for high-speed rail train timetabling problem to improve the service level of the high-speed rail. The general time-space path cost is presented which considers both the train travel time and the high-speed rail operation requirements: (1 service frequency requirement; (2 stopping plan adjustment; and (3 priority of train types. Train timetabling problem based on time-space path aims to minimize the total general time-space path cost of all trains. An improved branch-and-price algorithm is applied to solve the large scale integer programming problem. When dealing with the algorithm, a rapid branching and node selection for branch-and-price tree and a heuristic train time-space path generation for column generation are adopted to speed up the algorithm computation time. The computational results of a set of experiments on China’s high-speed rail system are presented with the discussions about the model validation, the effectiveness of the general time-space path cost, and the improved branch-and-price algorithm.
2008-06-01
such as intensification, diversification , and strategic oscillation (Harder et al., 2004). Harder et al.’s results are comparable to results achieved...were obtained by running both solutions using solvers on a Dell Precision PWS690 Intel® Xeon™ CPU 3.37GHz processor, with 3.00 GB of RAM. In some...there are multiple optimal solutions, but given the problem description, efficient routing procedures are desired and minor reward diversification
Energy Technology Data Exchange (ETDEWEB)
Bereketli Zafeirakopoulos, Ilke, E-mail: ibereketli@gsu.edu.tr; Erol Genevois, Mujde, E-mail: merol@gsu.edu.tr
2015-09-15
Life Cycle Assessment is a tool to assess, in a systematic way, the environmental aspects and its potential environmental impacts and resources used throughout a product's life cycle. It is widely accepted and considered as one of the most powerful tools to support decision-making processes used in ecodesign and sustainable production in order to learn about the most problematic parts and life cycle phases of a product and to have a projection for future improvements. However, since Life Cycle Assessment is a cost and time intensive method, companies do not intend to carry out a full version of it, except for large corporate ones. Especially for small and medium sized enterprises, which do not have enough budget for and knowledge on sustainable production and ecodesign approaches, focusing only on the most important possible environmental aspect is unavoidable. In this direction, finding the right environmental aspect to work on is crucial for the companies. In this study, a multi-criteria decision-making methodology, Analytic Network Process is proposed to select the most relevant environmental aspect. The proposed methodology aims at providing a simplified environmental assessment to producers. It is applied for a hand blender, which is a member of the Electrical and Electronic Equipment family. The decision criteria for the environmental aspects and relations of dependence are defined. The evaluation is made by the Analytic Network Process in order to create a realistic approach to inter-dependencies among the criteria. The results are computed via the Super Decisions software. Finally, it is observed that the procedure is completed in less time, with less data, with less cost and in a less subjective way than conventional approaches. - Highlights: • We present a simplified environmental assessment methodology to support LCA. • ANP is proposed to select the most relevant environmental aspect. • ANP deals well with the interdependencies between aspects
Energy Technology Data Exchange (ETDEWEB)
Lepetit, V.
2000-06-01
The methyl-tri-butyl-ether (MTBE) is an oxygenated automotive fuel additive used to increase the octane index and reduce the pollutant emissions. However, this additive is accused by the State secretary of agriculture and by the environment protection agency (EPA) of being a pollutant of aquifers, and thus should fall under the toxic substance control acts. MTBE is already prohibited in California and would be so in other states soon. According to European additive producers, the problem is mainly due to leaks of MTBE from the US production sites and fuel stocks towards the environment and suggest to use MTBE as a tracer to prevent the contamination of water by more toxic compounds like benzene. Short paper. (J.S.)
Directory of Open Access Journals (Sweden)
Yu. L. Sayenko
2016-12-01
Full Text Available Purpose. To perform structural and parametric identification of generalized load equivalent circuit of three-phase three-wire load in the network in the space of phase components. Methodology. Underlying structural identification methods are matrix analysis of electrical circuits. Parametric identification is based on the basic laws of electrical engineering. Results. The structure of a generalized load equivalent circuit is composed in three independent nodes. An approximate method for determining its parameters is proposed. The estimation error determination undistorted and distorted parts of the parameters of generalized load equivalent circuit. Originality. Approximate determination of equivalent circuit parameters are based on the results of a single measurement of voltages and phase currents. Practical value. The proposed replacement structure and a method for determining its parameters of the circuit can be used in the problem of the distribution of actual contributions at the point of common coupling.
Lalonde, Lyne; Quintana-Bárcena, Patricia; Lord, Anne; Bell, Robert; Clément, Valérie; Daigneault, Anne-Marie; Legris, Marie-Ève; Letendre, Sara; Mouchbahani, Marie; Jouini, Ghaya; Azar, Joëlle; Martin, Élisabeth; Berbiche, Djamal; Beaulieu, Stephanie; Beaunoyer, Sébastien; Bertin, Émilie; Bouvrette, Marianne; Charbonneau-Séguin, Noémie; Desrochers, Jean-François; Desforges, Katherine; Dumoulin-Charette, Ariane; Dupuis, Sébastien; El Bouchikhi, Maryame; Forget, Roxanne; Guay, Marianne; Lemieux, Jean-Phillippe; Morin-Bélanger, Claudia; Noël, Isabelle; Ricard, Stephanie; Sauvé, Patricia; Ste-Marie Paradis, François
2017-09-01
Appropriate training for community pharmacists may improve the quality of medication use. Few studies have reported the impact of such programs on medication management for patients with chronic kidney disease (CKD). Multicenter, cluster-randomized, controlled trial. Patients with CKD stage 3a, 3b, or 4 from 6 CKD clinics (Quebec, Canada) and their community pharmacies. Each cluster (a pharmacy and its patients) was randomly assigned to either ProFiL, a training-and-communication network program, or the control group. ProFiL pharmacists completed a 90-minute interactive web-based training program on use of medications in CKD and received a clinical guide, patients' clinical summaries, and facilitated access to the CKD clinic. Drug-related problems (primary outcome), pharmacists' knowledge and clinical skills, and patients' clinical attributes (eg, blood pressure and glycated hemoglobin concentration). Drug-related problems were evaluated the year before and after the recruitment of patients using a validated set of significant drug-related problems, the Pharmacotherapy Assessment in Chronic Renal Disease (PAIR) criteria. Pharmacists' questionnaires were completed at baseline and after 1 year. Clinical attributes were documented at baseline and after 1 year using available information in medical charts. 207 community pharmacies, 494 pharmacists, and 442 patients with CKD participated. After 1 year, the mean number of drug-related problems per patient decreased from 2.16 to 1.60 and from 1.70 to 1.62 in the ProFiL and control groups, respectively. The difference in reduction of drug-related problems per patient between the ProFiL and control groups was -0.32 (95% CI, -0.63 to -0.01). Improvements in knowledge (difference, 4.5%; 95% CI, 1.6%-7.4%) and clinical competencies (difference, 7.4%; 95% CI, 3.5%-11.3%) were observed among ProFiL pharmacists. No significant differences in clinical attributes were observed across the groups. High proportion of missing data
DEFF Research Database (Denmark)
Bruun, Jesper; Evans, Robert Harry
2014-01-01
This paper describes the background for, realisation of and author reflections on a network workshop held at ESERA2013. As a new research area in science education, networks offer a unique opportunity to visualise and find patterns and relationships in complicated social or academic network data...... research community. With this workshop, participants were offered a way into network science based on authentic educational research data. The workshop was constructed as an inquiry lesson with emphasis on user autonomy. Learning activities had participants choose to work with one of two cases of networks...... network methodology in one’s research might supersede the perceived benefits of doing so. As a response to that problem, we argue that workshops can act as a road towards meaningful engagement with networks and highlight that network methodology promises new ways of interpreting data to answer questions...
[Practical problems in criminal laws of prevention of cruelty to animals].
Iburg, U
2000-03-01
1. To ascertain serious pains and sufferings in the meaning of section 17 no. 2 b law of prevention of cruelty to animals you cannot do without the help of an expert witness for taking possession of evidence--apart from simple cases. Except the clarifying of fundamental questions concerning prevention of cruelty to animals a professional statement of the administrative veterinary surgeon will be as a rule sufficient. 2. For the actual seizure of animals for the purpose of confiscation and compulsory disposal the criminal justice is extremely dependent on the support of the authorities of administration. Therefore a trouble-free cooperation of criminal justice, veterinary authorities, animal homes and--concerning the protection of species--authorities for protection of endangered nature is imperative. 3. The main problems with the application of the regulation concerning the interdiction of keeping animals according to sections 20 and 20 a law of prevention of cruelty to animals are justified in the legal prerequisites. It is unsatisfactory that an interdiction of keeping animals cannot be imposed by summary punishment order and that a confiscation of animals is not possible by criminal proceedings in case of offence against sections 20 subsection 3, 20 a subsection 3 law of prevention of cruelty to animals. Therefore an admission of the sections as mentioned above to section 19 law of prevention of cruelty to animals seems to be convenient.
Caine Steve; Richards Nicky; Bremner Stephen A; De Wilde Stephen; Cook Derek G; Carey Iain M; Strachan David P; Hilton Sean R
2003-01-01
Abstract Background The General Practice Research Database (GPRD) and Doctor's Independent Network Database (DIN), are large electronic primary care databases compiled in the UK during the 1990s. They provide a valuable resource for epidemiological and health services research. GPRD (based on VAMP) presents notes as a series of discrete episodes, whereas DIN is based on a system (MEDITEL) that used a Problem Orientated Medical Record (POMR) which links prescriptions to diagnostic problems. We...
Onizuka, Miho; Hoang, Huu; Kawato, Mitsuo; Tokuda, Isao T; Schweighofer, Nicolas; Katori, Yuichi; Aihara, Kazuyuki; Lang, Eric J; Toyama, Keisuke
2013-11-01
The inferior olive (IO) possesses synaptic glomeruli, which contain dendritic spines from neighboring neurons and presynaptic terminals, many of which are inhibitory and GABAergic. Gap junctions between the spines electrically couple neighboring neurons whereas the GABAergic synaptic terminals are thought to act to decrease the effectiveness of this coupling. Thus, the glomeruli are thought to be important for determining the oscillatory and synchronized activity displayed by IO neurons. Indeed, the tendency to display such activity patterns is enhanced or reduced by the local administration of the GABA-A receptor blocker picrotoxin (PIX) or the gap junction blocker carbenoxolone (CBX), respectively. We studied the functional roles of the glomeruli by solving the inverse problem of estimating the inhibitory (gi) and gap-junctional conductance (gc) using an IO network model. This model was built upon a prior IO network model, in which the individual neurons consisted of soma and dendritic compartments, by adding a glomerular compartment comprising electrically coupled spines that received inhibitory synapses. The model was used in the forward mode to simulate spike data under PIX and CBX conditions for comparison with experimental data consisting of multi-electrode recordings of complex spikes from arrays of Purkinje cells (complex spikes are generated in a one-to-one manner by IO spikes and thus can substitute for directly measuring IO spike activity). The spatiotemporal firing dynamics of the experimental and simulation spike data were evaluated as feature vectors, including firing rates, local variation, auto-correlogram, cross-correlogram, and minimal distance, and were contracted onto two-dimensional principal component analysis (PCA) space. gc and gi were determined as the solution to the inverse problem such that the simulation and experimental spike data were closely matched in the PCA space. The goodness of the match was confirmed by an analysis of variance
Directory of Open Access Journals (Sweden)
Shou-feng Ji
2017-06-01
Full Text Available The increasing concern on global warming is prompting transportation sector to take into account more sustainable operation strategies. Among them, intermodal transportation (IT has already been regarded as one of the most effective measures on carbon reductions. This paper focuses on the model and algorithm for a certain kind of IT, namely multi-objective multi-sourcing intermodal transportation network design problem (MO_MITNDP, in which carbon emission factors are specially considered. The MO_MITNDP is concerned with determining optimal transportation routes and modes for a series of freight provided by multiple sourcing places to find good balance between the total costs and time efficiencies. First, we establish a multi-objective integer programming model to formulate the MO_MITNDP with total cost (TTC and maximum flow time (MFT criteria. Specifically, carbon emission costs distinguished by the different transportation mode and route are included in the cost function. Second, to solve the MO_MITNDP, a hybrid estimation of distribution algorithm (HEDA combined with a heterogeneous marginal distribution and a multi-objective local search is proposed, in which the from the Pareto dominance scenario. Finally, based on randomly generated data and a real-life case study of Jilin Petrochemical Company (JPC, China, simulation experiments and comparisons are carried out to demonstrate the effectiveness and application value of the proposed HEDA.
Symes, Yael; Campo, Rebecca A.; Wu, Lisa M.; Austin, Jane
2016-01-01
Background Cancer survivors treated with hematopoietic stem cell transplant rely on their social network for successful recovery. However, some survivors have negative attitudes about using social resources (negative social network orientation) that are critical for their recovery. Purpose We examined the association between survivors’ social network orientation and health-related quality of life (HRQoL) and whether it was mediated by social resources (network size, perceived support, and negative and positive support-related social exchanges). Methods In a longitudinal study, 255 survivors completed validated measures of social network orientation, HRQoL, and social resources. Hypotheses were tested using path analysis. Results More negative social network orientation predicted worse HRQoL (p social exchanges. Conclusions Survivors with negative social network orientation may have poorer HRQoL in part due to deficits in several key social resources. Findings highlight a subgroup at risk for poor transplant outcomes and can guide intervention development. PMID:26693932
Enhancing Air Interdiction of WMD
2014-04-01
plane.” CNN.com. 23 March 2014. http://www.cnn.com/2014/03/15/world/asia/ malaysia - airlines - flight - 370 -chronology/index.html?iid=article_sidebar...emerge in tracking of missing Malaysia Airlines plane,” CNN.com, 23 March 2014, http://www.cnn.com/2014/03/15/world/asia/ malaysia - airlines - flight ...Force Glossary." https:// doctrine.af.mil/DTM/dtmglossary.htm. Martinez, Michael. “Key moments emerge in tracking of missing Malaysia Airlines
Roving UAV IED Interdiction System
2011-03-01
President and Provost This report was prepared for the Chairman of the Systems Engineering Department in pursuit of the degree of Master of Science ...IED fall into five general categories: Static, Disguised Static, Disguised Moveable, Thrown/Projected, and Hoax . The Static category contains IEDs...Thrown or Projected IEDs are used in a manner similar to grenades and are typically thrown off overpasses or bridges. Hoax IEDs are non-operational IEDs
Directory of Open Access Journals (Sweden)
Guillaume Le Floch
2009-09-01
Full Text Available Le principe de l’interdiction du recours à la force est une pièce maîtresse dans l’édifice du système de sécurité collective mis en place après la seconde guerre mondiale. Transgressé à différentes reprises, la question de sa valeur se pose aujourd’hui. En effet, d’aucuns estiment que les multiples atteintes à ce principe ont eu pour effet d’en altérer sa valeur, de le faire tomber en désuétude. Cette affirmation doit être écartée car si la violation d’une règle de droit a évidemment des conséquences sur son effectivité, cela ne saurait remettre automatiquement en cause son existence. Même s’il y est porté atteinte, le principe de l’interdiction du recours à la force demeure une règle de droit positif.Prohibition of the use of force as a principle is a fundamental element in the structure of the collective security system established after World War II. Since it has been violated on various occasions, the question of its legal effect arises today. Indeed, some argue that multiple violations of this principle have resulted in its falling into disuse. This assertion must be dismissed because, if the breach of a legal rule obviously has an impact on its effectiveness, it does not automatically question its existence. Even when infringed, the principle of the prohibition of the use of force remains a positive law rule.
Overlay networks toward information networking
Tarkoma, Sasu
2010-01-01
With their ability to solve problems in massive information distribution and processing, while keeping scaling costs low, overlay systems represent a rapidly growing area of R&D with important implications for the evolution of Internet architecture. Inspired by the author's articles on content based routing, Overlay Networks: Toward Information Networking provides a complete introduction to overlay networks. Examining what they are and what kind of structures they require, the text covers the key structures, protocols, and algorithms used in overlay networks. It reviews the current state of th
Techniques for Analysing Problems in Engineering Projects
DEFF Research Database (Denmark)
Thorsteinsson, Uffe
1998-01-01
Description of how CPM network can be used for analysing complex problems in engineering projects.......Description of how CPM network can be used for analysing complex problems in engineering projects....
... Women Hair Loss Hand/Wrist/Arm Problems Headaches Hearing Problems Hip Problems Knee Problems Leg Problems Lower Back ... have ear pain or redness but is having problems hearing?YesNo Back to Questions Step 3 Possible Causes ...
A Network Traffic Control Enhancement Approach over Bluetooth Networks
DEFF Research Database (Denmark)
Son, L.T.; Schiøler, Henrik; Madsen, Ole Brun
2003-01-01
This paper analyzes network traffic control issues in Bluetooth data networks as convex optimization problem. We formulate the problem of maximizing of total network flows and minimizing the costs of flows. An adaptive distributed network traffic control scheme is proposed as an approximated...... solution of the stated optimization problem that satisfies quality of service requirements and topologically induced constraints in Bluetooth networks, such as link capacity and node resource limitations. The proposed scheme is decentralized and complies with frequent changes of topology as well...... as capacity limitations and flow requirements in the network. Simulation shows that the performance of Bluetooth networks could be improved by applying the adaptive distributed network traffic control scheme...
Energy Technology Data Exchange (ETDEWEB)
Rious, V
2007-10-15
This thesis analyses how the long term coordination between generation and transmission is organised in a liberalized power system. It relies on a modular analysis framework that allows us to separate the coordination mechanisms into distinct modules. The governance structure of the power network completes this analysis framework. In a rationale of institutional complementarity, this governance structure impacts the way the TSOs effectively implement the power flow management. The proactive behaviour of the TSO for the coordination of generation and transmission can be explained in two ways. Firstly, the network investment can be the only effective process of long term coordination between generation and transmission. Secondly, when forecasting network investment, the TSO can prepare the accommodation of the fast-built generation units and detect the potential failures of locational incentive signals. (author)
Directory of Open Access Journals (Sweden)
Michael Segal
2004-11-01
Full Text Available Abstract: Ad-hoc networks of sensor nodes are in general semi-permanently deployed. However, the topology of such networks continuously changes over time, due to the power of some sensors wearing out to new sensors being inserted into the network, or even due to designers moving sensors around during a network re-design phase (for example, in response to a change in the requirements of the network. In this paper, we address the problem of covering a given path by a limited number of sensors Ã¢Â€Â” in our case to two, and show its relation to the well-studied matrix multiplication problem.
Collaborative learning in networks.
Mason, Winter; Watts, Duncan J
2012-01-17
Complex problems in science, business, and engineering typically require some tradeoff between exploitation of known solutions and exploration for novel ones, where, in many cases, information about known solutions can also disseminate among individual problem solvers through formal or informal networks. Prior research on complex problem solving by collectives has found the counterintuitive result that inefficient networks, meaning networks that disseminate information relatively slowly, can perform better than efficient networks for problems that require extended exploration. In this paper, we report on a series of 256 Web-based experiments in which groups of 16 individuals collectively solved a complex problem and shared information through different communication networks. As expected, we found that collective exploration improved average success over independent exploration because good solutions could diffuse through the network. In contrast to prior work, however, we found that efficient networks outperformed inefficient networks, even in a problem space with qualitative properties thought to favor inefficient networks. We explain this result in terms of individual-level explore-exploit decisions, which we find were influenced by the network structure as well as by strategic considerations and the relative payoff between maxima. We conclude by discussing implications for real-world problem solving and possible extensions.
Energy Technology Data Exchange (ETDEWEB)
Paula, Wesley R. de [Universidade Federal de Campina Grande (UFCG), PB (Brazil). Curso de Pos-Graduacao em Informatica; Sousa, Andre G. de [Universidade Federal de Campina Grande (UFCG), PB (Brazil). Curso de Ciencia da Computacao; Gomes, Herman M.; Galvao, Carlos de O. [Universidade Federal de Campina Grande (UFCG), PB (Brazil)
2004-07-01
The objective of this paper is to present an initial study on the application of an Elman Neural Network to the problem of predicting the throughput of a petroleum collecting station. This study is part of a wider project, which aims at producing an automatic real-time system to remotely control a petroleum distribution pipeline, in such a way that optimum efficiency can be assured in terms of: (I) maximizing the volume of oil transported; and (II) minimizing energy consumption, risks of failures and damages to the environment. Experiments were carried out to determine the neural network parameters and to examine its performance under varying prediction times in the future. Promising results (with low MSE) have been obtained for predictions obtained up to 10 minutes in the future. (author)
DEFF Research Database (Denmark)
Almegaard, Henrik
2014-01-01
The majority of literature on engineering design methods is focused on the processes of fulfilling the design goals as efficiently as possible. This paper will focus on - and discuss - the processes of determining the design goals: the specifications. The purpose is to draw attention to the inher...... to the inherent problems, dilemmas and possibilities in these processes bearing in mind that that the most important decisions in a design project are taken in the beginning of the project....
... it could be a sign of a balance problem. Balance problems can make you feel unsteady. You may also ... injuries, such as a hip fracture. Some balance problems are due to problems in the inner ear. ...
Analog Processor To Solve Optimization Problems
Duong, Tuan A.; Eberhardt, Silvio P.; Thakoor, Anil P.
1993-01-01
Proposed analog processor solves "traveling-salesman" problem, considered paradigm of global-optimization problems involving routing or allocation of resources. Includes electronic neural network and auxiliary circuitry based partly on concepts described in "Neural-Network Processor Would Allocate Resources" (NPO-17781) and "Neural Network Solves 'Traveling-Salesman' Problem" (NPO-17807). Processor based on highly parallel computing solves problem in significantly less time.
Energy Technology Data Exchange (ETDEWEB)
Duran, Ana Cecilia
1990-03-01
This thesis aims to find a better way to solve large scale nonlinear sparse system problems giving special emphasis to load flow in electric power networks. The suggested algorithms are presented 63 refs., 28 figs., 16 tabs.
Directory of Open Access Journals (Sweden)
S. I. Balandin
2012-01-01
Full Text Available The paper describes implementation of dataflow networks based on Smart-M3 platform for use cases related to the Internet of Things. The mechanism for automatic substitution of computational agents created on top of Smart-M3 platform is described. The paper reviews concurrency issues of the developed solution regarding Smart-M3 platform, as well as in the broader context of the Internet of Things.
NASA's unique networking environment
Johnson, Marjory J.
1988-01-01
Networking is an infrastructure technology; it is a tool for NASA to support its space and aeronautics missions. Some of NASA's networking problems are shared by the commercial and/or military communities, and can be solved by working with these communities. However, some of NASA's networking problems are unique and will not be addressed by these other communities. Individual characteristics of NASA's space-mission networking enviroment are examined, the combination of all these characteristics that distinguish NASA's networking systems from either commercial or military systems is explained, and some research areas that are important for NASA to pursue are outlined.
Hwang, FK; Winter, P
1992-01-01
The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning networks have been well-studied when all connections are required to be between the given points. The novelty of the Steiner tree problem is that new auxiliary points can be introduced between the original points so that a spanning network of all the points will be shorter than otherwise possible. These new points are called Steiner points - locating them has proved problematic and research has diverged along many different avenues. This volume is devoted to the assimilation of the rich field of intriguing analyses and the consolidation of the fragments. A section has been given to each of the three major areas of interest which have emerged. The first concerns the Euclidean Steiner Problem, historically the original Steiner tree problem proposed by Jarník and Kössler in 1934. The second deals with the Steiner Problem in Networks, which was propounded independently by Hakimi and Levin and has enjoyed the most...
Known TCP Implementation Problems
Paxson, Vern (Editor); Allman, Mark; Dawson, Scott; Fenner, William; Griner, Jim; Heavens, Ian; Lahey, K.; Semke, J.; Volz, B.
1999-01-01
This memo catalogs a number of known TCP implementation problems. The goal in doing so is to improve conditions in the existing Internet by enhancing the quality of current TCP/IP implementations. It is hoped that both performance and correctness issues can be resolved by making implementors aware of the problems and their solutions. In the long term, it is hoped that this will provide a reduction in unnecessary traffic on the network, the rate of connection failures due to protocol errors, and load on network servers due to time spent processing both unsuccessful connections and retransmitted data. This will help to ensure the stability of the global Internet. Each problem is defined as follows: Name of Problem The name associated with the problem. In this memo, the name is given as a subsection heading. Classification one or more problem categories for which the problem is classified: "congestion control", "performance", "reliability", "resource management". Description A definition of the problem, succinct but including necessary background material. Significance A brief summary of the sorts of environments for which the problem is significant.
Designing and managing networks: possibilities and limitations for network management
2005-01-01
markdownabstract__Abstract__ If most decision-making processes aimed at solving societal problems have a network-like character, then a key question is how to deal with networks so that they can achieve valuable solutions to societal problems. Managing networks differs considerably from the
... Nausea and Vomiting in Infants and Children Neck Pain Neck Swelling Shortness of Breath Shortness of Breath in Infants and Children Shoulder Problems Skin Rashes & Other Skin Problems Throat Problems Tooth Problems Urination Problems Back to Symptoms Step 2 Answering Questions Did you begin to ...
... Nausea and Vomiting in Infants and Children Neck Pain Neck Swelling Shortness of Breath Shortness of Breath in Infants and Children Shoulder Problems Skin Rashes & Other Skin Problems Throat Problems Tooth Problems Urination Problems Back to Symptoms Step 2 Answering Questions Do you have pain ...
... Nausea and Vomiting in Infants and Children Neck Pain Neck Swelling Shortness of Breath Shortness of Breath in Infants and Children Shoulder Problems Skin Rashes & Other Skin Problems Throat Problems Tooth Problems Urination Problems Back to Symptoms Step 2 Answering Questions Did your knee pain ...
Leadership Networking Connect, Collaborate, Create
(CCL), Center for Creative Leadership; Baldwin, David
2011-01-01
Networking is essential to effective leadership in today's organizations. Leaders who are skilled networkers have access to people, information, and resources to help solve problems and create opportunities. Leaders who neglect their networks are missing out on a critical component of their role as leaders. This book will help leaders take a new view of networking and provide insight into how to enhance their networks and become effective at leadership networking.
Energy Technology Data Exchange (ETDEWEB)
Chapline, G.
1998-03-01
The engineering problems of constructing autonomous networks of sensors and data processors that can provide alerts for dangerous situations provide a new context for debating the question whether man-made systems can emulate the cognitive capabilities of the mammalian brain. In this paper we consider the question whether a distributed network of sensors and data processors can form ``perceptions`` based on sensory data. Because sensory data can have exponentially many explanations, the use of a central data processor to analyze the outputs from a large ensemble of sensors will in general introduce unacceptable latencies for responding to dangerous situations. A better idea is to use a distributed ``Helmholtz machine`` architecture in which the sensors are connected to a network of simple processors, and the collective state of the network as a whole provides an explanation for the sensory data. In general communication within such a network will require time division multiplexing, which opens the door to the possibility that with certain refinements to the Helmholtz machine architecture it may be possible to build sensor networks that exhibit a form of artificial consciousness.
... Plan Hot Topics Flu Facts Arrhythmias Abuse Speech Problems KidsHealth > For Teens > Speech Problems Print A A ... form speech sounds into words. What Causes Speech Problems? Normal speech might seem effortless, but it's actually ...
Bahrami, Saeed; Doulati Ardejani, Faramarz; Baafi, Ernest
2016-05-01
In this study, hybrid models are designed to predict groundwater inflow to an advancing open pit mine and the hydraulic head (HH) in observation wells at different distances from the centre of the pit during its advance. Hybrid methods coupling artificial neural network (ANN) with genetic algorithm (GA) methods (ANN-GA), and simulated annealing (SA) methods (ANN-SA), were utilised. Ratios of depth of pit penetration in aquifer to aquifer thickness, pit bottom radius to its top radius, inverse of pit advance time and the HH in the observation wells to the distance of observation wells from the centre of the pit were used as inputs to the networks. To achieve the objective two hybrid models consisting of ANN-GA and ANN-SA with 4-5-3-1 arrangement were designed. In addition, by switching the last argument of the input layer with the argument of the output layer of two earlier models, two new models were developed to predict the HH in the observation wells for the period of the mining process. The accuracy and reliability of models are verified by field data, results of a numerical finite element model using SEEP/W, outputs of simple ANNs and some well-known analytical solutions. Predicted results obtained by the hybrid methods are closer to the field data compared to the outputs of analytical and simple ANN models. Results show that despite the use of fewer and simpler parameters by the hybrid models, the ANN-GA and to some extent the ANN-SA have the ability to compete with the numerical models.
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.
Kelly, F. P.
1991-01-01
This paper describes work on the stochastic modelling of loss networks. Such systems have long been of interest to telephone engineers and are becoming increasingly important as models of computer and information systems. Throughout the century problems from this field have provided an impetus to the development of probability theory, pure and applied. This paper provides an introduction to the area and a review of recent work.
Deconvolution using a neural network
Energy Technology Data Exchange (ETDEWEB)
Lehman, S.K.
1990-11-15
Viewing one dimensional deconvolution as a matrix inversion problem, we compare a neural network backpropagation matrix inverse with LMS, and pseudo-inverse. This is a largely an exercise in understanding how our neural network code works. 1 ref.
Strategic Offensive Airpower: The Role of the Long Range Bomber.
1988-04-01
be a colossal problem to move sucn a large force up to the battle area. Air attacks. coulo cause enormous chaos" (29:29). NATO should generate intense...Interdiction of a Transportation Network. Research study prepared at the Naval Post Graduate School, Providence, Rhode Island, 1967. 28. O’Berry, Carl G., Col
DEFF Research Database (Denmark)
Tietjen, Anne; Jørgensen, Gertrud
2016-01-01
In a time of increasing globalisation and urbanisation, shrinking peripheral rural areas have become a truly wicked planning problem in many European countries. Although a problem can be easily perceived and measured by various indicators, the precise definition of the problem is problematic. Based...... on the case of a Danish planning process which was carried out in collaboration with a charitable trust, this paper discusses an emerging strategic planning approach at the municipal level. We use the concept of wicked problems, strategic planning theory and Actor-Network-Theory to study a collaborative...... projects played a major role in this process. First, they acted as a vehicle that assembled planners, politicians and stakeholders to work towards strategic visions across multiple scales. Second and consequently, they stimulated considerable second and third order effects in the form of shared problem...
Explaining the Mind: Problems, Problems
Harnad, Stevan
2001-01-01
The mind/body problem is the feeling/function problem: How and why do feeling systems feel? The problem is not just "hard" but insoluble (unless one is ready to resort to telekinetic dualism). Fortunately, the "easy" problems of cognitive science (such as the how and why of categorization and language) are not insoluble. Five books (by Damasio, Edelman/Tononi...
Stoer, Mechthild
1992-01-01
The problem of designing a cost-efficient network that survives the failure of one or more nodes or edges of the network is critical to modern telecommunications engineering. The method developed in this book is designed to solve such problems to optimality. In particular, a cutting plane approach is described, based on polyhedral combinatorics, that is ableto solve real-world problems of this type in short computation time. These results are of interest for practitioners in the area of communication network design. The book is addressed especially to the combinatorial optimization community, but also to those who want to learn polyhedral methods. In addition, interesting new research problemsare formulated.
Mechler, G. E.
2002-05-01
Some television networks have displayed a propensity for producing specials of a pseudoscientific nature. The Fox Network has especially demonstrated this propensity. Its most notorious cases were ``Alien Autopsy" in the mid-90s and last Winter's ``Conspiracy Theory: Did we land on the moon?" Both have had effective critical responses from scientists and those responses are readily accessible on the Internet. But their existence is emblematic of the larger societal problem of large numbers of citizens not being able to discriminate between science and pseudoscience. Many educators hesitate to include critical examinations of pseudosciences because 1) They themselves are not well versed in these areas, and 2) they prefer to avoid possible controversy and upset with their credulous students. Fox Network's ``Conspiracy Theory: Did we land on the moon?" offers educators a rich example of televised pseudoscience that 1) can be rebutted in ways readily understandable by nonscience students and 2) will not result in throngs of offended students as this is not a particularly popular pseudoscience and few students will have an emotional investment in it. This oral presentation will cover the benefits of using this particular television program to demonstrate scientific critical examination of claims, raise their general level of informed skepticism, and make clear how susceptible people --they, themselves-- can be to pseudoscientific claims when one is not familiar with the relevant science. A computer-slide presentation of this critique is available to those interested. In addition, informal surveys were taken of two lab classes in which the program and critique were shown. Students' opinions of the moon-landings-were-a-hoax claim were taken before and after seeing the program and after the critique.
Carey, Iain M; Cook, Derek G; De Wilde, Stephen; Bremner, Stephen A; Richards, Nicky; Caine, Steve; Strachan, David P; Hilton, Sean R
2003-09-30
The General Practice Research Database (GPRD) and Doctor's Independent Network Database (DIN), are large electronic primary care databases compiled in the UK during the 1990s. They provide a valuable resource for epidemiological and health services research. GPRD (based on VAMP) presents notes as a series of discrete episodes, whereas DIN is based on a system (MEDITEL) that used a Problem Orientated Medical Record (POMR) which links prescriptions to diagnostic problems. We have examined the implications for research of these different underlying philosophies. Records of 40,183 children from 141 practices in DIN and 76,310 from 464 practices in GRPD who were followed to age 5 were used to compare the volume of recording of prescribing and diagnostic codes in the two databases. To assess the importance and additional value of the POMR within DIN, the appropriateness of diagnostic linking to skin emollient prescriptions was investigated. Variation between practices for both the number of days on which prescriptions were issued and diagnoses were recorded was marked in both databases. Mean number of "prescription days" during the first 5 years of life was similar in DIN (19.5) and in GPRD (19.8), but the average number of "diagnostic days" was lower in DIN (15.8) than in GPRD (22.9). Adjustment for linkage increased the average "diagnostic days" to 23.1 in DIN. 32.7% of emollient prescriptions in GPRD appeared with an eczema diagnosis on the same day compared to only 19.4% in DIN; however, 86.4% of prescriptions in DIN were linked to an earlier eczema diagnosis. More specifically 83% of emollient prescriptions appeared under a problem heading of eczema in the 121 practices that were using problem headings satisfactorily. Prescribing records in DIN and GPRD are very similar, but the usage of diagnostic codes is more parsimonious in DIN because of its POMR structure. Period prevalence rates will be underestimated in DIN unless this structure is taken into account. The
Directory of Open Access Journals (Sweden)
Caine Steve
2003-09-01
Full Text Available Abstract Background The General Practice Research Database (GPRD and Doctor's Independent Network Database (DIN, are large electronic primary care databases compiled in the UK during the 1990s. They provide a valuable resource for epidemiological and health services research. GPRD (based on VAMP presents notes as a series of discrete episodes, whereas DIN is based on a system (MEDITEL that used a Problem Orientated Medical Record (POMR which links prescriptions to diagnostic problems. We have examined the implications for research of these different underlying philosophies. Methods Records of 40,183 children from 141 practices in DIN and 76,310 from 464 practices in GRPD who were followed to age 5 were used to compare the volume of recording of prescribing and diagnostic codes in the two databases. To assess the importance and additional value of the POMR within DIN, the appropriateness of diagnostic linking to skin emollient prescriptions was investigated. Results Variation between practices for both the number of days on which prescriptions were issued and diagnoses were recorded was marked in both databases. Mean number of "prescription days" during the first 5 years of life was similar in DIN (19.5 and in GPRD (19.8, but the average number of "diagnostic days" was lower in DIN (15.8 than in GPRD (22.9. Adjustment for linkage increased the average "diagnostic days" to 23.1 in DIN. 32.7% of emollient prescriptions in GPRD appeared with an eczema diagnosis on the same day compared to only 19.4% in DIN; however, 86.4% of prescriptions in DIN were linked to an earlier eczema diagnosis. More specifically 83% of emollient prescriptions appeared under a problem heading of eczema in the 121 practices that were using problem headings satisfactorily. Conclusion Prescribing records in DIN and GPRD are very similar, but the usage of diagnostic codes is more parsimonious in DIN because of its POMR structure. Period prevalence rates will be underestimated
Directory of Open Access Journals (Sweden)
Dalija Kemeklienė
2011-04-01
Full Text Available Nowadays advertising is of significant importance. Radio and television programmes, newspapers and magazines, various texts, even streets and shops are hardly imaginable without advertising. Advertising forms individuals’ as well as public attitude to many things in life. Besides it influences the person’s behavior and way of thinking. Advertising is inseparable part of the market; it helps create new working places, increases income and discloses positive qualities of manufactured products.However to create the correct, attractive and emotional body of the advert is not easy at all. Every person involved in advertising should be aware of that. In advertising texts vocabulary rules change, loanwords pushed, their standardisation and codification are noticed. In the period of integrating into the European Union, more new technological terms are used in the Lithuanian language. The language is being operated in virtual environment. New varieties of the language are being discovered - advertisement language and -communicative language. The problems of the usage of borrowed words also appear in the language.
Hierarchical Network Design Using Simulated Annealing
DEFF Research Database (Denmark)
Thomadsen, Tommy; Clausen, Jens
2002-01-01
networks are described and a mathematical model is proposed for a two level version of the hierarchical network problem. The problem is to determine which edges should connect nodes, and how demand is routed in the network. The problem is solved heuristically using simulated annealing which as a sub...
... the mother, baby, or both. Possible complications include Preterm (premature) labor, when labor starts before 37 completed weeks of pregnancy Problems with the umbilical cord Problems with the position of the baby, such as breech, in which ...
... e-newsletter! Aging & Health A to Z Foot Problems Basic Facts & Information Foot pain and foot disorders ... keep you active and independent. What are Foot Problems? Decades of standing changes your feet. Much of ...
... enough air. Sometimes you can have mild breathing problems because of a stuffy nose or intense exercise. ... Lung conditions such as asthma, emphysema, or pneumonia Problems with your trachea or bronchi, which are part ...
... your legs or feet Movement disorders such as Parkinson's disease Diseases such as arthritis or multiple sclerosis Vision or balance problems Treatment of walking problems depends on the cause. Physical therapy, surgery, or mobility aids may help.
Computer-communication networks
Meditch, James S
1983-01-01
Computer- Communication Networks presents a collection of articles the focus of which is on the field of modeling, analysis, design, and performance optimization. It discusses the problem of modeling the performance of local area networks under file transfer. It addresses the design of multi-hop, mobile-user radio networks. Some of the topics covered in the book are the distributed packet switching queuing network design, some investigations on communication switching techniques in computer networks and the minimum hop flow assignment and routing subject to an average message delay constraint
Held, Gilbert
2005-01-01
Wireless mesh networking is a new technology that has the potential to revolutionize how we access the Internet and communicate with co-workers and friends. Wireless Mesh Networks examines the concept and explores its advantages over existing technologies. This book explores existing and future applications, and examines how some of the networking protocols operate.The text offers a detailed analysis of the significant problems affecting wireless mesh networking, including network scale issues, security, and radio frequency interference, and suggests actual and potential solutions for each pro
DEFF Research Database (Denmark)
Dickison, Mark; Magnani, Matteo; Rossi, Luca
Multilayer networks, in particular multilayer social networks, where users belong to and interact on different networks at the same time, are an active research area in social network analysis, computer science, and physics. These networks have traditionally been studied within these separate...... social network systems, the evolution of interconnected social networks, and dynamic processes such as information spreading. A single real dataset is used to illustrate the concepts presented throughout the book, demonstrating both the practical utility and the potential shortcomings of the various...... research communities, leading to the development of several independent models and methods to deal with the same set of problems. This book unifies and consolidates existing practical and theoretical knowledge on multilayer networks including data collection and analysis, modeling, and mining of multilayer...
DEFF Research Database (Denmark)
Dickison, Mark; Magnani, Matteo; Rossi, Luca
social network systems, the evolution of interconnected social networks, and dynamic processes such as information spreading. A single real dataset is used to illustrate the concepts presented throughout the book, demonstrating both the practical utility and the potential shortcomings of the various......Multilayer networks, in particular multilayer social networks, where users belong to and interact on different networks at the same time, are an active research area in social network analysis, computer science, and physics. These networks have traditionally been studied within these separate...... research communities, leading to the development of several independent models and methods to deal with the same set of problems. This book unifies and consolidates existing practical and theoretical knowledge on multilayer networks including data collection and analysis, modeling, and mining of multilayer...
Extracting information from multiplex networks.
Iacovacci, Jacopo; Bianconi, Ginestra
2016-06-01
Multiplex networks are generalized network structures that are able to describe networks in which the same set of nodes are connected by links that have different connotations. Multiplex networks are ubiquitous since they describe social, financial, engineering, and biological networks as well. Extending our ability to analyze complex networks to multiplex network structures increases greatly the level of information that is possible to extract from big data. For these reasons, characterizing the centrality of nodes in multiplex networks and finding new ways to solve challenging inference problems defined on multiplex networks are fundamental questions of network science. In this paper, we discuss the relevance of the Multiplex PageRank algorithm for measuring the centrality of nodes in multilayer networks and we characterize the utility of the recently introduced indicator function Θ̃(S) for describing their mesoscale organization and community structure. As working examples for studying these measures, we consider three multiplex network datasets coming for social science.
The networking practices of businesswomen
Marlene Bogaards; Saskia Klerk; Karina Mostert
2011-01-01
Purpose: The primary objective of this study was to investigate the networking practices of businesswomen in the Gauteng Province, South Africa. The study of businesswomen's networking practices can provide critical insight into the manner in which networking can assist businesswomen in personal and professional skills development. Problem investigated: An investigation was conducted into the manner in which the concepts of networking and social networking are perceived by businesswome...
Learning Networks, Networked Learning
Sloep, Peter; Berlanga, Adriana
2010-01-01
Sloep, P. B., & Berlanga, A. J. (2011). Learning Networks, Networked Learning [Redes de Aprendizaje, Aprendizaje en Red]. Comunicar, XIX(37), 55-63. Retrieved from http://dx.doi.org/10.3916/C37-2011-02-05
DEFF Research Database (Denmark)
Brouer, Berit Dangaard
This thesis concerns design of liner shipping networks using operations research to optimize liner shipping networks at the strategic, tactical and operational level. Liner shipping networks are often compared to public transit networks as they consist of a set of scheduled sailings connecting....... The research field of liner shipping network design is relatively young and many open research questions exists. Among others, a unified and rich mathematical model formulating the main characteristics of the business domain has not been clearly described and exact methods for such mathematical models...... are still not able to solve significant instances of this complex optimization problem. In this thesis two research directions are explored within the field: The first research direction contributes to basic research on the liner shipping network design problem by describing the domain seen from...
Câmara, Daniel
2015-01-01
Bio-inspired techniques are based on principles, or models, of biological systems. In general, natural systems present remarkable capabilities of resilience and adaptability. In this book, we explore how bio-inspired methods can solve different problems linked to computer networks. Future networks are expected to be autonomous, scalable and adaptive. During millions of years of evolution, nature has developed a number of different systems that present these and other characteristics required for the next generation networks. Indeed, a series of bio-inspired methods have been successfully used to solve the most diverse problems linked to computer networks. This book presents some of these techniques from a theoretical and practical point of view. Discusses the key concepts of bio-inspired networking to aid you in finding efficient networking solutions Delivers examples of techniques both in theoretical concepts and practical applications Helps you apply nature's dynamic resource and task management to your co...
Handbook of networking & connectivity
McClain, Gary R
1994-01-01
Handbook of Networking & Connectivity focuses on connectivity standards in use, including hardware and software options. The book serves as a guide for solving specific problems that arise in designing and maintaining organizational networks.The selection first tackles open systems interconnection, guide to digital communications, and implementing TCP/IP in an SNA environment. Discussions focus on elimination of the SNA backbone, routing SNA over internets, connectionless versus connection-oriented networks, internet concepts, application program interfaces, basic principles of layering, proto
Affinity driven social networks
Ruyú, B.; Kuperman, M. N.
2007-04-01
In this work we present a model for evolving networks, where the driven force is related to the social affinity between individuals of a population. In the model, a set of individuals initially arranged on a regular ordered network and thus linked with their closest neighbors are allowed to rearrange their connections according to a dynamics closely related to that of the stable marriage problem. We show that the behavior of some topological properties of the resulting networks follows a non trivial pattern.
Iedema, Rick; Verma, Raj; Wutzke, Sonia; Lyons, Nigel; McCaughan, Brian
2017-04-10
Purpose To further our insight into the role of networks in health system reform, the purpose of this paper is to investigate how one agency, the NSW Agency for Clinical Innovation (ACI), and the multiple networks and enabling resources that it encompasses, govern, manage and extend the potential of networks for healthcare practice improvement. Design/methodology/approach This is a case study investigation which took place over ten months through the first author's participation in network activities and discussions with the agency's staff about their main objectives, challenges and achievements, and with selected services around the state of New South Wales to understand the agency's implementation and large system transformation activities. Findings The paper demonstrates that ACI accommodates multiple networks whose oversight structures, self-organisation and systems change approaches combined in dynamic ways, effectively yield a diversity of network governances. Further, ACI bears out a paradox of "centralised decentralisation", co-locating agents of innovation with networks of implementation and evaluation expertise. This arrangement strengthens and legitimates the role of the strategic hybrid - the healthcare professional in pursuit of change and improvement, and enhances their influence and impact on the wider system. Research limitations/implications While focussing the case study on one agency only, this study is unique as it highlights inter-network connections. Contributing to the literature on network governance, this paper identifies ACI as a "network of networks" through which resources, expectations and stakeholder dynamics are dynamically and flexibly mediated and enhanced. Practical implications The co-location of and dynamic interaction among clinical networks may create synergies among networks, nurture "strategic hybrids", and enhance the impact of network activities on health system reform. Social implications Network governance requires more
Reliable Communication in Wireless Meshed Networks using Network Coding
DEFF Research Database (Denmark)
Pahlevani, Peyman; Paramanathan, Achuthan; Hundebøll, Martin
2012-01-01
The advantages of network coding have been extensively studied in the field of wireless networks. Integrating network coding with existing IEEE 802.11 MAC layer is a challenging problem. The IEEE 802.11 MAC does not provide any reliability mechanisms for overheard packets. This paper addresses th...... introduce some signaling overhead, the results show that the performance is yet improved....
ATM Tactical Network - a challenge for the military networks
Waveren, C.J. van; Luiijf, H.A.M.; Burakowski, W.; Kopertowski, Z.
1997-01-01
The next generation of tactical networks will be based on the ATM technology. The POST-2000 tactical network is just in the designing phase. The objective of this paper is to point out the main problems which should be solved to adopt ATM technology into the tactical network environment. The
The African Field Epidemiology Network - Networking for effective ...
African Journals Online (AJOL)
Networks are a catalyst for promoting common goals and objectives of their membership. Public Health networks in Africa are crucial, because of the severe resource limitations that nations face in dealing with priority public health problems. For a long time, networks have existed on the continent and globally, but many of ...
Skovhus, Randi Boelskifte; Thomsen, Rie
2017-01-01
This article introduces a method to critical reviews and explores the ways in which problems have been formulated in knowledge production on career guidance in Denmark over a 10-year period from 2004 to 2014. The method draws upon the work of Bacchi focussing on the "What's the problem represented to be" (WPR) approach. Forty-nine…
... Read MoreDepression in Children and TeensRead MoreBMI Calculator Hearing ProblemsLoss in the ability to hear or discriminate ... This flow chart will help direct you if hearing loss is a problem for you or a ...
2014-11-09
multicommodity flow network interdiction problems. IIE Transactions 39(1) 15–26. Mukherjee, B., B. Banerjee, S. Ramamurthy, A. Mukherjee. 1996. Some principles for...designing a wide-area WDM optical network. IEEE/ACM Transactions on Networking 4(5) 684–706. Salmerón, J., K. Wood, R. Baldick. 2004. Analysis of...electric grid security under terrorist threat. IEEE Transactions on Power Systems 19 905–912. Wood, A. J., B. F. Wollenberg. 1996. Power generation
Neural networks and particle physics
Peterson, Carsten
1993-01-01
1. Introduction : Structure of the Central Nervous System Generics2. Feed-forward networks, Perceptions, Function approximators3. Self-organisation, Feature Maps4. Feed-back Networks, The Hopfield model, Optimization problems, Feed-back, Networks, Deformable templates, Graph bisection
Organizational Culture and Network Embeddedness
Noorderhaven, N.G.; Koen, C.I.; Beugelsdijk, S.
2002-01-01
A question that has been neglected in network research is where differences in network embeddedness come from.The network literature reveals that there are three key characteristics of embedded relationships: trust, open communication, and joint problem solving.On the basis of the sparse empirical
Breaking Free with Wireless Networks.
Fleischman, John
2002-01-01
Discusses wireless local area networks (LANs) which typically consist of laptop computers that connect to fixed access points via infrared or radio signals. Topics include wide area networks; personal area networks; problems, including limitations of available bandwidth, interference, and security concerns; use in education; interoperability;…
Combinatorial optimization networks and matroids
Lawler, Eugene
2011-01-01
Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics.
The Serializability of Network Codes
Blasiak, Anna
2010-01-01
Network coding theory studies the transmission of information in networks whose vertices may perform nontrivial encoding and decoding operations on data as it passes through the network. The main approach to deciding the feasibility of network coding problems aims to reduce the problem to optimization over a polytope of entropic vectors subject to constraints imposed by the network structure. In the case of directed acyclic graphs, these constraints are completely understood, but for general graphs the problem of enumerating them remains open: it is not known how to classify the constraints implied by a property that we call serializability, which refers to the absence of paradoxical circular dependencies in a network code. In this work we initiate the first systematic study of the constraints imposed on a network code by serializability. We find that serializability cannot be detected solely by evaluating the Shannon entropy of edge sets in the graph, but nevertheless, we give a polynomial-time algorithm tha...
Scalable Virtual Network Mapping Algorithm for Internet-Scale Networks
Yang, Qiang; Wu, Chunming; Zhang, Min
The proper allocation of network resources from a common physical substrate to a set of virtual networks (VNs) is one of the key technical challenges of network virtualization. While a variety of state-of-the-art algorithms have been proposed in an attempt to address this issue from different facets, the challenge still remains in the context of large-scale networks as the existing solutions mainly perform in a centralized manner which requires maintaining the overall and up-to-date information of the underlying substrate network. This implies the restricted scalability and computational efficiency when the network scale becomes large. This paper tackles the virtual network mapping problem and proposes a novel hierarchical algorithm in conjunction with a substrate network decomposition approach. By appropriately transforming the underlying substrate network into a collection of sub-networks, the hierarchical virtual network mapping algorithm can be carried out through a global virtual network mapping algorithm (GVNMA) and a local virtual network mapping algorithm (LVNMA) operated in the network central server and within individual sub-networks respectively with their cooperation and coordination as necessary. The proposed algorithm is assessed against the centralized approaches through a set of numerical simulation experiments for a range of network scenarios. The results show that the proposed hierarchical approach can be about 5-20 times faster for VN mapping tasks than conventional centralized approaches with acceptable communication overhead between GVNCA and LVNCA for all examined networks, whilst performs almost as well as the centralized solutions.
Drawing rooted phylogenetic networks.
Huson, Daniel H
2009-01-01
The evolutionary history of a collection of species is usually represented by a phylogenetic tree. Sometimes, phylogenetic networks are used as a means of representing reticulate evolution or of showing uncertainty and incompatibilities in evolutionary datasets. This is often done using unrooted phylogenetic networks such as split networks, due in part, to the availability of software (SplitsTree) for their computation and visualization. In this paper we discuss the problem of drawing rooted phylogenetic networks as cladograms or phylograms in a number of different views that are commonly used for rooted trees. Implementations of the algorithms are available in new releases of the Dendroscope and SplitsTree programs.
Transportation network reduction
Directory of Open Access Journals (Sweden)
Stanislav PALÚCH
2015-06-01
Full Text Available Network reduction problem is formulated as follows: We are given a transportation network T, a set of important origin – destination relations R and a number q greater than 1. The goal is to find a subnetwork S of the given network T such that all shortest paths between all origin – destination pairs from R using only subnetwork S are not longer than q-multiple of the corresponding distance in original network T. A mathematical model and an exact algorithm of just mentioned task is presented.
Parekh, Abhay
2014-01-01
Resource Allocation lies at the heart of network control. In the early days of the Internet the scarcest resource was bandwidth, but as the network has evolved to become an essential utility in the lives of billions, the nature of the resource allocation problem has changed. This book attempts to describe the facets of resource allocation that are most relevant to modern networks. It is targeted at graduate students and researchers who have an introductory background in networking and who desire to internalize core concepts before designing new protocols and applications. We start from the fun
Adaptive autonomous Communications Routing Optimizer for Network Efficiency Management Project
National Aeronautics and Space Administration — Maximizing network efficiency for NASA's Space Networking resources is a large, complex, distributed problem, requiring substantial collaboration. We propose the...
The Military Theater Distribution Network Design Problem
2015-03-26
64 Appendix B. VBA Code . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72 Appendix C. Story Board...application that allows calculation, graphing, and a macro programming language called Visual Basic for Applications ( VBA ). CPLEX is a commercial...in- stance, and we use the embedded VBA capability to represent our MILP for the instance. Also using VBA , we invoke the commercial solver CPLEX to
Parallel Decompositions for Network-Structured Problems
1994-04-10
sabbtical. With my greatest appreciation fnr your support during this project. Smrnerely ynrrR, Stavroo A. Zenioa cc: Offiep of Research Administration ...Matematica Pura e Aplicada . Diazil. 1993, (280 pages), ISBN 85-244- 0074-9. [21 I. Krwss, M. Pinr, T. Thompson, and S.A. Zcnio3. A large scale modcl for naval
Algorithms for Scheduling and Network Problems
1991-09-01
Baruch Awerbuch while at MIT, and I thank him for serving on my thesis committee as well. My fellow students Cliff Stein and David Williamson have both...least one processor per operation, this can be done in NC using the edge-coloring algorithm of Lev , Pippinger, and Valiant [84]. We can extend this to...scheduling unrelated parallel machines. Mathematical Programming, 46:259-271, 1990. [84] G. F. Lev , N. Pippenger, and L. G. Valiant. A fast parallel
Network Coding for Wireless Cooperative Networks
DEFF Research Database (Denmark)
Khamfroush, Hana; Roetter, Daniel Enrique Lucani; Barros, João
2014-01-01
We consider the problem of finding an optimal packet transmission policy that minimizes the total cost of transmitting M data packets from a source S to two receivers R1,R2 over half-duplex, erasure channels. The source can either broadcast random linear network coding (RLNC) packets to the recei......We consider the problem of finding an optimal packet transmission policy that minimizes the total cost of transmitting M data packets from a source S to two receivers R1,R2 over half-duplex, erasure channels. The source can either broadcast random linear network coding (RLNC) packets...
Beyond Space For Spatial Networks
Expert, Paul; Blondel, Vincent D; Lambiotte, Renaud
2010-01-01
Many complex systems are organized in the form of a network embedded in space. Important examples include the physical Internet infrastucture, road networks, flight connections, brain functional networks and social networks. The effect of space on network topology has recently come under the spotlight because of the emergence of pervasive technologies based on geo-localization, which constantly fill databases with people's movements and thus reveal their trajectories and spatial behaviour. Extracting patterns and regularities from the resulting massive amount of human mobility data requires the development of appropriate tools for uncovering information in spatially-embedded networks. In contrast with most works that tend to apply standard network metrics to any type of network, we argue in this paper for a careful treatment of the constraints imposed by space on network topology. In particular, we focus on the problem of community detection and propose a modularity function adapted to spatial networks. We sh...
... High Blood Pressure Nutrition Join our e-newsletter! Aging & Health A to Z Kidney Problems Basic Facts & ... build-up of waste products, and other serious consequences in later years. Doses of medications must also ...
DEFF Research Database (Denmark)
Skovhus, Randi Boelskifte; Thomsen, Rie
2017-01-01
This article introduces a method to critical reviews and explores the ways in which problems have been formulated in knowledge production on career guidance in Denmark over a 10-year period from 2004 to 2014. The method draws upon the work of Bacchi focussing on the ‘What's the problem represented...... to be’ (WPR) approach. Forty-nine empirical studies on Danish youth career guidance were included in the study. An analysis of the issues in focus resulted in nine problem categories. One of these, ‘targeting’, is analysed using the WPR approach. Finally, the article concludes that the WPR approach...... provides a constructive basis for a critical analysis and discussion of the collective empirical knowledge production on career guidance, stimulating awareness of problems and potential solutions among the career guidance community....
Kinsbourne, Marcel
1973-01-01
Intended for pediatricians, the article considers aspects of diagnosis and treatment of learning problems including definitions and documentation, the examination, developmental lag, intelligence and psychometry, reversals, serial ordering, cognitive processes in reading, and hyperactivity. (DB)
Kellerer, Hans; Pisinger, David
2004-01-01
Thirteen years have passed since the seminal book on knapsack problems by Martello and Toth appeared. On this occasion a former colleague exclaimed back in 1990: "How can you write 250 pages on the knapsack problem?" Indeed, the definition of the knapsack problem is easily understood even by a non-expert who will not suspect the presence of challenging research topics in this area at the first glance. However, in the last decade a large number of research publications contributed new results for the knapsack problem in all areas of interest such as exact algorithms, heuristics and approximation schemes. Moreover, the extension of the knapsack problem to higher dimensions both in the number of constraints and in the num ber of knapsacks, as well as the modification of the problem structure concerning the available item set and the objective function, leads to a number of interesting variations of practical relevance which were the subject of intensive research during the last few years. Hence, two years ago ...
Emergent complex network geometry.
Wu, Zhihao; Menichetti, Giulia; Rahmede, Christoph; Bianconi, Ginestra
2015-05-18
Networks are mathematical structures that are universally used to describe a large variety of complex systems such as the brain or the Internet. Characterizing the geometrical properties of these networks has become increasingly relevant for routing problems, inference and data mining. In real growing networks, topological, structural and geometrical properties emerge spontaneously from their dynamical rules. Nevertheless we still miss a model in which networks develop an emergent complex geometry. Here we show that a single two parameter network model, the growing geometrical network, can generate complex network geometries with non-trivial distribution of curvatures, combining exponential growth and small-world properties with finite spectral dimensionality. In one limit, the non-equilibrium dynamical rules of these networks can generate scale-free networks with clustering and communities, in another limit planar random geometries with non-trivial modularity. Finally we find that these properties of the geometrical growing networks are present in a large set of real networks describing biological, social and technological systems.
Porter, Mason A.; Onnela, Jukka-Pekka; Mucha, Peter J
2009-01-01
We survey some of the concepts, methods, and applications of community detection, which has become an increasingly important area of network science. To help ease newcomers into the field, we provide a guide to available methodology and open problems, and discuss why scientists from diverse backgrounds are interested in these problems. As a running theme, we emphasize the connections of community detection to problems in statistical physics and computational optimization.
Directory of Open Access Journals (Sweden)
Patrick Pognant
2009-09-01
Full Text Available Hors la sexualité à but procréatif, tout comportement sexuel a été considéré par les médecins comme pathologie et par les moralistes comme des crimes contre la morale. Bien que la masturbation et l’homosexualité ne fussent pas considérés comme un délit et un crime par le Code pénal français, elles furent cependant envisagées comme des interdits moraux et, notamment entre 1850 et 1930, elles furent réprimées par tous les acteurs de la société (clercs, liqueurs, religieux, policiers, juges, enseignants, parents… et par le corps médical (au premier rang desquels les psychiatres. Ce phénomène répressif a touché tous les pays occidentaux, y compris les Etats-Unis, à des degrés divers (le Code pénal allemand, par exemple, était beaucoup plus répressif que le Code pénal français sur ce sujet.De nombreux psychiatres se sont mués en auxiliaires de justice en favorisant la comparution d’homosexuels et de masturbateurs devant les tribunaux. La psychiatrie occidentale de cette époque se caractérise sur le plan de la sexualité comme une psychiatrie de l’erreur qui va muer en une psychiatrie de l’horreur en mettant au point un arsenal monstrueux à la fois technologique (corsets, camisoles et cages de contention… et thérapeutique (infibulation, cautérisation, circoncision à vif, castration…. Nos sociétés contemporaines portent encore les stigmates de cette période noire durant laquelle médecine et justice ont agi de concert pour médicaliser et punir les comportements sexuels s’écartant de la norme.Apart from sexuality with a procreative aim, sexual behaviour as such was considered, by physicians, as pathological and, by the moralists, as crimes against morality. Although masturbation and homosexuality were not regarded as a criminal offence or even as a crime by the French criminal code, however they were considered as the object of a moral interdiction and, particularly between 1850 and 1930
Interdicting a Nuclear-Weapons Project
2009-08-01
every fowl of tyrant wing. Shakespeare, The Phoenix and the Turtle 1. Introduction Sixty years after the United States detonated the first nuclear...be more difficult (e.g., EPA 2007). Highly enriched uranium (HEU) can be used in a gun-type or implosion -type fission weapon, but it can also fuel...thereby maximizes the project’s over- all completion time; simultaneously , it also represents the proliferator’s desire to minimize that time by choosing
Maritime Interdiction Operations in Logistically Barren Environments
2008-06-01
Resolution Imaging) from Sago Systems. Figure 22: ST15034 The ST150 passive millimeter-wave imager is a stand-off unit designed for outdoor...34 Sago Systems, “ST150,” http://www.sagosystems.com/Pages%20Folder/Products/products.html, 17 April...the search. 35 Sago Systems, “ST150,” http://www.sagosystems.com/Pages%20Folder/Products/products.html, 17
Behavioral Indicators During a Police Interdiction
2015-05-01
park during a music festival, 2 males were observed acting suspiciously. The festival contains one large stage with open seating in front surrounded by...and appear to be focusing on the crowd, not on the music stage or venders. Whenever the subjects observe a police officer walking through the crowd...group) will puff out their chest and begin to strut. Also involves clenching of the fist(s), popping out of the vein on the forehead. Could also be
Foreign Fighter Interdiction: Stability Operations as Countermeasures
2011-04-01
recently transferred hostages from Niger to Mali and now out of Mali while attempting to influence France. “The seven hostages - five French...nationals, a Togolese and a Mada- gascan - were seized from Niger’s uranium mining town of Arlit in September and later taken across the border into Mali...Department 2011) The U.S. stopped all non-humanitarian projects in Niger due to non- democratic actions in 2009. (U.S. State Department 2010) Somalia
Energy Technology Data Exchange (ETDEWEB)
NONE
2001-03-01
For the purpose of developing and popularizing environment conservation technologies in the Asia/Pacific region, activities were conducted for Environmental Technology Research Network in the Asia/Pacific Area (ETERNET-APR). In this fiscal year, under the motto of Expansion of International Collaborative Researches on Environmental Technology, a 7th international workshop was held in Yokkaichi City, Mie Prefecture, with the attendance of approximately 60 people in Japan and from abroad. Researchers from overseas, in addition, attended a 10-day training program at the National Institute for Resources and Development and others in preparation for the embodiment of international collaborative research. A survey was conducted overseas for the promotion of database utilization and registration and for grasping the problems intrinsic to the respective research institutes and problems to occur at every stage of development. People's Republic of China was visited, where a miniscale workshop was held, study tours were made, and opinions were exchanged. It was actually felt, at the places that were visited, that ETERNET-APR was certainly in function in various fields. (NEDO)
Energy Technology Data Exchange (ETDEWEB)
NONE
2000-03-01
Described herein are the results of the FY 1999 activities for the project of information exchange by researchers on environmental problems in the Asia-Pacific region. In 1999, the 6th International Workshop was held in City of Yokkaichi, Mie Pref., with the theme (Implementation of international collaborative researches on environmental technology) at International Center for Environmental Technology Transfer, with a total of more than 50 domestic and foreign attendees actively participating in the discussion. The keynote addresses were (Use of coal and environmental improvements) presented by Mr. Yoshisada Nitta, Director at Central Research Institute of Electric Power Industry, and (Potential of clean fuel from biomass) presented by Dr. Kyu-Wan Lee of Korea Research Institute of Chemical Technology. The overseas surveys were conducted to promote the use and registration of the databases, and to identify problems by the on-the-spot investigations in Vietnam, the Philippines and Republic of Korea. At the same time, the mini-workshops were held for information exchange with the research institutes. It is keenly felt that Environmental Technology Research Network in the Asia-Pacific Region (ENTERNET-APR) works certainly in various areas, with the attendees in the last workshops serving as the key persons. (NEDO)
MPLS for metropolitan area networks
Tan, Nam-Kee
2004-01-01
METROPOLITAN AREA NETWORKS AND MPLSRequirements of Metropolitan Area Network ServicesMetropolitan Area Network OverviewThe Bandwidth DemandThe Metro Service Provider's Business ApproachesThe Emerging Metro Customer Expectations and NeedsSome Prevailing Metro Service OpportunitiesService Aspects and RequirementsRoles of MPLS in Metropolitan Area NetworksMPLS PrimerMPLS ApplicationsTRAFFIC ENGINEERING ASPECTS OF METROPOLITAN AREA NETWORKSTraffic Engineering ConceptsNetwork CongestionHyper Aggregation ProblemEasing CongestionNetwork ControlTactical versus Strategic Traffic EngineeringIP/ATM Overl
Green heterogeneous wireless networks
Ismail, Muhammad; Nee, Hans-Peter; Qaraqe, Khalid A; Serpedin, Erchin
2016-01-01
This book focuses on the emerging research topic "green (energy efficient) wireless networks" which has drawn huge attention recently from both academia and industry. This topic is highly motivated due to important environmental, financial, and quality-of-experience (QoE) considerations. Specifically, the high energy consumption of the wireless networks manifests in approximately 2% of all CO2 emissions worldwide. This book presents the authors’ visions and solutions for deployment of energy efficient (green) heterogeneous wireless communication networks. The book consists of three major parts. The first part provides an introduction to the "green networks" concept, the second part targets the green multi-homing resource allocation problem, and the third chapter presents a novel deployment of device-to-device (D2D) communications and its successful integration in Heterogeneous Networks (HetNets). The book is novel in that it specifically targets green networking in a heterogeneous wireless medium, which re...
Solving the Extended Tree Knapsack Problem with xed cost ow ...
African Journals Online (AJOL)
Parts of the Local Access Telecommunication Network planning problem may be modelled as an Extended Tree Knapsack Problem. The Local Access Telecommunication Network can contribute up to 60% of the total network costs. This paper presents partitioning algorithms that use standard o-the-shelf software coupled ...
Baronti, Marco; van der Putten, Robertus; Venturi, Irene
2016-01-01
This book, intended as a practical working guide for students in Engineering, Mathematics, Physics, or any other field where rigorous calculus is needed, includes 450 exercises. Each chapter starts with a summary of the main definitions and results, which is followed by a selection of solved exercises accompanied by brief, illustrative comments. A selection of problems with indicated solutions rounds out each chapter. A final chapter explores problems that are not designed with a single issue in mind but instead call for the combination of a variety of techniques, rounding out the book’s coverage. Though the book’s primary focus is on functions of one real variable, basic ordinary differential equations (separation of variables, linear first order and constant coefficients ODEs) are also discussed. The material is taken from actual written tests that have been delivered at the Engineering School of the University of Genoa. Literally thousands of students have worked on these problems, ensuring their real-...
An Evolving Asymmetric Game for Modeling Interdictor-Smuggler Problems
2016-06-01
3–30. Morton D, Pan F, Saeger K (2007) Models for nuclear smuggling interdiction. IIE Transactions . 39(1): 3–14. Nehme M (2009) Two-person games...Twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modeling and Computer Simulation (TOMACS) 8(1
Establishing And Managing Development Networks In Africa ...
African Journals Online (AJOL)
Establishing And Managing Development Networks In Africa: Perspectives On The African Virtual Library And Information Network (Avlin) ... In times like this when libraries are facing problems with access and acquisition of materials, networking becomes very important. This paper discusses issues relating to networking in ...
Robinson, Julie A.; Tate-Brown, Judy M.
2009-01-01
Using a commercial software CD and minimal up-mass, SNFM monitors the Payload local area network (LAN) to analyze and troubleshoot LAN data traffic. Validating LAN traffic models may allow for faster and more reliable computer networks to sustain systems and science on future space missions. Research Summary: This experiment studies the function of the computer network onboard the ISS. On-orbit packet statistics are captured and used to validate ground based medium rate data link models and enhance the way that the local area network (LAN) is monitored. This information will allow monitoring and improvement in the data transfer capabilities of on-orbit computer networks. The Serial Network Flow Monitor (SNFM) experiment attempts to characterize the network equivalent of traffic jams on board ISS. The SNFM team is able to specifically target historical problem areas including the SAMS (Space Acceleration Measurement System) communication issues, data transmissions from the ISS to the ground teams, and multiple users on the network at the same time. By looking at how various users interact with each other on the network, conflicts can be identified and work can begin on solutions. SNFM is comprised of a commercial off the shelf software package that monitors packet traffic through the payload Ethernet LANs (local area networks) on board ISS.
A research on the application of software defined networking in satellite network architecture
Song, Huan; Chen, Jinqiang; Cao, Suzhi; Cui, Dandan; Li, Tong; Su, Yuxing
2017-10-01
Software defined network is a new type of network architecture, which decouples control plane and data plane of traditional network, has the feature of flexible configurations and is a direction of the next generation terrestrial Internet development. Satellite network is an important part of the space-ground integrated information network, while the traditional satellite network has the disadvantages of difficult network topology maintenance and slow configuration. The application of SDN technology in satellite network can solve these problems that traditional satellite network faces. At present, the research on the application of SDN technology in satellite network is still in the stage of preliminary study. In this paper, we start with introducing the SDN technology and satellite network architecture. Then we mainly introduce software defined satellite network architecture, as well as the comparison of different software defined satellite network architecture and satellite network virtualization. Finally, the present research status and development trend of SDN technology in satellite network are analyzed.
... most common source of vertigo) headache (including migraines) anxiety or panic ringing in the ears allergies or infections getting up quickly from sitting or lying down a growth on the auditory nerve that works with the ear (such as an acoustic neuroma) problems with nerves in your legs and ...
... problems can cause you to go to the bathroom frequently feel as if you need to rush to the bathroom, only to find you can’t urinate or ... and disseminates research findings through its clearinghouses and education programs to increase knowledge and understanding about health ...
Loo, Boon Thau
2012-01-01
Declarative Networking is a programming methodology that enables developers to concisely specify network protocols and services, which are directly compiled to a dataflow framework that executes the specifications. Declarative networking proposes the use of a declarative query language for specifying and implementing network protocols, and employs a dataflow framework at runtime for communication and maintenance of network state. The primary goal of declarative networking is to greatly simplify the process of specifying, implementing, deploying and evolving a network design. In addition, decla
Triangulation positioning system network
Directory of Open Access Journals (Sweden)
Sfendourakis Marios
2017-01-01
Full Text Available This paper presents ongoing work on localization and positioning through triangulation procedure for a Fixed Sensors Network - FSN.The FSN has to work as a system.As the triangulation problem becomes high complicated in a case with large numbers of sensors and transmitters, an adequate grid topology is needed in order to tackle the detection complexity.For that reason a Network grid topology is presented and areas that are problematic and need further analysis are analyzed.The Network System in order to deal with problems of saturation and False Triangulations - FTRNs will have to find adequate methods in every sub-area of the Area Of Interest - AOI.Also, concepts like Sensor blindness and overall Network blindness, are presented. All these concepts affect the Network detection rate and its performance and ought to be considered in a way that the network overall performance won’t be degraded.Network performance should be monitored contentiously, with right algorithms and methods.It is also shown that as the number of TRNs and FTRNs is increased Detection Complexity - DC is increased.It is hoped that with further research all the characteristics of a triangulation system network for positioning will be gained and the system will be able to perform autonomously with a high detection rate.
Synthesis of Reliable Telecommunication Networks
Directory of Open Access Journals (Sweden)
Dusan Trstensky
2005-01-01
Full Text Available In many application, the network designer may to know to senthesise a reliable telecommunication network. Assume that a network, denoted Gm,e has the number of nodes n and the number of edges e, and the operational probability of each edge is known. The system reliability of the network is defined to be the reliability that every pair of nodes can communicate with each other. A network synthesis problem considered in this paper is to find a network G*n,e, that maximises system reliability over the class of all networks for the classes of networks Gn,n-1, Gn,m and Gn,n+1 respectively. In addition an upper bound of maximum reliability for the networks with n-node and e-edge (e>n+2 is derived in terms of node. Computational experiments for the reliability upper are also presented. the results show, that the proposed reliability upper bound is effective.
Loss Discrimination Algorithm for Wired/Wireless Networks
Liw J. Seng; Mohd N. Derahman; Azizol Abdullah
2011-01-01
Problem statement: Wireless technology has far growing with an increasing demand of the Wireless networking technologies recent years. The wireless access network and cellular networks are being used to support their need. It is usually connected to a wired backbone network. TCP is used to handle the congestion in wired network. However, it is not well suited for hybrid network consisting of wired and wireless networks. Packet loss occurs in wireless network mostly due to high bit error rate,...
DEFF Research Database (Denmark)
Dirckinck-Holmfeld, Lone; Balacheff, Nicolas; Bottino, Rosa Maria
2016-01-01
Small and medium sized research labs (SMLs) are dominating European TEL research. This is justified by the great numbers of countries and regions in Europe needing to develop a research and innovation competence to facilitate the diverse educational systems contextualized in various institutional...... settings across Europe. However, to strengthen the various research practices and to develop a common scientific language on TEL research the Grand Challenge Problem is to establish a vivid network and a community of practice among the research labs. TELEARC (Technology Enhanced Learning European Advanced...
Combinational Optimal Stopping Problems
2016-04-01
0.0021 m. Elastic properties of the composite plate are as follows: Young’s modulus in the fiber direction is E1 = 102.97 GPa , Young’s modulus in...stage stochastic network model and solution methods for the dynamic empty container allocation problem. Transportation Science, 32(2):142– 162 , 1998...permeability; and B22 = E2/(1−ν12ν21), where E2 is Young’s modulus along the y-direction, ν12, and ν21 are the corresponding Poisson ratios. The
Inverse feasibility problems of the inverse maximum flow problems
Indian Academy of Sciences (India)
A strongly polynomial time algorithm to solve the inverse maximum flow problem under l1 norm (denoted ... IMF can not be solved using weakly polynomial algorithms (although sometimes they can be preferred) because ..... in the network ˜G. We shall sort descending the arcs of ˜G by their capacities˜c1. After sorting, the.
Generalization performance of regularized neural network models
DEFF Research Database (Denmark)
Larsen, Jan; Hansen, Lars Kai
1994-01-01
Architecture optimization is a fundamental problem of neural network modeling. The optimal architecture is defined as the one which minimizes the generalization error. This paper addresses estimation of the generalization performance of regularized, complete neural network models. Regularization...
Logistic control in automated transportation networks
Ebben, Mark
2001-01-01
Increasing congestion problems lead to a search for alternative transportation systems. Automated transportation networks, possibly underground, are an option. Logistic control systems are essential for future implementations of such automated transportation networks. This book contributes to the
Parameter Identification by Bayes Decision and Neural Networks
DEFF Research Database (Denmark)
Kulczycki, P.; Schiøler, Henrik
1994-01-01
The problem of parameter identification by Bayes point estimation using neural networks is investigated.......The problem of parameter identification by Bayes point estimation using neural networks is investigated....
Directory of Open Access Journals (Sweden)
Yaping Hu
2015-01-01
the nonsmooth convex optimization problem. First, by using Moreau-Yosida regularization, we convert the original objective function to a continuously differentiable function; then we use approximate function and gradient values of the Moreau-Yosida regularization to substitute the corresponding exact values in the algorithm. The global convergence is proved under suitable assumptions. Numerical experiments are presented to show the effectiveness of this algorithm.
Graph theory and interconnection networks
Hsu, Lih-Hsing
2008-01-01
The advancement of large scale integrated circuit technology has enabled the construction of complex interconnection networks. Graph theory provides a fundamental tool for designing and analyzing such networks. Graph Theory and Interconnection Networks provides a thorough understanding of these interrelated topics. After a brief introduction to graph terminology, the book presents well-known interconnection networks as examples of graphs, followed by in-depth coverage of Hamiltonian graphs. Different types of problems illustrate the wide range of available methods for solving such problems. The text also explores recent progress on the diagnosability of graphs under various models.
Avinash Bansal; Kamal Gupta
2012-01-01
Sorting network is an abstract mathematical modelwhich can be used as a multiple-input, multiple-output switchingnetwork to sort the data in ascending or descending order [1].Sorting has been one of the most critical applications on parallelcomputing machines. Many classic textbooks on algorithms likeThomas H. Cormen, therefore consider this problem in greatdetail and list many sorting network for this purpose [2]. Thereare many sorting algorithms as the Bubble / Insertion sorter,Odd-Even sor...
Network Formation and Cooperation
Felipe Balmaceda
2004-01-01
In this paper we adopt Granovetter's view expressed in his famous article ''Economic Action and Social Structure: The Problem of Embeddedness'' , where he argues that the concept of man in economics is extremely undersocialized because it ignores the importance of social networks. In so doing the incentives to mutual cooperation in social matching games in which the social network is endogenously determined are studied. The main result shows that in atomized societies where there is no inform...
Revisiting Friendship Networks
Aditi Roy; Sudipta Sarangi
2009-01-01
We extend the model of friendship networks developed by Brueck- ner (2006) in two ways. First, we extend the level of indirect benefits by incorporating benefits from up to three links and explore its impli- cation for the socially optimal and individual e¤ort levels. Next, we generalize the magnetic agent problem by allowing for more than 3 players by restricting ourselves to regular networks that include pay- o¤s from the magnetic agent.
The model of social crypto-network
Directory of Open Access Journals (Sweden)
Марк Миколайович Орел
2015-06-01
Full Text Available The article presents the theoretical model of social network with the enhanced mechanism of privacy policy. It covers the problems arising in the process of implementing the mentioned type of network. There are presented the methods of solving problems arising in the process of building the social network with privacy policy. It was built a theoretical model of social networks with enhanced information protection methods based on information and communication blocks
Troubleshooting Assistance Services in Community Wireless Networks
Directory of Open Access Journals (Sweden)
P. Kriz
2012-01-01
Full Text Available We have identified new services intended for users and administrators of community wireless networks. Troubleshooting assistance services will assist the users during solution of communication problems, gathering data for expert analysis, informing the user about the state of the network (including outages, and so forth. Network administrators will be provided with a unique tool supporting the network analysis, operation, and development. We have mainly focused on the use cases and prerequirements—the problem of topology discovery.
The model of social crypto-network
Марк Миколайович Орел
2015-01-01
The article presents the theoretical model of social network with the enhanced mechanism of privacy policy. It covers the problems arising in the process of implementing the mentioned type of network. There are presented the methods of solving problems arising in the process of building the social network with privacy policy. It was built a theoretical model of social networks with enhanced information protection methods based on information and communication blocks
Optical network democratization.
Nejabati, Reza; Peng, Shuping; Simeonidou, Dimitra
2016-03-06
The current Internet infrastructure is not able to support independent evolution and innovation at physical and network layer functionalities, protocols and services, while at same time supporting the increasing bandwidth demands of evolving and heterogeneous applications. This paper addresses this problem by proposing a completely democratized optical network infrastructure. It introduces the novel concepts of the optical white box and bare metal optical switch as key technology enablers for democratizing optical networks. These are programmable optical switches whose hardware is loosely connected internally and is completely separated from their control software. To alleviate their complexity, a multi-dimensional abstraction mechanism using software-defined network technology is proposed. It creates a universal model of the proposed switches without exposing their technological details. It also enables a conventional network programmer to develop network applications for control of the optical network without specific technical knowledge of the physical layer. Furthermore, a novel optical network virtualization mechanism is proposed, enabling the composition and operation of multiple coexisting and application-specific virtual optical networks sharing the same physical infrastructure. Finally, the optical white box and the abstraction mechanism are experimentally evaluated, while the virtualization mechanism is evaluated with simulation. © 2016 The Author(s).
Minimum cost connection networks
DEFF Research Database (Denmark)
Hougaard, Jens Leth; Tvede, Mich
2015-01-01
In the present paper we consider the allocation of costs in connection networks. Agents have connection demands in form of pairs of locations they want to have connected. Connections between locations are costly to build. The problem is to allocate costs of networks satisfying all connection...... demands. We use a few axioms to characterize allocation rules that truthfully implement cost minimizing networks satisfying all connection demands in a game where: (1) a central planner announces an allocation rule and a cost estimation rule; (2) every agent reports her own connection demand as well...... as all connection costs; (3) the central planner selects a cost minimizing network satisfying reported connection demands based on the estimated costs; and, (4) the planner allocates the true costs of the selected network. It turns out that an allocation rule satisfies the axioms if and only if relative...
Minimum cost connection networks
DEFF Research Database (Denmark)
Hougaard, Jens Leth; Tvede, Mich
In the present paper we consider the allocation of cost in connection networks. Agents have connection demands in form of pairs of locations they want to be connected. Connections between locations are costly to build. The problem is to allocate costs of networks satisfying all connection demands....... We use three axioms to characterize allocation rules that truthfully implement cost minimizing networks satisfying all connection demands in a game where: (1) a central planner announces an allocation rule and a cost estimation rule; (2) every agent reports her own connection demand as well as all...... connection costs; and, (3) the central planner selects a cost minimizing network satisfying reported connection demands based on estimated connection costs and allocates true connection costs of the selected network....
Community structure of complex networks based on continuous neural network
Dai, Ting-ting; Shan, Chang-ji; Dong, Yan-shou
2017-09-01
As a new subject, the research of complex networks has attracted the attention of researchers from different disciplines. Community structure is one of the key structures of complex networks, so it is a very important task to analyze the community structure of complex networks accurately. In this paper, we study the problem of extracting the community structure of complex networks, and propose a continuous neural network (CNN) algorithm. It is proved that for any given initial value, the continuous neural network algorithm converges to the eigenvector of the maximum eigenvalue of the network modularity matrix. Therefore, according to the stability of the evolution of the network symbol will be able to get two community structure.
Wireless rechargeable sensor networks
Yang, Yuanyuan
2015-01-01
This SpringerBrief provides a concise guide to applying wireless energy transfer techniques in traditional battery-powered sensor networks. It examines the benefits and challenges of wireless power including efficiency and reliability. The authors build a wireless rechargeable sensor networks from scratch and aim to provide perpetual network operation. Chapters cover a wide range of topics from the collection of energy information and recharge scheduling to joint design with typical sensing applications such as data gathering. Problems are approached using a natural combination of probability
Introduction to network emulation
Beuran, Razvan
2012-01-01
""Since network emulation permits investigation of how higher-level protocols interact with the underlying network behaviour, it will be of particular interest to anyone tasked with designing and rolling out new applications and services, especially those aimed at wireless transport. This book represents a comprehensive survey of the current state of the art. It will give the readers a good sense of the various techniques available, allowing them to make an informed decision as to which are appropriate to their particular problem.""-Dr. Neil Davies - Predictable Network Solutions, UK""The Inte
DEFF Research Database (Denmark)
Dickison, Mark; Magnani, Matteo; Rossi, Luca
social network systems, the evolution of interconnected social networks, and dynamic processes such as information spreading. A single real dataset is used to illustrate the concepts presented throughout the book, demonstrating both the practical utility and the potential shortcomings of the various...... research communities, leading to the development of several independent models and methods to deal with the same set of problems. This book unifies and consolidates existing practical and theoretical knowledge on multilayer networks including data collection and analysis, modeling, and mining of multilayer...
Practical neural network recipies in C++
Masters
2014-01-01
This text serves as a cookbook for neural network solutions to practical problems using C++. It will enable those with moderate programming experience to select a neural network model appropriate to solving a particular problem, and to produce a working program implementing that network. The book provides guidance along the entire problem-solving path, including designing the training set, preprocessing variables, training and validating the network, and evaluating its performance. Though the book is not intended as a general course in neural networks, no background in neural works is assum
The network researchers' network
DEFF Research Database (Denmark)
Henneberg, Stephan C.; Jiang, Zhizhong; Naudé, Peter
2009-01-01
The Industrial Marketing and Purchasing (IMP) Group is a network of academic researchers working in the area of business-to-business marketing. The group meets every year to discuss and exchange ideas, with a conference having been held every year since 1984 (there was no meeting in 1987). In thi......The Industrial Marketing and Purchasing (IMP) Group is a network of academic researchers working in the area of business-to-business marketing. The group meets every year to discuss and exchange ideas, with a conference having been held every year since 1984 (there was no meeting in 1987......). In this paper, based upon the papers presented at the 22 conferences held to date, we undertake a Social Network Analysis in order to examine the degree of co-publishing that has taken place between this group of researchers. We identify the different components in this database, and examine the large main...
Neschuk, Nancy Carolina
1998-01-01
Los problemas ambientales constituyen una preocupación creciente en las sociedades humanas. La Ecología, considerada como una ciencia teórica diseñada sólo para grupos académicos restringidos, adquiere ahora un valor práctico y sin duda será el mayor problema comercial que habrá que resolver en el siglo XXI. Environmental problems constitute an increasing concern in human societies. Ecology, regarded as a theoretical science designed for only restricted academic groups,...
Tunnadine, P
1985-05-01
Individual anxieties about sexuality remain surprisingly repetitive despite changing public attitudes toward sexuality. This discussion includes case histories which demonstrate the indirect presentation, using nonverbal and physical cues, adopted by some patients who experience difficulty in verbalizing their sexual problems. When seeking contraceptive consultation, the patient must have no conscious or unconscious anxiety about her desire for sexual pleasure without pregnancy and is entitled to assume, when seeking such advice, that the doctor who offers it has no such prejudices either. When the presenting symptom relates to otherwise illogical contraceptive difficulty, or otherwise invites examination of the genitals, one may suspect that the problem may be sexual and too difficult to express in other than the physical language the patient expects the physician to want. For a couple whose sexual life is comfortably confident and provides pleasure, any contraceptive method will serve its purpose of removing the fear of pregnancy. Such a couple may be advised on logical grounds. For the rest, an open-ended comment such as "I wonder what the real worry is" usually leads to the true anxiety. Yet, at this point, the doctor's anxiety often replaces the patient's since the management of psychosomatic disorders is not part of normal medical training. The temptation to send for the partner and advise a program of relearning, or to make referral to a sex therapy clinic which will do likewise, is strong for any busy doctor who has no psychosexual training. Skill in dealing with such common dilemmas in the context of the brief period allotted to each patient cannot be obtained from a short article, but it is worthwhile for a physician, confronted with a patient whose symptoms do not make sense, to ask what the symptom itself may indicate in terms of the unspoken problem at hand. Most family doctors who understand the training of the Institute of Psychosexual Medicine find
Network Analysis, Architecture, and Design
McCabe, James D
2007-01-01
Traditionally, networking has had little or no basis in analysis or architectural development, with designers relying on technologies they are most familiar with or being influenced by vendors or consultants. However, the landscape of networking has changed so that network services have now become one of the most important factors to the success of many third generation networks. It has become an important feature of the designer's job to define the problems that exist in his network, choose and analyze several optimization parameters during the analysis process, and then prioritize and evalua
Program Aids Simulation Of Neural Networks
Baffes, Paul T.
1990-01-01
Computer program NETS - Tool for Development and Evaluation of Neural Networks - provides simulation of neural-network algorithms plus software environment for development of such algorithms. Enables user to customize patterns of connections between layers of network, and provides features for saving weight values of network, providing for more precise control over learning process. Consists of translating problem into format using input/output pairs, designing network configuration for problem, and finally training network with input/output pairs until acceptable error reached. Written in C.
Opinion Impact Models and Opinion Consensus Methods in Ad Hoc Tactical Social Networks
Demin Li; Jie Zhou; Jingjuan Zhu; Jiacun Wang
2013-01-01
Ad hoc social networks are special social networks, such as ad hoc tactical social networks, ad hoc firefighter social networks, and ad hoc vehicular social networks. The social networks possess both the properties of ad hoc network and social network. One of the challenge problems in ad hoc social networks is opinion impact and consensus, and the opinion impact plays a key role for information fusion and decision support in ad hoc social networks. In this paper, consider the impact of physic...
Exploring the Community Structure of Complex Networks
Drago, Carlo
2016-01-01
Regarding complex networks, one of the most relevant problems is to understand and to explore community structure. In particular it is important to define the network organization and the functions associated to the different network partitions. In this context, the idea is to consider some new approaches based on interval data in order to represent the different relevant network components as communities. The method is also useful to represent the network community structure, especially the ...
Cason, Thomas
2012-01-01
Graphs allow to represent real problems in an abstract fashion which, though easily stated, raises non trivial mathematical problems. In the past few years, several large networks have become omnipresent in everyday life, which made their analysis a major concern. The notion of regularity for equivalence relations is one of the many analysis tools used in graph theory to reduce large graphs into smaller comprehensible structures. It consists in partitioning the nodes of a graph in blocks ...
Towards Authenticated Network Coding for Named Data Networking
Boussaha, Ryma; Challal, Yacine; Bessedik, Malika; Bouabdallah, Abdelmadjid
2017-01-01
International audience; Named Data Networking represents a novel and an alternative approach to the current host based Internet architecture, in which the content becomes the core of the communication model. In this paper, we propose to improve named data networking robustness and throughput performances by introducing network coding functionalities. We also propose an optimized authentication model based on homomorphic encryption to deal with the " pollution attacks " problem in which malici...
Neural Networks in Control Applications
DEFF Research Database (Denmark)
Sørensen, O.
The intention of this report is to make a systematic examination of the possibilities of applying neural networks in those technical areas, which are familiar to a control engineer. In other words, the potential of neural networks in control applications is given higher priority than a detailed...... study of the networks themselves. With this end in view the following restrictions have been made: - Amongst numerous neural network structures, only the Multi Layer Perceptron (a feed-forward network) is applied. - Amongst numerous training algorithms, only four algorithms are examined, all...... in a recursive form (sample updating). The simplest is the Back Probagation Error Algorithm, and the most complex is the recursive Prediction Error Method using a Gauss-Newton search direction. - Over-fitting is often considered to be a serious problem when training neural networks. This problem is specifically...
Pansharpening by Convolutional Neural Networks
National Research Council Canada - National Science Library
Masi, Giuseppe; Cozzolino, Davide; Verdoliva, Luisa; Scarpa, Giuseppe
2016-01-01
A new pansharpening method is proposed, based on convolutional neural networks. We adapt a simple and effective three-layer architecture recently proposed for super-resolution to the pansharpening problem...
Optimal design of network distribution systems
Directory of Open Access Journals (Sweden)
U. Passy
2003-12-01
Full Text Available The problem of finding the optimal distribution of pressure drop over a network is solved via an unconstrained gradient type algorithm. The developed algorithm is computationally attractive. Problems with several hundred variables and constraints were solved.