ppxscal/embedding_network huggingface dataset:
Dynamic I/O characterization of I/O intensive scientific applications
Authors: Barbara K. Pasquale, George C. Polyzos
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

Understanding the characteristic I/O behavior of scientific applications is an integral part of the research and development efforts for the improvement of high performance I/O systems. This study focuses on application level I/O behavior with respect to both static and dynamic characteristics. We observed the San Diego Supercomputer Center's Cray C90 workload and isolated the most I/O intensive applications. The combination of a low-level description of physical resource usage and the high-level functional composition of applications and scientific disciplines for this set reveals the major sources of I/O demand in the workload. We selected two applications from the I/O intensive set and performed a detailed analysis of their dynamic I/O behavior. These applications exhibited a high degree of regularity in their I/O activity over time and their characteristic I/O behaviors can be precisely described by one and two, respectively, recurring sequences of data accesses and computation periods. Key Words: empirical I/O behavior, supercomputer applications
Statically Scanning Java Code: Finding Security Vulnerabilities
Authors: John Viega, Gary McGraw, Tom Mutdosch, Edward W. Felten
Venue: IEEE Software (2000)

Developers and users require some degree of assurance in their applications' security vulnerabilities. The authors have designed a prototype tool, Jslint, to help programmers automatically use existing security knowledge.
On Idempotence and Related Requirements in Edge Detection
Authors: C. Ronse
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

The energy feature detectors described by R. Owens et al. (1989) are good candidates for idempotent edge detectors. However, some of them (in particular, the Gabor energy feature detector) suffer from a serious defect that is absent in gradient-type operators: their sensitivity to gray-level shift in the original image. This leads to errors in the localization of step edges. The Fourier phase and amplitude conditions outlined by M.C. Morrone and D.C. Burr (1988) for the class of energy feature detectors guarantee a zero DC level when the convolution masks are taken in L/sup 1/; therefore, the resulting energy feature detector is invariant under grey-level shift in the original image. Also, the properties of the underlying edge model are invariant under a smoothing of the image by a Gaussian or any function in L/sup 1/ having zero Fourier phase. In particular, such a smoothing does not deteriorate the idempotence of the edge detector. Some concrete examples of energy feature detectors satisfying the Morrone conditions are described.
A Fail-Safe Interlocking System for Railways
Authors: Vinod Chandra, M. R. Verma
Venue: IEEE Design Test (1991)

A new approach to the design of microprocessor-based failsafe systems for railways that was used to design the FIRM architecture is described. The approach involves assigning appropriate levels of safety to system functions, depending on how critical they are, instead of using the same safety standard for all functions. The FIRM (short for failsafe interlocking system for railways using microprocessors) architecture uses a pair of processors that operate in a see-saw mode, with one or more pairs kept on standby. The installation and testing of an engineering prototype of the architecture that was fabricated for Indian Railways are discussed.
The Implementation of POSTGRES
Authors: M. Stonebraker, L. A. Rowe, M. Hirohama
Venue: IEEE Transactions on Knowledge and Data Engineering (1990)

The design and implementation decisions made for the three-dimensional data manager POSTGRES are discussed. Attention is restricted to the DBMS backend functions. The POSTGRES data model and query language, the rules system, the storage system, the POSTGRES implementation and the current status and performance are discussed.
Managing Complexity in a Distributed Digital Library
Authors: Ian H. Witten, Rodger J. McNab, Steve Jones, Mark Apperley, David Bainbridge, Sally Jo Cunningham
Venue: Computer (1999)

As the capabilities of distributed digital libraries increase, managing organizational and software complexity becomes a key issue. How can collections and indexes be updated without impacting queries currently in progress? How can the system handle several user-interface clients for the same collections? Computer science professors and lectors from the University of Waikato have developed a software structure that successfully manages this complexity in the New Zealand Digital Library. This digital library has been a success in managing organizational and software complexity. The researchers' primary goal has been to minimize the effort required to keep the system operational and yet continue to expand its offerings.
SmartArrays for the APL programmer
Authors: James A. Brown, James G. Wheeler
Venue: ACM SIGAPL APL Quote Quad (2002)

The SmartArrays Software Develop Kit (SDK) is a technology that provides APL-style multi-dimensional nested array operations in traditional languages like C++ and Java. Using the syntax of the host language, SmartArrays provides a multi-dimensional array class with methods which include the traditional APL array operations but which are augmented with many additional methods. This paper shows use of the SmartArrays SDK by example and compares it to traditional APL.
Computer-Aided Design of Fault-Tolerant VLSI Systems
Authors: Ramesh Karri, Karin Hogstedt, Alex Orailoglu
Venue: IEEE Design Test (1996)

