ppxscal/embedding_network huggingface dataset:
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
Authors: Alex K. Simpson
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

We present a general axiomatic construction of models of FPC, a recursively typed lambda-calculus with call-by-value operational semantics. Our method of construction is to obtain such models as full subcategories of categorical models of intuitionistic set theory. This allows us to obtain a notion of model that encompasses both domain-theoretic and realizability models. We show that the existence of solutions to recursive domain equations, needed for the interpretation of recursive types, depends on the strength of the set theory. The internal set theory of an elementary topos is not strong enough to guarantee their existence. However,solutions to recursive domain equations do exist if models of intuitionistic Zermelo-Fraenkel set theory are used instead. We apply this result to interpret FPC, and we provide necessary and sufficient conditions on a model for the interpretation to be computationally adequate, i.e. for the operational and denotational notions of termination to agree.
Modeling Business Rules with Situation/Activation Diagrams
Authors: Peter Lang, Werner Obermair, Michael Schrefl
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Business rules are statements about business policies and can be formulated according to the event-condition-action structure of rules in active database systems. However, modeling business rules at the conceptual level from an external user's perspective requires a different set of concepts than currently provided by active database systems. This paper identifies requirements on the event language and on the semantics of rule execution for modeling business rules and presents a graphical object-oriented language, called Situation/Activation diagrams, meeting these requirements.
Moby Dick meets GEOCR: Lexical Considerations in Word Recognition
Authors: A. Lawrence Spitz
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

An earlier paper described a high speed, lexically driven OCR called GEOCR. This paper expands that work by describing the effects of lexical content, structure and processing on the performance of GEOCR as a word recognition engine. Word recognition performance is shown to be enhanced by the application of an appropriate lexicon. Recognition speed is essentially independent of the details of lexical content provided the intersection of the occurrences of words in the document and the lexicon is high. Word recognition accuracy is dependent on both intersection and specificity of the lexicon.
Delegation: Efficiently Rewriting History
Authors: Cris Pedregal Martin, Krithi Ramamritham
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Transaction delegation, as introduced in ACTA, allows a transaction to transfer responsibility for the operations that it has performed on an object to another transaction. Delegation can be used to broaden the visibility of the delegatee, and to tailor the recovery properties of a transaction model. Delegation has been shown to be useful in synthesizing advanced transaction models. With an efficient implementation of delegation it becomes practicable to realize various advanced transaction models whose requirements are specified at a high level language instead of the current expensive practice of building them from scratch. The authors identify the issues in efficiently supporting delegation and hence advanced transaction models, and illustrate this with our solution in ARIES, an industrial-quality system that uses UNDO/REDO recovery. Since delegation is tantamount to rewriting history, a naive implementation can entail frequent, costly log accesses, and can result in complicated recovery protocols. The algorithm achieves the effect of rewriting history without rewriting the log, resulting in an implementation that realizes the semantics of delegation at minimal additional overhead and incurs no overhead when delegation is not used. The work indicates that it is feasible to build efficient and robust, general-purpose machinery for advanced transaction models. It is also a step towards making recovery a first-class concept within advanced transaction models.
Architectural Support for Parallel Reductions in Scalable Shared-Memory Multiprocessors
Authors: María Jesús Garzarán, Milos Prvulovic, Ye Zhangy, Josep Torrellas, Alin Jula, Hao Yu, Lawrence Rauchwerger
Venue: Proceedings of the 2001 International Conference on Parallel Architectures and Compilation Techniques (2001)

Abstract: Reductions are important and time-consuming operations in many scientific codes. Effective parallelization of reductions is a critical transformation for loop parallelization, especially for sparse, dynamic applications. Unfortunately, conventional reduction parallelization algorithms are not scalable. In this paper, we present new architectural support that significantly speeds-up parallel reduction and makes it scalable in shared-memory multiprocessors. The required architectural changes are mostly confined to the directory controllers. Experimental results based on simulations show that the proposed support is very effective. While conventional software-only reduction parallelization delivers average speedups of only 2.7 for 16 processors, our scheme delivers average speedups of 7.6.
A Multimedia Information System for Administrative, Scientific and Intervention Data in Conservation-Restoration of Cultural Movable Properties
Authors: Flávio H. C. Nunes, Luiz A. C. Souza, Arnaldo de Albuquerque Araújo, Marcelo A. Correa
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

