ppxscal/embedding_network huggingface dataset:
G1: 1 Scenarios: Envisioning the Context for WMTE in 2015
Authors: Jeremy Roschelle, Charles Patton, John Brecht, Marie Bienkowski, Tak Wai Chan
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

The G1:1 international network of learning researchers met to identify major trends and uncertainties that could drive the evolution of learning technology. Using a technique called scenario-based planning, the group created stories of plausible futures that bring to life what collaborative learning may be like in 2015. These stories present contextual changes in technology and education practices that could occur, with each scenario considering a different trajectory. The group considered changes in the political and social goals of education and in the main role of teachers, as well as changes in the economies of publishing content. Using these scenarios as a way to think about long-term research plans could serve to make programs of research in wireless and mobile technology more robust.
Boundary Chord: A Novel Peer-to-Peer Algorithm for Replica Location Mechanism in Grid Environment
Authors: Hai Jin, Chengwei Wang, Hanhua Chen
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

The emerging grids need an efficient replica location mechanism. In the experience of developing 1 ChinaGrid Supporting Platform (CGSP), a grid middleware that builds a uniform platform supporting multiple grid-based applications, we meet a challenge of utilizing the properties of locality in replica location process to construct a practical and high performance replica location mechanism. The key of the solution to this challenge is to design an efficient replica location algorithm that meets above requirements. Some previous works have been done to build a replica location mechanism, but they are not suitable for replica location in a grid environment with multiple applications like ChinaGrid. In this paper, we present a novel peer-to-peer algorithm for replica location mechanism, Boundary Chord, which has the merits of locality awareness, self-organization, and load balancing. Simulation results show that the algorithm has better performance than other structured peer-to-peer solutions to the replica location problem.
Misbehaving TCP receivers can cause internet-wide congestion collapse
Authors: Rob Sherwood, Bobby Bhattacharjee, Ryan Braud
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

An optimistic acknowledgment (opt-ack) is an acknowledgment sent by a misbehaving client for a data segment that it has not received. Whereas previous work has focused on opt-ack as a means to greedily improve end-to-end performance, we study opt-ack exclusively as a denial of service attack. Specifically, an attacker sends optimistic acknowledgments to many victims in parallel, thereby amplifying its effective bandwidth by a factor of 30 million (worst case). Thus, even a relatively modest attacker can totally saturate the paths from many victims back to the attacker. Worse, a distributed network of compromised machines ("zombies") attacking in parallel can exploit over-provisioning in the Internet to bring about wide-spread, sustained congestion collapse.We implement this attack both in simulation and in a wide-area network, and show it severity both in terms of number of packets and total traffic generated. We engineer and implement a novel solution that does not require client or network modifications allowing for practical deployment. Additionally, we demonstrate the solution's efficiency on a real network.
A Schedulable Garbage Collection for Embedded Applications in CLI
Authors: Okehee Goh, Yann-Hang Lee, Ziad Kaakani, Elliott Rachlin
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Common Language Infrastructure (CLI) has been introduced as a core technology of Microsoft .NET. It enables "writing in multiple languages, running in multiple platforms" by providing Virtual Execution System (VES), Common Intermediate Language, and Common Type System etc. The advantages of using CLI, including portability, compactness, and interoperability, could benefit the productivity of application software development and deployment. However, for embedded real-time systems, the applications¿ time-constraints cannot be satisfied easily due to several features of CLI runtime environment, such as thread priority, thread scheduling, garbage collection etc. In this paper, we aim to have a garbage collection mechanism applicable on real-time applications in CLI and other virtual machine environments. We achieve the goal by making the pause time of garbage collection operations predictable, and the invocation of garbage collection and applications schedulable. A cost model based on measured WCET is established to predict the execution time and overhead of garbage collection operations.
Cost-effective VLSI Design of Non Linear Image Processing Filters
Authors: Sergio Saponara, Michele Cassiano, Stefano Marsi, Riccardo Coen, Luca Fanucci
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

This paper presents a design methodology suitable for the cost-effective and real-time implementation of nonlinear image processing algorithms. Starting from highlevel functional descriptions the proposed optimization flow simplifies the designer¿s duty to achieve a low complexity and low power realization in CMOS technology (FPGA and/or ASIC) with low accuracy loss for the implemented algorithm. As an application case study the paper describes the design of a system, based on a Retinex-like algorithm, to improve the visual quality of images acquired in bad lighting conditions.
Cost allocation using intelligent agents for new transmission investment under electricity deregulation
Authors: David Enke
Venue:  (2005)

