ppxscal/embedding_network huggingface dataset:
Analyzing the codes that avoid specified differences by binary tree
Authors: Xuerong Yong
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

The error probability of certain magnetic recording systems can be characterized by the difference patterns between the sequences that may be recorded. In [9] it is shown that the number of these sequences increases exponentially with their length and the capacity, the maximum growth rate of such sequences, is proven to be the logarithm of the joint spectral radius of a set of certain (0, 1) matrces. But approximating the joint spectral radius of a set of (0, 1) matrices is known to be NP-hard [11] (This is also stated in [9]).In this correspondence, we study these sequences using binary tree. Compared with the previous work, we get around the computation of the joint spectral radius. The number of sequences that avoid a certain set of difference patterns is proven to satisfy linear recurrence relations. From this we characterize the codes that have the maximum/minimum capacities. Our computation of capacities is straight-forward and therefore has less complexity than the previous ones.
Maximizing Battery Life Routing in Wireless Ad Hoc Networks
Authors: Weifa Liang, Yang Yuansheng
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Most wireless ad hoc networks consist of mobile devices which operate on batteries. Power consumption in this type of network therefore is paramount important. To maximize the lifetime of an ad hoc network, it is essential to prolong each individual node (mobile) life through minimizing the total transmission energy consumption for each communication request. Therefore, an efficient routing protocol must satisfy that the energy consumption rate at each node is evenly distributed and at the same time the total transmission energy for each request is minimized. To devise a routing protocol meeting the above two conflict objectives simultaneously is very difficult due to the NP hardness of the problem. Instead, an approximation solution is desirable and appreciated.In this paper we focus on developing power-aware routing algorithms which find routing paths that maximize the lifetime of individual nodes and minimize the total transmission energy consumption, thereby prolong the life of the entire network. In particular, for an ad hoc network consisting of the same type of battery mobile nodes, two approximation algorithms are proposed. The running times of the proposed algorithms are determined by the accuracies of the approximation solutions. Compared with a previously known result, our algorithms have less energy overhead and can be implemented in a distributed environment. For an adhoc network equipped with different types of battery mobile nodes, a new power-aware routing protocol is proposed, and the algorithm can also be implemented distributively.
A New Optimized Implemention of the SystemC Engine Using Acyclic Scheduling
Authors: Daniel Gracia Pérez, Gilles Mouchard, Olivier Temam
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

SystemC is rapidly gaining wide acceptance as a simulation framework for SoC and embedded processors. While its main assets are modularity and the very fact it is becoming a de facto standard, the evolution of the SystemC framework (from version 0.9 to version 2.0.1) suggests the environment is particularly geared toward increasing the framework functionalities rather than improving simulation speed. For cycle-level simulation, speed is a critical factor as simulation can be extremely slow, affecting the extent of design space exploration.In this article, we present a fast SystemC engine that, in our experience, can speed up simulations by a factor of 1.93 to 3.56 over SystemC 2.0.1. This SystemC engine is designed for cycle-level simulators and for the moment, it only supports the subset of the SystemC syntax (signals, methods) that is most often used for such simulators. We achieved greater speed (1) by completely rewriting the SystemC engine and improving the implementation software engineering, and (2) by proposing a new scheduling technique, intermediate between SystemC dynamic scheduling technique and existing static scheduling schemes. Unlike SystemC dynamic scheduling, our technique removes many if not all useless process wake-ups, while using a simpler scheduling algorithmthan in existing static scheduling techniques.
Augmented reality performance assessment battery (arpab): object recognition, distance estimation and size estimation using optical see-through head-worn displays
Authors: Sonny Eugene Harrison Kirkley,  Jr.
Venue:  (2003)

