ppxscal/embedding_network huggingface dataset:
Graphical and text-based design interfaces for parameter design of an I-beam, desk lamp, aircraft wing, and job shop manufacturing system
Authors: Timothy W. Simpson, Mary Frecker, Russell R. Barton, Ling Rothrock
Venue: Engineering with Computers (2007)

In this paper we describe four design optimization problems and corresponding design interfaces that have been developed to help assess the impact of fast, graphical interfaces for design space visualization and optimization. The design problems involve the design of an I-beam, desk lamp, aircraft wing, and job shop manufacturing system. The problems vary in size from 2 to 6 inputs and 2 to 7 outputs, where the outputs are formulated as either a multiobjective optimization problem or a constrained, single objective optimization problem. Graphical and text-based design interfaces have been developed for the I-beam and desk lamp problems, and two sets of graphical design interfaces have been developed for the aircraft wing and job shop design problems that vary in the number of input variables and analytical complexity, respectively. Response delays ranging from 0.0 to 1.5&#x00a0;s have been imposed in the interfaces to mimic computationally expensive analyses typical of complex engineering design problems, allowing us to study the impact of delay on user performance. In addition to describing each problem, we discuss the experimental methods that we use, including the experimental factors, performance measures, and protocol. The focus in this paper is to publicize and share our design interfaces as well as our insights with other researchers who are developing tools to support design space visualization and exploration.
The Xft font library: architecture and users guide
Authors: Keith Packard
Venue: Proceedings of the 5th annual Linux Showcase & Conference - Volume 5 (2001)

The X Render Extension provides a new glyph rendering architecture based on client-side glyph and font management. While this resolves many tough technical issues relating to the extension design, it places the burden of rasterizing, configuring and customizing font usage on every X client. The Xft library was written to provide X applications a convenient interface to the FreeType font rasterizer and the Render extension. As FreeType provides for no configuration or customization, Xft also performs this task. Xft provides new font naming conventions, sophisticated font matching and selection mechanisms and sufficient abstractions to permit common applications to benefit from Render extension based text output while still working on X servers without support for this extension.
Students' understanding of computer science soft ideas: the case of programming paradigm
Authors: Yuila Stolin, Orit Hazzan
Venue: ACM SIGCSE Bulletin (2007)

The article presents a research that focused on how the concept programming paradigm is understood in general, and on the understanding of the following three programming paradigms, in particular: functional, procedural, and object-oriented. The research population included seventeen prospective computer science teachers who were participating in a "Programming Paradigms" course. Research observations are organized within a framework that categorizes students' thinking about the concept of programming paradigm in three levels of abstraction.
An examination of vote verification technologies: findings and experiences from the Maryland study
Authors: Alan T. Sherman, Aryya Gangopadhyay, Stephen H. Holden, George Karabatis, A. Gunes Koru, Chris M. Law, Donald F. Norris, John Pinkston, Andrew Sears, Dongsong Zhang
Venue: Proceedings of the USENIX/Accurate Electronic Voting Technology Workshop 2006 on Electronic Voting Technology Workshop (2006)

We describe our findings and experiences from our technical review of vote verification systems for the Maryland State Board of Elections (SBE). The review included the following four systems for possible use together with Maryland's existing Diebold AccuVote-TS (touch screen) voting system: VoteHere Sentinel; SCYTL Pnyx.DRE; MIT-Selker audio system; Diebold voter verified paper audit trail. As a baseline, we also examined the SBE's procedures for "parallel testing" of its Diebold system. For each system, we examined how it enables voters who use touch screens to verify that their votes are cast as intended, recorded as cast, and reported as recorded. We also examined how well it permits post-election auditing. To this end, we considered implementation, impact on current state voting processes and procedures, impact on voting, functional completeness, security against fraud, attack and failure, reliability, accessibility, and voter privacy. Our principal findings are, first, that each system we examined may at some point provide a degree of vote verification beyond what is available through the Diebold System as currently implemented, provided the system were fully developed, fully integrated with the Diebold system, and effectively implemented. Second, none of the systems is yet a fully developed, commercially ready product. This interdisciplinary study-the first of its kind-is of interest for the way in which it evaluates the systems, for the technical questions it raises about standard interfaces, and as a snapshot of the state of vote verification technologies and their commercial development.
MESHMdl event spaces - A coordination middleware for self-organizing applications in ad hoc networks
Authors: Klaus Herrmann, Gero Mühl, Michael A. Jaeger
Venue: Pervasive and Mobile Computing (2007)

