ppxscal/embedding_network huggingface dataset:
The tagblog: exploring social web user contribution to encourage students to actively engage in learning content
Authors: Markus Heckner, Silke Schworm
Venue: International Journal of Web Based Communities (2009)

After leaving the lecture hall, students hardly reflect about the lesson's contents. To foster learning, the lesson content should be reorganised, elaborated and critically reflected. Tagging and blogging offer the opportunity to actively engage students in follow-up course work. This paper presents the results of a case study exploring the use of a social web application to encourage student contributions within the context of an undergraduate university seminar. The tagblog combines blogging, tagging and rating as three forms of online user contribution on Web 2.0 to develop a shared, emergent group knowledge repository. Blog posts, tags and comments are analysed to examine how user contributions reflect the active processing of learning content.
Pronoun resolution in Japanese sentences using surface expressions and examples
Authors: Masaki Murata, Hitoshi Isahara, Makoto Nagao
Venue: Proceedings of the Workshop on Coreference and its Applications (1999)

In this paper, we present a method of estimating referents of demonstrative pronouns, personal pronouns, and zero pronouns in Japanese sentences using examples, surface expressions, topics and foci. Unlike conventional work which was semantic markers for semantic constraints, we used examples for semantic constraints and showed in our experiments that examples are as useful as semantic markers. We also propose many new methods for estimating referents of pronouns. For example, we use the form "X of Y" for estimating referents of demonstrative adjectives. In addition to our new methods, we used many conventional methods. As a result, experiments using these methods obtained a precision rate of 87% in estimating referents of demonstrative pronouns, personal pronouns, and zero pronouns for training sentences, and obtained a precision rate of 78% for test sentences.
Distributed Constraint Force Approach for Coordination of Multiple Mobile Robots
Authors: Yunfei Zou, Prabhakar R. Pagilla
Venue: Journal of Intelligent and Robotic Systems (2009)

A new approach to coordination of multiple mobile robots is presented in this paper. The approach relies on the notion of constraint forces which are used in the development of the dynamics of a system of constrained particles with inertia. A familiar class of dynamic, nonholonomic robots are considered. The goal is to design a distributed coordination control algorithm for each robot in the group to achieve, and maintain, a particular formation while ensuring navigation of the group. The theory of constraint forces is used to generate a stable control algorithm for each mobile robot that will achieve, and maintain, a given formation. The advantage of the proposed method is that the formation keeping forces (constraint forces) cancel only those applied forces which act against the constraints. Another feature of the proposed distributed control algorithm is that it allows to add/remove other mobile robots into/from the formation gracefully with simple modifications of the control input. Further, the algorithm is scalable. To corroborate the theoretical approach, simulation results on a group of six robots are shown and discussed.
Test Case Evaluation and Input Domain Reduction strategies for the Evolutionary Testing of Object-Oriented software
Authors: José Carlos Bregieiro Ribeiro, Mário Alberto Zenha-Rela, Francisco Fernández de Vega
Venue: Information and Software Technology (2009)

In Evolutionary Testing, meta-heuristic search techniques are used for generating test data. The focus of our research is on employing evolutionary algorithms for the structural unit-testing of Object-Oriented programs. Relevant contributions include the introduction of novel methodologies for automation, search guidance and Input Domain Reduction; the strategies proposed were empirically evaluated with encouraging results. Test cases are evolved using the Strongly-Typed Genetic Programming technique. Test data quality evaluation includes instrumenting the test object, executing it with the generated test cases, and tracing the structures traversed in order to derive coverage metrics. The methodology for efficiently guiding the search process towards achieving full structural coverage involves favouring test cases that exercise problematic structures. Purity Analysis is employed as a systematic strategy for reducing the search space.
Connectivity preserving transformations for higher dimensional binary images
Authors: Anvesh Komuravelli, Arnab Sinha, Arijit Bishnu
Venue: Discrete Applied Mathematics (2009)