An ever increasing demand for affordable on-chip fault-tolerance, the inherent unreliability attendant upon very large scale integration (VLSI), and the overwhelming complexity of fault-tolerance have elevated the automatic design of fault-tolerant VLSI systems into a research problem of immediate practical relevance. In this paper, we will outline (i) a flexible methodology for compiling an algorithmic description into an equivalent fault-tolerant VLSI IC subject to an application specific policy for fault-tolerance and (ii) a framework that embodies this methodology. The framework subsumes algorithms for synthesizing self-recovering, fault-secure, and reliable VLSI ICs from high-level algorithmic descriptions.
What's Ahead for Embedded Software?
Authors: Edward A. Lee
Venue: Computer (2000)

Most of today's gadgets and cars use embedded software, which in many cases has taken over what mechanical and dedicated electronic systems used to do. Indeed, embedded software appears in everything from telephones and pagers to systems for medical diagnostics, climate control, and manufacturing. The author believes that research computer scientists have largely ignored embedded software because it has not been sufficiently complex or general to warrant the effort. There are many re-search questions but most center around one issue: how to reconcile a set of domainspecific requirements with the demands of interaction in the physical world. How do you adapt software abstractions designed merely to transform data to meet requirements like realtime constraints, concurrency, and stringent safety considerations? The answer to this question has given rise to some promising research angles discussed in this article, including novel ways to deal with concurrency and real time, and methods for augmenting component interfaces to promote safety and adaptability.
Faster SAT and smaller BDDs via common function structure
Authors: Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponential in the worst-case, the structure of real-world instances is a natural source of improvements. While SAT and BDD techniques are often presented as mutually exclusive alternatives, our work points out that both can be improved via the use of the same structural properties of instances. Our proposed methods are based on efficient problem partitioning and can be easily applied as pre-processing with arbitrary SAT solvers and BDD packages without source code modifications.Finding a better variable-ordering is a well recognized problem for both SAT solvers and BDD packages. Currently, all leading edge variable-ordering algorithms are dynamic, in the sense that they are invoked many times in the course of the "host" algorithm that solves SAT or manipulates BDDs. Examples include the DLCS ordering for SAT solvers and variable-sifting during BDD manipulations. In this work we propose a universal variable-ordering MINCE (MIN Cut Etc.) that pre-processes a given Boolean formula in CNF. MINCE is completely independent from target algorithms and outperforms both DLCS for SAT and variable sifting for BDDs. We argue that MINCE tends to capture structural properties of Boolean functions arising from real-world applications. Our contribution is validated on the ISCAS circuits and the DIMACS benchmarks. Empirically, our technique often outperforms existing techniques by a factor of two or more. Our results motivate search for stronger dynamic ordering heuristics and combined static/dynamic techniques.
Describing Database Objects in a Concept Language Environment
Authors: Alessandro Artale, Francesca Cesarini, Giovanni Soda
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

In this paper, we formally investigate the structural similarities and differences existing between object database models and concept languages establishing a correspondence between the two environments. Object Databases Models deal with two kinds of data: individual objects, which have an identity, and values, which can be basic values or can have complex structures containing both basic values and objects. Concept Languages only deal with individual objects. The correspondence points out the different role played by objects and values in both approaches and defines a way of properly mapping database descriptions into concept language descriptions at both a terminological and assertional level. Once the mapping is achieved, object databases can take advantage of both the algorithms and the results concerning their complexity developed in concept languages.
Architectural Styles, Design Patterns, and Objects
Authors: Robert T. Monroe, Andrew Kompanek, Ralph Melton, David Garlan
Venue: IEEE Software (1997)

This article shows the relationship between software architecture and object-oriented design, and shows that neither of them subsume the other because they address different (if overlapping) issues and use different abstraction mechanisms. The authors also argue that architectural styles and design patterns are complementary mechanisms for encapsulating design expertise, and that architectural styles are probably more directly comparable to object-oriented methodologies than to patterns.
A Fast VLSI-Efficient Self-Routing Permutation Network
Authors: Jose A. B. Fortes, Hasan Cam
Venue: IEEE Transactions on Computers (1995)