Due to electrical power restructuring a dramatic change has been made to the generation and transmission sectors of the power industry. Rules and legislation are continuously changing. The gap between the transmission expansion need and the proposed construction of transmission is widening. The new paradigm for cost allocation suggests that parties who have the need and/or benefit from the new transmission investment should pay the costs. The socialization methods of the past have been shown to be unfair to some market and network participants. The decentralization of the cost allocation must be considered. To promote more competition, transmission has to be expanded or upgraded to remove congestion and market power. The cost allocation of new investment in transmission has to be recalculated. The locational marginal price is used to indicate the benefit for each player. The proposed method is based on agent-based game theory and is compared with traditional cost allocation methods. A real option analysis is applied to deal with future uncertainty factors.
An IEEE Standard for Symbolic Music
Authors: Denis L. Baggi
Venue: Computer (2005)

IEEE Standard P1599 opens a new world to music listeners.
Web Service Composition: A Security Perspective
Authors: B. Carminati, E. Ferrari, P. C. K. Hung
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

A Web service is a software system designed to support interoperable application-to-application interactions over Internet. Web services are based on a set of XML standards, such as Web Services Description Language (WSDL), Simple Object Access Protocol (SOAP) and Universal Description, Discovery and Integration (UDDI). Recently, there has been a growing interest in Web service composition, and some languages (e.g., WSBPEL, BPML) for modeling the composition have been proposed. In this paper we focus on security issues of Web service composition, which have not been deeply investigated so far.
Adaptive Transmission Scheme Based on Rician Channel k-factor for EGPRS Systems
Authors: Rong-Terng Juang, Hsin-Piao Lin, Ming-Jeng Tseng
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

To utilize the spectrum efficiently, nine modulation and coding schemes had been specified in the EGPRS standard. This paper proposes a new closed-loop link adaptation by selecting the transmission mode according to the Rician channel k-factor. The proposed link adaptation incorporates only three identical modulated schemes due to the considerations of hardware complexity and implementation feasibility. Applying the proposed method to a real channel measured at urban Taipei city, the simulation results show that the adaptive scheme outperforms the fixed mode transmission by 58% while the block error rate is maintained below 2^-2.
A..Study on Vulnerability in On-line Writer Verification System
Authors: Yasushi Yamazaki, Akane Nakashima, Kazunobu Tasaka, Naohisa Komatsu
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

The analysis of vulnerabilities and threats in biometrics-based personal authentication systems is indispensable for the development and promotion of wide spread utilization of biometric technologies in accordance with international standardization of information security technologies. In this paper, we discuss the vulnerabilities and threats in a writer verification system which is an application of biometric technologies using handwriting information. We propose some attack methods that use verification results or user templates of a writer verification system. From some simulation results, it is clear that an attacker can estimate an authorized user's biometric information (handwriting information) and produce some forged handwritings which are accepted by the verification system.
Automated type and dimensional synthesis of planar mechanisms using numeric optimization with genetic algorithms
Authors: Yi Liu
Venue:  (2005)

Mechanism type synthesis, or topology optimization, is hampered by the lack of established, well-known design rules, and designers cannot grasp the space of possible designs and the impact of all design variables on a mechanism's performance. Realistically, a human can only design and evaluate several candidate mechanisms, though there may be hundreds of competitive designs that should be investigated. In contrast, an automated approach to mechanism type synthesis can create thousands of designs and measure the performance of each one. A new methodology for automated type and dimensional synthesis of planar mechanisms with revolute joints is presented. The methodology has the following features: (i) the mechanism topology is explicitly included as one design variable within a numeric optimization framework; (ii) the complex kinematic models are formulated by using an effective multibody system modeling technique; (iii) with the genetic algorithms as a synthesizer and a local search method as a kinematic solver, both discrete topological variables and continuous parameters are optimized simultaneously; (iv) the synthesizer accounts for the significance of different metrics through a requirement prioritization scheme; (v) high-performance computing techniques are easily embedded into this methodology. The proposed methodology has been applied to four mechanism design problems: one topology-based optimization and three kinematic synthesis problems. Numerical experiments have shown its applicability to general mechanism kinematic synthesis problems. With moderate effort, this methodology can be extended to tackle more complex dynamic synthesis problems due to the flexible and extensible software architecture. The author's methodology is different from other work in the literature in a fundamental way: it uses numeric optimization rather than domain-specific rules. The optimization-based approach allows a designer to explore an area for which design heuristics are difficult or impossible to establish. It is the first fully automated approach to solving a genuine mechanism type synthesis problem using a numeric optimization framework. Thus, this methodology constitutes a significant and original contribution to the field of mechanism and machine theory.
Parallel Sets: Visual Analysis of Categorical Data
Authors: Fabian Bendix, Robert Kosara, Helwig Hauser
Venue: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization (2005)

