ppxscal/embedding_network huggingface dataset:
On Computing the CS Decomposition with Systolic Arrays
Authors: I. M. Kaplan, Charles Van Loan
Venue:  (1984)

The computation of the CS decomposition is the key to the stable computation of the Generalized Singular Value Decomposition, and is also important in other applications. This paper describes our implementation of a technique to compute the CS decomposition, and investigates the transfer of this technique to systolic computer architectures with parallel computation.
Classification of source code archives
Authors: Robert Krovetz, Secil Ugurel, C. Lee Giles
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

The World Wide Web contains a number of source code archives. Programs are usually classified into various categories within the archive by hand. We report on experiments for automatic classification of source code into these categories. We examined a number of factors that affect classification accuracy. Weighting features by expected entropy loss makes a significant improvement in classification accuracy. We show a Support Vector Machine can be trained to classify source code with a high degree of accuracy. We feel these results show promise for software reuse.
On the Generation of Prime Implicants
Authors: Bernd Reusch
Venue:  (1976)

NO SUPPLIED
Details of Nested Dissection on a M x M x K Grid
Authors: Paul Lanzkron, J D Rose
Venue:  (1991)

\indent This report is intended to go along with the note Nested Dissection on $M \times M \times K$ grids [2]. The purpose of this report is to give the details of experiments discussed in the aforementioned report.
An extension of SQL to support ordered domains in relational databases
Authors: W. Ng, M. Levene
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

The ordered relational model is an extension of the relational model which incorporates partial orderings into data domains. We demonstrate that the ordered relational model is suitable for modelling advanced applications involving tree-structured information, incomplete information and temporal information. We describe OSQL, which is an extension of SQL for the ordered relational model, and show that OSQL combines the capabilities of standard SQL with the power of user-defined semantic orderings. The syntax of OSQL is a minimal extension of SQL and thus it should be easy for current SQL users to adapt to OSQL. Although it is a minimal extension, OSQL allows the users to formulate a wide range of queries, such as fuzzy or temporal, which are either very awkward or impossible to formulate in standard SQL. We also discuss the experimental implementation of OSQL and the further development of the capabilities of OSQL via the notion of an OSQL package in databases, which utilises semantic orderings to define the set of core operations associated with a specific application.
Minimal CDMA Recoding Strategies in Power-Controlled Ad-Hoc Wireless Networks
Authors: Indranil Gupta
Venue:  (2001)

The problem of Code Division Multiple Access (CDMA) code assignment to eliminate primary and hidden collisions in multihop packet radio networks has been widely researched in the past. However, very little work has been done on the very realistic *distributed, dynamic* version of the transmitter-oriented code assignment (TOCA) problem in an ad-hoc network where mobiles use CDMA technology. None of the existing dynamic TOCA CDMA algorithms in literature are efficient, in terms of maximum code index assigned in the network, or number of times a mobile has to change its code. We present a set of local and distributed *recoding* strategies for the TOCA CDMA problem in an ad-hoc network where mobiles can arbitrarily 1) connect and disconnect, 2) move about, and 3) increase or decrease their transmission power all these may need some mobiles to be recoded, to avoid new collisions. Our strategies, unlike those proposed earlier in literature, guarantee *minimal recoding*, that is, given a current network-wide code assignment and one of the above events, our strategies change the codes of the minimum number of mobiles needed to eliminate all collisions. Minimal recoding can be very important in reducing the effect of frequent code changes on the performance and criticality of distributed applications. Further, among all possible minimal recoding strategies in a class, most of our strategies are also (provably) *optimal* in terms of the maximum code index assigned in the network. Performance results that evaluate our dynamic minimal strategies are also presented.
The context-splittable normal form for Church--Rosser language systems
Authors: Jens R. Woinowski
Venue: Information and Computation (2003)

In this paper the context-splittable normal form for rewriting systems defining Church-Rosser languages is introduced. Context-splittable rewriting rules look like rules of context-sensitive grammars with swapped sides. To be more precise, they have the form uvw → uxw with u, v, w being words, v being nonempty and x being a single letter or the empty word. It is proved that this normal form can be achieved for each Church-Rosser language and that the construction is effective. Some interesting consequences of this characterization are given, too.
The Art of Deception: Controlling the Human Element of Security
Authors: Kevin D. Mitnick, William L. Simon
Venue:  (2003)