An N-dimensional digital binary image (I) is a function I:Z^N->{0,1}. I is B"3"^"N"-"1,W"3"^"N"-"1 connected if and only if its black pixels and white pixels are each (3^N-1)-connected. I is only B"3"^"N"-"1 connected if and only if its black pixels are (3^N-1)-connected. For a 3-D binary image, the respective connectivity models are B"2"6,W"2"6 and B"2"6. A pair of (3^N-1)-neighboring opposite-valued pixels is called interchangeable in a N-D binary image I, if reversing their values preserves the original connectedness. We call such an interchange to be a (3^N-1)-local interchange. Under the above connectivity models, we show that given two binary images of n pixels/voxels each, we can transform one to the other using a sequence of (3^N-1)-local interchanges. The specific results are as follows. Any two B"2"6-connected 3-dimensional images I and J each having n black voxels are transformable using a sequence of O((c"1+c"2)n^2) 26-local interchanges. Here, c"1 and c"2 are the total number of 8-connected components in all 2-dimensional layers of I and J respectively. We also show bounds on B"2"6 connectivity under a different interchange model as proposed in [A. Dumitrescu, J. Pach, Pushing squares around, Graphs and Combinatorics 22 (1) (2006) 37-50]. Next, we show that any two simply connected images under the B"2"6, W"2"6 connectivity model and each having n black voxels are transformable using a sequence of O(n^2) 26-local interchanges. We generalize this result to show that any two B"3"^"N"-"1, W"3"^"N"-"1-connected N-dimensional simply connected images each having n black pixels are transformable using a sequence of O(Nn^2)(3^N-1)-local interchanges, where N>1.
Design Framework for Ambient Assisted Living Platforms
Authors: Patricia Abril-Jiménez, Cecilia Vera-Muñoz, Maria Fernanda Cabrera-Umpierrez, María Teresa Arredondo, Juan Carlos Naranjo
Venue: Proceedings of the 5th International on ConferenceUniversal Access in Human-Computer Interaction. Part II: Intelligent and Ubiquitous Interaction Environments (2009)

Nowadays the new technological advances offer the possibility to provide a great number of different personalized services that cover the needs of diverse categories of users. The application of the Ambient Intelligence (AmI) paradigm and the Ambient Assisted Living (AAL) concept makes possible the creation of new applications that can significantly improve the quality of life of elderly and dependant people. This paper presents an interaction framework that provides a new generation of user interfaces for AAL services in the context of an AmI-based platform. This solution aims to develop the technological context where elderly and dependant citizens can increase their life independence.
Pushdown Automata Simulator
Authors: Mohamed Hamada
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

This paper introduces a pushdown automata simulator as a component of our evolving integrated virtual environment project for learning computational models and automata theory. The twofold contribution of this work is a novel use of modern technology to improve learning and a longitudinal quasi-experimental evaluation of its use in context.
Analysis on Descriptions of Dosage Regimens in Package Inserts of Medicines
Authors: Masaomi Kimura, Kazuhiro Okada, Keita Nabeta, Michiko Ohkura, Fumito Tsuchiya
Venue: Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009 (2009)

To prevent medical accidents caused by mix-up, the confirmation of usage should be the key to determining error. If a computerized order entry system for medicines shows information concerning therapeutic indications to doctors, they can subsequently avoid mix-ups of medicines such as the case in question. To investigate data which can be utilized for a database in such an entry system, we study the description patterns of the sentences in the dosage regimen portion of the SGML formatted package inserts data via a method based on the text mining technique. Based on this result, we also propose the data structure of dosage regimen information, which will be the basis of a drug information database to ensure safe usage.
Study on Velocity and Density of Pedestrians Flow in Metro Transfer Station
Authors: Zike Tang, Wusheng Liu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

By the investigation to the characteristics of Pedestrians flow on stairways in some main Pedestrians distributing centers, such as the Shanghai Chifeng Road Light Orbit Station, Shanghai People's Square Subway Station and the Shanghai train station and so on, and on the basis of the investigation data above, the fundamental characteristics of Pedestrians flow in transfer station are found by qualitative analysis, the form of function about density-velocity and density-flow rate of Pedestrians flow on stairways is confirmed, then fitting functions in term of investigation data and ensuring parameters by using software, such as Matlab, thus the functions of Pedestrians flow in transfer stations are gained. By comparing vehicles flow to Pedestrians flow on stairways, Pedestrians flow on the walkways to Pedestrians flow on stairways, the foreign related researches to this thesis’ research, the models of Pedestrians flow on stairways are suitable for transfer stations in some big cities in china. It will offer references and directions for improving capacity of stairways, strengthening management with Pedestrians flow and organizing effectively Pedestrians flow.
On a Computational Model for Language Acquisition: Modeling Cross-Speaker Generalisation
Authors: Louis Bosch, Joris Driesen, Hugo Hamme, Lou Boves
Venue: Proceedings of the 12th International Conference on Text, Speech and Dialogue (2009)

The discovery of words by young infants involves two interrelated processes: (a) the detection of recurrent word-like acoustic patterns in the speech signal, and (b) cross-modal association between auditory and visual information. This paper describes experimental results obtained by a computational model that simulates these two processes. The model is able to build word-like representations on the basis of multimodal input data (stimuli) without the help of an a priori specified lexicon. Each input stimulus consists of a speech signal accompanied by an abstract visual representation of the concepts referred to in the speech signal. In this paper we investigate how internal representations generalize across speakers. In doing so, we also analyze the cognitive plausibility of the model.
Social Influence and Role Analysis Based on Community Structure in Social Network
Authors: Tian Zhu, Bin Wu, Bai Wang
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

