Filters








30 Hits in 5.9 sec

Decision Diagram Algorithms to Extract Minimal Cutsets of Finite Degradation Models

Antoine Rauzy, Yang
2019 Information  
In this article, we propose decision diagram algorithms to extract minimal cutsets of finite degradation models.  ...  We show how algorithms used to calculate minimal cutsets can be lifted up to finite degradation models, thanks to a generic decomposition theorem and an extension of the binary decision diagrams technology  ...  Extraction of Minimal Cutsets As in the Boolean case [16] , the principle of the extraction of minimal cutsets is to build a second decision diagram encoding the minimal cutsets from the one associated  ... 
doi:10.3390/info10120368 fatcat:rlm3e64mzjf7la2jhadakigtaq

Energy-efficient soft error-tolerant digital signal processing

Byonghyo Shim, N.R. Shanbhag
2006 IEEE Transactions on Very Large Scale Integration (vlsi) Systems  
The proposed technique, referred to as algorithmic soft error-tolerance (ASET), employs low-complexity estimators of a main DSP block to achieve reliable operation in the presence of soft errors.  ...  For frequency selective finite-impulse response (FIR) filtering, it is shown that the proposed techniques provide robustness in the presence of soft error rates of up to er = 10 2 and er = 10 3 in a single-event  ...  The decision rule of ST-ASET is described by if if and if and poses, the power dissipation of the T-ASET is similar to that of the ST- Fig. 5 . 5 T-ASET: (a) block diagram and (b) schedule.  ... 
doi:10.1109/tvlsi.2006.874359 fatcat:zbvmoj7t4ng4ddlwfqdc5c5fkq

Index—Volumes 1–89

1997 Artificial Intelligence  
638 qualitatively distinct features 11 I3 quality decision -1227 of a decision 229, 243 of a decision, degradation of -229 quantification 636 of objects, three dimensional -201 over d#Dmain individuals  ...  meaningful -427 degenerate cases 471 views 571 degeneration. of genetic algorithms 1244 degradation of the quality of a decision 229 degrees of belief 413,597, 1245, 1378 degrees of freedom 1153  ...  mathematics of non-monotonic-150 mechanism 381 mechanized formal -152 meta-level -185 method geometric -12 17 methods choices of -1157 models inexact -906 multiple inheritance -966 multiple lines of -  ... 
doi:10.1016/s0004-3702(97)80122-1 fatcat:6az7xycuifaerl7kmv7l3x6rpm

Abstracts of Current Computer Literature

1968 IEEE transactions on computers  
learning in automatic systems; Recent work on theoretical models of biological memory; Some approaches to optimum feature extraction; Evaluation and selection of variables in pattern recognition; Some  ...  for Large Linear Sys-Minimization Minimal Experiments for Input-Independent Sequential Machines 5550 -see also Switching Functions Models Experimental Model of System/360 5563 Queueing Model for an Economic  ... 
doi:10.1109/tc.1968.229105 fatcat:2ijvliiwarh2jc2lxnwiyktyjq

Sum-product networks: A survey [article]

Iago París, Raquel Sánchez-Cauce, Francisco Javier Díez
2020 arXiv   pre-print
Their main advantage is the possibility of building tractable models from data, i.e., models that can perform several inference tasks in time proportional to the number of links in the graph.  ...  They are closely related to probabilistic graphical models, in particular to Bayesian networks with multiple context-specific independencies.  ...  Acknowledgments We thank Pascal Poupart for convincing us about the advantages of SPNs, and Concha Bielza, Adnan Darwiche, Pedro Larrañaga, Alejandro Molina, Andrzej Pronobis, Martin Trapp, Jos van de  ... 
arXiv:2004.01167v1 fatcat:zmwyvhyqerh67ju5duiuo3uecy

Sum-product networks: A survey

Raquel Sanchez-Cauce, Iago Paris, Francisco Javier Diez Vegas
2021 IEEE Transactions on Pattern Analysis and Machine Intelligence  
Their main advantage is the possibility of building tractable models from data, i.e., models that can perform several inference tasks in time proportional to the number of edges in the graph.  ...  They are closely related to probabilistic graphical models, in particular to Bayesian networks with multiple context-specific independencies.  ...  RSC received a postdoctoral grant and IP a predoctoral grant and from UNED, both co-financed by the Regional Government of Madrid and the Youth Employment Initiative (YEI) of the European Union. 12 .  ... 
doi:10.1109/tpami.2021.3061898 pmid:33630736 fatcat:2nivccgqkrabhaza5nsvvkjs4i

Dynamic reliability: towards an integrated platform for probabilistic risk assessment

P.E. Labeau, C. Smidts, S. Swaminathan
2000 Reliability Engineering & System Safety  
In principle, they constitute a more realistic modeling of systems for the purposes of reliability, risk and safety analysis.  ...  This paper attempts to provide milestones in the creation of a high level design of such tools. To achieve this purpose, a modular approach is used.  ...  However, the search algorithms for grouping and extracting results to be displayed in a presentable format, do not exist and research needs to shift its focus towards the development of these and their  ... 
doi:10.1016/s0951-8320(00)00017-x fatcat:k6h3hliez5bhxnryrwrmvb6rnu