Mobile ad hoc networks (MANETs) are gaining importance as a promising technology for flexible, proximity-based, mobile communication. However, the inherent dynamics of MANETs imposes strong limitations on the design of distributed applications. They need to be able to adapt to changing conditions quickly and organize themselves in terms of component placement and communication habits. In this paper, we present MESHMdl, a middleware that provides a high level of awareness and decoupling for application components to make them more flexible and adaptable. We focus on the Event Space as the central communication medium of MESHMdl. The Event Space offers a simple, unified communication interface for inter-agent communication as well as for communication with the middleware and resource access. Furthermore, it serves as a means for flexibly extending a MESHMdl daemon. We investigate the performance of the Event Space on different mobile devices and show that it is superior to comparable systems.
Random Generation of Test Inputs for Implicitly Defined Subdomains
Authors: John A. Murphy, David Coppit
Venue: Proceedings of the Second International Workshop on Automation of Software Test (2007)

In traditional random testing, samples are taken from the set of all possible values for the input types. However, for many programs testing effectiveness can be improved by focusing on a relevant subdomain defined implicitly by the program behavior. This paper presents an algorithm for identifying and randomly selecting inputs from implicitly defined subdomains. The algorithm dynamically constructs and refines a model of the input domain and is biased toward sparsely covered regions in order to accelerate boundary identification and uniform coverage. This method has several desirable qualities: (1) it requires no knowledge of the source code of the software being tested, (2) inputs are selected from an approximately uniform distribution across the subdomain, and (3) algorithmic running time overhead is negligible. We present the requirements for a solution and our algorithm. We also evaluate our solution for both an artificial model and a real-world aircraft collision-avoidance program.
Reducing the Effect of Hot Spots by Using a Multipath Network
Authors: Mu-Cheng Wang, Howard Jay Siegel, Mark A. Nichols, Seth Abraham
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

One type of interconnection network for a medium to large-scale parallel processing system (i.e., a system with 26 to 216 processors) is a buffered packet-switched multistage interconnection network (MIN). It has been shown that the per formance of these networks is satisfactory for uniform network traffic. More recently, several studies have indicated that the performance of MINs is degraded significantly when there is hot spot traffic, that is, a large fraction of the messages are routed to one particular destination. A multipath MIN is a MIN with two or more paths between all source and destination pairs. This research investigates how the Extra Stage Cube multipath MIN can reduce the detrimental effects of tree satura tion caused by hot spots. Simulation is used to evaluate the per formance of the proposed approach. The objective of this evaluation is to show that, under certain conditions, the perfor mance of the network with the usual routing scheme is severely degraded by the presence of hot spots. With the proposed approach, although the delay time of hot spot traffic may be increased, the performance of the background traffic, which constitutes the majority of the network traffic, can be significantly improved.
Incremental linking on HP-UX
Authors: Dmitry Mikulin, Murali Vijayasundaram, Loreena Wong
Venue: Proceedings of the 1st conference on Industrial Experiences with Systems Software - Volume 1 (2000)

The linker is often a time bottleneck in the development of large applications. Traditional linkers process all input files, even if only one or two objects have changed since the previous link. To shorten link time, we have developed an incremental linker for HP-UX which only processes modified files. Users can take advantage of the performance gains without modifying their usage patterns of the existing HP-UX linker since the incremental linker is implemented on top of the regular 64-bit linker. In addition to the tasks of the normal linker, the incremental linker must save extra information about input files, symbols and relocations, allow for the expansion of existing files and addition of new ones by allocating padding spaces in the output file and use this information to perform in-place updates. The results of several different design considerations and tradeoffs are materialized in link-time performance gains of up to thirteen times that of a normal link for large applications.
Efficient Scan-Based BIST Using Multiple LFSRs and Dictionary Coding
Authors: Kedarnath J. Balakrishnan
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

An efficient LFSR reseeding based scan vector compression scheme is proposed in this paper. By using a two step scheme of multiple small LFSRs and dictionary encoding of the LFSR seeds, very high compression can be achieved on scan load patterns. The proposed scheme involves reseeding only the required LFSRs depending on the number of specified bits in a scan load pattern thereby improving the encoding efficiency. Experiment results show that very high encoding efficiency can be achieved using the proposed scheme. Multiple small LFSRs are advantageous to a dictionary based compression scheme of the LFSR seeds. An algorithm to choose seeds intelligently to achieve higher second level compression is described. The proposed scheme can be used in both full Built-In Self-Test (BIST) environments and Hybrid-BIST environments where the compressed data is stored on the external test equipment. Experiments show that the proposed scheme requires less tester memory as compared to previously published results.
The eigenvalue complementarity problem
Authors: Joaquim J. Júdice, Hanif D. Sherali, Isabel M. Ribeiro
Venue: Computational Optimization and Applications (2007)

