ppxscal/embedding_network huggingface dataset:
MPEG-2 real-time software CODEC for full-duplex transmission application over IP networks
Authors: Hiroe Iwasaki, Jiro Naganuma, Makoto Endo, Yoshiyuki Yashima
Venue: Systems and Computers in Japan (2005)

This paper proposes a real-time MPEG-2 software CODEC for full-duplex transmission applications, and evaluates its performance and usefulness. The CODEC consists of a high-speed encoder&sol;decoder, an IP sender&sol;receiver, and an error recovery controller. Each encoder&sol;decoder is accelerated and optimized by exploiting fast algorithms and instruction-level parallelism. The IP sender&sol;receiver combination achieves low delay owing to the direct translating of each elementary stream of video and audio into UDP&sol;IP packets. The error recovery controller carries out simple but powerful error tolerance against packet loss over IP networks. This CODEC attains low delay of 99 ms (M = 1, N = 1) to 165 ms (M = 3, N = 3) including input, encoding, transmitting, decoding, and output delays, and maintains a normal frame rate of 30 fps (frames per second) and more than 20 fps even under a fairly heavy network load. It provides sufficiently good performance for use as a real-time full NTSC-size CODEC on a PC of at least 1.2-GHz CPU. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(2): 33&ndash;41, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20151
Project view IM: a tool for juggling multiple projects and teams
Authors: Peter Scupelli, Sara Kiesler, Susan R. Fussell, Congrui Chen
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Previous research suggests working on multiple projects may lead to stress and misallocation of attention. A modest redesign of Instant Messenger (IM) could help team members juggle multiple projects and teams. This paper describes the implementation of this redesign--an IM plug-in called Project View IM (PVIM). PVIM uses automatic project status logging to show active project-related files and team members. In a preliminary evaluation experiment, participants working collaboratively with different partners on two projects found PVIM and IM to be equally usable and informative but PVIM participants reported less workload stress. We discuss future work to iterate the design and measure allocation of attention and task performance.
User experience: an umbrella topic
Authors: Keith Instone
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This position paper represents my views on how we address the multi-disciplinary needs of the user experience industry. While each profession struggles to deepen its core skills and membership offerings, it also needs to branch out beyond its traditional borders to serve its members' needs within a broader industry. "User experience" should be the topic that unites all of various professional organizations under an umbrella. Because each organization has its special contribution to the network (some at the core, some as specialists and others as interested parties), and each person will have different needs, a personalized portal should be built for the UX topic to help individuals cross over existing boundaries.
An industry/university collaboration to upgrade software engineering knowledge and skills in industry
Authors: David Carrington, Paul Strooper, Sharron Newby, Terry Stevenson
Venue: Journal of Systems and Software (2005)

This paper describes an ongoing collaboration between Boeing Australia Limited and the University of Queensland to develop and deliver an introductory course on software engineering. The aims of the course are to provide a common understanding of the nature of software engineering for all Boeing Australia's engineering staff, and to ensure they understand the practices used throughout the company. The course is designed so that it can be presented to people with varying backgrounds, such as recent software engineering graduates, systems engineers, quality assurance personnel, etc. The paper describes the structure and content of the course, and the evaluation techniques used to collect feedback from the participants and the corresponding results. The immediate feedback on the course indicates that it has been well received by the participants, but also indicates a need for more advanced courses in specific areas. The long-term feedback from participants is less positive, and the long-term feedback from the managers of the course participants indicates a need to expand on the coverage of the Boeing-specific processes and methods.
Demanding Internet Enterprise
Authors: Adam Stone
Venue: IEEE Internet Computing (2004)

Speakers at the "Enterprise on Demand Summit" (held in San Francisco on 29-31 March) addressed the emerging new business-process management paradigm, rapidly expanding capabilities for real-time collaboration, new enterprise problem-solving methods, and a new model for warehousing and accessing data across an enterprise.
Empowering configurable QoS management in real-time systems
Authors: Aleksandra Tesanovic, Mehdi Amirijoo, Mikael Björk, Jörgen Hansson
Venue: Proceedings of the 4th international conference on Aspect-oriented software development (2005)

