ppxscal/embedding_network huggingface dataset:
Generic Faultloads Based on Software Faults for Dependability Benchmarking
Authors: Joao Duraes, Henrique Madeira
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

The most critical component of a dependabilitybenchmark is the faultload, as it should represent arepeatable, portable, representative, and generallyaccepted set of faults. These properties are essential toachieve the desired standardization level required by adependability benchmark but, unfortunately, are veryhard to achieve. This is particularly true for softwarefaults, which surely accounts for the fact that thisimportant class of faults has never been used in knowndependability benchmark proposals. This paper proposesa new methodology for the definition of faultloads basedon software faults for dependability benchmarking.Faultload properties such as repeatability, portabilityand scalability are also analyzed and validated throughexperimentation using a case study of dependabilitybenchmarking of web-servers. We concluded thatsoftware fault-based faultloads generated using ourmethodology are appropriate and useful for dependabilitybenchmarking. As our methodology is not tied to anyspecific software vendor or platform, it can be used togenerate faultloads for the evaluation of any softwareproduct such as OLTP systems.
Impact of Statechart Implementation Techniques on the Effectiveness of Fault Detection Mechanisms
Authors: G. Pinter, I. Majzik
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

This paper presents the analysis of an experiment series aiming at the discovery of the impact of two inherently different statechart implementation methods on the behavior of the resulting executables in the presence of faults. The discussion identifies the key features of implementation techniques influencing the effectiveness of standard fault detection mechanisms (memory protection, assertions etc.) and an advanced statechart-level watchdog scheme used for detecting the deviations from the abstract implementation-independent behavioral specification.
Shape Deformations with Meaningful Parameters and Constraints
Venue: Proceedings of the Shape Modeling International 2004 (2004)

The newly emerged computer-aided industrialdesign (CAID) systems gain increasing popularityamong industrial designers. Despite the large numberof deformation techniques already implemented incommercial systems or described in the literature, thesetechniques still lack in providing designers withmeaningful shape deformations tools. In this work, weaddress this issue through the allocation of meaningfulparameters and constraints to support specific shapedeformations. Therefore, we introduce the concept of ashape context, which incorporates specific parameters,constraints and shape variation procedures that helpsdesigners to quicker reach a desired shape. A shapedesign tool, MAPTool, has been developed based onthe shape context concept. MAPTool helps designersto reach different shapes using one shape deformationthrough the alteration of its two meaningfulparameters. Two product models developed usingMAPTool are shown. Finally, we conclude thatproviding designers with meaningful parameters basedon the shape context proves to be very promising.
Codes Closed under Arbitrary Abelian Group of Permutations
Authors: Bikash Kumar Dey, B. Sundar Rajan
Venue: SIAM Journal on Discrete Mathematics (2005)

Algebraic structure of codes over Fq, closed under arbitrary abelian group G of permutations with exponent relatively prime to q, called G-invariant codes, is investigated using a transform domain approach. In particular, this general approach unveils algebraic structure of quasi-cyclic codes, abelian codes, cyclic codes, and quasi-abelian codes with restriction on G to appropriate special cases. Dual codes of G-invariant codes and self-dual G-invariant codes are characterized. The number of G-invariant self-dual codes for any abelian group G is found. In particular, this gives the number of self-dual l-quasi-cyclic codes of length ml over Fq when (m,q)=1. We extend Tanner's approach for getting a bound on the minimum distance from a set of parity check equations over an extension field and outline how it can be used to get a minimum distance bound for a G-invariant code. Karlin's decoding algorithm for a systematic quasi-cyclic code with a single row of circulants in the generator matrix is extended to the case of systematic quasi-abelian codes. In particular, this can be used to decode systematic quasi-cyclic codes with columns of parity circulants in the generator matrix.
Dielectric effect of a thin SiO2 interlayer at the interface between Silicon and high-k Oxides
Authors: Feliciano Giustino, Paolo Umari, Alfredo Pasquarello
Venue: Microelectronic Engineering (2004)

We investigate the dielectric permittivity of SiO2 on Si(100) substrates using a first-principles approach. It is shown that both the static and high-frequency dielectric constants of the oxide overlayer increase when the oxide thickness is reduced. This behavior of the overlayer is found to be well reproduced by a classical two-layer model in which the pure oxide and the suboxide layer are treated as distinct dielectrics. Implications for interfaces between silicon and high-k gate oxides are discussed.
State-On-Demand Execution for Adaptive Component-based Mobile Agent Systems
Authors: Yuk Chow, Wenzhang Zhu, Cho-Li Wang, Francis C. M. Lau
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

