ppxscal/embedding_network huggingface dataset:
Parsimonious language models for information retrieval
Authors: Djoerd Hiemstra, Stephen Robertson, Hugo Zaragoza
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

We systematically investigate a new approach to estimating the parameters of language models for information retrieval, called parsimonious language models. Parsimonious language models explicitly address the relation between levels of language models that are typically used for smoothing. As such, they need fewer (non-zero) parameters to describe the data. We apply parsimonious models at three stages of the retrieval process: 1) at indexing time; 2) at search time; 3) at feedback time. Experimental results show that we are able to build models that are significantly smaller than standard models, but that still perform at least as well as the standard approaches.
Optimal control for partially observed nonlinear deterministic systems with fuzzy parameters
Authors: T. E. Dabbous, M. S. Bayoumi
Venue: Dynamics and Control (2001)

In this paper we consider the control problem for a class of partially observed deterministic systems governed by nonlinear differential equations with fuzzy parameters. Using Takagi-Sugeno fuzzy model, we propose a linear (fuzzy) controller, driven by the output process, for controlling the system. Further, using calculus of variations, we have developed a set of necessary conditions on the basis of which optimal control can be determined. Based on these necessary conditions we have proposed a numerical algorithm for computing optimal control along with some numerical simulations to illustrate the effectiveness of the proposed (fuzzy) control scheme.
Use of large databases for group projects at the nexus of teaching and research
Authors: Richard C. Thomas, Rebecca Mancy
Venue: ACM SIGCSE Bulletin (2004)

Final year, group (capstone) projects in computing disciplines are often expected to fill multiple roles: in addition to allowing students to learn important domain-specific knowledge, they should reinforce computing and software engineering concepts and provide for the acquisition of transferable skills. For motivational and pedagogical reasons, it is clearly preferable that such projects respond to real needs, be those in research or industry. We describe two student projects based on a large repository of usage data and integrated into a course in Professional Computing. These projects fulfilled the objectives outlined above and were closely linked to the research of the first author. We suggest that similar projects based on large databases may offer a transferable paradigm for others to follow. Finally, we outline some important elements for a successful group project based on a large database.
Static Real-Time Data Distribution
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

This paper describes the design and implementation of astatic real-time data distribution mechanism that uses areal-time event service and a real-time scheduling serviceto ensure the on-time, and temporally valid delivery ofdata. The mechanism implements an algorithm, called theJust-In-Time Data Distribution algorithm to determinescheduling parameters that will ensure that data thatarrives at a requesting target is valid. The paper uses aNavy weapons alignment application to demonstrate thenecessity and usefulness of the algorithm andimplementation. The paper also presents results of teststhat demonstrate that our implementation fulfills theguarantees predicted by the theoretical results.
Evolving antennas in-situ
Authors: D. S. Linden
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2004)

Evolvable hardware, particularly evolvable electronic circuitry, is being vigorously explored as a means to enhance performance and survivability. However, antennas are also excellent candidates for evolvable hardware, as they are crucial components in any wireless system, and changes in the environment can seriously affect antenna performance. The evolvable antenna system in this paper shows that an evolutionary algorithm and a reconfigurable antenna can be used to optimize signal reception in-situ, i.e., in real surroundings, rather than in simulation or even on an antenna range. Several reconfigurable antenna topologies were tested, and all were able to outperform a conventional antenna.
Key issues in fabricating microstructures with high aspect ratios by using deep X-ray lithography
Authors: Chao-Min Cheng, Ren-Haw Chen
Venue: Microelectronic Engineering (2004)

High aspect ratio microstructures are frequently made with the Lithographie, Galvanoformung, Abformung (LIGA) process. The success of this process depends critically on "deep" X-ray lithography (DXRL). This paper presents a variety of experimentally and analytically determined techniques for optimizing DXRL. These include methods for designing and fabricating high-quality X-ray masks. Methods for optimizing the exposure dosage and developing cycle are described. New methods for promoting resist adhesion and for avoiding resist film cracking are discussed. The influence of developer surface tension on the resist solvation process is quantified and new methods for controlling this surface tension are described.
Program reduction using symbolic execution
Authors: James C. King
Venue: ACM SIGSOFT Software Engineering Notes (1981)

By "program reduction" we mean making a program simpler according to some measure. For the narrow purposes here, that measure is the number of statements in the program. We are interested in the case when an existing program, assumed to be correct, is too general, too big, for a given situations. A simpler program, consistent with the original, but operating over a smaller domain is desired. We found that a program verifier, based on the symbolic execution methodology, with some minor enhancements could handle this program reduction task. The technique is interesting because it is such a simple, but powerful, application of such a program prover.
Conversational Video Over IP
Authors: A. Auchterlonie
Venue: BT Technology Journal (2004)

