ppxscal/embedding_network huggingface dataset:
Efficient peer-to-peer keyword searching
Authors: Patrick Reynolds, Amin Vahdat
Venue: Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware (2003)

The recent file storage applications built on top of peer-to-peer distributed hash tables lack search capabilities. We believe that search is an important part of any document publication system. To that end, we have designed and analyzed a distributed search engine based on a distributed hash table. Our simulation results predict that our search engine can answer an average query in under one second, using under one kilobyte of bandwidth.
Multiple target tracking with lazy background subtraction and connected components analysis
Authors: Robert G. Abbott, Lance R. Williams
Venue: Machine Vision and Applications (2009)

Background subtraction, binary morphology, and connected components analysis are the first processing steps in many vision-based tracking applications. Although background subtraction has been the subject of much research, it is typically treated as a stand-alone process, dissociated from the subsequent phases of object recognition and tracking. This paper presents a method for decreasing computational cost in visual tracking systems by using track state estimates to direct and constrain image segmentation via background subtraction and connected components analysis. We also present a multiple target tracking application that uses the technique to achieve a large reduction in computation costs.
Eclipse Modeling Project: A Domain-Specific Language (DSL) Toolkit, 1 edition
Authors: Richard C. Gronback
Venue:  (2009)

Achieve Breakthrough Productivity and Quality with MDD and Eclipse-Based DSLs Domain-specific languages (DSLs) and model-driven development (MDD) offer software engineers powerful new ways to improve productivity, enhance quality, and insulate systems from rapid technological change. Now, theres a pragmatic, start-to-finish guide to creating DSLs and using MDD techniques with the powerful open source Eclipse platform. In Eclipse Modeling Project, Richard C. Gronback illuminates both the principles and techniques software professionals need to master, offering insights that will be invaluable to developers working with any tool or platform. As coleader of the Eclipse Modeling Project, Gronback is singularly well-positioned to demonstrate DSLs and MDD at work in Eclipse. Gronback systematically introduces each of the Eclipse technologies that can be used in DSL and MDD development. Throughout, he introduces key concepts and technologies in the context of a complete worked example and presents new best practices and never-before published techniques. He also covers Eclipse projects discussed in no other book, including Query/View/Transformation (QVT) and the Graphical Modeling Framework (GMF)a project the author personally leads. Eclipse Modeling Project gives software practitioners all the knowledge they need to explore the remarkable potential of DSLs and MDDand includes coverage of Why a model-based approach enables the rapid customization of high-quality solutions within the product line paradigm How the Eclipse Modeling Projects capabilities can be used to efficiently create new DSLs Powerful techniques for developing DSL abstract syntax, graphical notation, and textual syntax How to build Model-to-Model (M2M) and Model-to-Text (M2T) transformationsincluding a powerful new M2M implementation of the Object Management Groups QVT Operational Mapping Language (OML) Efficiently packaging and deploying DSLs with Eclipse Complete reference sections for the Graphical Editing Framework (GEF), GMF runtime and tooling, QVT OML, Xpand, and more Foreword xix Preface xxi Acknowledgments xxiii About the Author xxv Part I: Introduction 1 Chapter 1: Introduction 3 Chapter 2: Modeling Project as a DSL Toolkit 17 Part II: Developing Domain-Specific Languages 27 Chapter 3: Developing a DSL Abstract Syntax 29 Chapter 4: Developing a DSL Graphical Notation 55 Chapter 5: Developing a DSL Textual Syntax 227 Chapter 6: Developing Model-to-Model Transformations 231 Chapter 7: Developing Model-to-Text Transformations 277 Chapter 8: DSL Packaging and Deployment 303 Part III: Reference 315 Chapter 9: Graphical Editing Framework 317 Chapter 10: Graphical Modeling Framework Runtime 353 Chapter 11: Graphical Modeling Framework Tooling 503 Chapter 12: Graphical Modeling Framework FAQs 545 Chapter 13: Query/View/Transformation Operational Mapping Language 549 Chapter 14: Xpand Template Language 605 Part IV: Appendixes 651 Appendix A: Graphical Modeling Framework Key Bindings 653 Appendix B: Model-Driven Architecture at Eclipse 661 References 671
Architecture for Large Scale Deployment of WiMAX Networks
Authors: Saleh Yousefi, Mojtaba Mazoochi, Saeed Bashirzadeh
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

