ppxscal/embedding_network huggingface dataset:
The effects of peripheral vision and physical navigation on large scale visualization
Authors: Robert Ball, Chris North
Venue: Proceedings of graphics interface 2008 (2008)

Large high-resolution displays have been shown to improve user performance over standard displays on many large-scale visualization tasks. But what is the reason for the improvement? The two most cited reasons for the advantage are (1) the wider field of view that exploits peripheral vision to provide context, and (2) the opportunity for physical navigation (e.g. head turning, walking, etc.) to visually access information. Which of these two factors is the key to advantage? Or, do they both work together to produce a combined advantage? This paper reports on an experiment that separates peripheral vision and physical navigation as independent variables. Results indicate that, for most of the tasks tested, increased physical navigation opportunity is more critical to improving performance than increased field of view. Some evidence indicates a valuable combined role.
Numerical study of controlling multistability by periodic pump modulation in an erbium-doped fiber laser
Authors: Rider Jaimes-Reátegui, Alexander N. Pisarchik, J. H. García-López
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

An erbium-doped fiber laser with driving pump modulation displays complex dynamics showing coexistence of attractors. Using a novel laser equation model we simulate experiments for controlling multistability in this laser and obtain good agreement with experimental results. We construct bifurcation diagrams of the laser peak intensity with respect to the driving and control modulation frequencies and amplitudes. We demonstrate with the basins of attraction of coexistent three periodic attractors that additional weak and slow harmonic modulation of the diode pump current can control the number of coexisting stable periodic orbits in the laser.
An agent-based model for virtual tourism using object Petri nets
Authors: Ali A. Pouyan, Ali Hassan Beigi, Mahnaz Kadkhoda
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

This paper presents a Petri net based agent model for virtual tourism. This model is based on object oriented Petri nets. The object Petri net model of virtual tourism consists of three distinct layers. Petri net models of agents are proposed to specify the components of mobile agent systems as autonomous modules. Each layer of the system has been modeled by a Petri net sub-module. The upper layers of the model consist of transitions, which are the encapsulated versions of the Petri net modules in a lower level layer. Communications among agents are defined via interfaces that are specified by the agent.
Marketing Audit Value Model Based on Rough Set and Support Vector Regression Machine
Authors: Cheng Che, Shan Ao, Shoulian Tang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

This study applies a new model based on rough set and support vector regression machine to enterprises' marketing audit value. To improve the efficiency, rough set was used to reduce the number of indexes. To improve the precision, the support vector regression machine was used. Then, the marketing audit value data of several companies were analyzed and 21 main indexes of marketing audit value were used. The experimental results demonstrate that the new method based on rough set and support vector regression machine has better precision than artificial neural network method and is more efficient than pure support vector regression machine method.
Optimizing Katsevich image reconstruction algorithm on multicore processors
Authors: Eric Fontaine, Hsien-Hsin S. Lee
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

The Katsevich image reconstruction algorithm is the first theoretically exact cone beam image reconstruction algorithm for a helical scanning path in computed tomography (CT). However, it requires much more computation and memory than other CT algorithms. Fortunately, there are many opportunities for coarse-grained parallelism using multiple threads and fine-grained parallelism using SIMD units that can be exploited by emerging multicore processors. In this paper, we implemented and optimized Katsevich image reconstruction based on the previously proposed &#x03C0;-interval method and cone beam cover method and parallelized them using OpenMP API and SIMD instructions. We also exploited symmetry in the backprojection stage. Our results show that reconstructing a 1024&#x00D7;1024&#x00D7;1024 image using 5120 512&#x00D7;128 projections on a dual-socket quad-core system took 23,798 seconds on our baseline and 642 seconds on our final version, a more than 37 times speedup. Furthermore, by parallelizing the code with more threads we found that the scalability is eventually hinged by the limited front-side bus bandwidth.
Preface by Arun Tripathi to Jeff Malpas' 'The Non-Autonomy of the Virtual'
Authors: Arun Tripathi
Venue: Ubiquity (2008)

Australian philosopher Jeff Malpas, author of Place and Experience, argues in his Ubiquity paper The non-autonomy of the virtual: philosophical reflections on contemporary virtuality that the virtual is not autonomous with respect to the everyday, but is rather embedded within it, and an extension of it. Within philosophy, Professor Malpas is perhaps best known as one of a small number of philosophers who work across the analytic-continental divide, publishing one of the first books that drew attention to convergences in the thinking of the key twentieth century American philosopher Donald Davidson and the phenomenological and hermeneutic traditions, as exemplified in the work of Heidegger and Gadamer.
Managing Enterprise Risk in Today's World of Sophisticated Threats: A Framework for Developing Broad-Based, Cost-Effective Information Security Programs
Authors: Ron Ross
Venue: The EDP Audit, Control, and Security Newsletter (2007)

