ppxscal/embedding_network huggingface dataset:
Speedup learning for repair-based search by identifying redundant steps
Authors: Shaul Markovitch, Asaf Shatil
Venue: The Journal of Machine Learning Research (2003)

Repair-based search algorithms start with an initial solution and attempt to improve it by iteratively applying repair operators. Such algorithms can often handle large-scale problems that may be difficult for systematic search algorithms. Nevertheless, the computational cost of solving such problems is still very high. We observed that many of the repair steps applied by such algorithms are redundant in the sense that they do not eventually contribute to finding a solution. Such redundant steps are particularly harmful in repair-based search, where each step carries high cost due to the very high branching factor typically associated with it. Accurately identifying and avoiding such redundant steps would result in faster local search without harming the algorithm's problem-solving ability. In this paper we propose a speedup learning methodology for attaining this goal. It consists of the following steps: defining the concept of a <em>redundant step</em>; acquiring this concept during off-line learning by analyzing solution paths for training problems, tagging all the steps along the paths according to the redundancy definition and using an induction algorithm to infer a classifier based on the tagged examples; and using the acquired classifier to filter out redundant steps while solving unseen problems. Our algorithm was empirically tested on instances of real-world employee timetabling problems (ETP). The problem solver to be improved is based on one of the best methods for solving some large ETP instances. Our results show a significant improvement in speed for test problems that are similar to the given example problems.
Access control of XML documents considering update operations
Authors: Chung-Hwan Lim, Seog Park, Sang H. Son
Venue: Proceedings of the 2003 ACM workshop on XML security (2003)

As a large quantity of information is presented in XML format on the Web, there are increasing demands for XML security. Until now, research on XML security has been focused on the security of data communication using digital signatures or encryption technologies. As XML is also used for a data representation of data storage, XML security comes to involve not only communication security but also managerial security. Managerial security is guaranteed through access control, but existing XML access control models consider only read queries. These models may make some problems when unauthorized users try to change XML documents or their structure. Therefore the access control of update queries must be executed correctly and efficiently as well as read queries. In this paper, we discuss an XML access control model and propose a technique that supports not only read operations but also update operations. We define new action types to systematically manage complex information of access right and to process various update queries in an efficient manner. Using these action types, the system can save memory and other system resources that are used in DOM-based DTD verification process, and shortens the overall steps of access control by filtering unnecessary queries out at the early stage. Although for read queries the proposed access control model introduces a minor overhead in determining action types, for update queries it shows better performance compared to existing access control models.
Cascade Architectures of Fuzzy Neural Networks
Authors: W. Pedrycz, M. Reformat, C. W. Han
Venue: Fuzzy Optimization and Decision Making (2004)

This study is concerned with cascade architectures of fuzzy neural networks. These networks exhibit three interesting and practically appealing features: (i) come with sound and transparent logic characteristics by being developed with the aid of AND and OR fuzzy neurons and subsequently logic processors (LPs), (ii) possess significant learning abilities and in this way fall in the realm of neuro-fuzzy architectures, and (iii) exhibit an evident hierarchical structure owing to the cascade of the LPs. We discuss main functional properties of the model and relate them to its form of cascade-type of systems formed as a stack of LPs. The construction of the systems of this form calls for some structural optimization that is realized in the realm of genetic optimization. The structure of the network that deals with a selection of a subset of input variables and their distribution across the individual LPs is optimized with the use of genetic algorithms (GAs). The chromosomes encode the order of the variables as well as include the parameters (connections) of the neurons. We discuss various schemes of genetic optimization (both a two-level and single-level GA) and gradient-based learning aimed at further refinement of the connections of the neurons. We elaborate on the interpretation aspects of the network and show how this leads to a Boolean or multivalued logic description of the experimental data. A number of numeric data sets are discussed with respect to the performance of the constructed networks and their interpretability.
On automatic secret generation and sharing for Karin-Greene-Hellman scheme
Authors: Kamil Kulesza, Zbigniew Kotulski
Venue: Artificial intelligence and security in computing systems (2003)

The secret considered is a binary string of fixed length. In the paper we propose a method of automatic secret generation and sharing. We show how to simultaneously generate and share random secret. Such a secret remains unknown until it is reconstructed. Next, we propose a method of automatic sharing of a known secret. In this case the Dealer does not know the secret and the secret's Owner does not know the shares. We discuss how to use extended capabilities in the proposed method.
The Periscope: supporting a computer enhanced field trip for children
Authors: Danielle Wilde, Eric Harris, Yvonne Rogers, Cliff Randell
Venue: Personal and Ubiquitous Computing (2003)

