ppxscal/embedding_network huggingface dataset:
Sharing the magic circle with spatially inclusive games
Authors: Erik Champion, Jeffrey Jacobson
Venue: ACM SIGGRAPH ASIA 2008 educators programme (2008)

Four types of interactive environments explored ways to extend gaming beyond the limitations of the personal computer's conventional desktop interface. These projects aimed to challenge John Huizinga's notion of a "magic circle", the imaginary boundaries of the fantasy world that players of a game occupy. By expanding and diffusing the "magic circle", we believe we can more richly and thematically immerse the player, and more directly involve the audience. The projects were: surround projection environments (using a spherical mirror and warping code); surround projection in custom-built surround spaces with thematically designed tangible interfaces; arcade-style games; and bodily aware-games (using indirect and subconscious biofeedback that changes the music, "boss" monsters, and shaders). The working prototypes were considered successful by the students' peers and by visitors, but were also successful in engaging the students with the interface possibilities and interaction issues of unconventional game design. We also intend to further develop and provide some of these tools to the wider academic community.
Opportunistic Scheduling for Heterogeneous Services in Downlink OFDMA System
Authors: Jun Shen, Na Yi, An Liu, Haige Xiang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

We consider opportunistic scheduling in a downlink OFDMA system to support heterogeneous services. Given the user's queue state information (QSI) and channel state information (CSI), the proposed sum waiting time based scheduling (SWBS) algorithm can guarantee QoS requirements for both real-time (RT) and non-real-time (NRT) service. The benefit is attained from scheduling heterogeneous services based on sum packet waiting time to fulfill the QoS requirements and exploiting multiuser diversity to achieve effective resource utilization. Simulation results illustrate that the max packet loss ratio and packet delay for real-time service and the throughput for non-real-time service are improved by the proposed algorithm.
Introduction to Part 2
Authors: Mike O'Boyle, François Bodin, Marcelo Cintra
Venue: Transactions on High-Performance Embedded Architectures and Compilers I (2007)

Current approaches to embedded compiler development are no longer sustainable. With each generation of embedded architecture, the development time increases and the performance improvement achieved decreases. As high-performance embedded systems move from application-specific integrated circuits to programmable multi-core parallel systems, this problem will become critical. This section of the volume investigates emerging alternative approaches to compiler construction exploring adaption, parallelization, speculation and automatic tuning.
Minimizing Average Flow Time on Unrelated Machines
Authors: René A. Sitters
Venue: Approximation and Online Algorithms: 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers (2009)

We give an O(Q)-approximation for minimizing average flow time on unrelated machines, where Q is the maximum number of different process times on a machine. Consequently, the ratio is O(logP/log&epsilon;) if all process times are a power of &epsilon;. Here, P is the ratio of the maximum and minimum process time of a job.
Voice transmission over ad hoc network adapting optimum approaches to maximize the performance
Authors: Md. Golam Kaosar, Tarek R. Sheltami
Venue: Computer Communications (2009)

Although a lot of research and implementations have been performed for voice transmission over regular network and internet, a little is done for mobile ad hoc network (MANET). Like other computer networks, in MANET voice transmission is also very much demanding and necessary. Since the wireless links in an ad hoc network are highly error prone and may go down frequently because of node mobility, interference, channel fading, and the lack of infrastructure, it is very difficult and challenging to implement voice transmission over MANET. In this research, to maximize the performance of MANET during voice transmission we choose some parameters and methodological approaches e.g. Method of media access, selection of audio codec, selection of routing protocol etc in efficient and optimum way. Since voice applications consume more energy than typical applications, we use an energy aware routing protocol known as WEAC for the study. During the selection process of routing protocol we have a performance comparison study between Improved DSR and WEAC, where WEAC performs better consuming less energy in case of larger network. We also have a comparative study among several audio codecs (G.711, G.729 and G.723.1) where by simulation we show that the G.729 codec is more suitable to use for voice transmission over MANET in terms of latency. Finally, we show that it is possible to launch voice transmission with acceptable quality and throughput over MANET using G.729 and WEAC protocol.
Analysis of factors that induce cysteine bonding state
Authors: Samad Jahandideh, Somayyeh Hoseini, Mina Jahandideh, Afsaneh Hoseini, Ali Salehzadeh Yazdi
Venue: Computers in Biology and Medicine (2009)

