ppxscal/embedding_network huggingface dataset:
A Dependent Set Theory
Authors: Wojciech Moczydlowski
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we introduce a dependent impredicative constructive set theory which we call IZF_D. Using realizability, we prove that the underlying lambda calculus weakly normalizes, thus enabling program extraction from IZF_D proofs. We also show that IZF_D can interpret IZF with Collection. By a wellknown result of Friedman, this establishes IZF_D as a remarkably strong theory, with proof-theoretical power equal to that of ZFC. We further demonstrate that IZF_D provides a natural framework to interpret first-order definitions, thus removing a longstanding barrier to implementing constructive set theories. Finally, we prove that IZF_D extended with excluded middle is consistent, thus paving the way to using our framework in the classical setting as well.
Vertex cuts, random walks, and dimension reduction in series-parallel graphs
Authors: Bo Brinkman, Adriana Karagiozova, James R. Lee
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We consider questions about vertex cuts in graphs, random walks in metric spaces, and dimension reduction in L1 and L2; these topics are intimately connected because they can each be reduced to the existence ofvarious families of real-valued Lipschitz maps on certain metric spaces. We view these issues through the lens of shortest-path metricson series-parallel graphs, and we discussthe implications for a variety of well-known open problems. Our main results follow. Every n-point series-parallel metric embeds into l1dom with O(√ log n) distortion, matchinga lower bound of Newman and Rabinovich. Our embeddings yield an O(√log n) approximation algorithm for vertex sparsestcut in such graphs, as well as an O(√log k) approximate max-flow/min-vertex-cut theorem for series-parallel instances withk terminals, improving over the O(log n) and O(log k) boundsfor general graphs. Every n-point series-parallel metric embeds withdistortion D into l1d with d = n1/Ω(D2),matching the dimension reduction lower bound of Brinkman andCharikar. There exists a constant C > 0 such that if (X,d) is aseries-parallel metric then for every stationary, reversible Markovchain Ztt=0∞ on X, we have for all t ≥ 0, E[d(Zt,Z0)2] ≤ Ct ·, E[d(Z0,Z1)2]. More generally, we show thatseries-parallel metrics have Markov type 2. This generalizesa result of Naor, Peres, Schramm, and Sheffield for trees.
On designing lightweight threads for substrate software
Authors: Matthew Haines
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1997)

Existing user-level thread packages employ a "black box" design approach, where the implementation of the threads is hidden from the user. While this approach is often sufficient for application-level programmers, it hides critical design decisions that system-level programmers must be able to change in order to provide efficient service for high-level systems. By applying the principles of Open Implementation Analysis and Design, we construct a new user-level threads package that supports common thread abstractions and a well-defined meta-interface for altering the behavior of these abstractions. As a result, system-level programmers will have the advantages of using high-level thread abstractions without having to sacrifice performance, flexibility, or portability.
The EPC Sensor Network for RFID and WSN Integration Infrastructure
Authors: Jongwoo Sung, Tomas Sanchez Lopez, Daeyoung Kim
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

Despite the popularity of current Radio Frequency Identification (RFID) and Wireless Sensor Networks (WSN), current research fails to propose the global vision that is needed for truly pervasive computing. In this paper we introduce our effort to build a global standard infrastructure for WSN and RFID based on the EPCglobal standard Architecture Framework. By leveraging the EPC Network infrastructure, our proposed EPC Sensor Network will effectively provide standardized WSN/RFID integration framework to support sensor data sharing.
Formal verification of high-level conformance with symbolic simulation
Authors: R. Kaivola, A. Naik
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2005. on Tenth IEEE International (2005)

We describe a practical methodology for large-scale full formal validation of industrial circuits. The approach targets conformance of register-transfer level circuit descriptions with abstract high-level models. It is supported by a proof tool that combines symbolic simulation with human-generated inductive invariants. The approach has emerged from extensive experiences in the validation of key parts of Intel IA-32 microprocessor designs, and it has allowed us to completely verify feedback-intensive circuits beyond the capabilities of most other tools. We discuss the methodology the context of two case studies: a register file bypass network and a cache invalidation protocol.
The Case for Flexible NIST Security Standards
Authors: Feisal Keblawi, Dick Sullivan
Venue: Computer (2007)