In this paper we propose a novel totally WiMAX-based architecture for large scale wireless broadband access. To provision scalable QoS, nodes' traffic should be managed locally. This is achieved through adding some gateway nodes which consequently leads to some cost. In order to realize the proposed architecture, intelligent node placement is primordial such the both cost and performance requirements are satisfied. We thus firstly review the most important node placement works in wireless networks. Then based on distinctive characteristics of WiMAX networks, we provide guidelines on suitable node placement methods in order to deploy the proposed architecture in real-life metropolitan scale.
Heuristic Optimization for Dual-resource Constrained Job Shop Scheduling
Authors: Huiyuan Ren, Lili Jiang, Xiaoying Xi, Muzhi Li
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

In the study of job shop scheduling problem in mass injection molding processing enterprises, the practical job shop scheduling environment cannot be mirrored in the traditional study only considering machine resources. A dual-resource (machines and moulds) constrained job shop scheduling problem model was established in this paper, according to the actual factors of mass injection molding processing job shop scheduling. A heuristic active algorithm combined with priority rules is employed to give the solution. Finally, an example is made to illustrate the algorithm, whose schedule result is shown with a Gantt chart.
An Efficient Gray-level Clustering Algorithm for Image Segmentation
Authors: Fan-Chei Cheng, Yu-Kumg Chen, Kuan-Ting Liu
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

Gray-level clustering is an important procedure in image processing, which reduces the gray-level of an image. In order to display an image with high gray level in a screen with lower gray level, a good gray-level clustering algorithm is necessary to complete this job. Based on the mean value and standard deviation of histogram within a sub-interval, a novel recursive algorithm for solving the gray-level reduction is proposed in this paper. It divides the sub-interval recursively until the difference between original image and clustered image within a given threshold. Experiments are carried out for some samples with high gray level to demonstrate the computational advantage of the proposed method.
An adaptive personalized news dissemination system
Authors: Ioannis Katakis, Grigorios Tsoumakas, Evangelos Banos, Nick Bassiliades, Ioannis Vlahavas
Venue: Journal of Intelligent Information Systems (2009)

