ppxscal/embedding_network huggingface dataset:
Automatic Hepatic Vessel Segmentation Using Graphics Hardware
Authors: Marius Erdt, Matthias Raspe, Michael Suehling
Venue: Proceedings of the 4th international workshop on Medical Imaging and Augmented Reality (2008)

The accurate segmentation of liver vessels is an important prerequisite for creating oncologic surgery planning tools as well as medical visualization applications. In this paper, a fully automatic approach is presented to quickly enhance and extract the vascular system of the liver from CT datasets. Our framework consists of three basic modules: vessel enhancement on the graphics processing unit (GPU), automatic vessel segmentation in the enhanced images and an option to verify and refine the obtained results. Tests on 20 clinical datasets of varying contrast quality and acquisition phase were carried out to evaluate the robustness of the automatic segmentation. In addition the presented GPU based method was tested against a CPU implementation to demonstrate the performance gain of using modern graphics hardware. Automatic segmentation using graphics hardware allows reliable and fast extraction of the hepatic vascular system and therefore has the potential to save time for oncologic surgery planning.
Non-Destructive Technique for Defect Localization in Concrete Structures Based on Ultrasonic Wave Propagation
Authors: Giuseppe Acciani, Girolamo Fornarelli, Antonio Giaquinto, Domenico Maiullari, Gioacchino Brunetti
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

Concrete structures require periodic inspections and quality control to assess their structural integrity. For this task several methodologies based on different technologies have been previously proposed. In particular, Non-Destructive Techniques, based on the use of ultrasonic wave propagation, have revealed attractive due to the possibility to perform reliable assessments of concrete structures. In this paper a method exploiting ultrasonic propagation characteristics is proposed. The aim of the method consists of determining the position of a defect by the computation of flight times related to signals reflected by anomalies in the structure. Such computation is based on a preliminary classification of defect positions that combines a genetic algorithm for a feature selection and a statistical approach for classification. The performances of the proposed method are evaluated in a specific case study, showing satisfactory numerical results, which show that this approach can be used to identify the position of small sized defects.
Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
Authors: Emilia Oikarinen, Tomi Janhunen
Venue: Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications (2008)

The stable model semantics of disjunctive logic programs is based on minimal models which assign atoms false by default. While this feature is highly useful and leads to concise problem encodings, it occasionally makes knowledge representation with disjunctive rules difficult. Lifschitz' parallel circumscription provides a remedy by introducing atoms that are allowed to vary or to have fixed values while others are falsified. Prioritized circumscription further refines this setting in terms of priority classes for atoms being falsified. In this paper, we present a linear and faithful transformation to embed prioritized circumscription into disjunctive logic programming in a systematic fashion. The implementation of the method enables the use of disjunctive solvers for computing prioritized circumscription. The results of an experimental evaluation indicate that the method proposed herein compares favorably with other existing implementations.
On Berge Multiplication for Monotone Boolean Dualization
Authors: Endre Boros, Khaled Elbassioni, Kazuhisa Makino
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

Given the prime CNF representation &phi; of a monotone Boolean function f:{0,1} n &rarr;{0,1}, the dualization problem calls for finding the corresponding prime DNF representation &psi; of f. A very simple method (called Berge multiplication [2] [Page 52---53]) works by multiplying out the clauses of &phi; from left to right in some order, simplifying whenever possible using the absorption law. We show that for any monotone CNF &phi;, Berge multiplication can be done in subexponential time, and for many interesting subclasses of monotone CNF's such as CNF's with bounded size, bounded degree, bounded intersection, bounded conformality, and read-once formula, it can be done in polynomial or quasi-polynomial time.
Visual Analysis of Program Flow Data with Data Propagation
Authors: Ying Xia, Kevin Fairbanks, Henry Owen
Venue: Proceedings of the 5th international workshop on Visualization for Computer Security (2008)

Host based program monitoring tools are an essential part of maintaining proper system integrity due to growing malicious network activity. As systems become more complicated, the quantity of data collected by these tools often grows beyond the ability of analysts to easily comprehend in a short amount of time. In this paper, we present a method for visual exploration of a system program flow over time to aid in the detection and identification of significant events. This allows automatic accentuation of programs with irregular file access and child process propagation, which results in more efficient forensic analysis and system recovery times.
Parameterized Tree Systems
Authors: Parosh Aziz Abdulla, Noomene Ben Henda, Giorgio Delzanno, Frédéric Haziza, Ahmed Rezine
Venue: Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2008)