This paper describes an interactive device, the Periscope, designed to be used as an educational tool featured during a children's digitally enhanced field trip in a woodland setting. The Periscope assembly, including a display and RFID equipped tangibles, is controlled using handles that enable it to be raised and rotated. The display is controlled by rotating the Periscope, or alternatively by twisting the handles. A set of tangibles, a collection of Petri dishes fitted with RFID tags, enable the children to carry out experiments with the results being shown on the display. Field trials are also outlined in which the effectiveness of this design is established. In conclusion, we discuss the aesthetic design issues raised by introducing digital technology into everyday environments.
The compactness of adaptive routing tables
Authors: Cyril Gavoille, Akka Zemmari
Venue: Journal of Discrete Algorithms (2003)

The compactness of a routing table is a complexity measure of the memory space needed to store the routing table on a network whose nodes have been labelled by a consecutive range of integers. It is defined as the smallest integer k such that, in every node u, every set of labels of destinations having the same output in the table of u can be represented as the union of k intervals of consecutive labels. While many works studied the compactness of deterministic routing tables, few of them tackled the adaptive case when the output of the table, for each entry, must contain a fixed number α of routing directions. We prove that every n-node network supports shortest path routing tables of compactness at most n/α for an adaptiveness parameter α, whereas we show a lower bound of n/αO(1).
Ad Hoc Software Interfacing: Enterprise Application Integration (EAI) when Middleware is Overkill
Authors: Arthur A. Reyes, José R. Espino, Vijai Mohan, Monica Nadkar
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Enterprise application integration (EAI) iscooperation of disparate systems and components toimplement business rules in a distributed environment."Systems and components" can be computer-aideddesign (CAD) or software engineering (CASE) tools,enterprise databases, COTS applications, or in-housesoftware. Ad hoc software interfacing (AHSI) is aspecial kind of EAI. A tradeoff analysis classifies an EAIproblem as an AHSI problem when middlewaresolutions are seen as heavy-handed. I.e., the plannedEAI is not expected to become broad enough to justifythe generality of a middleware solution or the client isunwilling to pay for a unified data model. AHSI seeks to"wire" extant software applications as components innew, larger software applications. We call applications-as-components "appliponents". AHSI seeks to minimize appliponent modification to the greatest extent possible.We demonstrate solutions to AHSI problems using XMLtoolkits, domain-specific language toolkits, andMicrosoft BizTalk Server.
Mathematics in a ubiquitous computing environment: communication, roles, and sense making
Authors: Phyllis Barsch Bolin
Venue:  (2003)

This study examined how students used technology in a ubiquitous computer environment to communicate with their college mathematics professor and to each other, to understand how the role of the professor and relationships between the students and the professor changed as the technology was integrated, and how student participation with the electronic communications contributed to their sense making of mathematics. By providing descriptive detail of the students' reflective responses to e-journal prompts, I hoped to provide information that might assist other teachers as they struggle to enhance communication and understand student conceptual sense making while offering insights into a more dynamic curriculum with communications, meaning, and inquiry more centrally located. The study found e-mail and e-journals provided opportunities to give individualized feedback to students and to extend the classroom conversation, but also enabled interactions that were not occurring in the classroom. This extension of the classroom dialogue provided new opportunities for students to think through issues that would not have been addressed in the classroom. E-mail and e-journals permitted a diverse set of conceptual topics to be discussed in depth. While e-journals may have promoted student learning through student reflections, the e-journals provided the professor with important insights in the complexity of students' meaning making processes. In conclusion, e-mail served as a conversational and instructional tool for a college mathematics class. E-mails provided the students a conversational tool in which they were able to converse with the professor about problems in or out of class, check about homework assignments, or just talk. As an instructional tool, e-mails allowed the professor to discuss students' conceptual problems. E-mail also provided the professor with an administrative tool in which changes in class times, assignments, or other organizational needs could be sent. E-journals provided an avenue for students to write as they reflected upon conceptual understanding and participated in the discourse community of the class, bridging the discourse community of mathematics. Additionally, the study supports the assertion that students' writing provides a starting place for change as teachers reflect upon how their students learn and think about mathematics.
Special Issue: AI in Manufacturing: State of the Art
Authors: William C. Regli
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

The AAAI Special Interest Group on AI in Manufacturing (SIGMAN) organization represents a wide array of researchers addressing fundamental scientific problems that arise in engineering design and manufacturing. The human endeavor that is design and manufacturing is rich in basic problems for researchers in Artificial Intelligence. From process planning researchers who aim to augment the abilities of human process engineers, to those who employ agents and distributed AI to model and control the factory floor&mdash;AI has found one of its most fertile and challenging proving grounds in the manufacture of products.
Comparing Pure Parallel Ensemble Creation Techniques Against Bagging
Authors: Lawrence O. Hall, Kevin W. Bowyer, Robert E. Banfield, Divya Bhadoria, W. Philip Kegelmeyer, Steven Eschrich
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

