ppxscal/embedding_network huggingface dataset:
Complete involutive rewriting systems
Authors: Gareth A. Evans, Christopher D. Wensley
Venue: Journal of Symbolic Computation (2007)

Given a monoid string rewriting system M, one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is well-known that this algorithm is equivalent to computing a noncommutative Grobner basis for M. This article develops an alternative approach, using noncommutative involutive basis methods to obtain a complete involutive rewriting system for M.
Intelligent Tutors for All: The Constraint-Based Approach
Authors: Antonija Mitrovic, Brent Martin, Pramuditha Suraweera
Venue: IEEE Intelligent Systems (2007)

Intelligent tutoring systems have revolutionized online education by providing individualized instruction for each student. Constraint-based tutors model instructional domains at an abstract level, a novel approach that simplifies development of these systems. Over the last decade, the University of Canterbury's Intelligent Computer Tutoring Group has developed effective constraint-based tutors for various instructional domains; some of these tutors have been successfully commercialized. Constraint-based tutoring is a mature, successful approach to providing adaptive learning environments. ICTG-developed authoring tools aim to make this technology widely available to teachers and students. This article is part of a special issue on intelligent educational systems.
Short-term non-uniform access in IEEE 802.11-compliant WLANs: A study on its impact on the saturation performance
Authors: Chunyu Hu, Hwangnam Kim, Jennifer C. Hou
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

Along with the success of IEEE 802.11-compliant WLANs, the distributed coordinated function (DCF) specified as the contention-based medium access mechanism in IEEE 802.11 has been widely used to support applications in new regimes. A thorough understanding of the characteristics of IEEE 802.11 DCF is therefore a research focus. DCF assumes the binary exponential backoff algorithm (BEBA) [D. Bertsekas, R. Gallager, Data Networks, Prentice Hall, 1992]. Several existing models that characterize BEBA as a p-persistent scheme have ignored several subtle protocol details. This has practically constrained the models from being applied in a broader range of configurations, e.g., small contention window, and from being further extended, e.g., 802.11e EDCA. In this paper, we develop an analytical model that captures the subtlety, and faithfully describes the channel activities as governed by DCF. Based on the devised model, we perform a rigorous analysis on the saturation throughput performance in a single-hop WLAN. We show that the stochastic property of the backoff time, r, may substantially impact the system performance. For example, setting the range of r to [1,CW] instead of [0,CW-1], can degrade the system throughput considerably. We also identify, by clearly defining and thus being able to differentiate the two terms, attempt probability and transmission probability, an erroneous extension made to Bianchi's model [G. Bianchi, Performance analysis of the IEEE 802.11 distributed coordination function, IEEE JSAC, 18(3) (2000) 535-547]. All the findings are corroborated by ns-2 simulation.
Custom Programming/Analysis in the Small Business Environment
Authors: T. Cary
Venue: Computer (1976)

As has often been stated, a business of any size can be considered as a general system,8,11,13,28,29,20,31with identifiable external inputs and outputs typically consisting of goods, services, energy, money, and information. Internally, a business consists of several interacting parts which may be considered as subsystems, each of which has inputs from external sources or from other subsystems and outputs to external sinks or to other subsystems. Usually, each subsystem requires information as an input and, in turn, generates information as an output. As a business becomes larger and more complex, the need for information becomes greater and more critical. 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
A Semantically Guided Deductive System for Automatic Theorem Proving
Authors: R. Reiter
Venue: IEEE Transactions on Computers (1976)

