ppxscal/embedding_network huggingface dataset:
Zodiac: efficient impact analysis for storage area networks
Authors: Aameek Singh, Madhukar Korupolu, Kaladhar Voruganti
Venue: Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4 (2005)

Currently, the fields of impact analysis and policy based management are two important storage management topics that are not being treated in an integrated manner. Policy-based storage management is being adopted by most storage vendors because it lets system administrators specify high level policies and moves the complexity of enforcing these policies to the underlying management software. Similarly, proactive impact analysis is becoming an important aspect of storage management because system administrators want to assess the impact of making a change before actually making it. Impact analysis is increasingly becoming a complex task when one is dealing with a large number of devices and workloads. Adding the policy dimension to impact analysis (that is, what policies are being violated due to a particular action) makes this problem even more complex. In this paper we describe a new framework and a set of optimization techniques that combine the fields of impact analysis and policy management. In this framework system administrators define policies for performance, interoperability, security, availability, and then proactively assess the impact of desired changes on both the system observables and policies. Additionally, the proposed optimizations help to reduce the amount of data and the number of policies that need to be evaluated. This improves the response time of impact analysis operations. Finally, we also propose a new policy classification scheme that classifies policies based on the algorithms that can be used to optimize their evaluation. Such a classification is useful in order to efficiently evaluate user-defined policies. We present an experimental study that quantitatively analyzes the framework and algorithms on real life storage area network policies. The algorithms presented in this paper can be leveraged by existing impact analysis and policy engine tools.
Distributed Event-Based Systems: An Emerging Community
Authors: Peter Pietzuch, Gero Muhl, Ludger Fiege
Venue: IEEE Distributed Systems Online (2007)

Over the past couple of years, event-based systems have appeared in many application domains, such as enterprise managementsystems, large-scale data dissemination, Internet applications, and autonomic computing. However, event-based-systems research has beenscattered across several conferences and workshops, making it hard to establish a single community of interested researchers andpractitioners. The Inaugural International Conference on Distributed Event-Based Systems will be held in Toronto in June 2007 to supportevent-based systems' growth.
An Integrated and “Engaging” Package for Tree Animations
Authors: Guido Rößling, Silke Schneider
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

This paper describes a prototypical system for tree and tree algorithm animations. The system allows the user to create his or her own tree from a selection of supported tree types by inserting and removing nodes. At any point in time, the user can ask for a visualization of the tree's generation to see the effects of the chosen actions. The user can also request embedded documentation on different levels of detail. The system may prompt the user to answer questions about the displayed contents. The online help further assists the user in learning about the tree types and operations. The package presented in this paper corresponds to the engagement levels viewing, responding, changing and also supports the presenting engagement level as defined in the engagement taxonomy [Naps, T.L., G. Roszling, V. Almstrum, W. Dann, R. Fleischer, C. Hundhausen, A. Korhonen, L. Malmi, M. McNally, S. Rodger and J.A. Velazquez-Iturbide, Exploring the Role of Visualization and Engagement in Computer Science Education, ACM SIGCSE Bulletin 35 (2003), pp. 131-152].
A Software Architecture for the Provisioning of Mobile Services in Peer-to-Peer Environments
Authors: Fabricio B. Goncalves, Carlo E. T. Oliveira, Izalmo Silva, Luiz G. L. Moura, Felipe M. G. Franca
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

Service-Oriented Computing (SOC) is the computational paradigm that utilizes services as fundamental elements to develop applications/solutions. To build a service model, SOC relies on the Service-Oriented Architecture (SOA), which is a way of reorganizing software applications and infrastructures in a set of interacting services. This paper proposes a layered architectural model of the abstraction levels needed in the construction of mobile services platforms. Each one of theses layers has been defined based on SOC requirements and delivers the functionality needed to the creation of autonomous reconfiguring distributed systems.
Adaptive CFAR detection of multidimensional signals
Authors: E. Conte
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Adaptive detection of multidimensional signals in the presence of interference with unknown covariance matrix is an expanding topic in a variety of scenarios ranging from radar/sonar to digital communication systems. We attack the problem of detecting a multidimensional radar signal, modeled as an unknown N/spl times/H matrix, embedded in Gaussian noise with unknown covariance matrix, with the ambition of devising receivers which yield the constant false alarm rate (CFAR) property. We show that this aim can be achieved by resorting to the principle of invariance, namely restricting our attention to hypothesis testing problems which remain unaltered under a proper group of transformations. Several detectors based on the maximal invariant statistic are studied and, in particular, the generalized likelihood ratio test (GLRT) is shown to belong to the class of invariant tests.
e-Business Integration Using Mobile Services for the Small to Medium Enterprise
Authors: T. Kirkham, J. Gallop, I. Johnson, D. Mac Randal, B. Ritchie, T. Varsamidis
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