In this paper an eigenvalue complementarity problem (EiCP) is studied, which finds its origins in the solution of a contact problem in mechanics. The EiCP is shown to be equivalent to a Nonlinear Complementarity Problem, a Mathematical Programming Problem with Complementarity Constraints and a Global Optimization Problem. A finite Reformulation---Linearization Technique (Rlt)-based tree search algorithm is introduced for processing the EiCP via the lattermost of these formulations. Computational experience is included to highlight the efficacy of the above formulations and corresponding techniques for the solution of the EiCP.
CNF formula simplification using implication reasoning
Authors: Rajat Arora, M. S. Hsiao
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

We propose a novel preprocessing technique that helps to significantly simplify a CNF instance, such that the resulting formula is easier for any SAT-solver to solve. The core of this simplification centers on a suite of lemmas and theorems derived from nontrivial Boolean reasoning. These theorems help us to deduce powerful unary and binary clauses which aid in the identification of necessary assignments, equivalent signals, complementary signals and other implication relationships among the CNF variables. The nontrivial clauses, when added to the original CNF database, subsequently simplify the CNF formula. We illustrate through experimental results that the CNF formula simplification obtained using our tool outperforms the simplification obtained using the recent preprocessors namely Hypre [F. Bacchus et al., (2003)] and NIVER [S. Subbarayan et al. (2004)]. Also, considerable savings in computation time are obtained when the simplified CNF formula is given to the SAT-solver for processing.
Matched window processing for mitigating over-the-horizon radar spread Doppler clutter
Authors: K. Harmanci
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

Ionospheric motion causes spreading of surface clutter in Doppler space which fundamentally limits the detection performance of skywave HF over-the-horizon radars. This paper presents a technique which reduces the effect of so-called "coincident" spread Doppler clutter, i.e., that which results from surface scattering from within the same range resolution cell as the target. The method exploits the spatial correlation of the ionospheric aberration along the geomagnetic field aligned irregularities to obtain a cross-relation between clutter in neighboring range bins. This cross relation is exploited to estimate the Doppler spreading sequence common to neighboring range bins by a technique adapted from blind multichannel system identification. A Chebyshev Doppler window is then designed which is matched to the estimated ionospheric aberration. Simulation and real data results presented here indicate the proposed method provides as much as 10 dB improvement in side-lobe level using a 3 second coherent integration time radar waveform.
Linear and non-linear filters for block based motion estimation
Authors: V. F. Ruiz
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

Many techniques are currently used for motion estimation. In the block-based approaches the most common procedure applied is the block matching based on various algorithms. To refine the motion estimates resulting from the full search or any coarse search algorithm, one can find few applications of Kalman filtering, mainly in the intraframe scheme. This paper presents an 8/spl times/8-block based motion estimation which uses the Kalman filtering technique to improve the motion estimates resulting from both the three step algorithm and the 16/spl times/16-block based Kalman application. In the interframe scheme, due to discontinuities in the dynamic behaviour of the motion vectors, we propose the filtering by approximated densities. This application uses a simple form involving statistical characteristics of multi-modal distributions.
DEUCON: Decentralized End-to-End Utilization Control for Distributed Real-Time Systems
Authors: Xiaorui Wang, Dong Jia, Chenyang Lu, Xenofon Koutsoukos
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Many real-time systems must control their CPU utilizations in order to meet end-to-end deadlines and prevent overload. Utilization control is particularly challenging in distributed real-time systems with highly unpredictable workloads and a large number of end-to-end tasks and processors. This paper presents the Decentralized End-to-end Utilization CONtrol (DEUCON) algorithm, which can dynamically enforce the desired utilizations on multiple processors in such systems. In contrast to centralized control schemes adopted in earlier works, DEUCON features a novel decentralized control structure that requires only localized coordination among neighbor processors. DEUCON is systematically designed based on recent advances in distributed model predictive control theory. Both control-theoretic analysis and simulations show that DEUCON can provide robust utilization guarantees and maintain global system stability despite severe variations in task execution times. Furthermore, DEUCON can effectively distribute the computation and communication cost to different processors and tolerate considerable communication delay between local controllers. Our results indicate that DEUCON can provide a scalable and robust utilization control for large-scale distributed real-time systems executing in unpredictable environments.
Case based education in the age of Internet
Authors: L. G. Richards, M. E. Gorman, W. T. Scherer
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Case-based learning is once again popular in engineering education. A case can be used to present open-ended engineering problems (design, analysis, selection, planning) and business decision situations. Teams of students must analyze the problem presented by the case and develop a solution. They present their results to the class, and must be prepared to defend their analysis. With interactive computer graphics, communications networks and hypermedia databases, case material can be provided to students in novel and engaging ways. In this paper, we describe our initial experiences using the World Wide Web as a distribution medium for a third-year course on invention and design, and our students' experiences using Netscape and Mosaic for access to our case materials (and all the resources of the Internet relevant to their projects). We also review the types and sources of cases available electronically, and suggest how we might make better use of this medium in the future.
Engaging student programmers as inclusive designers
Authors: Shaun K. Kane
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