Current Quality of Service (QoS) management methods in real-time systems using feedback control loop lack support for configurability and reusability as they cannot be configured for a target application or reused across different applications. In this paper we present a method for developing reconfigurable feedback-based QoS management for real-time systems, denoted Re-QoS. By combining component-based design with aspect-oriented software development Re-QoS enables successful handling of crosscutting nature of QoS policies, as well as evolutionary design of real-time systems and QoS management architectures. Re-QoS defines a QoS aspect package, which is an implementation of a set of aspects and components that provide a number of different QoS policies. By adding a QoS aspect package to an existing system without QoS guarantees, we are able to use the same system in unpredictable environments where performance guarantees are essential. Furthermore, by exchanging aspects within the QoS aspect package one can efficiently tailor the QoS management of a real-time system based on the application requirements. We demonstrate the usefulness of the concept on a case study of an embedded real-time database system, called COMET. Using the COMET example we show how a real-time database system can be adapted to be used in different applications with distinct QoS needs.
A Systematic Approach for Configuring Web-Based Information Systems
Authors: M. Nikolaidou, D. Anagnostopoulos
Venue: Distributed and Parallel Databases (2005)

Enterprise information systems consist of interrelated Intranet and Internet-based applications, thus the Web platform serves well as the middleware for their development. Using a Web Browser, it is possible to download the user interface of any web-based application from anywhere around the world, providing transparency in application implementation. A web-based information system can be described as a set of web-based applications and the underlying infrastructure (both Intranet and Internet). Although most information systems built to support current technological treads are based on this architecture, they often fail to provide the desired performance. A potential cause is that, configuration issues, although interrelated, are solved in isolation. As the underlying network topology strongly influences application configuration, the relationship between the resource allocation policy and network architecture should be explored. We, thus, argue that a systematic approach for the quantitative analysis, effective configuration and detailed performance evaluation of web-based information systems is required. Four discrete stages are identified. The consistent representation of system specifications throughout all configuration stages facilitates the exploration of their dependencies even if these aren't obvious. For this purpose, we propose a common meta-model, incorporating specific characteristics of web-based systems. UML-like notation was adopted for system specification representation. Two are the main advantages of the proposed meta-model: extendibility, facilitating the description of applications at different levels of abstraction, and consistency, ensuring the accurate estimation of the Quality of Service parameters imposed to the underlying network by the described applications. A case study where the proposed approach was used for configuring a complex web-based system and the experience obtained are also discussed.
Epi-convergent discretizations of stochastic programs via integration quadratures
Authors: Teemu Pennanen, Matti Koivu
Venue: Numerische Mathematik (2005)

The simplest and the best-known method for numerical approximation of high-dimensional integrals is the Monte Carlo method (MC), i.e. random sampling. MC has also become the most popular method for constructing numerically solvable approximations of stochastic programs. However, certain modern integration quadratures are often superior to crude MC in high-dimensional integration, so it seems natural to try to use them also in discretization of stochastic programs. This paper derives conditions that guarantee the epi-convergence of the resulting objectives to the original one. Our epi-convergence result is closely related to some of the existing ones but it is easier to apply to discretizations and it allows the feasible set to depend on the probability measure. As examples, we prove epi-convergence of quadrature-based discretizations of three different models of portfolio management and we study their behavior numerically. Besides MC, our discretizations are the only existing ones with guaranteed epi-convergence for these problem classes. In our tests, modern quadratures seem to result in faster convergence of optimal values than MC.
Interfaces for stack inspection
Authors: Frédéric Besson, Thomas De Grenier DeLatour, Thomas Jensen
Venue: Journal of Functional Programming (2005)

Stack inspection is a mechanism for programming secure applications in the presence of code from various protection domains. Run-time checks of the call stack allow a method to obtain information about the code that (directly or indirectly) invoked it in order to make access control decisions. This mechanism is part of the security architecture of Java and the .NET Common Language Runtime. A central problem with stack inspection is to determine to what extent the local checks inserted into the code are sufficient to guarantee that a global security property is enforced. A further problem is how such verification can be carried out in an incremental fashion. Incremental analysis is important for avoiding re-analysis of library code every time it is used, and permits the library developer to reason about the code without knowing its context of deployment. We propose a technique for inferring interfaces for stack-inspecting libraries in the form of secure calling context for methods. By a secure calling context we mean a pre-condition on the call stack sufficient for guaranteeing that execution of the method will not violate a given global property. The technique is a constraint-based static program analysis implemented via fixed point iteration over an abstract domain of linear temporal logic properties.
Cache Clouds: Cooperative Caching of Dynamic Documents in Edge Networks
Authors: Lakshmish Ramaswamy, Ling Liu, Arun Iyengar
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Caching on the edge of the Internet is becoming a popular technique to improve the scalability and efficiency of delivering dynamic web content. In this paper we study the challenges in designing a large scale cooperative edge cache network, focusing on mechanisms and methodologies for efficient cooperation among caches to improve the overall performance of the edge cache network. This paper makes three original contributions. First, we introduce the concept of cache clouds, which forms the fundamental framework for cooperation among caches in the edge network. Second, we present dynamic hashing-based protocols for document lookups and updates within each cache cloud, which are not only efficient, but also effective in dynamically balancing lookup and update loads among the caches in the cloud. Third, we outline a utility-based mechanism for placing dynamic documents within a cache cloud. Our experiments indicate that these techniques can significantly improve the performance of the edge cache networks.
The strict avalanche criterion randomness test
Authors: Julio Cesar Hernandez Castro, José María Sierra, Andre Seznec, Antonio Izquierdo, Arturo Ribagorda
Venue: Mathematics and Computers in Simulation (2005)

