ppxscal/embedding_network huggingface dataset:
Reliability and its relation to suitability and predictability
Authors: E. B. Ferrell
Venue: Papers and discussions presented at the Dec. 8-10, 1953, eastern joint AIEE-IRE computer conference: information processing systems---reliability and requirements (1953)

Reliability, like a great many other words, means different things to different people. Let me illustrate with a purely imaginary example. Suppose we have a small vacuum tube with amplification, mutual conductance, and plate impedance all of useful magnitudes. Tubes of this type have been made in large quantity. Their characteristics, when measured at the factory have very good uniformity---all are within &plusmn;1 per cent of their nominal value. Every tube that has been examined has kept its characteristics within these narrow limits throughout its entire life, and a large fraction of the tubes made have been thus examined. These characteristics are entirely independent of such things as ambient temperature and mechanical shock.
Generation of OWL Ontologies from Concept Maps in Shallow Domains
Authors: Alfredo Simón, Luigi Ceccaroni, Alejandro Rosete
Venue: Current Topics in Artificial Intelligence: 12th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2007, Salamanca, Spain, November 12-16, 2007. Selected Papers (2007)

A proposal is presented for integration between a graphical model, such as conceptual maps, and ontologies codified in the OWL language. Conceptual maps are a flexible form of knowledge representation, very useful in education-related collaborative environments; OWL is a language of knowledge representation oriented to semantic analysis and processing carried out by machines. Integration consists of a set of formal transformation applied to conceptual maps and the semantic analysis of the relations linking concepts. The proposed method is based on a concept sense-disambiguation procedure, also defined by the authors, and in the WordNet lexical database. It applies to conceptual maps of shallow domains with labels in the Spanish language.
Microsoft® windows vista® management and administration, First edition
Authors: Andrew Abbate, James Walker, Scott Chimner
Venue:  (2007)

This book will show administrators how to manage and administer the advanced functions and security features in Windows Vista. The recommendations, tips, tricks, and best practices are based on years of early-adopter implementations of Windows Vista in large corporate and private environments. The authors highlight the functions of Windows Vista that both large and small environments have found to be the most useful, including all-new features such as Complete PC Backup, BitLocker, and the powerful Group Policy options that are only available in Windows Vista.Understand how to... Integrate Windows Vista into an Active Directory domain Properly protect information for local and remote users Utilize BitLocker to encrypt all the data on a disk Properly secure a Windows Vista system Enable self-service recovery with Shadow Copy Deploy Windows Vista systems without having to touch them Deploy powerful new Group Policy settings Pick the version of Vista that is right for your users Optimize Vista performance Securely access corporate information while offline Perform image-level backup and restore of Vista workstations Andrew Abbate is a consultant in and best-selling author on various Microsoft technologies and security and operational practices.James Walker, MCSE, CPM, BSME, has been a consultant, author, and technical editor to several best-selling Windows Unleashed books involving design, security, performance optimization, and data communications.Scott G. Chimner, CISSP, MCSE, MCSA, TCSE 2, A+, is a consultant for Convergent Computing, an ISSA member, and has been in the computer industry for more than 12 years with a concentration on Information Security. Scott has also served as a contributing writer for several books on Microsoft technologies.
Unsupervised Learning of Head Pose through Spike-Timing Dependent Plasticity
Authors: Ulrich Weidenbacher, Heiko Neumann
Venue: Proceedings of the 4th IEEE tutorial and research workshop on Perception and Interactive Technologies for Speech-Based Systems: Perception in Multimodal Dialogue Systems (2008)

We present a biologically inspired model for learning prototypical representations of head poses. The model employs populations of integrate-and-fire neurons and operates in the temporal domain. Times-to-first spike (latencies) are used to develop a rank-order code, which is invariant to global contrast and brightness changes. Our model consists of 3 layers. In the first layer, populations of Gabor filters are used to extract feature maps from the input image. Filter activities are converted into spike latencies to determine their temporal spike order. In layer 2, intermediate level neurons respond selectively to feature combinations that are statistically significant in the presented image dataset. Synaptic connectivity between layer 1 and 2 is adapted by a mechanism of spike-timing dependent plasticity (STDP). This mechanism realises an unsupervised Hebbian learning scheme that modifies synaptic weights according to their timing between pre- and postsynaptic spike. The third layer employs a radial basis function (RBF) classifier to evaluate neural responses from layer 2. Our results show quantitatively that the network performs well in discriminating between 9 different input poses gathered from 200 subjects.
Exploiting Preferences for Minimal Credential Disclosure in Policy-Driven Trust Negotiations
Authors: Philipp Kärger, Daniel Olmedilla, Wolf-Tilo Balke
Venue: Proceedings of the 5th VLDB workshop on Secure Data Management (2008)

