ppxscal/embedding_network huggingface dataset:
Semantic Query Optimization for ODMG-93 Databases
Authors: M. F. Van Bommel
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

We present a graphical technique for semantic query optimization for ODMG-93 compliant databases. The OQL object query is represented as a graph based on the information contained in the ODL object schema.The graph reflects the constraints on possible objects satisfying the query. Vertices represent objects, which may be members of interfaces, ranges of values, constant values, objects returned by subqueries, object collections (count, sum, etc.), or constructs (sets, lists, etc). Key constraints and inverse relationships contained in the schema are used to perform join elimination, join simplification, and scan reduction via graph transformations. A marking scheme on the graph is used to perform subquery to join transformations and the detection of unnecessary duplication elimination.We argue that our approach generalizes previous research on object-based query optimization by providing a more natural representation of the query allowing simpler, more intuitive transformations, and leading to more efficient evaluation plans.
On the Use of Annotations for Integrating the Source in a Program Development Environment
Authors: Steven P. Reiss
Venue:  (1991)

A central problem in building a program development system is how to integrate the various tools so that the user sees a single view. This integration involves providing a common user interface to the tools, providing a backbone within the program development system that allows the tools to communicate with each other, and providing consistent access to the program for the user. In this paper we examine the use of annotations and an editor that supports annotations as a means for providing common access to the program source for a variety of tools within an open program development system. We show that annotations provide a convenient and consistent way of relating tool output to to the source and of initiating commands in the different tools based on the source. We do this by presenting our approach to annotation editing and examining several of the design issues that arose during its development.
Agent-based simulation of animal behaviour
Authors: Catholijn M. Jonker, Jan Treur
Venue:  (1998)

In this paper it is shown how animal behaviour can be simulated in an agent-based manner. Different models are shown for different types of behaviour, varying from purely reactive behaviour to pro-active, social and adaptive behaviour. The compositional development method for multi-agent systems DESIRE and its software environment supports the conceptual and detailed design, and execution of these models. Experiments reported in the literature on animal behaviour have been simulated for a number of agent models.
Microsoft Asp.Net Programming with Microsoft Visual Basic .Net Deluxe Learning Edition
Authors: G. Andrew Duthie, Microsoft Corporation
Venue:  (2002)

:Teach yourself how to build Web applications and services for Microsoft .NET-with tools and instruction, straight from the source! In a single, economical package, this deluxe learning edition delivers Microsoft's popular Step by Step tutorial for Microsoft ASP.NET along with fully supported, standard-edition software for the Microsoft Visual Basic .NET development system. Featuring instruction and examples focused on Visual Basic-based programming, this Step by Step book enables you to work at your own pace-and apply your learning to real Visual Basic .NET software, not a simulation. It's everything you need to build the skills and knowledge for developing .NET-ready Web applications and Web services, right now.
Refinement for Fault-Tolerance: An Aircraft Hand-off Protocol
Authors: Keith Marzullo, Fred B. Schneider, Jon Dehn
Venue:  (1994)

Part of the Advanced Automation System (AAS) for air-traffic control is a protocol to permit flight hand-off from one air-traffic controller to another. The protocol must be fault-tolerant and, therefore, is subtle--an ideal candidate for the application of formal methods. This paper describes a formal method for deriving fault-tolerant protocols that is based on refinement and proof outlines. The AAS hand-off protocol was actually derived using this method; that derivation is given.
Test Reuse in the Spreadsheet Paradigm
Authors: Marc Fisher II, Dalai Jin, Gregg Rothermel, Margaret Burnett
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

