ppxscal/embedding_network huggingface dataset:
A model, schema, and interface for metadata file systems
Authors: Stijn Dekeyser, Richard Watson, Lasse Motrøen
Venue: Proceedings of the thirty-first Australasian conference on Computer science - Volume 74 (2008)

Modern computer systems are based on the traditional hierarchical file system model, but typically contain large numbers of files with complex interrelationships. This traditional model is not capable of meeting the needs of current computer system users, who need to be able to store and retrieve files based on flexible criteria. A metadata file system can associate an extensive and rich set of data with a file, thus enabling more effective file organisation and retrieval than traditional file systems. In this paper we review a wide range of existing proposals to add metadata to files and make that metadata available for searching. We then propose a hierarchy of definitions for metadata file systems based on the reviewed prototypes. We introduce a data model for a database-oriented pure mdfss complete with operations and semantics. The model supports user-initiated instance and schema updates and file searches based on structured queries. We also explore the design space of a set of user interface operations intended to implement the pure model and facilitate the capturing of rich metadata. We argue that without such a simple method for users to create rich metadata, progress in this field will remain limited.
Correlating Multi-Step Attack and Constructing Attack Scenarios Based on Attack Pattern Modeling
Authors: Zhijie Liu, Chongjun Wang, Shifu Chen
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Most cyber-attacks are not single attack actions. They are multi-step attacks composed by a set of attack actions. Although techniques used by attackers can be diverse, attack patterns are generally finite. So we need to find attack steps that are correlated in an attack scenario. By studying the patterns of multi-step cyber attacks, an algorithm is presented for correlating multi-step cyber attacks and constructing attack scenario system based on modeling multi-step cyber attacks. When alerts appear, the algorithm turns them into corresponding attack models based on the knowledge base and correlates them, whether alert or not is based on the weighted cost in the attack path graph and the attack degree of the corresponding host. And attack scenarios can be constructed by correlating the attack path graphs. Moreover, the model can detect intrusion alerts in real time and revise the attack scenarios. Experiments on the DARPA IDS test dataset show the validity of the algorithm.
MANAGING RESPONSIVE ENVIRONMENTS WITH SOFTWARE AGENTS
Authors: Flavio Soares Correa da Silva, Wamberto Weber Vasconcelos
Venue: Applied Artificial Intelligence (2007)

Responsive environments are physical surroundings whose components change their behavior to accommodate the presence of people as well as other components. We describe a means to manage responsive environments whereby each component is dynamically assigned a software agent. Software agents are autonomous and reactive/proactive programs that communicate via message-passing. Arbitrary functionalities can be encoded in such agents, reflecting the capabilities of the components they represent, as well as extending them. Ours is a flexible and scalable approach allowing the gradual population of environments with physical devices and their agents.
21st Century Information Technology Revolution
Authors: Sanjay Kumar Pal
Venue: Ubiquity (2008)

The computing power in the few micro processors that are now in a Ford Motor Car is much more than all the computing power that was put in the space vehicle that landed the first men on the moon and brought them back. In today's do-more-with-less business environment, with increasing demands from customers, shareholders, and regulators, the IT organization is not only asked to work harder and smarter, but is being asked to take on the role of assuring the business. Humanity has progressed from agricultural revolution to the industrial revolution and is now moving to an information revolution. It is this awesome computing power at continuously falling prices and the computers being networked over global telecom highways that is leading to the use of Information Technology in every sector of human activity be it communication, banking, trading, learning and teaching, entertainment, socializing, government, management and librarying. Just as machines have extended man's mechanical power and his convenience and comfort, Information Technology as commonly picturized by computers, is extending man's mind or brain or intellectual power. The term information technology has ballooned to encompass many aspects of computing and technology, and the term is more recognizable than ever before.
Software development governance and its concerns
Authors: Sunita Chulani, Clay Williams, Avi Yaeli
Venue: Proceedings of the 1st international workshop on Software development governance (2008)

In this paper, we start with a discussion of Software Development Governance (SDG), and clarify its relationships to management and process. We discuss how these organizational components are related and present our view on SDG and its concerns. Throughout the paper, we use the Linux open source development project where we show how SDG is used to achieve productive development in an environment which is often considered to have anarchic characteristics.
Managing quality requirements using activity-based quality models
Authors: Stefan Wagner, Florian Deissenboeck, Sebastian Winter
Venue: Proceedings of the 6th international workshop on Software quality (2008)

