ppxscal/embedding_network huggingface dataset:
Autocorrelation and regularization of query-based information retrieval scores
Authors: James Allan
Venue:  (2008)

Query-based information retrieval refers to the process of scoring documents given a short natural language query. Query-based information retrieval systems have been developed to support searching diverse collections such as the world wide web, personal email archives, news corpora, and legal collections. This thesis is motivated by one of the tenets of information retrieval: the cluster hypothesis. We define a design principle based on the cluster hypothesis which states that retrieval scores should be locally consistent. We refer to this design principle as score autocorrelation. Our experiments show that the degree to which retrieval scores satisfy this design principle correlates positively with system performance. We use this result to define a general, black box method for improving the local consistency of a set of retrieval scores. We refer to this process as local score regularization. We demonstrate that regularization consistently and significantly improves retrieval performance for a wide variety of baseline algorithms. Regularization is closely related to classic techniques such as pseudo-relevance feedback and cluster-based retrieval. We demonstrate that the effectiveness of these techniques may be explained by their regularizing behavior. We argue that regularization should be adopted either as a generic post-processing step or as a fundamental design principle for retrieval models.
Access 2007 Programming by Example with VBA, XML, and ASP
Authors: Julitta Korol
Venue: Wordware Database Library (2007)

Access 2007 Programming by Example with VBA, XML, and ASP shows non-programmers how Access databases can be created, managed, and customized with Visual Basic for Applications (VBA) a powerful programming language built into Access. Hundreds of hands-on examples and projects throughout the book show users how to take charge of their Access databases with programming. Learn how to: Write and debug your programming code with the Visual Basic Editor. Access and manipulate databases with Data Access Objects (DAO) and ActiveX Data Objects (ADO). Use the Data Definition Language (DDL) to enforce data integrity and manage database security. Modify the behavior of forms, reports, and controls by writing event procedures. Publish dynamic Access data to the web using Active Server Pages (ASP) and Extensible Markup Language (XML). Work with the new features for tables, forms, reports, macros, and templates that are available in the Access 2007 user interface. 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
Performing Efficient NURBS Modeling Operations on the GPU
Authors: Adarsh Krishnamurthy, Rahul Khardekar, Sara McMains, Kirk Haller, Gershon Elber
Venue: IEEE Transactions on Visualization and Computer Graphics (2009)

We present algorithms for evaluating and performing modeling operations on NURBS surfaces using the programmable fragment processor on the Graphics Processing Unit (GPU). We extend our GPU-based NURBS evaluator that evaluates NURBS surfaces to compute exact normals for either standard or rational B-spline surfaces for use in rendering and geometric modeling. We build on these calculations in our new GPU algorithms to perform standard modeling operations such as inverse evaluations, ray intersections, and surface-surface intersections on the GPU. Our modeling algorithms run in real time, enabling the user to sketch on the actual surface to create new features. In addition, the designer can edit the surface by interactively trimming it without the need for retessellation. Our GPU-accelerated algorithm to perform surface-surface intersection operations with NURBS surfaces can output intersection curves in the model space as well as in the parametric spaces of both the intersecting surfaces at interactive rates. We also extend our surface-surface intersection algorithm to evaluate self-intersections in NURBS surfaces.
EduWear: smart textiles as ways of relating computing technology to everyday life
Authors: Eva-Sophie Katterfeldt, Nadine Dittert, Heidi Schelhowe
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

In this paper, we report on the outcomes of the European project EduWear. The aim of the project was to develop a construction kit with smart textiles and to examine its impact on young people. The construction kit, including a suitable programming environment and a workshop concept, was adopted by children in a number of workshops. The evaluation of the workshops showed that designing, creating, and programming wearables with a smart textile construction kit allows for creating personal meaningful projects which relate strongly to aspects of young people's life worlds. Through their construction activities, participants became more self-confident in dealing with technology and were able to draw relations between their own creations and technologies present in their environment. We argue that incorporating such constructionist processes into an appropriate workshop concept is essential for triggering thought processes about the character of digital media beyond the construction process itself.
Database Technologies: Concepts, Methodologies, Tools, and Applications
Authors: John Erickson, John Erickson
Venue:  (2009)

