ppxscal/embedding_network huggingface dataset:
Using LiDAR Data Visualization to Investigate Origin of Uphill-Facing Scarps in Mountains, Alaska
Authors: Zhiyong Li, Zuoxun Zeng, Ronald L. Bruhn
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Light Detection and Ranging (LIDAR) is a fast method for sampling the earth’s surface with a high density and high accuracy point cloud that is used to generate high density and high accuracy Digital Elevation Models (DEMs) and DSMs. In this research we obtained airborne LIDAR elevation data with spatial resolution of 1 m to reveal new details of mountain block morphology and structure to investigate the origin of uphill facing scarps. Quaternary fault scarps occur in several mountain blocks in the western Saint Elias and Eastern Chugach Mountains of southern Alaska. Possible mechanisms for formation of these scarps include deformation caused by active folding, or deformation caused by gravitational loading and strong ground motion during earthquakes. The field observations and LIDAR visualization lead us to propose a three-stage model for flexural toppling. Failure is by flexural toppling, with rotation and shearing of bedding planes under the influence of gravity where bedding dips steeply into the mountain side. Down-slope bending of bedding surfaces may initiate formation of a basal sliding surface beneath the toppled beds, leading to landsliding down slope. However, horizontal acceleration caused by strong ground motion enhances the probability of failure by flexural toppling, especially in the upper parts of mountain slopes, where ground motion is amplified.
Studying the effect of interaction analysis indicators on students' selfregulation during asynchronous discussion learning activities
Authors: Tharrenos Bratitsis, Angelique Dimitracopoulou
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

Selfregulation has become an important research subject during the past 20 years, especially in Technology Enhanced Learning approaches, following student-centered strategies. When designing learning activities under this scope, in a social context, the need for building supporting tools for the participants of such activities has been highlighted. We have implemented such tools, by applying Interaction Analysis (IA) techniques, in order to support the participants of asynchronous discussion learning activities. In this paper we study the effects of IA indicators on students' selfregulation. We present research findings from several implemented case studies, in order to confirm our hypothesis, that such supporting tools indeed facilitate students' selfregulation, as it was shown both quantitatively and qualitatively, thus enhancing the overall activity, as well as the collaborative process itself.
Volume Computation for Boolean Combination of Linear Arithmetic Constraints
Authors: Feifei Ma, Sheng Liu, Jian Zhang
Venue: Proceedings of the 22nd International Conference on Automated Deduction (2009)

There are many works on the satisfiability problem for various logics and constraint languages, such as SAT and Satisfiability Modulo Theories (SMT). On the other hand, the counting version of decision problems is also quite important in automated reasoning. In this paper, we study a counting version of SMT, i.e., how to compute the volume of the solution space, given a set of Boolean combinations of linear constraints. The problem generalizes the model counting problem and the volume computation problem for convex polytopes. It has potential applications to program analysis and verification, as well as approximate reasoning, yet it has received little attention. We first give a straightforward method, and then propose an improved algorithm. We also describe two ways of incorporating theory-level lemma learning technique into the algorithm. They have been implemented, and some experimental results are given. Through an example program, we show that our tool can be used to compute how often a given program path is executed.
Efficient Set Similarity Joins Using Min-prefixes
Authors: Leonardo A. Ribeiro, Theo Härder
Venue: Proceedings of the 13th East European Conference on Advances in Databases and Information Systems (2009)

Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similarity joins are commonly used to implement this operation; they scale to large datasets and are versatile to represent a variety of similarity notions. Most set similarity join methods proposed so far present two main phases at a high level of abstraction: candidate generation producing a set of candidate pairs and verification applying the actual similarity measure to the candidates and returning the correct answer. Previous work has primarily focused on the reduction of candidates, where candidate generation presented the major effort to obtain better pruning results. Here, we propose an opposite approach. We drastically decrease the computational cost of candidate generation by dynamically reducing the number of indexed objects at the expense of increasing the workload of the verification phase. Our experimental findings show that this trade-off is advantageous: we consistently achieve substantial speed-ups as compared to previous algorithms.
Display considerations for night and low-illumination viewing
Authors: Rafał Mantiuk, Allan G. Rempel, Wolfgang Heidrich
Venue: Proceedings of the 6th Symposium on Applied Perception in Graphics and Visualization (2009)

