ppxscal/embedding_network huggingface dataset:
Modules Classification and Automatic Generation of Kinematics on Self-reconfigurable Modular Machines
Authors: Yanqiong Fei, Xifang Zhao
Venue: Journal of Intelligent and Robotic Systems (2005)

Self-reconfigurable modular mechanical systems consist of a set of homogeneous units. We analyze the abstract modular structure of self-reconfigurable machines. A total of seven types of cuboid modules and two types of cubic modules have been classified. The concepts of basic group and basic cycle subgroup are proposed. The geometric relationships of each type of modules are derived with group theory. The transformation matrix T L and other characteristic parameters can be obtained iteratively and simply. For the purpose of automatic generation of the forward kinematics, an approach has been adopted by a series of elemental matrixes multiplication with PME (product of matrix exponentials). The methods used are very general and can be applied easily to other modular robots. Examples of the kinematics for a quadruped and a morphing dual-arm reconfigurable robot are given to demonstrate the applicability and effectiveness of the proposed methods generating the kinematics.
Linear Codes over $\mathbb{F}_{q}[u]/(u^s)$ with Respect to the Rosenbloom---Tsfasman Metric
Authors: Mehmet Ozen, Irfan Siap
Venue: Designs, Codes and Cryptography (2006)

We investigate the structure of codes over $\mathbb{F}_q[u]/(u^s)$ rings with respect to the Rosenbloom-Tsfasman (RT) metric. We define a standard form generator matrix and show how we can determine the minimum distance of a code by taking advantage of its standard form. We define MDR (maximum distance rank) codes with respect to this metric and give the weights of the codewords of an MDR code. We explore the structure of cyclic codes over $\mathbb{F}_q[u]/(u^s)$ and show that all cyclic codes over $\mathbb{F}_q[u]/(u^s)$ rings are MDR. We propose a decoding algorithm for linear codes over these rings with respect to the RT metric.
SoundWeb: Hyperlinked Voice Data for Wearable Computing Environment
Authors: Satoshi Nakamura, Takeshi Shoji, Masahiko Tsukamoto, Shojiro Nishio
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

In this paper, we propose a system for browsing voice data which are recorded by people in a wearable computing environment. In this system, voice data is structured by hypertext-style links. A linked part of the voice data is specified by its start/end time in an attached HTML file. When voice data is played, each link is announced by a link sound such as a beep. Users can get linked information by clicking a mouse button while the link sound is being played.
Fixing DNS Misbehavior Hindering IPv6 Deployment
Authors: Shigeya Suzuki, Tatuya Jinmei, Sohgo Takeuchi
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

During the course to deploy IPv6, we found several critical implementation and operational issues which distract user and possibly prevent wider deployment of IPv6. Among the problems we noticed, Domain Name System (DNS) related issues are significant. Some of the problems cause longer delay during the process to make a connection to a given node. In worst case, the delay will be 60 seconds or more. This amount of delay may mislead users for some idea that IPv6 is not good technology, which is not accurate. In this paper, we will reveal six cases which related to DNS server and resolver implemetation we found during our study in detail. To overcome these problem, fix to the servers are essential. To know how these cases affect overall behavior of the DNS, we created a tool to find misbehaving servers. We applied this tool to servers in ".JP" domain and found that there are 0.11% of servers in ".JP" domain have some problem. The other way to solve or ease the problem is to find workaround in client side. We will propose two workarounds, with a sample implementation.
The effects of cognitive load conditions upon performance, anxiety, and self-efficacy in computer-based learning environments
Authors: Raymond B. Miller
Venue:  (2005)

The present study examined whether an extraneous cognitive load condition adversely affected participants' performance, self-efficacy, and anxiety. The participants were sixty-six pre-service teacher education students across two pre-service undergraduate teacher education courses who volunteered to take part in this study. The correlation coefficient was used for the content because Nolen (1995) found that self-efficacy for statistics was related to cognitive engagement. Participants were randomly assigned to either an extraneous cognitive load or non-extraneous cognitive load condition. This study yielded a mixture of significant and non-significant findings regarding the effect of extraneous cognitive load upon motivation and performance. The results suggest two things. First, the correlation instruction improved participants' self-efficacy. Second, that there were confounds such as processing time and content domain that may have affected the results. This suggests that extraneous cognitive load conditions can still adversely impact motivation and performance, but further research is needed to examine these issues.
Web Services Management: A Survey
Authors: Michael P. Papazoglou, Willem-Jan van den Heuvel
Venue: IEEE Internet Computing (2005)

