A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Filters
Online Algorithms for Network Robustness under Connectivity Constraints
[article]
2021
arXiv
pre-print
Preserved Fulltext
In this paper, we present algorithms for designing networks that are robust to node failures with minimal or limited number of links. ...
We present algorithms for both the static network setting and the dynamic network setting; setting where new nodes can arrive in the future. ...
The static network problem can be stated as follows: what is the minimal L under Assumption 1 such that the robustness constraint RG N f holds? ...
arXiv:2106.04037v1
fatcat:qyfwdtvngzbs3dmg6vpdo3skma
Enhancing network robustness against malicious attacks
2012
Physical Review E
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
USA 108, 3838 (2011)], the authors proposed a simple measure for network robustness under malicious attacks on nodes. ...
Finally, some economical constraints for swapping the links in real networks are considered and significant improvement in both aspects of robustness are still achieved. ...
ACKNOWLEDGEMENT We would like to thank Yi-Cheng Zhang and Xiao-Pu Han for helpful suggestions. This work is supported by the Swiss National Science Foundation (No. 200020-132253). ...
doi:10.1103/physreve.85.066130
pmid:23005185
fatcat:s5env4fyufffngmmkgcqtp4qiu
Characterising the robustness of complex networks
2010
International Journal of Internet Technology and Secured Transactions
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
for robustness. ...
sufficient but not necessary condition for robustness. ...
Robert Kooij for contributing to the success of this work ...
doi:10.1504/ijitst.2010.037406
fatcat:5c3m6owaojferm5ksvplc25fki
Improvement of the robustness on geographical networks by adding shortcuts
2007
Physica A: Statistical Mechanics and its Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
for the robust network design. ...
In this paper, we numerically investigate the effects of adding shortcuts on the robustness in geographical scale-free network models under a similar degree distribution to the original one. ...
Acknowledgment The authors would like to thank CAIDA for using the AS relationship data [30]. This research is supported in part by Grant-in-Aide for Scientific Research in Japan, No.18500049. ...
doi:10.1016/j.physa.2007.02.080
fatcat:raxco5xidnairngh6nfrwleqze
Robust Outdoor Vehicle Visual Tracking Based on k-Sparse Stacked Denoising Auto-Encoder
[chapter]
2018
Autonomous Vehicles [Working Title]
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Finally, confidence of each particle is computed by the classification neural network and is used for online tracking under particle filter framework. ...
In this chapter, k-sparse constraint is added to the encoder part of stacked auto-encoder network to learn more invariant feature of object appearance, and a stacked k-sparse-autoencoder-based robust outdoor ...
The main online tracking steps under the particle filter framework are as follows. ...
doi:10.5772/intechopen.80089
fatcat:oskoxmu3qnbtldeavke2hu3joa
Online Admission Control and Resource Allocation in Network Slicing under Demand Uncertainties
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2022 pre-print arXiv:2108.03710v2 fatcat:jtnvswlvergmnfxyaiwq7lhcviOther Versions
Then, an optimal algorithm is proposed. This optimal algorithm cannot be solved in a reasonable amount of time for real-world and large-scale networks. ...
Because the slices' arrive to the network in different times and their lifespans vary, the solution should dynamically react to online slice requests. ...
CONCLUSION We proposed two online admission control and resource allocation algorithms for network slicing under bandwidth and workload uncertainties. ...
arXiv:2108.03710v3
fatcat:nxwh7q4mjbfs3eqsdtq2efsxuu
Online Verification of Deep Neural Networks under Domain or Weight Shift
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Although neural networks are widely used, it remains challenging to formally verify the safety and robustness of neural networks in real-world applications. ...
However, it is still challenging to run existing verification algorithms online. ...
For example, instead of verifying that a human behavior prediction network is robust to any arbitrary human subject, we can verify that it is robust to the current subject. ...
arXiv:2106.12732v1
fatcat:o7c7asb42rgt5h46huhuhiuuxm
Multi Criteria Optimization Algorithm for Economic Dispatch Complications for Sustainable Interconnected Power System
2012
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper proposed to develop an evolutionary algorithm which considers all constraints of power dispatch for economic operation of the power system. ...
Evolutionary algorithms have been nowadays frequently used for optimum performance of nonlinear and complex systems. ...
To develop such an algorithm and making an allowance for multi criteria optimization to solve economic dispatch complications for sustainable grid-connected power system. ...
doi:10.5120/7760-0824
fatcat:wuanc22orfelnkrar2oeyfnini
DEVELOPMENT OF A MULTI-OBJECTIVE MODEL WITH MULTIPLE ALLOCATION OF LIMITED CAPACITY IN TERMS OF UNCERTAINTY FOR LOCATION AXES
2016
The Turkish Online Journal of Design Art and Communication
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Hub location issues generally arise in the network transport and communications. ...
Hung and Wang [10] considered robust optimization model for location hub issue in a state of unlimited capacity nodes and using multiobjective genetic algorithms to solve their problem. ...
For this reason instead of using a direct connection to source indirect connections (connection to hub) to be handled. Thus can be used from economies of scale. ...
doi:10.7456/1060jse/004
fatcat:oydg4drj4zf6vldde3n63stgry
Online and Global Network Optimization: Towards the Next-Generation of Routing Platforms
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
From now on, cutting-edge optimization and machine learning algorithms can be used to control networks in real-time. ...
This paper presents a candidate architecture for the next generation of routing platforms built on three main pillars for admission control, re-routing and monitoring that would have not been possible ...
Due to their conservative nature, they generally underperform under more standard traffic conditions. One of the first online algorithms for admission control has been AAP. ...
arXiv:1602.01629v1
fatcat:jg2ljsbcabazdc2ufcfv4v6iku
Evolutionary construction of geographical networks with nearly optimal robustness and efficient routing properties
2009
Physica A: Statistical Mechanics and its Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2008 pre-print arXiv:0811.2827v2 fatcat:t3tushsqofbwjoigdh6hcxco7uOther Versions
in order to improve the robustness to a similar level to that of the optimal bimodal networks with a larger degree O(√(N)) for the network size N. ...
Robust and efficient design of networks on a realistic geographical space is one of the important issues for the realization of dependable communication systems. ...
Acknowledgments The author would like to thank anonymous reviewers for valuable comments to improve the manuscript, and also Yasumasa Ono and Hironori Okumura in my laboratory for helping with the simulation ...
doi:10.1016/j.physa.2008.11.027
fatcat:a53j723a5vehxnz7mavwxcs7jq
Online Robust Placement of Service Chains for Large Data Center Topologies
2019
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In this paper, we provide an online algorithm for robust placement of service chains in data centers. ...
INDEX TERMS Online placement algorithm, SFC, robustness, cloud, data center. 60150 This work is licensed under a Creative Commons Attribution 3.0 License. ...
Constraints As our algorithm aims to be used in an online manner, its resolution time must be kept fast. ...
doi:10.1109/access.2019.2914635
fatcat:bjdi4sls3bcw7g2le34j6i7f3q
An integer optimization algorithm for robust identification of non-linear gene regulatory networks
2012
BMC Systems Biology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The objective function is targeted to minimize the network connections subjected to the constraint of maximal agreement between the experimental and predicted gene dynamics. ...
Towards that, the identification algorithm is formulated as an integer-programming problem by introducing binary variables for each network component. ...
These results validate the performance of the algorithm for a small network under deterministic conditions.
1B Network identification under data uncertainty The performance of the algorithm is next analyzed ...
doi:10.1186/1752-0509-6-119
pmid:22937832
pmcid:PMC3444924
fatcat:raz2vrtiyzejlicofug5bj2tny
Is cortical connectivity optimized for storing information?
2016
Nature Neuroscience
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Here we study the properties of the excitatory synaptic connectivity in a network that maximizes the number of stored patterns of activity in a robust fashion. ...
This suggests synaptic connectivity in cortex is optimized to store a large number of attractor states in a robust fashion. ...
In all cases, we used the perceptron learning algorithm to learn a set of connectivity matrices that satisfied all constraints imposed by the patterns. ...
doi:10.1038/nn.4286
pmid:27065365
fatcat:miefw6u6kjcrzi64ion5cmwjry
Recent advances in robust optimization: An overview
2014
European Journal of Operational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
With respect to the practice of robust optimization, we consider a broad spectrum of applications, in particular inventory and logistics, finance, revenue management, but also queueing networks, machine ...
Key developments in the period from 2007 to present include: (i) an extensive body of work on robust decision-making under uncertainty with uncertain distributions, i.e., "robustifying" stochastic optimization ...
Acknowledgments The authors would like to thank the Associate Editor and three anonymous referees for their insightful comments and suggestions. ...
doi:10.1016/j.ejor.2013.09.036
fatcat:negoppbbu5hanjkdlccdwjb35a
« Previous
Showing results 1 — 15 out of 61,866 results