ppxscal/embedding_network huggingface dataset:
Bayesian detection of transient signals in colored noise
Authors: Yufei Huang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

The problem of detecting transient signals in colored noise is addressed. The generalized likelihood ratio test fails to provide good performance, and as an alternative, a Bayesian approach is proposed. Its implementation is simplified by adopting an invariant transformation, and a sequential Monte Carlo sampling procedure is provided to compute multidimensional integrations. The simulation results demonstrate the ability of this approach to detect weak and fast decaying signals in colored noise.
Contracts and Middleware for Safe SOA Applications
Authors: Beata Sarna-Starosta, R. E. K. Stirewalt, Laura K. Dillon
Venue: Proceedings of the International Workshop on Systems Development in SOA Environments (2007)

This position paper concerns formal methods for developing safe service-oriented architectures (SOAs) with support for resource management. We seek an approach to building such SOAs based on the specification of service requirements as declarative contracts, and the enforcement of these contracts at the level of the middleware. Using hierarchical containers that provide the necessary middleware services, we expect to guarantee certain safety properties by construction and raise the level of model abstraction for verifying other necessary properties.
Secure parallel file distribution through a streaming worm network: Research Articles
Authors: Michael J. Sheehan
Venue: Bell Labs Technical Journal (2007)

This paper introduces the novel concept of streaming worms and applies the concept to secure parallel file transfer. A streaming worm (sworm) is a powerful class of software that can replicate itself as well as a chunk of arbitrary payload code on a predetermined set of nodes in a network very quickly, while streaming data between all of the nodes in parallel. By harnessing the parallelism and scalability of sworms in a file distribution application, large gigabyte files can be efficiently and securely distributed to a large number of nodes over a Transmission Control Protocol&#x002F;Internet Protocol (TCP&#x002F;IP) network without congesting the network. But unlike traditional file transfer tools such as File Transfer Protocol (FTP), remote copy (RCP), or secure copy (SCP), the total sworm transfer time is relatively independent of the number of target nodes for large files. As such, this method of parallel file distribution is particularly useful when a large array or cluster of similar computers has to be quickly updated with a large amount of identical software or data. &copy; 2007 Alcatel-Lucent.
Fuzzy robust courses scheduling problem
Authors: Barbara Gładysz
Venue: Fuzzy Optimization and Decision Making (2007)

We consider examination courses scheduling at university. Two basic courses sharing at least one student cannot be scheduled at the same time. This scheduling problem will be stated as a graph coloring problem. The stability of the scheduled solution would be desirable in the sense that it remains valid also if some additional students want to do the exams, for example those who failed in earlier examination sessions. This stability is defined as the robustness of scheduling courses. We consider a mean value of the fuzzy number of courses incompatibilities as the robustness measure.
An Empirical Study on the Relationship between Defective Requirements and Test Failures
Authors: Robert W. Ferguson, Giuseppe Lami
Venue: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop (2006)

The quality of software products depends on the quality of the requirements used to create them. Expressiveness (i.e., the ability to convey the intended meaning by avoiding ambiguities and readability problems) is an important quality characteristic of natural language requirements. This paper describes an empirical study that used data from an industrial software project to identify possible relationships between expressiveness defects in natural language requirements and failures during testing. The study shows that test failures occur more frequently when there exist requirements cases with expressiveness defects.
Practical Issues of 2-D Parallel Finite Element Analysis
Authors: Michelle R. Ilribar, Valerie E. Taylor
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

The. use of parallel processors has made it possible to execute large scale applications such as finite element analysis. Generally, the speedup is limited by the interprocessor communication used by message-passing multicomputers. The major question addressed by users of message-passing machines is the identification, of the most efficient type of communication scheme for the. particular application. Practical considerations such as the following are frequently neglected: the range of message sizes for which a communication scheme is appropriate, the impact on the subdomain size, the. memory requirements versus the actual memory of the machine, and how the optimal communication method changes as a fixed size problem is scaled to a larger number of processors. In this paper we address these practical issues for 2-D finite, element problems executed on the Intel Delta machine.
The Cost of Free Web Tools
Authors: Edward Sobiesk, Gregory Conti
Venue: IEEE Security and Privacy (2007)

