ppxscal/embedding_network huggingface dataset:
Language features meet design patterns: raising the abstraction bar
Authors: Judith Bishop
Venue: Proceedings of the 2nd international workshop on The role of abstraction in software engineering (2008)

In the context of software engineering, abstraction is the means by which we move from layer to layer in the realization of the solution to a large problem. It has been recognized for over a decade that design patterns are one of the key mechanisms for implementing reliable and maintainable software. This paper explores where they fit in in the software "food chain". In particular, it examines how advances in language design can narrow the gap for implementing design patterns. Examples are given of syntax features in C# 3.0 (extension methods and LINQ) as well as of library methods (Serialize) in terms of which pattern implementations become easier to produce and reproduce. The challenges that face design pattern implementation are discussed and the promise of reusable design patterns examined.
The Impact of Critical Sporadic Jobs on Gang Scheduling Performance in Distributed Systems
Authors: Helen D. Karatza
Venue: Simulation (2008)

A commonly used task scheduling algorithm for parallel and distributed systems is gang scheduling. In this paper, we study gang scheduling performance in the presence of critical sporadic jobs. A simulation model is used to address performance issues associated with gang scheduling on distributed processors for various workloads. Simulated results indicate that the relative performance of the gang scheduling policies depends on the arrival rates of gangs and critical sporadic jobs and also on the variability in the critical sporadic jobs inter-arrival times.
An Effort to Understand the Optimal Routing Performance in Wireless Sensor Network
Authors: Qinghua Wang, Tingting Zhang, Stefan Pettersson
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Wireless sensor network is remarkable for its promising use on human-unattended information collection, such as forest fire monitoring. In order to support efficient communication, many routing algorithms specially designed for such networks have been proposed. However, there is no idea about whether these proposed routing algorithms are already good enough or still have a long way to become “perfect”, since there is currently a lack of understanding about the optimal routing performance. This paper makes a progress in the understanding of the optimal routing performance. Metrics here used to measure the routing performance are the network lifetime finally acquired and the total information finally collected. The condition used to judge the network’s death is defined by the user’s requirement on the guaranteed network information collecting ability. Optimization models based on the metrics and death condition mentioned above are proposed. Experiments show some existing routing proposals already work well when the user’s requirement is strict, but few of them satisfy when the user’s requirement is loose.
Introduction to Information Retrieval
Authors: Christopher D. Manning, Prabhakar Raghavan, Hinrich Schtze
Venue:  (2008)

Class-tested and coherent, this groundbreaking new textbook teaches web-era information retrieval, including web search and the related areas of text classification and text clustering from basic concepts. Written from a computer science perspective by three leading experts in the field, it gives an up-to-date treatment of all aspects of the design and implementation of systems for gathering, indexing, and searching documents; methods for evaluating systems; and an introduction to the use of machine learning methods on text collections. All the important ideas are explained using examples and figures, making it perfect for introductory courses in information retrieval for advanced undergraduates and graduate students in computer science. Based on feedback from extensive classroom experience, the book has been carefully structured in order to make teaching more natural and effective. Although originally designed as the primary text for a graduate or advanced undergraduate course in information retrieval, the book will also create a buzz for researchers and professionals alike.
Evaluation of the PTSI Crosstalk Noise Analysis Tool and Development of an Automated Spice Correlation Suite to Enable Accuracy Validation
Authors: C. R. Venugopal, Prasanth Soraiyur, Jagannath Rao
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

As process geometries are shrinking, width of the metal layer is continuously decreasing, height of the layer and wire lengths are increasing, thereby increasing the effect of coupling capacitances. Coupling induced crosstalk may induce unwanted noise on coupled signal nets resulting in functional failure and performance degradation and becomes a significant limitation in achieving first pass silicon success. At the same time the complexity of noise analysis has significantly increased due to factors such as driver weakening, IR drop, power network switching, voltage scaling and variations in manufacturing processes. Therefore validating the capabilities and verifying the analysis of a crosstalk analysis tool for current and future process nodes is very critical for efficient and accurate signoff analysis. The modeling of the cell itself needs to be accurate and comprehensive. The objective of the paper is to share the methodology and challenges involved in Crosstalk Noise Analysis and how the Composite Current Source (CCS) based Crosstalk Noise Analysis capability of PrimeTime SI would help us achieve many of our goals.
Minimizing Offset for Latching Voltage-Mode Sense Amplifiers for Sub-Threshold Operation
Authors: Joseph F. Ryan, Benton H. Calhoun
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

This paper examines latch style voltage mode sense amplifiers for operation in the sub-threshold region, where VDD
Cellwise OPC Based on Reduced Standard Cell Library
Authors: Hailong Jiao, Lan Chen
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