A multistage self-routing permutation network is presented. This network is constructed from concentrators and digit-controlled $2 \times 4$ switches. A destination-tag routing scheme is used to realize any arbitrary permutation. The network has $O(log^2\ N)$ gate-delay and uses $O(N^2)$ VLSI-area, where N is the number of inputs.1 Assuming packet-switching is used for message transmission, the delay and VLSI-area of the network are smaller than those of any self-routing permutation network presented to date.
Channel waveguides fabricated in 2D photonic crystals of Si nanopillars
Authors: Tetsuya Tada, Vladimir V. Poborchii, Toshihiko Kanayama
Venue: Microelectronic Engineering (2002)

Two-dimensional photonic crystal (PC) slabs were fabricated by arranging Si nanopillars into square lattices with period of 490 nm. The fabrication process of nanopillars used iron clusters as nuclei for self-formation of etching masks to obtain high-aspect-ratio structures. The PC slabs were embedded in grooves (1.2 µm deep × 200 µm wide × 4 mm long), sandwiched between the two silver layers whose refractive index is less than 1 for light confinement. Two kinds of line defects, a missing row of pillars and a reduced-diameter-pillar row, were introduced into the PC. The photonic band gap (PBG) was clearly observed in transmittance spectra for wavelength λ of 900-1000 nm. In the PBG, a sharp peak corresponding to the defect mode was observed at λ = 935 nm, which indicates the line defect acted as an optical waveguide.
Design of mixed IIR/FIR Two-channel QMF bank
Authors: Abdesselam Klouche-Djedid
Venue: Signal Processing (2002)

A general family of mixed IIR/FIR two-channel QMF filter banks (FB) with near perfect reconstruction (NPR) is presented. The design method is general in the sense that all possible distortions (aliasing, imaging, amplitude and phase distortions) can be simultaneously and arbitrarily minimised. In addition, variants of the method allow for a total removal of aliasing, imaging and/or phase distortions. The perfect or approximate linear phase property of analysis and synthesis filters could be easily incorporated during the design procedure. The method is based on a simple algorithm, also included, to approximate unstable all-pole filters with FIR filters. The resulting FB is efficient because a polyphase implementation is possible and delay is low compared to conventional FIR filter banks; also, the proposed approach offers a trade-off between savings of delay and/or computational cost and accuracy of FB reconstruction. It is also shown that some well-known two-channel FIR and IIR FBs are particular classes of the proposed one. Moreover, the filter bank has a natural two-dimensional extension resulting in efficient diamond-shaped frequency support NPR FBs. Examples illustrating these claims and showing an application to image compression are included.
Guest Editors' Introduction: Defect-Oriented Testing in the Deep-Submicron Era
Authors: Jaume Segura, Peter Maxwell
Venue: IEEE Design Test (2002)

CMOS IC scaling increases device/interconnect density to allow more logic on a die athigher clock rates,enhancing overall performance. Improvements in process technologyenable integration on a single die of circuits with different functions that require distinct manufacturing process steps. With added constraints of reduced time to market, the complexity ofCMOS ICs has grown steadily during the past few decades. Shortened development times requireshorter design, verification,and manufacturing cycles, as well as more ef .cient and accurate test and debugging methods. Despite impressive trends in the microelectronic industry,deep-submicron technologies--especially below 0.18 micron--face several important test-technology challenges. This special issue presents five articles that address some of these challenges.
Two-Handed Spatial Interface Tools for Neurosurgical Planning
Authors: John C. Goble, Ken Hinckley, Randy Pausch, John W. Snell, Neal F. Kassell
Venue: Computer (1995)

The authors' computer-based neurosurgical planning system, Netra, incorporates a 3D user interface based on the two-handed physical manipulation of handheld tools in free space. These user-interface props help transfer the neurosurgeon's skills for manipulating tools to operating a user interface for visualizing 3D medical images. From the surgeon's perspective, the interface is analogous to holding a miniature head in one hand. This head can be "sliced open" or pointed to via a cross-sectioning plane or a stylus tool, respectively, held in the other hand. The authors' informal evaluations of over 50 neurosurgeons have shown that with a cursory introduction, surgeons can understand and use the interface within about one minute of touching the props. The system is intended for clinical use by neurosurgeons doing real work. The authors have tested it in the context of surgical procedures involving real patients. In fact, various components of Netra have been used for approximately 40 patients in clinical cases involving epilepsy, brain tumors, or neurological-based motor disorders. Initial experiences indicate that technology-based systems such as Netra can significantly contribute to the surgical management of patients with certain neurological diseases.
Software Metrics: Good, Bad and Missing
Venue: Computer (1994)