A public dialogue on the role and reach of NIST as a rule maker and as a standards writer for federal cybersecurity is essential to understanding the limits of security rule making in the present federal environment. NIST should delay converting its guidelines into rules until advances in the technology permit such conversion.
Architectural leakage-aware management of partitioned scratchpad memories
Authors: Olga Golubeva, Mirko Loghi, Massimo Poncino, Enrico Macii
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Partitioning a memory into multiple blocks that can be independently accessed is a widely used technique to reduce its dynamic power. For embedded systems, its benefits can be even pushed further by properly matching the partition to the memory access patterns. When leakage energy comes into play, however, idle memory blocks must be put into a proper low-leakage sleep state to actually save energy when not accessed. In this case, the matching becomes an instance of power management problem, because moving to and from this sleep state requires additional energy. In this work, we propose an explorative solution to the problem of leakage-aware partitioning of a memory into disjoint sub-blocks. In particular, we target scratchpad memories, which are commonly used in some embedded systems as a replacement of caches. We show that the total energy (dynamic and static) cost function yields a non-convex partitioning space, making smart exploration the only viable option; we propose an effective randomized search in the solution space which has very good match with the results of exhaustive exploration, when this is feasible. Experiments on a different sets of embedded applications has shown that total energy savings larger than 60% on average can be obtained, with a marginal overhead in execution time, thanks to an effective implementation of the low-leakage sleep state.
Embedded inodes and explicit grouping: exploiting disk bandwidth for small files
Authors: Gregory R. Ganger, M. Frans Kaashoek
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1997)

Small file performance in most file systems is limited by slowly improving disk access times, even though current file systems improve on-disk locality by allocating related data objects in the same general region. The key insight for why current file systems perform poorly is that locality is insufficient -- exploiting disk bandwidth for small data objects requires that they be placed adjacently. We describe C-FFS (Co-locating Fast File System), which introduces two techniques, embedded inodes and explicit grouping, for exploiting what disks do well (bulk data movement) to avoid what they do poorly (reposition to new locations). With embedded inodes, the inodes for most files are stored in the directory with the corresponding name, removing a physical level of indirection without sacrificing the logical level of indirection. With explicit grouping, the data blocks of multiple small files named by a given directory are allocated adjacently and moved to and from the disk as a unit in most cases. Measurements of our C-FFS implementation show that embedded inodes and explicit grouping have the potential to increase small file throughput (for both reads and writes) by a factor of 5-7 compared to the same file system without these techniques. The improvement comes directly from reducing the number of disk accesses required by an order of magnitude. Preliminary experience with software-development applications shows performance improvements ranging from 10-300 percent.
Hot Topic Extraction Based on Timeline Analysis and Multidimensional Sentence Modeling
Authors: Kuan-Yu Chen, Luesak Luesukprasert, Seng-cho T. Chou
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

With the vast amount of digitized textual materials now available on the Internet, it is almost impossible for people to absorb all pertinent information in a timely manner. To alleviate the problem, we present a novel approach for extracting hot topics from disparate sets of textual documents published in a given time period. Our technique consists of two steps. First, hot terms are extracted by mapping their distribution over time. Second, based on the extracted hot terms, key sentences are identified and then grouped into clusters that represent hot topics by using multidimensional sentence vectors. The results of our empirical tests show that this approach is more effective in identifying hot topics than existing methods.
Local stability analysis of flexible independent component analysis algorithm
Authors: Seungjin Choi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

This paper addresses local stability analysis for the flexible independent component analysis (ICA) algorithm where the generalized Gaussian density model was employed for blind separation of mixtures of sub- and super-Gaussian sources. In the flexible ICA algorithm, the shape of nonlinear function in the learning algorithm varies depending on the Gaussian exponent which is properly selected according to the kurtosis of estimated source. In the framework of the natural gradient in Stiefel manifold, the flexible ICA algorithm is revisited and some new results about its local stability analysis are presented.
Challenge Paper: Validation of Forensic Techniques for Criminal Prosecution
Authors: Robert F. Erbacher, Barbara Endicott-Popovsky, Deborah A. Frincke
Venue: Proceedings of the Second International Workshop on Systematic Approaches to Digital Forensic Engineering (2007)