As critical dimensions (CDs) of integrated circuit (IC) continue to scale down, subwavelength lithography has become the mainstream of chip manufacture. Various resolution enhancement techniques (RETs) such as the popular model-based optical proximity correction (OPC) have become an indispensable part of mask data preparation. However, traditional full-chip OPC will lead to mask data explosion and prohibitive runtime. In this paper, we propose a novel kind of cellwise OPC which can reuse the results of standard-cell-based OPC. To achieve this goal, we construct a reduced standard cell library composed of merely three kinds of basic cells, which have the same size and can realize all logics of traditional standard cell library. This library is manufacture-friendly, and reuse of its OPC results can improve the efficiency of chip manufacture greatly and significantly reduce the need for large storage. The electrical simulation results of the library on several benchmark circuits also show that its overhead of area, delay, as well as power is quite minor or even competitive compared with traditional standard cell library.
On the number of colorings of a snark minus an edge
Authors: Richard C. Bradley
Venue: Journal of Graph Theory (2006)

For a given snark G and a given edge e of G, let &Psi;(G, e) denote the nonnegative integer such that for a cubic graph conformal to G {e}, the number of Tait colorings with three given colors is 18 &middot; &Psi;(G, e). If two snarks G1 and G2 are combined in certain well-known simple ways to form a snark G, there are some connections between &Psi; (G1, e1), &Psi; (G2, e2), and &Psi;(G, e) for appropriate edges e1, e2, and e of G1, G2, and G. As a consequence, if j and k are each a nonnegative integer, then there exists a snark G with an edge e such that &Psi;(G, e) = 2j &middot; 3k. &copy; 2005 Wiley Periodicals, Inc.
A longitudinal study of exploratory and keyword search
Authors: Max L. Wilson, m.c. schraefel
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

Digital libraries are concerned with improving the access to collections to make their service more effective and valuable to users. In this paper, we present the results of a four-week longitudinal study investigating the use of both exploratory and keyword forms of search within an online video archive, where both forms of search were available concurrently in a single user interface. While we expected early use to be more exploratory and subsequent use to be directed, over the whole period there was a balance of exploratory and keyword searches and they were often used together. Further, to support the notion that facets support exploration, there were more than five times as many facet clicks than more complex forms of keyword search (boolean and advanced). From these results, we can conclude that there is real value in investing in exploratory search support, which was shown to be both popular and useful for extended use of the system.
A Recursive Method for Structural Learning of Directed Acyclic Graphs
Authors: Xianchao Xie, Zhi Geng
Venue: The Journal of Machine Learning Research (2008)

In this paper, we propose a recursive method for structural learning of directed acyclic graphs (DAGs), in which a problem of structural learning for a large DAG is first decomposed into two problems of structural learning for two small vertex subsets, each of which is then decomposed recursively into two problems of smaller subsets until none subset can be decomposed further. In our approach, search for separators of a pair of variables in a large DAG is localized to small subsets, and thus the approach can improve the efficiency of searches and the power of statistical tests for structural learning. We show how the recent advances in the learning of undirected graphical models can be employed to facilitate the decomposition. Simulations are given to demonstrate the performance of the proposed method.
Shared Variable Management in SOAr-DSGrid
Authors: Xinjun Chen, Wentong Cai, Stephen J. Turner, Yong Wang
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Simulation is a low cost alternative to experimentation on real-world physical systems. In light of the prevalence of web services, issues relating to distributed simulation using web services have come to the fore in recent years. We have proposed a ser-vice-oriented architecture for distributed simulations on the Grid (SOAr-DSGrid). SOAr-DSGrid facilitates the development and execution of distributed simula-tions in different views (i.e., a component-based view for development and a service-oriented view for execu-tion). At run time, one component may require information from another component for execution or decision-making. In SOAr-DSGrid, this shared information from one component to another component is implemented through shared variables. Since two components may execute out of phase, without proper shared variable management, the value provided by one component may be invalid for another component due to the time difference. Since SOAr-DSGrid provides a service-oriented view for component execution, the development of shared variable support also follows the service-oriented methodology. Three different ap-proaches, namely Pull without FutureList, Pull with FutureList, and Push, have been implemented as the internal mechanism to solve the shared variable issue. Experimental results of the performance of these three approaches are also presented in this paper.
A secure privacy-preserving roaming protocol based on hierarchical identity-based encryption for mobile networks
Authors: Zhiguo Wan, Kui Ren, Bart Preneel
Venue: Proceedings of the first ACM conference on Wireless network security (2008)