Business processes in open distributed environments such as the Web force users to interact with other parties be it users or companies even if they have never had any common transaction in the past. Policy-driven trust negotiations emerged in order to address these situations. But although many policy languages and protocols have been defined, the problem of deciding which credential disclosure set to choose from those that possibly make a negotiation succeed is still subject of research. This paper explores the use of qualitative preferences in order to solve the problem and exploits the recently introduced notions of amalgamated and incremented preferences in order to allow for automated decisions which negotiations are preferred by the user. Our solution eases the task for the user of selection among all possible negotiations by removing irrelevant alternatives and it may even automatize negotiations that otherwise would require manual intervention.
Mobility through naming: impact on dns
Authors: R. Atkinson, S. Bhatti, S. Hailes
Venue: Proceedings of the 3rd international workshop on Mobility in the evolving internet architecture (2008)

An Identifier/Locator addressing scheme can enable a new approach to mobile hosts and mobile networks. Identifier and Locator information is stored in Domain Name System (DNS) Resource Records. In our on-going work using the Identifier-Locator Network Protocol (ILNP), the DNS would be updated with new Locator values as hosts and/or networks move; new sessions would obtain the correct Locator(s) for a mobile host and/or mobile network from the DNS, in much the same way as currently happens for IP address resolution. However, this use of the DNS is not currently required for IP mobility. We examine the potential impact on DNS from using a naming approach to mobility.
IGaze: Studying Reactive Gaze Behavior in Semi-immersive Human-Avatar Interactions
Authors: Michael Kipp, Patrick Gebhard
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

We present IGaze, a semi-immersive human-avatar interaction system. Using head tracking and an illusionistic 3D effect we let users interact with a talking avatar in an application interview scenario. The avatar features reactive gaze behavior that adapts to the user position according to exchangeable gaze strategies. In user studies we showed that two gaze strategies successfully convey the intended impression of dominance/submission and that the 3D effect was positively received. We argue that IGaze is a suitable setup for exploring reactive nonverbal behavior synthesis in human-avatar interactions.
Fast Scheduling of Distributable Real-Time Threads with Assured End-to-End Timeliness
Authors: Sherif F. Fahmy, Binoy Ravindran, E. D. Jensen
Venue: Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies (2008)

We consider networked, embedded real-time systems that operate under run-time uncertainties on activity execution times and arrivals, node failures, and message losses. We consider the distributable threads abstraction for programming and scheduling such systems, and present a thread scheduling algorithm called QBUA. We show that QBUA satisfies (end-to-end) thread time constraints in the presence of crash failures and message losses, has efficient message and time complexities, and lower overhead and superior timeliness properties than past thread scheduling algorithms. Our experimental studies validate our theoretical results, and illustrate the algorithm's effectiveness.
Towards a Software Process for Aspect-Oriented Modeling of Quality Attributes
Authors: Mónica Pinto, Lidia Fuentes
Venue: Proceedings of the 2nd European conference on Software Architecture (2008)

This paper defines a process for the aspect-oriented modeling of quality attributes, especially those with high functional implications. The goal of this process is to produce "built-in" reusable and parameterizable architectural solutions for each quality attribute. We propose using the AO-ADL Tool Suite to specify and store these solutions.
Norms in Branching Space-Times
Authors: Nuel Belnap
Venue: Proceedings of the 9th international conference on Deontic Logic in Computer Science (2008)

The idea of norms presupposes agency, and agency presupposes an indeterministic causal order (so that "ought" does not imply "is"). So much can be modeled in "branching time with agents and choices" (BTAC). The seriously ontological independence of agentive choices, however, requires, as a necessary condition, a causal order permitting space-like separation of those choices in a sense definable in "branching space-times with agents and choices" (BSTAC).Let us idealize an agent, when restricted to a single space-time, as a kind of spatio-temporal "worm" in the familiar way, representing the life of the agent in that space-time. Then a representation of "the agent," since it must include representation of seriously objective choices, must look like a tree with two kinds of branching. In both kinds of branching, there is a single past-pointing worm-like representation of the past-life of the agent up to the branching, and an entire assemblage of distinct worm-like representations of the possible future-life of the agent subsequent to the branching, one for each history in which the life of the agent continues. The first kind of branching occurs at choice-points for the agent. According to BSTAC, such branching will involve a last point of agent's-choice-not-yet-made (say, a last point of deliberation), but no first point of agent's-choice-has-beenmade in any possible future-life of the agent. In the second kind of branching, the agent is passive, having two or more possible future-lives due to space-like-related choices by other agents, or by metaphorical "choices" by some space-like-related element of Nature. In this case, BSTAC says that there will be no last point of the past-life of the agent, but instead a first point for each of the agent's possible future-lives.
FTSyn: a framework for automatic synthesis of fault-tolerance
Authors: Ali Ebnenasir, Sandeep S. Kulkarni, Anish Arora
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2008)

