ppxscal/embedding_network huggingface dataset:
Discrete Interval Truth Values Logic and Its Application
Authors: Noboru Takagi, Kyoichi Nakashima
Venue: IEEE Transactions on Computers (2000)

In this paper, we focus on functions defined on a special subset of the power set of $\left\{0, 1, \ldots, r-1\right\}$ (the elements in the subset will be called discrete interval truth values) and operations on the truth values. The operations discussed in this paper will be called regular because they are one of the extensions of the regularity, which was first introduced by Kleene in his ternary logic. Mukaidono investigated some properties of ternary functions which can be represented by the regular operations. He called such ternary functions ¿regular ternary logic functions.¿ Regular ternary logic functions are useful for representing and analyzing ambiguities such as transient states and/or initial states in binary logic circuits that Boolean functions cannot cope with. Furthermore, they are also applied to studies of fail-safe systems for binary logic circuits. In this paper, we will discuss an extension of regular ternary logic functions to functions on the discrete interval truth values. First, we will suggest an extension of the regularity, in the sense of Kleene, into operations on the discrete interval truth values. We will then present some mathematical properties of functions on the discrete interval truth values consisting of regular operations and one application of these functions.
Model reduction for DC solution of large nonlinear circuits
Authors: Emad Gad, Michel Nakhla
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

A new algorithm based on model reduction using Krylov subspace technique is proposed to compute the DC solution of large nonlinear circuits. The proposed method combines continuation methods with model reduction techniques. Thus it enables the application of the continuation methods to an equivalent reduced-order set of nonlinear equations instead of the original system. This results in a significant reduction in the computational expense as the size of the reduced equations is much less than that of the original system.The reduced order system is obtained by projecting the set of nonlinear equations, whose solution represents the DC operating point, into a subspace of a much lower dimension. It is also shown that the both the reduced-order system and the original system share the first q derivatives w.r.t. the circuit variable used to parameterize the family of the solution trajectories generated by the continuation method.
Probabilistic Analysis of An Infeasible-Interior-Point Algorithm for Linear Programming
Authors: Kurt M. Anstreicher, Jun Ji, Florian A. Potra, Yinyu Ye
Venue: Mathematics of Operations Research (1999)

We consider an infeasible-interior-point algorithm, endowed with a finite termination scheme, applied to random linear programs generated according to a model of Todd. Such problems have degenerate optimal solutions, and possess no feasible starting point. We use no information regarding an optimal solution in the initialization of the algorithm. Our main result is that the expected number of iterations before termination with an exact optimal solution is O(n ln(n)).
A case for data-driven testing
Authors: Tony Greening, Glenn Stevens, David Stratton
Venue: ACM SIGCSE Bulletin (2000)

This paper describes a novel approach to the on-line assessment of large groups of students, in which it may be desirable to maintain common questions between the groups. It is clear from the literature that computer based assessment has the potential to dramatically reduce the effort involved in testing and marking however problems arise where the cohort of students is larger than the number of available computers. However, the opposite situation is often true in practice, due to the perceived need to design multiple tests. The solution described here uses a small computer laboratory (20 machines) to administer a test to a series of groups of students in existing lab sessions. Each group receives the same set of questions but the data to which the questions apply, and hence the test answers, vary from group to group. The data from tests that have been applied to students is analysed to determine whether discussions with early candidates have influenced the performance of students in later testing sessions.
Probabilities for having a new fold on the basis of a map of all protein sequences
Authors: Elon Portugaly, Michal Linial
Venue: Proceedings of the fourth annual international conference on Computational molecular biology (2000)

It is a major problem in the study of protein structure to predict which proteins have new, currently unknown structural folds. In an attempt to address this problem we studied the location of all proteins with solved structures within the map of all known protein sequences provided by ProtoMap. The mutual distances in this map among solved structures are used to derive a probabilistic model from which we infer an estimate for the probability of an unsolved protein to have a new fold. The probabilities were based on data from SCOP release 1.37. The results were evaluated against the more recent SCOP pre-release 1.41. Our predicted probabilities for unsolved proteins to have a new fold are very well correlated with the proportion of new folds among recently released structures. Thus, information about the structure of proteins can be inferred from a global relational view of protein sequences. Finally, the same procedure was applied to estimate probabilities on the basis of SCOP 1.41. A list of the highest scoring proteins is provided: These are about 80 non-membranous proteins that belong to clusters with more than 5 proteins and achieve the highest probability to have a new fold. A rational selection for 3D determination of those targets is expected to accelerate the pace of new fold discovery.
Lapped textures
Authors: Emil Praun, Adam Finkelstein, Hugues Hoppe
Venue: Proceedings of the 27th annual conference on Computer graphics and interactive techniques (2000)

