ppxscal/embedding_network huggingface dataset:
Multichromosomal Genome Median and Halving Problems
Authors: Eric Tannier, Chunfang Zheng, David Sankoff
Venue: Proceedings of the 8th international workshop on Algorithms in Bioinformatics (2008)

Genome median and halving problems aim at reconstructing ancestral genomes and the evolutionary events leading from the ancestor to extant species. The NP-hardness of the breakpoint distance and reversal distance median problems for unichromosomal genomes do not easily imply the same for the multichromosomal case. Here we find the complexity of several genome median and halving problems, including a surprising polynomial result for the breakpoint median and guided halving problems in genomes with circular and linear chromosomes; the multichromosomal problem is thus easier than the unichromosomal one.
Optimization of Knowledge in Companies Simulating M6PROK© Model Using as Hybrid Methodology a Neuronal Network and a Memetic Algorithm
Authors: Ana Maria Lara, Lourdes Sáiz, Joaquín Pacheco, Rafael Brotóns
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

The pursuit of this paper is to give answers to the companies in order to know how profitable the knowledge they are acquiring, updating and transferring is. The scope of the application is carry out through a recent developed model, called Model of the Six Profitable Stages (M6PROK©) applied in twenty three companies of the service sector. Feasibility of the aforementioned model, results and conclusions are proved through the display of a Hybrid Architecture based in Neural Nets and Memetic Algorithms.
Composition of Loop Modules in the Structural Blanks Approach to Programming with Recurrences: A Task of Synthesis of Nested Loops
Authors: Vytautas Čyras
Venue: Informatica (2007)

The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations and focuses on data dependencies in loops. The paper presents language constructs and semantics for expressing programs that have complex data dependency patterns. These constructs are expressed using structural &ldquo;blanks&rdquo; for computations based on recurrence relations. In SB the recurrence structure and the functional part of a recurrence relation may be described separately. Therefore declarative representation of data dependencies is examined. SB aims at supporting the transformational development and reuse of program modules. The approach deals with two aspects: pragmatics and semantics. In the paper we aim at: (1) developing a theory and language for functional and structural modules, (2) an algorithm for composition of structural modules. The approach is illustrated by toy problems: the Fibonacci function, heat flow, etc. Hence the reuse and verification are viewed as those of, e.g., stacks, queues, bubble sort, etc.
Digital Preservation Needs of Scientific Communities: The Example of Göttingen University
Authors: Heike Neuroth, Stefan Strathmann, Sven Vlaeminck
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

Digital information has become an integral part of our cultural and scientific heritage. We are increasingly confronted with scientific findings, historical events and cultural achievements presented in electronic form. The rapid pace of technical change is causing data carriers and data formats to age quickly. The result is an acute threat to the long-term usability of digital objects which serve as sources for science and research. The necessity for long-term preservation has to be anchored in the social context of the national information, research and cultural policy, and the global integrations of science and research. To examine the preservation needs in the context of large scaled research facilities the awareness and practices at the University of Göttingen and at the ETH Zürich was explored. As a first step, an online questionnaire was developed and conducted in summer 2007. The poster explains first findings of the online survey.
ANN Combined-Inversion Control for the Excitation System of Generator
Authors: Wan-Cheng Wang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

The implementation of the inversion based linearizing method for the excitation system usually requires the full state feedback. This severely restricts its practical use because some of these states are very difficult to measure by physical sensors in practice due to no sensor available in the market or its high cost. To address this issue, the combined-inversion is proposed by coupling the left-inversion used as a soft-sensor with the right-inversion used as a nonlinear controller. Furthermore, to overcome the difficulty in explicit implementation of the combined-inversion by analytic means, an artificial neural network (ANN) is used to approximate the combined-inversion, thus forming the ANN combined-inversion. The simulation results demonstrate the effectiveness of the ANN combined-inversion.
Visual Exploration of Genomic Data
Authors: Michail Vlachos, Bahar Taneri, Eamonn Keogh, Philip S. Yu
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

In this study, we present methods for comparative visualization of DNA sequences in two dimensions. First, we illustrate a transformation of gene sequences into numerical trajectories. The trajectory visually captures the nucleotide content of each sequence, allowing for fast and easy visualization of long DNA sequences. Then, we project the relative placement of the trajectories on the 2D plane using a spanning-tree arrangement method, which allows the efficient comparison of multiple sequences. We demonstrate with various examples the applicability of our technique in evolutionary biology and specifically in capturing and visualizing the molecular phylogeny between species.
Technical communique: A convex characterization of dynamically-constrained anti-windup controllers
Authors: C. Roos, J. -M. Biannic
Venue: Automatica (Journal of IFAC) (2008)