An inadequately designed display viewed in the dark can easily cause dazzling glare and affect our night vision. In this paper we test a display design in which the spectral light emission is selected to reduce the impact of the display on night vision performance while at the same time ensuring good display legibility. We use long-wavelength light (red) that is easily visible to daylight vision photoreceptors (cones) but almost invisible to night vision photoreceptors (rods). We verify rod-cone separation in a psychophysical experiment, in which we measure contrast detection in the presence of a colored source of glare. In a separate user study we measure the range of display brightness settings that provide good legibility and are not distracting under low ambient lighting. Our results can serve as a guidelines for designing the displays that change their color scheme at low ambient light levels.
Centralized, distributed or something else? making timely decisions in multi-agent systems
Authors: Tim Harbers, Rajiv T. Maheswaran, Pedro Szekely
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

In multi-agent systems, agents need to share information in order to make good decisions. Who does what in order to achieve this matters a lot. The assignment of responsibility influences delay and consequently affects agents' abilities to make timely decisions. It is often unclear which approaches are best. We develop a model where one can easily test the impact of different assignments and information sharing protocols by focusing only on the delays caused by computation and communication. Using the model, we obtain interesting results that provide insight about the types of assignments that perform well in various domains and how slight variations in protocols can make great differences in feasibility.
Detection of distributed steganographic information in social networks
Authors: Alfonso Muñoz Muñoz, Justo Carracedo Gallardo, Sergio Sánchez García
Venue: Proceedings of the 2008 Euro American Conference on Telematics and Information Systems (2008)

The peak of the new communications and social interactions through the Web makes less effective the use of classic automated tools of data acquisition. The massive appearance of authentication mechanisms, closed groups of users and, especially, mechanisms like captchas, makes really complex that automated tools can, in a simple manner, compile information and analyze it later. This paper reasons out how the characteristics of the present social networks can facilitate the presence of steganographic information. SDA steganalysis architecture is shown. SDA is composed of different tools to solve, as far as possible, the commented analysis problems. The paper emphasizes one tool, DCST, adapted to the steganalysis of Web content, mainly dynamic, typically present in the new social networks.
The Innovation Architectures of Facebook
Authors: Susan Shepherd Ferebee, James Davis
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

User innovation is enabled through the existence of networks. This article examines the architectures of the social network, Facebook, and provides a theoretical discussion of why and how the architectures of Facebook can support a user innovation environment and what factors of the architectures can improve and enhance innovation.
Private whispers/public eyes: Is receiving highly personal information in a public place stressful?
Authors: Linda Little, Pam Briggs
Venue: Interacting with Computers (2009)

The use of technology to access personal information in public places is increasingly common, but can these interactions induce stress? Sixty-eight participants were led to believe that extremely sensitive personal information would be displayed via either a public or personal handheld device in isolated or crowded (in the presence of strangers) conditions. Stress responses were taken in terms of heart rate, galvanic skin response and subjective ratings. As anticipated, participants showed stronger stress reactions in the crowded rather than the isolated conditions and also experienced greater stress when the information was presented on a public screen in comparison to a personal handheld device. Implications for the design of public/private information systems are discussed.
Business Process Aware IS Change Management in SMEs
Authors: Janis Makna
Venue: Proceedings of the 13th East European Conference on Advances in Databases and Information Systems (2009)

Changes in the business process usually require changes in the computer supported information system and, vice versa, changes in the information system almost always cause at least some changes in the business process. In many situations it is not even possible to detect which of those changes are causes and which of them are effects. Nevertheless, it is possible to identify a set of changes that usually happen when one of the elements of the set changes its state. These sets of changes may be used as patterns for situation analysis to anticipate full range of activities to be performed to get the business process and/or information system back to the stable state after it is lost because of the changes in one of the elements. Knowledge about the change pattern gives an opportunity to manage changes of information systems even if business process models and information systems architecture are not neatly documented as is the case in many SMEs. Using change patterns it is possible to know whether changes in information systems are to be expected and how changes in information systems activities, data and users will impact different aspects of the business process supported by the information system.
From bottom-Up visual attention to robot action learning
Authors: Yukie Nagai
Venue: Proceedings of the 2009 IEEE 8th International Conference on Development and Learning (2009)

