ppxscal/embedding_network huggingface dataset:
Becoming Virtual: Knowledge Management and Transformation of the Distributed Organization, 1st edition
Authors: Jane E. Klobas, Paul D. Jackson
Venue: Contributions To Management Science (2007)

This book examines the capabilities needed to transform a globally distributed organization into a virtual organization (an organization that exists and operates across time and distance with the support of global communications technologies such as the Internet). It introduces techniques for definition of goals for virtualization, for monitoring progress toward virtualization and for studying the impact of virtualization on social uncertainty, knowledge sharing and knowledge transfer, organizational memory, transactive memory, communities of practice and organizational commitment, power and control. These techniques are applied in an extended case study of a development aid organization's attempts to use knowledge management for virtualization over a two year period. The multidisciplinary team of authors examines virtualization from points of view ranging from the organizational to the technological to the sociological and psychological.
Modular string-sensitive permission analysis with demand-driven precision
Authors: Emmanuel Geay, Marco Pistoia, Takaaki Tateishi, Barbara G. Ryder, Julian Dolby
Venue: Proceedings of the 2009 IEEE 31st International Conference on Software Engineering (2009)

In modern software systems, programs are obtained by dynamically assembling components. This has made it necessary to subject component providers to access-control restrictions. What permissions should be granted to each component? Too few permissions may cause run-time authorization failures, too many constitute a security hole. We have designed and implemented a composite algorithm for precise static permission analysis for Java and the CLR. Unlike previous work, the analysis is modular and fully integrated with a novel slicing-based string analysis that is used to statically compute the string values defining a permission and disambiguate permission propagation paths. The results of our research prototype on production-level Java code support the effectiveness, practicality, and precision of our techniques, and show outstanding improvement over previous work.
C++ Bindings to External Software Libraries with Examples from BLAS, LAPACK, UMFPACK, and MUMPS
Authors: Karl Meerbergen, Krešimir Fresl
Venue: ACM Transactions on Mathematical Software (TOMS) (2009)

FORTRAN and C software packages are often used in generic C++ software. Calling nongeneric functions in generic code is not straightforward. The bindings in this article help the C++ programmer using external software with a small effort. The bindings provide a mechanism to keep external software interfaces and specific vector and matrix containers orthogonal. We show examples using BLAS, LAPACK, UMFPACK, and MUMPS functions and subroutines.
Processing of medical images in virtual distributed environment
Authors: Tomáš Kulhánek, Milan Šárek
Venue: Proceedings of the 2009 Euro American Conference on Telematics and Information Systems: New Opportunities to increase Digital Citizenship (2009)

The processing of medical images within a PACS system depends on high capacity of communication channels and high performance of computational resources. We introduce pilot project utilizing grid technology to distribute functionality of PACS system to several machines located in distant places which allows economizing utilization of network channels. We also discuss benefits and disadvantages of virtualization techniques allowing to separate physical machine capabilities from the operating system. We compare this pilot project utilizing high speed CESNET 2 network with similar mature projects based mainly on P2P secure connection, centralized system and proprietary protocols.
Pattern avoidance by palindromes
Authors: I. A. Mikhailova, M. V. Volkov
Venue: Theoretical Computer Science (2009)

We show that every avoidable pattern can be avoided by an infinite sequence of palindromes over a fixed finite alphabet.
HIV-1 Drug Resistance Prediction and Therapy Optimization: A Case Study for the Application of Classification and Clustering Methods
Authors: Michal Rosen-Zvi, Ehud Aharoni, Joachim Selbig
Venue: Similarity-Based Clustering: Recent Developments and Biomedical Applications (2009)

This chapter provides a review of the challenges machine-learning specialists face when trying to assist virologists by generating an automatic prediction of an outcome of HIV therapy.Optimizing HIV therapies is crucial since the virus rapidly develops mutations to evade drug pressures. Modern anti-HIV regimens comprise multiple drugs in order to prevent, or at least delay, the development of resistance mutations. In recent years, large databases have been collected to allow the automatic analysis of relations between the virus genome other clinical and demographical information, and the failure or success of a therapy. The EuResist integrated database (EID) collected from about 18500 patients and 65000 different therapies is probably one of the largest clinical genomic databases. Only one third of the therapies in the EID contain therapy response information and only 5% of the therapy records have response information as well as genotypic data. This leads to two specific challenges (a) semi-supervised learning --- a setting where many samples are available but only a small proportion of them are labeled and (b) missing data.We review a novel solution for the first setting: a novel dimensionality reduction framework that binds information theoretic considerations with geometrical constraints over the simplex. The dimensionality reduction framework is formulated to find optimal low dimensional geometric embedding of the simplex that preserves pairwise distances. This novel similarity-based clustering solution was tested on toy data and textual data. We show that this solution, although it outperforms other methods and provides good results on a small sample of the Euresist data, is impractical for the large EuResist dataset. In addition, we review a generative-discriminative prediction system that successfully overcomes the missing value challenge.Apart from a review of the EuResist project and related challenges, this chapter provides an overview of recent developments in the field of machine learning-based prediction methods for HIV drug resistance.
Transform representation of the level-crossing probability in a single-server queue
Authors: Andrzej Chydzinski
Venue: Proceedings of the 13th WSEAS international conference on Applied mathematics (2008)