Based on a recent description of deadzone nonlinearities via local sector conditions, a new LMI characterization is proposed to compute full-order continuous-time anti-windup controllers with pole constraints. More precisely, an upper bound is introduced on the real part of the controller poles to avoid slow dynamics, which often leads to poor time-domain performance. As is demonstrated in a short applicative part, the introduction of such a bound allows us to efficiently handle the trade-off between stability domain enlargement and time-domain response relevance.
Super-Resolution of Face Images Based on Adaptive Markov Network
Authors: Dong Jun Huang, J. Paul Siebert, W. Paul Cockshott, Yi Jun Xiao
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Adopting a patch-based Markov Network as the fundamental mechanism, we first propose a patch-position constraint operation for searching matched patches in the training dataset to increase the probability value of observation function. For the hidden nodes, based on the first advantage and discovering that horizontal features of the face is more significant than vertical features visually, we create a local compatibility-checking algorithm which uses the most compatible neighboring patches along horizontal dimension of the face to synthesize the super-resolved outcome. Experiments demonstrate the effectiveness of the proposed algorithm.
Improving the Accuracy of Peer-to-Peer Sampling Services
Authors: Elth Ogston, Stephen A. Jarvis
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

Node sampling services provide peers in a peer-to-peer system with a source of randomly chosen addresses of other nodes. Ideally, samples should be independent and uniform. The restrictions of a distributed environment, however, introduce various dependancies between samples. We review gossip-based sampling protocols proposed in previous work, and identify sources of inaccuracy. These include replicating the items from which samples are drawn, and imprecise management of the process of refreshing items. Based on this analysis, we propose a new protocol, Eddy, which seeks to minimize temporal and spatial dependancies between samples. We demonstrate that these changes lead to a better sampling service by showing, through simulations, that using Eddy improves the accuracy of a network-size estimation algorithm that uses the random samples from the protocol.
Automatic blood sampling in dairy cows
Authors: Anders Fønss, Lene Munksgaard
Venue: Computers and Electronics in Agriculture (2008)

Loose housing systems for dairy cows are becoming increasingly common, raising new questions in the area of animal health and welfare. Some of these questions can be addressed by studying the variation in blood parameters, such as glucocortistioids. However, the traditional manual blood sampling procedure can in itself affect the responses of the animal. To address this issue we have developed a device for automated collection of multiple blood samples. The device is placed on the back of the animal and allows the animal to be kept in all types of environments, either alone or in social groups. The animal can move freely: no restraints and no handling of the animal are necessary during blood sampling. Three experiments were conducted to study the performance of the system and how the blood sampling procedure affected the cortisol responses in dairy cows. In the first experiment the accuracy of sample size and timing were investigated. In the second experiment, automatic samples were collected from six cows kept in tie-stalls, with samples taken at 3-min intervals for 38min. At 12, 24, 36 and 38min, a manual sample was taken by vein puncture. None of the cows showed a consistently increased cortisol response to automatic sampling, while two cows showed increased cortisol concentration after vein puncture. In the third experiment automatic blood sampling was conducted with 12 cows kept in a loose housing system. In the morning, over a period of 1.5h, 14 blood samples were taken at varying time intervals from each cow. In the afternoon, over a period of 2.5h, a further 14 samples were taken. Cortisol concentrations in the blood samples suggest that the cows were not affected by the blood sampling procedure. On some occasions during these experiments, it was not possible to get a sample. For the manual vein puncture 3 out of 24 samples (12.5%) were not successfully taken within a time limit of 2min. During the automatic blood sampling process, the catheter occasionally became twisted and blocked by the movement of the cow's head. This occurred in 8 out of 84 samples (9.5%). In four of the manual samples, considerable hemolysis had occurred during the sampling procedure. No hemolysis was observed in the automatic blood samples. Automated blood sampling offers the opportunity to collect a series of samples without disturbing the animal. Data suggest that automatic blood sampling is a superior alternative to manual blood sampling, even in a tie barn.
JCAT: a platform for the TAC market design competition
Authors: Jinzhong Niu, Kai Cai, Simon Parsons, Enrico Gerding, Peter McBurney, Thierry Moyaux, Steve Phelps, David Shield
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers (2008)