Augmented reality (AR) is a maturing technology that often utilizes head-worn see-through displays and shows digital objects so they appear as part of the environment. AR systems are increasingly being used in training and to support on-the-job performance. As a result, interface designers will increasingly be faced with developing user interfaces for these systems with minimal knowledge of the human factors of their use. This study examined human factors issues underlying the use of AR systems by investigating people's ability to identify objects, judge distances, and estimate sizes of objects. Specifically, the study used real objects, 3 dimensional (3D) models of those real objects, basic 3D geometric shapes, and flat geometric shapes (e.g., chair, VRML model of a chair, a pyramid, and a triangle). The participants wore off-the-shelf head-worn displays, either a Sony Glasstron (LCD display) or a Microvision Nomad (virtual retinal display). They viewed objects displayed individually at distances from 10&ndash;110 feet and reported estimated distances, size estimates, and object identity. The basic design of the experiment was a Test (4) by Distance (4) by Repetitions (2), where each of these factors was a fully crossed within-subject factor. The factors were randomized and counterbalanced using a Latin square design. In addition, there were several nested factors within tests. The primary data analyses consisted of Repeated-Measures ANOVAs dealing with within-subjects factors. After inspection of the control data, little variance was seen. Thus, to preserve error degrees of freedom, these covariates were not included in the analyses. Results confirm the importance of environmental cues for depth perception. People performed better and were more confident in their estimates with real objects than with virtual objects. Estimates for 3D models of real objects were more accurate than 3D geometric shapes. In turn, they estimated 3D geometric shapes more accurately than flat geometric shapes. Also, on all measures, participant error decreased with distance. These results indicate a need to greatly increase the image display quality of head-worn displays before commercial augmented reality systems are deployed. Additionally, people are likely to need extensive training in how to best judge depth of the objects displayed.
Project-centered teaching on CBIS to IBBA students in Hong Kong
Authors: Jacqueline Wong, Timon Du
Venue: ACM SIGCSE Bulletin (2003)

Knowledge of computer-based information systems (CBIS) is important to business administration (BA) students. The curriculum for CBIS should be different from the fundamentals of computer science (CS1 and CS2) because of the students' backgrounds. This paper discusses a project-centered teaching method for CBIS for BA students. Following three years of experience with this approach, the feedback from more than 500 students is encouraging.
Proactive management of software systems: analysis and implementation
Authors: Kalyanaraman Vaidyanathan
Venue:  (2002)

Recently, the phenomenon of software aging, one in which the state of the software system degrades with time, has been reported. The primary causes of this degradation are the exhaustion of operating system and middleware system resources, fragmentation of these resources, data corruption and numerical error accumulation. Eventually, software aging may lead to performance degradation, security compromise or crash/hang failure. To counteract software aging, a proactive approach to fault management called software rejuvenation has been proposed. It essentially involves occasionally terminating an application or a system, cleaning its internal state and restarting it. In this thesis, first, we extend the traditional classification of software faults (deterministic and transient) to include faults attributed to software aging, and study the treatment and recovery strategies for each of the fault classes. This will help us understand the nature of software faults and their impact on system availability and performance and aid in choosing the best possible recovery strategy when a fault is triggered. Next, we discuss methods of evaluating the effectiveness of proactive fault management in operational software systems and determining optimal times to perform rejuvenation. In this regard, we take a two-pronged strategy&mdash;measurement-based modeling and analytic modeling. The measurement based approach deals with detection of software aging and predicting aging related failures by collection and analysis of system data, so that proactive methods can be applied to prevent unplanned outages. For quantifying the effect of aging in these resources, we propose a metric called the Estimated time to exhaustion. The developed measurement-based models are the important steps towards predicting aging-related failures based on actual measurements, intended to help development of policies that automate the proactive handling of potential problems. The aim of the analytic modeling is to determine optimal times to perform rejuvenation by developing and analyzing stochastic models to maximize availability or minimize downtime cost. Using stochastic reward nets (SRNs), we model and analyze different rejuvenation policies for a cluster system. We also model inspection-based preventive maintenance in systems whose degradation level can be determined through some observable parameters. The model is solved using Markov Regenerative Process (MRGP) theory to obtain optimal rejuvenation strategies. We then describe the design and implementation of a software rejuvenation agent implemented in a major commercial server. The measurement-based model is then combined with an earlier analytical model to obtain a comprehensive model for software aging and rejuvenation. Finally, we summarize the contributions of the thesis, classifying the approaches and current methods of rejuvenation.
Interactive storytelling system using behavior-based non-verbal information: ZENetic computer
Authors: Naoko Tosa, Seigo Matsuoka, Koji Miyazaki
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

We have developed an interactive storytelling system that aims to help us "recreate" our conscious selves by calling on Buddhist principles, Asian philosophy, and traditional Japanese culture through the inspirational media of ink painting, kimono and haiku. "Recreating ourselves" means the process of making the consciousness of our 'daily self' meet that of our 'hidden self'. through stimulation of activity deep within us. Ultimately, this may meld our consciousness and unconsciousness in complete harmony. It is difficult to achieve this through traditional logic-based interactions. Our system is a new approach to reaching this goal by incorporating traditional media and methods in an interactive computer system.
SMEs in South Africa: acceptance and adoption of e-commerce
Authors: Eric Cloete
Venue: The economic and social impacts of e-commerce (2003)

