ppxscal/embedding_network huggingface dataset:
Making Home Automation Communications Secure
Authors: Peter Bergstrom, Kevin Driscoll, John Kimball
Venue: Computer (2001)

Long the futuristic domain of hobbyists, home automation is now moving to the mainstream. This domain involves three significant technological developments:Focused subsystems consist of specific home features that use local information to automate desired performance, such as programmable thermostats that change home temperature based on a time schedule.Integrated whole-home behavior lets users combine safety, comfort, health, information, and entertainment needs into one system that, for example, can change environmental settings based on variable home occupant activities rather than a fixed time schedule.Distributed-home-automation applications, enabled by widespread adoption of the Internet, run substantially outside the home, eliminating the need for a PC and making these applications easy to upgrade or tailor for specific individuals and markets.Although these new communications technologies offer numerous benefits, they also open home automation to many security threats. To protect against these threats within the limited resources of a typical home automation system, the authors have developed a family of products based on Honeywell's Global Home Server, a remote Web site that provides secure Internet access and other services to client installations.The GHS system is now operational, with initial product deployments in both the United States and Europe. Expanding on this work, the authors are developing security products that use different media and processors, can function in aircraft as well as in homes, and run various novel applications.
On the nonapproximability of boolean Function by OBDDs and read-k-times Branching Programs
Authors: Beate Bolling, Martin Sauerhoff, Ingo Wegener
Venue: Information and Computation (2002)

Branching programs are considered as a nonuniform model of computation in complexity theory as well as a data structure for boolean functions in several applications. In many applications (e.g., verification), exact representations are required. For learning boolean functions f on the basis of classified examples, it is sufficient to produce the representation of a function g approximating f. This motivates the investigation of the size of the smallest branching program approximating f. Although several nonapproximability results are contained in the papers on randomized branching programs, these results often do not work for the uniform distribution (which is the most important one in applications). Here, the following nonapproximability results are presented.(1) It is proven that two simple and well-known functions from the branching program literature require exponential size to be approximated with respect to the uniform distribution by OBDDs, which are the most important type of branching programs in applications.(2) The first truly exponential lower bound on the size of approximating syntactic read-k-times branching programs with respect to the uniform distribution and error probability 1/2 - 2-Ω(n), n the input size, is shown. In order to improve upon the best previous results for error probabilities smaller than 1/3, a strong combinatorial lemma from a paper of Ajtai on linear-length branching programs is exploited.
Fuzzy morphisms between graphs
Authors: Aymeric Perchant, Isabelle Bloch
Venue: Fuzzy Sets and Systems (2002)

A generic definition of fuzzy morphism between graphs (GFM) is introduced that includes classical graph related problem definitions as sub-cases (such as graph and subgraph isomorphism). The GFM uses a pair of fuzzy relations, one on the vertices and one on the edges. Each relation is a mapping between the elements of two graphs. These two fuzzy relations are linked with constraints derived from the graph structure and the notion of association graph. The theory extends the properties of fuzzy relation to the problem of generic graph correspondence. We introduce two complementary interpretations of GFM from which we derive several interesting properties. The first interpretation is the generalization of the notion of association compatibility. The second is the new notion of edge morphism. One immediate application is the introduction of several composition laws. Each property has a theoretical and a practical interpretation in the problem of graph correspondence that is explained throughout the paper. Special attention is paid to the formulation of a non-algorithmical theory in order to propose a first step towards a unified theoretic framework for graph morphisms.
Managing Locality Sets: The Model and Fixed-Size Buffers
Authors: A. Choi, M. Ruschitzka
Venue: IEEE Transactions on Computers (1993)

