ppxscal/embedding_network huggingface dataset:
On the convergence of high resolution methods with multiple time scales for hyperbolic conservation laws
Authors: Robert Kirby
Venue: Mathematics of Computation (2003)

A class of finite volume methods based on standard high resolution schemes, but which allows spatially varying time steps, is described and analyzed. A maximum principle and the TVD property are verified for general advective flux, extending the previous theoretical work on local time stepping methods. Moreover, an entropy condition is verified which, with sufficient limiting, guarantees convergence to the entropy solution for convex flux.
Near-Horn Prolog
Authors: W D Loveland
Venue:  (1987)

We propose an extension to Prolog that handles clause sets that are Horn and almost-Horn in a manner that emphasizes clarity, efficiency, and minimal deviation from standard Prolog. Although one version of near-Horn Prolog is complete under appropriate search strategies, we focus on incomplete variants that allow fast processing. Negation in the program is handled correctly, although within a positive implication logic extension of Horn logic. Processing speed degradation is directly proportional to the distance the program is from a Horn clause set.
Fresh Flash: New Design Ideas In Macromedia Flash MX, 1 edition
Authors: Jim Armstrong, Ty Lettau, Lifaros, Danny Franzreb
Venue:  (2002)

:This book brings together some of the hottest Flash designers around to answer these questions. The results they have produced are diverse, exciting and inspiring.
Implementations and experimental studies of dynamic graph algorithms
Authors: Christos D. Zaroliagis
Venue: Experimental algorithmics: from algorithm design to robust and efficient software (2002)

Dynamic graph algorithms have been extensively studied in the last two decades due to their wide applicability in many contexts. Recently, several implementations and experimental studies have been conducted investigating the practical merits of fundamental techniques and algorithms. In most cases, these algorithms required sophisticated engineering and fine-tuning to be turned into efficient implementations. In this paper, we survey several implementations along with their experimental studies for dynamic problems on undirected and directed graphs. The former case includes dynamic connectivity, dynamic minimum spanning trees, and the sparsification technique. The latter case includes dynamic transitive closure and dynamic shortest paths. We also discuss the design and implementation of a software library for dynamic graph algorithms.
A Fault Model for Fault Injection Analysis of Dynamic UML Dynamic Specifications
Authors: Alaa Ibrahim, Hanry H. Ammar, Sherif M. Yacoub
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

Verification and validation tasks, as applied to software specifications, enable early detection of analysis and design flaws prior to implementation.Several fault injection techniques for software Verification and validtion are proposed at the code level.In this work, we address verification and validation analysis methods based on fault injection at the software specification level. We present a fault model and a fault injection process for UML dynamic specifications. We use a case study based on a cardiac pacemaker for illustrating the developed approach.
Towards a taxonomy of virtual reality user interfaces
Authors: M. K. D. Coomans, H. J. P. Timmermans
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

Virtual reality based user interfaces (VRUIs) are expected to bring about a revolution in computing. VR can potentially communicate large amounts of data in an easily understandable format. VR looks very promising, but it is still a very new interface technology for which very little application oriented knowledge is available. As a basis for such a future VRUI design theory, a taxonomy of VRUIs is required. A general model of human computer communication is formulated. This model constitutes a frame for the integration of partial taxonomies of human computer interaction that are found in the literature. The whole model constitutes a general user interface taxonomy. The field of VRUIs is described and delimited with respect to this taxonomy.
Integrated Inductors Modeling and Tools for Automatic Selection and Layout Generation
Authors: Javier del Pino, Antonio Hernández, Javier Hernández, Jaime Aguilera, Andrés García-Alonso
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

In this work we propose new equivalent circuit models for integrated inductors based on the conventional lumped element model. Automatic tools to assist the designers in selecting and automatically laying-out integrated inductors are also reported. Model development is based on measurements taken from more than 100 integrated spiral inductors designed and fabricated in a standard silicon process. We demonstrate the capacity of the proposed models to accurately predict the integrated inductor behavior in a wider frequency range than the conventional model. Our equations are coded in an set of tools that requests the desired inductance value at a determined frequency and gives back the geometry of the better inductors available in a particular technology.
Creating Applications with Mozilla
Authors: David Boswell, Brian King, Eric Murphy, Ian Oescheger, Pete Collins
Venue:  (2002)