With the explosive growth of the Word Wide Web, information overload became a crucial concern. In a data-rich information-poor environment like the Web, the discrimination of useful or desirable information out of tons of mostly worthless data became a tedious task. The role of Machine Learning in tackling this problem is thoroughly discussed in the literature, but few systems are available for public use. In this work, we bridge theory to practice, by implementing a web-based news reader enhanced with a specifically designed machine learning framework for dynamic content personalization. This way, we get the chance to examine applicability and implementation issues and discuss the effectiveness of machine learning methods for the classification of real-world text streams. The main features of our system named PersoNews are: (a) the aggregation of many different news sources that offer an RSS version of their content, (b) incremental filtering, offering dynamic personalization of the content not only per user but also per each feed a user is subscribed to, and (c) the ability for every user to watch a more abstracted topic of interest by filtering through a taxonomy of topics. PersoNews is freely available for public use on the WWW ( http://news.csd.auth.gr ).
Microsoft SQL Server 2008 T-SQL Fundamentals
Authors: Itzik Ben-gan
Venue: Pro-Developer (2008)

This book walks you through your first steps in T-SQL (also known as Transact-SQL), which is Microsoft SQL Server s dialect of the standard ANSI-SQL language. You ll learn the theory behind T-SQL querying and programming, how to develop T-SQL code to query and modify data, and get an overview of programmable objects. Although this book is intended for beginners, it is not merely a step-by-step book. It goes beyond the syntactical elements of T-SQL and explains the logic behind the language and its elements. Many aspects of SQL are unique to the language, and are very different from other programming languages. This book helps you adopt the right state of mind and gain a true understanding of the language elements. You learn how to think in terms of sets and follow good SQL programming practices. The book is not version-specific; it does, however, cover language elements that were introduced in recent versions of SQL Server, including SQL Server 2008. To complement the learning experience, the book provides exercises that enable you to practice what you ve learned. The book starts with a theoretical background to T-SQL querying and programming (Chapter 1) laying the foundations for the rest of the book, and also coverage of creating tables and defining data integrity. The book moves on to various aspects of querying and modifying data (Chapters 2 through 8), then to a discussion of concurrency and transactions (Chapter 9), and finally provides an overview of programmable objects (Chapter 10). This book features a companion Web site that makes available to you all the code used in the book, the errata, additional resources, and more.
Numerical Study of Rayleigh-Benard Convection in a Rectangular Box
Authors: V. V. Kolmychkov, O. S. Mazhorova, Yu. P. Popov, O. V. Shcheritsa
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

Numerical study for convective instability of a liquid with linear vertical initial temperature profile in a closed box is presented. The paper provides stability analysis of two-dimensional rolls. Results are compared with R. Krishnamurti, F.H. Busse and coworkers data.
Robust FPGA resynthesis based on fault-tolerant Boolean matching
Authors: Yu Hu, Zhe Feng, Lei He, Rupak Majumdar
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

We present FPGA logic synthesis algorithms for stochastic fault rate reduction in the presence of both permanent and transient defects. We develop an algorithm for fault tolerant Boolean matching (FTBM), which exploits the flexibility of the LUT configuration to maximize the stochastic yield rate for a logic function. Using FTBM, we propose a robust resynthesis algorithm (ROSE) which maximizes stochastic yield rate for an entire circuit. Finally, we show that existing PLB (programmable logic block) templates for area-aware Boolean matching and logic resynthesis are not effective for fault tolerance, and propose a new robust template with path re-convergence. Compared to the state-of-the-art academic technology mapper Berkeley ABC, ROSE using the proposed robust PLB template reduces the fault rate by 25% with 1% fewer LUTs, and increases MTBF (mean time between failures) by 31%, while preserving the optimal logic depth.
Program debugging
Authors: Helene E. Kulsrud, Robert M. Blazer, Hermann H. Goldstine, Ralph Grishman, M. D. McIlroy, P. E. Hagerty, Helene E. Kulsrud
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The computing community is now concerned with the cost in time and money consumed by the debugging process. In spite of advances, such as proving program correctness, use of higher level languages and new methods for structuring programs, the problem remains. The panelists will consider many phases of the debugging activity as it exists today, giving their views on current and proposed tools and techniques.
Strategic Out-Tasking: Creating "win-win" outsourcing partnerships
Authors: Karthik Krishnamurthy, David Jegen, Bill Brownell
Venue: Information and Management (2009)

IT outsourcing is one of the most prevalent trends in business today. Yet traditional outsourcing models force tradeoffs by both the enterprise and its outsourcer. The former often compromise operational flexibility and innovation while the latter price deals to win, resulting in razor-thin margins and aggressive cost reduction. Strategic Out-Tasking can be seen as a ''win-win'' model that breaks the traditional, vicious cycle of negative compromise. Many visionary enterprises and leading outsourcers are embracing the guiding principles of a Strategic Out-Tasking model. From an operational perspective, this helps drive greater innovation within enterprises, yields higher outsourcer margins, and, more importantly, reduces partnership risk. We believe that Strategic Out-Tasking can, over the next few years, deliver $16 to $23 billion in industry bottom-line savings that enterprises and outsourcers can share.
A generative power-law search tree model
Authors: Alda Carvalho, Nuno Crato, Carla Gomes
Venue: Computers and Operations Research (2009)

It is now a well-established fact that search algorithms can exhibit heavy-tailed behavior. However, the reasons behind this fact are not well understood. We provide a generative search tree model whose distribution of the number of nodes visited during search is formally heavy-tailed. Our model allows us to generate search trees with any degree of heavy-tailedness. We also show how the different regimes observed for the runtime distributions of backtrack search methods across different constrainedness regions of random CSP models can be captured by a mixture of the so-called stable distributions.
Metamodelling for Software Engineering
Authors: Cesar Gonzalez-Perez, Brian Henderson-Sellers
Venue:  (2008)

This book focuses on metamodelling as a discipline, exploring its foundations, techniques and results. It presents a comprehensive metamodel that covers process, product and quality issues under a common framework.Issues covered include:An explanation of what metamodelling is and why it is necessary in the context of software engineering. Basic concepts and principles of traditional metamodelling, and some existing results of this approach. Problems associated with traditional approaches to Metamodelling are discussed, alongside an exploration of possible solutions and alternative approaches. Advanced topics such as the extension of the object-oriented paradigm for metamodelling purposes or the foundations of powertype-based tool development will be studied. Finally, a comprehensive case study is introduced and developed, showing how to use many of the concepts explained in the previous chapters. This book provides a comprehensive conceptual framework for metamodelling and includes case studies and exercises which will demonstrate practical uses of metamodelling. For lecturers and educators, the book provides a layered repository of contents, starting from the basics of metamodelling in the first chapters, through specific issues such as trans-layer control or non-strict approaches, up to advanced topics such as universal powertyping or extensions to the object-oriented paradigm. The book also serves as an in-depth reference guide to features and technologies to consider when developing in-house software development methods or customising and adopting off-the-shelf ones. Software tool developers and vendors can benefit from the book by finding in it a comprehensive guide to the implementation of frameworks and toolsets for computer-aided software modelling and development.
Tableau calculus for preference-based conditional logics: PCL and its extensions
Authors: Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Camilla Schwind
Venue: ACM Transactions on Computational Logic (TOCL) (2009)

We present a tableau calculus for some fundamental systems of propositional conditional logics. We consider the conditional logics that can be characterized by preferential semantics (i.e., possible world structures equipped with a family of preference relations). For these logics, we provide a uniform completeness proof of the axiomatization with respect to the semantics, and a uniform labeled tableau procedure.
Common knowledge does not have the Beth property
Authors: Thomas Studer
Venue: Information Processing Letters (2009)

Common knowledge is an essential notion for coordination among agents. We show that the logic of common knowledge does not have the Beth property and thus it also lacks interpolation. The proof we present is a variant of Maksimova's proof that temporal logics with 'the next' do not have the Beth property. Our result also provides an explanation why it is so difficult to find 'nice' deductive systems for common knowledge.
A Novel Model for Multi-agent Systems to Improve Communication Efficiency
Authors: Alireza Noroozi
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

By communicating and information exchange, agents can fulfill goals of multi-agent systems. Different communication languages and protocols have been proposed for agents. These languages are designed to transfer high level data and don’t have appropriate efficiency to send sensing. hearing and visual information in real environments. In this paper a model to exchange such kind of data in an efficient manner is proposed which increases multi-agent systems capabilities. Model Analysis and simulation results show the superiority of the model.
Towards a Universal Toolkit Model for Structures
Authors: Prasun Dewan
Venue: Engineering Interactive Systems: EIS 2007 Joint Working Conferences, EHCI 2007, DSV-IS 2007, HCSE 2007, Salamanca, Spain, March 22-24, 2007. Selected Papers (2008)

Model-based toolkit widgets have the potential for (i) increasing automation and (ii) making it easy to substitute a user-interface with another one. Current toolkits, however, have focused only on the automation benefit as they do not allow different kinds of widgets to share a common model. Inspired by programming languages, operating systems and database systems that support a single data structure, we present here an interface that can serve as a model for not only the homogeneous model-based structured-widgets identified so far --- tables and trees --- but also several heterogeneous structured-widgets such as forms, tabbed panes, and multi-level browsers. We identify an architecture that allows this model to be added to an existing toolkit by automatically creating adapters between it and existing widget-specific models. We present several full examples to illustrate how such a model can increase both the automation and substitutability of the toolkit. We show that our approach retains model purity and, in comparison to current toolkits, does not increase the effort to create existing model-aware widgets.
Acceptance criteria for computer security
Authors: William Neugent
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

Acceptance criteria define the degree of quality required and identify areas to be examined in evaluating the degree of quality. Three categories of computer security acceptance criteria are proposed: functionality, performance, and development method. Each is further divided into sub-categories. Aids in formulating requirements and criteria are noted, including the use of organizational policies and risk analysis methods. Quantification is shown as a volatile tool, since numbers are often treated as single data points rather than as ranges. A set of principles is presented, to be followed in formulating acceptance criteria. Illustrative principles are as follows: (1) Get a good start, (2) make sure everyone understands, (3) distinguish shall from should, and (4) explain why. The acceptance determination process is discussed, a key point being that intermediate products must be approved. The value of acceptance criteria is in making the product better and the judgment easier.
Computationally sound implementations of equational theories against passive adversaries
Authors: Mathieu Baudet, Véronique Cortier, Steve Kremer
Venue: Information and Computation (2009)

In this paper we study the link between formal and cryptographic models for security protocols in the presence of passive adversaries. In contrast to other works, we do not consider a fixed set of primitives but aim at results for arbitrary equational theories. We define a framework for comparing a cryptographic implementation and its idealization with respect to various security notions. In particular, we concentrate on the computational soundness of static equivalence, a standard tool in cryptographic pi calculi. We present a soundness criterion, which for many theories is not only sufficient but also necessary. Finally, to illustrate our framework, we establish the soundness of static equivalence for the exclusive OR and a theory of ciphers and lists.
A SOA-Driven Content Discovery and Retrieval Platform
Authors: Scott Mitchell, M. Brian Blake, David Cunningham, Sri Gopalan
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

Service-oriented architecture (SOA) has emerged as a promising paradigm for the inter-organizational sharing of domain-specific capabilities. Perhaps an equally important emergence is the use of SOA to manage the sharing of disparate information within a distributed environment. SOA provides a platform for organizations to enable the user-driven advertisement, discovery, and retrieval of data. A major shortcoming in the state-of-the-art is the lack of principled approaches for handling the sharing of large amounts of data within potentially resource-constrained environments while respecting the fundamental tenants of SOA. In this paper, we present several use cases where information sharing is paramount within a heterogeneous enterprise setting. Subsequently, we discuss a SOA-driven framework for realizing enterprise-wide data discovery and retrieval leveraging industry best practices and open standards.