ppxscal/embedding_network huggingface dataset:
Archive Design Based on Planets Inspired Logical Object Model
Authors: Eld Zierau, Anders Sewerin Johansen
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

This paper describes a proposal for a logical data model based on preliminary work within the Planets project. In OAIS terms the main areas discussed are related to the introduction of a logical data model for representing the past, present and future versions of the digital object associated with the Archival Storage Package for the publications deposited by our client repositories.
An empirical investigation of the contribution of computer self-efficacy, computer anxiety, and instructors' experience with the use of technology to their intention to use emerging educational technology in traditional classrooms
Authors: Yair Levy
Venue:  (2008)

Over the past decade there has been a shift in the emphasis of emerging educational technology from use in online settings to supporting face-to-face and mixed delivery classes. Although emerging educational technology integration in the classroom has increased in recent years, technology acceptance and usage continue to be problematic for educational institutions. In this predictive study the researcher aimed to predict university instructors' intention to use emerging educational technology in traditional classrooms based on the contribution of computer self-efficacy (CSE), computer anxiety (CA), and experience with the use of technology (EUT), as measured by their contribution to the prediction of behavioral intention (BI). Fifty-six instructors from a small, private university were surveyed to determine their level of CSE, CA, and EUT, and their intention to use emerging educational technology in traditional classrooms. A theoretical model was proposed, and two statistical methods were used to formulate models and test predictive power: Multiple Linear Regression (MLR) and Ordinal Logistic Regression (OLR). It was predicted that CSE, CA, and EUT would have a significant impact on instructors' intention to use emerging educational technology in the classroom. Results showed overall significant models of the three aforementioned factors in predicting instructors' use of emerging educational technology in traditional classrooms. Additionally, results demonstrated that CSE was a significant predictor of the use of emerging educational technology in the classroom, while CA and EUT were not found to be significant predictors. Two important contributions of this study include (1) an investigation of factors that contribute to instructors' acceptance of an emerging educational technology that has been developed specifically to respond to current demands of higher education, and (2) an investigation of key constructs contributing to instructors' intention to use emerging educational technology in the classroom.
An Approach to Contact Force Vector Determination and Its Implementation to Provide Intelligent Tactile Interaction with Environment
Authors: Dzmitry Tsetserukou, Naoki Kawakami, Susumu Tachi
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

The force vector information is essential while collision avoidance planning through tactile feedback in autonomous or teleoperation mode. In this paper, we concentrate on the approach to calculation of the applied force vector at any point of the robot arm and its technical realization. Based on the presented force vector calculation flow, we obtained the experimental results validating the ability of the proposed method to trace the contact point position and to estimate force vector robustly and accurately.
Graded Fuzzy Rules
Authors: Martina Daňková
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

In this contribution, we will recall graded fuzzy rules introduced in [5] and explain the difference from the classical fuzzy rules. Moreover, properties of formulae, which are used to formalize the graded fuzzy rules, will be recalled.
A Virtual Environment for Decision Support in Ship Damage Control
Authors: Jose M. Varela, C. Guedes Soares
Venue: IEEE Computer Graphics and Applications (2007)

The decision support tool Virtual Ship is a virtual environment that supports emergency planning decisions in a ship's Damage Control Center. The model considers what could occur when fluids disseminate through a ship's compartments, such as flooding, fire, or contamination.
On Top-k Search with No Random Access Using Small Memory
Authors: Peter Gurský, Peter Vojtáš
Venue: Proceedings of the 12th East European conference on Advances in Databases and Information Systems (2008)

Methods of top-k search with no random access can be used to find k best objects using sorted lists of attributes that can be read only by sorted access. Such methods usually need to work with a large number of candidates during the computation. In this paper we propose new methods of no random access top-k search that can be used to compute k best objects using small memory. We present results of experiments showing improvement in speed depending on ratio of memory size and data size. Our system outperforms other also when the total number of attributes is much bigger than number of query attributes (varying with user).
Nash Stability in Additively Separable Hedonic Games Is NP-Hard
Authors: Martin Olsen
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