Solutions based on service-oriented architectures are promising in that they leverage common services and enable collaborative business processes that cross organizational boundaries. However, because Web services applications can span multiple hosts, operating systems, languages, and enterprises, it's problematic to measure, control, and manage application availability and performance. In addition to discussing the relationship of Web services management to traditional distributed systems management, this survey explores various Web services management approaches and their underlying architectural concepts.
Integration and Analysis of Functional and Non-Functional Aspects in Model-Driven E-Service Development
Authors: Henk Jonkers, Maria-Eugenia Iacob, Marc M. Lankhorst, Patrick Strating
Venue: Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference (2005)

In this paper we propose an approach for the integration of functional models with non-functional models in the context of model-driven e-service development. Starting from the observation that current approaches to modeldriven development have a strong focus on functionality, we argue the necessity of including non-functional aspects, as early as possible in the service design process, from the architectural (computational independent) level through all MDA layers. Furthermore, we distinguish between two modelling spaces (orthogonal to the MDA view), the design space and the analysis space, which could be integrated by means of model transformations. Thus, relating the analysis results to the original design models can be achieved by following a sequence of steps that entail horizontal model-to-model transformations from the design space to the analysis space, vertical model-to-model transformations (within and between the MDA layers) and proprietary analysis techniques that are used for the derivation of required (quantitative) properties. This provides a framework for incorporating nonfunctional analysis into methodological support for eservice development.
The Sketch Recognition and Query Interpretation by GSQL, aGeographical Sketch Query Language
Authors: Fernando Ferri, Patrizia Grifoni, Maurizio Rafanelli
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Geographic information is intrinsi-cally spatial and it can be conveniently represented using a bidimensional space. Graphical User Interfaces and Visual Languages can be used to satisfy this need. However the growing availability of sketching enables the users to have a more informal and natural approach in the interaction. For this reason this paper presents GSQL (Geographical Sketch Query Language), a sketch-based approach for querying geographical databases. Each one of the users can easily sketch his/her geographical query by drawing it, erasing and modifying its parts and highlighting the query target. Context independent sketch interpretation uses spatial and temporal information related to the process of sketching, while contextdependent sketch interpretation uses geographical domain information to solve the remaining ambiguities and to provide the correct drawing and query interpretation. Also an analysis of the ambiguities, which characterise sketching of objects in the geographic application domain, and their possible solutions are here presented.
An authentication method for interaction between personal servers based on the exchange of addresses
Authors: Akinori Shiraga, Tsuyoshi Abe, Masahisa Kawashima
Venue: Proceedings of the 2005 workshop on Digital identity management (2005)

The sharing of information held on personal servers is becoming widespread, as represented by Weblogs, SNS, etc. In this situation, it is necessary for each personal server to authenticate users autonomously without any special conditions for the site to which they belong. In this paper, we propose an authentication method for interaction between personal servers. The proposal introduces a new method, which involves retrieving a public key based on the prior exchange of addresses. It requires no trusted-third-party, suppresses the number of secret data items to be managed, and enables key revocation with certainty. We investigate a possible security pitfall of the proposal which results in a risk of impersonation using DNS spoofing, and propose a countermeasure for this, showing that the risk is avoidable.
A Practical Approach for Measuring IT-Support of Business Processes
Authors: Rahil Hosseini
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Information Technology (IT) is playing vital role in today's business success. It has been proved that IT services directly effect on business processes performance and organization success. A main factor, which is directly related to IT performance, is functionality of IT services and their support of business processes. In every organization measuring IT functionality in business processes is an important problem, which many business managers are concerned about it. Most IT metrics measure IT services performance without considering their effect on business processes. Therefore a general practical approach for measuring IT services functionality and their effect on doing business process is very essential. In this paper a practical approach for measuring the amount of IT services functionality and their support of business processes has been proposed. By using this approach, we can measure the amount of IT functionality for each business process and total amount of IT support of organization. The amount of this metric helps manager to find out their strength and weakness and improve performance of business processes by utilization of IT services and elevates IT to its rightful place in organization.
An Assessment of Case-Based Reasoning for Spam Filtering
Authors: Sarah Jane Delany, Pádraig Cunningham, Lorcan Coyle
Venue: Artificial Intelligence Review (2005)

