ppxscal/embedding_network huggingface dataset:
Correlation k-Clustering in Trees and Trees of Rings
Authors: Xin Xiao, Li Shuguang
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

We consider the following correlation k-clustering problem: given a graph with real-valued edge weights (both positive and negative), extend a k-clustering of some vertices to partition all the vertices into clusters so as to maximize the total absolute weight of cut negative edges and uncut positive edges. This problem for general graphs is NP-complete for all fixedk ≥2. We present polynomial time exact algorithms for trees, rings and trees of rings.
The Rapid Transplant from English Chunking to Chinese One
Authors: Ying-Hong Liang, Jin-xiang Li, Chun-xiang Zhang, De-peng Wang
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Most of the methods of Chinese chunking are to re-realize the method of English chunking so as to identify Chinese phrases, which is not only waste manpower but also waste time. In this paper, a multi-agent strategy for English chunking is proposed first, whose value reaches 95.70%,which is higher than other else methods. Next, through replacing the English part of speech , phrase tags and repository by Chinese ones, at the same time, shielding some thread(the time for revising program is no more than one hour）, the program that is used for English chunking (eleven phrases), however, identified Chinese phrases (seven phrases) triumphantly. The value of Chinese chunking achieves 95.82%. This technology improves the efficiency of Chinese chunking and gives a new thought for Chinese chunking.
A New Algorithm for Polygonal Approximation Based on Ant Colony Optimization
Authors: Cecilia Ruberto, Andrea Morgera
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

In shape analysis a crucial step consists in extracting meaningful features from digital curves. Dominant points are those points with curvature extreme on the curve that can suitably describe the curve both for visual perception and for recognition. In this paper we present a novel method that combines the dominant point detection and the ant colony optimization search. The excellent results have been compared both to works using an optimal search approach and to works based on exact approximation strategy.
Software Transactional Memories: An Approach for Multicore Programming
Authors: Damien Imbs, Michel Raynal
Venue: Proceedings of the 10th International Conference on Parallel Computing Technologies (2009)

The recent advance of multicore architectures and the deployment of multiprocessors as the mainstream computing platforms have given rise to a new concurrent programming impetus. Software transactional memories (STM) are one of the most promising approach to take up this challenge. The aim of a STM system is to discharge the application programmer from the management of synchronization when he/she has to write multiprocess programs. His/her task is to decompose his/her program in a set of sequential tasks that access shared objects, and to decompose each task in atomic units of computation. The management of the required synchronization is ensured by the associated STM system. This paper presents two STM systems, and a formal proof for the second one. Such a proof -that is not trivial- is one of the very first proofs of a STM system. In that sense, this paper strives to contribute to the establishment of theoretical foundations for STM systems.
Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position
Authors: Chung-Meng Lee, Yuan-Hsiang Teng, Jimmy J. M. Tan, Lih-Hsing Hsu
Venue: Computers Mathematics with Applications (2009)

It is proved that there exists a path P"l(x,y) of length l if d"A"Q"""n(x,y)@?l@?2^n-1 between any two distinct vertices x and y of AQ"n. Obviously, we expect that such a path P"l(x,y) can be further extended by including the vertices not in P"l(x,y) into a hamiltonian path from x to a fixed vertex z or a hamiltonian cycle. In this paper, we prove that there exists a hamiltonian path R(x,y,z;l) from x to z such that d"R"("x","y","z";"l")(x,y)=l for any three distinct vertices x, y, and z of AQ"n with n>=2 and for any d"A"Q"""n(x,y)@?l@?2^n-1-d"A"Q"""n(y,z). Furthermore, there exists a hamiltonian cycle S(x,y;l) such that d"S"("x","y";"l")(x,y)=l for any two distinct vertices x and y and for any d"A"Q"""n(x,y)@?l@?2^n^-^1.
Grounding Robot Autonomy in Emotion and Self-awareness
Authors: Ricardo Sanz, Carlos Hernández, Adolfo Hernando, Jaime Gómez, Julita Bermejo
Venue: Proceedings of the FIRA RoboWorld Congress 2009 on Advances in Robotics (2009)

Much is being done in an attempt to transfer emotional mechanisms from reverse-engineered biology into social robots. There are two basic approaches: the imitative display of emotion --e.g. to intend more human-like robots-- and the provision of architectures with intrinsic emotion --in the hope of enhancing behavioral aspects. This paper focuses on the second approach, describing a core vision regarding the integration of cognitive, emotional and autonomic aspects in social robot systems. This vision has evolved as a result of the efforts in consolidating the models extracted from rat emotion research and their implementation in technical use cases based on a general systemic analysis in the framework of the ICEA and C3 projects. The desire for generality of the approach intends obtaining universal theories of integrated --autonomic, emotional, cognitive-- behavior. The proposed conceptualizations and architectural principles are then captured in a theoretical framework: ASys -- The Autonomous Systems Framework.
An e-writer for documents plus strokes
Authors: Michael J. Gormish, Kurt Piersol, Ken Gudan, John Barrus
Venue: Proceedings of the 9th ACM symposium on Document engineering (2009)

This paper describes the hardware, software, and a document model for a prototype E-Writer. Paper like displays have proved useful in E-Readers like the Kindle in part because of low power usage and the ability to read indoors and out. We focus on emulating other properties of paper in the E-Writer: everyone knows how to use it, and users can write anywhere on the page. By focusing on a simple document model consisting primarily of images and strokes we enabled rapid application development that integrates easily with current paper-based document workflows. This paper includes preliminary reports on usage of the E-Writer and its software by a small test group.
Simulation of Critical ICT Infrastructure for Municipal Crisis Management
Authors: Adam Kozakiewicz, Anna Felkner, Tomasz Jordan Kruk
Venue: Critical Information Infrastructure Security: Third International Workshop, CRITIS 2008, Rome, Italy, October13-15, 2008. Revised Papers (2009)

Crisis management benefits tremendously from simulation, especially during the planning and testing. At the same time an often overlooked aspect of crisis management is the key role of telecommunication. This paper describes the work done at NASK with the goal of implementing a simulator of the consequences of threats to the ICT (Information and Communication Technology) infrastructure, as a part of a large simulation environment for crisis management in a large urban area (specifically the Warsaw agglomeration).
Stochastic optimization for collision selection in high energy physics
Authors: Shimon Whiteson, Daniel Whiteson
Venue: Proceedings of the 19th national conference on Innovative applications of artificial intelligence - Volume 2 (2007)

Artificial intelligence has begun to play a critical role in basic science research. In high energy physics, AI methods can aid precision measurements that elucidate the underlying structure of matter, such as measurements of the mass of the top quark. Top quarks can be produced only in collisions at high energy particle accelerators. Most collisions, however, do not produce top quarks and making precise measurements requires culling these collisions into a sample that is rich in collisions producing top quarks (signal) and spare in collisions producing other particles (background). Collision selection is typically performed with heuristics or supervised learning methods. However, such approaches are suboptimal because they assume that the selector with the highest classification accuracy will yield a mass measurement with the smallest statistical uncertainty. In practice, however, the mass measurement is more sensitive to some backgrounds than others. This paper presents a new approach that uses stochastic optimization techniques to directly search for selectors that minimize statistical uncertainty in the top quark mass measurement. Empirical results confirm that stochastically optimized selectors have much smaller uncertainty. This new approach contributes substantially to our knowledge of the top quark's mass, as the new selectors are currently in use selecting real collisions.
An Efficient Method for Random Delay Generation in Embedded Software
Authors: Jean-Sébastien Coron, Ilya Kizhvatov
Venue: Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems (2009)

Random delays are a countermeasure against a range of side channel and fault attacks that is often implemented in embedded software. We propose a new method for generation of random delays and a criterion for measuring the efficiency of a random delay countermeasure. We implement this new method along with the existing ones on an 8-bit platform and mount practical side-channel attacks against the implementations. We show that the new method is significantly more secure in practice than the previously published solutions and also more lightweight.
Note: A proof of a conjecture on the Randić index of graphs with given girth
Authors: Xueliang Li, Jianxi Liu
Venue: Discrete Applied Mathematics (2009)

The Randic index R(G) of a graph G is defined by R(G)=@?"u"v1d(u)d(v), where d(u) is the degree of a vertex u in G and the summation extends over all edges uv of G. Aouchiche, Hansen and Zheng proposed the following conjecture: For any connected graph on n>=3 vertices with Randic index R and girth g, R+g>=n-3+2n-1+72andR@?g>=3n-9+32n-1+32 with equalities if and only if G=S"n^+. This paper is devoted to giving a confirmative proof to this conjecture.
What have you done! the role of 'interference' in tangible environments for supporting collaborative learning
Authors: Taciana Pontual Falcão, Sara Price
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

This paper presents a study that investigated collaborative activity in a tangible tabletop environment to support learning about the physics of light. In co-located groups of three, children performed exploratory activities, using tangible artefacts, to find out about light. Analysis suggests that the environment can support various collaborative activities, but of central interest, demonstrated the role of peer interference in learning activities. Verbal negotiation and synchronization of actions emerged as conflict-resolution strategies and an implicit agreement by the children for sharing the physical and virtual resources of the system was noticed. The physicality and 'present at hand' nature of the input devices contributed to balanced levels of participation, particularly through action. Overall, the interference-prone tabletop environment contributed to creating a highly collaborative environment in which individual exploration was discouraged, leading the group through a productive process of collective exploration and knowledge construction.
Hyperkalemia vs. Ischemia Effects in Fast or Unstable Pacing: A Cardiac Simulation Study
Authors: Ioanna Chouvarda, Nicos Maglaveras
Venue: Proceedings of the 2nd International Conference on Digital Human Modeling: Held as Part of HCI International 2009 (2009)

The relation between potassium concentration elevation and action potential duration decrease is well established. While hyperkalemia is present in ischemia, the latter is also followed by other ionic changes, such as acidosis. In this work, hyperkalemic and ischemic changes in relation with various activation patterns in an inhomogeneous tissue were in focus and effort was paid to investigate spatial patterns and draw quantitative conclusions about their effects. A series of simulations were performed with different combinations of short stimulus periods and increased extracellular potassium concentrations. The effect of these perturbations on the cellular and overall tissue activation and wave propagation characteristics was investigated.
Structure-Preserving Smoothing of Biomedical Images
Authors: Debora Gil, Aura Hernàndez-Sabaté, Mireia Burnat, Steven Jansen, Jordi Martínez-Villalta
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

Smoothing of biomedical images should preserve gray-level transitions between adjacent tissues, while restoring contours consistent with anatomical structures. Anisotropic diffusion operators are based on image appearance discontinuities (either local or contextual) and might fail at weak inter-tissue transitions. Meanwhile, the output of block-wise and morphological operations is prone to present a block structure due to the shape and size of the considered pixel neighborhood.In this contribution, we use differential geometry concepts to define a diffusion operator that restricts to image consistent level-sets. In this manner, the final state is a non-uniform intensity image presenting homogeneous inter-tissue transitions along anatomical structures, while smoothing intra-structure texture. Experiments on different types of medical images (magnetic resonance, computerized tomography) illustrate its benefit on a further process (such as segmentation) of images.
VTouch: A Vision-Base Dual Finger Touched Inputs for Large Displays
Authors: Ching-Han Chen, Cun-Xian Nian
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

In this work, we present a complete architecture to implement a dual touch function for large sized displays. The architecture includes the hardware device and the software algorithm. The system has lower cost and smaller size than previous works for large sized display. And the proposed approach eliminates the requirement of special hardware. The system can be plugged to a normal display and change the display to equip the dual touch function. At the final of this paper, we give an experiment to demonstrate the system and show its usability.
Simulation Study of CVT Ratio Control for Engine Braking
Authors: Naiwei Zou, Qingnian Wang, Wei Wang, Xiaohua Zeng
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

The properties of auxiliary brake and the influences of auxiliary brake to car performance are introduced. The engine brake characters and its influence factors are explained, and the engine brake performance experiment is expounded. It is discussed that the necessity of control CVT ratio during engine braking. The conception of setting vehicle velocity during engine brakes is proposed, the engine object speed is estimated through the setting vehicle velocity, the object ratio of CVT is calculated with the engine object speed. With PID algorithm, the current ratio tracks the object one. This method solves the problem of difficulty to confirm object engine speed without throttle opening signal inputs. Finally, a simulation model of car with CVT is established, the simulate result shows that the CVT ratio control strategy during engine braking is valid.
Context-Aware Recommendation by Aggregating User Context
Authors: Dongmin Shin, Jae-won Lee, Jongheum Yeon, Sang-goo Lee
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

Traditional recommendation approaches do not consider the changes of user preferences according to context. As a result, these approaches consider the user’s overall preferences, although the user preferences on items varies according to his/her context. However, in our context-aware approach, we take into account not only user preferences, but also context information. Our approach can be easily adopted for content-based and collaborative filtering based recommendations. To exploit raw context information in recommendation, we abstract the raw context information to a concept level. Moreover, by aggregating the context information, we can improve the quality of recommendation. The results of several experiments show that our method is more precise than the traditional recommendation approaches.
MCMC-Based Algorithm to Adjust Scale Bias in Large Series of Electron Microscopical Ultrathin Sections
Authors: Huaizhong Zhang, E. Patricia Rodriguez, Philip Morrow, Sally Mcclean, Kurt Saetzler
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

When using a non-rigid registration scheme, it is possible that bias is introduced during the registration process of consecutive sections. This bias can accumulate when large series of sections are to be registered and can cause substantial distortions of the scale space of individual sections thus leading to significant measurement bias. This paper presents an automated scheme based on Markov Chain Monte Carlo (MCMC) techniques to estimate and eliminate registration bias. For this purpose, a hierarchical model is used based on the assumption that (a) each section has the same, independent probability to be deformed by the sectioning and therefore the subsequent registration process and (b) the varying bias introduced by the registration process has to be balanced such that the average section area is preserved forcing the average scale parameters to have a mean value of 1.0.
Investigation on E-Commerce Based on Suffix Trees and Moore's Law
Authors: Libo Liu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

The synthesis of DHCP has constructed erasure coding, and current trends suggest that the understanding of flip-flop gates will soon emerge. After years of robust research into interrupts, it is shown that the confusing unification of spreadsheets and write-ahead logging are described. Although the discussion might seem counterintuitive, it fell in line with the expectations. It is concluded that the focus is not on whether suffix trees and Moore's Law are largely incompatible, but rather on describing an analysis of the transistor, which is proved to be practicable.
Research of Dynamic SOA Collaboration Architecture
Authors: Juan Fang, Yanhui Liu
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Dynamic SOA collaboration is a new approach for SOA collaboration. In dynamic SOA collaboration, both the workflows and services can be determined at runtime, while in the traditional service collaboration, only the services can be discovered at runtime and the workflows must be pre-defined at design time. With the change of requirement, the traditional service collaboration is hard to adapt to these changes. Dynamic SOA collaboration is a way to solve this problem. In this paper we propose a classification of SOA-based collaborative architecture, and then we propose a new architecture for dynamic SOA collaboration.
Brain networks involved in early versus late response anticipation and their relation to conflict processing
Authors: Henry Lütcke, Holger Gevensleben, Björn Albrecht, Jens Frahm
Venue: Journal of Cognitive Neuroscience (2009)

Previous electrophysiological studies have clearly identified separable neural events underlying early and late components of response anticipation. Functional neuroimaging studies, however, have so far failed to account for this separation. Here, we performed functional magnetic resonance imaging (fMRI) of an anticipation paradigm in 12 healthy adult subjects that reliably produced early and late expectancy waves in the electroencephalogram. We furthermore compared fMRI activations elicited during early and late anticipation to those associated with response conflict. Our results demonstrate the existence of distinct cortical and subcortical brain regions underlying early and late anticipation. Although late anticipatory behavior was associated with activations in dorsal ACC, frontal cortex, and thalamus, brain responses linked to the early expectancy wave were localized mainly in motor and premotor cortical areas as well as the caudate nucleus. Additionally, late anticipation was associated with increased activity in midbrain dopaminergic nuclei, very likely corresponding to the substantia nigra. Furthermore, whereas regions involved in late anticipation proved to be very similar to activations elicited by response conflict, this was not the case for early anticipation. The current study supports a distinction between early and late anticipatory processes, in line with a plethora of neurophysiological work, and for the first time describes the brain structures differentially involved in these processes.
Information System for Seismic Design of High-Rise Buildings in Shanghai-Application of GIS
Authors: Benliang Liang, Jianxin Liu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

More and more high-rise buildings had been constructed in Shanghai. Structure seismic design is becoming more and more difficult because of the increasing of structure height and structure style complexity. In order to promote seismic design of high-rise buildings, share the experience and design data, it is necessary to build an information system. In this paper, GIS technology is applied to the information system development, so as to COM technology, ArcGIS Engine and SQL Server 2000 database. This information system consists of five functional modules: information query module, statistical analysis module, special graph and chart made module, print and plot module, system maintenance module. At the end of this paper, the future research goals which build a whole reduction disaster system and an expert system by data mining to determine the optimum structure system of the high-rise buildings were presented.
PADS: a simple yet effective pattern-aware dynamic search method for fast maximal frequent pattern mining
Authors: Xinghuo Zeng, Jian Pei, Ke Wang, Jinyan Li
Venue: Knowledge and Information Systems (2009)

While frequent pattern mining is fundamental for many data mining tasks, mining maximal frequent patterns efficiently is important in both theory and applications of frequent pattern mining. The fundamental challenge is how to search a large space of item combinations. Most of the existing methods search an enumeration tree of item combinations in a depth-first manner. In this paper, we develop a new technique for more efficient max-pattern mining. Our method is pattern-aware: it uses the patterns already found to schedule its future search so that many search subspaces can be pruned. We present efficient techniques to implement the new approach. As indicated by a systematic empirical study using the benchmark data sets, our new approach outperforms the currently fastest max-pattern mining algorithms FPMax* and LCM2 clearly. The source code and the executable code (on both Windows and Linux platforms) are publicly available at http://www.cs.sfu.ca/~jpei/Software/PADS.zip.