ppxscal/embedding_network huggingface dataset:
Models for the Respiratory System Using Morphology-Based Electrical Analogy
Authors: Ionut Muntean, Clara Ionescu, Ioan Nascu
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)

This paper attempts to simulate changes in the mechanical properties of lungs through their equivalent changes in the human respiratory input impedance. The theory of electrical transmission lines and ladder networks is used to develop an equivalent model of the respiratory system. Three typical cases are investigated: healthy, asthma and chronic obstructive pulmonary disease. Simulation results are tested on different types of ladder network cells, such as RC, RLC and various simulating conditions of the whole system. Our conclusion is that an RLC cell gives results which are comparable to real measurements from healthy, asthma, or chronic obstructive pulmonary disease subjects and changes in the morphology.
Design of Automotive Seat Surface Based on Ergonomics
Authors: Pingqing Gan, Xinping Song
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Based on ergonomics theory, the paper analyzes the influencing factors of automobile driving comfort, from two sides, that are, physiological form of human sitting posture and body press distribution. On this basis, human physiological curve, the pressure curve and their function expressions are fitted through mathematical software. And combining the seat material properties, the seat curve in line with the human ecology is deduced, which provides new ideas for the seat design. Finally, this paper identifies H-point and draws the mating graph of seat surface curves and dummy.
Experimental Study on Different Ignition System Matching Different Spark Plug Gap
Authors: Gu Yufeng, Fang Zongde
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

In order to study the adjustability of spark plug gaps in different ignition Systems in search of optimum spark plug gap, traditional contact-controlled inductive storage ignition system and superposing high ignition system were used in BN492QA engine respectively. Performance of the two different ignition systems matching different spark plug gaps were studied through experiments of changing the spark plug gap and compression ratio. The experimental results show that traditional ignition system can only suit 0.7 millimeters spark plug gap and 7.3 compression ratio because of its low spark ignition energy while the superposing high ignition system can match 1.3 millimeters spark plug gap and 7.4 compression ratio. The results also show that big gap spark plug using high ignition system additionally can match high speed and high compression ratio of the engine and be advantageous to the engine knock suppression, and finally the engine performance is improved.
An Ontology for the Care of the Elder at Home
Authors: David Riaño, Francis Real, Fabio Campana, Sara Ercolani, Roberta Annicchiarico
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

The health-care of the elder at home is highly demanded in modern societies. It is based on the difficult task of coordinating multiple professionals and procedures acting on the same patient. K4CARE is a project aiming at implementing and testing a technology-based incremental and adaptable model to assist health care systems in home care. One of the key components of this model is the Case Profile Ontology (CPO) that is used to support the activities in the life-cycle of home care. These activities define a path that goes from assessing the problem to deploying a care plan. Along this path several CPO-based tools have been implemented to ease the assessment step, to manage care plans as State-Decision-Action diagrams, to combine care plans for comorbid patients, and to personalize care plans. The use of these tools significantly reduces the complexity of dealing with patients at home.
Comparing corpora with WordSmith tools: how large must the reference corpus be?
Authors: Tony Berber-Sardinha
Venue: Proceedings of the Workshop on Comparing Corpora (2000)

WordSmith Tools (Scott, 1998) offers a program for comparing corpora, known as KeyWords. KeyWords compares a word list extracted from what has been called 'the study corpus' (the corpus which the researcher is interested in describing) with a word list made from a reference corpus. The only requirement for a word list to be accepted as reference corpus by the software is that must be larger than the study corpus. one of the most pressing questions with respect to using KeyWords seems to be what would be the ideal size of a reference corpus. The aim of this paper is thus to propose answers to this question. Five English corpora were compared to reference corpora of various sizes (varying from two to 100 times larger than the study corpus). The results indicate that a reference corpus that is five times as large as the study corpus yielded a larger number of keywords than a smaller reference corpus. Corpora larger than five times the size of the study corpus yielded similar amounts of keywords. The implication is that a larger reference corpus is not always better than a smaller one, for WordSmith Tools Keywords analysis, while a reference corpus that is less than five times the size of the study corpus may not be reliable. There seems to be no need for using extremely large reference corpora, given that the number of keywords yielded do not seem to change by using corpora larger than five times the size of the study corpus.
CDx: a family of real-time Java benchmarks
Authors: Tomas Kalibera, Jeff Hagelberg, Filip Pizlo, Ales Plsek, Ben Titzer, Jan Vitek
Venue: Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems (2009)

