ppxscal/embedding_network huggingface dataset:
Selection of Target Area for Interventional and Cell Therapy after Myocardial Infarction Using 3d Echocardiography
Authors: Claudia Matei, Theodora Benedek, Monica Chitu, Istvan Benedek Jr., I. A. Sarbu-Pop, Istvan Kovacs, Istvan Benedek, Kakucs Eniko, Koppeczi Judit, Imre Benedek
Venue: Proceedings of the 2008 First International Conference on Complexity and Intelligence of the Artificial and Natural Complex Systems. Medical Applications of the Complex Systems. Biomedical Computing (2008)

Computerized 3D echocardiography could be an alternative in order to identify viable myocardium as target area for revascularization and cell therapy after myocardial infarction, especially when other imagistic techniques (SPECT, PET) are not available. Stem cell transplantation after myocardial infarction is an innovative therapy in order to save larger myocardial areas and to recover hibernated myocardium postinfarction. We studied 39 patients with acute myocardial infarction classified in three groups, according to the treatment performed. For all patients we used computerized 3D echocardiography to determine objective parameters for complex analyze of left ventricular contractility, synchronism and remodeling. Parameters determined were: contraction dis-synchronism between different segments, time delay until reaching the maximum contraction amplitude, maximum contraction excursion, ejection fraction at different segments, ventricular volumes in different moments of cardiac cycle.
Interaction Design: The Mobile Percussionist
Authors: Tiago Reis, Luís Carriço, Carlos Duarte
Venue: Proceedings of the 4th International Conference on Haptic and Audio Interaction Design (2009)

This paper presents the user centered iterative interaction design of a mobile music application. The application enables multiple users to use one or more accelerometers in order to simulate the interaction with real percussion instruments (drums, congas, and maracas). The ways through which the accelerometers are held, before and during interaction, define the instruments they represent, allowing the swapping of instruments during musical performances. The early evaluation sessions directed to the interaction modes created for each instrument enabled design iterations that were of utmost importance regarding the final application's ease of use and similarity to reality. The final evaluation of the application involved 4 percussionists that considered it well conceived, similar to the real instruments, natural and suitable for entertainment purposes, but not for professional musical purposes.
A multi-radio wireless P2P network testbed
Authors: Ze Zhao, Qiang Liu, Guang-Hua Yang, Victor Li, Li Cui
Venue: Proceedings of the 4th ACM international workshop on Experimental evaluation and characterization (2009)

Wireless peer-to-peer (P2P) networks have been widely studied in recent years. Testing and evaluating wireless P2P network protocols are challenging tasks because they require a powerful and flexible hardware platform and supervision interface. In this work, EZ270, a novel wireless node with multi-radio support is designed and developed. Based on EZ270, a general purpose wireless P2P network testbed with user-friendly supervision features is built. The functionality and effectiveness of the wireless nodes and of the testbed are demonstrated.
Solid Mass Flux Measurement of the Gas-Solid Flow Using the Elbow-Ultrasonic
Authors: Yanjun Zhao, Xinyue Shi, Shimin Wang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

Solid mass flux measurement method of the gas-solid flow by the Elbow-Ultrasonic is brought out in this paper, it basedon the elbow solid mass flux measurement method and the Ultrasonic velocity measurement method. The novel methodneednot pre-required knowledge about the gas-solid flow density. The experiment system is built and experiments by mixing the coal powder with gas as test material are performed on the 80 mm test facility. The accuracy is studied by comparing the flow measured by Elbow-Ultrasonic with it by weighbridge. The experiment results prove that this method is feasible.
Finding induced trees
Authors: N. Derhy, C. Picouleau
Venue: Discrete Applied Mathematics (2009)

Let G=(V(G),E(G)) be a finite connected undirected graph and W@?V(G) a subset of vertices. We are searching for a subset X@?V(G) such that W@?X and the subgraph induced on X is a tree. NP-completeness results and polynomial time algorithms are given assuming that the cardinality of W is fixed or not. Besides we give complexity results when X has to induce a path or when G is a weighted graph. We also consider problems where the cardinality of X has to be minimized.
On discretization errors and subgrid scale model implementations in large eddy simulations
Authors: A. Viré, B. Knaepen
Venue: Journal of Computational Physics (2009)