The expanding possibilities and promising current and future potential that lies within the advancing field of database technologies encompasses many aspects of life as its beneficial features and innovative functions are seen impacting society at countless diverse angles. Database Technologies: Concepts, Methodologies, Tools, and Applications expands the field of database technologies through four-volumes of in-depth, advanced research articles from nearly 300 of the world's leading professionals. This breakthrough publication contains over 200 chapters of important concepts, methods, and functions of database technologies, covering topics such as conceptual modeling, data warehousing, and Web-based information systems. Database Technologies: Concepts, Methodologies, Tools, and Applications is a paramount contribution to the technology field and a must-have for libraries.
Formation control of multi-agent system based on potential function in complex environment
Authors: Li Wang, Zengqiang Chen, Zhongxin Liu
Venue: International Journal of Systems, Control and Communications (2009)

Formation control of mobile multi-agent system is a question with practical significance in the complex dynamics system. In this paper, a multi-agent system moving in free-space and moving with obstacle avoidance is studied. Applying potential function, the multi-agent algorithms are proposed. The first algorithm is an algorithm for multi-agent system moving in free-space. Then we discuss flocking with Obstacle avoidance in multi-agent system, the second algorithm has obstacle avoidance capabilities. We present the control algorithm and make stability analysis. Finally, many computer simulations are used to show the validity of the results.
Finding Alternatives Web Services to Parry Breakdowns
Authors: Laure Bourgois
Venue: Proceeding of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium (2006)

The increasing number of Web services and thus of possible combinations is particularly hard to accord with the dynamic and versatile feature of the Web. Indeed, in general, complex Web services may frequently happen not to fit the situation encountered. To avoid composing a new Web service “from scratch”, we search a practical way of repairing failed ones. This paper presents a Web service repairing heuristic based on a semantic modeling approach. Modeling Web services is triggered with an OWL-S fragment. Repairing is based on our previous work which allows organizing a collection of Web services into hierarchies. A NEXPTIME complexity upper bound is shown for a reparation which doesn't change the internal structure of the complex Web service.
The Pocket Book of Adobe Acrobat 8 Professional
Authors: Andy Zhang
Venue:  (2008)

Adobe Acrobat 8 Professional provides an integrated development environment for creating PDF documents. The Pocket Book of Adobe Acrobat 8 Professional covers diverse sets of essential skills and instructions on how to use a variety of tools and technologies including Adobe LiveCycle Designer and Adobe Connect. Written for beginning-level users, the book details the topics of creating, combining, and exporting documents. In addition, it covers the topics of providing reviews, sharing comments, conducting meetings, creating forms, securing documents, improving accessibility, adding multimedia files and 3D models, searching and indexing, printing, and production. With this pocket-sized book, you will not only sharpen your skills but will also learn about the new features available in Adobe Acrobat 8 Professional. 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
Design Science Research Methods and Patterns: Innovating Information and Communication Technology, 1st edition
Authors: Vijay K. Vaishnavi, William Kuechler,  Jr.
Venue:  (2007)

Design research promotes understanding of advanced, cutting-edge information systems through the construction and evaluation of these systems and their components. Since this method of research can produce rigorous, meaningful results in the absence of a strong theory base, it excels in investigating new and even speculative technologies, offering the potential to advance accepted practice. Design Science Research Methods and Patterns presents innovative research methods that help break new ground by applying patterns, reuse, and design science to research. The book relies on familiar patterns to provide the solid fundamentals of various research philosophies and techniques as touchstones that demonstrate how to innovate research methods. Filled with practical examples of applying patterns to IT research with an emphasis on reusing research activities to save time and money, this book describes design science research in relation to other information systems research paradigms such as positivist and interpretivist research.
EEG Data Driven Animation and Its Application
Authors: Olga Sourina, Alexei Sourin, Vladimir Kulish
Venue: Proceedings of the 4th International Conference on Computer Vision/Computer Graphics CollaborationTechniques (2009)

Human electroencephalograph (EEG) data driven animation is often used in neurofeedback systems for concentration training in children and adults. Visualization of the time-series data could be used in neurofeedback and for the data analysis. The paper proposes a novel method of 3D mapping of EEG data and describes visualization system VisBrain that was developed for EEG data analysis. We employed a concept of a dynamic 3D volumetric shape for showing how the electrical signal changes through time. For the shape, a time-dependent solid blobby object was used. This object is defined using implicit functions. Besides just a visual comparison, we propose to apply set-theoretic ("Boolean") operations to the moving shapes to isolate activities common for both of them per time point, as well as those that are unique for either one. The advantages of the method are demonstrated with real EEG experiments examples. New emerging applications of EEG data driven animation in e-learning, games, entertainment, and medical applications are discussed.
Phastlane: a rapid transit optical routing network
Authors: Mark J. Cianchetti, Joseph C. Kerekes, David H. Albonesi
Venue: Proceedings of the 36th annual international symposium on Computer architecture (2009)

