ppxscal/embedding_network huggingface dataset:
A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI
Authors: Minzhu Xie, Jianxin Wang, Jianer Chen
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

Given the genotype and the aligned single nucleotide polymorphism (SNP) fragments of an individual, Minimum Error Correction with Genotype Information (MEC/GI) is an important computational model to infer a pair of haplotypes compatible with the genotype by correcting minimum number of SNPs in the given SNP fragments. For the problem, there has been no practical exact algorithm. In DNA sequencing experiments, due to technical limits, the maximum length of a fragment sequenced directly is about 1kb. In consequence, the maximum number k of SNP sites that a fragment covers is usually small (usually smaller than 10). Based on the observation above, the current paper introduces a new parameterized dynamic programming algorithm of running time O(m k 2 k + mlogm + mk), where m is the number of fragments. The algorithm solves the MEC/GI problem efficiently even if the number of fragments and SNPs are large, and is practical in real biological applications.
Power-Efficient Heterogeneous Multicore Technology for Digital Convergence
Authors: Kunio Uchiyama
Venue: Proceedings of the 12th Asia-Pacific conference on Advances in Computer Systems Architecture (2007)

In recent mobile phones, car navigation systems, digital TVs, and other consumer electronic devices, there is a trend toward digital convergence in which a single device has the ability to process various kinds of applications. At the same time, considering the processing of media content, these devices must be capable of encoding and decoding video images and audio data based on MPEG2, MPEG4, H.264, VC-1, MP3, AAC, WMA, RealAudio, and other formats. Moreover, the latest DVD recorders have the ability to automatically generate digests of video images by using audio and image recognition technology. These kinds of digital convergence devices must be able to flexibly process various kinds of data--media, recognition, data, communications, and so on--and the SoC (System-on-Chip) that is embedded in the devices must deliver superior performance while consuming very small power.
A Novel Associative Memory System Based Modeling and Prediction of TCP Network Traffic
Authors: Jun-Song Wang, Zhi-Wei Gao, Ning-Shou Xu
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

This paper proposes a novel high-order associative memory system (AMS) based on the Newton's forward interpolation (NFI), The Interpolation Polynomials and training algorithms for the new AMS scheme are derived. The proposed novel AMS is capable of implementing error-free approximation to complex nonlinear functions of arbitrary order. A method Based on NFI-AMS is designed to model and predict network traffic dynamics, which is capable of modeling the complex nonlinear behavior of a traffic time series and capturing the properties of network traffic. The simulation results showed that the proposed scheme is feasible and efficient. Furthermore, the NFI-AMS based traffic prediction can be used in more fields for network design, management and control.
Topic Detection via Participation Using Markov Logic Network
Authors: Victor Cheng, C. H. Li
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

The advent of Web2.0 enables the proliferation of online communities in which tremendous number of Internet users contribute and share enormous information. Proper exploitation of community structure help retrieving useful information and better understanding of their features. We employ Markov Logic Network to explore topic tracking by finding clusters, which represents latent topics, best fitting a set of rules. Rather than using contents in investigating discussions of a community, the user participation is used because it is believed that topics can be somehow reflected by the preferences of participation. User participation is also easier to process than text. The clustering results show this approach can reveal latent topics of a community effectively.
Software Product Lines Doctoral Symposium
Authors: Klaus Schmid
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

The SPLC doctoral symposium provides an opportunity for young researchers to get intensive feedback on their Ph.D. research. The symposium is open to all areas of product line engineering.
Dynamics of Approximate Information Fusion
Authors: Patrick Doherty, Barbara Dunin-Keplicz, Andrzej Szałas
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

The multi-agent system paradigm has proven to be a useful means of abstraction when considering distributed systems with interacting components. It is often the case that each component may be viewed as an intelligent agent with specific and often limited perceptual capabilities. It is also the case that these agent components may be used as information sources and such sources may be aggregated to provide global information about particular states, situations or activities in the embedding environment. This paper investigates a framework for information fusion based on the use of generalizations of rough set theory and the use of dynamic logic as a basis for aggregating similarity relations among objects where the similarity relations represent individual agents perceptual capabilities or limitations. As an added benefit, it is shown how this idea may also be integrated into description logics.
Spiking Neural P Systems. Power and Efficiency
Authors: Gheorghe Păun
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

This is a brief survey of spiking neural P systems, a branch of membrane computing recently introduced with motivation from neural computing. Basic ideas, examples, some results, and several research topics are presented.
Automated Test Generation and Verified Software
Authors: John Rushby
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

