ppxscal/embedding_network huggingface dataset:
The Immune Network System with Chaotic Behavior
Authors: Algis Garliauskas
Venue: Informatica (2008)

In this paper the immune network system was presented by the sequence of species with new immunological components allowing more plausible to reflect the immune response processes. The mathematical model oriented to the describing of the more realistic immune processes in the dynamics allowed to organize the computational experiment in the first to demonstrate a possible very complex behavior including chaotic regimes. The results of modeling of dynamic immunological processes with chaotic behavior are represented and considered.
Iterative Solution of the Quasicontinuum Equilibrium Equations with Continuation
Authors: Matthew Dobson, Mitchell Luskin
Venue: Journal of Scientific Computing (2008)

We give an analysis of a continuation algorithm for the numerical solution of the force-based quasicontinuum equations. The approximate solution of the force-based quasicontinuum equations is computed by an iterative method using an energy-based quasicontinuum approximation as the preconditioner.The analysis presented in this paper is used to determine an efficient strategy for the parameter step size and number of iterations at each parameter value to achieve a solution to a required tolerance. We present computational results for the deformation of a Lennard-Jones chain under tension to demonstrate the necessity of carefully applying continuation to ensure that the computed solution remains in the domain of convergence of the iterative method as the parameter is increased. These results exhibit fracture before the actual load limit if the parameter step size is too large.
A Novel Text-Independent Speaker Verification System Using Ant Colony Optimization Algorithm
Authors: Shahla Nemati, Reza Boostani, Mohammad Davarpanah Jazi
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

Automatic speaker verification (ASV) has become increasingly desirable in recent years. This system in general, requires 20 to 40 features as input for satisfactory verification. In this paper, features size is reduced by Ant Colony Optimization (ACO) technique to increase the ASV performance. After feature reduction phase, feature vectors are applied to a Gaussian Mixture Model (GMM) which is a text-independent speaker verification Model. Experiments are conducted on a subset of TIMIT corpora. The results indicate that with the optimized feature set, the performance of the ASV system is improved. Moreover, the speed of verification is significantly increased because number of features is reduced over 73% which consequently decrease the complexity of our ASV system.
Can We Stop Software Theft?
Authors: Richard Stern, Jeffrey Squires
Venue: IEEE Micro (1982)

"purloining" object code from a ROM is probably not an infringement of US copyright law. However, it is unfair, and there is ample ground for legal action preventig it.
Symbolic counter-example generation for model checking
Authors: Mahmoud Askari, Hamid Shojaei, Fataneh Faghani
Venue: Proceedings of the 7th WSEAS International Conference on Application of Electrical Engineering (2008)

Because of the complexity of digital system validation, formal verification has become an important member of the EDA tools. In formal verification, counterexamples help identify design problems and debugging. Almost all existing verification tools generate one counterexample when a property fails. This paper investigates, how debugging can benefit from using more than one counter-example generated by the verification tool. A new method for making counterexample is proposed that is based on PIRE (Property Intermediate Representation with Extensibility) structure. In this method, all possible counterexamples are generated.
The Design and Realization of Agent Strong Migration Based on Type Inference
Authors: Hua Jiang, Xin Wang
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

Mobile Agent Technology covers migration mechanism, communication facilities and security system, of which migration mechanism, functioning as the basic and core technology, supports agents to roam and execute consecutively on the network. The thesis analyzes the inner-relation of migration mechanism, and proposes the designing of Agent Transparent Migration based on Type Inference, so as to design and develop Java.JHW. Agent pack which can support Agent Transparent Migration. Because the method can deal with the problem of Transparent Migration, without modifying Java Virtual Machine and adding extra-cost, which has two good characteristics: transplanting and integrality.
Boosting for Model-Based Data Clustering
Authors: Amir Saffari, Horst Bischof
Venue: Proceedings of the 30th DAGM symposium on Pattern Recognition (2008)

In this paper a novel and generic approach for model-based data clustering in a boosting framework is presented. This method uses the forward stagewise additive modeling to learn the base clustering models. The experimental results on relatively large scale datasets and also Caltech4 object recognition set demonstrate how the performance of relatively simple and computationally efficient base clustering algorithms could be boosted using the proposed algorithm.
OntoZilla: An ontology-based, semi-structured, and evolutionary peer-to-peer network for information systems and services
Authors: Yuh-Jzer Joung, Feng-Yuan Chuang
Venue: Future Generation Computer Systems (2009)