The introduction of mobile code in the pervasive computingenvironment provides a good opportunity for research inways to enhance execution flexibility. We note that currentmobile code is too heavyweight and not adaptive enough tobe used in pervasive computing where devices are resource-limitedand heterogeneity is the norm. In this paper, we proposea new lightweight, component-based mobile agent systemthat can adapt to diverse devices and features resourcesaving as one of its aims. The system supports strong mobilityof mobile code, which is a prerequisite for achieving systemflexibility and good performance. The system discretizethe transmission of code and execution states and relies on ascheme called state-on-demand (SOD) for the execution ofthe mobile code. We provide performance results to demonstratethe effectiveness of the SOD scheme.
Flow Feature Extraction in Oceanographic Visualization
Authors: Da Guo, Constantinos Evangelinos, Nicholas M. Patrikalakis
Venue: Proceedings of the Computer Graphics International (2004)

This paper presents a novel method to detect an importantflow feature, vortices, in the ocean. Our method candetect closed streamlines around vortex cores. Coupledwith existing vortex core detection, the entire vortex area,which is the combination of the vortex core and surroundingstreamlines, can be detected. A variety of feature extractionmethods are presented, and those more pertinent tothis study are implemented. Detection results are evaluatedin terms of accuracy, clarity and usability.
An approach to high-level debugging of distributed systems: preliminary draft
Authors: Peter Bates, Jack C. Wileden
Venue: ACM SIGPLAN Notices (1983)

As part of a study of methods and strategies for problem solving in a distributed environment [Less80], we have been investigating techniques suitable for use in debugging programs written for implementation on distributed processing networks. Traditional debugging methods emphasize techniques that apply at the level of computation units and generally allow users to examine, and possibly alter, the state of a computation. Interactive debugging monitors are probably the most powerful implementations of the traditional method and usually permit a user to examine an entire snspshot of system state at any step of the computation. It is the job of the debugger (usually a person directing the error search) to determine what units are relevant to some problem, examine the units in whatever fashion is available, and then fit the results of these examinations into a model of how the computation works. Two elements essential to the successful completion of the debugging task are evident here: the ability to <underline>monitor</underline>, in some meaningful way, the relevant system activity so as to understand how system behavior differs from the debugger's model, and the ability to perform <underline>experiments</underline> based (implicitly or explicitly) on the information gathered. Through the interaction of these two elements a debugger attempts to gain an understanding of the causes of an error or at least to note where the implementation and the expected behavior differ.
Using discrete uniformity property in a mixed algebraic method
Authors: C. Conti, R. Morandi, D. Scaramelli
Venue: Applied Numerical Mathematics (2004)

Given a mixed algebraic method based on a transfinite Hermite-type interpolant scheme and on a B-spline tensor product method (see [C. Conti, R. Morandi, D. Scaramelli, An automatic control point choice in algebraic numerical grid generation, in: J. Levesly, I.J. Anderson, J.C. Mason (Eds.), Proceedings of Algorithms for Approximation IV, 2002, pp. 2-8] and references quoted therein), in this paper the choice of the B-spline knots and of the control points used in the tensor product is discussed. Both choices are performed by taking into account a discrete "uniformity" property.
Automatic application-specific instruction-set extensions under microarchitectural constraints
Authors: Kubilay Atasu, Laura Pozzi, Paolo Ienne
Venue: International Journal of Parallel Programming (2003)

This paper presents a methodology for automatically designing Instruction-Set Extensions in embedded processors. Many commercially available CPUs now offer the possibility of extending their instruction set for a specific application. Their tool chains typically support manual experimentations, but algorithms that can define the set of customised functional units most beneficial for a given applications are missing. Only a few algorithms exist but are severely limited in the type and size of operation clusters they can choose and hence reduce significantly the effectiveness of specialisation. A more general algorithm is presented here which selects maximal-speedup convex subgraphs of the application data-flow graph under fundamental microarchitectural constraints, and which improves significantly on the state of the art.
A Valuable Resource of Programmers Using .NET Technology
Authors: Helen Karatza
Venue: IEEE Distributed Systems Online (2004)

A review of "Distributed .NET Programming in VB .NET" by Tom Barnaby
Haptic interaction with fluid media
Authors: William Baxter, Ming C. Lin
Venue: Proceedings of Graphics Interface 2004 (2004)

We present a method for integrating force feedback with interactive fluid simulation. We use the method described to generate haptic display of an incompressible Navier-Stokes fluid simulation. The force feedback calculation is based on the equations of fluid motion, and enables us to generate forces as well as torques for use with haptic devices capable of delivering torque. In addition, we adapt our fluid-haptic feedback method for use in a painting application that is based on fluid simulation, enabling the artist to feel the paint. Finally we describe a force filtering technique to reduce the artifacts that result from using 60Hz simulation data to drive the 1KHz haptic servo loop, a situation which often arises in practice.
Languages for representing software specifications and designs
Authors: William E. Riddle, Jack C. Wileden
Venue: ACM SIGSOFT Software Engineering Notes (1978)