Spreadsheet languages are widely used by a variety ofend users to perform many important tasks. Despite theirperceived simplicity, spreadsheets often contain faults. Furthermore,users modify their spreadsheets frequently, whichcan render previously correct spreadsheets faulty. To addressthis problem, we previously introduced a visual approachby which users can systematically test their spreadsheets,see where new tests are required after changes, andrequest automated generation of potentially useful test inputs.To date, however, this approach has not taken advantageof previously developed test cases, which means thatusers of the approach cannot benefit, when re-testing followingchanges, from prior testing efforts. We have thereforebeen investigating ways to add support for test reuseinto our spreadsheet testing methodology. In this paper wepresent a test re-use strategy for spreadsheets, and the algorithmsthat implement it, and describe their integration intoour spreadsheet testing methodology. We report results of acase study examining the application of this strategy.
Formal semantics and communication strategies for proactive information delivery among team-based agents
Authors: John Yen, Xiaocong Fan, Shuang Sun, Rui Wang, Cong Chen, Kaivan Kamali, Mike Miller, Richard A. Volz
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Effective human teams often benefit from proactivity through members' capability of anticipating different needs of teammates. In this paper, we focus on three issues related to the behavior of proactive information delivery. Two types of information needs are identified, the intentional semantics of ProInform is given, and priliminary experiments are carried out to study how different strategies for choosing ProInform impact team performance. The work presented in this paper provide a sound and practical framework that enables further studies regarding proactive information delivery.
Writer Identification By Writer's Invariants
Authors: Ameur Bensefia, Ali Nosary, Thierry Paquet, Laurent Heutte
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This communication deals with the problem of writer identification. If the assumption of writing individuality is true then graphical fragments that constitute it should be individual too. Therefore we propose a morphological grapheme based analysis to make writer identification.Template Matching is the core of the approach. The redundancy of the individual patterns in a writing, defined as the writer's invariants, allows to compress the handwritten texts while maintaining good identification performance. Two series of tests are reported. The first series is designed to evaluate the relevance of our approach of identification on a basis of 88 writers by evaluating the influence of the text representation (with or without invariants) on the quality of the method. The method gives about 97.7% of correct identification when using large compressed samples of handwriting. The second series of tests is designed to evaluate theinfluence of the sample size of the writing to be identified on the quality of the method. It is shown that writer identification can reach a correct identification rate of 92.9% using only samples of 50 graphemes of each writing.
Theorems about Composition
Authors: Michel Charpentier, K. M Chandy
Venue:  (2000)

Compositional designs require component specifications that can be composed: Designers have to be able to deduce system properties from components specifications. On the other hand, components specifications should be abstract enough to allow component reuse and to hide substantial parts of correctness proofs in components verifications. Part of the problem is that too abstract specifications do not contain enough information to be composed. Therefore, the right balance between abstraction and composability must be found. This paper explores the systematic construction of abstract specifications that can be composed through specific forms of composition called existential and universal.
On the Undecidability of Partial Polymorphic Type Reconstruction
Authors: Frank Pfenning
Venue:  (1992)

We prove that partial type reconstruction for the pure polymorphic lambda-calculus is undecidable by a reduction from the second-order unification problem, extending a previous result by H.-J. Boehm. We show further that partial type reconstruction remains undecidable even in a very small predicative fragment of the polymorphic lambda-calculus, which implies undecidability of partial type reconstruction for lambda^ML as introduced by Harper, Mitchell, and Moggi.
BEA WebLogic 7.0 Application Server Deployment and Administration Handbook
Authors: Aaron Mulder
Venue:  (2002)

:The Deployment and Administration Handbooks simplify the varied and often complex task of getting J2EE applications up and running on a J2EE 1.3 certified application server. Despite the J2EE standard, every application server is different. Each has its own administrative interface, and deployment process. Each interprets and implements the specifications slightly differently, adding its own proprietary features and functionality.To develop powerful J2EE applications that fully utilize the runtime services provided by the platforms in which they run, you to need be well versed with the configuration and deployment of J2EE components on the application server. This Handbook covers the following tasks and features: The WebLogic Administrative and Deployment Tools Deploying J2EE components: WAR, EJB JAR, and EAR Deploying Web Services on WebLogic Server Configuring the WebLogic Server and Domains Configuring WebLogic Server Security Configuring JDBC Connections and Data Sources Configuring JMS Destinations and Connection Factories Configuring WebLogic Clustering Configuring Web Application Deployments Configuring EJB Deployments Configuring Container-Managed Persistence for Entity Beans The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Straightforward Java Persistence Through Checkpointing
Authors: Jon Howell
Venue:  (1998)

Several techniques have been proposed for adding persistence to the Java language environment. This paper describes a scheme based on checkpointing the Java Virtual Machine, and compares the scheme to other techniques. Checkpointing offers two unique advantages: first, the implementation is independent of the JVM implementation, and therefore survives JVM updates; second, because checkpointing saves and restores execution state, even threads become persistent entities.
Integrating CSP and DC
Authors: Jifeng He
Venue: Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems (2002)

