ppxscal/embedding_network huggingface dataset:
Mobile Life --- Innovation in the Wild
Authors: Kristina Höök
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

After a decade of work in our research labs on mobile and ubiquitous technology, often formed by the early visions of ubiquitous computing, with the urge to move interaction from the desktop out into the wild, these technologies have now moved out into the world - into the wild. We are in the middle of a second IT-revolution, caused by the spread of mobile and ubiquitous services, in combination with a broad consumer-oriented market pull. The first ITrevolution, the introduction and deployment of Internet and the World Wide Web during the 1990's, had a major impact on all parts of our society. As mobile, ubiquitous technology now becomes wide-spread, the design and evaluation of mobile services - i.e. information technology that can be accessed and used in virtually any setting - represents an important business arena for the IT- and telecom industry. Together we have to look for a sustainable web of work, leisure and ubiquitous technology we can call the mobile life.
An Architecture for Flexible Entity Configuration in a Simulation Environment
Authors: Changgu Kang, Yoosoo Oh, Woontack Woo
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

Recently, people's interest is on the rise for virtual simulation as witnessed from a large number of applications using virtual space. Especially, simulations for ubiquitous environment focus on generating realistic data, context, contextual interpretation and have characteristics such as systematic testing, detection of rule confliction, and provision of context-aware modules. The previous works only consider systematic functionalities, but do not consider how to easily configure entities in a simulation environment for a user. To make up for these limitations, we propose a system architecture for flexible entity configuration in a simulation environment for smart space. The proposed system architecture removes dependency which is related to a parameter among functions of each entity, and independently interprets and generates context information. An application developer can implement graphical user interface(GUI) of new entities without considering the structural dependency about overall GUI of the system. Therefore, the proposed system architecture is expected to provide flexible simulation environment for an application developer to test an entity by cost effectiveness.
Research on Variable Lane Signalized Control Method
Authors: Li-li Li, Zhao-wei Qu, Xian-min Song, Dian-hai Wang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Taking the variable lane as a research object, the paper designs the detector layout plan according the traffic flow characteristics. Then, it determines the invariable lane's attribute according to the detector data and proposes the signalized control method of invariable lanes. In order to avoid the traffic flow confusion at approaches because ofthe drivers entering into the wrong traffic lane when the lane’s attribute is changed, paper lays out a fictitious stop line and proposed a pre-signal control method based on the fictitious stop line. The suggested strategy was verified with simulation software VISSIM. The results showed that this article method may enhance the road intersection traveling capability and reduces the delay by comparing with different channelization and control methods.
Statistical Model Checking for Steady State Dependability Verification
Authors: Diana El Rabih, Nihal Pekergin
Venue: Proceedings of the 2009 Second International Conference on Dependability (2009)

We propose to apply the perfect simulation to perform statistical model checking of large Markov chains. Perfect simulation is an extension of Monte Carlo Markov Chain (MCMC) methods, it allows us to obtain exact steady-state samples of the underlying chain thus it avoids the burn-in time problem to detect the steady-state. The statistical model checking by MCMC methods has been already proposed in the last years. However the steady-state formulas can not be checked by this approach because of the problem of detecting steady-state. Thus we propose to do statistical model checking by combining perfect simulation and statistical hypothesis testing in order to verify steady state formulas. We apply our proposed method to verify the saturation and availability properties at long run for a multistage interconnection queueing network illustrating its efficiency when considering very large models.
XenLoop: a transparent high performance inter-VM network loopback
Authors: Jian Wang, Kwame-Lante Wright, Kartik Gopalan
Venue: Cluster Computing (2009)

