ppxscal/embedding_network huggingface dataset:
A new computational approach to the synthesis of fixed order controllers
Authors: K. R. Rajagopal, S. Darbha
Venue:  (2007)

The research described in this dissertation deals with an open problem concerning the synthesis of controllers of fixed order and structure. This problem is encountered in a variety of applications. Simply put, the problem may be put as the determination of the set, S of controller parameter vectors, K = (k 1,k2,...,kl), that render Hurwitz a family (indexed by F ) of complex polynomials of the form {P0( s,&alpha;) + i=1l Pi(s,&alpha;) ki, &alpha; &isin; F }, where the polynomials Pj(s,&alpha;), j = 0,...,l are given data. They are specified by the plant to be controlled, the structure of the controller desired and the performance that the controllers are expected to achieve. Simple examples indicate that the set S can be non-convex and even be disconnected. While the determination of the non-emptiness of S is decidable and amenable to methods such as the quantifier elimination scheme, such methods have not been computationally tractable and more importantly, do not provide a reasonable approximation for the set of controllers. Practical applications require the construction of a set of controllers that will enable a control engineer to check the satisfaction of performance criteria that may not be mathematically well characterized. The transient performance criteria often fall into this category. From the practical viewpoint of the construction of approximations for S , this dissertation is different from earlier work in the literature on this problem. A novel feature of the proposed algorithm is the exploitation of the interlacing property of Hurwitz polynomials to provide arbitrarily tight outer and inner approximation to S . The approximation is given in terms of the union of polyhedral sets which are constructed systematically using the Hermite-Biehler theorem and the generalizations of the Descartes' rule of signs.
Monitoring Patterns through an Integrated Management and Mining Tool
Authors: Evangelos E. Kotsifakos, Irene Ntoutsi, Yannis Vrahoritis, Yannis Theodoridis
Venue: Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II (2008)

Patterns upon the data of many real applications are affected by changes in these data. We employ Pattern-Miner tool to detect changes of clusterings extracted from dynamic data and thus, to provide insight on the dataset and to support strategic decisions. Pattern-Miner, is an integrated environment for pattern (data mining model) management and mining that deals with the whole lifecycle of patterns, from their generation (using data mining techniques) to their storage and querying, putting also emphasis on the comparison between patterns and meta-mining operations over the extracted patterns. In the current version, Pattern-Miner integrates also an algorithm and technique for monitoring patterns (currently clusters) over time.
Database Intrusion Detection and Response
Authors: Ashish Kamra, Elisa Bertino
Venue: Proceedings of the 11th international symposium on Recent Advances in Intrusion Detection (2008)

Why is it important to have an intrusion detection (ID) mechanism tailored for a database management system (DBMS)? There are three main reasons for this. First, actions deemed malicious for a DBMS are not necessarily malicious for the underlying operating system or the network; thus ID systems designed for the latter may not be effective against database attacks. Second, organizations have stepped up data vigilance driven by various government regulations concerning data management such as SOX, GLBA, HIPAA and so forth. Third, and this is probably the most relevant reason, the problem of insider threats is being recognized as a major security threat; its solution requires among other techniques the adoption of mechanisms able to detect access anomalies by users internal to the organization owning the data.
Towards ontologies for formalizing modularization and communication in large software systems
Authors: Daniel Oberle, Steffen Lamparter, S. Grimm, D. Vrandečić, S. Staab, A. Gangemi
Venue: Applied Ontology (2006)

Large software systems are modularized in order to improve manageability. The parts of a software system communicate in order to achieve the desired functionality. To better understand, develop, manage, and maintain the resulting complexity, this paper presents a framework of ontologies. The ontologies range from very general, foundational ones to ontologies that elucidate the specificities of particular modularization and communication paradigms. We support two specific paradigms. First, we define an ontology for software components that may be used in traditional middleware architectures, e.g., application servers. Second, we specify an ontology for Web services. Through the reuse of existing foundational ontologies and our new Core Software Ontology, our proposal offers several advantages. In particular, it avoids the typical shortcomings related approaches exhibit and it allows for the concise definition of commonalities and differences of the two paradigms.
Self-adaptive Lagrange Relaxation Algorithm for Aggregated Multicast
Authors: Hua Wang, Zuquan Ge, Jun Ma
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