A memory-management model based on describing reference behavior in terms of locality-set sequences is proposed. Specialized for fixed-size buffers, this model is used to define the PSETMIN and SETMIN strategies which are proven to minimize the number of page faults in the presence and absence of prepaging, respectively. In contrast to MIN, they are also realizable for certain computations. The methodology for obtaining the locality-set sequence of a computation in advance is illustrated for relational database management systems with multiattribute-index catalogs, and the concomitant performance gains are discussed. In general, for applications that maintain their own organized collections of data, optimal locality-set management of individual computations provides an alternative to the widely used general-purpose strategies based on heuristics.
Bitwidth aware global register allocation
Authors: Sriraman Tallam, Rajiv Gupta
Venue: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2003)

Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a register, only part of the register is used. New embedded processors have started supporting instruction sets that allow direct referencing of bit sections within registers and therefore multiple subword variables can be made to simultaneously reside in the same register without hindering accesses to these variables. However, a new register allocation algorithm is needed that is aware of the bitwidths of program variables and is capable of packing multiple subword variables into a single register. This paper presents one such algorithm.The algorithm we propose has two key steps. First, a combination of forward and backward data flow analyses are developed to determine the bitwidths of program variables throughout the program. This analysis is required because the declared bitwidths of variables are often larger than their true bitwidths and moreover the minimal bitwidths of a program variable can vary from one program point to another. Second, a novel interference graph representation is designed to enable support for a fast and highly accurate algorithm for packing of subword variables into a single register. Packing is carried out by a node coalescing phase that precedes the conventional graph coloring phase of register allocation. In contrast to traditional node coalescing, packing coalesces a set of interfering nodes. Our experiments show that our bitwidth aware register allocation algorithm reduces the register requirements by 10\% to 50% over a traditional register allocation algorithm that assigns separate registers to simultaneously live subword variables.
Visualizing 2D probability distributions from EOS satellite image-derived data sets: a case study
Authors: David Kao, Jennifer L. Dungan, Alex Pang
Venue: Proceedings of the conference on Visualization '01 (2001)

Maps of biophysical and geophysical variables using Earth Observing System (EOS) satellite image data are an important component of Earth science. These maps have a single value derived at every grid cell and standard techniques are used to visualize them. Current tools fall short, however, when it is necessary to describe a distribution of values at each grid cell. Distributions may represent a frequency of occurrence over time, frequency of occurrence from multiple runs of an ensemble forecast or possible values from an uncertainty model. We identify these "distribution data sets" and present a case study to visualize such 2D distributions. Distribution data sets are different from multivariate data sets in the sense that the values are for a single variable instead of multiple variables. Data for this case study consists of multiple realizations of percent forest cover, generated using a geostatistical technique that combines ground measurements and satellite imagery to model uncertainty about forest cover. We present two general approaches for analyzing and visualizing such data sets. The first is a pixel-wise analysis of the probability density functions for the 2D image while the second is an analysis of features identified within the image. Such pixel-wise and feature-wise views will give Earth scientists a more complete understanding of distribution data sets. See www.cse.ucsc.edu/research/avis/nasa_is for additional information.
Probabilistic Model and Optimal Reorganization of B+-Tree with Physical Clustering
Authors: June S. Park, V. Sridhar
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

We consider a variant of B+-tree called the B+-tree with physical clustering (BC), which is exemplified by VSAM key-sequenced datasets. In this file, logically contiguous data buckets are physically clustered in a storage unit called a region in order to enhance the efficiency of sequential processing. As a consequence, records in a bucket are redistributed over time according to two different split algorithms: bucket split and region split. A stochastic model of the disorganization of BC files is constructed using order statistics. Database administrators of on-line transaction systems often need to reorganize BC files before a region split occurs. An efficient algorithm for determining the optimal reorganization time of BC files is developed. Analytic results are validated by simulation. In passing, we discuss guidelines for load-time configuration of BC files.
Petri-net-based hypertext: document structure with browsing semantics
Authors: P. David Stotts, Richard Furuta
Venue: ACM Transactions on Information Systems (TOIS) (1989)

We present a formal definition of the Trellis model of hypertext and describe an authoring and browsing prototype called &agr;Trellis that is based on the model. The Trellis model not only represents the relationships that tie individual pieces of information together into a document (i.e., the adjacencies), but specifies the browsing semantics to be associated with the hypertext as well (i.e., the manner in which the information is to be visited and presented). The model is based on Petri nets, and is a generalization of existing directed graph-based forms of hypertext. The Petri net basis permits more powerful specification of what is to be displayed when a hypertext is browsed and permits application of previously developed Petri net analysis techniques to verify properties of the hypertext. A number of useful hypertext constructs, easily described in the Trellis model, are presented. These include the synchronization of simultaneous traversals of separate paths through a hypertext, the incorporation of access controls into a hypertext (i.e., specifying nodes that can be proven to be accessible only to certain classes of browsers), and construction of multiple specialized (tailored) versions from a single hypertext.
Systematic Random Error Correcting and all Unidirectional Error Detecting Codes
Authors: B. L. Montgomery, B. V. K. Kumar
Venue: IEEE Transactions on Computers (1990)

t-random-error correcting and all-unidirectional-error detecting (t-EC/AUED) codes obtained by appending a suffix to each codeword of a linear block code are presented. Although this technique has been previously used to construct such codes, a different approach is proposed that involves starting with a nonoptimal t-EC linear code to obtain more efficient t-EC/AUED codes. Specifically, t-EC/AUED codes constructed from an even-weight t-EC linear code are shown to require a shorter suffix than when a general t-EC linear code is used. The t-EC/AUED codes obtained in this manner are thoroughly compared to the best known codes, and are shown to require fewer bits in almost all cases.
Scale-Space and Edge Detection Using Anisotropic Diffusion
Authors: P. Perona, J. Malik
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