Because of the changing nature of spam, a spam filtering system that uses machine learning will need to be dynamic. This suggests that a case-based (memory-based) approach may work well. Case-Based Reasoning (CBR) is a lazy approach to machine learning where induction is delayed to run time. This means that the case base can be updated continuously and new training data is immediately available to the induction process. In this paper we present a detailed description of such a system called ECUE and evaluate design decisions concerning the case representation. We compare its performance with an alternative system that uses Naïve Bayes. We find that there is little to choose between the two alternatives in cross-validation tests on data sets. However, ECUE does appear to have some advantages in tracking concept drift over time.
Ant colony optimization for power plant maintenance scheduling optimization
Authors: Wai Kuan Foong, Holger R. Maier, Angus R. Simpson
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

In this paper, a formulation that enables ant colony optimization (ACO) algorithms to be applied to the power plant maintenance scheduling optimization (PPMSO) problem is developed and tested on a 21-unit case study. A heuristic formulation is introduced and its effectiveness in solving the problem is investigated. The results obtained indicate that the performance of ACO algorithms is significantly better than that of a number of other metaheuristics, such as genetic algorithms and simulated annealing, which have been applied to the same case study previously.
Power-Efficient Error Tolerance in Chip Multiprocessors
Authors: M. Wasiur Rashid, Edwin J. Tan, Michael C. Huang, David H. Albonesi
Venue: IEEE Micro (2005)

As device dimensions continue to be scaled, microprocessors are becoming increasingly vulnerable to environmental disturbances such as a cosmic particle strike, which can cause transient errors. Thus, redundancy becomes more imperative to prevent operational failure due to these errors. Exploiting the natural structural redundancy of multi-core architectures to execute multiple copies of the same program is an effective approach and incurs very little design complexity. Unfortunately, existing Redundant Multi-Threading (RMT) approaches incur high power overhead, a significant disadvantage in an era when power is arguably the most important limiting factor in microprocessors.In this paper, an RMT microarchitecture that significantly reduces this power overhead without impacting performance is presented. The approach exploits the fact that when the verification is parallelized and run on multiple cores, each can run much slower and therefore in a much more energy-efficient configuration, for example through voltage scaling. The design uses a novel approach to buffer a large amount of unverified stores and yet allow fast searching to enforce dependences. This in turn allows the computation thread to run far ahead of the verification ones to create enough of a workload for efficient parallelization.
Research on Classroom Networks for Whole-Class Activities
Authors: William R. Penuel, Jeremy Roschelle, Louis Abrahamson
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

In this paper, we describe results from a synthesis of re-search on classroom networks. We found that of three types of research studies identified-descriptive studies of teaching, outcome studies, and theoretical accounts of net-worked classrooms-the most common were descriptive studies. Descriptive studies, those which focused on identifying what is happening in classrooms that use the technology, point to a constellation of practices believed to be effective with classroom communication systems. Outcome studies point to the potential of classroom networks to support conceptual change, enhanced motivation and engagement, and better feedback between students and teachers. Although the theoretical accounts that attempt to explain reported effects diverge somewhat from one another, they help to explain different sets of research findings about classroom networks. We conclude the synthesis with recommendations for future research on classroom networks
A practical approach to sign language learning for institutional staff
Authors: Mary Jo Davidson
Venue:  (2005)

Hearing people, when learning sign language, have much more difficulty recognizing signs than producing them (Poor, personal communication, July 17, 2003; Tennant Brown, 1998). This work outlines a new approach to solving this problem and incorporates the approach in a new practice tool, designed to accommodate a specific population of sign language learners, staff members at the Mabley Developmental Center in Dixon, Illinois. The practice tool also incorporates the ability to look up an unknown sign based on the handshapes used to produce it.
Technical contributions describing activities underway
Authors: Alan Saltzman
Venue: ACM SIGBIO Newsletter (1979)

In the November 1978 issues of Datamation, in an arcticle entitled "The Changing Face of Applications Programming", Daniel McCracken, President of the ACM, defined procedural versus non-procedural languages. He says that "despite improvements the productivity of today's programmers is no more than two of three times the productivity of programmers a quarter of a century ago. In the same period, the price performance ratio of the computer hardware has improved by a factor of perhaps a million. People wanting to use this low cost hardware are frustrated by the handicaps imposed by writing programs in...procedural languages." He goes on to state that "by the mid-80's more than half of all computer time will be spent running applications programs constructed with non-procedural oriented languages." (Many companies have already become aware of the cost benefits of non-procedural languages and are already using them. Schering-Plough was to be one of these astute companies). 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
GAMA: Grid Account Management Architecture
Authors: Karan Bhatia, Sandeep Chandra, Kurt Mueller
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

