ppxscal/embedding_network huggingface dataset:
The CRISIS wide area security architecture
Authors: Eshwar Belani, Amin Vahdat, Thomas Anderson, Michael Dahlin
Venue: Proceedings of the 7th conference on USENIX Security Symposium - Volume 7 (1998)

This paper presents the design and implementation of a new authentication and access control system, called CRISIS. A goal of CRISIS is to explore the systematic application of a number of design principles to building highly secure systems, including: redundancy to eliminate single points of attack, caching to improve performance and availability over slow and unreliable wide area networks, fine-grained capabilities and roles to enable lightweight control of privilege, and complete local logging of all evidence used to make each access control decision. Measurements of a prototype CRISIS-enabled wide area file system show that in the common case CRISIS adds only marginal overhead relative to unprotected wide area accesses.
Messiah College's Mobile Mentor: energizing pre-college students
Authors: S. Smith, T. L. Ireland, M. S. Roberti, D. L. Terry
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Messiah's Mobile Mentor [MMM] is an educational program designed to generate student interest in the mathematical, engineering, and scientific fields of studies. Specifically, this program contains a number of experiments and demonstrations presented to younger students (kindergarten through 12th grade) in their schools. The program is divided into five categories; mechanical, electrical, thermodynamic, chemical and environmental experiments/demonstrations. Three senior engineering students developed the format, designed the experiments and demonstrations, presented the program to three distinct age groups, and have provided feedback from both the students and teachers. The paper provides an overview of the program and the results of its first year of operation. Recommendations for improvements in the future are also made.
Efficient Parallel Computation of Projections for Animated Volume Visualization
Authors: Tung-Kuang Wu, Martin L. Brady
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

In this paper, we parallelize a new efficient approximate projection algorithm for volume rendering. The algorithm is unique in that it computes N different views simultaneously, much faster than these projections could be computed independently. It is thus ideal for computing animated sequences of views. We implement and evaluate the algorithm on a MasPar MP-1. We render a 128x128x128 data set at up to 21 frames per second average on a 1K PE MasPar MP-1 using gray scale volumetric compositing (simpler transformations are computed even faster).
A representation independent language for planar spatial databases with Euclidean distance
Authors: Gabriel M. Kuper, Jianwen Su
Venue: Journal of Computer and System Sciences (2007)

Linear constraint databases and query languages are appropriate for spatial database applications. Not only is the data model suitable for representing a large portion of spatial data such as in GIS systems, but there also exist efficient algorithms for the core operations in the query languages. An important limitation of linear constraints, however, is that they cannot model constructs such as Euclidean distance; extending such languages to include such constructs, without obtaining the full power of polynomial constraints has proven to be quite difficult. One approach to this problem, by Kuijpers, Kuper, Paredaens, and Vandeurzen, used the notion of Euclidean constructions with ruler and compass as the basis for a first order query language. While their language had the desired expressive power, the semantics are not really natural, due to its use of an ad hoc encoding. In this paper, we define a language over a similar class of databases, with more natural semantics. We show that this language captures a natural subclass, the representation independent queries of the first order language of Kuijpers, Kuper, Paredaens, and Vandeurzen.
Matching of faces in camera images and document photographs
Authors: V. Starovoitov
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

An automatic system for the person identification based on comparison of a camera image and a document photo presents several design difficulties. The main complication arises from the fact that the document photo may represent quite a different appearance of the test person, i.e., an older version, sometimes by years, or with a different hairstyle, facial expression and lighting conditions. In addition the scanned photo is usually of a much lower quality. In this paper elements of a system for a face comparison between camera images and archival photo albums are discussed and experimental results are given. Such a system may be instrumental for document control or for police investigations.
Electronic Detection of DNA Hybridization: Toward CMOS Microarrays
Authors: Luca Benini, Carlotta Guiducci, Christian Paulus
Venue: IEEE Design Test (2007)

DNA microarrays are among the key technology enablers for the tumultuous development of biology and medicine triggered by high-throughput genomics. As microarray-based methods for analysis and diagnosis become more pervasive, there is an ever-growing demand for low-cost, highly integrated microarrays for point-of-care usage. This article focuses on fully electronic approaches that integrate DNA sensor arrays and circuits for transduction, amplification, digital conversion, and readout of signals on a single CMOS chip. Prototypes of these devices have obtained promising results.
Connections: marketing the University of Arkansas College of Engineering
Authors: O. J. Loewer
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