The chapter reports on research that was done in information systems at the University of Cape Town on the benefits of Internet utilisation and the barriers to its adoption amongst small businesses in South Africa. It addresses how these small businesses in a developing country perceive the potential benefits of e-commerce and look at their consequent adoption of e-commerce activities in their own organizations. Comparisons are made between studies conducted in first world countries, particularly regarding the role of government initiatives. A secondary aim of this research was to determine the current level of e-commerce adoption by small businesses in South Africa. This was achieved by circulating a questionnaire to test the perception of e-commerce benefits and e-commerce adoption levels amongst small businesses from various sectors in South Africa. If the global usage of the Internet for electronic commerce by small businesses is compared to the South African situation, this research clearly indicates that the available technologies are not adopted to the extent that is necessary for survival in a rapidly changing environment.
Natural laws controlling algorithm structure?
Authors: M. H. Halstead
Venue: ACM SIGPLAN Notices (1972)

In this preliminary report, a hypothesis is developed to the effect that algorithms, considered as distrillations of thought, may possess a general structure which obeys physical laws. Testing the hypothesis against measurements of published algorithms does not disprove it.
A finite element approach for the Dirac radial equation
Authors: L. A. A. Nikolopoulos
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

The Dirac radial functions are expanded in polynomial B-spline basis, transforming the Dirac equation in a generalized eigensystem matrix problem. Due to the locality nature of the B-spline functions the matrix representation of all the involved operators are highly sparse. Diagonalization of the matrix equations provides the bound and continuum eigenstates. Comparison with the analytical solutions of the hydrogenic atomic systems is presented and application for the nonhydrogenic atomic systems. The generalization of the above programs to the case of exotic atomic systems and highly charged ionic systems is straightforward.
MIGA, A Software Tool for Nonlinear System Modelling with Modular Neural Networks
Authors: Bernardo Morcego, Josep M. Fuertes, Gabriela Cembrano
Venue: Applied Intelligence (2004)

This paper presents a software tool suitable for dynamic system modelling. The models generated by this tool are modular neural networks, see [1]. Each module behaves like a functional block and is connected to the other modules like in classical block diagrams. This tool allows the inclusion of a priori knowledge and, furthermore, to extract physical information from the models, once the system has learned. The modelling tool is capable of automatic model generation, parameter estimation and model validation.
Communities of action: a cognitive and social approach to the design of CSCW systems
Authors: Manuel Zacklad
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

Most current theories about collective cognitive activities in limited groups apply to structurally closed co-operative situations Here we propose to work in the framework of intellectual transactions and communities of action theory with a view to describing and designing CSCW systems which can be used in more structurally open situations. First we compare this approach with other theories of collective cognition (such as those focusing on situated cognition and communities of practice, distributed cognition and coordination mechanisms). We then present the core concepts involved in defining communities of action, the duality of goals and forms of knowledge and the operational, strategic, integrative and relational categories of collective activity on which the OSIR model is based. We conclude by presenting as an example the application of the model to a research project designed to assist the setting up of a health network.
Traffic management in high-performance internet
Authors: Chunhua Hu
Venue:  (2003)

The Internet has become a truly multi-services network, carrying a broad spectrum of applications and services. It is now necessary for the service providers to break away from the original paradigm of best effort , and move towards the paradigm of guaranteed QoS (Quality of Service). In this dissertation, we investigate the Traffic Management (TM) as a key apparatus to achieve the desired QoS in the Internet. Specifically, within the boundary of high performance switching, we analyze different types of scheduling, policing, and traffic shaping, which together form the main elements of the TM. For the scheduling component of the TM, we first summarize the well known sorted-priority algorithms such as the Weighted Fair Queueing (WFQ) and Self-Clock Fair Queueing (SCFQ) that can achieve good performance but is too complex to be implemented for high performance switches, and the Weighted Round Robin (WRR) and the Deficit Round Robit (DRR) that are simple but are unsatisfactory in the performance. With this backdrop, we propose a new, simple scheduling algorithm for fixed size packets. This algorithm is then extended for variable length packets. Our analysis for the new scheduling algorithms shows that their performance is very close to SCFQ. For the policing component of the TM, we improve on the Generic Cell Rate Algorithm (GCRA), which has been proven effective for the fixed size packets, to support the multi-protocol, multiservice environment of today's Internet. The resulting policing algorithm, which we call the Loose/Strict Generic Bucket Policing (L/SGBP), is analyzed to show its protocol independent nature and high performance. Based on the L/SGBP proposed, a new traffic shaping algorithm is suggested for the highest granularity of traffic flow.
Utilizing Specification Testing in Review Task Trees for Rigorous Review of Formal Specification
Authors: Shaoying Liu
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