As in many domains, there is increasing agreement in the user and research community that digital forensics analysts would benefit from the extension, development and application of advanced techniques in performing large scale and heterogeneous data analysis. Modern digital forensics analysis of cyber-crimes and cyber-enabled crimes often requires scrutiny of massive amounts of data. For example, a case involving network compromise across multiple enterprises might require forensic analysis of numerous sets of network logs and computer hard drives, potentially involving 100's of gigabytes of heterogeneous data, or even terabytes or petabytes of data. Also, the goal for forensic analysis is to not only determine whether the illicit activity being considered is taking place, but also to identify the source of the activity and the full extent of the compromise or impact on the local network. Even after this analysis, there remains the challenge of using the results in subsequent criminal and civil processes.
Supporting a Territorial Emergency Scenario with Services and Agents: A Case Study Comparison
Authors: Giacomo Cabri, Francesco De Mola, Raffaele Quitadamo
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Territorial emergency scenarios imply several interesting issues with regard to the development of distributed applications and systems. From complexity to dynamism and unpredictability, these issues must be faced with appropriate paradigms and tools, which must grant flexibility and adaptability. In this paper, we apply concepts and abstractions from the Service- Oriented Computing paradigm and from Software Agents to support the management of territorial emergencies. Rather than making a theoretical comparison, we analyze a proper case study and show where the advantages and drawbacks of the two paradigms are more evident. From these considerations, we conclude that agents better suit this scenario, but need still to learn from the emerging paradigm of SOC.
Evaluating Enterprise Integration Middleware Technologies
Authors: Ian Gordon
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

Architects are faced with the problem of building enterprise scale information systems, with streamlined, automated internal business processes and web-enabled business functions, all across multiple legacy applications. The underlying architectures such systems are embodied in a range of diverse products known as 'enterprise integration' technologies. In this tutorial, we highlight some of the major problems, approaches and issues in designing enterprise integration architectures and selecting appropriate supporting technology. An architect's perspective on designing large-scale integrated applications is taken, and we discuss requirements elicitation, architecture patterns, enterprise integration technology features and risk mitigation. Specific technology platforms covered include messaging, message brokers, application servers, business process management and Web Services and Service-oriented architecture technologies.
Text-directed speech enhancement using phoneme classification and feature map constrained vector quantization
Authors: B. L. Pellom
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper presents and evaluates a novel text-directed speech enhancement algorithm for usage in non-real-time applications. In our approach, the text of the intended dialogue is used to partition noisy speech into regions of broad phoneme classifications. Classes considered include stops, fricatives, affricates, nasals, vowels, semivowels, diphthongs and silence. These partitions are then used to direct a new vector quantizer based enhancement scheme in which class directed constraints are applied to improve speech quality. Objective enhancement evaluations conducted across 100 sentences of the TIMIT database indicate consistent improvement in speech quality for actual helicopter fly-by noise, aircraft cockpit noise, and automobile highway noise at signal-to-noise ratios ranging from -5 to 10 dB. Subjective quality assessment was conducted in the form of an A-B comparison test. Results of these evaluations demonstrate that, for wideband noise distortion, the proposed algorithm is preferred over unprocessed noisy speech more than 2 to 1, while the proposed algorithm is preferred over spectral subtraction processed speech by more than 3 to 1.
De-interleaving of superimposed quantized autoregressive processes
Authors: A. Logothetis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

We consider the de-interleaving of N independent autoregressive (AR) processes from 1-bit quantized measurements. De-interleaving has applications in radar and signal detection. Other possible applications are computer communications and neural systems. The received signal (pulse train) is the superposition of N 1-bit quantized Gaussian AR processes observed in white Gaussian noise. The aim is to identify which sources are responsible for the observed noisy pulses. Furthermore, it is desired to obtain parameter estimates for the N sources. The proposed algorithm, (subject to model assumptions) optimally combines hidden Markov model and binary time series estimation techniques.
Propagators, Tomograms, Wavelets and Quasidistributions for Multipartite Quantum Systems
Authors: Margarita A. Man'Ko
Venue: Open Systems Information Dynamics (2007)

Integral transforms of analytic signal and quantum-system states like wavelets, tomograms, Ville-Wigner and other quasidistributions are constructed for systems with several degrees of freedom. Mutual relations of the integral transforms are presented. Quantum propagator is interpreted as the kernel of the integral transform. An example of the integral transforms with generic Gaussian kernels is studied. The fractional Fourier transform is discussed.
Filtering of XML Documents
Authors: D. Ballis, D. Romero
Venue: Proceedings of the 2nd Int'l. Workshop on Automated Specification and Verification of Web Systems (2006)

In this paper, we present a simple, easy-to-use, rewriting-like methodology for filtering information in an XML document. Essentially, we define a specification language which allows one to extract relevant data (positive filtering) as well as to exclude useless and misleading contents (negative filtering) from a set of XML documents according to some given criteria. We believe that our methodology achieves the right tradeoff between expressive power and simplicity of use, and thus it may be also fruitfully employed by those users who typically prefer to avoid formal languages.
Operating system management of MEMS-based storage devices
Authors: John Linwood Griffin, Steven W. Schlosser, Gregory R. Ganger, David F. Nagle
Venue: Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4 (2000)