:Kevin Mitnick's exploits as a cyber-desperado and fugitive from one of the most exhaustive FBI manhunts in history have spawned dozens of articles, books, films, and documentaries. Since his release from federal prison in 2000, Mitnick has turned his life around and established himself as one of the most sought-after computer security experts worldwide. Now, in The Art of Deception, the world's most famous hacker gives new meaning to the old adage, "It takes a thief to catch a thief." Inviting you into the complex mind of the hacker, Mitnick provides realistic scenarios of cons, swindles, and social engineering attacks on businesses -- and the consequences. Focusing on the human factors involved with information security, Mitnick explains why all the firewalls and encryption protocols in the world will never be enough to stop a savvy grifter intent on rifling a corporate database or an irate employee determined to crash a system. He illustrates just how susceptible even the most locked-down information systems are to a determined con artist impersonating an IRS agent or any other seemingly innocent character. Narrated from the points of view of both the attacker and the victim, The Art of Deception explores why each attack was so successful -- and how it could have been averted -- in an engaging and highly readable manner reminiscent of a true-crime novel. Most importantly, Mitnick redeems his former life of crime by providing specific guidelines for developing protocols, training programs, and manuals to ensure that a company's sophisticated technical security investment will not be for naught. He shares his advice for preventing security vulnerability in the hope that people will be mindfully on guard for an attack from the gravest risk of all -- human nature.
A system architecture for flexible control of downloaded executable content
Authors: T. Jaeger, A. Prakash, A. D. Rubin
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

We present an architecture that enables developers to build applications that can flexibly control downloaded executable content. The architecture includes an access control model for representing security requirements and a browser service for deriving application requirements from signed content messages and executing content in limited domains.
New MVL-PLA structures based on current-mode CMOS technology
Authors: M. Abd-El-Barr, M. N. Hasan
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

Programmable logic arrays (PLAs) are being used to implement complex multi-valued logic (MVL) circuits. In this paper we introduce three new current-mode CMOS MVL-PLA structures for the implementation of MVL functions. These PLA structures use four current-mode CMOS building blocks namely, cycle, min, tsum and constants. Comparison between the introduced architectures is made based on their respective ability to realize all possible r-valued one-variable functions. Simulation results are provided to show that the third type of PLA, called type-C PLA, is superior to the other two types, called type-A PLA and type-B PLA respectively, in terms of the total number of functions realized using a given number of columns. However, this comes at the expense of an increased hardware overhead in the form of extra cyclic generator blocks added at the input of the PLA.
Organizational patterns for data management in large-scale distributed multiagent systems
Authors: William Wright, Dana Moore, Michael Thome
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

One of the important advantages of a distributed multi-agent system comes from the parallelism that can be realized by distributing data over a network of agents. A properly designed distributed agent system can scale to handle arbitrarily large data sets by adding more computers, network bandwidth, and storage. However, this scalability comes at a price. In this paper, we show how a naive approach to data management in a distributed agent system unnecessarily limits its scalability and present our approach to data management and visualization using the Cougaar agent architecture. Finally, we examine the implementation of a distributed MAS realized as three systems of increasing scale and analyze how these principles were and were not followed in an actual, functional system.
Parasitic Languages for Requirements
Authors: Mike Hill
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

Computer modelling is a viable method for aiding requirements elicitation of future systems as it provides a mechanism for understanding and consolidating ideas which people can readily relate to. However a major drawback with a computer model is the capturing of its requirements for future contractual use. In this paper we put forward a method by which requirement statements can be attributed within models that allows for post compilation extraction and analysis. This approach is based on adding a parasitic language to a modelling language which strongly couples requirements to items of code, but which is transparent to the dynamic execution of the model. The paper illustrates the approach on a simple language and discusses how the approach has been incorporated within a large system modelling language. The ability to provide direct links to requirement management repositories is shown.
CCEL: A Metalanguage for C++
Authors: Carolyn K. Duby, Scott Meyers, Steven P. Reiss
Venue:  (1992)

C++ is an expressive language, but it does not allow software developers to say all the things about their systems that they need to be able to say. In particular, C++ offers no way to express many important constraints on a system''s design, implementation, and presentation. In this paper, we describe CCEL, a metalanguage for C++ that allows software developers to express constraints on C++ designs and implementations, and we describe Clean++, a system that checks C++ code for violations of CCEL constraints. CCEL is designed for practical, real-world use, and the examples in this paper demonstrate its power and flexibility.
Parallel Programming with Declarative Ada
Authors: John Thornley
Venue:  (1993)

