ppxscal/embedding_network huggingface dataset:
Exploring Collaboration Patterns among Global Software Development Teams
Authors: Fatma Cemile Serce, Ferda-Nur Alpaslan, Kathleen Swigger, Robert Brazile, George Dafoulas, Victor Lopez, Randy Schumacker
Venue: Proceedings of the 2009 Fourth IEEE International Conference on Global Software Engineering (2009)

This study examines communication behaviors in global software student teams. The authors of the paper characterize the types of communication behaviors that occur when student teams are engaged in a software development project. The authorspresent findings from a one-semester study that examined factors contributing to successful distributed programming interactions among students enrolled at the University of Atilim (Turkey), Universidad Tecnológica de Panamá, University of North Texas, and Middlesex University (UK). Using content and cluster analyses techniques, we identified distinct patterns of collaboration and examined how these patterns were associated with task, culture, GPA, and performance of collaborative teams. Our results suggest that communication patterns among global software learners may be related to task type, culture and GPA. It is hoped that these findings will lead to the development of new strategies for improving communication among global software teams.
Investigating virtual passthrough I/O on commodity devices
Authors: Lei Xia, Jack Lange, Peter Dinda, Chang Bae
Venue: ACM SIGOPS Operating Systems Review (2009)

A commodity I/O device has no support for virtualization. A VMM can assign such a device to a single guest with direct, fast, but insecure access by the guest's native device driver. Alternatively, the VMMcan build virtual devices on top of the physical device, allowing it to be multiplexed across VMs, but with lower performance. We propose a technique that provides an intermediate option. In virtual passthrough I/O (VPIO), the guest interacts directly with the physical device most of the time, achieving high performance, as in passthrough I/O. Additionally, the guest/device interactions drive a model that in turn identifies (1) when the physical device can be handed off to another VM, and (2) if the guest programs the device to behave illegitimately. In this paper, we describe the VPIO model, and present preliminary results in using it to support two commodity network cards within the Palacios VMM we are building. We believe that an appropriate model for an I/O device could be produced by the hardware vendor as part of the design, implementation, and testing process.
The Testing Techniques of Gyro Stabilized and Opto-electronic Tracking Platform
Authors: Zhou Tao, Wang Lei, Weiqun Shu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

According to the principles of the line of sight (LOS) stabilization and tracking the maneuvering target, the control and test facilities of the gyro stabilized and opto-electronic tracking platform were designed in the paper. The testing key techniques of them were discussed. An industrial computer was the control kernel of the testing system. A Peripheral Component Interconnection (PCI) bus interface analog output card, two digital input-output (IO) cards and a serial communication card were used in the facilities. The calculation and control circuits of the resolver and the Pulse-Width Modulation (PWM) , and the IO driving circuits were applied in the system. The software system was developed with the C++ language and the database software. The experiments results show that the testing facilities have the higher measurement precision and degree of automation, and the better universal performance. They could be operated conveniently because of the friendly human-computer interface. The facilities improve the efficiency of testing and assembling the gyro stabilized and opto-electronic tracking platform.
Design and implementation of a DDS-based multi-carrier GMSK modulator
Authors: M. J. Kesoulis, C. S. Koukourlis, J. N. Lygouras, D. Soudris, J. N. Sahalos
Venue: International Journal of Communication Systems (2009)

The design and hardware implementation of a multi-carrier Gaussian minimum shift keying (GMSK) modulator, based on a direct digital synthesizer, suitable for global system for mobile (GSM) base station applications is described. The synthesizer does not only generate the baseband GMSK signal, but also delivers it at a low IF. Special care has been taken in order to minimize the required memory of the synthesizer. The hardware implementation is mainly based on a field programmable gate array device (FPGA) and a D-A converter. The number of carriers depends on the size of the FPGA. Finally, the hardware implementation of a two-carrier modulator is given. Copyright &copy; 2009 John Wiley & Sons, Ltd. Direct Digital Synthesizer (DDS) is a common component in a variety of communications systems, since it uses digital circuitry to create, manipulate and modulate a signal and has several advantages including fast settling, fine step sizes, simple implementation. We have designed and implemented a DDS-based multicarrier GMSK modulator, where a modified all-digital GMSK filter and an innovative DDS are reused in order to compose and multiplex several GMSK modulated signals generating a modulated IF signal in an earlier stage prior to the transmitting antenna of a GSM communication base station. Copyright &copy; 2009 John Wiley & Sons, Ltd.
Complex Analysis of Anisotropic Swarms
Authors: Bo Liu, Haili Liang, Jie Zhang, Huan Li
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