Free Web-based services aren't really free: users pay for them with micropayments of information that add up to a very significant sum. Indeed, it can be quite eye-opening to find out how much we reveal about ourselves and our companies through the seemingly innocuous words we use to search and the maps we view on the Internet. In today's era of customized advertising, we see a trend toward automated mining and correlating of our data disclosures, which has a host of ethical implications. Clearly, no single solution will solve all the challenges--not least because future tools and services will raise new issues that need further attention--but anticipating and working through the challenges before they become crises would benefit all parties.
Forensics Education: Assessment and Measures of Excellence
Authors: Carol Taylor, Barbara Endicott-Popovsky, Amelia Phillips
Venue: Proceedings of the Second International Workshop on Systematic Approaches to Digital Forensic Engineering (2007)

In this paper we assess current academic and certificate based education and training programs in digital forensics education. Strong interest in the digital forensics field has led to a proliferation of education options in both academia and professional training programs. Yet, few studies have attempted to define quality attributes or measures of excellence for these programs. This study defines a set of excellence measures for academic programs seeking to teach digital forensics distilled from existing training documents, author experience and other studies. The expectation is that this first attempt to define program excellence will generate discussion and stimulate others in the forensics community to add their own measures of excellence in addition to critiquing ours. We also describe other needed components for digital forensics education in order for the field to move forward.
Time-delay estimation for compound point-processes using hidden Markov models
Authors: J. Wohlers
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

A new time-delay estimation algorithm for compound point-processes is presented. Compound point-processes, a generalization of temporal point-processes, describe processes with discrete events, where each occurrence time is associated with certain features. It is shown that, although the events are not observable, the time delays from events at one location to the same events at a second location can be estimated using hidden Markov models based on the associated features. We demonstrate the performance of this time-delay estimation algorithm with an application to the estimation of section-related traffic data in road traffic monitoring and control systems.
μ-tree: an ordered index structure for NAND flash memory
Authors: Dongwon Kang, Dawoon Jung, Jeong-Uk Kang, Jin-Soo Kim
Venue: Proceedings of the 7th ACM IEEE international conference on Embedded software (2007)

As NAND flash memory becomes increasingly popular as data storage for embedded systems, many file systems and database management systems are being built on it. They require an efficient index structure to locate a particular item quickly from a huge amount of directory entries or database records. This paper proposes μ-Tree, a new ordered index structure tailored to the characteristics of NAND flash memory. μ-Tree is a balanced tree similar to B+-Tree. In μ-Tree, however, all the nodes along the path from the root to the leaf are put together into a single flash memory page in order to minimize the number of flash write operations when a leaf node is updated. Our experimental evaluation shows that μ-Tree outperforms B+-Tree by up to 28% for traces extracted from real workloads. With a small in-memory cache of 8 Kbytes, μ-Tree improves the overall performance by up to 90% compared to B+-Tree with the same cache size.
A Weighted Voting Mechanism for Action Selection Problem in Self-Adaptive Software
Authors: Mazeiar Salehie, Ladan Tahvildari
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

Self-adaptive software is a closed-loop system which aims at adjusting itself in response to changes at runtime. Such a system is required to monitor domain events, detect significant changes, decide how to react, and act in order to execute the decisions. This paper focuses on the deciding process particularly for application-level adaptation actions. For this purpose, a weighted voting mechanism has been proposed which makes decisions based on a Goal-Action- Attribute Model (GAAM). The decision-making algorithm traverses GAAM, determines activated goals and feasible actions for voting, and ultimately selects an action as the social choice. The proposed mechanism and GAAM are evaluated within a simulated model of a news web site.
Practical memory leak detection using guarded value-flow analysis
Authors: Sigmund Cherem, Lonnie Princehouse, Radu Rugina
Venue: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation (2007)