Recent graph-theoretic approaches have demonstrated remarkable success for ranking networked entities, including degree, closeness, betweenness, etc. They are mainly considering the local link factors only, while not so much work concentrates on the social influence ranking based on the local structure in social network. In this paper, two new social influence ranking metrics, InnerPagerank and OutterPagerank are proposed based on the concept of modified Pagerank, by considering the community structure knowledge. It is well adapted to direct and weighted networks also. Using the two metrics, we also show how to assign community-based node roles to the nodes, which is an effective supplement for single metric used as social influence measure. Identifying and understanding the node's social influence and role is of tremendous interest from both analysis and application points of view. This method is shown to give rasonable results than previous metrics both on test networks and real networks.
A normal least squares support vector machine (NLS-SVM) and its learning algorithm
Authors: Xinjun Peng, Yifei Wang
Venue: Neurocomputing (2009)

Least squares support vector machine (LS-SVM) is a successful method for classification or regression problems, in which the margin and sum square errors (SSEs) on training samples are simultaneously minimized. However, LS-SVM only considers the SSEs of input variable. In this paper, a novel normal least squares support vector machine (NLS-SVM) is proposed, which effectively considers the noises on both input and response variables. It introduces a two-stage learning method to solve NLS-SVM. More importantly, a fast iterative updating algorithm is presented, which reaches the solution of NLS-SVM with lower computational complexity instead of directly adopting the two-stage learning method. Several experiments on artificial and real-world datasets are simulated, in which the results show that NLS-SVM outperforms LS-SVM.
Semi-automatic Web Service Composition Optimization with Global Constraint
Authors: Liu Xiangwei, Xianwen Fang, Juan Guo
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

For semi-automatic composite services, operators make the universal services composite model that adapts itself to application demands according to given business background. This paper present independent global constrains web service composition optimization methods based on Discrete Particle Swarm Optimization (DPSO) and extended Color Petri net (eCPN). Firstly, a eCPN modeling methods which can describe multi-attribute multi-constraint relations and associate relation between component services is proposed. Secondly, combining with the properties of icon, DPSOis used to search a legal firing sequence in the eCPN model, and the composite service corresponding to the legal firing sequence.Using legal firing sequences of the Petri net makes the service composition locating space based on DPSO shrink greatly. Theoretical analysis and experimental results indicate that this method owns both lower computation cost and higher success ratio of service composition.
Asymptotic connectivity in wireless ad hoc networks using directional antennas
Authors: Pan Li, Chi Zhang, Yuguang Fang
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

Connectivity is a crucial issue in wireless ad hoc networks (WANETs). Gupta and Kumar have shown that in WANETs using omnidirectional antennas, the critical transmission range to achieve asymptotic connectivity is O(√logn/n) if n nodes are uniformly and independently distributed in a disk of unit area. In this paper, we investigate the connectivity problem when directional antennas are used. We first assume that each node in the network randomly beamforms in one beam direction. We find that there also exists a critical transmission range for a WANET to achieve asymptotic connectivity, which corresponds to a critical transmission power (CTP). Since CTP is dependent on the directional antenna pattern, the number of beams, and the propagation environment, we then formulate a non-linear programming problem to minimize the CTP. We show that when directional antennas use the optimal antenna pattern, the CTP in a WANET using directional antennas at both transmitter and receiver is smaller than that when either transmitter or receiver uses directional antenna and is further smaller than that when only omnidirectional antennas are used. Moreover, we revisit the connectivity problem assuming that two neighboring nodes using directional antennas can be guaranteed to beamform to each other to carry out the transmission. A smaller critical transmission range than that in the previous case is found, which implies smaller CTP.
Learning lexical alignment policies for generating referring expressions in spoken dialogue systems
Authors: Srinivasan Janarthanam, Oliver Lemon
Venue: Proceedings of the 12th European Workshop on Natural Language Generation (2009)

We address the problem that different users have different lexical knowledge about problem domains, so that automated dialogue systems need to adapt their generation choices online to the users' domain knowledge as it encounters them. We approach this problem using policy learning in Markov Decision Processes (MDP). In contrast to related work we propose a new statistical user model which incorporates the lexical knowledge of different users. We evaluate this user model by showing that it allows us to learn dialogue policies that automatically adapt their choice of referring expressions online to different users, and that these policies are significantly better than adaptive hand-coded policies for this problem. The learned policies are consistently between 2 and 8 turns shorter than a range of different hand-coded but adaptive baseline lexical alignment policies.
Neuro-NIRS: Analysis of Neural Activities Using NIRS
Authors: Hiroshi Tamura, Miki Fuchigami, Akira Okada
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