Managing requirements on quality aspects is an important issue in the development of software systems. Difficulties arise from expressing them appropriately what in turn results from the difficulty of the concept of quality itself. Building and using quality models is an approach to handle the complexity of software quality. A novel kind of quality models uses the activities performed on and with the software as an explicit dimension. These quality models are a well-suited basis for managing quality requirements from elicitation over refinement to assurance. The paper proposes such an approach and shows its applicability in an automotive case study.
Weighted ensemble boosting for robust activity recognition in video
Authors: Yuri Ivanov, Raffay Hamid
Venue: Machine Graphics Vision International Journal (2006)

In this paper we introduce a novel approach to classifier combination, which we term Weighted Ensemble Boosting. We apply the proposed algorithm to the problem of activity recognition in video, and compare its performance to different classifier combination methods. These include Approximate Bayesian Combination, Boosting, Feature Stacking, and the more traditional Sum and Product rules. Our proposed Weighted Ensemble Boosting algorithm combines the Bayesian averaging strategy with the boosting framework, finding useful conjunctive feature combinations and achieving a lower error rate than the traditional boosting algorithm. The method demonstrates a comparable level of stability with respect to the classifier selection pool. We show the performance of our technique for a set of 6 types of classifiers in an office setting, detecting 7 classes of typical office activities.
The distribution of ascents of size d or more in partitions of n
Authors: Charlotte Brennan, Arnold Knopfmacher, Stephan Wagner
Venue: Combinatorics, Probability and Computing (2008)

A partition of a positive integer n is a finite sequence of positive integers a1, a2,. . ., ak such that a1+a2+ċ ċ ċ+ak=n and ai+1 ≥ ai for all i. Let d be a fixed positive integer. We say that we have an ascent of size d or more if ai+1 ≥ ai+d. We determine the mean, the variance and the limiting distribution of the number of ascents of size d or more (equivalently, the number of distinct part sizes of multiplicity d or more) in the partitions of n.
Location Fingerprinting In A Decorrelated Space
Authors: Shih-Hau Fang, Tsung-Nan Lin, Po-Chiang Lin
Venue: IEEE Transactions on Knowledge and Data Engineering (2008)

We present a novel approach to the indoor localization in wireless environments. The main contribution of this paper is four folds: (a) we show that, by projecting the measured signal into a decorrelated signal space, the accuracy is improved since the cross-correlation between each AP is reduced. (b) We demonstrate that this novel approach achieves a more efficient information compaction and provides a better scheme to reduce the online computation. The drawback of AP selection techniques is overcomed since we reduce the dimensionality by combing features. Each component in the decorrelated space is the linear combination of all APs. Therefore a more efficient mechanism is provided to utilize information of all APs while reducing the computational complexity. (c) Experimental results show that the size of training samples can be greatly reduced. That is, fewer human efforts are required for developing the system. (d) We carry out comparisons between RSS and three decorrelated spaces including Discrete Cosine Transform, principal component analysis (PCA), and independent component analysis in this paper. Two AP selection criteria proposed in literature, MaxMean and InfoGain are also compared. Testing on a realistic WLAN environment, we find that PCA achieves the best performance on the location fingerprinting task.
A Basic Firewall Configuration Strategy for the Protection of Development-related Computer Networks and Subnetworks
Authors: Sujan Maskey, Brittany Jansen, Dennis Guster, Charles Hall
Venue: Information Systems Security (2007)

As more and more development-related networks, both instructional and industry related, are being attached to the Internet, the need for protection from hackers becomes evident. This is largely due to the fact that security breaches have reached epidemic proportions. The article therein examines these issues as well as presents a case study for a basic firewall configuration. The logic behind the case study is based on four different modules containing one or more sections: environmental, forward rules, allow ping, and post-routing rules. A figure and source code is provided to indicate how the logic would appear once the plan had been implemented. The example was designed as such in hopes that a more sophisticated and usable product could emerge. In addition, this template could be considered a useful learning and/or teaching resource when teaching basic firewall configurations.
A new Petrie-like construction for abstract polytopes
Authors: Michael I. Hartley, Dimitri Leemans
Venue: Journal of Combinatorial Theory Series A (2008)

This article introduces a new construction for polytopes, that may be seen as a generalisation of the Petrie dual to higher ranks. Some theoretical results are derived regarding when the construction can be expected to work, and the construction is applied to some special cases. In particular, the generalised Petrie duals of the hypercubes are enumerated.
Problem Oriented Software Engineering: Solving the Package Router Control Problem
Authors: Jon Hall, Lucia Rapanotti, Michael Jackson
Venue: IEEE Transactions on Software Engineering (2008)

