ppxscal/embedding_network huggingface dataset:
Traversing Ontologies to Extract Views
Authors: Natalya F. Noy, Mark A. Musen
Venue: Modular Ontologies: Concepts, Theories and Techniques for Knowledge Modularization (2009)

One of the original motivations for ontology research was the belief that ontologies can help with reuse in knowledge representation. However, many of the ontologies that are developed with reuse in mind, such as standard reference ontologies and controlled terminologies, are extremely large, while the users often need to reuse only a small part of these resources in their work. Specifying various views of an ontology enables users to limit the set of concepts that they see. In this chapter, we develop the concept of a Traversal View, a view where a user specifies the central concept or concepts of interest, the relationships to traverse to find other concepts to include in the view, and the depth of the traversal. For example, given a large ontology of anatomy, a user may use a Traversal View to extract a concept of Lung and organs and organ parts that surround the lung or are contained in the lung. We define the notion of Traversal Views formally, discuss their properties, present a strategy for maintaining the view through ontology evolution and describe our tool for defining and extracting Traversal Views.
Advances in Feature Selection with Mutual Information
Authors: Michel Verleysen, Fabrice Rossi, Damien François
Venue: Similarity-Based Clustering: Recent Developments and Biomedical Applications (2009)

The selection of features that are relevant for a prediction or classification problem is an important problem in many domains involving high-dimensional data. Selecting features helps fighting the curse of dimensionality, improving the performances of prediction or classification methods, and interpreting the application. In a nonlinear context, the mutual information is widely used as relevance criterion for features and sets of features. Nevertheless, it suffers from at least three major limitations: mutual information estimators depend on smoothing parameters, there is no theoretically justified stopping criterion in the feature selection greedy procedure, and the estimation itself suffers from the curse of dimensionality. This chapter shows how to deal with these problems. The two first ones are addressed by using resampling techniques that provide a statistical basis to select the estimator parameters and to stop the search procedure. The third one is addressed by modifying the mutual information criterion into a measure of how features are complementary (and not only informative) for the problem at hand.
CoBTx-Net: A model for business collaboration reliability verification
Authors: Haiyang Sun, Jian Yang, Lai Xu
Venue: Information Systems Frontiers (2009)

Collaborative business process can become unreliable when business partners collaborate in a peer- based fashion without central control. Therefore, reliability checking becomes an important issue that needs to be dealt with for any generic solution in managing business collaboration. In this paper, we propose a novel Choreographical Business Transaction Net (CoBTx-Net) to model collaborative business process and to manage the collaboration by individual participants. Furthermore three reliability properties named Time-embedded dead marking freeness, Inter-organizational dead marking freeness, and Collaborative soundness are defined based on CoBTx-Net to verify (1) the violation of time constraint, (2) collaborative logic conflicts, and (3) the improper termination from individual organizations.
Understanding Operating Systems, Fifth Edition, 5th edition
Authors: Ann McHoes, Ida M. Flynn
Venue:  (2007)

With the same straightforward and clear writing style that has made previous editions so successful, Understanding Operating Systems, Fifth Edition, provides the ideal blend of operating theory and practice. Coverage includes the fundamentals of operating systems: what they are, what they do, how they function, how they can be evaluated, and how they compare to one another. Part One describes the management of memory, processors, devices, files, and networks as well as system security, ethics, and overall system management. The second part of the book focuses on four specific operating systems (UNIX, MS-DOS, Windows, and Linux) and how they apply the theory explained in the first part of the text. Updates include discussions of new technologies that affect operating system design, including multi-core chips and virtualization, making this edition a current and relevant resource.
An Algebra for Composing Ontologies
Authors: Saket Kaushik, Csilla Farkas, Duminda Wijesekera, Paul Ammann
Venue: Proceeding of the 2006 conference on Formal Ontology in Information Systems: Proceedings of the Fourth International Conference (FOIS 2006) (2006)