Review Task Tree (RTT) is a comprehensible notationfor expressing review tasks in rigorous review offormal specifications.It has a mechanism for evaluatingthe final review result based on the review results ofall the members (atomic tasks) of its minimal cutset.However, the notation does not provide any method foractually reviewing the atomic tasks.In this paper, wepresent a way to utilize a specification testing methodfor rigorous review of the atomic tasks.Strategies forgenerating test cases for each kind of RTT are describedand explained with examples.A small case study isconducted using the proposed technique and the resultis analyzed to show the benefit and the potential limitationof the technique.
Spidle: a DSL approach to specifying streaming applications
Authors: Charles Consel, Hedi Hamdi, Laurent Réveillère, Lenin Singaravelu, Haiyan Yu, Calton Pu
Venue: Proceedings of the 2nd international conference on Generative programming and component engineering (2003)

Multimedia stream processing is a rapidly evolving domain which requires much software development and expects high performance. Developing a streaming application often involves low-level programming, critical memory management, and finely tuned scheduling of processing steps.To address these problems, we present a domain-specific language (DSL) named <i>Spidle</i>, for specifying streaming applications. Spidle offers high-level and declarative constructs; compared to general-purpose languages (GPL), it improves robustness by enabling a variety of verifications to be performed.To assess the expressiveness of Spidle in practice, we have used it to specify a number of standardized and special-purpose streaming applications. These specifications are up to 2 times smaller than equivalent programs written in a GPL such as C.We have implemented a compiler for Spidle. Preliminary results show that compiled Spidle programs are roughly as efficient as the compiled, equivalent C programs.
A general framework for robust watermarking security
Authors: Mauro Barni, Franco Bartolini, Teddy Furon
Venue: Signal Processing (2003)

The analysis of the security of watermarking algorithms has received increasing attention since it has been recognized that the sole investigation of robustness issues is not enough to properly address the challenges set by practical applications. Such a security analysis, though, is still in its infancy, up to a point that a general agreement has not yet been reached even on the most fundamental problems. The purpose of this paper is to provide a general security framework encompassing most of the problems encountered in real-world applications. By considering the amount of information the attacker has about the watermarking algorithm, we introduce the notion of fair and un-fair attacks, so to ease the classification of different systems and attacks. Though we recognize that many important differences exist between watermarking and cryptographic security, a large part of our work is inspired by the Diffie-Helmann's paradigm, which is widely used in cryptography. For each class of systems great care is taken to describe both the attacker's and watermarker's point of view, presenting the challenges raised by each system to these different actors. Finally, we try to outline some research directions which, according to us, deserve further analysis.
Optimal Stock Allocation for a Capacitated Supply System
Authors: Francis de Véricourt, Fikri Karaesmen, Yves Dallery
Venue: Management Science (2002)

We consider a capacitated supply system that produces a single item that is demanded by several classes of customers. Each customer class may have a different backorder cost, so stock allocation arises as a key decision problem. We model the supply system as a multi customer make-to-stock queue. Using dynamic programming, we show that the optimal allocation policy has a simple and intuitive structure. In addition, we present an efficient algorithm to compute the parameters of this optimal allocation policy. Finally, for a typical supply chain design problem, we illustrate that ignoring the stock allocation dimension--a frequently encountered simplifying assumption--can lead to incorrect managerial decisions.
Supporting Flexible Collaborative Distance Learning in the CURE Platform
Authors: Jörg M. Haake, Till Schümmer, Anja Haake, Mohamed Bourimi, Britta Landgraf
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

At the German Distance Learning University, five collaborative distance learning scenarios have been recently identified by students and teachers as an important future form of collaborative learning in the university's virtual learning space. An analysis of these scenarios showed a great variance between them and a need to support run-time tailoring of the respective learning environments. Since no existing learning platform addresses all the needs, the CURE collaborative learning platform was developed to support the implementation of such a variety of tailorable learning environments. CURE is based on a room concept andsupports the implementation and run-time tailoring of collaborative distance learning environments for our scenarios. Initial experience indicates its applicability.