ppxscal/embedding_network huggingface dataset:
Locally Determined Logic Programs and Recursive Stable Models
Authors: Douglas Cenzer, Jeffrey B. Remmel, Amy Vanderbilt
Venue: Annals of Mathematics and Artificial Intelligence (2004)

In general, the set of stable models of a recursive logic program can be quite complex. For example, it follows from results of Marek, Nerode, and Remmel [Ann. Pure and Appl. Logic (1992)] that there exists finite predicate logic programs and recursive propositional logic programs which have stable models but no hyperarithmetic stable models. In this paper, we shall define several conditions which ensure that recursive logic program P has a stable model which is of low complexity, e.g., a recursive stable model, a polynomial time stable model, or a stable model which lies in a low level of the polynomial time hierarchy.
Description logics with aggregates and concrete domains
Authors: Franz Baader, Ulrike Sattler
Venue: Information Systems (2003)

Description logics are a family of knowledge representation formalisms well suited for intentional reasoning about conceptual models of databases/data warehouses. We extend description logics with concrete domains (such as integers and rational numbers) that include aggregation functions over these domains (such as min, max, count, and sum) which are usually available in database systems. We show that the presence of aggregation functions may easily lead to undecidability of (intentional) inference problems such as satisfiability and subsumption. However, there are also extensions for which satisfiability and subsumption are decidable, and we present decision procedures for the relevant inference problems.
Aspiration-Level Adaptation in an American Financial Services Organization: A Field Study
Authors: Stephen J. Mezias, Ya-Ru Chen, Patrice R. Murphy
Venue: Management Science (2002)

Using field data from an American financial services organization, we examined the effects of three important variables in Cyert and March's (1963) initial conceptualization of the aspiration-level adaptation process: The previous aspiration level, performance feedback, and social comparison. Past findings obtained in controlled contexts (Glynn et al. 1991; Lant 1992) have provided empirical support for the attainment discrepancy model (Lewin et al. 1944), which includes variables of the previous aspiration level and attainment discrepancy (i.e., performance feedback). We replicated these findings in the field: The effects of the previous aspiration level and attainment discrepancy on the current aspiration levels were significant and positive. In addition, we investigated the effect of social comparison using a variable based on the difference between the performance of the focal unit and the performance of comparable others (Greve 1998). Based on the assumption that decision makers in organizations will expect to observe similar performance levels among those in the same comparison group (Wood 1989), we posited that the effect of social comparison would be negative, refiecting managerial efforts to reduce performance discrepancies among similar units. The empirical results supported the prediction from this reasoning. We conclude by discussing implications of our findings for theory and research in organizational learning and the behavioral theory of the firm.
A Tale of Two Cities: Case Studies of GSS Transition in Two Organizations
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

Research shows that, under certain circumstances, people using GSS can be substantially more productive than people who do not. However GSS has been slow to transition into the workplace. This paper argues that the Technology Transition Model (TTM) may be a useful way to explain this seeming paradox. The paper presents a comparison of GSS transition case studies in two organizations -- one where a self-sustaining and growing community of users emerged, and one where it did not. Following TTM, it explores the frequency with which users perceived cognitive, economic, affective, political, social, and physical value from using the system. Comparison of the cases reveals differences in perceptions of value along several of these dimensions that are consistent with TTM. The findings suggest the model may be a useful way to explain organizational change, but much more research will be required to test the model more rigorously.
Video summarization and retrieval using singular value decomposition
Authors: Yihong Gong, Xin Liu
Venue: Multimedia Systems (2003)