Roaming services in wireless networks provide people with preferable flexibility and convenience. However, such advantages should be offered with both security and privacy in mind. With consideration on privacy protection during roaming in wireless networks, we proposed a hierarchical ID-based roaming protocol in this paper. In our scheme, we use a 2-layer hierarchical ID-based cryptosystem in which a trusted party acts as the root authority, each domain server acts as the second-layer authority, and the roaming user is the end user. With the hierarchical ID-based cryptosystem, we can avoid involvement with home network, and keep the roaming the user's identity private. Furthermore, not only the root authority is relieved from management of a large amount of private/public key pairs, but the domain servers are free to generate key pairs for their registered users. At the same time, we use hash chains together with ID-based signatures to achieve non-repudiation for service payment.
On the acyclic choosability of graphs
Authors: Mickaël Montassier, Pascal Ochem, André Raspaud
Venue: Journal of Graph Theory (2006)

A proper vertex coloring of a graph G = (V,E) is acyclic if G contains no bicolored cycle. A graph G is L-list colorable if for a given list assignment L = {L(v): v &epsilon; V}, there exists a proper coloring c of G such that c (v) &epsilon; L(v) for all v &epsilon; V. If G is L-list colorable for every list assignment with |L (v)| &ge; k for all v &epsilon; V, then G is said k-choosable. A graph is said to be acyclically k-choosable if the obtained coloring is acyclic. In this paper, we study the links between acyclic k-choosability of G and Mad(G) defined as the maximum average degree of the subgraphs of G and give some observations about the relationship between acyclic coloring, choosability, and acyclic choosability. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory 51: 281300, 2006
TS-Mid: Middleware for Wireless Sensor Networks Based on Tuple Space
Authors: Rita de Cássia Acioli Lima, Nelson Souto Rosa, Igor Roberto L. Marques
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The inherently distributed nature of wireless sensor networks (WSN) applications makes clear the necessity of adopting middleware systems in their development. However, the middleware must be designed regarding proper characteristics of WSNs such as low power consumption, processing capacity and bandwidth. In this scenario, we propose a middleware (TS-Mid) that provides communication based on a JavaSpace-compliant tuple space (shared memory), whilst it enables the creation of logical regions inside WSNs. The communication through tuple space is interesting in wireless networks and the notion of logical regions serves as a basic mechanism for power saving.
Diff and merge support for model based development
Authors: Lars Bendix, Pär Emanuelsson
Venue: Proceedings of the 2008 international workshop on Comparison and versioning of software models (2008)

Feature oriented development using models has many advantages. However, there are serious obstacles when it comes to using this approach because of lack of support for teamwork when using models. We believe that one solution is a better connection between research and problems -- and we suggest some strategies to pursue to achieve better support for teamwork when using models.
Broadband multi-objective synthesis of patch antennas
Authors: Zbynek Lukeš, Petr Šmíd, Zbynék Raida
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

The paper is oriented to a novel approach to the synthesis of non-conventional patch antennas exhibiting wideband or multi-band behavior. The synthesis is based on the frequency-domain moment method analysis of planar patch antennas and on their multi-objective genetic optimization. Antenna matching in the selected frequency band and its maximum gain in x-directions and y-directions are chosen as the three basic criteria of the multi-objective optimization.
Interference automata
Authors: M. V. Panduranga Rao
Venue: Theoretical Computer Science (2008)

We propose a computing model, the Two-Way Optical Interference Automata (2OIA), that makes use of the phenomenon of optical interference. We introduce this model to investigate the increase in power, in terms of language recognition, of a classical Deterministic Finite Automaton (DFA) when endowed with the facility of interference. The question is in the spirit of Two-Way Finite Automata With Quantum and Classical States (2QCFA) [A. Ambainis, J. Watrous, Two-way finite automata with quantum and classical states, Theoret. Comput. Sci. 287 (1) (2002) 299-311] wherein the classical DFA is augmented with a quantum component of constant size. We test the power of 2OIA against the languages mentioned in the above paper. We give efficient 2OIA algorithms to recognize languages for which 2QCFA machines have been shown to exist, as well as languages whose status vis-a-vis 2QCFA has been posed as open questions. Having a DFA as a component, it trivially recognizes regular languages. We show that our model can recognize all languages recognized by 1-way deterministic blind counter automata. Finally we show the existence of a language that cannot be recognized by a 2OIA but which can be recognized by an O(n^3) space Turing machine.
Resistance and the underlife: Informal written literacies and their relationship to human information behavior
Authors: Ciaran B. Trace
Venue: Journal of the American Society for Information Science and Technology (2008)