Ballester has shown that the problem of deciding whether a Nash stable partition exists in a hedonic game with arbitrary preferences is NP-complete. In this paper we will prove that the problem remains NP-complete even when restricting to additively separable hedonic games.Bogomolnaia and Jackson have shown that a Nash stable partition exists in every additively separable hedonic game with symmetric preferences. We show that computing Nash stable partitions is hard in games with symmetric preferences. To be more specific we show that the problem of deciding whether a non trivial Nash stable partition exists in an additively separable hedonic game with non-negative and symmetric preferences is NP-complete. The corresponding problem concerning individual stability is also NP-complete since individually stable partitions are Nash stable and vice versa in such games.
New State Recovery Attack on RC4
Authors: Alexander Maximov, Dmitry Khovratovich
Venue: Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology (2008)

The stream cipher RC4 was designed by R. Rivest in 1987, and it is a widely deployed cipher. In this paper we analyse the class RC4-N of RC4-like stream ciphers, where N is the modulus of operations, as well as the length of internal arrays. Our new attack is a state recovery attack which accepts the keystream of a certain length, and recovers the internal state. For the reduced RC4-100, our attack has total complexity of around 293 operations, whereas the best previous attack (from Knudsen et al.) needs 2236 of time.The complexity of the attack applied to the original RC4-256 depends on the parameters of specific states (patterns), which are in turn hard to discover. Extrapolated parameters from smaller patterns give us the attack of complexity about 2241, and it is much smaller than the complexity of the best known previous attack 2779. The algorithm of the new attack was implemented and verified on small cases.
Speech Emotion Recognition Based on a Fusion of All-Class and Pairwise-Class Feature Selection
Authors: Jia Liu, Chun Chen, Jiajun Bu, Mingyu You, Jianhua Tao
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Traditionally in speech emotion recognition, feature selection(FS) is implemented by considering the features from all classes jointly. In this paper, a hybrid system based on all-class FS and pairwise-class FS is proposed to improve speech emotion classification performance. Besides a subset of features obtained from an all-class structure, FS is performed on the available data from each pair of classes. All these subsets are used in their corresponding K-nearest-neighbors(KNN) or Support Vector Machine(SVM) classifiers and the posterior probabilities of the multi-classifiers are fused hierarchically. The experiment results demonstrate that compared with the classical method based on all-class FS and the pairwise method based on pairwise-class FS, the proposed approach achieves 3.2%-8.4% relative improvement on the average F1-measure in speaker-independent emotion recognition.
Mixed Success on US.Cyworld: Reflections on Korean EFL College Student Efforts to Establish an L2 Presence on an American Social Networking Site
Authors: Robert C. Meurant
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Social networking sites are finding pedagogical application, particularly in developing literacy skills. An intriguing extension of this is to second language acquisition (SLA). I set Hyejeon College freshmen the task of establishing individual homepages on the English-language US.Cyworld.com site, a sister site to the Hangeul Cyworld.com site used by most Korean students. Each student was required to decorate his/her minihome; post English-language content through writing a personal introduction, profile, photo captions, and journal; and establish neighborly links to other student homepages, developing text-based conversations. The intent was to improve second language (L2) Digital Literacy skills, which I have elsewhere identified as a critical issue in SLA of English. But the mixed success the task met with prompts a number of observations. While the L2 use of this social networking site appears well-suited to the more adept EFL student, its suitability for students of low L2 ability and/or motivation is questionable.
Evaluation of ACTSim: A Composition Tool for Authoring Adaptive Soft Skill Simulations
Authors: Conor Gaffney, Declan Dagger, Vincent Wade
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

Adaptivity in technology enhanced learning has proven to be an effective and efficient approach in education. While simulations are include in the top end of eLearning there has been few if any real attempts to develop adaptive educational simulations. The key problem with their incorporation is their expense, cost and the effort involved in developing them. This ground breaking paper is the first publication to show a unique way for non-technical domain experts to compose and generate adaptive eLearning simulations. In particular it presents ACTSim, an innovative and unique composition tool used to author adaptive soft skill simulations.
A Tutorial on Parallel Systems Development
Authors: Alex Vrenios
Venue: IEEE Distributed Systems Online (2004)

A review of Parallel Programming in C with MPI and OpenMP by Michael J. Quinn 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
3D Audiovisual Rendering and Real-Time Interactive Control of Expressivity in a Talking Head
Authors: Jean-Claude Martin, Christophe D'Alessandro, Christian Jacquemin, Brian Katz, Aurélien Max, Laurent Pointal, Albert Rilliard
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