We present a system called ''OntoZilla'', which combines ontologies and peer-to-peer (P2P) technology, with a vision of improving the information search process and facilitating greater integration as well as interoperability. In OntoZilla, peers supporting the same concept are grouped into the same cluster, and the relationships between clusters are modeled according to the concepts they specialize in. Therefore, a query belonging to a specific concept can be routed to the suitable group of peers in a systematic way, thus supporting efficient concept search. Moreover, since peer relationships are based on peers' expertises which may change over time, our semi-structured system can flexibly cope with the changing environment as peers evolve.
Adaptive Layered Multimedia Transmissions over Wireless Networks
Authors: Arjan Durresi, Vamsi Paruchuri, Mimoza Durresi, Leonard Barolli
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Layered transmission is a promising solution to multimedia transmission over Wireless Networks. However, since the number of layers is practically limited, noticeable mismatches would occur between the coarse-grained layer subscription levels and the heterogeneous and dynamic rate requirements from the receivers. In this paper, we propose Adaptive Layered Multicast (ALM) that exploits the increasing computing and communications capabilities of wireless devices. We show that by having few multicast nodes (about 10% the number of receivers) to encode and decode the video, an improvement of more than 30% in bandwidth efficiency could be achieved.
Islamic geometrical patterns indexing and classification using discrete symmetry groups
Authors: Mohamed Ould Djibril, Rachid Oulad Haj Thami
Venue: Journal on Computing and Cultural Heritage (JOCCH) (2008)

In this article, we propose a general computational model for the extraction of symmetry features of Islamic geometrical patterns' (IGP) images. We describe IGP images using the discrete symmetry groups theory. Our model contains the three following steps. (1) By noting that these patterns fall into three major categories, we begin our indexation process by classifying every pattern into one of these categories. The first pattern category describes all the patterns generated by translation along one direction. Every pattern of this category can be classified into one of the seven Frieze groups. The second type of pattern contains translational symmetries in two independent directions. Patterns of this category can be classified into one of the seventeen Wallpaper groups. The last type, called rosettes, describes patterns which begin at a central point and grow radially outward. We use rosette symmetry groups to classify patterns of this latter category. (2) For every pattern, we extract the symmetry features, namely, the symmetry group and the fundamental region, which is a representative region in the image from which the whole image can be regenerated. But for rosette groups, we can also compute the number of folds. (3) Finally, we describe the fundamental region by a simple color histogram and build the feature vector which is a combination of the symmetry feature (defined in the second step) and histogram information. Experiments show promising results for either IGP images' classification or indexing. Efforts for the subsequent task of classifying Islamic geometrical patterns' images can be significantly reduced.
Research on Resource Selection with Precedence and Due Date Constraint
Authors: Shujuan Li, Yong Liu, Yan Li, Yuefei Xu, Zhibin Zeng
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

In this paper, we consider the resource selection problem with due date constraint in production planning and control where the subtasks form a precedence network. We prove that this problem is NP-complete. Thus this problem cannot have any polynomial time solution algorithm at present. We establish a nonlinear integer-programming model for this problem, and prove the monotonicity properties of the objective function and constraint function in the model. Basing on our observations, we construct a Branch Bound method to solve the problem. The test results show that this algorithm is effective.
Connected Vertex Covers in Dense Graphs
Authors: Jean Cardinal, Eythan Levy
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in dense graphs, in which either the minimum or the average degree is linear. In particular, we prove tight parameterized upper bounds on the approximation returned by Savage's algorithm, and extend a vertex cover algorithm from Karpinski and Zelikovsky to the connected case. The new algorithm approximates the minimum connected vertex cover problem within a factor strictly less than 2 on all dense graphs. All these results are shown to be tight. Finally, we introduce the price of connectivity for the vertex cover problem, defined as the worst-case ratio between the sizes of a minimum connected vertex cover and a minimum vertex cover. We prove that the price of connectivity is bounded by 2/(1 + ¿) in graphs with average degree ¿n, and give a family of near-tight examples.
Parameterized Graph Editing with Chosen Vertex Degrees
Authors: Luke Mathieson, Stefan Szeider
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most k elementary editing operations; the operations are vertex deletion, edge deletion, and edge addition. We also consider more general annotated variants of this problem, where vertices and edges are assigned an integer cost and each vertex v has assigned its own desired degree ¿(v) ¿ {0,...,r}. We show that both problems are fixed-parameter tractable when parameterized by (k,r), but W[1]-hard when parameterized by k alone. These results extend our earlier results on problems that are defined similarly but where edge addition is not available. We also show that if edge addition and/or deletion are the only available operations, then the problems are solvable in polynomial time. This completes the classification for all combinations of the three considered editing operations.
Conceptual Model Generation from Requirements Model: A Natural Language Processing Approach
Authors: Azucena Montes, Hasdai Pacheco, Hugo Estrada, Oscar Pastor
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

