ppxscal/embedding_network huggingface dataset:
Fast output probability computation using scalar quantization and independent dimension multi-mixture
Authors: M. Yamada
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

In this paper, we propose a high speed output probability computation algorithm for multi-mixture continuous HMM. In the algorithm, we adopted the following three techniques: 1) independent dimension multi-mixture computation (IDMM), 2) scalar quantization (SQ) and 3) output probability recalculation. At the first step of the algorithm, the state probability is roughly estimated using the IDMM and SQ. The IDMM is an approximate computation of the multi-mixture probability density function, which realizes the fast probability estimation along with the SQ. The result of the rough estimation is used to select states with the high output probability. Then, the rigid probability calculation is carried out on the selected states. Our experiment on speaker independent continuous speech recognition showed that the proposed algorithm saves 81% of time for the output probability computation and 71% in the total speech recognition process, without degradation of the recognition rate.
Dynamic Dependency Monitoring to Secure Information Flow
Authors: Paritosh Shroff, Scott Smith, Mark Thober
Venue: Proceedings of the 20th IEEE Computer Security Foundations Symposium (2007)

Although static systems for information flow security are well-studied, few works address run-time information flow monitoring. Run-time information flow control offers distinct advantages in precision and in the ability to support dynamically defined policies. To this end, we here develop a new run-time information flow system based on the runtime tracking of indirect dependencies between program points. Our system tracks both direct and indirect information flows, and noninterference results are proved.
WETICE 2006 TICE Workshop -- Final Report
Authors: Alois Ferscha, Clemens Holzmann, Michael H. Leitner
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

This report is a summary of the first international IEEE workshop on "Tangible Interaction in Collaborative Environments" (TICE) hold during WETICE 2006 at the University of Manchester on June 27th.
Building a high-performance computing cluster using FreeBSD
Authors: Brooks Davis, Michael AuYeung, Gary Green, Craig Lee
Venue: Proceedings of the BSD Conference 2003 on BSD Conference (2003)

In this paper we discuss the design and implementation of Fellowship, a 300+ CPU, general use computing cluster based on FreeBSD. We address the design features including configuration management, network booting of nodes, and scheduling which make this cluster unique and how FreeBSD helped (and hindered) our efforts to make this design a reality.
Progress Towards Modeling Ship/Aircraft Dynamic Interface
Authors: Susan Polsky
Venue: Proceedings of the HPCMP Users Group Conference (2006)

Using a ship as a landing site creates a very challenging environment for aircraft and pilots. Sea-based aircraft operations must contend with airfield characteristics that lack the desirable aspects that one would find at conventional airports, such as long, stationary runways that are unobstructed by nearby buildings. The coupled relationship of the ship and aircraft system that exists during sea-based aircraft launch and recovery operations is often referred to as the "dynamic interface" (DI). Two primary factors that affect aircraft during dynamic interface operations are relative wind-over-deck (incoming wind angle and speed) and ship motion. The wind flowing over the ship structure produces a turbulent airwake that may have a significant effect on aircraft performance and consequently pilot workload. The motion of the ship, including forward speed and six-degree-of-freedom (6DOF) motion imparted by the seaway, results in a moving landing area that presents obvious problems for aircraft operations. Complicating matters further, ship motion may also affect the character of the ship airwake. In some cases, such as a rotorcraft hovering over a small deck ship, aircraft wake may have a first order effect on ship airwake and, in turn, the forces and moments felt by an aircraft. These effects may be coupled with other aerodynamic phenomena, such as ground effect, that would also occur during land-based operations.
A recurrent RBF network for non-linear channel
Authors: M. Mimura
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

In the conventional method to design recurrent RBF networks for channel equalizers, firstly, the impulse response of the channel is estimated with an adaptive FIR filter. Secondly, all noise-free received signals are estimated with an estimate of impulse response. However, the performance of the network designed with this method is degraded down if the channel is nonlinear. In order to overcome this drawback, we apply Miyake's (Miyake et al. 1996) method to the conventional training method of recurrent RBF networks. In the proposed method, we estimate the received noise-free signals with the relation between the training signals and the received signal. Then we design the recurrent RBF networks with the noise-free received signals.
Architectural Knowlege Management Strategies: Approaches in Research and Industry
Authors: Muhammad Ali Babar, Remco C. de Boer, Torgeir Dingsoyr, Rik Farenhorst
Venue: Proceedings of the Second Workshop on SHAring and Reusing architectural Knowledge Architecture, Rationale, and Design Intent (2007)