Security is a critical component of grid systems and while there are numerous software components and tools that provide some capabilities relating to security, there are few complete end-to-end security systems that work for emerging grid infrastructures "out-of-the-box". Hence significant time and effort are needed for software evaluation, testing and integration of different software components despite the fact that most grid infrastructures have very similar requirements and needs. In this paper, we present GAMA, a GSI-based security infrastructure that is easy to deploy and supports multiple applications. GAMA consists of two component groups: a backend server component that creates and manages X.509 user credentials on behalf of the user, and a set of portal components that provide interfaces for both users and administrators. The GAMA server provides synchronization capability between portals and clusters, supports any SOAP-based rich clients, and supports legacy applications that rely on MyProxy.
Efficient Implementation of Digital Filters with Use of Advanced Synthesis Methods Targeted FPGA Architectures
Authors: Mariusz Rawski, Pawe Tomaszewicz, Henry Selvaraj, Tadeusz Luba
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

This paper presents an efficient method for implementation of digital filters targeted FPGA architectures. The traditional approach is based on application of general purpose multipliers. However, performance of multipliers implemented in FPGA architectures does not allow to constructs high performance digital filters. In this paper application of distributed arithmetic is demonstrated. Since in this approach general purpose multipliers are replaced by combinational LUT blocks, it is possible to construct digital filters of very high performance. However LUT blocks can be of considerable size thus advanced synthesis methods have to be used to map them efficiently into FPGA resources. In this paper an application of the functional decomposition based synthesis has been investigated. This method is recognised as the best synthesis method targeted FPGA architectures and allows significant improvements in digital filters implementation. The paper presents many examples confirming that decomposition allows reduction of logic cell utilisation of filter implementation based on distributed arithmetic concept with no performance degradation and even increasing it.
The Detection and Quantification of Persons in Cluttered Beach Scenes Using Neural Network-Based Classification
Authors: Steve Green, Michael Blumenstein, Matthew Browne, Rodger Tomlinson
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

This paper presents an initial investigation into the detection and quantification of persons in real-world beach scenes for the automated monitoring of tourist sites. Aside from the obvious use of video and digital imagery for surveillance applications, this research focuses on the analysis of images for the purpose of predicting trends of tourist activities at beach sites in Australia. The proposed system uses image enhancement and segmentation techniques to detect objects in cluttered scenes. Following these steps, a newly proposed feature extraction technique is used to represent important information in the extracted objects for training of a neural network. The neural classifier is used to distinguish the extracted objects between "person" and "non-person" categories to assist in quantification. Encouraging results are presented for person classification on a database of real-word beach scenes.
Reactive Spin-locks: A Self-tuning Approach
Authors: Phuong Hoai Ha, Marina Papatriantafilou, Philippas Tsigas
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

Reactive spin-lock algorithms that can automatically adapt to contention variation on the lock have received great attention in the field of multiprocessor synchronization, since they can help applications achieve good performance in all possible contention conditions. However, in existing reactive spin-locks the reaction relies on (i) some fixed experimentally tuned thresholds, which may get frequently inappropriate in dynamic environments like multiprogramming/ multiprocessor systems, or (ii) known probability distributions of inputs. This paper presents a new reactive spin-lock algorithm that is completely self-tuning, which means no experimentally tuned parameter nor probability distribution of inputs are needed. The new spin-lock is built on a competitive online algorithm. Our experiments, which use the Spark98 kernels and the SPLASH-2 applications as application benchmarks, on a multiprocessor machine SGI Origin2000 and on an Intel Xeon workstation show that the new self-tuning spin-lock helps applications with different characteristics achieve good performance in a wide range of contention levels.
The Deception Detection and Restraint in Multi-agent System
Authors: Shuliang Zhao, Guorui Jiang, Tiyun Huang, Xiaoyan Yang
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

We give an approach on the detection and restraint of agent ability declaration deception in multi-agent system, and give a measure to detect and restrain the agent slandering and agent associated-cheat; we also give a method to recognize the agent impostor deception. Simulation test shows this method can fully detect the following impostor deception behaviors: an impostor falsely evaluates other agent; an impostor broadcasts rumor in other agent's relationship web; an impostor cooperates with other agents. It provides a solution to detect and restrain agent deceptions in multi-agent cooperation.