This paper presents an application of a Grid Service architecture to address the challenges of e- Business integration in mobile computing environments. The design is developed by combining the core services in an e-Business integration grid, with the core services from a grid that supports mobility. The presented architecture highlights key services that can be added to existing non-mobile Grid Service architectures to allow support for mobility. The paper presents the results of an investigation into the key service links that need to be maintained through the network layer, middleware layer and application layer in order to provide Grid applications that use mobile services. The paper concludes with an outline of future work and open issues in the development of mobile e-Business integration applications.
Persistent personal names for globally connected mobile devices
Authors: Bryan Ford, Jacob Strauss, Chris Lesniewski-Laas, Sean Rhea, Frans Kaashoek, Robert Morris
Venue: Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7 (2006)

The Unmanaged Internet Architecture (UIA) provides zero-configuration connectivity among mobile devices through personal names. Users assign personal names through an ad hoc device introduction process requiring no central allocation. Once assigned, names bind securely to the global identities of their target devices independent of network location. Each user manages one namespace, shared among all the user's devices and always available on each device. Users can also name other users to share resources with trusted acquaintances. Devices with naming relationships automatically arrange connectivity when possible, both in ad hoc networks and using global infrastructure when available. A UIA prototype demonstrates these capabilities using optimistic replication for name resolution and group management and a routing algorithm exploiting the user's social network for connectivity.
Lossless coding of MPEG-1 Layer III encoded audio streams
Authors: F. Golchin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

