ppxscal/embedding_network huggingface dataset:
Listen and whisper: security mechanisms for BGP
Authors: Lakshminarayanan Subramanian, Volker Roth, Ion Stoica, Scott Shenker, Randy H. Katz
Venue: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1 (2004)

BGP, the current inter-domain routing protocol, assumes that the routing information propagated by authenticated routers is correct. This assumption renders the current infrastructure vulnerable to both accidental misconfigurations and deliberate attacks. To reduce this vulnerability, we present a combination of two mechanisms: Listen and Whisper. Listen passively probes the data plane and checks whether the underlying routes to different destinations work. Whisper uses cryptographic functions along with routing redundancy to detect bogus route advertisements in the control plane. These mechanisms are easily deployable, and do not rely on either a public key infrastructure or a central authority like ICANN. The combination of Listen and Whisper eliminates a large number of problems due to router misconfigurations, and restricts (though not eliminates) the damage that deliberate attackers can cause. Moreover, these mechanisms can detect and contain isolated adversaries that propagate even a few invalid route announcements. Colluding adversaries pose a more stringent challenge, and we propose simple changes to the BGP policy mechanism to limit the damage colluding adversaries can cause. We demonstrate the utility of Listen and Whisper through real-world deployment, measurements and empirical analysis. For example, a randomly placed isolated adversary, in the worst case can affect reachability to only 1% of the nodes.
A Theory for Model-Based Transformation Applied to Computer-Supported Preservation in Digital Archives
Authors: Thomas Triebsees, Uwe M. Borghoff
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Model transformation has applications in many areas as, e.g., in model-driven software development or automated knowledge exchange. When applied, model transformations usually have in common that the transformation process shall preserve certain properties. In model-driven software development, e.g., abstract models are transformed into more specific ones while preserving the behavior of the specified software system. In this paper, we present a model transformation approach that implements a preservation-centric view. We introduce a formal preservation language that allows transformation algorithms to be computed automatically. Additionally, these generated transformations can be proven to respect specified preservation requirements. We demonstrate our approach using a systems specification example that stems from the digital archiving world. We specify a web-archiving system that consists of two components each of which uses its own website model for storage. Internal processes necessitate exchanging websites between these two components and, thus, model transformation. We apply our preservation language and show how the algorithm generation procedure generates a transformation algorithm that guarantees an unchanged external view on the transformed websites.
High performance low power CMOS dynamic logic for arithmetic circuits
Authors: Victor Navarro-Botello, Juan A. Montiel-Nelson, Saeid Nooshabadi
Venue: Microelectronics Journal (2007)

This paper presents the design of high performance and low power arithmetic circuits using a new CMOS dynamic logic family, and analyzes its sensitivity against technology parameters for practical applications. The proposed dynamic logic family allows for a partial evaluation in a computational block before its input signals are valid, and quickly performs a final evaluation as soon as the inputs arrive. The proposed dynamic logic family is well suited to arithmetic circuits where the critical path is made of a large cascade of inverting gates. Furthermore, circuits based on the proposed concept perform better in high fanout and high switching frequencies due to both lower delay and dynamic power consumption. Experimental results, for practical circuits, demonstrate that low power feature of the propose dynamic logic provides for smaller propagation time delay (3.5 times), lower energy consumption (55%), and similar combined delay, power consumption and active area product (only 8% higher), while exhibiting lower sensitivity to power supply, temperature, capacitive load and process variations than the dynamic domino CMOS technologies.
Speech LSF quantization with rate independent complexity, bit scalability and learning
Authors: A. D. Subramaniam
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

A computationally efficient, high quality, vector quantization scheme based on a parametric probability density function (PDF) is proposed. In this scheme, speech line spectral frequencies (LSF) are modeled as i.i.d realizations of a multivariate Gaussian mixture density. The mixture model parameters are efficiently estimated using the expectation maximization (EM) algorithm. An efficient quantization scheme using transform coding and bit allocation techniques which allows for easy and computationally efficient mapping from observation to quantized value is developed for both fixed rate and variable rate systems. An attractive feature of this method is that source encoding using the resultant codebook involves very few searches and its computational complexity is minimal and independent of the rate of the system. Furthermore, the proposed scheme is bit scalable and can switch between memoryless and quantizer with memory seamlessly. The performance of the memoryless quantizer is 2-3 bits better than conventional quantization schemes.
The Influence of Information Linkage on User Acceptance of a Knowledge Management System (KMS) in Small to Mid-size Enterprises (SME)
Authors: Robert Judge
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