In this paper, we present a software framework for adding fault-tolerance to existing finite-state programs. The input to our framework is a fault-intolerant program and a class of faults that perturbs the program. The output of our framework is a fault-tolerant version of the input program. Our framework provides (1) the first automated tool for the synthesis of fault-tolerant distributed programs, and (2) an extensible platform for researchers to develop a repository of heuristics that deal with the complexity of adding fault-tolerance to distributed programs. We also present a set of heuristics for polynomial-time addition of fault-tolerance to distributed programs. We have used this framework for automated synthesis of several fault-tolerant programs including a simplified version of an aircraft altitude switch, token ring, Byzantine agreement, and agreement in the presence of Byzantine and fail-stop faults. These examples illustrate that our framework can be used for synthesizing programs that tolerate different types of faults (process restarts, Byzantine and fail-stop) and programs that are subject to multiple faults (Byzantine and fail-stop) simultaneously. We have found our framework to be highly useful for pedagogical purposes, especially for teaching concepts of fault-tolerance, automatic program transformation, and the effect of heuristics.
FLiP: Managing Software Product Line Extraction and Reaction with Aspects
Authors: Vander Alves, Fernando Calheiros, Vilmar Nepomuceno, Andrea Menezes, Sérgio Soares, Paulo Borba
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

The extractive and the reactive Software Product Line (SPL) adoption strategies involve, respectively, bootstrapping existing products into a SPL and extending an existing SPL to encompass another product. In both cases, product line refactorings are useful to guide the SPL derivation process by extracting product variations and appropriately structuring them. They also help to assure the safety of the whole process by preserving SPL configurability. In this context, we describe FLiP, which is a suite of tools implemented as Eclipse plugins and has been designed and tested in the context of mobile game SPLs.
Heuristics for negotiation schedules in multi-plan optimization
Authors: Bo An, Fred Douglis, Fan Ye
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

In cooperating systems such as grids [4] and collaborative streaming analysis [2], autonomous sites can establish "agreements" to arrange access to remote resources for a period of time [1]. The determination of which resources to reserve to accomplish a task need not be known a priori, because there exist multiple plans for accomplishing the same task and they may require access to different resources [3]. While these plans can be functionally equivalent, they may have different performance/cost tradeoffs and may use a variety of resources, both local and belonging to other sites. The negotiation schedule, i.e., the order in which remote resources are negotiated, determines how quickly one plan can be selected and deployed; it also decides the utility for running the plan. This paper studies the problem of optimizing negotiation schedules in cooperative systems with multiple plans. We first provide a voting-based heuristic that reduces the complexity O(n!) of the exhaustive search to O(mnq). We also present a weight-based heuristic that further reduces the complexity to O(mn). Experimental results show that, on average, 1) the voting-based approach achieved 6% higher utility than the weight-based approach but the voting-based approach has a much higher computation cost than the weight-based approach, 2) the two proposed approaches achieved almost 50% higher utility than a randomized approach; and 3) the average utility produced by the two proposed approaches are within almost 90% of that of the optimal results with reasonable plan sizes.
Indexing Factors with Gaps
Authors: M. Sohel Rahman, Costas S. Iliopoulos
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

Indexing of factors is a widely used and useful technique in stringology and can be seen as a tool in solving diverse text algorithmic problems. A gapped-factor is a concatenation of a factor of length k, a gap of length d and another factor of length k¿. The problem of indexing the gapped-factors was considered recently by [18]. In this paper, we present a new improved indexing scheme for the gapped-factors.
AutoMOTGen: Automatic Model Oriented Test Generator for Embedded Control Systems
Authors: Ambar A. Gadkari, Anand Yeolekar, J. Suresh, S. Ramesh, Swarup Mohalik, K. C. Shashidhar
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

We present AutoMOTGen, a tool for automatic test case generation (ATG) from MATLAB Simulink/Stateflow (SL/SF) models [6] for testing automotive controllers. Our methodology is based on model checking [2]. The main highlights of the tool are: 1 Enhanced coverage of the model elements as well as high-level requirements. 1 A modular design for plug-and-play of different model checkers, test data generators and coverage analysis tools for enhancing the test suite quality. 1 Implements sampling time abstraction to generate tests with lesser number of (discrete) steps in the intermediate model. 1 Implements coverage dependent instrumentation of the model for the structural coverage criteria. 1 Capability to handle SL/SF blocks commonly used in automotive controllers (including blocks such as integrator, delay, multiplication/division, look-up tables, triggered subsystems and hierarchical and parallel charts). The current implementation of AutoMOTGen uses SAL [8] as an intermediate representation and uses associated tools such as sal-atg, sal-bmc and sal-smc for generation of test data and proving the unreachability of some of the coverage goals. AutoMOTGen is implemented in Java and C++ (.NET framework) and uses MATLAB scripting language for extracting the relevant information from SL/SF models required for the purpose of test generation.
Checkpoint Processing and Recovery: An Efficient, Scalable Alternative to Reorder Buffers
Authors: Haitham Akkary, Ravi Rajwar, Srikanth T. Srinivasan
Venue: IEEE Micro (2003)