We consider the nature of software system specifications and designs, then survey the languages used in representing them. We emphasize the utility of language-based representations as a foundation for computerized tools which provide aid during software system development. The survey is based upon a classification of the languages according to their underlying representational constructs.
Protocol for Dynamic Self-Adaptive Coupling in Component-Based Distributed Systems
Authors: Petre Dini, Cosmin Dini, Manuela Popescu, Andrew Harvey
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Coupling has been originally defined as the measure of the strength of association established by a connection from one module to another. Most of the existing techniques and measuring coupling metrics are classified by procedural programming and object-oriented programming. Specification and management of adaptive systems pose complex problems, if the systems are not designed with the idea of "adaptability" in mind, regardless whether it is a self-adaptability or a managed adaptability (through external entities). In a component-based distributed system (architecture), component interactions are the most crucial piece of adaptability, from both (1) component interface design and (2) the nature of the component coupling. Our proposal addresses the latter issues. We introduce new concepts for coupling and propose protocol mechanisms to define, use and implement dynamic adaptive coupling. Our proposal captures coupling semantics and allows several ways to monitor and control large distributes systems.
Consistent model for the voltage and temperature dependence of the soft breakdown conduction mechanism in ultrathin gate Oxides
Authors: A. Avellán, E. Miranda, D. Schroeder, W. Krautschneider
Venue: Microelectronic Engineering (2004)

The voltage and temperature dependence of the soft breakdown conduction mechanism in ultrathin gate oxides in MOS structures was investigated. Measurements performed on p- and n-type substrate samples with different oxide thicknesses were compared, and the results analyzed within the framework of the quantum point contact model for dielectric breakdown. The model has been extended so as to include the thermal vibrations of the atoms that form the constriction's bottleneck. A new interpretation of the model parameters, in connection with the potential drops distribution, is discussed.
Upper Bound on the Length of Generalized Disjunction-Free Patterns
Authors: Marzena Kryszkiewicz
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

A number of lossless representations of frequentpatterns were proposed in recent years. Therepresentation that consists of all frequent closeditemsets and the representations based on generalizeddisjunction-free patterns or on non-derivable itemsetsare proven the most concise ones. Experiments showfurther that the latter ones are by a few orders ofmagnitude more concise (and determinable) than theformer one. As follows from experiments, therepresentations based on generalized disjunction-freepatterns are also more concise than the available in theliterature representations of frequent patterns, whichdetermine supports of patterns in an approximate way. Inthis paper, we provide an upper bound on the length ofgeneralized disjunction-free patterns. The bounddetermines the maximum number of scans of thedatabase carried out by Apriori-like algorithmsdiscovering the representations based on generalizeddisjunction-free patterns.
Introduction: Lessons Learned around the World: Key Success Factors to Enable Process Change
Authors: David Dorenbos, Annie Combelles
Venue: IEEE Software (2004)

From Chile to Sweden to Georgia to Hong Kong, for very small teams to large organizations, for basic repeatability to complex technology, the question is the same: Why isn't process change easier? The process articles in this issue demonstrate that aligning interests on a process change is hard work. But more than just facing hard work, each part of an organization's staff must share the values of process change to succeed. Company leadership must have a vision of the benefit. Development teams must see the value. Process engineers must recognize that the change will be both interactive and iterative.
Disjoint Triangles of a Cubic Line Graph
Authors: Xiao-Dong Zhang, Stanislaw Bylka
Venue: Graphs and Combinatorics (2004)

In this paper, we prove that a cubic line graph G on n vertices rather than the complete graph K4 has * vertex-disjoint triangles and the vertex independence number *. Moreover, the equitable chromatic number, acyclic chromatic number and bipartite density of G are * respectively.
Generator-based Verification
Authors: Yunshan Zhu, James H. Kukula
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

To prove system correctness, assumptions made in verifying a blockmust be cleared by verifying that the block's environment guaranteesthem. Conversely, guarantees enforced by a block may be usedas assumptions for its environment. Block level interface specificationsthus serve as both assumptions and guarantees in compositionalverification. Traditionally, such specifications have beenrepresented as monitors or checkers. In this paper, we propose analternative representation using generators. Novel algorithms arepresented for simulation and formal verification. We argue that forsimulation, representation as a generator can be more efficient thanas a checker - both asymptotically and practically. We also identifya subset of generators that can be efficiently handled using formaltechniques. Experimental results are given for some benchmarkexamples and industrial case studies.
Wavelength Assignment on Bounded Degree Trees of Rings
Authors: Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