A concern relevant to the viability of a Knowledge Management System (KMS) implementation may well be: at what point is there adequate information packets and links among them to achieve value to the user? A closely associated statement may wonder if the size of a company or the number of knowledge workers in the company may or may not be sufficient to generate enough links. This paper uses a realist research approach to study how the mechanism of adding links among stored packets of information in a KMS, impacts the outcome of user acceptance. The paper's context will specifically analyze KMS in Small to Mid-sized Enterprises (SMEs) and attempt to determine whether there is a measurable point (tipping point) where the extent of links is such that the user community will value and accept the system.
Message-Task Scheduling in Ojbect-Oriented Heterogeneous Guru Distributed DBMS
Authors: R. C. Joshi, G. S. D. Verma, K. Singh
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

Distributed Message-Task System (DMTS) is designed and implemented on GURU Distributed Database Management System (GURU DDBMS). It incorporates the advantages of Message Based Communication System (MBCS) and Distributed Shared Memory System (DSMS). The message carrying ordinary data is scheduled by the scheduler for the translation in the local DBMS environment, and later passed to the supervisor of the object as a simple message. The other kind of messages having the control instructions are first scheduled for the translation of the data conversions and later are rescheduled for the instruction translation in the local DBMS environment. The intelligent translator and mapper handle the objects and provide the exact meaning of the data and control instructions. Finally synchronously and asynchronously exited task scheduling policies and concurrency control procedures are suggested.
Supporting Deliberative Real-Time AI Systems: A Fixed Priority Scheduling Approach
Authors: Yanching Chu, Alan Burns
Venue: Proceedings of the 19th Euromicro Conference on Real-Time Systems (2007)

Constructing deliberative real-time AI systems is challenging due to the high execution-time variance in AI algorithms and the requirement of worst-case bounds for hard real-time guarantees, often resulting in poor use of system resources. Using a motivating case study, the general problem of resource usage maximization is addressed. We show how the issues can be leveraged by employing a hybrid task model for anytime algorithms, which is supported by recent advances in fixed priority scheduling for imprecise computation. In particular, with a novel scheduling scheme based on Dual Priority Scheduling, hard tasks are guaranteed by schedulability analysis and scheduled in favor of optional and anytime components which are executed whenever possible for enhancing system utility. Simulation studies show satisfactory performance on the case study with the application of the scheduling scheme. With its basis on fixed priority scheduling, it is expected that it can be easily incorporated into existing real-time operating systems, promoting wider use of imprecise computing and providing a framework where real-time AI applications can be suitably facilitated.
SPIHT image compression without lists
Authors: F. W. Wheeler
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

A variant of the SPIHT image compression algorithm called no list SPIHT (NLS) is presented. NLS operates without linked lists and is suitable for a fast, simple hardware implementation. NLS has a fixed predetermined memory requirement about 50% larger than that needed for the image alone. Instead of lists, a state table with four bits per coefficient keeps track of the set partitions and what information has been encoded. NLS sparsely marks selected descendant nodes of insignificant trees in the state table in such a way that large groups of predictably insignificant pixels are easily identified and skipped during coding passes. The image data is stored in a one dimensional recursive zig-zag array for computational efficiency and algorithmic simplicity. The performance of the algorithm on standard test images is nearly the same as SPIHT.
Efficient testbench code synthesis for a hardware emulator system
Authors: I. Mavroidis, I. Papaefstathiou
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