Several recent works have considered parameterized verification, i.e. automatic verification of systems consisting of an arbitrary number of finite-state processes organized in a linear array. The aim of this paper is to extend these works by giving a simple and efficient method to prove safety properties for systems with tree-like architectures. A process in the system is a finite-state automaton and a transition is performed jointly by a process and its parent and children processes. The method derives an over-approximation of the induced transition system, which allows the use of finite trees as symbolic representations of infinite sets of configurations. Compared to traditional methods for parameterized verification of systems with tree topologies, our method does not require the manipulation of tree transducers, hence its simplicity and efficiency. We have implemented a prototype which works well on several nontrivial tree-based protocols.
Recommending Typical Usage Examples for Component Retrieval in Reuse Repositories
Authors: Yan Li, Liangjie Zhang, Ge Li, Bing Xie, Jiasu Sun
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

Programmers tend to reuse existing components to reduce development cost as well as improve productivity. While retrieving components from the reuse repository, developers often need to know how the components are used in different ways in order to judge which one is more appropriate. An efficient way guiding developers to know how the components are utilized is by leveraging the example code. However, usually the examples provided in handbooks and online documents are not adequate enough. To address this problem, we propose an approach recommending typical usage examples to developers by leveraging source code acquired from the Internet. For each component developers want to utilize, our method first retrieves relevant code downloaded from the Internet as candidate examples. The candidate examples are then clustered and we choose a typical one from each cluster. Finally, the selected ones are ranked and returned to the developers. We implemented our method with a prototype system and conducted an experimental study to evaluate its effectiveness. The experimental results demonstrate that our approach can provide examples to help developers know different usages of the component and thus has the potential to assist developers in reuse.
Edit Distances and Factorisations of Even Permutations
Authors: Anthony Labarre
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

A number of fields, including genome rearrangements and interconnection network design, are concerned with sorting permutations in "as few moves as possible", using a given set of allowed operations. These often act on just one or two segments of the permutation, e.g. by reversing one segment or exchanging two segments. The cycle graph of the permutation to sort is a fundamental tool in the theory of genome rearrangements. In this paper, we present an algebraic reinterpretation of the cycle graph as an even permutation, and show how to reformulate our sorting problems in terms of particular factorisations of the latter permutation. Using our framework, we recover known results in a simple and unified way, and obtain a new lower bound on the prefix transposition distance (where a prefix transposition displaces the initial segment of a permutation), which is shown to outperform previous results. Moreover, we use our approach to improve the best known lower bound on the prefix transposition diameter from 2n/3 to $\left\lfloor\frac{3n+1}{4}\right \rfloor$. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
An Intelligent NPC Framework for Context Awareness in MMORPG
Authors: Bong-Keun Lee, Choong-Shik Park, Jae-Hong Kim, Sang-Jo Youk, Keun Ho Ryu
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Recently AI(artificial intelligence) is one of the issues in the on-line game, a research that a game character seems to be realistic and is progressing using AI technique. Especially NPC is an important part of the AI researches of on-line game, and it is concerned by a game player and an architect. We proposed an intelligent agent framework to implement the NPC technique after studying the NPC technique using context awareness that reacts to the PC(Player Character) actively.
On-Line T-S Fuzzy Model Identification with Growing and Pruning Rules
Authors: Longtao Liao, Shaoyuan Li
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

This paper focuses on seeking an appropriate number of rules for a T-S inference system. A growing and pruning strategy in neural network is employed, which relates one fuzzy rule's contribution to the modeling accuracy by a statistic criterion, such that fuzzy rules is added/removed, whereas all the parameters can learn using EKF, both absolutely on-line and with small computation. A simulation for nonlinear system identification illustrates the good performance.
Flexible resource allocation and composition across gsm/3g networks and wlans
Authors: Mohammad Al-Fares, Martin Johnsson, Per Johansson, Amin Vahdat
Venue: Proceedings of the 3rd international workshop on Mobility in the evolving internet architecture (2008)