The discrete nature of categorical data makes it a particular challenge for visualization. Methods that work very well for continuous data are often hardly usable with categorical dimensions. Only few methods deal properly with such data, mostly because of the discrete nature of categorical data, which does not translate well into the continuous domains of space and color. Parallel Sets is a new visualization method that adopts the layout of parallel coordinates, but substitutes the individual data points by a frequency-based representation. This abstracted view, combined with a set of carefully designed interactions, supports visual data analysis of large and complex data sets. The technique allows ef- ficient work with meta data, which is particularly important when dealing with categorical datasets. By creating new dimensions from existing ones, for example, the user can filter the data according to his or her current needs. We also present the results from an interactive analysis of CRM data using Parallel Sets. We demonstrate how the flexible layout eases the process of knowledge crystallization, especially when combined with a sophisticated interaction scheme.
Real-Time Traffic Separation in Shared Ethernet Networks: Simulation Analysis of the h-BEB Collision Resolution Algorithm
Authors: Ricardo Moraes, Francisco Vasques
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

In this paper, the enhanced collision resolution algorithm, referred as high priority Binary Exponential Backoff (h-BEB) is analyzed. Such algorithm provides high priority traffic separation, enabling the support of real-time communication in shared Ethernet networks. It allows multiple Ethernet standard devices to coexist in the same network segment with one h-BEB enhanced station, imposing higher priority for the transfer of h-BEB related traffic. The simulation analysis shows that the h-BEB algorithm guarantees values for both the average access delay and the related standard deviation, that are significantly smaller for the h-BEB station than for the BEB stations.
Locating faulty code using failure-inducing chops
Authors: Neelam Gupta, Haifeng He, Xiangyu Zhang, Rajiv Gupta
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Software debugging is the process of locating and correcting faulty code. Prior techniques to locate faulty code either use program analysis techniques such as backward dynamic program slicing or exclusively use delta debugging to analyze the state changes during program execution. In this paper, we present a new approach that integrates the potential of delta debugging algorithm with the benefit of forward and backward dynamic program slicing to narrow down the search for faulty code. Our approach is to use delta debugging algorithm to identify a minimal failure-inducing input, use this input to compute a forward dynamic slice and then intersect the statements in this forward dynamic slice with the statements in the backward dynamic slice of the erroneous output to compute a failure-inducing chop. We implemented our technique and conducted experiments with faulty versions of several programs from the Siemens suite to evaluate our technique. Our experiments show that failure-inducing chops can greatly reduce the size of search space compared to the dynamic slices without significantly compromising the capability to locate the faulty code. We also applied our technique to several programs with known memory related bugs such as buffer overflow bugs. The failure-inducing chop in several of these cases contained only 2 to 4 statements which included the code causing memory corruption.
Performance Analysis of the FICC-DiffServ Architecture
Authors: Ha Trung Phan, Doan B. Hoang, Bushar Yousef
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

This paper analyses the behaviour and evaluates the performance of a new QoS DiffServ model, called FICCDiffServ, as implemented in [1]. The implementation proposed a comprehensive framework for DiffServ networks. In the model, the Fair Intelligent Congestion Control (FICC) algorithm is applied to provide fairness among traffic aggregates and control congestion inside the networks. Simulation results show that the FICCDiffServ is robust and simple to implement. It provides excellent fairness and minimizes the packet delay and jitter under a wide range of variations of both internal and external network conditions. In addition, the paper investigates the dynamicity of the overall system by studying the impact of its target operating point on the overall system performance and suggesting a scheme to adjust the operating point adaptively.
Using Re-factoring to Reduce the Pain of Component Evolution
Authors: Ralph Johnson
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

Refactoring is usually described as a way to keep software as simple as possible, or as a way to reuse parts of a software system that were not designed to be reusable. But it has other uses. One of the problems with using software components is that new versions of the components require changes in the systems that use them. If the change from one version of a component to another is described as a set of refactorings then the parts of the system that use them can be automatically changed to use the new versions of the component. This makes it much easier for developers to use the latest versions of components.
The Efficiency of Decreasing Payment Amounts in Mobile Commerce and Ubiquitous Computing
Authors: Daniel Gille
Venue: Proceedings of the Second IEEE International Workshop on Mobile Commerce and Services (2005)