The rising complexity of modern embedded systems is causing a significant increase in the verification effort required by hardware designers and software developers, leading to the "design verification crisis", as it is known among engineers. Today's verification challenges require powerful testbenches and high-performance simulation solutions such as Hardware Simulation Accelerators and Hardware Emulators that have been in use in hardware and electronic system design centers for approximately the last decade. In particular, in order to accelerate functional simulation, hardware emulation is used so as to offload calculation-intensive tasks from the software simulator. However, the communication overhead between the software simulator and hardware emulator is becoming a new critical bottleneck. We tackle this problem by partitioning the code running on the software simulator into two sections: the testbench HDL (Hardware Description Language) code that communicates directly with the Design Under Test (DUT) and the rest C-like testbench code. The former section is transformed into synthesizable code while the latter runs in a general purpose CPU. Our experiments demonstrate that the proposed method reduces the communication overhead by a factor of about 5 compared to a conventional hardware emulated simulation.
Interactive Semiconductor Process Overview
Authors: S. Villareal, V. Riggins, J. Schroeder, P. Tissot, J. P. Wallace
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

The Interactive Semiconductor Process Overview (ISPO) is a multimedia CD-ROM package that is based on a successful Semiconductor Processing Overview course developed through a partnership between the Texas A&M University System and several major Texas semiconductor manufacturers. The ISPO focuses on the basic process terminology, the key equipment components and the most sensitive quality issues of each major processing step. The ISPO includes a customized course management system and navigation system to assist the course coordinator and student to maximize the learning experience. The material is designed with the potential for three different levels of instruction. The technical content is divided into modules corresponding to major process steps or topics, with each process module further modularized into standard sub-modules. The ISPO's interactive, visual emphasis is developed and maintained through a combination of 3-D graphics, scanned images, video clips, computer-generated animations and visual simulations. The animations depict the essence of various technical concepts with all spurious elements removed. The visual simulations are developed from physically accurate mathematical models and correctly scaled graphics. The visual simulations allow students to vary input control parameters to pre-selected values and observe the resulting effect on the process.
String Gradient Weighted Moving Finite Elements in Multiple Dimensions with Applications in Two Dimensions
Authors: A. Wacher, I. Sobey
Venue: SIAM Journal on Scientific Computing (2007)

We formulate the string gradient weighted moving finite element method (SGWMFE) for systems of PDEs in multiple dimensions. Then we illustrate implementation issues for the method using two dimensions. The method is applied successfully to solve the highly nonlinear unsteady porous medium equation in two dimensions and the results are compared to exact solutions. We proceed to present results for the method when applied to the Gray Scott chemical reaction diffusion model in two dimensions. Finally, we apply the method to the shallow water equations in two dimensions and compare the meshes produced with those produced using gradient weighted finite element methods (GWMFE). Our conclusion is that SGWMFE is an easily applied member of the group of moving finite element methods.
Subtleties of Transactional Memory Atomicity Semantics
Authors: Milo Martin, Colin Blundell, E. Lewis
Venue: IEEE Computer Architecture Letters (2006)

Transactional memory has great potential for simplifying multithreaded programming by allowing programmers to specify regions of the program that must appear to execute atomically. Transactional memory implementations then optimistically execute these transactions concurrently to obtain high performance. This work shows that the same atomic guarantees that give transactions their power also have unexpected and potentially serious negative effects on programs that were written assuming narrower scopes of atomicity. We make four contributions: (1) we show that a direct translation of lock-based critical sections into transactions can introduce deadlock into otherwise correct programs, (2) we introduce the terms strong atomicity and weak atomicity to describe the interaction of transactional and non-transactional code, (3) we show that code that is correct under weak atomicity can deadlock under strong atomicity, and (4) we demonstrate that sequentially composing transactional code can also introduce deadlocks. These observations invalidate the intuition that transactions are strictly safer than lock-based critical sections, that strong atomicity is strictly safer than weak atomicity, and that transactions are always composable.
Improving academic performance through typifying electronics engineers
Authors: C. Cardenas
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Traditionally when a professor begins teaching a given course, he or she can assume that all of the students enrolled in said course possess the necessary abilities, knowledge, attitudes and values in order to achieve the desired maximum results of the course in terms of performance. However, that is not always the case. In order to reach said performance goal, it is necessary to first realize a diagnostic analysis of the students from a holistic approach, as opposed to a behavioral one, and to use said results in adapting the learning-teaching process to the group of students in question (adaptive process). From this perspective, it is therefore necessary to define the ideal profile of the alumnus, based on consulting those constituents whom actually interact with students upon graduation or who typically employ students with said profile, and through the use of various tools, not only those academic in nature but moreover those tools related to social skills. 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
Creating a dynamic picture of network participant geospatial information in complex terrains
Authors: Paul Labbe, Louise Lamont, Ying Ge, Li Li
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