We present for creating texture over an surface mesh using an example 2D texture. The approach is to identify interesting regions (texture patches) in the 2D example, and to repeatedly paste them onto the surface until it is completely covered. We call such a collection of overlapping patches a lapped texture. It is rendered using compositing operations, either into a traditional global texture map during a preprocess, or directly with the surface at runtime. The runtime compositing approach avoids resampling artifacts and drastically reduces texture memory requirements. Through a simple interface, the user specifies a tangential vector field over the surface, providing local control over the texture scale, and for anisotropic textures, the orientation. To paste a texture patch onto the surface, a surface patch is grown and parametrized over texture space. Specifically, we optimize the parametrization of each surface patch such that the tangential vector field aligns everywhere with the standard frame of the texture patch. We show that this optimization is solved efficiently as a sparse linear system.
MOBILE: user-centered interface building
Authors: Angel R. Puerta, Eric Cheng, Tunhow Ou, Justin Min
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

Interfhce builders are popular tools for designing and developing graphical user interfaces. These tools, however, are engineering-centered; they operate mainly on windows and widgets. A typical interface builder does not offer any specific support for user-centered interface design, a methodology recognized as critical for effective user interface design. We present MOBILE (Model-Based Inter xx Layout Editor) an interface building tool that iidly supports user-centered design and that guides the htafhce building process by using user-task models and a knowledge base of interface design guidelines. The approach in MOBILE has the important added benefit of being useful in both top-down and bottom-up interface design strategies.
Complexes of Directed Graphs
Authors: Anders Björner, Volkmar Welker
Venue: SIAM Journal on Discrete Mathematics (1999)

Let P be a monotone property of directed graphs on n vertices, and let $\Delta_n^{P}$ denote the abstract simplicial complex whose simplices are the edge sets of graphs having property P. We prove the following: If "P = acyclic,'' then $\Delta_n^{P}$ is homotopy equivalent to the (n-2)-sphere. If "P = not strongly connected,'' then $\Delta_n^{P}$ has the homotopy type of a wedge of (n-1)! spheres of dimension 2n-4. The lattice of all posets on {1,2,...,n} plays an important role in the analysis. We also discuss some other properties of directed graphs from this point of view.
Evaluating the performance of distributed architectures for information retrieval using a variety of workloads
Authors: Brendon Cahoon, Kathryn S. McKinley, Zhihong Lu
Venue: ACM Transactions on Information Systems (TOIS) (2000)

The information explosion across the Internet and elswhere offers access to an increasing number of document collections. In order for users to effectively access these collections, information retrieval (IR) systems must provide coordinated, concurrent, and distributed access. In this article, we explore how to achieve scalable performance in a distributed system for collection sizes ranging from 1GB to 128GB. We implement a fully functional distributed IR system based on a multithreaded version of the Inquery simulation model. We measure performance as a function of system parameters such as client command rate, number of document collections, ter ms per query, query term frequency, number of answers returned, and command mixture. Our results show that it is important to model both query and document commands because the heterogeneity of commands significantly impacts performance. Based on our results, we recommend simple changes to the prototype and evaluate the changes using the simulator. Because of the significant resource demands of information retrieval, it is not difficult to generate workloads that overwhelm system resources regardless of the architecture. However under some realistic workloads, we demonstrate system organizations for which response time gracefully degrades as the workload increases and performance scales with the number of processors. This scalable architecture includes a surprisingly small number of brokers through which a large number of clients and servers communicate.
Changing IS curriculum and methods of instruction
Authors: Marian Kuraś, Mariusz Grabowski, Agnieszka Zając
Venue: ACM SIGCSE Bulletin (1999)

The paper presents problems of teaching information systems at school of management. Authors drew from observations in Polish and western schools of management and literature. Suggestions in respect to rules for new curriculum design are given in the paper. The results of investigations are presented in conclusions with recommendations.
Animating explosions
Authors: Gary D. Yngve, James F. O'Brien, Jessica K. Hodgins
Venue: Proceedings of the 27th annual conference on Computer graphics and interactive techniques (2000)

In this paper, we introduce techniques for animating explosions and their effects. The primary effect of an explosion is a disturbance that causes a shock wave to propagate through the surrounding medium. The disturbance determines the behavior of nearly all other secondary effects seen in explosion. We simulate the propagation of an explosion through the surrounding air using a computational fluid dynamics model based on the equations for compressible, viscous flow. To model the numerically stable formation of shocks along blast wave fronts, we employ an integration method that can handle steep pressure gradients without introducing inappropriate damping. The system includes two-way coupling between solid objects and surrounding fluid. Using this technique, we can generate a variety of effects including shaped explosive charges, a projectile propelled from a chamber by an explosion, and objects damaged by a blast. With appropriate rendering techniques, our explosion model can be used to create such visual effects as fireballs, dust clouds, and the refraction of light caused by a blast wave.
A micro-power mixed signal IC for battery-operated burglar alarm systems
Authors: Silvio Bolliri, Paolo Porcu, Luigi Raffo
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