Testing remains the principal means of verification in commercial practice and in many certification regimes. Formal methods of verification will coexist with testing and should be developed in ways that improve, supplement, and exploit the value of testing. I describe automated test generation, which uses technology from formal methods to mechanize the construction of test cases, and discuss some of the research challenges in this area.
Corporate-, Agile- and Open Source Software Development: A Witch's Brew or An Elixir of Life?
Authors: Morkel Theunissen, Derrick Kourie, Andrew Boake
Venue: Balancing Agility and Formalism in Software Engineering: Second IFIP TC 2 Central and East European Conference on Software Engineering Techniques, CEE-SET 2007, Poznan, Poland, October 10-12, 2007, Revised Selected Papers (2008)

The observation that the Open Source Software development style is becoming part of corporate software development, raises questions about its compatibility with traditional development processes. Particular compatibility questions arise where the existing corporate development style is in the agile tradition. These questions are identified and discussed. Measures that can be taken to avoid clashes are suggested. An example illustrates how Corporate-, Agile- and Open Source Software could intersect, and SPEM modelling is employed to show how corporate processes would need to adapt to accommodate the new scenario.
Evidence and scenario sensitivities in naive Bayesian classifiers
Authors: Silja Renooij, Linda C. van der Gaag
Venue: International Journal of Approximate Reasoning (2008)

Empirical evidence shows that naive Bayesian classifiers perform quite well compared to more sophisticated classifiers, even in view of inaccuracies in their parameters. In this paper, we study the effects of such parameter inaccuracies by investigating the sensitivity functions of a naive Bayesian network. We show that, as a consequence of the network's independence properties, these sensitivity functions are highly constrained. We further investigate whether the patterns of sensitivity that follow from these functions support the observed robustness of naive Bayesian classifiers. In addition to standard sensitivities given available evidence, we also study the effect of parameter inaccuracies in view of scenarios of additional evidence. We show that standard sensitivity functions suffice to describe such scenario sensitivities.
Approximation of common fixed points of an infinite family of nonexpansive mappings in Banach spaces
Authors: Yeol Je Cho, Shin Min Kang, Xiaolong Qin
Venue: Computers Mathematics with Applications (2008)

