ppxscal/embedding_network huggingface dataset:
cql: Flat file database query language
Authors: Glenn Fowler
Venue: Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference (1994)

cql is a UNIX system tool that applies C style query expressions to flat file databases. In some respects it is yet another addition to the toolbox of programmable file filters: grep [Hume88], sh [Bour78] [BK89], awk [AKW88], and perl [Wall]. However, by restricting its problem domain, cql takes advantage of optimizations not available to these more general purpose tools. This paper describes the cql data description and query language, query optimizations, and provides comparisons with other tools.
Reflections on a history
Authors: Robert D. Campbell
Venue: ACM SIGCSE Bulletin (2007)

After working in the two-year college environment for twenty-nine years, I've now relocated to The Graduate Center of the City University of New York, and so this will be my last column as Chair of the ACM Two-Year College Education Committee. It's more than fitting to use this opportunity to reflect on the auspicious history of this Committee.
Real-time control of video surveillance systems with program supervision techniques
Authors: B. Georis, F. Br&#x00e9;mond, M. Thonnat
Venue: Machine Vision and Applications (2007)

In this article, we describe a knowledge-based controlled platform using program supervision techniques. This platform eases the creation and the configuration of video surveillance systems. Several issues need to be addressed to provide a correct system configuration: (1) to choose, among a library of programs, those which are best satisfying a given user request, (2) to assign a correct value for each program parameter, (3) to evaluate performances and to guarantee a performance rate which is satisfactory regarding end-user requirements. This platform is composed of three main components: the library of programs, the knowledge base and the control component. The knowledge is either given by experts or learnt by the system. The control is generic in the sense that it is independent of any application. To validate this platform, we have built and evaluated six video surveillance systems which are featured with three properties: adaptability, reliability and real-time processing.
Fair Π
Authors: Diletta Cacciagrano, Flavio Corradini, Catuscia Palamidessi
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

In this paper, we define fair computations in the @p-calculus [Milner, R., Parrow, J. & Walker, D., A Calculus of Mobile Processes, Part I and II, Information and Computation 100 (1992) 1-78]. We follow Costa and Stirling's approach for CCS-like languages [Costa, G. & Stirling, C., A Fair Calculus of Communicating Systems, Acta Informatica 21 (1984) 417-441, Costa, G. & Stirling, C., Weak and Strong Fairness in CCS, Information and Computation 73 (1987) 207-244] but exploit a more natural labeling method of process actions to filter out unfair process executions. The new labeling allows us to prove all the significant properties of the original one, such as unicity, persistence and disappearance of labels. It also turns out that the labeled @p-calculus is a conservative extension of the standard one. We contrast the existing fair testing [Brinksma, E., Rensink, A. & Vogler, W., Fair Testing, Proc. of CONCUR'95, LNCS, 962 (1995) 313-327, Natarajan, V. & Cleaveland, R., Divergence and Fair Testing, Proc. of ICALP '95, LNCS, 944 (1995) 648-659] with those that naturally arise by imposing weak and strong fairness as defined by Costa and Stirling. This comparison provides the expressiveness of the various fair testing-based semantics and emphasizes the discriminating power of the one already proposed in the literature.
HW clustering
Authors: San Mehat
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

In this talk, San will discuss hardware level cluster management options under Linux. He will introduce the VACM program. VACM is a GUI based open source cluster controller with allows certain intel motherboard based machines to have serial bios, console redirection, all while monitoring power, cooling, and other sensors on the motherboard.
A dynamic ontology for a dynamic reference work
Authors: Mathias Niepert, Cameron Buckner, Colin Allen
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

The successful deployment of digital technologies by humanities scholars presents computer scientists with a number of unique scientific and technological challenges. The task seems particularly daunting because issues in the humanities are presented in abstract language demanding the kind of subtle interpretation often thought to be beyond the scope of artificial intelligence, and humanities scholars themselves often disagree about the structure of their disciplines. The future of humanities computing depends on having tools for automatically discovering complex semantic relationships among different parts of a corpus. Digital library tools for the humanities will need to be capable of dynamically tracking the introduction of new ideas and interpretations and applying them to older texts in ways that support the needs of scholars and students. This paper describes the design of new algorithms and the adjustment of existing algorithms to support the automated and semi-automated management of domain-rich metadata for an established digital humanities project, the Stanford Encyclopedia of Philosophy. Our approach starts with a "hand-built" formal ontology that is modified and extended by a combination of automated and semi-automated methods, thus becoming a "dynamic ontology". We assess the suitability of current information retrieval and information extraction methods for the task of automatically maintaining the ontology. We describe a novel measure of term-relatedness that appears to be particularly helpful for predicting hierarchical relationships in the ontology. We believe that our project makes a further contribution to information science by being the first to harness the collaboration inherent in a expert-maintained dynamic reference work to the task of maintaining and verifying a formal ontology. We place special emphasis on the task of bringing domain expertise to bear on all phases of the development and deployment of the system, from the initial design of the software and ontology to its dynamic use in a fully operational digital reference work.
Using Program Families for Maintenance Experiments
Authors: Scott D. Fleming, R. E. Kurt Stirewalt, Laura K. Dillon
Venue: Proceedings of the First International Workshop on Assessment of Contemporary Modularization Techniques (2007)