Java is becoming a viable platform for hard real-time computing. There are production and research real-time Java VMs, as well as applications in both military and civil sector. Technological advances and increased adoption of Real-time Java contrast significantly with the lack of real-time benchmarks. The few benchmarks that exist are either low-level synthetic micro-benchmarks, or benchmarks used internally by companies, making it difficult to independently verify and repeat reported results. This paper presents the x (Collision Detector) benchmark suite, an open source application benchmark suite that targets different hard and soft real-time virtual machines. x is, at its core, a real-time benchmark with a single periodic task, which implements aircraft collision detection based on simulated radar frames. The benchmark can be configured to use different sets of real-time features and comes with a number of workloads. We describe the architecture of the benchmark and characterize the workload based on input parameters.
Coreference resolution in dialogues in English and Portuguese
Authors: Marco Rocha
Venue: Proceedings of the Workshop on Coreference and its Applications (1999)

This paper introduces a methodology to analyse and resolve cases of coreference in dialogues in English and Portuguese. A four-attribute annotation to analyse cases of anaphora was used to analyse a sample of around three thousand cases in each language collected in dialogue corpora. The information thus gathered was analysed by means of exploratory and model-building statistical procedures. A probabilistic model was then built on the basis of aggregate combinations of categories across the four attributes. This model, in combination with direct observation of cases, was used to build an antecedent-likelihood theory, which is at present being organised as a decision tree for the purpose of testing with a view for automatic annotation and subsequent resolution of coreference cases in dialogues in both languages. It is thought that the findings could be extended to Spanish, Italian and possibly French.
The needlework in evaluating a CSCL system: the evaluand oriented responsive evaluation model
Authors: Iván M. Jorrín-Abellán, Robert E. Stake, Alejandra Martínez-Moné
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

This article presents the Evaluand-oriented Responsive Evaluation Model (EREM), a comprehensive evaluation model to be used in the evaluation of a CSCL system. The model relies on a responsive evaluation approach to provide potential evaluators with a practical tool to evaluate multiple criteria and episodes.
Interpolant Generation for UTVPI
Authors: Alessandro Cimatti, Alberto Griggio, Roberto Sebastiani
Venue: Proceedings of the 22nd International Conference on Automated Deduction (2009)

The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for interpolant generation have been presented for some theories of interest ---including that of equality and uninterpreted functions ($\mathcal{EUF}$), linear arithmetic over the rationals ($\mathcal{LA}(\mathbb{Q})$), and some fragments of linear arithmetic over the integers ($\mathcal{LA}(\mathbb{Z})$)--- and they are successfully used within model checking tools.In this paper we address the problem of computing interpolants in the theory of Unit-Two-Variable-Per-Inequality ($\mathcal{UTVPI}$). This theory is a very useful fragment of $\mathcal{LA}(\mathbb{Z})$, since it is expressive enough to encode many hardware and software verification queries while still admitting a polynomial time decision procedure. We present an efficient graph-based algorithm for interpolant generation in $\mathcal{UTVPI}$, which exploits the power of modern SMT techniques. We have implemented our new algorithm within the MathSAT SMT solver. Our experimental evaluation demonstrates both the efficiency and the usefulness of the new algorithm.
A Bayesian inference approach to identify a Robin coefficient in one-dimensional parabolic problems
Authors: Liang Yan, Fenglian Yang, Chuli Fu
Venue: Journal of Computational and Applied Mathematics (2009)

This paper investigates a nonlinear inverse problem associated with the heat conduction problem of identifying a Robin coefficient from boundary temperature measurement. A Bayesian inference approach is presented for the solution of this problem. The prior modeling is achieved via the Markov random field (MRF). The use of a hierarchical Bayesian method for automatic selection of the regularization parameter in the function estimation inverse problem is discussed. The Markov chain Monte Carlo (MCMC) algorithm is used to explore the posterior state space. Numerical results indicate that MRF provides an effective prior regularization, and the Bayesian inference approach can provide accurate estimates as well as uncertainty quantification to the solution of the inverse problem.
Extending process automation systems with multi-agent techniques
Authors: I. Seilonen, T. Pirttioja, K. Koskinen
Venue: Engineering Applications of Artificial Intelligence (2009)

This paper presents a design of a process automation system extended with multi-agent systems (MAS) and experiments with its implementation. According to this design, MAS can be used to extend the functionality of ordinary process automation systems at higher levels of control. Anticipated benefits of this include enhanced reconfigurability, responsiveness and flexibility of the resulting automation system. The design also takes into account particular characteristics of process automation. An agent platform for process automation is presented as a basis for applying MAS. A FIPA-compliant agent platform is extended with process automation specific functionality. The platform utilizes a hierarchical agent organization and a BDI-agent model. Two applications are implemented using the platform. One of these shows how the techniques of distributed planning can be applied in discrete control. The other provides a model for supervisory continuous control using the techniques of distributed search. Experiments performed with a laboratory test environment using the applications are presented. They are able to demonstrate the feasibility of the approach in test scenarios.
Numerical approximation of the Vlasov-Poisson-Fokker-Planck system in two dimensions
Authors: Stephen Wollman, Ercument Ozizmir
Venue: Journal of Computational Physics (2009)