This research addresses the challenge of developing an action learning model employing bottom-up visual attention. Although bottom-up attention enables robots to autonomously explore the environment, learn to recognize objects, and interact with humans, the instability of their attention as well as the poor quality of the information detected at the attentional location has hindered the robots from processing dynamic movements. In order to learn actions, robots have to stably attend to the relevant movement by ignoring noises while maintaining sensitivity to a new important movement. To meet these contradictory requirements, I introduce mechanisms for retinal filtering and stochastic attention selection inspired by human vision. The former reduces the complexity of the peripheral vision and thus enables robots to focus more on the currently-attended location. The latter allows robots to flexibly shift their attention to a new prominent location, which must be relevant to the demonstrated action. The signals detected at the attentional location are then enriched based on the spatial and temporal continuity so that robots can learn to recognize objects, movements, and their associations. Experimental results show that the proposed system can extract key actions from human action demonstrations.
The Oil Viscous Force Measurement System Based on Embedded System
Authors: Jingwen Tian, Shiru Zhou, Meijuan Gao
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

An oil viscous force measurement system using the pulling and separating method based on embedded system is designed in this paper, ARM9 core S3C2410 chip was used as the kernel control unit of this measurement system. The high-precision strain gauge weight measurement is designed to weigh the liquid, and the viscous force can be computed according to the change of the liquid weight in pulling and separating process. The paper mainly focused on the design of the measurement and the temperature compensation methods, and the recurrent neural networks is used to compute the temperature compensation of weight measurement. The experimental results show that this system has good measurement accuracy, and this system can be used to measure automatically, in order to reduce the manual errors interference.
Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs
Authors: Richard Garner, Tom Hirschowitz, Aurélien Pardon
Venue: Proceedings of the 20th International Conference on Concurrency Theory (2009)

This paper investigates the use of symmetric monoidal closed (smc) structure for representing syntax with variable binding, in particular for languages with linear aspects. In this setting, one first specifies an smc theory ${\mathcal{T}}$, which may express binding operations, in a way reminiscent from higher-order abstract syntax (hoas). This theory generates an smc category $S ({\mathcal{T}}$ whose morphisms are, in a sense, terms in the desired syntax. We apply our approach to Jensen and Milner's (abstract binding) bigraphs, in which processes behave linearly, but names do not. This leads to an alternative category of bigraphs, which we compare to the original.
An MPI-1 Compliant Thread-Based Implementation
Authors: J. C. Díaz Martín, J. A. Rico Gallego, J. M. Álvarez Llorente, J. F. Perogil Duque
Venue: Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2009)

This work presents AzequiaMPI, the first full compliant implementation of the MPI-1 standard where the MPI node is a thread. Performance comparisons with MPICH2-Nemesis show that thread-based implementations exploit adequately the multicore architectures under oversubscription, what could make MPI competitive with OpenMP-like solutions.
Investigating Landscape Topology for Subpopulation Differentiation in Genetic Chromodynamics
Authors: Ruxandra Stoean, Catalin Stoean, D. Dumitrescu
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

Evolutionary algorithms for multimodal optimizationare usually radius dependent in subpopulation formationand dynamics. The appropriate setting of a value to cover such a fluctuant threshold (as a result of variously shaped attraction basins) strongly relies upon the knowledge on the problem at hand or the extensive skill in manual parameter tuning. If several thresholds model the disposal of species with the many attraction basins, radii setting significantly increases in complexity. Geneticchromodynamics is one such recent, competent technique, whose performance is practically affected by the existence of such key parameters. It is hence the purpose of present paper to present an enhanced alternative to radii maintenance within this method, by embedding a mechanism to examine the fitness landscape and detect the attractors, around which these species revolve.
Processing publish/subscribe queries over distributed data streams
Authors: Oana Jurca, Sebastian Michel, Alexandre Herrmann, Karl Aberer
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

We address the problem of processing continuous multi-join queries, over distributed data streams, making use of existing work in the field of publish/subscribe systems. We show how these principles can be ported to data streams, by enriching the common query model with location dependent attributes. Users can subscribe to a set of sensor attributes, a service that requires processing multi-join correlation queries. The goal is to decrease the overall network traffic consumption by removing redundant subscriptions and eliminating unrequested events close to the publishing sensors. This is non-trivial, especially in the presence of multi-join queries without any central control mechanism. Our approach is based on the concept of filter-split-forward phases for efficient subscription filtering and placement inside the network. We report on a performance evaluation using a real-world dataset, showing the suitability of our approach to reduce the overall data traffic.
Constructive Dimension and Turing Degrees
Authors: Laurent Bienvenu, David Doty, Frank Stephan
Venue: Theory of Computing Systems (2009)