We analyze the impact of discretization errors on the performance of the Smagorinsky model in large eddy simulations (LES). To avoid difficulties related to solid boundaries, we focus on decaying homogeneous turbulence. It is shown that two numerical implementations of the model in the same finite volume code lead to significantly different results in terms of kinetic energy decay, time evolutions of the viscous dissipation and kinetic energy spectra. In comparison with spectral LES results, excellent predictions are however obtained with a novel formulation of the model derived from the discrete Navier-Stokes equations. We also highlight the effect of discretization errors on the measurement of physical quantities that involve scales close to the grid resolution.
Modelling composite document behaviour with concurrent hierarchical state machines
Authors: Steve Battle, Helen Balinsky
Venue: Proceedings of the 9th ACM symposium on Document engineering (2009)

This paper addresses the need for a modular approach to document composition and life-cycle, enabling mixed content to be used and re-used within documents. Each content item may bring with it its own workflow. Documents are conventionally considered to be the passive subjects of workflow, but when a document presents a complex mix of components it becomes harder for a centralized workflow to cater for this variety of needs. Our solution is to apply object-oriented concepts to documents, expressing process definitions alongside the content they apply to. We are interested in describing document life-cycles, and use Finite State Machines to describe the way that the individual components of a document change over time. A framework for composing these functional document components must first consider their hierarchical nesting for which we use Hierarchical State Machines. Furthermore, to accommodate the composition of independent sibling components under a common parent we use Concurrent Hierarchical State Machines. This theoretical framework provides practical guidelines for modelling composite document behaviour.
Pragmatic information extraction from subject ellipsis in informal English
Authors: Shigeko Nariyama
Venue: Proceedings of the Third Workshop on Scalable Natural Language Understanding (2006)

Subject ellipsis is one of the characteristics of informal English. The investigation of subject ellipsis in corpora thus reveals an abundance of pragmatic and extra-linguistic information associated with subject ellipsis that enhances natural language understanding. In essence, the presence of subject ellipsis conveys an 'informal' conversation involving 1) an informal 'Topic' as well as familiar/close 'Participants', 2) specific 'Connotations' that are different from the corresponding full sentences: interruptive (ending discourse coherence), polite, intimate, friendly, and less determinate implicatures. This paper also construes linguistic environments that trigger the use of subject ellipsis and resolve subject ellipsis.
Coarse-to-Fine Matching of Shapes Using Disconnected Skeletons by Learning Class-Specific Boundary Deformations
Authors: Aykut Erdem, Sibel Tari
Venue: Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition (2009)

Disconnected skeleton [1] is a very coarse yet a very stable skeleton-based representation scheme for generic shape recognition in which recognition is performed mainly based on the structure of disconnection points of extracted branches, without explicitly using information about boundary details [2,3]. However, sometimes sensitivity to boundary details may be required in order to achieve the goal of recognition. In this study, we first present a simple way to enrich disconnected skeletons with radius functions. Next, we attempt to resolve the conflicting goals of stability and sensitivity by proposing a coarse-to-fine shape matching algorithm. As the first step, two shapes are matched based on the structure of their disconnected skeletons, and following to that, the computed matching cost is re-evaluated by taking into account the similarity of boundary details in the light of class-specific boundary deformations which are learned from a given set of examples.
Low-Complexity, High-Throughput Multiple-Access Wireless Protocol for Body Sensor Networks
Authors: Seung-mok Yoo, Chong-Jing Chen, Pai H. Chou
Venue: Proceedings of the 2009 Sixth International Workshop on Wearable and Implantable Body Sensor Networks (2009)

Wireless systems that form a body-area network must be made small and low power without sacrificing performance. To achieve high-throughput communication in low-cost wireless body area networks, we propose a low complexity,“pulling” MAC protocol. Such a network architecture consists of low-complexity nodes and moderate complexity base stations, which act as clients to pull data from the nodes that act as thin servers. This organization achieves intra-network collision-free multiple access as in TDMA but without expensive time synchronization. It also achieves high utilization of air bandwidth and adaptivity of CSMA protocols but without collision or complexity on the node side. Experimental results show that our pulling protocol achieves better good channel utilization of up to 52.8% and high data throughput of up to 432Kbps. We also tested our MAC protocol on a wireless ECG system. Our MAC protocol can transmit ten simultaneous streams of data at 200 samples per second each from ten sensing devices.
Incremental Tree Induction for Detection of the Rescue Target in the Marine Casualty
Authors: Xin Ran, Yongxin Zhang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