Advances in virtualization technology have focused mainly on strengthening the isolation barrier between virtual machines (VMs) that are co-resident within a single physical machine. At the same time, a large category of communication intensive distributed applications and software components exist, such as web services, high performance grid applications, transaction processing, and graphics rendering, that often wish to communicate across this isolation barrier with other endpoints on co-resident VMs. State of the art inter-VM communication mechanisms do not adequately address the requirements of such applications. TCP/UDP based network communication tends to perform poorly when used between co-resident VMs, but has the advantage of being transparent to user applications. Other solutions exploit inter-domain shared memory mechanisms to improve communication latency and bandwidth, but require applications or user libraries to be rewritten against customized APIs--something not practical for a large majority of distributed applications. In this paper, we present the design and implementation of a fully transparent and high performance inter-VM network loopback channel, called XenLoop, in the Xen virtual machine environment. XenLoop does not sacrifice user-level transparency and yet achieves high communication performance between co-resident guest VMs. XenLoop intercepts outgoing network packets beneath the network layer and shepherds the packets destined to co-resident VMs through a high-speed inter-VM shared memory channel that bypasses the virtualized network interface. Guest VMs using XenLoop can migrate transparently across machines without disrupting ongoing network communications, and seamlessly switch between the standard network path and the XenLoop channel. In our evaluation using a number of unmodified benchmarks, we observe that XenLoop can reduce the inter-VM round trip latency by up to a factor of 5 and increase bandwidth by a up to a factor of 6.
Numerical solution for a sub-diffusion equation with a smooth kernel
Authors: Kassem Mustapha
Venue: Journal of Computational and Applied Mathematics (2009)

In this paper we study the numerical solution of an initial value problem of a sub-diffusion type. For the time discretization we apply the discontinuous Galerkin method and we use continuous piecewise finite elements for the space discretization. Optimal order convergence rates of our numerical solution have been shown. We compare our theoretical error bounds with the results of numerical computations. We also present some numerical results showing the super-convergence rates of the proposed method.
Designing with Only Four People in Mind? --- A Case Study of Using Personas to Redesign a Work-Integrated Learning Support System
Authors: Amir Dotan, Neil Maiden, Valentina Lichtner, Lola Germanovich
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

In this paper we describe and reflect on the use of personas to redesign the 3rd prototype of APOSDLE --- a system to support informal learning and knowledge transfer in the workplace. Based on the results of a formative evaluation of the 2nd prototype we used personas to explore how users' goals, behaviour and preferences could be communicated to project members during a two-day design workshop, in order to ensure useful and usable design solutions. We actively involved stakeholders representing the target market throughout the process as they helped to create, validate and interpret the four personas we used. By doing so we aimed to address methodological weaknesses and practical limitations of using personas, primarily those relating to the validity of the personas used and the way they are interpreted. We reflected on how effective the personas were by referring to data generated during the workshop and discussion transcripts. As reported by others, and as we have experienced ourselves, using personas can be quite challenging as rich narrative descriptions are expected to produce insight and design solutions. In light of this challenge, we contribute a case study illustrating how personas were implemented in a real world situation to engage project members with user information and drive the design process. We specifically discussed the strengths and weaknesses of actively involving stakeholders in creating and using personas.
Research on Data Processing for Weight-in-Motion of Vehicles
Authors: LanYing Guo, Bo Liang, Anguo Dong
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

A new method based on combination of the empirical mode decomposition (EMD) method with nonlinear curve fitting method is proposed for weight-in-motion of vehicles to improve the precision of weight-in-motion(WIM) due to vibration from dynamic load. The analysis shows the proposed method can effectively reduce the impact of low-frequency load. The feasibility and effective of the proposed method in data processing of weight-in-motion of vehicles is shown by simulation and on-site experiment. The maximal deviation is less than 5% when the vehicle velocity is under 40km/h.
Rule based lexical analysis of Maltese
Authors: Paul Micallef
Venue: Proceedings of the Workshop on Computational Approaches to Semitic Languages (1998)

Since no computer based dictionaries exist for Maltese, the only analysis that can be made at present is rule based. The paper describes a rule based system taking into account the mixed origins, (semitic and romance), of Maltese to categorise function and verb words. The system separates the database, the rule formalisms and the rule definitions, enabling easier analysis and quicker changes to rules when necessary.
The Loss of Traffic Noise in Chinese Key Cities
Authors: Caixia Zhu, Fuqin Ma, Yide Zhou, Gaoju Song
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