Personalised, location-related and differentiated services in the mobile digital economy create a demand for suitable pricing models. In the case of disaggregated "microservices" (e.g., small digitalized information or service units), as well as for the acquisition of low-value physical goods, the deployment of micropayments seems appropriate. This paper analyzes the economic efficiency of marginal transaction amounts in MCommerce by applying the theoretical approach of transaction cost economics. For this purpose, a separation of technical and cognitive transaction costs is applied. The influence of selected determinants such as specifity, uncertainty and bounded rationality on transaction costs in Mobile Commerce Micropayments is analyzed. The theoretical results imply a more likely application of micropayments for physical goods such as beverages or parking tickets than for digital goods and services. In addition, indicators for a significant abovezero lower limit of transaction amounts in Mobile Commerce are presented.
Using task context variables for selecting the best timing for interrupting users
Authors: Sonja Gievska, John Sibert
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

This paper presents a framework that helps in selecting the most appropriate timing for interruption as a way to mediate human interruptions by the computer. The conceptual framework is based on the new Interruption Taxonomy and uses Bayesian Belief Networks as a decision-support aid. A proof-of-concept model was constructed for the experimental setting used in the exploratory study that was also part of this research. The steps in constructing the model that was built into the first version of the interruption mediator will be presented to show, in detail, how one might use the proposed framework for mediating interruptions.
Gradual Model Generator for Single-Pass Clustering
Authors: Ismo Karkkainen, Pasi Franti
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

We present an algorithm for generating a mixture model from data set by performing a single pass over the data. The method is applicable when the entire data is not available at the same time in the main memory. We use Gaussian mixture model but the algorithm can be adapted to other types of models, too. We also outline a post processing method, which can iteratively reduce the size of the model obtained by the single-pass algorithm. This will result in a model with fewer components, but with approximately the same representation accuracy than the result of the original model from the single-pass algorithm.
The visualization of computer simulation
Authors: Antonio E. Gibson
Venue: ACM SIGSIM Simulation Digest (1974)

The giant red helicopter sits in the center of a stark, surreal runway. Its rotors turn, slowly at first, then whirl into a flashing arc as the helicopter lifts off to sweep out over the ocean and hover over a ship's deck. The helicopter picks up a cargo container, turns toward the audience and fades as the short film clip ends. 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
Predictive Functional Control Based on Fuzzy Model: Design and Stability Study
Authors: Igor Škrjanc, Saso Blazic
Venue: Journal of Intelligent and Robotic Systems (2005)

In the paper the design methodology and stability analysis of parallel distributed fuzzy model based predictive control is presented. The idea is to design a control law for each rule of the fuzzy model and blend them together. The proposed control algorithm is developed in state space domain and is given in analytical form. The analytical form brings advantages in comparison with optimization based control schemes especially in the sence of realization in real-time. The stability analysis and design problems can be viewed as a linear matrix inequalities problem. This problem is solved by convex programming involving LMIs. In the paper a sufficient stability condition for parallel distributed fuzzy model-based predictive control is given. The problem is illustrated by an example on magnetic suspension system.
Competitive Approaches to PSO Algorithms via New Acceleration Co-Efficient Variant with Mutation Operators
Authors: M. Senthil Arumugam, Aarthi Chandramohan, M. V. C. Rao
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

This paper presents a few new competitive approaches to particle swarm optimization (PSO) algorithm in terms of the global and local best values (GLbest-PSO) and the standard PSO along with three set of variants namely, inertia weight (IW), acceleration co-efficient (AC) and mutation operators in this paper. Standard PSO is designed with time varying inertia weight (TVIW) and either time varying AC (TVAC) or fixed AC (FAC) while GLbest-PSO comprises of Global-average Local best IW (GaLbestIW) with either Global-Local best AC (GLbestAC) or FAC. The performances of these two algorithms are improved considerably in solving an optimal control problem, by introducing the concept of mutation variants between particles in each generation. The presence of mutation operator sharpens the convergence and tunes to the best solution. In order to compare and verify the validity and effectiveness of the new approaches for PSO, several statistical analyses are carried out. The results clearly demonstrate the improved performances of the proposed PSOs over the standard PSOs.