Multicast has great advantages in data forwarding. But the number of forwarding states becomes huge in routers when there are large numbers of multicast groups in the network, which may cause explosions of state information and control information. Aggregated multicast is a novel approach to reducing multicast state numbers. It enables multicast groups to share a single distribution tree so that the tree management overhead at core routers can be reduced. Aggregated Multicast can actually be attributed to minimal set cover problem, which is an NP-complete problem. To solve it this paper proposes a self-adaptive Lagrange Relaxation Algorithm, which can achieve global optimal solution. Simulation results show that this algorithm is better than the conventional greedy algorithm in that it improves aggregation degree and reduces multicast state number.
A Fuzzy Logic System for Evaluating Quality of Experience of Haptic-Based Applications
Authors: Abdelwahab Hamam, Mohamad Eid, Abdulmotaleb Saddik, Nicolas D. Georganas
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

Multimedia systems and applications have recently started to integrate the sense of touch and force feedback in the human-computer interaction. Surprisingly, measuring the quality of experience (QoE) when haptic modality is incorporated in a virtual user interface has received limited attention from the research community. In this paper, we propose a taxonomy for measuring the quality of experience of Virtual Reality (VR) applications. Furthermore, the taxonomy is modeled using a Fuzzy Logic Inference System (FIS) to quantitatively measure the QoE of a haptic virtual environment. Finally, the proposed model is tested using the Mamdani system. The simulation and usability analysis demonstrated that the proposed model reflects the user estimation for the applications more accurately and thus is capable of measuring the overall QoE of a haptic application.
Adaptive Retrieval of Semi-structured Data
Authors: Yosi Ben-Asher, Shlomo Berkovsky, Paolo Busetta, Yaniv Eytani, Sadek Jbara, Tsvi Kuflik
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

The rapidly growing amount of heterogeneous semi-structured data available on the Web is creating a need for simple and universal access methods. For this purpose, we propose exploiting the notion of UNSpecified Ontology (UNSO), where the data objects are described using a list of attributes and their values. To facilitate efficient management of UNSO data objects, we use LoudVoice, a multi-agent channeled multicast communication platform, where each attribute is assigned a designated communication channel. This allows efficient searches to be performed by querying only the relevant channels, and aggregating the partial results. We implemented a prototype system and experimented with a corpus of real-life E-Commerce advertisements. The results demonstrate that the proposed approach yields a high level of accuracy and scalability.
A New Approach for Optimization of Dynamic Metric Access Methods Using an Algorithm of Effective Deletion
Authors: Renato Bueno, Daniel Santos Kaster, Agma Juci Traina, Caetano Traina,  Jr.
Venue: Proceedings of the 20th international conference on Scientific and Statistical Database Management (2008)

The existing Metric Access Methods (MAM) assume the data elements represent immutable objects. However, many applications must handle complex data evolving over time. Health care, weather monitoring, and other applications require removing or updating elements. Most of the MAM presented in the literature either do not have the deletion operation described, or it is performed just marking the element as deleted without effectively removing it from the structure. In this paper we describe an algorithm that effectively removes any element from a metric tree. While maintaining the height-balancing of the structure, the proposed deletion algorithm uses mechanisms to enforce a reduced number of pages in the tree, improving the query performance. Based on the deletion algorithm, we propose a new way to optimize a MAM, which we call the Push-pull technique. It reduces the node overlap performing the deletion and reinsertion of elements close to the border of each node covering region. We also developed the Smart Push-pull algorithm, which uses statistical data about subtrees' overlapping to calculate how many elements should be removed from each node. The statistics are collected during the evaluation of the structure overlap, an operation employed to ascertain the need to trigger an optimization process. The experiments were run on the Slim-tree and showed a reduction of overlap and a query performance improvement over trees optimized by this technique as compared over trees optimized by the Slim-down method.
A Practical DPA Countermeasure with BDD Architecture
Authors: Toru Akishita, Masanobu Katagi, Yoshikazu Miyato, Asami Mizuno, Kyoji Shibutani
Venue: Proceedings of the 8th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications (2008)

We propose a logic-level DPA countermeasure called Dual-rail Pre-charge circuit with Binary Decision Diagram architecture (DP-BDD). The proposed countermeasure has a dual-rail pre-charge logic style and can be implemented using CMOS standard cell libraries, which is the similar property to Wave Dynamic Differential Logic (WDDL). By using novel approaches, we can successfully reduce the early propagation effect, which is one of the main factors of DPA leakage of WDDL. DP-BDD is suited to implementation of S-boxes. In our implementations of the AES S-box, DP-BDD can reduce the maximum difference of transition timing at outputs of S-box to about 1/6.5 compared to that of WDDL without delay adjustment. Moreover, by applying simple delay adjustment to the inputs of the S-box, we can reduce it to about 1/85 of that without the adjustment. We consider DP-BDD is a practical and effective DPA countermeasure for implementation of S-boxes.
DCOPolis: a framework for simulating and deploying distributed constraint reasoning algorithms
Authors: Evan A. Sultanik, Robert N. Lass, William C. Regli
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers (2008)

