ppxscal/embedding_network huggingface dataset:
Policy and Enforcement in Virtual Organizations
Authors: Glenn Wasson, Marty Humphrey
Venue: Proceedings of the 4th International Workshop on Grid Computing (2003)

Arguably, the main goal of Grid Computing is to facilitatethe creation of Virtual Organizations (VOs); however, todate, not enough attention has been placed on the policiesand mechanisms by which these VOs will operate. Thecore of the VO--roughly, the responsibility of eachPhysical Organization (PO) in the VO to contribute andnot unjustly consume resources in achieving the overallgoal of the VO--is at best service-level agreements(SLAs) that lack a concrete connection to the underlyingGrid software and at worst an implicit "in-spirit"agreement. Unfulfilled expectations and obligations onthe part of each PO can have dire consequences and canultimately lead to the demise of the VO itself. This paperidentifies three general policies regarding resourceutilization by which VOs might operate and presents theramifications of each policy on the VO's day-to-dayoperations and the VO's ability to actually enforce thepolicy. A prototype implementation of a VO with the"you-get-what-you-give" policy is the basis of a concretecost/benefit analysis of policy enforcement for this typeof VO.
A Dynamic Programming Procedure for Pricing American-Style Asian Options
Authors: Hatem Ben-Ameur, Michèle Breton, Pierre L'Ecuyer
Venue: Management Science (2002)

Pricing European-style Asian options based on the arithmetic average, under the Black and Scholes model, involves estimating an integral (a mathematical expectation) for which no easily computable analytical solution is available. Pricing their American-style counterparts, which provide early exercise opportunities, poses the additional difficulty of solving a dynamic optimization problem to determine the optimal exercise strategy. A procedure for pricing American-style Asian options of the Bermudan flavor, based on dynamic programming combined with finite-element piecewise-polynomial approximation of the value function, is developed here. A convergence proof is provided. Numerical experiments illustrate the consistency and efficiency of the procedure. Theoretical properties of the value function and of the optimal exercise strategy are also established.
An Exploratory Study into Open Source Platform Adoption
Authors: Jason Dedrick, Joel West
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Research on open source software has focused mainly on the motivations of open sourceprogrammers and the organization of open source projects [17] [19]. Some researchers portray open source as an extension of the earlier open systems movement [36]. While there has been some research on open-systems software adoption by corporate MIS organizations [4] the issue of open source adoption has received little attention.We use a series of interviews with MIS managers to develop a grounded theory of open source platform adoption. We contrast this to prior academic and popular reports about the adoption of open source.
Low complexity, high-speed vlsi architectures for error correction decoders
Authors: Keshab K. Parhi
Venue:  (2003)

This thesis is devoted to the low complexity, high speed VLSI architectures for various error correction decoders. To reduce the complexity of space-time block turbo coded system, a computationally efficient approach is proposed for the soft decoding of space-time block code, which can reduce the computation by up to 70 percent without any performance degradation. Additionally, for the considered outer code block turbo code, through reduction of test patterns scanned in the Chase algorithm and alternative extrinsic information computation, extra 0.3dB to 0.4dB coding gain is obtained with negligible hardware overhead. The overall complexity is approximately ten times less than that of the near-optimum decoder with coding gain loss of 0.5dB at the BER of 10&minus;5 over AWGN channel. Based on the proposed interleaved single parity check turbo product codes, a parallel decoding structure is developed to increase the throughput. A new interleaver is constructed to further improve the coding gain. The extremely simple sign-min decoding is derived with only two additions needed to compute each bit's extrinsic information. Important implementation issues such as the finite precision analysis, sorting circuit design and interleaver memory are also presented. A systematic approach is proposed to develop high throughput decoder for quasi-cyclic low density parity check (LDPC) codes. Based on its properties, the two stages of belief propagation algorithm could be overlapped. To avoid the memory access conflict, the maximum concurrency of the two stages is explored by a novel scheduling algorithm. Consequently, the decoding throughput could be increased by about two times assuming dual-port memory is available. Furthermore, a load balanced approach is presented to reduce the area of logic core. A FPGA/ASIC implementation of irregular LDPC decoder is also presented. Long BCH codes achieve additional coding gain of 0.6dB compared to Reed-Solomon codes used for long-haul optical communication systems. A novel group matching scheme is proposed to further reduce the overall hardware complexity by 46% for BCH(2047, 1926, 23) code. The proposed scheme exploits the substructure sharing within a finite field multiplier (FFM) and among groups of FFMs.
Exploiting Self-Modification Mechanism for Program Protection
Authors: Yuichiro Kanzaki, Akito Monden, Masahide Nakamura, Ken-ichi Matsumoto
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