Hybrid systems are interactive systems of continuousdevices and digital control programs. Typical examplesare digital modules that control a physical environmentevolving over time. The principal problem of the subjectis to model them so that given a specification for thecontinuous component of the system, we can extract, ifthis is possible, from the description of the total systemand the specification of the continuous component, thespecification of thecontrol program which will force thecontinuous device to meet its specification.This paperpresents a formal description language for hybrid sys-tems, which is an integration of CSP, which describesdigital control programs, and DC for specification ofcontinuous devices. We define primitive operators oversystems in DC and prove that so defined operators meetbasic algebraic laws of these operators.
A Summmary of Network Performance Benchmarking of Sun 4/490File Servers
Authors: Technical Staff
Venue:  (1994)

In 1990, the technical staff of the Computer Science Department at Brown University undertook a study of the NFS performance of Sun 4/280 and Sun 4/490 servers. This paper describes the reasons behind the need for the testing, how the tests were conducted, and the conclusions which were drawn from the work. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Minimizing the expected minimum
Authors: Colin L. Mallows
Venue: Advances in Applied Mathematics (2003)

The problem is to find a probability measure, supported in the unit cube, such that the projections onto each of the three coordinate planes are uniform, that minimizes the expectation of the minimum of x1, x2, x3. This is an infinite linear programming problem. Its solution by way of discrete approximation seems to be far out of reach. In this paper I describe a solution.
Combining Multiple Evidence from Different Properties of Weighting Schemes
Authors: Joon H Lee
Venue:  (1995)

It has been known that using different representations of either queries or documents, or different retrieval techniques retrieves different sets of documents. Recent work suggests that significant improvements in retrieval performance can be achieved by combining multiple representations or multiple retrieval techniques. In this paper we propose a simple method for retrieving different documents within a single query representation, a single document representation and a single retrieval technique. We classify the types of documents, and describe the properties of weighting schemes. Then, we explain that different properties of weighting schemes may retrieve different types of documents. Experimental results show that significant improvements can be obtained by combining the retrieval results from different properties of weighting schemes. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Optimizing Buffer Management for Reliable Multicast
Authors: Zhen Xiao, Ken Birman
Venue:  (2000)

Reliable multicast delivery requires that a multicast message be received by all members in a group. Hence certain or all members need to buffer messages for possible retransmissions. Designing an efficient buffer management algorithm is challenging in large multicast groups where no member has complete group membership information and the delivery latency to different members could differ by orders of magnitude. We propose an innovative two-phase buffering algorithm, which explicitly addresses variations in delivery latency seen in large multicast groups. The algorithm effectively reduces buffer requirements by adaptively allocating buffer space to messages most needed in the system and by spreading the load of buffering among all members in the group. Simulation results demonstrate that the algorithm has good performance.
The Domination-Compliance Graph of a Tournament
Authors: Guillermo Jimenez, J. R Lundgren
Venue:  (1997)

Vertices x and y are a dominant pair in a tournament if for all vertices z not equal to x,y, either x beats z or y beats z. Vertices x and y are a compliant pair in a tournament if for all vertices z not equal to x,y, either z beats x or z beats y. Let DC(T) be the graph on the same vertex set as T with edges between pairs of vertices that are either a dominant pair or a compliant pair in T. We show that the maximum possible number of edges in DC(T) is 2(n-1) and this bound is sharp. In addition we obtain results about the structure of DC(T) such as forbidden subgraphs and the clique number. Since DC(T) is the complement of the Competition/Resource graph of a tournament, complementary results are obtained for this graph.
A task graph model for design and implementation of real-time systems
Authors: A. Silberman, T. J. Marlowe
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

The paper introduces the RTM task graph model. RTM is a distributed operating system and scheduler for complex real time tasks developed at the University of Illinois, Urbana-Champaign, with a medium grained data flow model of computation. Tasks are linearly segmented (possibly with loops), but have arbitrary interconnectivity. This allows for decomposable tasks while avoiding the complications of a full fledged hierarchical model, simplifying scheduling, resource allocation. Our description of the task graph model in RTM can largely also be viewed as a list of desirable characteristics of any task graph based environment for real time design and implementation.
A Panorama-based Method of Personal Positioning and Orientation and Its Real-time Applications for Wearable Computers
Authors: Masakatsu Kourogi, Takeshi Kurata, Katsuhiko Sakaue.
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

In this paper, we describe an improved method of personal positioning and orientation using image registration between input video frames and panoramic images captured beforehand. In our previous work, we proposed the method of image registration with an affine transform. However, the affine transform is generally not capable of image registration between a frame and a panorama. We improved the previous method so that it can estimate projective transform parameters without severely increasing computational cost. We also improved the method to be robust with respect to lighting changes by using the weighted sum of absolute difference of both brightness and its gradient between images. We confirmed that this improved method could estimate image registration parameters under conditions that hindered the previous method. Its computational cost increased by only 10--20% and its software implementation was capable of real-time processing.
On Estimating Testing Effort Needed to Assure Field Quality in Software Development
Authors: Osamu Mizuno, Eijiro Shigematsu, Yasunari Takagi, Tohru Kikuno
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