This paper considers a continuous time swarm model with individuals moving with a nutrient profile (or an attractant/repellent) in an n-dimensional space. The swarm behavior is a result of a balance between inter-individual interplays as well as the interplays of the swarm agents with their environment. It is proved that the swarm members aggregate and eventually form a cohesive cluster of finite size around the swarm weighted center in a finite time under certain conditions.
Impression Evaluation of a Conversational Robot Playing RAKUGO
Authors: Akihiro Ogino, Noritaka Moriya, Park Seung-Joon, Hirotada Ueda
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

The purpose of this paper is to detect a comfortable strength and timing of gestures of the robot for people. This paper describes the evaluation of individual impressions concerning RAKUGO of the traditional Japanese comic storytelling that is performed by a conversational robot. This paper shows that the gestures of the robot like professional actor of RAKUGO give smart and mature impressions to people than exaggerated gestures. In order to detect a tendency of impression based on individual personality, this paper also describes a relation between the individual impression to the gesture of the robot and Transactional Analysis that is one of psychology. We detect that there is a correlation between their impression to the gesture and their personality.
Imbalance Identification of an Over-Hung Rotor Based on the Accelerating Response Data
Authors: J. P. Huang, X. M. Ren
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

Based on the transfer matrix method, the transient equations of motion for an over-hung rotor are established. Then, the Newmark integral method is employed to solve the model equations numerically. An imbalance identification method of the over-hung rotor based on the accelerating response data has been presented after investigating the operating characteristics of the rotor. In this new method, only two accelerating run-ups are required: in the first one, the imbalance angle can be identified by the relationship among the transient amplitude, the rotational velocity, the procession velocity, the phase angle and the key phase impulse. And in the second one, the imbalance magnitude can be acquired with a trial mass being placed in the right or the opposite direction of the imbalance angle which has been identified in the first run-up. The results of the simulating balancing examples show that the proposed method is effective and practical.
An AdaBoost Algorithm with SVM Based on Nonlinear Decision Function
Authors: Wei Wu, Zhang Yanan, Wu Linlin
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

This paper presents a method of using nonlinear decision function to improve the performance of AdaBoost with SVM based weak learners. Compared with the existing AdaBoostSVM methods,this method, named ERBF-AdaBoostSVM, has advantages of higher hate rate and better generalization performance. This method also provides non-linear separator in the weak learner space and classifies accurately more examples. Experimental results demonstrated that ERBF-AdaBoostSVM achieve better generalization performance and higher hate rate than the existing SVM and AdaBoostSVM methods.
Design of multichannel MAC protocols for wireless ad hoc networks
Authors: Shou-Chih Lo
Venue: International Journal of Network Management (2009)

Medium access control (MAC) protocols coordinate channel access between wireless stations, and they significantly affect the network throughput of wireless ad hoc networks. MAC protocols that are based on a multichannel model can increase the throughput by enabling more simultaneous transmission pairs in the network. In this paper, we comprehensively compare different design methods for multichannel MAC protocols. We classify existing protocols into different categories according to the channel negotiation strategies they employ. The common problems that may be encountered in multichannel design are discussed. We then propose a hybrid protocol that combines the advantages of the two methods of a common control channel and a common control period. The simulation results show that our proposed protocol can significantly outperform two representative protocols.
Dynamic DFS tree in ADOPT-ing
Authors: Marius C. Silaghi, Makoto Yokoo
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Several distributed constraint reasoning algorithms employ Depth First Search (DFS) trees on the constraint graph that spans involved agents. In this article we show that it is possible to dynamically detect a minimal DFS tree, compatible with the current order on agents, during the distributed constraint reasoning process of the ADOPT algorithm. This also allows for shorter DFS trees during the initial steps of the algorithms, while some constraints did not yet prove useful given visited combinations of assignments. Earlier distributed algorithms for finding spanning trees on agents did not look to maintain compatibility with an order already used. We also show that announcing a nogood to a single optional agent is bringing significant improvements in the total number of messages. The dynamic detection of the DFS tree brings improvements in simulated time.
SCAN tools for collaborative learning
Authors: Jürgen Buder, Daniel Bodemer, Jessica Dehler, Tanja Engelmann
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

