ppxscal/embedding_network huggingface dataset:
Geo-spatial Data Analysis, Quality Assessment and Visualization
Authors: Yong Ge, Bai Hexiang, Sanping Li
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

As GIS and Remote Sensing technologies develops rapidly, they provide the strong technical support for multi-level geo-spatial data acquisition. However, serious lag of spatial analysis technology leads to the "data explosion but knowledge poverty". At the same time, the lack of quality assessment means allows users to doubt the reliability of colourful "high-tech" geospatial products. This paper would propose an advanced and integrated architecture to establish the relations between spatial data analysis, the uncertainty and reliability of geo-spatial data in terms of geo-spatial data processing flow. This provides a quality assessment for geo-spatial analysis outcome from multi-source information fusion and integration, and a support for decision maker based on the reliability. Furthermore, geo-visualization technology would help people intuitively know the quantity, distribution, spatial structure and tendency of uncertainty of geo-spatial data and information. A case study is followed to describe the framework.
A Sufficient Condition for Uniform Convergence of Stationary p-Subdivision Scheme
Authors: Yi-Kuan Zhang, Ke Lu, Jiangshe Zhang, Xiaopeng Zhang
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

Subdivision is a convenient tool to construct objective curves and surfaces directly from given scattered points. Stationary p-subdivision schemes are highly efficient in the acquisitions of curve/surface points in shape modeling. The features of supported set of nonnegative mask of uniform convergent stationary subdivision schemes are important to their theoretic researches and applications. According to the properties of supported set of the nonnegative mask, a sufficient condition for uniform convergence of stationary p-subdivision scheme is presented. This condition is proved with two propositions and spline function. The contribution of this work is that the convergence of a stationary p-subdivision scheme can be judged directly. This direct judge is in favor of applications of this scheme.
Task Learning Based on Reinforcement Learning in Virtual Environment
Authors: Tadashi Tsubone, Kenichi Kurimoto, Koichi Sugiyama, Yasuhiro Wada
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

As a novel learning method, reinforced learning by which a robot acquires control rules through trial and error has gotten a lot of attention. However, it is quite difficult for robots to acquire control rules by reinforcement learning in real space because many learning trials are needed to achieve the control rules; the robot itself may lose control, or there may be safety problems with the control objects. In this paper, we propose a method in which a robot in real space learns a virtual task; then the task is transferred from virtual to real space. The robot eventually acquires the task in a real environment. We show that a real robot can acquire a task in virtual space with an input device by an example of an inverted pendulum. Next, we verify availability that the acquired task in virtual space can be applied to a real world task. We emphasize the utilization of virtual space to effectively obtain the real world task.
Pair Correlation Integral for Fractal Characterization of Three-Dimensional Histograms from Color Images
Authors: Julien Chauveau, David Rousseau, François Chapeau-Blondeau
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

The pair correlation integral is used to assess the intrinsic dimensionality of the three-dimensional histogram of RGB color images. For application in the bounded colorimetric cube, this correlation measure is first calibrated on color histograms of reference constructed with integer dimensionality. The measure is then applied to natural color images. The results show that their color histogram tends to display a self-similar structure with noninteger fractal dimension. Such a fractal organization in the colorimetric space can have relevance for image segmentation or classification, or other areas of color image processing.
Does the contingency of agents' nonverbal feedback affect users' social anxiety?
Authors: Sin-Hwa Kang, Jonathan Gratch, Ning Wang, James H. Watt
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

We explored the association between users' social anxiety and the interactional fidelity of an agent (also referred to as a virtual human), specifically addressing whether the contingency of agents' nonverbal feedback affects the relationship between users' social anxiety and their feelings of rapport, performance, or judgment on interaction partners. This subject was examined across four experimental conditions where participants interacted with three different types of agents and a real human. The three types of agents included the Non-Contingent Agent, the Responsive Agent (opposite to the Non-Contingent Agent), and the Mediated Agent (controlled by a real human). The results indicated that people having greater social anxiety would feel less rapport and show worse performance while feeling more embarrassment if they experience the untimely feedback of the Non-Contingent Agent. The results also showed people having more anxiety would trust real humans less as their interaction partners. We discuss the implication of this relationship between social anxiety in a human subject and the interactional fidelity of an agent on the design of virtual characters for social skills training and therapy.
Development of a Tool-Centered Collision Model for Volumetric Resection in ENT Surgery Simulation
Authors: Carina Grühser, Nils Ritter, Gero Strauß, Heiko Maaß, Michel Audette
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

