ppxscal/embedding_network huggingface dataset:
The Application of Watersnakes Algorithm in Segmentation of the Hippocampus from Brain MR Image
Authors: Xiang Lu, Shuqian Luo
Venue: Medical Imaging and Informatics: 2nd International Conference, MIMI 2007, Beijing, China, August 14-16, 2007 Revised Selected Papers (2008)

The application of watersnakes algorithm in segmentation of hippocampus MR image has been investigated.This algorithm integrates the watershed transform and the active contour algorithm. The watershed transform, based on mathematical morphology, is powerful and flexible for segmentation. However, it does not allow the characteristics of region boundaries to be included in the way that active contour algorithm does. So, over-segmentation is shown in the result of watershed transform, this phenomenon is even worse for the segmentation of hippocampus. For watersnakes algorithm, the primitive contour of hippocampus can be obtained using watershed transform. Based on energy-driven, the contour of hippocampus can develop into the ultimate result. In the process of energy-driven, the information relating to characteristics of region boundaries is involved.
Computing Lightweight Spanners Locally
Authors: Iyad A. Kanj, Ljubomir Perković, Ge Xia
Venue: Proceedings of the 22nd international symposium on Distributed Computing (2008)

We consider the problem of computing bounded-degree lightweight plane spanners of unit disk graphs in the local distributed model of computation. We are motivated by the hypothesis that such subgraphs can provide the underlying network topology for efficient unicasting and multicasting in wireless distributed systems. We present the first local distributed algorithm that computes a bounded-degree plane lightweight spanner of a given unit disk graph. The upper bounds on the degree, the stretch factor, and the weight of the spanner, are very small. For example, our results imply a local distributed algorithm that computes a plane spanner of a given unit disk graph U, whose degree is at most 14, stretch factor at most 8.81, and weight at most 8.81 times the weight of a Euclidean Minimum Spanning Tree of V(U).We show a wider application of our techniques by giving an O(nlogn) time centralized algorithm that constructs bounded-degree plane lightweight spanners of unit disk graphs (which include Euclidean graphs), with the best upper bounds on the spanner degree, stretch factor, and weight.
Complexity of Counting the Optimal Solutions
Authors: Miki Hermann, Reinhard Pichler
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

Following the approach of Hemaspaandra and Vollmer, we can define counting complexity classes #$\cdot\mathcal{C}$ for any complexity class of decision problems. In particular, the classes with k ¿ 1 corresponding to all levels of the polynomial hierarchy have thus been studied. However, for a large variety of counting problems arising from optimization problems, a precise complexity classification turns out to be impossible with these classes. In order to remedy this unsatisfactory situation, we introduce a hierarchy of new counting complexity classes #·Opt k P and #·Opt k P[log n] with k ¿ 1. We prove several important properties of these new classes, like closure properties and the relationship with the -classes. Moreover, we establish the completeness of several natural counting complexity problems for these new classes.
A Runtime Constraint-Aware Solution for Automated Refinement of IT Change Plans
Authors: Weverton Luis Costa Cordeiro, Guilherme Sperb Machado, Fabrício Girardi Andreis, Alan Diego Santos, Cristiano Bonato Both, Luciano Paschoal Gaspary, Lisandro Zambenedetti Granville, Claudio Bartolini, David Trastour
Venue: Proceedings of the 19th IFIP/IEEE international workshop on Distributed Systems: Operations and Management: Managing Large-Scale Service Deployment (2008)

Change design is one of the key steps within the IT change management process and involves defining the set of activities required for the implementation of a change. Despite its importance, existing approaches for automating this step disregard the impact that actions will cause on the affected elements of the IT infrastructure. As a consequence, activities that compose the change plan may not be executable, for example, due to runtime constraints that emerge during the change plan execution (e.g., lack of disk space and memory exhaustion). In order to address this issue, we propose a solution for the automated refinement of runtime constraint-aware change plans, built upon the concept of incremental change snapshots of the target IT environment. The potential benefits of our approach are (i) the generation of accurate, workable change plans, composed of activities that do not hinder the execution of subsequent ones, and (ii) a decrease in the occurrence of service-delivery disruptions caused by failed changes. The experimental evaluation carried out in our investigation shows the feasibility of the proposed solution, being able to generate plans less prone to be prematurely aborted due to resource constraints.
Implementation and Stability Analysis of the Fuzzy Controller Based on Electric-Driven Simulation Turntable
Authors: Xie Mu-jun, Wang Lian-ming, Wang Zhi-qian
Venue: Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management - Volume 02 (2008)

