ppxscal/embedding_network huggingface dataset:
Hiding Information in Region-Based Wet Images
Authors: Chin-Chen Chang, Kuo-Nan Chen, Chin-Feng Lee, Zhi-Hui Wang
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

In most data-hiding schemes, the area of interest in the cover image cannot be protected from being modified. In this paper, we propose a data-hiding scheme in which the changeable and unchangeable pixels can be specified by the data-hider. To reduce the size of extra information, the location map used to depict the location information of changeable and unchangeable pixels is compressed by Run Length Coding (RLC) or by Huffman coding. Therefore, only a little additional information, a private key, is needed to depict the changeable pixels in which the Run Length code or the Huffman code is embedded. The experimental results show that our proposed scheme can efficiently embed and successfully extract the secret information.
Effects of animation, user-controlled interactions, and multiple static views in understanding 3D structures
Authors: Taylor Sando, Melanie Tory, Pourang Irani
Venue: Proceedings of the 6th Symposium on Applied Perception in Graphics and Visualization (2009)

Visualizations of 3D spatial structures use various techniques such as user controlled interactions or 2D projection views to convey the structure to users. Researchers have shown that motion cues can help assimilate the structure of 3D spatial data, particularly for discerning occluded parts of the objects. However, motion cues or smooth animations also have costs - they increase the viewing time. What remains unclear is whether any one particular viewing time. What remains unclear is whether any one particular viewing modality allows users to understand and operate on the 3D structure as effectively as a combination of 2D and 3D static views. To assess the effectiveness of understanding 3D structures, we carried out three experiments. In all three experiments we evaluated the effectiveness of perceiving 3D structures with either self controlled interactions, animated transitions, and 2D+3D static views. In the first experiment, subjects were given a task to estimate the relative distances of objects in a 3D scene. In the second experiment, subjects made judgements to discern and identify the existence of differences between 3D objects. In the third experiment, participants were required to reconstruct a 3D spatial structure based on the 3D models presented to them. Results of the three experiments reveal that participants were more accurate and performed the spatial tasks faster with smooth animations and self-controlled interactions than with 2D+3D static views. Our results overall suggest that the costs involved in interacting or animating a 3D spatial structure are significantly outweighed by the perceptual benefits derived from viewing and interacting in these modes of presentation.
Low Cost Flexible Wrist Touch UI Solution
Authors: Bin Wang, Chenguang Cai, Emilia Koskinen, Tang Zhenqi, Huayu Cao, Leon Xu, Antti O. Salo
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

Wrist device is an interesting and convenient user interaction method between a user and a mobile communication device. This paper presents a low cost flexible wrist device user interaction solution based on flexible touch screen technology. We mainly focused on the 2 aspects: one is the user study to understand what requirements of the wrist UI the users demand; and another is how to realize the specific UI solutions that the users demand. Base on user study report from NRC Helsinki and Beijing, we adopt 3x3 matrix resistance touch panel module and 2-color flexible LCD module as the user interaction hardware solution.
The effects of task characteristics on online discussion
Authors: Robert L. Jorczak
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

A key guidance factor of computer supported collaborative learning (CSCL) is the specification of a discussion task. Aspects of the discussion task may affect the quality of group discussion for higher-order learning. This experiment investigated the effects of two aspects of discussion task on asynchronous text discussion of an online higher-education course. Groups completed discussion assignments that varied in degree of task context and outcome specification. Content analysis was used to assess conceptual conflict and level of information processing of online messages. Results indicate that conceptual conflict is associated with higher-order discussion, but differences in task context and product do not have large effects on the quantity or quality of online discussion.
Accelerating Particle Swarm Optimization Algorithms Using Gaussian Process Machine Learning
Authors: Guoshao Su
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

A novel optimization framework (GP-PSO) based on Gaussian process (GP) machine learning and Particle Swarm Optimization (PSO) algorithm is presented in this paper for solving computationally expensive optimization problem. Gaussian process is used to predict the most promising solutions before searching the global optimum solution using PSO during each iteration step. The case study result indicates GP-PSO algorithm clearly outperforms standard PSO algorithm with much less fitness evaluations on benchmark functions. The result of application to a real-world engineering problem also suggests that the proposed optimization framework is capable of solving computationally expensive optimization problem effectively.
Esense: communication through energy sensing
Authors: Kameswari Chebrolu, Ashutosh Dhekne
Venue: Proceedings of the 15th annual international conference on Mobile computing and networking (2009)