In this paper a transform representation of the level-crossing probability in the single-server queueing system is shown. The model of the queue includes general type of service distribution and autocorrelated arrival process.
Reasoning intra-dependency in commitments for robust scheduling
Authors: Mingzhong Wang, Kotagiri Ramamohanarao, Jinjun Chen
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Commitment-modeled protocols enable flexible and robust interactions among agents. However, existing work has focused on features and capabilities of protocols without considering the active role of agents in them. Therefore, in this paper we propose to augment agents with the ability of reasoning about and manipulating their commitments to maximize the system utility. We adopt a bottom-up approach by first investigating the intra-dependency between each commitment's preconditions and result which leads to a novel classification of commitments as well as a formalism to express various types of complex commitment. Within this framework, we provide a set of inference rules to benefit an agent by means of commitment refactoring which enables composition and/or decomposition of its commitments to optimize runtime performance. We also discuss the pros and cons of an agent scheduling and executing its commitments in parallel. We propose a reasoning strategy and an algorithm to minimize possible loss when the commitment is broken and maximize the overall system robustness and performance. Experiments show that concurrent schedules based on the features of commitments can boost the system performance significantly.
Modular verification and supervisory controller design for discrete-event systems using abstraction and incremental construction
Authors: Dawn M. Tilbury, Stephane Lafortune
Venue:  (2008)

The subject of this dissertation is modular approaches to the verification and control of discrete-event systems (DES). DES are dynamic systems characterized by discrete states and event-driven evolution. In recent years, a substantial body of work has been built up to provide a theory and framework for the control and verification of DES. Despite all the advancements that have been made in this area, application to real-life systems has been somewhat slow. A significant hurdle to the adoption of these methods is the state-space explosion that occurs in modeling systems of the size most commonly found in industry. A common approach that has been applied to address this complexity problem is to construct a series of smaller modular supervisors, rather than a single monolithic supervisor. The problem with this approach is that the modular supervisors can often conflict with one another.This dissertation develops three new approaches to the supervisory control of DES that adopt a modular aspect to their control, while addressing the potential problem of conflict. The first approach addresses the problem of state-space explosion by offering a procedure for incrementally building modular supervisors that are guaranteed to not conflict with one another by construction. An observer type abstraction is employed to make the procedure more computationally feasible. The second approach of this dissertation constructs traditional modular supervisors, then adds another level of coordinating control to resolve conflict between the supervisors. This work employs a conflict-equivalence preserving abstraction to detect and resolve the conflict. The final approach of this dissertation employs interfaces between different components of the global system. The additional structure of these interfaces allows global properties to be verified through the achievement of local properties. Additionally, these interfaces allow for modular supervisors to be synthesized locally such that the necessary requirements are met by construction.In this work, the correctness of the three approaches is proven. Additionally, application to some manufacturing based examples are employed to illustrate the potential strengths and weaknesses of each of the approaches.
A practical classification of multiword expressions
Authors: Radosław Moszczyński
Venue: Proceedings of the 45th Annual Meeting of the ACL: Student Research Workshop (2007)

The paper proposes a methodology for dealing with multiword expressions in natural language processing applications. It provides a practically justified taxonomy of such units, and suggests the ways in which the individual classes can be processed computationally. While the study is currently limited to Polish and English, we believe our findings can be successfully employed in the processing of other languages, with emphasis on inflectional ones.
A non parametric approach for modeling interferometric SAR imagery and applications
Authors: Kuntal Sengupta, Prabir Burman
Venue: Proceedings of the 2008 IEEE Workshop on Applications of Computer Vision (2008)

In this paper, we present a non parametric modeling for phase maps of interferometric SAR. Cosine and Sine projections maps are generated from the SAR phase map, and each of them are individually modeled by fitting 2D basis functions. The coefficients of these basis functions describe a "smoothed" version of the original phase map. Several applications can be derived from this noise filtered phase map: better phase unwrapping and SAR image compression are to of the applications that we will be discussing in the paper. The approach can be extended to other imaging domains that involve large maps of directional or phase data, such as modeling of phase MRI images, modeling of wind directions in meteorological data, etc.
Flow-sensitive semantics for dynamic information flow policies
Authors: Niklas Broberg, David Sands
Venue: Proceedings of the ACM SIGPLAN Fourth Workshop on Programming Languages and Analysis for Security (2009)