The integration of virtual agents in real-time interactive virtual applications raises several challenges. The rendering of the movements of the virtual character in the virtual scene (locomotion of the character or rotation of its head) and the binaural rendering in 3D of the synthetic speech during these movements need to be spatially coordinated. Furthermore, the system must enable real-time adaptation of the agent's expressive audiovisual signals to user's on-going actions. In this paper, we describe a platform that we have designed to address these challenges as follows: (1) the modules enabling real time synthesis and spatial rendering of the synthetic speech, (2) the modules enabling 3D real time rendering of facial expressions using a GPU-based 3D graphic engine, and (3) the integration of these modules within an experimental platform using gesture as an input modality. A new model of phoneme-dependent human speech directivity patterns is included in the speech synthesis system, so that the agent can move in the virtual scene with realistic 3D visual and audio rendering. Future applications of this platform include perceptual studies about multimodal perception and interaction, expressive real time question and answer system and interactive arts.
Automata on Multisets of Communicating Objects
Authors: Linmin Yang, Yong Wang, Zhe Dang
Venue: Proceedings of the 7th international conference on Unconventional Computing (2008)

Inspired by P systems initiated by Gheorghe Pãun, we study a computation model over a multiset of communicating objects. The objects in our model are instances of finite automata. They interact with each other by firing external transitions between two objects. Our model, called service automata, is intended to specify, at a high level, a service provided on top of network devices abstracted as communicating objects. We formalize the concept of processes, running over a multiset of objects, of a service automaton and study the computing power of both single-process and multiprocess service automata. In particular, in the multiprocess case, regular maximal parallelism is defined for inter-process synchronization. It turns out that single-process service automata are equivalent to vector addition systems and hence can define nonregular processes. Among other results, we also show that Presburger reachability problem for single-process service automata is decidable, while it becomes undecidable in the multiprocess case. Hence, multiprocess service automata are strictly more powerful than single-process service automata.
XtreemOS: Towards a Grid-Enabled Linux-Based Operating System
Authors: Domenico Laforenza
Venue: Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge (2008)

The term Grid computing was introduced at the end of 90s by Foster and Kesselman; it was envisioned as "an important new field, distinguished from conventional distributed computing by its focus on large-scale resource sharing, innovative applications, and, in some cases, high-performance orientation" [1].Defining Grids has always been difficult but nowadays there is a general agreement that Grids are distributed systems enabling the creation of Virtual Organizations (VOs) [2] in which users can share, select, and aggregate a wide variety of geographically distributed resources, owned by different organizations, for solving large-scale computational and data intensive problems in science, engineering, and commerce. Those platforms may include any kind of computational resources like supercomputers, storage systems, data sources, sensors, and specialized devices.
FPGA Acceleration of a Subband Beamforming Algorithm for Speech Enhancement
Authors: Ka-Fai Cedric Yiu, Yao Lu, Xiaoxiang Shi, Wayne Luk
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

Signal processing methods for speech enhancement are of vital interest for many equipment. In particular, beamforming algorithms, which perform spatial filtering to separate signals that have overlapping frequency content but are originated from different spatial locations, are important for a wide range of applications. In this paper, a particular beamforming algorithm based on the signal-to-noise ratio together with calibrated signals is described. In order to achieve computational efficiency, the algorithm is implemented in the frequency domain and is accelerated by FPGA.
A New Method to Determine Evidence Discounting Coefficient
Authors: Wen Jiang, An Zhang, Qi Yang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Data fusion technology is widely used in automatic target recognition systems to improve the efficiency. In the framework of evidence, information fusion relies on the use of a combination rule allowing the belief function to be combined. However, Dempster's rule of combination is a poor solution for the management of the conflict between the various information sources. It is proved that, if the false evidence can be correctly selected, Dempster's rule can deal with highly conflicting evidence combination efficiently. However, how to determine the false evidence is an open issue. In this paper, a novel method to determine the discounting coefficient is proposed. First, the distance function between bodies of evidence is introduced to express the degree of conflict degree. Then, the confidence lever of each piece of evidence is obtained to reflect the reliability of each information source to some degree. The discounting coefficient can be determined finally through the relative credibility of sensor reports. The numerical example of multi-sensor fusion target recognition based on DS theory is shown to illustrate the efficiency of the presented approach.
Trust in secure adhoc on-line collaboration
Authors: Samir Chatterjee
Venue:  (2008)