This poster describes the process of modelling and implementing a multimedia information system for CECOR-Center for Conservation and Restoration of Cultural Movable Properties. The new system includes a multimedia system which contains information about the restored objects, their materials and techniques, images generated by methods of diagnosis, results of scientific analysis, etc. The new system also includes administrative information about the contacts with the clients, payments and the current status of the object, regarding its restoration process.
Reverse Architecting Approach for Complex Systems
Authors: René L. Krikhaar
Venue: Proceedings of the International Conference on Software Maintenance (1997)

Philips is an electronics company which operates world wide and participates in professional as well as consumer markets. The architecture of many software intensive systems are currently not optimally prepared for the changing market. For example, the variety of systems is increasing because different users or user groups demand slightly different variants of a system. Good understanding of systems is required to be able to follow these changes. During the last years we have analysed a number of systems from which we have derived a general approach for reverse architecting (RA). Our approach has proved to be applicable for various complex systems in different domains. It consists of a number RA steps. In this paper we describe three RA steps and indicate some aspects of other RA steps. The description is supplemented with three case studies of complex systems. The complete set of RA steps is not fully independent, however it is not necessary to perform all RA steps for each case.
Praire: A Rule Specification Framework for Query Optimizers
Authors: Dinesh Das, Don S. Batory
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

From our experience, current rule-based query optimizers do not provide a very intuitive and well-defined framework to define rules and actions. To remedy this situation, we propose an extensible and structured algebraic framework called Prairie for specifying rules. Prairie facilitates rule-writing by enabling a user to write rules and actions more quickly, correctly and in an easy-to-understand and easy-to-debug manner. Query optimizers consist of three major parts: a search space, a cost model and a search strategy. The approach we take is only to develop the algebra which defines the search space and the cost model and use the Volcano optimizer-generator as our search engine. Using Prairie as a front-end we translate Prairie rules to Volcano to validate our claim that Prairie makes it easier to write rules. We describe our algebra and present experimental results which show that using a high-level framework like Prairie to design large-scale optimizers does not sacrifice efficiency.
Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps
Authors: Peter Bürgisser, Martin Lotz
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We prove lower bounds of order n log n for both the problem to multiply polynomials of degree n, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower bounds are optimal up to order of magnitude. The proof uses a recent idea of R. Raz [Proc. 34th STOC 2002] proposed for matrix multiplication. It reduces the linear problem to multiply a random circulant matrix with a vector to the bilinear problem of cyclic convolution. We treat the arising linear problem by extending J. Morgenstern's bound [J. ACM 20, pp. 305-306, 1973] in a unitarily invariant way. This establishes a new lower bound on the bounded coefficient complexity of linear forms in terms of the singular values of the corresponding matrix.
Migrating Legacy Systems towards Object-Oriented Platforms
Authors: Giuseppe A. Di Lucca, Anna Rita Fasolino, Patrizia Guerra, Silvia Petruzzelli
Venue: Proceedings of the International Conference on Software Maintenance (1997)

We present an approach to migrate legacy systems to object-oriented platforms. The process consists of six sequential phases and encompasses reverse engineering and re-engineering activities. The aim of the reverse engineering phases is to decompose programs into components implementing the user interface management and components implementing application domain objects. The identification of objects is centered around persistent data store and exploits object-oriented design metrics. Wrapping techniques are the core of the re-engineering activities. They make new systems able to exploit existing resources, thus allowing an incremental and selective translation of the identified objects.
Low power data format converter design using semi-static register allocation
Authors: Kala Srivatsan, Chaitali Chakrabarti, Lori Lucke
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

In many applications, such as digital signal processing, data format converters are used to reformat the data transferred between processing modules. In VLSI implementations, these converters consume a large portion of the available resources. Various methods have been proposed to synthesize data format converter architectures while optimizing the number of registers used to store the data. In this paper, we present a new register allocation scheme which not only minimizes the number of resistors, but also minimizes the power consumption in the data format converter. Low power data format converters are synthesized by minimizing the transitions and interconnections between the registers used to store the data. We present both a heuristic and an integer linear programming formulation to solve the allocation problem. Our method shows significant improvement over previous techniques.
Using Preference Order in Ontologies
Authors: S. Heymans, Dirk Vermeir
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