Regarding the fact that the protein structure is principally encoded in its sequence, investigating the bonding state of cysteine has gained a great deal of attention due to its significance in the formation of protein structure. Due to lack of evident influence of free cysteines on the protein structure, it may be expected that only half-cystines convey encoded information. The results obtained from the analysis of amino acid distribution in proximity of both states of cysteines explicitly indicated that perquisite information for inducing cysteine bonding state is present even in the flanking amino acid sequences of free cysteines.
Probabilistic planning with clear preferences on missing information
Authors: Maxim Likhachev, Anthony Stentz
Venue: Artificial Intelligence (2009)

For many real-world problems, environments at the time of planning are only partially-known. For example, robots often have to navigate partially-known terrains, planes often have to be scheduled under changing weather conditions, and car route-finders often have to figure out paths with only partial knowledge of traffic congestions. While general decision-theoretic planning that takes into account the uncertainty about the environment is hard to scale to large problems, many such problems exhibit a special property: one can clearly identify beforehand the best (called clearly preferred) values for the variables that represent the unknowns in the environment. For example, in the robot navigation problem, it is always preferred to find out that an initially unknown location is traversable rather than not, in the plane scheduling problem, it is always preferred for the weather to remain a good flying weather, and in route-finding problem, it is always preferred for the road of interest to be clear of traffic. It turns out that the existence of the clear preferences can be used to construct an efficient planner, called PPCP (Probabilistic Planning with Clear Preferences), that solves these planning problems by running a series of deterministic low-dimensional A*-like searches. In this paper, we formally define the notion of clear preferences on missing information, present the PPCP algorithm together with its extensive theoretical analysis, describe several useful extensions and optimizations of the algorithm and demonstrate the usefulness of PPCP on several applications in robotics. The theoretical analysis shows that once converged, the plan returned by PPCP is guaranteed to be optimal under certain conditions. The experimental analysis shows that running a series of fast low-dimensional searches turns out to be much faster than solving the full problem at once since memory requirements are much lower and deterministic searches are orders of magnitude faster than probabilistic planning.
Network Design with Weighted Degree Constraints
Authors: Takuro Fukunaga, Hiroshi Nagamochi
Venue: Proceedings of the 3rd International Workshop on Algorithms and Computation (2009)

In an undirected graph G&thinsp;=&thinsp;(V,E) with a weight function $w: E \times V \rightarrow \mathbb Q_+$, the weighted degree d w (v;E) of a vertex v is defined as &sum;&thinsp;{w(e,v) |e&thinsp;&isin;&thinsp;E incident with v}. In this paper, we consider a network design problem which has upper-bounds on weighted degrees of vertices as its constraints while the objective is to compute a minimum cost graph with a prescribed connectivity. We propose bi-criteria approximation algorithms based on the iterative rounding, which has been successfully applied to the degree-bounded network design problem. A problem minimizing the maximum weighted degree of vertices is also discussed.
Web based application for registering degree projects
Authors: Leonidas Fragidis, Achilleas Michailidis, Vassilios Mardiris, Vassilios Chatzis
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The purpose of this paper is to present the web-based application "e-project" accessing a relational database through internet. The tools that have been used to build this application are MySQL as a relational database system for the database design, TCL as a computer language for the development of the application, JavaScript language scripts has been included in source code and HTML for the internet user interface programming. The aim of the application is to provide easy access to the submitted projects and dissertations of the Information Management Department of the Technological Institute of Kavala, Greece to each authorized user. The users are separated to three different groups, the administrator, the professors and the regular users which are the students of the department.
Statistics Without Maths for Psychology: Using Spss for Windows, 4th edition
Authors: Christine Dancey, John Reidy
Venue:  (2008)

Statistics Without Maths for Psychology is an essential companion to your psychology course, guiding you through the process of using statistics without mathematical formulae. It gives you the tools to use SPSS to analyse data and provides clear but comprehensive explanations of all the statistical concepts you will need, offering you the opportunity to test your knowledge and practice your skills along the way with activities, exercises and multiple choice questions. Packed with examples, discussion points and handy tips it will enable you to enrich your understanding and avoid feeling like a fish out of water.New features to this edition *Full guidance on using the latest version 15 of SPSS as well as earlier versions 10-14 *A brand new chapter provides a clear introduction to the SPSS software before you start *Up-to date examples from the literature keep you informed of current research*A revised preface will guide you through how to use the new edition and web resources more effectively *Answers to multiple choice questions are now included at the end of each chapter to allow you to test yourself easily and quickly A brand new companion website with expanded and interactive features including; *An interactive hyperlinked flow chart guiding you through each step of choosing an analyses *An expanded bank of Multiple Choice Questions allowing you to test your knowledge of each chapter*Case studies with data sets and questions for each chapter to allow you to put what you've learnt into practice Endorsements . ..To come Christine Dancey is a Professor of Psychology at the University of East London John Reidy is a Senior Lecturer in the Department of Psychology at Sheffield Hallam University
Simulation of FSO transmission channel
Authors: Zdenek Kolka, Viera Biolková, Dalibor Biolek
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

