ppxscal/embedding_network huggingface dataset:
Model-Based Failure Analysis with RODON
Authors: Karin Lunde, Rüdiger Lunde, Burkhard Münker
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

The model-based reasoning tool RODON supports engineers in their quest for reliable, well-designed technical products, by providing means to analyze system behavior, especially in case of failure, systematically. Based on a quantitative product model, it offers a wide range of analyses, including reliability analyses such as FMEA and FTA or the generation of diagnostic knowledge such as diagnostic decision trees. An object-oriented modeling language enhances the reusability of models and, together with an integrated design environment and extensive model libraries, considerably reduces the modeling effort. In this paper, we describe the modeling framework and the model analyses supported by RODON (considering as example the model of a comfort seat), and characterize the technology behind them. Finally, we discuss the experience gained during the development of RODON.
The Conceptual Framework To User-Oriented Content Management
Authors: Bernhard Thalheim
Venue: Proceeding of the 2007 conference on Information Modelling and Knowledge Bases XVIII (2007)

Content and content management have become buzzwords. They are still heavily overloaded, not well understood or defined and heavily misused. Moreover, the user dimension is not yet incorporated. We develop an approach that is based on separation of concern: syntax dimension and content, semantics dimension and concepts, pragmatics dimension and topics, and finally referent or user dimension and memes. This separation of concern may increase the complexity of handling. We show, however, that a sophisticated handling of different kind of data at each dimension and a mapping facility between the dimensions provides a basis for a user-oriented content management system. This separation of concern and the special mapping procedure allows to derive content management systems that satisfy the needs of user communities.
Memory hierarchy exploration for accelerating the parallel computation of SVDs
Authors: Mostafa I. Soliman
Venue: Neural, Parallel Scientific Computations (2008)

The performance of many applications on modern computers is often limited by memory latency rather than by processor speed. For computers with memory hierarchy, it is preferable to perform the computation on blocks of data to reduce the impact of memory latency by reusing the loaded data in cache memories. This paper proposes a fast algorithm for parallel computing the extremely useful singular value decomposition (SVD) based on one-sided Jacobi on multi-level memory hierarchy architectures. On Pparallel processors, the given matrix is divided into super-rows and then these super-rows are partitioned into 2Pblocks. One key point of the proposed algorithm is the highly exploitation of memory hierarchy by performing all computations on super-rows loaded in cache memory rather than on rows. Another key point is that the number of sweeps required for convergence is very close to cyclic one-sided Jacobi. Third key point of the proposed algorithm is that the number of sweeps required for convergence does not depend drastically on the size of the input matrix. On two dual-core Intel Xeon processors, our results show that the performance of parallel implementation of the proposed algorithm is around 11 times higher than the sequential implementation on the same hardware. Moreover, a performance of around 10 GFLOPS (double-precision) can be achieved on the target system using multi-threading, Intel SIMD instructions, matrix blocking, and loop unrolling techniques.
Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties
Authors: James Pita, Manish Jain, Fernando Ordóñez, Milind Tambe, Sarit Kraus, Reuma Magori-Cohen
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

How do we build multiagent algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such as oligopolistic markets and security domains. In Stackelberg games, one player, the leader, commits to a strategy and the follower makes their decision with knowledge of the leader's commitment. Existing algorithms for Stackelberg games efficiently find optimal solutions (leader strategy), but they critically assume that the follower plays optimally. Unfortunately, in real-world applications, agents face human followers (adversaries) who --- because of their bounded rationality and limited observation of the leader strategy --- may deviate from their expected optimal response. Not taking into account these likely deviations when dealing with human adversaries can cause an unacceptable degradation in the leader's reward, particularly in security applications where these algorithms have seen real-world deployment. To address this crucial problem, this paper introduces three new mixed-integer linear programs (MILPs) for Stackelberg games to consider human adversaries, incorporating: (i) novel anchoring theories on human perception of probability distributions and (ii) robustness approaches for MILPs to address human imprecision. Since these new approaches consider human adversaries, traditional proofs of correctness or optimality are insufficient; instead, it is necessary to rely on empirical validation. To that end, this paper considers two settings based on real deployed security systems, and compares 6 different approaches (three new with three previous approaches), in 4 different observability conditions, involving 98 human subjects playing 1360 games in total. The final conclusion was that a model which incorporates both the ideas of robustness and anchoring achieves statistically significant better rewards and also maintains equivalent or faster solution speeds compared to existing approaches.
A method of stepwise benchmarking for inefficient DMUs based on the proximity-based target selection
Authors: Shaneth A. Estrada, Hee Seok Song, Young Ae Kim, Su Hyeon Namn, Shin Cheol Kang
Venue: Expert Systems with Applications: An International Journal (2009)