This paper presents a practical inter-procedural analysis algorithm for detecting memory leaks in C programs. Our algorithm tracks the flow of values from allocation points to deallocation points using a sparse representation of the program consisting of a value flow graph that captures def-use relations and value flows via program assignments. Edges in the graph are annotated with guards that describe branch conditions in the program. The memory leak analysis is reduced to a reachability problem over the guarded value flowgraph. Our implemented tool has been effective at detecting more than 60 memory leaks in the SPEC2000 benchmarks and in two open-source applications, bash and sshd, while keeping the false positive rate below 20%. The sparse program representation makes the tool efficient in practice, and allows it to report concise error messages.
Energy Efficient Data Routing in Wireless Sensor Network: A Mixed Approach
Authors: Md Ashiqur Rahman, Sajid Hussain
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

This paper presents a data routing protocol for a non-mobile, location-aware wireless sensor network that is primarily designed for continuous monitoring application (e.g. environmental, infrastructure, under-water or agricultural monitoring). The protocol, in addition to optimally minimizing the total energy consumption of all sensors over all rounds of data gathering, also balances the load on them. The algorithm works in polynomial time complexity and is completely centralized. However, it incurs less overhead as the data routing information is disseminated to all sensors only once at the network initialization.
Trust Mass, Volume and Density - a Novel Approach to Reasoning about Trust
Authors: Fredrik Degerlund
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

The notion of trust has become a major factor in today's networked world. While security is widely recognized as an important aspect of public networked systems, the actions of individual participants is often neglected. Even though the need of trust management is taken into account, there is no universal solution as to what algorithms to use for calculating trust, nor is there any universal representation. In this paper, we propose a novel approach to managing trust by making an analogy between physical matter and abstract trust. We show that this alternative way of reasoning is feasible by proposing a framework based on metrics such as trust mass, volume and density, inspired by the corresponding concepts in physics. Our framework also provides for an intuitive means of representing trust graphically.
An Application Specific Processor for Montecarlo Simulations
Authors: G. Danese, F. Leporati, M. Bera, M. Giachero, N. Nazzicari, A. Spelgatti
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

In this paper we describe an Accelerator based on FPGA technology and interfaced to an external host computing system through standard bus connections; it is conceived to accelerate double precision floating point operations, present in the energy calculation of Montecarlo (MC) Metropolis particle system simulations. The Accelerator plays the role of coprocessor giving a speed-up factor equal to 4, with respect last generation PCs. The proposed solution is based on COTS components and shows good characteristics of scalability in terms of clock frequency, memory capability and number of computing units. Moreover, the Accelerator can be also conceived as a part of a computing system made up by a cluster of accelerated workstations.
Active learning with upper division computer science students
Authors: B. Timmerman
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

Computer science students, especially upper division students, are stereotypically considered to be introverted and therefore poor candidates for an active learning curriculum. Ironically, the requirements of their field demand skills in critical analysis and evaluation, as well as communication and collaboration skills, that are not easily acquired in the traditional classroom environment with a "lecture" agenda where students maintain a basically passive role. This paper describes experiments with active learning techniques performed in two different upper division computer science classes, "Societal Issues in Computing" and "Computer System Security". In spite of the traditional views of computer science as an individualistic subject matter with self centered nonsocial students, the authors have used active learning techniques in their classrooms for several semesters with encouraging results. In addition to an improved attitude and stated increased satisfaction, students' test results showed increased comprehension and improved critical reasoning abilities.
Enterprise Healthcare for Mobile Device and Interoperation of Patient Information
Authors: Dong-Chun Lee, Kee-Hyun Choi, Dong-Ryeol Shin
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Future pervasive environments will integrate the environment with enterprise systems, including software, hardware, databases, standards, and life cycle systems. Designing and implementing "enterprise-strength" pervasive applications today is a challenging task, but enterprise application has practical usage by supporting numerous clients and enterprise technology basically supports web as an application layer like JSP pages. Through web, every client can access the same application regardless of the devices such as mobile device (PDA). In line with this concept we suggest a scenario which can be occurred in usual life assuming that this system is practically used in hospital domain. We implement healthcare application which is based on J2EE platform and using Web standard technology. By using J2EE platform and XML, we can support mobility, scalability and integrity.
Lexical file names in plan 9 or getting dot-dot right
Authors: Rob Pike
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