Public and private sector enterprises today are almost completely dependent on their information technology infrastructures to accomplish their critical missions and carry out their corporate business strategies. In order to effectively compete in a fast-paced, highly complex, global economy, organizations are employing new, more powerful information technologies at an unprecedented rate, and in most instances, either ignoring or not fully understanding the increased exposure of their enterprise operations1 and assets due to the aggressive use of that technology.
Trade-Offs in Peer Delay Minimization for Video Streaming in P2P Systems
Authors: Anis Ouali, Brigitte Jaumard, Gérard Hébuterne
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Peer-to-peer (P2P) systems are quite attractive due to their ability to deliver large amounts of data at a reduced deployment cost. They offer an interesting paradigm for media streaming applications that can benefit from the inherent self organization and resource scalability made available by participating peers. However, most studies on P2P live video streaming deal mainly with the feasibility of such an approach with a focus on maximizing throughput and resiliency. Little has been done to investigate the impact ofthe characteristics of the streaming source and of the participating peers on the P2P system performance and more specifically, on the playback delays experienced by peers. Through the use of an integer linear programming model, this paper investigates several related trade offs we need toconsider, to fully exploit the potential of a P2P streaming system.
On Bayesian estimation and model comparison of an integrated structural equation model
Authors: Sik-Yum Lee, Xin-Yuan Song
Venue: Computational Statistics Data Analysis (2008)

In this paper, we introduce a Bayesian approach to the estimation and model comparison of an integrated two-level nonlinear structural equation model with mixed continuous, dichotomous, and ordered categorical data that may be missing at random. This general model can accommodate nonlinearities of latent variables and the effects of fixed covariates on measurement and structural equations in within-groups and between-groups models. A sampling-based algorithm that combines the Gibbs sampler and the Metropolis-Hastings algorithm is proposed for posterior simulation. A procedure that utilizes path sampling is implemented to compute the Bayes factor for model comparison under the framework of the proposed integrated model. Empirical performances of Bayesian methodologies are illustrated via analysis of a real example.
Spiral removal of exceptional patients for mining chronic hepatitis data
Authors: Masatoshi Jumi, Muneaki Ohshima, Ning Zhong, Hideto Yokoi, Katsuhiko Takabayashi, Einoshin Suzuki
Venue: New Generation Computing (2007)

In this paper, we propose a method which removes exceptional patients in a spiral manner for obtaining a definition of a disease in the form of a table of conditional probabilities and we describe its application to chronic hepatitis data. The removal is based on a risk-ratio-based criterion and can be supported by our previously developed data mining methods and medical experts. A series of experiments in which two domain experts decided exceptional patients to be removed show that our proposed method is effective and promising from various viewpoints such as obtaining new hypotheses and improving skills of domain experts. Another series of experiments in which exceptional patients were removed automatically led us to a rediscovery of a piece of knowledge, which had been reported in an article of a medical journal as the main result of the article.
Generalizations of tournaments: A survey
Authors: Jørgen Bang–Jensen, Gregory Gutin
Venue: Journal of Graph Theory (1998)

We survey results concerning various generalizations of tournaments. The reader will see that tournaments are by no means the only class of directed graphs with a very rich structure. We describe, among numerous other topics mostly related to paths and cycles, results on hamiltonian paths and cycles. The reader will see that although these problems are polynomially solvable for all of the classes described, they can be highly nontrivial, even for these &ldquo;tournament-like&rdquo; digraphs. &copy; 1998 John Wiley & Sons, Inc. J. Graph Theory 28: 171&ndash;202, 1998
Using on ethnographic process to conduct requirements analysis for agile systems developmet
Authors: Nanda C. Surendra
Venue: Information Technology and Management (2008)