Video has been carried over both the analogue and digital networks for many years. The transport of uncompressed &lsquo;raw&rsquo; video has historically been very bandwidth intensive, particularly video used for broadcast and television. The advent of digital video and the compression schemes that allows its transport over ever more modest bandwidths has made the transport and delivery of video a small business and consumer reality. PSTN and ISDN videotelephony (which are circuit-switched networks) have been with us for a number of years but have never really enjoyed widespread take-up. The availability of the Internet (a packet-switched network) and the advent of increasingly lower cost bandwidth and broadband access are changing the way in which video can be transported and used.
An attempt to formalise a non-trivial benchmark problem in common sense reasoning
Authors: Murray Shanahan
Venue: Artificial Intelligence (2004)

Most logic-based AI research works at a meta-theoretical level, producing new logics and studying their properties. Little effort is made to show how these logics can be used to formalise object-level theories of common sense. In the spirit of Pat Hayes's Naive Physics Manifesto, the present paper supplies a formalisation of a non-trivial benchmark problem in common sense physical reasoning, namely how to crack an egg. The formalisation is based on the event calculus, a well-known formalism for reasoning about action. Along the way, a number of methodological issues are raised, such as the question of how the symbols deployed in the formalisation might be grounded through a robot's interaction with the world.
On the Two-Class M/M/1 System under Preemptive Resume and Impatience of the Prioritized Customers
Authors: Andreas Brandt, Manfred Brandt
Venue: Queueing Systems: Theory and Applications (2004)

The paper deals with the two-class priority M/M/1 system, where the prioritized class-1 customers are served under FCFS preemptive resume discipline and may become impatient during their waiting for service with generally distributed maximal waiting times. The class-2 customers have no impatience. The required mean service times may depend on the class of the customer. As the dynamics of class-1 customers are related to the well analyzed M/M/1+GI system, our aim is to derive characteristics for class-2 customers and for the whole system. The solution of the balance equations for the partial probability generating functions of the detailed system state process is given in terms of the weak solution of a family of boundary value problems for ordinary differential equations, where the latter can be solved explicitly only for particular distributions of the maximal waiting times. By means of this solution formulae for the joint occupancy distribution and for the sojourn and waiting times of class-2 customers are derived generalizing corresponding results recently obtained by Choi et al. in case of deterministic maximal waiting times. The latter case is dealt as an example in our paper.
A formal analysis of information disclosure in data exchange
Authors: Gerome Miklau, Dan Suciu
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

We perform a theoretical study of the following query-view security problem: given a view V to be published, does V logically disclose information about a confidential query S? The problem is motivated by the need to manage the risk of unintended information disclosure in today's world of universal data exchange. We present a novel information-theoretic standard for query-view security. This criterion can be used to provide a precise analysis of information disclosure for a host of data exchange scenarios, including multi-party collusion and the use of outside knowledge by an adversary trying to learn privileged facts about the database. We prove a number of theoretical results for deciding security according to this standard. We also generalize our security criterion to account for prior knowledge a user or adversary may possess, and introduce techniques for measuring the magnitude of partical disclosures. We believe these results can be a foundation for practical efforts to secure data exchange frameworks, and also illuminate a nice interaction between logic and probability theory.
Lenient Array Operations for Practical Secure Information Flow
Authors: Zhenyue Deng, Geoffrey Smith
Venue: Proceedings of the 17th IEEE workshop on Computer Security Foundations (2004)

Our goal in this paper is to make secure informationflow typing more practical.We propose simple and permissivetyping rules for array operations in a simple sequentialimperative language.Arrays are given types of the form¿¿ and ¿¿, where ¿¿ is the security class of thearray's contents and ¿¿ is the security class of the array's length.Tokeep the typing rules permissive, we propose a novel, lenientsemantics for out-of-bounds array indices.We showthat our type system ensures a noninterference property, andwe present an example that suggests that it will not be toodifficult in practice to write programs that satisfy the typing rules.
Delivering an online translation course
Authors: Dermot F. Campbell
Venue: ReCALL (2004)

This presentation is a discursive treatment of the migration of a classroom based translation class to online delivery using the Virtual Learning Environment WebCT. The main focus is not on the VLE itself, but on the pedagogical challenges posed by the move to online delivery and the course structure developed to retain as many of the advantages of face-to-face delivery as possible. Key to this is the use of an innovative colour-coding system of error analysis combined with constructivist comments designed to promote reflection on the translation process. The application of colour-coded feedback to categories relevant to translation training is flexible and can be adapted to other disciplines where essay-type answers are appropriate and differentiated comment by the tutor is expected. Since translation is a process-heavy activity rather than content rich, special attention has been paid to pedagogical considerations. Emphasis is also placed on using the VLE to build up a durable learning resource. The advantages and weaknesses of both forms of delivery are compared.
A Conversation with Sam Leffler
Authors: James Russell
Venue: Queue (2004)