SCAN tools (Social and Cognitive Awareness and Navigation tools) inform participants about social and/or cognitive variables with respect to a group and its members. This paper describes how SCAN tools facilitate and "institutionalize" the natural processes of becoming aware about social and cognitive variables, thereby leading to adaptive behavior in collaboration. The notion of person-object relations (PORs) is introduced as the basic building block underlying both group awareness and social navigation. Four design principles of SCAN tools (response formatting, juxtaposition, aggregation/transformation, and prediction/recommendation) are discussed, and their application in CSCL scenarios is described. Finally, issues for both practical implications and use-inspired basic research on SCAN mechanisms will be explored.
Formal Analysis for Security of Otway-Rees Protocol with BAN Logic
Authors: Li Tingyuan, Liu Xiaodong, Qin Zhiguang, Zhang Xuanfang
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

BAN logic can prove whether a protocol can reach expected target and find some flaws in the protocol. The paper analyzed constitute of BAN logic and analysis steps. On the basis of the above work, BAN logic was used to construct an ideal model of the Otway-Rees protocol and the security of the protocol was analyzed with the initial hypothesis and the logic postulate. The paper also pointed out various kinds of demerit of BAN logic and discussed some possible improvement.
Optimal Motion Planning for Free-Floating Space Robots Based on Null Space Approach
Authors: Haitao Shui, Jianwen Wang, Hongxu Ma
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

The kinematics of a free-floating space robot(FFSR) is more complex than that of a fixed-base robot, and hence its motion planning is more difficult. In this paper, the kinematics of the FFSR is introduced firstly. Then the null space approach is used to reparameterize the path: the direction and magnitude are decoupled and no direction error is introduced.And the Newton iterative method is adopted to find the optimal magnitude of the joint velocity. A plannar FFSR with a 2 DOFs manipulator is selected to test the algorithm and simulation results illustrate that the path following is realized prisely. Finally, deficiencies of the method and prospecsts forthe future are summarized.
Novel Protocol and Its Implementation QKD in Wi-Fi Networks
Authors: Xu Huang, Shirantha Wijesekera, Dharmendra Sharma
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

It is the fact that wireless networks have become one of the most widely used communication systems in the world. However, providing secure communication for wireless networks has become one of the prime concerns. Quantum cryptography, namely Quantum Key Distribution (QKD), offers the promise of unconditional security. In this paper, we have extended our previous research work to a new protocol with the method of integrating quantum cryptography for key distribution in 802.11 wireless networks. Our contributions, based on our previous results [1], are as follows: (1) we shall show how QKD can be implemented in IEEE 802.11 wireless networks to securely distribute the keys. (2) We shall introduce a novel protocol with a method that take the advantage of mutual authentication features offered by some EAP variants of 802.1X Port-Based Network Access Control. (3) Finally, we present a new code called Quantum Message Integrity Code (Q-MIC) which provides mutual authentication between the two communication parties and its implementation
Object identification in a Bayesian context
Authors: Timothy Huang, Stuart Russell
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

Object identification--the task of deciding that two observed objects are in fact one and the same object--is a fundamental requirement for any situated agent that reasons about individuals. Object identity, as represented by the equality operator between two terms in predicate calculus, is essentially a first-order concept. Raw sensory observations, on the other hand, are essentially propositional-- especially when formulated as evidence in standard probability theory. This paper describes patterns of reasoning that allow identity sentences to be grounded in sensory observations, thereby bridging the gap. We begin by defining a physical event space over which probabilities are defined. We then introduce an identity criterion, which selects those events that correspond to identity between observed objects. From this, we are able to compute the probability that any two objects are the same, given a stream of observations of many objects. We show that the appearance probability, which defines how an object can be expected to appear at subsequent observations given its current appearance, is a natural model for this type of reasoning. We apply the theory to the task of recognizing cars observed by cameras at widely separated sites in a freeway network, with new heuristics to handle the inevitable complexity of matching large numbers of objects and with online learning of appearance probability models. Despite extremely noisy observations, we are able to achieve high levels of performance.
Unattended Remote Attestation Delegation for Grid Computing
Authors: Ge Cheng
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