In this paper, we propose novel video summarization and retrieval systems based on unique properties from singular value decomposition (SVD). Through mathematical analysis, we derive the SVD properties that capture both the temporal and spatial characteristics of the input video in the singular vector space. Using these SVD properties, we are able to summarize a video by outputting a motion video summary with the user-specified length. The motion video summary aims to eliminate visual redundancies while assigning equal show time to equal amounts of visual content for the original video program. On the other hand, the same SVD properties can also be used to categorize and retrieve video shots based on their temporal and spatial characteristics. As an extended application of the derived SVD properties, we propose a system that is able to retrieve video shots according to their degrees of visual changes, color distribution uniformities, and visual similarities.
The Influence of Process Variations on the Halo MOSFETs and its Implications on the Analog Circuit performance
Authors: K. Narasimhulu, Siva G. Narendra, V. Ramgopal Rao
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Lateral Asymmetric Channel (LAC) and DoubleHalo (DH) MOSFETs have been reported to exhibitexcellent properties for mixed signal CMOS applications.In this work, the effect of process variations such as gateoxide thickness, implantation parameters, and channellength are systematically investigated on the device andanalog circuit performance for all these technologies.The performance parameters of LAC and DH differentialamplifiers and current mirror circuits are evaluated,using mixed-mode simulations, as a function of processinduced mismatch. Our simulation results on differentialamplifiers and current mirrors show that, an identical Vtmismatch in CON, DH, and LAC devices results in alower variation in the circuit parameters for LACtechnologies. It is found that, for a specified circuitparameter variation, almost a 25% higher Vt mismatch istolerable with LAC technologies as compared to theCON technologies.
Axisymmetric rigid bodies in creeping flow
Authors: J. Roumeliotis
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Many biological and industrial processes involve fluid flows in which viscosity is large and/or particle lengths are small. These flow regimes, called Stokes or creeping flows are described by the governing equations ∇p = µ∇2u, ∇ ċ u = 0, (1) where u is the velocity field, p the pressure field and µ the viscosity of an external fluid domain Ω. The most striking feature of these equations are their linearity and it is this that has been exploited over the years to develop both analytic and numerical solutions for a variety of problems.
A fair message exchange framework for distributed multi-player games
Authors: Katherine Guo, Sarit Mukherjee, Sampath Rangarajan, Sanjoy Paul
Venue: Proceedings of the 2nd workshop on Network and system support for games (2003)

This paper presents a framework for message delivery in real-time multi-player distributed interactive games that use the client-server model. Based on this framework, we propose message delivery algorithms that remove the unfair advantage that players with smaller message delays from the game server receive over players with large message delays from the server. The framework is very general in the sense that it does not require assumptions of synchronized clocks at the players and servers; neither does it require a mechanism to compute the one-way delay from the players to the server accurately. It also avoids the need for bucket synchronization that leads to messages being delayed by a fixed amount of time at the server. The framework is based on a proxy architecture that is independent of game applications.
The turing way to parameterized complexity
Authors: Marco Cesati
Venue: Journal of Computer and System Sciences (2003)

We propose a general proof technique based on the Turing machine halting problem that allows us to establish membership results for the classes W[1], W[2], and W[P]. Using this technique, we prove that Perfect Code belongs to W[1], Steiner Tree belongs to W[2], and α-Balanced Separator, Maximal Irredundant Set, and Bounded DFA Intersection belong to W[P].
Complementary replacement: a meta scheduling principle
Authors: H. Hellerman
Venue: Proceedings of the second symposium on Operating systems principles (1969)

A principle of scheduling is presented that includes a wide class of time and space allocation problems met in time sharing and virtual systems. Its essence is a method, based on symmetry, to use any of several rules for admission-to-service in a single server system to derive a space-replacement rule. This method, called complementary replacement includes several known job dispatching rules as well as some page-replacement algorithms such as the MIN and LRU (last-recently-used). A fundamental but unsolved problem with the principle is its range of applicability and the conditions under which it guarantees an optimum.
Using objects to distribute configuration management tasks
Authors: Terry Coatta
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

Distributed programming techniques have transformed applications into federations of cooperating semi-autonomous components. Complex interactions between these components create complex interdependencies which are quickly outstripping the capacity of human systems managers. Adding configuration management features to an application's components reduces the flexibility and portability of those components. The Raven Configuration Management System (RCMS) provides an environment in which configuration management is handled orthogonally to the task of programming individual components. RCMS is a mechanism for abstractly grouping related components, and it provides rules which govern their interactions. RCMS combines object-oriented structuring with declarative programming to produce a system which provides improved reliability and performance in the presence of an evolving environment. An initial version of RCMS has been completed, including a compiler and run-time support routines. Current work focuses on automation of constraint maintenance and distribution of the management workload.
Combining link-based and content-based methods for web document classification
Authors: Pável Calado, Marco Cristo, Edleno Moura, Nivio Ziviani, Berthier Ribeiro-Neto, Marcos André Gonçalves
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

This paper studies how link information can be used to improve classification results for Web collections. We evaluate four different measures of subject similarity, derived from the Web link structure, and determine how accurate they are in predicting document categories. Using a Bayesian network model, we combine these measures with the results obtained by traditional content-based classifiers. Experiments on a Web directory show that best results are achieved when links from pages outside the directory are considered. Link information alone is able to obtain gains of up to 46 points in F1, when compared to a traditional content-based classifier. The combination with content-based methods can further improve the results, but too much noise may be introduced, since the text of Web pages is a much less reliable source of information. This work provides an important insight on which measures derived from links are more appropriate to compare Web documents and how these measures can be combined with content-based algorithms to improve the effectiveness of Web classification.
A Measure for the Non-Orthogonality of a Lattice Basis
Authors: M. Seysen
Venue: Combinatorics, Probability and Computing (1999)

