ppxscal/embedding_network huggingface dataset:
Event Reconstruction in High-Energy Physics
Authors: Frank J. Rinaldo, Matthew R. Fausey
Venue: Computer (1993)

Cooperative Processes Software (CPS), a parallel programming toolkit developed at Fermilab for processing CPU-intensive experimental data in the area of high-energy physics, is described. CPS allows physicists to solve computationally intensive problems on a collection of reduced-instruction-set-computer (RISC) workstations that work in parallel to provide solutions within a reasonable time frame. This mode of parallel processing provides a cost effective and easily scalable solution to CPU-bound computational problems that can be classified as large grained and loosely coupled. The performance of CPS on a typical experiment of Fermilab, which has 1000 to 2000 8 mm tapes of raw event data that needs to be reconstructed, is discussed.
Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set
Authors: Jochen Harant, Zdenek Ryjácek, Ingo Schiermeyer
Venue: Discrete Mathematics (2002)

The well-known greedy algorithm MIN for finding a maximal independent set in a graph G is based on recursively removing the closed neighborhood of a vertex which has (in the currently existing graph) minimum degree. We give a forbidden induced subgraph condition under which algorithm MIN always results in finding a maximum independent set of G, and hence yields the exact value of the independence number of G in polynomial time.
A computational steering model applied to problems in medicine
Authors: Christopher R. Johnson, Steven G. Parker
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

We describe a computational steering model which allows users to interactively change boundary conditions, model geometry, and computational parameters via a graphical user interface. To replace the typical simulation mode -- in which the researcher manually sets input parameters, computes results, stores data off to disk, visualizes the results via a separate visualization package, then starts again at the beginning -- we have designed software to "close the loop" and allow the visualization to help guide (steer) the design and computation phases of the simulation. We have applied the computational steering model to problems in medicine, specifically to applications in bioelectric field phenomena and biomedical device design.
Negligible Electromagnetic Interaction Between Medical Electronic Equipment and 2.4 GHz Band Wireless LAN
Authors: Eisuke Hanada, Yasushi Hoshino, Hiroshi Oyama, Yoshiaki Watanabe, Yoshiaki Nose
Venue: Journal of Medical Systems (2002)

Wireless LANs using radio waves have recently gained popularity for installation in hospitals. Because electromagnetic waves transmitted from mobile telephones have been shown to cause interference with medical electronic equipment, prudence would seem necessary when introducing radio wave communication devices into hospitals. Therefore, we tested the effect of wireless LAN communication on medical electronic equipment and the effect of electronic equipment on wireless LAN communication. We observed nine pieces of electronic equipment in the operating mode while transmitting radio waves from a wireless LAN. Even when the access point was put very close to the medical electronic equipment surface and data was transmitted, no malfunction of the equipment was observed. The medical electronic equipment caused little change in the effectiveness of the communication device, although radio waves emitted from electric knives and a remote patient monitor reduced the reception rate to about 60%. The communication speed of the wireless LAN was temporarily reduced only when a microwave oven was located close to and facing the access point. Because output in Japan is limited to a maximum of 10 mW, wireless LAN following the IEEE802.11b standard should be able to be installed safely in Japanese hospitals. However, wireless LAN access points should not be installed near microwave ovens.
Analyzing Outliers Cautiously
Authors: X. Liu, G. Cheng, J. X. Wu
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Outliers are difficult to handle because some of them can be measurement errors, while others may represent phenomena of interest, something significant from the viewpoint of the application domain. Statistical and computational methods have been proposed to detect outliers, but further analysis of outliers requires much relevant domain knowledge. In our previous work, we suggested a knowledge-based method for distinguishing between the measurement errors and phenomena of interest by modeling real measurements ¿how measurements should be distributed in an application domain. In this paper, we make this distinction by modeling measurement errors instead. This is a cautious approach to outlier analysis, which has been successfully applied to a medical problem and may find interesting applications in other domains such as science, engineering, finance, and economics.
Doodles and doilies, non-simple symmetric Venn diagrams
Authors: Peter Hamburger
Venue: Discrete Mathematics (2002)

In this paper, we create and implement a method to construct a non-simple, symmetric 11-Venn diagram. By doing this we answer a question of Grünbaum. Daniel Kleitman's mathematics seems to be remote from this area, but in fact, his results inspired this solution, which holds promise of settling the general case for all prime numbers, and the promise to find simple doilies with 11 and more curves as well.
Web Interaction Using Very Small Internet Devices
Authors: Bill N. Schilit, Jonathan Trevor, David M. Hilbert, Tzu Khiau Koh
Venue: Computer (2002)