Problem Orientation is gaining interest as a way of approaching the development of software intensive systems and yet a significant example that explores its use is missing from the literature. In this paper, we present the basic elements of Problem Oriented Software Engineering (POSE) which aims to bring both non-formal and formal aspects of software development together in a single framework. We provide an example of a detailed and systematic POSE development of a software problem, that of designing the controller for a package router. The problem is drawn from the literature, but the analysis presented here is new. The aim of the example is twofold: to illustrate the main aspects of POSE and how it supports software engineering design, and to demonstrate how a non-trivial problem can be dealt with by the approach.
Provenance: The Bridge Between Experiments and Data
Authors: Simon Miles, Paul Groth, Ewa Deelman, Karan Vahi, Gaurang Mehta, Luc Moreau
Venue: Computing in Science and Engineering (2008)

Current scientific applications are often structured as workflows and rely on workflow systems to compile abstract experiment designs into enactable workflows that utilize the best available resources. The automation of this step, and of the workflow enactment, hides the details about how results are produced. Knowing how compilation and enactment occurred allows results to be reconnected with the experiment design. The authors investigate how provenance helps scientists connect their results with the actual execution that took place, their original experiment, and its inputs and parameters.
OIDE: un outil pour la conception et le d&eacute;veloppement d'interfaces multimodales
Authors: Marcos Serrano, David Juras, Michael Ortega, Laurence Nigay
Venue: Proceedings of the 4th French-speaking conference on Mobility and ubiquity computing (2008)

Multimodal interaction software development presents a particular challenge because of ever increasing number of novel interaction devices. In this paper, we present the OpenInterface Interaction Development Environment (OIDE) that addresses the design and development of multimodal interfaces. To illustrate our approach, we present a multimodal slideshow implemented with our tool.
A simple proof of Moser's theorem
Authors: Xuding Zhu
Venue: Journal of Graph Theory (1999)

This article gives a simple proof of a result of Moser, which says that, for any rational number r between 2 and 3, there exists a planar graph G whose circular chromatic number is equal to r. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 30: 19&ndash;26, 1999
Weighted Derivations and the cd-Index
Authors: Du&#x0161;ko Joji&#x0107;
Venue: Discrete Computational Geometry (2008)

Weighted derivations W 1 and W 2 allowed R.&#x00a0;Ehrenborg and M.&#x00a0;Readdy (Discrete Comput. Geom. 21:389&#x2013;403, [1999]) to give a recursive description of the cd-indices of the lattices of the regions of the arrangements $\mathcal{A}_{n}$ and &#x212c; n . In part motivated by this, we describe a new basis for the subspace spanned by ab-indices of all simplicial graded posets and determine the action of certain linear maps (associated with weighted derivations W k ) on this basis. Extending the &#x201c;pyramid&#x201d; and &#x201c;prism&#x201d; operations, we define operations &#x03a3; k on graded posets and show that relations between the ab-indices (or cd-indices, for an Eulerian poset P) of barycentric subdivisions of &#x03a3; k (P) and P can be described by using the linear maps associated by weighted derivations W k . Finally, in response to a question from Ehrenborg and Readdy (Discrete Comput. Geom. 21:389&#x2013;403, [1999]), we obtain the formulae that express the cd-index of the lattice $R_{\mathcal{D}_{n}}$ of regions of the arrangement $\mathcal{D}_{n}$ in terms of the cd-indices of $R_{\mathcal{B}_{n}}$ and $R_{\mathcal{A}_{n-2}}$.
Attracting majors: panel discussion
Authors: Ken Hartness, Li-Jen Shannon, Timothy McGuire, Phyllis Tedford
Venue: Journal of Computing Sciences in Colleges (2008)

Studies show that a large number of students entering college expressed ignorance of computer science and the careers to which it could lead1 A few students come to understand the benefits of computer science or realize that they have an interest in majoring in the field after taking a CS elective or initiating a minor in CS. High school counselors and even teachers of computer classes are uninformed of the benefits of a computer science major.
Beginning VB 2008 Databases: From Novice to Professional (Beginning from Novice to Professional)
Authors: Vidya Vrat Agarwal, James Huddleston
Venue:  (2008)