Surgical simulation trains medical residents and surgeons in specific interventions and therefore improves the surgical outcome and reduces operation time. This work focuses on the development of a surgical simulator emulating a tumor resection, whereby 3D tissue mesh resection is implemented. Collision detection algorithms in surgical simulation are not developed to model a changing form of the operating instrument during the operation, which is why tool-centered collision detection is created. One important objective in simulation is clinical realism, and the recruitment of the IOMaster7D, capable of seven degrees of freedom for the dominant hand and six degrees of freedom for the other, allows to synthesize the effect of the Blakesley forceps and the endoscope respectively, as well as provide force feedback.
Task Effects on Interactive Search: The Query Factor
Authors: Elaine G. Toms, Heather O'Brien, Tayze Mackenzie, Chris Jordan, Luanne Freund, Sandra Toze, Emilie Dawe, Alexandra Macnutt
Venue: Focused Access to XML Documents: 6th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2007 Dagstuhl Castle, Germany, December 17-19, 2007. Selected Papers (2008)

The purpose of this research is to examine how search differs according to selected task variables. Three types of task information goals and two types of task structures were explored. This mixed within- and between-subjects designed study had 96 participants complete three of 12 tasks in a laboratory setting using a specialized search system based on Lucene. Using a combination metrics (user perception collected by questionnaires, transaction log data, and characteristics of relevant documents), we assessed the effect of goals and structure on search as demonstrated through queries and their use in interactive searching.
Misleading Performance Reporting in the Supercomputing Field
Authors: David H. Bailey
Venue: Scientific Programming (1992)

In a previous humorous note, I outlined 12 ways in which performance figures for scientific supercomputers can be distorted. In this paper, the problem of potentially misleading performance reporting is discussed in detail. Included are some examples that have appeared in recent published scientific papers. This paper also includes some proposed guidelines for reporting performance, the adoption of which would raise the level of professionalism and reduce the level of confusion in the field of supercomputing.
Lightweight, Semi-automated Enactment of Pragmatic-Reuse Plans
Authors: Reid Holmes, Robert J. Walker
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

Reusing source code in a manner for which it has not been designed (which we term a pragmatic-reuse task) is traditionally regarded as poor practice. The unsystematic nature of these tasks increases the likelihood of a developer pursuing one that is infeasible or choosing not to pursue a feasible one. In previous work, we demonstrated that these risks can be mitigated by providing support to developers to help them systematically investigate and plan pragmatic-reuse tasks. But planning is only a small part of performing a pragmatic-reuse task; to enact a plan, the developer would have to manually extract the code they want to reuse and resolve any errors that arise from removing it from its originating system. This paper describes an approach that semi-automates the process of pragmatic-reuse plan enactment, automatically extracting the reused source code and resolving the majority of compilation errors for the developer through lightweight (i.e., computationally simple but analytically unsound) transformations. By reducing the number of low-level compilation issues (which are typically trivial but copious) that the developer must resolve, they are able to focus on the higher-level semantic and conceptual issues that are the main barrier to the successful completion of the reuse task. The efficacy of our approach to save developer effort is evaluated in a small-scale, controlled experiment on non-trivial pragmatic-reuse tasks. We find that our approach improves the likelihood of a pragmatic reuse task being successful, and decreases the time required to complete these tasks, as compared to a manual enactment approach.
Distributed symbolic reachability analysis
Authors: Gianfranco Ciardo
Venue:  (2007)