In this paper, we present a new method to protect soft-wareagainst illegal acts of hacking. The key idea is to add amechanism of self-modifying codes to the original program,so that the original program becomes hard to be analyzed.In the binary program obtained by the proposed method,the original code fragments we want to protect are camouflagedby dummy instructions. Then, the binary programautonomously restores the original code fragments withina certain period of execution, by replacing the dummy instructionswith the original ones. Since the dummy instructionsare completely different from the original ones, codehacking fails if the dummy instructions are read as theyare. Moreover, the dummy instructions are scattered overthe program, therefore, they are hard to be identified. As aresult, the proposed method helps to construct highly invulnerablesoftware without special hardware.
Digital Design: The components of a new paradigm
Authors: Rajat Gupta
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

The digital design paradigm is in transition. Wediscuss on-chip programmable regulators to reduce powerconsumption; SERDES blocks to reduce the inter-blockinterconnections and small signal swing high-speeddifferential inputs and outputs to maximize performancein interconnect delay-dominated technologies. We need tobuild re-configurability and re-use of logic as an essentialfeature of device functionality. We need to adopt self-calibrationmechanisms to solve the timing closureproblem and find ways to reduce the cost of test by design.
Shaken or stirred &ndash; virtual reverberation spaces and transformative gender identities in Kaija Saariaho's NoaNoa (1992) for flute and electronics
Authors: Taina Riikonen
Venue: Organised Sound (2003)

Kaija Saariaho's NoaNoa for flute and electronics consists of two materials: the live flute part and the electronic component, which can be further divided into real-time and pre-recorded material. The sound mixtures of live instrument, pre-recorded material, and real-time electronics create diverse instrumental positions, which also have effects on the musician's experiences of self and gender. This article examines the live flautist's embodied identity during the real-time reverberation and the pre-recorded part. Different performances of NoaNoa by different performers introduce diverse embodied flautist identities where the negotiations of gender and self are constantly redefined.
Grooming furry surfaces of arbitrary topology
Authors: Andrew Harvey
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

The Moving Picture Company has developed a custom fur solution which employs a novel interpolation technique driven by Maya shading networks, allowing the artist to intuitively groom furry creatures regardless of surface topology or type.
Conceptual confusions in knowledge management and knowledge management systems: clarifications for better KMS development
Authors: Michael Boahene, George Ditsa
Venue: Knowledge management: current issues and challenges (2003)

Knowledge Management and Knowleadge Management Systems are slowly but surely capturing the attention of many organisations in a quest for competitive advantage. Like many other computing fads before them, there is no shortage of recipes by its proponents. This chapter discusses the emerging discipline of Knowledge Management in computing and explains the concepts underlying Knowledge Management Systems that will lead to a better development and implementation of these systems. In particular, it tackles the conceptual confusion about data, information, and knowledge, which appears to be finding its way into the Knowledge Management literature. The terms, 'capta' (Checkland, Howell, 1998) and 'constructed data' (Flood, 1999), are used in analysing these concepts to clear some of the confusion surrounding them. The use of these terms also highlights our (the IT community) taking for granted assumptions about the hierarchical relationship and the more insightful emergent relationships.
Individual Differences and the Use of Collaborative Technologies in Education: An Empirical Investigation
Authors: Uday S. Murthy
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

This study investigated the extent to which students' participation in and satisfaction with acomputer-mediated collaborative learning system were affected by their preference for autonomy and anxiety about the use of computers. The results indicated that although students varied significantly in terms of their preference for autonomy and anxiety about the use of computers, there was no significant difference in participation and satisfaction levels between low and high computer anxiety students or between those with a low preference for autonomy relative to those with a high preference for autonomy.
Clustering for Petri nets
Authors: Walter Keller
Venue: Theoretical Computer Science (2003)

This work builds a bridge from • clustering techniques--merging neighbouring nodes which is a key feature for software engineering and the practical applications of Petri nets--to • folding techniques--merging only transitions with transitions and places with places, preserving behaviour and allowing theoretical connections to many models of concurrency.A new category of Petri nets is introduced. Morphisms support clustering, offering attractive properties to software engineering and integrating smoothly with invariants. A computationally reasonable adjunction connects it to folding-based Petri nets, namely, to two new cocomplete and complete categories. The dichotomy of structure and behaviour of Petri nets is expressed as compatible adjunctions to behavioural categories. Finally reachability and process semantics are attached categorically and a new variant of occurrence nets is proposed as a purer image of causality and branching. This framework offers categorical support for practical applications of Petri nets.
Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
Authors: Roberto Bruni, José Meseguer, Ugo Montanari
Venue: Mathematical Structures in Computer Science (2002)