A method for analyzing loss of traffic noise is proposed based on the rate of pollution loss. Correlative parameter of this method is confirmed according to the national standard of environmental noise. Then the rate of pollution loss for different sound level is computed. Considering the characteristic of traffic noise of China cities, the general computational method for loss of traffic noise is proposed in this paper. Finally, the loss of traffic noise in Chinese key cities are analyzed by the urban road traffic noise, per capita disposable income and metropolitan area population of Chinese key cities in last five years.
Lower Bounds on Quantum Multiparty Communication Complexity
Authors: Troy Lee, Gideon Schechtman, Adi Shraibman
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power of two is known, despite significant efforts. We examine this question in the number-on-the-forehead model of multiparty communication complexity. We show that essentially all lower bounds known on randomized complexity in this model also hold for quantum communication. This includes bounds of size Omega(n/2^k) for the k-party complexity of explicit functions, bounds for the generalized inner product function, and recent work on the multiparty complexity of disjointness. To the best of our knowledge, these are the first lower bounds of any kind on quantum communication in the general number-on-the-forehead model. We show this result in the following way. In the two-party case, there is a lower bound on quantum communication complexity in terms of a norm gamma_2, which is known to subsume nearly all other techniques in the literature. For randomized complexity there is another natural bound in terms of a different norm mu which is also one of the strongest techniques available. A deep theorem in functional analysis, Grothendieck's inequality, implies that gamma_2 and mu are equivalent up to a constant factor. This connection is one of the major obstacles to showing a larger gap between randomized and quantum communication complexity in the two-party case. The lower bound technique in terms of the norm mu was recently extended to the multiparty number-on-the-forehead model. Here we show how the gamma_2 norm can be also extended to lower bound quantum multiparty complexity. Surprisingly, even in this general setting the two lower bounds, on quantum and classical communication, are still very closely related. This implies that separating quantum and classical communication in this setting will require the development of new techniques. The relation between these extensions of mu and gamma_2 is proved by a multi-dimensional version of Grothendieck's inequality.
Real-Time Traffic Flow Statistical Analysis Based on Network-Constrained Moving Object Trajectories
Authors: Zhiming Ding, Guangyan Huang
Venue: Proceedings of the 20th International Conference on Database and Expert Systems Applications (2009)

In this paper, we propose a novel traffic flow analysis method, Network-constrained Moving Objects Database based Traffic Flow Statistical Analysis (NMOD-TFSA) model. By sampling and analyzing the spatial-temporal trajectories of network constrained moving objects, NMOD-TFSA can get the real-time traffic conditions of the transportation network. The experimental results show that, compared with the floating-car methods which are widely used in current traffic flow analyzing systems, NMOD-TFSA provides an improved performance in terms of communication costs and statistical accuracy.
Intelligent Face Image Retrieval Using Eigenpaxels and Learning Similarity Metrics
Authors: Paul Conilione, Dianhui Wang
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

Content-based Image Retrieval (CBIR) systems have been rapidly developing over the years, both in labs and in real world applications. Face Image Retrieval (FIR) is a specialised CBIR system where a user submits a query (image of a face) to the FIR system which searches and retrieves the most visually similar face images from a database. In this paper, we use a neural-network based similarity measure and compare the retrieval performance to Lp-norm similarity measures. Further we examined the effect of user relevance-feedback on retrieval performance. It was found that the neural-similarity measure provided significant performance gains over Lp-norm similarity measures for both the training and test data sets.
Simulating Social Networks of Online Communities: Simulation as a Method for Sociability Design
Authors: Chee Siang Ang, Panayiotis Zaphiris
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

We propose the use of social simulations to study and support the design of online communities. In this paper, we developed an Agent-Based Model (ABM) to simulate and study the formation of social networks in a Massively Multiplayer Online Role Playing Game (MMORPG) guild community. We first analyzed the activities and the social network (who-interacts-with-whom) of an existing guild community to identify its interaction patterns and characteristics. Then, based on the empirical results, we derived and formalized the interaction rules, which were implemented in our simulation. Using the simulation, we reproduced the observed social network of the guild community as a means of validation. The simulation was then used to examine how various parameters of the community (e.g. the level of activity, the number of neighbors of each agent, etc) could potentially influence the characteristic of the social networks.
Temporal Relationships between Rough Time Intervals
Authors: Anahid Bassiri, Mohammad R. Malek, Ali A. Alesheikh, Pouria Amirian
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

Time is a basic measure used to quantify the motions of objects, to compare the durations of events, and to sequence events. Temporal behaviors of spatial objects have occupied geoinformatic's minds and this motivation can be seen in temporal GIS (Geospatial Information System) and navigation. This article focuses on a mathematical abstraction for calculating periods of time. Uncertainty in temporal intervals is considered and temporal relationships are defined based on rough set theory as a powerful device to handle the indeterminate time interval.
Stability and Bifurcation of Flexible Rotor System with Hydrodynamic Bearing Supports
Authors: Yongfang Zhang, Yanjun Lu, Rong Dai
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