Since the late 1990s, agile or lightweight software development methodologies have experienced a meteoric rise of interest among systems developers who consider traditional systems development methodologies (such as Structured Systems Development, Information Engineering, and Rational Unified Process) too inflexible for building systems having unpredictable and changing requirements. Agile methodologies try to adapt to rapid requirement changes by having short, iterative development cycles and by encouraging frequent, open communication with customers. However, agile methodologies are still in the process of devising systematic approaches on how to be adaptive to unpredictable and changing requirements and how to incorporate customers into the systems development process. In this study, we show how an ethnographic research process called Strip Resolution can be applied as a systematic complement to projects applying agile development principles. We illustrate, in detail, how the Strip Resolution Process (SRP) enabled us, in the role of systems developers, to adapt to changing and unpredictable user requirements and to incorporate customers into the systems development process.
Enocoro-80: A Hardware Oriented Stream Cipher
Authors: Dai Watanabe, Kota Ideguchi, Jun Kitahara, Kenichiro Muto, Hiroki Furuichi, Toshinobu Kaneko
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Panama is a pseudo-random number generator proposed by Daemen and Clapp in 1998. It is designed to achieve high performance in software implementations, and the throughput is twice as fast as that of the AES block cipher. On the other hand, the size optimized implementation in hardware circuit is much larger than that of the AES. We are attempted to design a new hardware oriented PRNG which has a similar structure to Panama. In this paper, a family of PRNGs Enocoro is presented and especially a specific algorithm Enocoro-80 for 80-bit key is given. Enocoro-80 can be implemented with 2.7 Kgates in ASIC. The implementation results are comparable to other ciphers selected as the eSTREAM Profile 2 candidates (hardware oriented ciphers). As a result, we confirm that the design of Panama is suitable to not only a software oriented cipher, but also a hardware oriented cipher.
Attacks and counter-attacks on the GPT public key cryptosystem
Authors: Ernst M. Gabidulin
Venue: Designs, Codes and Cryptography (2008)

The public key cryptosystem based on rank error correcting codes (the GPT cryptosystem) was proposed in 1991. Several attacks against this system were published, including Gibson's attacks and recent Overbeck's attacks. In this paper, we improve the GPT system by more careful choice of parameters to withstand these attacks.
The deep computing messaging framework: generalized scalable message passing on the blue gene/P supercomputer
Authors: Sameer Kumar, Gabor Dozsa, Gheorghe Almasi, Philip Heidelberger, Dong Chen, Mark E. Giampapa, Michael Blocksome, Ahmad Faraj, Jeff Parker, Joseph Ratterman, Brian Smith, Charles J. Archer
Venue: Proceedings of the 22nd annual international conference on Supercomputing (2008)

We present the architecture of the Deep Computing Messaging Framework (DCMF), a message passing runtime designed for the Blue Gene/P machine and other HPC architectures. DCMF has been designed to easily support several programming paradigms such as the Message Passing Interface (MPI), Aggregate Remote Memory Copy Interface (ARMCI), Charm++, and others. This support is made possible as DCMF provides an application programming interface (API) with active messages and non-blocking collectives. DCMF is being open sourced and has a layered component based architecture with multiple levels of abstraction, allowing the members of the community to contribute new components to its design at the various layers. The DCMF runtime can be extended to other architectures through the development of architecture specific implementations of interface classes. The production DCMF runtime on Blue Gene/P takes advantage of the direct memory access (DMA) hardware to offload message passing work and achieve good overlap of computation and communication. We take advantage of the fact that the Blue Gene/P node is a symmetric multi-processor with four cache-coherent cores and use multi-threading to optimize the performance on the collective network. We also present a performance evaluation of the DCMF runtime on Blue Gene/P and show that it delivers performance close to hardware limits.
System-Level Modeling and Simulation of Uplink WCDMA
Authors: Rachod Patachaianand, Kumbesan Sandrasegaran
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Universal Mobile Telecommunication System (UMTS) is based on WCDMA technology. The capacity of this system is difficult to manually compute because of at least two reasons. Firstly, this system is designed to support many types of services, and hence capacity calculation using classic Erlang’s capacity is not sufficient. Secondly, the capacity of such system depends on interference which is a time-varying factor, so that it is necessary to precisely model the interference; otherwise the result may be inaccurate. This paper aims to provide complete details of uplink WCDMA modeling and simulation. This proposed simulation is a dynamic system-level simulation in which important parameters such as radio propagation effects, user movement, power control and interference modeling are included. The principles of WCDMA modeling and simulation which are presented in this paper are essential tools for study and research in optimising UMTS system.
Robot Navigation by Waypoints
Authors: Yang Wang, David Mulvaney, Ian Sillitoe, Erick Swere
Venue: Journal of Intelligent and Robotic Systems (2008)