Formal verification techniques such as model checking have become widely used in industry for quality assurance, as they can be used to detect design errors early in the product lifecycle. State-space generation, also called reachability analysis, is an essential but very memory-intensive step in model checking. Yet, the increasing complexity of real world systems stresses the most severe limitation of model checking, the state-space explosion problem: the search space can grow exponentially in the size of the targeted systems. Even though the introduction of symbolic state-space encoding techniques, based on Binary Decision Diagrams (BDDs) or Multiway Decision Diagrams (MDDs), helps to cope with this problem, the analysis of many industrial designs still relies on the use of virtual memory. To deal with the large memory requirement of symbolic reachability analysis, in [28], we partitioned MDDs horizontally onto a Network Of Workstations (NOW), and developed a distributed state-space generation algorithm based on the Saturation algorithm introduced in [37], so that the memory required for the state-space encoding is spread onto workstations: each workstation exclusively owns a contiguous range of MDD levels while performing Saturation-style fix-point computation over a NOW. However, this horizontal image slicing scheme comes with a serious tradeoff: it introduces a succinct MDDs partition but makes parallelism more difficult. Since, with Saturation NOW, only one workstation is active at any time, the distributed computation is virtually sequentialized. To overcome this limitation, in [29, 30], we introduced a series of approaches to accelerate Saturation NOW by using workstations' idle time and perform image computation speculatively. In addition, to let our distributed approaches utilize the overall NOW memory while the algorithm performs its highly irregular exploration, in [31], we developed a garbage collection scheme and several operation-cache policies dedicated to symbolic reachability analysis for examining extremely complex systems. Also, in [32], we introduced a two-step chaining scheme that is fine-grained and dynamically applied to the decision-diagram nodes for improving the convergence of fix-point computation during reachability analysis. We stress that all mechanisms described in this dissertation can facilitate not only Saturation-based but also breath-first-based reachability analysis.
Missing Clusters Indicate Poor Estimates or Guesses of a Proper Fuzzy Exponent
Authors: Ulrich Möller
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

