20,872 Hits in 5.0 sec

Dark matter revisited

S. Vinoski
2004 IEEE Internet Computing  
I wonder how much cleaner SlimServer might be if it were instead written in Python and used a network programming framework, such as Twisted.  ...  The Twisted framework represents a fairly complete architecture for networked applications.  ... 
doi:10.1109/mic.2004.8 fatcat:lhaif4l6svbp7mud57rxmgeyra

Rectilinear Location Revisited

D. J. White
1996 Journal of the Operational Research Society  
The key function is the function 0(-, -) defined on X x A”.  ...  A GENERAL FRAMEWORK For 6€ {—1, 1)", ie I define an affine function on R” by, for x € X, a(x, 6) = 56,(x; — x}). jeJ Let the set of all such 6 be A, ie. A= {6*}, ke K =(1, 2, ... 2"}.  ... 
doi:10.1057/jors.1996.16 fatcat:tukohqczqfhvbkmajsmhpvqb2y

Wave equations on space-times of low regularity: Existence results and regularity theory in the framework of generalized function algebras [article]

James D.E. Grant, Eberhard Mayerhofer
2007 arXiv   pre-print
We present recent developments concerning Lorentzian geometry in algebras of generalized functions.  ...  These have, in particular, raised a new interest in refined regularity theory for the wave equation on singular space-times.  ...  The program of this article is to report on recent developments in Lorentzian geometry in a generalised framework and to present results on the wave-equation on singular space-times.  ... 
arXiv:0711.1972v1 fatcat:7zmds4raxrgobfigwuifv2zgaq

Constraint Games revisited

Anthony Palmieri, Arnaud Lallouet
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
Constraint Games are a recent framework proposed to model and solve static games where Constraint Programming is used to express players preferences.  ...  It yields not only a more elegant but also a more efficient framework.  ...  Constraint Games [Nguyen and Lallouet, 2014] are a way to give games a compact representation by using Constraint Programming to represent utility functions.  ... 
doi:10.24963/ijcai.2017/101 dblp:conf/ijcai/PalmieriL17 fatcat:dgmredmbuvaspakcvsrwgc4qn4

Modal logic programming revisited

Linh Anh Nguyen
2009 Journal of Applied Non-Classical Logics  
We present optimizations for the modal logic programming system MProlog, including the standard form for resolution cycles, optimized sets of rules used as meta-clauses, optimizations for the version of  ...  We also show that the labelling technique used in our direct approach is relatively better than the Skolemization technique used in the translation approaches for modal logic programming.  ...  I would like to thank also Professor Andrzej Szałas for reading the draft of this paper and giving useful comments.  ... 
doi:10.3166/jancl.19.167-181 fatcat:rmitxrzmjncyjhio2h45d7no2e

Formalising and analysing the control software of the Compact Muon Solenoid Experiment at the Large Hadron Collider

Yi Ling Hwong, Jeroen J.A. Keiren, Vincent J.J. Kusters, Sander Leemans, Tim A.C. Willemse
2013 Science of Computer Programming  
The control software of the CERN Compact Muon Solenoid experiment contains over 30,000 finite state machines.  ...  The sheer size of the system makes it virtually impossible to fully understand the details of its behaviour at the macro level. This is fuelled by unclarities that already exist at the micro level.  ...  We also thank Frank Glege, Robert Gomez-Reino Garrido, Lorenzo Masetti and Giovanni Polese from the CERN CMS DAQ group, Stefan Schlenker from the ATLAS experiment and Ombretta Pinazza from the ALICE experiment  ... 
doi:10.1016/j.scico.2012.11.009 fatcat:4q6zkhcjungwzm4qj45ctyey2a

Symbolic pointer analysis revisited

Jianwen Zhu, Silvian Calman
2004 Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation - PLDI '04  
In contrast to the classical frameworks where context-sensitive point-to information of a procedure has to be obtained by the application of its transfer function exponentially many times, our method can  ...  In this paper, we refine the concept of symbolic transfer function proposed earlier and establish a common framework for both context-insensitive and context-sensitive pointer analysis.  ...  of the symbolic framework to other program analysis problems.  ... 
doi:10.1145/996841.996860 dblp:conf/pldi/ZhuC04 fatcat:bq4a6b6v7zaaja2ii6j2is3tia

Symbolic pointer analysis revisited

Jianwen Zhu, Silvian Calman
2004 SIGPLAN notices  
In contrast to the classical frameworks where context-sensitive point-to information of a procedure has to be obtained by the application of its transfer function exponentially many times, our method can  ...  In this paper, we refine the concept of symbolic transfer function proposed earlier and establish a common framework for both context-insensitive and context-sensitive pointer analysis.  ...  of the symbolic framework to other program analysis problems.  ... 
doi:10.1145/996893.996860 fatcat:z62gjno7izagrd7ssarsoll2de