In the conceptual modeling stage of the object-oriented development process, the requirements model is analyzed in order to establish the static structure (conceptual model) and dynamic structure (sequence diagrams, state diagrams) of the future system. The analysis is done manually by a requirements engineer, based upon his experience, the system's domain and certain rules of extraction of classes, objects, methods and properties. However, this task could get complicated when large systems are developed. For this reason, a method to automatically generate a conceptual model from the system's textual descriptions of the use case scenarios in Spanish language is presented. Techniques of natural language processing (NLP) and conceptual graphs are used as the basis of the method. The advantage of the proposed method, in comparison to other approaches [1, 2, 3], is that it makes exhaustive use of natural language techniques to face the text analysis. This allows us to consider text with a certain level of ambiguity and to cover relevant linguistic aspects, like composition of nouns, and verbal periphrases.
Research of Spam Filtering System Based on LSA and SHA
Authors: Jingtao Sun, Qiuyu Zhang, Zhanting Yuan, Wenhan Huang, Xiaowen Yan, Jianshe Dong
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

Along with the widespread concern of spam problem, at present, there are spam filtering system nowadays about the problem of semantic imperfection and spam filter low effect in the multi-send spam. This paper proposes a model of spam filtering which based on latent semantic analysis (LSA) and message-digest algorithm 5 (SHA). Making use of the LSA marks the latent feature phrase in the spam, semantic analysis is led into the spam filtering technique; the "e-mail fingerprint" of multi-send spam is born with SHA on the LSA analytical foundation, the problem of filtering technique's low effect in the multi-send spam is resolved with this kind of method. We have designed a spam filtering system based on this model. Our designed system was evaluated with an optional dataset. The results obtained were compared with KNN algorithm filter experiment results show that system based on Latent Semantic Analysis and SHA performs KNN. The experiments show the expected results obtained, and the feasibility and advantage of the new spam filtering method is validated.
On the Decidability of the Equivalence for k-Valued Transducers
Authors: Rodrigo Souza
Venue: Proceedings of the 12th international conference on Developments in Language Theory (2008)

We give a new proof for the decidability of the equivalence of two k-valued transducers, a result originally established by Culik and Karhümaki and independently by Weber. Our proof relies on two constructions we have recently introduced to decompose a k-valued transducer and to decide whether a transducer is k-valued. As a result, our proof is entirely based on the structure of the transducers under inspection, and the complexity it yields is of single exponential order on the number of states. This improves Weber's result by one exponential.
Toward Automatic Hint Generation for Logic Proof Tutoring Using Historical Student Data
Authors: Tiffany Barnes, John Stamper
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

We have proposed a novel application of Markov decision processes (MDPs), a reinforcement learning technique, to automatically generate hints for an intelligent tutor that learns. We demonstrate the feasibility of this approach by extracting MDPs from four semesters of student solutions in a logic proof tutor, and calculating the probability that we will be able to generate hints at any point in a given problem. Our results indicate that extracted MDPs and our proposed hint-generating functions will be able to provide hints over 80% of the time. Our results also indicate that we can provide valuable tradeoffs between hint specificity and the amount of data used to create an MDP.
Accessing and manipulating meaning of textual and data information for information assurance and security and intelligence information
Authors: Victor Raskin, Brian Buck, Arthur Keen, Christian F. Hempelmann, Katrina E. Triezenberg
Venue: Proceedings of the 4th annual workshop on Cyber security and information intelligence research: developing strategies to meet the cyber security and information intelligence challenges ahead (2008)

This extended abstract focuses on the crucial task of accessing meaning directly in natural language texts (NLT) and databases for the purposes of information assurance and security (IAS) and, especially, information intelligence. It is pretty obvious to all those involved in these areas that much if not most of the information that is pertinent for the various tasks in these fields is represented by NLTs and data from the Web, intercepted documents, research and position papers, print and media reports, etc. The paper deals with a unique approach, ontological semantics (OntoSem), that makes it possible to access the comprehensive meaning of texts and databases directly, emulating and approximating human understanding, and to manipulate it in various real-life applications, rather than trying to circumvent semantics with the juxtaposition of practically unimplementable formalisms, increasingly detailed syntactic parsers or ingenious cluster statistics on NLTs, which is most of the field of natural language processing (NLP) has been playing with in the last two decades.
Searching Trees with Sources and Targets
Authors: Chris Worman, Boting Yang
Venue: Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics (2008)