A new definition of scale-space is suggested, and a class of algorithms used to realize a diffusion process is introduced. The diffusion coefficient is chosen to vary spatially in such a way as to encourage intraregion smoothing rather than interregion smoothing. It is shown that the 'no new maxima should be generated at coarse scales' property of conventional scale space is preserved. As the region boundaries in the approach remain sharp, a high-quality edge detector which successfully exploits global information is obtained. Experimental results are shown on a number of images. Parallel hardware implementations are made feasible because the algorithm involves elementary, local operations replicated over the image.
Robots in the laboratory
Authors: Stella Atkins, Lou Hafer, Patrick Leung
Venue: ACM SIGCSE Bulletin (1988)

A $70 toy robot has been successfully used in Computer Science undergraduate laboratory courses in real-time programming and advanced operating systems to provide students with hands on experience. A custom designed interface card connects a Radio Shack Armatron toy mobile robot with an IBM PC. To provide sensory input and hence introduce feedback, the robot is shackled to a track filled with sensors. Extra sensors in the robot's environment allow challenging experiments such as picking up an object from a moving belt. While programming the robot and its environment in Turbo Pascal, the students learn how to write software drivers to control low level hardware that requires real-time response. This experimental design obviates the need to use sophisticated test equipment or special software development tools, and so the robot has transformed potentially routine courses into a exciting and fulfilling learning experiences.
Automatic generation of behavioral models from switch-level descriptions
Authors: D. T. Blaauw, D. G. Saab, R. B. Mueller-Thuns, J. A. Abraham, J. T. Rahmeh
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

This paper discusses the automatic generation of high-level software models from switch-level circuit descriptions. The proposed algorithms operate directly on the hierarchical description, and incorporate information about the design such as the structure, regularity, functionality, and control signals in the generation process. New algorithms are proposed and have been implemented for combinational modules and bus structures. A significant speedup has been obtained for these modules of a commercially available chip.
The control of computerized information relating to branch manpower management follow-up systems for banks
Authors: A. Rushinek, S. Rushinek
Venue: ACM SIGCPR Computer Personnel (1989)

The content of information control in complex organizations continues to be a source of interest for both researchers and business managers. This study attempts to demonstrate the application of model-sampling and its effects in relation to accuracy, frequency and recency of data under scrutiny. The study uses a linear model to measure and forecast. The findings of this study are applicable not only to banks but also to Accounting Information Systems (AIS) in general. Moreover, they are as applicable to a computerized follow-up survey as to the initial manual system survey. In fact, this study presents an approach for conducting a follow-up program using an on-line interactive evaluation system.
Problem-solution mapping in object-oriented design
Authors: M. B. Rosson, E. Gold
Venue: Conference proceedings on Object-oriented programming systems, languages and applications (1989)

Six expert Smalltalk programmers and three expert procedural programmers were observed as they worked on a gourmet shopping design problem; they were asked to think aloud about what was going through their minds as they worked. These verbal protocols were recorded and examined for ways in which the programmers' understanding of the problem domain affected the design process; most of our examples are from the three Smalltalk programmers who focussed most on the mapping from problem to solution. We characterize the problem entities that did appear as solution objects, the active nature of the mapping process, and ways in which the resultant objects went beyond their problem analogs.
The use of cluster hierarchies in hypertext information retrieval
Authors: D. B. Crouch, C. J. Crouch G. Andreas
Venue: Proceedings of the second annual ACM conference on Hypertext (1989)

The graph-traversal approach to hypertext information retrieval is a conceptualization of hypertext in which the structural aspects of the nodes are emphasized. A user navigates through such hypertext systems by evaluating the semantics associated with links between nodes as well as the information contained in nodes. [Fris88] In this paper we describe an hierarchical structure which effectively supports the graphical traversal of a document collection in a hypertext system. We provide an overview of an interactive browser based on cluster hierarchies. Initial results obtained from the use of the browser in an experimental hypertext retrieval system are presented.
Recruiting more computer science students&mdash;what to do after the &ldquo;glamour&rdquo; has gone away?
Authors: William E. McBride, James Calhoun, James L. Richards, Harriet G. Taylor, F. Garnet Walters
Venue: ACM SIGCSE Bulletin (1988)