Ontologies are used as a means of expressing agreements to a vocabulary shared by a community in a coherent and consistent manner. As it happens in the Internet, ontologies are created by community members in a decentralized manner, requiring that they be merged before being used by the community. We develop an algebra to do so in the Resource Description Framework (RDF). To provide formal semantics of the proposed algebraic operators, we type a fragment of the RDF syntax.
Interfacial reaction and shear strength of SnAgCu-xNi/Ni solder joints during aging at 150°C
Authors: Pei Yao, Ping Liu, Jim Liu
Venue: Microelectronic Engineering (2009)

The interfacial microstructure and shear strength of Sn3.8Ag0.7Cu-xNi (SAC-xNi, x=0.5, 1, and 2) composite solders on Ni/Au finished Cu pads were investigated in detail after aging at 150^oC for up to 1000h. The interfacial characteristics of composite solder joints were affected significantly by the weight percentages of added Ni micro-particles and aging time. After aging for 200h, the solder joints of SAC, SAC-0.5Ni and -1Ni presented duplex intermetallic compound (IMC) layers regardless of the initial interfacial structure on as-reflowed joints, whose upper and lower IMC layers were comprised of (CuNi)"6Sn"5 and (NiCu)"3Sn"4, respectively. Only a single (NiCu)"3Sn"4 IMC layer was ever observed at the SAC-2Ni/Ni interface on whole aging process. Based on the compositional analysis, the amount of Ni within the IMC regions increased as the proportion of Ni addition increased. The IMC (NiCu)"3Sn"4 layer thickness on the interface of SAC and SAC-0.5Ni grew more slowly when compared to that of SAC-1Ni and -2Ni, while for the (CuNi)"6Sn"5 layer the reverse is true. Except the IMCs sizes are increased with increased aging time, the interfacial IMCs tended to transfer their morphologies to polyhedra. In all composite joints testing, the shear strengths were approximately equal to non-composite joints. The fracturing observed during shear testing of composite joints occurred in the bulk solder, indicating that the SAC-xNi/Ni solder joints had a desirable joint reliability.
Microsoft Windows Vista: Introductory Concepts and Techniques, 1st edition
Authors: Gary B. Shelly, Steven M. Freund, Raymond E. Enger
Venue:  (2007)

Microsoft Windows Vista: Introductory Concepts and Techniques provides a project-based, step-by-step approach to teaching the Windows Vista operating system.
The space of formal balls and models of quasi-metric spaces
Authors: M. Ali-akbari, B. Honari, M. Pourmahdian, M. m. Rezaii
Venue: Mathematical Structures in Computer Science (2009)

In this paper we study quasi-metric spaces using domain theory. Our main objective in this paper is to study the maximal point space problem for quasi-metric spaces. Here we prove that quasi-metric spaces that satisfy certain completeness properties, such as Yoneda and Smyth completeness, can be modelled by continuous dcpo's. To achieve this goal, we first study the partially ordered set of formal balls (BX, ⊑) of a quasi-metric space (X, d). Following Edalat and Heckmann, we prove that the order properties of (BX, ⊑) are tightly connected to topological properties of (X, d). In particular, we prove that (BX, ⊑) is a continuous dcpo if (X, d) is algebraic Yoneda complete. Furthermore, we show that this construction gives a model for Smyth-complete quasi-metric spaces. Then, for a given quasi-metric space (X, d), we introduce the partially ordered set of abstract formal balls (BX, ⊑, ≺). We prove that if the conjugate space (X, d−1) of a quasi-metric space (X, d) is right K-complete, then the ideal completion of (BX, ⊑, ≺) is a model for (X, d). This construction provides a model for any Yoneda-complete quasi-metric space (X, d), as well as the Sorgenfrey line, Kofner plane and Michael line.
From XML inclusions to XML transclusions
Authors: Angelo Di Iorio, John Lumley
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

