ppxscal/embedding_network huggingface dataset:
The HIPAA-potamus in health care data security
Authors: Rebecca T. Mercuri
Venue: Communications of the ACM (2004)

Regulations intended to improve health care data access have created new security risks along with headaches for patients and practitioners.
Sharing knowledge online (abstract only): a dream or reality?
Authors: Melanie Gnasa
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

The Web provides a global platform for knowledge sharing. However, several shortcomings still arise from the absence of personalization and collaboration in Web searches. More effective retrieval techniques could be provided by means of transforming explicit knowledge into implicit knowledge. The approach presented in this paper is based on a peer-to-peer architecture and aims at complementing classical Web searches in terms of personalized ranking lists. These local rankings can be accumulated and evaluated in order to supplement the process of knowledge generation by building Virtual Knowledge Communities. Furthermore, the aggregation of ranking lists can be used to identify topics as well as communities of interest. Together with social aspects for community support, a framework for congenial Web search is defined.
From Membership to Separation, a Simple Construction
Authors: Fran&#x00e7;ois Maurras
Venue: Combinatorica (2002)

In [3], Martin Gr&#x00f6;tschel, L&#x00e1;szl&#x00f3; Lov&#x00e1;sz and Alexander Schrijver use a construction of Dmitrii Yudin et Arkadi&#x012d; Nemirovski&#x012d; to polynomially separate a point x from a centered bounded convex K using a membership oracle. In this note, we present a natural and simple construction which solve the same problem but for the simpler case of polyhedra. Namely, given a well defined polyhedron P with a non-empty interior, a point $$x \notin P$$ and a point $$a \in \operatorname{int} {\left( P \right)}$$, using a polynomial number of calls of the membership oracle, we find a facet of P whose supporting hyperplane separates x from P.
Signed Digit CMOS (SD-CMOS) Logic Circuits with Static Operation
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

A design is proposed for a voltage-mode signeddigit CMOS (SD-CMOS) logic circuit. Theis circuitcan provide stable, static operation with amulti-voltage power supply, and it can be fabricatedby applyingwith standard CMOS process technology.Key components based on the proposed circuit design,such as a driver circuit, an inverter circuit, a generalCMOS logic circuit, and a D-F/F, are described. TheEach circuitýsý element numbers, operation speeds,and power consumption are examined from theviewpoint of system applications.
Using the structure of Web sites for automatic segmentation of tables
Authors: Kristina Lerman, Lise Getoor, Steven Minton, Craig Knoblock
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Many Web sites, especially those that dynamically generate HTML pages to display the results of a user's query, present information in the form of list or tables. Current tools that allow applications to programmatically extract this information rely heavily on user input, often in the form of labeled extracted records. The sheer size and rate of growth of the Web make any solution that relies primarily on user input is infeasible in the long term. Fortunately, many Web sites contain much explicit and implicit structure, both in layout and content, that we can exploit for the purpose of information extraction. This paper describes an approach to automatic extraction and segmentation of records from Web tables. Automatic methods do not require any user input, but rely solely on the layout and content of the Web source. Our approach relies on the common structure of many Web sites, which present information as a list or a table, with a link in each entry leading to a detail page containing additional information about that item. We describe two algorithms that use redundancies in the content of table and detail pages to aid in information extraction. The first algorithm encodes additional information provided by detail pages as constraints and finds the segmentation by solving a constraint satisfaction problem. The second algorithm uses probabilistic inference to find the record segmentation. We show how each approach can exploit the web site structure in a general, domain-independent manner, and we demonstrate the effectiveness of each algorithm on a set of twelve Web sites.
A data model for XML databases
Authors: Vilas Wuwongse, Kiyoshi Akama, Chutiporn Anutariya, Ekawit Nantajeewarawat
Venue: Journal of Intelligent Information Systems (2003)

In the proposed data model for XML databases, an XML element is directly represented as a ground (variable-free) XML expression--a generalization of an XML element by incorporation of variables for representation of implicit information and enhancement of its expressive power--while a collection of XML documents as a set of ground expressions, each describing an XML element in the documents. Axioms and relationships among elements in the collection as well as structural and integrity constraints are formalized as XML clauses. An XML database, consisting of: (i) a document collection (or an extensional database), (ii) a set of axioms and relationships (or an intensional database), (iii) a set of integrity constraints, is therefore modeled as an XML declarative description comprising a set of ground XML expressions and XML clauses. Its semantics is a set of ground XML expressions, which are explicitly described by the extensional database or implicitly derived from the database, based on the defined intensional database, and satisfy all the specified set of constraints. Thus, selective and complex queries, formulated as sets of XML clauses, about information satisfying specific criteria and possibly implicit in the database, become expressible and computable. The model thereby serves as an effective and well-founded XML database management framework with succinct representational and operational uniformity, reasoning capabilities as well as complex and deductive query supports.
Extendable Cycles in Multipartite Tournaments
Authors: Yubao Guo, Lutz Volkmann
Venue: Graphs and Combinatorics (2004)