DEA is a useful nonparametric method of measuring the relative efficiency of a DMU and yielding a reference target for an inefficient DMU. However, it is very difficult for inefficient DMUs to be efficient by benchmarking a target DMU which has different input use. Identifying appropriate benchmarks based on the similarity of input endowment makes it easier for an inefficient DMU to imitate its target DMUs. But it is rare to find out a target DMU, which is both the most efficient and similar in input endowments, in real situation. Therefore, it is necessary to provide an optimal path to the most efficient DMU on the frontier through several times of a proximity-based target selection process. We propose a dynamic method of stepwise benchmarking for inefficient DMUs to improve their efficiency gradually. The empirical study is conducted to compare the performance between the proposed method and the prior methods with a dataset collected from Canadian Bank branches. The comparison result shows that the proposed method is very practical to obtain a gradual improvement for inefficient DMUs while it assures to reach frontier eventually.
Developer's Guide to Reporting Services 2005
Authors: John A. Kuhn, Paul D. Sheriff
Venue:  (2007)

This book is designed as an introduction for anyone who wants to learn how to design, deploy and integrate reports using SQL Server 2005 Reporting Services, the .NET Framework and either ASP.NET Web Forms or .NET Windows Forms applications. SQL Server 2005 Reporting Services is an excellent platform for meeting a wide variety of reporting needs. In this book you will learn: - How to install & configure Reporting Services - How to create, design and deploy reports - How to design reports effectively - How to use report server URL access - How to use the Web Forms report viewer - How to use the Windows Forms report viewer - How to use the Reporting Services web service - How to administer Reporting Services If you started from scratch, it would take you over 30 hours of work to develop the classes that are included with this book! Join John and Paul as they teach you what you need to know to create reports using SQL Reporting Services 2005.
Intelligent forecasting for financial time series subject to structural changes
Authors: Jae Joon Ahn, Suk Jun Lee, Kyong Joo Oh, Tae Yoon Kim
Venue: Intelligent Data Analysis (2009)

This paper is mainly concerned about intelligent forecasting for financial time series subject to structural changes. For example, it is well known that interest rates are subject to structural changes due to external shocks such as government monetary policy change. Such structural changes usually make prediction harder if they are not properly taken care of. Recently, Oh and Kim (2002a, 2002b) suggested a method that could handle such difficulties efficiently. Their basic idea is to assume that different probabilistic law (and hence different predictor) works for different situations. Their method is termed as two-stage piecewise nonlinear prediction since it is comprised of establishing various situations empirically and then installing a different probabilistic nonlinear law as predictor on each of them. Thus, for its proper prediction functioning, it is essential to identify the law dictating the financial time series presently. In this article we propose and study a mixing approach for better identification of the presently working probabilistic law.
Collaboration 2.0: Technology and Best Practices for Successful Collaboration in a Web 2.0 World
Authors: David Coleman, Stewart Levine
Venue:  (2008)

With the advent of Web 2.0, we are seeing dramatic changes in the way people interact with each other via the Internet. Blogs, Wikis, online communities, social networks, and distributed teams are just some of the ways these technologies are shaping our interactions. David Coleman is an expert in the area of collaborative processes and technologies and Stewart Levine is an expert on how to get people to work together more effectively. Together David and Stewart encompass a holistic view of these new technologies and processes and help groups, teams, departments and organizations to work better and more effectively over time and distance.
Controllability and observability of Boolean control networks
Authors: Daizhan Cheng, Hongsheng Qi
Venue: Automatica (Journal of IFAC) (2009)

The controllability and observability of Boolean control networks are investigated. After a brief review on converting a logic dynamics to a discrete-time linear dynamics with a transition matrix, some formulas are obtained for retrieving network and its logical dynamic equations from this network transition matrix. Based on the discrete-time dynamics, the controllability via two kinds of inputs is revealed by providing the corresponding reachable sets precisely. Then the problem of observability is also solved by giving necessary and sufficient conditions.
Design architecture, developer networks and performance of open source software projects
Authors: John C. Henderson
Venue:  (2008)