Fuzzy controller was used to resolve the problem of fast tracking and overshoot in electric-driven simulation turntable, for its essence belongs to PD control. In this system, the control rules of fuzzy controller were established according to the step dynamic response process, for the speed loop of this system was predigested to be second-orders system. The describing function method was adopted to analyze the stability of the fuzzy control system. It gave the information of stability of system intuitively. The fuzzy controller had been applied in this system successfully. The simulation turntable had no overshooting nearly when its step input signal was close to 90 degrees. Experimental results show the implementation method of fuzzy controller is not only simple but also effectual in engineering practice. It also provides an approach of design of fuzzy controller for motion control system.
Directable animation of elastic bodies with point-constraints
Authors: Ryo Kondo
Venue: Computer Animation and Virtual Worlds (2008)

We propose a simple framework for making elastic body animation with point constraints. In general, a physics-based approach for constraint animation offers a variety of animations with physically correct realism, which are achieved by solving the equations of motion. However, in the digital animation industry, solving the equations of motion is an indirect path to creating more art-directed animations that maintain a plausible realism. Our algorithms provide animators a practical way to make elastic body animation with plausible realism, while effectively using point-constraints to offer directatorial control. The animation examples illustrate that our framework creates a wide variety of point-constraint animations of elastic objects with greater directability than existing methods. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Location Privacy-An Overview
Authors: Michael Decker
Venue: Proceedings of the 2008 7th International Conference on Mobile Business (2008)

Location-based services (LBS) are mobile services which evaluate knowledge about a user's location. In most cases this is done to provide the user with personalized information, e.g. to list point of interests in his nearer surrounding. But users have concerns when their whereabouts are tracked and their location information is disclosedto external service providers. So it is no wonder that a lot of publications deal with the specific privacy issues of LBS usage. The aim of this article is to give an overview about the most relevant works in this field: we first discuss different attack scenarios where location information is misused. Afterwards we present a classification of technical approaches to prevent such misuse of location information. We also summarize some results from pertinent empirical studies.
Computational Proteomics of Biomolecular Interactions in Sequence and Structure Space of the Tyrosine Kinome: Evolutionary Constraints and Protein Conformational Selection Determine Binding Signatures of Cancer Drugs
Authors: Gennady M. Verkhivker
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

The emerging insights into kinase function and evolution combined with a rapidly growing number of crystal structures of protein kinases complexes have facilitated a comprehensive structural bioinformatics analysis of sequence---structure relationships in determining the binding function of protein tyrosine kinases. We have found that evolutionary signal derived solely from the tyrosine kinase sequence conservation can not be readily translated into the ligand binding phenotype. However, fingerprinting ligand---protein interactions using in silico profiling of inhibitor binding against protein tyrosine kinases crystal structures can detect a functionally relevant kinase binding signal and reconcile the existing experimental data. In silico proteomics analysis unravels mechanisms by which structural plasticity of the tyrosine kinases is linked with the conformational preferences of cancer drugs Imatinib and Dasatinib in achieving effective drug binding with a distinct spectrum of the tyrosine kinome. While Imatinib binding is highly sensitive to the activation state of the enzyme, the computed binding profile of Dasatinib is remarkably tolerant to the conformational state of ABL. A comprehensive study of evolutionary, structural, dynamic and energetic aspects of tyrosine kinases binding with clinically important class of inhibitors provides important insights into mechanisms of sequence---structure relationships in the kinome space and molecular basis of functional adaptability towards specific binding.
Online Clustering of Non-stationary Data Using Incremental and Decremental SVM
Authors: Khaled Boukharouba, Stéphane Lecoeuche
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

In this paper we present an online recursive clustering algorithm based on incremental and decremental Support Vector Machine (SVM). Developed to learn evolving clusters from non-stationary data, it is able to achieve an efficient multi-class clustering in a non-stationary environment. With a new similarity measure and different procedures (Creation, Adaptation: incremental and decremental learning, Fusion and Elimination) this classifier can provide optimal updated models of data.
The Modeling of the External Cost Influence on the Modal Split in the Transport Network
Authors: Jacyna Marianna
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