MEMS-based storage devices promise significant performance, reliability, and power improvements relative to disk drives. This paper compares and contrasts these two storage technologies and explores how the physical characteristics of MEMS-based storage devices change four aspects of operating system (OS) management: request scheduling, data placement, failure management, and power conservation. Straightforward adaptations of existing disk request scheduling algorithms are found to be appropriate for MEMS-based storage devices. A new bipartite data placement scheme is shown to better match these devices' novel mechanical positioning characteristics. With aggressive internal redundancy, MEMS-based storage devices can mask and tolerate failure modes that halt operation or cause data loss for disks. In addition, MEMS-based storage devices simplify power management because the devices can be stopped and started rapidly.
Iterative context bounding for systematic testing of multithreaded programs
Authors: Madanlal Musuvathi, Shaz Qadeer
Venue: ACM SIGPLAN Notices (2007)

Multithreaded programs are difficult to get right because of unexpected interaction between concurrently executing threads. Traditional testing methods are inadequate for catching subtle concurrency errors which manifest themselves late in the development cycle and post-deployment. Model checking or systematic exploration of program behavior is a promising alternative to traditional testing methods. However, it is difficult to perform systematic search on large programs as the number of possible program behaviors grows exponentially with the program size. Confronted with this state-explosion problem, traditional model checkers perform iterative depth-bounded search. Although effective for message-passing software, iterative depth-bounding is inadequate for multithreaded software. This paper proposes iterative context-bounding, a new search algorithm that systematically explores the executions of a multithreaded program in an order that prioritizes executions with fewer context switches. We distinguish between preempting and nonpreempting context switches, and show that bounding the number of preempting context switches to a small number significantly alleviates the state explosion, without limiting the depth of explored executions. We show both theoretically and empirically that context-bounded search is an effective method for exploring the behaviors of multithreaded programs. We have implemented our algorithmin two model checkers and applied it to a number of real-world multithreaded programs. Our implementation uncovered 9 previously unknown bugs in our benchmarks, each of which was exposed by an execution with at most 2 preempting context switches. Our initial experience with the technique is encouraging and demonstrates that iterative context-bounding is a significant improvement over existing techniques for testing multithreaded programs.
An Algebraic Approach to Multi-Valued Model Checking
Authors: Jinzhao Wu, Lin Zhao
Venue: Proceedings of the Seventh International Conference on Application of Concurrency to System Design (2007)

Multi-valued model checking [3], a generalization of classical model checking [4], works for any multi-valued logics whose truth values form a quasi-boolean lattice. The model is defined by a multi-valued Kripke (mv-Kripke) structure, which is like a Kripke structure except that both atomic propositions and transitions between states may take any of the truth values of a given multi-values logic. Properties to be checked are expressed in CTL (Computational Tree Logic), generalized with multi-valued semantics.
Distance learning need not sacrifice high-quality education
Authors: L. Shafer
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

The University of Texas Software Project Management certification program allows students to continue work responsibilities while learning. With the addition of online learning, and the flexibility it affords, the program continues to embody quality educational characteristics: taught by industry practitioners; taught in a classroom with simultaneous web casting; students work in teams of supporting professionals; lessons are available on-demand; information is spread over a training period long enough to sustain retention; quality and benefits of what was learned in class are continually evaluated; lessons are immediately applicable in the workplace; students develop repeatable, usable toolsets; quality education leads to certification by professional societies. Going online presented challenges in maintaining quality goals, some of which have been overcome. Facilitated by a courseware tool, students continue to work in teams with remote members, learning the skills they need to manage in modern global companies. 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
Medical Knowledge Morphing via a Semantic Web Framework
Authors: Syed Sibte Raza Abidi, Sajjad Hussain
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Clinical decision-making involves an active interplay between various medical knowledge modalities. Medical knowledge morphing aims to support clinical decision support by mimicking the interplay between knowledge modalities, as per the problem description, to derive a holistic knowledge-base. We leverage the Semantic Web technology suite to pursue knowledge morphing. We present a Knowledge Morphing framework that involves ontologies to represent the domain and knowledge artifacts, annotation of knowledge artifacts based on the respective ontological model, and ontology mediation activities to knowledge morphing.