Optimal Operation of Network-Connected Combined Heat and Powers for Customer Profit Maximization

Directory of Open Access Journals (Sweden)

Da Xie

2016-06-01

Full Text Available Network-connected combined heat and powers (CHPs, owned by a community, can export surplus heat and electricity to corresponding heat and electric networks after community loads are satisfied. This paper proposes a new optimization model for network-connected CHP operation. Both CHPs’ overall efficiency and heat to electricity ratio (HTER are assumed to vary with loading levels. Based on different energy flow scenarios where heat and electricity are exported to the network from the community or imported, four profit models are established accordingly. They reflect the different relationships between CHP energy supply and community load demand across time. A discrete optimization model is then developed to maximize the profit for the community. The models are derived from the intervals determined by the daily operation modes of CHP and real-time buying and selling prices of heat, electricity and natural gas. By demonstrating the proposed models on a 1 MW network-connected CHP, results show that the community profits are maximized in energy markets. Thus, the proposed optimization approach can help customers to devise optimal CHP operating strategies for maximizing benefits.

Profit maximization mitigates competition

DEFF Research Database (Denmark)

Dierker, Egbert; Grodal, Birgit

1996-01-01

We consider oligopolistic markets in which the notion of shareholders' utility is well-defined and compare the Bertrand-Nash equilibria in case of utility maximization with those under the usual profit maximization hypothesis. Our main result states that profit maximization leads to less price...... competition than utility maximization. Since profit maximization tends to raise prices, it may be regarded as beneficial for the owners as a whole. Moreover, if profit maximization is a good proxy for utility maximization, then there is no need for a general equilibrium analysis that takes the distribution...... of profits among consumers fully into account and partial equilibrium analysis suffices...

Joint Utility-Based Power Control and Receive Beamforming in Decentralized Wireless Networks

Directory of Open Access Journals (Sweden)

Angela Feistel

2010-01-01

Full Text Available This paper addresses the problem of joint resource allocation in general wireless networks and its practical implementation aspects. The objective is to allocate transmit powers and receive beamformers to the users in order to maximize a network-wide utility that represents the attained QoS and is a function of the signal-to-interference ratios. This problem is much more intricate than the corresponding QoS-based power control problem. In particular, it is not known which class of utility functions allows for a convex formulation of this problem. In case of perfect synchronization, the joint power and receiver control problem can be reformulated as a power control problem under optimal receivers. Standard gradient projection methods can be applied to solve this problem. However, these algorithms are not applicable in decentralized wireless networks. Therefore, we decompose the problem and propose a convergent alternate optimization that is amenable to distributed implementation. In addition, in real-world networks noisy measurements and estimations occur. Thus, the proposed algorithm has to be investigated in the framework of stochastic approximation. We discuss practical implementation aspects of the proposed stochastic algorithm and investigate its convergence properties by simulations.

Maximizing Lifetime of Wireless Sensor Networks with Mobile Sink Nodes

Directory of Open Access Journals (Sweden)

Yourong Chen

2014-01-01

Full Text Available In order to maximize network lifetime and balance energy consumption when sink nodes can move, maximizing lifetime of wireless sensor networks with mobile sink nodes (MLMS is researched. The movement path selection method of sink nodes is proposed. Modified subtractive clustering method, k-means method, and nearest neighbor interpolation method are used to obtain the movement paths. The lifetime optimization model is established under flow constraint, energy consumption constraint, link transmission constraint, and other constraints. The model is solved from the perspective of static and mobile data gathering of sink nodes. Subgradient method is used to solve the lifetime optimization model when one sink node stays at one anchor location. Geometric method is used to evaluate the amount of gathering data when sink nodes are moving. Finally, all sensor nodes transmit data according to the optimal data transmission scheme. Sink nodes gather the data along the shortest movement paths. Simulation results show that MLMS can prolong network lifetime, balance node energy consumption, and reduce data gathering latency under appropriate parameters. Under certain conditions, it outperforms Ratio_w, TPGF, RCC, and GRND.

Equidistant Linear Network Codes with maximal Error-protection from Veronese Varieties

DEFF Research Database (Denmark)

Hansen, Johan P.

2012-01-01

Linear network coding transmits information in terms of a basis of a vector space and the information is received as a basis of a possible altered vectorspace. Ralf Koetter and Frank R. Kschischang in Coding for errors and erasures in random network coding (IEEE Transactions on Information Theory...... construct explicit families of vector-spaces of constant dimension where any pair of distinct vector-spaces are equidistant in the above metric. The parameters of the resulting linear network codes which have maximal error-protection are determined....

Profit maximization algorithms for utility companies in an oligopolistic energy market with dynamic prices and intelligent users

Directory of Open Access Journals (Sweden)

Tiansong Cui

2016-01-01

Full Text Available Dynamic energy pricing provides a promising solution for the utility companies to incentivize energy users to perform demand side management in order to minimize their electric bills. Moreover, the emerging decentralized smart grid, which is a likely infrastructure scenario for future electrical power networks, allows energy consumers to select their energy provider from among multiple utility companies in any billing period. This paper thus starts by considering an oligopolistic energy market with multiple non-cooperative (competitive utility companies, and addresses the problem of determining dynamic energy prices for every utility company in this market based on a modified Bertrand Competition Model of user behaviors. Two methods of dynamic energy pricing are proposed for a utility company to maximize its total profit. The first method finds the greatest lower bound on the total profit that can be achieved by the utility company, whereas the second method finds the best response of a utility company to dynamic pricing policies that the other companies have adopted in previous billing periods. To exploit the advantages of each method while compensating their shortcomings, an adaptive dynamic pricing policy is proposed based on a machine learning technique, which finds a good balance between invocations of the two aforesaid methods. Experimental results show that the adaptive policy results in consistently high profit for the utility company no matter what policies are employed by the other companies.

Network Bandwidth Utilization Forecast Model on High Bandwidth Network

Energy Technology Data Exchange (ETDEWEB)

Yoo, Wucherl; Sim, Alex

2014-07-07

With the increasing number of geographically distributed scientific collaborations and the scale of the data size growth, it has become more challenging for users to achieve the best possible network performance on a shared network. We have developed a forecast model to predict expected bandwidth utilization for high-bandwidth wide area network. The forecast model can improve the efficiency of resource utilization and scheduling data movements on high-bandwidth network to accommodate ever increasing data volume for large-scale scientific data applications. Univariate model is developed with STL and ARIMA on SNMP path utilization data. Compared with traditional approach such as Box-Jenkins methodology, our forecast model reduces computation time by 83.2percent. It also shows resilience against abrupt network usage change. The accuracy of the forecast model is within the standard deviation of the monitored measurements.

Network bandwidth utilization forecast model on high bandwidth networks

Energy Technology Data Exchange (ETDEWEB)

Yoo, Wuchert (William) [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Sim, Alex [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)

2015-03-30

With the increasing number of geographically distributed scientific collaborations and the scale of the data size growth, it has become more challenging for users to achieve the best possible network performance on a shared network. We have developed a forecast model to predict expected bandwidth utilization for high-bandwidth wide area network. The forecast model can improve the efficiency of resource utilization and scheduling data movements on high-bandwidth network to accommodate ever increasing data volume for large-scale scientific data applications. Univariate model is developed with STL and ARIMA on SNMP path utilization data. Compared with traditional approach such as Box-Jenkins methodology, our forecast model reduces computation time by 83.2%. It also shows resilience against abrupt network usage change. The accuracy of the forecast model is within the standard deviation of the monitored measurements.

Automatic physical inference with information maximizing neural networks

Science.gov (United States)

Charnock, Tom; Lavaux, Guilhem; Wandelt, Benjamin D.

2018-04-01

Compressing large data sets to a manageable number of summaries that are informative about the underlying parameters vastly simplifies both frequentist and Bayesian inference. When only simulations are available, these summaries are typically chosen heuristically, so they may inadvertently miss important information. We introduce a simulation-based machine learning technique that trains artificial neural networks to find nonlinear functionals of data that maximize Fisher information: information maximizing neural networks (IMNNs). In test cases where the posterior can be derived exactly, likelihood-free inference based on automatically derived IMNN summaries produces nearly exact posteriors, showing that these summaries are good approximations to sufficient statistics. In a series of numerical examples of increasing complexity and astrophysical relevance we show that IMNNs are robustly capable of automatically finding optimal, nonlinear summaries of the data even in cases where linear compression fails: inferring the variance of Gaussian signal in the presence of noise, inferring cosmological parameters from mock simulations of the Lyman-α forest in quasar spectra, and inferring frequency-domain parameters from LISA-like detections of gravitational waveforms. In this final case, the IMNN summary outperforms linear data compression by avoiding the introduction of spurious likelihood maxima. We anticipate that the automatic physical inference method described in this paper will be essential to obtain both accurate and precise cosmological parameter estimates from complex and large astronomical data sets, including those from LSST and Euclid.

An Efficient Algorithm for Maximizing Range Sum Queries in a Road Network

Directory of Open Access Journals (Sweden)

Tien-Khoi Phan

2014-01-01

Full Text Available Given a set of positive-weighted points and a query rectangle r (specified by a client of given extents, the goal of a maximizing range sum (MaxRS query is to find the optimal location of r such that the total weights of all the points covered by r are maximized. All existing methods for processing MaxRS queries assume the Euclidean distance metric. In many location-based applications, however, the motion of a client may be constrained by an underlying (spatial road network; that is, the client cannot move freely in space. This paper addresses the problem of processing MaxRS queries in a road network. We propose the external-memory algorithm that is suited for a large road network database. In addition, in contrast to the existing methods, which retrieve only one optimal location, our proposed algorithm retrieves all the possible optimal locations. Through simulations, we evaluate the performance of the proposed algorithm.

New BFA Method Based on Attractor Neural Network and Likelihood Maximization

Czech Academy of Sciences Publication Activity Database

Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.; Snášel, V.

2014-01-01

Roč. 132, 20 May (2014), s. 14-29 ISSN 0925-2312 Grant - others:GA MŠk(CZ) ED1.1.00/02.0070; GA MŠk(CZ) EE.2.3.20.0073 Program:ED Institutional support: RVO:67985807 Keywords : recurrent neural network * associative memory * Hebbian learning rule * neural network application * data mining * statistics * Boolean factor analysis * information gain * dimension reduction * likelihood-maximization * bars problem Subject RIV: IN - Informatics, Computer Science Impact factor: 2.083, year: 2014

Maximization of Energy Efficiency in Wireless ad hoc and Sensor Networks With SERENA

Directory of Open Access Journals (Sweden)

Saoucene Mahfoudh

2009-01-01

Full Text Available In wireless ad hoc and sensor networks, an analysis of the node energy consumption distribution shows that the largest part is due to the time spent in the idle state. This result is at the origin of SERENA, an algorithm to SchEdule RoutEr Nodes Activity. SERENA allows router nodes to sleep, while ensuring end-to-end communication in the wireless network. It is a localized and decentralized algorithm assigning time slots to nodes. Any node stays awake only during its slot and the slots assigned to its neighbors, it sleeps the remaining time. Simulation results show that SERENA enables us to maximize network lifetime while increasing the number of user messages delivered. SERENA is based on a two-hop coloring algorithm, whose complexity in terms of colors and rounds is evaluated. We then quantify the slot reuse. Finally, we show how SERENA improves the node energy consumption distribution and maximizes the energy efficiency of wireless ad hoc and sensor networks. We compare SERENA with classical TDMA and optimized variants such as USAP in wireless ad hoc and sensor networks.

Influence maximization in social networks under an independent cascade-based model

Science.gov (United States)

Wang, Qiyao; Jin, Yuehui; Lin, Zhen; Cheng, Shiduan; Yang, Tan

2016-02-01

The rapid growth of online social networks is important for viral marketing. Influence maximization refers to the process of finding influential users who make the most of information or product adoption. An independent cascade-based model for influence maximization, called IMIC-OC, was proposed to calculate positive influence. We assumed that influential users spread positive opinions. At the beginning, users held positive or negative opinions as their initial opinions. When more users became involved in the discussions, users balanced their own opinions and those of their neighbors. The number of users who did not change positive opinions was used to determine positive influence. Corresponding influential users who had maximum positive influence were then obtained. Experiments were conducted on three real networks, namely, Facebook, HEP-PH and Epinions, to calculate maximum positive influence based on the IMIC-OC model and two other baseline methods. The proposed model resulted in larger positive influence, thus indicating better performance compared with the baseline methods.

Maximizing the optical network capacity.

Science.gov (United States)

Bayvel, Polina; Maher, Robert; Xu, Tianhua; Liga, Gabriele; Shevchenko, Nikita A; Lavery, Domaniç; Alvarado, Alex; Killey, Robert I

2016-03-06

Most of the digital data transmitted are carried by optical fibres, forming the great part of the national and international communication infrastructure. The information-carrying capacity of these networks has increased vastly over the past decades through the introduction of wavelength division multiplexing, advanced modulation formats, digital signal processing and improved optical fibre and amplifier technology. These developments sparked the communication revolution and the growth of the Internet, and have created an illusion of infinite capacity being available. But as the volume of data continues to increase, is there a limit to the capacity of an optical fibre communication channel? The optical fibre channel is nonlinear, and the intensity-dependent Kerr nonlinearity limit has been suggested as a fundamental limit to optical fibre capacity. Current research is focused on whether this is the case, and on linear and nonlinear techniques, both optical and electronic, to understand, unlock and maximize the capacity of optical communications in the nonlinear regime. This paper describes some of them and discusses future prospects for success in the quest for capacity. © 2016 The Authors.

Optimal network structure to induce the maximal small-world effect

International Nuclear Information System (INIS)

Zhang Zheng-Zhen; Xu Wen-Jun; Lin Jia-Ru; Zeng Shang-You

2014-01-01

In this paper, the general efficiency, which is the average of the global efficiency and the local efficiency, is defined to measure the communication efficiency of a network. The increasing ratio of the general efficiency of a small-world network relative to that of the corresponding regular network is used to measure the small-world effect quantitatively. The more considerable the small-world effect, the higher the general efficiency of a network with a certain cost is. It is shown that the small-world effect increases monotonically with the increase of the vertex number. The optimal rewiring probability to induce the best small-world effect is approximately 0.02 and the optimal average connection probability decreases monotonically with the increase of the vertex number. Therefore, the optimal network structure to induce the maximal small-world effect is the structure with the large vertex number (> 500), the small rewiring probability (≍ 0.02) and the small average connection probability (< 0.1). Many previous research results support our results. (interdisciplinary physics and related areas of science and technology)

A Method of Determination of an Acquisition Program in Order to Maximize the Total Utility Using Linear Programming in Integer Numbers

Directory of Open Access Journals (Sweden)

Alin Cristian Ioan

2010-03-01

Full Text Available This paper solves in a different way the problem of maximization of the total utility using the linear programming in integer numbers. The author uses the diofantic equations (equations in integers numbers and after a decomposing in different cases, he obtains the maximal utility.

Maximizing hosting capacity of renewable energy sources in distribution networks: A multi-objective and scenario-based approach

International Nuclear Information System (INIS)

Rabiee, Abbas; Mohseni-Bonab, Seyed Masoud

2017-01-01

Due to the development of renewable energy sources (RESs), maximization of hosting capacity (HC) of RESs has gained significant interest in the existing and future power systems. HC maximization should be performed considering various technical constraints like power flow equations, limits on the distribution feeders' voltages and currents, as well as economic constraints such as the cost of energy procurement from the upstream network and power generation by RESs. RESs are volatile and uncertain in nature. Thus, it is necessary to handle their inherent uncertainties in the HC maximization problem. Wind power is now the fastest growing RESs around the world. Hence, in this paper a stochastic multi-objective optimization model is proposed to maximize the distribution network's HC for wind power and minimize the energy procurement costs in a wind integrated power system. The following objective functions are considered: 1) Cost of the purchased energy from upstream network (to be minimized) and 2) Operation and maintenance cost of wind farms. The proposed model is examined on a standard radial 69 bus distribution feeder and a practical 152 bus distribution system. The numerical results substantiate that the proposed model is an effective tool for distribution network operators (DNOs) to consider both technical and economic aspects of distribution network's HC for RESs. - Highlights: • Hosting capacity of wind power is improved in distribution feeders. • A stochastic multi-objective optimization model is proposed. • Wind power and load uncertainties are modeled by scenario based approach. • Purchased energy cost from upstream network and O&M cost of wind farms are used.

Expected Power-Utility Maximization Under Incomplete Information and with Cox-Process Observations

International Nuclear Information System (INIS)

Fujimoto, Kazufumi; Nagai, Hideo; Runggaldier, Wolfgang J.

2013-01-01

We consider the problem of maximization of expected terminal power utility (risk sensitive criterion). The underlying market model is a regime-switching diffusion model where the regime is determined by an unobservable factor process forming a finite state Markov process. The main novelty is due to the fact that prices are observed and the portfolio is rebalanced only at random times corresponding to a Cox process where the intensity is driven by the unobserved Markovian factor process as well. This leads to a more realistic modeling for many practical situations, like in markets with liquidity restrictions; on the other hand it considerably complicates the problem to the point that traditional methodologies cannot be directly applied. The approach presented here is specific to the power-utility. For log-utilities a different approach is presented in Fujimoto et al. (Preprint, 2012).

Expected Power-Utility Maximization Under Incomplete Information and with Cox-Process Observations

Energy Technology Data Exchange (ETDEWEB)

Fujimoto, Kazufumi, E-mail: m_fuji@kvj.biglobe.ne.jp [Bank of Tokyo-Mitsubishi UFJ, Ltd., Corporate Risk Management Division (Japan); Nagai, Hideo, E-mail: nagai@sigmath.es.osaka-u.ac.jp [Osaka University, Division of Mathematical Science for Social Systems, Graduate School of Engineering Science (Japan); Runggaldier, Wolfgang J., E-mail: runggal@math.unipd.it [Universita di Padova, Dipartimento di Matematica Pura ed Applicata (Italy)

2013-02-15

We consider the problem of maximization of expected terminal power utility (risk sensitive criterion). The underlying market model is a regime-switching diffusion model where the regime is determined by an unobservable factor process forming a finite state Markov process. The main novelty is due to the fact that prices are observed and the portfolio is rebalanced only at random times corresponding to a Cox process where the intensity is driven by the unobserved Markovian factor process as well. This leads to a more realistic modeling for many practical situations, like in markets with liquidity restrictions; on the other hand it considerably complicates the problem to the point that traditional methodologies cannot be directly applied. The approach presented here is specific to the power-utility. For log-utilities a different approach is presented in Fujimoto et al. (Preprint, 2012).

Synthetic aperture radar ship discrimination, generation and latent variable extraction using information maximizing generative adversarial networks

CSIR Research Space (South Africa)

Schwegmann, Colin P

2017-07-01

Full Text Available such as Synthetic Aperture Radar imagery. To aid in the creation of improved machine learning-based ship detection and discrimination methods this paper applies a type of neural network known as an Information Maximizing Generative Adversarial Network. Generative...

An optimally evolved connective ratio of neural networks that maximizes the occurrence of synchronized bursting behavior

Science.gov (United States)

2012-01-01

Background Synchronized bursting activity (SBA) is a remarkable dynamical behavior in both ex vivo and in vivo neural networks. Investigations of the underlying structural characteristics associated with SBA are crucial to understanding the system-level regulatory mechanism of neural network behaviors. Results In this study, artificial pulsed neural networks were established using spike response models to capture fundamental dynamics of large scale ex vivo cortical networks. Network simulations with synaptic parameter perturbations showed the following two findings. (i) In a network with an excitatory ratio (ER) of 80-90%, its connective ratio (CR) was within a range of 10-30% when the occurrence of SBA reached the highest expectation. This result was consistent with the experimental observation in ex vivo neuronal networks, which were reported to possess a matured inhibitory synaptic ratio of 10-20% and a CR of 10-30%. (ii) No SBA occurred when a network does not contain any all-positive-interaction feedback loop (APFL) motif. In a neural network containing APFLs, the number of APFLs presented an optimal range corresponding to the maximal occurrence of SBA, which was very similar to the optimal CR. Conclusions In a neural network, the evolutionarily selected CR (10-30%) optimizes the occurrence of SBA, and APFL serves a pivotal network motif required to maximize the occurrence of SBA. PMID:22462685

ON THE APPROACH TO SCIENTIFIC PUBLICATIONS VISIBILITY MAXIMIZATION BY THE SCIENTIFIC SOCIAL NETWORKS USAGE

Directory of Open Access Journals (Sweden)

A. V. Semenets

2015-12-01

3 Research results. Data integration of the user profiles of the scientific social networksThe maximization of visibility and bibliometrics citation increasing of the scientific papers initiated by the given above approach is discussed. The detailed strategy of the user profiles bibliometrics data integration through the scientific social networks is proposed. The role and ways to receiving of the Altmetric rating indices are mentioned.

Optimization in the utility maximization framework for conservation planning: a comparison of solution procedures in a study of multifunctional agriculture

Science.gov (United States)

Kreitler, Jason R.; Stoms, David M.; Davis, Frank W.

2014-01-01

Quantitative methods of spatial conservation prioritization have traditionally been applied to issues in conservation biology and reserve design, though their use in other types of natural resource management is growing. The utility maximization problem is one form of a covering problem where multiple criteria can represent the expected social benefits of conservation action. This approach allows flexibility with a problem formulation that is more general than typical reserve design problems, though the solution methods are very similar. However, few studies have addressed optimization in utility maximization problems for conservation planning, and the effect of solution procedure is largely unquantified. Therefore, this study mapped five criteria describing elements of multifunctional agriculture to determine a hypothetical conservation resource allocation plan for agricultural land conservation in the Central Valley of CA, USA. We compared solution procedures within the utility maximization framework to determine the difference between an open source integer programming approach and a greedy heuristic, and find gains from optimization of up to 12%. We also model land availability for conservation action as a stochastic process and determine the decline in total utility compared to the globally optimal set using both solution algorithms. Our results are comparable to other studies illustrating the benefits of optimization for different conservation planning problems, and highlight the importance of maximizing the effectiveness of limited funding for conservation and natural resource management.

Resource allocation via sum-rate maximization in the uplink of multi-cell OFDMA networks

KAUST Repository

Tabassum, Hina; Alouini, Mohamed-Slim; Dawy, Zaher

2012-01-01

In this paper, we consider maximizing the sum rate in the uplink of a multi-cell orthogonal frequency-division multiple access network. The problem has a non-convex combinatorial structure and is known to be NP-hard. Because of the inherent

Risk measures on networks and expected utility

International Nuclear Information System (INIS)

Cerqueti, Roy; Lupi, Claudio

2016-01-01

In reliability theory projects are usually evaluated in terms of their riskiness, and often decision under risk is intended as the one-shot-type binary choice of accepting or not accepting the risk. In this paper we elaborate on the concept of risk acceptance, and propose a theoretical framework based on network theory. In doing this, we deal with system reliability, where the interconnections among the random quantities involved in the decision process are explicitly taken into account. Furthermore, we explore the conditions to be satisfied for risk-acceptance criteria to be consistent with the axiomatization of standard expected utility theory within the network framework. In accordance with existing literature, we show that a risk evaluation criterion can be meaningful even if it is not consistent with the standard axiomatization of expected utility, once this is suitably reinterpreted in the light of networks. Finally, we provide some illustrative examples. - Highlights: • We discuss risk acceptance and theoretically develop this theme on the basis of network theory. • We propose an original framework for describing the algebraic structure of the set of the networks, when they are viewed as risks. • We introduce the risk measures on networks, which induce total orders on the set of networks. • We state conditions on the risk measures on networks to let the induced risk-acceptance criterion be consistent with a new formulation of the expected utility theory.

FUSE: a profit maximization approach for functional summarization of biological networks.

Science.gov (United States)

Seah, Boon-Siew; Bhowmick, Sourav S; Dewey, C Forbes; Yu, Hanry

2012-03-21

The availability of large-scale curated protein interaction datasets has given rise to the opportunity to investigate higher level organization and modularity within the protein interaction network (PPI) using graph theoretic analysis. Despite the recent progress, systems level analysis of PPIS remains a daunting task as it is challenging to make sense out of the deluge of high-dimensional interaction data. Specifically, techniques that automatically abstract and summarize PPIS at multiple resolutions to provide high level views of its functional landscape are still lacking. We present a novel data-driven and generic algorithm called FUSE (Functional Summary Generator) that generates functional maps of a PPI at different levels of organization, from broad process-process level interactions to in-depth complex-complex level interactions, through a pro t maximization approach that exploits Minimum Description Length (MDL) principle to maximize information gain of the summary graph while satisfying the level of detail constraint. We evaluate the performance of FUSE on several real-world PPIS. We also compare FUSE to state-of-the-art graph clustering methods with GO term enrichment by constructing the biological process landscape of the PPIS. Using AD network as our case study, we further demonstrate the ability of FUSE to quickly summarize the network and identify many different processes and complexes that regulate it. Finally, we study the higher-order connectivity of the human PPI. By simultaneously evaluating interaction and annotation data, FUSE abstracts higher-order interaction maps by reducing the details of the underlying PPI to form a functional summary graph of interconnected functional clusters. Our results demonstrate its effectiveness and superiority over state-of-the-art graph clustering methods with GO term enrichment.

Lifetime Maximization via Hole Alleviation in IoT Enabling Heterogeneous Wireless Sensor Networks.

Science.gov (United States)

Wadud, Zahid; Javaid, Nadeem; Khan, Muhammad Awais; Alrajeh, Nabil; Alabed, Mohamad Souheil; Guizani, Nadra

2017-07-21

In Internet of Things (IoT) enabled Wireless Sensor Networks (WSNs), there are two major factors which degrade the performance of the network. One is the void hole which occurs in a particular region due to unavailability of forwarder nodes. The other is the presence of energy hole which occurs due to imbalanced data traffic load on intermediate nodes. Therefore, an optimum transmission strategy is required to maximize the network lifespan via hole alleviation. In this regard, we propose a heterogeneous network solution that is capable to balance energy dissipation among network nodes. In addition, the divide and conquer approach is exploited to evenly distribute number of transmissions over various network areas. An efficient forwarder node selection is performed to alleviate coverage and energy holes. Linear optimization is performed to validate the effectiveness of our proposed work in term of energy minimization. Furthermore, simulations are conducted to show that our claims are well grounded. Results show the superiority of our work as compared to the baseline scheme in terms of energy consumption and network lifetime.

Addressing practical challenges in utility optimization of mobile wireless sensor networks

Science.gov (United States)

Eswaran, Sharanya; Misra, Archan; La Porta, Thomas; Leung, Kin

2008-04-01

This paper examines the practical challenges in the application of the distributed network utility maximization (NUM) framework to the problem of resource allocation and sensor device adaptation in a mission-centric wireless sensor network (WSN) environment. By providing rich (multi-modal), real-time information about a variety of (often inaccessible or hostile) operating environments, sensors such as video, acoustic and short-aperture radar enhance the situational awareness of many battlefield missions. Prior work on the applicability of the NUM framework to mission-centric WSNs has focused on tackling the challenges introduced by i) the definition of an individual mission's utility as a collective function of multiple sensor flows and ii) the dissemination of an individual sensor's data via a multicast tree to multiple consuming missions. However, the practical application and performance of this framework is influenced by several parameters internal to the framework and also by implementation-specific decisions. This is made further complex due to mobile nodes. In this paper, we use discrete-event simulations to study the effects of these parameters on the performance of the protocol in terms of speed of convergence, packet loss, and signaling overhead thereby addressing the challenges posed by wireless interference and node mobility in ad-hoc battlefield scenarios. This study provides better understanding of the issues involved in the practical adaptation of the NUM framework. It also helps identify potential avenues of improvement within the framework and protocol.

FUSE: a profit maximization approach for functional summarization of biological networks

Directory of Open Access Journals (Sweden)

Seah Boon-Siew

2012-03-01

Full Text Available Abstract Background The availability of large-scale curated protein interaction datasets has given rise to the opportunity to investigate higher level organization and modularity within the protein interaction network (PPI using graph theoretic analysis. Despite the recent progress, systems level analysis of PPIS remains a daunting task as it is challenging to make sense out of the deluge of high-dimensional interaction data. Specifically, techniques that automatically abstract and summarize PPIS at multiple resolutions to provide high level views of its functional landscape are still lacking. We present a novel data-driven and generic algorithm called FUSE (Functional Summary Generator that generates functional maps of a PPI at different levels of organization, from broad process-process level interactions to in-depth complex-complex level interactions, through a pro t maximization approach that exploits Minimum Description Length (MDL principle to maximize information gain of the summary graph while satisfying the level of detail constraint. Results We evaluate the performance of FUSE on several real-world PPIS. We also compare FUSE to state-of-the-art graph clustering methods with GO term enrichment by constructing the biological process landscape of the PPIS. Using AD network as our case study, we further demonstrate the ability of FUSE to quickly summarize the network and identify many different processes and complexes that regulate it. Finally, we study the higher-order connectivity of the human PPI. Conclusion By simultaneously evaluating interaction and annotation data, FUSE abstracts higher-order interaction maps by reducing the details of the underlying PPI to form a functional summary graph of interconnected functional clusters. Our results demonstrate its effectiveness and superiority over state-of-the-art graph clustering methods with GO term enrichment.

A new scheme for maximizing the lifetime of heterogeneous wireless sensor networks

OpenAIRE

Aldaihani, Reem; AboElFotoh, Hosam

2016-01-01

Heterogeneous wireless sensor network consists of wireless sensor nodes with different abilities, such as different computing power and different initial energy. We present in this paper a new scheme for maximizing heterogeneous WSN lifetime. The proposed scheme employs two types of sensor nodes that are named (consistent with IEEE 802.15.4 standard) Full Function Device (FFD) and Reduced Function Device (RFD). The FFDs are the expensive sensor nodes with high power and computational capabili...

Sum rate maximization in the uplink of multi-cell OFDMA networks

KAUST Repository

Tabassum, Hina

2012-10-03

Resource allocation in orthogonal frequency division multiple access (OFDMA) networks plays an imperative role to guarantee the system performance. However, most of the known resource allocation schemes are focused on maximizing the local throughput of each cell, while ignoring the significant effect of inter-cell interference. This paper investigates the problem of resource allocation (i.e., subcarriers and powers) in the uplink of a multi-cell OFDMA network. The problem has a non-convex combinatorial structure and is known to be NP hard. Firstly, we investigate the upper and lower bounds to the average network throughput due to the inherent complexity of implementing the optimal solution. Later, a centralized sub-optimal resource allocation scheme is developed. We further develop less complex centralized and distributed schemes that are well-suited for practical scenarios. The computational complexity of all schemes has been analyzed and the performance is compared through numerical simulations. Simulation results demonstrate that the distributed scheme achieves comparable performance to the centralized resource allocation scheme in various scenarios. © 2011 IEEE.

Utility applications and broadband networks

Energy Technology Data Exchange (ETDEWEB)

Chebra, R.; Taylor, P.

2003-02-01

A detailed analytical model of a cable network that would be capable of providing utilities with such services as automatic meter reading, on-line ability to remotely connect and disconnect commodity service, outage notification, tamper detection, direct utility-initiated load control, indirect user prescribed load control, and user access to energy consumption information, is described. The paper provides an overview of of the zones of focus that must be addressed -- market assessment, competitive analysis, product identification, economic model development, assessment of skill set requirements, performance monitoring and tracking, and various technical issues -- to identify any gaps in the organisation's ability to fully develop such a plan. Developers of the model field tested it in 1995 using some benchmarks that were available at that time, and found that the benefit afforded by direct labor saving was not sufficient to cover the capital expenditure of the advanced utility gateway connected to the cable network. However, since 1995 the unanticipated shift in the derived consumer value from a host of cable-based communications services has rendered these original projections irrelevant. Since national communications organizations concentrate on 'tier one' or at best 'tier two' cities (roughly corresponding to the NFL franchise cities and baseball farm team cities), the uncovered rural and suburban areas of the country create a significant digital divide within the population. The developers of the model contend that these unserviced areas provide utilities, especially municipal utilities, with an excellent opportunity to step into the gap and provide a full range of services that includes water, electricity and communications. The proposed model provides the foundation for utilities upon which to base their ultimate implementation decisions.

A Complex Network Model for Analyzing Railway Accidents Based on the Maximal Information Coefficient

International Nuclear Information System (INIS)

Shao Fu-Bo; Li Ke-Ping

2016-01-01

It is an important issue to identify important influencing factors in railway accident analysis. In this paper, employing the good measure of dependence for two-variable relationships, the maximal information coefficient (MIC), which can capture a wide range of associations, a complex network model for railway accident analysis is designed in which nodes denote factors of railway accidents and edges are generated between two factors of which MIC values are larger than or equal to the dependent criterion. The variety of network structure is studied. As the increasing of the dependent criterion, the network becomes to an approximate scale-free network. Moreover, employing the proposed network, important influencing factors are identified. And we find that the annual track density-gross tonnage factor is an important factor which is a cut vertex when the dependent criterion is equal to 0.3. From the network, it is found that the railway development is unbalanced for different states which is consistent with the fact. (paper)

Throughput Maximization for Cognitive Radio Networks Using Active Cooperation and Superposition Coding

KAUST Repository

Hamza, Doha R.

2015-02-13

We propose a three-message superposition coding scheme in a cognitive radio relay network exploiting active cooperation between primary and secondary users. The primary user is motivated to cooperate by substantial benefits it can reap from this access scenario. Specifically, the time resource is split into three transmission phases: The first two phases are dedicated to primary communication, while the third phase is for the secondary’s transmission. We formulate two throughput maximization problems for the secondary network subject to primary user rate constraints and per-node power constraints with respect to the time durations of primary transmission and the transmit power of the primary and the secondary users. The first throughput maximization problem assumes a partial power constraint such that the secondary power dedicated to primary cooperation, i.e. for the first two communication phases, is fixed apriori. In the second throughput maximization problem, a total power constraint is assumed over the three phases of communication. The two problems are difficult to solve analytically when the relaying channel gains are strictly greater than each other and strictly greater than the direct link channel gain. However, mathematically tractable lowerbound and upperbound solutions can be attained for the two problems. For both problems, by only using the lowerbound solution, we demonstrate significant throughput gains for both the primary and the secondary users through this active cooperation scheme. We find that most of the throughput gains come from minimizing the second phase transmission time since the secondary nodes assist the primary communication during this phase. Finally, we demonstrate the superiority of our proposed scheme compared to a number of reference schemes that include best relay selection, dual-hop routing, and an interference channel model.

Throughput Maximization for Cognitive Radio Networks Using Active Cooperation and Superposition Coding

KAUST Repository

Hamza, Doha R.; Park, Kihong; Alouini, Mohamed-Slim; Aissa, Sonia

2015-01-01

We propose a three-message superposition coding scheme in a cognitive radio relay network exploiting active cooperation between primary and secondary users. The primary user is motivated to cooperate by substantial benefits it can reap from this access scenario. Specifically, the time resource is split into three transmission phases: The first two phases are dedicated to primary communication, while the third phase is for the secondary’s transmission. We formulate two throughput maximization problems for the secondary network subject to primary user rate constraints and per-node power constraints with respect to the time durations of primary transmission and the transmit power of the primary and the secondary users. The first throughput maximization problem assumes a partial power constraint such that the secondary power dedicated to primary cooperation, i.e. for the first two communication phases, is fixed apriori. In the second throughput maximization problem, a total power constraint is assumed over the three phases of communication. The two problems are difficult to solve analytically when the relaying channel gains are strictly greater than each other and strictly greater than the direct link channel gain. However, mathematically tractable lowerbound and upperbound solutions can be attained for the two problems. For both problems, by only using the lowerbound solution, we demonstrate significant throughput gains for both the primary and the secondary users through this active cooperation scheme. We find that most of the throughput gains come from minimizing the second phase transmission time since the secondary nodes assist the primary communication during this phase. Finally, we demonstrate the superiority of our proposed scheme compared to a number of reference schemes that include best relay selection, dual-hop routing, and an interference channel model.

A Multi-Hop Energy Neutral Clustering Algorithm for Maximizing Network Information Gathering in Energy Harvesting Wireless Sensor Networks.

Science.gov (United States)

Yang, Liu; Lu, Yinzhi; Zhong, Yuanchang; Wu, Xuegang; Yang, Simon X

2015-12-26

Energy resource limitation is a severe problem in traditional wireless sensor networks (WSNs) because it restricts the lifetime of network. Recently, the emergence of energy harvesting techniques has brought with them the expectation to overcome this problem. In particular, it is possible for a sensor node with energy harvesting abilities to work perpetually in an Energy Neutral state. In this paper, a Multi-hop Energy Neutral Clustering (MENC) algorithm is proposed to construct the optimal multi-hop clustering architecture in energy harvesting WSNs, with the goal of achieving perpetual network operation. All cluster heads (CHs) in the network act as routers to transmit data to base station (BS) cooperatively by a multi-hop communication method. In addition, by analyzing the energy consumption of intra- and inter-cluster data transmission, we give the energy neutrality constraints. Under these constraints, every sensor node can work in an energy neutral state, which in turn provides perpetual network operation. Furthermore, the minimum network data transmission cycle is mathematically derived using convex optimization techniques while the network information gathering is maximal. Simulation results show that our protocol can achieve perpetual network operation, so that the consistent data delivery is guaranteed. In addition, substantial improvements on the performance of network throughput are also achieved as compared to the famous traditional clustering protocol LEACH and recent energy harvesting aware clustering protocols.

A Multi-Hop Energy Neutral Clustering Algorithm for Maximizing Network Information Gathering in Energy Harvesting Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Liu Yang

2015-12-01

Full Text Available Energy resource limitation is a severe problem in traditional wireless sensor networks (WSNs because it restricts the lifetime of network. Recently, the emergence of energy harvesting techniques has brought with them the expectation to overcome this problem. In particular, it is possible for a sensor node with energy harvesting abilities to work perpetually in an Energy Neutral state. In this paper, a Multi-hop Energy Neutral Clustering (MENC algorithm is proposed to construct the optimal multi-hop clustering architecture in energy harvesting WSNs, with the goal of achieving perpetual network operation. All cluster heads (CHs in the network act as routers to transmit data to base station (BS cooperatively by a multi-hop communication method. In addition, by analyzing the energy consumption of intra- and inter-cluster data transmission, we give the energy neutrality constraints. Under these constraints, every sensor node can work in an energy neutral state, which in turn provides perpetual network operation. Furthermore, the minimum network data transmission cycle is mathematically derived using convex optimization techniques while the network information gathering is maximal. Simulation results show that our protocol can achieve perpetual network operation, so that the consistent data delivery is guaranteed. In addition, substantial improvements on the performance of network throughput are also achieved as compared to the famous traditional clustering protocol LEACH and recent energy harvesting aware clustering protocols.

Maximal planar networks with large clustering coefficient and power-law degree distribution

International Nuclear Information System (INIS)

Zhou Tao; Yan Gang; Wang Binghong

2005-01-01

In this article, we propose a simple rule that generates scale-free networks with very large clustering coefficient and very small average distance. These networks are called random Apollonian networks (RANs) as they can be considered as a variation of Apollonian networks. We obtain the analytic results of power-law exponent γ=3 and clustering coefficient C=(46/3)-36 ln (3/2)≅0.74, which agree with the simulation results very well. We prove that the increasing tendency of average distance of RANs is a little slower than the logarithm of the number of nodes in RANs. Since most real-life networks are both scale-free and small-world networks, RANs may perform well in mimicking the reality. The RANs possess hierarchical structure as C(k)∼k -1 that are in accord with the observations of many real-life networks. In addition, we prove that RANs are maximal planar networks, which are of particular practicability for layout of printed circuits and so on. The percolation and epidemic spreading process are also studied and the comparisons between RANs and Barabasi-Albert (BA) as well as Newman-Watts (NW) networks are shown. We find that, when the network order N (the total number of nodes) is relatively small (as N∼10 4 ), the performance of RANs under intentional attack is not sensitive to N, while that of BA networks is much affected by N. And the diseases spread slower in RANs than BA networks in the early stage of the suseptible-infected process, indicating that the large clustering coefficient may slow the spreading velocity, especially in the outbreaks

Maintenance Management in Network Utilities Framework and Practical Implementation

CERN Document Server

Gómez Fernández, Juan F

2012-01-01

In order to satisfy the needs of their customers, network utilities require specially developed maintenance management capabilities. Maintenance Management information systems are essential to ensure control, gain knowledge and improve-decision making in companies dealing with network infrastructure, such as distribution of gas, water, electricity and telecommunications. Maintenance Management in Network Utilities studies specified characteristics of maintenance management in this sector to offer a practical approach to defining and implementing  the best management practices and suitable frameworks.   Divided into three major sections, Maintenance Management in Network Utilities defines a series of stages which can be followed to manage maintenance frameworks properly. Different case studies provide detailed descriptions which illustrate the experience in real company situations. An introduction to the concepts is followed by main sections including: • A Literature Review: covering the basic concepts an...

On Maximizing the Lifetime of Wireless Sensor Networks by Optimally Assigning Energy Supplies

Science.gov (United States)

Asorey-Cacheda, Rafael; García-Sánchez, Antonio Javier; García-Sánchez, Felipe; García-Haro, Joan; Gonzalez-Castaño, Francisco Javier

2013-01-01

The extension of the network lifetime of Wireless Sensor Networks (WSN) is an important issue that has not been appropriately solved yet. This paper addresses this concern and proposes some techniques to plan an arbitrary WSN. To this end, we suggest a hierarchical network architecture, similar to realistic scenarios, where nodes with renewable energy sources (denoted as primary nodes) carry out most message delivery tasks, and nodes equipped with conventional chemical batteries (denoted as secondary nodes) are those with less communication demands. The key design issue of this network architecture is the development of a new optimization framework to calculate the optimal assignment of renewable energy supplies (primary node assignment) to maximize network lifetime, obtaining the minimum number of energy supplies and their node assignment. We also conduct a second optimization step to additionally minimize the number of packet hops between the source and the sink. In this work, we present an algorithm that approaches the results of the optimization framework, but with much faster execution speed, which is a good alternative for large-scale WSN networks. Finally, the network model, the optimization process and the designed algorithm are further evaluated and validated by means of computer simulation under realistic conditions. The results obtained are discussed comparatively. PMID:23939582

On Maximizing the Lifetime of Wireless Sensor Networks by Optimally Assigning Energy Supplies

Directory of Open Access Journals (Sweden)

Francisco Javier González-Castano

2013-08-01

Full Text Available The extension of the network lifetime of Wireless Sensor Networks (WSN is an important issue that has not been appropriately solved yet. This paper addresses this concern and proposes some techniques to plan an arbitrary WSN. To this end, we suggest a hierarchical network architecture, similar to realistic scenarios, where nodes with renewable energy sources (denoted as primary nodes carry out most message delivery tasks, and nodes equipped with conventional chemical batteries (denoted as secondary nodes are those with less communication demands. The key design issue of this network architecture is the development of a new optimization framework to calculate the optimal assignment of renewable energy supplies (primary node assignment to maximize network lifetime, obtaining the minimum number of energy supplies and their node assignment. We also conduct a second optimization step to additionally minimize the number of packet hops between the source and the sink. In this work, we present an algorithm that approaches the results of the optimization framework, but with much faster execution speed, which is a good alternative for large-scale WSN networks. Finally, the network model, the optimization process and the designed algorithm are further evaluated and validated by means of computer simulation under realistic conditions. The results obtained are discussed comparatively.

Influencing Busy People in a Social Network.

Science.gov (United States)

Sarkar, Kaushik; Sundaram, Hari

2016-01-01

We identify influential early adopters in a social network, where individuals are resource constrained, to maximize the spread of multiple, costly behaviors. A solution to this problem is especially important for viral marketing. The problem of maximizing influence in a social network is challenging since it is computationally intractable. We make three contributions. First, we propose a new model of collective behavior that incorporates individual intent, knowledge of neighbors actions and resource constraints. Second, we show that the multiple behavior influence maximization is NP-hard. Furthermore, we show that the problem is submodular, implying the existence of a greedy solution that approximates the optimal solution to within a constant. However, since the greedy algorithm is expensive for large networks, we propose efficient heuristics to identify the influential individuals, including heuristics to assign behaviors to the different early adopters. We test our approach on synthetic and real-world topologies with excellent results. We evaluate the effectiveness under three metrics: unique number of participants, total number of active behaviors and network resource utilization. Our heuristics produce 15-51% increase in expected resource utilization over the naïve approach.

Influencing Busy People in a Social Network

Science.gov (United States)

Sarkar, Kaushik; Sundaram, Hari

2016-01-01

We identify influential early adopters in a social network, where individuals are resource constrained, to maximize the spread of multiple, costly behaviors. A solution to this problem is especially important for viral marketing. The problem of maximizing influence in a social network is challenging since it is computationally intractable. We make three contributions. First, we propose a new model of collective behavior that incorporates individual intent, knowledge of neighbors actions and resource constraints. Second, we show that the multiple behavior influence maximization is NP-hard. Furthermore, we show that the problem is submodular, implying the existence of a greedy solution that approximates the optimal solution to within a constant. However, since the greedy algorithm is expensive for large networks, we propose efficient heuristics to identify the influential individuals, including heuristics to assign behaviors to the different early adopters. We test our approach on synthetic and real-world topologies with excellent results. We evaluate the effectiveness under three metrics: unique number of participants, total number of active behaviors and network resource utilization. Our heuristics produce 15-51% increase in expected resource utilization over the naïve approach. PMID:27711127

Efficient Conservation in a Utility-Maximization Framework

Directory of Open Access Journals (Sweden)

Frank W. Davis

2006-06-01

Full Text Available Systematic planning for biodiversity conservation is being conducted at scales ranging from global to national to regional. The prevailing planning paradigm is to identify the minimum land allocations needed to reach specified conservation targets or maximize the amount of conservation accomplished under an area or budget constraint. We propose a more general formulation for setting conservation priorities that involves goal setting, assessing the current conservation system, developing a scenario of future biodiversity given the current conservation system, and allocating available conservation funds to alter that scenario so as to maximize future biodiversity. Under this new formulation for setting conservation priorities, the value of a site depends on resource quality, threats to resource quality, and costs. This planning approach is designed to support collaborative processes and negotiation among competing interest groups. We demonstrate these ideas with a case study of the Sierra Nevada bioregion of California.

Simulation-Optimization Framework for Synthesis and Design of Natural Gas Downstream Utilization Networks

Directory of Open Access Journals (Sweden)

Saad A. Al-Sobhi

2018-02-01

Full Text Available Many potential diversification and conversion options are available for utilization of natural gas resources, and several design configurations and technology choices exist for conversion of natural gas to value-added products. Therefore, a detailed mathematical model is desirable for selection of optimal configuration and operating mode among the various options available. In this study, we present a simulation-optimization framework for the optimal selection of economic and environmentally sustainable pathways for natural gas downstream utilization networks by optimizing process design and operational decisions. The main processes (e.g., LNG, GTL, and methanol production, along with different design alternatives in terms of flow-sheeting for each main processing unit (namely syngas preparation, liquefaction, N2 rejection, hydrogen, FT synthesis, methanol synthesis, FT upgrade, and methanol upgrade units, are used for superstructure development. These processes are simulated using ASPEN Plus V7.3 to determine the yields of different processing units under various operating modes. The model has been applied to maximize total profit of the natural gas utilization system with penalties for environmental impact, represented by CO2eq emission obtained using ASPEN Plus for each flowsheet configuration and operating mode options. The performance of the proposed modeling framework is demonstrated using a case study.

Network governance in electricity distribution: Public utility or commodity

International Nuclear Information System (INIS)

Kuenneke, Rolf; Fens, Theo

2005-01-01

This paper addresses the question whether the operation and management of electricity distribution networks in a liberalized market environment evolves into a market driven commodity business or might be perceived as a genuine public utility task. A framework is developed to classify and compare different institutional arrangements according to the public utility model and the commodity model. These models are exemplified for the case of the Dutch electricity sector. It appears that the institutional organization of electricity distribution networks is at the crossroads of two very different institutional development paths. They develop towards commercial business if the system characteristics of the electricity sector remain basically unchanged to the traditional situation. If however innovative technological developments allow for a decentralization and decomposition of the electricity system, distribution networks might be operated as public utilities while other energy services are exploited commercially. (Author)

Robust Utility Maximization Under Convex Portfolio Constraints

International Nuclear Information System (INIS)

Matoussi, Anis; Mezghani, Hanen; Mnif, Mohamed

2015-01-01

We study a robust maximization problem from terminal wealth and consumption under a convex constraints on the portfolio. We state the existence and the uniqueness of the consumption–investment strategy by studying the associated quadratic backward stochastic differential equation. We characterize the optimal control by using the duality method and deriving a dynamic maximum principle

Bandwidth efficient cluster-based data aggregation for Wireless Sensor Network

DEFF Research Database (Denmark)

Dnyaneshwar, Mantri; Prasad, Neeli R.; Prasad, Ramjee

2015-01-01

A fundamental challenge in the design of Wireless Sensor Network (WSNs) is the proper utilization of resources that are scarce. The critical challenge is to maximize the bandwidth utilization in data gathering and forwarding from sensor nodes to the sink. The main design objective is to utilize...

Maximal qubit violation of n-locality inequalities in a star-shaped quantum network

Science.gov (United States)

Andreoli, Francesco; Carvacho, Gonzalo; Santodonato, Luca; Chaves, Rafael; Sciarrino, Fabio

2017-11-01

Bell's theorem was a cornerstone for our understanding of quantum theory and the establishment of Bell non-locality played a crucial role in the development of quantum information. Recently, its extension to complex networks has been attracting growing attention, but a deep characterization of quantum behavior is still missing for this novel context. In this work we analyze quantum correlations arising in the bilocality scenario, that is a tripartite quantum network where the correlations between the parties are mediated by two independent sources of states. First, we prove that non-bilocal correlations witnessed through a Bell-state measurement in the central node of the network form a subset of those obtainable by means of a local projective measurement. This leads us to derive the maximal violation of the bilocality inequality that can be achieved by arbitrary two-qubit quantum states and arbitrary local projective measurements. We then analyze in details the relation between the violation of the bilocality inequality and the CHSH inequality. Finally, we show how our method can be extended to the n-locality scenario consisting of n two-qubit quantum states distributed among n+1 nodes of a star-shaped network.

Unified Model for Generation Complex Networks with Utility Preferential Attachment

International Nuclear Information System (INIS)

Wu Jianjun; Gao Ziyou; Sun Huijun

2006-01-01

In this paper, based on the utility preferential attachment, we propose a new unified model to generate different network topologies such as scale-free, small-world and random networks. Moreover, a new network structure named super scale network is found, which has monopoly characteristic in our simulation experiments. Finally, the characteristics of this new network are given.

Temperature dependence of the multistability of lactose utilization network of Escherichia coli

Science.gov (United States)

Nepal, Sudip; Kumar, Pradeep

Biological systems are capable of producing multiple states out of a single set of inputs. Multistability acts like a biological switch that allows organisms to respond differently to different environmental conditions and hence plays an important role in adaptation to changing environment. One of the widely studied gene regulatory networks underlying the metabolism of bacteria is the lactose utilization network, which exhibits a multistable behavior as a function of lactose concentration. We have studied the effect of temperature on multistability of the lactose utilization network at various concentrations of thio-methylgalactoside (TMG), a synthetic lactose. We find that while the lactose utilization network exhibits a bistable behavior for temperature T >20° C , a graded response arises for temperature T lactose utilization network as a function of temperature and TMG concentration. Our results suggest that environmental conditions, in this case temperature, can alter the nature of cellular regulation of metabolism.

Transcriptional regulation of the carbohydrate utilization network in Thermotoga maritima

Directory of Open Access Journals (Sweden)

Dmitry A Rodionov

2013-08-01

Full Text Available Hyperthermophilic bacteria from the Thermotogales lineage can produce hydrogen by fermenting a wide range of carbohydrates. Previous experimental studies identified a large fraction of genes committed to carbohydrate degradation and utilization in the model bacterium Thermotoga maritima. Knowledge of these genes enabled comprehensive reconstruction of biochemical pathways comprising the carbohydrate utilization network. However, transcriptional factors (TFs and regulatory mechanisms driving this network remained largely unknown. Here, we used an integrated approach based on comparative analysis of genomic and transcriptomic data for the reconstruction of the carbohydrate utilization regulatory networks in 11 Thermotogales genomes. We identified DNA-binding motifs and regulons for 19 orthologous TFs in the Thermotogales. The inferred regulatory network in T. maritima contains 181 genes encoding TFs, sugar catabolic enzymes and ABC-family transporters. In contrast to many previously described bacteria, a transcriptional regulation strategy of Thermotoga does not employ global regulatory factors. The reconstructed regulatory network in T. maritima was validated by gene expression profiling on a panel of mono- and disaccharides and by in vitro DNA-binding assays. The observed upregulation of genes involved in catabolism of pectin, trehalose, cellobiose, arabinose, rhamnose, xylose, glucose, galactose, and ribose showed a strong correlation with the UxaR, TreR, BglR, CelR, AraR, RhaR, XylR, GluR, GalR, and RbsR regulons. Ultimately, this study elucidated the transcriptional regulatory network and mechanisms controlling expression of carbohydrate utilization genes in T. maritima. In addition to improving the functional annotations of associated transporters and catabolic enzymes, this research provides novel insights into the evolution of regulatory networks in Thermotogales.

Consumer preferences for alternative fuel vehicles: Comparing a utility maximization and a regret minimization model

International Nuclear Information System (INIS)

Chorus, Caspar G.; Koetse, Mark J.; Hoen, Anco

2013-01-01

This paper presents a utility-based and a regret-based model of consumer preferences for alternative fuel vehicles, based on a large-scale stated choice-experiment held among company car leasers in The Netherlands. Estimation and application of random utility maximization and random regret minimization discrete choice models shows that while the two models achieve almost identical fit with the data and differ only marginally in terms of predictive ability, they generate rather different choice probability-simulations and policy implications. The most eye-catching difference between the two models is that the random regret minimization model accommodates a compromise-effect, as it assigns relatively high choice probabilities to alternative fuel vehicles that perform reasonably well on each dimension instead of having a strong performance on some dimensions and a poor performance on others. - Highlights: • Utility- and regret-based models of preferences for alternative fuel vehicles. • Estimation based on stated choice-experiment among Dutch company car leasers. • Models generate rather different choice probabilities and policy implications. • Regret-based model accommodates a compromise-effect

VIRTUAL SOCIAL NETWORKS AND THEIR UTILIZATION FOR PROMOTION

OpenAIRE

Robert Stefko; Peter Dorcak; Frantisek Pollak

2011-01-01

The article deals with current knowledge of social media with the focus on social networks. Social media offer great opportunities for businesses. However, in order to use these new business channels in the most effective way, businesses need relevant information. The main purpose of this article is to evaluate the state of utilization of social networks by businesses as well as home and foreign customers. The aim is also to point out on the importance of networking as a tool for acquiring an...

An Optical Multicast Routing with Minimal Network Coding Operations in WDM Networks

Directory of Open Access Journals (Sweden)

Huanlin Liu

2014-01-01

Full Text Available Network coding can improve the optical multicast routing performance in terms of network throughput, bandwidth utilization, and traffic load balance. But network coding needs high encoding operations costs in all-optical WDM networks due to shortage of optical RAM. In the paper, the network coding operation is defined to evaluate the number of network coding operation cost in the paper. An optical multicast routing algorithm based on minimal number of network coding operations is proposed to improve the multicast capacity. Two heuristic criteria are designed to establish the multicast routing with low network coding cost and high multicast capacity. One is to select one path from the former K shortest paths with the least probability of dropping the multicast maximal capacity. The other is to select the path with lowest potential coding operations with the highest link shared degree among the multiple wavelength disjoint paths cluster from source to each destination. Comparing with the other multicast routing based on network coding, simulation results show that the proposed multicast routing algorithm can effectively reduce the times of network coding operations, can improve the probability of reaching multicast maximal capacity, and can keep the less multicast routing link cost for optical WDM networks.

A Gap-Filling Procedure for Hydrologic Data Based on Kalman Filtering and Expectation Maximization: Application to Data from the Wireless Sensor Networks of the Sierra Nevada

Science.gov (United States)

Coogan, A.; Avanzi, F.; Akella, R.; Conklin, M. H.; Bales, R. C.; Glaser, S. D.

2017-12-01

Automatic meteorological and snow stations provide large amounts of information at dense temporal resolution, but data quality is often compromised by noise and missing values. We present a new gap-filling and cleaning procedure for networks of these stations based on Kalman filtering and expectation maximization. Our method utilizes a multi-sensor, regime-switching Kalman filter to learn a latent process that captures dependencies between nearby stations and handles sharp changes in snowfall rate. Since the latent process is inferred using observations across working stations in the network, it can be used to fill in large data gaps for a malfunctioning station. The procedure was tested on meteorological and snow data from Wireless Sensor Networks (WSN) in the American River basin of the Sierra Nevada. Data include air temperature, relative humidity, and snow depth from dense networks of 10 to 12 stations within 1 km2 swaths. Both wet and dry water years have similar data issues. Data with artificially created gaps was used to quantify the method's performance. Our multi-sensor approach performs better than a single-sensor one, especially with large data gaps, as it learns and exploits the dominant underlying processes in snowpack at each site.

Learning curves for mutual information maximization

International Nuclear Information System (INIS)

Urbanczik, R.

2003-01-01

An unsupervised learning procedure based on maximizing the mutual information between the outputs of two networks receiving different but statistically dependent inputs is analyzed [S. Becker and G. Hinton, Nature (London) 355, 161 (1992)]. For a generic data model, I show that in the large sample limit the structure in the data is recognized by mutual information maximization. For a more restricted model, where the networks are similar to perceptrons, I calculate the learning curves for zero-temperature Gibbs learning. These show that convergence can be rather slow, and a way of regularizing the procedure is considered

Solving the influence maximization problem reveals regulatory organization of the yeast cell cycle.

Science.gov (United States)

Gibbs, David L; Shmulevich, Ilya

2017-06-01

The Influence Maximization Problem (IMP) aims to discover the set of nodes with the greatest influence on network dynamics. The problem has previously been applied in epidemiology and social network analysis. Here, we demonstrate the application to cell cycle regulatory network analysis for Saccharomyces cerevisiae. Fundamentally, gene regulation is linked to the flow of information. Therefore, our implementation of the IMP was framed as an information theoretic problem using network diffusion. Utilizing more than 26,000 regulatory edges from YeastMine, gene expression dynamics were encoded as edge weights using time lagged transfer entropy, a method for quantifying information transfer between variables. By picking a set of source nodes, a diffusion process covers a portion of the network. The size of the network cover relates to the influence of the source nodes. The set of nodes that maximizes influence is the solution to the IMP. By solving the IMP over different numbers of source nodes, an influence ranking on genes was produced. The influence ranking was compared to other metrics of network centrality. Although the top genes from each centrality ranking contained well-known cell cycle regulators, there was little agreement and no clear winner. However, it was found that influential genes tend to directly regulate or sit upstream of genes ranked by other centrality measures. The influential nodes act as critical sources of information flow, potentially having a large impact on the state of the network. Biological events that affect influential nodes and thereby affect information flow could have a strong effect on network dynamics, potentially leading to disease. Code and data can be found at: https://github.com/gibbsdavidl/miergolf.

Solving the influence maximization problem reveals regulatory organization of the yeast cell cycle

Science.gov (United States)

Shmulevich, Ilya

2017-01-01

The Influence Maximization Problem (IMP) aims to discover the set of nodes with the greatest influence on network dynamics. The problem has previously been applied in epidemiology and social network analysis. Here, we demonstrate the application to cell cycle regulatory network analysis for Saccharomyces cerevisiae. Fundamentally, gene regulation is linked to the flow of information. Therefore, our implementation of the IMP was framed as an information theoretic problem using network diffusion. Utilizing more than 26,000 regulatory edges from YeastMine, gene expression dynamics were encoded as edge weights using time lagged transfer entropy, a method for quantifying information transfer between variables. By picking a set of source nodes, a diffusion process covers a portion of the network. The size of the network cover relates to the influence of the source nodes. The set of nodes that maximizes influence is the solution to the IMP. By solving the IMP over different numbers of source nodes, an influence ranking on genes was produced. The influence ranking was compared to other metrics of network centrality. Although the top genes from each centrality ranking contained well-known cell cycle regulators, there was little agreement and no clear winner. However, it was found that influential genes tend to directly regulate or sit upstream of genes ranked by other centrality measures. The influential nodes act as critical sources of information flow, potentially having a large impact on the state of the network. Biological events that affect influential nodes and thereby affect information flow could have a strong effect on network dynamics, potentially leading to disease. Code and data can be found at: https://github.com/gibbsdavidl/miergolf. PMID:28628618

Solving the influence maximization problem reveals regulatory organization of the yeast cell cycle.

Directory of Open Access Journals (Sweden)

David L Gibbs

2017-06-01

Full Text Available The Influence Maximization Problem (IMP aims to discover the set of nodes with the greatest influence on network dynamics. The problem has previously been applied in epidemiology and social network analysis. Here, we demonstrate the application to cell cycle regulatory network analysis for Saccharomyces cerevisiae. Fundamentally, gene regulation is linked to the flow of information. Therefore, our implementation of the IMP was framed as an information theoretic problem using network diffusion. Utilizing more than 26,000 regulatory edges from YeastMine, gene expression dynamics were encoded as edge weights using time lagged transfer entropy, a method for quantifying information transfer between variables. By picking a set of source nodes, a diffusion process covers a portion of the network. The size of the network cover relates to the influence of the source nodes. The set of nodes that maximizes influence is the solution to the IMP. By solving the IMP over different numbers of source nodes, an influence ranking on genes was produced. The influence ranking was compared to other metrics of network centrality. Although the top genes from each centrality ranking contained well-known cell cycle regulators, there was little agreement and no clear winner. However, it was found that influential genes tend to directly regulate or sit upstream of genes ranked by other centrality measures. The influential nodes act as critical sources of information flow, potentially having a large impact on the state of the network. Biological events that affect influential nodes and thereby affect information flow could have a strong effect on network dynamics, potentially leading to disease. Code and data can be found at: https://github.com/gibbsdavidl/miergolf.

Investigation on network utilization efficiency and image transmission time for the PACS network

International Nuclear Information System (INIS)

Tawara, K.; Nishihara, E.; Komatsu, K.I.

1987-01-01

The authors investigated the following features of a PACS network: (1) network utilization efficiency and (2) image transmission time. They changed the following parameters, which the two items shown above depend on: (1) transfer rate between imaging equipment and network (10 kB/econd-8 MB/second), (2) network transmission speed (100 kB/second-50 MB/second), (3) packet length (10 kB-4 MB), and (4) message length (image data) (64 kB-4 MB). As a result, a conventional-type network cannot meet a need for PACS. To solve this problem, the authors propose a multiplexed network that consists of the high-speed network for image transmission and the conventional speed of control network for commands and shorter messages. If the packet length of the image network is designed to be variable, they can choose an optimum packet length for image transmission

Inclusive Fitness Maximization:An Axiomatic Approach

OpenAIRE

Okasha, Samir; Weymark, John; Bossert, Walter

2014-01-01

Kin selection theorists argue that evolution in social contexts will lead organisms to behave as if maximizing their inclusive, as opposed to personal, fitness. The inclusive fitness concept allows biologists to treat organisms as akin to rational agents seeking to maximize a utility function. Here we develop this idea and place it on a firm footing by employing a standard decision-theoretic methodology. We show how the principle of inclusive fitness maximization and a related principle of qu...

Analysis of a utility-interactive wind-photovoltaic hybrid system with battery storage using neural network

Science.gov (United States)

Giraud, Francois

1999-10-01

This dissertation investigates the application of neural network theory to the analysis of a 4-kW Utility-interactive Wind-Photovoltaic System (WPS) with battery storage. The hybrid system comprises a 2.5-kW photovoltaic generator and a 1.5-kW wind turbine. The wind power generator produces power at variable speed and variable frequency (VSVF). The wind energy is converted into dc power by a controlled, tree-phase, full-wave, bridge rectifier. The PV power is maximized by a Maximum Power Point Tracker (MPPT), a dc-to-dc chopper, switching at a frequency of 45 kHz. The whole dc power of both subsystems is stored in the battery bank or conditioned by a single-phase self-commutated inverter to be sold to the utility at a predetermined amount. First, the PV is modeled using Artificial Neural Network (ANN). To reduce model uncertainty, the open-circuit voltage VOC and the short-circuit current ISC of the PV are chosen as model input variables of the ANN. These input variables have the advantage of incorporating the effects of the quantifiable and non-quantifiable environmental variants affecting the PV power. Then, a simplified way to predict accurately the dynamic responses of the grid-linked WPS to gusty winds using a Recurrent Neural Network (RNN) is investigated. The RNN is a single-output feedforward backpropagation network with external feedback, which allows past responses to be fed back to the network input. In the third step, a Radial Basis Functions (RBF) Network is used to analyze the effects of clouds on the Utility-Interactive WPS. Using the irradiance as input signal, the network models the effects of random cloud movement on the output current, the output voltage, the output power of the PV system, as well as the electrical output variables of the grid-linked inverter. Fourthly, using RNN, the combined effects of a random cloud and a wind gusts on the system are analyzed. For short period intervals, the wind speed and the solar radiation are considered as

Leveraging network utility management practices for regulatory purposes

International Nuclear Information System (INIS)

2009-11-01

Electric utilities around the globe are entering a phase where they must modernize and implement smart grid technologies. In order to optimize system architecture, asset replacement, and future operating costs, it the utilities must implement robust and flexible asset management structures. This report discussed the ways in which regulators assess investment plans. It focused on the implicit or explicit use of an asset management approach, including principles; processes; input and outputs; decision-making criteria and prioritization methods. The Ontario Energy Board staff were familiarized with the principles and objectives of established and emerging asset management processes and underlying analytic processes, systems and tools in order to ensure that investment information provided by network utilities regarding rates and other applications could be evaluated effectively. Specifically, the report discussed the need for and importance of asset management and provided further details of international markets and their regulatory approaches to asset management. The report also discussed regulatory approaches for review of asset management underlying investment plans as well as an overview of international regulatory practice for review of network utility asset management. It was concluded that options for strengthening regulatory guidance and assessment included utilizing appropriate and effective benchmarking to assess, promote and provide incentives for best practices and steer clear of the potential perverse incentives. 21 tabs., 17 figs., 1 appendix.

A monopoly pricing model for diffusion maximization based on heterogeneous nodes and negative network externalities (Case study: A novel product

Directory of Open Access Journals (Sweden)

Aghdas Badiee

2018-10-01

Full Text Available Social networks can provide sellers across the world with invaluable information about the structure of possible influences among different members of a network, whether positive or negative, and can be used to maximize diffusion in the network. Here, a novel mathematical monopoly product pricing model is introduced for maximization of market share in noncompetitive environment. In the proposed model, a customer’s decision to buy a product is not only based on the price, quality and need time for the product but also on the positive and negative influences of his/her neighbors. Therefore, customers are considered heterogeneous and a referral bonus is granted to every customer whose neighbors also buy the product. Here, the degree of influence is directly related to the intensity of the customers’ relationships. Finally, using the proposed model for a real case study, the optimal policy for product sales that is the ratio of product sale price in comparison with its cost and also the optimal amounts of referral bonus per customer is achieved.

Developing maximal neuromuscular power: Part 1--biological basis of maximal power production.

Science.gov (United States)

Cormie, Prue; McGuigan, Michael R; Newton, Robert U

2011-01-01

This series of reviews focuses on the most important neuromuscular function in many sport performances, the ability to generate maximal muscular power. Part 1 focuses on the factors that affect maximal power production, while part 2, which will follow in a forthcoming edition of Sports Medicine, explores the practical application of these findings by reviewing the scientific literature relevant to the development of training programmes that most effectively enhance maximal power production. The ability of the neuromuscular system to generate maximal power is affected by a range of interrelated factors. Maximal muscular power is defined and limited by the force-velocity relationship and affected by the length-tension relationship. The ability to generate maximal power is influenced by the type of muscle action involved and, in particular, the time available to develop force, storage and utilization of elastic energy, interactions of contractile and elastic elements, potentiation of contractile and elastic filaments as well as stretch reflexes. Furthermore, maximal power production is influenced by morphological factors including fibre type contribution to whole muscle area, muscle architectural features and tendon properties as well as neural factors including motor unit recruitment, firing frequency, synchronization and inter-muscular coordination. In addition, acute changes in the muscle environment (i.e. alterations resulting from fatigue, changes in hormone milieu and muscle temperature) impact the ability to generate maximal power. Resistance training has been shown to impact each of these neuromuscular factors in quite specific ways. Therefore, an understanding of the biological basis of maximal power production is essential for developing training programmes that effectively enhance maximal power production in the human.

Real-time topic-aware influence maximization using preprocessing.

Science.gov (United States)

Chen, Wei; Lin, Tian; Yang, Cheng

2016-01-01

Influence maximization is the task of finding a set of seed nodes in a social network such that the influence spread of these seed nodes based on certain influence diffusion model is maximized. Topic-aware influence diffusion models have been recently proposed to address the issue that influence between a pair of users are often topic-dependent and information, ideas, innovations etc. being propagated in networks are typically mixtures of topics. In this paper, we focus on the topic-aware influence maximization task. In particular, we study preprocessing methods to avoid redoing influence maximization for each mixture from scratch. We explore two preprocessing algorithms with theoretical justifications. Our empirical results on data obtained in a couple of existing studies demonstrate that one of our algorithms stands out as a strong candidate providing microsecond online response time and competitive influence spread, with reasonable preprocessing effort.

Utilizing Weak Indicators to Detect Anomalous Behaviors in Networks

Energy Technology Data Exchange (ETDEWEB)

Egid, Adin Ezra [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

2018-02-06

We consider the use of a novel weak in- dicator alongside more commonly used weak indicators to help detect anomalous behavior in a large computer network. The data of the network which we are studying in this research paper concerns remote log-in information (Virtual Private Network, or VPN sessions) from the internal network of Los Alamos National Laboratory (LANL). The novel indicator we are utilizing is some- thing which, while novel in its application to data science/cyber security research, is a concept borrowed from the business world. The Her ndahl-Hirschman Index (HHI) is a computationally trivial index which provides a useful heuristic for regulatory agencies to ascertain the relative competitiveness of a particular industry. Using this index as a lagging indicator in the monthly format we have studied could help to detect anomalous behavior by a particular or small set of users on the network. Additionally, we study indicators related to the speed of movement of a user based on the physical location of their current and previous logins. This data can be ascertained from the IP addresses of the users, and is likely very similar to the fraud detection schemes regularly utilized by credit card networks to detect anomalous activity. In future work we would look to nd a way to combine these indicators for use as an internal fraud detection system.

Maximization of the Supportable Number of Sensors in QoS-Aware Cluster-Based Underwater Acoustic Sensor Networks

Directory of Open Access Journals (Sweden)

Thi-Tham Nguyen

2014-03-01

Full Text Available This paper proposes a practical low-complexity MAC (medium access control scheme for quality of service (QoS-aware and cluster-based underwater acoustic sensor networks (UASN, in which the provision of differentiated QoS is required. In such a network, underwater sensors (U-sensor in a cluster are divided into several classes, each of which has a different QoS requirement. The major problem considered in this paper is the maximization of the number of nodes that a cluster can accommodate while still providing the required QoS for each class in terms of the PDR (packet delivery ratio. In order to address the problem, we first estimate the packet delivery probability (PDP and use it to formulate an optimization problem to determine the optimal value of the maximum packet retransmissions for each QoS class. The custom greedy and interior-point algorithms are used to find the optimal solutions, which are verified by extensive simulations. The simulation results show that, by solving the proposed optimization problem, the supportable number of underwater sensor nodes can be maximized while satisfying the QoS requirements for each class.

On Green Cognitive Radio Cellular Networks: Dynamic Spectrum and Operation Management

KAUST Repository

Sboui, Lokman; Ghazzai, Hakim; Rezki, Zouheir; Alouini, Mohamed-Slim

2016-01-01

We study a profit maximization problem related to cognitive radio cellular networks in an environmentally- friendly framework. The objective of the primary network (PN) and secondary network (SN) is to maximize their profits while respecting a certain carbon dioxide (CO2) emissions threshold. In this study, the PN can switch off some of its base stations (BSs) powered by mircogrids, and hence leases the spectrum in the corresponding cells, to reduce its footprint. The corresponding users are roamed to the SN infrastructure. In return, the SN receives a certain roaming cost and its users can freely exploit the spectrum. We study two scenarios in which the profits are either separately or jointly maximized. In the disjoint maximization problem, two low complexity algorithms for PN and SN BS on/off switching are proposed to maximize the profit per CO2 emissions utility and determine the amount of the shared bandwidth. In the joint maximization approach, the low complexity algorithm is based on maximizing the sum of weighted profits per CO2. Selected numerical results illustrate the collaboration performance versus various system parameters. We show that the proposed algorithms achieve performances close to those obtained with the exhaustive search method, and that the roaming price and the renewable energy availability are crucial parameters that control the collaboration of both networks.

On Green Cognitive Radio Cellular Networks: Dynamic Spectrum and Operation Management

KAUST Repository

Sboui, Lokman

2016-07-18

We study a profit maximization problem related to cognitive radio cellular networks in an environmentally- friendly framework. The objective of the primary network (PN) and secondary network (SN) is to maximize their profits while respecting a certain carbon dioxide (CO2) emissions threshold. In this study, the PN can switch off some of its base stations (BSs) powered by mircogrids, and hence leases the spectrum in the corresponding cells, to reduce its footprint. The corresponding users are roamed to the SN infrastructure. In return, the SN receives a certain roaming cost and its users can freely exploit the spectrum. We study two scenarios in which the profits are either separately or jointly maximized. In the disjoint maximization problem, two low complexity algorithms for PN and SN BS on/off switching are proposed to maximize the profit per CO2 emissions utility and determine the amount of the shared bandwidth. In the joint maximization approach, the low complexity algorithm is based on maximizing the sum of weighted profits per CO2. Selected numerical results illustrate the collaboration performance versus various system parameters. We show that the proposed algorithms achieve performances close to those obtained with the exhaustive search method, and that the roaming price and the renewable energy availability are crucial parameters that control the collaboration of both networks.

Development of a Deterministic Optimization Model for Design of an Integrated Utility and Hydrogen Supply Network

International Nuclear Information System (INIS)

Hwangbo, Soonho; Lee, In-Beum; Han, Jeehoon

2014-01-01

Lots of networks are constructed in a large scale industrial complex. Each network meet their demands through production or transportation of materials which are needed to companies in a network. Network directly produces materials for satisfying demands in a company or purchase form outside due to demand uncertainty, financial factor, and so on. Especially utility network and hydrogen network are typical and major networks in a large scale industrial complex. Many studies have been done mainly with focusing on minimizing the total cost or optimizing the network structure. But, few research tries to make an integrated network model by connecting utility network and hydrogen network. In this study, deterministic mixed integer linear programming model is developed for integrating utility network and hydrogen network. Steam Methane Reforming process is necessary for combining two networks. After producing hydrogen from Steam-Methane Reforming process whose raw material is steam vents from utility network, produced hydrogen go into hydrogen network and fulfill own needs. Proposed model can suggest optimized case in integrated network model, optimized blueprint, and calculate optimal total cost. The capability of the proposed model is tested by applying it to Yeosu industrial complex in Korea. Yeosu industrial complex has the one of the biggest petrochemical complex and various papers are based in data of Yeosu industrial complex. From a case study, the integrated network model suggests more optimal conclusions compared with previous results obtained by individually researching utility network and hydrogen network

Defense strategies for asymmetric networked systems under composite utilities

Energy Technology Data Exchange (ETDEWEB)

Rao, Nageswara S. [ORNL; Ma, Chris Y. T. [Hang Seng Management College, Hon Kong; Hausken, Kjell [University of Stavanger, Norway; He, Fei [Texas A& M University, Kingsville, TX, USA; Yau, David K. Y. [Singapore University of Technology and Design; Zhuang, Jun [University at Buffalo (SUNY)

2017-11-01

We consider an infrastructure of networked systems with discrete components that can be reinforced at certain costs to guard against attacks. The communications network plays a critical, asymmetric role of providing the vital connectivity between the systems. We characterize the correlations within this infrastructure at two levels using (a) aggregate failure correlation function that specifies the infrastructure failure probability giventhe failure of an individual system or network, and (b) first order differential conditions on system survival probabilities that characterize component-level correlations. We formulate an infrastructure survival game between an attacker and a provider, who attacks and reinforces individual components, respectively. They use the composite utility functions composed of a survival probability term and a cost term, and the previously studiedsum-form and product-form utility functions are their special cases. At Nash Equilibrium, we derive expressions for individual system survival probabilities and the expected total number of operational components. We apply and discuss these estimates for a simplified model of distributed cloud computing infrastructure

Maximizing information exchange between complex networks

International Nuclear Information System (INIS)

West, Bruce J.; Geneston, Elvis L.; Grigolini, Paolo

2008-01-01

Science is not merely the smooth progressive interaction of hypothesis, experiment and theory, although it sometimes has that form. More realistically the scientific study of any given complex phenomenon generates a number of explanations, from a variety of perspectives, that eventually requires synthesis to achieve a deep level of insight and understanding. One such synthesis has created the field of out-of-equilibrium statistical physics as applied to the understanding of complex dynamic networks. Over the past forty years the concept of complexity has undergone a metamorphosis. Complexity was originally seen as a consequence of memory in individual particle trajectories, in full agreement with a Hamiltonian picture of microscopic dynamics and, in principle, macroscopic dynamics could be derived from the microscopic Hamiltonian picture. The main difficulty in deriving macroscopic dynamics from microscopic dynamics is the need to take into account the actions of a very large number of components. The existence of events such as abrupt jumps, considered by the conventional continuous time random walk approach to describing complexity was never perceived as conflicting with the Hamiltonian view. Herein we review many of the reasons why this traditional Hamiltonian view of complexity is unsatisfactory. We show that as a result of technological advances, which make the observation of single elementary events possible, the definition of complexity has shifted from the conventional memory concept towards the action of non-Poisson renewal events. We show that the observation of crucial processes, such as the intermittent fluorescence of blinking quantum dots as well as the brain's response to music, as monitored by a set of electrodes attached to the scalp, has forced investigators to go beyond the traditional concept of complexity and to establish closer contact with the nascent field of complex networks. Complex networks form one of the most challenging areas of modern

Maximizing information exchange between complex networks

Science.gov (United States)

West, Bruce J.; Geneston, Elvis L.; Grigolini, Paolo

2008-10-01

Science is not merely the smooth progressive interaction of hypothesis, experiment and theory, although it sometimes has that form. More realistically the scientific study of any given complex phenomenon generates a number of explanations, from a variety of perspectives, that eventually requires synthesis to achieve a deep level of insight and understanding. One such synthesis has created the field of out-of-equilibrium statistical physics as applied to the understanding of complex dynamic networks. Over the past forty years the concept of complexity has undergone a metamorphosis. Complexity was originally seen as a consequence of memory in individual particle trajectories, in full agreement with a Hamiltonian picture of microscopic dynamics and, in principle, macroscopic dynamics could be derived from the microscopic Hamiltonian picture. The main difficulty in deriving macroscopic dynamics from microscopic dynamics is the need to take into account the actions of a very large number of components. The existence of events such as abrupt jumps, considered by the conventional continuous time random walk approach to describing complexity was never perceived as conflicting with the Hamiltonian view. Herein we review many of the reasons why this traditional Hamiltonian view of complexity is unsatisfactory. We show that as a result of technological advances, which make the observation of single elementary events possible, the definition of complexity has shifted from the conventional memory concept towards the action of non-Poisson renewal events. We show that the observation of crucial processes, such as the intermittent fluorescence of blinking quantum dots as well as the brain’s response to music, as monitored by a set of electrodes attached to the scalp, has forced investigators to go beyond the traditional concept of complexity and to establish closer contact with the nascent field of complex networks. Complex networks form one of the most challenging areas of

Maximizing information exchange between complex networks

Energy Technology Data Exchange (ETDEWEB)

West, Bruce J. [Mathematical and Information Science, Army Research Office, Research Triangle Park, NC 27708 (United States); Physics Department, Duke University, Durham, NC 27709 (United States)], E-mail: bwest@nc.rr.com; Geneston, Elvis L. [Center for Nonlinear Science, University of North Texas, P.O. Box 311427, Denton, TX 76203-1427 (United States); Physics Department, La Sierra University, 4500 Riverwalk Parkway, Riverside, CA 92515 (United States); Grigolini, Paolo [Center for Nonlinear Science, University of North Texas, P.O. Box 311427, Denton, TX 76203-1427 (United States); Istituto di Processi Chimico Fisici del CNR, Area della Ricerca di Pisa, Via G. Moruzzi, 56124, Pisa (Italy); Dipartimento di Fisica ' E. Fermi' Universita' di Pisa, Largo Pontecorvo 3, 56127 Pisa (Italy)

2008-10-15

Science is not merely the smooth progressive interaction of hypothesis, experiment and theory, although it sometimes has that form. More realistically the scientific study of any given complex phenomenon generates a number of explanations, from a variety of perspectives, that eventually requires synthesis to achieve a deep level of insight and understanding. One such synthesis has created the field of out-of-equilibrium statistical physics as applied to the understanding of complex dynamic networks. Over the past forty years the concept of complexity has undergone a metamorphosis. Complexity was originally seen as a consequence of memory in individual particle trajectories, in full agreement with a Hamiltonian picture of microscopic dynamics and, in principle, macroscopic dynamics could be derived from the microscopic Hamiltonian picture. The main difficulty in deriving macroscopic dynamics from microscopic dynamics is the need to take into account the actions of a very large number of components. The existence of events such as abrupt jumps, considered by the conventional continuous time random walk approach to describing complexity was never perceived as conflicting with the Hamiltonian view. Herein we review many of the reasons why this traditional Hamiltonian view of complexity is unsatisfactory. We show that as a result of technological advances, which make the observation of single elementary events possible, the definition of complexity has shifted from the conventional memory concept towards the action of non-Poisson renewal events. We show that the observation of crucial processes, such as the intermittent fluorescence of blinking quantum dots as well as the brain's response to music, as monitored by a set of electrodes attached to the scalp, has forced investigators to go beyond the traditional concept of complexity and to establish closer contact with the nascent field of complex networks. Complex networks form one of the most challenging areas of

Simultaneous Visualization of Different Utility Networks for Disaster Management

Science.gov (United States)

Semm, S.; Becker, T.; Kolbe, T. H.

2012-07-01

Cartographic visualizations of crises are used to create a Common Operational Picture (COP) and enforce Situational Awareness by presenting and representing relevant information. As nearly all crises affect geospatial entities, geo-data representations have to support location-specific decision-making throughout the crises. Since, Operator's attention span and their working memory are limiting factors for the process of getting and interpreting information; the cartographic presentation has to support individuals in coordinating their activities and with handling highly dynamic situations. The Situational Awareness of operators in conjunction with a COP are key aspects of the decision making process and essential for coming to appropriate decisions. Utility networks are one of the most complex and most needed systems within a city. The visualization of utility infrastructure in crisis situations is addressed in this paper. The paper will provide a conceptual approach on how to simplify, aggregate, and visualize multiple utility networks and their components to meet the requirements of the decision-making process and to support Situational Awareness.

An ethical justification of profit maximization

DEFF Research Database (Denmark)

Koch, Carsten Allan

2010-01-01

In much of the literature on business ethics and corporate social responsibility, it is more or less taken for granted that attempts to maximize profits are inherently unethical. The purpose of this paper is to investigate whether an ethical argument can be given in support of profit maximizing...... behaviour. It is argued that some form of consequential ethics must be applied, and that both profit seeking and profit maximization can be defended from a rule-consequential point of view. It is noted, however, that the result does not apply unconditionally, but requires that certain form of profit (and...... utility) maximizing actions are ruled out, e.g., by behavioural norms or formal institutions....

Aging and loss decision making: increased risk aversion and decreased use of maximizing information, with correlated rationality and value maximization.

Science.gov (United States)

Kurnianingsih, Yoanna A; Sim, Sam K Y; Chee, Michael W L; Mullette-Gillman, O'Dhaniel A

2015-01-01

We investigated how adult aging specifically alters economic decision-making, focusing on examining alterations in uncertainty preferences (willingness to gamble) and choice strategies (what gamble information influences choices) within both the gains and losses domains. Within each domain, participants chose between certain monetary outcomes and gambles with uncertain outcomes. We examined preferences by quantifying how uncertainty modulates choice behavior as if altering the subjective valuation of gambles. We explored age-related preferences for two types of uncertainty, risk, and ambiguity. Additionally, we explored how aging may alter what information participants utilize to make their choices by comparing the relative utilization of maximizing and satisficing information types through a choice strategy metric. Maximizing information was the ratio of the expected value of the two options, while satisficing information was the probability of winning. We found age-related alterations of economic preferences within the losses domain, but no alterations within the gains domain. Older adults (OA; 61-80 years old) were significantly more uncertainty averse for both risky and ambiguous choices. OA also exhibited choice strategies with decreased use of maximizing information. Within OA, we found a significant correlation between risk preferences and choice strategy. This linkage between preferences and strategy appears to derive from a convergence to risk neutrality driven by greater use of the effortful maximizing strategy. As utility maximization and value maximization intersect at risk neutrality, this result suggests that OA are exhibiting a relationship between enhanced rationality and enhanced value maximization. While there was variability in economic decision-making measures within OA, these individual differences were unrelated to variability within examined measures of cognitive ability. Our results demonstrate that aging alters economic decision-making for

Aging and loss decision making: increased risk aversion and decreased use of maximizing information, with correlated rationality and value maximization

Directory of Open Access Journals (Sweden)

Yoanna Arlina Kurnianingsih

2015-05-01

Full Text Available We investigated how adult aging specifically alters economic decision-making, focusing on examining alterations in uncertainty preferences (willingness to gamble and choice strategies (what gamble information influences choices within both the gains and losses domains. Within each domain, participants chose between certain monetary outcomes and gambles with uncertain outcomes. We examined preferences by quantifying how uncertainty modulates choice behavior as if altering the subjective valuation of gambles. We explored age-related preferences for two types of uncertainty, risk and ambiguity. Additionally, we explored how aging may alter what information participants utilize to make their choices by comparing the relative utilization of maximizing and satisficing information types through a choice strategy metric. Maximizing information was the ratio of the expected value of the two options, while satisficing information was the probability of winning.We found age-related alterations of economic preferences within the losses domain, but no alterations within the gains domain. Older adults (OA; 61 to 80 years old were significantly more uncertainty averse for both risky and ambiguous choices. OA also exhibited choice strategies with decreased use of maximizing information. Within OA, we found a significant correlation between risk preferences and choice strategy. This linkage between preferences and strategy appears to derive from a convergence to risk neutrality driven by greater use of the effortful maximizing strategy. As utility maximization and value maximization intersect at risk neutrality, this result suggests that OA are exhibiting a relationship between enhanced rationality and enhanced value maximization. While there was variability in economic decision-making measures within OA, these individual differences were unrelated to variability within examined measures of cognitive ability. Our results demonstrate that aging alters economic

BHCDA: Bandwidth Efficient Heterogeneity aware Cluster based Data Aggregation for Wireless Sensor Network

DEFF Research Database (Denmark)

Dnyaneshwar, Mantri; Prasad, Neeli R.; Prasad, Ramjee

2013-01-01

The fundamental challenge in the design of Wireless sensor Network (WSNs) is proper utilization of resources which are scare. One of the critical challenges is to maximize the bandwidth utilization in data gathering from sensor nodes and forward to sink. The main design objective of this paper...

Utility communication networks and services specification, deployment and operation

CERN Document Server

2017-01-01

This CIGRE green book begins by addressing the specification and provision of communication services in the context of operational applications for electrical power utilities, before subsequently providing guidelines on the deployment or transformation of networks to deliver these specific communication services. Lastly, it demonstrates how these networks and their services can be monitored, operated, and maintained to ensure that the requisite high level of service quality is consistently achieved.

A Three-Threshold Learning Rule Approaches the Maximal Capacity of Recurrent Neural Networks.

Directory of Open Access Journals (Sweden)

Alireza Alemi

2015-08-01

Full Text Available Understanding the theoretical foundations of how memories are encoded and retrieved in neural populations is a central challenge in neuroscience. A popular theoretical scenario for modeling memory function is the attractor neural network scenario, whose prototype is the Hopfield model. The model simplicity and the locality of the synaptic update rules come at the cost of a poor storage capacity, compared with the capacity achieved with perceptron learning algorithms. Here, by transforming the perceptron learning rule, we present an online learning rule for a recurrent neural network that achieves near-maximal storage capacity without an explicit supervisory error signal, relying only upon locally accessible information. The fully-connected network consists of excitatory binary neurons with plastic recurrent connections and non-plastic inhibitory feedback stabilizing the network dynamics; the memory patterns to be memorized are presented online as strong afferent currents, producing a bimodal distribution for the neuron synaptic inputs. Synapses corresponding to active inputs are modified as a function of the value of the local fields with respect to three thresholds. Above the highest threshold, and below the lowest threshold, no plasticity occurs. In between these two thresholds, potentiation/depression occurs when the local field is above/below an intermediate threshold. We simulated and analyzed a network of binary neurons implementing this rule and measured its storage capacity for different sizes of the basins of attraction. The storage capacity obtained through numerical simulations is shown to be close to the value predicted by analytical calculations. We also measured the dependence of capacity on the strength of external inputs. Finally, we quantified the statistics of the resulting synaptic connectivity matrix, and found that both the fraction of zero weight synapses and the degree of symmetry of the weight matrix increase with the

Public utilities in networks: competition perspectives and new regulations

International Nuclear Information System (INIS)

Bergougnoux, J.

2000-01-01

This report makes first a status about the historical specificities, the present day situation and the perspectives of evolution of public utilities in networks with respect to the European directive of 1996 and to the 4 sectors of electricity, gas, railway transport and postal service. Then, it wonders about the new institutions and regulation procedures to implement to conciliate the public utility mission with the honest competition. (J.S.)

Capacity utilization in resilient wavelength-routed optical networks using link restoration

DEFF Research Database (Denmark)

Limal, Emmanuel; Danielsen, Søren Lykke; Stubkjær, Kristian

1998-01-01

The construction of resilient wavelength-routed optical networks has attracted much interest. Many network topologies, path and wavelength assignment strategies have been proposed. The assessment of network strategies is very complex and comparison is difficult. Here, we take a novel analytical...... approach in estimating the maximum capacity utilization that is possible in wavelength-division multiplexing (WDM) networks that are resilient against single link failures. The results apply to general network topologies and can therefore be used to evaluate the performance of more specific wavelength...

SIMULTANEOUS VISUALIZATION OF DIFFERENT UTILITY NETWORKS FOR DISASTER MANAGEMENT

Directory of Open Access Journals (Sweden)

S. Semm

2012-07-01

Full Text Available Cartographic visualizations of crises are used to create a Common Operational Picture (COP and enforce Situational Awareness by presenting and representing relevant information. As nearly all crises affect geospatial entities, geo-data representations have to support location-specific decision-making throughout the crises. Since, Operator's attention span and their working memory are limiting factors for the process of getting and interpreting information; the cartographic presentation has to support individuals in coordinating their activities and with handling highly dynamic situations. The Situational Awareness of operators in conjunction with a COP are key aspects of the decision making process and essential for coming to appropriate decisions. Utility networks are one of the most complex and most needed systems within a city. The visualization of utility infrastructure in crisis situations is addressed in this paper. The paper will provide a conceptual approach on how to simplify, aggregate, and visualize multiple utility networks and their components to meet the requirements of the decision-making process and to support Situational Awareness.

Energy Effective Congestion Control for Multicast with Network Coding in Wireless Ad Hoc Network

Directory of Open Access Journals (Sweden)

Chuanxin Zhao

2014-01-01

Full Text Available In order to improve network throughput and reduce energy consumption, we propose in this paper a cross-layer optimization design that is able to achieve multicast utility maximization and energy consumption minimization. The joint optimization of congestion control and power allocation is formulated to be a nonlinear nonconvex problem. Using dual decomposition, a distributed optimization algorithm is proposed to avoid the congestion by control flow rate at the source node and eliminate the bottleneck by allocating the power at the intermediate node. Simulation results show that the cross-layer algorithm can increase network performance, reduce the energy consumption of wireless nodes and prolong the network lifetime, while keeping network throughput basically unchanged.

Inclusive fitness maximization: An axiomatic approach.

Science.gov (United States)

Okasha, Samir; Weymark, John A; Bossert, Walter

2014-06-07

Kin selection theorists argue that evolution in social contexts will lead organisms to behave as if maximizing their inclusive, as opposed to personal, fitness. The inclusive fitness concept allows biologists to treat organisms as akin to rational agents seeking to maximize a utility function. Here we develop this idea and place it on a firm footing by employing a standard decision-theoretic methodology. We show how the principle of inclusive fitness maximization and a related principle of quasi-inclusive fitness maximization can be derived from axioms on an individual׳s 'as if preferences' (binary choices) for the case in which phenotypic effects are additive. Our results help integrate evolutionary theory and rational choice theory, help draw out the behavioural implications of inclusive fitness maximization, and point to a possible way in which evolution could lead organisms to implement it. Copyright © 2014 Elsevier Ltd. All rights reserved.

Social networks uncovered: 10 tips every plastic surgeon should know.

Science.gov (United States)

Dauwe, Phillip; Heller, Justin B; Unger, Jacob G; Graham, Darrell; Rohrich, Rod J

2012-11-01

Understanding online social networks is of critical importance to the plastic surgeon. With knowledge, it becomes apparent that the numerous networks available are similar in their structure, usage, and function. The key is communication between Internet media such that one maximizes exposure to patients. This article focuses on 2 social networking platforms that we feel provide the most utility to plastic surgeons. Ten tips are provided for incorporation of Facebook and Twitter into your practice.

IFC to CityGML Transformation Framework for Geo-Analysis : A Water Utility Network Case

NARCIS (Netherlands)

Hijazi, I.; Ehlers, M.; Zlatanova, S.; Isikdag, U.

2009-01-01

The development of semantic 3D city models has allowed for new approaches to town planning and urban management (Benner et al. 2005) such as emergency and catastrophe planning, checking building developments, and utility networks. Utility networks inside buildings are composed of pipes and cables

The behavioral economics of consumer brand choice: patterns of reinforcement and utility maximization.

Science.gov (United States)

Foxall, Gordon R; Oliveira-Castro, Jorge M; Schrezenmaier, Teresa C

2004-06-30

Purchasers of fast-moving consumer goods generally exhibit multi-brand choice, selecting apparently randomly among a small subset or "repertoire" of tried and trusted brands. Their behavior shows both matching and maximization, though it is not clear just what the majority of buyers are maximizing. Each brand attracts, however, a small percentage of consumers who are 100%-loyal to it during the period of observation. Some of these are exclusively buyers of premium-priced brands who are presumably maximizing informational reinforcement because their demand for the brand is relatively price-insensitive or inelastic. Others buy exclusively the cheapest brands available and can be assumed to maximize utilitarian reinforcement since their behavior is particularly price-sensitive or elastic. Between them are the majority of consumers whose multi-brand buying takes the form of selecting a mixture of economy -- and premium-priced brands. Based on the analysis of buying patterns of 80 consumers for 9 product categories, the paper examines the continuum of consumers so defined and seeks to relate their buying behavior to the question of how and what consumers maximize.

The utilization of social networking as promotion media (Case study: Handicraft business in Palembang)

OpenAIRE

Rahadi, Dedi Rianto; Abdillah, Leon Andretti

2013-01-01

Nowadays social media (Twitter, Facebook, etc.), not only simply as communication media, but also for promotion. Social networking media offers many business benefits for companies and organizations. Research purposes is to determine the model of social network media utilization as a promotional media for handicraft business in Palembang city. Qualitative and quantitative research design are used to know how handicraft business in Palembang city utilizing social media networking as a promotio...

Activity-Driven Influence Maximization in Social Networks

DEFF Research Database (Denmark)

Kumar, Rohit; Saleem, Muhammad Aamir; Calders, Toon

2017-01-01

-driven approach based on the identification of influence propagation patterns. In the first work, we identify so-called information-channels to model potential pathways for information spread, while the second work exploits how users in a location-based social network check in to locations in order to identify...... influential locations. To make our algorithms scalable, approximate versions based on sketching techniques from the data streams domain have been developed. Experiments show that in this way it is possible to efficiently find good seed sets for influence propagation in social networks.......Interaction networks consist of a static graph with a timestamped list of edges over which interaction took place. Examples of interaction networks are social networks whose users interact with each other through messages or location-based social networks where people interact by checking...

Architecture and design of optical path networks utilizing waveband virtual links

Science.gov (United States)

Ito, Yusaku; Mori, Yojiro; Hasegawa, Hiroshi; Sato, Ken-ichi

2016-02-01

We propose a novel optical network architecture that uses waveband virtual links, each of which can carry several optical paths, to directly bridge distant node pairs. Future photonic networks should not only transparently cover extended areas but also expand fiber capacity. However, the traversal of many ROADM nodes impairs the optical signal due to spectrum narrowing. To suppress the degradation, the bandwidth of guard bands needs to be increased, which degrades fiber frequency utilization. Waveband granular switching allows us to apply broader pass-band filtering at ROADMs and to insert sufficient guard bands between wavebands with minimum frequency utilization offset. The scheme resolves the severe spectrum narrowing effect. Moreover, the guard band between optical channels in a waveband can be minimized, which increases the number of paths that can be accommodated per fiber. In the network, wavelength path granular routing is done without utilizing waveband virtual links, and it still suffers from spectrum narrowing. A novel network design algorithm that can bound the spectrum narrowing effect by limiting the number of hops (traversed nodes that need wavelength path level routing) is proposed in this paper. This algorithm dynamically changes the waveband virtual link configuration according to the traffic distribution variation, where optical paths that need many node hops are effectively carried by virtual links. Numerical experiments demonstrate that the number of necessary fibers is reduced by 23% compared with conventional optical path networks.

A Utility Maximizing and Privacy Preserving Approach for Protecting Kinship in Genomic Databases.

Science.gov (United States)

Kale, Gulce; Ayday, Erman; Tastan, Oznur

2017-09-12

Rapid and low cost sequencing of genomes enabled widespread use of genomic data in research studies and personalized customer applications, where genomic data is shared in public databases. Although the identities of the participants are anonymized in these databases, sensitive information about individuals can still be inferred. One such information is kinship. We define two routes kinship privacy can leak and propose a technique to protect kinship privacy against these risks while maximizing the utility of shared data. The method involves systematic identification of minimal portions of genomic data to mask as new participants are added to the database. Choosing the proper positions to hide is cast as an optimization problem in which the number of positions to mask is minimized subject to privacy constraints that ensure the familial relationships are not revealed.We evaluate the proposed technique on real genomic data. Results indicate that concurrent sharing of data pertaining to a parent and an offspring results in high risks of kinship privacy, whereas the sharing data from further relatives together is often safer. We also show arrival order of family members have a high impact on the level of privacy risks and on the utility of sharing data. Available at: https://github.com/tastanlab/Kinship-Privacy. erman@cs.bilkent.edu.tr or oznur.tastan@cs.bilkent.edu.tr. Supplementary data are available at Bioinformatics online. © The Author (2017). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com

Energy optimization in mobile sensor networks

Science.gov (United States)

Yu, Shengwei

consuming negligible amount of energy for mobility cost. For the second problem, the problem is extended to accommodate mobile robotic nodes with energy harvesting capability, which makes it a non-convex optimization problem. The non-convexity issue is tackled by using the existing sequential convex approximation method, based on which we propose a novel procedure of modified sequential convex approximation that has fast convergence speed. For the third problem, the proposed procedure is used to solve another challenging non-convex problem, which results in utilizing mobility and routing simultaneously in mobile robotic sensor networks to prolong the network lifetime. The results indicate that joint design of mobility and routing has an edge over other methods in prolonging network lifetime, which is also the justification for the use of mobility in mobile sensor networks for energy efficiency purpose. For the fourth problem, we include the dynamics of the robotic nodes in the problem by modeling the networked robotic system using hybrid systems theory. A novel distributed method for the networked hybrid system is used to solve the optimal moving trajectories for robotic nodes and optimal network links, which are not answered by previous approaches. Finally, the fact that mobility is more effective in prolonging network lifetime for a data-intensive network leads us to apply our methods to study mobile visual sensor networks, which are useful in many applications. We investigate the joint design of mobility, data routing, and encoding power to help improving the video quality while maximizing the network lifetime. This study leads to a better understanding of the role mobility can play in data-intensive surveillance sensor networks.

Mobile Virtual Network Operator Information Systems for Increased Sustainability in Utilities

DEFF Research Database (Denmark)

Joensen, Hallur Leivsgard; Tambo, Torben

2011-01-01

sales from efficiency of business processes, underlying information systems, and the ability to make the link from consumption to cost visual and transparent to consumers. The conclusion is that the energy sector should look into other sectors and learn from information systems which ease up business......, sales and buying processes are separated from physical networks and energy production. This study aims to characterise and evaluate information systems supporting the transformation of the free market-orientation of energy and provision of utilities in a cross-sectorial proposition known as Mobile...... Virtual Network Operator (MVNO). Emphasis is particularly on standardised information systems for automatically linking consumers, sellers and integration of network infrastructure actors. The method used is a feasibility study assessing business and information processes of a forthcoming utilities market...

Utilizing Weak Indicators to Detect Anomalous Behaviors in Networks

Energy Technology Data Exchange (ETDEWEB)

Egid, Adin [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

2017-11-01

We consider the use of a novel weak in- dicator alongside more commonly used weak indicators to help detect anomalous behavior in a large computer network. The data of the network which we are studying in this research paper concerns remote log-in information (Virtual Private Network, or VPN sessions) from the internal network of Los Alamos National Laboratory (LANL). The novel indicator we are utilizing is some- thing which, while novel in its application to data science/cyber security research, is a concept borrowed from the business world. The Her ndahl-Hirschman Index (HHI) is a computationally trivial index which provides a useful heuristic for regulatory agencies to ascertain the relative competitiveness of a particular industry. Using this index as a lagging indicator in the monthly format we have studied could help to detect anomalous behavior by a particular or small set of users on the network.

MC-LMAC: A Multi-Channel MAC Protocol for Wireless Sensor Networks

NARCIS (Netherlands)

Durmaz, O.; Jansen, P.G.; Mullender, Sape J.

2008-01-01

In traditional wireless sensor network (WSN) applications, energy efficiency is considered to be the most important concern whereas utilizing the use of bandwidth and maximizing the throughput are of secondary importance. However, recent applications, such as structural health monitoring, require

Optimizing Low Speed VoIP Network for Rural Next Generation Network (R-NGN

Directory of Open Access Journals (Sweden)

Yoanes Bandung

2007-11-01

Full Text Available In this research, we propose an optimization method based-on E-Model for designing an efficient low speed VoIP network for Rural Next Generation Network (R-NGN. We are choosing 128 kbps and 256 kbps bandwidth as the typical community link to be used in the designing of R-NGN infrastructure. The method is based on selection of some VoIP network parameters such as voice coder, communication protocol, packet loss level, network utilization and resource allocation. We draw analytic approach for achieving rating value (R of E-model that represent level of quality of service. In this approach, we focus on delay and packet loss calculation to find the rating value. We state the rating value = 70 as minimum level of quality of service for each call, equivalent to 3.6 of Mean Opinion Score (MOS. In our experiments, either G.723.1 5.3 kbps or G.729 is chosen for maximizing the number of VoIP calls, it depends on link utilization and level of packet loss.

Revenue-Maximizing Radio Access Technology Selection with Net Neutrality Compliance in Heterogeneous Wireless Networks

Directory of Open Access Journals (Sweden)

Elissar Khloussy

2018-01-01

Full Text Available The net neutrality principle states that users should have equal access to all Internet content and that Internet Service Providers (ISPs should not practice differentiated treatment on any of the Internet traffic. While net neutrality aims to restrain any kind of discrimination, it also grants exemption to a certain category of traffic known as specialized services (SS, by allowing the ISP to dedicate part of the resources for the latter. In this work, we consider a heterogeneous LTE/WiFi wireless network and we investigate revenue-maximizing Radio Access Technology (RAT selection strategies that are net neutrality-compliant, with exemption granted to SS traffic. Our objective is to find out how the bandwidth reservation for SS traffic would be made in a way that allows maximizing the revenue while being in compliance with net neutrality and how the choice of the ratio of reserved bandwidth would affect the revenue. The results show that reserving bandwidth for SS traffic in one RAT (LTE can achieve higher revenue. On the other hand, when the capacity is reserved across both LTE and WiFi, higher social benefit in terms of number of admitted users can be realized, as well as lower blocking probability for the Internet access traffic.

Review of Recommender Systems Algorithms Utilized in Social Networks based e-Learning Systems & Neutrosophic System

Directory of Open Access Journals (Sweden)

A. A. Salama

2015-03-01

Full Text Available In this paper, we present a review of different recommender system algorithms that are utilized in social networks based e-Learning systems. Future research will include our proposed our e-Learning system that utilizes Recommender System and Social Network. Since the world is full of indeterminacy, the neutrosophics found their place into contemporary research. The fundamental concepts of neutrosophic set, introduced by Smarandache in [21, 22, 23] and Salama et al. in [24-66].The purpose of this paper is to utilize a neutrosophic set to analyze social networks data conducted through learning activities.

Gross domestic product estimation based on electricity utilization by artificial neural network

Science.gov (United States)

Stevanović, Mirjana; Vujičić, Slađana; Gajić, Aleksandar M.

2018-01-01

The main goal of the paper was to estimate gross domestic product (GDP) based on electricity estimation by artificial neural network (ANN). The electricity utilization was analyzed based on different sources like renewable, coal and nuclear sources. The ANN network was trained with two training algorithms namely extreme learning method and back-propagation algorithm in order to produce the best prediction results of the GDP. According to the results it can be concluded that the ANN model with extreme learning method could produce the acceptable prediction of the GDP based on the electricity utilization.

Utilization of social networks in education and their impact on ...

African Journals Online (AJOL)

Utilization of social networks in education and their impact on knowledge acquisition ... Developed countries are known to be quick adopters of modern advanced ... in education changing traditional systems to more open and interactive ones.

Future vision of advanced telecommunication networks for electric utilities; Denki jigyo ni okeru joho tsushin network no shorai vision

Energy Technology Data Exchange (ETDEWEB)

Tonaru, S.; Ono, K.; Sakai, S.; Kawai, Y.; Tsuboi, A. [Central Research Institute of Electric Power Industry, Tokyo (Japan); Manabe, S. [Shikoku Electric Power Co., Inc., Kagawa (Japan); Miki, Y. [Kansai Electric Power Co. Inc., Osaka (Japan)

1995-06-01

The vision of an advanced information system is proposed to cope with the future social demand and business environmental change in electric utilities. At the large turning point such as drastic reconsideration of Electricity Utilities Industry Law, further improvement of efficiency and cost reduction are requested as well as business innovation such as proposal of a new business policy. For that purpose utilization of information and its technology is indispensable, and use of multimedia and common information in organization are the future direction for improving information basis. Consequently, free information networks without any limitation due to person and media are necessary, and the following are important: high-speed, high-frequency band, digital, easily connectable and multimedia transmission lines, and cost reduction and high reliability of networks. Based on innovation of information networks and the clear principle on advanced information system, development of new applications by multimedia technologies, diffusion of communication terminals, and promotion of standardization are essential. 60 refs., 30 figs., 5 tabs.

Fiber fault location utilizing traffic signal in optical network.

Science.gov (United States)

Zhao, Tong; Wang, Anbang; Wang, Yuncai; Zhang, Mingjiang; Chang, Xiaoming; Xiong, Lijuan; Hao, Yi

2013-10-07

We propose and experimentally demonstrate a method for fault location in optical communication network. This method utilizes the traffic signal transmitted across the network as probe signal, and then locates the fault by correlation technique. Compared with conventional techniques, our method has a simple structure and low operation expenditure, because no additional device is used, such as light source, modulator and signal generator. The correlation detection in this method overcomes the tradeoff between spatial resolution and measurement range in pulse ranging technique. Moreover, signal extraction process can improve the location result considerably. Experimental results show that we achieve a spatial resolution of 8 cm and detection range of over 23 km with -8-dBm mean launched power in optical network based on synchronous digital hierarchy protocols.

Game-Theoretic Social-Aware Resource Allocation for Device-to-Device Communications Underlaying Cellular Network

Directory of Open Access Journals (Sweden)

Lei Wang

2018-01-01

Full Text Available Device-to-Device communication underlaying cellular network can increase the spectrum efficiency due to direct proximity communication and frequency reuse. However, such performance improvement is influenced by the power interference caused by spectrum sharing and social characteristics in each social community jointly. In this investigation, we present a dynamic game theory with complete information based D2D resource allocation scheme for D2D communication underlaying cellular network. In this resource allocation method, we quantify both the rate influence from the power interference caused by the D2D transmitter to cellular users and rate enhancement brought by the social relationships between mobile users. Then, the utility function maximization game is formulated to optimize the overall transmission rate performance of the network, which synthetically measures the final influence from both power interference and sociality enhancement. Simultaneously, we discuss the Nash Equilibrium of the proposed utility function maximization game from a theoretical point of view and further put forward a utility priority searching algorithm based resource allocation scheme. Simulation results show that our proposed scheme attains better performance compared with the other two advanced proposals.

A Methodology for a Sustainable CO2 Capture and Utilization Network

DEFF Research Database (Denmark)

Frauzem, Rebecca; Fjellerup, Kasper; Gani, Rafiqul

2015-01-01

hydrogenation highlights the application. This case study illustrates the utility of the utilization network and elements of the methodology being developed. In addition, the conversion process is linked with carbon capture to evaluate the overall sustainability. Finally, the production of the other raw...... of Climate Change. New York: Cambridge University Press, 2007. [2] J. Wilcox, Carbon Capture. New York: Springer, 2012....

Research Activity in Computational Physics utilizing High Performance Computing: Co-authorship Network Analysis

Science.gov (United States)

Ahn, Sul-Ah; Jung, Youngim

2016-10-01

The research activities of the computational physicists utilizing high performance computing are analyzed by bibliometirc approaches. This study aims at providing the computational physicists utilizing high-performance computing and policy planners with useful bibliometric results for an assessment of research activities. In order to achieve this purpose, we carried out a co-authorship network analysis of journal articles to assess the research activities of researchers for high-performance computational physics as a case study. For this study, we used journal articles of the Scopus database from Elsevier covering the time period of 2004-2013. We extracted the author rank in the physics field utilizing high-performance computing by the number of papers published during ten years from 2004. Finally, we drew the co-authorship network for 45 top-authors and their coauthors, and described some features of the co-authorship network in relation to the author rank. Suggestions for further studies are discussed.

Sum Utilization of Spectrum with Spectrum Handoff and Imperfect Sensing in Interweave Multi-Channel Cognitive Radio Networks

Directory of Open Access Journals (Sweden)

Waqas Khalid

2018-05-01

Full Text Available Fifth-generation (5G heterogeneous network deployment poses new challenges for 5G-based cognitive radio networks (5G-CRNs as the primary user (PU is required to be more active because of the small cells, random user arrival, and spectrum handoff. Interweave CRNs (I-CRNs improve spectrum utilization by allowing opportunistic spectrum access (OSA for secondary users (SUs. The sum utilization of spectrum, i.e., joint utilization of spectrum by the SU and PU, depends on the spatial and temporal variations of PU activities, sensing outcomes, transmitting conditions, and spectrum handoff. In this study, we formulate and analyze the sum utilization of spectrum with different sets of channels under different PU and SU co-existing network topologies. We consider realistic multi-channel scenarios for the SU, with each channel licensed to a PU. The SU, aided by spectrum handoff, is authorized to utilize the channels on the basis of sensing outcomes and PU interruptions. The numerical evaluation of the proposed work is presented under different network and sensing parameters. Moreover, the sum utilization gain is investigated to analyze the sensitivities of different sensing parameters. It is demonstrated that different sets of channels, PU activities, and sensing outcomes have a significant impact on the sum utilization of spectrum associated with a specific network topology.

Riemann-Roch Spaces and Linear Network Codes

DEFF Research Database (Denmark)

Hansen, Johan P.

We construct linear network codes utilizing algebraic curves over finite fields and certain associated Riemann-Roch spaces and present methods to obtain their parameters. In particular we treat the Hermitian curve and the curves associated with the Suzuki and Ree groups all having the maximal...... number of points for curves of their respective genera. Linear network coding transmits information in terms of a basis of a vector space and the information is received as a basis of a possibly altered vector space. Ralf Koetter and Frank R. Kschischang %\\cite{DBLP:journals/tit/KoetterK08} introduced...... in the above metric making them suitable for linear network coding....

Passive Optical Networks for the Distribution of Timed Signals in Particle Physics Experiments

CERN Document Server

Papakonstantinou, I; Papadopoulos,S; Troska, J; Vasey, F; Baron, S; Santos, L; Silva, S; Stejskal, P; Sigaud, C; Detraz, S; Moreira, P; Darwazeh, I

2009-01-01

A passive optical network for timing distribution applications based on FPGAs has been successfully demonstrated. Deterministic latency was achieved in the critical downstream direction where triggers are distributed while a burst mode receiver was successfully implemented in the upstream direction. Finally, a simple and efficient protocol was introduced for the communication between the OLT and the ONUs in the network that maximizes bandwidth utilization.

Maximizing utilization of sport halls during peak hours

DEFF Research Database (Denmark)

Iversen, Evald Bundgård; Forsberg, Peter

the number of participants 7.5 persons higher pr. activity compared to club activities. This implies that clubs during peak hours could include more participants. Another possibility to increase utilization is if the management of sport facilities forced sport clubs and other organisers to adapt...... their activities to a smaller amount of floor space, which would make it possible to have more than one activity on the floor at the same time. Hence, to achieve better utilization during prime time, further analysis and research could focus on how activities in sport halls can be adapted to include more......BACKGROUNDDuring peak hours (4.30pm-8pm) demand for timeslots in sport halls in Denmark are high and there are few timeslots available. Further, focus on how public resources are spent most efficient is increasing (Iversen, 2013). This makes it interesting to analyse how utilization could...

An efficient community detection algorithm using greedy surprise maximization

International Nuclear Information System (INIS)

Jiang, Yawen; Jia, Caiyan; Yu, Jian

2014-01-01

Community detection is an important and crucial problem in complex network analysis. Although classical modularity function optimization approaches are widely used for identifying communities, the modularity function (Q) suffers from its resolution limit. Recently, the surprise function (S) was experimentally proved to be better than the Q function. However, up until now, there has been no algorithm available to perform searches to directly determine the maximal surprise values. In this paper, considering the superiority of the S function over the Q function, we propose an efficient community detection algorithm called AGSO (algorithm based on greedy surprise optimization) and its improved version FAGSO (fast-AGSO), which are based on greedy surprise optimization and do not suffer from the resolution limit. In addition, (F)AGSO does not need the number of communities K to be specified in advance. Tests on experimental networks show that (F)AGSO is able to detect optimal partitions in both simple and even more complex networks. Moreover, algorithms based on surprise maximization perform better than those algorithms based on modularity maximization, including Blondel–Guillaume–Lambiotte–Lefebvre (BGLL), Clauset–Newman–Moore (CNM) and the other state-of-the-art algorithms such as Infomap, order statistics local optimization method (OSLOM) and label propagation algorithm (LPA). (paper)

ATP and phosphocreatine utilization in single human muscle fibres during the development of maximal power output at elevated muscle temperatures.

Science.gov (United States)

Gray, Stuart R; Söderlund, Karin; Ferguson, Richard A

2008-05-01

In this study, we examined the effect of muscle temperature (Tm) on adenosine triphosphate (ATP) and phosphocreatine utilization in single muscle fibres during the development of maximal power output in humans. Six male participants performed a 6-s maximal sprint on a friction-braked cycle ergometer under both normal (Tm = 34.3 degrees C, s = 0.6) and elevated (T(m) = 37.3 degrees C, s = 0.2) muscle temperature conditions. During the elevated condition, muscle temperature of the legs was raised, passively, by hot water immersion followed by wrapping in electrically heated blankets. Muscle biopsies were taken from the vastus lateralis before and immediately after exercise. Freeze-dried single fibres were dissected, characterized according to myosin heavy chain composition, and analysed for ATP and phosphocreatine content. Single fibres were classified as: type I, IIA, IIAX25 (1 - 25% IIX isoform), IIAX50 (26 - 50% IIX), IIAX75 (51 - 75% IIX), or IIAX100 (76 - 100% IIX). Maximal power output and pedal rate were both greater (P < 0.05) during the elevated condition by 258 W (s = 110) and 22 rev . min(-1) (s = 6), respectively. In both conditions, phosphocreatine content decreased significantly in all fibre types, with a greater decrease during the elevated condition in type IIA fibres (P < 0.01). Adenosine triphosphate content was also reduced to a greater (P < 0.01) extent in type IIA fibres during the elevated condition. The results of the present study indicate that after passive elevation of muscle temperature, there was a greater decrease in ATP and phosphocreatine content in type IIA fibres than in the normal trial, which contributed to the higher maximal power output.

Power Converters Maximize Outputs Of Solar Cell Strings

Science.gov (United States)

Frederick, Martin E.; Jermakian, Joel B.

1993-01-01

Microprocessor-controlled dc-to-dc power converters devised to maximize power transferred from solar photovoltaic strings to storage batteries and other electrical loads. Converters help in utilizing large solar photovoltaic arrays most effectively with respect to cost, size, and weight. Main points of invention are: single controller used to control and optimize any number of "dumb" tracker units and strings independently; power maximized out of converters; and controller in system is microprocessor.

Maximizing lifetime of wireless sensor networks using genetic approach

DEFF Research Database (Denmark)

Wagh, Sanjeev; Prasad, Ramjee

2014-01-01

The wireless sensor networks are designed to install the smart network applications or network for emergency solutions, where human interaction is not possible. The nodes in wireless sensor networks have to self organize as per the users requirements through monitoring environments. As the sensor......-objective parameters are considered to solve the problem using genetic algorithm of evolutionary approach.......The wireless sensor networks are designed to install the smart network applications or network for emergency solutions, where human interaction is not possible. The nodes in wireless sensor networks have to self organize as per the users requirements through monitoring environments. As the sensor...

Maximally flat radiation patterns of a circular aperture

Science.gov (United States)

Minkovich, B. M.; Mints, M. Ia.

1989-08-01

The paper presents an explicit solution to the problems of maximizing the area utilization coefficient and of obtaining the best approximation (on the average) of a sectorial Pi-shaped radiation pattern of an antenna with a circular aperture when Butterworth conditions are imposed on the approximating pattern with the aim of flattening it. Constraints on the choice of admissible minimum and maximum antenna dimensions are determined which make possible the synthesis of maximally flat patterns with small sidelobes.

The Large Margin Mechanism for Differentially Private Maximization

OpenAIRE

Chaudhuri, Kamalika; Hsu, Daniel; Song, Shuang

2014-01-01

A basic problem in the design of privacy-preserving algorithms is the private maximization problem: the goal is to pick an item from a universe that (approximately) maximizes a data-dependent function, all under the constraint of differential privacy. This problem has been used as a sub-routine in many privacy-preserving algorithms for statistics and machine-learning. Previous algorithms for this problem are either range-dependent---i.e., their utility diminishes with the size of the universe...

Tri-maximal vs. bi-maximal neutrino mixing

International Nuclear Information System (INIS)

Scott, W.G

2000-01-01

It is argued that data from atmospheric and solar neutrino experiments point strongly to tri-maximal or bi-maximal lepton mixing. While ('optimised') bi-maximal mixing gives an excellent a posteriori fit to the data, tri-maximal mixing is an a priori hypothesis, which is not excluded, taking account of terrestrial matter effects

Theoretical Guidelines for the Utilization of Instructional Social Networking Websites

Directory of Open Access Journals (Sweden)

Ilker YAKIN

2015-10-01

Full Text Available interaction and communication technologies. Indeed, there has been an emerging movement in the interaction and communication technologies. More specifically, the growth of Web 2.0 technologies has acted as a catalyst for change in the disciplines of education. The social networking websites have gained popularity in recent years; therefore, many research studies have been conducted to explain how the use of social networking websites for instructional purposes. For the best practices, it is essential to understand theories associated with social networking studies because related theories for any subject may provide insights and guideline for professionals and researchers. This theoretical paper was designed to offer a road map through the literature in relation to the utilization of social networking websites by presenting main understandings of theories associated with social networking. The Uses and Gratification Theory, social network theory, connectives, and constructivism were selected to serve as a basis for designing social networking studies regarding instructional purposes. Moreover, common attributes of the theories and specific application areas were also discussed. This paper contributes to this emerging movement by explaining the role of these theories for researchers and practitioners to find ways to beneficially integrate them into their future research endeavors

Influence maximization in complex networks through optimal percolation

Science.gov (United States)

Morone, Flaviano; Makse, Hernan; CUNY Collaboration; CUNY Collaboration

The whole frame of interconnections in complex networks hinges on a specific set of structural nodes, much smaller than the total size, which, if activated, would cause the spread of information to the whole network, or, if immunized, would prevent the diffusion of a large scale epidemic. Localizing this optimal, that is, minimal, set of structural nodes, called influencers, is one of the most important problems in network science. Here we map the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix of the network. Big data analyses reveal that the set of optimal influencers is much smaller than the one predicted by previous heuristic centralities. Remarkably, a large number of previously neglected weakly connected nodes emerges among the optimal influencers. Reference: F. Morone, H. A. Makse, Nature 524,65-68 (2015)

The moderating role of social networks in the relationship between alcohol consumption and treatment utilization for alcohol-related problems

Science.gov (United States)

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

Utilizing social networks, blogging and YouTube in allergy and immunology practices.

Science.gov (United States)

Dimov, Ves; Eidelman, Frank

2015-01-01

Online social networks are used to connect with friends and family members, and increasingly, to stay up-to-date with the latest news and developments in allergy and immunology. As communication is a central part of healthcare delivery, the utilization of such networking channels in allergy and immunology will continue to grow. There are inherent risks to online social networks related to breaches of patient confidentiality, professionalism and privacy. Malpractice and liability risks should also be considered. There is a paucity of information in the literature on how social network interventions affect patient outcomes. The allergy and immunology community should direct future studies towards investigating how the use of social networks and other technology tools and services can improve patient care.

Quantum communication network utilizing quadripartite entangled states of optical field

International Nuclear Information System (INIS)

Shen Heng; Su Xiaolong; Jia Xiaojun; Xie Changde

2009-01-01

We propose two types of quantum dense coding communication networks with optical continuous variables, in which a quadripartite entangled state of the optical field with totally three-party correlations of quadrature amplitudes is utilized. In the networks, the exchange of information between any two participants can be manipulated by one or two of the remaining participants. The channel capacities for a variety of communication protocols are numerically calculated. Due to the fact that the quadripartite entangled states applied in the communication systems have been successfully prepared already in the laboratory, the proposed schemes are experimentally accessible at present.

Coding for Parallel Links to Maximize the Expected Value of Decodable Messages

Science.gov (United States)

Klimesh, Matthew A.; Chang, Christopher S.

2011-01-01

When multiple parallel communication links are available, it is useful to consider link-utilization strategies that provide tradeoffs between reliability and throughput. Interesting cases arise when there are three or more available links. Under the model considered, the links have known probabilities of being in working order, and each link has a known capacity. The sender has a number of messages to send to the receiver. Each message has a size and a value (i.e., a worth or priority). Messages may be divided into pieces arbitrarily, and the value of each piece is proportional to its size. The goal is to choose combinations of messages to send on the links so that the expected value of the messages decodable by the receiver is maximized. There are three parts to the innovation: (1) Applying coding to parallel links under the model; (2) Linear programming formulation for finding the optimal combinations of messages to send on the links; and (3) Algorithms for assisting in finding feasible combinations of messages, as support for the linear programming formulation. There are similarities between this innovation and methods developed in the field of network coding. However, network coding has generally been concerned with either maximizing throughput in a fixed network, or robust communication of a fixed volume of data. In contrast, under this model, the throughput is expected to vary depending on the state of the network. Examples of error-correcting codes that are useful under this model but which are not needed under previous models have been found. This model can represent either a one-shot communication attempt, or a stream of communications. Under the one-shot model, message sizes and link capacities are quantities of information (e.g., measured in bits), while under the communications stream model, message sizes and link capacities are information rates (e.g., measured in bits/second). This work has the potential to increase the value of data returned from

Algorithmic network monitoring for a modern water utility: a case study in Jerusalem.

Science.gov (United States)

Armon, A; Gutner, S; Rosenberg, A; Scolnicov, H

2011-01-01

We report on the design, deployment, and use of TaKaDu, a real-time algorithmic Water Infrastructure Monitoring solution, with a strong focus on water loss reduction and control. TaKaDu is provided as a commercial service to several customers worldwide. It has been in use at HaGihon, the Jerusalem utility, since mid 2009. Water utilities collect considerable real-time data from their networks, e.g. by means of a SCADA system and sensors measuring flow, pressure, and other data. We discuss how an algorithmic statistical solution analyses this wealth of raw data, flexibly using many types of input and picking out and reporting significant events and failures in the network. Of particular interest to most water utilities is the early detection capability for invisible leaks, also a means for preventing large visible bursts. The system also detects sensor and SCADA failures, various water quality issues, DMA boundary breaches, unrecorded or unintended network changes (like a valve or pump state change), and other events, including types unforeseen during system design. We discuss results from use at HaGihon, showing clear operational value.

Resource allocation via sum-rate maximization in the uplink of multi-cell OFDMA networks

KAUST Repository

Tabassum, Hina

2012-10-03

In this paper, we consider maximizing the sum rate in the uplink of a multi-cell orthogonal frequency-division multiple access network. The problem has a non-convex combinatorial structure and is known to be NP-hard. Because of the inherent complexity of implementing the optimal solution, firstly, we derive an upper bound (UB) and a lower bound (LB) to the optimal average network throughput. Moreover, we investigate the performance of a near-optimal single cell resource allocation scheme in the presence of inter-cell interference, which leads to another easily computable LB. We then develop a centralized sub-optimal scheme that is composed of a geometric programming-based power control phase in conjunction with an iterative subcarrier allocation phase. Although the scheme is computationally complex, it provides an effective benchmark for low complexity schemes even without the power control phase. Finally, we propose less complex centralized and distributed schemes that are well suited for practical scenarios. The computational complexity of all schemes is analyzed, and the performance is compared through simulations. Simulation results demonstrate that the proposed low complexity schemes can achieve comparable performance with that of the centralized sub-optimal scheme in various scenarios. Moreover, comparisons with the UB and LB provide insight on the performance gap between the proposed schemes and the optimal solution. Copyright © 2011 John Wiley & Sons, Ltd.

State of the art of the virtual utility: the smart distributed generation network

International Nuclear Information System (INIS)

Coll-Mayor, D.; Picos, R.; Garcia-Moreno, E.

2004-01-01

The world of energy has lately experienced a revolution, and new rules are being defined. The climate change produced by the greenhouse gases, the inefficiency of the energy system or the lack of power supply infrastructure in most of the poor countries, the liberalization of the energy market and the development of new technologies in the field of distributed generation (DG) are the key factors of this revolution. It seems clear that the solution at the moment is the DG. The advantage of DG is the energy generation close to the demand point. It means that DG can lower costs, reduce emissions, or expand the energy options of the consumers. DG may add redundancy that increases grid security even while powering emergency lighting or other critical systems and reduces power losses in the electricity distribution. After the development of the different DG and high efficiency technologies such as co-generation and tri-generation, the next step in the DG world is the interconnection of different small distributed generation facilities which act together in a DG network as a large power plant controlled by a centralized energy management system (EMS). The main aim of the EMS is to reach the targets of low emissions and high efficiency. The EMS gives priority to renewable energy sources instead of the use of fossil fuels. This new concept of energy infrastructure is referred to as virtual utility (VU). The VU can be defined as a new model of energy infrastructure which consists of integrating different kind of distributed generation utilities in an energy (electricity and heat) generation network controlled by a central energy management system (EMS). The electricity production in the network is subordinated to the heat necessity of every user. The thermal energy is consumed on site; the electricity is generated and distributed in the entire network. The network is composed of one centralized control with the EMS and different clusters of distributed generation utilities

Changes of glucose utilization by erythrocytes, lactic acid concentration in the serum and blood cells, and haematocrit value during one hour rest after maximal effort in individuals differing in physical efficiency.

Science.gov (United States)

Tomasik, M

1982-01-01

Glucose utilization by the erythrocytes, lactic acid concentration in the blood and erythrocytes, and haematocrit value were determined before exercise and during one hour rest following maximal exercise in 97 individuals of either sex differing in physical efficiency. In the investigations reported by the author individuals with strikingly high physical fitness performed maximal work one-third greater than that performed by individuals with medium fitness. The serum concentration of lactic acid was in all individuals above the resting value still after 60 minutes of rest. On the other hand, this concentration returned to the normal level in the erythrocytes but only in individuals with strikingly high efficiency. Glucose utilization by the erythrocytes during the restitution period was highest immediately after the exercise in all studied individuals and showed a tendency for more rapid return to resting values again in individuals with highest efficiency. The investigation of very efficient individuals repeated twice demonstrated greater utilization of glucose by the erythrocytes at the time of greater maximal exercise. This was associated with greater lactic acid concentration in the serum and erythrocytes throughout the whole one-hour rest period. The observed facts suggest an active participation of erythrocytes in the process of adaptation of the organism to exercise.

Utility, games, and narratives

OpenAIRE

Fioretti, Guido

2009-01-01

This paper provides a general overview of theories and tools to model individual and collective decision-making. In particular, stress is laid on the interaction of several decision-makers. A substantial part of this paper is devoted to utility maximization and its application to collective decision-making, Game Theory. However, the pitfalls of utility maximization are thoroughly discussed, and the radically alternative approach of viewing decision-making as constructing narratives is pre...

Influence maximization in complex networks through optimal percolation

Science.gov (United States)

Morone, Flaviano; Makse, Hernán A.

2015-08-01

The whole frame of interconnections in complex networks hinges on a specific set of structural nodes, much smaller than the total size, which, if activated, would cause the spread of information to the whole network, or, if immunized, would prevent the diffusion of a large scale epidemic. Localizing this optimal, that is, minimal, set of structural nodes, called influencers, is one of the most important problems in network science. Despite the vast use of heuristic strategies to identify influential spreaders, the problem remains unsolved. Here we map the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix of the network. Big data analyses reveal that the set of optimal influencers is much smaller than the one predicted by previous heuristic centralities. Remarkably, a large number of previously neglected weakly connected nodes emerges among the optimal influencers. These are topologically tagged as low-degree nodes surrounded by hierarchical coronas of hubs, and are uncovered only through the optimal collective interplay of all the influencers in the network. The present theoretical framework may hold a larger degree of universality, being applicable to other hard optimization problems exhibiting a continuous transition from a known phase.

Utilizing social networking sites to promote adolescents' health: a pragmatic review of the literature.

Science.gov (United States)

Francomano, Jesse A; Harpin, Scott B

2015-01-01

Social networking site use has exploded among youth in the last few years and is being adapted as an important tool for healthcare interventions and serving as a platform for adolescents to gain access to health information. The aim of this study was to examine the strengths, weaknesses, and best practices of utilizing Facebook in adolescent health promotion and research via pragmatic literature review. We also examine how sites can facilitate ethically sound healthcare for adolescents, particularly at-risk youth. We conducted a literature review of health and social sciences literature from the past 5 years related to adolescent health and social network site use. Publications were grouped by shared content then categorized by themes. Five themes emerged: access to healthcare information, peer support and networking, risk and benefits of social network site use in care delivery, overcoming technological barriers, and social network site interventions. More research is needed to better understand how such Web sites can be better utilized to provide access to adolescents seeking healthcare. Given the broad reach of social network sites, all health information must be closely monitored for accurate, safe distribution. Finally, consent and privacy issues are omnipresent in social network sites, which calls for standards of ethical use.

Status of Utilizing Social Media Networks in the Teaching-Learning Process at Public Jordanian Universities

Directory of Open Access Journals (Sweden)

Muneera Abdalkareem Alshdefait

2018-03-01

Full Text Available This study aimed at finding out the status of utilizing social media networks in the teaching-learning process at public Jordanian Universities. To achieve the goal of the study, the descriptive developmental method was used and a questionnaire was developed, consisting of (35 statements. The questionnaire was checked for its validity and reliability. Then it was distributed to a sample of (382 male and female students from the undergraduate and graduate levels. The study results showed that the participants gave a low score to the status of utilizing social media networks in the teaching-learning process at public Jordanian universities. The results also showed that there were statistically significant differences between the participants of the study according to the academic rank attributed to the graduate students, and according to gender attributed to male students at the instrument macro level and on all dimensions of the two variables. In light of these results, the study recommended that public universities should utilize modern technology in the educational process, urge and encourage the teaching staff members to use the social media networks in the teaching-learning process and raise the students' awareness about the benefits of using social media networks. Keywords: Social media networks, Teaching-learning process, Public Jordanian Universities

Energy efficiency and SINR maximization beamformers for cognitive radio utilizing sensing information

KAUST Repository

Alabbasi, AbdulRahman; Rezki, Zouheir; Shihada, Basem

2014-01-01

communication using adaptive beamforming schemes combined with the sensing information to achieve an optimal energy efficient system. The proposed schemes maximize the energy efficiency and SINR metrics subject to cognitive radio and quality of service

Incentivize Spectrum Leasing in Cognitive Radio Networks by Exploiting Cooperative Retransmission

Directory of Open Access Journals (Sweden)

Xiaoyan Wang

2015-07-01

Full Text Available This paper addresses the spectrum leasing issue in cognitive radio networks by exploiting the secondary user’s cooperative retransmission. In contrast with the previous researches that focuses on cancellationbased or coding-based cooperative retransmissions, we propose a novel trading-based mechanism to facilitate the cooperative retransmission for cognitive radio networks. By utilizing the Stackelberg game model, we incentivize the otherwise non-cooperative users by maximizing their utilities in terms of transmission rates and economic profit. We analyze the existence of the unique Nash equilibrium of the game, and provide the optimal solutions with corresponding constraints. Numerical results demonstrate the efficiency of the proposed mechanism, under which the performance of the whole system could be substantially improved.

Quantum speedup in solving the maximal-clique problem

Science.gov (United States)

Chang, Weng-Long; Yu, Qi; Li, Zhaokai; Chen, Jiahui; Peng, Xinhua; Feng, Mang

2018-03-01

The maximal-clique problem, to find the maximally sized clique in a given graph, is classically an NP-complete computational problem, which has potential applications ranging from electrical engineering, computational chemistry, and bioinformatics to social networks. Here we develop a quantum algorithm to solve the maximal-clique problem for any graph G with n vertices with quadratic speedup over its classical counterparts, where the time and spatial complexities are reduced to, respectively, O (√{2n}) and O (n2) . With respect to oracle-related quantum algorithms for the NP-complete problems, we identify our algorithm as optimal. To justify the feasibility of the proposed quantum algorithm, we successfully solve a typical clique problem for a graph G with two vertices and one edge by carrying out a nuclear magnetic resonance experiment involving four qubits.

Self-consistent collective-coordinate method for ''maximally-decoupled'' collective subspace and its boson mapping: Quantum theory of ''maximally-decoupled'' collective motion

International Nuclear Information System (INIS)

Marumori, T.; Sakata, F.; Maskawa, T.; Une, T.; Hashimoto, Y.

1983-01-01

The main purpose of this paper is to develop a full quantum theory, which is capable by itself of determining a ''maximally-decoupled'' collective motion. The paper is divided into two parts. In the first part, the motivation and basic idea of the theory are explained, and the ''maximal-decoupling condition'' on the collective motion is formulated within the framework of the time-dependent Hartree-Fock theory, in a general form called the invariance principle of the (time-dependent) Schrodinger equation. In the second part, it is shown that when the author positively utilize the invariance principle, we can construct a full quantum theory of the ''maximally-decoupled'' collective motion. This quantum theory is shown to be a generalization of the kinematical boson-mapping theories so far developed, in such a way that the dynamical ''maximal-decoupling condition'' on the collective motion is automatically satisfied

Maximizing performance of fuel cell using artificial neural network approach for smart grid applications

International Nuclear Information System (INIS)

Bicer, Y.; Dincer, I.; Aydin, M.

2016-01-01

This paper presents an artificial neural network (ANN) approach of a smart grid integrated proton exchange membrane (PEM) fuel cell and proposes a neural network model of a 6 kW PEM fuel cell. The data required to train the neural network model are generated by a model of 6 kW PEM fuel cell. After the model is trained and validated, it is used to analyze the dynamic behavior of the PEM fuel cell. The study results demonstrate that the model based on neural network approach is appropriate for predicting the outlet parameters. Various types of training methods, sample numbers and sample distribution methods are utilized to compare the results. The fuel cell stack efficiency considerably varies between 20% and 60%, according to input variables and models. The rapid changes in the input variables can be recovered within a short time period, such as 10 s. The obtained response graphs point out the load tracking features of ANN model and the projected changes in the input variables are controlled quickly in the study. - Highlights: • An ANN approach of a proton exchange membrane (PEM) fuel cell is proposed. • Dynamic behavior of the PEM fuel cell is analyzed. • The effects of various variables on model accuracy are investigated. • Response curves indicate the load following characteristics of the model.

Energy efficiency and SINR maximization beamformers for cognitive radio utilizing sensing information

KAUST Repository

Alabbasi, Abdulrahman

2014-06-01

In this paper we consider a cognitive radio multi-input multi-output environment in which we adapt our beamformer to maximize both energy efficiency and signal to interference plus noise ratio (SINR) metrics. Our design considers an underlaying communication using adaptive beamforming schemes combined with the sensing information to achieve an optimal energy efficient system. The proposed schemes maximize the energy efficiency and SINR metrics subject to cognitive radio and quality of service constraints. Since the optimization of energy efficiency problem is not a convex problem, we transform it into a standard semi-definite programming (SDP) form to guarantee a global optimal solution. Analytical solution is provided for one scheme, while the other scheme is left in a standard SDP form. Selected numerical results are used to quantify the impact of the sensing information on the proposed schemes compared to the benchmark ones.

Research on the Prediction Model of CPU Utilization Based on ARIMA-BP Neural Network

Directory of Open Access Journals (Sweden)

Wang Jina

2016-01-01

Full Text Available The dynamic deployment technology of the virtual machine is one of the current cloud computing research focuses. The traditional methods mainly work after the degradation of the service performance that usually lag. To solve the problem a new prediction model based on the CPU utilization is constructed in this paper. A reference offered by the new prediction model of the CPU utilization is provided to the VM dynamic deployment process which will speed to finish the deployment process before the degradation of the service performance. By this method it not only ensure the quality of services but also improve the server performance and resource utilization. The new prediction method of the CPU utilization based on the ARIMA-BP neural network mainly include four parts: preprocess the collected data, build the predictive model of ARIMA-BP neural network, modify the nonlinear residuals of the time series by the BP prediction algorithm and obtain the prediction results by analyzing the above data comprehensively.

Principles of Selection, Implementation and Utilization of RFID in Supply Chain Management

Directory of Open Access Journals (Sweden)

Juraj Vaculik

2009-01-01

Full Text Available The paper deals with RFID (Radio Frequency Identificationimplementation and utilization within supply chain managementand also includes the economic feasibility of rollingout RFID. The members of the supply chain networks- suppliers,manufacturers and distributors - will operate independentlyfrom one another and according to their own agendas.This type of unmanaged network, howeve1; results in inefficiencies.The manufacturer might have a goal of maximizing productionin order to minimize unit costs. Clearly, all members ofthe supply chain stand to gain by coordinating their efforts toimprove efficiency and overall supply chain performance. Thisarticle is divided into three parts: Supply chain, Economic feasibilityof rolling out RFID and Processes of Supply chain management.

Allocating service parts in two-echelon networks at a utility company

NARCIS (Netherlands)

van den Berg, D.; van der Heijden, Matthijs C.; Schuur, Peter

2014-01-01

We study a multi-item, two-echelon, continuous-review inventory problem at a Dutch utility company, Liander. We develop a model that optimizes the quantities of service parts and their allocation in the two-echelon network under an aggregate waiting time restriction. Specific aspects that we address

Visualizing deep neural network by alternately image blurring and deblurring.

Science.gov (United States)

Wang, Feng; Liu, Haijun; Cheng, Jian

2018-01-01

Visualization from trained deep neural networks has drawn massive public attention in recent. One of the visualization approaches is to train images maximizing the activation of specific neurons. However, directly maximizing the activation would lead to unrecognizable images, which cannot provide any meaningful information. In this paper, we introduce a simple but effective technique to constrain the optimization route of the visualization. By adding two totally inverse transformations, image blurring and deblurring, to the optimization procedure, recognizable images can be created. Our algorithm is good at extracting the details in the images, which are usually filtered by previous methods in the visualizations. Extensive experiments on AlexNet, VGGNet and GoogLeNet illustrate that we can better understand the neural networks utilizing the knowledge obtained by the visualization. Copyright © 2017 Elsevier Ltd. All rights reserved.

Path selection and bandwidth allocation in MPLS networks: a nonlinear programming approach

Science.gov (United States)

Burns, J. E.; Ott, Teunis J.; de Kock, Johan M.; Krzesinski, Anthony E.

2001-07-01

Multi-protocol Label Switching extends the IPv4 destination-based routing protocols to provide new and scalable routing capabilities in connectionless networks using relatively simple packet forwarding mechanisms. MPLS networks carry traffic on virtual connections called label switched paths. This paper considers path selection and bandwidth allocation in MPLS networks in order to optimize the network quality of service. The optimization is based upon the minimization of a non-linear objective function which under light load simplifies to OSPF routing with link metrics equal to the link propagation delays. The behavior under heavy load depends on the choice of certain parameters: It can essentially be made to minimize maximal expected utilization, or to maximize minimal expected weighted slacks (both over all links). Under certain circumstances it can be made to minimize the probability that a link has an instantaneous offered load larger than its transmission capacity. We present a model of an MPLS network and an algorithm to find and capacitate optimal LSPs. The algorithm is an improvement of the well-known flow deviation non-linear programming method. The algorithm is applied to compute optimal LSPs for several test networks carrying a single traffic class.

A hybridised variable neighbourhood tabu search heuristic to increase security in a utility network

International Nuclear Information System (INIS)

Janssens, Jochen; Talarico, Luca; Sörensen, Kenneth

2016-01-01

We propose a decision model aimed at increasing security in a utility network (e.g., electricity, gas, water or communication network). The network is modelled as a graph, the edges of which are unreliable. We assume that all edges (e.g., pipes, cables) have a certain, not necessarily equal, probability of failure, which can be reduced by selecting edge-specific security strategies. We develop a mathematical programming model and a metaheuristic approach that uses a greedy random adaptive search procedure to find an initial solution and uses tabu search hybridised with iterated local search and a variable neighbourhood descend heuristic to improve this solution. The main goal is to reduce the risk of service failure between an origin and a destination node by selecting the right combination of security measures for each network edge given a limited security budget. - Highlights: • A decision model aimed at increasing security in a utility network is proposed. • The goal is to reduce the risk of service failure given a limited security budget. • An exact approach and a variable neighbourhood tabu search heuristic are developed. • A generator for realistic networks is built and used to test the solution methods. • The hybridised heuristic reduces the total risk on average with 32%.

Optimal assignment of multiple utilities in heat exchange networks

International Nuclear Information System (INIS)

Salama, A.I.A.

2009-01-01

Existing numerical geometry-based techniques, developed by [A.I.A. Salama, Numerical techniques for determining heat energy targets in pinch analysis, Computers and Chemical Engineering 29 (2005) 1861-1866; A.I.A. Salama, Determination of the optimal heat energy targets in heat pinch analysis using a geometry-based approach, Computers and Chemical Engineering 30 (2006) 758-764], have been extended to optimally assign multiple utilities in heat exchange network (HEN). These techniques utilize the horizontal shift between the cold composite curve (CC) and the stationary hot CC to determine the HEN optimal energy targets, grand composite curve (GCC), and the complement grand composite curve (CGCC). The proposed numerical technique developed in this paper is direct and simultaneously determines the optimal heat-energy targets and optimally assigns multiple utilities as compared with an existing technique based on sequential assignment of multiple utilities. The technique starts by arranging in an ascending order the HEN stream and target temperatures, and the resulting set is labelled T. Furthermore, the temperature sets where multiple utilities are introduced are arranged in an ascending order and are labelled T ic and T ih for the cold and hot sides, respectively. The graphical presentation of the results is facilitated by the insertion at each multiple-utility temperature a perturbed temperature equals the insertion temperature minus a small perturbation. Furthermore, using the heat exchanger network (HEN) minimum temperature-differential approach (ΔT min ) and stream heat-capacity flow rates, the presentation is facilitated by using the conventional temperature shift of the HEN CCs. The set of temperature-shifted stream and target temperatures and perturbed temperatures in the overlap range between the CCs is labelled T ol . Using T ol , a simple formula employing enthalpy-flow differences between the hot composite curve CC h and the cold composite curve CC c is

Influence Maximization in Social Networks with Genetic Algorithms

NARCIS (Netherlands)

Bucur, Doina; Iacca, Giovanni; Squillero, Giovanni; Burelli, Paolo

We live in a world of social networks. Our everyday choices are often influenced by social interactions. Word of mouth, meme diffusion on the Internet, and viral marketing are all examples of how social networks can affect our behaviour. In many practical applications, it is of great interest to

Opportunistic spectrum utilization in vehicular communication networks

CERN Document Server

Cheng, Nan

2016-01-01

This brief examines current research on improving Vehicular Networks (VANETs), examining spectrum scarcity due to the dramatic growth of mobile data traffic and the limited bandwidth of dedicated vehicular communication bands and the use of opportunistic spectrum bands to mitigate congestion. It reviews existing literature on the use of opportunistic spectrum bands for VANETs, including licensed and unlicensed spectrum bands and a variety of related technologies, such as cognitive radio, WiFi and device-to-device communications. Focused on analyzing spectrum characteristics, designing efficient spectrum exploitation schemes, and evaluating the date delivery performance when utilizing different opportunistic spectrum bands, the results presented in this brief provide valuable insights on improving the design and deployment of future VANETs.

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 solu...... 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...... 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......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...

Optimization of Multiple Related Negotiation through Multi-Negotiation Network

Science.gov (United States)

Ren, Fenghui; Zhang, Minjie; Miao, Chunyan; Shen, Zhiqi

In this paper, a Multi-Negotiation Network (MNN) and a Multi- Negotiation Influence Diagram (MNID) are proposed to optimally handle Multiple Related Negotiations (MRN) in a multi-agent system. Most popular, state-of-the-art approaches perform MRN sequentially. However, a sequential procedure may not optimally execute MRN in terms of maximizing the global outcome, and may even lead to unnecessary losses in some situations. The motivation of this research is to use a MNN to handle MRN concurrently so as to maximize the expected utility of MRN. Firstly, both the joint success rate and the joint utility by considering all related negotiations are dynamically calculated based on a MNN. Secondly, by employing a MNID, an agent's possible decision on each related negotiation is reflected by the value of expected utility. Lastly, through comparing expected utilities between all possible policies to conduct MRN, an optimal policy is generated to optimize the global outcome of MRN. The experimental results indicate that the proposed approach can improve the global outcome of MRN in a successful end scenario, and avoid unnecessary losses in an unsuccessful end scenario.

An auxiliary graph based dynamic traffic grooming algorithm in spatial division multiplexing enabled elastic optical networks with multi-core fibers

Science.gov (United States)

Zhao, Yongli; Tian, Rui; Yu, Xiaosong; Zhang, Jiawei; Zhang, Jie

2017-03-01

A proper traffic grooming strategy in dynamic optical networks can improve the utilization of bandwidth resources. An auxiliary graph (AG) is designed to solve the traffic grooming problem under a dynamic traffic scenario in spatial division multiplexing enabled elastic optical networks (SDM-EON) with multi-core fibers. Five traffic grooming policies achieved by adjusting the edge weights of an AG are proposed and evaluated through simulation: maximal electrical grooming (MEG), maximal optical grooming (MOG), maximal SDM grooming (MSG), minimize virtual hops (MVH), and minimize physical hops (MPH). Numeric results show that each traffic grooming policy has its own features. Among different traffic grooming policies, an MPH policy can achieve the lowest bandwidth blocking ratio, MEG can save the most transponders, and MSG can obtain the fewest cores for each request.

The Value of Sustainable Knowledge Transfer Methods for SMEs, Utilizing Socio-Technical Networks and Complex Systems

Directory of Open Access Journals (Sweden)

Susu Nousala

2010-12-01

Full Text Available This paper will examine the development of sustainable SME methods for tracking tacit (informal knowledge transfer as a series of networks of larger complex system. Understanding sustainable systems begins with valuing tacit knowledge networks and their ability to produce connections on multiple levels. The behaviour of the social or socio aspects of a system in relation to the explicit formal/physical structures need to be understood and actively considered when utilizing methodologies for interacting within complex systems structures. This paper utilizes theory from several previous studies to underpin the key case study discussed. This approach involved examining the behavioural phenomena of an SME knowledge network. The knowledge network elements were highlighted to identify their value within an SME structure. To understand the value of these emergent elements from between tacit and explicit knowledge networks, is to actively, simultaneously and continuous support sustainable development for SME organizations. The simultaneous links within and between groups of organizations is crucial for understanding sustainable networking structures of complex systems.

Power maximization of variable-speed variable-pitch wind turbines using passive adaptive neural fault tolerant control

Science.gov (United States)

Habibi, Hamed; Rahimi Nohooji, Hamed; Howard, Ian

2017-09-01

Power maximization has always been a practical consideration in wind turbines. The question of how to address optimal power capture, especially when the system dynamics are nonlinear and the actuators are subject to unknown faults, is significant. This paper studies the control methodology for variable-speed variable-pitch wind turbines including the effects of uncertain nonlinear dynamics, system fault uncertainties, and unknown external disturbances. The nonlinear model of the wind turbine is presented, and the problem of maximizing extracted energy is formulated by designing the optimal desired states. With the known system, a model-based nonlinear controller is designed; then, to handle uncertainties, the unknown nonlinearities of the wind turbine are estimated by utilizing radial basis function neural networks. The adaptive neural fault tolerant control is designed passively to be robust on model uncertainties, disturbances including wind speed and model noises, and completely unknown actuator faults including generator torque and pitch actuator torque. The Lyapunov direct method is employed to prove that the closed-loop system is uniformly bounded. Simulation studies are performed to verify the effectiveness of the proposed method.

Clinical Telemedicine Utilization in Ontario over the Ontario Telemedicine Network.

Science.gov (United States)

O'Gorman, Laurel D; Hogenbirk, John C; Warry, Wayne

2016-06-01

Northern Ontario is a region in Canada with approximately 775,000 people in communities scattered across 803,000 km(2). The Ontario Telemedicine Network (OTN) facilitates access to medical care in areas that are often underserved. We assessed how OTN utilization differed throughout the province. We used OTN medical service utilization data collected through the Ontario Health Insurance Plan and provided by the Ministry of Health and Long Term Care. Using census subdivisions grouped by Northern and Southern Ontario as well as urban and rural areas, we calculated utilization rates per fiscal year and total from 2008/2009 to 2013/2014. We also used billing codes to calculate utilization by therapeutic area of care. There were 652,337 OTN patient visits in Ontario from 2008/2009 to 2013/2014. Median annual utilization rates per 1,000 people were higher in northern areas (rural, 52.0; urban, 32.1) than in southern areas (rural, 6.1; urban, 3.1). The majority of usage in Ontario was in mental health and addictions (61.8%). Utilization in other areas of care such as surgery, oncology, and internal medicine was highest in the rural north, whereas primary care use was highest in the urban south. Utilization was higher and therapeutic areas of care were more diverse in rural Northern Ontario than in other parts of the province. Utilization was also higher in urban Northern Ontario than in Southern Ontario. This suggests that telemedicine is being used to improve access to medical care services, especially in sparsely populated regions of the province.

Phenomenology of maximal and near-maximal lepton mixing

International Nuclear Information System (INIS)

Gonzalez-Garcia, M. C.; Pena-Garay, Carlos; Nir, Yosef; Smirnov, Alexei Yu.

2001-01-01

The possible existence of maximal or near-maximal lepton mixing constitutes an intriguing challenge for fundamental theories of flavor. We study the phenomenological consequences of maximal and near-maximal mixing of the electron neutrino with other (x=tau and/or muon) neutrinos. We describe the deviations from maximal mixing in terms of a parameter ε(equivalent to)1-2sin 2 θ ex and quantify the present experimental status for |ε| e mixing comes from solar neutrino experiments. We find that the global analysis of solar neutrino data allows maximal mixing with confidence level better than 99% for 10 -8 eV 2 ∼ 2 ∼ -7 eV 2 . In the mass ranges Δm 2 ∼>1.5x10 -5 eV 2 and 4x10 -10 eV 2 ∼ 2 ∼ -7 eV 2 the full interval |ε| e mixing in atmospheric neutrinos, supernova neutrinos, and neutrinoless double beta decay

Asymptotic expansion for the resistance between two maximally separated nodes on an M by N resistor network.

Science.gov (United States)

Izmailian, N Sh; Huang, Ming-Chang

2010-07-01

We analyze the exact formulas for the resistance between two arbitrary notes in a rectangular network of resistors under free, periodic and cylindrical boundary conditions obtained by Wu [J. Phys. A 37, 6653 (2004)]. Based on such expression, we then apply the algorithm of Ivashkevich, Izmailian, and Hu [J. Phys. A 35, 5543 (2002)] to derive the exact asymptotic expansions of the resistance between two maximally separated nodes on an M×N rectangular network of resistors with resistors r and s in the two spatial directions. Our results is 1/s (R(M×N))(r,s) = c(ρ)ln S + c(0)(ρ,ξ) + ∑(p=1)(∞) (c(2p)(ρ,ξ))/S(p) with S = MN, ρ = r/s and ξ = M/N. The all coefficients in this expansion are expressed through analytical functions. We have introduced the effective aspect ratio ξeff = square root(ρ)ξ for free and periodic boundary conditions and ξeff = square root(ρ)ξ/2 for cylindrical boundary condition and show that all finite-size correction terms are invariant under transformation ξeff→1/ξeff.

Maximizing Light Utilization Efficiency and Hydrogen Production in Microalgal Cultures

Energy Technology Data Exchange (ETDEWEB)

Melis, Anastasios [Univ. of California, Berkeley, CA (United States)

2014-12-31

The project addressed the following technical barrier from the Biological Hydrogen Production section of the Fuel Cell Technologies Program Multi-Year Research, Development and Demonstration Plan: Low Sunlight Utilization Efficiency in Photobiological Hydrogen Production is due to a Large Photosystem Chlorophyll Antenna Size in Photosynthetic Microorganisms (Barrier AN: Light Utilization Efficiency).

Short-term electricity prices forecasting in a competitive market: A neural network approach

International Nuclear Information System (INIS)

Catalao, J.P.S.; Mariano, S.J.P.S.; Mendes, V.M.F.; Ferreira, L.A.F.M.

2007-01-01

This paper proposes a neural network approach for forecasting short-term electricity prices. Almost until the end of last century, electricity supply was considered a public service and any price forecasting which was undertaken tended to be over the longer term, concerning future fuel prices and technical improvements. Nowadays, short-term forecasts have become increasingly important since the rise of the competitive electricity markets. In this new competitive framework, short-term price forecasting is required by producers and consumers to derive their bidding strategies to the electricity market. Accurate forecasting tools are essential for producers to maximize their profits, avowing profit losses over the misjudgement of future price movements, and for consumers to maximize their utilities. A three-layered feedforward neural network, trained by the Levenberg-Marquardt algorithm, is used for forecasting next-week electricity prices. We evaluate the accuracy of the price forecasting attained with the proposed neural network approach, reporting the results from the electricity markets of mainland Spain and California. (author)

Coverage-maximization in networks under resource constraints.

Science.gov (United States)

Nandi, Subrata; Brusch, Lutz; Deutsch, Andreas; Ganguly, Niloy

2010-06-01

Efficient coverage algorithms are essential for information search or dispersal in all kinds of networks. We define an extended coverage problem which accounts for constrained resources of consumed bandwidth B and time T . Our solution to the network challenge is here studied for regular grids only. Using methods from statistical mechanics, we develop a coverage algorithm with proliferating message packets and temporally modulated proliferation rate. The algorithm performs as efficiently as a single random walker but O(B(d-2)/d) times faster, resulting in significant service speed-up on a regular grid of dimension d . The algorithm is numerically compared to a class of generalized proliferating random walk strategies and on regular grids shown to perform best in terms of the product metric of speed and efficiency.

Twitch interpolation technique in testing of maximal muscle strength

DEFF Research Database (Denmark)

Bülow, P M; Nørregaard, J; Danneskiold-Samsøe, B

1993-01-01

The aim was to study the methodological aspects of the muscle twitch interpolation technique in estimating the maximal force of contraction in the quadriceps muscle utilizing commercial muscle testing equipment. Six healthy subjects participated in seven sets of experiments testing the effects...

GPP Webinar: Solar Utilization in Higher Education Networking & Information Sharing Group: Financing Issues Discussion

Science.gov (United States)

This presentation from a Solar Utilization in Higher Education Networking and Information webinar covers financing and project economics issues related to solar project development in the higher education sector.

An inkjet-printed UWB antenna on paper substrate utilizing a novel fractal matching network

KAUST Repository

Cook, Benjamin Stassen

2012-07-01

In this work, the smallest reported inkjet-printed UWB antenna is proposed that utilizes a fractal matching network to increase the performance of a UWB microstrip monopole. The antenna is inkjet-printed on a paper substrate to demonstrate the ability to produce small and low-cost UWB antennas with inkjet-printing technology which can enable compact, low-cost, and environmentally friendly wireless sensor network. © 2012 IEEE.

Network marketing on a small-world network

Science.gov (United States)

Kim, Beom Jun; Jun, Tackseung; Kim, Jeong-Yoo; Choi, M. Y.

2006-02-01

We investigate a dynamic model of network marketing in a small-world network structure artificially constructed similarly to the Watts-Strogatz network model. Different from the traditional marketing, consumers can also play the role of the manufacturer's selling agents in network marketing, which is stimulated by the referral fee the manufacturer offers. As the wiring probability α is increased from zero to unity, the network changes from the one-dimensional regular directed network to the star network where all but one player are connected to one consumer. The price p of the product and the referral fee r are used as free parameters to maximize the profit of the manufacturer. It is observed that at α=0 the maximized profit is constant independent of the network size N while at α≠0, it increases linearly with N. This is in parallel to the small-world transition. It is also revealed that while the optimal value of p stays at an almost constant level in a broad range of α, that of r is sensitive to a change in the network structure. The consumer surplus is also studied and discussed.

Design of optimal linear antennas with maximally flat radiation patterns

Science.gov (United States)

Minkovich, B. M.; Mints, M. Ia.

1990-02-01

The paper presents an explicit solution to the problem of maximizing the aperture area utilization coefficient and obtaining the best approximation in the mean of the sectorial U-shaped radiation pattern of a linear antenna, when Butterworth flattening constraints are imposed on the approximating pattern. Constraints are established on the choice of the smallest and large antenna dimensions that make it possible to obtain maximally flat patterns, having a low sidelobe level and free from pulsations within the main lobe.

A P2P Query Algorithm for Opportunistic Networks Utilizing betweenness Centrality Forwarding

Directory of Open Access Journals (Sweden)

Jianwei Niu

2013-01-01

Full Text Available With the proliferation of high-end mobile devices that feature wireless interfaces, many promising applications are enabled in opportunistic networks. In contrary to traditional networks, opportunistic networks utilize the mobility of nodes to relay messages in a store-carry-forward paradigm. Thus, the relay process in opportunistic networks faces several practical challenges in terms of delay and delivery rate. In this paper, we propose a novel P2P Query algorithm, namely Betweenness Centrality Forwarding (PQBCF, for opportunistic networking. PQBCF adopts a forwarding metric called Betweenness Centrality (BC, which is borrowed from social network, to quantify the active degree of nodes in the networks. In PQBCF, nodes with a higher BC are preferable to serve as relays, leading to higher query success rate and lower query delay. A comparison with the state-of-the-art algorithms reveals that PQBCF can provide better performance on both the query success Ratio and query delay, and approaches the performance of Epidemic Routing (ER with much less resource consumption.

Probability of islanding in utility networks due to grid connected photovoltaic power systems

Energy Technology Data Exchange (ETDEWEB)

Verhoeven, B.

2002-09-15

This report for the International Energy Agency (IEA) made by Task 5 of the Photovoltaic Power Systems (PVPS) programme takes a look at the probability of islanding in utility networks due to grid-connected photovoltaic power systems. The mission of the Photovoltaic Power Systems Programme is to enhance the international collaboration efforts which accelerate the development and deployment of photovoltaic solar energy. Task 5 deals with issues concerning grid-interconnection and distributed PV power systems. This report summarises the results on a study on the probability of islanding in power networks with a high penetration level of grid connected PV-systems. The results are based on measurements performed during one year in a Dutch utility network. The measurements of active and reactive power were taken every second for two years and stored in a computer for off-line analysis. The area examined and its characteristics are described, as are the test set-up and the equipment used. The ratios between load and PV-power are discussed. The general conclusion is that the probability of islanding is virtually zero for low, medium and high penetration levels of PV-systems.

In-House Communication Support System Based on the Information Propagation Model Utilizes Social Network

Science.gov (United States)

Takeuchi, Susumu; Teranishi, Yuuichi; Harumoto, Kaname; Shimojo, Shinji

Almost all companies are now utilizing computer networks to support speedier and more effective in-house information-sharing and communication. However, existing systems are designed to support communications only within the same department. Therefore, in our research, we propose an in-house communication support system which is based on the “Information Propagation Model (IPM).” The IPM is proposed to realize word-of-mouth communication in a social network, and to support information-sharing on the network. By applying the system in a real company, we found that information could be exchanged between different and unrelated departments, and such exchanges of information could help to build new relationships between the users who are apart on the social network.

A relative rate utility based distributed power allocation algorithm for Cognitive Radio Networks

DEFF Research Database (Denmark)

Mahmood, Nurul Huda; Øien, G.E.; Lundheim, L.

2012-01-01

In an underlay Cognitive Radio Network, multiple secondary users coexist geographically and spectrally with multiple primary users under a constraint on the maximum received interference power at the primary receivers. Given such a setting, one may ask "how to achieve maximum utility benefit...

Transforming Musical Signals through a Genre Classifying Convolutional Neural Network

Science.gov (United States)

Geng, S.; Ren, G.; Ogihara, M.

2017-05-01

Convolutional neural networks (CNNs) have been successfully applied on both discriminative and generative modeling for music-related tasks. For a particular task, the trained CNN contains information representing the decision making or the abstracting process. One can hope to manipulate existing music based on this 'informed' network and create music with new features corresponding to the knowledge obtained by the network. In this paper, we propose a method to utilize the stored information from a CNN trained on musical genre classification task. The network was composed of three convolutional layers, and was trained to classify five-second song clips into five different genres. After training, randomly selected clips were modified by maximizing the sum of outputs from the network layers. In addition to the potential of such CNNs to produce interesting audio transformation, more information about the network and the original music could be obtained from the analysis of the generated features since these features indicate how the network 'understands' the music.

Lewis Research Center studies of multiple large wind turbine generators on a utility network

Science.gov (United States)

Gilbert, L. J.; Triezenberg, D. M.

1979-01-01

A NASA-Lewis program to study the anticipated performance of a wind turbine generator farm on an electric utility network is surveyed. The paper describes the approach of the Lewis Wind Energy Project Office to developing analysis capabilities in the area of wind turbine generator-utility network computer simulations. Attention is given to areas such as, the Lewis Purdue hybrid simulation, an independent stability study, DOE multiunit plant study, and the WEST simulator. Also covered are the Lewis mod-2 simulation including analog simulation of a two wind turbine system and comparison with Boeing simulation results, and gust response of a two machine model. Finally future work to be done is noted and it is concluded that the study shows little interaction between the generators and between the generators and the bus.

BAKNET - Communication network for radiation monitoring devices

International Nuclear Information System (INIS)

Cohen, Y.; Wengrowicz, U.; Tirosh, D.; Barak, D.

1997-01-01

A system, based on a new concept of controlling and monitoring distributed radiation monitors, has been developed and approved at the NRCN. The system, named B AKNET Network , consists of a series of communication adapters connected to a main PC via an RS-485 communication network (see Fig. 1). The network's maximal length is 1200 meters and it enables connection of up to 128 adapters. The BAKNET adapters are designed to interface output signals of different types of stationary radiation monitors to a main PC. The BAKNET adapters' interface type includes: digital, analog, RS-232, and mixed output signals. This allows versatile interfacing of different stationary radiation monitors to the main computer. The connection to the main computer is via an RS-485 network, utilizing an identical communication protocol. The PC software, written in C ++ under MS-Windows, consists of two main programs. The first is the data collection program and the second is the Human Machine Interface (HMI). (authors)

Maximal Bell's inequality violation for non-maximal entanglement

International Nuclear Information System (INIS)

Kobayashi, M.; Khanna, F.; Mann, A.; Revzen, M.; Santana, A.

2004-01-01

Bell's inequality violation (BIQV) for correlations of polarization is studied for a product state of two two-mode squeezed vacuum (TMSV) states. The violation allowed is shown to attain its maximal limit for all values of the squeezing parameter, ζ. We show via an explicit example that a state whose entanglement is not maximal allow maximal BIQV. The Wigner function of the state is non-negative and the average value of either polarization is nil

An efficient forward–reverse expectation-maximization algorithm for statistical inference in stochastic reaction networks

KAUST Repository

Bayer, Christian

2016-02-20

© 2016 Taylor & Francis Group, LLC. ABSTRACT: In this work, we present an extension of the forward–reverse representation introduced by Bayer and Schoenmakers (Annals of Applied Probability, 24(5):1994–2032, 2014) to the context of stochastic reaction networks (SRNs). We apply this stochastic representation to the computation of efficient approximations of expected values of functionals of SRN bridges, that is, SRNs conditional on their values in the extremes of given time intervals. We then employ this SRN bridge-generation technique to the statistical inference problem of approximating reaction propensities based on discretely observed data. To this end, we introduce a two-phase iterative inference method in which, during phase I, we solve a set of deterministic optimization problems where the SRNs are replaced by their reaction-rate ordinary differential equations approximation; then, during phase II, we apply the Monte Carlo version of the expectation-maximization algorithm to the phase I output. By selecting a set of overdispersed seeds as initial points in phase I, the output of parallel runs from our two-phase method is a cluster of approximate maximum likelihood estimates. Our results are supported by numerical examples.

An efficient forward-reverse expectation-maximization algorithm for statistical inference in stochastic reaction networks

KAUST Repository

Vilanova, Pedro

2016-01-07

In this work, we present an extension of the forward-reverse representation introduced in Simulation of forward-reverse stochastic representations for conditional diffusions , a 2014 paper by Bayer and Schoenmakers to the context of stochastic reaction networks (SRNs). We apply this stochastic representation to the computation of efficient approximations of expected values of functionals of SRN bridges, i.e., SRNs conditional on their values in the extremes of given time-intervals. We then employ this SRN bridge-generation technique to the statistical inference problem of approximating reaction propensities based on discretely observed data. To this end, we introduce a two-phase iterative inference method in which, during phase I, we solve a set of deterministic optimization problems where the SRNs are replaced by their reaction-rate ordinary differential equations approximation; then, during phase II, we apply the Monte Carlo version of the Expectation-Maximization algorithm to the phase I output. By selecting a set of over-dispersed seeds as initial points in phase I, the output of parallel runs from our two-phase method is a cluster of approximate maximum likelihood estimates. Our results are supported by numerical examples.

A 250-Mbit/s ring local computer network using 1.3-microns single-mode optical fibers

Science.gov (United States)

Eng, S. T.; Tell, R.; Andersson, T.; Eng, B.

1985-01-01

A 250-Mbit/s three-station fiber-optic ring local computer network was built and successfully demonstrated. A conventional token protocol was employed for bus arbitration to maximize the bus efficiency under high loading conditions, and a non-return-to-zero (NRS) data encoding format was selected for simplicity and maximum utilization of the ECL-circuit bandwidth.

Network approach for decision making under risk-How do we choose among probabilistic options with the same expected value?

Science.gov (United States)

Pan, Wei; Chen, Yi-Shin

2018-01-01

Conventional decision theory suggests that under risk, people choose option(s) by maximizing the expected utility. However, theories deal ambiguously with different options that have the same expected utility. A network approach is proposed by introducing 'goal' and 'time' factors to reduce the ambiguity in strategies for calculating the time-dependent probability of reaching a goal. As such, a mathematical foundation that explains the irrational behavior of choosing an option with a lower expected utility is revealed, which could imply that humans possess rationality in foresight.

Wireless Sensor Network-Based Service Provisioning by a Brokering Platform.

Science.gov (United States)

Guijarro, Luis; Pla, Vicent; Vidal, Jose R; Naldi, Maurizio; Mahmoodi, Toktam

2017-05-12

This paper proposes a business model for providing services based on the Internet of Things through a platform that intermediates between human users and Wireless Sensor Networks (WSNs). The platform seeks to maximize its profit through posting both the price charged to each user and the price paid to each WSN. A complete analysis of the profit maximization problem is performed in this paper. We show that the service provider maximizes its profit by incentivizing all users and all Wireless Sensor Infrastructure Providers (WSIPs) to join the platform. This is true not only when the number of users is high, but also when it is moderate, provided that the costs that the users bear do not trespass a cost ceiling. This cost ceiling depends on the number of WSIPs, on the value of the intrinsic value of the service and on the externality that the WSIP has on the user utility.

An Optimal Online Resource Allocation Algorithm for Energy Harvesting Body Area Networks

Directory of Open Access Journals (Sweden)

Guangyuan Wu

2018-01-01

Full Text Available In Body Area Networks (BANs, how to achieve energy management to extend the lifetime of the body area networks system is one of the most critical problems. In this paper, we design a body area network system powered by renewable energy, in which the sensors carried by patient with energy harvesting module can transmit data to a personal device. We do not require any a priori knowledge of the stochastic nature of energy harvesting and energy consumption. We formulate a user utility optimization problem. We use Lyapunov Optimization techniques to decompose the problem into three sub-problems, i.e., battery management, collecting rate control and transmission power allocation. We propose an online resource allocation algorithm to achieve two major goals: (1 balancing sensors’ energy harvesting and energy consumption while stabilizing the BANs system; and (2 maximizing the user utility. Performance analysis addresses required battery capacity, bounded data queue length and optimality of the proposed algorithm. Simulation results verify the optimization of algorithm.

Distributed cloud association in downlink multicloud radio access networks

KAUST Repository

Dahrouj, Hayssam

2015-03-01

This paper considers a multicloud radio access network (M-CRAN), wherein each cloud serves a cluster of base-stations (BS\\'s) which are connected to the clouds through high capacity digital links. The network comprises several remote users, where each user can be connected to one (and only one) cloud. This paper studies the user-to-cloud-assignment problem by maximizing a network-wide utility subject to practical cloud connectivity constraints. The paper solves the problem by using an auction-based iterative algorithm, which can be implemented in a distributed fashion through a reasonable exchange of information between the clouds. The paper further proposes a centralized heuristic algorithm, with low computational complexity. Simulations results show that the proposed algorithms provide appreciable performance improvements as compared to the conventional cloud-less assignment solutions. © 2015 IEEE.

Maximizing and customer loyalty: Are maximizers less loyal?

Directory of Open Access Journals (Sweden)

Linda Lai

2011-06-01

Full Text Available Despite their efforts to choose the best of all available solutions, maximizers seem to be more inclined than satisficers to regret their choices and to experience post-decisional dissonance. Maximizers may therefore be expected to change their decisions more frequently and hence exhibit lower customer loyalty to providers of products and services compared to satisficers. Findings from the study reported here (N = 1978 support this prediction. Maximizers reported significantly higher intentions to switch to another service provider (television provider than satisficers. Maximizers' intentions to switch appear to be intensified and mediated by higher proneness to regret, increased desire to discuss relevant choices with others, higher levels of perceived knowledge of alternatives, and higher ego involvement in the end product, compared to satisficers. Opportunities for future research are suggested.

Scheduling Data Access in Smart Grid Networks Utilizing Context Information

DEFF Research Database (Denmark)

Findrik, Mislav; Grønbæk, Jesper; Olsen, Rasmus Løvenstein

2014-01-01

Current electrical grid is facing increased penetration of intermittent energy resources, in particular wind and solar energy. Fast variability of the power supply due to renewable energy resources can be balanced out using different energy storage systems or shifting the loads. Efficiently...... managing this fast flexibility requires two-way data exchange between a controller and sensors/meters via communication networks. In this paper we investigated scheduling of data collection utilizing meta-data from sensors that are describing dynamics of information. We show the applicability...

An inkjet-printed UWB antenna on paper substrate utilizing a novel fractal matching network

KAUST Repository

Cook, Benjamin Stassen; Shamim, Atif

2012-01-01

In this work, the smallest reported inkjet-printed UWB antenna is proposed that utilizes a fractal matching network to increase the performance of a UWB microstrip monopole. The antenna is inkjet-printed on a paper substrate to demonstrate

Microeconomics-based resource allocation in overlay networks by using non-strategic behavior modeling

Science.gov (United States)

Analoui, Morteza; Rezvani, Mohammad Hossein

2011-01-01

Behavior modeling has recently been investigated for designing self-organizing mechanisms in the context of communication networks in order to exploit the natural selfishness of the users with the goal of maximizing the overall utility. In strategic behavior modeling, the users of the network are assumed to be game players who seek to maximize their utility with taking into account the decisions that the other players might make. The essential difference between the aforementioned researches and this work is that it incorporates the non-strategic decisions in order to design the mechanism for the overlay network. In this solution concept, the decisions that a peer might make does not affect the actions of the other peers at all. The theory of consumer-firm developed in microeconomics is a model of the non-strategic behavior that we have adopted in our research. Based on it, we have presented distributed algorithms for peers' "joining" and "leaving" operations. We have modeled the overlay network as a competitive economy in which the content provided by an origin server can be viewed as commodity and the origin server and the peers who multicast the content to their downside are considered as the firms. On the other hand, due to the dual role of the peers in the overlay network, they can be considered as the consumers as well. On joining to the overlay economy, each peer is provided with an income and tries to get hold of the service regardless to the behavior of the other peers. We have designed the scalable algorithms in such a way that the existence of equilibrium price (known as Walrasian equilibrium price) is guaranteed.

Network approach for decision making under risk—How do we choose among probabilistic options with the same expected value?

Science.gov (United States)

Chen, Yi-Shin

2018-01-01

Conventional decision theory suggests that under risk, people choose option(s) by maximizing the expected utility. However, theories deal ambiguously with different options that have the same expected utility. A network approach is proposed by introducing ‘goal’ and ‘time’ factors to reduce the ambiguity in strategies for calculating the time-dependent probability of reaching a goal. As such, a mathematical foundation that explains the irrational behavior of choosing an option with a lower expected utility is revealed, which could imply that humans possess rationality in foresight. PMID:29702665

Network approach for decision making under risk-How do we choose among probabilistic options with the same expected value?

Directory of Open Access Journals (Sweden)

Wei Pan

Full Text Available Conventional decision theory suggests that under risk, people choose option(s by maximizing the expected utility. However, theories deal ambiguously with different options that have the same expected utility. A network approach is proposed by introducing 'goal' and 'time' factors to reduce the ambiguity in strategies for calculating the time-dependent probability of reaching a goal. As such, a mathematical foundation that explains the irrational behavior of choosing an option with a lower expected utility is revealed, which could imply that humans possess rationality in foresight.

Generalized Cartographic and Simultaneous Representation of Utility Networks for Decision-Support Systems and Crisis Management in Urban Environments

Science.gov (United States)

Becker, T.; König, G.

2015-10-01

Cartographic visualizations of crises are used to create a Common Operational Picture (COP) and enforce Situational Awareness by presenting relevant information to the involved actors. As nearly all crises affect geospatial entities, geo-data representations have to support location-specific analysis throughout the decision-making process. Meaningful cartographic presentation is needed for coordinating the activities of crisis manager in a highly dynamic situation, since operators' attention span and their spatial memories are limiting factors during the perception and interpretation process. Situational Awareness of operators in conjunction with a COP are key aspects in decision-making process and essential for making well thought-out and appropriate decisions. Considering utility networks as one of the most complex and particularly frequent required systems in urban environment, meaningful cartographic presentation of multiple utility networks with respect to disaster management do not exist. Therefore, an optimized visualization of utility infrastructure for emergency response procedures is proposed. The article will describe a conceptual approach on how to simplify, aggregate, and visualize multiple utility networks and their components to meet the requirements of the decision-making process and to support Situational Awareness.

Refined reservoir description to maximize oil recovery

International Nuclear Information System (INIS)

Flewitt, W.E.

1975-01-01

To assure maximized oil recovery from older pools, reservoir description has been advanced by fully integrating original open-hole logs and the recently introduced interpretive techniques made available through cased-hole wireline saturation logs. A refined reservoir description utilizing normalized original wireline porosity logs has been completed in the Judy Creek Beaverhill Lake ''A'' Pool, a reefal carbonate pool with current potential productivity of 100,000 BOPD and 188 active wells. Continuous porosity was documented within a reef rim and cap while discontinuous porous lenses characterized an interior lagoon. With the use of pulsed neutron logs and production data a separate water front and pressure response was recognized within discrete environmental units. The refined reservoir description aided in reservoir simulation model studies and quantifying pool performance. A pattern water flood has now replaced the original peripheral bottom water drive to maximize oil recovery

Spectrum Sharing Based on a Bertrand Game in Cognitive Radio Sensor Networks

Directory of Open Access Journals (Sweden)

Biqing Zeng

2017-01-01

Full Text Available In the study of power control and allocation based on pricing, the utility of secondary users is usually studied from the perspective of the signal to noise ratio. The study of secondary user utility from the perspective of communication demand can not only promote the secondary users to meet the maximum communication needs, but also to maximize the utilization of spectrum resources, however, research in this area is lacking, so from the viewpoint of meeting the demand of network communication, this paper designs a two stage model to solve spectrum leasing and allocation problem in cognitive radio sensor networks (CRSNs. In the first stage, the secondary base station collects the secondary network communication requirements, and rents spectrum resources from several primary base stations using the Bertrand game to model the transaction behavior of the primary base station and secondary base station. The second stage, the subcarriers and power allocation problem of secondary base stations is defined as a nonlinear programming problem to be solved based on Nash bargaining. The simulation results show that the proposed model can satisfy the communication requirements of each user in a fair and efficient way compared to other spectrum sharing schemes.

PEM-PCA: A Parallel Expectation-Maximization PCA Face Recognition Architecture

Directory of Open Access Journals (Sweden)

Kanokmon Rujirakul

2014-01-01

Full Text Available Principal component analysis or PCA has been traditionally used as one of the feature extraction techniques in face recognition systems yielding high accuracy when requiring a small number of features. However, the covariance matrix and eigenvalue decomposition stages cause high computational complexity, especially for a large database. Thus, this research presents an alternative approach utilizing an Expectation-Maximization algorithm to reduce the determinant matrix manipulation resulting in the reduction of the stages’ complexity. To improve the computational time, a novel parallel architecture was employed to utilize the benefits of parallelization of matrix computation during feature extraction and classification stages including parallel preprocessing, and their combinations, so-called a Parallel Expectation-Maximization PCA architecture. Comparing to a traditional PCA and its derivatives, the results indicate lower complexity with an insignificant difference in recognition precision leading to high speed face recognition systems, that is, the speed-up over nine and three times over PCA and Parallel PCA.

PEM-PCA: a parallel expectation-maximization PCA face recognition architecture.

Science.gov (United States)

Rujirakul, Kanokmon; So-In, Chakchai; Arnonkijpanich, Banchar

2014-01-01

Principal component analysis or PCA has been traditionally used as one of the feature extraction techniques in face recognition systems yielding high accuracy when requiring a small number of features. However, the covariance matrix and eigenvalue decomposition stages cause high computational complexity, especially for a large database. Thus, this research presents an alternative approach utilizing an Expectation-Maximization algorithm to reduce the determinant matrix manipulation resulting in the reduction of the stages' complexity. To improve the computational time, a novel parallel architecture was employed to utilize the benefits of parallelization of matrix computation during feature extraction and classification stages including parallel preprocessing, and their combinations, so-called a Parallel Expectation-Maximization PCA architecture. Comparing to a traditional PCA and its derivatives, the results indicate lower complexity with an insignificant difference in recognition precision leading to high speed face recognition systems, that is, the speed-up over nine and three times over PCA and Parallel PCA.

Multi-objective optimization for the maximization of the operating share of cogeneration system in District Heating Network

International Nuclear Information System (INIS)

Franco, Alessandro; Versace, Michele

2017-01-01

Highlights: • Combined Heat and Power plants and civil/residential energy uses. • CHP plant supported by auxiliary boilers and thermal energy storage. • Definition of optimal operational strategies for cogeneration plants for District Heating. • Optimal-sized Thermal Energy Storage and a hybrid operational strategy. • Maximization of cogeneration share and reduction of time of operation of auxiliary boilers. - Abstract: The aim of the paper is to define optimal operational strategies for Combined Heat and Power plants connected to civil/residential District Heating Networks. The role of a reduced number of design variables, including a Thermal Energy Storage system and a hybrid operational strategy dependent on the storage level, is considered. The basic principle is to reach maximum efficiency of the system operation through the utilization of an optimal-sized Thermal Energy Storage. Objective functions of both energetic and combined energetic and economic can be considered. In particular, First and Second Law Efficiency, thermal losses of the storage, number of starts and stops of the combined heat and power unit are considered. Constraints are imposed to nullify the waste of heat and to operate the unit at its maximum efficiency for the highest possible number of consecutive operating hours, until the thermal tank cannot store more energy. The methodology is applied to a detailed case study: a medium size district heating system, in an urban context in the northern Italy, powered by a combined heat and power plant supported by conventional auxiliary boilers. The issues involving this type of thermal loads are also widely investigated in the paper. An increase of Second Law Efficiency of the system of 26% (from 0.35 to 0.44) can be evidenced, while the First Law Efficiency shifts from about 0.74 to 0.84. The optimization strategy permits of combining the economic benefit of cogeneration with the idea of reducing the energy waste and exergy losses.

Joint Resource Allocation for Dual - Band Heterogeneous Wireless Network

DEFF Research Database (Denmark)

Adeogun, Ramoni

2018-01-01

In this paper, we investigate downlink resource allocation in two-tier OFDMA heterogeneous networks comprising a macrocell transmitting at a microwave frequency and dual band small cells utilizing both microwave and millimeter wave frequencies. A non - cooperative game theoretic approach...... is proposed for adaptively switching the SC transmission frequency based on the location of small cell users and interference to macrocell users. We propose a resource allocation approach which maximizes the sum rate of small cell users while minimizing interference to macrocell users and the total power...

Diagnosis method utilizing neural networks

International Nuclear Information System (INIS)

Watanabe, K.; Tamayama, K.

1990-01-01

Studies have been made on the technique of neural networks, which will be used to identify a cause of a small anomalous state in the reactor coolant system of the ATR (Advance Thermal Reactor). Three phases of analyses were carried out in this study. First, simulation for 100 seconds was made to determine how the plant parameters respond after the occurence of a transient decrease in reactivity, flow rate and temperature of feed water and increase in the steam flow rate and steam pressure, which would produce a decrease of water level in a steam drum of the ATR. Next, the simulation data was analysed utilizing an autoregressive model. From this analysis, a total of 36 coherency functions up to 0.5 Hz in each transient were computed among nine important and detectable plant parameters: neutron flux, flow rate of coolant, steam or feed water, water level in the steam drum, pressure and opening area of control valve in a steam pipe, feed water temperature and electrical power. Last, learning of neural networks composed of 96 input, 4-9 hidden and 5 output layer units was done by use of the generalized delta rule, namely a back-propagation algorithm. These convergent computations were continued as far as the difference between the desired outputs, 1 for direct cause or 0 for four other ones and actual outputs reached less than 10%. (1) Coherency functions were not governed by decreasing rate of reactivity in the range of 0.41x10 -2 dollar/s to 1.62x10 -2 dollar /s or by decreasing depth of the feed water temperature in the range of 3 deg C to 10 deg C or by a change of 10% or less in the three other causes. Change in coherency functions only depended on the type of cause. (2) The direct cause from the other four ones could be discriminated with 0.94+-0.01 of output level. A maximum of 0.06 output height was found among the other four causes. (3) Calculation load which is represented as products of learning times and numbers of the hidden units did not depend on the

Characterization and assessment of voltage and power constraints of DFIG WT connected to a weak network

DEFF Research Database (Denmark)

Abulanwar, Elsayed; Hu, Weihao; Iov, Florin

2014-01-01

This article thoroughly investigates the challenges and constraints raised by the integration of a Doubly-fed Induction generator wind turbine, DFIG WT, into an ac network of extensively varying parameters and very weak conditions. The objective is to mitigate the voltage variations at the point...... of common coupling, PCC, and maximize the wind power penetration into weak networks. As a basis of investigation, a simplified system model is utilized and the respective PCC voltage, active and reactive power stability issues are identified. Besides, a steady-state study for DFIG WT connected to a weak...

Principles of maximally classical and maximally realistic quantum ...

Indian Academy of Sciences (India)

Principles of maximally classical and maximally realistic quantum mechanics. S M ROY. Tata Institute of Fundamental Research, Homi Bhabha Road, Mumbai 400 005, India. Abstract. Recently Auberson, Mahoux, Roy and Singh have proved a long standing conjecture of Roy and Singh: In 2N-dimensional phase space, ...

Fault Reconnaissance Agent for Sensor Networks

Directory of Open Access Journals (Sweden)

Elhadi M. Shakshuki

2010-01-01

Full Text Available One of the key prerequisite for a scalable, effective and efficient sensor network is the utilization of low-cost, low-overhead and high-resilient fault-inference techniques. To this end, we propose an intelligent agent system with a problem solving capability to address the issue of fault inference in sensor network environments. The intelligent agent system is designed and implemented at base-station side. The core of the agent system – problem solver – implements a fault-detection inference engine which harnesses Expectation Maximization (EM algorithm to estimate fault probabilities of sensor nodes. To validate the correctness and effectiveness of the intelligent agent system, a set of experiments in a wireless sensor testbed are conducted. The experimental results show that our intelligent agent system is able to precisely estimate the fault probability of sensor nodes.

Power allocation for target detection in radar networks based on low probability of intercept: A cooperative game theoretical strategy

Science.gov (United States)

Shi, Chenguang; Salous, Sana; Wang, Fei; Zhou, Jianjiang

2017-08-01

Distributed radar network systems have been shown to have many unique features. Due to their advantage of signal and spatial diversities, radar networks are attractive for target detection. In practice, the netted radars in radar networks are supposed to maximize their transmit power to achieve better detection performance, which may be in contradiction with low probability of intercept (LPI). Therefore, this paper investigates the problem of adaptive power allocation for radar networks in a cooperative game-theoretic framework such that the LPI performance can be improved. Taking into consideration both the transmit power constraints and the minimum signal to interference plus noise ratio (SINR) requirement of each radar, a cooperative Nash bargaining power allocation game based on LPI is formulated, whose objective is to minimize the total transmit power by optimizing the power allocation in radar networks. First, a novel SINR-based network utility function is defined and utilized as a metric to evaluate power allocation. Then, with the well-designed network utility function, the existence and uniqueness of the Nash bargaining solution are proved analytically. Finally, an iterative Nash bargaining algorithm is developed that converges quickly to a Pareto optimal equilibrium for the cooperative game. Numerical simulations and theoretic analysis are provided to evaluate the effectiveness of the proposed algorithm.

Implications of maximal Jarlskog invariant and maximal CP violation

International Nuclear Information System (INIS)

Rodriguez-Jauregui, E.; Universidad Nacional Autonoma de Mexico

2001-04-01

We argue here why CP violating phase Φ in the quark mixing matrix is maximal, that is, Φ=90 . In the Standard Model CP violation is related to the Jarlskog invariant J, which can be obtained from non commuting Hermitian mass matrices. In this article we derive the conditions to have Hermitian mass matrices which give maximal Jarlskog invariant J and maximal CP violating phase Φ. We find that all squared moduli of the quark mixing elements have a singular point when the CP violation phase Φ takes the value Φ=90 . This special feature of the Jarlskog invariant J and the quark mixing matrix is a clear and precise indication that CP violating Phase Φ is maximal in order to let nature treat democratically all of the quark mixing matrix moduli. (orig.)

Generative Adversarial Networks Based Heterogeneous Data Integration and Its Application for Intelligent Power Distribution and Utilization

Directory of Open Access Journals (Sweden)

Yuanpeng Tan

2018-01-01

Full Text Available Heterogeneous characteristics of a big data system for intelligent power distribution and utilization have already become more and more prominent, which brings new challenges for the traditional data analysis technologies and restricts the comprehensive management of distribution network assets. In order to solve the problem that heterogeneous data resources of power distribution systems are difficult to be effectively utilized, a novel generative adversarial networks (GANs based heterogeneous data integration method for intelligent power distribution and utilization is proposed. In the proposed method, GANs theory is introduced to expand the distribution of completed data samples. Then, a so-called peak clustering algorithm is proposed to realize the finite open coverage of the expanded sample space, and repair those incomplete samples to eliminate the heterogeneous characteristics. Finally, in order to realize the integration of the heterogeneous data for intelligent power distribution and utilization, the well-trained discriminator model of GANs is employed to check the restored data samples. The simulation experiments verified the validity and stability of the proposed heterogeneous data integration method, which provides a novel perspective for the further data quality management of power distribution systems.

Optimization of workflow scheduling in Utility Management System with hierarchical neural network

Directory of Open Access Journals (Sweden)

Srdjan Vukmirovic

2011-08-01

Full Text Available Grid computing could be the future computing paradigm for enterprise applications, one of its benefits being that it can be used for executing large scale applications. Utility Management Systems execute very large numbers of workflows with very high resource requirements. This paper proposes architecture for a new scheduling mechanism that dynamically executes a scheduling algorithm using feedback about the current status Grid nodes. Two Artificial Neural Networks were created in order to solve the scheduling problem. A case study is created for the Meter Data Management system with measurements from the Smart Metering system for the city of Novi Sad, Serbia. Performance tests show that significant improvement of overall execution time can be achieved by Hierarchical Artificial Neural Networks.

Spectral and Energy Efficiencies in mmWave Cellular Networks for Optimal Utilization

Directory of Open Access Journals (Sweden)

Abdulbaset M. Hamed

2018-01-01

Full Text Available Millimeter wave (mmWave spectrum has been proposed for use in commercial cellular networks to relieve the already severely congested microwave spectrum. Thus, the design of an efficient mmWave cellular network has gained considerable importance and has to take into account regulations imposed by government agencies with regard to global warming and sustainable development. In this paper, a dense mmWave hexagonal cellular network with each cell consisting of a number of smaller cells with their own Base Stations (BSs is presented as a solution to meet the increasing demand for a variety of high data rate services and growing number of users of cellular networks. Since spectrum and power are critical resources in the design of such a network, a framework is presented that addresses efficient utilization of these resources in mmWave cellular networks in the 28 and 73 GHz bands. These bands are already an integral part of well-known standards such as IEEE 802.15.3c, IEEE 802.11ad, and IEEE 802.16.1. In the analysis, a well-known accurate mmWave channel model for Line of Sight (LOS and Non-Line of Sight (NLOS links is used. The cellular network is analyzed in terms of spectral efficiency, bit/s, energy efficiency, bit/J, area spectral efficiency, bit/s/m2, area energy efficiency, bit/J/m2, and network latency, s/bit. These efficiency metrics are illustrated, using Monte Carlo simulation, as a function of Signal-to-Noise Ratio (SNR, channel model parameters, user distance from BS, and BS transmission power. The efficiency metrics for optimum deployment of cellular networks in 28 and 73 GHz bands are identified. Results show that 73 GHz band achieves better spectrum efficiency and the 28 GHz band is superior in terms of energy efficiency. It is observed that while the latter band is expedient for indoor networks, the former band is appropriate for outdoor networks.

Statistical complexity is maximized in a small-world brain.

Directory of Open Access Journals (Sweden)

Teck Liang Tan

Full Text Available In this paper, we study a network of Izhikevich neurons to explore what it means for a brain to be at the edge of chaos. To do so, we first constructed the phase diagram of a single Izhikevich excitatory neuron, and identified a small region of the parameter space where we find a large number of phase boundaries to serve as our edge of chaos. We then couple the outputs of these neurons directly to the parameters of other neurons, so that the neuron dynamics can drive transitions from one phase to another on an artificial energy landscape. Finally, we measure the statistical complexity of the parameter time series, while the network is tuned from a regular network to a random network using the Watts-Strogatz rewiring algorithm. We find that the statistical complexity of the parameter dynamics is maximized when the neuron network is most small-world-like. Our results suggest that the small-world architecture of neuron connections in brains is not accidental, but may be related to the information processing that they do.

Dopaminergic balance between reward maximization and policy complexity

Directory of Open Access Journals (Sweden)

Naama eParush

2011-05-01

Full Text Available Previous reinforcement-learning models of the basal ganglia network have highlighted the role of dopamine in encoding the mismatch between prediction and reality. Far less attention has been paid to the computational goals and algorithms of the main-axis (actor. Here, we construct a top-down model of the basal ganglia with emphasis on the role of dopamine as both a reinforcement learning signal and as a pseudo-temperature signal controlling the general level of basal ganglia excitability and motor vigilance of the acting agent. We argue that the basal ganglia endow the thalamic-cortical networks with the optimal dynamic tradeoff between two constraints: minimizing the policy complexity (cost and maximizing the expected future reward (gain. We show that this multi-dimensional optimization processes results in an experience-modulated version of the softmax behavioral policy. Thus, as in classical softmax behavioral policies, probability of actions are selected according to their estimated values and the pseudo-temperature, but in addition also vary according to the frequency of previous choices of these actions. We conclude that the computational goal of the basal ganglia is not to maximize cumulative (positive and negative reward. Rather, the basal ganglia aim at optimization of independent gain and cost functions. Unlike previously suggested single-variable maximization processes, this multi-dimensional optimization process leads naturally to a softmax-like behavioral policy. We suggest that beyond its role in the modulation of the efficacy of the cortico-striatal synapses, dopamine directly affects striatal excitability and thus provides a pseudo-temperature signal that modulates the trade-off between gain and cost. The resulting experience and dopamine modulated softmax policy can then serve as a theoretical framework to account for the broad range of behaviors and clinical states governed by the basal ganglia and dopamine systems.

Maximizers versus satisficers

Directory of Open Access Journals (Sweden)

Andrew M. Parker

2007-12-01

Full Text Available Our previous research suggests that people reporting a stronger desire to maximize obtain worse life outcomes (Bruine de Bruin et al., 2007. Here, we examine whether this finding may be explained by the decision-making styles of self-reported maximizers. Expanding on Schwartz et al. (2002, we find that self-reported maximizers are more likely to show problematic decision-making styles, as evidenced by self-reports of less behavioral coping, greater dependence on others when making decisions, more avoidance of decision making, and greater tendency to experience regret. Contrary to predictions, self-reported maximizers were more likely to report spontaneous decision making. However, the relationship between self-reported maximizing and worse life outcomes is largely unaffected by controls for measures of other decision-making styles, decision-making competence, and demographic variables.

Simulation of emergency response operations for a static chemical spill within a building using an opportunistic resource utilization network

NARCIS (Netherlands)

Lilien, L.T.; Elbes, M.W.; Ben Othmane, L.; Salih, R.M.

2013-01-01

We investigate supporting emergency response operations with opportunistic resource utilization networks ("oppnets"), based on a network paradigm for inviting and integrating diverse devices and systems available in the environment. We simulate chemical spill on a single floor of a building and

Maximize Minimum Utility Function of Fractional Cloud Computing System Based on Search Algorithm Utilizing the Mittag-Leffler Sum

Directory of Open Access Journals (Sweden)

Rabha W. Ibrahim

2018-01-01

Full Text Available The maximum min utility function (MMUF problem is an important representative of a large class of cloud computing systems (CCS. Having numerous applications in practice, especially in economy and industry. This paper introduces an effective solution-based search (SBS algorithm for solving the problem MMUF. First, we suggest a new formula of the utility function in term of the capacity of the cloud. We formulate the capacity in CCS, by using a fractional diffeo-integral equation. This equation usually describes the flow of CCS. The new formula of the utility function is modified recent active utility functions. The suggested technique first creates a high-quality initial solution by eliminating the less promising components, and then develops the quality of the achieved solution by the summation search solution (SSS. This method is considered by the Mittag-Leffler sum as hash functions to determine the position of the agent. Experimental results commonly utilized in the literature demonstrate that the proposed algorithm competes approvingly with the state-of-the-art algorithms both in terms of solution quality and computational efficiency.

Optimal Battery Utilization Over Lifetime for Parallel Hybrid Electric Vehicle to Maximize Fuel Economy

Energy Technology Data Exchange (ETDEWEB)

Patil, Chinmaya; Naghshtabrizi, Payam; Verma, Rajeev; Tang, Zhijun; Smith, Kandler; Shi, Ying

2016-08-01

This paper presents a control strategy to maximize fuel economy of a parallel hybrid electric vehicle over a target life of the battery. Many approaches to maximizing fuel economy of parallel hybrid electric vehicle do not consider the effect of control strategy on the life of the battery. This leads to an oversized and underutilized battery. There is a trade-off between how aggressively to use and 'consume' the battery versus to use the engine and consume fuel. The proposed approach addresses this trade-off by exploiting the differences in the fast dynamics of vehicle power management and slow dynamics of battery aging. The control strategy is separated into two parts, (1) Predictive Battery Management (PBM), and (2) Predictive Power Management (PPM). PBM is the higher level control with slow update rate, e.g. once per month, responsible for generating optimal set points for PPM. The considered set points in this paper are the battery power limits and State Of Charge (SOC). The problem of finding the optimal set points over the target battery life that minimize engine fuel consumption is solved using dynamic programming. PPM is the lower level control with high update rate, e.g. a second, responsible for generating the optimal HEV energy management controls and is implemented using model predictive control approach. The PPM objective is to find the engine and battery power commands to achieve the best fuel economy given the battery power and SOC constraints imposed by PBM. Simulation results with a medium duty commercial hybrid electric vehicle and the proposed two-level hierarchical control strategy show that the HEV fuel economy is maximized while meeting a specified target battery life. On the other hand, the optimal unconstrained control strategy achieves marginally higher fuel economy, but fails to meet the target battery life.

Quantitative utilization of prior biological knowledge in the Bayesian network modeling of gene expression data

Directory of Open Access Journals (Sweden)

Gao Shouguo

2011-08-01

Full Text Available Abstract Background Bayesian Network (BN is a powerful approach to reconstructing genetic regulatory networks from gene expression data. However, expression data by itself suffers from high noise and lack of power. Incorporating prior biological knowledge can improve the performance. As each type of prior knowledge on its own may be incomplete or limited by quality issues, integrating multiple sources of prior knowledge to utilize their consensus is desirable. Results We introduce a new method to incorporate the quantitative information from multiple sources of prior knowledge. It first uses the Naïve Bayesian classifier to assess the likelihood of functional linkage between gene pairs based on prior knowledge. In this study we included cocitation in PubMed and schematic similarity in Gene Ontology annotation. A candidate network edge reservoir is then created in which the copy number of each edge is proportional to the estimated likelihood of linkage between the two corresponding genes. In network simulation the Markov Chain Monte Carlo sampling algorithm is adopted, and samples from this reservoir at each iteration to generate new candidate networks. We evaluated the new algorithm using both simulated and real gene expression data including that from a yeast cell cycle and a mouse pancreas development/growth study. Incorporating prior knowledge led to a ~2 fold increase in the number of known transcription regulations recovered, without significant change in false positive rate. In contrast, without the prior knowledge BN modeling is not always better than a random selection, demonstrating the necessity in network modeling to supplement the gene expression data with additional information. Conclusion our new development provides a statistical means to utilize the quantitative information in prior biological knowledge in the BN modeling of gene expression data, which significantly improves the performance.

Contract-Based Incentive Mechanism for Mobile Crowdsourcing Networks

Directory of Open Access Journals (Sweden)

Nan Zhao

2017-09-01

Full Text Available Mobile crowdsourcing networks (MCNs are a promising method of data collecting and processing by leveraging the mobile devices’ sensing and computing capabilities. However, because of the selfish characteristics of the service provider (SP and mobile users (MUs, crowdsourcing participants only aim to maximize their own benefits. This paper investigates the incentive mechanism between the above two parties to create mutual benefits. By modeling MCNs as a labor market, a contract-based crowdsourcing model with moral hazard is proposed under the asymmetric information scenario. In order to incentivize the potential MUs to participate in crowdsourcing tasks, the optimization problem is formulated to maximize the SP’s utility by jointly examining the crowdsourcing participants’ risk preferences. The impact of crowdsourcing participants’ attitudes of risks on the incentive mechanism has been studied analytically and experimentally. Numerical simulation results demonstrate the effectiveness of the proposed contract design scheme for the crowdsourcing incentive.

Optimal Base Station Density of Dense Network: From the Viewpoint of Interference and Load.

Science.gov (United States)

Feng, Jianyuan; Feng, Zhiyong

2017-09-11

Network densification is attracting increasing attention recently due to its ability to improve network capacity by spatial reuse and relieve congestion by offloading. However, excessive densification and aggressive offloading can also cause the degradation of network performance due to problems of interference and load. In this paper, with consideration of load issues, we study the optimal base station density that maximizes the throughput of the network. The expected link rate and the utilization ratio of the contention-based channel are derived as the functions of base station density using the Poisson Point Process (PPP) and Markov Chain. They reveal the rules of deployment. Based on these results, we obtain the throughput of the network and indicate the optimal deployment density under different network conditions. Extensive simulations are conducted to validate our analysis and show the substantial performance gain obtained by the proposed deployment scheme. These results can provide guidance for the network densification.

A Local Scalable Distributed Expectation Maximization Algorithm for Large Peer-to-Peer Networks

Data.gov (United States)

National Aeronautics and Space Administration — This paper describes a local and distributed expectation maximization algorithm for learning parameters of Gaussian mixture models (GMM) in large peer-to-peer (P2P)...

CUFID-query: accurate network querying through random walk based network flow estimation.

Science.gov (United States)

Jeong, Hyundoo; Qian, Xiaoning; Yoon, Byung-Jun

2017-12-28

Functional modules in biological networks consist of numerous biomolecules and their complicated interactions. Recent studies have shown that biomolecules in a functional module tend to have similar interaction patterns and that such modules are often conserved across biological networks of different species. As a result, such conserved functional modules can be identified through comparative analysis of biological networks. In this work, we propose a novel network querying algorithm based on the CUFID (Comparative network analysis Using the steady-state network Flow to IDentify orthologous proteins) framework combined with an efficient seed-and-extension approach. The proposed algorithm, CUFID-query, can accurately detect conserved functional modules as small subnetworks in the target network that are expected to perform similar functions to the given query functional module. The CUFID framework was recently developed for probabilistic pairwise global comparison of biological networks, and it has been applied to pairwise global network alignment, where the framework was shown to yield accurate network alignment results. In the proposed CUFID-query algorithm, we adopt the CUFID framework and extend it for local network alignment, specifically to solve network querying problems. First, in the seed selection phase, the proposed method utilizes the CUFID framework to compare the query and the target networks and to predict the probabilistic node-to-node correspondence between the networks. Next, the algorithm selects and greedily extends the seed in the target network by iteratively adding nodes that have frequent interactions with other nodes in the seed network, in a way that the conductance of the extended network is maximally reduced. Finally, CUFID-query removes irrelevant nodes from the querying results based on the personalized PageRank vector for the induced network that includes the fully extended network and its neighboring nodes. Through extensive

Photon spectrometry utilizing neural networks

International Nuclear Information System (INIS)

Silveira, R.; Benevides, C.; Lima, F.; Vilela, E.

2015-01-01

Having in mind the time spent on the uneventful work of characterization of the radiation beams used in a ionizing radiation metrology laboratory, the Metrology Service of the Centro Regional de Ciencias Nucleares do Nordeste - CRCN-NE verified the applicability of artificial intelligence (artificial neural networks) to perform the spectrometry in photon fields. For this, was developed a multilayer neural network, as an application for the classification of patterns in energy, associated with a thermoluminescent dosimetric system (TLD-700 and TLD-600). A set of dosimeters was initially exposed to various well known medium energies, between 40 keV and 1.2 MeV, coinciding with the beams determined by ISO 4037 standard, for the dose of 10 mSv in the quantity Hp(10), on a chest phantom (ISO slab phantom) with the purpose of generating a set of training data for the neural network. Subsequently, a new set of dosimeters irradiated in unknown energies was presented to the network with the purpose to test the method. The methodology used in this work was suitable for application in the classification of energy beams, having obtained 100% of the classification performed. (authors)

Maximizing your ability to compete as a municipal electrical utility

International Nuclear Information System (INIS)

MacOdrum, B.

1996-01-01

The implications of the MacDonald Committee's recommendations on introducing competition to Ontario's electricity industry were reviewed from the point of view of Toronto Hydro, the largest municipal utility and Ontario Hydro's largest customer. Issues examined included (1) the consequences of unbundling Ontario Hydro's generating, transmission and distribution functions, (2) the structural change option of phasing-in competition among Ontario Hydro and municipal and other private generators, (3) enhancing the efficiency of the distribution sector, and (4) the relative benefits and consequences of private equity as a means of enhancing competition through the sale of Ontario Hydro's generating assets, or the sale of non-essential business operations. Recommendations to the Committee included the need for the transmission grid to remain under public control, for electricity pricing to take into account the variable environmental impact of different generating types, and the need for transferring regulatory authority over municipal electric utilities from Ontario Hydro to the Ontario Energy Board

Maximizing as a predictor of job satisfaction and performance: A tale of three scales

Directory of Open Access Journals (Sweden)

Nicole M. Giacopelli

2013-07-01

Full Text Available Research on individual differences in maximizing (versus satisficing has recently proliferated in the Judgment and Decision Making literature, and high scores on this construct have been linked to lower life satisfaction as well as, in some cases, to worse decision-making performance. The current study exported this construct to the organizational domain and evaluated the utility of the three most widely used measures of maximizing in predicting several criteria of interest to organizational researchers: job satisfaction, intentions to quit the organization, performance in the job role, and income. Moreover, this study used relative weight analyses to determine the relative importance of maximizing and two dispositional variables (conscientiousness and core self-evaluations that are traditionally used to predict these criteria in the organizational literature. Results indicate that relationships between maximizing and these criteria are influenced by the way in which maximizing is measured. Yet, regardless of how it is measured, maximizing is not a particularly strong predictor of these criteria compared to traditional organizational predictors. Limitations and future research directions are discussed.

Extraordinary variability and sharp transitions in a maximally frustrated dynamic network

Science.gov (United States)

Liu, Wenjia; Schmittmann, Beate; Zia, R. K. P.

2013-03-01

Most previous studies of complex networks have focused on single, static networks. However, in the real world, networks are dynamic and interconnected. Inspired by the presence of extroverts and introverts in the general population, we investigate a highly simplified model of a social network, involving two types of nodes: one preferring the highest degree possible, and one preferring no connections whatsoever. There are only two control parameters in the model: the number of ``introvert'' and ``extrovert'' nodes, NI and NE. Our key findings are as follows: As a function of NI and NE, the system exhibits a highly unusual transition, displaying extraordinary fluctuations (as in 2nd order transitions) and discontinuous jumps (characteristic of 1st order transitions). Most remarkably, the system can be described by an Ising-like Hamiltonian with long-range multi-spin interactions and some of its properties can be obtained analytically. This is in stark contrast with other dynamic network models which rely almost exclusively on simulations. NSF-DMR-1005417/1244666 and and ICTAS Virginia Tech

GPP Webinar: Solar Utilization in Higher Education Networking & Information Sharing Group: RFP, Contract, and Administrative Issues Discussion

Science.gov (United States)

This presentation from a Solar Utilization in Higher Education Networking and Information webinar covers contracts, Request for Proposals (RFPs), and administrative issues related to solar project development in the higher education sector.

Maximizers versus satisficers

OpenAIRE

Andrew M. Parker; Wandi Bruine de Bruin; Baruch Fischhoff

2007-01-01

Our previous research suggests that people reporting a stronger desire to maximize obtain worse life outcomes (Bruine de Bruin et al., 2007). Here, we examine whether this finding may be explained by the decision-making styles of self-reported maximizers. Expanding on Schwartz et al. (2002), we find that self-reported maximizers are more likely to show problematic decision-making styles, as evidenced by self-reports of less behavioral coping, greater dependence on others when making decisions...

Lifetime Maximizing Adaptive Power Control in Wireless Sensor Networks

National Research Council Canada - National Science Library

Sun, Fangting; Shayman, Mark

2006-01-01

...: adaptive power control. They focus on the sensor networks that consist of a sink and a set of homogeneous wireless sensor nodes, which are randomly deployed according to a uniform distribution...

Distributed interference alignment iterative algorithms in symmetric wireless network

Directory of Open Access Journals (Sweden)

YANG Jingwen

2015-02-01

Full Text Available Interference alignment is a novel interference alignment way,which is widely noted all of the world.Interference alignment overlaps interference in the same signal space at receiving terminal by precoding so as to thoroughly eliminate the influence of interference impacted on expected signals,thus making the desire user achieve the maximum degree of freedom.In this paper we research three typical algorithms for realizing interference alignment,including minimizing the leakage interference,maximizing Signal to Interference plus Noise Ratio (SINR and minimizing mean square error(MSE.All of these algorithms utilize the reciprocity of wireless network,and iterate the precoders between original network and the reverse network so as to achieve interference alignment.We use the uplink transmit rate to analyze the performance of these three algorithms.Numerical simulation results show the advantages of these algorithms.which is the foundation for the further study in the future.The feasibility and future of interference alignment are also discussed at last.

Networks of Cells and Petri Nets

OpenAIRE

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

2007-01-01

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

Efficient data communication protocols for wireless networks

Science.gov (United States)

Zeydan, Engin

In this dissertation, efficient decentralized algorithms are investigated for cost minimization problems in wireless networks. For wireless sensor networks, we investigate both the reduction in the energy consumption and throughput maximization problems separately using multi-hop data aggregation for correlated data in wireless sensor networks. The proposed algorithms exploit data redundancy using a game theoretic framework. For energy minimization, routes are chosen to minimize the total energy expended by the network using best response dynamics to local data. The cost function used in routing takes into account distance, interference and in-network data aggregation. The proposed energy-efficient correlation-aware routing algorithm significantly reduces the energy consumption in the network and converges in a finite number of steps iteratively. For throughput maximization, we consider both the interference distribution across the network and correlation between forwarded data when establishing routes. Nodes along each route are chosen to minimize the interference impact in their neighborhood and to maximize the in-network data aggregation. The resulting network topology maximizes the global network throughput and the algorithm is guaranteed to converge with a finite number of steps using best response dynamics. For multiple antenna wireless ad-hoc networks, we present distributed cooperative and regret-matching based learning schemes for joint transmit beanformer and power level selection problem for nodes operating in multi-user interference environment. Total network transmit power is minimized while ensuring a constant received signal-to-interference and noise ratio at each receiver. In cooperative and regret-matching based power minimization algorithms, transmit beanformers are selected from a predefined codebook to minimize the total power. By selecting transmit beamformers judiciously and performing power adaptation, the cooperative algorithm is shown to

Increasing network lifetime by battery-aware master selection in radio networks

NARCIS (Netherlands)

de Graaf, Maurits; van Ommeren, Jan C.W.; Brogle, Marc; Heijenk, Gerhard J.; Braun, Torsten; Konstantas, D.

2009-01-01

Mobile wireless communication systems often need to maximize their network lifetime (defined as the time until the first node runs out of energy). In the broadcast network lifetime problem, all nodes are sending broadcast traffic, and one asks for an assignment of transmit powers to nodes, and for

Genome-scale consequences of cofactor balancing in engineered pentose utilization pathways in Saccharomyces cerevisiae.

Directory of Open Access Journals (Sweden)

Amit Ghosh

Full Text Available Biofuels derived from lignocellulosic biomass offer promising alternative renewable energy sources for transportation fuels. Significant effort has been made to engineer Saccharomyces cerevisiae to efficiently ferment pentose sugars such as D-xylose and L-arabinose into biofuels such as ethanol through heterologous expression of the fungal D-xylose and L-arabinose pathways. However, one of the major bottlenecks in these fungal pathways is that the cofactors are not balanced, which contributes to inefficient utilization of pentose sugars. We utilized a genome-scale model of S. cerevisiae to predict the maximal achievable growth rate for cofactor balanced and imbalanced D-xylose and L-arabinose utilization pathways. Dynamic flux balance analysis (DFBA was used to simulate batch fermentation of glucose, D-xylose, and L-arabinose. The dynamic models and experimental results are in good agreement for the wild type and for the engineered D-xylose utilization pathway. Cofactor balancing the engineered D-xylose and L-arabinose utilization pathways simulated an increase in ethanol batch production of 24.7% while simultaneously reducing the predicted substrate utilization time by 70%. Furthermore, the effects of cofactor balancing the engineered pentose utilization pathways were evaluated throughout the genome-scale metabolic network. This work not only provides new insights to the global network effects of cofactor balancing but also provides useful guidelines for engineering a recombinant yeast strain with cofactor balanced engineered pathways that efficiently co-utilizes pentose and hexose sugars for biofuels production. Experimental switching of cofactor usage in enzymes has been demonstrated, but is a time-consuming effort. Therefore, systems biology models that can predict the likely outcome of such strain engineering efforts are highly useful for motivating which efforts are likely to be worth the significant time investment.

Analyzing the factors affecting network lifetime cluster-based wireless sensor network

International Nuclear Information System (INIS)

Malik, A.S.; Qureshi, A.

2010-01-01

Cluster-based wireless sensor networks enable the efficient utilization of the limited energy resources of the deployed sensor nodes and hence prolong the node as well as network lifetime. Low Energy Adaptive Clustering Hierarchy (Leach) is one of the most promising clustering protocol proposed for wireless sensor networks. This paper provides the energy utilization and lifetime analysis for cluster-based wireless sensor networks based upon LEACH protocol. Simulation results identify some important factors that induce unbalanced energy utilization between the sensor nodes and hence affect the network lifetime in these types of networks. These results highlight the need for a standardized, adaptive and distributed clustering technique that can increase the network lifetime by further balancing the energy utilization among sensor nodes. (author)

Study of transmitting electric power utility communications in IP network. Transmission of existing electric power utility communications in best effort type IP network under delay constraint; Denryokuyo tsushin kaisen no IP mo eno shuyo kento. Chien jikan seiyakuka ni okeru best effort gata IP mo eno kison denryokuyo tsushin kaisen no shuyo

Energy Technology Data Exchange (ETDEWEB)

Miyake, H.

2000-07-01

Since IP network does best effort behavior fundamentally, it always generates delay time and delay variation. For this reason, IP network has been unsuitable to transmit real time data such as a voice. However, in recent years, the technologies which transmit real time data in IP network, e.g. VoIP, have spread. If it is possible to transmit the existing electric power utility communications in IP network using these technologies, total network cost can be reduced by the reduction of required bandwidth and the simplification of communication network systems. In this report, it is examined quantitatively whether end-end delay time of the existing electric power utility communications, e.g. on-line, telephone, carrier relay, CDT (cyclic digital transmission equipment), video conference, ITV(industrial television), is within their permission delay time when they are transmitted in the best effort type IP network. (author)

Entropy maximization

Indian Academy of Sciences (India)

Abstract. It is shown that (i) every probability density is the unique maximizer of relative entropy in an appropriate class and (ii) in the class of all pdf f that satisfy. ∫ fhi dμ = λi for i = 1, 2,...,...k the maximizer of entropy is an f0 that is pro- portional to exp(. ∑ ci hi ) for some choice of ci . An extension of this to a continuum of.

Computationally Efficient Power Allocation Algorithm in Multicarrier-Based Cognitive Radio Networks: OFDM and FBMC Systems

Directory of Open Access Journals (Sweden)

Shaat Musbah

2010-01-01

Full Text Available Cognitive Radio (CR systems have been proposed to increase the spectrum utilization by opportunistically access the unused spectrum. Multicarrier communication systems are promising candidates for CR systems. Due to its high spectral efficiency, filter bank multicarrier (FBMC can be considered as an alternative to conventional orthogonal frequency division multiplexing (OFDM for transmission over the CR networks. This paper addresses the problem of resource allocation in multicarrier-based CR networks. The objective is to maximize the downlink capacity of the network under both total power and interference introduced to the primary users (PUs constraints. The optimal solution has high computational complexity which makes it unsuitable for practical applications and hence a low complexity suboptimal solution is proposed. The proposed algorithm utilizes the spectrum holes in PUs bands as well as active PU bands. The performance of the proposed algorithm is investigated for OFDM and FBMC based CR systems. Simulation results illustrate that the proposed resource allocation algorithm with low computational complexity achieves near optimal performance and proves the efficiency of using FBMC in CR context.

SDN control of optical nodes in metro networks for high capacity inter-datacentre links

Science.gov (United States)

Magalhães, Eduardo; Perry, Philip; Barry, Liam

2017-11-01

Worldwide demand for bandwidth has been growing fast for some years and continues to do so. To cover this, mega datacentres need scalable connectivity to provide rich connectivity to handle the heavy traffic across them. Therefore, hardware infrastructures must be able to play different roles according to service and traffic requirements. In this context, software defined networking (SDN) decouples the network control and forwarding functions enabling the network control to become directly programmable and the underlying infrastructure to be abstracted for applications and network services. In addition, elastic optical networking (EON) technologies enable efficient spectrum utilization by allocating variable bandwidth to each user according to their actual needs. In particular, flexible transponders and reconfigurable optical add/drop multiplexers (ROADMs) are key elements since they can offer degrees of freedom to self adapt accordingly. Thus, it is crucial to design control methods in order to optimize the hardware utilization and offer high reconfigurability, flexibility and adaptability. In this paper, we propose and analyze, using a simulation framework, a method of capacity maximization through optical power profile manipulation for inter datacentre links that use existing metropolitan optical networks by exploiting the global network view afforded by SDN. Results show that manipulating the loss profiles of the ROADMs in the metro-network can yield optical signal-to-noise ratio (OSNR) improvements up to 10 dB leading to an increase in 112% in total capacity.

Adjusting Sensing Range to Maximize Throughput on Ad-Hoc Multi-Hop Wireless Networks

National Research Council Canada - National Science Library

Roberts, Christopher

2003-01-01

.... Such a network is referred to as a multi-hop ad-hoc network, or simply a multi-hop network. Most multi-hop network protocols use some form of carrier sensing to determine if the wireless channel is in use...

Multi-layer network utilizing rewarded spike time dependent plasticity to learn a foraging task.

Directory of Open Access Journals (Sweden)

Pavel Sanda

2017-09-01

Full Text Available Neural networks with a single plastic layer employing reward modulated spike time dependent plasticity (STDP are capable of learning simple foraging tasks. Here we demonstrate advanced pattern discrimination and continuous learning in a network of spiking neurons with multiple plastic layers. The network utilized both reward modulated and non-reward modulated STDP and implemented multiple mechanisms for homeostatic regulation of synaptic efficacy, including heterosynaptic plasticity, gain control, output balancing, activity normalization of rewarded STDP and hard limits on synaptic strength. We found that addition of a hidden layer of neurons employing non-rewarded STDP created neurons that responded to the specific combinations of inputs and thus performed basic classification of the input patterns. When combined with a following layer of neurons implementing rewarded STDP, the network was able to learn, despite the absence of labeled training data, discrimination between rewarding patterns and the patterns designated as punishing. Synaptic noise allowed for trial-and-error learning that helped to identify the goal-oriented strategies which were effective in task solving. The study predicts a critical set of properties of the spiking neuronal network with STDP that was sufficient to solve a complex foraging task involving pattern classification and decision making.

Link Power Budget and Traffict QoS Performance Analysis of Gygabit Passive Optical Network

Science.gov (United States)

Ubaidillah, A.; Alfita, R.; Toyyibah

2018-01-01

Data service of telecommunication network is needed widely in the world; therefore extra wide bandwidth must be provided. For this case, PT. Telekomunikasi Tbk. applies GPON (Gigabit Passive Optical Network) as optical fibre based on telecommunication network system. GPON is a point to a multipoint technology of FTTx (Fiber to The x) that transmits information signals to the subscriber over optical fibre. In GPON trunking system, from OLT (Optical Line Terminal), the network is split to many ONT (Optical Network Terminal) of the subscribers, so it causes path loss and attenuation. In this research, the GPON performance is measured from the link power budget system and the Quality of Service (QoS) of the traffic. And the observation result shows that the link power budget system of this GPON is in good condition. The link power budget values from the mathematical calculation and direct measurement are satisfy the ITU-T G984 Class B standard, that the power level must be between -8 dBm to -27 dBm. While from the traffic performance, the observation result shows that the network resource utility of the subscribers of the observed area is not optimum. The mean of subscriber utility rate is 27.985 bps for upstream and 79.687 bps for downstream. While maximally, It should be 60.800 bps for upstream and 486.400 bps for downstream.

Spiking sychronization regulated by noise in three types of Hodgkin—Huxley neuronal networks

International Nuclear Information System (INIS)

Zhang Zheng-Zhen; Zeng Shang-You; Tang Wen-Yan; Hu Jin-Lin; Zeng Shao-Wen; Ning Wei-Lian; Qiu Yi; Wu Hui-Si

2012-01-01

In this paper, we study spiking synchronization in three different types of Hodgkin—Huxley neuronal networks, which are the small-world, regular, and random neuronal networks. All the neurons are subjected to subthreshold stimulus and external noise. It is found that in each of all the neuronal networks there is an optimal strength of noise to induce the maximal spiking synchronization. We further demonstrate that in each of the neuronal networks there is a range of synaptic conductance to induce the effect that an optimal strength of noise maximizes the spiking synchronization. Only when the magnitude of the synaptic conductance is moderate, will the effect be considerable. However, if the synaptic conductance is small or large, the effect vanishes. As the connections between neurons increase, the synaptic conductance to maximize the effect decreases. Therefore, we show quantitatively that the noise-induced maximal synchronization in the Hodgkin—Huxley neuronal network is a general effect, regardless of the specific type of neuronal network

Atmospheric dispersion prediction and source estimation of hazardous gas using artificial neural network, particle swarm optimization and expectation maximization

Science.gov (United States)

Qiu, Sihang; Chen, Bin; Wang, Rongxiao; Zhu, Zhengqiu; Wang, Yuan; Qiu, Xiaogang

2018-04-01

Hazardous gas leak accident has posed a potential threat to human beings. Predicting atmospheric dispersion and estimating its source become increasingly important in emergency management. Current dispersion prediction and source estimation models cannot satisfy the requirement of emergency management because they are not equipped with high efficiency and accuracy at the same time. In this paper, we develop a fast and accurate dispersion prediction and source estimation method based on artificial neural network (ANN), particle swarm optimization (PSO) and expectation maximization (EM). The novel method uses a large amount of pre-determined scenarios to train the ANN for dispersion prediction, so that the ANN can predict concentration distribution accurately and efficiently. PSO and EM are applied for estimating the source parameters, which can effectively accelerate the process of convergence. The method is verified by the Indianapolis field study with a SF6 release source. The results demonstrate the effectiveness of the method.

Dynamic Resource Allocation with Integrated Reinforcement Learning for a D2D-Enabled LTE-A Network with Access to Unlicensed Band

Directory of Open Access Journals (Sweden)

Alia Asheralieva

2016-01-01

Full Text Available We propose a dynamic resource allocation algorithm for device-to-device (D2D communication underlying a Long Term Evolution Advanced (LTE-A network with reinforcement learning (RL applied for unlicensed channel allocation. In a considered system, the inband and outband resources are assigned by the LTE evolved NodeB (eNB to different device pairs to maximize the network utility subject to the target signal-to-interference-and-noise ratio (SINR constraints. Because of the absence of an established control link between the unlicensed and cellular radio interfaces, the eNB cannot acquire any information about the quality and availability of unlicensed channels. As a result, a considered problem becomes a stochastic optimization problem that can be dealt with by deploying a learning theory (to estimate the random unlicensed channel environment. Consequently, we formulate the outband D2D access as a dynamic single-player game in which the player (eNB estimates its possible strategy and expected utility for all of its actions based only on its own local observations using a joint utility and strategy estimation based reinforcement learning (JUSTE-RL with regret algorithm. A proposed approach for resource allocation demonstrates near-optimal performance after a small number of RL iterations and surpasses the other comparable methods in terms of energy efficiency and throughput maximization.

User Utility Oriented Queuing Model for Resource Allocation in Cloud Environment

Directory of Open Access Journals (Sweden)

Zhe Zhang

2015-01-01

Full Text Available Resource allocation is one of the most important research topics in servers. In the cloud environment, there are massive hardware resources of different kinds, and many kinds of services are usually run on virtual machines of the cloud server. In addition, cloud environment is commercialized, and economical factor should also be considered. In order to deal with commercialization and virtualization of cloud environment, we proposed a user utility oriented queuing model for task scheduling. Firstly, we modeled task scheduling in cloud environment as an M/M/1 queuing system. Secondly, we classified the utility into time utility and cost utility and built a linear programming model to maximize total utility for both of them. Finally, we proposed a utility oriented algorithm to maximize the total utility. Massive experiments validate the effectiveness of our proposed model.

Improved Algorithms OF CELF and CELF++ for Influence Maximization

Directory of Open Access Journals (Sweden)

Jiaguo Lv

2014-06-01

Full Text Available Motivated by the wide application in some fields, such as viral marketing, sales promotion etc, influence maximization has been the most important and extensively studied problem in social network. However, the most classical KK-Greedy algorithm for influence maximization is inefficient. Two major sources of the algorithm’s inefficiency were analyzed in this paper. With the analysis of algorithms CELF and CELF++, all nodes in the influenced set of u would never bring any marginal gain when a new seed u was produced. Through this optimization strategy, a lot of redundant nodes will be removed from the candidate nodes. Basing on the strategy, two improved algorithms of Lv_CELF and Lv_CELF++ were proposed in this study. To evaluate the two algorithms, the two algorithms with their benchmark algorithms of CELF and CELF++ were conducted on some real world datasets. To estimate the algorithms, influence degree and running time were employed to measure the performance and efficiency respectively. Experimental results showed that, compared with benchmark algorithms of CELF and CELF++, matching effects and higher efficiency were achieved by the new algorithms Lv_CELF and Lv_CELF++. Solutions with the proposed optimization strategy can be useful for the decisionmaking problems under the scenarios related to the influence maximization problem.

Entropy Maximization

Indian Academy of Sciences (India)

It is shown that (i) every probability density is the unique maximizer of relative entropy in an appropriate class and (ii) in the class of all pdf that satisfy ∫ f h i d = i for i = 1 , 2 , … , … k the maximizer of entropy is an f 0 that is proportional to exp ⁡ ( ∑ c i h i ) for some choice of c i . An extension of this to a continuum of ...

Cooperative Caching in Mobile Ad Hoc Networks Based on Data Utility

Directory of Open Access Journals (Sweden)

Narottam Chand

2007-01-01

Full Text Available Cooperative caching, which allows sharing and coordination of cached data among clients, is a potential technique to improve the data access performance and availability in mobile ad hoc networks. However, variable data sizes, frequent data updates, limited client resources, insufficient wireless bandwidth and client's mobility make cache management a challenge. In this paper, we propose a utility based cache replacement policy, least utility value (LUV, to improve the data availability and reduce the local cache miss ratio. LUV considers several factors that affect cache performance, namely access probability, distance between the requester and data source/cache, coherency and data size. A cooperative cache management strategy, Zone Cooperative (ZC, is developed that employs LUV as replacement policy. In ZC one-hop neighbors of a client form a cooperation zone since the cost for communication with them is low both in terms of energy consumption and message exchange. Simulation experiments have been conducted to evaluate the performance of LUV based ZC caching strategy. The simulation results show that, LUV replacement policy substantially outperforms the LRU policy.

Mapping and discrimination of networks in the complexity-entropy plane

Science.gov (United States)

Wiedermann, Marc; Donges, Jonathan F.; Kurths, Jürgen; Donner, Reik V.

2017-10-01

Complex networks are usually characterized in terms of their topological, spatial, or information-theoretic properties and combinations of the associated metrics are used to discriminate networks into different classes or categories. However, even with the present variety of characteristics at hand it still remains a subject of current research to appropriately quantify a network's complexity and correspondingly discriminate between different types of complex networks, like infrastructure or social networks, on such a basis. Here we explore the possibility to classify complex networks by means of a statistical complexity measure that has formerly been successfully applied to distinguish different types of chaotic and stochastic time series. It is composed of a network's averaged per-node entropic measure characterizing the network's information content and the associated Jenson-Shannon divergence as a measure of disequilibrium. We study 29 real-world networks and show that networks of the same category tend to cluster in distinct areas of the resulting complexity-entropy plane. We demonstrate that within our framework, connectome networks exhibit among the highest complexity while, e.g., transportation and infrastructure networks display significantly lower values. Furthermore, we demonstrate the utility of our framework by applying it to families of random scale-free and Watts-Strogatz model networks. We then show in a second application that the proposed framework is useful to objectively construct threshold-based networks, such as functional climate networks or recurrence networks, by choosing the threshold such that the statistical network complexity is maximized.

Subjective expected utility with non-increasing risk aversion

NARCIS (Netherlands)

Wakker, P.P.

1989-01-01

It is shown that assumptions about risk aversion, usually studied under the presupposition of expected utility maximization, have a surprising extra merit at an earlier stage of the measurement work: together with the sure-thing principle, these assumptions imply subjective expected utility

Iterative reconstruction of transcriptional regulatory networks: an algorithmic approach.

Directory of Open Access Journals (Sweden)

Christian L Barrett

2006-05-01

Full Text Available The number of complete, publicly available genome sequences is now greater than 200, and this number is expected to rapidly grow in the near future as metagenomic and environmental sequencing efforts escalate and the cost of sequencing drops. In order to make use of this data for understanding particular organisms and for discerning general principles about how organisms function, it will be necessary to reconstruct their various biochemical reaction networks. Principal among these will be transcriptional regulatory networks. Given the physical and logical complexity of these networks, the various sources of (often noisy data that can be utilized for their elucidation, the monetary costs involved, and the huge number of potential experiments approximately 10(12 that can be performed, experiment design algorithms will be necessary for synthesizing the various computational and experimental data to maximize the efficiency of regulatory network reconstruction. This paper presents an algorithm for experimental design to systematically and efficiently reconstruct transcriptional regulatory networks. It is meant to be applied iteratively in conjunction with an experimental laboratory component. The algorithm is presented here in the context of reconstructing transcriptional regulation for metabolism in Escherichia coli, and, through a retrospective analysis with previously performed experiments, we show that the produced experiment designs conform to how a human would design experiments. The algorithm is able to utilize probability estimates based on a wide range of computational and experimental sources to suggest experiments with the highest potential of discovering the greatest amount of new regulatory knowledge.

Maximally incompatible quantum observables

Energy Technology Data Exchange (ETDEWEB)

Heinosaari, Teiko, E-mail: teiko.heinosaari@utu.fi [Turku Centre for Quantum Physics, Department of Physics and Astronomy, University of Turku, FI-20014 Turku (Finland); Schultz, Jussi, E-mail: jussi.schultz@gmail.com [Dipartimento di Matematica, Politecnico di Milano, Piazza Leonardo da Vinci 32, I-20133 Milano (Italy); Toigo, Alessandro, E-mail: alessandro.toigo@polimi.it [Dipartimento di Matematica, Politecnico di Milano, Piazza Leonardo da Vinci 32, I-20133 Milano (Italy); Istituto Nazionale di Fisica Nucleare, Sezione di Milano, Via Celoria 16, I-20133 Milano (Italy); Ziman, Mario, E-mail: ziman@savba.sk [RCQI, Institute of Physics, Slovak Academy of Sciences, Dúbravská cesta 9, 84511 Bratislava (Slovakia); Faculty of Informatics, Masaryk University, Botanická 68a, 60200 Brno (Czech Republic)

2014-05-01

The existence of maximally incompatible quantum observables in the sense of a minimal joint measurability region is investigated. Employing the universal quantum cloning device it is argued that only infinite dimensional quantum systems can accommodate maximal incompatibility. It is then shown that two of the most common pairs of complementary observables (position and momentum; number and phase) are maximally incompatible.

Maximally incompatible quantum observables

International Nuclear Information System (INIS)

Heinosaari, Teiko; Schultz, Jussi; Toigo, Alessandro; Ziman, Mario

2014-01-01

The existence of maximally incompatible quantum observables in the sense of a minimal joint measurability region is investigated. Employing the universal quantum cloning device it is argued that only infinite dimensional quantum systems can accommodate maximal incompatibility. It is then shown that two of the most common pairs of complementary observables (position and momentum; number and phase) are maximally incompatible.

Coverage maximization under resource constraints using a nonuniform proliferating random walk.

Science.gov (United States)

Saha, Sudipta; Ganguly, Niloy

2013-02-01

Information management services on networks, such as search and dissemination, play a key role in any large-scale distributed system. One of the most desirable features of these services is the maximization of the coverage, i.e., the number of distinctly visited nodes under constraints of network resources as well as time. However, redundant visits of nodes by different message packets (modeled, e.g., as walkers) initiated by the underlying algorithms for these services cause wastage of network resources. In this work, using results from analytical studies done in the past on a K-random-walk-based algorithm, we identify that redundancy quickly increases with an increase in the density of the walkers. Based on this postulate, we design a very simple distributed algorithm which dynamically estimates the density of the walkers and thereby carefully proliferates walkers in sparse regions. We use extensive computer simulations to test our algorithm in various kinds of network topologies whereby we find it to be performing particularly well in networks that are highly clustered as well as sparse.

On Hybrid Energy Utilization in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Mohammad Tala’t

2017-11-01

Full Text Available In a wireless sensor network (WSN, many applications have limited energy resources for data transmission. In order to accomplish a better green communication for WSN, a hybrid energy scheme can supply a more reliable energy source. In this article, hybrid energy utilization—which consists of constant energy source and solar harvested energy—is considered for WSN. To minimize constant energy usage from the hybrid source, a Markov decision process (MDP is designed to find the optimal transmission policy. With a finite packet buffer and a finite battery size, an MDP model is presented to define the states, actions, state transition probabilities, and the cost function including the cost values for all actions. A weighted sum of constant energy source consumption and a packet dropping probability (PDP are adopted as the cost value, enabling us to find the optimal solution for balancing the minimization of the constant energy source utilization and the PDP using a value iteration algorithm. As shown in the simulation results, the performance of optimal solution using MDP achieves a significant improvement compared to solution without its use.

Adaptive interaction a utility maximization approach to understanding human interaction with technology

CERN Document Server

Payne, Stephen J

2013-01-01

This lecture describes a theoretical framework for the behavioural sciences that holds high promise for theory-driven research and design in Human-Computer Interaction. The framework is designed to tackle the adaptive, ecological, and bounded nature of human behaviour. It is designed to help scientists and practitioners reason about why people choose to behave as they do and to explain which strategies people choose in response to utility, ecology, and cognitive information processing mechanisms. A key idea is that people choose strategies so as to maximise utility given constraints. The frame

Image annotation by deep neural networks with attention shaping

Science.gov (United States)

Zheng, Kexin; Lv, Shaohe; Ma, Fang; Chen, Fei; Jin, Chi; Dou, Yong

2017-07-01

Image annotation is a task of assigning semantic labels to an image. Recently, deep neural networks with visual attention have been utilized successfully in many computer vision tasks. In this paper, we show that conventional attention mechanism is easily misled by the salient class, i.e., the attended region always contains part of the image area describing the content of salient class at different attention iterations. To this end, we propose a novel attention shaping mechanism, which aims to maximize the non-overlapping area between consecutive attention processes by taking into account the history of previous attention vectors. Several weighting polices are studied to utilize the history information in different manners. In two benchmark datasets, i.e., PASCAL VOC2012 and MIRFlickr-25k, the average precision is improved by up to 10% in comparison with the state-of-the-art annotation methods.

Dynamics of Research Team Formation in Complex Networks

Science.gov (United States)

Sun, Caihong; Wan, Yuzi; Chen, Yu

Most organizations encourage the formation of teams to accomplish complicated tasks, and vice verse, effective teams could bring lots benefits and profits for organizations. Network structure plays an important role in forming teams. In this paper, we specifically study the dynamics of team formation in large research communities in which knowledge of individuals plays an important role on team performance and individual utility. An agent-based model is proposed, in which heterogeneous agents from research communities are described and empirically tested. Each agent has a knowledge endowment and a preference for both income and leisure. Agents provide a variable input (‘effort’) and their knowledge endowments to production. They could learn from others in their team and those who are not in their team but have private connections in community to adjust their own knowledge endowment. They are allowed to join other teams or work alone when it is welfare maximizing to do so. Various simulation experiments are conducted to examine the impacts of network topology, knowledge diffusion among community network, and team output sharing mechanisms on the dynamics of team formation.

Intervention in gene regulatory networks with maximal phenotype alteration.

Science.gov (United States)

Yousefi, Mohammadmahdi R; Dougherty, Edward R

2013-07-15

A basic issue for translational genomics is to model gene interaction via gene regulatory networks (GRNs) and thereby provide an informatics environment to study the effects of intervention (say, via drugs) and to derive effective intervention strategies. Taking the view that the phenotype is characterized by the long-run behavior (steady-state distribution) of the network, we desire interventions to optimally move the probability mass from undesirable to desirable states Heretofore, two external control approaches have been taken to shift the steady-state mass of a GRN: (i) use a user-defined cost function for which desirable shift of the steady-state mass is a by-product and (ii) use heuristics to design a greedy algorithm. Neither approach provides an optimal control policy relative to long-run behavior. We use a linear programming approach to optimally shift the steady-state mass from undesirable to desirable states, i.e. optimization is directly based on the amount of shift and therefore must outperform previously proposed methods. Moreover, the same basic linear programming structure is used for both unconstrained and constrained optimization, where in the latter case, constraints on the optimization limit the amount of mass that may be shifted to 'ambiguous' states, these being states that are not directly undesirable relative to the pathology of interest but which bear some perceived risk. We apply the method to probabilistic Boolean networks, but the theory applies to any Markovian GRN. Supplementary materials, including the simulation results, MATLAB source code and description of suboptimal methods are available at http://gsp.tamu.edu/Publications/supplementary/yousefi13b. edward@ece.tamu.edu Supplementary data are available at Bioinformatics online.

Towards Optimal Buffer Size in Wi-Fi Networks

KAUST Repository

Showail, Ahmad J.

2016-01-19

Buffer sizing is an important network configuration parameter that impacts the quality of data traffic. Falling memory cost and the fallacy that ‘more is better’ lead to over provisioning network devices with large buffers. Over-buffering or the so called ‘bufferbloat’ phenomenon creates excessive end-to-end delay in today’s networks. On the other hand, under-buffering results in frequent packet loss and subsequent under-utilization of network resources. The buffer sizing problem has been studied extensively for wired networks. However, there is little work addressing the unique challenges of wireless environment. In this dissertation, we discuss buffer sizing challenges in wireless networks, classify the state-of-the-art solutions, and propose two novel buffer sizing schemes. The first scheme targets buffer sizing in wireless multi-hop networks where the radio spectral resource is shared among a set of con- tending nodes. Hence, it sizes the buffer collectively and distributes it over a set of interfering devices. The second buffer sizing scheme is designed to cope up with recent Wi-Fi enhancements. It adapts the buffer size based on measured link characteristics and network load. Also, it enforces limits on the buffer size to maximize frame aggregation benefits. Both mechanisms are evaluated using simulation as well as testbed implementation over half-duplex and full-duplex wireless networks. Experimental evaluation shows that our proposal reduces latency by an order of magnitude.

Probabilistic mapping of descriptive health status responses onto health state utilities using Bayesian networks: an empirical analysis converting SF-12 into EQ-5D utility index in a national US sample.

Science.gov (United States)

Le, Quang A; Doctor, Jason N

2011-05-01

As quality-adjusted life years have become the standard metric in health economic evaluations, mapping health-profile or disease-specific measures onto preference-based measures to obtain quality-adjusted life years has become a solution when health utilities are not directly available. However, current mapping methods are limited due to their predictive validity, reliability, and/or other methodological issues. We employ probability theory together with a graphical model, called a Bayesian network, to convert health-profile measures into preference-based measures and to compare the results to those estimated with current mapping methods. A sample of 19,678 adults who completed both the 12-item Short Form Health Survey (SF-12v2) and EuroQoL 5D (EQ-5D) questionnaires from the 2003 Medical Expenditure Panel Survey was split into training and validation sets. Bayesian networks were constructed to explore the probabilistic relationships between each EQ-5D domain and 12 items of the SF-12v2. The EQ-5D utility scores were estimated on the basis of the predicted probability of each response level of the 5 EQ-5D domains obtained from the Bayesian inference process using the following methods: Monte Carlo simulation, expected utility, and most-likely probability. Results were then compared with current mapping methods including multinomial logistic regression, ordinary least squares, and censored least absolute deviations. The Bayesian networks consistently outperformed other mapping models in the overall sample (mean absolute error=0.077, mean square error=0.013, and R overall=0.802), in different age groups, number of chronic conditions, and ranges of the EQ-5D index. Bayesian networks provide a new robust and natural approach to map health status responses into health utility measures for health economic evaluations.

Self-Coexistence among IEEE 802.22 Networks: Distributed Allocation of Power and Channel.

Science.gov (United States)

Sakin, Sayef Azad; Razzaque, Md Abdur; Hassan, Mohammad Mehedi; Alamri, Atif; Tran, Nguyen H; Fortino, Giancarlo

2017-12-07

Ensuring self-coexistence among IEEE 802.22 networks is a challenging problem owing to opportunistic access of incumbent-free radio resources by users in co-located networks. In this study, we propose a fully-distributed non-cooperative approach to ensure self-coexistence in downlink channels of IEEE 802.22 networks. We formulate the self-coexistence problem as a mixed-integer non-linear optimization problem for maximizing the network data rate, which is an NP-hard one. This work explores a sub-optimal solution by dividing the optimization problem into downlink channel allocation and power assignment sub-problems. Considering fairness, quality of service and minimum interference for customer-premises-equipment, we also develop a greedy algorithm for channel allocation and a non-cooperative game-theoretic framework for near-optimal power allocation. The base stations of networks are treated as players in a game, where they try to increase spectrum utilization by controlling power and reaching a Nash equilibrium point. We further develop a utility function for the game to increase the data rate by minimizing the transmission power and, subsequently, the interference from neighboring networks. A theoretical proof of the uniqueness and existence of the Nash equilibrium has been presented. Performance improvements in terms of data-rate with a degree of fairness compared to a cooperative branch-and-bound-based algorithm and a non-cooperative greedy approach have been shown through simulation studies.

Self-Coexistence among IEEE 802.22 Networks: Distributed Allocation of Power and Channel

Directory of Open Access Journals (Sweden)

Sayef Azad Sakin

2017-12-01

Full Text Available Ensuring self-coexistence among IEEE 802.22 networks is a challenging problem owing to opportunistic access of incumbent-free radio resources by users in co-located networks. In this study, we propose a fully-distributed non-cooperative approach to ensure self-coexistence in downlink channels of IEEE 802.22 networks. We formulate the self-coexistence problem as a mixed-integer non-linear optimization problem for maximizing the network data rate, which is an NP-hard one. This work explores a sub-optimal solution by dividing the optimization problem into downlink channel allocation and power assignment sub-problems. Considering fairness, quality of service and minimum interference for customer-premises-equipment, we also develop a greedy algorithm for channel allocation and a non-cooperative game-theoretic framework for near-optimal power allocation. The base stations of networks are treated as players in a game, where they try to increase spectrum utilization by controlling power and reaching a Nash equilibrium point. We further develop a utility function for the game to increase the data rate by minimizing the transmission power and, subsequently, the interference from neighboring networks. A theoretical proof of the uniqueness and existence of the Nash equilibrium has been presented. Performance improvements in terms of data-rate with a degree of fairness compared to a cooperative branch-and-bound-based algorithm and a non-cooperative greedy approach have been shown through simulation studies.

Maximal combustion temperature estimation

International Nuclear Information System (INIS)

Golodova, E; Shchepakina, E

2006-01-01

This work is concerned with the phenomenon of delayed loss of stability and the estimation of the maximal temperature of safe combustion. Using the qualitative theory of singular perturbations and canard techniques we determine the maximal temperature on the trajectories located in the transition region between the slow combustion regime and the explosive one. This approach is used to estimate the maximal temperature of safe combustion in multi-phase combustion models

Developing maximal neuromuscular power: part 2 - training considerations for improving maximal power production.

Science.gov (United States)

Cormie, Prue; McGuigan, Michael R; Newton, Robert U

2011-02-01

This series of reviews focuses on the most important neuromuscular function in many sport performances: the ability to generate maximal muscular power. Part 1, published in an earlier issue of Sports Medicine, focused on the factors that affect maximal power production while part 2 explores the practical application of these findings by reviewing the scientific literature relevant to the development of training programmes that most effectively enhance maximal power production. The ability to generate maximal power during complex motor skills is of paramount importance to successful athletic performance across many sports. A crucial issue faced by scientists and coaches is the development of effective and efficient training programmes that improve maximal power production in dynamic, multi-joint movements. Such training is referred to as 'power training' for the purposes of this review. Although further research is required in order to gain a deeper understanding of the optimal training techniques for maximizing power in complex, sports-specific movements and the precise mechanisms underlying adaptation, several key conclusions can be drawn from this review. First, a fundamental relationship exists between strength and power, which dictates that an individual cannot possess a high level of power without first being relatively strong. Thus, enhancing and maintaining maximal strength is essential when considering the long-term development of power. Second, consideration of movement pattern, load and velocity specificity is essential when designing power training programmes. Ballistic, plyometric and weightlifting exercises can be used effectively as primary exercises within a power training programme that enhances maximal power. The loads applied to these exercises will depend on the specific requirements of each particular sport and the type of movement being trained. The use of ballistic exercises with loads ranging from 0% to 50% of one-repetition maximum (1RM) and

Logistical networking: a global storage network

International Nuclear Information System (INIS)

Beck, Micah; Moore, Terry

2005-01-01

The absence of an adequate distributed storage infrastructure for data buffering has become a significant impediment to the flow of work in the wide area, data intensive collaborations that are increasingly characteristic of leading edge research in several fields. One solution to this problem, pioneered under DOE's SciDAC program, is Logistical Networking, which provides a framework for a globally scalable, maximally interoperable storage network based on the Internet Backplane Protocol (IBP). This paper provides a brief overview of the Logistical Networking (LN) architecture, the middleware developed to exploit its value, and a few of the applications that some of research communities have made of it

Adaption of the temporal correlation coefficient calculation for temporal networks (applied to a real-world pig trade network).

Science.gov (United States)

Büttner, Kathrin; Salau, Jennifer; Krieter, Joachim

2016-01-01

The average topological overlap of two graphs of two consecutive time steps measures the amount of changes in the edge configuration between the two snapshots. This value has to be zero if the edge configuration changes completely and one if the two consecutive graphs are identical. Current methods depend on the number of nodes in the network or on the maximal number of connected nodes in the consecutive time steps. In the first case, this methodology breaks down if there are nodes with no edges. In the second case, it fails if the maximal number of active nodes is larger than the maximal number of connected nodes. In the following, an adaption of the calculation of the temporal correlation coefficient and of the topological overlap of the graph between two consecutive time steps is presented, which shows the expected behaviour mentioned above. The newly proposed adaption uses the maximal number of active nodes, i.e. the number of nodes with at least one edge, for the calculation of the topological overlap. The three methods were compared with the help of vivid example networks to reveal the differences between the proposed notations. Furthermore, these three calculation methods were applied to a real-world network of animal movements in order to detect influences of the network structure on the outcome of the different methods.

Utility franchises reconsidered

Energy Technology Data Exchange (ETDEWEB)

Weidner, B.

1981-11-01

It is easier to obtain a public utility franchise than one for a fast food store because companies like Burger King value the profit share and control available with a franchise arrangement. The investor-owned utilities (IOUs) in Chicago and elsewhere gets little financial or regulatory benefit, although they do have an alternative because the franchise can be taken over by the city with a one-year notice. As IOUs evolved, the annual franchise fee has been incorporated into the rate in a move that taxes ratepayers and maximizes profits. Cities that found franchising unsatisfactory are looking for ways to terminate the franchise and finance a takeover, but limited-term and indeterminate franchises may offer a better mechanism when public needs and utility aims diverge. A directory lists franchised utilities by state and comments on their legal status. (DCK)

Synthesis of magnetic systems producing field with maximal scalar characteristics

International Nuclear Information System (INIS)

Klevets, Nickolay I.

2005-01-01

A method of synthesis of the magnetic systems (MSs) consisting of uniformly magnetized blocks is proposed. This method allows to synthesize MSs providing maximum value of any magnetic field scalar characteristic. In particular, it is possible to synthesize the MSs providing the maximum of a field projection on a given vector, a gradient of a field modulus and a gradient of a field energy on a given directing vector, a field magnitude, a magnetic flux through a given surface, a scalar product of a field or a force by a directing function given in some area of space, etc. The synthesized MSs provide maximal efficiency of permanent magnets utilization. The usage of the proposed method of MSs synthesis allows to change a procedure of projecting in principal, namely, to execute it according to the following scheme: (a) to choose the sizes, a form and a number of blocks of a system proceeding from technological (economical) reasons; (b) using the proposed synthesis method, to find an orientation of site magnetization providing maximum possible effect of magnet utilization in a system obtained in (a). Such approach considerably reduces a time of MSs projecting and guarantees maximal possible efficiency of magnets utilization. Besides it provides absolute assurance in 'ideality' of a MS design and allows to obtain an exact estimate of the limit parameters of a field in a working area of a projected MS. The method is applicable to a system containing the components from soft magnetic material with linear magnetic properties

How an existing telecommunications network can support the deployment of smart meters in a water utility?

Directory of Open Access Journals (Sweden)

Samuel de Barros Moraes

2015-12-01

Full Text Available This case study, based on interviews and technical analysis of a Brazilian water utility with more than 10 million clients, aims to understand what kind of adjusts on a telecommunications network, developed for operational and corporate use, demands to support a smart metering system, identifying this synergies and challenges.

Enhancing Sensing and Channel Access in Cognitive Radio Networks

KAUST Repository

Hamza, Doha R.

2014-06-18

Cognitive radio technology is a promising technology to solve the wireless spectrum scarcity problem by intelligently allowing secondary, or unlicensed, users access to the primary, licensed, users\\' frequency bands. Cognitive technology involves two main tasks: 1) sensing the wireless medium to assess the presence of the primary users and 2) designing secondary spectrum access techniques that maximize the secondary users\\' benefits while maintaining the primary users\\' privileged status. On the spectrum sensing side, we make two contributions. First, we maximize a utility function representing the secondary throughput while constraining the collision probability with the primary below a certain value. We optimize therein the channel sensing time, the sensing decision threshold, the channel probing time, together with the channel sensing order for wideband primary channels. Second, we design a cooperative spectrum sensing technique termed sensing with equal gain combining whereby cognitive radios simultaneously transmit their sensing results to the fusion center over multipath fading reporting channels. The proposed scheme is shown to outperform orthogonal reporting systems in terms of achievable secondary throughput and to be robust against phase and synchronization errors. On the spectrum access side, we make four contributions. First, we design a secondary scheduling scheme with the goal of minimizing the secondary queueing delay under constraints on the average secondary transmit power and the maximum tolerable primary outage probability. Second, we design another secondary scheduling scheme based on the spectrum sensing results and the primary automatic repeat request feedback. The optimal medium access probabilities are obtained via maximizing the secondary throughput subject to constraints that guarantee quality of service parameters for the primary. Third, we propose a three-message superposition coding scheme to maximize the secondary throughput without

Searching for Communities in Bipartite Networks

OpenAIRE

Barber, Michael J.; Faria, Margarida; Streit, Ludwig; Strogan, Oleg

2008-01-01

Bipartite networks are a useful tool for representing and investigating interaction networks. We consider methods for identifying communities in bipartite networks. Intuitive notions of network community groups are made explicit using Newman's modularity measure. A specialized version of the modularity, adapted to be appropriate for bipartite networks, is presented; a corresponding algorithm is described for identifying community groups through maximizing this measure. The algorithm is applie...

Maximization of learning speed in the motor cortex due to neuronal redundancy.

Directory of Open Access Journals (Sweden)

Ken Takiyama

2012-01-01

Full Text Available Many redundancies play functional roles in motor control and motor learning. For example, kinematic and muscle redundancies contribute to stabilizing posture and impedance control, respectively. Another redundancy is the number of neurons themselves; there are overwhelmingly more neurons than muscles, and many combinations of neural activation can generate identical muscle activity. The functional roles of this neuronal redundancy remains unknown. Analysis of a redundant neural network model makes it possible to investigate these functional roles while varying the number of model neurons and holding constant the number of output units. Our analysis reveals that learning speed reaches its maximum value if and only if the model includes sufficient neuronal redundancy. This analytical result does not depend on whether the distribution of the preferred direction is uniform or a skewed bimodal, both of which have been reported in neurophysiological studies. Neuronal redundancy maximizes learning speed, even if the neural network model includes recurrent connections, a nonlinear activation function, or nonlinear muscle units. Furthermore, our results do not rely on the shape of the generalization function. The results of this study suggest that one of the functional roles of neuronal redundancy is to maximize learning speed.

Maximizing profitability in a hospital outpatient pharmacy.

Science.gov (United States)

Jorgenson, J A; Kilarski, J W; Malatestinic, W N; Rudy, T A

1989-07-01

This paper describes the strategies employed to increase the profitability of an existing ambulatory pharmacy operated by the hospital. Methods to generate new revenue including implementation of a home parenteral therapy program, a home enteral therapy program, a durable medical equipment service, and home care disposable sales are described. Programs to maximize existing revenue sources such as increasing the capture rate on discharge prescriptions, increasing "walk-in" prescription traffic and increasing HMO prescription volumes are discussed. A method utilized to reduce drug expenditures is also presented. By minimizing expenses and increasing the revenues for the ambulatory pharmacy operation, net profit increased from +26,000 to over +140,000 in one year.

Sustainable wireless networks

CERN Document Server

Zheng, Zhongming; Xuemin

2013-01-01

This brief focuses on network planning and resource allocation by jointly considering cost and energy sustainability in wireless networks with sustainable energy. The characteristics of green energy and investigating existing energy-efficient green approaches for wireless networks with sustainable energy is covered in the first part of this brief. The book then addresses the random availability and capacity of the energy supply. The authors explore how to maximize the energy sustainability of the network and minimize the failure probability that the mesh access points (APs) could deplete their

Shipboard Calibration Network Extension Utilizing COTS Products

Science.gov (United States)

2014-09-01

Identification TCP Transport Control Protocol VNC Virtual Network Computing WLAN Wireless Local Area Network xvi THIS PAGE INTENTIONALLY...available at the location of the sensor to be calibrated. With the wide adoption of the wireless local area network ( WLAN ) protocol, IEEE 802.11...standard devices have been proven to provide a stable, wireless infrastructure for many applications . The fast setup, wire-free configuration and

Efficient Wideband Spectrum Sensing with Maximal Spectral Efficiency for LEO Mobile Satellite Systems

Directory of Open Access Journals (Sweden)

Feilong Li

2017-01-01

Full Text Available The usable satellite spectrum is becoming scarce due to static spectrum allocation policies. Cognitive radio approaches have already demonstrated their potential towards spectral efficiency for providing more spectrum access opportunities to secondary user (SU with sufficient protection to licensed primary user (PU. Hence, recent scientific literature has been focused on the tradeoff between spectrum reuse and PU protection within narrowband spectrum sensing (SS in terrestrial wireless sensing networks. However, those narrowband SS techniques investigated in the context of terrestrial CR may not be applicable for detecting wideband satellite signals. In this paper, we mainly investigate the problem of joint designing sensing time and hard fusion scheme to maximize SU spectral efficiency in the scenario of low earth orbit (LEO mobile satellite services based on wideband spectrum sensing. Compressed detection model is established to prove that there indeed exists one optimal sensing time achieving maximal spectral efficiency. Moreover, we propose novel wideband cooperative spectrum sensing (CSS framework where each SU reporting duration can be utilized for its following SU sensing. The sensing performance benefits from the novel CSS framework because the equivalent sensing time is extended by making full use of reporting slot. Furthermore, in respect of time-varying channel, the spatiotemporal CSS (ST-CSS is presented to attain space and time diversity gain simultaneously under hard decision fusion rule. Computer simulations show that the optimal sensing settings algorithm of joint optimization of sensing time, hard fusion rule and scheduling strategy achieves significant improvement in spectral efficiency. Additionally, the novel ST-CSS scheme performs much higher spectral efficiency than that of general CSS framework.

ANCS: Achieving QoS through Dynamic Allocation of Network Resources in Virtualized Clouds

Directory of Open Access Journals (Sweden)

Cheol-Ho Hong

2016-01-01

Full Text Available To meet the various requirements of cloud computing users, research on guaranteeing Quality of Service (QoS is gaining widespread attention in the field of cloud computing. However, as cloud computing platforms adopt virtualization as an enabling technology, it becomes challenging to distribute system resources to each user according to the diverse requirements. Although ample research has been conducted in order to meet QoS requirements, the proposed solutions lack simultaneous support for multiple policies, degrade the aggregated throughput of network resources, and incur CPU overhead. In this paper, we propose a new mechanism, called ANCS (Advanced Network Credit Scheduler, to guarantee QoS through dynamic allocation of network resources in virtualization. To meet the various network demands of cloud users, ANCS aims to concurrently provide multiple performance policies; these include weight-based proportional sharing, minimum bandwidth reservation, and maximum bandwidth limitation. In addition, ANCS develops an efficient work-conserving scheduling method for maximizing network resource utilization. Finally, ANCS can achieve low CPU overhead via its lightweight design, which is important for practical deployment.

Datum maintenance of the main Egyptian geodetic control networks by utilizing Precise Point Positioning “PPP” technique

Directory of Open Access Journals (Sweden)

Mostafa Rabah

2016-06-01

To see how non-performing maintenance degrading the values of the HARN and NACN, the available HARN and NACN stations in the Nile Delta were observed. The Processing of the tested part was done by CSRS-PPP Service based on utilizing Precise Point Positioning “PPP” and Trimble Business Center “TBC”. The study shows the feasibility of Precise Point Positioning in updating the absolute positioning of the HARN network and its role in updating the reference frame (ITRF. The study also confirmed the necessity of the absent role of datum maintenance of Egypt networks.

Numerical simulation of coherent resonance in a model network of Rulkov neurons

Science.gov (United States)

Andreev, Andrey V.; Runnova, Anastasia E.; Pisarchik, Alexander N.

2018-04-01

In this paper we study the spiking behaviour of a neuronal network consisting of Rulkov elements. We find that the regularity of this behaviour maximizes at a certain level of environment noise. This effect referred to as coherence resonance is demonstrated in a random complex network of Rulkov neurons. An external stimulus added to some of neurons excites them, and then activates other neurons in the network. The network coherence is also maximized at the certain stimulus amplitude.

Quantum logic networks for probabilistic teleportation

Institute of Scientific and Technical Information of China (English)

刘金明; 张永生; 等

2003-01-01

By eans of the primitive operations consisting of single-qubit gates.two-qubit controlled-not gates,Von Neuman measurement and classically controlled operations.,we construct efficient quantum logic networks for implementing probabilistic teleportation of a single qubit,a two-particle entangled state,and an N-particle entanglement.Based on the quantum networks,we show that after the partially entangled states are concentrated into maximal entanglement,the above three kinds of probabilistic teleportation are the same as the standard teleportation using the corresponding maximally entangled states as the quantum channels.

Flexible Demand Control to Enhance the Dynamic Operation of Low Voltage Networks

DEFF Research Database (Denmark)

Diaz de Cerio Mendaza, Iker; Szczesny, Ireneusz Grzegorz; Pillai, Jayakrishnan Radhakrishna

2015-01-01

Moving towards a carbon free energy system has become an objective for many countries nowadays. Among other changes, the electrification of strategic sectors such as heating and transportation is inevitable. As a consequence, the current power system load will substantially increase...... for controlling the demand response of a low voltage grid. This is designed to; i) maximize the grid utilization, thereby reducing the need for reinforcement, ii) accommodate the maximum number of flexible loads and iii) satisfy the power and comfort requirements from each of the consumers in the network....... In this context, the nature of the expected loads (heat pumps, plug-in electric vehicles, etc.) makes the low voltage networks specially targeted. A promising solution to overcome the challenges resulting from their grid integration, is demand response. This paper introduces a hierarchical structure...

Site Assessment of Multiple-Sensor Approaches for Buried Utility Detection

Directory of Open Access Journals (Sweden)

Alexander C. D. Royal

2011-01-01

Full Text Available The successful operation of buried infrastructure within urban environments is fundamental to the conservation of modern living standards. Open-cut methods are predominantly used, in preference to trenchless technology, to effect a repair, replace or install a new section of the network. This is, in part, due to the inability to determine the position of all utilities below the carriageway, making open-cut methods desirable in terms of dealing with uncertainty since the buried infrastructure is progressively exposed during excavation. However, open-cut methods damage the carriageway and disrupt society's functions. This paper describes the progress of a research project that aims to develop a multi-sensor geophysical platform that can improve the probability of complete detection of the infrastructure buried beneath the carriageway. The multi-sensor platform is being developed in conjunction with a knowledge-based system that aims to provide information on how the properties of the ground might affect the sensing technologies being deployed. The fusion of data sources (sensor data and utilities record data is also being researched to maximize the probability of location. This paper describes the outcome of the initial phase of testing along with the development of the knowledge-based system and the fusing of data to produce utility maps.

The Commercial Utilization of Social Networks

OpenAIRE

Adlaf, Petr

2011-01-01

The presented bachelor's thesis deals with advertisement. It answers the question of what advertisement is, why firms use advertisement and what its benefits are. It concentrates especially on Internet advertisement presented through social networks. These social networks have come to occupy a significant position on the Internet during the last five years and offer new possibilities in terms of creating advertising campaigns (Hypertargeting). The thesis presents the division and comparison o...

Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks

NARCIS (Netherlands)

J. Byrka (Jaroslaw); K.T. Huber; S.M. Kelk (Steven); P. Gawrychowski

2009-01-01

htmlabstractThe study of phylogenetic networks is of great interest to computational evolutionary biology and numerous different types of such structures are known. This article addresses the following question concerning rooted versions of phylogenetic networks. What is the maximum value of pset

Octopus: LLL's computing utility

International Nuclear Information System (INIS)

Anon.

1978-01-01

The Laboratory's Octopus network constitutes one of the greatest concentrations of computing power in the world. This power derives from the network's organization as well as from the size and capability of its computers, storage media, input/output devices, and communication channels. Being in a network enables these facilities to work together to form a unified computing utility that is accessible on demand directly from the users' offices. This computing utility has made a major contribution to the pace of research and development at the Laboratory; an adequate rate of progress in research could not be achieved without it. 4 figures

A tree routing protocol for cognitive radio network

Directory of Open Access Journals (Sweden)

Mohammed Hashem

2017-07-01

Full Text Available Cognitive Radio (CR technology is an agile solution for spectrum congestion and spectrum access utilization problems that result from the legacy fixed spectrum management policies. CR technology can exploit unused licensed band to meet the increasing demand for radio frequency. The routing process faces many challenges in CR Network (CRN such as the absence of centralized infrastructure, the coordination between the routing module and spectrum management module, in addition to the frequent link failure due to the sudden appearance of PUs. In this paper we propose a Tree routing protocol for cognitive radio network (C-TRP that jointly utilizes the tree routing algorithm with a spectrum management module in routing decisions, and also we proposed a new metric used in taking the best route decisions. In addition, we enhance the traditional tree routing algorithm by using a neighbor table technique that speeds up the forwarding data packets. Moreover, we add a robust recovery module to C-TRP to resume the network in case of the link failure. The main motivation in the design of C-TRP is quick data transmission and maximization of date rates. The performance evaluation is carried out in NS2 simulator. The simulation results proved that C-TRP protocol achieves better performance in terms of average “PDR”, “end-to-end delay” and “routing overhead ratio “compared to “CTBR” and “STOD-RP” routing protocols.

Graphs, Ideal Flow, and the Transportation Network

OpenAIRE

Teknomo, Kardi

2016-01-01

This lecture discusses the mathematical relationship between network structure and network utilization of transportation network. Network structure means the graph itself. Network utilization represent the aggregation of trajectories of agents in using the network graph. I show the similarity and relationship between the structural pattern of the network and network utilization.

AUC-Maximizing Ensembles through Metalearning.

Science.gov (United States)

LeDell, Erin; van der Laan, Mark J; Petersen, Maya

2016-05-01

Area Under the ROC Curve (AUC) is often used to measure the performance of an estimator in binary classification problems. An AUC-maximizing classifier can have significant advantages in cases where ranking correctness is valued or if the outcome is rare. In a Super Learner ensemble, maximization of the AUC can be achieved by the use of an AUC-maximining metalearning algorithm. We discuss an implementation of an AUC-maximization technique that is formulated as a nonlinear optimization problem. We also evaluate the effectiveness of a large number of different nonlinear optimization algorithms to maximize the cross-validated AUC of the ensemble fit. The results provide evidence that AUC-maximizing metalearners can, and often do, out-perform non-AUC-maximizing metalearning methods, with respect to ensemble AUC. The results also demonstrate that as the level of imbalance in the training data increases, the Super Learner ensemble outperforms the top base algorithm by a larger degree.

Approaching maximal performance of longitudinal beam compression in induction accelerator drivers

International Nuclear Information System (INIS)

Mark, J.W.K.; Ho, D.D.M.; Brandon, S.T.; Chang, C.L.; Drobot, A.T.; Faltens, A.; Lee, E.P.; Krafft, G.A.

1986-01-01

Longitudinal beam compression occurs before final focus and fusion chamber beam transport and is a key process determining initial conditions for final focus hardware. Determining the limits for maximal performance of key accelerator components is an essential element of the effort to reduce driver costs. Studies directed towards defining the limits of final beam compression including considerations such as maximal available compression, effects of longitudinal dispersion and beam emittance, combining pulse-shaping with beam compression to reduce the total number of beam manipulators, etc., are given. Several possible techniques are illustrated for utilizing the beam compression process to provide the pulse shapes required by a number of targets. Without such capabilities to shape the pulse, an additional factor of two or so of beam energy would be required by the targets

Public utilities in networks: competition perspectives and new regulations; Services publics en reseau: perspectives de concurrence et nouvelles regulations

Energy Technology Data Exchange (ETDEWEB)

Bergougnoux, J

2000-07-01

This report makes first a status about the historical specificities, the present day situation and the perspectives of evolution of public utilities in networks with respect to the European directive of 1996 and to the 4 sectors of electricity, gas, railway transport and postal service. Then, it wonders about the new institutions and regulation procedures to implement to conciliate the public utility mission with the honest competition. (J.S.)

Thermodynamic criterions for heat exchanger networks design

Energy Technology Data Exchange (ETDEWEB)

Guiglion, C.; Farhat, S.; Pibouleau, L.; Domenech, S. (Ecole Nationale Superieure d' Ingenieurs de Genie Chimique, 31 - Toulouse (France))

1994-03-01

This problem under consideration consists in selecting a heat exchanger network able to carry out a given request in heatings and coolings, in steady-state behaviour with constant pressure, by using if necessary cold and hot utilities, and under the constraint [Delta] T [>=] e in order to restrict investment costs. The exchanged energy and the produced entropy are compared in terms of operating costs. According to the request to be satisfied and the constraints of utility consumption, it is shown that the goal to minimize the produced entropy more or less agrees with the goal to minimize the exchanged energy. In the last part, the case where the cost of utility use is assumed to be proportional to the flow rate, with a proportionality constant only depending on the input thermodynamic state, is studied thoroughly. Under this assumption, the minimization of operating costs is compatible with the minimization of exchanged energy, and can be obtained via the maximization of the difficulty of the request part, made without using utilities. This point is based on the notion of a request easier than another, which explicits the quite vague idea that a request is all the more easier because it involves less heatings at high temperatures and less coolings at low temperatures. (author). 5 refs., 1 fig.

Sum Rate Maximization of D2D Communications in Cognitive Radio Network Using Cheating Strategy

Directory of Open Access Journals (Sweden)

Yanjing Sun

2018-01-01

Full Text Available This paper focuses on the cheating algorithm for device-to-device (D2D pairs that reuse the uplink channels of cellular users. We are concerned about the way how D2D pairs are matched with cellular users (CUs to maximize their sum rate. In contrast with Munkres’ algorithm which gives the optimal matching in terms of the maximum throughput, Gale-Shapley algorithm ensures the stability of the system on the same time and achieves a men-optimal stable matching. In our system, D2D pairs play the role of “men,” so that each D2D pair could be matched to the CU that ranks as high as possible in the D2D pair’s preference list. It is found by previous studies that, by unilaterally falsifying preference lists in a particular way, some men can get better partners, while no men get worse off. We utilize this theory to exploit the best cheating strategy for D2D pairs. We find out that to acquire such a cheating strategy, we need to seek as many and as large cabals as possible. To this end, we develop a cabal finding algorithm named RHSTLC, and also we prove that it reaches the Pareto optimality. In comparison with other algorithms proposed by related works, the results show that our algorithm can considerably improve the sum rate of D2D pairs.

Vibration monitoring with artificial neural networks

International Nuclear Information System (INIS)

Alguindigue, I.

1991-01-01

Vibration monitoring of components in nuclear power plants has been used for a number of years. This technique involves the analysis of vibration data coming from vital components of the plant to detect features which reflect the operational state of machinery. The analysis leads to the identification of potential failures and their causes, and makes it possible to perform efficient preventive maintenance. Earlydetection is important because it can decrease the probability of catastrophic failures, reduce forced outgage, maximize utilization of available assets, increase the life of the plant, and reduce maintenance costs. This paper documents our work on the design of a vibration monitoring methodology based on neural network technology. This technology provides an attractive complement to traditional vibration analysis because of the potential of neural network to operate in real-time mode and to handle data which may be distorted or noisy. Our efforts have been concentrated on the analysis and classification of vibration signatures collected from operating machinery. Two neural networks algorithms were used in our project: the Recirculation algorithm for data compression and the Backpropagation algorithm to perform the actual classification of the patterns. Although this project is in the early stages of development it indicates that neural networks may provide a viable methodology for monitoring and diagnostics of vibrating components. Our results to date are very encouraging

Heat exchanger networks design with constraints

International Nuclear Information System (INIS)

Amidpur, M.; Zoghi, A.; Nasiri, N.

2000-01-01

So far there have been two approaches to the problem of heat recovery system design where stream matching constraints exist. The first approach involves mathematical techniques for solving the combinational problem taking due recognition of the constraints. These methodologies are now efficient, still suffer from the problem of taking a significant amount of control and direction away from the designer. The second approach based upon so called pinch technology and involves the use of adaptation of standard problem table algorithm. Unfortunately, the proposed methodologies are not very easy to understand, therefore they fail to provide the insight and generally associated with these approaches. Here, a new pinch based methodology is presented. In this method, we modified the traditional numerical targeting procedure-problem table algorithm which is stream cascade table. Unconstrained groups are established by using of artificial intelligence method such that they have minimum utility consumption among different alternatives. Each group is an individual network, therefore, traditional optimization, used in pinch technology, should be employed. By transferring energy between groups heat recovery can be maximized, then each group designs individually and finally networks combine together. One of the advantages of using this method is simple targeting and easy networks-design. Besides the approach has the potential using of new network design methods such as dual temperature approach, flexible pinch design, pseudo pinch design. It is hoped that this methodology provides insight easy network design

Asset Management for Water and Wastewater Utilities

Science.gov (United States)

Renewing and replacing the nation's public water infrastructure is an ongoing task. Asset management can help a utility maximize the value of its capital as well as its operations and maintenance dollars.

KeyPathwayMiner - De-novo network enrichment by combining multiple OMICS data and biological networks

DEFF Research Database (Denmark)

Baumbach, Jan; Alcaraz, Nicolas; Pauling, Josch K.

We tackle the problem of de-novo pathway extraction. Given a biological network and a set of case-control studies, KeyPathwayMiner efficiently extracts and visualizes all maximal connected sub-networks that contain mainly genes that are dysregulated, e.g., differentially expressed, in most cases ...

Is CP violation maximal

International Nuclear Information System (INIS)

Gronau, M.

1984-01-01

Two ambiguities are noted in the definition of the concept of maximal CP violation. The phase convention ambiguity is overcome by introducing a CP violating phase in the quark mixing matrix U which is invariant under rephasing transformations. The second ambiguity, related to the parametrization of U, is resolved by finding a single empirically viable definition of maximal CP violation when assuming that U does not single out one generation. Considerable improvement in the calculation of nonleptonic weak amplitudes is required to test the conjecture of maximal CP violation. 21 references

Classifying Sensors Depending on their IDs to Reduce Power Consumption in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Ayman Mohammd Brisha

2010-05-01

Full Text Available Wireless sensor networks produce a large amount of data that needs to be processed, delivered, and assessed according to the application objectives. Cluster-based is an effective architecture for data-gathering in wireless sensor networks. Clustering provides an effective way for prolonging the lifetime of a wireless sensor network. Current clustering algorithms usually utilize two techniques, selecting cluster heads with more residual energy and rotating cluster heads periodically, in order to distribute the energy consumption among nodes in each cluster and extend the network lifetime. Clustering sensors are divided into groups, so that sensors will communicate information only to cluster heads and then the cluster heads will communicate the aggregated information to the processing center, and this may save energy. In this paper we show Two Relay Sensor Algorithm (TRSA, which divide wireless Sensor Network (WSN into unequaled clusters, showing that it can effectively save power for maximizing the life time of the network. Simulation results show that the proposed unequal clustering mechanism (TRSA balances the energy consumption among all sensor nodes and achieves an obvious improvement on the network lifetime.

Shareholder, stakeholder-owner or broad stakeholder maximization

OpenAIRE

Mygind, Niels

2004-01-01

With reference to the discussion about shareholder versus stakeholder maximization it is argued that the normal type of maximization is in fact stakeholder-owner maxi-mization. This means maximization of the sum of the value of the shares and stake-holder benefits belonging to the dominating stakeholder-owner. Maximization of shareholder value is a special case of owner-maximization, and only under quite re-strictive assumptions shareholder maximization is larger or equal to stakeholder-owner...

Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time

Science.gov (United States)

2011-01-01

523 10 Arabisopsis thaliana 1745 3098 71 12 Drosophila melanogaster 7282 24894 176 12 Homo Sapiens 9527 31182 308 12 Schizosaccharomyces pombe 2031...clusters of actors [6,14,28,40] and may be used as features in exponential random graph models for statistical analysis of social networks [17,19,20,44,49...29. R. Horaud and T. Skordas. Stereo correspondence through feature grouping and maximal cliques. IEEE Trans. Patt. An. Mach. Int. 11(11):1168–1180

User Matching with Relation to the Stable Marriage Problem in Cognitive Radio Networks

KAUST Repository

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.

Emergency Vehicle Scheduling Problem with Time Utility in Disasters

Directory of Open Access Journals (Sweden)

Xiaobing Gan

2015-01-01

Full Text Available This paper presents a flexible emergency rescue system which is chiefly composed of three parts, namely, disaster assistance center, relief vehicles, and disaster areas. A novel objective of utility maximization is used to evaluate the entire system in disasters. Considering the uncertain road conditions in the relief distribution, we implement triangular fuzzy number to calculate the vehicle velocity. As a consequence, a fuzzy mathematical model is built to maximize the utility of emergency rescue system and then converted to the crisp counterpart. Finally, the results of numerical experiments obtained by particle swarm optimization (PSO prove the validity of this proposed mathematical model.

Integration of SPS with utility system networks

Energy Technology Data Exchange (ETDEWEB)

Kaupang, B.M.

1980-06-01

This paper will discuss the integration of SPS power in electric utility power systems. Specifically treated will be the nature of the power output variations from the spacecraft to the rectenna, the operational characteristics of the rectenna power and the impacts on the electric utility system from utilizing SPS power to serve part of the system load.

Task-oriented maximally entangled states

International Nuclear Information System (INIS)

Agrawal, Pankaj; Pradhan, B

2010-01-01

We introduce the notion of a task-oriented maximally entangled state (TMES). This notion depends on the task for which a quantum state is used as the resource. TMESs are the states that can be used to carry out the task maximally. This concept may be more useful than that of a general maximally entangled state in the case of a multipartite system. We illustrate this idea by giving an operational definition of maximally entangled states on the basis of communication tasks of teleportation and superdense coding. We also give examples and a procedure to obtain such TMESs for n-qubit systems.

Wireless Energy Harvesting Two-Way Relay Networks with Hardware Impairments.

Science.gov (United States)

Peng, Chunling; Li, Fangwei; Liu, Huaping

2017-11-13

This paper considers a wireless energy harvesting two-way relay (TWR) network where the relay has energy-harvesting abilities and the effects of practical hardware impairments are taken into consideration. In particular, power splitting (PS) receiver is adopted at relay to harvests the power it needs for relaying the information between the source nodes from the signals transmitted by the source nodes, and hardware impairments is assumed suffered by each node. We analyze the effect of hardware impairments [-20]on both decode-and-forward (DF) relaying and amplify-and-forward (AF) relaying networks. By utilizing the obtained new expressions of signal-to-noise-plus-distortion ratios, the exact analytical expressions of the achievable sum rate and ergodic capacities for both DF and AF relaying protocols are derived. Additionally, the optimal power splitting (OPS) ratio that maximizes the instantaneous achievable sum rate is formulated and solved for both protocols. The performances of DF and AF protocols are evaluated via numerical results, which also show the effects of various network parameters on the system performance and on the OPS ratio design.

Robust Template Decomposition without Weight Restriction for Cellular Neural Networks Implementing Arbitrary Boolean Functions Using Support Vector Classifiers

Directory of Open Access Journals (Sweden)

Yih-Lon Lin

2013-01-01

Full Text Available If the given Boolean function is linearly separable, a robust uncoupled cellular neural network can be designed as a maximal margin classifier. On the other hand, if the given Boolean function is linearly separable but has a small geometric margin or it is not linearly separable, a popular approach is to find a sequence of robust uncoupled cellular neural networks implementing the given Boolean function. In the past research works using this approach, the control template parameters and thresholds are restricted to assume only a given finite set of integers, and this is certainly unnecessary for the template design. In this study, we try to remove this restriction. Minterm- and maxterm-based decomposition algorithms utilizing the soft margin and maximal margin support vector classifiers are proposed to design a sequence of robust templates implementing an arbitrary Boolean function. Several illustrative examples are simulated to demonstrate the efficiency of the proposed method by comparing our results with those produced by other decomposition methods with restricted weights.

A Dynamic Programming Model for Internal Attack Detection in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Qiong Shi

2017-01-01

Full Text Available Internal attack is a crucial security problem of WSN (wireless sensor network. In this paper, we focus on the internal attack detection which is an important way to locate attacks. We propose a state transition model, based on the continuous time Markov chain (CTMC, to study the behaviors of the sensors in a WSN under internal attack. Then we conduct the internal attack detection model as the epidemiological model. In this model, we explore the detection rate as the rate of a compromised state transition to a response state. By using the Bellman equation, the utility for the state transitions of a sensor can be written in standard forms of dynamic programming. It reveals a natural way to find the optimal detection rate that is by maximizing the total utility of the compromised state of the node (the sum of current utility and future utility. In particular, we encapsulate the current state, survivability, availability, and energy consumption of the WSN into an information set. We conduct extensive experiments and the results show the effectiveness of our solutions.

The Application of Social Characteristic and L1 Optimization in the Error Correction for Network Coding in Wireless Sensor Networks.

Science.gov (United States)

Zhang, Guangzhi; Cai, Shaobin; Xiong, Naixue

2018-02-03

One of the remarkable challenges about Wireless Sensor Networks (WSN) is how to transfer the collected data efficiently due to energy limitation of sensor nodes. Network coding will increase network throughput of WSN dramatically due to the broadcast nature of WSN. However, the network coding usually propagates a single original error over the whole network. Due to the special property of error propagation in network coding, most of error correction methods cannot correct more than C /2 corrupted errors where C is the max flow min cut of the network. To maximize the effectiveness of network coding applied in WSN, a new error-correcting mechanism to confront the propagated error is urgently needed. Based on the social network characteristic inherent in WSN and L1 optimization, we propose a novel scheme which successfully corrects more than C /2 corrupted errors. What is more, even if the error occurs on all the links of the network, our scheme also can correct errors successfully. With introducing a secret channel and a specially designed matrix which can trap some errors, we improve John and Yi's model so that it can correct the propagated errors in network coding which usually pollute exactly 100% of the received messages. Taking advantage of the social characteristic inherent in WSN, we propose a new distributed approach that establishes reputation-based trust among sensor nodes in order to identify the informative upstream sensor nodes. With referred theory of social networks, the informative relay nodes are selected and marked with high trust value. The two methods of L1 optimization and utilizing social characteristic coordinate with each other, and can correct the propagated error whose fraction is even exactly 100% in WSN where network coding is performed. The effectiveness of the error correction scheme is validated through simulation experiments.

A User Cooperation Stimulating Strategy Based on Cooperative Game Theory in Cooperative Relay Networks

Directory of Open Access Journals (Sweden)

Ping Zhang

2009-01-01

Full Text Available This paper proposes a user cooperation stimulating strategy among rational users. The strategy is based on cooperative game theory and enacted in the context of cooperative relay networks. Using the pricing-based mechanism, the system is modeled initially with two nodes and a Base Station (BS. Within this framework, each node is treated as a rational decision maker. To this end, each node can decide whether to cooperate and how to cooperate. Cooperative game theory assists in providing an optimal system utility and provides fairness among users. Under different cooperative forwarding modes, certain questions are carefully investigated, including “what is each node's best reaction to maximize its utility?” and “what is the optimal reimbursement to encourage cooperation?” Simulation results show that the nodes benefit from the proposed cooperation stimulating strategy in terms of utility and thus justify the fairness between each user.

A User Cooperation Stimulating Strategy Based on Cooperative Game Theory in Cooperative Relay Networks

Directory of Open Access Journals (Sweden)

Jiang Fan

2009-01-01

Full Text Available This paper proposes a user cooperation stimulating strategy among rational users. The strategy is based on cooperative game theory and enacted in the context of cooperative relay networks. Using the pricing-based mechanism, the system is modeled initially with two nodes and a Base Station (BS. Within this framework, each node is treated as a rational decision maker. To this end, each node can decide whether to cooperate and how to cooperate. Cooperative game theory assists in providing an optimal system utility and provides fairness among users. Under different cooperative forwarding modes, certain questions are carefully investigated, including "what is each node's best reaction to maximize its utility?" and "what is the optimal reimbursement to encourage cooperation?" Simulation results show that the nodes benefit from the proposed cooperation stimulating strategy in terms of utility and thus justify the fairness between each user.

FLOUTING MAXIMS IN INDONESIA LAWAK KLUB CONVERSATION

Directory of Open Access Journals (Sweden)

Rahmawati Sukmaningrum

2017-04-01

Full Text Available This study aims to identify the types of maxims flouted in the conversation in famous comedy show, Indonesia Lawak Club. Likewise, it also tries to reveal the speakers‘ intention of flouting the maxim in the conversation during the show. The writers use descriptive qualitative method in conducting this research. The data is taken from the dialogue of Indonesia Lawak club and then analyzed based on Grice‘s cooperative principles. The researchers read the dialogue‘s transcripts, identify the maxims, and interpret the data to find the speakers‘ intention for flouting the maxims in the communication. The results show that there are four types of maxims flouted in the dialogue. Those are maxim of quality (23%, maxim of quantity (11%, maxim of manner (31%, and maxim of relevance (35. Flouting the maxims in the conversations is intended to make the speakers feel uncomfortable with the conversation, show arrogances, show disagreement or agreement, and ridicule other speakers.

VIOLATION OF CONVERSATION MAXIM ON TV ADVERTISEMENTS

Directory of Open Access Journals (Sweden)

Desak Putu Eka Pratiwi

2015-07-01

Full Text Available Maxim is a principle that must be obeyed by all participants textually and interpersonally in order to have a smooth communication process. Conversation maxim is divided into four namely maxim of quality, maxim of quantity, maxim of relevance, and maxim of manner of speaking. Violation of the maxim may occur in a conversation in which the information the speaker has is not delivered well to his speaking partner. Violation of the maxim in a conversation will result in an awkward impression. The example of violation is the given information that is redundant, untrue, irrelevant, or convoluted. Advertisers often deliberately violate the maxim to create unique and controversial advertisements. This study aims to examine the violation of maxims in conversations of TV ads. The source of data in this research is food advertisements aired on TV media. Documentation and observation methods are applied to obtain qualitative data. The theory used in this study is a maxim theory proposed by Grice (1975. The results of the data analysis are presented with informal method. The results of this study show an interesting fact that the violation of maxim in a conversation found in the advertisement exactly makes the advertisements very attractive and have a high value.

Finding Maximal Quasiperiodicities in Strings

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Pedersen, Christian N. S.

2000-01-01

of length n in time O(n log n) and space O(n). Our algorithm uses the suffix tree as the fundamental data structure combined with efficient methods for merging and performing multiple searches in search trees. Besides finding all maximal quasiperiodic substrings, our algorithm also marks the nodes......Apostolico and Ehrenfeucht defined the notion of a maximal quasiperiodic substring and gave an algorithm that finds all maximal quasiperiodic substrings in a string of length n in time O(n log2 n). In this paper we give an algorithm that finds all maximal quasiperiodic substrings in a string...... in the suffix tree that have a superprimitive path-label....

Two Dimensional Array Based Overlay Network for Balancing Load of Peer-to-Peer Live Video Streaming

International Nuclear Information System (INIS)

Ibrahimy, Abdullah Faruq Ibn; Rafiqul, Islam Md; Anwar, Farhat; Ibrahimy, Muhammad Ibn

2013-01-01

The live video data is streaming usually in a tree-based overlay network or in a mesh-based overlay network. In case of departure of a peer with additional upload bandwidth, the overlay network becomes very vulnerable to churn. In this paper, a two dimensional array-based overlay network is proposed for streaming the live video stream data. As there is always a peer or a live video streaming server to upload the live video stream data, so the overlay network is very stable and very robust to churn. Peers are placed according to their upload and download bandwidth, which enhances the balance of load and performance. The overlay network utilizes the additional upload bandwidth of peers to minimize chunk delivery delay and to maximize balance of load. The procedure, which is used for distributing the additional upload bandwidth of the peers, distributes the additional upload bandwidth to the heterogeneous strength peers in a fair treat distribution approach and to the homogeneous strength peers in a uniform distribution approach. The proposed overlay network has been simulated by Qualnet from Scalable Network Technologies and results are presented in this paper

Two Dimensional Array Based Overlay Network for Balancing Load of Peer-to-Peer Live Video Streaming

Science.gov (United States)

Faruq Ibn Ibrahimy, Abdullah; Rafiqul, Islam Md; Anwar, Farhat; Ibn Ibrahimy, Muhammad

2013-12-01

The live video data is streaming usually in a tree-based overlay network or in a mesh-based overlay network. In case of departure of a peer with additional upload bandwidth, the overlay network becomes very vulnerable to churn. In this paper, a two dimensional array-based overlay network is proposed for streaming the live video stream data. As there is always a peer or a live video streaming server to upload the live video stream data, so the overlay network is very stable and very robust to churn. Peers are placed according to their upload and download bandwidth, which enhances the balance of load and performance. The overlay network utilizes the additional upload bandwidth of peers to minimize chunk delivery delay and to maximize balance of load. The procedure, which is used for distributing the additional upload bandwidth of the peers, distributes the additional upload bandwidth to the heterogeneous strength peers in a fair treat distribution approach and to the homogeneous strength peers in a uniform distribution approach. The proposed overlay network has been simulated by Qualnet from Scalable Network Technologies and results are presented in this paper.

Networking Technologies for Future Home Networks Using 60 GHz Radio

OpenAIRE

Wang, J.

2010-01-01

Networking technologies have been changing the life of people in their private residential space. With the arrival of high definition (HD) multimedia services and broadband communications into the living space, future home networks are expected to support high speed device-to-device connectivity with Quality-of-Service (QoS) provisioning. There is no prize for guessing that it has to be wireless communication which creates maximal freedom. Nevertheless, it is doubtful that today's home networ...

Utility-Based Link Recommendation in Social Networks

Science.gov (United States)

Li, Zhepeng

2013-01-01

Link recommendation, which suggests links to connect currently unlinked users, is a key functionality offered by major online social networking platforms. Salient examples of link recommendation include "people you may know"' on Facebook and "who to follow" on Twitter. A social networking platform has two types of stakeholder:…

Improved NGL recovery designs maximize operating flexibility and product recoveries

International Nuclear Information System (INIS)

Wilkinson, J.D.; Hudson, H.M.

1992-01-01

This paper reports that the historically cyclical nature in the market for ethane and propane has demonstrated the need for flexible natural gas liquids (NGL) recovery plants. NEwly developed and patented processes are now available which can provide ultra-high recovery of ethane (95%+) when demand for ethane is high and provide essentially complete ethane rejection without the normally concomitant reduction in propane recovery. This provides plant operators the flexibility to respond more readily to NGL market conditions, thus maximizing plant operating profits. The new process designs provide this flexibility without increasing utility requirements. In fact, utility consumption is often lower when compared to conventional designs. This same process technology can also be easily retrofit into existing plants with relatively quick payout of the modifications from both recovery and efficiency improvements

Delay/Disruption Tolerance Networking (DTN) Implementation and Utilization Options on the International Space Station

Science.gov (United States)

Holbrook, Mark; Pitts, Robert Lee; Gifford, Kevin K.; Jenkins, Andrew; Kuzminsky, Sebastian

2010-01-01

The International Space Station (ISS) is in an operational configuration and nearing final assembly. With its maturity and diverse payloads onboard, the opportunity exists to extend the orbital lab into a facility to exercise and demonstrate Delay/Disruption Tolerant Networking (DTN). DTN is an end-to-end network service providing communications through environments characterized by intermittent connectivity, variable delays, high bit error rates, asymmetric links and simplex links. The DTN protocols, also known as bundle protocols, provide a store-and-forward capability to accommodate end-to-end network services. Key capabilities of the bundling protocols include: the Ability to cope with intermittent connectivity, the Ability to take advantage of scheduled and opportunistic connectivity (in addition to always up connectivity), Custody Transfer, and end-to-end security. Colorado University at Boulder and the Huntsville Operational Support Center (HOSC) have been developing a DTN capability utilizing the Commercial Generic Bioprocessing Apparatus (CGBA) payload resources onboard the ISS, at the Boulder Payload Operations Center (POC) and at the HOSC. The DTN capability is in parallel with and is designed to augment current capabilities. The architecture consists of DTN endpoint nodes on the ISS and at the Boulder POC, and a DTN node at the HOSC. The DTN network is composed of two implementations; the Interplanetary Overlay Network (ION) and the open source DTN2 implementation. This paper presents the architecture, implementation, and lessons learned. By being able to handle the types of environments described above, the DTN technology will be instrumental in extending networks into deep space to support future missions to other planets and other solar system points of interest. Thus, this paper also discusses how this technology will be applicable to these types of deep space exploration missions.

Optimal Joint Detection and Estimation That Maximizes ROC-Type Curves.

Science.gov (United States)

Wunderlich, Adam; Goossens, Bart; Abbey, Craig K

2016-09-01

Combined detection-estimation tasks are frequently encountered in medical imaging. Optimal methods for joint detection and estimation are of interest because they provide upper bounds on observer performance, and can potentially be utilized for imaging system optimization, evaluation of observer efficiency, and development of image formation algorithms. We present a unified Bayesian framework for decision rules that maximize receiver operating characteristic (ROC)-type summary curves, including ROC, localization ROC (LROC), estimation ROC (EROC), free-response ROC (FROC), alternative free-response ROC (AFROC), and exponentially-transformed FROC (EFROC) curves, succinctly summarizing previous results. The approach relies on an interpretation of ROC-type summary curves as plots of an expected utility versus an expected disutility (or penalty) for signal-present decisions. We propose a general utility structure that is flexible enough to encompass many ROC variants and yet sufficiently constrained to allow derivation of a linear expected utility equation that is similar to that for simple binary detection. We illustrate our theory with an example comparing decision strategies for joint detection-estimation of a known signal with unknown amplitude. In addition, building on insights from our utility framework, we propose new ROC-type summary curves and associated optimal decision rules for joint detection-estimation tasks with an unknown, potentially-multiple, number of signals in each observation.

Report for fiscal 2000 on electronic patient record network discussion committee. Survey on promotion of medical information use utilizing electronic patient record network; 2000 nendo denshi karute network kento iinkai hokokusho. Denshi karute network wo katsuyoshita iryo johoka no sokushin ni kansuru chosa

Energy Technology Data Exchange (ETDEWEB)

NONE

2001-03-01

Based on the movements in the most advanced IT technologies and in social system reformation in the medical and health preservation fields, discussions were given on the assignments and measures to be solved to realize the medical information network, and the secondary utilization method of the medical information and the assignments and measures in the utilization thereof. A patient record is originally a document stating the secrets of a patient for his or her medical information, and has a nature that doctors may be sued from the patient if they disclose or exchange the document. There is a large number of company owners, politicians or salaried people who would not want their diseases which they had in the past, the name of the existing disease and medical treatment to be made public. The electronic patient record network has a conflicting proposition to elevate its values by means of data re-utilization, secondary utilization and information exchange. Preparation of the database requires multilateral analyses and classifications, as well as sufficient discussions and realistic execution including the consistency with the personal information protection law, as to whether it is information that the patient wants the exchange or disclosure, or whether it is information to be exchanged or disclosed even if the patient refuses it, not speak of attention to 5W1H. (NEDO)

Stimulus Sensitivity of a Spiking Neural Network Model

Science.gov (United States)

Chevallier, Julien

2018-02-01

Some recent papers relate the criticality of complex systems to their maximal capacity of information processing. In the present paper, we consider high dimensional point processes, known as age-dependent Hawkes processes, which have been used to model spiking neural networks. Using mean-field approximation, the response of the network to a stimulus is computed and we provide a notion of stimulus sensitivity. It appears that the maximal sensitivity is achieved in the sub-critical regime, yet almost critical for a range of biologically relevant parameters.

Shareholder, stakeholder-owner or broad stakeholder maximization

DEFF Research Database (Denmark)

Mygind, Niels

2004-01-01

With reference to the discussion about shareholder versus stakeholder maximization it is argued that the normal type of maximization is in fact stakeholder-owner maxi-mization. This means maximization of the sum of the value of the shares and stake-holder benefits belonging to the dominating...... including the shareholders of a company. Although it may be the ultimate goal for Corporate Social Responsibility to achieve this kind of maximization, broad stakeholder maximization is quite difficult to give a precise definition. There is no one-dimensional measure to add different stakeholder benefits...... not traded on the mar-ket, and therefore there is no possibility for practical application. Broad stakeholder maximization instead in practical applications becomes satisfying certain stakeholder demands, so that the practical application will be stakeholder-owner maximization un-der constraints defined...

On the maximal superalgebras of supersymmetric backgrounds

International Nuclear Information System (INIS)

Figueroa-O'Farrill, Jose; Hackett-Jones, Emily; Moutsopoulos, George; Simon, Joan

2009-01-01

In this paper we give a precise definition of the notion of a maximal superalgebra of certain types of supersymmetric supergravity backgrounds, including the Freund-Rubin backgrounds, and propose a geometric construction extending the well-known construction of its Killing superalgebra. We determine the structure of maximal Lie superalgebras and show that there is a finite number of isomorphism classes, all related via contractions from an orthosymplectic Lie superalgebra. We use the structure theory to show that maximally supersymmetric waves do not possess such a maximal superalgebra, but that the maximally supersymmetric Freund-Rubin backgrounds do. We perform the explicit geometric construction of the maximal superalgebra of AdS 4 X S 7 and find that it is isomorphic to osp(1|32). We propose an algebraic construction of the maximal superalgebra of any background asymptotic to AdS 4 X S 7 and we test this proposal by computing the maximal superalgebra of the M2-brane in its two maximally supersymmetric limits, finding agreement.

Status of Utilizing Social Media Networks in the Teaching-Learning Process at Public Jordanian Universities

OpenAIRE

Muneera Abdalkareem Alshdefait; Mohammad . S. Alzboon

2018-01-01

This study aimed at finding out the status of utilizing social media networks in the teaching-learning process at public Jordanian Universities. To achieve the goal of the study, the descriptive developmental method was used and a questionnaire was developed, consisting of (35) statements. The questionnaire was checked for its validity and reliability. Then it was distributed to a sample of (382) male and female students from the undergraduate and graduate levels. The study results showed tha...

Modeling regulated water utility investment incentives

Science.gov (United States)

Padula, S.; Harou, J. J.

2014-12-01

This work attempts to model the infrastructure investment choices of privatized water utilities subject to rate of return and price cap regulation. The goal is to understand how regulation influences water companies' investment decisions such as their desire to engage in transfers with neighbouring companies. We formulate a profit maximization capacity expansion model that finds the schedule of new supply, demand management and transfer schemes that maintain the annual supply-demand balance and maximize a companies' profit under the 2010-15 price control process in England. Regulatory incentives for costs savings are also represented in the model. These include: the CIS scheme for the capital expenditure (capex) and incentive allowance schemes for the operating expenditure (opex) . The profit-maximizing investment program (what to build, when and what size) is compared with the least cost program (social optimum). We apply this formulation to several water companies in South East England to model performance and sensitivity to water network particulars. Results show that if companies' are able to outperform the regulatory assumption on the cost of capital, a capital bias can be generated, due to the fact that the capital expenditure, contrarily to opex, can be remunerated through the companies' regulatory capital value (RCV). The occurrence of the 'capital bias' or its entity depends on the extent to which a company can finance its investments at a rate below the allowed cost of capital. The bias can be reduced by the regulatory penalties for underperformances on the capital expenditure (CIS scheme); Sensitivity analysis can be applied by varying the CIS penalty to see how and to which extent this impacts the capital bias effect. We show how regulatory changes could potentially be devised to partially remove the 'capital bias' effect. Solutions potentially include allowing for incentives on total expenditure rather than separately for capex and opex and allowing

Transcriptional Regulatory Network Analysis of MYB Transcription Factor Family Genes in Rice

Directory of Open Access Journals (Sweden)

Shuchi eSmita

2015-12-01

Full Text Available MYB transcription factor (TF is one of the largest TF families and regulates defense responses to various stresses, hormone signaling as well as many metabolic and developmental processes in plants. Understanding these regulatory hierarchies of gene expression networks in response to developmental and environmental cues is a major challenge due to the complex interactions between the genetic elements. Correlation analyses are useful to unravel co-regulated gene pairs governing biological process as well as identification of new candidate hub genes in response to these complex processes. High throughput expression profiling data are highly useful for construction of co-expression networks. In the present study, we utilized transcriptome data for comprehensive regulatory network studies of MYB TFs by top down and guide gene approaches. More than 50% of OsMYBs were strongly correlated under fifty experimental conditions with 51 hub genes via top down approach. Further, clusters were identified using Markov Clustering (MCL. To maximize the clustering performance, parameter evaluation of the MCL inflation score (I was performed in terms of enriched GO categories by measuring F-score. Comparison of co-expressed cluster and clads analyzed from phylogenetic analysis signifies their evolutionarily conserved co-regulatory role. We utilized compendium of known interaction and biological role with Gene Ontology enrichment analysis to hypothesize function of coexpressed OsMYBs. In the other part, the transcriptional regulatory network analysis by guide gene approach revealed 40 putative targets of 26 OsMYB TF hubs with high correlation value utilizing 815 microarray data. The putative targets with MYB-binding cis-elements enrichment in their promoter region, functional co-occurrence as well as nuclear localization supports our finding. Specially, enrichment of MYB binding regions involved in drought-inducibility implying their regulatory role in drought

Integration of SPS with utility system networks

Science.gov (United States)

Kaupang, B. M.

1980-01-01

The integration of Satellite Power System (SPS) power in electric utility power systems is discussed. Specifically, the nature of the power output variations from the spacecraft to the rectenna, the operational characteristics of the rectenna power, and the impacts on the electric utility system from utilizing SPS power to serve part of the system load are treated. It is concluded that if RF beam control is an acceptable method for power control, and that the site distribution of SPS rectennas do not cause a very high local penetration (40 to 50%), SPS may be integrated into electric utility system with a few negative impacts. Increased regulating duty on the conventional generation, and a potential impact on system reliability for SPS penetration in excess of about 25% appear to be two areas of concern.

Utility green pricing programs: a statistical analysis of program effectiveness

International Nuclear Information System (INIS)

Ryan, W.; Scott, O.; Lori, B.; Blair, S.

2005-01-01

Utility green pricing programs represent one way in which consumers can voluntarily support the development of renewable energy. The design features and effectiveness of these programs varies considerably. Based on a survey of utility program managers in the United States, this article provides insight into which program features might help maximize both customer participation in green pricing programs and the amount of renewable energy purchased by customers in those programs. We find that program length has a substantial impact on customer participation and purchases; to achieve higher levels of success, utilities will need to remain committed to their product offering for some time. Our findings also suggest that utilities should consider higher renewable energy purchase thresholds for residential customers in order to maximize renewable energy sales. Smaller utilities are found to be more successful than larger utilities, and we find some evidence that providing private benefits to nonresidential participants can enhance success. Interestingly, we find little evidence that the cost of the green pricing product greatly impacts customer participation and renewable energy sales, at least over the narrow range of premiums embedded in our data set, and for the initial set of green power purchasers. (author)

Maximally multipartite entangled states

Science.gov (United States)

Facchi, Paolo; Florio, Giuseppe; Parisi, Giorgio; Pascazio, Saverio

2008-06-01

We introduce the notion of maximally multipartite entangled states of n qubits as a generalization of the bipartite case. These pure states have a bipartite entanglement that does not depend on the bipartition and is maximal for all possible bipartitions. They are solutions of a minimization problem. Examples for small n are investigated, both analytically and numerically.

Maximally Symmetric Composite Higgs Models.

Science.gov (United States)

Csáki, Csaba; Ma, Teng; Shu, Jing

2017-09-29

Maximal symmetry is a novel tool for composite pseudo Goldstone boson Higgs models: it is a remnant of an enhanced global symmetry of the composite fermion sector involving a twisting with the Higgs field. Maximal symmetry has far-reaching consequences: it ensures that the Higgs potential is finite and fully calculable, and also minimizes the tuning. We present a detailed analysis of the maximally symmetric SO(5)/SO(4) model and comment on its observational consequences.

Automatic optimization of core loading patterns to maximize cycle energy production within operational constraints

International Nuclear Information System (INIS)

Hobson, G.H.; Turinsky, P.J.

1986-01-01

Computational capability has been developed to automatically determine the core loading pattern which minimizes fuel cycle costs for a pressurized water reactor. Equating fuel cycle cost minimization with core reactivity maximization, the objective is to determine the loading pattern which maximizes core reactivity at end-of-cycle while satisfying the power peaking constraint throughout the cycle and region average discharge burnup limit. The method utilizes a two-dimensional, coarse mesh, finite difference scheme to evaluate core reactivity and fluxes for an initial reference loading pattern as a function of cycle burnup. First order perturbation theory is applied to determine the effects of assembly shuffling on reactivity, power distribution, and end-of-cycle burnup

Formation Control of the MAXIM L2 Libration Orbit Mission

Science.gov (United States)

Folta, David; Hartman, Kate; Howell, Kathleen; Marchand, Belinda

2004-01-01

The Micro-Arcsecond X-ray Imaging Mission (MAXIM), a proposed concept for the Structure and Evolution of the Universe (SEU) Black Hole Imager mission, is designed to make a ten million-fold improvement in X-ray image clarity of celestial objects by providing better than 0.1 micro-arcsecond imaging. Currently the mission architecture comprises 25 spacecraft, 24 as optics modules and one as the detector, which will form sparse sub-apertures of a grazing incidence X-ray interferometer covering the 0.3-10 keV bandpass. This formation must allow for long duration continuous science observations and also for reconfiguration that permits re-pointing of the formation. To achieve these mission goals, the formation is required to cooperatively point at desired targets. Once pointed, the individual elements of the MAXIM formation must remain stable, maintaining their relative positions and attitudes below a critical threshold. These pointing and formation stability requirements impact the control and design of the formation. In this paper, we provide analysis of control efforts that are dependent upon the stability and the configuration and dimensions of the MAXIM formation. We emphasize the utilization of natural motions in the Lagrangian regions to minimize the control efforts and we address continuous control via input feedback linearization (IFL). Results provide control cost, configuration options, and capabilities as guidelines for the development of this complex mission.

Lithium-thionyl chloride battery design concepts for maximized power applications

Science.gov (United States)

Kane, P.; Marincic, N.

The need for primary batteries configured to deliver maximized power has been asserted by many different procuring activities. Battery Engineering Inc. has developed some specific design concepts and mastered some specialized techniques utilized in the production of this type of power source. The batteries have been successfully bench tested during the course of virtually all of these programs, with ultimate success coming in the form of two successful test launches under the USAF Plasma Effects Decoy Program. This paper briefly discusses some of these design concepts and the rationale behind them.

Revisiting Social Network Utilization by Physicians-in-Training.

Science.gov (United States)

Black, Erik W; Thompson, Lindsay A; Duff, W Patrick; Dawson, Kara; Saliba, Heidi; Black, Nicole M Paradise

2010-06-01

To measure and compare the frequency and content of online social networking among 2 cohorts of medical students and residents (2007 and 2009). Using the online social networking application Facebook, we evaluated social networking profiles for 2 cohorts of medical students (n  =  528) and residents (n  =  712) at the University of Florida in Gainesville. Objective measures included existence of a profile, whether it was made private, and whether any personally identifiable information was included. Subjective outcomes included photographic content, affiliated social groups, and personal information not generally disclosed in a doctor-patient encounter. We compared our results to our previously published and reported data from 2007. Social networking continues to be common amongst physicians-in-training, with 39.8% of residents and 69.5% of medical students maintaining Facebook accounts. Residents' participation significantly increased (P privacy settings (P privacy and the expansive and impersonal networks of online "friends" who may view profiles.

Self-Optimization of LTE Networks Utilizing Celnet Xplorer

CERN Document Server

Buvaneswari, A; Polakos, Paul; Buvaneswari, Arumugam

2010-01-01

In order to meet demanding performance objectives in Long Term Evolution (LTE) networks, it is mandatory to implement highly efficient, autonomic self-optimization and configuration processes. Self-optimization processes have already been studied in second generation (2G) and third generation (3G) networks, typically with the objective of improving radio coverage and channel capacity. The 3rd Generation Partnership Project (3GPP) standard for LTE self-organization of networks (SON) provides guidelines on self-configuration of physical cell ID and neighbor relation function and self-optimization for mobility robustness, load balancing, and inter-cell interference reduction. While these are very important from an optimization perspective of local phenomenon (i.e., the eNodeB's interaction with its neighbors), it is also essential to architect control algorithms to optimize the network as a whole. In this paper, we propose a Celnet Xplorer-based SON architecture that allows detailed analysis of network performan...

Maximal quantum Fisher information matrix

International Nuclear Information System (INIS)

Chen, Yu; Yuan, Haidong

2017-01-01

We study the existence of the maximal quantum Fisher information matrix in the multi-parameter quantum estimation, which bounds the ultimate precision limit. We show that when the maximal quantum Fisher information matrix exists, it can be directly obtained from the underlying dynamics. Examples are then provided to demonstrate the usefulness of the maximal quantum Fisher information matrix by deriving various trade-off relations in multi-parameter quantum estimation and obtaining the bounds for the scalings of the precision limit. (paper)

Utility Evaluation Based on One-To-N Mapping in the Prisoner's Dilemma Game for Interdependent Networks.

Directory of Open Access Journals (Sweden)

Juan Wang

Full Text Available In the field of evolutionary game theory, network reciprocity has become an important means to promote the level of promotion within the population system. Recently, the interdependency provides a novel perspective to understand the widespread cooperation behavior in many real-world systems. In previous works, interdependency is often built from the direct or indirect connections between two networks through the one-to-one mapping mode. However, under many realistic scenarios, players may need much more information from many neighboring agents so as to make a more rational decision. Thus, beyond the one-to-one mapping mode, we investigate the cooperation behavior on two interdependent lattices, in which the utility evaluation of a focal player on one lattice may not only concern himself, but also integrate the payoff information of several corresponding players on the other lattice. Large quantities of simulations indicate that the cooperation can be substantially promoted when compared to the traditionally spatial lattices. The cluster formation and phase transition are also analyzed in order to explore the role of interdependent utility coupling in the collective cooperation. Current results are beneficial to deeply understand various mechanisms to foster the cooperation exhibited inside natural, social and engineering systems.

Understanding Violations of Gricean Maxims in Preschoolers and Adults

Directory of Open Access Journals (Sweden)

Mako eOkanda

2015-07-01

Full Text Available This study used a revised Conversational Violations Test to examine Gricean maxim violations in 4- to 6-year-old Japanese children and adults. Participants’ understanding of the following maxims was assessed: be informative (first maxim of quantity, avoid redundancy (second maxim of quantity, be truthful (maxim of quality, be relevant (maxim of relation, avoid ambiguity (second maxim of manner, and be polite (maxim of politeness. Sensitivity to violations of Gricean maxims increased with age: 4-year-olds’ understanding of maxims was near chance, 5-year-olds understood some maxims (first maxim of quantity and maxims of quality, relation, and manner, and 6-year-olds and adults understood all maxims. Preschoolers acquired the maxim of relation first and had the greatest difficulty understanding the second maxim of quantity. Children and adults differed in their comprehension of the maxim of politeness. The development of the pragmatic understanding of Gricean maxims and implications for the construction of developmental tasks from early childhood to adulthood are discussed.

Power consumption optimization strategy for wireless networks

DEFF Research Database (Denmark)

Cornean, Horia; Kumar, Sanjay; Marchetti, Nicola

2011-01-01

in order to reduce the total power consumption in a multi cellular network. We present an algorithm for power optimization under no interference and in presence of interference conditions, targeting to maximize the network capacity. The convergence of the algorithm is guaranteed if the interference...

High-Voltage DC-DC Converter Topology for PV Energy Utilization - Investigation and Implementation

DEFF Research Database (Denmark)

Sanjeevikumar, Padmanaban; Blaabjerg, Frede; Wheeler, Patrick

2017-01-01

This paper exploited the utilization of photovoltaic (PV) energy system with high-voltage (HV) output DC-DC converter. Classical boost converters are used for both renewable energy integration and HV applications, but limited by reducing output/efficiency in performance. Moreover, as parasitic...... elements suppress the power transfer ratio, converter needs to maximize the PV energy utilization. This investigation study focused to include additional parasitic elements (voltage-lift technique) to a standard DC-DC buck converter and to overcome all the above drawbacks to maximize the PV power...

Maximizing the Lifetime of Wireless Sensor Networks Using Multiple Sets of Rendezvous

Directory of Open Access Journals (Sweden)

Bo Li

2015-01-01

Full Text Available In wireless sensor networks (WSNs, there is a “crowded center effect” where the energy of nodes located near a data sink drains much faster than other nodes resulting in a short network lifetime. To mitigate the “crowded center effect,” rendezvous points (RPs are used to gather data from other nodes. In order to prolong the lifetime of WSN further, we propose using multiple sets of RPs in turn to average the energy consumption of the RPs. The problem is how to select the multiple sets of RPs and how long to use each set of RPs. An optimal algorithm and a heuristic algorithm are proposed to address this problem. The optimal algorithm is highly complex and only suitable for small scale WSN. The performance of the proposed algorithms is evaluated through simulations. The simulation results indicate that the heuristic algorithm approaches the optimal one and that using multiple RP sets can significantly prolong network lifetime.

The Naïve Utility Calculus: Computational Principles Underlying Commonsense Psychology.

Science.gov (United States)

Jara-Ettinger, Julian; Gweon, Hyowon; Schulz, Laura E; Tenenbaum, Joshua B

2016-08-01

We propose that human social cognition is structured around a basic understanding of ourselves and others as intuitive utility maximizers: from a young age, humans implicitly assume that agents choose goals and actions to maximize the rewards they expect to obtain relative to the costs they expect to incur. This 'naïve utility calculus' allows both children and adults observe the behavior of others and infer their beliefs and desires, their longer-term knowledge and preferences, and even their character: who is knowledgeable or competent, who is praiseworthy or blameworthy, who is friendly, indifferent, or an enemy. We review studies providing support for the naïve utility calculus, and we show how it captures much of the rich social reasoning humans engage in from infancy. Copyright © 2016 Elsevier Ltd. All rights reserved.

Distributed Hybrid Scheduling in Multi-Cloud Networks using Conflict Graphs

KAUST Repository

Douik, Ahmed

2017-09-07

Recent studies on cloud-radio access networks assume either signal-level or scheduling-level coordination. This paper considers a hybrid coordinated scheme as a means to benefit from both policies. Consider the downlink of a multi-cloud radio access network, where each cloud is connected to several base-stations (BSs) via high capacity links, and, therefore, allows for joint signal processing within the cloud transmission. Across the multiple clouds, however, only scheduling-level coordination is permitted, as low levels of backhaul communication are feasible. The frame structure of every BS is composed of various time/frequency blocks, called power-zones (PZs), which are maintained at a fixed power level. The paper addresses the problem of maximizing a network-wide utility by associating users to clouds and scheduling them to the PZs, under the practical constraints that each user is scheduled to a single cloud at most, but possibly to many BSs within the cloud, and can be served by one or more distinct PZs within the BSs’ frame. The paper solves the problem using graph theory techniques by constructing the conflict graph. The considered scheduling problem is, then, shown to be equivalent to a maximum-weight independent set problem in the constructed graph, which can be solved using efficient techniques. The paper then proposes solving the problem using both optimal and heuristic algorithms that can be implemented in a distributed fashion across the network. The proposed distributed algorithms rely on the well-chosen structure of the constructed conflict graph utilized to solve the maximum-weight independent set problem. Simulation results suggest that the proposed optimal and heuristic hybrid scheduling strategies provide appreciable gain as compared to the scheduling-level coordinated networks, with a negligible degradation to signal-level coordination.

Alternate MIMO AF relaying networks with interference alignment: Spectral efficient protocol and linear filter design

KAUST Repository

Park, Kihong

2013-02-01

In this paper, we study a two-hop relaying network consisting of one source, one destination, and three amplify-and-forward (AF) relays with multiple antennas. To compensate for the capacity prelog factor loss of 1/2$ due to the half-duplex relaying, alternate transmission is performed among three relays, and the inter-relay interference due to the alternate relaying is aligned to make additional degrees of freedom. In addition, suboptimal linear filter designs at the nodes are proposed to maximize the achievable sum rate for different fading scenarios when the destination utilizes a minimum mean-square error filter. © 1967-2012 IEEE.

Service Demand Discovery Mechanism for Mobile Social Networks.

Science.gov (United States)

Wu, Dapeng; Yan, Junjie; Wang, Honggang; Wang, Ruyan

2016-11-23

In the last few years, the service demand for wireless data over mobile networks has continually been soaring at a rapid pace. Thereinto, in Mobile Social Networks (MSNs), users can discover adjacent users for establishing temporary local connection and thus sharing already downloaded contents with each other to offload the service demand. Due to the partitioned topology, intermittent connection and social feature in such a network, the service demand discovery is challenging. In particular, the service demand discovery is exploited to identify the best relay user through the service registration, service selection and service activation. In order to maximize the utilization of limited network resources, a hybrid service demand discovery architecture, such as a Virtual Dictionary User (VDU) is proposed in this paper. Based on the historical data of movement, users can discover their relationships with others. Subsequently, according to the users activity, VDU is selected to facilitate the service registration procedure. Further, the service information outside of a home community can be obtained through the Global Active User (GAU) to support the service selection. To provide the Quality of Service (QoS), the Service Providing User (SPU) is chosen among multiple candidates. Numerical results show that, when compared with other classical service algorithms, the proposed scheme can improve the successful service demand discovery ratio by 25% under reduced overheads.

Coordinated scheduling for the downlink of cloud radio-access networks

KAUST Repository

Douik, Ahmed S.

2015-09-11

This paper addresses the coordinated scheduling problem in cloud-enabled networks. Consider the downlink of a cloud-radio access network (CRAN), where the cloud is only responsible for the scheduling policy and the synchronization of the transmit frames across the connected base-stations (BS). The transmitted frame of every BS consists of several time/frequency blocks, called power-zones (PZ), maintained at fixed transmit power. The paper considers the problem of scheduling users to PZs and BSs in a coordinated fashion across the network, by maximizing a network-wide utility under the practical constraint that each user cannot be served by more than one base-station, but can be served by one or more power-zones within each base-station frame. The paper solves the problem using a graph theoretical approach by introducing the scheduling graph in which each vertex represents an association of users, PZs and BSs. The problem is formulated as a maximum weight clique, in which the weight of each vertex is the benefit of the association represented by that vertex. The paper further presents heuristic algorithms with low computational complexity. Simulation results show the performance of the proposed algorithms and suggest that the heuristics perform near optimal in low shadowing environments. © 2015 IEEE.

Vibration monitoring of EDF rotating machinery using artificial neural networks

International Nuclear Information System (INIS)

Alguindigue, I.E.; Loskiewicz-Buczak, A.; Uhrig, R.E.; Hamon, L.; Lefevre, F.

1991-01-01

Vibration monitoring of components in nuclear power plants has been used for a number of years. This technique involves the analysis of vibration data coming from vital components of the plant to detect features which reflect the operational state of machinery. The analysis leads to the identification of potential failures and their causes, and makes it possible to perform efficient preventive maintenance. Earlydetection is important because it can decrease the probability of catastrophic failures, reduce forced outgage, maximize utilization of available assets, increase the life of the plant, and reduce maintenance costs. This paper documents our work on the design of a vibration monitoring methodology based on neural network technology. This technology provides an attractive complement to traditional vibration analysis because of the potential of neural networks to operate in real-time mode and to handle data which may be distorted or noisy. Our efforts have been concentrated on the analysis and classification of vibration signatures collected by Electricite de France (EDF). Two neural networks algorithms were used in our project: the Recirculation algorithm and the Backpropagation algorithm. Although this project is in the early stages of development it indicates that neural networks may provide a viable methodology for monitoring and diagnostics of vibrating components. Our results are very encouraging

Poster abstract: A decentralized routing scheme based on a zero-sum game to optimize energy in solar powered sensor networks

KAUST Repository

Dehwah, Ahmad H.; Tembine, Hamidou; Claudel, Christian G.

2014-01-01

This poster is aimed at solving the problem of maximizing the energy margin of a solar-powered sensor network at a fixed time horizon, to maximize the network performance during an event to monitor. Using a game theoretic approach, the optimal routing maximizing the energy margin of the network at a given time under solar power forcing can be computed in a decentralized way and solved exactly through dynamic programming with a low overall complexity. We also show that this decentralized algorithm is simple enough to be implemented on practical sensor nodes. Such an algorithm would be very useful whenever the energy margin of a solar-powered sensor network has to be maximized at a specific time. © 2014 IEEE.

Poster abstract: A decentralized routing scheme based on a zero-sum game to optimize energy in solar powered sensor networks

KAUST Repository

Dehwah, Ahmad H.

2014-04-01

This poster is aimed at solving the problem of maximizing the energy margin of a solar-powered sensor network at a fixed time horizon, to maximize the network performance during an event to monitor. Using a game theoretic approach, the optimal routing maximizing the energy margin of the network at a given time under solar power forcing can be computed in a decentralized way and solved exactly through dynamic programming with a low overall complexity. We also show that this decentralized algorithm is simple enough to be implemented on practical sensor nodes. Such an algorithm would be very useful whenever the energy margin of a solar-powered sensor network has to be maximized at a specific time. © 2014 IEEE.

Adaptive autonomous Communications Routing Optimizer for Network Efficiency Management, Phase I

Data.gov (United States)

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...

Prediction of Global Solar Radiation in India Using Artificial Neural Network

Directory of Open Access Journals (Sweden)

Rajiv Gupta

2016-06-01

Full Text Available Increasing global warming and decreasing fossil fuel reserves has necessitated the use of renewable energy resources like solar energy in India. To maximize return on a solar farm, it had to be set up at a place with high solar radiation. The solar radiation values are available only for a small number of places and must be interpolated for the rest. This paper utilizes Artificial Neural Network in interpolation, by obtaining a function with input as combinations of 7 geographical and meteorological parameters affecting radiation, and output as global solar radiation. Data considered was of past 9 years for 13 Indian cities. Low error values and high coefficient of determination values thus obtained, verified that the results were accurate in terms of the original solar radiation data known. Thus, artificial neural network can be used to interpolate the solar radiation for the places of interest depending on the availability of the data.

Sum rate maximization in the uplink of multi-cell OFDMA networks

KAUST Repository

Tabassum, Hina; Alouini, Mohamed-Slim; Dawy, Zaher

2012-01-01

of each cell, while ignoring the significant effect of inter-cell interference. This paper investigates the problem of resource allocation (i.e., subcarriers and powers) in the uplink of a multi-cell OFDMA network. The problem has a non

Firms’ corporate social responsibility behavior: An integration of institutional and profit maximization approaches

OpenAIRE

Susan L Young; Mona V Makhija

2014-01-01

Understanding firms’ behavior across countries – a key concern in the international business literature – requires the joint consideration of both institutional influences and firms’ profit maximization goals. In the corporate social responsibility (CSR) area, however, researchers have utilized theories that take into account only one or the other – institutional theory, which explains CSR as legitimacy-seeking activities in line with national-level institutions, or economic-based approaches ...

Robust Learning of High-dimensional Biological Networks with Bayesian Networks

Science.gov (United States)

Nägele, Andreas; Dejori, Mathäus; Stetter, Martin

Structure learning of Bayesian networks applied to gene expression data has become a potentially useful method to estimate interactions between genes. However, the NP-hardness of Bayesian network structure learning renders the reconstruction of the full genetic network with thousands of genes unfeasible. Consequently, the maximal network size is usually restricted dramatically to a small set of genes (corresponding with variables in the Bayesian network). Although this feature reduction step makes structure learning computationally tractable, on the downside, the learned structure might be adversely affected due to the introduction of missing genes. Additionally, gene expression data are usually very sparse with respect to the number of samples, i.e., the number of genes is much greater than the number of different observations. Given these problems, learning robust network features from microarray data is a challenging task. This chapter presents several approaches tackling the robustness issue in order to obtain a more reliable estimation of learned network features.

On maximal massive 3D supergravity

OpenAIRE

Bergshoeff , Eric A; Hohm , Olaf; Rosseel , Jan; Townsend , Paul K

2010-01-01

ABSTRACT We construct, at the linearized level, the three-dimensional (3D) N = 4 supersymmetric " general massive supergravity " and the maximally supersymmetric N = 8 " new massive supergravity ". We also construct the maximally supersymmetric linearized N = 7 topologically massive supergravity, although we expect N = 6 to be maximal at the non-linear level. (Bergshoeff, Eric A) (Hohm, Olaf) (Rosseel, Jan) P.K.Townsend@da...

Dynamic Pricing in Electronic Commerce Using Neural Network

Science.gov (United States)

Ghose, Tapu Kumar; Tran, Thomas T.

In this paper, we propose an approach where feed-forward neural network is used for dynamically calculating a competitive price of a product in order to maximize sellers’ revenue. In the approach we considered that along with product price other attributes such as product quality, delivery time, after sales service and seller’s reputation contribute in consumers purchase decision. We showed that once the sellers, by using their limited prior knowledge, set an initial price of a product our model adjusts the price automatically with the help of neural network so that sellers’ revenue is maximized.

Case Study: Organizational Realignment at Tripler Army Medical Center to Reflect "Best Business Practice." Facilitate Coordinated Care, and Maximize the Use of Resources

National Research Council Canada - National Science Library

Gawlik, John

2000-01-01

...) was established to evaluate Tripler's Utilization Management, Resource Management, Managed Care, Patient Administration, Information Management, and Clinical Support divisions to maximize billing...

An Adaptive Learning Based Network Selection Approach for 5G Dynamic Environments

Directory of Open Access Journals (Sweden)

Xiaohong Li

2018-03-01

Full Text Available Networks will continue to become increasingly heterogeneous as we move toward 5G. Meanwhile, the intelligent programming of the core network makes the available radio resource be more changeable rather than static. In such a dynamic and heterogeneous network environment, how to help terminal users select optimal networks to access is challenging. Prior implementations of network selection are usually applicable for the environment with static radio resources, while they cannot handle the unpredictable dynamics in 5G network environments. To this end, this paper considers both the fluctuation of radio resources and the variation of user demand. We model the access network selection scenario as a multiagent coordination problem, in which a bunch of rationally terminal users compete to maximize their benefits with incomplete information about the environment (no prior knowledge of network resource and other users’ choices. Then, an adaptive learning based strategy is proposed, which enables users to adaptively adjust their selections in response to the gradually or abruptly changing environment. The system is experimentally shown to converge to Nash equilibrium, which also turns out to be both Pareto optimal and socially optimal. Extensive simulation results show that our approach achieves significantly better performance compared with two learning and non-learning based approaches in terms of load balancing, user payoff and the overall bandwidth utilization efficiency. In addition, the system has a good robustness performance under the condition with non-compliant terminal users.

computer networks

Directory of Open Access Journals (Sweden)

N. U. Ahmed

2002-01-01

Full Text Available In this paper, we construct a new dynamic model for the Token Bucket (TB algorithm used in computer networks and use systems approach for its analysis. This model is then augmented by adding a dynamic model for a multiplexor at an access node where the TB exercises a policing function. In the model, traffic policing, multiplexing and network utilization are formally defined. Based on the model, we study such issues as (quality of service QoS, traffic sizing and network dimensioning. Also we propose an algorithm using feedback control to improve QoS and network utilization. Applying MPEG video traces as the input traffic to the model, we verify the usefulness and effectiveness of our model.

Triangular Alignment (TAME). A Tensor-based Approach for Higher-order Network Alignment

Energy Technology Data Exchange (ETDEWEB)

Mohammadi, Shahin [Purdue Univ., West Lafayette, IN (United States); Gleich, David F. [Purdue Univ., West Lafayette, IN (United States); Kolda, Tamara G. [Sandia National Laboratories (SNL-CA), Livermore, CA (United States); Grama, Ananth [Purdue Univ., West Lafayette, IN (United States)

2015-11-01

Network alignment is an important tool with extensive applications in comparative interactomics. Traditional approaches aim to simultaneously maximize the number of conserved edges and the underlying similarity of aligned entities. We propose a novel formulation of the network alignment problem that extends topological similarity to higher-order structures and provide a new objective function that maximizes the number of aligned substructures. This objective function corresponds to an integer programming problem, which is NP-hard. Consequently, we approximate this objective function as a surrogate function whose maximization results in a tensor eigenvalue problem. Based on this formulation, we present an algorithm called Triangular AlignMEnt (TAME), which attempts to maximize the number of aligned triangles across networks. We focus on alignment of triangles because of their enrichment in complex networks; however, our formulation and resulting algorithms can be applied to general motifs. Using a case study on the NAPABench dataset, we show that TAME is capable of producing alignments with up to 99% accuracy in terms of aligned nodes. We further evaluate our method by aligning yeast and human interactomes. Our results indicate that TAME outperforms the state-of-art alignment methods both in terms of biological and topological quality of the alignments.

Opportunistic Beacon Networks: Information Dissemination via Wireless Network Identifiers

NARCIS (Netherlands)

Türkes, Okan; Scholten, Johan; Havinga, Paul J.M.

2016-01-01

This paper presents OBN, a universal opportunistic ad hoc networking model particularly intended for smart mobile devices. It enables fast and lightweight data dissemination in wireless community networks through the utilization of universally-available wireless network identifiers. As a ubiquitous

Maximal Entanglement in High Energy Physics

Directory of Open Access Journals (Sweden)

Alba Cervera-Lierta, José I. Latorre, Juan Rojo, Luca Rottoli

2017-11-01

Full Text Available We analyze how maximal entanglement is generated at the fundamental level in QED by studying correlations between helicity states in tree-level scattering processes at high energy. We demonstrate that two mechanisms for the generation of maximal entanglement are at work: i $s$-channel processes where the virtual photon carries equal overlaps of the helicities of the final state particles, and ii the indistinguishable superposition between $t$- and $u$-channels. We then study whether requiring maximal entanglement constrains the coupling structure of QED and the weak interactions. In the case of photon-electron interactions unconstrained by gauge symmetry, we show how this requirement allows reproducing QED. For $Z$-mediated weak scattering, the maximal entanglement principle leads to non-trivial predictions for the value of the weak mixing angle $\\theta_W$. Our results are a first step towards understanding the connections between maximal entanglement and the fundamental symmetries of high-energy physics.

Design and manufacturing rules for maximizing the performance of polycrystalline piezoelectric bending actuators

International Nuclear Information System (INIS)

Jafferis, Noah T; Smith, Michael J; Wood, Robert J

2015-01-01

Increasing the energy and power density of piezoelectric actuators is very important for any weight-sensitive application, and is especially crucial for enabling autonomy in micro/milli-scale robots and devices utilizing this technology. This is achieved by maximizing the mechanical flexural strength and electrical dielectric strength through the use of laser-induced melting or polishing, insulating edge coating, and crack-arresting features, combined with features for rigid ground attachments to maximize force output. Manufacturing techniques have also been developed to enable mass customization, in which sheets of material are pre-stacked to form a laminate from which nearly arbitrary planar actuator designs can be fabricated using only laser cutting. These techniques have led to a 70% increase in energy density and an increase in mean lifetime of at least 15× compared to prior manufacturing methods. In addition, measurements have revealed a doubling of the piezoelectric coefficient when operating at the high fields necessary to achieve maximal energy densities, along with an increase in the Young’s modulus at the high compressive strains encountered—these two effects help to explain the higher performance of our actuators as compared to that predicted by linear models. (paper)

Maximal Inequalities for Dependent Random Variables

DEFF Research Database (Denmark)

Hoffmann-Jorgensen, Jorgen

2016-01-01

Maximal inequalities play a crucial role in many probabilistic limit theorem; for instance, the law of large numbers, the law of the iterated logarithm, the martingale limit theorem and the central limit theorem. Let X-1, X-2,... be random variables with partial sums S-k = X-1 + ... + X-k. Then a......Maximal inequalities play a crucial role in many probabilistic limit theorem; for instance, the law of large numbers, the law of the iterated logarithm, the martingale limit theorem and the central limit theorem. Let X-1, X-2,... be random variables with partial sums S-k = X-1 + ... + X......-k. Then a maximal inequality gives conditions ensuring that the maximal partial sum M-n = max(1) (...

Planning for Micro-grid with Static Voltage Stability and Maximizing Renewable Energy Utilization

Science.gov (United States)

Zhou, Youfu; Zhang, Yuhong; Lv, Xuehai; Zhang, Wentai; Wei, Jun; Zhang, Changhua; Chen, Xin

2017-05-01

The access position and capacity of distribution generation (DG) affect the static voltage stability of micro-grid, thus affecting the renewable energy utilization. In the current reform of the energy supply side, a multi-objective optimization model is established, aiming at the abandoning wind and abandoning light problem. This model has three advantages, which are the largest renewable energy utilization, static voltage stability of micro-grid and the minimum cost of DG investment considering environmental benefits. It can effectively promote the use of wind power, photovoltaic power generation and other renewable energy sources. In this paper, the multi-objective optimization problem is transformed into a single objective programming problem by using the deviation method; the optimal solution of multi-objective function is solved by using particle swarm optimization algorithm, so as to establish the planning scheme of micro-grid. Simulation results prove the correctness and feasibility of the optimization method.

Quantized hopfield networks for reliability optimization

International Nuclear Information System (INIS)

Nourelfath, Mustapha; Nahas, Nabil

2003-01-01

The use of neural networks in the reliability optimization field is rare. This paper presents an application of a recent kind of neural networks in a reliability optimization problem for a series system with multiple-choice constraints incorporated at each subsystem, to maximize the system reliability subject to the system budget. The problem is formulated as a nonlinear binary integer programming problem and characterized as an NP-hard problem. Our design of neural network to solve efficiently this problem is based on a quantized Hopfield network. This network allows us to obtain optimal design solutions very frequently and much more quickly than others Hopfield networks

Discrete rate and variable power adaptation for underlay cognitive networks

KAUST Repository

Abdallah, Mohamed M.; Salem, Ahmed H.; Alouini, Mohamed-Slim; Qaraqe, Khalid A.

2010-01-01

We consider the problem of maximizing the average spectral efficiency of a secondary link in underlay cognitive networks. In particular, we consider the network setting whereby the secondary transmitter employs discrete rate and variable power

Social network analysis community detection and evolution

CERN Document Server

Missaoui, Rokia

2015-01-01

This book is devoted to recent progress in social network analysis with a high focus on community detection and evolution. The eleven chapters cover the identification of cohesive groups, core components and key players either in static or dynamic networks of different kinds and levels of heterogeneity. Other important topics in social network analysis such as influential detection and maximization, information propagation, user behavior analysis, as well as network modeling and visualization are also presented. Many studies are validated through real social networks such as Twitter. This edit

A Qualitative Linear Utility Theory for Spohn's Theory of Epistemic Beliefs

OpenAIRE

Giang, Phan H.; Shenoy, Prakash P.

2013-01-01

In this paper, we formulate a qualitative "linear" utility theory for lotteries in which uncertainty is expressed qualitatively using a Spohnian disbelief function. We argue that a rational decision maker facing an uncertain decision problem in which the uncertainty is expressed qualitatively should behave so as to maximize "qualitative expected utility." Our axiomatization of the qualitative utility is similar to the axiomatization developed by von Neumann and Morgenstern for probabilistic l...

Short term memory in echo state networks

OpenAIRE

Jaeger, H.

2001-01-01

The report investigates the short-term memory capacity of echo state recurrent neural networks. A quantitative measure MC of short-term memory capacity is introduced. The main result is that MC 5 N for networks with linear Output units and i.i.d. input, where N is network size. Conditions under which these maximal memory capacities are realized are described. Several theoretical and practical examples demonstrate how the short-term memory capacities of echo state networks can be exploited for...

Coherence resonance in globally coupled neuronal networks with different neuron numbers

International Nuclear Information System (INIS)

Ning Wei-Lian; Zhang Zheng-Zhen; Zeng Shang-You; Luo Xiao-Shu; Hu Jin-Lin; Zeng Shao-Wen; Qiu Yi; Wu Hui-Si

2012-01-01

Because a brain consists of tremendous neuronal networks with different neuron numbers ranging from tens to tens of thousands, we study the coherence resonance due to ion channel noises in globally coupled neuronal networks with different neuron numbers. We confirm that for all neuronal networks with different neuron numbers there exist the array enhanced coherence resonance and the optimal synaptic conductance to cause the maximal spiking coherence. Furthermoremore, the enhancement effects of coupling on spiking coherence and on optimal synaptic conductance are almost the same, regardless of the neuron numbers in the neuronal networks. Therefore for all the neuronal networks with different neuron numbers in the brain, relative weak synaptic conductance (0.1 mS/cm 2 ) is sufficient to induce the maximal spiking coherence and the best sub-threshold signal encoding. (interdisciplinary physics and related areas of science and technology)

Location-aware network operation for cloud radio access network

KAUST Repository

Wang, Fanggang

2017-06-20

One of the major challenges in effectively operating a cloud radio access network (C-RAN) is the excessive overhead signaling and computation load that scale rapidly with the size of the network. In this paper, the exploitation of location information of the mobile devices is proposed to address this challenge. We consider an approach in which location-assisted channel state information (CSI) acquisition methods are introduced to complement conventional pilot-based CSI acquisition methods and avoid excessive overhead signaling. A low-complexity algorithm is designed to maximize the sum rate. An adaptive algorithm is also proposed to address the uncertainty issue in CSI acquisition. Both theoretical and numerical analyses show that location information provides a new dimension to improve throughput for next-generation massive cooperative networks.

Extinction times of epidemic outbreaks in networks.

Science.gov (United States)

Holme, Petter

2013-01-01

In the Susceptible-Infectious-Recovered (SIR) model of disease spreading, the time to extinction of the epidemics happens at an intermediate value of the per-contact transmission probability. Too contagious infections burn out fast in the population. Infections that are not contagious enough die out before they spread to a large fraction of people. We characterize how the maximal extinction time in SIR simulations on networks depend on the network structure. For example we find that the average distances in isolated components, weighted by the component size, is a good predictor of the maximal time to extinction. Furthermore, the transmission probability giving the longest outbreaks is larger than, but otherwise seemingly independent of, the epidemic threshold.

Extinction times of epidemic outbreaks in networks.

Directory of Open Access Journals (Sweden)

Petter Holme

Full Text Available In the Susceptible-Infectious-Recovered (SIR model of disease spreading, the time to extinction of the epidemics happens at an intermediate value of the per-contact transmission probability. Too contagious infections burn out fast in the population. Infections that are not contagious enough die out before they spread to a large fraction of people. We characterize how the maximal extinction time in SIR simulations on networks depend on the network structure. For example we find that the average distances in isolated components, weighted by the component size, is a good predictor of the maximal time to extinction. Furthermore, the transmission probability giving the longest outbreaks is larger than, but otherwise seemingly independent of, the epidemic threshold.

Spectrum-efficient multi-channel design for coexisting IEEE 802.15.4 networks: A stochastic geometry approach

KAUST Repository

Elsawy, Hesham

2014-07-01

For networks with random topologies (e.g., wireless ad-hoc and sensor networks) and dynamically varying channel gains, choosing the long term operating parameters that optimize the network performance metrics is very challenging. In this paper, we use stochastic geometry analysis to develop a novel framework to design spectrum-efficient multi-channel random wireless networks based on the IEEE 802.15.4 standard. The proposed framework maximizes both spatial and time domain frequency utilization under channel gain uncertainties to minimize the number of frequency channels required to accommodate a certain population of coexisting IEEE 802.15.4 networks. The performance metrics are the outage probability and the self admission failure probability. We relax the single channel assumption that has been used traditionally in the stochastic geometry analysis. We show that the intensity of the admitted networks does not increase linearly with the number of channels and the rate of increase of the intensity of the admitted networks decreases with the number of channels. By using graph theory, we obtain the minimum required number of channels to accommodate a certain intensity of coexisting networks under a self admission failure probability constraint. To this end, we design a superframe structure for the coexisting IEEE 802.15.4 networks and a method for time-domain interference alignment. © 2002-2012 IEEE.

Does mental exertion alter maximal muscle activation?

Directory of Open Access Journals (Sweden)

Vianney eRozand

2014-09-01

Full Text Available Mental exertion is known to impair endurance performance, but its effects on neuromuscular function remain unclear. The purpose of this study was to test the hypothesis that mental exertion reduces torque and muscle activation during intermittent maximal voluntary contractions of the knee extensors. Ten subjects performed in a randomized order three separate mental exertion conditions lasting 27 minutes each: i high mental exertion (incongruent Stroop task, ii moderate mental exertion (congruent Stroop task, iii low mental exertion (watching a movie. In each condition, mental exertion was combined with ten intermittent maximal voluntary contractions of the knee extensor muscles (one maximal voluntary contraction every 3 minutes. Neuromuscular function was assessed using electrical nerve stimulation. Maximal voluntary torque, maximal muscle activation and other neuromuscular parameters were similar across mental exertion conditions and did not change over time. These findings suggest that mental exertion does not affect neuromuscular function during intermittent maximal voluntary contractions of the knee extensors.

Can multilayer brain networks be a real step forward?. Comment on "Network science of biological systems at different scales: A review" by M. Gosak et al.

Science.gov (United States)

Buldú, Javier M.; Papo, David

2018-03-01

Over the last two decades Network Science has become one of the most active fields in science, whose growth has been supported by four fundamental pillars: statistical physics, nonlinear dynamics, graph theory and Big Data [1]. Initially concerned with analyzing the structure of networks, Network Science rapidly turned its attention, focused on the implications of network topology, on the dynamics of and processes unfolding on networked systems, greatly improving our understanding of diffusion, synchronization, epidemics and information transmission in complex systems [2]. The network approach typically considered complex systems as evolving in a vacuum; however real networks are generally not isolated systems, but are in continuous and evolving contact with other networks, with which they interact in multiple qualitative different and typically time-varying ways. These systems can then be represented as a collection of subsystems with connectivity layers, which are simply collapsed when considering the traditional monolayer representation. Surprisingly, such an "unpacking" of layers has proven to bear profound consequences on the structural and dynamical properties of networks, leading for instance to counter-intuitive synchronization phenomena, where maximization synchronization is achieved through strategies opposite of those maximizing synchronization in isolated networks [3].

The Analysis of SARDANA HPON Networks Using the HPON Network Configurator

Directory of Open Access Journals (Sweden)

Rastislav Roka

2013-01-01

Full Text Available NG-PON systems present optical access infrastructures to support various applications of the many service providers. In the near future, we can expect NG-PON technologies with different motivations for developing of HPON networks. The HPON is a hybrid passive optical network in a way that utilizes on a physical layer both TDM and WDM multiplexing principles together. The HPON network utilizes similar or soft revised topologies as TDM-PON architectures. In this second paper, requirements for the SARDANA HPON networks are introduced. A main part of the paper is dedicated to presentation of the HPON network configurator that allows configurating and analyzing the SARDANA HPON characteristics from a viewpoint of various specific network parameters. Finally, a short introduction to the comparison of the SARDANA and SUCCESS HPON networks based on simulation results is presented.

The Analysis of SUCCESS HPON Networks Using the HPON Network Configurator

Directory of Open Access Journals (Sweden)

Rastislav Roka

2013-01-01

Full Text Available NG-PON systems present optical access infrastructures to support various applications of the many service providers. In the near future, we can expect NG-PON technologies with different motivations for developing of HPON networks. The HPON is a hybrid passive optical network in a way that utilizes on a physical layer both TDM and WDM multiplexing principles together. The HPON network utilizes similar or soft revised topologies as TDM-PON architectures. In this first paper, design requirements for SUCCESS HPON networks are introduced. A main part of the paper is dedicated to presentation of the HPON network configurator that allows configurating and analyzing the SUCCESS HPON characteristics from a viewpoint of various specific network parameters. Finally, a short introduction to the comparison of the SUCCESS and SARDANA HPON networks based on simulation results is presented.

Information processing in echo state networks at the edge of chaos.

Science.gov (United States)

Boedecker, Joschka; Obst, Oliver; Lizier, Joseph T; Mayer, N Michael; Asada, Minoru

2012-09-01

We investigate information processing in randomly connected recurrent neural networks. It has been shown previously that the computational capabilities of these networks are maximized when the recurrent layer is close to the border between a stable and an unstable dynamics regime, the so called edge of chaos. The reasons, however, for this maximized performance are not completely understood. We adopt an information-theoretical framework and are for the first time able to quantify the computational capabilities between elements of these networks directly as they undergo the phase transition to chaos. Specifically, we present evidence that both information transfer and storage in the recurrent layer are maximized close to this phase transition, providing an explanation for why guiding the recurrent layer toward the edge of chaos is computationally useful. As a consequence, our study suggests self-organized ways of improving performance in recurrent neural networks, driven by input data. Moreover, the networks we study share important features with biological systems such as feedback connections and online computation on input streams. A key example is the cerebral cortex, which was shown to also operate close to the edge of chaos. Consequently, the behavior of model systems as studied here is likely to shed light on reasons why biological systems are tuned into this specific regime.

DEVELOPMENT OF A VALIDATED MODEL FOR USE IN MINIMIZING NOx EMISSIONS AND MAXIMIZING CARBON UTILIZATION WHEN CO-FIRING BIOMASS WITH COAL

Energy Technology Data Exchange (ETDEWEB)

Larry G. Felix; P. Vann Bush; Stephen Niksa

2003-04-30

In full-scale boilers, the effect of biomass cofiring on NO{sub x} and unburned carbon (UBC) emissions has been found to be site-specific. Few sets of field data are comparable and no consistent database of information exists upon which cofiring fuel choice or injection system design can be based to assure that NOX emissions will be minimized and UBC be reduced. This report presents the results of a comprehensive project that generated an extensive set of pilot-scale test data that were used to validate a new predictive model for the cofiring of biomass and coal. All testing was performed at the 3.6 MMBtu/hr (1.75 MW{sub t}) Southern Company Services/Southern Research Institute Combustion Research Facility where a variety of burner configurations, coals, biomasses, and biomass injection schemes were utilized to generate a database of consistent, scalable, experimental results (422 separate test conditions). This database was then used to validate a new model for predicting NO{sub x} and UBC emissions from the cofiring of biomass and coal. This model is based on an Advanced Post-Processing (APP) technique that generates an equivalent network of idealized reactor elements from a conventional CFD simulation. The APP reactor network is a computational environment that allows for the incorporation of all relevant chemical reaction mechanisms and provides a new tool to quantify NOx and UBC emissions for any cofired combination of coal and biomass.

Hybrid Scheduling/Signal-Level Coordination in the Downlink of Multi-Cloud Radio-Access Networks

KAUST Repository

Douik, Ahmed

2016-03-28

In the context of resource allocation in cloud- radio access networks, recent studies assume either signal-level or scheduling-level coordination. This paper, instead, considers a hybrid level of coordination for the scheduling problem in the downlink of a multi-cloud radio- access network, so as to benefit from both scheduling policies. Consider a multi-cloud radio access network, where each cloud is connected to several base-stations (BSs) via high capacity links, and therefore allows joint signal processing between them. Across the multiple clouds, however, only scheduling-level coordination is permitted, as it requires a lower level of backhaul communication. The frame structure of every BS is composed of various time/frequency blocks, called power- zones (PZs), and kept at fixed power level. The paper addresses the problem of maximizing a network-wide utility by associating users to clouds and scheduling them to the PZs, under the practical constraints that each user is scheduled, at most, to a single cloud, but possibly to many BSs within the cloud, and can be served by one or more distinct PZs within the BSs\\' frame. The paper solves the problem using graph theory techniques by constructing the conflict graph. The scheduling problem is, then, shown to be equivalent to a maximum- weight independent set problem in the constructed graph, in which each vertex symbolizes an association of cloud, user, BS and PZ, with a weight representing the utility of that association. Simulation results suggest that the proposed hybrid scheduling strategy provides appreciable gain as compared to the scheduling-level coordinated networks, with a negligible degradation to signal-level coordination.

Productive Agglomerations of Suppliers in the Automotive Industry: A Way to Maximize Competitiveness in Supply Chain Management.

Directory of Open Access Journals (Sweden)

Patricia Guarnieri

2006-08-01

Full Text Available The objective of this paper is to identify how the automotive industries maximize the competitiveness in supply chain management through the constitution of entrepreneurial productive agglomerations of suppliers. For this purpose, an applied research was carried out, and the technical procedure utilized was bibliographic review based in some researches about Brazilian industrial condominiums. Thus, through the constitution of entrepreneurial agglomerations of suppliers in automotive industry it is possible to obtain logistic advantages in the transporting, stocking and warehousing activities. Besides, it is possible to maximize the supply chain management competitiveness through the establishment of trust and lasting relationships between the components of the whole chain.

On maximal surfaces in asymptotically flat space-times

International Nuclear Information System (INIS)

Bartnik, R.; Chrusciel, P.T.; O Murchadha, N.

1990-01-01

Existence of maximal and 'almost maximal' hypersurfaces in asymptotically flat space-times is established under boundary conditions weaker than those considered previously. We show in particular that every vacuum evolution of asymptotically flat data for Einstein equations can be foliated by slices maximal outside a spatially compact set and that every (strictly) stationary asymptotically flat space-time can be foliated by maximal hypersurfaces. Amongst other uniqueness results, we show that maximal hypersurface can be used to 'partially fix' an asymptotic Poincare group. (orig.)

Advanced Networks in Motion Mobile Sensorweb

Science.gov (United States)

Ivancic, William D.; Stewart, David H.

2011-01-01

Advanced mobile networking technology applicable to mobile sensor platforms was developed, deployed and demonstrated. A two-tier sensorweb design was developed. The first tier utilized mobile network technology to provide mobility. The second tier, which sits above the first tier, utilizes 6LowPAN (Internet Protocol version 6 Low Power Wireless Personal Area Networks) sensors. The entire network was IPv6 enabled. Successful mobile sensorweb system field tests took place in late August and early September of 2009. The entire network utilized IPv6 and was monitored and controlled using a remote Web browser via IPv6 technology. This paper describes the mobile networking and 6LowPAN sensorweb design, implementation, deployment and testing as well as wireless systems and network monitoring software developed to support testing and validation.

Brain networks: small-worlds, after all?

International Nuclear Information System (INIS)

Muller, Lyle; Destexhe, Alain; Rudolph-Lilith, Michelle

2014-01-01

Since its introduction, the ‘small-world’ effect has played a central role in network science, particularly in the analysis of the complex networks of the nervous system. From the cellular level to that of interconnected cortical regions, many analyses have revealed small-world properties in the networks of the brain. In this work, we revisit the quantification of small-worldness in neural graphs. We find that neural graphs fall into the ‘borderline’ regime of small-worldness, residing close to that of a random graph, especially when the degree sequence of the network is taken into account. We then apply recently introducted analytical expressions for clustering and distance measures, to study this borderline small-worldness regime. We derive theoretical bounds for the minimal and maximal small-worldness index for a given graph, and by semi-analytical means, study the small-worldness index itself. With this approach, we find that graphs with small-worldness equivalent to that observed in experimental data are dominated by their random component. These results provide the first thorough analysis suggesting that neural graphs may reside far away from the maximally small-world regime. (paper)

Brain networks: small-worlds, after all?

Energy Technology Data Exchange (ETDEWEB)

Muller, Lyle; Destexhe, Alain; Rudolph-Lilith, Michelle [Unité de Neurosciences, Information et Complexité (UNIC), Centre National de la Recherche Scientifique (CNRS), 1 Avenue de la Terrasse, Gif-sur-Yvette (France)

2014-10-01

Since its introduction, the ‘small-world’ effect has played a central role in network science, particularly in the analysis of the complex networks of the nervous system. From the cellular level to that of interconnected cortical regions, many analyses have revealed small-world properties in the networks of the brain. In this work, we revisit the quantification of small-worldness in neural graphs. We find that neural graphs fall into the ‘borderline’ regime of small-worldness, residing close to that of a random graph, especially when the degree sequence of the network is taken into account. We then apply recently introducted analytical expressions for clustering and distance measures, to study this borderline small-worldness regime. We derive theoretical bounds for the minimal and maximal small-worldness index for a given graph, and by semi-analytical means, study the small-worldness index itself. With this approach, we find that graphs with small-worldness equivalent to that observed in experimental data are dominated by their random component. These results provide the first thorough analysis suggesting that neural graphs may reside far away from the maximally small-world regime. (paper)

Insulin resistance and maximal oxygen uptake

DEFF Research Database (Denmark)

Seibaek, Marie; Vestergaard, Henrik; Burchardt, Hans

2003-01-01

BACKGROUND: Type 2 diabetes, coronary atherosclerosis, and physical fitness all correlate with insulin resistance, but the relative importance of each component is unknown. HYPOTHESIS: This study was undertaken to determine the relationship between insulin resistance, maximal oxygen uptake......, and the presence of either diabetes or ischemic heart disease. METHODS: The study population comprised 33 patients with and without diabetes and ischemic heart disease. Insulin resistance was measured by a hyperinsulinemic euglycemic clamp; maximal oxygen uptake was measured during a bicycle exercise test. RESULTS......: There was a strong correlation between maximal oxygen uptake and insulin-stimulated glucose uptake (r = 0.7, p = 0.001), and maximal oxygen uptake was the only factor of importance for determining insulin sensitivity in a model, which also included the presence of diabetes and ischemic heart disease. CONCLUSION...

Dynamic Video Streaming in Caching-enabled Wireless Mobile Networks

OpenAIRE

Liang, C.; Hu, S.

2017-01-01

Recent advances in software-defined mobile networks (SDMNs), in-network caching, and mobile edge computing (MEC) can have great effects on video services in next generation mobile networks. In this paper, we jointly consider SDMNs, in-network caching, and MEC to enhance the video service in next generation mobile networks. With the objective of maximizing the mean measurement of video quality, an optimization problem is formulated. Due to the coupling of video data rate, computing resource, a...

Economic Features of the Internet and Network Neutrality

OpenAIRE

Nicholas Economides

2015-01-01

We discuss the issue of a possible abolition of network neutrality and the introduction of paid prioritization by residential broadband access networks.We show that, in short run analysis where bandwidth is fixed, and in the absence of congestion, network neutrality tends to maximize total surplus. When an ISP violates network neutrality and invests the extra profits to bandwidth expansion, the presence of more bandwidth alleviates the allocative distortion, and can even reverse it. We also d...

An alternative respiratory sounds classification system utilizing artificial neural networks

Directory of Open Access Journals (Sweden)

Rami J Oweis

2015-04-01

Full Text Available Background: Computerized lung sound analysis involves recording lung sound via an electronic device, followed by computer analysis and classification based on specific signal characteristics as non-linearity and nonstationarity caused by air turbulence. An automatic analysis is necessary to avoid dependence on expert skills. Methods: This work revolves around exploiting autocorrelation in the feature extraction stage. All process stages were implemented in MATLAB. The classification process was performed comparatively using both artificial neural networks (ANNs and adaptive neuro-fuzzy inference systems (ANFIS toolboxes. The methods have been applied to 10 different respiratory sounds for classification. Results: The ANN was superior to the ANFIS system and returned superior performance parameters. Its accuracy, specificity, and sensitivity were 98.6%, 100%, and 97.8%, respectively. The obtained parameters showed superiority to many recent approaches. Conclusions: The promising proposed method is an efficient fast tool for the intended purpose as manifested in the performance parameters, specifically, accuracy, specificity, and sensitivity. Furthermore, it may be added that utilizing the autocorrelation function in the feature extraction in such applications results in enhanced performance and avoids undesired computation complexities compared to other techniques.

Liner shipping hub network design in a competitive environment

DEFF Research Database (Denmark)

Gelareh, Shahin; Nickel, Stefan; Pisinger, David

2010-01-01

A mixed integer programming formulation is proposed for hub-and-spoke network design in a competitive environment. It addresses the competition between a newcomer liner service provider and an existing dominating operator, both operating on hub-and-spoke networks. The newcomer company maximizes i...

POLITENESS MAXIM OF MAIN CHARACTER IN SECRET FORGIVEN

Directory of Open Access Journals (Sweden)

Sang Ayu Isnu Maharani

2017-06-01

Full Text Available Maxim of Politeness is an interesting subject to be discussed, since politeness has been criticized from our childhood. We are obliques to be polite to anyone either in speaking or in acting. Somehow we are manage to show politeness in our spoken expression though our intention might be not so polite. For example we must appriciate others opinion although we feel objection toward the opinion. In this article the analysis of politeness is based on maxim proposes by Leech. He proposed six types of politeness maxim. The discussion shows that the main character (Kristen and Kami use all types of maxim in their conversation. The most commonly used are approbation maxim and agreement maxim

Continuous Learning of a Multilayered Network Topology in a Video Camera Network

Directory of Open Access Journals (Sweden)

Zou Xiaotao

2009-01-01

Full Text Available Abstract A multilayered camera network architecture with nodes as entry/exit points, cameras, and clusters of cameras at different layers is proposed. Unlike existing methods that used discrete events or appearance information to infer the network topology at a single level, this paper integrates face recognition that provides robustness to appearance changes and better models the time-varying traffic patterns in the network. The statistical dependence between the nodes, indicating the connectivity and traffic patterns of the camera network, is represented by a weighted directed graph and transition times that may have multimodal distributions. The traffic patterns and the network topology may be changing in the dynamic environment. We propose a Monte Carlo Expectation-Maximization algorithm-based continuous learning mechanism to capture the latent dynamically changing characteristics of the network topology. In the experiments, a nine-camera network with twenty-five nodes (at the lowest level is analyzed both in simulation and in real-life experiments and compared with previous approaches.

Continuous Learning of a Multilayered Network Topology in a Video Camera Network

Directory of Open Access Journals (Sweden)

Xiaotao Zou

2009-01-01

Full Text Available A multilayered camera network architecture with nodes as entry/exit points, cameras, and clusters of cameras at different layers is proposed. Unlike existing methods that used discrete events or appearance information to infer the network topology at a single level, this paper integrates face recognition that provides robustness to appearance changes and better models the time-varying traffic patterns in the network. The statistical dependence between the nodes, indicating the connectivity and traffic patterns of the camera network, is represented by a weighted directed graph and transition times that may have multimodal distributions. The traffic patterns and the network topology may be changing in the dynamic environment. We propose a Monte Carlo Expectation-Maximization algorithm-based continuous learning mechanism to capture the latent dynamically changing characteristics of the network topology. In the experiments, a nine-camera network with twenty-five nodes (at the lowest level is analyzed both in simulation and in real-life experiments and compared with previous approaches.

Microbial network for waste activated sludge cascade utilization in an integrated system of microbial electrolysis and anaerobic fermentation

DEFF Research Database (Denmark)

Liu, Wenzong; He, Zhangwei; Yang, Chunxue

2016-01-01

in an integrated system of microbial electrolysis cell (MEC) and anaerobic digestion (AD) for waste activated sludge (WAS). Microbial communities in integrated system would build a thorough energetic and metabolic interaction network regarding fermentation communities and electrode respiring communities...... to Firmicutes (Acetoanaerobium, Acetobacterium, and Fusibacter) showed synergistic relationship with exoelectrogensin the degradation of complex organic matter or recycling of MEC products (H2). High protein and polysaccharide but low fatty acid content led to the dominance of Proteiniclasticum...... biofilm. The overall performance of WAS cascade utilization was substantially related to the microbial community structures, which in turn depended on the initial pretreatment to enhance WAS fermentation. It is worth noting that species in AD and MEC communities are able to build complex networks...

A new approach for optimum DG placement and sizing based on voltage stability maximization and minimization of power losses

International Nuclear Information System (INIS)

Aman, M.M.; Jasmon, G.B.; Bakar, A.H.A.; Mokhlis, H.

2013-01-01

Highlights: • A new algorithm is proposed for optimum DG placement and sizing.• I 2 R losses minimization and voltage stability maximization is considered in fitness function.• Bus voltage stability and line stability is considered in voltage stability maximization.• Multi-objective PSO is used to solve the problem.• Proposed method is compared with analytical and grid search algorithm. - Abstract: Distributed Generation (DG) placement on the basis of minimization of losses and maximization of system voltage stability are two different approaches, discussed in research. In the new proposed algorithm, a multi-objective approach is used to combine the both approaches together. Minimization of power losses and maximization of voltage stability due to finding weakest voltage bus as well as due to weakest link in the system are considered in the fitness function. Particle Swarm Optimization (PSO) algorithm is used in this paper to solve the multi-objective problem. This paper will also compare the propose method with existing DG placement methods. From results, the proposed method is found more advantageous than the previous work in terms of voltage profile improvement, maximization of system loadability, reduction in power system losses and maximization of bus and line voltage stability. The results are validated on 12-bus, 30-bus, 33-bus and 69-bus radial distribution networks and also discussed in detailed

Marginal Contribution-Based Distributed Subchannel Allocation in Small Cell Networks.

Science.gov (United States)

Shah, Shashi; Kittipiyakul, Somsak; Lim, Yuto; Tan, Yasuo

2018-05-10

The paper presents a game theoretic solution for distributed subchannel allocation problem in small cell networks (SCNs) analyzed under the physical interference model. The objective is to find a distributed solution that maximizes the welfare of the SCNs, defined as the total system capacity. Although the problem can be addressed through best-response (BR) dynamics, the existence of a steady-state solution, i.e., a pure strategy Nash equilibrium (NE), cannot be guaranteed. Potential games (PGs) ensure convergence to a pure strategy NE when players rationally play according to some specified learning rules. However, such a performance guarantee comes at the expense of complete knowledge of the SCNs. To overcome such requirements, properties of PGs are exploited for scalable implementations, where we utilize the concept of marginal contribution (MC) as a tool to design learning rules of players’ utility and propose the marginal contribution-based best-response (MCBR) algorithm of low computational complexity for the distributed subchannel allocation problem. Finally, we validate and evaluate the proposed scheme through simulations for various performance metrics.

Marginal Contribution-Based Distributed Subchannel Allocation in Small Cell Networks

Directory of Open Access Journals (Sweden)

Shashi Shah

2018-05-01

Full Text Available The paper presents a game theoretic solution for distributed subchannel allocation problem in small cell networks (SCNs analyzed under the physical interference model. The objective is to find a distributed solution that maximizes the welfare of the SCNs, defined as the total system capacity. Although the problem can be addressed through best-response (BR dynamics, the existence of a steady-state solution, i.e., a pure strategy Nash equilibrium (NE, cannot be guaranteed. Potential games (PGs ensure convergence to a pure strategy NE when players rationally play according to some specified learning rules. However, such a performance guarantee comes at the expense of complete knowledge of the SCNs. To overcome such requirements, properties of PGs are exploited for scalable implementations, where we utilize the concept of marginal contribution (MC as a tool to design learning rules of players’ utility and propose the marginal contribution-based best-response (MCBR algorithm of low computational complexity for the distributed subchannel allocation problem. Finally, we validate and evaluate the proposed scheme through simulations for various performance metrics.

Mobile Sinks Assisted Geographic and Opportunistic Routing Based Interference Avoidance for Underwater Wireless Sensor Network.

Science.gov (United States)

Ahmed, Farwa; Wadud, Zahid; Javaid, Nadeem; Alrajeh, Nabil; Alabed, Mohamad Souheil; Qasim, Umar

2018-04-02

The distinctive features of acoustic communication channel-like high propagation delay, multi-path fading, quick attenuation of acoustic signal, etc. limit the utilization of underwater wireless sensor networks (UWSNs). The immutable selection of forwarder node leads to dramatic death of node resulting in imbalanced energy depletion and void hole creation. To reduce the probability of void occurrence and imbalance energy dissipation, in this paper, we propose mobility assisted geo-opportunistic routing paradigm based on interference avoidance for UWSNs. The network volume is divided into logical small cubes to reduce the interference and to make more informed routing decisions for efficient energy consumption. Additionally, an optimal number of forwarder nodes is elected from each cube based on its proximity with respect to the destination to avoid void occurrence. Moreover, the data packets are recovered from void regions with the help of mobile sinks which also reduce the data traffic on intermediate nodes. Extensive simulations are performed to verify that our proposed work maximizes the network lifetime and packet delivery ratio.

Mobile Sinks Assisted Geographic and Opportunistic Routing Based Interference Avoidance for Underwater Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Farwa Ahmed

2018-04-01

Full Text Available The distinctive features of acoustic communication channel-like high propagation delay, multi-path fading, quick attenuation of acoustic signal, etc. limit the utilization of underwater wireless sensor networks (UWSNs. The immutable selection of forwarder node leads to dramatic death of node resulting in imbalanced energy depletion and void hole creation. To reduce the probability of void occurrence and imbalance energy dissipation, in this paper, we propose mobility assisted geo-opportunistic routing paradigm based on interference avoidance for UWSNs. The network volume is divided into logical small cubes to reduce the interference and to make more informed routing decisions for efficient energy consumption. Additionally, an optimal number of forwarder nodes is elected from each cube based on its proximity with respect to the destination to avoid void occurrence. Moreover, the data packets are recovered from void regions with the help of mobile sinks which also reduce the data traffic on intermediate nodes. Extensive simulations are performed to verify that our proposed work maximizes the network lifetime and packet delivery ratio.

Natural maximal νμ-ντ mixing

International Nuclear Information System (INIS)

Wetterich, C.

1999-01-01

The naturalness of maximal mixing between myon- and tau-neutrinos is investigated. A spontaneously broken nonabelian generation symmetry can explain a small parameter which governs the deviation from maximal mixing. In many cases all three neutrino masses are almost degenerate. Maximal ν μ -ν τ -mixing suggests that the leading contribution to the light neutrino masses arises from the expectation value of a heavy weak triplet rather than from the seesaw mechanism. In this scenario the deviation from maximal mixing is predicted to be less than about 1%. (Copyright (c) 1999 Elsevier Science B.V., Amsterdam. All rights reserved.)

The brain's default network: anatomy, function, and relevance to disease.

Science.gov (United States)

Buckner, Randy L; Andrews-Hanna, Jessica R; Schacter, Daniel L

2008-03-01

Thirty years of brain imaging research has converged to define the brain's default network-a novel and only recently appreciated brain system that participates in internal modes of cognition. Here we synthesize past observations to provide strong evidence that the default network is a specific, anatomically defined brain system preferentially active when individuals are not focused on the external environment. Analysis of connectional anatomy in the monkey supports the presence of an interconnected brain system. Providing insight into function, the default network is active when individuals are engaged in internally focused tasks including autobiographical memory retrieval, envisioning the future, and conceiving the perspectives of others. Probing the functional anatomy of the network in detail reveals that it is best understood as multiple interacting subsystems. The medial temporal lobe subsystem provides information from prior experiences in the form of memories and associations that are the building blocks of mental simulation. The medial prefrontal subsystem facilitates the flexible use of this information during the construction of self-relevant mental simulations. These two subsystems converge on important nodes of integration including the posterior cingulate cortex. The implications of these functional and anatomical observations are discussed in relation to possible adaptive roles of the default network for using past experiences to plan for the future, navigate social interactions, and maximize the utility of moments when we are not otherwise engaged by the external world. We conclude by discussing the relevance of the default network for understanding mental disorders including autism, schizophrenia, and Alzheimer's disease.

Gaussian maximally multipartite-entangled states

Science.gov (United States)

Facchi, Paolo; Florio, Giuseppe; Lupo, Cosmo; Mancini, Stefano; Pascazio, Saverio

2009-12-01

We study maximally multipartite-entangled states in the context of Gaussian continuous variable quantum systems. By considering multimode Gaussian states with constrained energy, we show that perfect maximally multipartite-entangled states, which exhibit the maximum amount of bipartite entanglement for all bipartitions, only exist for systems containing n=2 or 3 modes. We further numerically investigate the structure of these states and their frustration for n≤7 .

Gaussian maximally multipartite-entangled states

International Nuclear Information System (INIS)

Facchi, Paolo; Florio, Giuseppe; Pascazio, Saverio; Lupo, Cosmo; Mancini, Stefano

2009-01-01

We study maximally multipartite-entangled states in the context of Gaussian continuous variable quantum systems. By considering multimode Gaussian states with constrained energy, we show that perfect maximally multipartite-entangled states, which exhibit the maximum amount of bipartite entanglement for all bipartitions, only exist for systems containing n=2 or 3 modes. We further numerically investigate the structure of these states and their frustration for n≤7.

Capacity factors of a mixed speed railway network

DEFF Research Database (Denmark)

Harrod, Steven

2009-01-01

Fifty-four combinations of track network and speed differential are evaluated within a linear, discrete time network model that maximizes an objective function of train volume, delays, and idle train time. The results contradict accepted dispatching practice by suggesting that when introducing...... a priority, high-speed train onto a network, maximum network now is attained when the priority train operates at maximum speed. in addition, increasing siding capacity at meeting points may offer a network capacity improvement comparable to partial double track. (C) 2009 Elsevier Ltd. All rights reserved....

Energy Efficiency Maximization for WSNs with Simultaneous Wireless Information and Power Transfer.

Science.gov (United States)

Yu, Hongyan; Zhang, Yongqiang; Guo, Songtao; Yang, Yuanyuan; Ji, Luyue

2017-08-18

Recently, the simultaneous wireless information and power transfer (SWIPT) technique has been regarded as a promising approach to enhance performance of wireless sensor networks with limited energy supply. However, from a green communication perspective, energy efficiency optimization for SWIPT system design has not been investigated in Wireless Rechargeable Sensor Networks (WRSNs). In this paper, we consider the tradeoffs between energy efficiency and three factors including spectral efficiency, the transmit power and outage target rate for two different modes, i.e., power splitting (PS) and time switching modes (TS), at the receiver. Moreover, we formulate the energy efficiency maximization problem subject to the constraints of minimum Quality of Service (QoS), minimum harvested energy and maximum transmission power as non-convex optimization problem. In particular, we focus on optimizing power control and power allocation policy in PS and TS modes to maximize energy efficiency of data transmission. For PS and TS modes, we propose the corresponding algorithm to characterize a non-convex optimization problem that takes into account the circuit power consumption and the harvested energy. By exploiting nonlinear fractional programming and Lagrangian dual decomposition, we propose suboptimal iterative algorithms to obtain the solutions of non-convex optimization problems. Furthermore, we derive the outage probability and effective throughput from the scenarios that the transmitter does not or partially know the channel state information (CSI) of the receiver. Simulation results illustrate that the proposed optimal iterative algorithm can achieve optimal solutions within a small number of iterations and various tradeoffs between energy efficiency and spectral efficiency, transmit power and outage target rate, respectively.

Energy Efficiency Maximization for WSNs with Simultaneous Wireless Information and Power Transfer

Science.gov (United States)

Yu, Hongyan; Zhang, Yongqiang; Yang, Yuanyuan; Ji, Luyue

2017-01-01

Recently, the simultaneous wireless information and power transfer (SWIPT) technique has been regarded as a promising approach to enhance performance of wireless sensor networks with limited energy supply. However, from a green communication perspective, energy efficiency optimization for SWIPT system design has not been investigated in Wireless Rechargeable Sensor Networks (WRSNs). In this paper, we consider the tradeoffs between energy efficiency and three factors including spectral efficiency, the transmit power and outage target rate for two different modes, i.e., power splitting (PS) and time switching modes (TS), at the receiver. Moreover, we formulate the energy efficiency maximization problem subject to the constraints of minimum Quality of Service (QoS), minimum harvested energy and maximum transmission power as non-convex optimization problem. In particular, we focus on optimizing power control and power allocation policy in PS and TS modes to maximize energy efficiency of data transmission. For PS and TS modes, we propose the corresponding algorithm to characterize a non-convex optimization problem that takes into account the circuit power consumption and the harvested energy. By exploiting nonlinear fractional programming and Lagrangian dual decomposition, we propose suboptimal iterative algorithms to obtain the solutions of non-convex optimization problems. Furthermore, we derive the outage probability and effective throughput from the scenarios that the transmitter does not or partially know the channel state information (CSI) of the receiver. Simulation results illustrate that the proposed optimal iterative algorithm can achieve optimal solutions within a small number of iterations and various tradeoffs between energy efficiency and spectral efficiency, transmit power and outage target rate, respectively. PMID:28820496

Training Deep Convolutional Neural Networks with Resistive Cross-Point Devices.

Science.gov (United States)

Gokmen, Tayfun; Onen, Murat; Haensch, Wilfried

2017-01-01

In a previous work we have detailed the requirements for obtaining maximal deep learning performance benefit by implementing fully connected deep neural networks (DNN) in the form of arrays of resistive devices. Here we extend the concept of Resistive Processing Unit (RPU) devices to convolutional neural networks (CNNs). We show how to map the convolutional layers to fully connected RPU arrays such that the parallelism of the hardware can be fully utilized in all three cycles of the backpropagation algorithm. We find that the noise and bound limitations imposed by the analog nature of the computations performed on the arrays significantly affect the training accuracy of the CNNs. Noise and bound management techniques are presented that mitigate these problems without introducing any additional complexity in the analog circuits and that can be addressed by the digital circuits. In addition, we discuss digitally programmable update management and device variability reduction techniques that can be used selectively for some of the layers in a CNN. We show that a combination of all those techniques enables a successful application of the RPU concept for training CNNs. The techniques discussed here are more general and can be applied beyond CNN architectures and therefore enables applicability of the RPU approach to a large class of neural network architectures.

Training Deep Convolutional Neural Networks with Resistive Cross-Point Devices

Science.gov (United States)

Gokmen, Tayfun; Onen, Murat; Haensch, Wilfried

2017-01-01

In a previous work we have detailed the requirements for obtaining maximal deep learning performance benefit by implementing fully connected deep neural networks (DNN) in the form of arrays of resistive devices. Here we extend the concept of Resistive Processing Unit (RPU) devices to convolutional neural networks (CNNs). We show how to map the convolutional layers to fully connected RPU arrays such that the parallelism of the hardware can be fully utilized in all three cycles of the backpropagation algorithm. We find that the noise and bound limitations imposed by the analog nature of the computations performed on the arrays significantly affect the training accuracy of the CNNs. Noise and bound management techniques are presented that mitigate these problems without introducing any additional complexity in the analog circuits and that can be addressed by the digital circuits. In addition, we discuss digitally programmable update management and device variability reduction techniques that can be used selectively for some of the layers in a CNN. We show that a combination of all those techniques enables a successful application of the RPU concept for training CNNs. The techniques discussed here are more general and can be applied beyond CNN architectures and therefore enables applicability of the RPU approach to a large class of neural network architectures. PMID:29066942

Towards Controlling Latency in Wireless Networks

KAUST Repository

Bouacida, Nader

2017-04-24

Wireless networks are undergoing an unprecedented revolution in the last decade. With the explosion of delay-sensitive applications in the Internet (i.e., online gaming and VoIP), latency becomes a major issue for the development of wireless technology. Taking advantage of the significant decline in memory prices, industrialists equip the network devices with larger buffering capacities to improve the network throughput by limiting packets drops. Over-buffering results in increasing the time that packets spend in the queues and, thus, introducing more latency in networks. This phenomenon is known as “bufferbloat”. While throughput is the dominant performance metric, latency also has a huge impact on user experience not only for real-time applications but also for common applications like web browsing, which is sensitive to latencies in order of hundreds of milliseconds. Concerns have arisen about designing sophisticated queue management schemes to mitigate the effects of such phenomenon. My thesis research aims to solve bufferbloat problem in both traditional half-duplex and cutting-edge full-duplex wireless systems by reducing delay while maximizing wireless links utilization and fairness. Our work shed lights on buffer management algorithms behavior in wireless networks and their ability to reduce latency resulting from excessive queuing delays inside oversized static network buffers without a significant loss in other network metrics. First of all, we address the problem of buffer management in wireless full-duplex networks by using Wireless Queue Management (WQM), which is an active queue management technique for wireless networks. Our solution is based on Relay Full-Duplex MAC (RFD-MAC), an asynchronous media access control protocol designed for relay full-duplexing. Compared to the default case, our solution reduces the end-to-end delay by two orders of magnitude while achieving similar throughput in most of the cases. In the second part of this thesis

Stochastic Control of Multi-Scale Networks: Modeling, Analysis and Algorithms

Science.gov (United States)

2014-10-20

correlation, protocol behavior (e.g., retransmissions), and network congestion ; and statistically analyzed the properties of LRD traffic from empirical data...traffic correlation, protocol behavior (e.g., retransmissions), and network congestion ; and statistically analyzed the properties of LRD traffic...Maximization in Wireless Networks, IEEE Transactions on Vehicular Technology, (07 2011): 0. doi: 10.1109/TVT.2011.2157544 Sugumar Murugesan, Philip

Fewer intensive care unit refusals and a higher capacity utilization by using a cyclic surgical case schedule

NARCIS (Netherlands)

van Houdenhoven, Mark; van Oostrum, Jeroen M.; Wullink, Gerhard; Hans, Elias W.; Hurink, Johann L.; Bakker, Jan; Kazemier, Geert

Purpose: Mounting health care costs force hospital managers to maximize utilization of scarce resources and simultaneously improve access to hospital services. This article assesses the benefits of a cyclic case scheduling approach that exploits a master surgical schedule (MSS). An MSS maximizes

Information maximization explains the emergence of complex cell-like neurons

Directory of Open Access Journals (Sweden)

Takuma eTanaka

2013-11-01

Full Text Available We propose models and a method to qualitatively explain the receptive field properties of complex cells in the primary visual cortex. We apply a learning method based on the information maximization principle in a feedforward network, which comprises an input layer of image patches, simple cell-like first-output-layer neurons, and second-output-layer neurons (Model 1. The information maximization results in the emergence of the complex cell-like receptive field properties in the second-output-layer neurons. After learning, second-output-layer neurons receive connection weights having the same size from two first-output-layer neurons with sign-inverted receptive fields. The second-output-layer neurons replicate the phase invariance and iso-orientation suppression. Furthermore, on the basis of these results, we examine a simplified model showing the emergence of complex cell-like receptive fields (Model 2. We show that after learning, the output neurons of this model exhibit iso-orientation suppression, cross-orientation facilitation, and end stopping, which are similar to those found in complex cells. These properties of model neurons suggest that complex cells in the primary visual cortex become selective to features composed of edges to increase the variability of the output.

Study of QoS control and reliable routing method for utility communication network. Application of differentiated service to the network and alternative route establishment by the IP routing protocol; Denryokuyo IP network no QoS seigyo to shinraisei kakuho no hoho. DiffServ ni yoru QoS seigyo no koka to IP ni yoru fuku root ka no kento

Energy Technology Data Exchange (ETDEWEB)

Oba, E.

2000-05-01

QoS control method which satisfies utilities communication network requirement and alternative route establishment method which is for sustaining communication during a failure are studied. Applicability of DiffServ (Differentiated Service), one of the most promising QoS control method on IP network and studying energetically in IETF WG, is studied and it is found most application used in the utility communication network except for relaying system information could he accommodated to the DiffServ network. An example of the napping of the utility communication applications to the DiffServ PHB (Per Hop Behavior) is shown in this paper. Regarding to the alternative route, usual IP routing protocol cannot establish alternative route which doesn't have common links and nodes in their paths for a destination. IP address duplication with some modification of routing protocol enables such alternative route establishment. MPLS, distance vector algorithm and link state algorithm are evaluated qualitatively, and as a result, we found MPLS is promising way to establish the route. Quantitative evaluation will be future work. (author)

Activity versus outcome maximization in time management.

Science.gov (United States)

Malkoc, Selin A; Tonietto, Gabriela N

2018-04-30

Feeling time-pressed has become ubiquitous. Time management strategies have emerged to help individuals fit in more of their desired and necessary activities. We provide a review of these strategies. In doing so, we distinguish between two, often competing, motives people have in managing their time: activity maximization and outcome maximization. The emerging literature points to an important dilemma: a given strategy that maximizes the number of activities might be detrimental to outcome maximization. We discuss such factors that might hinder performance in work tasks and enjoyment in leisure tasks. Finally, we provide theoretically grounded recommendations that can help balance these two important goals in time management. Published by Elsevier Ltd.

FY1998 report on a survey related to joint utilization of welfare device development data using an international network; 1998 nendo kokusai network ni yoru fukushi kiki kaihatsu data no kyodo riyo ni kansuru chosa hokokusho

Energy Technology Data Exchange (ETDEWEB)

NONE

1999-03-01

A survey was made in relation with joint utilization of welfare device development data using an international network. Developing welfare devices requires data from ergonomic and medical systems, while the cope of the objects is wide, and the kinds are various. For proliferation of welfare devices, system compatibility evaluation including that on using environment is important, including living environments that are different by countries. The present survey has identified how data for aged, handicapped and help-needing persons are accumulated and utilized in research organizations in America and Europe for both of the ergonomic and medical areas. The survey also investigated major academic societies in overseas countries, and collected database and academic network information that support the advanced research and development. At the same time, investigations were also made on organizations and corporations who are moving forward the efficient data utilization. Welfare device and service information providing systems in Japan were investigated to compare them with the trends in other countries. Conceptions and methods were compiled to utilize data internationally and jointly. Database models for device development were considered, and a proposal was made on structuring a research and development supporting database, and the operation method thereof. (NEDO)

Hidden Connectivity in Networks with Vulnerable Classes of Nodes

Directory of Open Access Journals (Sweden)

Sebastian M. Krause

2016-10-01

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

Recovery and Resource Allocation Strategies to Maximize Mobile Network Survivability by Using Game Theories and Optimization Techniques

Directory of Open Access Journals (Sweden)

Pei-Yu Chen

2013-01-01

Full Text Available With more and more mobile device users, an increasingly important and critical issue is how to efficiently evaluate mobile network survivability. In this paper, a novel metric called Average Degree of Disconnectivity (Average DOD is proposed, in which the concept of probability is calculated by the contest success function. The DOD metric is used to evaluate the damage degree of the network, where the larger the value of the Average DOD, the more the damage degree of the network. A multiround network attack-defense scenario as a mathematical model is used to support network operators to predict all the strategies both cyber attacker and network defender would likely take. In addition, the Average DOD would be used to evaluate the damage degree of the network. In each round, the attacker could use the attack resources to launch attacks on the nodes of the target network. Meanwhile, the network defender could reallocate its existing resources to recover compromised nodes and allocate defense resources to protect the survival nodes of the network. In the approach to solving this problem, the “gradient method” and “game theory” are adopted to find the optimal resource allocation strategies for both the cyber attacker and mobile network defender.

Maximizing Entropy over Markov Processes

DEFF Research Database (Denmark)

Biondi, Fabrizio; Legay, Axel; Nielsen, Bo Friis

2013-01-01

The channel capacity of a deterministic system with confidential data is an upper bound on the amount of bits of data an attacker can learn from the system. We encode all possible attacks to a system using a probabilistic specification, an Interval Markov Chain. Then the channel capacity...... as a reward function, a polynomial algorithm to verify the existence of an system maximizing entropy among those respecting a specification, a procedure for the maximization of reward functions over Interval Markov Chains and its application to synthesize an implementation maximizing entropy. We show how...... to use Interval Markov Chains to model abstractions of deterministic systems with confidential data, and use the above results to compute their channel capacity. These results are a foundation for ongoing work on computing channel capacity for abstractions of programs derived from code....

Maximizing entropy over Markov processes

DEFF Research Database (Denmark)

Biondi, Fabrizio; Legay, Axel; Nielsen, Bo Friis

2014-01-01

The channel capacity of a deterministic system with confidential data is an upper bound on the amount of bits of data an attacker can learn from the system. We encode all possible attacks to a system using a probabilistic specification, an Interval Markov Chain. Then the channel capacity...... as a reward function, a polynomial algorithm to verify the existence of a system maximizing entropy among those respecting a specification, a procedure for the maximization of reward functions over Interval Markov Chains and its application to synthesize an implementation maximizing entropy. We show how...... to use Interval Markov Chains to model abstractions of deterministic systems with confidential data, and use the above results to compute their channel capacity. These results are a foundation for ongoing work on computing channel capacity for abstractions of programs derived from code. © 2014 Elsevier...

HEALTH INSURANCE: CONTRIBUTIONS AND REIMBURSEMENT MAXIMAL

CERN Document Server

HR Division

2000-01-01

Affected by both the salary adjustment index on 1.1.2000 and the evolution of the staff members and fellows population, the average reference salary, which is used as an index for fixed contributions and reimbursement maximal, has changed significantly. An adjustment of the amounts of the reimbursement maximal and the fixed contributions is therefore necessary, as from 1 January 2000.Reimbursement maximalThe revised reimbursement maximal will appear on the leaflet summarising the benefits for the year 2000, which will soon be available from the divisional secretariats and from the AUSTRIA office at CERN.Fixed contributionsThe fixed contributions, applicable to some categories of voluntarily insured persons, are set as follows (amounts in CHF for monthly contributions):voluntarily insured member of the personnel, with complete coverage:815,- (was 803,- in 1999)voluntarily insured member of the personnel, with reduced coverage:407,- (was 402,- in 1999)voluntarily insured no longer dependent child:326,- (was 321...

The utility function and the emotional well-being function

OpenAIRE

Parada Daza, Jose Rigoberto

2004-01-01

Behind the utility function, which is the basis for economic and finance theory, is a philosophical and ethical approach based essentially on the Utilitarian and Hedonistic schools. Once qualitative, the utility function’s approach shifted to a quantitative one based on the work of the mathematician, D. Bernoulli. This quantitative approach is normative and based on a maximizing agent. In this paper, the “emotional well-being” function is developed which mixes the ethics of a rationa...

Survey on Cloud Radio Access Network

Directory of Open Access Journals (Sweden)

Reeta Chhatani

2016-01-01

Full Text Available The existing wireless network will face the challenge of data tsunami in the near future. Densification of network will deal huge data traffic but will increase the interferences and network cost. At the same time, the existing wireless network is underutilized due to dynamic traffic. To deal with this adverse scenario, a change in the current network architecture is required. Based on virtualization, Cloud Radio Access Network (CRAN was proposed for wireless network. In CRAN the functionality of base station will be distributed into base band unit (BBU and remote radio heads (RRH which will achieve benefits of centralization. This paper presents a survey on CRAN centring on optimized resource allocation, energy efficiency and throughput maximization under fronthaul capacity. The existing solution and future opportunities in CRAN are also summarized.

Computational Aspects of Sensor Network Protocols (Distributed Sensor Network Simulator

Directory of Open Access Journals (Sweden)

Vasanth Iyer

2009-08-01

Full Text Available In this work, we model the sensor networks as an unsupervised learning and clustering process. We classify nodes according to its static distribution to form known class densities (CCPD. These densities are chosen from specific cross-layer features which maximizes lifetime of power-aware routing algorithms. To circumvent computational complexities of a power-ware communication STACK we introduce path-loss models at the nodes only for high density deployments. We study the cluster heads and formulate the data handling capacity for an expected deployment and use localized probability models to fuse the data with its side information before transmission. So each cluster head has a unique Pmax but not all cluster heads have the same measured value. In a lossless mode if there are no faults in the sensor network then we can show that the highest probability given by Pmax is ambiguous if its frequency is ≤ n/2 otherwise it can be determined by a local function. We further show that the event detection at the cluster heads can be modelled with a pattern 2m and m, the number of bits can be a correlated pattern of 2 bits and for a tight lower bound we use 3-bit Huffman codes which have entropy < 1. These local algorithms are further studied to optimize on power, fault detection and to maximize on the distributed routing algorithm used at the higher layers. From these bounds in large network, it is observed that the power dissipation is network size invariant. The performance of the routing algorithms solely based on success of finding healthy nodes in a large distribution. It is also observed that if the network size is kept constant and the density of the nodes is kept closer then the local pathloss model effects the performance of the routing algorithms. We also obtain the maximum intensity of transmitting nodes for a given category of routing algorithms for an outage constraint, i.e., the lifetime of sensor network.

On the maximal diphoton width

CERN Document Server

Salvio, Alberto; Strumia, Alessandro; Urbano, Alfredo

2016-01-01

Motivated by the 750 GeV diphoton excess found at LHC, we compute the maximal width into $\\gamma\\gamma$ that a neutral scalar can acquire through a loop of charged fermions or scalars as function of the maximal scale at which the theory holds, taking into account vacuum (meta)stability bounds. We show how an extra gauge symmetry can qualitatively weaken such bounds, and explore collider probes and connections with Dark Matter.