The chosen aspects of external costs generated by transportation were introduced in the article. One of the major problems relating to modern transport systems is the accurate evaluation of the suitability of the transport network infrastructure components for the actual transport tasks performed. The paper presents a certain approach to modal split in the transport network, when environmental cost is taking into account. The external costs of transportation are costs connected with negative for natural environment and the man life as the results of the forwarding activity. That is why the development of balanced transport system, friendly for natural environment and man, is very important (Basiewicz et all 2000, Jacyna 1999, 2003). The paper suggested that to evaluate the development, should are study many alternative variants of the transport task allocation, and on this basis select one of the variants.
Interest Point Based Medical Image Retrieval
Authors: Xia Zheng, Mingquan Zhou, Xingce Wang
Venue: Medical Imaging and Informatics: 2nd International Conference, MIMI 2007, Beijing, China, August 14-16, 2007 Revised Selected Papers (2008)

The technology of medical image retrieval in picture archiving and communication systems (PACS) is of great importance. A shape prior algorithm retrieval based on interest point is presented in this paper. Firstly, according to the formulaic composition of a medical image, a Harris point detector is improved to extract some interest points in images. Secondly, by combining invariants for each point and an edge type histogram, the feature vector for matching is constructed. Finally, a strategy for matching vectors is implemented to retrieve medical images. The test results prove the efficiency of this approach.
Self-assembled metallic nanocrystal structures for advanced non-volatile memory applications
Authors: Ralf Hofmann, Nety Krishna
Venue: Microelectronic Engineering (2008)

Nanocrystal (NC) based non-volatile memories are a leading candidate to replace conventional floating gate memory. Substituting the poly-silicon gate with a layer of discrete nanocrystals or nanodots provides increased immunity to charge loss. Metallic nanocrystals have been found to be advantageous over Si- or Ge-based approaches due to good controllability of the size distribution and the achievable NC densities as well as increased charge storage capacity of metallic nanocrystals. Sufficiently high NC densities have been achieved to demonstrate feasibility for sub-32nm node non-volatile memory devices.
The Genetic Development of Uninorm-Based Neurons
Authors: Angelo Ciaramella, Witold Pedrycz, Roberto Tagliaferri
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

In this study, we are concerned with a new category of logic connectives and logic neurons based on the concept of uninorms. Uninorms are a generalization of t-norms and t-conorms used for composing fuzzy sets. We discuss the development of such constructs by using genetic algorithms. In this way we optimize a suite of parameters encountered in uninorms, especially their identity element. In the sequel, we introduce a class of logic neurons based on uninorms (which will be refereed to as unineurons). The learning issues of the neurons are presented and some experimental results obtained for synthetic and benchmark data are reported.
A backtracking-based algorithm for hypertree decomposition
Authors: Georg Gottlob, Marko Samer
Venue: Journal of Experimental Algorithmics (JEA) (2009)

Hypertree decompositions of hypergraphs are a generalization of tree decompositions of graphs. The corresponding hypertree-width is a measure for the acyclicity and therefore an indicator for the tractability of the associated computation problem. Several NP-hard decision and computation problems are known to be tractable on instances whose structure is represented by hypergraphs of bounded hypertree-width. Roughly speaking, the smaller the hypertree-width, the faster the computation problem can be solved. In this paper, we present the new backtracking-based algorithm det-k-decomp for computing hypertree decompositions of small width. Our benchmark evaluations have shown that det-k-decomp significantly outperforms opt-k-decomp, the only exact hypertree decomposition algorithm so far. Even compared to the best heuristic algorithm, we obtained competitive results as long as the hypergraphs are sufficiently simple.
A Watermarking Algorithm for Embedding of MIDI Information in the Digital Music Score
Authors: Genfang Chen, Wenjun Zhang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

A blind watermarking algorithm for the embedding of MIDI (Musical Instrument Digital Interface) information into the binary music score image based on the OMR (Optical Music Recognition) technology is presented in this paper, and the information of digital music score and MIDI can be reconstructed. The experiment results show that the algorithm has no effect to the precision of music score recognition, and will be available to the integrity auditing and the synchronized transmit of digital music score and its MIDI information.
Intelligent digital redesign revisited: Approximate discretization and stability limitation
Authors: Ho Jae Lee, Do Wan Kim
Venue: Fuzzy Sets and Systems (2008)

This paper sharpens the recently developed intelligent digital redesign (IDR) technique in regard of stability. A major assumption in the previous result was that the firing strength of each fuzzy rule is approximated as its sampled value during a sampling period for efficient discretization of the Takagi-Sugeno (T-S) fuzzy system, by which some unexpected stability might be experienced for certain sampling period as large as the assumption is unrealistic. To clarify results for that case, we refine the IDR condition and prove that the uniformly semiglobal practical asymptotic stability of the sampled-data T-S fuzzy control system by the intelligently redesigned digital fuzzy controller, rather than the global exponential stability shown in the previous result.
Generating GO Slim Using Relational Database Management Systems to Support Proteomics Analysis
Authors: Getiria Onsongo, Hongwei Xie, Timothy J. Griffin, John Carlis
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