The design of the standard CMOS IC core of a commercial wireless burglar alarm system is presented as an example of a very low-power analog VLSI design for battery-operated systems. The main constraint is battery life, which must be at least five years (with standard camera-battery). The chip is composed of a digital (decision) part and an analog interface with sensors. The entire chip absorbs 10&mgr;A. Measures on each single component and test on working environment show full functionality and complied with specifications. Even though the example is application specific, the design solutions and each single element can also be utilized in many other battery-operated low-frequency devices (e.g. environmental parameter monitoring).
Experimenting with tail-recursion and simulating coroutines
Authors: Gyorgy E. Revesz
Venue: ACM SIGCSE Bulletin (1998)

The efficiency of tail recursion and the simplicity of its removal makes some people wonder why we cannot transform all recursive definitions to this form? Clearly, the usual trick of introducing a new variable and using it as an accumulator to hold the intermediate results during the winding phase does not always work. But, by trying to generalize this technique to primitive recursion one can easily find a sufficient condition which makes it work. The class of functions satisfying this condition may be interesting also on its own. A direct generalization of this function class for mutual recursion is fairly straightforward.
Oracle PL/SQL language pocket reference
Authors: Steven Feuerstein, Bill Pribyl, Chip Dawes
Venue:  (1999)

This pocket reference provides quick-reference information that will help you use Oracle's PL/SQL language. It is a companion to Steven Feuerstein and Bill Pribyl's bestselling book, Oracle PL/SQL Programming, and includes coverage of the latest version of Oracle, Oracle8i. Oracle is the most popular database management system in use today, and PL/SQL plays a pivotal role in current and projected Oracle products and applications. PL/SQL provides procedural extensions to the SQL relational database language and to an ever-growing number of Oracle development tools. It offers a myriad of data types, and such features as cursors, loops, conditional and sequential control statements, exception handlers, records, tables, and constructs for developing modular code (functions, procedures, and packages). Originally a rather limited tool, PL/SQL became with Oracle7 a mature and effective language for developers. Now, with the introduction of Oracle8, PL/SQL has taken the next step towards becoming a fully realized programming language providing sophisticated object-oriented capabilities. The book on which this pocket reference is based, Oracle PL/SQL Programming, filled a huge gap in the Oracle market, providing developers with a single, comprehensive guide to building applications with PL/SQL -- and building them the right way. That book has become the bible for PL/SQL developers who have raved about its completeness, readability, and practicality. The book is packed with strategies, code architectures, tips, techniques, and fully realized code. The second edition of the book updated the text with the new Oracle8 PL/SQL features, including object types, collections, external procedures, and large object data types and functions. The pocket reference boils down the most vital information from the large (nearly 1000 pages) book into an accessible quick reference that summarizes the basics of PL/SQL -- its block structure, fundamental language elements (e.g., identifiers, declarations, defaults), data structures (including Oracle8 objects), and statements for program control, loops, exception handling, and database access. It also covers the the basics of using Oracle's procedures, functions, and packages, and the latest features for Oracle8i.
A multimedia presentation algebra
Authors: S. Adali, M. L. Sapino, V. S. Subrahmanian
Venue: Proceedings of the 1999 ACM SIGMOD international conference on Management of data (1999)

Over the last few years, there has been a tremendous increase in the number of interactive multimedia presentations prepared by different individuals and organizations. In this paper, we present an algebra for querying multimedia presentation databases. In contrast to the relational algebra, an algebra for interactive multimedia presentations must operate on trees whose branches reflect different possible playouts of a family of presentations. The query language supports selection type operations for locating objects and presentation paths that are of interest to the user, join type operations for combining presentations from multiple databases into a single presentation, and finally set theoretic operations for comparing different databases. The algebra operations can be used to locate presentations with specific properties and also for creating new presentations by borrowing different components from existing ones. We prove a host of equivalence results for queries in this algebra which may be used to build query optimizers for interactive presentation databases.
Efficient, distributed data placement strategies for storage area networks (extended abstract)
Authors: André Brinkmann, Kay Salzwedel, Christian Scheideler
Venue: Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures (2000)