Strategic, operational and tactical information, combat identification and blue-force-tracking provided by advanced "Command, Control, Communications, Computers, Intelligence, Surveillance, and Reconnaissance" distributed system-of-systems improve the quality of decision-makers' situation awareness (SA). Such SA improvements increase the pace at which decisionmaking can be done while maintaining a low risk of errors by decreasing the friction (the fog of war) in today's complex geopolitical contexts often conducted in urbanized areas. The first challenge addressed by this paper relates to generating accurate geolocation of agents even where satellite-positioning systems, such as the Global Positioning System, are unreliable or denied. The second challenge concerns the efficient sharing of this information for mobile agents in complex terrains by using advanced mobile ad-hoc network (MANET) technologies. The last challenge addressed consists in devising a set of rules based on a dead-reckoning error model for controlling the positionaldata updates shared over the MANET.
Interactive digital violin tutor (IDVT): an edutainment system for violin learners
Authors: Ye Wang, Jia Zhu
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

We present in this demo our current design of an Interactive Digital Violin Tutor (iDVT), which enables students to have reflective practice when human teachers are not available. iDVT combines violin audio transcription with visualization. Our transcription method is designed for violin audio recorded in home environments. The visualization is designed to be useful to people with different level of music knowledge. The different visualization modalities-video, 2D fingerboard animation, 3D avatar animation-help learners to practice and learn more effectively. The entire system has been implemented with off-the-shelf hardware and shown to be practical in home environments.
Computational Characterization of Thyroid Tissue in the Radon Domain
Authors: M. A. Savelonas, D. K. Iakovidis, N. Dimitropoulos, D. Maroulis
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

This paper investigates a novel computational approach to thyroid tissue characterization in ultrasound images. It is based on the hypothesis that tissues in thyroid ultrasound images may be differentiated by directionality patterns. These patterns may not be always distinguishable by the human eye because of the dominant image noise. The encoding of the directional patterns in the thyroid ultrasound images is realized by means of Radon Transform features. A representative set of ultrasound images, acquired from 66 patients was constructed to perform experiments that test the validity of the initial hypothesis. Supervised classification experiments showed that the proposed approach is capable of discriminating normal and nodular thyroid tissues, whereas nodular tissues can be further characterized as of high or low malignancy risk.
Neural Network of a Cognitive Crow: An interacting map based architecture
Authors: Vishwanathan Mohan, Pietro Morasso
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

Studies on animal reasoning can serve as a very relevant guide in building artificial systems that autonomously evolve their cognition and develop new skills in structural/functional coupling with their environments. New Caledonian crows display sophisticated abilities in fashioning tools and using them to acquire otherwise unobtainable food rewards. We may consider this an act of creativity, during which a cognitive agent reasons about things that do not yet exist but could exist as a result of his actions. However, the computational basis of such cognitive processes have remained elusive. Taking the example of tool manufacture by Caledonian crows, we explore an interacting self organizing map based architecture for virtually manipulating neural activity so as to achieve ones goals in novel situations. Simulation results demonstrate how interactions between sensorimotor space, action space and work space can be exploited in new situations to find action/action sequences that result in known intermediate states (sub goals) that in turn lead to the overall goal.
Strong Normalization as Safe Interaction
Authors: Colin Riba
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

When enriching the \lambda -calculus with rewriting, union types may be needed to type all strongly normalizing terms. However, with rewriting, the elimination rule (\vee E) of union types may also allow to type non normalizing terms (in which case we say that (\vee E) is unsafe). This occurs in particular with non-determinism, but also with some confluent systems. It appears that studying the safety of (\vee E) amounts to the characterization, in a term, of safe interactions between some of its subterms. In this paper, we study the safety of (\vee E) for an extension of the \lambda-calculus with simple rewrite rules. We prove that the union and intersection type discipline without (\vee E) is complete w.r.t. strong normalization. This allows to show that (\vee E) is safe if and only if an interpretation of types based on biorthogonals is sound for it. We also discuss two sufficient conditions for the safety of (\vee E), and study an alternative biorthogonality relation, based on the observation of the least reducibility candidate.