The Gene Ontology Consortium built the Gene Ontology database (GO) to address the need for a common standard in naming genes and gene products. Using different names for the same concepts and different concepts with the same name makes it effectively impossible for humans and computers alike to analyze biological processes across different organisms. The consortium addresses this need by defining terms for categorizing genes and gene products. A convention in GO is that each gene or gene product is annotated to the most specific GO term in the GO database. It is, however, also useful for researchers to be able to group genesor gene products into broad biological categories that give a higher-level view of their function when analyzing results of an experiment. A GO Slim is a subset of the GO ontology that provides such a higher-level view of functions. Existing GO Slim generation tools have two important limitations: programming language dependence, and an inability to dynamically generate a GO Slim while analyzing. We have extended the relational database engine to dynamically generate a GO Slim overcoming this limitations. Using this extention, we have developed a tool (Dynamic GOSlim) that dynamically generates a GO Slim and uses the generated GO Slim to categorize genes or gene products. This tool is being used in an ongoing proteomics project aimed at identifying possible oral cancer biomarkers in saliva.
The Impact of Multimedia Extensions for Multimedia Applications on Mobile Computing Systems
Authors: Jong-Myon Kim
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

Multimedia is a key element in human-computer interaction systems. Multimedia applications, however, are among the most dominant computing workloads driving innovations in high performance and low power imaging systems. Parallel implementations of multimedia applications mostly focus on the use of parallel computers. Modern general-purpose processors, however, have employed multimedia extensions (e.g., MMX, VIS, MAX, AltiVec) or subword parallel instructions to their instruction set architectures to improve the performance of multimedia. This paper quantitatively evaluates the impact of multimedia extensions on multiprocessor systems to exploit subword level parallelism (SLP) in addition to data level parallelism (DLP). Experimental results for a set of multimedia applications on a representative multiprocessor array shows that MMX (a representative Intel's multimedia extension) achieve an average speedup ranging from 3x to 5x over the same baseline multiprocessor array. MMX also outperforms baseline in both area efficiency (a 13% increase) and energy consumption (a 73% decrease), resulting in better component utilization and sustainable battery life. These results demonstrate that MMX is a suitable candidate for mobile multimedia computing systems.
A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms
Authors: Olivier Hermant, James Lipton
Venue: Proceedings of the 22nd international workshop on Computer Science Logic (2008)

We give a fully constructive semantic proof of cut elimination for intuitionistic type theory with axioms. The problem here, as with the original Takeuti conjecture, is that the impredicativity of the formal system involved makes it impossible to define a semantics along conventional lines, in the absence, a priori, of cut, or to prove completeness by induction on subformula structure. In addition, unlike semantic proofs by Tait, Takahashi, and Andrews of variants of the Takeuti conjecture, our arguments are constructive.Our techniques offer also an easier approach than Girard's strong normalization techniques to the problem of extending the cut-elimination result in the presence of axioms. We need only to relativize the Heyting algebras involved in a straightforward way.
Merkle Signatures with Virtually Unlimited Signature Capacity
Authors: Johannes Buchmann, Erik Dahmen, Elena Klintsevich, Katsuyuki Okeya, Camille Vuillaume
Venue: Proceedings of the 5th international conference on Applied Cryptography and Network Security (2007)

We propose GMSS, a new variant of the Merkle signature scheme. GMSS is the first Merkle-type signature scheme that allows a cryptographically unlimited (280) number of documents to be signed with one key pair. Compared to recent improvements of the Merkle signature scheme, GMSS reduces the signature size as well as the signature generation cost.
A Novel Genetic Algorithm Based on Dynastic Changes Mechanism of Nation
Authors: Chao-Xue Wang, Chang-Hua Li, Fei Qi, Zhi-Jie Li
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

On the basis of the analysis of canonical genetic algorithm's shortage, a novel genetic algorithm based on dynastic changes mechanism of nation (DCGA) is proposed. In DCGA, populations one by one evolve according to the relay race mode, by which the DCGA holds a mechanism of transferring from a local optimal solution to another better one and finally finding the global optimal solution under the guidance of knowledge, which is continuously updated along with the alternation of population evolution. To evaluate DCGA, TSP is applied. The results of simulation show that DCGA can avoid premature convergence and evolutionary stagnation efficiently and has the strong ability of realizing the global optimization.