Auctions, when well designed, result in desirable economic out-comes and have been widely used in solving real-world resource allocation problems, and in structuring stock or futures exchanges. The field of auction mechanism design has drawn much attention in recent years from economists, mathematicians, and computer scientists. In traditional auction theory, auctions are viewed as games of incomplete information and traditional analytic methods from game theory have been successfully applied to some simple types of auctions. However, the assumption of prior common knowledge in the incomplete information approach may not hold in some auctions, and computing analytic solutions may be infeasible in other auctions. Both of these problems hold in the case of continuous double auctions.
Computing Sharp 2-Factors in Claw-Free Graphs
Authors: Hajo Broersma, Daniël Paulusma
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

In a recently submitted paper we obtained an upper bound for the minimum number of components of a 2-factor in a claw-free graph. This bound is sharp in the sense that there exist infinitely many claw-free graphs for which the bound is tight. In this paper we extend these results by presenting a polynomial algorithm that constructs a 2-factor of a claw-free graph with minimum degree at least four whose number of components meets this bound. As a byproduct we show that the problem of obtaining a minimum 2-factor (if it exists) is polynomially solvable for a subclass of claw-free graphs. As another byproduct we give a short constructive proof for a result of Ryjá¿ek, Saito Schelp.
TMCP: Two-layer multicast communication protocol for Bluetooth radio networks
Authors: Chao-Tsun Chang, Chih-Yung Chang, Sheng-Wen Chang
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

Bluetooth is a low power, low cost, and short-range wireless technology developed for Personal Area Networks (PANs). A Bluetooth multicast group is a set of Bluetooth devices that desire for periodically receiving the multicast messages from the same source. For reducing the propagation delay and saving the bandwidth and energy consumptions, a multicast tree which connects all multicast members serves for the delivery of multicast messages. However, a given connected scatternet topology may not be appropriate for constructing an efficient multicast tree and hence causes power consumption and end-to-end delay. This paper develops a two-layer multicast communication protocol (TMCP) using role switching techniques for constructing an efficient multicast tree. The proposed TMCP collects as many as possible the members into the same piconet, reduces the length of multicast paths and assigns each member with a proper role. The constructed multicast tree has several features including as few as possible the non-member devices, the smallest tree level and the minimal propagation delay. Experiment results show that the TMCP offers efficient multicast service with low power consumption and small delay.
Fuzzy multiple modeling and fuzzy predictive control of a tubular heat exchanger system
Authors: A. H. Mazinan, N. Sadati
Venue: Proceedings of the 7th WSEAS International Conference on Application of Electrical Engineering (2008)

In this paper, a new strategy for control of a tubular heat exchanger system using multiple models approach has been presented. The proposed control strategy is realized using Takagi-Sugeno-Kang (TSK) fuzzy-based modeling. In this strategy, each environment of the system is first presented by an explicit linear model. Then for each model, its corresponding fuzzy generalized predictive controller is designed. For demonstrating the effectiveness of the proposed approach, simulations are done and the results are compared with those obtained using the single model predictive control approach. The results can verify the validity of the proposed control scheme.
An Identity-Based Signcryption Scheme for Multi-domain Ad Hoc Networks
Authors: Fagen Li, Yupu Hu, Chuanrong Zhang
Venue: Proceedings of the 5th international conference on Applied Cryptography and Network Security (2007)

As various applications of wireless ad hoc networks have been proposed, security has become one of the big research challenges and is receiving increasing attention. Recently, Several security schemes for wireless ad hoc networks have been proposed using identity-based signcryption schemes. However, almost all identity-based signcryption schemes that have been proposed until now are based on a single private key generator, which is not suitable for multi-domain ad hoc networks. In this paper, we propose a new identity-based signcryption scheme based on multiple private key generators, which is more suitable for multi-domain ad hoc networks. We prove its semantical security under the Decisional Bilinear Diffie-Hellman assumption in the random oracle model.
Stopping Criterion for Adaptive Algorithm
Authors: Sanjay Kumar Khattri
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Adaptive algorithm consists of many different parameters. For example, adaptive index, adaptive criterion and stopping criterion. The adaptivity index drives the adaptive algorithm by selecting some elements for further refinement. Apart from the driving force, another important aspect of an algorithm is its stopping criteria. We present a new stopping criterion for adaptive algorithm. 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
Haptic Rendering of Actuated Mechanisms by Active Admittance Control
Authors: Michael Strolz, Martin Buss
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