In the case that a marine casualty occurs, the detection of the rescue target such as life rafts is surely required to carry out the prompt rescue of human life.To detect the small target in the wide views over the sea, we have proposed a new method including the feature extraction techniques based on the color information and the system learning method based on incremental tree induction. The color information derived from the image data is used to construct the incremental tree which can update online to adapt well to the real time circumstance. The experimental results show that the proposed method is efficient to detect the small target in cluttered natural scene.
The Analysis and Design of Steel Plant Electrostatic Precipitator Control System Based on IFIX
Authors: Kaixing Wu, Yuqing Zheng
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

Electrostatic precipitators (ESP) are the most widely used devices which are capable of controlling particle emission effectively from steel plants and other process industries. The performance of an electrostatic precipitator is significantly affected by its complex running parameters. Once they are set inappropriately, the failure rate will be increasing. It is, however, difficult to find the fault’s causation and position, which reduces collection efficiency and drops the level of management automation. More importantly, that makes gas emission over standard, the environment polluted. Aim at the above problems, this paper proposes a kind of ESP control system based on iFix configuration software. The system brings iFix’s automatic function of data acquisition and data management into full play, and improves equipment utilization and management degree of automation as well. This system includes real-time monitoring picture, alarm processing, report processing and so on. The implement of the system achieves the goal of improving collection efficiency, pro-environment and energy conservation, enhancement of security, saving manpower and material resources and convenient for management and maintenance, so it’s very worthy of expanding.
A Novel Clone Selection Algorithm for High-Dimensional Global Optimization Problems
Authors: Xingbao Liu, Liangwu Shi, Rongyuan Chen, Haijun Chen
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

The clone selection algorithm (CSA) is a stochastic, population-based evolutionary method that can be applied to the global optimization problems. The paper proposes a variation on the traditional CSA: clone selection algorithm with simplex crossover, or CSA_SPX. The novel algorithm employs the randomized distribution scheme for clone individuals, bit hyper-mutation and simplex crossover to significantly improve the performance of the original algorithm. Application of the CSA_SPX on 23 benchmark optimization problems shows a marked improvement in performance over the traditional CSA.
Impact of Expressive Wrinkles on Perception of a Virtual Character's Facial Expressions of Emotions
Authors: Matthieu Courgeon, Stéphanie Buisine, Jean-Claude Martin
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

Facial animation has reached a high level of photorealism. Skin is rendered with grain and translucency, wrinkles are accurate and dynamic. These recent visual improvements are not fully tested for their contribution to the perceived expressiveness of virtual characters. This paper presents a perceptual study assessing the impact of different rendering modes of expressive wrinkles on users' perception of facial expressions of basic and complex emotions. Our results suggest that realistic wrinkles increase agent's expressivity and user's preference, but not the recognition of emotion categories. This study was conducted using our real time facial animation platform that is designed for perceptive evaluations of affective interaction.
Searching for Concurrent Design Patterns in Video Games
Authors: Micah J. Best, Alexandra Fedorova, Ryan Dickie, Andrea Tagliasacchi, Alex Couture-Beil, Craig Mustard, Shane Mottishaw, Aron Brown, Zhi Feng Huang, Xiaoyuan Xu, Nasser Ghazali, Andrew Brownsword
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

The transition to multicore architectures has dramatically underscored the necessity for parallelism in software. In particular, while new gaming consoles are by and large multicore, most existing video game engines are essentially sequential and thus cannot easily take advantage of this hardware. In this paper we describe techniques derived from our experience parallelizing an open-source video game Cube 2. We analyze the structure and unique requirements of this complex application domain, drawing conclusions about parallelization tools and techniques applicable therein. Our experience and analysis convinced us that while existing tools and techniques can be used to solve parts of this problem, none of them constitutes a comprehensive solution. As a result we were inspired to design a new parallel programming environment (PPE) targeted specifically at video game engines and other complex soft real-time systems. The initial implementation of this PPE, Cascade, and its performance analysis are also presented.
Dynamic distributed constraint reasoning
Authors: Robert N. Lass, Evan A. Sultanik, William C. Regli
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

What local action can agents take, without the benefit of global knowledge, to produce the best global solution? Many dynamic distributed systems can be modeled using techniques from distributed constraint reasoning, however, existing work in the distributed constraint reasoning community does not address the true dynamism inherent in many real-world systems.
Design and Implementation of LabVIEW-Based IEC61499 Compliant Device
Authors: Grzegorz Polaków, Mieczyslaw Metzger
Venue: Proceedings of the 4th International Conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2009)