Tile systems offer a general paradigm for modular descriptions of concurrent systems, based on a set of rewriting rules with side-effects. Monoidal double categories are a natural semantic framework for tile systems, because the mathematical structures describing system states and synchronizing actions (called configurations and observations, respectively, in our terminology) are monoidal categories having the same objects (the interfaces of the system). In particular, configurations and observations based on net-process-like and term structures are usually described in terms of symmetric monoidal and cartesian categories, where the auxiliary structures for the rearrangement of interfaces correspond to suitable natural transformations. In this paper we discuss the lifting of these auxiliary structures to double categories. We notice that the internal construction of double categories produces a pathological asymmetric notion of natural transformation, which is fully exploited in one dimension only (for example, for configurations or for observations, but not for both). Following Ehresmann (1963), we overcome this biased definition, introducing the notion of generalized natural transformation between four double functors (rather than two). As a consequence, the concepts of symmetric monoidal and cartesian (with consistently chosen products) double categories arise in a natural way from the corresponding ordinary versions, giving a very good relationship between the auxiliary structures of configurations and observations. Moreover, the Kelly&ndash;Mac Lane coherence axioms can be lifted to our setting without effort, thanks to the characterization of two suitable diagonal categories that are always present in a double category. Then, symmetric monoidal and cartesian double categories are shown to offer an adequate semantic setting for process and term tile systems.
Using Counter Example Guided Abstraction Refinement to Find Complex Bugs
Authors: Per Bjesse, James Kukula
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

In this paper, we present a method for finding failure traces for safety properties that are out of reach for traditional approaches to counter example generation. We do this by guiding Bounded Model Checking (BMC) with information gathered from counter example guided abstraction refinement. Unlike previously described approaches based on reconstructing abstract counter examples on the concrete machines, we do not limit ourselves to search for failures of the same length as the current abstract counterexample. We also describe a combination of previously known methods for choosing registers to include in the abstraction that we have found works very well together with our technique for finding failures. Our experimental results show that the resulting method can find counter examples that are out ofrange for both standard BMC and two previously published approaches to abstraction-guided BMC.
Assessing the Performance of Interdependent Infrastructures and Optimizing Investments
Authors: Linda K. Nozick, Mark A. Turnquist, Dean A. Jones, Jennifer R. Davis, Craig R. Lawton
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

Our nation's security as well as the quality of life of its citizenry depends on the continuousreliable operation of a collection of complicated interdependent infrastructures including transportation, electric power, oil, gas, telecommunications and emergency services. A disruption in one infrastructure can quickly and significantly impact another, causing ripples across the nation. Our infrastructures are increasingly reliant on new information technologies and the Internet to operate, often being connected to one another via electronic, informational links. While these technologies allow for enormous gains in efficiency, they also create new vulnerabilities. The focus of this paper is the development of a unifying mathematical framework to represent these "mega infrastructures" and a collection of algorithms that can be used to estimate performance and optimize investment. We include a small computationalexample that focuses on the delivery of gas and electric services, including the underlying SCADA system that supports the gas network, to illustrate the operation of the algorithms.
Space & Time Partitioning with ARINC 653 and pragma profile
Authors: Joyce L. Tokar
Venue: Proceedings of the 12th international workshop on Real-time Ada (2003)

The development of embedded applications is entering into a new domain with the availability of new high-speed processors and low cost on-chip memory. As the result of these new developments in hardware, there is an interest in enabling multiple applications to share a single processor and memory. To facilitate such a model the execution time and memory space of each application must be protected from other applications in the system.The ARINC Specification 653[1] provides the definition of an APplication EXecutive (APEX) that supports space and time partitioning of applications. ARINC 653 systems are composed of software partitions. Each partition is a separate application and there is dedicated memory space for each partition thereby providing space partitioning. Similarly, the APEX provides a dedicated time slice for each partition to support time partitioning. ARINC 653 supports a multitasking environment in each partition through a well-defined set of process communication mechanisms and preemptive priority based scheduling.The availability of a multi-tasking environment within each ARINC 653 partition reduces the need for the use of the Ada process model in the development of applications to execute on top of the ARINC 653 APEX. This paper will presents a proposal for a new profile definition, ARINC_653_Processes, for consideration using the pragma Profile capability of Ada.
Intelligent agents for patient monitoring and diagnostics
Authors: Susan L. Mabry, Troy Schneringer, Timothy Etters, Naomi Edwards
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