This paper examines the constructive Hausdorff and packing dimensions of Turing degrees. The main result is that every infinite sequence S with constructive Hausdorff dimension dim&#x2009;H(S) and constructive packing dimension dim&#x2009;P(S) is Turing equivalent to a sequence R with dim&#x2009;H(R)&#x2265;(dim&#x2009;H(S)/dim&#x2009;P(S))&#x2212;&#x03b5;, for arbitrary &#x03b5;>0. Furthermore, if dim&#x2009;P(S)>0, then dim&#x2009;P(R)&#x2265;1&#x2212;&#x03b5;. The reduction thus serves as a randomness extractor that increases the algorithmic randomness of S, as measured by constructive dimension. A number of applications of this result shed new light on the constructive dimensions of Turing degrees. A lower bound of dim&#x2009;H(S)/dim&#x2009;P(S) is shown to hold for the Turing degree of any sequence S. A new proof is given of a previously-known zero-one law for the constructive packing dimension of Turing degrees. It is also shown that, for any regular sequence S (that is, dim&#x2009;H(S)=dim&#x2009;P(S)) such that dim&#x2009;H(S)>0, the Turing degree of S has constructive Hausdorff and packing dimension equal to 1. Finally, it is shown that no single Turing reduction can be a universal constructive Hausdorff dimension extractor, and that bounded Turing reductions cannot extract constructive Hausdorff dimension. We also exhibit sequences on which weak truth-table and bounded Turing reductions differ in their ability to extract dimension.
This Is Who I Am and This Is What I Do: Demystifying the Process of Designing Culturally Authentic Technology
Authors: Wanda Eugene, Leshell Hatley, Kyla Mcmullen, Quincy Brown, Yolanda Rankin, Sheena Lewis
Venue: Proceedings of the 3rd International Conference on Internationalization, Design and Global Development: Held as Part of HCI International 2009 (2009)

The goal of this paper is to bridge the gap between existing frameworks for the design of culturally relevant educational technology. Models and guidelines that provide potential frameworks for designing culturally authentic learning environment are explained and transposed into one comprehensive design framework, understanding that integrating culture into the design of educational technology promotes learning and a more authentic user experience. This framework establishes principles that promote a holistic approach to design.
In-Game Peer Performance Assessment Role That Fosters Metacognitive Agility and Reflection
Authors: Elaine M. Raybourn
Venue: Proceedings of the 8th International Conference on Entertainment Computing (2009)

In this paper we describe the development of a method and system for training metacognitive agility (self-awareness and self-regulated learning) in serious games applications. We introduce a unique design that features a novel role for real-time, in-game peer performance assessment and feedback to encourage user reflection and self-explanation. This approach has been implemented in two serious games currently in use today whose focus is intercultural competence and intercultural sensitivity education.
Secure Interoperation in Multidomain Environments Employing UCON Policies
Authors: Jianfeng Lu, Ruixuan Li, Vijay Varadharajan, Zhengding Lu, Xiaopu Ma
Venue: Proceedings of the 12th International Conference on Information Security (2009)

Ensuring secure interoperation in multidomain environments based on role based access control (RBAC) has drawn considerable research works in the past. However, RBAC primarily consider static authorization decisions based on subjects' permissions on target objects, and there is no further enforcement during the access. Recently proposed usage control (UCON) can address these requirements of access policy representation for temporal and time-consuming problems. In this paper, we propose a framework to facilitate the establishment of secure interoperability in multidomain environments employing Usage Control (UCON) policies. In particular, we propose an attribute mapping technique to establish secure context in multidomain environments. A key challenge in the establishment of secure interoperability is to guarantee security of individual domains in presence of interoperation. We study how conflicts arise and show that it is efficient to resolve the security violations of cyclic inheritance and separation of duty.
Cell AT-Models for Digital Volumes
Authors: Pedro Real, Helena Molina-Abril
Venue: Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition (2009)

In [4], given a binary 26-adjacency voxel-based digital volume V, the homological information (that related to n-dimensional holes: connected components, "tunnels" and cavities) is extracted from a linear map (called homology gradient vector field) acting on a polyhedral cell complex P(V) homologically equivalent to V. We develop here an alternative way for constructing P(V) based on homological algebra arguments as well as a new more efficient algorithm for computing a homology gradient vector field based on the contractibility of the maximal cells of P(V).