The method of IEC 61499 compliant device implementation with the National Instruments LabVIEW is proposed. The work focuses on these aspects of the tasks of the event generation and dispatching, which have no direct counterparts in the G language. A mapping of all the IEC 61499 concepts onto the G language concepts is described. Because of the limited multithreading support in LV (multithreading is possible but a number of parallel threads is fixed at the stage of the program development and compilation) it is needed to fit all the IEC 61499 defined functionalities in a fixed number of threads. A FIFO queue based dispatching algorithm is implemented, similar to the one used in the C++FBRT implementation. The ultimate objective of the work is the development of the FBLV run-time environment, which converts the LabVIEW compatible industry grade hardware into the IEC 61499 compliant device.
The Proof Complexity of Polynomial Identities
Authors: Pavel Hrube, Iddo Tzameret
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

Devising an efficient deterministic -- or even a non-deterministic sub-exponential time -- algorithm for testing polynomial identities is a fundamental problem in algebraic complexity and complexity at large. Motivated by this problem, as well as by results from proof complexity, we investigate the complexity of _proving_ polynomial identities. To this end, we study a class of equational proof systems, of varying strength, operating with polynomial identities written as arithmetic formulas over a given ring. A proof in these systems establishes that two arithmetic formulas compute the same polynomial, and consists of a sequence of equations between polynomials, written as arithmetic formulas, where each equation in the sequence is derived from previous equations by means of the polynomial-ring axioms. We establish the first non-trivial upper and lower bounds on the size of equational proofs of polynomial identities, as follows: 1. Polynomial-size upper bounds on equational proofs of identities involving symmetric polynomials and interpolation-based identities. In particular, we show that basic properties of the elementary symmetric polynomials are efficiently provable already in equational proofs operating with depth-4 formulas, over infinite fields. This also yields polynomial-size depth-4 proofs of the Newton identities, providing a positive answer to a question posed by Grigoriev and Hirsch [GH03]. 2. Exponential-size lower bounds on (full, unrestricted) equational proofs of identities over certain specific rings. 3. Exponential-size lower bounds on analytic proofs operating with depth-3 formulas, under a certain regularity condition. The ``analytic'' requirement is, roughly, a condition that forbids introducing arbitrary formulas in a proof and the regularity condition is an additional structural restriction. 4. Exponential-size lower bounds on one-way proofs (of unrestricted depth) over infinite fields. Here, one-way proofs are analytic proofs, in which one is also not allowed to introduce arbitrary constants. Furthermore, we determine basic structural characterizations of equational proofs, and consider relations with polynomial identity testing procedures. Specifically, we show that equational proofs efficiently simulate the polynomial identity testing algorithm provided by Dvir and Shpilka [DS04].
Optimal Route Model for Urban Transit Network and Research on Its Algorithm
Authors: Liu Cheng, Zhou Xialing
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

For the transit network involving only bus lines and the transit network involving both bus lines and subway lines, this paper presents a mathematical model in multiobjective programming for transfer times, trip time consumption and trip cost. With transfer times as the primary objective, trip time consumption as the next, and trip cost as the final one, a corresponding solution algorithm based on the idea of Dijkstra algorithm for shortest-route solution is developed.
Watermarking Algorithm Based on Curvelet Transform and Human Visual Model
Authors: Zhenghua Shu, Xiaobao Zhang, Guodong Liu, Lixin Gan, Lin Zhan
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

Fast Discrete Curvelet Transform(FDCT) is a multiscale, multidirection and shift-invariant over complete transform. The paper proposes a blind watermarking algorithm in the FDCT domain. A simple but effective human visual model in FDCT domain is described. By modelling watermarking as a communication process. The experimentations show that this domain has higher capacity than the wavelet (include complex wavelet and real wavelet) and spatial domains. FDCT has better direction selectivity and less redundancy than wavelets, and has shift-invariant property. Watermarking algorithm based on curvelet transform improves the robustness of watermark at gaussian white noise attack. Hence that curvelet provide a potentially good domain for watermarking.
Relations between Surface Gradient Maps in Frequency Domain and Application in Diffuse Component Detection
Authors: Zuojuan Liang, Junyu Dong, Xinghui Dong, Xiaoming Hu, Jianliang Xu
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

This paper examines the relationships between surface gradient maps in frequency domain and applies the relationships to detect the diffuse component using a set of images. In our method, we first assume the diffuse component can be expressed by the Lambertian model, and then we obtain a set of surface gradient pairs by selecting different pixel values produced by different illumination directions. We use the relation between surface gradient maps as a constraint to select the optimized surface gradient maps pair, which can be further used to obtain diffuse parameters. Experimental results based on real surface textures are presented.