A significant challenge facing wireless and mobile networking is seamless global network connectivity. As expected, no single network operator and no single technology dominates the wireless access landscape. Instead, heterogeneity and change characterize both operators and access technologies. On the face of it, such a competitive landscape should support rapid innovation and more rapid rollout of global connectivity. Unfortunately, end users today are still unable to seamlessly leverage the broad array of available networks. Thus, while coverage may be nearly ubiquitous, access is not. One reason for this difficulty is that wireless providers cannot quickly and efficiently enter into the equivalent of roaming agreements. In this paper, we present a system architecture to enable seamless composition of wireless network access across a range of technologies. Importantly, we do not require pre-existing agreements on the part of operators or active involvement on the part of end users. Rather, operators advertise network capabilities and price while users have built-in preferences for cost, performance, battery life, etc. to allow end devices to both choose an appropriate network and to ensure that end-to-end billing takes place appropriately. We have completed an initial system prototype and our performance evaluation is promising for potential future low-overhead deployment.
Shape-constrained flock animation
Authors: Jiayi Xu Xiaogang Jin
Venue: Computer Animation and Virtual Worlds (2008)

We propose a novel shape-constrained flock animation system for interactively controlling flock navigation in virtual environments. This system is capable of making the spatial distribution of a flock meet static or deforming shape constraints while performing flock simulation. Such a capability can find many applications in the entertainment industry. Given a 3D constraining shape, our system first draws a set of uniform sample points through a 3D surface mosaicing process or a stratified point sampling strategy. Once correspondences between flock members and sample points have been established, points on the target shape are used as homing destinations to guide flock migration. Under a global path control scheme, an effective fuzzy control logic, which dynamically adjusts steering forces and control forces, has been developed to create visually pleasing shape-constrained flock animations. Copyright &copy; 2008 John Wiley & Sons, Ltd.
ContTest - A Multi-agent System for Accounting Education
Authors: Bogdan Patrut, Simona Elena Vârlan, Tiberiu Socaciu
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

This paper represents a summary of a research report and the results of developing an educational software, including a multi-agent system for teaching accounting bases and financial accounting. The paper describes the structure of the multi-agent system, defined as a complex network of s-agents. Each s-agent contains 6 pedagogical agents and a coordinator agent. We have defined a new architecture (BeSGOTE) which extends the BDI (Beliefs, Desires, Intentions) architecture for intelligent agents and also a mixing-up relation among the accounts. We have presented both the way in which this mixing-up relation can be used for testing students and the way in which regular expressions can be used for representing accounting problems.
Combining Uncertain Outputs from Multiple Ontology Matchers
Authors: Ying Wang, Weiru Liu, David Bell
Venue: Proceedings of the 1st international conference on Scalable Uncertainty Management (2007)

An ontology matching method (or a matcher) aims at matching every entity (or concept) in one ontology to the most suitable entity (or entities) in another ontology. Usually it is almost impossible to find a perfect match in the second ontology for every entity in the first ontology, so a matcher generally returns a set of possible matches with some weights (uncertainty) attached to each pair of match. In order to improve a matching result, several matchers can be used and the matched results from these matchers are combined with suitable approaches. In this paper, we first propose two new matchers among three matchers we use. We then address the need of dealing with uncertainties in mapping by investigating how some uncertainty reasoning frameworks can be used to combine matching results. We apply both the Dempster Shafer theory of evidence (DS theory) and Possibility Theory to merge the results computed by different matchers. Our experimental results and comparisons with related work indicate that integrating these theories to deal with uncertain ontology matching is a promising way to improve the overall matching results.
Compiling mappings to bridge applications and databases
Authors: Sergey Melnik, Atul Adya, Philip A. Bernstein
Venue: ACM Transactions on Database Systems (TODS) (2008)

Translating data and data access operations between applications and databases is a longstanding data management problem. We present a novel approach to this problem, in which the relationship between the application data and the persistent storage is specified using a declarative mapping, which is compiled into bidirectional views that drive the data transformation engine. Expressing the application model as a view on the database is used to answer queries, while expressing the database schema as a view on the application model allows us to leverage view maintenance algorithms for update translation. This approach has been implemented in a commercial product. It enables developers to interact with a relational database via a conceptual schema and an object-oriented programming surface. We outline the implemented system and focus on the challenges of mapping compilation, which include rewriting queries under constraints and supporting nonrelational constructs.
Derivation of dynamic electric and magnetic response properties based on the quasienergy derivative method
Authors: Takao Kobayashi, Kotoku Sasagane, Kizashi Yamaguchi
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

