OpenRaiser/Intern-Atlas huggingface dataset:
Calibration of 3-d.o.f. Translational Parallel Manipulators Using Leg Observations
Venue: arXiv cs.RO 2009
Year: 2009

The paper proposes a novel approach for the geometrical model calibration of quasi-isotropic parallel kinematic mechanisms of the Orthoglide family. It is based on the observations of the manipulator leg parallelism during motions between the specific test postures and employs a low-cost measuring system composed of standard comparator indicators attached to the universal magnetic stands. They are sequentially used for measuring the deviation of the relevant leg location while the manipulator moves the TCP along the Cartesian axes. Using the measured differences, the developed algorithm estimates the joint offsets and the leg lengths that are treated as the most essential parameters. Validity of the proposed calibration technique is confirmed by the experimental results.
Knowledge Extraction for Discriminating Male and Female in Logical Reasoning from Student Model
Venue: arXiv cs.OH 2009
Year: 2009

The learning process is a process of communication and interaction between the teacher and his students on one side and between the students and each others on the other side. Interaction of the teacher with his students has a great importance in the process of learning and education. The pattern and style of this interaction is determined by the educational situation, trends and concerns, and educational characteristics. Classroom interaction has an importance and a big role in increasing the efficiency of the learning process and raising the achievement levels of students. Students need to learn skills and habits of study, especially at the university level. The effectiveness of learning is affected by several factors that include the prevailing patterns of interactive behavior in the classroom. These patterns are reflected in the activities of teacher and learners during the learning process. The effectiveness of learning is also influenced by the cognitive and non cognitive characteristics of teacher that help him to succeed, the characteristics of learners, teaching subject, and the teaching methods. This paper presents a machine learning algorithm for extracting knowledge from student model. The proposed algorithm utilizes the inherent characteristic of genetic algorithm and neural network for extracting comprehensible rules from the student database. The knowledge is used for discriminating male and female levels in logical reasoning as a part of an expert system course.
Beyond the Drawing Board: Toward More Effective Use of Whiteboard Content
Venue: arXiv cs.HC 2009
Year: 2009

We developed a system that augments traditional office whiteboards with computation for the purposes of retrieving, reusing, and sharing whiteboard content. Our system automatically captures changes to whiteboard images, detects significant changes, and identifies potential collaborative activities. Users then browse and search the collection of images captured from their camera or shared from other users' cameras based on aspects such as location, time, collaboration, etc. We report on the results of a formative study and on an evaluation of effectiveness of our system, and discuss additional functionality that can be built on our framework.
How to Compare the Scientific Contributions between Research Groups
Venue: arXiv cs.IR 2009
Year: 2009

We present a method to analyse the scientific contributions between research groups. Given multiple research groups, we construct their journal/proceeding graphs and then compute the similarity/gap between them using network analysis. This analysis can be used for measuring similarity/gap of the topics/qualities between research groups' scientific contributions. We demonstrate the practicality of our method by comparing the scientific contributions by Korean researchers with those by the global researchers for information security in 2006 - 2008. The empirical analysis shows that the current security research in South Korea has been isolated from the global research trend.
Functions Definable by Numerical Set-Expressions
Venue: arXiv cs.LO 2009
Year: 2009

A "numerical set-expression" is a term specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. If these operations are confined to the usual Boolean operations together with the result of lifting addition to the level of sets, we speak of "additive circuits". If they are confined to the usual Boolean operations together with the result of lifting addition and multiplication to the level of sets, we speak of "arithmetic circuits". In this paper, we investigate the definability of sets and functions by means of additive and arithmetic circuits, occasionally augmented with additional operations.
Checking Behavioral Consistency Constraints for Pervasive Context in Asynchronous Environments
Venue: arXiv cs.SE 2009
Year: 2009

Context consistency checking, the checking of specified constraint on properties of contexts, is essential to context-aware applications. In order to delineate and adapt to dynamic changes in the pervasive computing environment, context-aware applications often need to specify and check behavioral consistency constraints over the contexts. This problem is challenging mainly due to the distributed and asynchronous nature of pervasive computing environments. Specifically, the critical issue in checking behavioral constraints is the temporal ordering of contextual activities. The contextual activities usually involve multiple context collecting devices, which are fully-decentralized and interact in an asynchronous manner. However, existing context consistency checking schemes do not work in asynchronous environments, since they implicitly assume the availability of a global clock or relay on synchronized interactions. To this end, we propose the Ordering Global Activity (OGA) algorithm, which detects the ordering of the global activities based on predicate detection in asynchronous environments. The essence of our approach is the message causality and its on-the-fly coding as logic vector clocks in asynchronous environments. We implement the Middleware Infrastructure for Predicate detection in Asynchronous environments (MIPA), over which the OGA algorithm is implemented and evaluated. The evaluation results show the impact of asynchrony on the checking of behavioral consistency constraints, which justifies the primary motivation of our work. They also show that OGA can achieve accurate checking of behavioral consistency constraints in dynamic pervasive computing environments.
A Mirroring Theorem and its Application to a New Method of Unsupervised Hierarchical Pattern Classification
Venue: arXiv cs.LG 2009
Year: 2009