We experimentally evaluate randomization-based approachesto creating an ensemble of decision-tree classifiers.Unlike methods related to boosting, all of the eightapproaches considered here create each classifier in an ensembleindependently of the other classifiers. Experimentswere performed on 28 publicly available datasets, usingC4.5 release 8 as the base classifier. While each of the otherseven approaches has some strengths, we find that none ofthem is consistently more accurate than standard baggingwhen tested for statistical significance.
A robust algorithm for reading detection
Authors: Christopher S. Campbell, Paul P. Maglio
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

As video cameras become cheaper and more pervasive, there is now increased opportunity for user interfaces to take advantage of user gaze data. Eye movements provide a powerful source of information that can be used to determine user intentions and interests. In this paper, we develop and test a method for recognizing when users are reading text based solely on eye-movement data. The experimental results show that our reading detection method is robust to noise, individual differences, and variations in text difficulty. Compared to a simple detection algorithm, our algorithm reliably, quickly, and accurately recognizes and tracks reading. Thus, we provide a means to capture normal user activity, enabling interfaces that incorporate more natural interactions of human and computer.
On Transfer Function and Power Consumption Transient Response
Authors: Lipeng Cao
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper proposes to use time series analysis techniques to model both average and cycle-by-cycle moving average power consumption behavior of electronic systems. The power model is in the form of first and/or second order transfer functions that represent themapping from primary input/output activities to power consumption profile over time. Such an approach has power estimation applications in both software simulation and hardware implementation of power monitor circuit.
Tag semantics for the retrieval of XML documents
Authors: Davide Buscaldi, Giovanna Guerrini, Marco Mesiti, Paolo Rosso
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Word Sense Disambiguation (WSD), in the field of Natural Language Processing (NLP), consists in assigning the correct sense (semantics) to a word form (lexeme) by means of the context in which the lexeme is found. In this paper we investigate the possibility of applying WSD techniques to the field of Information Retrieval, especially to the retrieval of XML documents. We consider two methods to automatically assign semantic values to XML tags on the grounds of the tagged text contained. Such methods rely on the bayesian supervised approach and on an automatic unsupervised approach and exploit the WordNet ontology. Results show that the applicability of both methods is hampered by the habit of use abbreviation or shortcuts as tags.
Impact of LKD5109TM low-k to cap/liner interfaces in single damascene process and performance
Authors: F. Iacopi, M. Patz, I. Vos, Zs. Tökei, B. Sijmus, Q. T. Le, E. Sleeckx, B. Eyckens, H. Struyf, A. Das, K. Maex
Venue: Microelectronic Engineering (2003)

The importance of interface quality in the single damascene integration process of LKD5109TM porous low-k films is investigated. A strong correlation is observed between chemical mechanical planarization (CMP) performance and LKD/cap layer interfacial fracture energies. The use of FF02TM as cap layer material (an on-purpose developed spin-on organic hard-mask) on LKD leads to superior interfacial adhesion and metal continuity yield as compared to the use of chemical vapour deposition SiC:H cap films. The adhesion quality of LKD/liner films appears less critical than LKD/cap layer adhesion as far as CMP performance is concerned. Electrical line-to-line performance is not always directly correlated with adhesion but rather, more generally speaking, with interface quality (i.e., presence of defects/dangling bonds or moisture). The introduction of surface pre-treatments to enhance interfacial adhesion leads to degradation in both leakage current and breakdown field behaviour because of damage induced at the interface.
Distributivity of categories of coalgebras
Authors: H. Peter Gumm, Jesse Hughes, Tobias Schröder
Venue: Theoretical Computer Science (2003)

For any Set-endofunctor F, the category SetF of F-coalgebras has preimages, i.e. pullbacks along an injective map. If F preserves preimages, then SetF is distributive, and the converse holds, whenever SetF has finite products.
A Logical Framework for Querying and Repairing Inconsistent Databases
Authors: Gianluigi Greco, Sergio Greco, Ester Zumpano
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

In this paper, we address the problem of managing inconsistent databases, i.e., databases violating integrity constraints. We propose a general logic framework for computing repairs and consistent answers over inconsistent databases. A repair for a possibly inconsistent database is a minimal set of insert and delete operations which makes the database consistent, whereas a consistent answer is a set of tuples derived from the database, satisfying all integrity constraints. In our framework, different types of rules defining general integrity constraints, repair constraints (i.e., rules defining conditions on the insertion or deletion of atoms), and prioritized constraints (i.e., rules defining priorities among updates and repairs) are considered. We propose a technique based on the rewriting of constraints into (prioritized) extended disjunctive rules with two different forms of negation (negation as failure and classical negation). The disjunctive program can be used for two different purposes: to compute "repairs" for the database and produce consistent answers, i.e., a maximal set of atoms which do not violate the constraints. We show that our technique is sound, complete (each preferred stable model defines a repair and each repair is derived from a preferred stable model), and more general than techniques previously proposed.
Analysis of blocking dynamic circuits
Authors: Tyler Thorp, Dean Liu, Pradeep Trivedi
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