Beginning VB 2008 Databases teaches you everything you need to know about relational databases, SQL, and ADO.NET 2.0, giving you a sound start in developing console and Windows database applications. The book also includes chapters on the new SQL Server XML data type and the forthcoming LINQ enhancements to the next version of Visual Basic. In addition to teaching you database basics like using SQL to communicate with databases, this book provides you with detailed, code-practical techniques to access data in Visual Basic 2008 across a range of coding situations. Code-heavy and full of practical detail, this book has been fully revised and upgraded for .NET 3.5 and offers you the best contemporary practice in this core programming area, so that youll find yourself using it in nearly all your .NET projects. Provides step-by-step instructions on how to install and configure necessary tools Presents all essential SQL query and update concepts and syntax, so you dont need prior familiarity with relational databases or SQL Describes how to use ADO.NET transactions, exceptions, and events Covers ADO.NET features for handling XML, text, and binary data within a Visual Basic 2008 context Explains all concepts through straightforward code examples What youll learn How relational databases work and how to use them How Visual Basic uses ADO.NET to access databases How to write stored procedures in T-SQL and call them from Visual Basic programs How to use XML in database applications How to use LINQ to simplify VB database programming How to install SQL Server 2005 Express and use it to teach yourself databases by doing databases Who is this book for? Beginning VB 2008 Databases is for every VB programmer. Database programming requires relatively little knowledge of VB but a lot of knowledge about relational database concepts and the database language SQL. This book assumes no prior database experience and teaches you, always through hands-on examples, how to create and use relational databases with SQL and how to access them with VB. Almost every application needs to access a database, and this book teaches all the fundamentals you may ever need to develop professional database applications. About the Apress Beginning Series The Beginning series from Apress is the right choice to get the information you need to land that crucial entry-level job. These books will teach you a standard and important technology from the ground up because they are explicitly designed to take you from novice to professional. Youll start your journey by seeing what you need to knowbut without needless theory and filler. Youll build your skill set by learning how to put together real-world projects step by step. So whether your goal is your next career challenge or a new learning opportunity, the Beginning series from Apress will take you thereit is your trusted guide through unfamiliar territory! Related Titles Pro T-SQL 2005 Programmers Guide Foundations of LINQ in C#
Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts
Authors: Eliyahu Osherovich, Vladimir Yanovki, Israel A. Wagner, Alfred M. Bruckstein
Venue: International Journal of Robotics Research (2008)

We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark places visited with pheromone marks and sense the level of the pheromone in their local neighborhood. In the case of multiple robots, these pheromone marks can be sensed by all robots and provide the only way of (indirect) communication between the robots. The robots are assumed to be memoryless, and to have no information besides that mentioned above. Despite the robots' simplicity we show that they are able, by running a very simple rule of behavior, to ensure efficient covering of arbitrary connected domains, including non-planar and multidimensional domains. The novelty of our algorithm lies in the fact that, unlike previously proposed methods, our algorithm works on continuous domains without relying on some induced underlying graph effectively reducing the problem to a discrete case of graph covering. In addition, we demonstrate various benefits of our algorithm such as ability to cope with arbitrary initial pheromone profile and a bounded constant time between two successive visits of the robot at the same location, making it suitable for patrolling. Finally, we provide a new theoretical bound on covering time of a wide family of such mark and walk algorithms.
Using &ldquo;tilt&rdquo; as an interface to control &ldquo;no-button&rdquo; 3-D mobile games
Authors: Paul Gilbertson, Paul Coulton, Fadi Chehimi, Tamas Vajk
Venue: Computers in Entertainment (CIE) (2008)

Mobile phones offer considerable challenges for game developers, and not least among them is the user interface, which is primarily optimized for number entry rather than for playing games. In fact, due to the limitations one of the most desirable criteria for mobile games has the design of games controlled by a one-button interface. However, this type of interface has only been seen as applicable for casual games, where mastering the interface is de-emphasized. As a number of mobile phones are starting to appear with 3-D accelerometers, game developers have the opportunity to investigate new interface mechanisms. In this article we illustrate how accelerometers provide the possibility of a no-button mobile game. While 3-D accelerometers offer a range of possible interface mechanisms, the one that requires minimal signal processing and no external references is motion, and in particular, tilt, and as such is eminently suitable for mobile phones. In this article we explore a tilt interface for a 3-D graphics first-person driving game titled Tunnel Run, and compare the user experience playing the same game with a traditional phone joypad interface and with a tilt interface in two different modes. The results show that the tilt interface was experienced as fun, and certainly seemed more attractive to players, who said they would not have played this type of game otherwise.
Tchr: A framework for tabled clp
Authors: Tom Schrijvers, Bart Demoen, David s. Warren
Venue: Theory and Practice of Logic Programming (2008)

Tabled Constraint Logic Programming is a powerful execution mechanism for dealing with Constraint Logic Programming without worrying about fixpoint computation. Various applications, e.g. in the fields of program analysis and model checking, have been proposed. Unfortunately, a high-level system for developing new applications is lacking, and programmers are forced to resort to complicated ad hoc solutions. This papers presents TCHR, a high-level framework for tabled Constraint Logic Programming. It integrates in a light-weight manner Constraint Handling Rules (CHR), a high-level language for constraint solvers, with tabled Logic Programming. The framework is easily instantiated with new application-specific constraint domains. Various high-level operations can be instantiated to control performance. In particular, we propose a novel, generalized technique for compacting answer sets.