In this dissertation I seek to understand the factors differentiating successful from unsuccessful software projects by investigating how design architectures and developers' positions within collaborative networks affect software project outcomes. There is a growing body of evidence that a product's architecture &ndash; defined here as decisions made regarding how to decompose design tasks and the resulting design structure &ndash; is a critical issue to both researchers and managers to understand. However, prior research studies on software development tend to emphasize design without taking into account the collaborative development environment, or have little power in predicting the phenomena with which the design constructs are associated because of insufficient empirical evidence. This dissertation develops and tests a model measuring the impact on software project performance of (1) software products' design architectures and (2) developers' positions within collaborative networks. Three indicators of project success are used: product quality, the signal of market success, and project velocity. Two dimensions of design architecture&mdash;degree of decomposition and coupling&mdash;and two characteristics of developer network structures&mdash;degree centrality and structural holes&mdash;are investigated for their impact on project performance. Using data gathered from SourceForge.net and the data warehouse including its monthly dumps, empirical analysis is conducted on the top 100 ranked projects and compared to a randomly chosen 100 projects. The main findings are that (1) the degree of decomposition has an inverted U-shaped relationship with project performance, (2) When tested on the sample of top 100 projects, average degree centrality of a project team has a positive and significant effects on project performance, and (3) the effects of network metrics on some of the indicators of project performance are positive in the top 100 projects and some of them are negative in random 100 projects. We employ some control variables such as number of projects each developer works on and organizational sponsorship to provide insights into the direction of the effect of degree centrality and structural holes on project success. Theoretical and practical implications are discussed, and several future research directions will be outlined.
Establishing trust in encrypted programs
Authors: Henry L. Owen
Venue:  (2008)

We propose a methodology to develop trust in encrypted programs. The goal of this research is to provide system administrators, users, and security personnel with the information necessary in order to safely execute encrypted programs on their systems without compromising their sensitive data. Traditional monitoring techniques aim to observe program behavior and characteristics in order to detect potential security weaknesses. However, there are many program encryption techniques designed to defeat many of the current monitoring approaches. Our goal is not to defeat the encryption of a program, but to inform the user if the encrypted program is behaving in a dangerous way. There is no such methodology available at present to perform this function. In our work, we present the results of implementing on demand system call monitoring, which uses a policy based and behavior based intrusion detection system to ensure that a program is not compromised or is accessing data in an unsafe manner. We believe that implementing this layer minimizes the changes to the operating system thus lowers the probability of incompatibility with executing encrypted software. Further, we use the data gathered from this monitoring to provide several types of program analysis and detection.
Some basic concepts for shared autonomy: a first report
Authors: Stéphane Mercier, Catherine Tessier
Venue: Proceeding of the 2008 conference on Collaborative Decision Making: Perspectives and Challenges (2008)

In the context of supervisory control of one or several artificial agents by a human operator, the definition of the autonomy of an agent remains a major challenge. When the mission is critical and in a real-time environment, e.g. in the case of unmanned vehicles, errors are not permitted while performance must be as high as possible. Therefore, a trade-off must be found between manual control, usually ensuring good confidence in the system but putting a high workload on the operator, and full autonomy of the agents, often leading to less reliability in uncertain environments and lower performance. Having an operator in the decision loop does not always grant maximal performance and safety anyway, as human beings are fallible. Additionally, when an agent and a human decide and act simultaneously using the same resources, conflicts are likely to occur and coordination between entities is mandatory. We present the basic concepts of an approach aiming at dynamically adjusting the autonomy of an agent in a mission relatively to its operator, based on a formal modelling of mission ingredients.
On the Topology and Geometry of Spaces of Affine Shapes
Authors: David Groisser, Hemant D. Tagare
Venue: Journal of Mathematical Imaging and Vision (2009)

We define the space of affine shapes of k points in R n to be the topological quotient of (R n ) k modulo the natural action of the affine group of R n . These spaces arise naturally in many image-processing applications, and despite having poor separation properties, have some topological and geometric properties reminiscent of the more familiar Procrustes shape spaces Σ n k in which one identifies configurations related by an orientation-preserving Euclidean similarity transformation. We examine the topology of the connected, non-Hausdorff spaces Sh n k in detail. Each Sh n k is a disjoint union of naturally ordered strata, each of which is homeomorphic in the relative topology to a Grassmannian, and we show how the strata are attached to each other. The top stratum carries a natural Riemannian metric, which we compute explicitly for k>n, expressing the metric purely in terms of "pre-shape" data, i.e. configurations of k points in R n .
Internet and Society: Social Theory in the Information Age
Authors: Christian Fuchs
Venue:  (2007)