A fundamental problem in computer and communicationnetworks is the wavelength assignment (WA) problem:given a set of routing paths on a network, assign wavelengths(channels) to the paths such that the paths with thesame wavelength are edge-disjoint. The optimization problemhere is to minimize the number of wavelengths. A popularnetwork topology is a tree of rings. It is known NP-hardto find the minimum number of wavelengths for theWA problem on a tree of rings. Let L be the maximum numberof paths on any edge in the network. Then L is a lowerbound on the number of wavelengths for the WA problem.We give a polynomial time algorithm which uses at most3L wavelengths for the WA problem on a tree of rings withnode degree at most eight. This improves the previous resultof 4L. We also show that some instances of the WA problemrequire at least 3L wavelengths on a tree of rings, implyingthat the 3L upper bound is optimal for the worst caseinstances. In addition, we prove that our algorithm has approximationratios 2 and 2.5 for a tree of rings with nodedegrees at most four and six, respectively.
Reliable Distributed Network Management by Replication
Authors: Aldri L. Dos Santos, Elias P. Duarte,  Jr., Glenn M. Keeni
Venue: Journal of Network and Systems Management (2004)

This paper presents a new clustering architecture for SNMP agents that supports semi-active replication of managed objects. A cluster of agents provides fault-tolerant object functionality: replicated managed objects of a crashed agent of a given cluster may be accessed through a peer cluster. The proposed architecture is structured in three layers. The lower layer corresponds to the managed objects at the network elements. The middle layer contains management entities called clusters that monitor and replicate managed objects. The upper layer allows the definition of management clusters as well as the relationship between clusters. A practical tool was implemented and is presented. The impact of replication on network performance is evaluated as well as a probabilistic analysis of replicated object consistency.
Criticality and synchrony of fluctuations in rhythmical brain activity: pretransitional effects in epileptic patients
Authors: Roger Cerf, El Hassan El Ouasdad, Philippe Kahane
Venue: Biological Cybernetics (2004)

In extending our previous results demonstrating critical fluctuations in electropathophysiological brain activity prior to onset of partial epileptic seizures, we used once again Haken&#x2019;s approach to self-organized complex systems, which resorts to identifying an order parameter. A renormalized density in phase space and a renormalized differential density were defined and substituted for the Lerner density, which we used previously. Fluctuations in electropathophysiological activity, consisting of periods of high activity recorded from both depth and scalp electrodes in six presurgical patients, were characterized on different time scales. Extension in space of the fluctuations was characterized by observing their synchronous occurrence in different areas of the brain. By simultaneously establishing the fluctuations&#x2019; criticality, we were observing &#x201c;synchronous instabilities&#x201d;. Criticality followed from characterizing the time course of the synchronously arising fluctuations, when approaching seizure onset (i) by their slowing, for the longer-lasting ones (up to about 2 min), and (ii) by their increase in rate of production, for those of shorter duration (up to 20&#x2013;30 s). Critical behavior may be displayed in favorable cases over more than 1 h prior to seizure onset. Other effects are also described that in some cases may interfere with the simple time course of fluctuations and must be given further consideration, particularly with a view to application to seizure anticipation. Because periods of high activity are involved, any marker of increased electropathophysiological activity in the brain may, in principle, play the role of an order parameter or of an approximate order parameter, e.g., a signal&#x2019;s root-mean-square amplitude, or its excess energy content. Such markers may be put to use for the fluctuations they display or merely for their average time evolution prior to seizure onset. We compared the time evolution, prior to onset, of the excess production rate of synchronies and of the signals&#x2019; excess energy content, both averaged over signal sections of a chosen duration. In view of potential noninvasive applications, those scalp electrodes showing effects similar to the observations we made at the epileptogenic focus were identified, and the time course of their order parameters prior to seizure onset was analyzed.
A General S-Domain Hierarchical Network Reduction Algorithm
Authors: Sheldon X. -D. Tan
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

This paper presents an efficient method to reduce complexities ofa linear network in s-domain. The new method works on circuitmatrices directly and reduces the circuit complexities by eliminatingsubcircuits in a hierarchical way. The resulting admittancesin the reduced networks are kept as rational functions of s withreduced order. Some theoretical results are characterized for thepresence of common factors coming from the suppression of subcircuits.A novel common factor removal (de-cancellation) strategybased on a graph-based hierarchical subcircuit reduction processis proposed. The resulting reduction algorithm is applicableto any linear circuits in s-domain. The stability of the reduced systemis enforced by applying the Hurwitz polynomial approximation.The reduced systems can be used for fast s-domain analysisand for time domain waveform evaluation. Experimental resultson both linear analog circuits and RLC circuits, and comparisonwith SPICE in s-domain analysis are also provided.