Virtual Prototyping with haptic feedback offers great benefits in the development process of actuated systems. We present a generic control scheme for the haptic rendering of actuated mechanisms, introducing the active admittance. It extends the conventional admittance control by modeling the actuation and the movable parts of the mechanism separately. This allows for an efficient iterative design and evaluation of an actuated mechanism and its single elements. The practicability of active admittance control is demonstrated by haptically rendering a car door with two actuated degrees-of-freedom.
Evaluating the Wisdom of Crowds in Assessing Phishing Websites
Authors: Tyler Moore, Richard Clayton
Venue: Financial Cryptography and Data Security: 12th International Conference, FC 2008, Cozumel, Mexico, January 28-31, 2008. Revised Selected Papers (2008)

We examine the structure and outcomes of user participation in PhishTank, a phishing-report collator. Anyone who wishes may submit URLs of suspected phishing websites, and may vote on the accuracy of other submissions. We find that PhishTank is dominated by its most active users, and that participation follows a power-law distribution, and that this makes it particularly susceptible to manipulation. We compare PhishTank with a proprietary source of reports, finding PhishTank to be slightly less complete and significantly slower in reaching decisions. We also evaluate the accuracy of PhishTank's decisions and discuss cases where incorrect information has propagated. We find that users who participate less often are far more likely to make mistakes, and furthermore that users who commit many errors tend to have voted on the same URLs. Finally, we explain how the structure of participation in PhishTank leaves it susceptible to large-scale voting fraud which could undermine its credibility. We also discuss general lessons for leveraging the `wisdom of crowds' in taking security decisions by mass participation.
On the solitons and nonlinear wave equations
Authors: Petre P. Teodorescu, Ligia Munteanu
Venue: Proceedings of the 9th WSEAS International Conference on Acoustics & Music: Theory & Applications (2008)

The paper is focused on the solitons and nonlinear equations for an uniaxial deformation problem. The aim is to determine a parametrical representation for a class of constitutive laws for nonhomogeneous media for which the motion equations attached to a material system, is associated to a pseudospherical surface (with negative Gaussian curvature K). A subclass of these constitutive laws can be associated to a Tzitzeica surface, for which the ratio K/d4(d is the distance from the origin to the tangent plane at an arbitrary point), is constant. A genetic algorithm is performed to study three inverse problems associated to some experimental results.
Research on Management of Resource Virtualization Based on Network
Authors: Gui-Lin Chen, Sheng-Hui Zhao, Li-Sheng Ma, Ming-Yong Pang
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

In order to satisfy the demands of individualized learning for various learners, it is necessary to reform the traditional resource management pattern to provide various learners an individualized learning platform and abundant resources. In this paper, the basic attributes of teaching resources are discussed firstly, and proposes to exert the resources using attributes by the virtualizing management. Thus, produces the definition of management of resource virtualization, and designs a layered management model of resources virtualization. Further, the article discusses the function and realization method of each layer, and proposes the concrete implementation suggestions. The developed partial practices developed showed that the virtual management could effectively promote resources sharing and expediently use for learners.
Markovian Characterisation of H.264/SVC Scalable Video
Authors: Dieter Fiems, Veronique Inghelbrecht, Bart Steyaert, Herwig Bruneel
Venue: Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications (2008)

In this paper, a multivariate Markovian traffic model is proposed to characterise H.264/SVC scalable video traces. Parametrisation by a genetic algorithm results in models with a limited state space which accurately capture both the temporal and the inter-layer correlation of the traces. A simulation study further shows that the model is capable of predicting performance of video streaming in various networking scenarios.
Finite relational structure models of topological spaces and maps
Authors: K. A. Hardie, P. J. Witbooi
Venue: Theoretical Computer Science (2008)

We define the notion of homotopy pushout in the category of binary reflexive relational structures and explore its basic properties. We construct finite models in this category, of spaces and maps in Top with a view to developing systematic methods in this regard.
Pitch Accents, Boundary Tones and Contours: Automatic Learning of Czech Intonation
Authors: Tomáš Duběda, Jan Raab
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

The present paper examines three methods of intonational stylization in the Czech language: a sequence of pitch accents, a sequence of boundary tones, and a sequence of contours. The efficiency of these methods was compared by means of a neural network which predicted the f0 curve from each of the three types of input, with subsequent perceptual assessment. The results show that Czech intonation can be learned with about the same success rate in all three situations. This speaks in favour of a rehabilitation of contours as a traditional means of describing Czech intonation, as well as the use of boundary tones as another possible local approach.