Let B = [b1, &hellip;, bn] (with column vectors bi) be a basis of &Ropf;n. Then L = &sum;bi&Zopf; is a lattice in &Ropf;n and A = B&#x22A4;B is the Gram matrix of B. The reciprocal lattice L&#x002A; of L has basis B&#x002A; = (B&minus;1)&#x22A4; with Gram matrix A&minus;1. For any nonsingular matrix A = (ai,j) with inverse A&minus;1 = (a&#x002A;i,j), let &tau;(A) = max1&le;i&le;n {&sum;nj =1&#x2223;ai,j &middot;a&#x002A;j,j&#x2223;}. Then &tau;(A), &tau;(A&minus;1)&ge;1 holds, with equality for an orthogonal basis. We will show that for any lattice L there is a basis with Gram matrix A such that &tau;(A), &tau;(A&minus;1) = exp (O((ln n)2)). This generalizes a result in [8] and [20].For any basis transformation A&rarr;&Amacr; with &Amacr; = T&#x22A4;AT, T = (ti,j)&isin;SLn(&Zopf;), we will show &#x2223;ti,j&#x2223;&le;&tau;(A&minus;1) &middot;&tau;(&Amacr;). This implies that every integral matrix representation of a finite group is equivalent to a representation where the coefficients of the matrices representing group elements are bounded by exp (O((ln n)2)). This new bound is considerably smaller than the known (exponential) bounds for automorphisms of Minkowski-reduced lattice bases: see, for example, [6].The quantities &tau;(A), &tau;(A&minus;1) have the following geometric interpretation. Let V(L) &ratio;= {x&isin;&Ropf;n&#x2223;&forall;&lambda;&isin;L &ratio;&#x2223;x&#x2223;&le;&#x2223;x&minus;&lambda;&#x2223;} be the Voronoi cell (also called the Dirichlet region) of the lattice L. For a basis B of L, we call C(B) = {&sum;xibi, &#x2223;xi&#x2223;&le;1&#x002F;2} the basis cell of B. Both cells define a lattice tiling of &Ropf;n (see [6]); they coincide for an orthogonal basis. For a general basis B of L with Gram matrix A we will show V(L)&le;&tau;(A&minus;1)&middot;C(B) and C(B)&le;n&middot;&tau;(A)&middot;V(L).
Combining Behavior and Data Modeling in Automated Test Case Generation
Authors: Patrick J. Schroeder, Eok Kim, Jerry Arshem, Pankaj Bolaki
Venue: Proceedings of the Third International Conference on Quality Software (2003)

Software testing plays a critical role in the process ofcreating and delivering high-quality software products.Manual software testing can be an expensive, tedious anderror-prone process, therefore testing is often automatedin an attempt to reduce its cost and improve its defectdetection capability. Model-based testing, a techniqueused in automated test case generation, is an importanttopic because it addresses the need for test suites that areof high-quality and yet, maintainable. Current model-basedtechniques often use a single model to representsystem behavior. Using a single model may restrict thenumber and type of test cases that may be generated. Inthis paper, system-level test case generation isaccomplished using two models to represent systembehavior. The results of case studies used to evaluate thistechnique indicate that for the systems studied a largerpercentage of the required test cases can be generatedusing the combined modeling approach.
MLS-PCA: A High Assurance Security Architecture for Future Avionics
Authors: Clark Weissman
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

DOD Joint Vision 2020 (JV2020) is the integratedmulti-service planning document for conduct amongcoalition forces of future warfare. It requires theconfluence of a number of key avionics technicaldevelopments: integrating the network-centric battlefield,management of hundred thousands of distributedprocessors, high assurance Multi Level Security (MLS) inthe battlefield, and low cost high assurance engineering.This paper describes the results of a study and modelingof a new security architecture, (MLS-PCA), that yields apractical solution for JV2020 based upon DARPAPolymorphic Computing Architecture (PCA) advances,and a new distributed process-level encryption scheme.The paper defines a functional model and a verifiedformal specification of MLS-PCA, for high assurance,with the constraints PCA software and hardwaremorphware must support. Also, the paper shows a viablemapping of the MLS-PCA model to the PCA hardware.MLS-PCA is designed to support upwards of 500,000CPUs predicted by Moore's law to be available circa2020. To test such speculation, the paper concludes witha description of an in-progress proof-of-conceptimplementation of MLS-PCA using a 100-node GridComputing system and an MLS distributed targetingapplication.
Concurrency Control of Real-Time Transactions with Disconnections in Mobile Computing Environment
Authors: GuoQiong Liao, Yun Sheng Liu, LiNa Wang, ChuJi Peng
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