In this exceptional study, Christian Fuchs discusses how the internet has transformed the lives of human beings and social relationships in contemporary society. By outlining a social theory of the internet and the information society, he demonstrates how the ecological, economic, political, and cultural systems of contemporary society have been transformed by new ICTs. Fuchs highlights how new forms of cooperation and competition are advanced and supported by the internet in subsystems of society and also discusses opportunities and risks of the information society.
The analysis of the directional couplers with chiral materials
Authors: S. S. Razavi Pour, S. Mohammadi, A. kazerooni
Venue: Proceedings of the 8th WSEAS international conference on Microelectronics, nanoelectronics, optoelectronics (2009)

The utilization of Chiral materials in waveguides has been recently increased. Directional coupler with chiral is One of these applications. The analysis results of directional couplers with chiral material will be discussed in this paper. For this purpose, the finite element method is used for calculating of electromagnetic waves and the coupled mode approach is applied for investigating the coupling process between two waveguides.
Gendering the ICT curriculum: The paradox of choice
Authors: Jane Abbiss
Venue: Computers Education (2009)

This paper looks at the ICT (information and communication technology) curriculum in New Zealand secondary schools and gendered participation patterns in different specialist ICT subjects. New Zealand has a permissive ICT curriculum, comprising a variety of subjects and characterised by choice and variation in the curriculum in practice at the local level. The data that are reported include results of (i) a national questionnaire survey of secondary schools, and (ii) a qualitative case study conducted in a large, co-educational New Zealand secondary school and involving classroom observations and interviews with teachers and students. It is suggested that the permissiveness of the curriculum, which ostensibly caters for the needs of students by providing choices, may, in some circumstances, effectively reinforce gender stereotypes relating to computer interests and practices. This is a paradox of choice. Questions are raised about the nature of the ICT curriculum in New Zealand and how it may contribute to or challenge gender stereotypes, future curriculum developments and, more broadly, how we can account for persistent gendered participation patterns in ICT subjects in schools.
Integration and interoperation at the border states in North America: a status report
Authors: J. Ramon Gil-Garcia, Sehl Mellouli, Celene Navarrete, H. Jochen Scholl, Theresa Pardo, Anthony Cresswell, Lei Zheng
Venue: Proceedings of the 10th Annual International Conference on Digital Government Research: Social Networks: Making Connections between Citizens, Data and Government (2009)

The North American Digital Government Working Group is a collection of researchers and practitioners from North America who seek to advance electronic government research across geographic and political boundaries in the region. The Border States Integration and Interoperation Sub-group was created to identify the information sharing and collaboration issues and challenges faced by government agencies working in the border regions of North America. Below is a report of the sub-group's activities and an outline of their 2008--2009 research agenda.
Compressed string-matching in standard Sturmian words
Authors: Pawe Baturo, Wojciech Rytter
Venue: Theoretical Computer Science (2009)

We present a simple algorithm which for an explicitly given input string pat (a pattern) and a standard Sturmian word x described by the recurrences of size n computes, in time O(|pat|+n), the set of all occurrences of pat in x as a single arithmetic progression (modulo the length of x). The algorithm can be extended to the case when some letters of the pattern are replaced by a don't care symbol. In this case the set of all occurrences does not need to be a single arithmetic progression and our algorithm produces linearly many (with respect to the size of pat) arithmetic progressions. It is an example of fast computations for the input given in a compressed form. In our special case the length of the standard Sturmian word x is usually exponential with respect to the size of the input.
WIRE: a wearable spoken language understanding system for the military
Authors: Helen Hastie, Patrick Craven, Michael Orr
Venue: Proceedings of the Workshop on Bridging the Gap: Academic and Industrial Research in Dialog Technologies (2007)

In this paper, we present the WIRE system for human intelligence reporting and discuss challenges of deploying spoken language understanding systems for the military, particularly for dismounted warfighters. Using the PARADISE evaluation paradigm, we show that performance models derived using standard metrics can account for 68% of the variance of User Satisfaction. We discuss the implication of these results and how the evaluation paradigm may be modified for the military domain.
Space-efficient simulation of quantum computers
Authors: Michael P. Frank, Uwe H. Meyer-Baese, Irinel Chiorescu, Liviu Oniciuc, Robert A. van Engelen
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

Traditional algorithms for simulating quantum computers on classical ones require an exponentially large amount of memory, and so typically cannot simulate general quantum circuits with more than about 30 or so qubits on a typical PC-scale platform with only a few gigabytes of main memory. However, more memory-efficient simulations are possible, requiring only polynomial or even linear space in the size of the quantum circuit being simulated. In this paper, we describe one such technique, which was recently implemented at FSU in the form of a C++ program called SEQCSim, which we releasing publicly. We also discuss the potential benefits of this simulation in quantum computing research and education, and outline some possible directions for further progress.