A new statistical test for randomness, the strict avalanche criterion (SAC) test, is presented, together with its results over some well-known generators in the literature. These results are analyzed and some possible applications of the test, as for measuring the strength of cryptographic primitives including block ciphers, stream ciphers and pseudorandom number generators, especially during the design and analysis phase, are detailed. Finally, the source code for a basic version of the SAC test is provided, which proves some of its other advantages: it is easy to implement, and very fast so well-suited for practical applications.
Power and performance optimization at the system level
Authors: Valentina Salapura, Randy Bickford, Matthias Blumrich, Arthur A. Bright, Dong Chen, Paul Coteus, Alan Gara, Mark Giampapa, Michael Gschwind, Manish Gupta, Shawn Hall, Ruud A. Haring, Philip Heidelberger, Dirk Hoenicke, Gerard V. Kopcsay, Martin Ohmacht, Rick A. Rand, Todd Takken, Pavlos Vranas
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

The BlueGene/L supercomputer has been designed with a focus on power/performance efficiency to achieve high application performance under the thermal constraints of common data centers. To achieve this goal, emphasis was put on system solutions to engineer a power-efficient system. To exploit thread level parallelism, the BlueGene/L system can scale to 64 racks with a total of 65536 computer nodes consisting of a single compute ASIC integrating all system functions with two industry-standard PowerPC microprocessor cores in a chip multiprocessor configuration. Each PowerPC processor exploits data-level parallelism with a high-performance SIMD oating point unitTo support good application scaling on such a massive system, special emphasis was put on efficient communication primitives by including five highly optimized communification networks. After an initial introduction of the Blue-Gene/L system architecture, we analyze power/performance efficiency for the BlueGene system using performance and power characteristics for the overall system performance (as exemplified by peak performance numbers.To understand application scaling behavior, and its impact on performance and power/performance efficiency, we analyze the NAMD molecular dynamics package using the ApoA1 benchmark. We find that even for strong scaling problems, BlueGene/L systems can deliver superior performance scaling and deliver significant power/performance efficiency. Application benchmark power/performance scaling for the voltage-invariant energy delay 2 power/performance metric demonstrates that choosing a power-efficient 700MHz embedded PowerPC processor core and relying on application parallelism was the right decision to build a powerful, and power/performance efficient system
Classical linear logic of implications
Authors: Masahito Hasegawa
Venue: Mathematical Structures in Computer Science (2005)

We give a simple term calculus for the multiplicative exponential fragment of Classical Linear Logic, by extending Barber and Plotkin's dual-context system for the intuitionistic case. The calculus has the non-linear and linear implications as the basic constructs, and this design choice allows a technically manageable axiomatisation without commuting conversions. Despite this simplicity, the calculus is shown to be sound and complete for category-theoretic models given by &#x002A;-autonomous categories with linear exponential comonads.
Recent developments in numerical techniques for treating material interfaces (abstract)
Authors: Hans M. Ruppel
Venue: ACM SIGNUM Newsletter (1975)

The Arbitrary-Lagrangian Eulerian Technique (ALE)1 provides a framework in which one can regrid individually different regions of a calculational mesh. In particular, one can treat an interface between materials as a Lagrangian line and rezone the remaining parts of the grid with some appropriate algorithm. This keeps material from being fluxed across the interface and avoids the problem of mixed cells with the attendant difficulty of obtaining pressures for such cells. At the same time it maintains some degree of regularity in the regions away from the interface.
Every monotone graph property is testable
Authors: Noga Alon, Asaf Shapira
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many monotone graph properties are some of the most well-studied properties in graph theory, and the abstract family of all monotone graph properties was also extensively studied. Our main result in this paper is that any monotone graph property can be tested with one-sided error, and with query complexity depending only on ε. This result unifies several previous results in the area of property testing, and also implies the testability of well-studied graph properties that were previously not known to be testable. At the heart of the proof is an application of a variant of Szemerédi's Regularity Lemma. The main ideas behind this application may be useful in characterizing all testable graph properties, and in generally studying graph property testing.As a byproduct of our techniques we also obtain additional results in graph theory and property testing, which are of independent interest. One of these results is that the query complexity of testing testable graph properties with one-sided error may be arbitrarily large. Another result, which significantly extends previous results in extremal graph-theory, is that for any monotone graph property P, any graph that is ε -far from satisfying P, contains a subgraph of size depending on ε only, which does not satisfy P. Finally, we prove the following compactness statement: If a graph G is ε-far from satisfying a (possibly infinite) set of graph properties P, then it is at least δ P ε-far from satisfying one of the properties.
Grounding needs: achieving common ground via lightweight chat in large, distributed, ad-hoc groups
Authors: Jeremy P. Birnholtz, Thomas A. Finholt, Daniel B. Horn, Sung Joo Bae
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

This paper reports on the emergent use of lightweight text chat to provide important grounding and facilitation information in a large, distributed, ad-hoc group of researchers participating in a live experiment. The success of chat in this setting suggests a critical re-examination and extension of Clark and Brennan's work on grounding in communication. Specifically, it is argued that there are some settings characterized by reduced information and clarification needs, where the use of extremely lightweight tools (such as basic text chat) can be sufficient for achieving common ground - even when conversational participants are unknown to each other. Theoretical and design implications are then presented.
Hacking Exposed Cisco Networks, 1 edition
Authors: Andrew Vladimirov, Konstantin Gavrilenko, Andrei Mikhailovsky
Venue:  (2005)

Here is the first book to focus solely on Cisco network hacking, security auditing, and defense issues. Using the proven Hacking Exposed methodology, this book shows you how to locate and patch system vulnerabilities by looking at your Cisco network through the eyes of a hacker. The book covers device-specific and network-centered attacks and defenses and offers real-world case studies.
Architecture Decisions: Demystifying Architecture
Authors: Jeff Tyree, Art Akerman
Venue: IEEE Software (2005)

Bridging the gap between requirements and the right technical solution involves a lot of "magic." Explicitly documenting major architecture decisions makes the architecture development process more structured and transparent. Additionally, it clarifies the architects' rationale for stakeholders, designers, and other architects. Architecture decisions are also a helpful addition to more traditional architecture approaches.
Context sensitive access control
Authors: R. J. Hulsebosch, A. H. Salden, M. S. Bargh, P. W. G. Ebben, J. Reitsma
Venue: Proceedings of the tenth ACM symposium on Access control models and technologies (2005)

We investigate the practical feasibility of using context information for controlling access to services. Based solely on situational context, we show that users can be transparently provided anonymous access to services and that service providers can still impose various security levels. Thereto, we propose context-sensitive verification methods that allow checking the user's claimed authenticity in various ways and to various degrees. More precisely, conventional information management approaches are used to compare historic contextual (service usage) data of an individual user or group. The result is a relatively strong, less intrusive and more flexible access control process that mimics our natural way of authentication and authorization in the physical world.
Testing of MEMS-Based Microsystems
Authors: Hans G. Kerkhoff
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

The introduction of MEMS in microsystems is progressing rapidly. The high-volume testing of these multi-domain systems are often relatively cumbersome in comparison with pure electrical tests, because of non-electrical stimuli and/or response. It requires currently custom-made test set-up. Also the quality of tests is difficult to quantify. Hence, structural tests seem more appropriate, but this requires a lot of research and new approaches.
Marching-pixels: a new organic computing paradigm for smart sensor processor arrays
Authors: Dietmar Fey, Daniel Schmidt
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

In this paper we present a new organic computing principle denoted as marching pixels for the architectures of future smart CMOS camera chips. The idea of marching pixels is based on the realization of a massively-parallel fine-grain single-chip processor array. Marching pixels are virtual organic units which are propagating in a pixel processor array, similar to virtual ants in ant algorithms. The task of the marching pixels is to carry out autonomously important image pre-processing tasks, e.g. fast and robust detection of objects and its center points or tracking of moving objects. We are favoring organic computing principles based on virtual life-like objects which are implemented in hardware to realize fast reply times and self-healing properties. This technology is thought for future smart sensor chips which will integrate hundreds of million transistors. The paper presents the basic idea of marching pixels and its functional behavior for different algorithmic tasks. Furthermore a concept for the implementation of marching pixels is shown as well as results of a simulation study which presents a first proof of concept of the effectiveness of the marching pixels idea