ppxscal/embedding_network huggingface dataset:
The flask security architecture: system support for diverse security policies
Authors: Ray Spencer, Stephen Smalley, Peter Loscocco, Mike Hibler, David Andersen, Jay Lepreau
Venue: Proceedings of the 8th conference on USENIX Security Symposium - Volume 8 (1999)

Operating systems must be flexible in their support for security policies, providing sufficient mechanisms for supporting the wide variety of real-world security policies. Such flexibility requires controlling the propagation of access rights, enforcing fine-grained access rights and supporting the revocation of previously granted access rights. Previous systems are lacking in at least one of these areas. In this paper we present an operating system security architecture that solves these problems. Control over propagation is provided by ensuring that the security policy is consulted for every security decision. This control is achieved without significant performance degradation through the use of a security decision caching mechanism that ensures a consistent view of policy decisions. Both fine-grained access rights and revocation support are provided by mechanisms that are directly integrated into the service-providing components of the system. The architecture is described through its prototype implementation in the Flask microkernel-based operating system, and the policy flexibility of the prototype is evaluated. We present initial evidence that the architecture's impact on both performance and code complexity is modest. Moreover, our architecture is applicable to many other types of operating systems and environments.
Using Views to Specify a Synchronization Aspect for Object-Oriented Languages
Authors: R. E. K. Stirewalt, L. K. Dillon, R. Behrends
Venue: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop (2006)

It is widely held that programming language extensions that support separation of concerns and that are also integrative benefit development, maintenance and reuse of software designs and code. Such is the intent of our Synchronization Units Model (Szumo), which unifies new features for expressing synchronization in a multi-threaded program with existing features of an object-oriented language. However, to make effective use of a language extension, a programmer needs an accurate mental model of how new concepts affect and are affected by existing concepts. Moreover, good separation dictates that interactions between these concepts should be understandable at the level of the new concepts. This suggests that the semantics of Szumo should be specifiable as a self-contained partial specification, called a view, and the semantics of its integration with other language features should be specifiable by view composition. To our knowledge, however, view-based approaches have not been applied in specifying the semantics of language extensions. Moreover, devising separable views that serve to simplify comprehensibility of a complex specification is still more of an art than a science. This paper presents a case study in the use of views in structuring a Z specification of Szumo.
Behavior of a Bayesian adaptation method for incremental enrollment in speaker verification
Authors: C. Fredouille
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

Classical adaptation approaches are generally used for speaker or environment adaptation of speech recognition systems. In this paper, we use such techniques for the incremental training of client models in a speaker verification system. The initial model is trained on a very limited amount of data and then progressively updated with access data, using a segmental-EM procedure. In supervised mode (i.e. when access utterances are certified), the incremental approach yields equivalent performance to the batch one. We also investigate on the impact of various scenarios of impostor attacks during the incremental enrollment phase. All results are obtained with the Picassoft platform-the state-of-the-art speaker verification system developed in the PICASSO project.
Trainable speech synthesis with trended hidden Markov models
Authors: J. Dines
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

We present a trainable speech synthesis system that uses the trended hidden Markov model to generate the trajectories of spectral features of synthesis units. The synthesis units are trained from a transcribed continuous speech corpus, making the speech more natural than that produced by conventional diphone synthesisers which are generally, trained from a highly articulated speech database and require a large investment of time and effort in order to train a new voice. The,overall system has been incorporated into a PSOLA synthesiser to produce speech that is natural sounding and preserves the identity of the source speaker.
Adaptive Load Distribution Strategies for Divisible Load Processing on Resource Unaware Multilevel Tree Networks
Authors: Jingxi Jia, Bharadwaj Veeravalli, Debasish Ghose
Venue: IEEE Transactions on Computers (2007)

In this paper, we propose load distribution strategies for divisible loads for networked computing environments where computation and communication resource characteristics are unknown and/or vary with time. The principle on which our strategies are formulated is based on using probing loads to estimate the network characteristics and using them to determine the best possible load distribution. This work extends the adaptive strategies proposed in an earlier work to multilevel general networks. These networks, while being more challenging, also offer several opportunities that can be exploited to make the probing phase more efficient. We propose two strategies, one static, which caters to the presence of unknown parameters, and the other dynamic, which caters to both unknown as well as time-varying network parameters. The proposed strategies are robust, resilient, and easily adaptable to network fluctuations. The algorithms are also shown to have a tracking ability, a property that is important in dynamic environments. Examples are presented to illustrate the salient features of these strategies.
Direct Phase-Resolved Simulations of Large-Scale Nonlinear Ocean Wave-Fields
Authors: Guangyu Wu, Yuming Liu, Dick K. P. Yue
Venue: Proceedings of the HPCMP Users Group Conference (2006)