:Mozilla is not just a browser. Mozilla provides a framework that allows developers to create cross-platform applications by utilizing its accessible components, including JavaScript, CSS (Cascading Style Sheets), and Mozilla's XUL (XML-based User-interface Language), as well as the Gecko rendering engine, XBL (eXtensible Binding Language), and XPCOM (Mozilla's component model). Imagine the innovative applications you can create, such as a text editor, chat client, or MP3 player, by using a combination of easy-to-understand technologies. Creating Applications with Mozilla provides step-by-step information about how you can create your own programs using Mozilla's powerful cross-platform development framework. After you understand the basic workings of the Mozilla building blocks, you'll create a simple "Hello World" application and progress to the point of adding more advanced features and functionality to your programs. Working through the book, the first several chapters serve as an introduction to the Mozilla development environment and impart the knowledge necessary to quickly learn to create simple programs. After obtaining the initial satisfaction of developing your own applications, you'll be ready to branch into topics on modular development and other advanced subjects. In order for you to be able to build more complex applications, the second half of the book explores UI enhancements, localization, datasources, and remote distribution.
Induction of Schemata For Program Synthesis
Authors: Lynn N Tinkham
Venue:  (1990)

The observation that beginning students appear to learn program patterns by seeing groups of specific, similar programs suggests the automatic programming technique of construction program schemata by generalization from programs and then using those schemata in the synthesis of future programs. For example, after one has seen several programs involving recursion on the tail of a list, one might remember this recursive pattern and use it on the next list-processing problem. We consider, then, two problems: 1) Given a set of programs, find a schema which is a generalization of every program in that set; 2) Given a schema and a set of examples and counterexamples of the desired input/output behavior of a target program, find a program which is a specialization of that schema and whose input/output behavior matches the given set of examples. We present a method for finding schemata from a set of programs, and we show that these schemata may be used to improve the efficiency of program synthesis. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Program Generator for Object-Based Implementation of Communication Protocol Software
Authors: Chung-Shyan Liu
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

In this paper, a program generator for communication protocol software will be presented. Our program generator takes an extended finite state machine as a domain model and generates a group of C++ classes needed for an implementation. For each state of the FSM, a C++ class is generated, where the interface events are implemented as member functions of the corresponding state object. PDUs are embedded as Message objects and specified in the same way as packet filter and is interpreted to generate necessary PDU definition statements and PDU manipulation statements. Also, protocol objects from different layers can be linked together by using an organization model, where a protocol entity is invoked by its upper layer entity or lower layer entity by member function calls. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Online Prediction Algorithms for Databases and Operating Systems
Authors: P. Krishnan
Venue:  (1995)

In making online decisions, computer systems are inherently trying to predict future events. Typical decision problems in computer systems translate to three prediction scenarios: predicting {\em what\/} event is going to happen in the future, {\em when\/} a specific event will take place, or {\em how much\/} of something is going to happen. In this thesis, we develop practical algorithms for specific instances of these three prediction scenarios, and prove the goodness of our algorithms via analytical and experimental methods. We study each of the three prediction scenarios via motivating systems problems. The problem of {\em prefetching\/} requires a prediction of which page is going to be next requested by a user. The problem of {\em disk spindown in mobile machines}, modeled by the {\em rent-to-buy\/} framework, requires an estimate of when the next disk access is going to happen. Query optimizers choose a database access strategy by predicting or estimating {\em selectivity}, i.e., by estimating the size of a query result. We analyze the novel idea of using data compression techniques for prediction, and investigate the similarities and differences between the different prediction scenarios. We show the theoretical optimality and practical merit of prefetchers based on data compressors, study predictive and adaptive disk spindown strategies, and develop methods for estimating alphanumeric selectivity in relational databases. In each of our prediction algorithms, we cope with the stringent limits on the storage and time available to do prediction that are imposed by system environments. We conclude that good and practical predictors can be obtained from data compressors. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A hybrid approach to knowledge discovery from military health systems
Authors: Dursun Delen, Satheesh Ramachandran
Venue: Neural, Parallel Scientific Computations (2003)