Modularized documents, composed of fragments from multiple sources, provide users high maintainability and reuse. In the world of XML, powerful and widely-supported solutions exist to create such documents. Surprisingly enough, a lot of interesting features - especially those envisioned by the pioneers of the hypermedia community - are still missing for XML inclusions. The goal of this paper is to investigate these issues and identify possible improvements in this area. Our main inspiration is the Xanadu project and the concept of transclusions. This paper proposes an enhanced model to describe and interact with XML inclusions. We identify multiple classes of inclusions and multiple views of multi-source documents. Particular attention is also given to the idea of making inclusions transparent to both users and applications. An engine producing composite documents, with rich information about inclusions, and a viewer for modularized XML documents are presented as well.
Coverage-driven test generation for functional validation of pipelined processors
Authors: Prabhat Mishra
Venue:  (2007)

Functional verification of microprocessors is one of the most complex and expensive tasks in the current system-on-chip design methodology. Simulation using functional test vectors is the most widely used form of processor verification. A major challenge in simulation-based verification is how to reduce the overall verification time and resources. Traditionally, billions of random and directed tests are used during simulation. Compared to random tests, directed tests can reduce overall validation effort significantly since shorter tests can obtain the same coverage goal. However, there is a lack of automated techniques for directed test generation targeting micro-architectural design errors. Furthermore, the lack of a comprehensive functional coverage metric makes it difficult to measure the verification progress. This dissertation presents a functional coverage-driven test generation methodology. Based on the behavior of pipelined processors, a functional coverage is defined to evaluate the verification progress. My research provides efficient test generation techniques using formal methods by decomposing processor designs and properties to reduce test generation time as well as memory requirement. My research also provides a functional test compaction technique to reduce the number of directed tests while preserving the overall functional coverage. The experiments using MIPS and PowerPC processors demonstrate the feasibility and usefulness of the proposed functional test generation methodology.
Complete formal specification of the OpenMP memory model
Authors: Greg Bronevetsky, Bronis R. de Supinski
Venue: International Journal of Parallel Programming (2007)

OpenMP [OpenMP Architecture Review Board. OpenMP application program interface, version 2.5] is an important API for shared memory programming, combining shared memory's potential for performance with a simple programming interface. Unfortunately, OpenMP lacks a critical tool for demonstrating whether programs are correct: a formal memory model. Instead, the current official definition of the OpenMP memory model (the Open-MP 2.5 specification [OpenMP Architecture Review Board. OpenMP application program interface, version 2.5]) is in terms of informal prose. As a result, it is impossible to verify OpenMP applications formally since the prose does not provide a formal consistency model that precisely describes how reads and writes on different threads interact. We expand on our previous work that focused on the formal verification of OpenMP programs through a formal memory model [Greg Bronevetsky and Bronis de Supinski. Formal specification of the memory model. In International Workshop on OpenMP (IWOMP), (2006)]. As in that work, our formalization, which is derived from the existing prose model [OpenMP Architecture Review Board. OpenMP application program interface, version 2.5], provides a two-step process to verify whether an observed OpenMP execution is conformant. This paper extends the model to cover the entire specification. In addition to this formalization, our contributions include a discussion of ambiguities in the current prose-based memory model description. Although our formal model may not capture the current informal memory model perfectly, in part due to these ambiguities, our model reflects our understanding of the informal model's intent. We conclude with several examples that may indicate areas of the OpenMP memory model that need further refinement, however it is specified. Our goal is to motivate the OpenMP community to adopt those refinements eventually, ideally through a formal model, in later OpenMP specifications.
Customer Assistance Services for Simulated Shopping Scenarios
Authors: Florian Messerschmidt, Andreas D. Lattner, Ingo J. Timm
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

Providing helpful assistance in shopping scenarios can lead to satisfied customers with the potential for higher customer retention. Different hypotheses addressing the assistance functions and customer types are evaluated by statistical significance tests of agent-based simulation runs. Among others, the results show that the assistance functions lead to reduced shopping durations and a reduced number of forgotten items for our settings.
Structure Learning of Markov Logic Networks through Iterated Local Search
Authors: Marenglen Biba, Stefano Ferilli, Floriana Esposito
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