Tens and eventually hundreds of processing cores are projected to be integrated onto future microprocessors, making the global interconnect a key component to achieving scalable chip performance within a given power envelope. While CMOS-compatible nanophotonics has emerged as a leading candidate for replacing global wires beyond the 22nm timeframe, on-chip optical interconnect architectures proposed thus far are either limited in scalability or are dependent on comparatively slow electrical control networks. In this paper, we present Phastlane, a hybrid electrical/optical routing network for future large scale, cache coherent multicore microprocessors. The heart of the Phastlane network is a low-latency optical crossbar that uses simple predecoded source routing to transmit cache-line-sized packets several hops in a single clock cycle under contentionless conditions. When contention exists, the router makes use of electrical buffers and, if necessary, a high speed drop signaling network. Overall, Phastlane achieve 2X better network performance than a state-of-the-art electrical baseline while consuming 80% less network power.
Secure and policy-compliant source routing
Authors: Barath Raghavan, Patric Verkaik, Alex C. Snoeren
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

In today's Internet, inter-domain route control remains elusive; nevertheless, such control could improve the performance, reliability, and utility of the network for end users and ISPs alike. While researchers have proposed a number of source routing techniques to combat this limitation, there has thus far been no way for independent ASes to ensure that such traffic does not circumvent local traffic policies, nor to accurately determine the correct party to charge for forwarding the traffic. We present Platypus, an authenticated source routing system built around the concept of network capabilities, which allow for accountable, fine-grained path selection by cryptographically attesting to policy compliance at each hop along a source route. Capabilities can be composed to construct routes through multiple ASes and can be delegated to third parties. Platypus caters to the needs of both end users and ISPs: users gain the ability to pool their resources and select routes other than the default, while ISPs maintain control over where, when, and whose packets traverse their networks. We describe the design and implementation of an extensive Platypus policy framework that can be used to address several issues in wide-area routing at both the edge and the core, and evaluate its performance and security. Our results show that incremental deployment of Platypus can achieve immediate gains.
Gross primary production simulation in a coniferous forest using a daily gas exchange model with seasonal change of leaf physiological parameters derived from remote sensing data
Authors: Quan Wang, John Tenhunen, Timo Vesala
Venue: International Journal of Remote Sensing (2009)

The importance of including the seasonal changes of canopy physiology in carbon balance simulation models was emphasized in earlier research. This paper proposes a new approach to combine the commonly available Normalized Difference Vegetation Index (NDVI) to derive the seasonal changes of canopy physiology with a modified daily step gas exchange model to simulate the gross primary production (GPP) in a coniferous forest stand. For validation, four years (1997-2000) of continuous time-series data for GPP were derived using the observations of net ecosystem carbon dioxide exchange obtained with eddy covariance techniques. A variety of scenarios were designed to simulate the GPP with the daily model and the results (1) reaffirm the importance of including seasonal changes of canopy physiology in the carbon balance model; (2) demonstrate the feasibility of deriving the seasonal change information of canopy physiology from NDVI time-series; (3) show the importance of the quality of NDVI time-series. The results suggest that the daily model can be linked with remote sensing data, which provides information on the seasonal changes of canopy physiology, and can be an efficient tool for regional carbon balance simulation.
On Definability in Dependence Logic
Authors: Juha Kontinen, Jouko Väänänen
Venue: Journal of Logic, Language and Information (2009)

We study the expressive power of open formulas of dependence logic introduced in Väänänen [Dependence logic (Vol. 70 of London Mathematical Society Student Texts), 2007]. In particular, we answer a question raised by Wilfrid Hodges: how to characterize the sets of teams definable by means of identity only in dependence logic, or equivalently in independence friendly logic.
OECD Patent Statistics Manual
Venue:  (2009)