Symbolic links make the Unix file system non-hierarchical, resulting in multiple valid path names for a given file. This ambiguity is a source of confusion, especially since some shells work overtime to present a consistent view from programs such as pwd, while other programs and the kernel itself do nothing about the problem. Plan 9 has no symbolic links but it does have other mechanisms that produce the same difficulty. Moreover, Plan 9 is founded on the ability to control a program's environment by manipulating its name space. Ambiguous names muddle the result of operations such as copying a name space across the network. To address these problems, the Plan 9 kernel has been modified to maintain an accurate path name for every active file (open file, working directory, mount table entry) in the system. The definition of 'accurate' is that the path name for a file is guaranteed to be the rooted, absolute name the program used to acquire it. These names are maintained by an efficient method that combines lexical processing--such as evaluating .. by just removing the last path name element of a directory--with local operations within the file system to maintain a consistently, easily understood view of the name system. Ambiguous situations are resolved by examining the lexically maintained names themselves. A new kernel call, fd2path, returns the file name associated with an open file, permitting the use of reliable names to improve system services ranging from pwd to debugging. Although this work was done in Plan 9, Unix systems could also benefit from the addition of a method to recover the accurate name of an open file or the current directory.
Screen-Camera Calibration using a Spherical Mirror
Authors: Yannick Francken, Chris Hermans, Philippe Bekaert
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

Recent developments in the consumer market have indicated that the average user of a personal computer is likely to also own a webcam. With the emergence of this new user group will come a new set of applications, which will require a user-friendly way to calibrate the position of the camera with respect to the location of the screen. This paper presents a fully automatic method to calibrate a screen-camera setup, using a single moving spherical mirror. Unlike other methods, our algorithm needs no user intervention other then moving around a spherical mirror. In addition, if the user provides the algorithm with the exact radius of the sphere in millimeters, the scale of the computed solution is uniquely defined.
Subcube Level Time-Sharing in Hypercube Multicomputers
Authors: Debendra Das Sharma, Gavin D. Holland, Dhiraj K. Pradhan
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

A novel approach for subcube level time-sharing in hypercube multicomputers is proposed. Using this approach, multiple tasks may execute on the same processors. The tasks may be completely or partially overlapped with synchronous or asynchronous context switching. A dynamic binary tree is used for subcube allocation and deallocation. An incoming task is allocated to a subcube within which it will encounter minimum interference from other tasks. The allocation and deallocation time complexities are shown to be 0(n2). The proposed strategy has been implemented on an nCUBE 2. Measurement results indicate that the proposed strategy outperforms the FCFS-based batch-scheduling policy and an existing time-sharing policy by significantly reducing the average turn-around times.
A new W3C markup standard for text-to-speech synthesis
Authors: M. R. Walker
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

A new set of XML-based markup standards developed for the purpose of enabling voice browsing of the Internet are emerging from the Voice Browser working group, organized under the auspices of the W3C. Among the first in this series of specifications is the speech synthesis text markup standard. The Speech Synthesis Markup Language (SSML) specification is largely based on Java Speech Markup Language (JSML), but also incorporates elements and concepts from SABLE, previously published text markup standards, and from Voice eXtensible Markup Language (VoiceXML), which is itself based on JSML and SABLE. SSML also includes new elements designed to optimize the capabilities of contemporary speech synthesis engines in the task of converting text into speech. This paper summarizes the markup element design philosophy and includes descriptions of each of the speech synthesis markup elements.
Co-articulation Modeling for Handwriting Synthesis
Authors: Jin H. Kim, H. I. Choi
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Personal style handwriting synthesis aims to produce texts in the writer's style from a few handwriting samples. A handwriting synthesis system usually focuses on the production of the glyph, a handwriting unit separated by a space such as English word, Tamil word, Chinese character, Korean character, etc. However, glyph cannot be considered as the unit of direct generation, because the number of glyphs in a language is large and the handwriting shape varies over time, Since, the glyph consists of one or more of components, called graphemes, and a grapheme is an atomic unit of glyph that has a relatively unique shape, grapheme is a most desirable unit of handwriting generation. However, handwritten grapheme generation is not simple as it sounds, because a grapheme is written differently depending on its neighboring graphemes, which is called co-articulation effect.