Filters








2,261 Hits in 4.3 sec

The TM System for Repairing Non-Theorems

Simon Colton, Alison Pease
2005 Electronical Notes in Theoretical Computer Science  
We show that, for 98 non-theorems, TM produced meaningful modifications for 81 of them. This work forms part of two larger projects.  ...  This is achieved in the TM system through an interaction of the HR machine learning program, the Otter theorem prover and the Mace model generator.  ...  Special thanks to Bill McCune and Geoff Sutcliffe for supplying data and for their input to this work, and to Roy McCasland for providing the proof found in the appendix.  ... 
doi:10.1016/j.entcs.2004.07.021 fatcat:qraievnxnrf3bivw6jdwn6mbqa

State of the Art of Information Technology Computing Models for Autonomic Cloud Computing †

Eugene Eberbach
2017 Proceedings (MDPI)  
In the paper we present several models of computation for autonomic cloud computing.  ...  The above claims are illustrated using as an example the DIME Network Architecture.  ...  In short, Gödel's theorem prohibits "self-reflection" in TMs. This self-reflection causes exactly that we have so many TM unsolvable problems.  ... 
doi:10.3390/10.3390/is4si-2017-04028 fatcat:4xflczvv7nbyxiifv3fqnzan2q

State of the Art of Information Technology Computing Models for Autonomic Cloud Computing

Eugene Eberbach
2017 Proceedings (MDPI)  
In the paper we present several models of computation for autonomic cloud computing.  ...  The above claims are illustrated using as an example the DIME Network Architecture.  ...  In short, Gödel's theorem prohibits "self-reflection" in TMs. This self-reflection causes exactly that we have so many TM unsolvable problems.  ... 
doi:10.3390/is4si-2017-04028 fatcat:qlvc4cdy3bcm5mfkmtq26h24b4

Magic Sets and their application to data integration

Wolfgang Faber, Gianluigi Greco, Nicola Leone
2007 Journal of computer and system sciences (Print)  
In fact, results of experiments in the EU project INFOMIX, show that Magic Sets are fundamental for the scalability of the system. ✩ This work was partially supported by MIUR under projects "Sistemi basati  ...  Our Magic Sets optimization constitutes an effective method for enhancing the performance of data integration systems in which query-answering is carried out by means of cautious reasoning over Datalog  ...  It is worthwhile noting that in the data integration setting there is little hope to materialize (in polynomial time) a repair which is representative of all the repairs for the system.  ... 
doi:10.1016/j.jcss.2006.10.012 fatcat:euekrhyltfedbo2bg5khlllbuy

Quantitative analysis of a transfer production line with Andon

Jingshan Li, Dennis E. Blumenfeld
2006 IIE Transactions  
We show that when average repair times are short, introducing Andon to stop the line and repair all defects on the line is an effective way to achieve a high throughput of non-defective jobs.  ...  Some practical rules are derived to guide operations management on the factory floor.  ...  Saif Benjaafar and the anonymous reviewers for their valuable comments and suggestions.  ... 
doi:10.1080/07408170600733228 fatcat:lmv2tt3c75aklgwhen5h5reynu

A two-machine repair model with variable repair rate

F. A. Van Der Duyn Schouten, P. Wartenhorst
1993 Naval Research Logistics  
After inspection of a failed unit the repairman chooses either a slow or a fast repair rate to carry out the corresponding amount of work.  ...  Furthermore, we present several performance measures for this maintenance system controlled by a two-dimensional control limit rule. rate w earn out this amount of work.  ...  In the next two theorems we assume K,1 = 0 (no fixed costs at system breakdown). In Theorem 2.2, we prove that the repair rate to start a repair is chosen according to a control limit rule.  ... 
doi:10.1002/1520-6750(199306)40:4<495::aid-nav3220400406>3.0.co;2-v fatcat:rgtjwqdm2nfkncf6g4czcia64q

Erasures repair for decreasing monomial-Cartesian and augmented Reed-Muller codes of high rate [article]

Hiram H. López, Gretchen L. Matthews, Daniel Valvo
2021 arXiv   pre-print
Unlike the repair scheme for two erasures of DM-CC, the repair scheme for two erasures for the augmented codes has no restrictions on the positions of the erasures.  ...  We develop repair schemes for one or two erasures for these families of augmented codes.  ...  The maximum k for which RM(K m , k) admits the repair scheme given in [2, Theorem III.1] is 623.  ... 
arXiv:2107.01534v1 fatcat:xjomhcupqzf3phyrqdgpipjnay