We develop and apply a direct phase-resolved simulation capability for large-scale nonlinear ocean wavefield evolution. Unlike phase-averaged models, we directly solve the primitive Euler equation and preserve the phase of the wavefield during its nonlinear evolution. As a result, detailed descriptions of the free surface elevation and the kinematics of the wavefield are obtained. Using the direct simulation capability, we investigate the validity and limitations of existing approximate theories and models for the prediction of ocean surface wave statistics under different physical parameters. In particular, with 256 processors on the ERDC Cray XT3, we directly compute the nonlinear evolution of a short-crested (three-dimensional) wavefield in a domain of 28.7km×28.7km with evolution time up to 30 minutes, and analyze the occurrence statistics and spatial distribution of rogue waves in the wavefield. The effects of spectral bandwidth and angular spreading on wave statistics are investigated.
VISCP: a virtual instrumentation and CAD tool for electronic engineering learning
Authors: L. Rodriguez Pardo
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

The main objective of electronic engineering learning is the development of the student's ability to design, simulate and test electronic circuits to implement real systems. Commercial tools are very flexible and feature a lot of options. Nevertheless, they are oriented towards the professional market, and they provide many features not needed for educational purposes. On the other hand, much time devoted to understanding very complex manuals is required by the students to master these tools, slowing down the learning of fundamental design concepts. The objective of this communication is to present a CAD tool for the design of digital electronic circuits as well as for testing developed circuits. The system, which is called VISCP, is an educational tool for practical training on digital systems and is intended to guide students in the practical design of basic digital circuits.
Engineering scalable multi-agent communities
Authors: Omer F. Rana, Steven J. Lynden
Venue: Integrated Computer-Aided Engineering (2004)

Various aspects of scalability are investigated, and a survey of various approaches to define this term is provided. Subsequently a description of metrics that may be used to measure and quantify scalability are introduced, and based on system, agent behaviour, coordination and organisation parameters. The LEAF toolkit for building scalable systems which can take account of both functional characteristics - through "functional utility", and the performance characteristics of a system - through a "performance utility" is then outlined. These two utility approaches may be used to combine system, behaviour, coordination and organisation metrics, and provide a first step towards constructing scalable systems.
Facial feature tracking and pose estimation in video sequences by factorial coding of the low-dimensional entropy manifolds due to the partial symmetries of faces
Authors: E. D. Mandel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

In a number of practical scenarios, such as video conferencing and visual human/computer interaction, objects that belong to a well defined class are segmented, normalized, and encoded, after which they are stored and/or transmitted, and subsequently reconstructed. The Karhunen-Loeve transform (KLT) optimally concentrates the signal power in a relatively small number of uncorrelated coefficients. Nevertheless, it implicitly assumes a multidimensional Gaussian probability model, which is typically not correct. Here we show that, in the context of video sequences of human heads, the segmentation and normalization steps result in partial symmetries which force the KLT coefficients to lie close to low-dimensional manifolds in suitably chosen high-dimensional KLT subspaces. We show how this fact can be used to track the faces robustly, and to estimate their pose. We use vector quantization to discover those manifolds, and to build a factorial code that has a substantially lower dimensionality than KLT.
Simple and Secure Authentication Escrow for Rights Trading Protocol
Authors: Keiichi Hirota, Noboru Sonehara
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

Considering electronic rights trading, especially P2P trading of rights among users, high usability is necessary for protocols as well as strong safety. However, in some protocols, they need several synchronous bi-directional transactions to achieve strong safety, but it offers low usability. We propose a novel rights trading protocol which enables simple and secure authentication escrow with asynchronous two transactions. In our protocol, the authentication information of the owner is hidden into trade declaration with the identifier of the right and trading conditions like price the owner requires, and the declaration is dispersed into a pair of shares using polynomial function. These shares include all the information and anyone can reconstruct a part of trade declaration, but no one except rights manager and the owner himself can reconstruct the authentication information. In this paper we describe detailed outline of the protocol and discuss the safety and usability of it.
Stochastic iterative alignment for machine translation evaluation
Authors: Ding Liu, Daniel Gildea
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