Let C be a closed convex subset of a real uniformly smooth and strictly convex Banach space E. Consider the following iterative algorithm given by {x"0=x@?Carbitrarily chosen ,y"n=@b"nx"n+(1-@b"n)W"nx"n,x"n"+"1=@a"nf(x"n)+(1-@a"n)y"n,@?n>=0, where f is a contraction on C and W"n is a mapping generated by an infinite family of nonexpansive mappings {T"i}"i"="1^~. Assume that the set of common fixed points of this infinite family of nonexpansive mappings is not empty. In this paper, we prove that the sequence {x"n} generated by the above iterative algorithm converges strongly to a common fixed point of {T"i}"i"="1^~, which solves some variational inequality. Our results improve and extend the results announced by many others.
Differences between informational and transactional tasks in information seeking on the web
Authors: Hitoshi Terai, Hitomi Saito, Yuka Egusa, Masao Takaku, Makiko Miwa, Noriko Kando
Venue: Proceedings of the second international symposium on Information interaction in context (2008)

We examine the influence of task types on information-seeking behaviors on the Web by using screen capture logs and eye-movement data. Eleven participants performed two different types of web search, an informational task and a transactional task, and their think aloud protocols and behaviors were recorded. Analyses of the screen capture logs showed that the task type affected the participants' informationseeking behaviors. In the transactional task, participants visited more web pages than for the informational task, but their reading time for each page was shorter than in the informational task. A preliminary analysis of eye-movement data for nine participants revealed characteristics of the scanpaths followed in search result pages as well as the distribution of lookzones for each task.
Reducing CORBA Call Latency by Caching and Prefetching
Authors: Bernd Brugge, Christoph Vilsmeier
Venue: IEEE Distributed Systems Online (2003)

Method call latency is a major problem in approaches based on object-oriented middleware such as CORBA, DCOM, and RMI, especially for fine-grained server interfaces. A mechanism that groups method calls and caches results can reduce method call latency. The middleware runtime system does this transparently without affecting client code or server implementation.
P2P Evolutionary Algorithms: A Suitable Approach for Tackling Large Instances in Hard Optimization Problems
Authors: J. L. Laredo, A. E. Eiben, M. Steen, P. A. Castillo, A. M. Mora, J. J. Merelo
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

In this paper we present a distributed Evolutionary Algorithm (EA) whose population is structured using newscast, a gossiping protocol. This algorithm has been designed to deal with computationally expensive problems via massive scalability; therefore, we analyse the response time of the model using large instances of well-known hard optimization problems that require from EAs a (sometimes exponentially) bigger computational effort as these problems scale. Our approach has been matched against a sequential Genetic Algorithm (sGA) applied to the same set of problems, and we found that it needs less computational effort than the sGA in yielding success. Furthermore, the response time scales logarithmically with respect to the problem size, which makes it suitable to tackle large instances.
Exponential queuing system with negative customers and bunker for ousted customers
Authors: R. Manzo, N. Cascone, R. V. Razumchik
Venue: Automation and Remote Control (2008)

Consideration was given to the queuing system with Poisson flows of incoming positive and negative customers. For the positive customers, there is an infinite-capacity buffer. The arriving negative customer knocks out a positive customer queued in the buffer and moves it to an infinite-capacity buffer of ousted customers (bunker). If the buffer is empty, then the negative customer discharges the system without affecting it. After servicing the current customer, the server receives a customer from the buffer or, if the buffer is empty, the bunker. The customers arriving from both the buffer and bunker are distributed exponentially with the same parameter. Relations for calculation of the stationary distributions of the queues in the buffer and bunker were obtained.
From t-Closeness to PRAM and Noise Addition Via Information Theory
Authors: David Rebollo-Monedero, Jordi Forné, Josep Domingo-Ferrer
Venue: Proceedings of the UNESCO Chair in data privacy international conference on Privacy in Statistical Databases (2008)

t-Closeness is a privacy model recently defined for data anonymization. A data set is said to satisfy t-closeness if, for each group of records sharing a combination of key attributes, the distance between the distribution of a confidential attribute in the group and the distribution of the attribute in the data is no more than a threshold t. We state here the t-closeness property in terms of information theory and then use the tools of that theory to show that t-closeness can be achieved by the PRAM masking method in the discrete case and by a form of noise addition in the general case.
Fuzzy joystick control algorithm for telemanipulation approach
Authors: Daniela Gotseva
Venue: Proceedings of the 9th WSEAS International Conference on Fuzzy Systems (2008)

This research presents a fuzzy algorithm used in robot system with micro/nano telemanipulation control. Fuzzy variables and their values are defined and the corresponding fuzzy rules developed. The fuzzy algorithm is a modification of an existing Boolean logic algorithm, which facilitates the improvement of the operator's skills. The algorithm is realized using C++ fuzzy language extension and tested in a virtual environment.
Strong WORM
Authors: Radu Sion
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

We introduce a Write-Once Read-Many (WORM) storage system providing strong assurances of data retention and compliant migration, by leveraging trusted secure hardware in close data proximity. This is important because existing compliance storage products and research prototypes are fundamentally vulnerable to faulty or malicious behavior, as they rely on simple enforcement primitives ill-suited for their threat model. This is hard because tamper-proof processing elements are significantly constrained in both computation ability and memory capacity – as heat dissipation concerns under tamper-resistant requirements limit their maximum allowable spatial gate-density. We achieve efficiency by (i) ensuring the secure hardware is accessed sparsely, minimizing the associated overhead for expected transaction loads, and (ii) using adaptive overhead-amortized constructs to enforce WORM semantics at the throughput rate of the storage servers ordinary processors during burst periods. With a single secure co-processor, on single-CPU commodity x86 hardware, our architecture can support over 2500 transactions per second.
Towards verifying compliance in agent-based web service compositions
Authors: Alessio Lomuscio, Hongyang Qu, Monika Solanki
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

We explore the problem of specification and verification of compliance in agent based Web service compositions. We use the formalism of temporal-epistemic logic suitably extended to deal with compliance/violations of contracts. We illustrate these concepts using a motivating example where the behaviours of participating agents are governed by contracts. The composition is specified in OWL-S and mapped to our chosen formalism. Finally we use an existing symbolic model checker to verify the example specification whose state space is approximately 221 and discuss experimental results.
Fitting Nature's Basic Functions Part IV: The Variable Projection Algorithm
Authors: Bert W. Rust
Venue: Computing in Science and Engineering (2003)

In the previous installments, we described linear and nonlinear least squares calculations. The latter are considerably more difficult than the former. We will now examine the variable projection algorithm, which often greatly simplifies nonlinear least squares calculations because it does not require iteration on parameters that appear linearly in the model.
Weight Support Technique and the Symmetric Boolean Functions with Maximum Algebraic Immunity on Even Number of Variables
Authors: Longjiang Qu, Chao Li
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

The weight support technique is applied to study the symmetric Boo- lean functions with maximum algebraic immunity on even number of variables. The problem to study the n-variable(n even) symmetric Boolean functions with maximum algebraic immunity is reduced to the problem to determine $WS_{min}(n,\frac{n}{2})$. Then some new results about $WS_{min}(n,\frac{n}{2})$ are got. A fast algorithm to get all the n-variable(n even) symmetric Boolean functions with maximum algebraic immunity is also given.
Topic 6: Grid and Cluster Computing
Authors: Marco Danelutto, Juan Touriño, Mark Baker, Rajkumar Buyya, Paraskevi Fragopoulou, Christian Perez, Erich Schikuta
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Grid computing has been and continues to be one of the most popular research and development areas in computing science and technology. Much of the research activity in this field has been devoted to grid programming environments, applications, middleware, and system architecture. However, as technology evolves, new emerging challenges are faced, which stimulates further research in this area. Cluster computing is another key technology area, especially when high performance is taken into account.
Pacta Sunt Servanda but Where Is the Agreement? The Complicated Case of eCustoms
Authors: Helle Zinner Henriksen, Boriana Rukanova, Yao-Hua Tan
Venue: Proceedings of the 7th international conference on Electronic Government (2008)

This paper examines the role of regulation in eCustoms. We made use of a novel methodological approach, syntegration, to obtain the views of experts from government, businesses, technology providers and academics about barriers and drivers of eCustoms imlementation. During the syntegration workshop, regulation was perceived as both a barrier and a driver and in this paper we present the arguments of the participants on this issue. In our analysis, we attempt to discuss the practical value from the syntegration workshop by reflecting on the power of regulation when we move from a national to an international context which is the arena for eCustoms regulation. Our conclusion is that although at a national level regulation can be a powerful instrument for eCustoms implementation, the power of regulation fades to recommendations and soft law the more we move to an international level, and thus, making it a less powerful instrument for eCustoms implementation.
Fault Tolerance in Process Control: An Overview And Examples of European Products
Authors: Hubert Kirrmann
Venue: IEEE Micro (1987)

Fult-tolerant architectures vary widely. The key to choosing a cost-effective plant control system is to provide no more redundancy than necessary.
CDSS (Clinical Decision Support System) Architecture in Korea
Authors: Jeong Ah Kim, InSook Cho, Yoon Kim
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

We present architecture for implementing independent, extensible, and interoperable clinical decision support service in perspective of EHR. In this architecture, components for implementing independent knowledge service and interface mechanism with EHR service or existing hospital information system are identified. In our architecture knowledge engine is critical component for implementing knowledge service. In this paper, we suggested interoperable CDSS(clinical decision support system) architecture and knowledge engine architecture.
Enriching the class diagram concepts to capture natural language semantics for database access
Authors: Frank S. C. Tseng, Chun-Ling Chen
Venue: Data Knowledge Engineering (2008)

Research on accessing databases using natural languages usually utilizes an intermediate logical form for the mapping process from natural languages to database query languages. However, there is still much that needs to be accomplished to bridge the gap between natural language constructs and database schemas. In this paper, we present a translation scheme for transforming natural language queries into relational algebra through the class diagram representations. Based on a logical form developed by extending the UML class diagram notations, a transformation model is presented to support the automatic transformation of natural language queries into relational algebra by employing appropriate natural language processing techniques and object-oriented analysis methods. The proposed logical form has the advantage that it can be mapped from natural language constructs by referring to the conceptual schema modeled by class diagrams, and can be efficiently transformed into relational algebra for query execution. We believe the whole process could offer a clear and natural framework for processing natural language queries to retrieve data from database systems.
Generalized Ring Signatures
Authors: Jian Ren, Lien Harn
Venue: IEEE Transactions on Dependable and Secure Computing (2008)

Ring signature was first introduced in 2001. In a ring signature, instead of revealing the actual identity of the message signer, it specifies a set of possible signers. The verifier can be convinced that the signature was indeed generated by one of the ring members, however, she is unable to tell which member actually produced the signature. In this paper, we propose a generalized ring signature scheme and a generalized multi-signer ring signature based on the original ElGamal signature scheme. The proposed ring signature can achieve unconditional signer ambiguity and is secure against adaptive chosen-message attacks in the random oracle model. Comparing to ring signature based on RSA algorithm, the proposed generalized ring signature scheme has three advantages: (1) all ring members can share the same prime number and all operations can be performed in the same domain; (2) by combining with multi-signatures, we can develop the generalized multi-signer ring signature schemes to enforce cross-organizational involvement in message leaking. It may result in a higher level of confidence or broader coverage on the message source; and (3) the proposed ring signature is a convertible ring signature. It enables the actual message signer to prove to a verifier that only she is capable of generating the ring signature.