The trusted computing is popularity in Grid arch to improve the grid security. Especially, remote attestation allows the grid user verify the authenticity of the remote resource. However, in the grid environment, remote attestation based on the hash value of platform’s initial configuration is closely related to the job requirements of grid user, which leads to the interaction between the grid user and the remote resource. But there always need unattended remote attestation in grid. In this paper, we give an unattended remote attestation delegation to resolve the issue, which allow the grid user delegate his job related security requirement to the remote attestation delegation. We change the traditional attestation way which makes the resources of the candidate node platform to launch attestation. At the same time we allow grid users to bind his job to the PCR value of platform that he expected and entrust to the remote attestation delegation. So only to meet the security needs of Grid user, the platform will be able to perform user’s job. In this way we avoid the risk of divulging sensitive information while distributing the job in the fragile Grid middleware.
Paradigmatic treatment of Arabic morphology
Authors: Martine Smets
Venue: Proceedings of the Workshop on Computational Approaches to Semitic Languages (1998)

This paper presents a language to express morphological processes, concatenative or non-concatenative. The language allows the definition of two kinds of paradigms: helping paradigms, which define partial morphological forms, and main paradigms, which combine two or more helping paradigms to define fully specified forms.
Automatic construction of predicate-argument structure patterns for biomedical information extraction
Authors: Akane Yakushiji, Yusuke Miyao, Tomoko Ohta, Yuka Tateisi, Jun'ichi Tsujii
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

This paper presents a method of automatically constructing information extraction patterns on predicate-argument structures (PASs) obtained by full parsing from a smaller training corpus. Because PASs represent generalized structures for syntactical variants, patterns on PASs are expected to be more generalized than those on surface words. In addition, patterns are divided into components to improve recall and we introduce a Support Vector Machine to learn a prediction model using pattern matching results. In this paper, we present experimental results and analyze them on how well protein-protein interactions were extracted from MEDLINE abstracts. The results demonstrated that our method improved accuracy compared to a machine learning approach using surface word/part-of-speech patterns.
Stability Analysis of Social Foraging Swarm with Interaction Time Delays
Authors: Bo Liu, Yan Yu, Jie Zhang, Huan Li
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

This paper considers a swarm model with an attraction-repulsion function involving variable communication time lags and an attractant/repellent. It is proved that for quadratic attractant/repellent profiles the members of the swarm with time delays will aggregate and form a cohesive cluster of finite size in a finite time. Moreover, all the swarm members will converge to more favorable areas of the quadratic attractant/repellent profiles under certain conditions in the presence of communication delays.
Summation properties of the ηj and Li constants
Authors: Mark W. Coffey
Venue: Journal of Computational and Applied Mathematics (2009)

We find new summatory and other properties of the constants @h"j entering the Laurent expansion of the logarithmic derivative of the Riemann zeta function about s=1. We relate these constants to other coefficients and functions appearing in the theory of the zeta function. In particular, connections to the Li equivalence of the Riemann hypothesis are discussed and quantitatively developed. The validity of the Riemann hypothesis is reduced to the condition of the sublinear order of a certain alternating binomial sum.
Maximum entropy inverse reinforcement learning
Authors: Brian D. Ziebart, Andrew Maas, J. Andrew Bagnell, Anind K. Dey
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

Recent research has shown the benefit of framing problems of imitation learning as solutions to Markov Decision Problems. This approach reduces learning to the problem of recovering a utility function that makes the behavior induced by a near-optimal policy closely mimic demonstrated behavior. In this work, we develop a probabilistic approach based on the principle of maximum entropy. Our approach provides a well-defined, globally normalized distribution over decision sequences, while providing the same performance guarantees as existing methods. We develop our technique in the context of modeling real-world navigation and driving behaviors where collected data is inherently noisy and imperfect. Our probabilistic approach enables modeling of route preferences as well as a powerful new approach to inferring destinations and routes based on partial trajectories.
Multimodal Functional Imaging Using fMRI-Informed Regional EEG/MEG Source Estimation
Authors: Wanmei Ou, Aapo Nummenmaa, Matti Hämäläinen, Polina Golland
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

We propose a novel method, fMRI-Informed Regional Estimation (FIRE), which utilizes information from fMRI in E/MEG source reconstruction. FIRE takes advantage of the spatial alignment between the neural and the vascular activities, while allowing for substantial differences in their dynamics. Furthermore, with the regional approach, FIRE can be efficiently applied to a dense grid of sources. Inspection of our optimization procedure reveals that FIRE is related to the re-weighted minimum-norm algorithms, the difference being that the weights in the proposed approach are computed from both the current estimates and fMRI data. Analysis of both simulated and human fMRI-MEG data shows that FIRE reduces the ambiguities in source localization present in the minimum-norm estimates. Comparisons with several joint fMRI-E/MEG algorithms demonstrate robustness of FIRE in the presence of sources silent to either fMRI or E/MEG measurements.