A semantic and deductive formal system for automatic theorem proving is presented. The system has, as its deductive component, a form of natural deduction. Its semantic component relies on an underlying representation of a model. This model is invoked to prune subgoals generated by the deductive component, whenever such subgoals test false in the model. In addition, the model is used to suggest inferences to be made at the deductive level. Conversely, the current state of the proof suggests changes to be made to the model, e.g., when a construction is required as in geometry.
Uniqueness of Linear Combinations of Ridge Functions
Authors: Jinling Long, Wei Wu, Dong Nan, Junfang Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Ridge functions are multivariate functions of the form g(a \cdot x), where g is a univariate function, and a \cdot x is the inner product of a \in R^d\{0} and x \in R^d. We are concerned with the uniqueness of representation of a given function as some sum of ridge functions. We prove that if f(x) = \sum\nolimits_{i - 1}^m {g_i (a^i\cdot x)}= 0 for some a^i = (a^i 1, \cdot \cdot \cdot , a^i_d) \in R^d\{0}, and if g_i \in L^p_loc (R) (or g_i \in D' (R) and g_i (a^i \cdot x) \in D' (R^d)), then, each g_i is a polynomial of degree at most m - 2. We also prove a theorem on the smoothness of linear combinations of ridge functions. These results improve the existing results.
Efficiently answering top-k typicality queries on large databases
Authors: Ming Hua, Jian Pei, Ada W. C. Fu, Xuemin Lin, Ho-Fung Leung
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Finding typical instances is an effective approach to understand and analyze large data sets. In this paper, we apply the idea of typicality analysis from psychology and cognition science to database query answering, and study the novel problem of answering top-k typicality queries. We model typicality in large data sets systematically. To answer questions like "Who are the top-k most typical NBA players?", the measure of simple typicality is developed. To answer questions like "Who are the top-k most typical guards distinguishing guards from other players?", the notion of discriminative typicality is proposed. Computing the exact answer to a top-k typicality query requires quadratic time which is often too costly for online query answering on large databases. We develop a series of approximation methods for various situations. (1) The randomized tournament algorithm has linear complexity though it does not provide a theoretical guarantee on the quality of the answers. (2) The direct local typicality approximation using VP-trees provides an approximation quality guarantee. (3) A VP-tree can be exploited to index a large set of objects. Then, typicality queries can be answered efficiently with quality guarantees by a tournament method based on a Local Typicality Tree data structure. An extensive performance study using two real data sets and a series of synthetic data sets clearly show that top-k typicality queries are meaningful and our methods are practical.
Approaching the skyline in Z order
Authors: Ken C. K. Lee, Baihua Zheng, Huajing Li, Wang-Chien Lee
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Given a set of multidimensional data points, skyline query retrieves a set of data points that are not dominated by any other points. This query is useful for multi-preference analysis and decision making. By analyzing the skyline query, we observe a close connection between Z-order curve and skyline processing strategies and propose to use a new index structure called ZBtree, to index and store data points based on Z-order curve. We develop a suite of novel and efficient skyline algorithms, which scale very well to data dimensionality and cardinality, including (1) ZSearch, which processes skyline queries and supports progressive result delivery; (2) ZUpdate, which facilitates incremental skyline result maintenance; and (3) k-ZSearch, which answers k-dominant skyline query (a skyline variant that retrieves a representative subset of skyline results). Extensive experiments have been conducted to evaluate our proposed algorithms and compare them against the best available algorithms designed for skyline search, skyline result update, and k-dominant skyline search, respectively. The result shows that our algorithms, developed coherently based on the same ideas and concepts, soundly outperforms the state-of-the-art skyline algorithms in their specialized domains.
GARM: A Group - Anonymity Reputation Model in Peer-to-Peer System
Authors: Wen Ji, Shoubao Yang, Dong Wei, Weina Lu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

When Peer-to-Peer reputation systems are optimal for attracting peers to contribute resources and combating the rise in "Free-Riding", they still cannot avoid facing some malicious attacks such as "Slander", "Collusion", and "Sybil Attack". In this paper, reputation mechanism and anonymity in Peerto- Peer systems are both considered. A groupanonymity reputation model without CA is proposed, for the purpose of impelling the P2P system to the maximization of resource utility. By way of contrasting to other reputation systems, peers in this model do not have a global reputation but a group-anonymity reputation instead. In addition, peers are divided into distinguishing groups, among which anonymity is achieved - by preventing querying peers from getting the information of the providing peers. And after each interaction between the service peer (namely, the resource provider) and the consumer one, the latter will submit its evaluation about the provider to the system. As the anonymity of the resource provider is protected, some malicious behaviors could not exercise a great influence on this group-anonymity reputation model.
Chosen-ciphertext secure proxy re-encryption
Authors: Ran Canetti, Susan Hohenberger
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

In a proxy re-encryption (PRE) scheme, a proxy is given special information that allows it to translate a ciphertext under one key into a ciphertext of the same message under a different key. The proxy cannot, however, learn anything about the messages encrypted under either key. PRE schemes have many practical applications, including distributed storage, email, and DRM. Previously proposed re-encryption schemes achieved only semantic security; in contrast, applications often require security against chosen ciphertext attacks. We propose a definition of security against chosen ciphertext attacks for PRE schemes, and present a scheme that satisfies the definition. Our construction is efficient and based only on the Decisional Bilinear Diffie-Hellman assumption in the standard model. We also formally capture CCA security for PRE schemes via both a game-based definition and simulation-based definitions that guarantee universally composable security. We note that, simultaneously with our work, Green and Ateniese proposed a CCA-secure PRE, discussed herein.
A simple Markov chain structure for the evolution of credit ratings
Authors: Amparo Baíllo, José Luis Fernández
Venue: Applied Stochastic Models in Business and Industry (2007)