A numerical method is developed for approximating the solution to the Vlasov-Poisson-Fokker-Planck system in two spatial dimensions. The method generalizes the approximation for the system in one dimension given in [S. Wollman, E. Ozizmir, Numerical approximation of the Vlasov-Poisson-Fokker-Planck system in one dimension, J. Comput. Phys. 202 (2005) 602-644]. The numerical procedure is based on a change of variables that puts the convection-diffusion equation into a form so that finite difference methods for parabolic type partial differential equations can be applied. The computational cycle combines a type of deterministic particle method with a periodic interpolation of the solution along particle trajectories onto a fixed grid. computational work is done to demonstrate the accuracy and effectiveness of the approximation method. Parts of the numerical procedure are adapted to run on a parallel computer.
Morphogenetic approach to system identification
Authors: Francesco Marcelloni, Germano Resconi, Pietro Ducange
Venue: International Journal of Intelligent Systems (2009)

In this paper, we propose a novel approach to system identification based on morphogenetic theory (MT). Given a context H defined by a set of M objects, each described by a set of N attributes, and a vector X of desired outputs for each object, MT combines notions from formal concept analysis and tensor calculus so as to generate a morphogenetic system (MS). The MS is defined by a set of weights s1, &hellip;, sN, one for each attribute. Given H and X, weights are computed so as to generate the projection Y of X on the space of the attributes with the minimum distance between Y and X. An MS can be represented as a neuron, morphogenetic neuron, with a number of synapses equal to the number of attributes and synaptic weights equal to s1, &hellip;, sN. Unlike traditional neural network paradigm, which adopts an iterative process to determine synaptic weights, in MT, weights are computed at once. We introduce a method to generate a morphogenetic neural network (MNN) for identification problems. The method is based on extending appropriately and iteratively the attribute space so as to reduce the error between desired output and computed output. By using four well-known datasets, we show that an MNN can identify an unknown system with a precision comparable with classical multilayer perceptron with complexity similar to the MNN but reducing drastically the time needed to generate the neural network. Furthermore, the structure of the MNN is generated automatically by the method and does not require a trial-and-error approach often applied in classical neural networks. &copy; 2009 Wiley Periodicals, Inc.
Vision-Based Moving Objects Detection with Background Modeling
Authors: Hongyu Hu, Zhihui Li, Zhaowei Qu, Dianhai Wang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

Video detection has become an efficient technique support for collecting parameters of urban traffic. Detection of moving objects with background model in complex environment is developed in this paper. 1) In order to obtain moving objects from the video sequence efficiently, a background initialization algorithm based on clustering classifier is presented, all stable non-overlapping intervals in the temporal training sequence of each pixel are located as possible backgrounds by slip window; then the background interval is obtained from the classified data set of possible backgrounds by unsupervised clustering. 2) According to spatial-temporal property of pixels, the paper also presents Mixture Gaussian background update algorithm based on object-level with moving segmentation. The method can get over the effect of object’s long-term stop. The proposed approach is validated under real traffic scenes. Experimental results show that moving objects detection is robust and adaptive, can be well applied in real-world.
Research on Performance Simulation and VR of Complex Product Based on Virtual Prototyping Technology
Authors: Yanbin Sun, Liang Zhao, Siqun Ma, Wenzhong Zhao
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

The concept of virtual prototyping is discussed and the makeup of unit modules of virtual prototyping system of complex product and its function frame are given, as a example, structure optimization for the folded energy-absorbing tube and underframe VR design of SUV car are researched, the method how to create simulation frame, analysis and evaluation system supported by virtual prototyping system is introduced when develop complicated products. Practical application indicated this system can supply effective technology support for the development course of product.
Algorithms Based on Density and Shared Neighbors for Functional Modules Identification in PPI Networks
Authors: Peng Gang Sun, Lin Gao
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