Nonlinear dynamic behaviors of hydrodynamic bearing-flexible rotor system are analyzed. A local iteration method consisting of improved Wilson-θ method, predictor-corrector mechanism and Newton-Raphson method is proposed to calculate nonlinear dynamic responses. By the proposed method, the iterations are only executed on nonlinear degrees of freedom. The stability and bifurcation type of the periodic responses are determined by Floquet theory. The numerical results reveal periodic, quasi-periodic, co-existing, jump solutions of rich and complex nonlinear behaviors of the system, and show that the proposed methods not only save computing cost but also have high precision.
The Evolution and Future Trends of Technology and Information Sciences
Authors: Matthew He
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Abstract--Technology is evolving and being transformed. Many boundaries among science, engineering and social systems are cross-linked in the face of combinations of knowledge and tools.It is the time we look at how things work at a system level from past, present to future with great precision. It is the time when the physical, biological and social sciences are joining forces with information sciences and technology. It is the time when we will make extraordinary advances in the history of mankind through information sciences and technologies.Recently the system view of technologies is emerging. In this paper, we classify technology and information sciences into three main domains: (1) physical technology and information science (non-organic/nonliving material-based); (2) biological technology and information science (organic/living material-based); and (3) societal technology and information science (language/mind-based). Furthermore we exam each branch of technologies and information sciences and establish a system-based model of technology and information sciences and discuss the evolution and future trends of technology and information sciences.
Dance Motion Control of a Humanoid Robot Based on Real-Time Tempo Tracking from Musical Audio Signals
Authors: Naoto Nakahara, Koji Miyazaki, Hajime Sakamoto, Takashi X. Fujisawa, Noriko Nagata, Ryohei Nakatsu
Venue: Proceedings of the 8th International Conference on Entertainment Computing (2009)

This paper proposes a system that controls and generates a humanoid robot's dance motion in real-time using the timing of beats in musical audio signals. The system tracks changes in tempo and calculate the integration value of a decibel by analyzing audio signals in real-time. It uses the information to add changes to the robot's dance motion. Beat intervals and the integration value of decibels are used to change the tempo and range of the robot's dance motion respectively. We propose a method to synchronize dance motion of robot with musical beat, changing the robot's dance motion interactively according to the input value.
Graph-Based Representation of Symbolic Musical Data
Authors: Bassam Mokbel, Alexander Hasenfuss, Barbara Hammer
Venue: Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition (2009)

In this work, we present an approach that utilizes a graph-based representation of symbolic musical data in the context of automatic topographic mapping. A novel approach is introduced that represents melodic progressions as graph structures providing a dissimilarity measure which complies with the invariances in the human perception of melodies. That way, music collections can be processed by non-Euclidean variants of Neural Gas or Self-Organizing Maps for clustering, classification, or topographic mapping for visualization. We demonstrate the performance of the technique on several datasets of classical music.
Efficiently Implementing Episodic Memory
Authors: Nate Derbinsky, John E. Laird
Venue: Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2009)

Endowing an intelligent agent with an episodic memory affords it a multitude of cognitive capabilities. However, providing efficient storage and retrieval in a task-independent episodic memory presents considerable theoretical and practical challenges. We characterize the computational issues bounding an episodic memory. We explore whether even with intractable asymptotic growth, it is possible to develop efficient algorithms and data structures for episodic memory systems that are practical for real-world tasks. We present and evaluate formal and empirical results using Soar-EpMem: a task-independent integration of episodic memory with Soar 9, providing a baseline for graph-based, task-independent episodic memory systems.
An Analytical and Experimental Study of Grinding Temperature for Heavy Duty Cam
Authors: Rong-lian Chen, Wei-ming Cheng, Zhi-hong Hu, Xiu-rong Wang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

In order to further study the grinding mechanism and to improve the grinding quality of non-circular cams a mathematical heat transfer model for cam grinding was set up based on the heat transfer theory with reasonable assumptions and simplifications on a heavy duty cam grinding. Internal distributions of temperature, stress, and deformation of the cam were achieved from the cam grinding simulation by ANSYS with calculation and analysis on instantaneous thermal transfer. Results from the simulation truly reflected the heat distribution in the cam grinding. Supported by experiments, the temperature fields from ANSYS were matched by large by what from on line infra red cameras, with an average relative difference about 8.83%. This offers help in solving the problem of cam surface thermal damage and deformation and others during cam grinding