The software architecture community has recently gained an increasing interest in managing architectural knowledge. However, up until now there have been no attempts to obtain an overview of the work in the field. In this paper we present a preliminary review on current approaches to architectural knowledge manage- ment. To this end, we compare approaches known from literature and encountered in industry with knowledge management theory. We found that in reports from research and practice there appears to be a preference to use the codification strategy. However, our obser- vations of the software architecture industry show that organizations in general tend to use a personalization strategy unintentionally. This paper serves as a call for awareness of this gap between intention and real- ity, and questions the biased focus on intentional cod- ification alone. We suggest to close this gap through focusing on hybrid approaches.
A Probabilistic Approach to Predict Changes in Object-Oriented Software Systems
Authors: Ali R. Sharafat, Ladan Tahvildari
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

Predicting the changes in the next release of a software system has become a quest during its maintenance phase. Such a prediction can help managers to allocate resources more appropriately which results in reducing costs associated with software maintenance activities. A measure of change- proneness of a software system also provides a good understanding of its architectural stability. This research work proposes a novel approach to predict changes in an object oriented software system. The rationale behind this approach is that in a well-designed software system, feature enhancement or corrective maintenance should affect a limited amount of existing code. The goal is to quantify this aspect of quality by assessing the probability that each class will change in a future generation. Our proposed probabilistic approach uses the dependencies obtained from the UML diagrams, as well as other data extracted from source code of several releases of a software system using reverse engineering techniques. The proposed systematic approach has been evaluated on a multi-version medium size open source project namely JFlex, The Fast Scanner Generator for Java. The obtained results indicate the simplicity and accuracy of our approach in the comparison with existing methods in the literature.
Single block finite alphabet based source recovery and channel identification
Authors: D. H. Pharn, J. H. Manton
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

It has been known that under certain conditions the source symbols can be recovered and the channel identified given only the channel output and knowledge of the alphabet generating the source symbols. However. an arbitrarily large number of received symbols may have to be observed. This paper considers the case when null guards are present between blocks of symbols and proves that source recovery and channel identification is always possible given only a single received block. A Viterbi-like algorithm implementing this single block source recovery strategy is also derived.
Spectral analysis of discrete signals generated by multiplicative and additive iterative procedures
Authors: T. Alieva
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

The discrete Fourier transform of signals constructed through multiplicative and additive iterative procedures is determined and its specific features are considered. It is shown that-in spite of the rather different structure of multiplicative and additive signals-the Fourier transforms of both types of signals exhibit the property of self-affinity. The power spectra of additive signals produced by different generating vectors have similar forms and can be divided into similar branches. The number of branches depends on the generation level and the symmetry of the power spectrum of the generating vector.
Orthogonal array experiment for architecting a system of systems responding to small boat attacks
Authors: Thomas V. Huynh, Andrew Kessler, Joseph Oravec, Shaunnah Wark, Jennifer Davis
Venue: Systems Engineering (2007)

In this work we solve the problem of architecting a conceptual, near-term, cost-effective system of systems (SoS) to respond to small boats used by terrorists to attack maritime commerce traffic and critical shore infrastructures in the United States, by formulating the architecting problem as an assignment problem which is then solved using the orthogonal array experiment. Also known as the Taguchi method in quality control, the orthogonal array experiment is efficient for this class of problems. The optimality of the resulting architecture, called optimal cost-effective architecture, is validated against a heuristically developed architecture and an optimal effective architecture; the latter is obtained also with the orthogonal array experiment approach. The main purpose of this paper is an exploratory application of the Taguchi method to architecting a system of systems. The principal results of the orthogonal array experiment method reported herein underline this successful exploratory work in architecting a system of systems. This method can be extended to architecting other systems of systems. &copy; 2007 Wiley Periodicals, Inc. Syst Eng 10: 241&ndash;259, 2007
Psychological experiments on the cognitive complexities of fundamental control structures of software systems
Authors: Yingxu Wang
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