In this paper, we prove a crucial theorem called Mirroring Theorem which affirms that given a collection of samples with enough information in it such that it can be classified into classes and subclasses then (i) There exists a mapping which classifies and subclassifies these samples (ii) There exists a hierarchical classifier which can be constructed by using Mirroring Neural Networks (MNNs) in combination with a clustering algorithm that can approximate this mapping. Thus, the proof of the Mirroring theorem provides a theoretical basis for the existence and a practical feasibility of constructing hierarchical classifiers, given the maps. Our proposed Mirroring Theorem can also be considered as an extension to Kolmogrovs theorem in providing a realistic solution for unsupervised classification. The techniques we develop, are general in nature and have led to the construction of learning machines which are (i) tree like in structure, (ii) modular (iii) with each module running on a common algorithm (tandem algorithm) and (iv) selfsupervised. We have actually built the architecture, developed the tandem algorithm of such a hierarchical classifier and demonstrated it on an example problem.
Knowledge Management Concepts For Training By Project An observation of the case of project management education
Venue: arXiv cs.CY 2009
Year: 2009

Project management education programmes are often proposed in higher education to give students competences in project planning (Gantt's chart), project organizing, human and technical resource management, quality control and also social competences (collaboration, communication), emotional ones (empathy, consideration of the other, humour, ethics), and organizational ones (leadership, political vision, and so on). This training is often given according a training-by-project type of learning with case studies. This article presents one course characterized by a pedagogical organization based upon Knowledge Management (KM) concepts: knowledge transfer and construction throughout a learning circle and social interactions. The course is supported by a rich and complex tutor organization. We have observed this course by using another KM method inspired from KADS with various return of experience formalized into cards and charts. Our intention is, according to the model of Argyris and Schön (Smith, 2001), to gain feedback information about local and global processes and about actors' experience in order to improve the course. This paper describes precisely the course (pedagogical method and tutor activity) and the KM observation method permitting to identify problem to solve. In our case, we observe problem of pedacogical coordination and skills acquisition. We propose to design a metacognitive tool for tutors and students, usable for improving knowledge construction and learning process organisation
Enhancing the Guidance of the Intentional Model "MAP": Graph Theory Application
Venue: arXiv cs.SE 2009
Year: 2009

The MAP model was introduced in information system engineering in order to model processes on a flexible way. The intentional level of this model helps an engineer to execute a process with a strong relationship to the situation of the project at hand. In the literature, attempts for having a practical use of maps are not numerous. Our aim is to enhance the guidance mechanisms of the process execution by reusing graph algorithms. After clarifying the existing relationship between graphs and maps, we improve the MAP model by adding qualitative criteria. We then offer a way to express maps with graphs and propose to use Graph theory algorithms to offer an automatic guidance of the map. We illustrate our proposal by an example and discuss its limitations.
An Optimal Method For Wake Detection In SAR Images Using Radon Transformation Combined With Wavelet Filters
Venue: arXiv cs.CV 2009
Year: 2009

A new fangled method for ship wake detection in synthetic aperture radar (SAR) images is explored here. Most of the detection procedure applies the Radon transform as its properties outfit more than any other transformation for the detection purpose. But still it holds problems when the transform is applied to an image with a high level of noise. Here this paper articulates the combination between the radon transformation and the shrinkage methods which increase the mode of wake detection process. The latter shrinkage method with RT maximize the signal to noise ratio hence it leads to most optimal detection of lines in the SAR images. The originality mainly works on the denoising segment of the proposed algorithm. Experimental work outs are carried over both in simulated and real SAR images. The detection process is more adequate with the proposed method and improves better than the conventional methods.
AES Implementation and Performance Evaluation on 8-bit Microcontrollers
Venue: arXiv cs.CR 2009
Year: 2009

The sensor network is a network technique for the implementation of Ubiquitous computing environment. It is wireless network environment that consists of the many sensors of lightweight and low power. Though sensor network provides various capabilities, it is unable to ensure the secure authentication between nodes. Eventually it causes the losing reliability of the entire network and many secure problems. Therefore, encryption algorithm for the implementation of reliable sensor network environments is required to the applicable sensor network. In this paper, we proposed the solution of reliable sensor network to analyze the communication efficiency through measuring performance of AES encryption algorithm by plaintext size, and cost of operation per hop according to the network scale.
GoS Proposal to Improve Trust and Delay of MPLS Flows for MCN Services
Venue: arXiv cs.NI 2009
Year: 2009

In this article, Guarantee of Service (GoS) is defined as a proposal to improve the integration of Mission Critical Networking (MCN) services in the Internet, analyzing the congestion impact on those privileged flows with high requirements of trust and delay. Multiprotocol Label Switching (MPLS) is a technology that offers flow differentiation and QoS in the Internet. Therefore, in order to improve network performance in case of congested domains, GoS is proposed as a technique that allows the local recovering of lost packets of MPLS privileged flows. To fulfill the GoS requirements for integration of MCN in MPLS, a minimum set of extensions to RSVPTE has been proposed to provide GoS capable routes. Moreover, we have carried out an analytical study of GoS scalability and a performance improvement analysis by means of simulations.
Building a Vietnamese Language Query Processing Framework for ELibrary Searching Systems
Venue: arXiv cs.DL 2009
Year: 2009

In the objective of building intelligent searching systems for Elibraries or online bookstores, we have proposed a searching system model based on a Vietnamese language query processing component. Such document searching systems based on this model can allow users to use Vietnamese queries that represent content information as input, instead of entering keywords for searching in specific fields in database. To simplify the realization process of system based on this searching system model, we set a target of building a framework to support the rapid development of Vietnamese language query processing components. Such framework let the implementation of Vietnamese language query processing component in similar systems in this domain to be done more easily.
SOAP Serialization Performance Enhancement, Design And Implementation Of A Middleware
Venue: arXiv cs.SE 2009
Year: 2009

The most straightforward way to improve performance of any system is to define the bottlenecks and think of ways to remove them. Web services are the inseparable part of any web application, as a result enhancing performance of web services will have a great effect on the overall performance of the system. The most widely used communication protocol in the web services model, SOAP, is a simple protocol for the exchange of messages. The serialization of large SOAP responses is a major performance bottleneck in a SOAP message exchange. Clearly, some web servers can expect to receive many similar messages for a particular web service as they share the same signature. The idea behind this paper is to avoid the redundant serialization stage of SOAP responses for request which have the same call parameters. The technique exploits the similarities between call parameters to improve web service Response Time by avoiding redundant serialization of the same response with the help of a middleware running on top of web server. The middleware will maintain a trie of incoming parameters for every set of current requests. This way request processing and serialization of the response of same requests will be done only once. In a nutshell, to serialize only the different responses is the simplest way to avoid extra work done by a serializer. It might worth noting that although our approach is to utilize the exact repeating portion parameters, the middleware can be configured to apply changes made to the result set of response to the serialized response being maintained in a trie to generate valid results.
A Trust Based Cross Layer Security Protocol for Mobile Ad hoc Networks
Venue: arXiv cs.CR 2009
Year: 2009

In this paper, we develop a trust based security protocol based on a cross layer approach which attains confidentiality and authentication of packets in both routing and link layers of MANETs. In the first phase of the protocol, we design a trust based packet forwarding scheme for detecting and isolating the malicious nodes using the routing layer information. It uses trust values to favor packet forwarding by maintaining a trust counter for each node. A node is punished or rewarded by decreasing or increasing the trust counter. If the trust counter value falls below a trust threshold, the corresponding intermediate node is marked as malicious. In the next phase of the protocol, we provide link layer security using the CBCX mode of authentication and encryption. By simulation results, we show that the proposed cross layer security protocol achieves high packet delivery ratio while attaining low delay and overhead.
Constellation Precoded Multiple Beamforming
Venue: arXiv cs.IT 2009
Year: 2009

Beamforming techniques that employ Singular Value Decomposition (SVD) are commonly used in Multi-Input Multi-Output (MIMO) wireless communication systems. In the absence of channel coding, when a single symbol is transmitted, these systems achieve the full diversity order provided by the channel; whereas when multiple symbols are simultaneously transmitted, this property is lost. When channel coding is employed, full diversity order can be achieved. For example, when Bit-Interleaved Coded Modulation (BICM) is combined with this technique, full diversity order of NM in an MxN MIMO channel transmitting S parallel streams is possible, provided a condition on S and the BICM convolutional code rate is satisfied. In this paper, we present constellation precoded multiple beamforming which can achieve the full diversity order both with BICM-coded and uncoded SVD systems. We provide an analytical proof of this property. To reduce the computational complexity of Maximum Likelihood (ML) decoding in this system, we employ Sphere Decoding (SD). We report an SD technique that reduces the computational complexity beyond commonly used approaches to SD. This technique achieves several orders of magnitude reduction in computational complexity not only with respect to conventional ML decoding but also, with respect to conventional SD.
An XML-based Multi-Agent System for Supporting Online Recruitment Services
Venue: arXiv cs.MA 2009
Year: 2009

In this paper we propose an XML-based multi-agent recommender system for supporting online recruitment services. Our system is characterized by the following features: {\em (i)} it handles user profiles for personalizing the job search over the Internet; {\em (ii)} it is based on the Intelligent Agent Technology; {\em (iii)} it uses XML for guaranteeing a light, versatile and standard mechanism for information representation, storing and exchange. The paper discusses the basic features of the proposed system, presents the results of an experimental study we have carried out for evaluating its performance, and makes a comparison between the proposed system and other e-recruitment systems already presented in the past.
Sampling and Reconstruction of Signals in a Reproducing Kernel Subspace of $L^p({\Bbb R}^d)$
Venue: arXiv cs.IT 2009
Year: 2009

In this paper, we consider sampling and reconstruction of signals in a reproducing kernel subspace of $L^p(\Rd), 1\le p\le \infty$, associated with an idempotent integral operator whose kernel has certain off-diagonal decay and regularity. The space of $p$-integrable non-uniform splines and the shift-invariant spaces generated by finitely many localized functions are our model examples of such reproducing kernel subspaces of $L^p(\Rd)$. We show that a signal in such reproducing kernel subspaces can be reconstructed in a stable way from its samples taken on a relatively-separated set with sufficiently small gap. We also study the exponential convergence, consistency, and the asymptotic pointwise error estimate of the iterative approximation-projection algorithm and the iterative frame algorithm for reconstructing a signal in those reproducing kernel spaces from its samples with sufficiently small gap.
State Information in Bayesian Games
Venue: arXiv cs.IT 2009
Year: 2009

Two-player zero-sum repeated games are well understood. Computing the value of such a game is straightforward. Additionally, if the payoffs are dependent on a random state of the game known to one, both, or neither of the players, the resulting value of the game has been analyzed under the framework of Bayesian games. This investigation considers the optimal performance in a game when a helper is transmitting state information to one of the players. Encoding information for an adversarial setting (game) requires a different result than rate-distortion theory provides. Game theory has accentuated the importance of randomization (mixed strategy), which does not find a significant role in most communication modems and source coding codecs. Higher rates of communication, used in the right way, allow the message to include the necessary random component useful in games.
Unique Normal Forms in Infinitary Weakly Orthogonal Term Rewriting
Venue: arXiv cs.LO 2009
Year: 2009

The theory of finite and infinitary term rewriting is extensively developed for orthogonal rewrite systems, but to a lesser degree for weakly orthogonal rewrite systems. In this note we present some contributions to the latter case of weak orthogonality, where critial pairs are admitted provided they are trivial. We start with a refinement of the by now classical Compression Lemma, as a tool for establishing infinitary confluence, and hence the property of unique infinitary normal forms, for the case of weakly orthogonal TRSs that do not contain collapsing rewrite rules. That this restriction of collapse-freeness is crucial, is shown in a elaboration of a simple TRS which is weakly orthogonal, but has two collapsing rules. It turns out that all the usual theory breaks down dramatically. We conclude with establishing a positive fact: the diamond property for infinitary developments for weakly orthogonal TRSs, by means of a detailed analysis initiated by van Oostrom for the finite case.
Examples as Interaction: On Humans Teaching a Computer to Play a Game
Venue: arXiv cs.AI 2009
Year: 2009

This paper reviews an experiment in human-computer interaction, where interaction takes place when humans attempt to teach a computer to play a strategy board game. We show that while individually learned models can be shown to improve the playing performance of the computer, their straightforward composition results in diluting what was earlier learned. This observation suggests that interaction cannot be easily distributed when one hopes to harness multiple human experts to develop a quality computer player. This is related to similar approaches in robot task learning and to classic approaches to human learning and reinforces the need to develop tools that facilitate the mix of human-based tuition and computer self-learning.