We focus on continuous Markov chains as a model to describe the evolution of credit ratings. In this work it is checked whether a simple, tridiagonal type of generator provides a good approximation to a general one. Three different tridiagonal approximations are proposed and their performance is checked against two generators, corresponding to a volatile and a stable period, respectively. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Codelink
Authors: Diego Diez, Rebeca Alvarez, Ana Dopazo
Venue: Bioinformatics (2007)

Motivation: Microarray-based expression profiles have become a standard methodology in any high-throughput analysis. Several commercial platforms are available, each with its strengths and weaknesses. The R platform for statistical analysis and graphics is a powerful environment for the analysis of microarray data, because it has many integrated statistical methods available as well as the specialized microarray analysis project Bioconductor. Many packages have been added in the last few years increasing the range of possible analysis. Here, we report the availability of a package for reading and analyzing data from GE Healthcare Gene Expression Bioarrays within the R environment. Availability: The software is implemented in the R language, is open source and available for download free of charge through the Bioconductor ( http://www.bioconductor.org) project. Contact: diez@kuicr.kyoto-u.ac.jp Supplementary information: Supplementary data are available at Bioinformatics online.
An Optimal Algorithm for Computing Fourier Texture Descriptors
Authors: S. L. Tanimoto
Venue: IEEE Transactions on Computers (1978)

The description of texture is an important problem in image analysis. Several methods in the literature require that local two-dimensional discrete Fourier transforms be computed as a first step in the texture description process. A chief limitation in these approaches has been the computational complexity of the transform calculation which has tended to limit the resolution of subsequent description and/or segmentation. It is shown here that through a suitable ordering of calculations, the transforms over a complete set of overlapping "texture windows" can be obtained efficiently. An algorithm is given and is shown to be time-optimal to within a constant factor.
The effects of conceptual description and search practice on users' mental models and information seeking in a case-based reasoning retrieval system
Authors: Wu He, Sanda Erdelez, Feng-Kwei Wang, Chi-Ren Shyu
Venue: Information Processing and Management: an International Journal (2008)

This paper reportes a study that investigated the effects of conceptual description and search practice on users' mental models and information seeking in a case-based reasoning retrieval (CBR) system with a best match search mechanism. This study also found examined how the presence of a mental model affects the users' search performance and satisfaction in this system. The results of this study revealed that the conceptual description and search practice treatments do not have significantly different effects on the types of user's mental models, search correctness, and search satisfaction. However, the search practice group spent significantly less time than the conceptual description group in finding the results. Qualitative analysis for the subjects' post mental models revealed that subjects in the conceptual description group seem to have more complete mental models of the best match system than those in the search practice group. This study also that subjects with the best match mental models have significantly higher search correctness and search result satisfaction than subjects without the best match mental models. However, the best match mental models do not guarantee less search time in finding the results. This study did not find a significant correlation among search time, search correctness and search satisfaction. The study concludes with suggestions for future research and implications for system developers who are interested in CBR retrieval systems.
CoGrOO - An OpenOffice Grammar Checker
Authors: Jorge Kinoshita, Lais N. Salvador, Carlos E. D. Menezes
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This paper describes a Portuguese language grammar checker project, called CoGrOO - Corretor Gramatical para o OpenOffice (Grammar Checker for OpenOffice). Two of its features are highlighted: 1) hybrid architecture, mixing rules and statistics; 2) free software project. This project aims to check grammatical errors such as nominal and verbal agreement, "crase" (preposition "a" + determiner "a" yielding "à"), nominal and verbal government and other common errors in Brazilian Portuguese language. We present some empirical results based on the first version of the grammar checker and the new approach used in the second version.
Inducing High-Level Behaviors from Problem-Solving Traces Using Machine-Learning Tools
Authors: Vivien Robinet, Gilles Bisson, Mirta B. Gordon, Benoit Lemaire
Venue: IEEE Intelligent Systems (2007)