The measurement of cognitive complexity and functional size of software systems are an age-long problem in software engineering. Although, the symbolic complexity of software may be measured in lines of code, the functional complexity of software is too abstract to be measured or even estimated. Because numerous attributes of software systems are highly dependent on the understanding and measurability of software functional complicity, it has to be formally treated and empirically studied based on cognitive informatics and theoretical software engineering methodologies. This talk reveals that the cognitive functional size (CFS) of software is a product of its architectural and operational complexities based on the studies in cognitive informatics and abstract system theories. The fundamental basic control structures (BCSs) are elicited from software architectural and behavioral specifications and descriptions. The cognitive weights of those BCSs are derived and calibrated via a series of psychological experiments. Based on this work, CFS of a software system may be rigorously measured and analyzed by the unit of function-object (FO).
Semiformal Approach to the IT Security Development
Authors: Andrzej Bialas
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

The paper concludes the author's works on the IT security development framework compliant with the Common Criteria standard. Two basic issues were solved to make this development easier and more effective: the entire development process was better formalized using the UML/OCL approach, and the set of specification means was extended (by defining enhanced generics) thus now the set covers all development stages and is more precise. Moreover, the set of relationships between specification elements was predefined to help developers solve typical security issues. The computer-aided tool, implementing this methodology, has the following elements built in: the simple risk analysis tool, design selfevaluator, reporting and documentation management facilities. The paper presents the volume of works, gives some examples, summarizes the results and gained experiences, and defines the plans of future works.
Mildly non-projective dependency structures
Authors: Marco Kuhlmann, Joakim Nivre
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

Syntactic parsing requires a fine balance between expressivity and complexity, so that naturally occurring structures can be accurately parsed without compromising efficiency. In dependency-based parsing, several constraints have been proposed that restrict the class of permissible structures, such as projectivity, planarity, multi-planarity, well-nestedness, gap degree, and edge degree. While projectivity is generally taken to be too restrictive for natural language syntax, it is not clear which of the other proposals strikes the best balance between expressivity and complexity. In this paper, we review and compare the different constraints theoretically, and provide an experimental evaluation using data from two treebanks, investigating how large a proportion of the structures found in the treebanks are permitted under different constraints. The results indicate that a combination of the well-nestedness constraint and a parametric constraint on discontinuity gives a very good fit with the linguistic data.
Modeling of inhibition/excitation firing in olfactory bulb through spiking neurons
Authors: Iren Valova, Natacha Gueorguieva, Frank Troescher, Oxana Lapteva
Venue: Neural Computing and Applications (2007)

Spiking neural systems are based on biologically inspired neural models of computation since they take into account the precise timing of spike events and therefore are suitable to analyze dynamical aspects of neuronal signal transmission. These systems gained increasing interest because they are more sophisticated than simple neuron models found in artificial neural systems; they are closer to biophysical models of neurons, synapses, and related elements and their synchronized firing of neuronal assemblies could serve the brain as a code for feature binding and pattern segmentation. The simulations are designed to exemplify certain properties of the olfactory bulb (OB) dynamics and are based on an extension of the integrate-and-fire (IF) neuron, and the idea of locally coupled excitation and inhibition cells. We introduce the background theory to making an appropriate choice of model parameters. The following two forms of connectivity offering certain computational and analytical advantages, either through symmetry or statistical properties in the study of OB dynamics have been used: a) all-to-all coupling, b) receptive field style coupling. Our simulations showed that the inter-neuron transmission delay controls the size of spatial variations of the input and also smoothes the network response. Our IF extended model proves to be a useful basis from which we can study more sophisticated features as complex pattern formation, and global stability and chaos of OB dynamics.
A two-semester freshman orientation course sequence for retaining underrepresented minorities in engineering
Authors: T. L. Mitchell
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