Cascading Network Failure in Power Grid Blackouts [chapter]

Dr.Ian Dobson
2014 Encyclopedia of Systems and Control  
The emerging risk analysis, simulation, and modeling of cascading blackouts are briefly surveyed, and key references are suggested.  ...  Cascading failure consists of complicated sequences of dependent failures and can cause large blackouts.  ...  For example, line overloads tend to propagate along cutsets of the network.  ... 
doi:10.1007/978-1-4471-5102-9_264-1 fatcat:slhzrvsilfephprfzlkkccbyma

Cooperative Manipulators [chapter]

Fabrizio Caccavale
2015 Encyclopedia of Systems and Control  
The emerging risk analysis, simulation, and modeling of cascading blackouts are briefly surveyed, and key references are suggested.  ...  Cascading failure consists of complicated sequences of dependent failures and can cause large blackouts.  ...  For example, line overloads tend to propagate along cutsets of the network.  ... 
doi:10.1007/978-1-4471-5058-9_175 fatcat:gzo7xen4ynezhesyrpsldzj5bi

Recurrent Neural Networks [chapter]

Sajid A. Marhon, Christopher J. F. Cameron, Stefan C. Kremer
2013 Intelligent Systems Reference Library  
A goal is to design better algorithms that are both computationally efficient and simple to implement.  ...  Others address real-time solutions of optimization problems and a unified method for designing optimization neural network models with global convergence.  ...  Lund and Stefano Nolfi who did most of the development of the kepsim simulator, which has been used (in slightly adapted form) to implement the experiments documented in this paper.  ... 
doi:10.1007/978-3-642-36657-4_2 fatcat:jnmgv7rlifhuncqhi5kxldepdm

2021 Index IEEE Transactions on Image Processing Vol. 30

2021 IEEE Transactions on Image Processing  
The primary entry includes the coauthors' names, the title of the paper or other item, and its location, specified by the publication abbreviation, year, month, and inclusive pagination.  ...  Departments and other items may also be covered if they have been judged to have archival value. The Author Index contains the primary entry for each item, listed under the first author's name.  ...  ., +, TIP 2021 4840-4854 Degradation Fast and Robust Cascade Model for Multiple Degradation Single Image Super-Resolution.  ... 
doi:10.1109/tip.2022.3142569 fatcat:z26yhwuecbgrnb2czhwjlf73qu

Decision Diagrams for Optimization

Andre Augusto Cire
2018
As our first contribution, we provide a modeling framework based on dynamic programming that can be used to specify how to build a decision diagram of a discrete optimization problem and how to approximate  ...  A decision diagram is viewed here as a graphical representation of the feasible solution set of a discrete problem.  ...  The framework requires P to be written as a dynamic programming (DP) model and extracts a decision diagram from the resulting state transition graph.  ... 
doi:10.1184/r1/6715670.v1 fatcat:mbzttyad6nccldqkh34fwdsfu4

MIP Formulations for the Steiner Forest Problem [article]

Daniel Schmidt, Bernd Zey, François Margot
2017 arXiv   pre-print
On the practical side, bounds from a mixed integer program by Magnanti and Raghavan [MR05] are very close to the integer optimum in computational experiments, but the size of the model limits its practical  ...  Finding tight linear programming bounds for the problem is the key for both fast Branch-and-Bound algorithms and good primal-dual approximations.  ...  Acknowledgements This work was supported by a fellowship within the Postdoc-Program of the German Academic Exchange Service (DAAD).  ... 
arXiv:1709.01124v1 fatcat:ttqbuda6lngevdenq5h2j65kme

IJATES_Vol6_No1

Jaroslav Koton
2017 International Journal of Advances in Telecommunications, Electrotechnics, Signals and Systems  
It is implicit that this model considers no graceful degradation: either the cloud responds to the service demand or not.  ...  So, it is always a good practice to minimize the use of multipliers in hardware designs.  ... 
doaj:914d7e61fbe54d4cba06ff1a639c3f56 fatcat:4k2flqu6ffdjvk2caqb2qzbinu

Wireless communications

2006 ChoiceReviews  
In this introductory chapter we will briefly review the history of wireless networks, from the smoke signals of the pre-industrial age to the cellular, satellite, and other wireless networks of today.  ...  The gap between current and emerging systems and the vision for future wireless applications indicates that much work remains to be done to make this vision a reality.  ...  The finite bandwidth and random variations of wireless channels also requires robust applications that degrade gracefully as network performance degrades.  ... 
doi:10.5860/choice.43-5310 fatcat:agh3tfw2uzacrjb4n4nmpq6uta
« Previous Showing results 1 — 15 out of 30 results