This article applies machine-learning techniques to student modeling, presenting a method for discovering high-level student behaviors from a very large set of low-level traces corresponding to problem-solving actions in a learning environment. The system encodes basic actions into sets of domain-dependent attribute-value patterns. Then, a domain-independent hierarchical clustering identifies high-level abilities, yielding natural-language diagnoses for teachers. The method can be applied to individual students or to entire groups, such as a class. The system was applied to the actions of thousands of students in the domain of algebraic transformations. This article is part of a special issue on intelligent educational systems.
Alternative dataflow model
Authors: Conrad S. M. Mueller
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Dataflow architectures showed considerable potential however the initial interest has to some extent petered out. Difficulties arose with the cost of implementation, appropriate programming languages and operating systems, and ability to sustain development. We argue that there is a fundamental problem with dataflow relating to how a program is represented. This article explores representing a program by an unlimited acyclic network rather than a fixed one with either cycles or reuse. The state is captured in the edges rather than the nodes. We show how this model can address many of the shortcomings of dataflow and enable dataflow to realize its expected potential. The model shows promise in: improving parallelism and ease of implementation.
On Coordination Mechanisms in Global Software Development
Authors: Marcelo Cataldo, Matthew Bass, James D. Herbsleb, Len Bass
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

The ability of an organization to successfully carry out its tasks depends on the appropriate combination of organizational structure, processes, and communication and coordination mechanisms. In this paper, we present four case studies that exemplify coordination breakdown problems in global software development. Our analysis showed those problems took place even in the presence of a collection of processes, organizational mechanisms and communication tools established to increases the ability of the teams to perform their tasks. Finally, we discuss possible solutions to overcome the identified problems.
Adaptive Particle Swarm Optimization Algorithm With Genetic Mutation Operation
Authors: Yuelin Gao, Zihui Ren
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

This paper presents a new adaptive particle swarm optimization algorithm with genetic mutation operator. In the algorithm, we give a new adaptive inertia weight to access to local search quickly at the front of the iteration and use the adaptive variance and immune algorithm new affinity definition of the swarm to judge whether the algorithm sink into local minimum or not, then we use a new genetic mutation operator for some particles to escape from the local minimum's basin of attraction and realize global search. The experiments on six problems show that the modified PSO algorithm can improve the global search ability and greatly enhance the successful rate of search.
A Monte Carlo simulation for two novel automatic censoring techniques of radar interfering targets in log-normal clutter
Authors: Musaed N. Almarshad, Mourad Barkat, Saleh A. Alshebeili
Venue: Signal Processing (2008)

In this paper, we present two novel algorithms for automatic censoring of radar interfering targets in log-normal clutter. The proposed algorithms consist of two steps: removing the corrupted reference cells (censoring) and the actual detection. Both steps are performed dynamically by using a suitable set of ranked cells to estimate the unknown background level and set the adaptive thresholds accordingly. The proposed detectors do not require any prior information about the clutter parameters nor do they require the number of interfering targets. The effectiveness of the proposed algorithms is assessed by computing, using Monte Carlo simulations, the probability of censoring and the probability of detection in different background environments.
An Algorithm for Identifying Authors Using Synonyms
Authors: Jonathan H. Clark, Charles J. Hannon
Venue: Proceedings of the Eighth Mexican International Conference on Current Trends in Computer Science (2007)

An approach for identifying the human source of a text by leveraging the significance of synonyms in language is presented. While others have attempted to identify authors in the past, they have focused on purely statistical approaches such as word length distribution, number of distinct words, and language models. We claim that an author's choice of synonyms is idiosyncratic and can be used in determining the identity of an author, which we demonstrate via our algorithm for recognizing authors. This algorithm uses synonym sets from the WordNet lexical database to give more weight to words that have many common synonyms. The results of this method applied to the task of identifying the authors of classic literature show that there is a correlation between an author's synonym choice and the author's identity. With this new author recognition technology, we may now explore new avenues of intelligent and meaningful interaction with users.
Dual Processor Scheduling with Dynamic Reassignment
Authors: S. H. Bokhari
Venue: IEEE Transactions on Software Engineering (1979)

The problem of finding an optimal dynamic assignment of a modular program for a two-processor system is analyzed. Stone's formulation of the static assignment problem is extended to include the cost of dynamically reassigning a module from one processor to the other and the cost of module residence without execution. By relocating modules during the course of program execution, changes in the locality of the program can be taken into account. It is shown that network flow algorithms may be used to find a dynamic assignment that minimizes the sum of module execution costs, module residence costs, intermodule communication costs, and module reassignment costs. Techniques for reducing the size of the problem are described for the case where the costs of residence are negligible.
Evaluation of Deviating Alerts coming from Behavioral Intrusion Detection System
Authors: Jacques Saraydaryan, Veronique Legrand, Stephane Ubeda
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

The growth of behavioral intrusion detection solutions raises a new issue. The update of normal references is necessary and determines the flexibility and accuracy of the detection. This paper describes a decision block function used to update a behavioral intrusion detection method. Based on a risk analysis and Support Vector Machines, our approach completes the Behavioral anomaly detection using Bayesian modeling based on a global vision of the system approach.