In mobile real-time databases systems, the objects of concurrency control should take saving system resources and supporting disconnection into consideration, besides ensuring database consistency, reducing the number of expired transactions and avoiding "priority inversion". Inthe paper, a nested transaction model for mobile real-time transactions is discussed first. Then a divergence control lock model based on prudent ordered sharing and a Check-Out/Check-In protocol supporting disconnections are given. DC/POS-PAI-2PL is a two-phase lock strategy integrating these methods for mobile real-time transactions. The performances of DC/POS-PAI-2PL are d analyzed in the end. It is shown that the suggestedtransaction model and DC/POS-PAI-2PL can improve system performances.
Adapting innocent game models for the B&#x00F6;hm tree &#x03BB;-theory
Authors: Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong
Venue: Theoretical Computer Science (2003)

We present a game model of the untyped λ-calculus, with equational theory equal to the Böhm tree λ-theory B, which is universal (i.e. every element of the model is definable by some term). This answers a question of Di Gianantonio, Franco and Honsell. We build on our earlier work, which uses the methods of innocent game semantics to develop a universal model inducing the maximal consistent sensible theory H*. To our knowledge these are the first syntax-independent universal models of the untyped λ-calculus.
The Asymptotic Proportion of Subdivisions of a 2 &times; 2 Table that Result in Simpson's Paradox
Authors: Petros Hadjicostas
Venue: Combinatorics, Probability and Computing (1999)

In [1], recently published in Combinatorics, Probability and Computing, there was a typographical error. On p. 392, part (5) of Lemma 3.1, the formula should read as follows:**** Insert formula here *****References[1] Hadjicostas, P. (1998) The asymptotic proportion of subdivisions of a 2 &times; 2 table that result in Simpson's Paradox. Combinatorics, Probability and Computing 7 387&ndash;396.
The use of process clustering in distributed-system event displays
Authors: David J. Taylor
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

When debugging a distributed application, a display showing the events causing interactions between processes can be very useful. If the number of processes is large, displaying all of them may be impossible or undesirable. In such cases, several processes may be collapsed into a "cluster", with all interactions internal to the cluster omitted from the display. This paper describes the fundamental theoretical constraints on such clustering and the means for effectively displaying clusters. It also describes the particular implementation of clustering provided in a prototype debugger that allows a hierarchical cluster structure to be built and conveniently manipulated.
ROVer ranch: a 3-D learning environment for K-12
Authors: Stephanie L. Smith
Venue: ACM SIGGRAPH 2003 Educators Program (2003)

The ROVer Ranch is an online NASA project for K-12 students to learn about robotics engineering. The students assume a mission engineer's role to design, build and test a robot in a 3-D mission simulator. Students activities are structured along the lines of the scientific method as they discover the what, why and how of robotics. The activities are presented in a variety of ways so educators can use different teaching methods with their students.The ROVer Ranch is sponsored by the NASA Learning Technologies Project (LTP), which is an Internet-based distance learning initiative that combines NASA research and advanced Internet technologies to create unique science learning environments. Technologies such as streaming media, real-time interactive gaming, 3-D simulations and remote manipulation of scientific instruments are some of the methods the LTP projects use to convey science lessons and NASA research.
On Privacy-Preserving Access to Distributed Heterogeneous Healthcare Information
Authors: Claus Boyens, Ramayya Krishnan, Rema Padman
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

Regional healthcare initiatives seek to improve the quality of healthcare by collecting, analyzing, and disseminating information about chronic diseases such as diabetes. The datarequired to support such initiatives comes from several organizations such as insurers, physicians, hospitals, pharmacies and labs each of which gather and maintain data for thepurpose of healthcare delivery. Accessing data in this distributed and heterogeneous environment is difficult and has to deal with well-documented issues such as resolving semantic conflicts, multiple query languages etc. Data warehousing and mediator-basedarchitectures are often proposed and used in these settings. In this paper, we focus on mediator-based architectures and the privacy problems that arise in the healthcare context owing to the linkage of information about patients, physicians, and diseases enabled by the mediator. Current proposals for security-conscious mediators do not address inferential disclosure resulting from record linkage. In particular, we study the problem of interval inference, a specific kind of disclosure that arises when participants are able to compute tight bounds on sensitive values of other participants, based on the aggregate information published by the mediator. We illustrate our approach with a real world example and propose an "audit and aggregate" methodology that chooses the optimal level of aggregation of the data taking into account both the risk of disclosure as well as the utility of the released data to legitimate users.
Spiders: a new user interface for rotation and visualization of n-dimensional point sets
Authors: Kirk L. Duffin, William A. Barrett
Venue: Proceedings of the conference on Visualization '94 (1994)

We present a new method for creating n-dimensional rotation matrices from manipulating the projections of n-dimensional data coordinate axes onto a viewing plane. A user interface for n-dimensional rotation is implemented. The interface is shown to have no rotational hysteresis.