In general, new modularization techniques require a significant intellectual investment from practitioners in order to adopt them. Before practitioners are willing to make such an investment, they want a careful scientific assessment of the technique for a number of properties (e.g., effects on reusability, reliability, and maintainability). Unfortunately, many promising modularization techniques languish too long in the "academic ghetto," because their validation comes only in the form of simple proof-of-concept examples. To properly assess these techniques, rigorous empirical investigation is needed. Our work is concerned with conducting such empirical investigations for assessing how modularization techniques affect maintainability; in particular, this paper presents an approach to conducting formal experiments for assessing a technique's impact on perfective maintenance. We refer to such experiments as maintenance experiments in the sequel.
Computer-aided design algorithms and tools for nanotechnologies
Authors: Niraj K. Jha
Venue:  (2006)

The famous Moore's Law states that chip density doubles almost every 18 months. The Semiconductor Industries Association (SIA) roadmap predicts that complementary metal-oxide semiconductor (CMOS) chips will continue to fuel the need for high-performance systems for another 10--15 years. However, new devices and technologies must be introduced to continue the scaling of chips beyond that time-frame. With rapid advancements in electronic materials and devices, many new nanoscale devices have been created, such as resonant tunneling diode (RTD), quantum cellular automata (QCA), single electron transistor (SET), single electron box (SEB), and tunneling phase logic (TPL), which have novel structures and properties. Such devices offer the opportunity to further improve the compactness and speed of very large scale integrated (VLSI) systems. While it is easier to implement Boolean gates using CMOS, it is easier for many nanoscale devices to implement threshold and majority gates. As progress is made in the material and physical understanding of nanoscale devices, research must be done at the logic level to fully harness the potential offered by these devices. The main purpose of the work in this dissertation is to bridge the current wide gap between research on nanoscale devices and research on synthesis methodologies for generating optimized networks utilizing these devices. We present the first comprehensive threshold network synthesis methodology for multi-output multi-level threshold networks starting from Boolean descriptions. It does threshold logic synthesis through binate and unate splitting and by calling a linear program solver. We have implemented the methodology in a tool called TELS, on top of an existing logic synthesis tool, and validated it with a large number of benchmarks. We also present a methodology for efficient majority/minority network synthesis of arbitrary multi-output Boolean functions, which is based on the concept of admissible patterns of majority gates. We have implemented this methodology in a tool called MALS, on top of the same existing logic synthesis tool. We expanded our research from combinational circuits to sequential circuits by addressing the problem of state encoding of finite-state machines targeting threshold/majority logic based implementations. We propose a methodology for state encoding based on an evolutionary algorithm. Besides solving the logic synthesis and state encoding problems for threshold and majority circuits, we also evaluated several factorization methods, targeting threshold/majority logic circuits specifically. Nanotechnology-based circuits are usually more vulnerable to both permanent and transient faults. Therefore, we evaluated threshold/majority totally self-checking (TSC) circuits to impart concurrent error detection capability to such circuits. We establish the efficacy of all the above methods through experimental results on a large number of benchmarks.
Audio watermarking by time-scale modification
Authors: M. F. Mansour
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

A new algorithm for audio watermarking is proposed. The basic idea of the algorithm is to change the length of the intervals between salient points of the audio signal to embed data. We propose several novel ideas for practical implementations that can be used by other watermarking schemes as well. The algorithm is robust to common audio processing operations e.g. MP3 lossy compression, low pass filtering, and time-scale modification. The watermarked signal has very high perceptual quality and is indistinguishable from the original signal.
Using non-word lexical units in automatic speech understanding
Authors: M. Penagarikano
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