Historically, working groups conducted business face-to-face, however today collaboration often occurs virtually via the Internet. Within organizations, it is easy to create secure environments because all members have some identifiers (i.e. userid, encoded badge) and have been granted specific privileges to systems and files. Increasingly, people from diverse organizations with various devices, are collaborating together in an adhoc fashion. Ad hoc collaboration involves (1) users temporarily joining a collaborative environment to perform specific functions, or (2) environments set up to satisfy a given purpose that are disbanded once that mission is accomplished. Collaboration is broadly defined as interaction among individuals which encompasses a range of behaviors including communication, cooperation, coordination, information sharing, negotiation and problem solving. This research focused on understanding the social implications of trust, and creating an artifact that applies trust concepts to a security model which will support web-enabled secure ad hoc collaboration in a decentralized Peer-to-Peer (P2P) architecture. Trust theories from several disciplines were reviewed to select appropriate social values that emulate the dynamic nature of trust. We built a trust algorithm that contains seven attributes classified into three general dimensions: Authentication Confidence, Availability and Contribution. The Age of Key, Introducer and Key Signers attributes comprise the Authentication Confidence dimension. The Availability dimension includes the Last Date On and Active Sessions attributes. Quantity and Quality make up the Contribution dimension. A java program supporting automated, distributed trust record management was written to simulate the model. Each local node maintains its own trust table and trust record updates are done automatically. There is no incentive to manipulate the trust records because the impact is limited to local node interactions and would not influence the decision of other nodes to trust one another. The model detects malicious nodes attempting to masquerade as trusted nodes. Research contributions include: (1) developing a simulation to test the trust model concepts; (2) results indicate feasibility for supporting secure adhoc collaboration in a distributed environment and (3) a strong possibility that such a trust model can be implemented in a real-world P2P environment.
Real-Time Spherical Videos from a Fast Rotating Camera
Authors: Frank Nielsen, Alexis André, Shigeru Tajima
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

We present a new framework for the acquisition of full spherical videos using a high-speed rotating linear or area sensor equipped with a fish-eye lens. The high capture rate of the sensors allows us to reach high frame rates on the resulting videos. We describe the image processing workflows from the raw data to the full spherical frames, and we show experimental results of non-parallax panoramic videos covering the complete field of view.
Ubiquitous Earthquake Observation System Using Wireless Sensor Devices
Authors: Hirokazu Miura, Yosuke Shimazaki, Noriyuki Matsuda, Fumitaka Uchio, Koji Tsukada, Hirokazu Taki
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

Japan suffers from a high number of earthquakes, so the technology for an earthquake observation is highly demanded. One of information on an earthquake is seismic intensity information which is measured with seismic intensity meters and is announced by the media such as TV. The seismic intensity is a value observed at a location where a seismic intensity meter is placed. This means that the seismic intensity shows wide area information such as administrative districts, e.g., city, town or village. However sites where equal seismic intensity was observed would not necessarily suffer the same damage, because damage depends on the type of construction and on the nature of the seismic motion. Therefore, it is difficult to estimate the individual damage in personal area. In order to measure all the locations, it is necessary to place huge number of seismic intensity meters. In the paper, we develop the system which can observe an earthquake by using wireless sensor network technology. We use wireless nodes equipped with acceleration sensors. The system can provide useful information to predict the individual damage.
Continuous Clustering of Moving Objects in Spatial Networks
Authors: Wenting Liu, Zhijian Wang, Jun Feng
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

Spatial-Temporal clustering is one of the most important analysis tasks in spatial databases. Especially, in many real applications, real time data analysis such as clustering moving objects in spatial networks or traffic congestion prediction is more meaningful.Extensive method of clustering moving objects in Euclidean space is more complex and expensive. This paper proposes the scheme of clustering continuously moving objects, analyzes the fixed feature of the road network, proposes a notion of Virtual Clustering Unit (VCU) and improves on the existing algorithm. Performance analysis shows that the new scheme achieves high efficiency and accuracy for continuous clustering of moving objects in road networks.
Research on Combined Rough Sets with Fuzzy Sets
Authors: Haishan Chen, Meihong Wang, Feng Qian, Qingshan Jiang
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Fuzzy set theory and rough set theory are useful mathematical tools for dealing with complex information in many real-world applications. In this paper we describe three aspects of this field: theoretical research into the properties of fuzzy sets and rough sets, research on the efficient implementation of this theory(attribute reduction, rule generation), and finally the development of hybrid systems that combine fuzzy sets or rough sets with other soft computing techniques such as neural networks and genetic algorithms. Hybrid algorithms can greatly improve the quality of the reconstructed system, bringing a much simpler and better solution to many practical applications.