Declarative programming languages (e.g., functional and logic programming languages) are semantically elegant and implicitly express parallelism at a high level. We show how a parallel declarative language can be based on a modern structured imperative language with single-assignment variables. Such a language combines the advantages of parallel declarative programming with the strengths and familiarity of the underlying imperative language. We introduce Declarative Ada, a parallel declarative language based on a subset of Ada. Declarative Ada integrates parallel and sequential composition, allowing sequential input and output from within parallel declarative programs.
Analysis of Bib1 Mapping
Authors: Maria B Baldacci, Stefania Biagioni, Silvana Agueci, Fabiola Fazi, Barbara Pistoia, Renato Tamburrini, Gian L Betti, Carmen Gomez, Jesus Zubiaga, Sara Sanchez, Ernesto G Camarero
Venue:  (1995)

This document deals with ARCA Target requirements concerning checking RPN queries and translating them into the OPAC language, record syntax, composition of the records and character set. EMAIL:: baldacci@iei.pi.cnr.it
A Communication Layer for the Construction of Global, Transparent and Quasi-optimal Virtual Machines for Distributed Computing
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

The proposed communication layer is a software building block for constructing virtual machines. The construction process is user-transparent. Many distributed communication layers cooperate automatically to form a single global, quasi-optimal virtual machine to be shared by different parallel programs. The virtual machine conceptually sits between the running parallel processes and the underlying physically-distributed processors. It enables inter-process interaction and utilization of physical resources. Its nodes are mapped to different physical processors, and its performance depends on how echo packets are managed in the system. We combine three mechanisms to facilitate the operations in the communication layer, namely the forward rippling mechanism, the echoing mechanism, and the adaptive breadth-first forward successive inferencing mechanism.
Integration of Information in Four-Valued Logics under Non-Uniform Assumptions
Authors: Yann Loyer, Nicolas Spyratos, Daniel Stamate
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

We study the problem of integrating information coming from different sources in a distributed environment. We assume a central server that collects facts from sources and tries to combine them using a set of logical rules, i.e. a logic program. We provide a formal framework for the integration of information in such a setting, under non-uniform assumptions on the missing information.
A Performance Model for ATM Switches with Multiple Input Queues
Authors: Ge Nong, Jogesh K. Muppala, Mounir Hamdi
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

An analytical model for the performance analysis of a novel input access scheme for an ATM switch is developed and presented in this paper. The interconnection network of the ATM switch is internally nonblocking and each input port maintains a separate queue for each output port so as to reduce the head-of-line (HOL) blocking of conventional input queuing switches. Each input is allowed to send only one cell per time slot, and each output port is allowed to receive only one cell per time slot. Using a tagged queue approach, an analytical model with an underlying two-dimensional Markov chain with a state space of size (Queue Capacity * switch size) is constructed for evaluating the switch performance under i.i.d Bernoulli traffic for different offered traffic loads. The switch throughput, mean cell delay, and cell loss probability are computed from the analytical model. The accuracy of the analytical model is verified using simulation.
Smart Clothing for the Arctic Environment
Authors: J. Rantanen, T. Karinsalo, M. Mäkinen, P. Talvenmaa, M. Tasanen, J. Vanhala, N. Alfthan, J. Impiö, M. Malmivaara, R. Matala, A. Reho
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

New fiber and textile materials and miniaturized electronic components make it possible to create truly usable smart clothes. These intelligent clothes are worn like ordinary clothing providing help in various situations according to the designed application. This paper describes the design and implementation of a survival smart clothing prototype for the arctic environment. Concept development, electrical design, non-electrical features, textile material selection, and clothing design are discussed. Communication and positioning aids have been provided to the suit's user. Several human and the environment measurements decide whether an emergency message should be sent. The functionality of the suit has been tested in the arctic environment.
Partial up and down logic
Authors: Jan O.M. Jaspars
Venue:  (1995)

This paper presents logics for reasoning about extension and reduction of partial information states. This enterprise amounts to non-persistent variations of certain constructive logics, in particular the so-called logic of constructible falsity of [Nelson 1949.]. We provide simple semantics, sequential calculi, completeness and decidability proofs.
Formal Tools for Managing Inconsistency and Change in RE
Authors: Aditya K. Ghose
Venue: Proceedings of the 10th International Workshop on Software Specification and Design (2000)

Dealing with inconsistencies and change in requirements engineering is known to be a difficult problem. We propose a formal, integrated approach to inconsistency handling and requirements evolution with a focus on providing automated support. We define a novel representation scheme that is expressive and able to maintain several key semantic distinctions. Based on this scheme, we define a toolkit of inconsistency handling technique. We define a principled process for evolving such specifications, with minimal computational cost and user intervention. Finally, we describe the REFORM system, which implements some of these techniques.
Generation of Passion Images from "Tanka" Poems Based on the Synesthesia Phenomenon
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