An n-partite tournament is an orientation of a complete n-partite graph. If D is a strongly connected n-partite (n&#x2265;3) tournament, then we shall prove that every partite set of D has at least one vertex which lies on a cycle Cm of each length m for * such that V(C3)&#x2282;V(C4)&#x2282;&#x22ef;&#x2282;V(Cn), where V(Cm) is the vertex set of Cm for *. This result extends those of Bondy [2], Guo and Volkmann [4], Gutin [6], Moon [8], and Yeo [12].
On Representing Uncertain Historical Time
Authors: Kamil Matousek, Jan Uhlir
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This paper describes an intelligent approach to representing uncertainly specified time periods applicable particularly to historical content.It is based on using the operational conceptual modelling language OCML [Reusable Components for Knowledge Modeling]. An example of a temporal inconsistency in data annotated by means of temporal ontology is given that can be found using the prototype implementation of this approach.
Mixing dance realities: collaborative development of live-motion capture in a performing arts environment
Authors: W. Scott Meador, Timothy J. Rogers, Kevin O'Neal, Eric Kurt, Carol Cunningham
Venue: Computers in Entertainment (CIE) (2004)

An experimental dance performance featuring live-motion capture, real-time computer graphics, and multi-image projection was produced by a cross-departmental team of faculty and students at Purdue University. Dancers occupied and traversed performance mediums or "frames," including a virtual performance frame occupied by a 3D character, driven by a dancer in motion-capture equipment. Developing and facilitating the relationships between the dancers in various performance frames became a primary focus for the project, but other areas, e.g., creating an artistically sound and technologically seamless performance, helping the various team members collaborate, and exploring the nature of the technology, were important focus points as well.
A Single-Electron-Transistor Logic Gate Family and Its Application " Part I: Basic Components for Binary, Multiple-Valued and Mixed-Mode Logic
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

This paper presents a model-based study of SET(Single-Electron-Transistor) logic gate family for synthesizingbinary and MV (Multiple-Valued) logic circuits.The use of SETs combined with MOS transistorsallows a compact realization of basic logic functionsthat exhibit periodic transfer characteristics. These basicSET logic gates are useful for implementing binarylogic circuits, MV logic circuits and binary-MV-mixedlogic circuits in a highly .exible manner. As an example,this paper describes the design of various parallelcounters for carry-propagation-free arithmetic, whereMV signals are e.ectively used to achieve higher functionalitywith lower hardware complexity.
Show & tell
Venue: ACM SIGGRAPH 2003 video review on Electronic theater program on Electronic theater program - Volume 144 (2003)

Earl is a student in a dank Victorian schoolhouse. A bit of a misfit amongst his classmates, it is his turn to "Show & Tell". In a building crescendo of showmanship, he draws forth from his bag a barrage of items. Ms. Beeble, the Teacher, does her best to control the ensuing anarchy, but Earl gets the better of her, and has the best day of his life. Copyright held by creator.
The ANIMUS project: a framework for the creation of interactive creatures in immersed environments
Authors: Daniel Torres, Pierre Boulanger
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2003)

This paper describes the architecture of the ANIMUS framework. This framework facilitates the creation of synthetic characters that convey the illusion of being alive. The components of ANIMUS are inspired by observations made in biological organisms, and provide means for creating autonomous agents that mimic awareness of their environment, of other agents, and of human audience. They also show particular roles, personality, and emotions, active and reactive behavior, automatic reflexes, and selective attention; use temporal memory and learning capabilities to evolve in their dynamic virtual worlds, and express their thought and emotions with a flexible animation system while they interact with the user in immersive 3D environments. ANIMUS creatures follow artistic conceptual designs and constraints that determine the way they behave, react and interact with other creatures and the user, allowing the designer to create meaningful and interesting characters. The framework can be applied to complex immersive environments like CAVE systems or other interactive applications like video games and advanced man-machine interfaces, providing high level tools for creating a new generation of responsive believable agents.
Contribution to the dynamic study of humanoid robots interacting with dynamic environment
Authors: Miomir Vukobratović, Veljko Potkonjak, Aleksandar Rodić
Venue: Robotica (2004)