Internet-enabled cell phones typically accommodate only three to 12 text lines, and their design emphasizes portability. Web interaction has, so far, been a secondary concern.For the most part, automated techniques to address the feature gap between the desktop and these phonetops rely on the notion of transducing--translating HTML and images into formats compatible with small devices, which typically cannot handle HTML content.The authors have developed a Web browsing model that supports navigation and action in separate interfaces. To demonstrate the model, they created m-Links, a middleware proxy system that retrieves Web documents using HTTP,lets users navigate and apply services to Web content, and delivers a suitable user interface to a variety of small Web-capable wireless devices.
Collaborative process patterns for e-Business
Authors: Prasad Jayaweera, Paul Johannesson, Petia Wohed
Venue: ACM SIGGROUP Bulletin (2001)

The basic notions in computer supported work coordination in e-Business are communicative, institutional, and deontic notions such as obligation, responsibility, and trust. The Language Action approach that has a significant impact within CSCW, therefore, seems to be a most promising framework for designing e-Business systems. However, the penetration of the Language Action approach in industrial practice is still limited. We discuss some reasons for this state of affairs by identifying a number of problems that hinder an effective application of the Language Action approach. We propose modeling techniques and methodological guidelines that can contribute to the solution of these problems. These techniques and guidelines are based on three building blocks: a business model describing the values exchanged in an e-Business process, a formal and executable language based on communicating state machines, and an automated designer assistant that guides a user from a business model to an executable process model.
Algorithm-Agile Encryption in ATM Networks
Authors: Thomas D. Tarman, Robert L. Hutchinson, Lyndon G. Pierson, Peter E. Sholander, Edward L. Witzke
Venue: Computer (1998)

As more users subscribe to ATM data services to support their broadband applications, ATM security devices must be employed to ensure protection against eavesdropping, impersonation, unauthorized data modification, and denial-of- service threats. Because security policies can vary according to site preference or import/export regulations, the ATM Forum's ATM Security Specification, Version 1.0, provides for the negotiation of security parameters. To increase the likelihood for successful negotiation of encryption parameters, the ATM encryptor must implement multiple algorithms. Such encryptors are called algorithm-agile encryptors. This article describes a prototype ATM encryptor that implements mechanisms for requesting an encryption algorithm, performing end-user and encryptor authentication, and exchanging encryption keys, using the ATM Forum's Security Message Exchange protocol. When used together, these mechanisms provide protection against eavesdropping and impersonation threats.
Performability Modeling with UltraSAN
Authors: Joseph A. Couvillion, Roberto Freire, Ron Johnson, W. Douglas Obal, M. Akber Qureshi, Manish Rai, William H. Sanders, Janet E. Tvedt
Venue: IEEE Software (1991)

The utility of stochastic activity networks (SANs) for performability evaluation is discussed. UltraSAN, a new graphical, X-Windows-based software package that uses SANs, is described. UltraSAN incorporates three innovations: a class of SAN-level performability variables common to both analytical and simulation solution methods, methods that use the performability-variable choice and the SAN structure to greatly reduce the size of the stochastic process required for an analytical solution, and methods that use the performability-variable choice and the SAN structure to reduce the number of activities checked on each state change, thus speeding the simulation. The UltraSAN modeling framework, organization, and user interface are examined. Model construction and solution are described.
On energy consistency of large deformation plasticity models, with application to the design of unconditionally stable time integrators
Authors: X. N. Meng, T. A. Laursen
Venue: Finite Elements in Analysis and Design (2002)

This paper addresses the concept of energy consistency of plasticity models, with the ultimate goal of designing time integrators that are unconditionally stable for large deformation, nonlinear dynamical systems. In the course of the discussion, some attention is devoted to a widely used plasticity model, which we assert has a fundamental thermodynamical problem if its flow rule is not carefully defined.
Finding Shortest Paths on Surfaces Using Level Sets Propagation
Authors: Ron Kimmel, Arnon Amir, Alfred M. Bruckstein
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

We present a new algorithm for determining minimal length paths between two regions on a three dimensional surface. The numerical implementation is based on finding equal geodesic distance contours from a given area. These contours are calculated as zero sets of a bivariate function designed to evolve so as to track the equal distance curves on the given surface. The algorithm produces all paths of minimal length between the source and destination areas on the surface given as height values on a rectangular grid.
Fast algorithm for multi-dimensional discrete Hartley transform with size ql1 × ql2 × ... × qlr
Authors: Yonghong Zeng, Guoan Bi, A. C. Kot
Venue: Signal Processing (2002)