The paper deals with the modeling and simulation of atmospheric Free-Space Optical (FSO) links. Due to the effect of atmospheric turbulence the links are characterized by outages in the order of tens of milliseconds, which are several orders of magnitude longer than the duration of frames (packets) being transmitted. For high transmission rates the optical channel can be simply modeled as a slowly varying AWGN channel. It allows computing the probability of the occurrence of errors in each packet by means of analytical formulae. The method is demonstrated on the simulation of channel coding for mitigating short fades for unidirectional link using the OOK modulation.
A robust trigonometrically fitted embedded pair for perturbed oscillators
Authors: Yonglei Fang, Yongzhong Song, Xinyuan Wu
Venue: Journal of Computational and Applied Mathematics (2009)

A new kind of trigonometrically fitted embedded pair of explicit ARKN methods for the numerical integration of perturbed oscillators is presented in this paper. This new pair is based on the trigonometrically fitted ARKN method of order five derived by Yang and Wu in [H.L. Yang, X.Y. Wu, Trigonometrically-fitted ARKN methods for perturbed oscillators, Appl. Numer. Math. 9 (2008) 1375-1395]. We analyze the stability properties, phase-lag (dispersion) and dissipation of the higher-order method of the new pair. Numerical experiments carried out show that our new embedded pair is very competitive in comparison with the embedded pairs proposed in the scientific literature.
A highly sensitive refractive-index sensor based on the long-period grating pair with a fiber-taper in-between
Authors: Jinfei Ding, Liyang Shao, Hong Su, Shuangchen Ruan
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

We report an improved structure of long-period gratings (LPGs), i.e. long-period grating pair with a fiber-taper in-between (LPGP-FTI), as a highly sensitive refractive-index sensor. Since a taper is introduced in-between the LPG pair, the guided core mode will be transmitted to a cladding mode as the fiber tapers down, and thus the evanescent field of the selected cladding mode in the external medium is increased. In this way the effective index difference is enlarged, so that the sensitivity can be greatly improved. The experimental results have shown that the sensitivity of the LPG pair to the change in the RI of the measurand can be efficiently improved by a fiber taper, and can be flexibly tailored by the tapering degree. Enhanced sensitivity, which is about five times higher than that of a normal LPG pair, is achieved in the experiment. Such a highly sensitive fiber-optic RI sensor is good for use as a chemical or biological sensor.
Experimental analysis of optimization techniques on the road passenger transportation problem
Authors: Beatriz López, Victor Muñoz, Javier Murillo, Federico Barber, Miguel A. Salido, Montserrat Abril, Mariamar Cervantes, Luis F. Caro, Mateu Villaret
Venue: Engineering Applications of Artificial Intelligence (2009)

Analyzing the state of the art in a given field in order to tackle a new problem is always a mandatory task. Literature provides surveys based on summaries of previous studies, which are often based on theoretical descriptions of the methods. An engineer, however, requires some evidence from experimental evaluations in order to make the appropriate decision when selecting a technique for a problem. This is what we have done in this paper: experimentally analyzed a set of representative state-of-the-art techniques in the problem we are dealing with, namely, the road passenger transportation problem. This is an optimization problem in which drivers should be assigned to transport services, fulfilling some constraints and minimizing some function cost. The experimental results have provided us with good knowledge of the properties of several methods, such as modeling expressiveness, anytime behavior, computational time, memory requirements, parameters, and free downloadable tools. Based on our experience, we are able to choose a technique to solve our problem. We hope that this analysis is also helpful for other engineers facing a similar problem.
A Simplified pulse-coupled neural network for adaptive segmentation of fabric defects
Authors: Meihong Shi, Shoushan Jiang, Huiran Wang, Bugao Xu
Venue: Machine Vision and Applications (2009)

This paper describes an adaptive image-segmentation method based on a simplified pulse-coupled neural network (PCNN) for detecting fabric defects. Defect segmentation has been a focal point in fabric inspection research, and it remains challenging because it detects delicate features of defects complicated by variations in weave textures and changes in environmental factors (e.g., illumination, noise). A new parameter called the deviation of the contrast (DOC) was introduced to describe the contrast difference in row and column between the analyzed image and a defect-free image of the same fabric. The DOC essentially weakens the influence of the weave texture and the illumination. The simplification of PCNN reduces the number of the network&#x2019;s parameters by utilizing the local and global DOC information for the parameter selections. The validation tests on the developed algorithms were performed with fabric images captured by a line-scan camera on an inspection machine, and with images from TILDA&#x2019;s Textile Texture Database (http://lmb.informatik.uni-freiburg.de/research/dfg-texture/tilda) as well.
Analytical solution of spectrum changes in simple nonlinear systems without memory, used in digital audio signal processing
Authors: Jiri Schimmel, Jiri Misurec
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