The seeds of Unix and open source were sown in the 1970s, and Sam Leffler was right in there doing some of the heaviest cultivating. He has been actively working with Unix since 1976 when he first encountered it at Case Western Reserve University, and he has been involved with what people now think of as open source, as he says, "long before it was even termed open source."
Evolutionary Strategy for Learning Multiple-Valued Logic Functions
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

We consider the problem of synthesizing multiple-valuedlogic functions by neural networks. An evolutionary strategy(ES) which finds the longest strip in V \subseteq K^n described. Astrip contains points located between two parallel hyperplanes. Repeatedapplication of ES partitions the space V into certain numberof strips, each of them corresponding to a hidden unit. Weconstruct neural networks based on these hidden units. Preliminaryexperimental results are presented and discussed.
Reliability of MOS devices with tungsten gates
Authors: F. Palumbo, S. Lombardo, J. H. Stathis, V. Narayanan, F. R. McFeely, J. J. Yurkas
Venue: Microelectronic Engineering (2004)

We have investigated the behaviour under accelerated reliability tests of MOS capacitors stressed at high voltage in accumulation with ultra-thin SiO2 dielectrics and with tungsten gates. Standard p+ poly-Si gates are used as reference. In this report, we show and discuss data concerning the oxide wearout and the breakdown transient.
The Need for Declarative Security Mechanisms
Authors: Stefan Probst, Josef Kung
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

Today, security is recognized as an absolute need in application development. Programming environments offer mechanisms and concepts allowing an easy integration of security mechanisms into the application. However, this often has to be done by hand, resulting in extra effort that has to be made during the development cycle. Furthermore, the code is popped up with statements that enforce application or site-specific security requirements, having negative impact on the reusability and maintainability of the code. The goal of this paper is to promote the usage of declarative security mechanisms which allow the decoupling of security logic completely from the application logic. Furthermore, the framework GAMMA is presented, that offers several declarative authentication, access control, and auditing mechanisms that can be transparently integrated into software applications.
The antecedents of consumers' loyalty toward internet service providers
Authors: Jyh-Shen Chiou
Venue: Information and Management (2004)

Internet popularity is growing at an impressive rate. Sooner or later, every consumer comes face to face with the decision of choosing an Internet Service Provider (ISP). This study developed and empirically tested a model examining the antecedents of consumer loyalty toward ISPs. It incorporated the concept of expected technology change into the model to examine its effects on the formation of ISP loyalty intention. Confirmatory Factor Analysis (CFA) was performed to examine the reliability and validity of the measurement model, and the structural equation modeling techniques were used to evaluate the casual model. Based on an internet survey in Taiwan, this study showed that perceived value is very important in generating overall customer satisfaction and loyalty intention toward an ISP, and that perceived trust of an ISP enhances perceived value, overall satisfaction, and loyalty intention. However, the study demonstrated that future ISP technology expectancy exerted a negative influence on a consumer's overall satisfaction and loyalty intention toward their ISP.
Approximating the cut-norm via Grothendieck's inequality
Authors: Noga Alon, Assaf Naor
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

The cut-norm ||A||C of a real matrix A=(aij)i∈ R,j∈S is the maximum, over all I ⊂ R, J ⊂ S of the quantity | Σi ∈ I, j ∈ J aij|. This concept plays a major role in the design of efficient approximation algorithms for dense graph and matrix problems. Here we show that the problem of approximating the cut-norm of a given real matrix is MAX SNP hard, and provide an efficient approximation algorithm. This algorithm finds, for a given matrix A=(aij)i ∈ R, j ∈ S, two subsets I ⊂ R and J ⊂ S, such that | Σi ∈ I, j ∈ J aij| ≥ ρ ||A||C, where ρ > 0 is an absolute constant satisfying $ρ > 0. 56. The algorithm combines semidefinite programming with a rounding technique based on Grothendieck's Inequality. We present three known proofs of Grothendieck's inequality, with the necessary modifications which emphasize their algorithmic aspects. These proofs contain rounding techniques which go beyond the random hyperplane rounding of Goemans and Williamson [12], allowing us to transfer various algorithms for dense graph and matrix problems to the sparse case.
Understanding Web query interfaces: best-effort parsing with hidden syntax
Authors: Zhen Zhang, Bin He, Kevin Chen-Chuan Chang
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Recently, the Web has been rapidly "deepened" by many searchable databases online, where data are hidden behind query forms. For modelling and integrating Web databases, the very first challenge is to understand what a query interface says- or what query capabilities a source supports. Such automatic extraction of interface semantics is challenging, as query forms are created autonomously. Our approach builds on the observation that, across myriad sources, query forms seem to reveal some "concerted structure," by sharing common building blocks. Toward this insight, we hypothesize the existence of a hidden syntax that guides the creation of query interfaces, albeit from different sources. This hypothesis effectively transforms query interfaces into a visual language with a non-prescribed grammar- and, thus, their semantic understanding a parsing problem. Such a paradigm enables principled solutions for both declaratively representing common patterns, by a derived grammar, and systematically interpreting query forms, by a global parsing mechanism. To realize this paradigm, we must address the challenges of a hypothetical syntax- that it is to be derived, and that it is secondary to the input. At the heart of our form extractor, we thus develop a 2P grammar and a best-effort parser, which together realize a parsing mechanism for a hypothetical syntax. Our experiments show the promise of this approach-it achieves above 85% accuracy for extracting query conditions across random sources.
Processing Normative References on the Basis of Natural Language Questions
Authors: Monica Palmirani, Raffaella Brighi, Matteo Massini
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This essay shows how an analysis of the references found in normative texts can make it easier to find the same references and related information in a document base starting from randomly selected strings of text.
The Wrong Stuff?
Authors: Richard Ford
Venue: IEEE Security and Privacy (2004)