Space compression revisited

S.R. Das, T.F. Barakat, E.M. Petriu, M.H. Assaf, K. Chakrabarty
2000 IEEE Transactions on Instrumentation and Measurement  
, time compaction.  ...  This paper discusses new space compression techniques for built-in self-testing (BIST) of VLSI circuits based on the use of compact test sets to minimize the storage requirements for the circuit under  ...  ACKNOWLEDGMENT The authors are extremely grateful to the anonymous referees and to the Guest Editor Dr.  ... 
doi:10.1109/19.850416 fatcat:7iowgwaiqfhslibopm7jmmdn6q

Aliasing-free compaction revisited

S.R. Das, A. Hossain, S. Biswas, E.M. Petriu
2008 IET Circuits, Devices & Systems  
The authors briefly present the mathematical basis of selection criteria for merger of an optimal number of outputs of the module under test for realising maximum compaction ratio in the design, along  ...  The authors revisit the general problem of designing zero-aliasing (or aliasing-free) space compression hardware in relation to embedded cores-based SOC for single stuck-line faults in particular, extending  ...  Acknowledgments The authors would like to thank the anonymous reviewers for their very valuable comments that immensely helped in the preparation of the revised version of the paper.  ... 
doi:10.1049/iet-cds:20070119 fatcat:xo2zjiri2revxmx6lsjnhkq6he

Polyhedra scanning revisited

Chun Chen
2012 Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation - PLDI '12  
Second, an if-statement simplification algorithm further reduces the number of comparisons in the code.  ...  The strength of our approach lies in two new algorithms.  ...  It should be pointed out that different mathematical frameworks other than Omega+ can be used as long as the same functionality is provided.  ... 
doi:10.1145/2254064.2254123 dblp:conf/pldi/Chen12 fatcat:zoszbrjkerdstbducfwc6j4knm

Summarized Dimensions Revisited

Holger Siegel, Axel Simon
2012 Electronical Notes in Theoretical Computer Science  
The task of summarizing memory regions becomes increasingly important in the analysis of data structures and the analysis of recursive functions.  ...  Also, as the number of memory cells allocated in a program cannot be bounded a priori, it is crucial to summarize the information contained in different memory cells into one abstract memory cell to ensure  ...  Indeed, in the abstract interpretation framework [1] the partial order C n , ⊆ can be seen as a concrete domain over which the semantics of the program is expressed.  ... 
doi:10.1016/j.entcs.2012.10.009 fatcat:yijk47md3vejldjxrxx72tmvue

Revisiting Fault-Injection Experiment-Platform Architectures

Horst Schirmeier, Martin Hoffmann, Rudiger Kapitza, Daniel Lohmann, Olaf Spinczyk
2011 2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing  
Trace recording and fault injection are among the core functionalities these tools provide for hardware debuggers or system simulators, partially including some means to automate larger experiment campaigns  ...  Based on this analysis, we propose a novel architecture for a versatile FI experiment framework, based on the aspect-oriented programming (AOP) paradigm. II.  ...  Aspect-oriented programming (AOP, [8] ) is a technique known to facilitate this: So-called aspects-defining where ("pointcut") FI code (what: "advice") should be applied-allow for compact, well-encapsulated  ... 
doi:10.1109/prdc.2011.46 dblp:conf/prdc/SchirmeierHKLS11 fatcat:aeabsfmokfhnrcuoksoia3xznm

Student Leadership Programming Model Revisited

Trent A. Engbers
2006 Journal of Leadership Education  
The new model casts program styles against individual and group functions, thereby creating a more holistic perspective of the leadership phenomenon.  ...  The model is also explored in relation to assessment, campus culture, and sample programs.  ...  Community Involvement Similar to the recent rise of leadership development programs, there exists a reemergence of community service and service learning programs in higher education (Campus Compact,  ... 
doi:10.12806/v5/i3/tf1 fatcat:jrn2ktqefjeitbhoj2tsyadlye

Adversarial Reprogramming Revisited [article]

Matthias Englert, Ranko Lazic
2022 arXiv   pre-print
We prove that two-layer ReLU neural networks with random weights can be adversarially reprogrammed to achieve arbitrarily high accuracy on Bernoulli data models over hypercube vertices, provided the network  ...  A trajectory of gradient flow is a function θ(t) : [0, ∞) → R k(d+1) that is an arc, i.e. it is absolutely continuous on every compact subinterval, and that satisfies the differential inclusion dθ dt ∈  ...  The program is initialised in such a way that after the application of the softsign function, each value lies uniformly at random in (−1, 1).  ... 
arXiv:2206.03466v1 fatcat:trujcde45vd73lg5xcbqv67k34
« Previous Showing results 1 — 15 out of 20,872 results