In this paper we propose a novel waypoint-based robot navigation method that combines reactive and deliberative actions. The approach uses reactive exploration to generate waypoints that can then be used by a deliberative system to plan future movements through the same environment. The waypoints are used largely to provide the interface between reactive and deliberative navigation and a range of methods could be used for either type of navigation. In the current work, an incremental decision tree method is used to navigate the robot reactively from the specified initial position to its destination avoiding obstacles in its path and a genetic algorithm method is used to perform the deliberative navigation. The new method is shown to have a number of practical advantages. Firstly, in contrast with many deliberative approaches, complete knowledge of the environment is not required, nor is it necessary to make assumptions regarding the geometry of obstacles. Secondly, the presence of a reactive navigator means it is always possible to continue directed movements in unknown or changing environments or when time constraints become particularly demanding. Thirdly, the use of waypoints allows escape from certain obstacle configurations that would normally trap robots navigated under the control of purely reactive methods. In addition, the results presented in this paper from a number of realistic simulated environments show that the adoption of waypoints significantly reduces the time to calculate a deliberative path.
Process Knowledge Verification Method Based on Petri Net
Authors: Wang Daliang, Zhang Dezheng, Gao Li-xin, Liu Jian-ming, Zhang Huansheng
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Process knowledge is a key element to construct the domain knowledge database, and the process knowledge is mainly represented by process models. Although there are many methods to represent the process knowledge, they all have complexity and difficulty on the representation of the model construction, furthermore, the key problem lies on the difficulty of the process knowledge verification. Therefore, a method of modeling and verifying process model on the basis of Petri Net is proposed in this paper, and Petri Net representations of basic units in process model are refined. It is proved by examples that the problem of accessibility, deadlock and dead circle can be solved well by this method.
A Local Broker enabled MobiPass architecture for enhancing trusted interaction efficiency
Authors: Will Tao, Robert Steele
Venue: Proceedings of the thirty-first Australasian conference on Computer science - Volume 74 (2008)

While mobile computing provides a potentially vast business opportunity for many industry participants, it also raises issues such as security and performance. This paper proposes a Local Broker enabled MobiPass architecture based on our previous research outcomes. Our MobiPass architecture can convert the unpredictable and highly dynamic mobile environment into a trusted business platform. By setting customised rules against a MobiPolicy, the Mobipass architecture enables fine grained access control without necessarily having a prior knowledge or interaction with other encountered parties and environments. This paper extends our MobiPass architecture by introducing an additional element -- the Local Broker, to enhance the architecture's performance and efficiency. A detailed case study has been provided to explain the role that the Local Broker takes in the architecture.
Geometric displacement on plane and sphere
Authors: Elodie Fourquet, William Cowan, Stephen Mann
Venue: Proceedings of graphics interface 2008 (2008)

This paper describes a new algorithm for geometric displacement mapping. Its key idea is that all occluded solutions for an eye ray lie in two-dimensional manifolds perpendicular to the underlying surface to which the height map is applied. The manifold depends only on the eye position and surface geometry, and not on the height field. A simple stepping algorithm, moving along the surface within a manifold renders a curve of pixels to the view plane, which reduces height map rendering to a set of one-dimensional computations that can be done in parallel. The curves on the view plane for two specific underlying manifolds, a plane and a sphere, are straight lines. In this paper we focus on the specific geometry of simple underlying surfaces for which the geometry is more intuitive and the sampling of the rendered image direct.
Hierarchical naive bayes models for representing user profiles
Authors: J. F. Huete, L. M. de Campos, J. M. Fernandez-Luna, M. A. Rueda-Morales
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

In this paper, we show how a user profile can be enhanced when a more detailed description of the products is included. Two main assumptions have been considered: the first implies that the set of features used to describe an item can be organized into a well-defined set of components or categories, and the second is that the user's rating for a given item is obtained by combining user opinions of the relevance of each component.
A Composite Convex Hull Collision Detector for the Open Dynamics Engine
Authors: Richard Cant, Caroline Langensiepen, Lewis Foster
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

We describe a collision detection system that can be used alongside the integrator and constraint resolver components of the open dynamics engine (ODE). The system provides contact detection between convex hulls (convex polyhedra), which was not availablewithin the main ODE project until very recently. It also includes direct contact detection between composite objects constructed of multiple hulls. The aggregation of hulls within the collision detection software allows contact culling to be performed, eliminating problems that inevitably arise with 3D assets when coincident contact points occur.
Integer-pixel motion estimation H.264/AVC accelerator architecture with optimal memory management
Authors: Armando Mora Campos, Francisco J. Ballester Merelo, Marcos A. Martínez Peiró, José A. Canals Esteve
Venue: Microprocessors Microsystems (2008)

This paper presents an improved accelerator core for H.264/AVC video-coding motion estimation. The proposed hardware architecture meets the integer-pixel, full-search block-matching algorithm requirements with an optimal memory management and an effective data-path. Performance characteristics like low latency, high processing speed and efficiency near 100% are achieved without a high control overhead. The core calculates the 41 best motion vectors using a pipeline process. It is composed of a systolic 16x16 processor elements array, a sum of absolute differences adder tree and a Lagrangian rate/distortion cost optimizer. Implementation results based on FPGA devices in a system on chip (SoC) structure using VHDL are included.