This paper deals with an analytic solution of spectrum changes that appear in nonlinear discrete systems without memory whose transfer characteristics can be approximated via a piecewise-linear function. Such systems appear frequently in digital audio signal processing, for example in the case of signal saturation, overflow, elimination of denormal numbers, etc. The paper also deals with relations between the mutual ratio of amplitudes of the higher harmonics produced and the approximation parameters.
Quantitative evaluation between rival planning systems with dosimetric indices
Authors: Pei-Ju Chao, Tsair-Fwu Lee, Te-Jen Su, Fu-Min Fang
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

To evaluate and quantify the potential dosimetric gains of two intensity-modulated radiotherapy (IMRT) modalities for head-and-neck (H&N) tumor cases with PET/CT images guided target volume delineation. Twenty patients curatively treated by PS1 were examined. Dose plans were compared using dose volume histograms (DVH), conformity index (CI) and homogeneity index (HI) of the planned target volume (PTV) and improvement ratios of CI and HI. A dosimetric gain in conformity and homogeneity of PTV and sparing of OARs was significantly obtained in PS1 versus PS2 plans in the study cohort. Whether such dosimetric superiority in PS1 could transfer into clinical advantages needs further investigation.
Fighting spam, phishing, and online scams at the network level
Authors: Nick Feamster
Venue: Proceedings of the 4th Asian Conference on Internet Engineering (2008)

Recent estimates indicate that upwards of 90% of all email traffic is spam [4]. Spam is more than just a nuisance: it consumes resources on the network and at mail servers, and much of it is also used to mount attacks on users via malware and social engineering attacks (e.g., phishing). In recent years, spammers have increased their virulence, by sending spam from large collections of compromised machines ("botnets"), encapsulating their messages in content that is difficult to filter (e.g., images), and by targeting their messages towards specific groups of users. Indeed, spammers show no sign of slowing, and, worse, their techniques may carry over to other domains (e.g., VoIP, mobile devices) in the future.
Self-adaptive Wheel-side Independent Driving System with Active Suspension
Authors: Wei Chen, Xin-hui Liu
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

A new traction-balanced driving vehicle steering in complicated cross country terrains was developed to improve the synchronous driving vehicle steering in complicated terrains low traction efficiency. The vehicle driving system traction-balanced was achieved through hydraulic-resistance control technology applied to the single-side wheel-side hydraulic driving motor and securing the tyro grounding by hydraulic active suspension. The semi-rail vehicle driving system model was set up based on the methods of estimating wheel–terrain contact angles of mobile robots using simple on-board sensors and principle of the pump-control-motor. The simulation showed that when the wheel grounding was secured, the vehicle traction efficiency was improved with the hydraulic-resistance control in different complicated terrains and the vehicle cross-country performance was improved further.
Accelerating Face Detection by Using Depth Information
Authors: Haiyuan Wu, Kazumasa Suzuki, Toshikazu Wada, Qian Chen
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

In the case that the sizes of faces are not available, all possible sizes of faces have to be assumed and a face detector has to classify many (often ten or more) sub-image regions everywhere in an image. This makes the face detection slow and the high false positive rate. This paper explores the usage of depth information for accelerating the face detection and reducing the false positive rate at the same time. In detail, we use the depth information to determine the size of the sub-image region that needs to be classified for each pixel. This will reduce the number of sub-image regions that need to be classified from many to one for one position (pixel) in an image. Since most unnecessary classifications are effectively avoided, both the processing time for face detection and the possibility of false positive can be reduced greatly. We also propose a fast algorithm for estimating the depth information that is used to determine the size of sub-image regions to be classified.
Supporting multiple protection strategies in optical networks
Authors: Srinivasan Ramasubramanian
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

This paper develops a framework to support multiple protection strategies in optical networks, which is in general applicable to any connection-oriented network. The capacity available on a link for routing primary and backup connections are computed depending on the protection strategy. The paper also develops a model for computing service outage and failure recovery times for a connection where notifications of failure location are broadcast in the network. The effectiveness of employing multiple protection strategies is established by studying the performance of three networks for traffic with four types of protection requirement.