This paper describes Intelligent Monitor Agents (IM-Agents), a project that utilizes intelligent multiagents to assist patient health care. Clinicians must simultaneously audit and interpret an overwhelming amount of information regarding a patient during the process of monitoring, performing diagnostics and determining therapeutic intervention. Multiple IM-Agents coordinate as a team with each agent performing specialized monitor and diagnostic tasks. Fuzzy logic, connection networks, trend analysis and qualitative logic methods are used within the dynamic decision modules of all IM-Agents. The agents are autonomous, interactive, mobile and capable of performing dynamic intelligent inference during execution. Decision functionality is demonstrated in preliminary prototype test cases involving emergency trauma scenarios, particularly focusing on stabilizing hemorrhagic shock.
VolVis: a diversified volume visualization system
Authors: Ricardo Avila, Taosong He, Lichan Hong, Arie Kaufman, Hanspeter Pfister, Claudio Silva, Lisa Sobierajski, Sidney Wang
Venue: Proceedings of the conference on Visualization '94 (1994)

VolVis is a diversified, easy to use, extensible, high performance, and portable volume visualization system for scientists and engineers as well as for visualization developers and researchers. VolVis accepts as input 3D scalar volumetric data as well as 3D volume-sampled and classical geometric models. Interaction with the data is controlled by a variety of 3D input devices in an input device-independent environment. VolVis output includes navigation preview, static images, and animation sequences. A variety of volume rendering algorithms are supported, ranging from fast rough approximations, to compression-domain rendering, to accurate volumetric ray tracing and radiosity, and irregular grid rendering.
Mobile Robot Learning by Self-Observation
Authors: R. Andrew Russell
Venue: Autonomous Robots (2004)

The aim of the project described in this paper was to investigate robot learning at a most fundamental level. The project focused on the transition between organisms with innate behaviors and organisms that have the most rudimentary capability of learning through their personal interaction with their environment. It was assumed that the innate behaviors gave basic survival competence but no learning ability. By observing the interaction between their innate behaviors and the organism's environment it was reasoned that the organism should be able to learn how to modify its actions in a way that improves its performance. If a learning system is given more information than it requires then, when it is successful, it is difficult to say which pieces of information contribute to the success. For this reason the information available to the learning system was kept to an absolute minimum. In order to provide a practical test of the learning scheme developed in this project, the robot environment EDEN was constructed. Within EDEN a robot's actions influence its internal &lsquo;energy&rsquo; reserves. The environment incorporates sources of energy, and it also involves situations that use additional energy or reduce energy consumption. A successful learning scheme was developed purely based on the recorded history of the robot's interactions with its environment and the knowledge that the robot's innate behavior was reactive. This learning scheme allowed the robot to improve its energy management by exhibiting classical conditioning and a restricted form of operant conditioning.
Bounding restricted rotation distance
Authors: Sean Cleary, Jennifer Taback
Venue: Information Processing Letters (2003)

Restricted rotation distance between pairs of rooted binary trees quantifies differences in tree shape. Cleary exhibited a linear upper bound of 12n for the restricted rotation distance between two trees with n interior nodes, and a lower bound of (n - 1)/3 if the two trees satisfy a reduction condition. We obtain a significantly improved sharp upper bound of 4n - 8 for restricted rotation distance between two rooted binary trees with n interior nodes, and a significantly improved sharp lower bound of n - 2, again with the requirement that the trees satisfy a reduction condition. These improvements use work of Fordham to compute the word metric in Thompson's group F.
Geometric Approach to Clustering and Querying in Databases and Warehouses
Authors: Olga Sourina, Liu Dongquan
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

Databases and warehouses play significant role inreal world providing the human with the necessaryinformation for solving problems in all areas of life frommarketing to bioinformatics. Therefore, databases andwarehouses are essential components of all intelligentinformation systems in the Cyberworlds. This paperdescribes a geometric approach to clustering andquerying data in databases and warehouses. Data areinterpreted geometrically as multidimensional points. Ageometric definition of the cluster as a multidimensionalsolid defined with implicit functions is introduced. Aquery window is a query solid of any shape specified byits location. The queries are formulated with geometricobjects and operations over them. The geometric objectsand operations are described with implicit functions.With the uniform geometric model of the clustering andquerying, 3D visualization tools can be naturallyincorporated in one system that allows us to visualize andquery clusters in 3D space. The user clusters the data andposes the queries through graphics interface accessingdynamically multidimensional points and solids.