Page 6313 of Mathematical Reviews Vol. , Issue 2002H [page]

2002 Mathematical Reviews  
In this paper we show that a combination of the two approaches has an improved time/memory/data tradeoff for stream ciphers of the form TM?D? = N? for any D?< T<N.  ...  We propose a construction of non-committing encryption that can be based on any public-key system which is secure in the ordinary sense and which has an extra property we call simulatability.  ... 

Page 7239 of Mathematical Reviews Vol. , Issue 90M [page]

1990 Mathematical Reviews  
Mark Brown (1-CCNY) 90m:60099 60K10 62N05 90B25 van der Heijden, Matthieu (NL-VUAM-A) A simple algorithm for the system reliability in the 1-out-of-n system with exponential repair times. Comm.  ...  (iii) At least for some special cases there is a need to study the problem with nonexponential repair times. R.  ... 

Optimal Replacement Policy for a General Model with Imperfect Repair

Viliam Makis, Andrew K. S. Jardine
1992 Journal of the Operational Research Society  
Then we have from the general theorem in Aven and Bergman”’ (Theorem 3.1) that function ¥(d) is non-increasing for d < g* and non-decreasing for d > g*. g* is the unique fixed-point of ¥(-) which can be  ...  system can be either replaced at the cost cy, or can undergo a repair at a cost c(m, x) where x is the age of the system.  ... 
doi:10.1057/jors.1992.17 fatcat:7l25upczwfc47n3pvc4jcdy6c4

The association in time of a Markov process with application to multistate reliability theory

Nils Lid Hjort, Bent Natvig, Espen Funnemark
1985 Journal of Applied Probability  
A series of bounds for the availability and unavailability in a fixed time interval, I, for a system of maintained, interdependent components are given in Natvig (1980) in the traditional binary case,  ...  For the special case of independent components the only assumption needed to arrive at these bounds is that the marginal performance process of each component is associated in I.  ...  Acknowledgement The authors would like to thank Arne Bang Huseby for assistance on the linear programming problems that turned up when trying to generalize the proof of Esary and Proschan (1970).  ... 
doi:10.1017/s0021900200037955 fatcat:o2r2wih6qrhqnnwxlltwcrceoe

Page 5723 of Mathematical Reviews Vol. , Issue 86m [page]

1986 Mathematical Reviews  
We prove that, under the condition that the mean lifetime of the system is much larger than the mean repair time and the maintenance time, the system reliability function will tend to be exponential.”  ...  ,%1,t1) []i<m<n fim-sim(tmtm-1)), where (fi;(t)) is the minimal solution related to a Q-matrix [see K.-L.  ... 

Time and Palm stationarity of repairable systems

Günter Last, Ryszard Szekli
1999 Stochastic Processes and their Applications  
In this paper we study asymptotic behaviour of marked point processes describing failure processes of repairable systems in which repair decisions depend on the past.  ...  The methods used in this paper combine classical Palm-martingale calculus for marked point processes with stability results for Harris recurrent Markov processes.  ...  Using Eq. (6.16) for k = 1, we obtain for V (0) = v6v 0 , P(Á m+1 ∈ · |F 0 )¿P(Á m+1 ∈ · ; −T M (Â Tm+1 )¡T m+1 − T 1 |F 0 ) = P((M (Â Tm+1 (T1; Tm+1] ); m+1 ) ∈ · ; −T M (Â Tm+1 (T1; Tm+1] )¡T m+1 − T  ... 
doi:10.1016/s0304-4149(98)00067-2 fatcat:npmnzovzuvhunalxqjzggeixa4

Optimal time to repair a broken server

Awi Federgruen, Kut C. So
1989 Advances in Applied Probability  
The operating costs of the system include customer holding costs, repair costs and running costs.  ...  by a single threshold parameter: a repair is initiated if and only if the number of customers in the system exceeds this threshold.  ...  repairs the server if and only if the number of customers in the system exceeds a certain level for this problem.  ... 
doi:10.2307/1427165 fatcat:r6q2q2l77bagvj4deyly7wxfdy

Non-monotonic logic I

Drew McDermott, Jon Doyle
1980 Artificial Intelligence  
Introduction "Non-monotonic" logical systems are l ogics in which the Introduction of new axioms can invalidate old theorems.  ...  Non-monotonic logical systems are logics in which the introduction of new axioms can invalidate old theorems.  ... 
doi:10.1016/0004-3702(80)90012-0 fatcat:2np5actyufadji5i6glm4ehts4
« Previous Showing results 1 — 15 out of 2,261 results