The proliferation of mobile computers---such as laptops, personal digital assistants, and smart phones---has propelled distributed computing into mainstream society. Over the past decade these technologies have spurred interest in both decentralized multiagent systems and wireless mobile ad-hoc networks. Such networks, however, present many challenges to information sharing and coordination. Interference, obstacles, and other environmental effects conspire with power-and processing-limited hardware to impose a number of challenging networking characteristics. Messages are routinely lost or delayed, connections may be only sporadically available, and network transfer capacity is nowhere near that available on modern wired networks. It is therefore imperative to emphasize local decision making and autonomy over a centralized analogue, insofar as it is possible. The majority of such decentralized decision making can be seen as a fundamental problem of propagating and then solving systems of constraints, otherwise known as Distributed Constraint Reasoning (DCR).
BPEL4RBAC: An Authorisation Specification for WS-BPEL
Authors: Xin Wang, Yanchun Zhang, Hao Shi, Jian Yang
Venue: Proceedings of the 9th international conference on Web Information Systems Engineering (2008)

Business process management is designed to make business activities and trade easier and more cost effective. The increasing business integration and legal requirements raise the need for secure business processes. However, the openness and distribution nature of inter-organisational business processes may result in more security breaches. As a widely accepted standard, WS-BPEL does not support for business process security protection even if the participating organisations already have working security policies. To address this problem, we have developed an authorisation specification BPEL4RBAC for WS-BPEL. Through BPEL4RBAC access control model, with an extension for WS-BPEL, called BPEL4RBAC policy language, the secure WS-BPEL is then achievable. The former introduces the access control capability into business process environment while the latter is used to represent the authorisation information in WS-BPEL.
An Updated Guide to Sources of Information About Computer Graphics
Authors: Carl Machover
Venue: IEEE Computer Graphics and Applications (1983)

This source guide* contains a selection of representiative books, magazines, and journals from the computer graphics field. It singles out some specific magazine and journal articles and also includes professional society names and addresses; titles and dates of conferences, symposia, meetings, and short courses; and names and addresses of product review and market data sources.
Sensitivity of Contrast-Enhanced Digital Breast Tomosynthesis to Changes in Iodine Concentration during Acquisition
Authors: Melissa L. Hill, James G. Mainprize, Martin J. Yaffe
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

In contrast-enhanced digital breast tomosynthesis (CE-DBT) there are several challenges in attempting to relate the reconstructed iodine signal to the true concentration in the patient. One such challenge arises from a change in iodine concentration during image acquisition. Here, we study this phenomenon experimentally. Fifteen projection images of a phantom with simulated spherical lesions ranging from 4 to 9.5 mm in diameter were acquired over a 40° angular extent, representing a clinical exam of about 15 s in duration. Iodine concentrations were varied to simulate changes of 0.1 mg/mL between successive projections. Signal enhancement due to the presence of iodine is characterized by the signal-difference between lesion and background from the central slice through the lesion. In a variety simulated lesion enhancement profiles, signal difference accurately represented the mean of the iodine concentration during image acquisition, but a dependence on lesion size was observed. Quantitative CE-DBT may require calibration for lesion size.
The Mailbox Problem
Authors: Marcos K. Aguilera, Eli Gafni, Leslie Lamport
Venue: Proceedings of the 22nd international symposium on Distributed Computing (2008)

We propose and solve a synchronization problem called the mailbox problem, motivated by the interaction between devices and processor in a computer. In this problem, a postman delivers letters to the mailbox of a housewife and uses a flag to signal a non-empty mailbox. The wife must remove all letters delivered to the mailbox and should not walk to the mailbox if it is empty. We present algorithms and an impossibility result for this problem.
quFiles: a unifying abstraction for mobile data management
Authors: Kaushik Veeraraghavan, Edmund B. Nightingale, Jason Flinn, Brian Noble
Venue: Proceedings of the 9th workshop on Mobile computing systems and applications (2008)

We introduce a unifying file system abstraction, called a quFile, that provides a new mechanism for implementing mobile data management policies. quFiles allow arbitrary data types to be bundled together without confusing the user. Similar to a quBit (quantum bit), the particular data displayed by a quFile is not determined until the moment it is observed. A quFile displays the appropriate data type and version depending upon an application-specific policy that can take any information into account, such as the platform, external devices, context, connectivity, or battery power. We first describe what the quFile mechanism provides to applications and mobile devices. We then discuss how quFiles can benefit mobile data management in the areas of resource management, extensibility, and data consistency and availability.
Monadic Second Order Logic on Graphs with Local Cardinality Constraints
Authors: Stefan Szeider
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