In this paper we present the up-to-now results of a federally funded research project that aims to develop a hybrid knowledge discovery framework which would support the excavation of valuable information from military health systems data repositories in order to deliver useful knowledge to patients, medical practitioners and policy planners. Across the military health system, medical data is being generated at a staggering rate. Effective ways to discover useful knowledge from these enormous volumes of data would be extremely valuable in making a significant difference in military healthcare systems. In many data rich environments (including private and public health care systems), data mining and its enabling technologies are emerging as a powerful means for researchers, practitioners, and consumers to more effectively gain and use knowledge. The challenge lies in finding new and innovative ways to deal with the increasing volume and complexity of medical data and thereby improve our understanding of disease and health related issues. So far in this project, we established the foundation for a knowledge discovery framework that has potential to overcome those challenges, developed a set of deployable data mining components, and implemented an integrated toolkit that maps those data mining components into the proposed framework.
A multiagent-system for integrating a large-scale project
Authors: Carlos Eisenberg, Boi Faltings, Lars Leistam
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper presents a multiagent-system for integrating ALICE: a real-life, distributed, large-scale particle physics experiment of the LHC project at CERN.The work is concerned with solving the large-scale coordination problem using a distributed constraint satisfaction algorithm. We believe that until now, no such algorithm has successfully handled problems of this size. The developed algorithm is a local search algorithm, based on the distributed breakout algorithm and is extended by an incremental problem solving scheme combined with a variable ordering heuristic. By benchmark results we show the algorithm performs extremely well and outperforms the standard version by orders of magnitude.In addition, we develop a constraint based project planning ontology for the knowledge exchange amongst the ALICE subproject agents. By using domain variables and constraints for information exchange, ambiguities due to cultural differences are eliminated.
Quasi-Planar Graphs Have a Linear Number of Edges
Authors: K P Agarwal, Boris Aronov, Janos Pach, Pollack,  R, Micha Sharir
Venue:  (1995)

A graph is called {\em quasi-planar\/} if it can be drawn in the plane so that no three of its edges are pairwise crossing. It is shown that the maximum number of edges of a quasi-planar graph with $n$ vertices is $O(n)$.
Cross-Feature Analysis for Detecting Ad-Hoc Routing Anomalies
Authors: Yi-an Huang, Wei Fan, Wenke Lee, Philip S. Yu
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

With the proliferation of wireless devices, mobile ad-hocnetworking (MANET) has become a very exciting and importanttechnology. However, MANET is more vulnerablethan wired networking. Existing security mechanisms designedfor wired networks have to be redesigned in this newenvironment. In this paper, we discuss the problem of intrusiondetection in MANET. The focus of our research is ontechniques for automatically constructing anomaly detectionmodels that are capable of detecting new (or unseen)attacks. We introduce a new data mining method that performs"cross-feature analysis" to capture the inter-featurecorrelation patterns in normal traffic. These patterns can beused as normal profiles to detect deviation (or anomalies)caused by attacks. We have implemented our method on afew well known ad-hoc routing protocols, namely, DynamicSource Routing (DSR) and Ad-hoc On-Demand DistanceVector (AODV), and have conducted extensive experimentson the ns-2 simulator. The results show that the anomalydetection models automatically computed using our datamining method can effectively detect anomalies caused bytypical routing intrusions.
Local buckling, post-buckling and mode interaction finite element analyses in cold-formed steel members
Authors: K. Nagahama, D. Camotim, E. Batista
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The paper presents, discusses and illustrates the application of an unified approach to the use of FEM analyses to investigate the local buckling (linear stability), post-buckling and mode interaction behaviour of cold-formed steel thin-walled members, both in the elastic and elastic-plastic ranges. After briefly addressing a number of relevant modelling and numerical implementation issues, the efficiency of the FEM to handle the above problems is assessed by investigating several aspects concerning the non linear behaviour of rack section members. All the numerical results displayed here have been obtained through analyses performed by using the commercial FEM code ABAQUS and adopting 4-node shell finite elements to discretise the members. Such results consist of (i) elastic critical stress values and buckling mode shapes and (ii) elastic and elastic-plastic equilibrium paths, which (ii1) describe the member local-plate and distortional post-buckling behaviours and, if necessary, (ii2) take into account the influence of the interaction between these two local buckling modes. In order to validate the FEM results, some of them are compared with values available in the literature, most of which yielded by finite strip analyses.
A multi-agent system for the quantitative simulation of biological networks
Authors: Salim Khan, Ravi Makkena, Foster McGeary Keith Decker, William Gillis, Carl Schmidt
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We apply the multi-agent system (MAS) platform to the task of biological network simulation. In this paper, we describe the simulation of signal transduction (ST) networks using the DECAF [9] MAS architecture. Unlike previous approaches that relied on systems of differential equations (DE), the distributed framework of MAS scales well and allows us to model large, highly interconnected ST pathways. This scalability is achieved by adopting a hybrid strategy that factors macro-level measures, such as reaction rateconstants, to calculate the stochastic kinetics at the level of individual molecules. Thus, by capturing the ST domain at an intermediate level of abstraction, we are able to retain much of the granularity afforded by a purely individual-based approach. The task distribution within a MAS enables us to model certain physical properies, such as diffusion and subcellular compartmentalization, which have proven to be difficult for DE systems. We demonstrate that large-grained agents are well suited to maintaining interal state representations and efficient in computing reactant concentration, both of which are vital considerations in modeling the ST domain. In our system, a molecular species is modeled as an individual agent with hierarchical task network structures to represent self- and externally-initiated reactions. An agent's identity is determined by a rule file (one for every participating molecular species) that specifies the reactions it may participate in, as well as its initial concentration. Reactions within the system are actuated by inter-agent communication. We present results from modeling the well-studied epidermal growth factor (EGF) pathway, demonstrating the viability of MAS technologies as a simulation platform for biological networks.
Implementation of Multiple-Valued Functions Using Literal-Splitting Technique
Authors: Elena Dubrova
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