In this paper, we present Esense: a new paradigm of communication between devices that have fundamentally different physical layers. The same communication framework also works between devices that have the same physical layer, which are out of communication range but within carrier-sense range. Esense is based on sensing and interpreting energy profiles. While our ideas are generic enough to be applicable in a variety of contexts, we illustrate the usefulness of our ideas by presenting novel solutions to existing problems in three distinct research domains. As part of these solutions, we demonstrate the ability to communicate between devices that follow two different standards: IEEE 802.11 and 802.15.4. We build an ``alphabet set'': a set of signature packet sizes which can be used for Esense. For this, we take a measurement based approach by considering WiFi traces from actual deployments. We then analyze the channel activity resulting from these traces and build an appropriate alphabet set for Esense communication. Our results show that we could potentially construct an alphabet of size as high as 100; such a large alphabet size promises efficient Esense communication. We also validate this alphabet set via a prototype implementation, and show that effective communication is indeed feasible even when both sides use different physical layers.
Efficient algorithms for mining constrained frequent patterns from uncertain data
Authors: Carson Kai-Sang Leung, Dale A. Brajczuk
Venue: Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data (2009)

Mining of frequent patterns is one of the popular knowledge discovery and data mining (KDD) tasks. It also plays an essential role in the mining of many other patterns such as correlation, sequences, and association rules. Hence, it has been the subject of numerous studies since its introduction. Most of these studies find all the frequent patterns from collection of precise data, in which the items within each datum or transaction are definitely known and precise. However, there are many real-life situations in which the user is interested in only some tiny portions of these frequent patterns. Finding all frequent patterns would then be redundant and waste lots of computation. This calls for constrained mining, which aims to find only those frequent patterns that are interesting to the user. Moreover, there are also many reallife situations in which the data are uncertain. This calls for uncertain data mining. In this paper, we propose an algorithm to efficiently find constrained frequent patterns from collections of uncertain data.
Learning with probabilistic features for improved pipeline models
Authors: Razvan C. Bunescu
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

We present a novel learning framework for pipeline models aimed at improving the communication between consecutive stages in a pipeline. Our method exploits the confidence scores associated with outputs at any given stage in a pipeline in order to compute probabilistic features used at other stages downstream. We describe a simple method of integrating probabilistic features into the linear scoring functions used by state of the art machine learning algorithms. Experimental evaluation on dependency parsing and named entity recognition demonstrate the superiority of our approach over the baseline pipeline models, especially when upstream stages in the pipeline exhibit low accuracy.
Non-Well-Founded Probabilities and Coinductive Probability Logic
Authors: Andrew Schumann
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

Abstract—One of the most useful computer algebra used today is calgebra and its versions, e.g. stream calculus. In the paper I show that p-adic arithmetic can be regarded as one of the natural interpretation of stream calculus on a finite set of positive integers. Further, I define probabilities on streams using bisimulation and construct probability logic with non-wellfounded syntax and non-well-founded semantics.
Conceptual Modeling of Systems Integration Requirements
Authors: Narasimha Bolloju
Venue: IEEE Software (2009)

Although information systems integration is an important and ongoing activity in organizations with large IT infrastructures, there is no conceptual modeling technique especially designed to help systems analysts and integrators elicit, represent, and analyze enterprise-wide integration requirements. The proposed modeling technique contains a set of constructs and a method for developing enterprise-wide integration requirement models. Students in a graduate-level course on systems integration evaluated this technique by applying it in 20 different team projects. The findings of this evaluation indicate that the bottom-up method is structured and easy to follow, and that the modeling constructs are easy to comprehend and use.
Study on Detection of SF6 Gas Leakage Based on Photoacoustic Spectrometry
Authors: Yuanzhe Xu, Hongjing Zhou, Bo Li, Xin Zhao
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