This is the first in a series of six companion papers that address the marketing of the College of Engineering at the University of Arkansas, Fayetteville, USA. While valuable as an independent resource, the content of this document should be considered within the context of all six papers. The University of Arkansas College of Engineering has been involved in a comprehensive proactive marketing effort since February, 2000, designed to help them meet their goal of becoming a top-25 public college of engineering as measured by the number of tenure/tenure track faculty and degree and research productivity. They are in the process of altering their collective engineering culture about the role of marketing. Marketing tools that meet their needs have been identified and utilized with some success. However, there are many issues that have to be addressed on a regular basis.
Efficient method for carrier offset correction in OFDM system
Authors: Hongya Ge
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

We present a simple approach to estimate and correct the carrier offset in an orthogonal frequency division multiplexing (OFDM) system. The approach leads to a computationally and statistically efficient estimator for the carrier offset. Computer simulations verify that the estimation accuracy is comparable to the Cramer-Rao bound (CRB). We demonstrated that by incorporating the estimated carrier offset (obtained using reasonable frames of OFDM data) in the demodulation process, the bit error rate (BER) can approach that of the ideal OFDM system with no carrier offset.
The emergence of networking abstractions and techniques in TinyOS
Authors: Philip Levis, Sam Madden, David Gay, Joseph Polastre, Robert Szewczyk, Alec Woo, Eric Brewer, David Culler
Venue: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1 (2004)

The constraints of sensor networks, an emerging area of network research, require new approaches in system design. We study the evolution of abstractions and techniques in TinyOS, a popular sensor network operating system. Examining CVS repositories of several research institutions that use TinyOS, we trace three areas of development: single-hop networking, multi-hop networking, and network services. We note common techniques and draw conclusions on the emerging abstractions as well as the novel constraints that have shaped them.
Distributed infrastructures for network data correlation
Authors: Ramesh Govindan
Venue:  (2006)

Distributed data correlation is an extremely important component for many networked applications including searching, monitoring, and anomaly detection, to name a few. In large wireless and wired networks, such as sensor networks and the Internet, it is possible and feasible to build distributed infrastructures that provide users with a distributed data correlation facility. To date, however, there have not been many successful infrastructures designed and especially implemented for distributed data correlation purposes. In this thesis, we address the design and implementation of distributed infrastructures for distributed data correlation. First, we discuss a distributed indexing system, DIM, that supports multi-dimensional range queries for wireless sensor networks. We show that the insertion and query costs in DIM scale as O( N ) under reasonable assumptions of query distributions. We also describe a simple but efficient approach to balance DIM in a realistic sensor network workload. Second, we discuss the design and implementation of an Internet distributed indexing system, MIND, that is specially designed for network monitoring applications. We present the details of MIND, including tuple insertion, query processing, loading balancing, and robustness under failures. We deployed a prototype of MIND on more than 100 nodes on the planet-lab and validated it with traffic traces from two large backbone networks: Abilene and G&Eacute;ANT. Finally, we propose Defeat, a novel network-wide anomaly detection scheme which emphasize on high detection confidence and high robustness against failures or attacks. We show how one can use random aggregations of IP flows to enable more precise identification of the underlying causes of anomalies. We show how to combine traffic sketches with a subspace method to detect anomalies with high accuracy and identify the IP flows that are responsible for the anomaly. The Defeat approach has detection rates comparable to previous methods and detects many more anomalies than prior work, taking us a step closer towards a robust on-line system for anomaly detection and identification.
Optimization techniques for curved path computing
Authors: Adolfo Mu&#x00f1;oz, Diego Gutierrez, Francisco J. Ser&#x00f3;n
Venue: The Visual Computer: International Journal of Computer Graphics (2007)

Participating media with an inhomogeneous index of refraction make light follow curved paths. Simulating this in a global illumination environment has usually been neglected due to the complexity of the calculations involved, sacrificing accurate physical simulations for efficient visual results. This paper aims to simulate non-linear media in a more reasonable time than previous works without losing physical correctness. Accuracy is achieved by solving the Eikonal equation of geometrical optics, which describes the path followed by a light beam that traverses a non-linear medium. This equation is used in the context of a photon mapping extension. To improve the efficiency of the method, we study the existing correlation between numerical methods and the description of the non-linear medium, in terms of simulation time and error. Also, by taking advantage of several features of the scenes that include non-linear media, new optimization techniques that can be applied both for ray tracing and photon mapping will be developed. Flight or driving simulators could greatly benefit from this work.
Risc+simd=dsp?
Authors: H. Shi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