Fast algorithms are presented for multi-dimensional discrete Hartley transform (MD-DHT) with size ql1 × ql2 ×... × qlr, where q is an odd prime number, and r > 1 is the number of dimensions. By using the multi-dimensional polynomial transform, the MD-DHT can be converted into a series of reduced one-dimensional DHT. Compared to other fast algorithms, the proposed one substantially reduces the overall computational complexity and has a simple computational structure.
The backward Mann iteration
Authors: Stefan M. Soltuz
Venue: Octogon Mathematical Magazine (2001)

We introduce the backward Mann iteration. We give a convergence result for this iteration.
What Should Your Speech System Say?
Authors: Niels Ole Bernsen, Hans Dybkjær, Laila Dybkjær
Venue: Computer (1997)

Telephone-based, spoken-language dialogue systems have been entering the market since the early 1990s. Because they provide such significant cost reductions, the market for these systems is growing rapidly. However, the designers of the dialogue these systems employ do not have a set of principles to guide them. Today's designers tend to rely on common sense, experience, intuition, and trial and error. This means they must be both very careful and very lucky, or humans will have problems interacting with the system, and development costs will rise. This article contains a comprehensive set of dialogue design guidelines. The guidelines could significantly reduce development time and cost by removing dialogue problems as early as possible in the design life cycle, mitigating the need for lengthy experimentation, controlled user testing, and field trial cycles.
WFS + Branch and Bound = Stable Models
Authors: V. s. Subrahmanian, Dana Nau, Carlo Vago
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

Though the semantics of nonmonotonic logic programming has been studied extensively, relatively little work has been done on operational aspects of these semantics. In this paper, we develop techniques to compute the well-founded model of a logic program. We describe a prototype implementation and show, based on experimental results, that our technique is more efficient than the standard alternating fixpoint computation. Subsequently, we develop techniques to compute the set of all stable models of a deductive database. These techniques first compute the well-founded semantics and then use an intelligent branch and bound strategy to compute the stable models. We report on our implementation, as well as on experiments that we have conducted on the efficiency of our approach.
An Efficient Algorithm for Sequential Circuit Test Generation
Authors: T. P. Kelsey, K. K. Saluja, S. Y. Lee
Venue: IEEE Transactions on Computers (1993)

This paper presents an efficient sequential circuit automatic test generation algorithm. The algorithm is based on PODEM and uses a nine-valued logic model. Among the novel features of the algorithm are use of Initial Timeframe Algorithm and correct implementation of a solution to the Previous State Information Problem. The Initial Timeframe Algorithm, one of the most important aspects of the test generator, determines the number of timeframes required to excite the fault for which a test is to be derived and the number of timeframes required to observe the excited fault. Correct determination of the number of timeframes in which the fault should be excited (activated) and observed saves the test generator from performing unnecessary search in the input space. Test generation is unidirectional, i.e., it is done strictly in forward time, and flip-flops in the initial timeframe are never assigned a state that needs to be justified later. The algorithm saves both the good and the faulty machine states after finding a test to aid in subsequent test generation. The Previous State Information Problem, which has often been ignored by existing test generators, is presented and discussed in the paper. Experimental results are presented to demonstrate the effectiveness of the algorithm.
Applications of Abduction: Testing Very Long Qualitative Simulations
Authors: Tim Menzies, Robert F. Cohen, Sam Waugh, Simon Goss
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

We can test a theory of "X" by checking if that theory can reproduce known behavior of "X." In the general case, this check for time-based simulations is only practical for short simulation runs. We show that, given certain reasonable language restrictions, the complexity of this check reduces to the granularity of the measurements. That is, provided a very long simulation run is only measured infrequently, this check is feasible.
Non-linear quantification scheduling in image computation
Authors: Pankaj Chauhan, Edmund M. Clarke, Somesh Jha, Jim Kukula, Tom Shiple, Helmut Veith, Dong Wang
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

Computing the set of states reachable in one step from a given set of states, i.e. image computation, is a crucial step in several symbolic verification algorithms, including model checking and reachability analysis. So far, the best methods for quantification scheduling in image computation, with a conjunctively partitioned transition relation, have been restricted to a linear schedule. This results in a loss of flexibility during image computation. We view image computation as a problem of constructing an optimal parse tree for the image set. The optimality of a parse tree is defined by the largest BDD that is encountered during the computation of the tree. We present dynamic and static versions of a new algorithm, VarScore, which exploits the flexibility offered by the parse tree approach to the image computation. We show by extensive experimentation that our techniques outperform the best known techniques so far.
Relations between squares and triangles
Authors: P. Barrucand, S. Cooper, M. Hirschhorn
Venue: Discrete Mathematics (2002)