In view of the problems of using traditional monitoring method for SF6 gas leakage in electrical equipments, according to the photoacoustic spectrometry technology, the photoacoustic spectrometry experiment system is designed for detecting SF6 gas concentration. The generation of photoacoustic spectrum is presented, the photoacoustic technique is used to survey the photoacoustic characteristic of SF6 molecule at 10.6 μm wavelength, resonance frequency of PA cell is determined. The detection sensitivity can reach 0.12×10-9 under standard atmospheric pressure. The results show that the system could detect the SF6 gas concentration accurately and reliably, it has a lot of advantages and the widespread application value and prospect.
Cultural dialects of real and synthetic emotional facial expressions
Authors: Zs&#x00f3;fia Ruttkay
Venue: AI Society (2009)

In this article we discuss the aspects of designing facial expressions for virtual humans (VHs) with a specific culture. First we explore the notion of cultures and its relevance for applications with a VH. Then we give a general scheme of designing emotional facial expressions, and identify the stages where a human is involved, either as a real person with some specific role, or as a VH displaying facial expressions. We discuss how the display and the emotional meaning of facial expressions may be measured in objective ways, and how the culture of displayers and the judges may influence the process of analyzing human facial expressions and evaluating synthesized ones. We review psychological experiments on cross-cultural perception of emotional facial expressions. By identifying the culturally critical issues of data collection and interpretation with both real and VHs, we aim at providing a methodological reference and inspiration for further research.
WebGIS Resolution for Management Information System of Disaster Prevention
Authors: Chen Yanhua, Su Youpo, Liu Weiwei
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Data share and publication of disaster prevention information is in urgent need, and WebGIS resolution of management information system (MIS) is the main problems for Internet publication. Through analyzing the technique function of WebGIS and the character of information publication, management information system of disaster prevention is investigated. The system application is developed based on MapXtreme in Windows 2000 Server operating system, the real-time browse in client and real-time publication of disaster prevention information in server are achieved. In order to improve the speed of data transmitting through Internet, ASP technique is combined with ActiveX controls. System application is developed with network language VBScript and JavaScript under the ASP environment. As an example application, MIS of disaster prevention for Internet publication in Tangshan City is worked out; Finally, some advice is proposed for the development of Internet publication system based on WebGIS.
The Non-linear Analysis of Beams Strengthened by Steel Plate
Authors: Xianmin Li, Yajun Zhao
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

Recently, the technology of steel bars and concrete plays an important role in the development of building construction, in this paper, calculation methods of cracking moment, ultimate moment, and stiffness of the beams strengthened by steel plate are offered according to the non-linear relationship between stress and strain of concrete, the theoretical and experimental results are compared and analyzed. In addition, the proposals of checking the separating stress, anchorage length, strong shearing and weak bending are supposed so as to ensure the beams strengthened by steel plate could fail because of bending.
Real-Time Stereo Vision: Making More Out of Dynamic Programming
Authors: Jan Salmen, Marc Schlipsing, Johann Edelbrunner, Stefan Hegemann, Stefan Lüke
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

Dynamic Programming (DP) is a popular and efficient method for calculating disparity maps from stereo images. It allows for meeting real-time constraints even on low-cost hardware. Therefore, it is frequently used in real-world applications, although more accurate algorithms exist. We present a refined DP stereo processing algorithm which is based on a standard implementation. However it is more flexible and shows increased performance. In particular, we introduce the idea of multi-path backtracking to exploit the information gained from DP more effectively. We show how to automatically tune all parameters of our approach offline by an evolutionary algorithm. The performance was assessed on benchmark data. The number of incorrect disparities was reduced by 40 % compared to the DP reference implementation while the overall complexity increased only slightly. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
An Approximation Scheme for Terrain Guarding
Authors: Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi Varadarajan
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algorithm inspired by the recent results of Chan and Har-Peled [2] and Mustafa and Ray [15]. Our key contribution is to show the existence of a planar graph that appropriately relates the local and global optimum.
High-Performance Local Search for Solving Real-Life Inventory Routing Problems
Authors: Thierry Benoist, Bertrand Estellon, Frédéric Gardi, Antoine Jeanjean
Venue: Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (2009)