The adoptions of RISC (reduced instruction set computer) and SIMD (single instruction multiple data) architectures in processor design have been proven great successes in boosting processor performance. System designers and processor architects are now asking if the combination of both can produce a unified digital signal processor (DSP)/microcontroller (MC) for system-on-a-chip design. The unified processor is particularly suited for cost reduction of handheld systems such as cellular phone and speech interface applications. This paper discusses various aspects that contribute to the answer of this question as well as the top-level design tradeoffs.
A Backjumping Search Algorithm for a Distributed Memory Multicomputer
Authors: James M. Conrad, Jerry Mathew
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

Solving Constraint Satisfaction Problems (CSPs) has been subject to intense study by earlier researchers because CSPs can be used to model a whole variety of practical real world problems. This work involves investigation of the performance of parallel backtracking algorithms for solving CSPs. Two classes of backtracking search algorithms are considered: i) chronological backtracking, and ii) dependency directed backtracking, called backjumping. Results show that the new parallel backjumping algorithm retains the efficiency that the sequential algorithm exhibits, while realizing twice the speedup of parallel backtracking for random constraint networks.
Cramer-Rao bounds for continuous-time AR parameter estimation with irregular sampling
Authors: E. K. Larsson, E. G. Larsson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Consider the problem of estimating the parameters in a continuous-time autoregressive (AR) model given measurements taken at arbitrary time instants. In this paper the Cramer-Rao bound for this problem is derived by using a technique based on the Slepian-Bang's formula and residue calculus. Furthermore, we investigate by means of numerical experiments how different sampling schemes can affect the accuracy. Interestingly enough, however, for the examples studied, the estimation accuracy is relatively insensitive to the choice of sampling strategy.
Association rule computation using lexicographic order combination
Authors: Shounak Roychowdhury
Venue: Integrated Computer-Aided Engineering (2003)

Association rules in data mining are used in order to discover latent information hidden in databases. The class of apriori algorithms provide a simple way to compute association rules. Despite the simplicity of the algorithm its computational complexity is quite high. Specifically, the computational performance degrades due to intense computational requirements during the phase of frequent itemset generation. In this paper we have proposed a novel procedure to extract frequent itemsets. The itemset is modeled as a cell of a hypercube, and this cell is represented as a lexicographical order combination. The procedure described in this paper reduces the number of database passes to a single pass to extract frequent itemsets. Thus, the procedure is computationally attractive.
Specifying and controlling multi-channel web interfaces for enterprise applications
Authors: Matthias Book, Volker Gruhn
Venue: Information Systems Frontiers (2007)

When building enterprise applications that need to be accessed through a variety of client devices, developers usually strive to implement most of the business logic device-independently while using a web browser to display the user interface. However, when those web-based front-ends shall be rendered on different devices, their differing I/O capabilities may require device-specific interaction patterns that still need to be specified and implemented efficiently. We present an approach for specifying the dialog flows in multi-channel web interfaces with very low redundancy and introduce a framework that controls web interfaces' device-specific dialog flows according to those specifications, while keeping the enterprise application logic completely device-independent.
Scale-Free Overlay Topologies with Hard Cutoffs for Unstructured Peer-to-Peer Networks
Authors: Hasan Guclu, Murat Yuksel
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

In unstructured peer-to-peer (P2P) networks, the overlay topology (or connectivity graph) among peers is a crucial component in addition to the peer/data organization and search. Topological characteristics have profound impact on the efficiency of search on such unstructured P2P networks as well as other networks. A key limitation of scalefree (power-law) topologies is the high load (i.e. high degree) on very few number of hub nodes. In a typical unstructured P2P network, peers are not willing to maintain high degrees/loads as they may not want to store large number of entries for construction of the overlay topology. So, to achieve fairness and practicality among all peers, hard cutoffs on the number of entries are imposed by the individual peers, which limits scale-freeness of the overall topology. Thus, it is expected that efficiency of the flooding search reduces as the size of the hard cutoff does. We investigate construction of scale-free topologies with hard cutoffs and effect of these hard cutoffs on the search efficiency.
Integrating pattern-based and distributional similarity methods for lexical entailment acquisition
Authors: Shachar Mirkin, Ido Dagan, Maayan Geffet
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