Dynamic information flow policies, such as declassification, are essential for practically useful information flow control systems. However, most systems proposed to date that handle dynamic information flow policies suffer from a common drawback. They build on semantic models of security which are inherently flow insensitive, which means that many simple intuitively secure programs will be considered insecure. In this paper we address this problem in the context of a particular system, flow locks. We provide a new flow sensitive semantics for flow locks based on a knowledge-style definition (following Askarov and Sabelfeld), in which the knowledge gained by an actor observing a program run is constrained according to the flow locks which are open at the time each observation is made. We demonstrate the applicability of the definition in a soundness proof for a simple flow lock type system. We also show how other systems can be encoded using flow locks, as an easy means to provide these systems with flow sensitive semantics.
Designing XML documents from conceptual schemas and workload information
Authors: Rebeca Schroeder, Ronaldo Dos Santos Mello
Venue: Multimedia Tools and Applications (2009)

Due to the increase of XML-based applications, XML schema design has become an important task. One approach is to consider conceptual schemas as a basis for generating XML documents compliant to consensual information of specific domains. However, the conversion of conceptual schemas to XML schemas is not a straightforward process and inconvenient design decisions can lead to a poor query processing on XML documents generated. This paper presents a conversion approach which considers data and query workload estimated for XML applications, in order to generate an XML schema from a conceptual schema. Load information is used to produce XML schemas which can respond well to the main queries of an XML application. We evaluate our approach through a case study carried out on a native XML database. The experimental results demonstrate that the XML schemas generated by our methodology contribute to a better query performance than related approaches.
Nonparametric estimation of the precision-recall curve
Authors: Stéphan Clémençon, Nicolas Vayatis
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

The Precision-Recall (PR) curve is a widely used visual tool to evaluate the performance of scoring functions in regards to their capacities to discriminate between two populations. The purpose of this paper is to examine both theoretical and practical issues related to the statistical estimation of PR curves based on classification data. Consistency and asymptotic normality of the empirical counterpart of the PR curve in sup norm are rigorously established. Eventually, the issue of building confidence bands in the PR space is considered and a specific resampling procedure based on a smoothed and truncated version of the empirical distribution of the data is promoted. Arguments of theoretical and computational nature are presented to explain why such a bootstrap is preferable to a "naive" bootstrap in this setup.
Financial contagion: evolutionary optimization of a multinational agent-based model
Authors: Guglielmo Maria Caporale, Antoaneta Serguieva, Hao Wu
Venue: International Journal of Intelligent Systems in Accounting and Finance Management (2009)

Over the past two decades, financial market crises with similar features have occurred in different regions of the world. Unstable cross-market linkages during a crisis are referred to as financial contagion. We simulate crisis transmission in the context of a model of market participants adopting various strategies; this allows testing for financial contagion under alternative scenarios. Using a minority game approach, we develop an agent-based multinational model and investigate the reasons for contagion. Although the phenomenon has been extensively investigated in the financial literature, it has not been studied through computational intelligence techniques. Our simulations shed light on parameter values and characteristics which can be exploited to detect contagion at an earlier stage, hence recognizing financial crises with the potential to destabilize cross-market linkages. In the real world, such information would be extremely valuable in developing appropriate risk management strategies. Copyright &copy; 2009 John Wiley & Sons, Ltd.
An electromyographic investigation of asymmetric lifting and moving of a load: II. Effects of load lift from knuckle to target shelves
Authors: Biman Das, Godfrey Mabaleka
Venue: Human Factors in Ergonomics Manufacturing (2009)

The range of normalized electromyography (EMG) values when lifting and moving a 5.84 kg box was between 0.08 and 0.63. The right iliocostalis and the left erector spinae showed decreased muscle activity with increasing asymmetry. The right erector spinae and the left and the right external obliques showed significant increases in muscle activity at 90&deg; asymmetry. The left and the right iliocostalis, the left erector spinae, and the right external oblique showed significant reductions in muscle activity for the sternum height when compared to the knuckle height. The right erector spinae exhibited a significant increase at reach height when compared to the knuckle height. The muscle activity for the knuckle lift was significantly lower than the floor lift. The average decrease in muscle activity was approximately 68&percnt;. Consequently, asymmetric lifting and moving tasks should be performed from a knuckle height to sternum height. &copy; 2009 Wiley Periodicals, Inc.
Why we're able to Google
Authors: Alfred Spector
Venue: Computing Research that Changed the World: Reflections and Perspectives (2009)