The moderator will first focus on the question: &ldquo;Are enrollments actually declining in computer science programs across this country?&rdquo; He will report the results of his surveys which indicate there has been a definite downturn in enrollment over the past two years. The panelists will then discuss what is being done at their schools to recruit students and to meet this new challenge of declining enrollments.
Linearization of Nonlinear Recursive Rules
Authors: D. J. Troy, C. T. Yu, W. Zhang
Venue: IEEE Transactions on Software Engineering (1989)

The problem of converting a simple nonlinear recursive logic query into an equivalent linear one is considered. A general method is given to transform a nonlinear rule into a sequence of linear ones. For efficient processing it is necessary to convert a nonlinear rule into a single linear rule. For such a conversion, a necessary and sufficient condition is provided for a type of doubly recursive rule to be equivalent to the resulting linear rule. It is also shown that a restricted type of higher order recursive rule is equivalent to the linear rule obtained by its conversion.
A case study of user interface management system development and application
Authors: J. M. Manheimer, R. C. Burnett, J. A. Wallers
Venue: ACM SIGCHI Bulletin (1989)

This paper discusses the design and applications of an object-oriented user interface management system (UIMS). Specifically, the Lockheed User Interface System (LUIS) is described. LUIS is based on a user interface model that includes declarative and procedural components. The package has been used by both non-programmers and programmers in several applications at Lockheed. Experiences derived from applications of the package are used to address several key issues in the UIMS field, such as procedural versus declarative specification, separation of the user interface from applications, UIMS flexibility, and UIMS support for design evaluation.
Modeling the user's plans and goals
Authors: Sandra Carberry
Venue: Computational Linguistics (1988)

This work is an ongoing research effort aimed both at developing techniques for inferring and constructing a user model from an information-seeking dialog and at identifying strategies for applying this model to enhance robust communication. One of the most important components of a user model is a representation of the system's beliefs about the underlying task-related plan motivating an information-seeker's queries. These beliefs can be used to interpret subsequent utterances and produce useful responses. This paper describes the IREPS system, emphasizing its dynamic construction of the task-related plan motivating the information-seeker's queries and the application of this component of a user model to handling utterances that violate the pragmatic rules of the system's world model. By reasoning on a model of the user's plans and goals, the system often can deduce the intended meaning of faulty utterances and allow the dialogue to continue without interruption. Some limitations of current plan inference systems are discussed. It is suggested that the problem of detecting and recovering from discrepancies between the system's model of the user's plan and the actual plan under construction by the user requires an enriched model that differentiates among its components on the basis of the support the system accords each component as a correct and intended part of the user's plan.
A scheme for overlaying concurrent testing of VLSI circuits
Authors: W.-B. Jone, C. A. Papachristou, M. Pereira
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

This paper presents a test scheduling method, called overlaying concurrent testing, for built-in testing of VLSI circuits. The scheme is based on a resource-conflict analysis of subcircuits and a scheduling algorithm. The algorithm fully exploits test parallelism by overlaying the test intervals of compatible subcircuits to test as many of them as possible concurrently. The technique is supported by a test hardware architecture whose design is well coordinated with the test scheduling leading to a considerable reduction of testing time, as demonstrated by simulation experiments.
Dynamic versus static menus: an exploratory comparison
Authors: J. Mitchell, B. Shneiderman
Venue: ACM SIGCHI Bulletin (1989)

Sixty-three subjects completed 24 tasks using a menu driven computer program. The menu items appeared in a fixed (static) order during 12 of the tasks. During the other 12 tasks the menu item order changed dynamically such that the most frequently selected items always appeared at the top of the menu. All the subjects tried both dynamic and static menus.The subjects that used adaptive dynamic menus for the first set of tasks were significantly slower than those who used static menus on the first set of tasks. Subjects' performance during the second set of tasks was not affected by menu style. Eighty-one percent of the subjects preferred working with static menus to working with dynamic menus.
Seismic migration algorithms on parallel computers
Authors: V. K. Madisetti, D. G. Messerschmitt
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

Seismic signal processing is computationally intensive and sequential algorithms in use do not exploit the concurrency inherent in data migration techniques. In this paper we study seismic migration algorithms with a view to present a general framework for analyzing such algorithms and propose some coarse-grained paradigms for computation on parallel computers. We analyze a few typical examples of the different migration techniques existing in literature, and discuss techniques to optimize their performance on distributed concurrently executing processors. The computational and communication requirements of the algorithms are discussed and diverse optimization techniques are proposed. The memory limitation, I/O bottleneck and computational tradeoffs on hypercube multiprocessors are analyzed [1,8,9].