In the last couple of years a dramatic growth of enterprise data storage capacity can be observed. As a result, new strategies have been sought that allow servers and storage being centralized to better manage the explosion of data and the overall cost of ownership. Nowadays, a common approach is to combine storage devices into a dedicated network that is connected to LANs and/or servers. Such networks are usually called storage area networks (SAN). A very important aspect for these networks is scalability. If a SAN undergoes changes (for instance, due to insertions or removals of disks), it may be necessary to replace data in order to allow an efficient use of the system. To keep the influence of data replacements on the performance of the SAN small, this should be done as efficiently as possible. In this paper, we investigate the problem of evenly distributing and efficiently locating data in dynamically changing SANs. We consider two scenarios: (1) all disks have the same capacity, and (2) the capacities of the disks are allowed to be arbitrary. For both scenarios, we present placement strategies capable of locating blocks efficiently and that are able to quickly adjust the data placement to insertions or removals of disks or data blocks. Furthermore, we study how the performance of our placement strategies changes if we allow to waste a certain amount of capacity of the disks.
A New Approach to Computer Guidance in Orthopedic Surgery Using Real Time Volume Rendering
Authors: U. C. Liener, C. Reinhart, L. Kinzl, F. Gebhard
Venue: Journal of Medical Systems (1999)

The purpose of this paper was to evaluate the ability of a new real time volume rendering system using raw unprocessed CT data on a four processor Pentium&reg; PC. A CT data set of the pelvic area was used to demonstrate the systems ability to integrate and visualize both data from a CT scan and a tracking system. The computer system consisted of a four processor Pentium&reg; PC and the software tool VGInsight (Volume Graphics GmbH). For study purposes in a laboratory setting a magnetic tracking system (Polemus&reg; Inc.) was used to simulate tracked surgical tools. With this new software tool and the tracking system the exact relative location of a tracked instrument within all structures of the pelvic area, soft tissue as well as bone, could be displayed in 3D and real time without preprocessing of the data set. Until recently real time volume rendering required expensive workstations. With a new software tool on a four processor Pentium&reg; PC the authors were able to introduce a 3D real time processed data supply to the surgeon.
An object-oriented data framework for virtual environments with hierarchical modeling
Authors: Zhu Xiaoguang, Wang Dongmu, Hong Bingrong
Venue: ACM SIGSOFT Software Engineering Notes (1999)

Virtual reality technology, which is cyberspace composed of multimedia, is a field of comprehensive technology. It is of three basic feathers, namely, interaction, immersion and imagination so that we have to cope with the need for extremely large data sets, massive amounts of computation, and high-throughput networking. This paper presents an approach for object-oriented data modeling framework of complicated virtual environments. The paper discusses the hierarchical decomposition of objects in virtual environments and reuse of these object data libraries to constitute model of virtual environments. This modeling approach used in the paper makes sure that modeling data can be inherited, modularized, maintained easily so as to control redundant data and reduce the software development time, at the same time, realizes dynamic behaviors of objects to meet the needs of some changes of virtual environments.
An ada-based object-oriented modeling language
Authors: Guilan Dai, Baowen Xu
Venue: ACM SIGPLAN Notices (1999)

This paper describes an Ada-based object-oriented modeling language AML which is suitable to model large software systems. AML takes a unique and innovative approach to integrate the object-oriented Ada95-like syntax with formal methods in a modeling language. In the paper, the design philosophies of the language are firstly discussed. Secondly AML fundamental constructs and their inherent relations are analyzed. Thirdly the related work is briefly discussed and the main characteristics of the language are summarized. Finally, an AML program for the elevator control system has been given partly to demonstrate the capability and to illustrate the use of AML.
Numerical Evaluation of an Energy Relaxation Method for Inviscid Real Fluids
Authors: Arun In
Venue: SIAM Journal on Scientific Computing (1999)

We consider finite volume methods for the Euler equations of a real fluid with a general pressure law. We present some numerical tests concerning an energy relaxation method proposed by Coquel and Perthame [ SIAM J. Numer. Anal., 35 (1998), pp. 2223--2249]. We use some particular equations of state for which classical methods can be used. This allows to compare the results obtained with the classical methods and the energy relaxation method.
Symplectic Integration with Processing: A General Study
Authors: S. Blanes, F. Casas, J. Ros
Venue: SIAM Journal on Scientific Computing (1999)

The number of conditions to be satisfied by the operators K and P in symplectic integrators with processing, given by ePe-hKe-P, is determined for a Hamiltonian of the form $H={\cal A}+{\cal B}$. The conditions for $K$ are explicitly written up to order six and used to obtain more efficient methods with fewer evaluations per step than other symplectic integrators. Special cases in which the number of conditions for the kernel is drastically reduced are also studied. It is shown that the kernel completely determines the optimal method one can obtain by processing.
Vive le Customer!
Authors: Yoram Har-Lev
Venue: International Journal of Network Management (1996)

A call for vendors&rsquo; obligation for controlling their products