We show that all problems of the following form can be solved in polynomial time for graphs of bounded treewidth: Given a graph G and for each vertex v of G a set ¿(v) of non-negative integers. Is there a set S of vertices or edges of G such that S satisfies a fixed property expressible in monadic second order logic, and for each vertex v of G the number of vertices/edges in S adjacent/incident with v belongs to the set ¿(v)? A wide range of problems can be formulated in this way, for example Lovász's General Factor Problem.
3-D Computer Modeling with Intra-Component, Geometric, Quality and Topological Constraints
Authors: Athanasios D. Styliadis, Petros G. Patias Nikos C. Zestas
Venue: Informatica (2003)

The study of 3-D indoor accurate scenery modeling is an active research area. The produced model can be used in a number of virtual reality applications, in digital documentation of monuments and sites, and so on. Digital photogrammetry and CAD technology have to play a vital role in this field. Photogrammetry's contribution is mainly on data acquisition from imagery, whilst the necessary image knowledge is derived from geometry and topology of image contents. While the first is traditionally used, the second one only lately is been tackled. In this paper, a technique is presented for modeling of indoor scenery based on digital images, photo-derived intra-component, geometric and topologic constraints, object-oriented graphic databases containing 3-D parametric models and a rough (generic) CAD model. Optionally, an absolute reference system could be applied, but for VR applications a relative reference system is adequate. The original contribution with respect to related works in this field is mainly the introduction of Display File, Segment Table, Scene Parts Table and Constraint Table structures which deal with the constraints and &ldquo;drive&rdquo; a modeling control program called the Constraint Modeler. The use of these structures leads in a direct, global, portable, and semi-automated technique for 3-D indoor modeling. Experimental results from simulated images are presented, and the robustness of the technique is discussed.
Primal Central Paths and Riemannian Distances for Convex Sets
Authors: Y. Nesterov, A. Nemirovski
Venue: Foundations of Computational Mathematics (2008)

In this paper, we study the Riemannian length of the primal central path in a convex set computed with respect to the local metric defined by a self-concordant function. Despite some negative examples, in many important situations, the length of this path is quite close to the length of a geodesic curve. We show that in the case of a bounded convex set endowed with a &#x03bd;-self-concordant barrier, the length of the central path is within a factor O(&#x03bd; 1/4) of the length of the shortest geodesic curve.
Multi-state Directed Acyclic Graphs
Authors: Michael Wachter, Rolf Haenni
Venue: Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence (2007)

This paper continues the line of research on the representation and compilation of propositional knowledge bases with propositional directed acyclic graphs (PDAG), negation normal forms (NNF), and binary decision diagrams (BDD). The idea is to permit variables with more than two states and to explicitly represent them in their most natural way. The resulting representation languages are analyzed according to their succinctness, supported queries, and supported transformations. The paper shows that most results from PDAGs, NNFs, and BDDs can be generalized to their corresponding multi-state extension. This implies that the entire knowledge compilation map is extensible from propositional to multi-state variables.
A Public-Key Protocol for Social Networks with Private Relationships
Authors: Josep Domingo-Ferrer
Venue: Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence (2007)

The need for protecting the privacy of relationships in social networks has recently been stressed in the literature. Conventional protection mechanisms in those networks deal with the protection of resources and data, i.e. with deciding whether access to resources and data held by a user (owner) should be granted to a requesting user (requestor). However, the relationships between users are also sensitive and need protection: knowing who is trusted by a user and to what extent leaks a lot of confidential information about that user. The use of symmetric key cryptography to implement private relationships in social networks has recently been proposed. We show in this paper how to use public-key cryptography to reduce the overhead caused by private relationships.
SitCom: Virtual Smart-Room Environment for Multi-modal Perceptual Systems
Authors: Jan Cuřín, Jan Kleindienst
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

In this paper we present a novel approach for building intelligent services in smart rooms - i.e. spaces equipped with different sets of sensors, including audio and visual perception. Designing such multi-modal perceptual systems is a non-trivial task which involves interdisciplinary effort dealing with integration of voice and image recognition technologies, situation modeling middleware and context-aware multi-user interfaces into robust and self-manageable software framework.The inherent complexity associated with building such systems aiming at perception and understanding of behavior of people in smart spaces makes it a very difficult undertaking. Hence this fresh research arena currently suffers with immature architectural models, weak system testability, and challenging component maintainability. In addition, traditional methodologies of design lifecycle such as "bottom-up" or "top-down" fall short because of the aspects mentioned.