The term `missing cluster' (MC) is introduced as an undesirable feature of fuzzy partitions. A method for detecting persistent MCs is shown to improve the choice of proper fuzzy parameter values in fuzzy C-means clustering when compared to other methods. The comparison was based on simulated data and gene expression profiles of cancer.
Monitoring the Execution of Third-Party Software on Mobile Devices
Authors: Andrew Brown, Mark Ryan
Venue: Proceedings of the 11th international symposium on Recent Advances in Intrusion Detection (2008)

The current security model for a third-party application running on a mobile device requires its user to trust that application's vendor and whilst mechanisms exist to mediate this relationship, they cannot guarantee complete protection against the threats posed. This work introduces a security architecture that prevents a third-party application deviating from its intended behaviour, defending devices against previously unseen malware more effectively than existing security measures.
Face Recognition in Color Using Complex and Hypercomplex Representations
Authors: Mauricio Villegas, Roberto Paredes
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

Color has plenty of discriminative information that can be used to improve the performance of face recognition algorithms, although it is difficult to use it because of its high variability. In this paper we investigate the use of the quaternion representation of a color image for face recognition. We also propose a new representation for color images based on complex numbers. These two color representation methods are compared with the traditional grayscale and RGB representations using an eigenfaces based algorithm for identity verification. The experimental results show that the proposed method gives a very significant improvement when compared to using only the illuminance information.
Shotgun Protein Sequencing
Authors: Pavel A. Pevzner
Venue: Proceedings of the 7th international workshop on Algorithms in Bioinformatics (2007)

Despite significant advances in the identification of known proteins, the analysis of unknown proteins by tandem mass spectrometry (MS/MS) still remains a challenging open problem. Although Klaus Biemann recognized the potential of mass spectrometry for sequencing of unknown proteins in the 1980s, low-throughput Edman degradation followed by cloning still remains the main method to sequence unknown proteins. The automated spectral interpretation has been limited by a focus on individual spectra and has not capitalized on the information contained in spectra of overlapping peptides. Indeed, the powerful Shotgun DNA Sequencing strategies have not been extended to protein sequencing yet.We demonstrate, for the first time, the feasibility of Shotgun Protein Sequencing of protein mixtures and validate this approach by generating highly accurate de novo reconstructions of various proteins in western diamondback rattlesnake venom. We further argue that Shotgun Protein Sequencing has the potential to overcome the limitations of current protein sequencing approaches and thus catalyze the otherwise impractical applications of proteomics methodologies in studies of unknown proteins. We further describe applications of this technique to analyzing proteins that are not directly inscribed in DNA sequences (like antibodies and fusion proteins in cancer).This is a joint work with Nuno Bandeira (UCSD) and Karl Clauser (Broad).
Considerate home notification systems: a field study of acceptability of notifications in the home
Authors: Martijn H. Vastenburg, David V. Keyson, Huib Ridder
Venue: Personal and Ubiquitous Computing (2008)

A field study in ten homes was conducted to understand what influences users' acceptability of notifications in the home environment. The key finding is that perceived message urgency is the primary indicator of acceptability of notifications in the home--if people think a message is urgent, they want the message to be shown immediately, regardless of what they are doing at the time of notification. The study also shows that the acceptability of low-urgent and medium-urgent messages could be improved by taking into account mental activity load at the time of notification. No effect of physical activity was found on acceptability. The results suggest that to improve the scheduling of notifications in the home, notification systems need a mechanism assessing both the message urgency and the mental activity load, whereas physical activity can be ignored. From a methodological point of view, it is difficult to measure acceptability of notifications in a realistic setting, given the need to balance experimental control with realistic context. The present paper suggests a way to introduce controlled notifications and subjective measurements of acceptability in homes.
Learning to interact: connecting perception with action in virtual environments
Authors: Pedro Sequeira, Ana Paiva
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

Modeling synthetic characters which interact with objects in dynamic virtual worlds is important when we want the agents to act in an autonomous and non-preplanned way. Such interactions with objects would allow the synthetic characters to behave in a more believable way. Once objects offer innumerous uses, it is essential that the agent is able to acquire the necessary knowledge to identify action possibilities in the objects while interacting with them. We propose a conceptual framework that allows the agents to identify possible interactions with objects based in past experiences with other objects. Starting from sensory patterns collected during interactions with objects, the agent is able to acquire conceptual knowledge about regularities of the world, its internal states and its own actions. The presented work also proposes that such acquired knowledge may be used by the agent in order to satisfy its needs and goals by interacting with objects. Preliminary tests were made and it is possible to state that our agents are able to acquire valid conceptual knowledge about the regularities in the environment and its objects, its own actions and causal relations between them.
A Combined Web Mining Model and Its Application in Crisis Management
Authors: Xingsen Li, Lingling Zhang, Maoliang Ding, Yong Shi, Jun Li
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Crisis management is an increasingly important activity of management. Organizations' critical crises can induce severe consequences or even disasters if wrong decisions are made. The World Wide Web provides an unprecedented freedom for the public to discuss one's opinions which impact much on the progress of the crisis. Based on the study of web mining and its relative techniques, a combined web mining model was presented. It consists of web mining, text mining, data mining and human experience knowledge. All knowledge from each part was saved in database through a knowledge management platform. Its application shows that utilizing the combined model for crisis management can improve the quality of decisions.
Probabilistic rough set approximations
Authors: Yiyu Yao
Venue: International Journal of Approximate Reasoning (2008)

Probabilistic approaches have been applied to the theory of rough set in several forms, including decision-theoretic analysis, variable precision analysis, and information-theoretic analysis. Based on rough membership functions and rough inclusion functions, we revisit probabilistic rough set approximation operators and present a critical review of existing studies. Intuitively, they are defined based on a pair of thresholds representing the desired levels of precision. Formally, the Bayesian decision-theoretic analysis is adopted to provide a systematic method for determining the precision parameters by using more familiar notions of costs and risks. Results from existing studies are reviewed, synthesized and critically analyzed, and new results on the decision-theoretic rough set model are reported.
Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals
Authors: Jean Bernard Lasserre, Monique Laurent, Philipp Rostalski
Venue: Foundations of Computational Mathematics (2008)

For an ideal I&#x2286;&#x211d;[x] given by a set of generators, a new semidefinite characterization of its real radical I(V &#x211d;(I)) is presented, provided it is zero-dimensional (even if I is not). Moreover, we propose an algorithm using numerical linear algebra and semidefinite optimization techniques, to compute all (finitely many) points of the real variety V &#x211d;(I) as well as a set of generators of the real radical ideal. The latter is obtained in the form of a border or Gr&#x00f6;bner basis. The algorithm is based on moment relaxations and, in contrast to other existing methods, it exploits the real algebraic nature of the problem right from the beginning and avoids the computation of complex components.
Robust and efficient aggregate query processing in wireless sensor networks
Authors: Kebin Liu, Lei Chen, Yunhao Liu, Minglu Li
Venue: Mobile Networks and Applications (2008)

Wireless sensor networks have been widely used in many applications, such as soil temperature monitoring for plant growth and abnormal event detection of industrial parameters. Among these applications, aggregate queries, such as SUM, COUNT, AVERAGE, MIN and MAX are often used to collect statistical data. Due to the low quality sensing devices or random environmental disturbances, sensor data are often noisy. Hence, the idea of moving average, which computes the average over consecutive aggregate data, is introduced to offset the effect. The high link loss rate, however, makes the result after averaging still inaccurate. To address this issue, we propose a PCM-based data transmission scheme to "make up" the possibly lost data. Specifically, we focus on obtaining robust aggregate results under high link loss rate. In order to reduce the communication traffic that dominates the energy consumption of the sensor network, we also design an intelligent path selection algorithm for our scheme. Our extensive simulation results have shown that this technique outperforms its counterparts under various sensor network conditions.