Many real-world applications of AI require both probability and first-order logic to deal with uncertainty and structural complexity. Logical AI has focused mainly on handling complexity, and statistical AI on handling uncertainty. Markov Logic Networks (MLNs) are a powerful representation that combine Markov Networks (MNs) and first-order logic by attaching weights to first-order formulas and viewing these as templates for features of MNs. State-of-the-art structure learning algorithms of MLNs maximize the likelihood of a relational database by performing a greedy search in the space of candidates. This can lead to suboptimal results because of the incapability of these approaches to escape local optima. Moreover, due to the combinatorially explosive space of potential candidates these methods are computationally prohibitive. We propose a novel algorithm for learning MLNs structure, based on the Iterated Local Search (ILS) metaheuristic that explores the space of structures through a biased sampling of the set of local optima. The algorithm focuses the search not on the full space of solutions but on a smaller subspace defined by the solutions that are locally optimal for the optimization engine. We show through experiments in two real-world domains that the proposed approach improves accuracy and learning time over the existing state-of-the-art algorithms.
MIP reformulations of the probabilistic set covering problem
Authors: Anureet Saxena, Vineet Goyal, Miguel A. Lejeune
Venue: Mathematical Programming: Series A and B (2009)

In this paper, we address the following probabilistic version (PSC) of the set covering problem: where A is a 0-1 matrix, is a random 0-1 vector and is the threshold probability level. We introduce the concepts of p-inefficiency and polarity cuts. While the former is aimed at deriving an equivalent MIP reformulation of (PSC), the latter is used as a strengthening device to obtain a stronger formulation. Simplifications of the MIP model which result when one of the following conditions hold are briefly discussed: A is a balanced matrix, A has the circular ones property, the components of are pairwise independent, the distribution function of is a stationary distribution or has the disjunctive shattering property. We corroborate our theoretical findings by an extensive computational experiment on a test-bed consisting of almost 10,000 probabilistic instances. This test-bed was created using deterministic instances from the literature and consists of probabilistic variants of the set covering model and capacitated versions of facility location, warehouse location and k-median models. Our computational results show that our procedure is orders of magnitude faster than any of the existing approaches to solve (PSC), and in many cases can reduce hours of computing time to a fraction of a second.
PRNG based on new HCI devices entropy sources: Wii remote study case
Authors: Alfonso Muñoz Muñoz, Miguel Luis González González, Justo Carracedo Gallardo
Venue: Proceedings of the 2009 Euro American Conference on Telematics and Information Systems: New Opportunities to increase Digital Citizenship (2009)

This paper analyzes the possibilities of cutting edge HCI (HumanComputer Interaction) devices for random number generation. Their increasing presence in electronic devices is a fact, so they may be taken into account for PRNG. As an example, the Wii control device (Wii Remote) is analyzed. Among other characteristics, it includes accelerometers and an IR camera, which can be a valid source of entropic information. As these characteristics are appearing in other devices (for example, mobile phones), the aim of this paper is to study the reliability of these sensors as sources of non-predictive information, which could be useful in many areas. Standard algorithm methodologies are used to corroborate the analysis. Its usage as seed of a PRNG could be analyzed by other kind of tests, NIST SP 800-22 among others.
Geometric entities related by inequalities
Authors: Constantin Udriste, Dragos Cioroboiu
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