If the objective of a continuous automatic speech understanding system is not a speech-to-text translation, words are not strictly needed, and then the use of alternative lexical units (LUs) will bring us a new degree of freedom to improve the system performance. Consequently, we experimentally explore some methods to automatically extract a set of LUs from a Spanish training corpus and verify that the system can be improved in two ways: reducing the computational costs and increasing the recognition rates. Moreover, preliminary results point out that, even if the system target is a speech-to-text translation, using non-word units and post-processing the output to produce the corresponding word chain outperforms the word based system.
Obfuscation as Intellectual Rights Protection in VHDL Language
Authors: Maciej Brzozowski, Vyacheslav N. Yarmolik
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

Software is more and more frequently distributed in form of source code. Unprotected code is easy to alter and build in others projects. The answer for attacks against intellectual rights is obfuscation, a process that makes software unintelligible but still functional. In this paper we review several generic techniques of obfuscation VHDL (Very High Speed Integrated Circuit Hardware Description Language) code and present a set of them for software protection. We are going to describe some related experimental work.
Roundoff noise minimization in a direct form delta operator structure
Authors: J. Kauraniemi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

Delta operator realizations of IIR filters have received a lot of interest due to their good finite-wordlength properties. We present a detailed analysis of the computationally efficient transposed direct form II delta structure, which is also known to have excellent roundoff noise performance under fast sampling. The focus is on the roundoff noise minimization in fixed-point implementations. The free /spl Delta/ parameter in the delta operator is optimized with respect to the output roundoff noise within the scaling constraints. Moreover, the required internal wordlength to obtain a prespecified noise performance is derived.
Improved genetic algorithm inspired by biological evolution
Authors: P. Kumar, D. Gospodaric, P. Bauer
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

The process of mutation has been studied extensively in the field of biology and it has been shown that it is one of the major factors that aid the process of evolution. Inspired by this a novel genetic algorithm (GA) is presented here. Various mutation operators such as small mutation, gene mutation and chromosome mutation have been applied in this genetic algorithm. In order to facilitate the implementation of the above-mentioned mutation operators a modified way of representing the variables has been presented. It resembles the way genetic information is coded in living beings. Different mutation operators pose a challenge as regards the determination of the optimal rate of mutation. This problem is overcome by using adaptive mutation operators. The main purpose behind this approach was to improve the efficiency of GAs and to find widely distributed Pareto-optimal solutions. This algorithm was tested on some benchmark test functions and compared with other GAs. It was observed that the introduction of these mutations do improve the genetic algorithms in terms of convergence and the quality of the solutions.
Using Rescue Points to Navigate Software Recovery
Authors: Stelios Sidiroglou, Oren Laadan, Angelos D. Keromytis, Jason Nieh
Venue: Proceedings of the 2007 IEEE Symposium on Security and Privacy (2007)

We present a new technique that enables software recovery in legacy applications by retrofitting exception-handling capabilities, error virtualization using rescue points. We introduce the idea of "rescue points" as program locations to which an application can recover its execution in the presence of failures. The use of rescue points reduces the chance of unanticipated execution paths thereby making recovery more robust by mimicking system behavior under controlled error conditions. These controlled error conditions can be thought of as a set erroneous inputs, like the ones used by most quality-assurance teams during software development, designed to stress-test an application. To discover rescue points applications are profiled and monitored during tests that bombard the program with bad/random inputs. The intuition is that by monitoring application behavior during these runs, we gain insight into how programmer-tested program points are used to propagate faults gracefully.
Designing Self-Organising Emergent Systems based on Information Flows and Feedback-loops
Authors: Tom De Wolf, Tom Holvoet
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

For self-organising emergent solutions, there is no support to explicitly design system-wide information flows and feedback loops in those flows. This is problematic because the problem-solving power mainly resides in coordination between agents which needs information exchange. The flows of inherently decentralised information are essential for emergence. Feedback loops are a prerequisite for selforganisation. The design should explicitly focus on information flows. Otherwise, engineers are overwhelmed by details of decentralised coordinationmechanisms such as gradient fields without first looking at the bigger coordination picture. We introduce "Information Flow" as abstraction to design a solution independently of the coordination mechanism details by explicitly identifying information flows and designing feedback-loops. UML 2 activity diagrams are the notation. An automated guided vehicle transportation system shows the usefulness and feasibility.
Plug-and-play PKI: a PKI your mother can use
Authors: Peter Gutmann
Venue: Proceedings of the 12th conference on USENIX Security Symposium - Volume 12 (2003)