This paper describes an investigation of the generation of surrealistic spaces that aim to achieve a new communications environment in which people can mutually convey their thoughts, mental images, and passions. Passion images here can be compared with conceptual images in the analogy of "logos versus pathos." Our focus was on the phenomenon of synesthesia, and the results shown are of the testing of color image creation involving "tanka" (i.e., 31-syllable Japanese poems), aiming at the generation of images where some passions are reflected rather than concrete scenes imagined from word meanings. In addition, this paper proposes an application that judges the similarity of pieces of music, showing the possibility of making instant, subjective judgements without need for a performance.
Combinations of Deformable Shape Prototypes
Authors: Saratendu Sethi, Stan Sclaroff
Venue:  (1999)

Abstract We propose to investigate a model-based technique for encoding non-rigid object classes in terms of object prototypes. Objects from the same class can be parameterized by identifying shape and appearance invariants of the class to devise low-level representations. The approach presented here creates a flexible model for an object class from a set of prototypes. This model is then used to estimate the parameters of low-level representation of novel objects as combinations of the prototype parameters. Variations in the object shape are modeled as non-rigid deformations. Appearance variations are modeled as intensity variations. In the training phase, the system is presented with several example prototype images. These prototype images are registered to a reference image by a finite element-based technique called Active Blobs. The deformations of the finite element model to register a prototype image with the reference image provide the shape description or shape vector for the prototype. The shape vector for each prototype, is then used to warp the prototype image onto the reference image and obtain the corresponding texture vector. The prototype texture vectors, being warped onto the same reference image have a pixel by pixel correspondence with each other and hence are ``shape normalized''''. Given sufficient number of prototypes that exhibit appropriate in-class variations, the shape and the texture vectors define a linear prototype subspace that spans the object class. Each prototype is a vector in this subspace. The matching phase involves the estimation of a set of combination parameters for synthesis of the novel object by combining the prototype shape and texture vectors. The strengths of this technique lie in the combined estimation of both shape and appearance parameters. This is in contrast with the previous approaches where shape and appearance parameters were estimated separately.
A multi-scale, multi-layer, translucent virtual space
Authors: H. Lieberman
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

The dynamic nature of virtual display spaces can provide powerful tools for helping people comprehend phenomena that occur over widely disparate spatial scales. This paper presents the macroscope, an interactive technique for browsing very large spaces of displayed information at different scales. The macroscope takes as a point of departure the traditional 2D zoom and pan operations, but introduces multiple translucent layers to avoid the problem of losing visual context. The third dimension is used to visually separate the layers and provide an external point of view for controlling the presentation. The user can manipulate viewfinders in the virtual space, which control the relative scale and position of the layers.
A Semantic Foundation for Architectural Reengineering and Interchange
Authors: Steven Woods, S. Jeromy Carriere, Rick Kazman
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

This is a paper describing our view on the importance of exchanging not only system information in the reengineering community, but also exchanging a description of the semantics that underly the extraction, annotation and augmentation of the information one wishes to exchange. The semantics are more than the schema of the information exchanged. They include the rationale for the structure of the schema itself. We also make the point that we need to be explicit about what it means to reconstruct architecture, in terms of the architectural semantics that we are hypothesizing for the system being analyzed. We present the discussion in the context of a revised set of levels based on the CORUM II model.
Development of a measure for the information technology infrastructure construct
Authors: Bruce R. Lewis, Terry Anthony Byrd
Venue: European Journal of Information Systems (2003)

The goal of this research was to operationalize the information technology infrastructure (ITI) concept by identifying its underlying dimensions and establishing a valid and reliable measure for the construct. In order to accomplish this task with the highest degree of certainty, two approaches were sequentially applied: exploratory factor analysis and confirmatory factor analysis. In evaluating the confirmatory factor model, a step-by-step process was employed, assessing unidimensionality, reliability, discriminant validity, and nomological validity. The dimensions of ITI were determined to be: Chief Information Officer, IT Planning, IT Security, Technology Integration, Advisory Committee, Enterprise Model, and Data Administration. Researchers may now make use of this validated ITI measure to conduct investigations of ITI and other organizational measures. Implications of the ITI measure with other organizational initiatives such as electronic commerce and knowledge management are explored.