Virus-detection technology is based on fairly simple rules, and researchers and industry developers have done much hard work. The author examines virus detectionýs state of the art and highlight some of its shortcomings. I believe that as a community we need an honest reassessment of our defenses. Are we are pursuing a failed solution, focusing on the wrong stuff?
Identification of Highly Significant Sequence Patterns in siRNAs for the Optimal Design of siRNA
Authors: WeiPing Chen, Dongying Wu, Wei Zha, Paul Russell
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

siRNAs for gene silencing studies have a broad range of applications. Studies haveaddressed the design of siRNAs based on the target sequence patterns, such as the sequence AA around the ends of the siRNA or the avoidance of GGG in siRNA sequences. However, information from just these two patterns is not sufficient for effectively designing siRNA. Nine sequence patterns were identified as highly significantly correlated motifs in studies on oligonucleotides antisense activities. The correlation between the sequence patterns of the siRNA and the gene silencing ratio (GSR) by siRNA has not been described. Understanding this relationship may guide one to a systematic design of the most effective siRNAs. We designed a computer program to calculate the sequence patterns from our siRNA silencing database. Four statistical methods were used to identify the frequency and the distribution of the highly significant sequence patterns from the 1344 combinations for the three, four, and five nucleotide sequences. For the first time, 52 sequence patterns were identified as the highly significant patterns by ANOVA and Pearson correlation analyses with the GSR. These 52 patterns were further clustered into 18 groups. Information from this study may help in the optimized design of siRNA.
TSU.MI.KI: Stimulating Children's Creativity and Imagination with Interactive Blocks
Authors: Yuichi Itoh, Shintaro Akinobu, Hiroyasu Ichida, Ryoichi Watanabe, Yoshifumi Kitamura, Fumio Kishino
Venue: Proceedings of the Second International Conference on Creating, Connecting and Collaborating through Computing (2004)

Young children often build various structures withwooden blocks; structures that are often used forpretend play, subtly improving childrenýs creativityand imagination. Based on a traditional Japanesewooden block toy, Tsumiki, we propose a novelinteractive toy for children, maintaining the physicalassets of wooden blocks and enhancing them withautomation. We name our interactive toy"TSU.MI.KI." "TSU.MI.KI" consists of a set ofcomputerized blocks equipped with severalinput/output devices. Children can tangibly interactwith a virtual scenario by manipulating andconstructing structures from the physical blocks, andby using input and output devices that are integratedinto the blocks. TSU.MI.KI retains the physicaladvantages of its ancient predecessor and adds adistinct interactive layer that supports creativity byimitating a storyteller or a supportive caregiver.
Cyclic Redundancy Code (CRC) Polynomial Selection For Embedded Networks
Authors: Philip Koopman, Tridib Chakravarty
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Cyclic Redundancy Codes (CRCs) provide a first line ofdefense against data corruption in many networks.Unfortunately, many commonly used CRC polynomialsprovide significantly less error detection capability thanthey might. An exhaustive exploration reveals that mostpreviously published CRC polynomials are either inferiorto alternatives or are only good choices for particularmessage lengths. Unfortunately these shortcomings andlimitations often seem to be overlooked. This paperdescribes a polynomial selection process for embeddednetwork applications and proposes a set of goodgeneral-purpose polynomials. A set of 35 newpolynomials in addition to 13 previously publishedpolynomials provides good performance for 3- to 16-bitCRCs for data word lengths up to 2048 bits.