A number of metrics for automatic evaluation of machine translation have been proposed in recent years, with some metrics focusing on measuring the adequacy of MT output, and other metrics focusing on fluency. Adequacy-oriented metrics such as BLEU measure &eta;-gram overlap of MT outputs and their references, but do not represent sentence-level information. In contrast, fluency-oriented metrics such as ROUGE-W compute longest common subsequences, but ignore words not aligned by the LCS. We propose a metric based on stochastic iterative string alignment (SIA), which aims to combine the strengths of both approaches. We compare SIA with existing metrics, and find that it outperforms them in overall evaluation, and works specially well in fluency evaluation.
The JMT Simulator for Performance Evaluation of Non-Product-Form Queueing Networks
Authors: M. Bertoli, G. Casale, G. Serazzi
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

This paper describes JSIM: the simulation module of the Java Modelling Tools (JMT), an open-source fully-portable Java suite for capacity planning studies. The simulator has been purposely developed to help both unexperienced and advanced users. Most of the difficult decisions that are needed in order to run simulations properly, such as the detection of the transient part of samples to be discarded, have been automated. The tool also provides guidance over the graphical design of the network and over the analysis and the plot of the results. What-if parametric analyses for parametric evaluation of complex systems are supported. Several features that increase the generality of the applica- tions to capacity planning studies are provided, among them fork-join service centers, regions with finite capacity, state- dependent routing algorithms, priority classes and import of real workload distributions from log files.
On Noetherian Spaces
Authors: Jean Goubault-Larrecq
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

A topological space is Noetherian iff every open is compact. Our starting point is that this notion generalizes that of well-quasi order, in the sense that an Alexandroff-discrete space is Noetherian iff its specialization quasi-ordering is well. For more general spaces, this opens the way to verifying infinite transition systems based on non-well quasi ordered sets, but where the preimage operator satisfies an additional continuity assumption. The technical development rests heavily on techniques arising from topology and domain theory, including sobriety and the de Groot dual of a stably compact space. We show that the category Nthr of Noetherian spaces is finitely complete and finitely cocomplete. Finally, we note that if X is a Noetherian space, then the set of all (even infinite) subsets of X is again Noetherian, a result that fails for well-quasi orders.
Trickle: a self-regulating algorithm for code propagation and maintenance in wireless sensor networks
Authors: Philip Levis, Neil Patel, David Culler, Scott Shenker
Venue: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1 (2004)

We present Trickle, an algorithm for propagating and maintaining code updates in wireless sensor networks. Borrowing techniques from the epidemic/gossip, scalable multicast, and wireless broadcast literature, Trickle uses a "polite gossip" policy, where motes periodically broadcast a code summary to local neighbors but stay quiet if they have recently heard a summary identical to theirs. When a mote hears an older summary than its own, it broadcasts an update. Instead of flooding a network with packets, the algorithm controls the send rate so each mote hears a small trickle of packets, just enough to stay up to date. We show that with this simple mechanism, Trickle can scale to thousand-fold changes in network density, propagate new code in the order of seconds, and impose a maintenance cost on the order of a few sends an hour.
A semi-continuous stochastic trajectory model for phoneme-based continuous speech recognition
Authors: O. Siohan, Yifan Gong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

We propose a model of phoneme-based speech unit, called semi-continuous stochastic trajectory model (SC-STM), which generalizes our stochastic trajectory models (STM). As STMs, the SC-STMs focus on the modeling of speech segments (called trajectories) in their parameter space, and can therefore handle segmental information, which is critical for large vocabulary continuous speech recognition. Compared to the STMs, the SC-STMs improve the resolution of the trajectory modeling, while keeping a moderate number of free parameters by sharing state probability density functions. The SC-STM can therefore maintain a good trade-off between detailed acoustic modeling and limited training data. We tested the idea on a 2010 words, speaker-dependent, continuous speech database. Preliminary results show that SC-STM gives a word accuracy close to that of STM, without using heuristic techniques that enhanced STM.
Data Structure Health
Authors: Nick Mitchell, Gary Sevitsky, Palani Kumanan, Edith Schonberg
Venue: Proceedings of the 5th International Workshop on Dynamic Analysis (2007)

Applications often have large runtime memory requirements. In some cases, large memory footprint helps accomplish an important functional, performance, or engineering requirement. A large cache, for example, may ameliorate a pernicious performance problem. In general, however, finding a good balance between memory consumption and other requirements is quite challenging. To do so, the development team must distinguish effective from excessive use of memory: when is a data structure too big for its own good? We introduce health signatures to facilitate this balance. Using data from dozens of applications and benchmarks, we show that they provide concise and application-neutral summaries of footprint. We show how to use them to form value judgments about whether a design or implementation choice is good or bad. We demonstrate how to use health signatures to evaluate the asymptotic behavior of these choices, as input data size scales up. Finally, we show how being independent of any application eases comparison across disparate implementations.
The Voronoi diagram of circles made easy
Authors: Francois Anton, Darka Mioc, Christopher Gold
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