The latest ontology languages can be translated into a description logic (DL), thus providing them with a formal semantics and associated reasoning procedures. We introducethe ordered description logic OSHOQ(D) as a simple decidable extension of SHOQ(D) that supports the direct definition of a preference order on defeasible axioms, thus allowing for a succinct and intuitive expression of defeasible ontologies, containing e.g. exceptions for certain axioms.We demonstrate the usefulness of OSHOQ(D) for solving inconsistencies that may appear e.g. when merging existing ontologies. We present an algorithm that, based on concrete examples of facts that should be true, produces minimal preference orderings on the axioms, in order to make an otherwise inconsistent knowledge base consistent.
Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model
Authors: Boaz Barak
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We present the first constant-round non-malleable commitment scheme and the first constant-round non-malleable zero-knowledge argument system, as defined by Dolev, Dwork and Naor. Previous constructions either used a non-constant number of rounds, or were onlysecure under stronger setup assumptions. An example of such an assumption is the shared random string model where we assume all parties have access to a reference string that was chosen uniformly at random by a trusted dealer.We obtain these results by defining an adequate notion of non-malleable coin-tossing, and presenting a constant-round protocol that satisfies it. This protocol allows us to transform protocols that are non-malleable in (a modified notion of) the shared random string model into protocols that are non-malleable in the plain model (without any trusted dealer or setup assumptions). Observing that known constructions of a non-interactive non-malleable zero-knowledge argument systems in the shared random string model (De Santis et. al., 2001) are in fact non-malleable in the modified model, and combining them with our coin-tossing protocol we obtain the results mentioned above.The techniques we use are different from those used in previous constructions of non-malleable protocols. In particular our protocol uses diagonalization and a non-black-box proof of security (in a sense similar to Barak's zero-knowledge argument).
An Agent-Based Framework for Developing Flexible Distributed Systems
Authors: Kenji Sugawara
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

This paper discusses a concept of flexible distributed systems and an agent-based architecture for them. Then, an agent-based framework for developing such a flexible distributed system named ADIPS framework is proposed. This consists of distributed agent work places, agent repositories and support tools. Finally, agent-based flexible applications developed using the ADIPS framework are demonstrated.
Geometric Data Structures on a Reconfigurable Mesh, with Applications
Authors: Amitava Datta
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

We present several geometric data structures and algorithms for problems for a planar set of rectangles and bipartitioning problems for a point set in two dimensions on a reconfigurable mesh of size n\times n. The problems for rectangles include computing the measure, contour, perimeter and maximum clique for the union of a set of rectangles. The bipartitioning problems for a two dimensional point set are solved in the L_\infty and L_1 metrics. We solve all these problems in O(\log n) time.
High Availability in Clustered Multimedia Servers
Authors: Renu Tewari, Daniel M. Dias, Rajat Mukherjee, Harrick M. Vin
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

Clustered multimedia servers, consisting of interconnected nodes and disks, have been proposed for large scale servers, that are capable of supporting multiple concurrent streams which access the video objects stored in the server. As the number of disks and nodes in the cluster increases, so does the probability of a failure. With data striped across all disks in a cluster, the failure of a single disk or node, results in the disruption of many or all streams in the system. Guaranteeing high availability in such a cluster becomes a primary requirement, to ensure continuous service. In this paper, we study mirroring and software RAID schemes with different placement strategies, that guarantee high availability in the event of disk and node failures, while satisfying the real-time requirements of the streams. We examine various declustering techniques for spreading the redundant information across disks and nodes and show that random declustering has good real-time performance. Finally, we compare the overall cost per stream for different system configurations. We derive the parameter space where mirroring and software RAID apply, and determine optimal parity group sizes.
Linking the Semantic Web with Existing Sources
Authors: Wolfgang May
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

The Semantic Web aims at providing Web data sources on a semantic level. On the other hand, most of the Web data itself is not suitably prepared (e.g., by annotations). In this paper, we describe a semantic layer that integrates existing data sources with the Semantic Web by combining semantic modeling with links that associate the semantic notions with actual data on the Web. The semantic level consists of specialized service providers ¿ which can be seen as agents ¿ for each application domain. Each agent contains ontologicalknowledge represented in XML where the links to the actual data are embedded as XPath expressions, similar to XLink. The agent uses its knowledge with an internal reasoning mechanism to combine the links for translating a Semantic Web query into a Web query that is then evaluated against the individual sources.
A Framework for Modeling Strategy, Business Processes and Information Systems
Authors: André Vasconcelos, Artur Caetano, João Neves, Pedro Sinogas, Ricardo Mendes, José Tribolet
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: In order to continuously improve its knowledge and to identify problems and possible solutions, an organization requires understanding of the way business is aligned with the organizational strategy and how information systems are supporting the business. This paper presents a framework for describing and associating organizational concepts at multiple levels of detail using three separate areas of concerns: goals and strategy, business processes and information systems. The framework is presented as an extension to the Unified Modeling Language (UML) using a standard UML Profile. The framework's concepts are illustrated by modeling the purchase and sales business operations of a retail store from the strategic, process and information systems viewpoints.
Adaptive Mode Control: A Static-Power-Efficient Cache Design
Authors: Huiyang Zhou, Mark C. Toburen, Eric Rotenberg, Thomas M. Conte
Venue: Proceedings of the 2001 International Conference on Parallel Architectures and Compilation Techniques (2001)

Abstract: Lower threshold voltages in deep sub-micron technologies cause more leakage current, increasing static power dissipation. This trend, combined with the trend of larger/more cache memories dominating die area, has prompted circuit designers to develop SRAM cells with low-leakage operating modes (e.g., sleep mode). Sleep mode reduces static power dissipation but data stored in a sleeping cell is unreliable or lost. So, at the architecture level, there is interest in exploiting sleep mode to reduce static power dissipation while maintaining high performance. Current approaches dynamically control the operating mode of large groups of cache lines or even individual cache lines. However, the performance monitoring mechanism that controls the percentage of sleep-mode lines, and identifies particular lines for sleep mode, is somewhat arbitrary. There is no way to know what the performance could be with all cache lines active, so arbitrary miss rate targets are set (perhaps on a per-benchmark basis using profile information) and the control mechanism tracks these targets. We propose applying sleep mode only to the data store and not the tag store. By keeping the entire tag store active, the hardware knows what the hypothetical miss rate would be if all data lines were active and the actual miss rate can be made to precisely track it. Simulations show an average of 73% of I-cache lines and 54% of D-cache lines are put in sleep mode with an average IPC impact of only 1.7%, for 64KB caches.
Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System
Authors: Keqin Li, Victor Y. Pan
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

The known fast sequential algorithms for multiplying two N× N matrices (over an arbitrary ring) have time complexity 0(Na) where 2
Supply and Demands of Information Technology Workers
Authors: Stephen S. Yau
Venue: 23rd International Computer Software and Applications Conference (1999)

With the rapid expansion of applications of information technology (IT), it is obvious that there are heavy demands of IT workers in many sectors of the society. The immediate problem encountered in the IT industry and IT users is the serious difficulty of filling numerous vacancies with qualified IT workers, which naturally leads to the conclusion that we have severe shortage of IT workers. There are many on-going discussions in industry, governments and academia on how to address various issues associated with the supply and demands of IT workers. The most recent study was conducted by the Computing Research Association on the supply of Information Technology Workers in the United States.
Profile-Driven Generation of Trace Samples
Authors: Pradeep K. Dubey, Ravi Nair
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

Trace driven simulation is a common technique for evaluating different machine design options. Since the computing resources needed for simulation depend on the size of the trace, it is not always practical to use the complete trace of an application for simulation. This paper proposes a new technique, profile-driven sampling, for obtaining a reduced trace that is representative of the complete trace. Inaccuracy in the prediction of performance using such a reduced trace, is generally less than that from reduced traces using published techniques. For example, the prediction inaccuracy due to profile-driven sampling is 50 percent less than that using periodic time-based sampling. Profile-driven sampling also eliminates sensitivity to sampling parameters, such as sample size and inter-sample interval of periodic window based trace sampling, resulting in a simple and robust trace generation process.