Any geometric inequality reflects a free or constrained optimum problem with suitable variables and suitable constraints. To solve such a problem, we can apply the techniques of nonlinear programming, giving answers to the following questions: - what survives from Riemannian geometry if one basic equality is replaced with an inequality? - what kind of manifolds support to transform a basic equality into an inequality? Following this idea, we justify some Chen like inequalities or we obtain new inequalities. In context, we study the extrema of curvature majorant quadratic forms of a slant submanifold in a relaxed Sasakian spatial form, using proper values and proper vectors of a curvature like operator. The most important results include bounds for curvature operator. Section 1 formulates a relaxed Chen Lemma. Section 2 studies a Chen like inequality on relaxed Sasakian space form. Section 3 studies the critical points of curvature majorant quadratic forms of a slant submanifoldin a relaxed Sasakian spatial form constrained by unit 2-frames. Section 4 gives bounds for curvature quadratic majorant forms. Section 5 formulates open problems regarding inequalitiesin differential geometry.
Processing XPath/XQuery to be aware of XLink hyperlinks
Authors: Lule Ahmedi, Mentor Arifaj
Venue: Proceedings of the 2nd conference on European computing conference (2008)

XML Linking Language (XLink) as a W3C recommendation represents the standard way how to use links within XML documents. With these links, it is possible to select arbitrarily narrow content, and not restricted to selecting the whole document as it is the case with HTML hyperlinks. There are few implementations for XLink despite the fact that it is a recommendation since 2001. Most of these implementations are focused on how to handle XLink links while browsing rather then query them. There is an implementation using LDAP that uses other data model than XML and another one that is an extension of eXist a XML database system to support XLinks. We extended another well-known and widely used XPath/XQuery open source system named Saxon-B. The Saxon-B is an in-memory system and is capable to be used with programming languages to support the XML features implemented on it. We describe our extension in several steps and illustrate it with algorithms and samples. We complement the discussion by comparing our system with existing systems (eXist and LDAP), and confirm that our system is a complement and not a duplication of these systems.
Technical Section: Quality encoding for tetrahedral mesh optimization
Authors: Kai Xu, Zhi-Quan Cheng, Yanzhen Wang, Yueshan Xiong, Hao Zhang
Venue: Computers and Graphics (2009)

We define quality differential coordinates (QDC) for per-vertex encoding of the quality of a tetrahedral mesh. QDC measures the deviation of a mesh vertex from a position which maximizes the combined quality of the set of tetrahedra incident at that vertex. Our formulation allows the incorporation of different choices of element quality metrics into QDC construction to penalize badly shaped and inverted tetrahedra. We develop an algorithm for tetrahedral mesh optimization through energy minimization driven by QDC. The variational problem is solved efficiently and robustly using gradient flow based on a stable semi-implicit integration scheme. To ensure quality boundary of the resulting tetrahedral mesh, we propose a harmonic-guided optimization scheme which leads to consistent handling of both the interior and boundary tetrahedra.
Propagation of sech2-type solitary waves in hierarchical KdV-type systems
Authors: Lauri Ilison, Andrus Salupere
Venue: Mathematics and Computers in Simulation (2009)

A hierarchical Korteweg-de Vries-type evolution equation is applied for modelling wave propagation in dilatant granular materials. The model equation is integrated numerically under sech^2-type initial conditions using the Fourier transform-based pseudospectral method. Numerical simulations are carried out over a wide range of material parameters (two dispersion parameters and one microstructure parameter) and amplitudes of the initial wave. The analysis of the time-space behaviour of solutions results in five solution types. Besides typical KdV-like solitonic structures, wave packets were detected for some domains of material parameters.
Comparing Negotiation Strategies Based on Offers
Authors: Lena Mashayekhy, Mohammad Ali Nematbakhsh, Behrouz Tork Ladani
Venue: Proceeding of the 2008 conference on Applications of Data Mining in E-Business and Finance (2008)

Negotiation is a process between self-interested agents trying to reach an agreement on one or multiple issues in an ecommerce domain. The knowledge of an agent about the opponents' strategies improves the negotiation outcome. However, an agent negotiates with incomplete information about its opponent. Given this, to detect the opponent's strategy, we can use the similarity between opponents' strategies. In this paper we present a method for measuring the similarity between negotiators' strategies. Offers are generated by the agent's strategy therefore our similarity measure is based on the history of offers in negotiation sessions. We extended the Levenshtein distance technique to detect similarity between strategies. We implement this measure and experimentally show that the result of using the measure improves the recognition of the opponent's strategy.