At NC State University, USA, the authors have developed a student success model that is contributing towards their goal of increasing diversity as it relates to the engineering and computer science professions. They know they are on the right track because their NC State University College of Engineering has been honored twice in the short, four-year history of a national mentoring awards program. In 2000, they received their second Presidential Award for Excellence in Science, Mathematics and Engineering Mentoring. This work in progress report and accompanying presentation focus on their two-semester sequence that contains their freshman-level Engineering Professional Student Development courses. They describe the demographics of their student enrollment population, share details of both courses to include topical coverage, professional guests participation, and the impact these courses have on minority engineering and computer science students as they become acclimated to their campus environment.
CPU Model-Based Hardware/Software Co-design, Co-simulation and Analysis Technology for Real-Time Embedded Control Systems
Authors: Makoto Ishikawa, D. J. McCune, George Saikalis, Shigeru Oho
Venue: Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium (2007)

This paper proposes a new development method for highly reliable real-time embedded control systems using a CPU model-based hardware/software co-simulation. We take an approach that allows the full simulation of the virtual mechanical control system including the mechatronics plant, microcontroller hardware and object code level software. This full virtual system simulation reveals the control system behavior, especially in microcontroller hardware and software. It enables microarchitecture design space exploration, control design validation, robustness evaluation of the system, software optimization before components design, and prevents potential problems. A novel aspect of this work is that the proposed virtual control system comprises all the components in a typical control system, therefore it enables the analysis of the effects from the different domains, for example the mechanical analysis of behavior due to a control software bug. To help the design, evaluation and analysis, we developed an integrated behavior analyzer into the development environment. This can display the processor behavior graphically during the simulation without affecting the simulation results, such as task level CPU load, interrupt statistics and software variable transition chart. This analyzer provides useful information on the behavior. No software modification is necessary for this virtual system analysis, and this analysis does not change the control timing and does not require any processing power on the target microcontroller. Therefore this method is suitable for real-time embedded control system design, in particular automotive control system design which requires high level reliability, robustness, quality and safety. In this paper, a Renesas SH-2A microcontroller model was developed on a CoMETTMplatform from VaST Systems Technology. An ETC (Electronic Throttle Control) system is chosen as the plant to prove this concept. The ETB (Electronic Throttle Body) model on Saber..R simulator from Synopsys..R was co-simulated with the SH-2A model. The SH-2A chip was under development during this project, nevertheless we could complete the OSEK OS development, control software design and verification using the virtual system. We confirmed that such software could run on an actual ETC hardware system without modification after a working sample chip was released at a later stage in the course of this work. This demonstrates that our models and simulation environment are sufficiently credible and trustful.
Binary synthesis
Authors: Greg Stitt, Frank Vahid
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2007)

Recent high-level synthesis approaches and C-based hardware description languages attempt to improve the hardware design process by allowing developers to capture desired hardware functionality in a well-known high-level source language. However, these approaches have yet to achieve wide commercial success due in part to the difficulty of incorporating such approaches into software tool flows. The requirement of using a specific language, compiler, or development environment may cause many software developers to resist such approaches due to the difficulty and possible instability of changing well-established robust tool flows. Thus, in the past several years, synthesis from binaries has been introduced, both in research and in commercial tools, as a means of better integrating with tool flows by supporting all high-level languages and software compilers. Binary synthesis can be more easily integrated into a software development tool-flow by only requiring an additional backend tool, and it even enables completely transparent dynamic translation of executing binaries to configurable hardware circuits. In this article, we survey the key technologies underlying the important emerging field of binary synthesis. We compare binary synthesis to several related areas of research, and we then describe the key technologies required for effective binary synthesis: decompilation techniques necessary for binary synthesis to achieve results competitive with source-level synthesis, hardware/software partitioning methods necessary to find critical binary regions suitable for synthesis, synthesis methods for converting regions to custom circuits, and binary update methods that enable replacement of critical binary regions by circuits.
Structure induction by lossless graph compression
Authors: Leonid Peshkin
Venue: Proceedings of the 2007 Data Compression Conference (2007)

This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example genomic networks. A novel algorithm, dubbed Graphitour, for structure induction by lossless graph compression is presented and illustrated by a clear and broadly known case of nested structure in a DNA molecule. This work extends to graphs some well established approaches to grammatical inference previously applied only to strings. The bottom-up graph compression problem is related to the maximum cardinality (non-bipartite) maximum cardinality matching problem. The algorithm accepts a variety of graph types including directed graphs and graphs with labeled nodes and arcs. The resulting structure could be used for representation and classification of graphs.