This 2009 edition of the OECD Patent Statistics Manual takes stock of the recent developments in the field. It provides guiding principles for the use of patent data in the context of S T measurement, and recommendations for the compilation and interpretation of patent indicators in this context. It aims to show what patent statistics can and cannot be used for, and how to count patents in order to maximise information on S T activities while minimising statistical noise and biases. Finally, it describes how patent data can be used in the analysis of a wide array of topics related to technical change and patenting activity including industry-science linkages, patenting strategies by companies, internationalisation of research, and indicators on the value of patents. Table of Content : Foreword Acronyms Chapter 1. Objectives and Scope of the Manual Chapter 2. Patents as Statistical Indicators of Science and Technology -2.1 Introduction -2.2. Legal foundations of patents -2.3 Administrative routes for protection -2.4. Economic foundations of patents -2.5. The information content of patent documents -2.6. Patents as statistical indicators of inventive activity -2.7. Patent databases -2.8. Topics of investigation -Annex 2.A1. Front page of an EPO patent application -Annex 2.A2. Front page of a JPO patent application -Annex 2.A3. Front page of a USPTO patent application Chapter 3. Patent Systems and Procedures -3.1. Introduction -3.2. The core patenting procedure -3.3. National and regional procedures -3.4. International patent applications Chapter 4. Basic Criteria for Compiling Patent-Based Indicators -4.1. Introduction -4.2. Reference Date -4.3. Reference country -4.4. PCT applications -4.5. Patent families -4.6. Normalised country-level patent indicators -Annex 4.A1. Other definitions of patent families Chapter 5. Classifying Patents by Different Criteria -5.1. Introduction -5.2. Technology fields -5.3. Industry classification -5.4. Regional classification -5.5. Institutional sectors -5.6. Patents by companies -5.7. Patents by inventors Chapter 6. The Use and Analysis of Citations in Patents -6.1. Introduction -6.2. What are citations? -6.3. Uses and applications of citations indicators -6.4. Citations practices in patent offices -6.5. Citation-based indicators -6.6. Non-patent literature -6.7. Other indicators based on the categories of citations (EPO and PCT search reports) Chapter 7. Indicators of Internationalisation of Science and Technology -7.1. Introduction -7.2. Indicators -7.3. Ownership and research strategies Chapter 8. Indicators of Patent Value -8.1. Introduction -8.2. Forward citations -8.3. Indicators based on procedural information and applicants' behaviour -8.4. Other indicators Glossary
Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables
Authors: Reynald Af Feldt, Hubert Comon-Lundh
Venue: Formal to Practical Security: Papers Issued from the 2005-2008 French-Japanese Collaboration (2009)

First-order logic resolution is a standard way to automate the verification of security protocols. However, it sometimes fails to produce security proofs for secure protocols because of the detection of false attacks. For the verification of a bounded number of sessions, false attacks can be avoided by introducing rigid variables. Unfortunately, this yields complicated resolution procedures. We show here that there is a simple translation of the security problem for a bounded number of sessions into first-order logic, that does not introduce false attacks. This is shown by translating clauses involving rigid variables into classical first-order clauses, while preserving satisfiability. We illustrate this approach by giving a complete and terminating strategy for a first-order logic fragment resulting from the above translation, that yields a decision procedure for a bounded number of sessions.
Problem Solving Process Oriented Diagnosis in Logic Programming
Authors: Nguyen-Thinh Le, Wolfgang Menzel
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

In this paper, we present the evaluation result of our constraint-based tutoring system for logic programming from which we derive the conclusion that students need diagnostic information and remedial hints corresponding to the stage of the problem solving process where they are stuck. For this reason, we propose a three steps diagnosis approach which consists of: diagnosis at the task analysis stage, diagnosis at the solution design stage and diagnosis at the implementation stage. Our diagnosis approach should not only help students learn logic programming, but also master the skills of task analysis and solution design.
A distributed adaptive scheme for detecting faults in wireless sensor networks
Authors: Jae-Young Choi, Sung-Jib Yim, Yoon Jae Huh, Yoon-Hwa Choi
Venue: WSEAS TRANSACTIONS on COMMUNICATIONS (2009)

This paper presents a distributed adaptive scheme for detecting faults in wireless sensor networks. Each sensor nodes makes a local decision based on the comparisons of its own readings with those of neighbors, along with the dissemination of the decision to them, if necessary. At the end of each fault detection cycle, each node dynamically adjusts critical parameters in the distributed fault detection algorithm, such as node degree and thresholds, resulting in high performance for a wide range of fault probabilities. By extensive computer simulation the scheme is shown to be scalable with the number of faulty sensor nodes except for sparse networks where the average node degree is extremely low.
Breast cancer diagnostic typologies by grade-of-membership fuzzy modeling
Authors: José G. Dias
Venue: Proceedings of the 2nd WSEAS international conference on Multivariate analysis and its application in science and engineering (2009)

This paper proposes de definition of breast cancer diagnostic typologies by the grade-of-membership approach. This fuzzy clustering model is described theoretically, and a fixed point algorithm is used in its estimation. An application to breast cancer diagnostic classification shows the existence of two distinct patterns. The graphical representation of the grade-of-membership estimates confirms the good fuzzy properties of the two-cluster solution.