Analysis method for quick component of NIRS is explained. In order to compare quantitatively the amount of quick component, absolute average operation is applied. The result Q is then formulated as the product of magnitude M and density D. By characteristic differences of M and D functional features of each channel are discussed. The method is applied to text entry task to mobile phone. Most of 34 channels under study D values diverged in rest state, but they converged at task state. 6 channels among 34, showed specific responses to specific task.
Data Classification via a New Data Mining Approach: Multiple Criteria Programming with Multiple Kernels
Authors: Wenzhou Wang, Liwei Wei
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

Nowadays the datasets are constituted by many high dimensional vectors in many applications. Due to this situation, it is necessary for these methods to reduce the computational burden and improve the generalization. In this paper, we propose a novel multiple criteria programming with multiple kernels (MK-MCP) to overcome these difficulties. This model adopts the equality constraints. Compared to the traditional mathematic programming based methods, this method doesn’t require solving a large scale formulation to find the optimal solution. So this formulation leads to an extremely fast and simple algorithm for generating a classifier that merely requires the solution of a set of linear equations. Inspired by the idea of SVM, we introduce the kernel function to solve the classification problem to improve the generalization ability. Some UCI datasets are used to demonstrate the efficiency of this model.
A Case Study of Communication Optimizations on 3D Mesh Interconnects
Authors: Abhinav Bhatelé, Eric Bohm, Laxmikant V. Kalé
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

Optimal network performance is critical to efficient parallel scaling for communication-bound applications on large machines. With wormhole routing, no-load latencies do not increase significantly with number of hops traveled. Yet, we, and others have recently shown that in presence of contention, message latencies can grow substantially large. Hence task mapping strategies should take the topology of the machine into account on large machines. In this paper, we present topology aware mapping as a technique to optimize communication on 3-dimensional mesh interconnects and hence improve performance.Our methodology is facilitated by the idea of object-based decomposition used in Charm++ which separates the processes of decomposition from mapping of computation to processors and allows a more flexible mapping based on communication patterns between objects. Exploiting this and the topology of the allocated job partition, we present mapping strategies for a production code, OpenAtom to improve overall performance and scaling. OpenAtom presents complex communication scenarios of interaction involving multiple groups of objects and makes the mapping task a challenge. Results are presented for OpenAtom on up to 16,384 processors of Blue Gene/L, 8,192 processors of Blue Gene/P and 2,048 processors of Cray XT3.
Multi-objective Russian Doll search
Authors: Emma Rollon, Javier Larrosa
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Russian Doll Search (RDS) is a well-known algorithm for combinatorial optimization. In this paper we extend it from mono-objective to multi-objective optimization. We demonstrate its practical applicability in the challenging multiple-orbit SPOT5 instances. Besides being much more efficient than any other alternatives, multi-objective RDS can solve an instance which could not have been solved previously.
Indexed Containers
Authors: Thorsten Altenkirch, Peter Morris
Venue: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science (2009)

We show that the syntactically rich notion of inductive families can be reduced to a core type theory with a fixed number of type constructors exploiting the novel notion of indexed containers. Indexed containers generalize simple containers, capturing strictly positive families instead of just strictly positive types, without having to extend the core type theory. Other applications of indexed containers include data type-generic programming and reasoning about polymorphic functions. The construction presented here has been formalized using the Agda system.
Floating gate MOSFET circuit design for a monolithic MEMS GAS sensor
Authors: M. A. Reyes-Barranca, S. Mendoza-Acevedo, A. Ávila-García, J. L. González-Vidal, L. M. Flores-Nava
Venue: Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes (2009)

Gas sensors based on various principles and configurations have been studied for several years. Some of them are based on resistance variation of sensing layers. On the other hand, floating-gate MOSFETs can modify its threshold voltage by means of a chemical reaction. Here a study is made to prove that the charge produced by such chemical reaction can affect the voltage upon the floating gate. An analysis of a reading circuit with an FGMOS as the transducer is made, showing this approximation as a promising alternative for gas sensors. A very simple design can be made for fabrication of a monolithic gas sensing system, by using a standard technology, supported in a MEMS structure for thermal isolation purposes. In order to show feasibility of this idea, experimental data is obtained using a conventional MOSFET and an Fe2O3 layer, showing that the system can be used as a gas sensor.