We present a response theory based on the quasienergy derivative (QED) method in which not only the electric dipole interaction but also the magnetic dipole and diamagnetic interactions are considered as interactions between a (spin- and orbit-nondegenerate) molecular system and a time-dependent electromagnetic field. The QED method-based systematic derivation of dynamic electric and magnetic response properties in an exact theory and two approximate models (time-dependent Hartree-Fock (TDHF) and (orbital-nonrelaxed) coupled-cluster (CC) theories) is shown. Among dynamic electric and magnetic response properties, we present the explicit derivation of electric dipole-magnetic dipole polarizability ($G_{A,E}(-&omega;_1;&omega;_1)$), magnetizability ($&chi;_{EF}(-&omega;_1;&omega;_1)$), and hypermagnetizability ($&eta;_{AB,EF}(-&omega;_&sigma;;&omega;_1,&omega;_2,&omega;_3)$).
A Visualization of Genetic Algorithm Using the Pseudo-color
Authors: Shin-Ichi Ito, Yasue Mitsukura, Hiroko Nakamura Miyamura, Takafumi Saito, Minoru Fukumi
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

In this paper, we propose a visualization method to grasp the search process and results in the binary-coded genetic algorithm. The representation, the choices of operations, and the associated parameters can each make a major difference to the speed and the quality of the final result. These parameters are decided interactively and very difficult to disentangle their effects. Therefore, we focus on the chromosome structure, the fitness function, the objective function, the termination conditions, and the association among these parameters. We can indicate the most important or optimum parameters in visually. The proposed method is indicated all individuals of the current generation using the pseudo-color. The pixels related a gene of the chromosome are painted the red color when the gene of the chromosome represents `1', and the pixels related to one are painted the blue color when one represents `0'. Then the brightness of the chromosome changes by the fitness value, and the hue of the chromosome changes by the objective value. In order to show the effectiveness of the proposed method, we apply the proposed method to the zero-one knapsack problems.
Small Water Clusters: The Cases of Rare Gas-Water, Alkali Ion-Water and Water Dimer
Authors: Margarita Albertí, Antonio Aguilar, Massimiliano Bartolomei, David Cappelletti, Antonio Laganà, Josep M. Lucas, Fernando Pirani
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

The role played by the various components of the intermolecular interaction in some clusters involving water molecules is discussed. In particular, the main features of some rare gas-water (Rg-H2O), alkali ion-water (M + -H2O) and small pure water (H2O)n clusters have been investigated and the tendency of multicenter van der Waals components (size repulsion + dispersion-attraction) to coalesce on a single interaction centre located on the oxygen atom as the strength of the interaction increases, is discussed. The interplay between induction and electrostatic components for the various systems is also analysed and the impact on the formulation of the intermolecular potentials of relevance for molecular dynamics simulations is considered.
Pseudo-wave decomposition high-order method for magnetogasdynamics
Authors: T. Gomez
Venue: Journal of Computational Physics (2008)

A new characteristics-based decomposition of the ideal magnetogasdynamic equations is derived. This formulation consists in representing the temporal variation of the physical quantities pressure, velocity, magnetic field and entropy as a linear combination of the generic advective terms corresponding to each wave type occurring in the medium. The flux terms can then be handled with existing high-order upwind dispersion relation preserving schemes; those being specifically chosen in our case to increase numerical accuracy and improve stability. Another feature of the new formulation of the non-ideal governing equations is that the boundary conditions are exactly satisfied at the frontiers of the computational domain. The accuracy of the method is assessed by comparison between numerical and exact solutions. Good agreement is obtained between computed and exact solutions.
Classification of Fabric Defect Based on PSO-BP Neural Network
Authors: Suyi Liu, Jingjing Liu, Leduo Zhang
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

The particle swarm optimization was applied in BP neural network training. It reasonably confirms threshold and connection weight of neural network, and improves capability of solving problems in realities. Meanwhile, PSO-BP neural network is applied into classification of fabric defect. The method of orthogonal wavelet transform was used to decompose monolayer from fabric image. And the sub-images of horizontal and vertical direction are extracted to represent respectively the textures of fabric in warp and weft. Compared classification of PSO-BP neural network to classification of BP neural network, it is shown that PSO-BP neural network achieves favorable results.
Towards a deeper understanding of cell phones in schools: aligning school policy
Authors: Kay Fielden, Pam Malcolm
Venue: International Journal of Mobile Learning and Organisation (2008)

In this qualitative research study conducted in 12 New Zealand secondary schools data was gathered on policy formation on a range of issues including: cell phone usage at school; mobile technology incorporated into learning; staff development; curriculum development; assessment, school and class management; and registration and enrolment. Participants included school principals, deans, heads of department, guidance officers, teachers and prior students. There appears to be limited use of cell phones for school-related learning, training and management activities.