We consider a new pursuit-evasion problem on trees where a subset of vertices, called sources, are initially occupied by searchers. We also consider the scenario where some of the searchers must end their search at certain vertices called targets. We incrementally consider such problems, first considering only sources, then only targets, and finally we consider the case where there are both sources and targets. For each case we provide a polynomial-time algorithm for computing the search number, i.e. the minimum number of searchers required to clear the tree, and an optimal search strategy. We also demonstrate that each search model is monotonic, i.e. for each case their exists an optimal search strategy such that the set of cleared edges grows monotonically as the search progresses.
A Family of Tolerant Antidivision Operators for Database Fuzzy Querying
Authors: Patrick Bosc, Olivier Pivert
Venue: Proceedings of the 2nd international conference on Scalable Uncertainty Management (2008)

In this paper, we present an algebraic relational operator called antidivision and we describe a range of interpretations that can be attached to this operator in the context of databases with fuzzy relations (i.e., relations that contain weighted tuples). We also study the way(s) this operator can be made tolerant to exceptions in order to limit the risk of obtaining empty answers.
Output schemas of XSLT stylesheets and their applications
Authors: Sven Groppe, Jinghua Groppe
Venue: Information Sciences: an International Journal (2008)

The capabilities of XSLT processing are widely used to transform XML documents into target XML documents. These target XML documents conform to output schemas of the used XSLT stylesheet. Output schemas of XSLT stylesheets can be used for a static analysis of the used XSLT stylesheet, to automatically detect the XSLT stylesheet of target XML documents or to reason on the output schema without access to the target XML documents. In this paper, we develop an approach to automatically determining the output schema of an XSLT stylesheet. We also describe several application scenarios of output schemas. The experimental evaluation shows that our prototype can determine the output schemas of nearly all typical XSLT stylesheets and the improvements in preciseness in several application scenarios when using output schemas in comparison to when not using output schemas.
Semantic Graph Visualisation for Mobile Semantic Web Interfaces
Authors: Daniel Sonntag, Philipp Heim
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

Information visualisation benefits from the Semantic Web: multimodal mobile interfaces to the Semantic Web offer access to complex knowledge and information structures. Natural language dialogue systems are ideal interfaces to personal digital assistants (PDAs) or other handheld clients. We explore more fine-grained co-ordination of multimodal presentations as answers to natural language questions about a specific domain by graph-based visualisation and navigation in ontological RDF result structures. Semantic Navigation on mobile devices leverages graphical user interface activity for dialogical interaction in mobile environments. Constraint-based programming helps to find optimised multimedia graph visualisations.
Toward Web-Scale Workflows for Film Production
Authors: Chun Ouyang, Marcello La Rosa, Arthur H. M. ter Hofstede, Marlon Dumas, Katherine Shortland
Venue: IEEE Internet Computing (2008)

The screen business encompasses all creative and management aspects related to film, television, and new media content, from concept to production and distribution. Companies in this industry face increasing competition due to market globalization. To stay competitive, they're turning to contemporary technology-enabled business improvement methods, such as business process management. Despite its potential benefits, the use of workflow systems for automating film production processes is largely unexplored. The authors' case study highlights some of the key challenges that lie ahead for Web-scale workflows for film production.
Literal Projection for First-Order Logic
Authors: Christoph Wernhard
Venue: Proceedings of the 11th European conference on Logics in Artificial Intelligence (2008)

The computation of literal projection generalizes predicate quantifier elimination by permitting, so to speak, quantifying upon an arbitrary sets of ground literals, instead of just (all ground literals with) a given predicate symbol. Literal projection allows, for example, to express predicate quantification upon a predicate just in positive or negative polarity. Occurrences of the predicate in literals with the complementary polarity are then considered as unquantified predicate symbols. We present a formalization of literal projection and related concepts, such as literal forgetting, for first-order logic with a Herbrand semantics, which makes these notions easy to access, since they are expressed there by means of straightforward relationships between sets of literals. With this formalization, we show properties of literal projection which hold for formulas that are free of certain links, pairs of literals with complementary instances, each in a different conjunct of a conjunction, both in the scope of a universal first-order quantifier, or one in a subformula and the other in its context formula. These properties can justify the application of methods that construct formulas without such links to the computation of literal projection. Some tableau methods and direct methods for second-order quantifier elimination can be understood in this way.