In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a long-term horizon, is a generalization of the vehicle routing problem with vendor managed inventory replenishment. The particularity of this problem is that the vendor monitors the customers' inventories, deciding when and how much each inventory should be replenished by routing tank trucks. Thus, the objective of the vendor is to minimize the logistic cost of the inventory replenishment for all customers over the long run. Then, an original local-search heuristic is presented for solving the short-term planning problem. The engineering of this algorithm follows the three-layers methodology for "high-performance local search" recently introduced by some of the authors. A computational study demonstrates that our solution is both effective, efficient and robust, providing long-term savings exceeding 20 % on average, compared to solutions computed by expert planners or even a classical greedy algorithm. The resulting software is now exploited in North America by one of the French industry leaders.
The total Turing test and the Loebner prize
Authors: David M. W. Powers
Venue: Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning (1998)

The Loebner Prize is the first, and only regular, competition based on the Turing Test, but in order to stage the competition various modifications to the original test have been made. In particular, the Grand Prize has a controversial and as yet undefined Audio-Visual condition attached to it. This paper discusses the value of the test with and without the A/V condition, and makes a proposal about what the general nature of the A/V test should be.
Evaluating Centering for sentence ordering in two new domains
Authors: Nikiforos Karamanis
Venue: Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX (2006)

This paper builds on recent research investigating sentence ordering in text production by evaluating the Centering-based metrics of coherence employed by Karamanis et al. (2004) using the data of Barzilay and Lapata (2005). This is the first time that Centering is evaluated empirically as a sentence ordering constraint in several domains, verifying the results reported in Karamanis et al.
Programmable and Scalable Architecture for Graphics Processing Units
Authors: Carlos S. Lama, Pekka Jääskeläinen, Jarmo Takala
Venue: Proceedings of the 9th International Workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2009)

Graphics processing is an application area with high level of parallelism at the data level and at the task level. Therefore, graphics processing units (GPU) are often implemented as multiprocessing systems with high performance floating point processing and application specific hardware stages for maximizing the graphics throughput.In this paper we evaluate the suitability of Transport Triggered Architectures (TTA) as a basis for implementing GPUs. TTA improves scalability over the traditional VLIW-style architectures making it interesting for computationally intensive applications. We show that TTA provides high floating point processing performance while allowing more programming freedom than vector processors.Finally, one of the main features of the presented TTA-based GPU design is its fully programmable architecture making it suitable target for general purpose computing on GPU APIs which have become popular in recent years.
Minimal mental models
Authors: David V. Pynadath, Stacy C. Marsella
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Agents must form and update mental models about each other in a wide range of domains: team coordination, plan recognition, social simulation, user modeling, games of incomplete information, etc. Existing research typically treats the problem of forming beliefs about other agents as an isolated subproblem, where the modeling agent starts from an initial set of possible models for another agent and then maintains a belief about which of those models applies. This initial set of models is typically a full specification of possible agent types. Although such a rich space gives the modeling agent high accuracy in its beliefs, it will also incur high cost in maintaining those beliefs. In this paper, we demonstrate that by taking this modeling problem out of its isolation and placing it back within the overall decision-making context, the modeling agent can drastically reduce this rich model space without sacrificing any performance. Our approach comprises three methods. The first method clusters models that lead to the same behaviors in the modeling agent's decision-making context. The second method clusters models that may produce different behaviors, but produce equally preferred outcomes with respect to the utility of the modeling agent. The third technique sacrifices a fixed amount of accuracy by clustering models that lead to performance losses that are below a certain threshold. We illustrate our framework using a social simulation domain and demonstrate its value by showing the minimal mental model spaces that it generates.
Frequency Modulation Based Vibrotactile Device for Teleoperation
Authors: H. Phong Pham, Ryad Chellali
Venue: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology (2009)

This study investigated how people achieve pointing and path following tasks using a vibrotactile device. In pointing tasks, subjects are asked to reach a target as fast as possible guided by two types of tactile information generated by a specific glove we developed. The first type of information is a constant vibrating stimulation and the second one is a frequency modulation based vibration. A comparison using the visual channel when performing the same task is done is presented. For each modality, two experiments were performed. The first one is 1D: the subjects reach a target situated on a line. The second one is 2D and the target is in the horizontal plane. The results we obtained showed that tactile based pointing tasks obey to the classical Fitts’ law. Furthermore, we show that the frequency modulation based vibration mode is more useful than the constant one for pointing tasks. In path following experiments, we have a comparison between global and local visual feedback. Results show that in case of lacking global spatial information, vibrotactile feedback can give similar performance as visual feedback.