Proximity queries among circles could be effectively answered if the Delaunay graph for sets of circles could be computed in an efficient and exact way. In this paper, we first show a necessary and sufficient condition of connectivity of the Voronoi diagram of circles. Then, we show how the Delaunay graph of circles (the dual graph of the Voronoi diagram of circles) can be computed exactly, and in a much simpler way, by computing the eigenvalues of a two by two matrix.
Surface Rendering for Parallel Slices of Contours from Medical Imaging
Authors: Wang Qiang, Zhigeng Pan, Chen Chun, Bu Jianjun
Venue: Computing in Science and Engineering (2007)

A radial basis function-based interpolation method can help researchers render the surface of human organs. Moreover, by using data sets that contain parallel slices of contours extracted from medical images, researchers can also efficiently reconstruct an organ's surface.
Computer simulation of electric power system
Authors: A. Ahmed, J. M. Bee
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Describes how to use computer simulation as a useful tool for teaching power flow analysis at the undergraduate level. A PC-based computer program, which runs under the Windows environment, has been developed at Purdue University Calumet. It provides a user-friendly environment that allows the students to simulate and analyze events that occur on a transmission system. These events consist of changing the bus voltages at the generating stations, taking generating stations off-line and taking transmission lines out of service. After each event, the software calculates the voltage at each bus, and the real and reactive power flow through the system. The user can then analyze the change in these values because of the event. The software package is used as a supplement to an undergraduate course in electrical power systems. This has increased students' ability to understand the way a power system responds to various loads and generation schedules. Examples of simulations are included.
Use of statistical timing analysis on real designs
Authors: A. Nardi, E. Tuncer, S. Naidu, A. Antonau, S. Gradinaru, T. Lin, J. Song
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

A vast literature has been published on Statistical Static Timing Analysis (SSTA), its motivations, its different implementations and their runtime/accuracy trade-offs. However, very limited literature exists ([1]) on the applicability and the usage models of this new technology on real designs. This work focuses on the use of SSTA in real designs and its practical benefits and limitations over the traditional design flow. We introduce two new metrics to drive the optimization: skew criticality and aggregate sensitivity. Practical benefits of SSTA are demonstrated for clock tree analysis, and correct modeling of on-chip-variations. The use of SSTA to cover the traditional corner analysis and to drive optimization is also discussed. Results are reported on three designs implemented on a 90nm technology.
Teaching computer architecture in a PC equipped lab using Turbo and Sun assembly language
Authors: B. S. Goda, D. C. Gray, J. R. Loy
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Cadets at the US Military Academy majoring in computer science or computer engineering take an introductory computer architecture course. In contrast to your traditional architecture course, ours is taught in a PC equipped classroom. Cadets learn the basic organization and internal functioning of an IBM PC by employing Turbo Assembler. Important teaching points can be emphasized by having cadets step though an assembly language program while observing the various changes in the registers and status flags. By studying the control flow of actual programs, cadets gain a better appreciation of the data flow, timing and control necessary to execute a program. The goal of the course is to gain an understanding of the importance of assembly language and its relationship to a computer's architecture, not to make cadets experts in assembly language programming.
Dynamic channel assignment and reassignment for exploiting channel reuse opportunities in ad hoc wireless networks
Authors: Chih-Yung Chang, Chao-Tsun Chang, Po-Chih Huang
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

In Ad Hoc networks, a channel that is occupied by a pair of hosts can be reused by another pair of hosts, only if their communication range is not overlapped. Exploiting the channel reuse opportunities may cause the co-channel interference problem. Two pairs of communicating hosts that use the same channel may be gradually close to each other. A channel reassignment operation should be applied to these hosts for maintaining their communication. This paper proposes a channel assignment protocol so that the channel resource could be highly utilized. A channel reassignment protocol is also proposed for preventing the communicating hosts from co-channel interference owing to mobility. The proposed reassignment protocol efficiently reassigns a new available channel for one pair of hosts that is suffering from co-channel interference. Experimental results show that the proposed protocols provide a larger amount of hosts with communication at the same time and prevent their communication from failure.