ppxscal/embedding_network huggingface dataset:
Virtualizing a campus: a SEEU case study
Authors: Bujar Raufi, Zamir Dika, Florije Ismaili, Xhemal Zenuni, Bunjamin Memishi
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

Creating a presentation for the web that drastically differs from standard ones is still a challenge and represents a milestone for many research groups. Virtual university campuses together with virtual learning represent one of these challenges, because it fuses in-place learning with Virtual Learning or education. In this paper we present the in house development of the Virtual Campus for South East European University, the design methodologies, implementation experience, results and possibilities.
Solving Awari with Parallel Retrograde Analysis
Authors: John W. Romein, Henri E. Bal
Venue: Computer (2003)

In Awari, a two-person game of pure skill, players sow stones into pits on a board. The game's rules define how to capture stones, and the player who captures the most wins the game.For more than a decade, researchers have studied computerized techniques to play Awari. The authors have now solved the game by determining the score of 889,063,398,406 board positions and storing them in databases. They performed the necessary computations on a 144-processor parallel computer with 72 gigabytes of main memory and a fast Myrinet interconnect.
On-Line Wireless Channel Modeling for Performance Control Purposes
Authors: Dmitri Moltchanov
Venue: Proceedings of the 8th international conference, NEW2AN and 1st Russian Conference on Smart Spaces, ruSMART on Next Generation Teletraffic and Wired/Wireless Advanced Networking (2008)

Performance control of applications running over wireless channels depends on ability to estimate statistical characteristics of wireless channels in real-time and represent them in terms of the model. Inherent time-varying dynamics of these characteristics pose a number of problems that have to be addressed before reliable estimates of the current channel state will be available. In this paper we consider the problem of on-line estimation of the state of the wireless channel based on bit error observations. The proposed approach is based on smoothing of the original error sequence which is shown to provide better description of the wireless channel for any given instant of time compared to conventional approaches. We also discuss applicability of the proposed approach in performance control of applications running over the air interface.
Framework for a Competency-Driven, Multi-viewpoint, and Evolving Learner Model
Authors: Lucie Moulet, Olga Marino, Richard Hotte, Jean-Marc Labat
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

Considering learning as a dynamic, evolving, social, and lifelong process which occurs in a wide variety of contexts, we aim to improve online learning by offering learning adaptation possibilities, lifelong learning follow-up, learning evolution follow-up, openness to the learner's contexts (personal, professional, and academic), and openness to actors involved in the learning process. To achieve this goal, we propose the development of a meta-model for learner models based on competencies, integrating learner production and personal and professional information, IPP, evolving in time and taking into account different viewpoints. This meta-model may be used for creating different kind of learner models which serve different purposes: adaptation of learning to the learner's cognitive state, learning evaluation, self-reflection, team work... From these kinds of models, models representing individuals will be instantiated.
Direct Conversion Transceivers as a Promising Solution for Building Future Ad-Hoc Networks
Authors: Oleg Panfilov, Antonio Turgeon, Ron Hickling, Lloyd Linder
Venue: Proceedings of the 7th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking (2007)

A potential solution for building ad-hoc networks is described. It is based on the Technoconcepts' TSR chipset. This chipset provides direct conversion of RF signals to baseband. Such RF/DTM chips convert the received signals into digital form immediately after the antenna, making it possible to provide all required signal processing in digital form, thus allowing adaptive frequency bands free of interference. This flexibility provides the most favorable conditions for quality communications. The offered solution has its own set of challenges. The paper describes the major challenges, and the potential ways of addressing them. An example of possible ad-hoc network architectures is presented that is based on the RF/DTM chips.
Diagrams for the Masses: Raising Public Awareness --- From Neurath to Gapminder and Google Earth
Authors: Raul Niño Zambrano, Yuri Engelhardt
Venue: Proceedings of the 5th international conference on Diagrammatic Representation and Inference (2008)