In the practical software development, software quality is generally evaluated by the number of residual defects.To keep the number of residual defects with a permissible value, too much effort is often assigned to software testing. In this paper, we try to develop a statistical model to determine the amount of testing effort which is needed to assure the field quality.The model explicitly includes design, review, and test (including debug) activities.Firstly, we construct a linear multiple regression model that can clarify the relationship among the number of residual defects and the efforts assigned to design, review, and test activities.We then confirm the applicability of the model by statistical analysis using actual project data.Next we obtain an equation based on the model to determine the test effort.As parameters in the equation, the permissible number of residual defects, the design effort, and the review effort are included.Then, the equation determines the test effort that is needed to assure the permissible residual defects.Finally, we conduct an experimental evaluation using actual project data and show the usefulness of the equation.
Adding Reviews, Prototyping and Frequent Deliveries to Software Engineering Projects
Authors: U C Smith, Charles Martin
Venue:  (1987)

{\em Program Design and Construction} is Duke''s introductory software engineering course. Until spring semester of 1985, this has been a fairly conventional project-oriented course. At that time, we added critical evaluation of other software systems, more frequent intermediate deliveries, and human-interface prototyping to the project assignments. These additions to a previously-successful course produces a positive result far out of proportion to what we expected. This was surprising enough that we thought it should be reported; the first part of this report describes the original course and our changes to it. In addition, we think we have learned something more general about teaching software engineering principles, and improving software engineering practices. What we have learned, and ideas and speculations based on this, make up the second part of the report.
Scheduling unrelated parallel machines to minimize total weighted tardiness
Authors: Ching-Fang Liaw, Yang-Kuei Lin, Chun-Yuan Cheng, Mingchin Chen
Venue: Computers and Operations Research (2003)

This article considers the problem of scheduling a given set of independent jobs on unrelated parallel machines to minimize the total weighted tardiness. The problem is known to be NP-hard in the strong sense. Efficient lower and upper bounds are developed. The lower bound is based on the solution of an assignment problem, while the upper bound is obtained by a two-phase heuristic. A branch-and-bound algorithm that incorporates various dominance rules is presented. Computational experiments are conducted to demonstrate the performance of the proposed algorithm.
Quantifying Error in Dynamic Power Estimation of CMOS Circuits
Authors: Puneet Gupta, Andrew B. Kahng
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

Conventional power estimation techniques are prone to manysources of error. With increasing dominance of coupling capacitances,capacitive coupling potentially contributes significantly toUDSM power consumption. We analyze potential sources of inaccuracyin power estimation, focusing on those due to coupling.Our results suggest that traditional power estimates can be off byas much as 50%.
Optimal bandwidth allocation for bandwidth adaptation in wireless multimedia networks
Authors: Koo-Min Ahn, Sehun Kim
Venue: Computers and Operations Research (2003)

The concept of bandwidth adaptation which additionally allocates the terminated bandwidth to ongoing calls is one of the promising methods to reduce the new call blocking and handoff call dropping probabilities. In this paper, we formulate the bandwidth allocation problem for the bandwidth adaptation as a binary linear integer program which maximizes the satisfaction degree of customers. Since this optimization should be performed in real time, we presented a computationally efficient heuristic algorithm for the problem based on the Lagrangian relaxation procedure. Our simulation test shows that the algorithm finds a sub-optimal solution within 0.5% in average from the true optimal solution. The solutions of our scheme show better performance than other scheme in both handoff call dropping and new call blocking probabilities.
A Single-Phase Method Based on Evolution Calculation for Vehicle Routing Problem
Authors: Takeo Takeno, Yasuhiro Tsujimura, Genji Yamazaki
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

This paper is concerned with a transportation system in which vehicles deliver a peace ofluggage to determine an assignment of the luggage into each vehicle.Problem to obtainthe assignment is called Vehicle routing Problem and its is one of hard combinatorial optimization problems.And VRP is characterized with two properties, geometrical andtime structures.The main purpose of this work is to propose an Evolution Calculation method for VRP.In the method, four search operators that utilize geometrical and timestructures are introduced.Numerical experiments for an actual system are appeared to examine the method.