This paper addresses the problem of acquiring lexical semantic relationships, applied to the lexical entailment relation. Our main contribution is a novel conceptual integration between the two distinct acquisition paradigms for lexical relations - the pattern-based and the distributional similarity approaches. The integrated method exploits mutual complementary information of the two approaches to obtain candidate relations and informative characterizing features. Then, a small size training set is used to construct a more accurate supervised classifier, showing significant increase in both recall and precision over the original approaches.
A secure environment for untrusted helper applications confining the Wily Hacker
Authors: Ian Goldberg, David Wagner, Randi Thomas, Eric A. Brewer
Venue: Proceedings of the 6th conference on USENIX Security Symposium, Focusing on Applications of Cryptography - Volume 6 (1996)

Many popular programs, such as Netscape, use untrusted helper applications to process data from the network. Unfortunately, the unauthenticated network data they interpret could well have been created by an adversary, and the helper applications are usually too complex to be bug-free. This raises significant security concerns. Therefore, it is desirable to create a secure environment to contain untrusted helper applications. We propose to reduce the risk of a security breach by restricting the program's access to the operating system. In particular, we intercept and filter dangerous system calls via the Solaris process tracing facility. This enabled us to build a simple, clean, user-mode implementation of a secure environment for untrusted helper applications. Our implementation has negligible performance impact, and can protect pre-existing applications.
Investigating perceptual responses and shared understanding of architectural design ideas when communicated through different forms of visual representations
Authors: Nada Bates-Brkljac
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Research to date has demonstrated the apparent differences how architects, as "experts' and members of the public as "non-experts' perceive and understand visual representations. However, the studies that compare architect' responses with other professionals in the field are rare. This paper reports the findings from an Economic and Social science Research Council (ESRC) funded study that investigated peoples' perceptual and cognitive responses to traditional and computer generated forms of architectural representations. The study and analysis provide an insight into factors that are relevant to the communication, shared understanding of design ideas and knowledge exchange amongst the participants in the process. Findings indicate strong resemblance between professionals' and "lay' peoples' responses. Architects' responses vary depending on the age and length of work experience. The analysis of groups' accounts of how and why they prefer and value the forms they do shows the fracturing of communication and shared understanding amongst participants.
A workflow approach to designed reservoir study
Authors: Gabrielle Allen, Promita Chakraborty, Dayong Huang, Zhou Lei, John Lewis, Xin Li, Christopher D. White, Xiaoxi Xu, Chongjie Zhang
Venue: Proceedings of the 2nd workshop on Workflows in support of large-scale science (2007)

Reservoir simulations are commonly used to predict the performance of oil and gas reservoirs, taking into account a myriad of uncertainties in the geophysical structure of the reservoir as well as operational factors such as well location. Designed reservoir study provides a robust tool to quantify the impact of uncertainties in model input variables, and can be used to simulate, analyze, and optimize reservoir development. However, such studies are computationally challenging, involving massive (terabyte or petabyte) geographically distributed datasets and requiring hundreds or tens of thousands of simulation runs. Providing petroleum engineers with integrated workflow through a secure and easy-to-use user interface will enable new advanced reservoir studies. This paper describes the workflow solution and user interface designed and implemented for reservoir uncertainty analysis in the UCoMS project ( Ubiquitous Computing and Monitoring System for discovery and management of energy resources).
Innovation Patterns in KIBS Organizations: A Case Study of Finnish Technical Engineering Industry
Authors: Ville Ojanen, Pekka Salmi, Marko Torkkeli
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The innovation patterns in Finnish engineering consultancies are analyzed in terms of service innovation types. The utilized typology of service innovations includes four dimensions: new service concepts, new client interfaces, organizational innovations and technological options. The empirical findings indicate that innovations in Finnish engineering consultancies mainly occur as client-led innovations and innovations through services. Typical examples of innovations are related to new organizational models and networks, which help working with the clients, and technology-based innovations, which can take the form of new software. Based on the analysis, we draw some preliminary conclusions about the general development needs in innovation patterns of the engineering consultancy sector. We also outline some potential directions for future studies.