In this paper we describe a lossless coding scheme for the encoding of MPEG-1 Layer III encoded audio bitstreams. Commonly known as MP3, the MPEG-1 Layer III standard has proved widely popular for the transmission of encoded audio files (MP3's) over the Internet. However, the MPEG-1 Layer III standard has been designed with a wide range of applications in mind. As such, the frame sizes are kept small and redundancies between samples in neighboring frames are not exploited. We propose a design which uses a combination of linear predictive coding and arithmetic coding to exploit such redundancies. The proposed coder was tested on a number of Layer III encoded audio (MP3) files and shown to produce an average coding gain of 12.2% over the original Layer III encoded files.
Swarm directions embedded in fast evolutionary programming
Authors: Chengjian Wei, Zhenya He, Yifeng Zhang, Wenjiang Pei
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Evolutionary programming has been applied to many optimization problems. However, on some function optimization problems its convergence rate is slow. In this paper, swarm directions are embedded in fast evolutionary programming. The swarm direction for an individual supplies its place to be mutated. The experimental results show its effectiveness and efficiency.
Adaptive-search tree-structured residual vector quantization
Authors: C. B. Peel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

Full-search vector quantization (VQ) provides optimal results only with high memory and computational cost. We describe the computational and memory requirements of tree-structured VQ, residual VQ (RVQ), and tree-structured RVQ. We present multiple-rate, adaptive-search implementations of these VQ structures, and simulation results with video sequences. Tree-structured RVQ provides up to 1.5 db PSNR quality improvements over RVQ, as well as significant perceptual improvement. These algorithms maintain many of the benefits of full-search VQ, while providing trade-offs between computational, storage, and performance requirements.
Performance issues in parallelized network protocols
Authors: Erich M. Nahum, David J. Yates, James F. Kurose, Don Towsley
Venue: Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation (1994)

Parallel processing has been proposed as a means of improving network protocol throughput. Several different strategies have been taken towards parallelizing protocols. A relatively popular approach is packet-level parallelism, where packets are distributed across processors. This paper provides an experimental performance study of packet-level parallelism on a contemporary shared-memory multiprocessor. We examine several unexplored areas in packet-level parallelism and investigate how various protocol structuring and implementation techniques can affect performance. We study TCP/IP and UDP/IP protocol stacks, implemented with a parallel version of the x-kernel running in user space on Silicon Graphics multiprocessors. Our results show that only limited packet-level parallelism can be achieved within a single connection under TCP, but that using multiple connections can improve available parallelism. We also demonstrate that packet ordering plays a key role in determining single-connection TCP performance, that careful use of locks is a necessity, and that selective exploitation of caching can improve throughput. We also describe experiments that compare parallel protocol performance on two generations of a parallel machine and show how computer architectural trends can influence performance.
Computer-based reading program with at-risk pre-kindergarten students
Authors: Gertrude W. Abramson
Venue:  (2006)

The goal of the dissertation was to investigate the usage-effect for the computer-based reading program, Breakthrough to Literacy (BTL), in literacy achievement with at-risk Pre-K students, and summer learning loss. Designed to supplement classroom literacy activities through daily time using the computerized program, BTL emphasized four reading instruction components: alphabet knowledge, phonological awareness, vocabulary, and word recognition. Using a prospective causal-comparative research design, the year and half long study included a large, 1,288 student sample population of experimental and control groups identified from intact, at-risk Pre-K classes in an urban school district in eastern Virginia. Classroom visitations and BTL student usage data validated fidelity of implementation in experimental classes. Pretest and posttest literacy achievement data were collected through school year 2004-05 using the Internet-based PALS-PreK test system. Experimental group mean score was slightly higher than the control group, although not significant. ANCOVA, with pretests as covariate, showed higher control group gain score, with significance, but small effect size (partial &eta;2=.006). Notably, experimental teachers rated the BTL program as excellent in developmental, presentation, social, and instructional components. Teachers judged it as an appropriate instructional application for literacy development with at-risk Pre-K students. The control teacher advocated expansion of the Pre-K BTL program to increase kindergarten readiness. Prior research found summer learning loss in literacy achievement for disadvantaged students. Kindergarten literacy achievement data were obtained in 2005-06 from the PALS-K test system. Based on prior Pre-K and kindergarten scores, 43.1% of the at-risk experimental and control Pre-K students had experienced summer learning loss. Both groups showed positive mean kindergarten gain scores with the experimental (M=5.16) two times higher than the control group (M=2.48), although not significant. Results suggested BTL usage influenced retaining Pre-K literacy achievement beyond summer.
A Comparative Performance Study of an Interconnection Cached Network
Authors: Vipul Gupta, Eugen Schenfeld
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

The Holy Grail of multi-computer network architects is an ideal crossbar with large size, high bandwidth and fast switching speed. Currently, only small crossbars with fast switching rates are available. Some technologies, e.g. optics, make it possible to build large, high bandwidth crossbars. However, these crossbars switch slowly. The Interconnection Cached Network (ICN) contains many small crossbars interconnected by a single large crossbar. The large crossbar is used for topology reconfiguration, and the small crossbars for message switching. In many parallel applications, each processing element (PE) communicates with only a small set of other PEs. We call this phenomenon switching locality and show that, in its presence, the ICN performs almost as well as the ideal crossbar. We also show that alternative networks have poorer overall performance in terms of average message latency, highest sustainable throughput, and application scalability.
Transparency and access to source code in electronic voting
Authors: Joseph Lorenzo Hall
Venue: Proceedings of the USENIX/Accurate Electronic Voting Technology Workshop 2006 on Electronic Voting Technology Workshop (2006)

We examine the potential role of source code disclosure and open source code requirements in promoting technical improvements and increasing transparency of voting systems. We describe the "enclosure of transparency" of voting technology that has occurred over the course of United States' electoral history, the implications that source code disclosure has for transparency, the negative effects that enclosing transparency has had at different levels and the regulatory and legislative efforts to increase access to source code. We then look at the benefits and risks of open and disclosed source code regimes for voting systems, efforts to provide open source voting systems, existing open source business models that might translate to the voting systems context, regulatory and market barriers to disclosed or open source code in voting systems and alternatives that might exist outside of public disclosure of source code. We conclude that disclosure of full system source code to qualified individuals will promote technical improvements in voting systems while limiting some of the potential risks associated with full public disclosure.
False Information in Internet Auction Communities
Authors: Oliver Hinz
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

As one of the most important features, the Internet enables individuals to make their personal thoughts and opinions easily accessible to the global community of Internet users. Numerous studies have shown that the Internet's anonymity can result in a high rate of false information, which may lead to suboptimal decisions by deceived users. Little is known what drives users to post false information. Therefore, the aim of this paper is to identify the drivers of false information in communities where users neither have incentives to make false statements nor spread information at all. Thereby, we conduct a laboratory experiment creating a controlled community. By identifying the drivers of false information, we can derive valuable implications for designing Internet communities.
Design and Implementation of a Menu Based OSCAR Command Line Interface
Authors: Wesley Bland, Thomas Naughton, Geoffroy Vallee, Stephen L. Scott
Venue: Proceedings of the 21st International Symposium on High Performance Computing Systems and Applications (2007)

The Open Source Cluster Application Resources (OSCAR) toolkit is used to build and maintain HPC clusters. The OSCAR cluster installer provides a graphical user interface (GUI) "wizard" that directs the user through the installation process. This GUI is useful for general usage, but in some instances a more basic interface is desirable. Therefore, a command line interface (CLI) has been developed for the OSCAR installer. Through the CLI, the OSCAR installer is better equipped to support scripting, which aids more advanced testing scenarios and helps in cluster replication. Additionally, the CLI is better suited for remote installations using OSCAR.
In with the New, Out with the Old
Authors: John C. Dill, Maureen C. Stone
Venue: IEEE Computer Graphics and Applications (2007)

Outgoing Editor-in-Chief John Dill and incoming Editor-in-Chief Maureen Stone discuss the magazine's successes and its future.
Professor-driven, student-driven, and client-driven design projects
Authors: H. G. Ansell
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

This paper suggests some of the advantages that students may gain from their design project experience. It also suggests the likely special advantages of professor-driven, student-driven, and client-driven projects. A design project in which the specifications are chosen by the professor is valuable in allowing students to apply what they have learned in a course. Such projects are also likely to be adequately challenging to the students. A design project in which the project and its specifications are chosen by the student is valuable in permitting the student to explore his or her interests. It has a good chance of being within the student's capabilities, and is likely to raise the student's self confidence, and be enjoyed by the student. A design project in which the specifications are determined mainly by a client's needs will likely draw on more than what is taught in any one class. It will impose constraints and pressures preparing a student for a job involving design, including time pressures, cost containment pressures, and pressures of meeting important specifications. It will tend to encourage students to brainstorm for ideas and to consider alternative designs. It will tend to encourage adequate testing of the product. It may involve some opportunity for negotiation over the specifications. It will help the student acquire the habit of maintaining a customer focus. The paper concludes that there is no optimum type of design project for all purposes. It suggests that such a mix is likely to be challenging, of interest to the student, and likely to involve realistic design pressures. 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
A speech understanding module for a multimodal mathematical formula editor
Authors: J. Hunsinger
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

As part of a framework for a multimodal mathematical formula editor which will support natural speech and handwriting interaction, a single stage speech understanding module is presented. It is based on a multilevel statistical, expectation driven approach. Completely spoken realistic formulas containing basic arithmetic operations, roots, indexed sums, integrals, trigonometric functions, logarithms, convolutions, fourier transforms, exponentiations, and indexing (among others) were examined. The speaker specific or formula specific structural recognition accuracies reach up to 90% or 100%, respectively. For visualization and postprocessing purposes, a transformation into Adobe(R) FrameMaker(R) documents is performed. An advanced variant of this architecture will further be utilized as the basis for a multimodal semantic decoder incorporating combined script and speech analysis. It will enclose a so-called multimodal probabilistic grammar which will be trained via multimodal usability tests.
The Optimum Convergence Condition for the Durand-Kerner Type Simultaneous Inclusion Method
Authors: Octavian Cira, Cristian-Mihai Cira
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

In order to solve the algebraic equation, where the complex polynomial has only simple zeros, one can use the simultaneous inclusion methods. The quadratic convergence condition for the Durand-Kerner simultaneous inclusion method, using point estimation theory is w^(0) \le d^(0)/(an + b), where n is the polynomial degree, d^(0) the minimum distance between the initial iterations and w^(0) is the absolute maximum of the Weierstrass factors. This paper determines the optimum quadratic convergence condition for a generalized Durand-Kerner type simultaneous inclusion method.
Accuracy analysis for off-line array calibration
Authors: B. Friedlander
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Practical sensor arrays are characterized by certain parameters, related to the array shape and its electrical properties. Accurate direction finding requires calibration of these parameters to a relatively high accuracy. Off-line calibration of the array parameters is performed by transmitting signals from known locations and measuring the array response. This paper relates the parameter estimation accuracy achieved in off-line calibration to the direction-of-arrival errors during on-line operation. It then proposes a criterion for choosing the off-line calibration points so as to meet on-line accuracy requirements.