In order for dynamic circuits to operate correctly, their inputs must be monotonically rising during evaluation. Blocking dynamic circuits satisfy this constraint by delaying evaluation until all inputs have been properly setup relative to the evaluation clock. By viewing dynamic gates as latches, we demonstrate that the optimal delay of a blocking dynamic gate may occur when the setup time is negative. With blocking dynamic circuits, cascading low-skew dynamic gates allows each dynamic gate to tolerate a degraded input level. The larger noise margin provides greater flexibility with the delay versus noise margin tradeoff (i.e., the circuit robustness versus speed tradeoff). This paper generalizes blocking dynamic circuits and provides a systematic approach for assigning clock phases, given delay and noise margin constraints. Using this framework, one can analyze any logic network consisting of blocking dynamic circuits.
Understanding gender and confidence in CS course culture
Authors: Lilly Irani
Venue: ACM SIGCSE Bulletin (2004)

Women in the first systems course in Stanford's CS core find themselves in a divided culture in which they are a minority. For these women, establishing an identity of competence becomes critical to defining a place in the CS culture and establishing legitimacy. Social factors such as gendered self-presentation and communication, rather than objective measures of ability, plays a large role in developing confidence. Only by understanding the role of such social factors can we develop strategies for creating a more inclusive CS culture in which women may thrive. Findings are drawn from surveys, interviews, and five years of enrollment data.
Nearest neighbor queries in road networks
Authors: Christian S. Jensen, Jan Kolářvr, Torben Bach Pedersen, Igor Timko
Venue: Proceedings of the 11th ACM international symposium on Advances in geographic information systems (2003)

With wireless communications and geo-positioning being widely available, it becomes possible to offer new e-services that provide mobile users with information about other mobile objects. This paper concerns active, ordered k-nearest neighbor queries for query and data objects that are moving in road networks. Such queries may be of use in many services.Specifically, we present an easily implementable data model that serves well as a foundation for such queries. We also present the design of a prototype system that implements the queries based on the data model. The algorithm used for the nearest neighbor search in the prototype is presented in detail. In addition, the paper reports on results from experiments with the prototype system.
Evaluating the Performance of Various Architectures for Wireless Ad Hoc Networks
Authors: Karthik Ramachandra, Hesham H. Ali
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

A "mobile ad hoc network" is an autonomous system of mobile hosts connected by wireless links. The nodes are free to move randomly and organize themselves arbitrarily; thus, the network's wireless topology may change rapidly and unpredictably. Such a network may operate in a standalone fashion, or may be connected to the larger Internet. The performanceof such networks was evaluated based on simulations. In this paper, we evaluate the practicality of realizing an ad-hoc wireless network and investigate on performance issues. We have tried to simulate three different architectures for wireless networks and compare their performance based on a number of factors. This study centers around investigating the best architecture for ad hoc networks. We have used ns-2 for all our simulations. In all our simulations, we have tried to quantify the effects of factors like cluster size, routing protocols, mobility patterns and type of traffic, that affect the performance of ad hoc networks. Specifically, this paper evaluates the impact of these factors on the following performance metrics: throughput, average routing overhead, packet delivery ratio and end-to-end delay across the three different architectures.
Intersecting Systems
Authors: R. Ahlswede, N. Alon, P. L. Erdös, M. Ruszinkó, L. A. Székely
Venue: Combinatorics, Probability and Computing (1997)

An intersecting system of type (&exist;, &forall;, k, n) is a collection &Fopf;={&Fscr;1, ..., &Fscr;m} of pairwise disjoint families of k-subsets of an n-element set satisfying the following condition. For every ordered pair &Fscr;i and &Fscr;j of distinct members of &Fopf; there exists an A&isin;&Fscr;i that intersects every B&isin;&Fscr;j. Let In (&exist;, &forall;, k) denote the maximum possible cardinality of an intersecting system of type (&exist;, &forall;, k, n). Ahlswede, Cai and Zhang conjectured that for every k&ge;1, there exists an n0(k) so that In (&exist;, &forall;, k)=(n&minus;1&#x002F;k&minus;1) for all n>n0(k). Here we show that this is true for k&le;3, but false for all k&ge;8. We also prove some related results.