From the LoC symposium, sponsored by the Computing Community Consortium and the Computing Research Association
Refining and reasoning about nonfunctional requirements
Authors: S. Farhat, G. Simco, F. J. Mitropoulos
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

Nonfunctional requirements (NFR) must be addressed early in the software development cycle to avoid the cost of revisiting those requirements or re-factoring at the later stages of the development cycle. Methods and frameworks that identify and incorporate NFR at each stage of development cycle reduce this cost. The methodology used in this work for refining and reasoning about NFR is based on the NFR framework. This work identifies four NFR types and provides the methodology for developing domain specific NFR by using techniques for converting the requirements into design artifacts per NFR type. The contribution is four NFR types: Functionally Restrictive, Additive Restrictive, Policy Restrictive, and Architecture Restrictive and the software engineering process that provides specific refinements that result in unique architectural and design artifacts. By applying the same functional requirement focus to the different NFR domains it enhances the development process and promotes software quality attributes such as composability, maintainability, evolvability, and traceability.
Algorithms for near solutions to polynomial equations
Authors: Shih Ping Tung
Venue: Journal of Symbolic Computation (2009)

Let F(x,y) be a polynomial over a field K and m a nonnegative integer. We call a polynomial g over K an m-near solution of F(x,y) if there exists a c@?K such that F(x,g)=cx^m, and the number c is called an m-value of F(x,y) corresponding to g. In particular, c can be 0. Hence, by viewing F(x,y)=0 as a polynomial equation over K[x] with variable y, every solution of the equation F(x,y)=0 in K[x] is also an m-near solution. We provide an algorithm that gives all m-near solutions of a given polynomial F(x,y) over K, and this algorithm is polynomial time reducible to solving one variable equations over K. We introduce approximate solutions to analyze the algorithm. We also give some interesting properties of approximate solutions.
A DIYD (Do It Yourself Design) e-commerce system for vehicle design based on Ontologies and 3D Visualization
Authors: Lambros Makris, Nikolaos Karatzoulis, Dimitrios Tzovaras
Venue: Proceeding of the 2007 conference on Emerging Artificial Intelligence Applications in Computer Engineering: Real Word AI Systems with Applications in eHealth, HCI, Information Retrieval and Pervasive Technologies (2007)

The customization level of vehicles is growing in order to deal with increasing user needs. Web browsers are becoming the focal point of vehicle customization, forming personalized market places where users can select and preview various setups. However the state of the art for the completion of the transaction is still very much characterized by a face-to-face sales situation. Direct sales over the internet, without sales person contacts, are still a small segment of the market, of only a few percent, for European manufacturers. This chapter presents an Intelligent DIY e-commerce system for vehicle design, based on Ontologies and 3D Visualization that aims at enabling a suitable representation of products with the most realistic possible visualization outcome in order to help prospective customers in their decision. The platform, designed for the vehicle sector, includes all the practicable electronic commerce variants and its on-line product configuration process is controlled by an ontology that was created using the OWL Web Ontology Language.
"Integrated" and "transcendent" e-government: keys for analyzing organizational structure and governance
Authors: Beat Estermann, Reinhard Riedl, Alessia C. Neuroni
Venue: Proceedings of the 10th Annual International Conference on Digital Government Research: Social Networks: Making Connections between Citizens, Data and Government (2009)

As e-government enters the "transformation" phase, public authorities face major challenges in terms of governance and leadership. The present article consolidates prior research related to organizational structure and governance, and provides an analytical framework intended to guide empirical enquiry and to orient action. We argue that our understanding is enhanced by distinguishing an "integration" stage and a "transcendence" stage of e-government maturity. While the former is accompanied by a profusion of inter-organizational arrangements, the latter's distinctive feature are inter-personal networks. In order to appraise the implications of these organizational structures, we identify the main reasons behind their growing importance, analyze the ways they create value, and lay the foundations of a normative approach for the choice of governance structures.
How to Create the Magic Wand?Currently Implementable Formulation of the Problem
Authors: Victor Malyshkin
Venue: Proceeding of the 2006 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fifth SoMeT_06 (2006)

This paper considers the currently implementable approach to the problem of the magic wand creation.
Stability of Switched Cellular Neural Networks with Flat Fuzzy Feedback Min and Max Templates
Authors: Jinhua Huang, Jiqing Liu
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

In this paper, switched cellular neural networks are studied. Some sufficient conditions are obtained to guarantee that switched cellular neural network with flat fuzzy feedback Min templates and flat fuzzy feedback Max templates is globally exponentially stable. Since our assumptions relax the previous assumptions in some existing works, the results presented in this paper are the improvement and extension of the existed ones.