The software industry is an embarrassment when it comes to measurement and metrics. Many software managers and practitioners, including tenured academics in software engineering and computer science, seem to know little or nothing about these topics. Many of the measurements found in the software literature are not used with enough precision to replicate the author's findings-a canon of scientific writing in other fields. Several of the most widely used software metrics have been proved unworkable, yet they continue to show up in books, encyclopedias, and refereed journals. So long as these invalid metrics are used carelessly, there can be no true software engineering, only a kind of amateurish craft that uses rough approximations instead of precise measurement. The paper considers three significant and widely used software metrics that are invalid under various conditions: lines of code or LOC metrics, software science or Halstead metrics, and the cost-per-defect metric. Fortunately, two metrics that actually generate useful information-complexity metrics and function-point metrics-are growing in use and importance.
Numerical solution for linear-quadratic control problems of Markov jump linear systems and weak detectability concept
Authors: J. B. R. Do Val, E. F. Costa
Venue: Journal of Optimization Theory and Applications (2002)

A method for solving the linear-quadratic problem of Markov jump linear systems is developed in this paper, relying on the assumption of weak detectability. The concept of weak detectability generalizes previous concepts relevant to this class of systems, and most importantly, it allows us to revisit the quadratic control problem. In the main result of the paper, we show that, for weakly detectable systems, the solution obtained with the new method converges to the solution of the coupled algebraic Riccati equation that arises in the control problem if and only if the system is mean-square stabilizable. The paper shows how the concepts and the method involved are applied by means of numerical examples and comparisons.
A Data Structure for Circular String Analysis and Visualization
Authors: D. P. Mehta, S. Sahni
Venue: IEEE Transactions on Computers (1993)

A csdawg for circular strings, which is obtained by making simple modifications to the compact symmetric directed acyclic word graph (csdawg) for linear strings, is proposed. This data structure does not contain extraneous vertices and, consequently, avoids the disadvantages of previous methods. Using this method, algorithms which make use of the csdawg for linear strings can then be extended to circular strings with trivial modifications. The extended algorithms continue to have the same time and space complexities. Moreover, the extensions take the form of postprocessing or preprocessing steps which are simple to add on to a system built for linear strings, particularly in an object-oriented language.
Automated Production of an On-line Laboratory Reference Manual from a Laboratory Information System
Authors: Sterling T. Bennett, Dale A. Kern
Venue: Journal of Medical Systems (2002)

Laboratories provide information beyond test results, including information related to patient preparation, specimen collection and handling, test methodology, test availability, and interpretation of results. Most laboratories publish reference manuals to distribute this information to clients, while relying on the laboratory information system to provide this information to laboratory staff. Maintaining duplicate sources of information is expensive and error-prone, and printed materials become rapidly outdated. We developed a process to automate the production of a web-based reference manual directly from the laboratory information system, using a combination of MUMPS programs and HTML templates. We now focus our resources to assure that the laboratory information system database is accurate and complete, and then with minimal additional effort or expense produce an up-to-date on-line reference manual. We are therefore able to provide better sources of information in a sustainable manner.
Hardware Support for Interprocess Communication
Authors: U. Ramachandran, M. Solomon, M. K. Vernon
Venue: IEEE Transactions on Parallel and Distributed Systems (1990)

The use of a special-purpose coprocessor for supporting message passing is proposed. An actual message-based operating system is partitioned into computation and communication parts, executing, respectively, on a host and a message coprocessor which interact through shared queues. Its performance is measured on a multiprocessor. Hardware support in the form of a special-purpose smart bus and smart shared memory is designed. The benefits of these components are demonstrated through analytical modeling using generalized timed Petri nets. The analysis shows good agreement with experimental results and indicates that substantial benefits may be obtained when the software is partitioned between host and the message coprocessor and when a small amount of special-purpose hardware is added.
Cell-projection of cyclic meshes
Authors: Martin Kraus, Thomas Ertl
Venue: Proceedings of the conference on Visualization '01 (2001)

We present the first algorithm that employs hardware-accelerated cell-projection for direct volume rendering of cyclic meshes, i.e., meshes with visibility cycles. The visibility sorting of a cyclic mesh is performed by an extended topological sorting, which computes and isolates visibility cycles. Measured sorting times are comparable to previously published algorithms, which are, however, restricted to acyclic meshes. In practice, our algorithm is also useful for acyclic meshes as numerical instabilities can lead to false visibility cycles.Our method includes a simple, hardware-assisted algorithm based on image compositing that renders visibility cycles correctly. For tetrahedral meshes this algorithm allows us to render each tetrahedral cell (whether it is part of a cycle or not) by hardware-accelerated cell-projection. In its basic form our method applies only to convex cyclic meshes; however, we present an exact and a simpler but inexact extension of our method for nonconvex meshes.