A common complaint about PKI is that it is simply too hard to use at the end-user level. Somewhat surprisingly, there exists no PKI equivalent of DHCP or BOOTP for automated, transparent PKI setup, leaving the certificate user experience similar to the process of bringing up an X.25 link. This paper provides a PKI equivalent of these basic bootstrap services that provides automatic, transparent configuration and setup of certificate information, with the user needing to supply no more than their user name and password. The work covers the design process involved and tradeoffs made, implementation details, and experiences with actual operation. The overall purpose of the work is to design and implement a plug-and-play certificate setup mechanism usable by even the most inexperienced user, a "PKI your mother can use".
Minimal paths and cycles in set systems
Authors: Dhruv Mubayi, Jacques Verstraëte
Venue: European Journal of Combinatorics (2007)

A minimal k-cycle is a family of sets A"0,...,A"k"-"1 for which A"i@?A"j=3, @?n-1r-1+O(n^r^-^2)@?f"r(n,k)@?3@?n-1r-1+O(n^r^-^2), where @?=@?(k-1)/2@?. We also prove that f"r(n,4)=(1+o(1))n-1r-1 as n->~. This supports a conjecture of Z. Furedi [Hypergraphs in which all disjoint pairs have distinct unions, Combinatorica 4 (2-3) (1984) 161-168] on families in which no two pairs of disjoint sets have the same union.
Integrative considerations and techniques for quantitative distance learning courses in graduate engineering management education
Authors: R. Snow
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

This presentation details work-in-progress for the development of quantitative and IT related graduate courses for distance learning that are taught concurrently with the schedule of our traditional courses. Development and delivery of courses in a format suitable for a distance learning graduate management engineering program presents many unique challenges. All of our graduate courses require a high degree of class participation, student team interaction and presentations. Engineering graduate course materials must be revised frequently to maintain technical relevance. Some faculty have successfully relied on video recorded lectures to keep students on track with a course organized for distance learning. However, current video technology is not able to represent computer screen images that are recorded from overhead projectors or conventional white board drawings with sufficient detail to present quantitative materials in the same format that is suitable for an in-class room presentation. The need to rapidly and efficiently prepare, revise and capture lecture materials for delivery of highly technical and quantitative courses requires special consideration. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Opportunities for bandwidth adaptation in microsoft office documents
Authors: Eyal de Lara, Dan S. Wallach, Willy Zwaenepoel
Venue: Proceedings of the 4th conference on USENIX Windows Systems Symposium - Volume 4 (2000)

Microsoft Office, the most popular office productivity suite, produces large documents that can result in long download latencies for platforms with limited bandwidth. To reduce latency and improve the user's experience, these documents need to be adapted for transmission on a limited-bandwidth network. To identify opportunities for adaptation, we characterize documents created by three popular applications from the Microsoft Office suite: Word, PowerPoint, and Excel. Our study encompasses over 12,500 documents retrieved from 935 different Web sites. Our main conclusions are: 1) Microsoft Office documents are large and require adaptation on bandwidth-limited clients; 2) embedded objects and images account for the majority of the data in these documents, with image types being the most popular non-text, content, suggesting that adaptation efforts should focus on these elements; 3) compression considerably reduces the sized of these documents; and 4) the internal structure of these documents (pages, slides, or sheets) can be used to download elements on demand and reduce user-perceived latency.
Detection and Tracking of Moving Vehicles in Crowded Scenes
Authors: Xuefeng Song, Ram Nevatia
Venue: Proceedings of the IEEE Workshop on Motion and Video Computing (2007)

Vehicle inter-occlusion is a significant problem for multiplevehicle tracking even with a static camera. The difficulty is that the one-to-one correspondence between foreground blobs and vehicles does not hold when multiple vehicle blobs are merged in the scene. Making use of camera and vehicle model constraints, we propose a MCMCbased method to segment multiple merged vehicles into individual vehicles with their respective orientation. Then a Viterbi algorithm is applied to search through the sequence for the optimal tracks. Our method automatically detects and tracks multiple vehicles with orientation changes and prevalent occlusion, without requiring a special region to initialize each vehicle individually. Tests are performed on video sequences from busy street intersections and show very promising results.
Fast algorithms for computing one and two dimensional convolution in integer polynomial rings
Authors: H. K. Garg
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

The factorization properties of polynomials defined over finite integer rings and the associated direct sums are analyzed. The objective is to describe new computationally efficient algorithms for computing one and two dimensional convolution of data sequences defined over finite integer rings. The number theoretic transforms (NTTs) are a special case of the general theory presented.