While awareness of accessibility standards and guidelines can help students learn to produce accessible web pages, overcoming real-world accessibility issues often requires creativity and flexibility. One way to develop these skills is to engage student programmers in design practice. This poster describes an undergraduate web programming course that used pedagogical techniques drawn from architecture and industrial design education to enable students to empathize with users with disabilities and to creatively address accessibility issues. Evaluative feedback from students indicates that this approach is effective in encouraging accessible design practices.
The Model based Similarity Metric
Authors: Lionel Gueguen, Mihai Datcu
Venue: Proceedings of the 2007 Data Compression Conference (2007)

This paper addresses the problem of building a compact representation of objects which enables to define a similarity measure. The key idea is to provide a mean to extract and represent the relevant information of an object. By integrating the Minimum Length Description to an informational similarity metric based on Kolmogorov complexity [1], we propose a new informational measure based on models.
Hybrid Multi-module Security Policy Verification
Authors: Igor Kotenko, Olga Chervatuk, Ekaterina Sidelnikova, Artem Tishkov
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

To build a powerful and flexible security policy verification tool, it is very important to use the approach which allows covering all possible inconsistencies, has open (extendable) architecture and efficient verification implementation. We suggest using a family of different verification modules each of which can work with acceptable computational complexity for the particular types of conflicts, the system scale and the policy complication. The poster describes a common approach to security policy verification and presents a novel hybrid multi-module SEcurity Checker (SEC) software tool that can serve as a security policy debugger for various categories of security policy, including authentication, authorization, filtering, channel protection and operational rules.
Diagnosis of Embedded Software Using Program Spectra
Authors: Peter Zoeteweij, Rui Abreu, Rob Golsteijn, Arjan J. C. van Gemund
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Automated diagnosis of errors detected during software testing can improve the efficiency of the debugging process, and can thus help to make software more reliable. In this paper we discuss the application of a specific automated debugging technique, namely software fault localization through the analysis of program spectra, in the area of embedded software in high-volume consumer electronics products. We discuss why the technique is particularly well suited for this application domain, and through experiments on an industrial test case we demonstrate that it can lead to highly accurate diagnoses of realistic errors.
Comparing traffic classifiers
Authors: Luca Salgarelli, Francesco Gringoli, Thomas Karagiannis
Venue: ACM SIGCOMM Computer Communication Review (2007)

Many reputable research groups have published several interesting papers on traffic classification, proposing mechanisms of different nature. However, it is our opinion that this community should now find an objective and scientific way of comparing results coming out of different groups. We see at least two hurdles before this can happen. A major issue is that we need to find ways to share full-payload data sets, or, if that does not prove to be feasible, at least anonymized traces with complete application layer meta-data. A relatively minor issue refers to finding an agreement on which metric should be used to evaluate the performance of the classifiers. In this note we argue that these are two important issues that the community should address, and sketch a few solutions to foster the discussion on these topics.
Communication-Efficient Tracking of Distributed Cumulative Triggers
Authors: Ling Huang, Minos Garofalakis, Anthony D. Joseph, Nina Taft
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

In recent work, we proposed D-Trigger, a framework for tracking a global condition over a large network that allows us to detect anomalies while only collecting a very limited amount of data from distributed monitors. In this paper, we expand our previous work by designing a new class of queries (conditions) that can be tracked for anomaly violations. We show how security violations can be detected over a time window of any size. This is important because security operators do not know in advance the window of time in which measurements should be made to detect anomalies. We also present an algorithm that determines how each machine should filter its time series measurements before back-hauling them to a central operations center. Our filters are computed analytically such that upper bounds on false positive and missed detection rates are guaranteed. In our evaluation, we show that botnet detection can be carried out successfully over a distributed set of machines, while simultaneously filtering out 80 to 90% of the measurement data.