The questions when and why one needs to use mathematical models, and especially the models of dynamics, represent still an unresolved issue. A general answer would be that dynamic modelling is needed as a tool when designing structure of the system and its control unit. In this case we talk about simulation. The other application is in on-line control of the system &ndash; the so-called dynamic control. While in simulation one generally uses the best available model, the control can be based on a reduced dynamics, depending on a particular task. The aim of this paper was to highlight the problems important for the dynamics of humanoids and their dynamic environment.
Pessimistic Concurrency Control and Versioning to Support Database Pointers in Real-Time Databases
Authors: Dag Nystrom, Mikael Nolin, Aleksandra Tesanovic, Christer Norstrom, Jorgen Hansson
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

In this paper we present a concurrency control algorithmthat allows co-existence of soft real-time, relationaldatabase transactions, and hard real-time database pointertransactions in real-time database management systems.The algorithm uses traditional pessimistic concurrency-control(i.e. locking) for soft transactions and versioningfor hard transactions to allow them to execute regardlessof any database lock. We provide formal proof that the algorithmis deadlock free and formally verify that transactionshave atomic semantics. We also present an evaluationthat demonstrates significant benefits for both soft and hardtransactions when our algorithm is used. The proposed algorithmis suited for resource-constrained safety critical,real-time systems that have a mix of hard real-time controlapplications and soft real-time management, maintenance,or user-interface applications.
Domain Driven Software Development " A World of Transformations
Authors: Shane Sendall
Venue: Proceedings of the 15th IEEE International Workshop on Rapid System Prototyping (2004)

Software development teams are faced with bridging the gap between the problem, asenvisaged by the stakeholders and constrained by the environment, and a softwaresolution, which is built upon the abstractions offered by current softwaretechnologies. Unfortunately, too often the abstractions offered are limited anddisparate with respect to the problem space. Reducing this gap would facilitate moresophisticated problems to be tackled in software development projects, and it wouldcomparatively reduce development costs and time-to-market, and remove errorscaused by the disparity. In this talk, I will explore a number of techniques forimproving current software development practice, which relate to the theme ofdomain-driven software development.
Some problems concerning the Smarandache square complementary function (V)
Authors: Maohua Le
Venue: Smarandache Notions Journal (2004)

In this paper we discuss the convergence for two series concerning the Smarandache square complelmentary function.
SpiderWeb
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 1 - Volume 145 (2003)

For Rhythm & Hues, an animation house utilizing both proprietary and commercial software packages, the ability to freely exchange useful data between applications is essential. The options become quite liberating in a modular pipeline. Copyright held by creator.
An introduction to the DREAM software design system
Authors: William E. Riddle, John H. Sayler, Alan R. Segal, Jack C. Wileden
Venue: ACM SIGSOFT Software Engineering Notes (1977)

We describe the underlying philosophy, the system organization and the design language of the <u>D</u>esign <u>R</u>ealization <u>E</u>valuation <u>A</u>nd <u>M</u>odelling system, a prototype of a system being developed to aid software system designers.
Exploring Genomic Context Patterns for Rhodobacter Sphaeroides in the HERBE Knowledge Discovery Environment
Authors: Heidi J. Sofia, Abigail L. Corrigan, Kyle R. Klicker, George Chin, Eric G. Stephan
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Sophisticated information strategies are increasingly essential for biologists. We have built a powerful knowledge discovery resource using novel genomic context methods, interactive visualization strategies, and computational environment technologies. The Heuristic Entity Relationship Building Environment (HERBE) is a research platform for advanced database technologies that fuses data management solutions with knowledge management components to support the dynamic capture of concepts and observations as biologists explore large-scale data. The Similarity Box visualization software supports the ability of biologists to interact with large-scale computational results and evaluate relationships based on natural reasoning processes. We have applied these knowledge methods in the exploration of complex microbial genome relationships. We extracted a complete set of gene neighbor patterns for Rhodobacter sphaeroides using HERBE to map data structures for chromosomal contiguity against sequence similarity. We then organized these gene neighbor patterns by their phylogenetic profiles using Similarity Box to enable biologists to explore the results.
Fractional Cut: Improved Recursive Bisection Placement
Authors: Ameya Agnihotri, Mehmet Can YILDIZ, Ateen Khatkhate, Ajita Mathur, Satoshi Ono, Patrick H. Madden
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