This article presents findings from a research study (Trace, 2004) that looked at a particular aspect of human information behavior: children's information creation in a classroom setting. In the portion of the study described here, naturalism and ethnomethodology are used as theoretical frameworks to investigate informal documents as an information genre. Although previous studies have considered the role of informal documents within the classroom, little sustained attention has been paid to pre-adolescents, particularly in terms of how they create unofficial or vernacular literacies both to navigate their growing awareness of the formal (albeit sometimes &ldquo;hidden&rdquo;) curriculum and, on occasion, to subvert it, positing an alternative economy that itself can be &ldquo;hidden&rdquo; via surreptitious use of informal documents. Making explicit the ties that exist between these objects and the worlds in which they are embedded demonstrates that informal documents hold a particular relevance for children within this social context (Garfinkel & Bittner, 1999). Furthermore, this article demonstrates that an ethnomethodologically informed viewpoint of information creation brings a level of dignity and determination to an individual's human information behavior, allowing us to appreciate the human ability to recontextualize or reenvisage sanctioned or official information genres to meet our own needs and purposes. &copy; 2008 Wiley Periodicals, Inc.
Determining the equivalence for one-way quantum finite automata
Authors: Lvzhou Li, Daowen Qiu
Venue: Theoretical Computer Science (2008)

Two quantum finite automata are equivalent if for any input string x the two automata accept x with equal probability. In this paper, we first focus on determining the equivalence for one-way quantum finite automata with control language (CL-1QFAs) defined by Bertoni et al., and then, as an application, we address the equivalence problem for measure-many one-way quantum finite automata (MM-1QFAs) introduced by Kondacs and Watrous. More specifically, we obtain that: (i)Two CL-1QFAs A"1 and A"2 with control languages (regular languages) L"1 and L"2, respectively, are equivalent if and only if they are (c"1n"1^2+c"2n"2^2-1)-equivalent, where n"1 and n"2 are the numbers of states in A"1 and A"2, respectively, and c"1 and c"2 are the numbers of states in the minimal DFAs that recognize L"1 and L"2, respectively. Furthermore, if L"1 and L"2 are given in the form of DFAs, with m"1 and m"2 states, respectively, then there exists a polynomial-time algorithm running in time O((m"1n"1^2+m"2n"2^2)^4) that takes as input A"1 and A"2 and determines whether they are equivalent. (ii)(As an application of item (i)): Two MM-1QFAs A"1 and A"2 with n"1 and n"2 states, respectively, are equivalent if and only if they are (3n"1^2+3n"2^2-1)-equivalent. Furthermore, there is a polynomial-time algorithm running in time O((3n"1^2+3n"2^2)^4) that takes as input A"1 and A"2 and determines whether A"1 and A"2 are equivalent.
RFID-based networks: exploiting diversity and redundancy
Authors: Nitin Vaidya, Samir R. Das
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2008)

In this article, we outline a research agenda for developing protocols and algorithms for densely populated RFID based systems covering a wide geographic area. This will need multiple readers collaborating to read RFID tag data. We consider cases where the tag data is used for identification, or for sensing environmental parameters. We address performance issues related to 'accuracy' and 'efficiency' in such systems by exploiting 'diversity' and 'redundancy'. We discuss how tag multiplicity can be used to improve accuracy. In a similar fashion, we explore how reader diversity, achieved by using multiple readers with potentially partially overlapping coverage areas, can be exploited to improve accuracy and efficiency. Finally, we show how multiple antennas in a reader can be used to improve accuracy and access rates by utilizing antenna diversity. RFID tag/sensor data can be highly redundant for the purpose of answering a higher level query. For example, often the higher level query needs to compute a statistic or a function on the sensory data obtained by the RFID sensors, and does not need all the individual sensor readings. We outline the need for efficient tag-to-reader communication, and reader-to-reader coordination to effectively compute such functions with low overhead.
Using Composition Policies to Manage Authentication and Authorization Patterns and Services
Authors: Judith E. Y. Rossebø, Rolv Bræk
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

This paper presents a policy-driven approach to service engineering, addressing the gap between static structure specification and dynamic behavioral specification. By this we mean providing a more complete means of documenting the composition of separately specified behaviors. We introduce the concept of a policy enforcement state machine diagram to specify the linking of collaborations for which the behavior has been specified separately using semantic connectors. We also use composition patterns which define constraints/restrictions on collaborations that run in parallel in a service.
Developmental evaluation in Genetic Programming: The TAG-based frame work
Authors: Tuan-Hao Hoang, Daryl Essam, McKay RI (Bob), Nguyen Xuan Hoai
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2008)

We build on our previous feasibility studies [18,20], which demonstrated the impact of evaluation during development in the DEVTAG system, and here present a full-fledged developmental system - Developmental Tree Adjoining Grammar Guided Genetic Programming (DTAG3P) with developmental evaluation, based on Tree-Adjoining Grammars (TAG). While DEVTAG used only a trivial developmental process, DTAG3P uses L-systems to encode TAG derivation trees, because the L-systems permit a full developmental process. DEVTAG was previously shown to dramatically out-perform standard Genetic Programming (GP) on some structured families of problems; here, we examine DTAG3P's performance on these families, and find a further major increment in performance over DEVTAG. DTAG3P achieves this despite dispensing with two extra control parameters which were necessary with DEVTAG.