One of the main practical problems of implementingmultiple-valued logic circuits is reduced noise margins. Inthis paper we show that this problem can be avoided byimplementing multiple-valued functions using the followingtechnique. First, the input domain of an m-valued n-variablefunction f is partitioned into m m-valued inputbinary-valued output characteristic functions. Then, eachof these functions is treated as a function of n · m binaryvariables, representing the literals of the variables of f. Thefact that any multiple-valued function can be implementedthat way is known. The main contribution of this paper is toshow a technology, for which this type of implementation isnatural and results in no hardware overhead.
Circular drawings of rooted trees
Authors: Guy Melancon, Ivan Herman
Venue:  (1998)

We describe an algorithm producing circular layouts for trees, that is drawings, where subtrees of a node lie within circles, and these circles are themselves placed on the circumference of a circle. The complexity and methodology of our algorithm compares to Reingold and Tilford''s algorithm for trees. Moreover, the algorithm naturally admits distortion transformations of the layout. This, added to its low complexity, makes it very well suited to be used in an interactive environment.
Quantitative Evaluation of Capture-Recapture Models to Control Software Inspections
Authors: Lionel C. Briand, Khaled El Emam, Bernd Freimut, Oliver
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

An important requirement to control the inspection of software artifacts is to be able to decide, based on objective information, whether inspection can stop or whether it should continue to achieve a suitable level of artifact quality. Several studies in software engineering have considered the use of capture-recapture models to predict the number of remaining defects in an inspected document as a decision criterion about reinspection. However, no study on software engineering artifacts compares the actual number of remaining defects to the one predicted by a capture-recapture model. Simulations have been performed but no definite conclusions can be drawn regarding the degree of accuracy of such models under realistic inspection conditions, and the factors affecting this accuracy. Furthermore, none of these studies performed an exhaustive comparison of existing models. In this study, we focus on traditional inspections and estimate, based on actual inspections' data, the degree of accuracy of all relevant, state-of-the-art, capture-recapture models for which statistical estimators exist. We compare the various models' accuracies and look at the impact of the number of inspectors on these accuracies. Results show that models' accuracies are strongly affected by the number of inspectors and, therefore, one must consider this factor before using capture-recapture models. When the number of inspectors is below 4, no model is sufficiently accurate and underestimation may be substantial. In addition, some models perform better than others in a large number of conditions and plausible reasons are discussed. Based on our analyses, we recommend using a model taking into account that defects have different probabilities of being detected and a corresponding Jackknife estimator.
Solution of Definite Quadratic Programming Problems
Authors: Gregory D Shubert
Venue:  (1978)

A algorithm for solving the definite quadratic programming problem is presented. An implementation of this algorithm in FORTRAN is discussed. Numerical tests of this algorithm and a similar one not using the positive definiteness property show the former to be more stable. This algorithm is paarticularly suited for numerical methods for solving general nonlinear programming problems or minimax problems. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player