In this paper, we present improvements to recursive bisection basedplacement. In contrast to prior work, our horizontal cut lines arenot restricted to row boundaries; this avoids a "narrow region"problem. To support these new cut line positions, a dynamic programmingbased legalization algorithm has been developed. Thecombination of these has improved the stability and lowered thewire lengths produced by our Feng Shui placement tool.On benchmarks derived from industry partitioning examples,our results are close to those of the annealing based tool Dragon,while taking only a fraction of the run time. On synthetic benchmarks,our wire lengths are nearly 23% better than those of Dragon.For both benchmark suites, our results are substantially better thanthose of the recursive bisection based tool Capo and the analyticplacement tool Kraftwerk.
The representation of planning strategies
Authors: Andrew S. Gordon
Venue: Artificial Intelligence (2004)

An analysis of strategies, recognizable abstract patterns of planned behavior, highlights the difference between the assumptions that people make about their own planning processes and the representational commitments made in current automated planning systems. This article describes a project to collect and represent strategies on a large scale to identify the representational components of our commonsense understanding of intentional action. Three hundred and seventy-two strategies were collected from ten different planning domains. Each was represented in a pre-formal manner designed to reveal the assumptions that these strategies make concerning the human planning process. The contents of these representations, consisting of nearly one thousand unique concepts, were then collected and organized into forty-eight groups that outline the representational requirements of strategic planning systems.
Fault Tolerance Tradeoffs in Moving from Decentralized to Centralized Embedded Systems
Authors: Jennifer Morris, Daniel Kroening, Philip Koopman
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Some safety-critical distributed embedded systems mayneed to use centralized components to achieve certaindependability properties. The difficulty in combiningcentralized and distributed architectures is achieving thepotential benefits of centralization without giving upproperties that motivated the use of a distributed approachin the first place. This paper examines the impact on faulttolerance of adding selected centralized components todistributed embedded systems, and possible approaches tochoosing an appropriate configuration. We consider theproposed use of a star topology with centralized busguardians in the Time-Triggered Architecture. We modelsystems with different levels of centralized control in theirstar couplers, and compare fault tolerance properties in thepresence of star-coupler faults. We demonstrate thatbuffering entire frames in the star coupler could lead tofailures in startup and integration. We also show thatconstraining buffer size imposes restrictions on frame sizeand clock rates.
Cubic spline elements for modelling microstructural evolution of materials controlled by solid-state diffusion and grain-boundary migration
Authors: H. N. Ch'ng, J. Pan
Venue: Journal of Computational Physics (2004)

A new set of finite element formulations are presented in this paper to model surface diffusion, grain-boundary diffusion, grain-boundary migration and their interaction. The new formulations use the classical cubic splines both to represent material interface and to act as shape functions for the migration velocity of the interface. The smoothness of the interface is enforced such that the second order derivatives of the migration velocity is continuous anywhere on the interface. This is achieved by using the cubic spline shape functions and by introducing two new Lagrange terms in the variational principle. The work presented here is a new development to the finite element scheme which was previously developed by Pan, Cocks and their co-workers [Comput. Mater. Sci. 18 (2000) 76: Comput. Mater. Sci. 1 (1993) 95; Acta Mater. 43 (1995) 1395: Proc. Roy. Soc. London A 453 (1997) 2161] for modelling microstructural evolution of materials. The cubic spline elements provide a numerically efficient alternative to the linear elements used by Pan et al. [Proc. Roy. Soc. London A 453 (1997) 2161]. The finite element formulations are verified using a series of test cases for which analytical solutions exist in the literature. A further demonstration case of the co-sintering of two particles of different sizes is provided. The new finite element scheme has made it possible to carry out computer simulations of microstructural evolution using sophisticated and more realistic material models than ever before. The over-simplifications in various existing material models can lead to incorrect predictions. This is dramatically demonstrated in a separate paper in which the finite element scheme is used to investigate the sintering behaviour of large pores [Mech. Mater. (2003)].
On non-hierachical systems of binary operators
Authors: D. J. Cooke
Venue: ACM SIGACT News (1983)

In a previous paper [3] a system was described by which context-sensitive grammars could be used to specify balanced derivations of certain expressions; such derivations corresponding in a natural way to balanced semantic trees appropriate for parallel execution. The earlier work was only applicable to expressions involving a strictly ordered hierachy of binary operators. This note shows how under certain "reasonable" algebraic constraints the method can be extended to less well-behaved situations.
Formula to obtain the next prime number in any increasing sequence of positive integer numbers
Authors: Sebastián Martín Ruiz
Venue: Smarandache Notions Journal (2004)

In this article I give a generalization of the previous formulas [1],[2],[3] to obtain the following prime number, valid for any increasing sequence of positive integer numbers in the one that we know the algebraic expression of its nth term.