Processors require a combination of large instruction windows and high clock frequency to achieve high performance. Traditional processors use reorder buffers, but these structures do not scale efficiently as window size increases. A new technique, checkpoint processing and recovery, offers an efficient means of increasing the instruction window size without requiring large, cycle-critical structures, and provides a promising microarchitecture for future high-performance processors.
Feature Extraction Using Histogram Entropies of Euclidean Distances for Vehicle Classification
Authors: Ming Bao, Luyang Guan, Xiaodong Li, Jing Tian, Jun Yang
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

This paper presents a novel method for feature extraction based on the generalized entropy of the histogram formed by Euclidean distances, which is named distributive entropy of Euclidean distance (DEED in sort). DEED is a nonlinear measure for learning feature space, which provides the congregate and information measure of learning samples space. The ratio of between-class DEED to within-class DEED (J rd ) is used as a new nonlinear separability criterion for optimizing feature selection. Experiments on vehicle classification show that the proposed method has better performance on all the datasets than the fisher linear discriminant analysis.
State-Merging DFA Induction Algorithms with Mandatory Merge Constraints
Authors: Bernard Lambeau, Christophe Damas, Pierre Dupont
Venue: Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications (2008)

Standard state-merging DFA induction algorithms, such as RPNI or Blue-Fringe, aim at inferring a regular language from positive and negative strings. In particular, the negative information prevents merging incompatible states: merging those states would lead to produce an inconsistent DFA. Whenever available, domain knowledge can also be used to extend the set of incompatible states. We introduce here mandatory merge constraints, which form the logical counterpart to the usual incompatibility constraints. We show how state-merging algorithms can benefit from these new constraints. Experiments following the Abbadingo contest protocol illustrate the interest of using mandatory merge constraints. As a side effect, this paper also points out an interesting property of state-merging techniques: they can be extended to take any pair of DFAs as inputs rather than simple strings.
A Novel Scalable and Data Efficient Feature Subset Selection Algorithm
Authors: Sergio Rodrigues De Morais, Alex Aussem
Venue: Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II (2008)

In this paper, we aim to identify the minimal subset of discrete random variables that is relevant for probabilistic classification in data sets with many variables but few instances. A principled solution to this problem is to determine the Markov boundary of the class variable. Also, we present a novel scalable, data efficient and correct Markov boundary learning algorithm under the so-called faithfulness condition. We report extensive empiric experiments on synthetic and real data sets scaling up to 139,351 variables.
Dynamic Responses of an Infinite Beam on a Layered Water-Saturated Poroelastic Foundation Under Moving Loads
Authors: B. Xu, J. F. Lu, J. H. Wang
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Based on the Biot's dynamic equation and the dynamic theory of elastic beam, the dynamic responses of an infinite beam resting on a layered water-saturated poroelastic foundation subjected to moving loads is investigated by the transmission and reflection matrices (TRM) method in this study. Applying the triple Fourier transformation, the general solutions for the water-saturated poroelastic foundation and the beam in the transformed domain are derived. Utilizing the continuity conditions between each layer and boundary condition at the surface of the half space, the equivalent stiffness of the layered water-saturated poroelastic foundation is obtained. Time-space domain solutions are obtained by means of IFFT arithmetic. The present methodology was validated by comparing present solutions with some known results. According to numerical results, it can be seen that the occurrence of a softer middle layer enhances the deformation of the beam.
A Specification Framework for Earth-Friendly Logistics
Authors: Ichiro Satoh
Venue: Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2008)

This paper describes the use of a formal approach to logistics management systems to reduce the environmental impact of logistics operations. Trucks play an essential role as carriers in modern logistics services, but collectively they emit a huge quantity of carbon dioxide. To reduce fossil fuel consumption and carbon dioxide emissions resulting from transport, we must enhance the transport efficiency of trucks. The milk-run approach is one of the most effective and popular solutions to this problem. However, it tends to be too complicated to implement in a logistics management system. The framework described in this paper provides a language for specifying the routes of trucks and an order relation as a route selection mechanism. The former is formulated as process calculus and the latter selects suitable trucks according to their routes. This paper also describes a prototype implementation of the framework as a distributed logistics management system based on the use of RFID tags.