In the beginning of the 1920s Austrian philosopher and sociologist Otto Neurath developed a diagrammatic language (Isotype) that uses simplified pictures and composition rules to convey social and economic statistical data to a general public. A current trend in the information visualization community is the presentation and sharing of information graphics via the World Wide Web (e.g. Gapminder, Google Earth Outreach). In 2007, the Nobel Peace Prize was awarded to work in which statistical diagrams played a key role in raising public awareness (Al Gore's campaign concerning the Inconvenient Truth about global warming). In this paper we explore what these recent uses of graphic representations share with Neurath's idealism about visual education in terms of access to information, empowerment and the assumed benefits of the visual. We also address how digital media have amplified these concepts, and we propose three different categories of `diagrams for the masses'.
Clustering Microarray Data with Space Filling Curves
Authors: Dimitrios Vogiatzis, Nicolas Tsapatsoulis
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

We introduce a new clustering method for DNA microarray data that is based on space filling curves and wavelet denoising. The proposed method is much faster than the established fuzzy c-means clustering because clustering occurs in one dimension and it clusters cells that contain data, instead of data themselves. Moreover, preliminary evaluation results on data sets from Small Round Blue-Cell tumors, Leukemia and Lung cancer microarray experiments show that it can be equally or more accurate than fuzzy c-means clustering or a gaussian mixture model.
Euclidean Sections of $\ell_1^N$ with Sublinear Randomness and Error-Correction over the Reals
Authors: Venkatesan Guruswami, James R. Lee, Avi Wigderson
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

It is well-known that $\mathbb R^N$ has subspaces of dimension proportional to N on which the ¿1 and ¿2 norms are uniformly equivalent, but it is unknown how to construct them explicitly. We show that, for any ¿> 0, such a subspace can be generated using only N ¿ random bits. This improves over previous constructions of Artstein-Avidan and Milman, and of Lovett and Sodin, which require O(N logN), and O(N) random bits, respectively.Such subspaces are known to also yield error-correcting codes over the reals and compressed sensing matrices. Our subspaces are defined by the kernel of a relatively sparse matrix (with at most N ¿ non-zero entries per row), and thus enable compressed sensing in near-linear O(N 1 + ¿ ) time.As in the work of Guruswami, Lee, and Razborov, our construction is the continuous analog of a Tanner code, and makes use of expander graphs to impose a collection of local linear constraints on vectors in the subspace. Our analysis is able to achieve uniform equivalence of the ¿1 and ¿2 norms (independent of the dimension). It has parallels to iterative decoding of Tanner codes, and leads to an analogous near-linear time algorithm for error-correction over reals.
Performance Enhancement of TCP in Dynamic Bandwidth Wired and Wireless Networks
Authors: Neng-Chung Wang, Jong-Shin Chen, Yung-Fa Huang, Chi-Lun Chiou
Venue: Wireless Personal Communications: An International Journal (2008)

In this paper, we propose a scheme that dynamically adjusts the slow start threshold (ssthresh) of TCP. The ssthresh estimation is used to set an appropriate ssthresh. A good ssthresh would improve the transmission performance of TCP. For the congestion avoidance state, we present a mechanism that probes the available bandwidth. We adjust the congestion window size (cwnd) appropriately by observing the round trip time (RTT) and reset the ssthresh after quick retransmission or timeout using the ssthresh estimation. Then the TCP sender can enhance its performance by using the ssthresh estimation and the observed RTT. Our scheme defines what is considered an efficient transmission rate. It achieves better utilization than other TCP versions. Simulation results show that our scheme effectively improves TCP performance. For example, when the average bottleneck bandwidth is close to 30% of the whole network bandwidth, our scheme improves TCP performance by at least 10%.
Decommitment in multi-resource negotiation
Authors: Bo An, Victor Lesser, Kwang Mong Sim
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

This paper presents the design and implementation of negotiation agents that negotiate with other entities for acquiring multiple resources. In our approach, agents utilize a time-dependent negotiation strategy in which the reserve price of each negotiation issue is dynamically determined by 1) the likelihood that negotiation will not be successfully completed (conflict probability), 2) the expected agreement price of the issue, and 3) the expected number of final agreements. Results from a series of experiments indicate that on average, our negotiation strategy achieved higher average utility than traditional negotiation strategies.
Fast Initialization and Memory Management Techniques for Log-Based Flash Memory File Systems
Authors: Junkil Ryu, Chanik Park
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

Flash memory's adoption in the mobile devices is increasing for various multimedia services such as audios, videos, and games. The traditional research issues such as out-place update, garbage collection, and wear-leveling are important, the fast initialization and response time issues of flash memory file system are becoming much more important than ever because flash memory capacity is rapidly increasing. In this paper, we propose a fast initialization technique and an efficient memory management technique for fast response time in log-based flash memory file systems. Our prototype is implemented based on a well-known log-based flash memory file system YAFFS2 and the performance tests were conducted by comparing our prototype with YAFFS2. The experimental results show that the proposed initialization technique reduced the initialization time of the log-based flash memory file system regardless of unmounting the file system properly. Moreover our prototype outperforms YAFFS2 in the read I/O operations and the forward/backward seek I/O operations by way of our proposed memory management technique. This technique is also able to be used to control the memory size required for address mapping in flash memory file systems.
Evaluation of home based junior doctor medical simulator
Authors: Aidan Sliney, David Murphy, David Phelan
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

This paper presents initial research on a home based junior doctor medical simulator (JDoc) to improve the efficiency of junior doctor training within the restrictions imposed by the European Working Time Directive (EWTD). Our goal is to make complex theoretical medical knowledge more accessible. We developed a high fidelity test framework JDoc. Our objective is to understand the potential for medical simulation in junior doctor training. The paper outlines the design process and the construction of the simulator as well as a small scale post-test usability study amongst junior doctors from which we can assess the benefits of JDoc.
Human control of cooperating robots
Authors: Jijun Wang
Venue:  (2007)

Advances in robotic technologies and artificial intelligence are allowing robots to emerge from research laboratories into our lives. Experiences with field applications show that we have underestimated the importance of human-robot interaction (HRI) and that new problems arise in HRI as robotic technologies expand. This thesis classifies HRI along four dimensions&mdash;human, robot, task, and world and illustrates that previous HRI classifications can be successfully interpreted as either about one of these elements or about the relationship between two or more of these elements. Current HRI studies of single-operator single-robot (SOSR) control and single-operator multiple-robots (SOMR) control are reviewed using this approach. Human control of multiple robots has been suggested as a way to improve effectiveness in robot control. Unlike previous studies that investigated human interaction either in low-fidelity simulations or based on simple tasks, this thesis investigates human interaction with cooperating robot teams within a realistically complex environment. USARSim, a high-fidelity game-engine-based robot simulator, and MrCS, a distributed multirobot control system, were developed for this purpose. In the pilot experiment, we studied the impact of autonomy level. Mixed initiative control yielded performance superior to fully autonomous and manual control. To avoid limitation to particular application fields, the present thesis focuses on common HRI evaluations that enable us to analyze HRI effectiveness and guide HRI design independently of the robotic system or application domain. We introduce the interaction episode (IEP), which was inspired by our pilot human-multirobot control experiment, to extend the Neglect Tolerance model to support general multiple robots control for complex tasks. Cooperation Effort (CE), Cooperation Demand (CD), and Team Attention Demand (TAD) are defined to measure the cooperation in SOMR control. Two validation experiments were conducted to validate the CD measurement under tight and weak cooperation conditions in a high-fidelity virtual environment. The results show that CD, as a generic HRI metric, is able to account for the various factors that affect HRI and can be used in HRI evaluation and analysis.
Live Model Transformations Driven by Incremental Pattern Matching
Authors: István Ráth, Gábor Bergmann, András Ökrös, Dániel Varró
Venue: Proceedings of the 1st international conference on Theory and Practice of Model Transformations (2008)

In the current paper, we introduce a live model transformation framework, which continuously maintains a transformation context such that model changes to source inputs can be readily identified, and their effects can be incrementally propagated. Our framework builds upon an incremental pattern matcher engine, which keeps track of matches of complex contextual constraints captured in the form of graph patterns. As a result, complex model changes can be treated as elementary change events. Reactions to the changes of match sets are specified by graph transformation rules with a novel transactional execution semantics incorporating both pseudo-parallel and serializable behaviour.
Generating Checking Sequences for Partial Reduced Finite State Machines
Authors: Adenilso Simão, Alexandre Petrenko
Venue: Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop (2008)

The problem of generating checking sequences for FSMs with distinguishing sequence has been attracting interest of researchers for several decades. In this paper, a solution is proposed for partial reduced FSMs with distinguishing sets, and either with or without reset feature. Sufficient conditions for a sequence to be a checking sequence for such FSMs are formulated. Based on these conditions, a method to generate checking sequence is elaborated. The results of an experimental comparison indicate that the proposed method produces shorter checking sequences than existing methods in most cases. The impact of using the reset feature on the length of checking sequence is also experimentally evaluated.
Towards Cyber-Physical Holodeck Systems Via Physically Rendered Environments (PRE's)
Authors: Veljko Krunic, Richard Han
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

We present an early vision of a cyber-physical environment in which computer controlled rendering of physical surfaces, terrains, and environments is achieved by manipulating grids of "moving physical pixels'' or "moxels", whose heights can be raised and lowered on command. A user would be free to walk within such a dynamically deformable physically rendered environment (PRE). The system would be able to create on demand the floor, ceiling and sides of the "Holodeck'' in which the person resides, and vary the slipperiness of the surfaces to provide authentic tactile feedback in real time. A user would be able to conduct a walking tour of a remote site, the experience of climbing a steep mountain, or navigation through a maze - all within the bounds of the Holodeck. Multiple users could be networked together to create a distributed cyber-physical system to enable team-based distributed training. We present early results in a Holodeck-like simulator, HoloSim.
A Fuzzy Rule-Based System with Ontology for Summarization of Multi-camera Event Sequences
Authors: Han-Saem Park, Sung-Bae Cho
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

Recently, research for the summarization of video data has been studied a lot due to the proliferation of user created contents. Besides, the use of multiple cameras for the collection of the video data has been increasing, but most of them have used the multi-camera system either to cover the wide area or to track moving objects. This paper focuses on getting diverse views for a single event using multi-camera system and deals with the problem of summarizing event sequences collected in the office environment based on this perspective. Summarization includes camera view selection and event sequence summarization. View selection makes a single event sequence from multiple event sequences as selecting optimal views in each time, for which domain ontology based on the elements in an office environment and rules from questionnaire surveys have been used. Summarization generates a summarized sequence from a whole sequence, and the fuzzy rule-based system is used to approximate human decision making. The degrees of interests input by users are used in both parts. Finally, we have confirmed that the proposed method yields acceptable results using experiments of summarization.
The profile of the Cartesian product of graphs
Authors: David Kuo, Jing-Ho Yan
Venue: Discrete Applied Mathematics (2008)

Given a graph G, a proper labelingf of G is a one-to-one function from V(G) onto {1,2,...,|V(G)|}. For a proper labeling f of G, the profile widthw"f(v) of a vertex v is the minimum value of f(v)-f(x), where x belongs to the closed neighborhood of v. The profile of a proper labelingfofG, denoted by P"f(G), is the sum of all the w"f(v), where v@?V(G). The profile ofG is the minimum value of P"f(G), where f runs over all proper labeling of G. In this paper, we show that if the vertices of a graph G can be ordered to satisfy a special neighborhood property, then so can the graph GxQ"n. This can be used to determine the profile of Q"n and K"mxQ"n.
A Probabilistic Prediction Method for Object Contour Tracking
Authors: Daniel Weiler, Volker Willert, Julian Eggert
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

In this paper we present an approach for probabilistic contour prediction in an object tracking system. We combine level-set methods for image segmentation with optical flow estimations based on probability distribution functions (pdf's) calculated at each image position. Unlike most recent level-set methods that consider exclusively the sign of the level-set function to determine an object and its background, we introduce a novel interpretation of the value of the level-set function that reflects the confidence in the contour. To this end, in a sequence of consecutive images, the contour of an object is transformed according to the optical flow estimation and used as the initial object hypothesis in the following image. The values of the initial level-set function are set according to the optical flow pdf's and thus provide an opportunity to incorporate the uncertainties of the optical flow estimation in the object contour prediction.
Statistical Word Sense Disambiguation in Contexts for Russian Nouns Denoting Physical Objects
Authors: Olga Mitrofanova, Olga Lashevskaya, Polina Panicheva
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

The paper presents experimental results on automatic word sense disambiguation (WSD). Contexts for polysemous and/or homonymic Russian nouns denoting physical objects serve as an empirical basis of the study. Sets of contexts were extracted from the Russian National Corpus (RNC). Machine learning software for WSD was developed within the framework of the project. WSD tool used in experiments is aimed at statistical processing and classification of noun contexts. WSD procedure was performed taking into account lexical markers of word meanings in contexts and semantic annotation of contexts. Sets of experiments allowed to define optimal conditions for WSD in Russian texts.
An Efficient Fourth Order Implicit Runge-Kutta Algorithm for Second Order Systems
Authors: Basem S. Attili
Venue: Computer Mathematics: 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers (2008)

We will present an algorithmic approach to the implementation of a fourth order two stage implicit Runge-Kutta method to solve periodic second order initial value problems. The systems involved will be solved using some type of factorization that usually involves both complex and real arithmetic. We will consider the real type case which will be efficient and leads to a system that is one fourth the size of similar systems using normal implicit Runge-Kutta method. We will present some numerical examples to show the efficiency of the method.