With rk(n) denoting the number of representations of n as the sum of k squares and tk(n) the number of representations of n as the sum of k triangular numbers, we prove the relation rk(8n + k) = 2k- 1 { 2 + (k 4)} tk(n) for 1 ≤ k ≤ 7.
Handling Geometric Singularities by the Mortar Spectral Element Method I. Case of the Laplace Equation
Authors: Nejmeddine Chorfi
Venue: Journal of Scientific Computing (2003)

The solution of an elliptic partial differential equation in a polygon is generally not regular. But it can be written as a sum of a regular part and a linear combination of singular functions. The purpose of our work is the numerical analysis and the implementation of the Strang and Fix algorithm, with the mortar spectral element method. We also compute with a high accuracy the coefficient of the leading singularity.
Is Speech Recognition Becoming Mainstream?
Authors: Savitha Srinivasan, Eric Brown
Venue: Computer (2002)

Combining the Web's connectivity, wireless technology, and handheld devices with grammar-based speech recognition in a VoiceXML infrastructure may finally bring speech recognition to mass-market prominence.
High-Speed Addition in CMOS
Authors: N. T. Quach, M. J. Flynn
Venue: IEEE Transactions on Computers (1992)

A fully static complementary metal-oxide semiconductor (CMOS) implementation of a Ling-type 32-bit adder is described. The implementation saves up to one gate delay and always reduces the number of serial transistors in the worst-case critical path over the conventional carry look-ahead (CLA) approach with a negligible increaser in hardware.
Static Inspection: Tapping the Wheels of Software
Authors: Les Hatton
Venue: IEEE Software (1995)

Les Hatton, director of research and engineering for Programming Research Ltd.in the UK and a member of the British Standards Institute¿s C++ committee,has spent many years looking at how languages and their compilers cansupport software quality. Here, the author of Safer C: Developing Software forHigh¿Integrity and Safety¿Critical Systems (McGraw¿Hill, 1995) shares some of hisfindings. ¿ Shari Lawrence Pfleeger
A probabilistic constructive approach to optimization problems
Authors: Jennifer L. Wong, Farinaz Koushanfar, Seapahn Meguerdichian, Miodrag Potkonjak
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

We propose a new optimization paradigm for solving intractable combinatorial problems. The technique, named Probabilistic Constructive (PC), combines the advantages of both constructive and probabilistic algorithms. The constructive aspect provides relatively short runtime and makes the technique amenable for the inclusion of insights through heuristic rules. The probabilistic nature facilitates a flexible trade-off between runtime and the quality of solution.In addition to presenting the generic technique, we apply it to the Maximal Independent Set problem. Extensive experimentation indicates that the new approach provides very attractive trade-offs between the quality of the solution and runtime, often outperforming the best previously published approaches.
Optimal Data Placement on Disks: A Comprehensive Solution for Different Technologies
Authors: Peter Triantafillou, Stavros Christodoulakis, Costas Georgiadis
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

The problem of optimally placing data on disks (ODP) to maximize disk-access performance has long been recognized as important. Solutions to this problem have been reported for some widely available disk technologies, such as magnetic CAV and optical CLV disks. However, important new technologies such as multizoned magnetic disks, have been recently introduced. For such technologies no formal solution to the ODP problem has been reported. In this paper, we first identify the fundamental characteristics of disk-device technologies which influence the solution to the ODP problem. We develop a comprehensive solution to the problem that covers all currently available disk technologies. We show how our comprehensive solution can be reduced to the solutions for existing disk technologies, contributing thus a solution to the ODP problem for multizoned disks. Our analytical solution has been validated through simulations and through its reduction to the known solutions for particular disks. Finally, we study how the solution for multizoned disks is affected by the disk and data characteristics.
Fuzzy stage characteristic-preserving product life cycle modeling
Authors: Ping-Teng Chang
Venue: Fuzzy Sets and Systems (2002)

Stage concerns have been important in product life cycles (PLC). Such concerns are stage identification, stage-related strategies and, here newly introduced, 'stage modeling'. Stage modeling is concerned with not only modeling but also aggregation of individual stages in an overall-influencing manner. It not only preserves the respective characteristics of the stages but also may be explored for the stage-related strategy issue later. To date, this aspect of PLC modeling has not yet been explored. In this paper, a fuzzy PLC modeling capable of preserving the fuzzy individual characteristics of the stages is proposed. The various concepts such as boundary identification, fuzzy stages modeling, and stages' inter-influence functions are introduced and discussed. Finally, to illustrate and support the approach, a numerical example and a comparison with classical data-analytic procedures (segmented polynomial regression and autoregressive-integrated moving average) is provided.