Accumulating evidence suggests that biological systems are composed of interacting, separable, functional modules—groups of vertices within which connections are dense but between which they are sparse. Identifying these modules is essential to understand the organization of biological systems. However, the most existing deterministic algorithms only find “dense” clusters. Actually, the modules are of differing sizes, densities and shapes. In this paper, we take into account the property of diversity of module topological structure, propose an efficient algorithm relying on density and shared neighbors for detecting overlapping modules in PPI (protein-protein interaction) networks. Our algorithm first finds the skeleton of the modules, SNCS(Shared Neighbor Connected Subgraph), then constructs the modules by expanding the leaf vertices of SNCS based on shared neighbors. Furthermore, since the PPI network is noisy and still incomplete, some methods treat the PPI networks as weighted graphs in which each edge (e.g., interaction) is associated with a weight representing the probability or reliability of that interaction for preprocessing and purifying PPI data. Thus, we extend our method into weighted networks which takes into account the link weights in a more delicate way by incorporating the subgraph intensity. We test our method on PPI networks. Our analysis of the yeast PPI network suggests that most of these modules have well biological significance in the context of protein localization, function annotation.
Technical Section: Visual computing for medical diagnosis and treatment
Authors: Jan Klein, Ola Friman, Markus Hadwiger, Bernhard Preim, Felix Ritter, Anna Vilanova, Gabriel Zachmann, Dirk Bartz
Venue: Computers and Graphics (2009)

Diagnostic algorithms and efficient visualization techniques are of major importance for preoperative decisions, intra-operative imaging and image-guided surgery. Complex diagnostic decisions are characterized by a high information flow and fast decisions, requiring efficient and intuitive presentation of complex medical data and precision in the visualization. For intra-operative medical treatment, the pre-operative visualization results of the diagnostic systems have to be transferred to the patient on the operation room table. Via augmented reality, additional information of the hidden regions can be displayed virtually. This state-of-the-art report summarizes visual computing algorithms for medical diagnosis and treatment. After starting with direct volume rendering and tagged volume rendering as general techniques for visualizing anatomical structures, we go into more detail by focusing on the visualization of tissue and vessel structures. Afterwards, algorithms and techniques that are used for medical treatment in the context of image-guided surgery, intra-operative imaging and augmented reality are discussed and reviewed.
Operator-splitting methods in respect of eigenvalue problems for nonlinear equations and applications for Burgers equations
Authors: Jürgen Geiser
Venue: Journal of Computational and Applied Mathematics (2009)

In this article we consider iterative operator-splitting methods for nonlinear differential equations with respect to their eigenvalues. The main focus of the proposed idea is the fixed-point iterative scheme that linearizes our underlying equations. On the basis of the approximated eigenvalues of such linearized systems we choose the order of the operators for our iterative splitting scheme. The convergence properties of such a mixed method are studied and demonstrated. We confirm with numerical applications the effectiveness of the proposed scheme in comparison with the standard operator-splitting methods by providing improved results and convergence rates. We apply our results to deposition processes.
Concentrations and Influencing Factors of Hexachlorocyclohexanes (HCHs) in the Peacock River of Xinjiang, Northwest China
Authors: Wei Chen, Mingming Jing, Julia Ellis Burnet, Shihua Qi, Qi Song, Yibing Ke, Meng Liu, Jinjie Miao
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Hexachlorocyclohexane (HCH) was one of the major organochlorine pesticides (OCPs) in the water and sediments of the Peacock River in Xinjiang, China. Analyzing the water and sediment samples by gas chromatography–electron capture detection (GC-ECD), it showed that all the HCH isomers (α-HCH, β-HCH, γ-HCH and δ-HCH) could be found in the sediment, and the range was from 0.13 ng/g to 6.58 ng/g. The ratios of α-HCH/γ-HCH at all the sites (except Site 2 and Site 6), were below 1.5, and it appeared that the sediment environment changed recently (there was newly input of γ-HCH) and the Bosten Lake was the most possible source. In the water, only β-HCH could be detected, the range was from N.D. to 0.019μg/L. Discuss the influencing factors of HCH solubility: it showed that the high salinity reduced the solubility of HCHs into the water, and the alkalescence increased the solubility.
Attribute Constrained Rules for Partially Labeled Sequence Completion
Authors: Chad A. Williams, Peter C. Nelson, Abolfazl (Kouros) Mohammadian
Venue: Proceedings of the 9th Industrial Conference on Advances in Data Mining. Applications and Theoretical Aspects (2009)

Sequential pattern and rule mining have been the focus of much research, however predicting missing sets of elements within a sequence remains a challenge. Recent work in survey design suggests that if these missing elements can be inferred with a higher degree of certainty, it could greatly reduce the time burden on survey participants. To address this problem and the more general problem of missing sensor data, we introduce a new form of constrained sequential rules that use attribute presence to better capture rule confidence in sequences with missing data than previous constraint based techniques. Specifically we examine the problem of given a partially labeled sequence of sets, how well can the missing attributes be inferred. Our study shows this technique significantly improves prediction robustness when even large amounts of data are missing compared to traditional techniques.