ppxscal/embedding_network huggingface dataset:
Harnessing mobile ubiquitous video
Authors: Neil J. McCurdy, Jennifer N. Carlisle, William G. Griswold
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Realityflythrough is a telepresence/tele-reality system that works in the dynamic, uncalibrated environments typically associated with ubiquitous computing. By opportunistically harnessing networked mobile video cameras, it allows a user to remotely and immersively explore a physical space. Live 2d video feeds are situated in a 3d representation of the world. Rather than try to achieve photorealism at every point in space, we instead focus on providing the user with a sense of how the video streams relate to one another spatially. By providing cues in the form of dynamic transitions, we can approximate photorealistic telepresence while harnessing cameras "in the wild." This paper shows that transitions between situated 2d images are sensible and provide a compelling telepresence experience.
Out-of-core computing on mesh connected computers
Authors: Sanguthevar Rajasekaran
Venue: Journal of Parallel and Distributed Computing (2004)

Several models of parallel disks are found in the literature. These models have been proposed to alleviate the I/O bottleneck arising in handling voluminous data. These models have the general theme of assuming multiple disks. For instance the parallel disks model assumes D disks and a single computer. It is also assumed that a block of data from each of the D disks can be fetched into the main memory in one parallel I/O operation. In this paper, we study a model where there are more than one processors and each processor has an associated disk. In addition to the I/O cost, one also has to account for the inter-processor communication costs. To begin with we study the mesh and we investigate the performance of the mesh with respect to out-of-core computing. As a case study we consider the problem of sorting. The goal of this paper is to study the properties of this model.
Proceedings of the 5th conference on Creativity cognition
Venue: Creativity and Cognition (2005)

When we started planning the first Creativity & Cognition conference around thirteen years ago, we never imagined that the series would still be running in 2005. A single meeting that brought together artists, designers, cognitive scientists, computer scientists for a dialogue about creativity seemed daring enough to do once only, but it turned out that each time we held the meeting those who took part wanted more. Well, here it is: more Creativity & Cognition.Geographically, the Conference has slipped south a little, from Loughborough University in the English Midlands, to Goldsmiths College in London. Goldsmiths provides a very appropriate location for the 2005 conference. The Ben Pimlott, a new building designed by Will Alsop, houses the Centre for Cognition, Computation and Culture and the Goldsmiths Digital Studios under the guidance of Janis Jefferies and Robert Zimmer who are Conference Co-Programme Chair and Local Chair respectively. The new Centre is an innovative multi-disciplinary collaboration between several departments and draws together work in the Cognitive Neuroscience unit and the Goldsmiths Digital Studios, as well as related research areas elsewhere in the College.There are other changes too. The Programme is now organized into three streams, each with a co-chair. One stream represents the central, scientific and technology oriented work on creativity that we have always encouraged. A second expands our direct coverage of creative art practice, and includes an enhanced exhibition component. The third stream addresses history in this area and, although we have had papers, and invited presentations, on history before, this year it plays a welcome enlarged part of the proceedings. It is appropriate that the Programme team have space in this introduction to comment on the contributions that they have put so much into shaping and selecting.
Performance Analysis of Radio Resource Allocation for Multimedia Traffic in Cellular Networks
Authors: Wei-Yeh Chen, Jean-Lien C. Wu
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

In this paper, we study the performance of radio resource allocation for cellular networks where real-time (RT) and non-real-time (NRT) data traffic are considered in addition to voice traffic. To guarantee the performance of voice traffic, preemptive priority is used so that voice calls can preempt data packets and RT data traffic preempts NRT data traffic. By reserving channels specifically for RT data, the packet loss probability and mean queueing delay can be reduced, meanwhile, the performance of NRT data can also be improved. This is achieved at the expense of increasing voice blocking probability. Thus, the number of reserved channels can be adjusted to control the voice blocking probability while improving the performance of data traffic. Besides, the packet loss probability of RT traffic is smaller for smaller RT traffic ratio. On the contrary, the smaller the RT traffic ratio, the larger the queueing delay.
An adaptive memory programming method for risk logistics operations
Authors: C. D. Tarantilis, C. T. Kiranoudis
Venue: International Journal of Systems Science (2004)

This paper presents a decision support system (DSS) that enables logistics planners of a well-known bank to design intra-city safe delivery routes, using an intelligent metaheuristic method and exploiting risk methodologies and spatial data information. The DSS routes minimize the probability of successful vehicle robbery at a certain point of the road network and satisfy all operational constraints of the distribution problem examined. The proposed DSS was implemented to an actual banking environment and the results obtained by this real-life, application are reported.
Wireless protocol testing and validation supported by formal methods: a hands-on report
Authors: Manuel J. Fernández-Iglesias, Juan C. Burguillo-Rial, Francisco J. González-Castaño, Martín Llamas-Nistal
Venue: Journal of Systems and Software (2005)

We apply formal testing and validation techniques and tools to analyse a configuration protocol for a Bluetooth Location Network (BLN). This network is composed by static Bluetooth nodes that establish a spontaneous network at system initialization. Once configured, BLN provides location services for location-aware or context-driven wireless environments, such as m-commerce networks or e-museums. BLN configuration was initially defined in natural language, and had passed some initial tests and simulation-based analysis. Formal methods have provided deeper understanding and discovered unexpected errors that may arise in some failure scenarios.
An Analysis of RPM Validation Drift
Venue: Proceedings of the 16th USENIX conference on System administration (2002)

Experiments that analyze dependencies in RedHat Linux and RpmFind.net show disturbing conflicts and overlaps between software packages that result in installing multiple differing versions of dynamic libraries. The final state of a system containing conflicting packages depends upon the order in which packages are installed, as well as user input during the installation process. This leads to system states that may or may not have been tested, lowering confidence that the resulting software configuration will function properly. We describe the details of the problem, potential effects, and potential solutions involving improving the practice of building RPM packages.
Home Networking: A Visual Do-It-Yourself Guide
Authors: Brian Underdahl
Venue:  (2004)

The only home networking book you'll ever needSetting up a home network doesn't need to be difficult. You can use this easy-to-understand reference to set up your home network, secure it, and turn it into an entertainment network. Don't be fooled by other guides-it can be this simple: It's Easy-Set up your home network with this visual step-by-step guide. Quit Wasting Time and Money-Buy the network gadgets and equipment you need. Make It Secure-Use simple tips to make your network secure. Wow the Neighbors-Turn your home network into an entertainment network. What Went Wrong-Fix common problems you might encounter while setting up your network.
Scalable computational methods in quantum field theory
Authors: Jason Slaunwhite
Venue: Journal of Computing Sciences in Colleges (2004)

Matrix eigenvalue problems arise in several areas of science and engineering. Particle physicists, in particular, are interested in solving eigenvalue problems that describe relativistic subatomic interactions. Quantum field theory provides a formal mathematical approach for specifying the eigenvalue problems, but it also introduces some complications. A particularly problematic complication is accounting for an infinite number of particles. It is not necessary to deal practically with infinities: the system maybe truncated to a discrete number. In the case of strong coupling, however, it is inaccurate to truncate at small particle numbers. Scalable computational methods are vital to the exploration of quantum field theory since they facilitate inclusion of increasing numbers of particles. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A method for detecting conceptual differences based on correlation between decision trees
Authors: Kensuke Ohnishi, Tetsuya Yoshida, Shogo Nishida
Venue: Systems and Computers in Japan (2004)

When several people are engaged in cooperative work, conceptual differences resulting from differences in background knowledge or specialized fields can impede the flow of ideas. Previously, the authors have represented user knowledge as a decision tree for when different symbols are used with the same meaning for conceptual differences, or when the same symbols are used with a different meaning. They then worked on detecting conceptual differences by using the differences in the structure of the decision trees. In this paper, the authors describe the problems with conventional methods to detect differences by generating virtual knowledge based on each user's knowledge and then creating a decision tree. As a solution to these problems, they propose a method to detect differences by finding correlations between decision trees in a bottom-up fashion based on class classification in the decision trees. The authors create a prototype using their proposed method, and then confirm in experiments on a case involving the diagnosis of a motor failure that detection precision rises. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(2): 25&ndash;38, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10430
eGaLab: a new dimension for artists: Research Articles
Authors: Michal Masa, Jiri Zara, Pavel Smetana
Venue: Computer Animation and Virtual Worlds (2005)

Presenting art in the age of the Internet brings along several misunderstandings: there occurs, for instance, a profound difference between online galleries or museums providing a simple point and click navigation in multimedia documents on the one hand, and some of the newly emerging presentation platforms that reflect contemporary artistic creation in its essential dependence on electronic media (e.g. net.art or virtual sculpture), on the other. The eGaLab (Electronic Gallery and Laboratory) project advances possibilities to create and present artworks on the Internet. It introduces an intuitive approach in the field of virtual environments as well as communities oriented towards visual art and shared artistic collaboration. eGaLab combines and transforms the advantages of collaborative virtual environments with the traditional aspects of artistic creation and presentation. In this paper we describe the architecture of the eGaLab platform. We describe its networking part based on a concept of General Variables and discuss several implementation issues related to its specific character. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Real-life JVM design for mobile devices
Authors: Bernd Mathiske
Venue: Proceedings of the 2004 workshop on Interpreters, virtual machines and emulators (2004)

The design of Java(TM) Virtual Machines for mobile devices is strongly influenced by resource limitations (memory sizes, processor speed, power consumption, etc.). For early designs like the KVM, the main challenge was to meet the given restrictions at all. Meanwhile, the design space has shifted and widened, accompanied by increasing user demands for execution speed, interactive responsiveness and reliability. Consequently, JVMs for mobile devices need to incorporate increasingly sophisticated features, in some cases "trickling down" from larger JVMs. It is not straight forward to adopt any of the latter, though, since resource limitations simultaneously increase the urgency of enhancing resource management and the urgency of simplicity.
A clustering- and probability-based approach for time-multiplexed FPGA partitioning
Authors: Guang-Ming Wu, Mango Chia-Tso Chao, Yao-Wen Chang
Venue: Integration, the VLSI Journal (2004)

Improving logic density by time-sharing, time-multiplexed FPGAs (TMFPGAs) have become an important research topic for reconfigurable computing. Due to the precedence and capacity constraints in TMFPGAs, the clustering and partitioning problems for TMFPGAs are different from the traditional ones. In this paper, we propose a two-phase hierarchical approach to solve the partitioning problem for TMFPGAs. With the precedence and capacity considerations for both phases, the first phase clusters nodes to reduce the problem size, and the second phase applies a probability-based iterative-improvement approach to minimize cut cost. Experimental results based on the Xilinx TMFPGA architecture show that our algorithm significantly outperforms previous works.
Interactive Color Image Segmentation by Region Growing Combined with Image Enhancement Based on Bezier Model
Authors: Yongming Li, Dongming Lu, Xiqun Lu, Jianming Liu
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Image segmentation has been the subject of considerable research activity over the last three decades. This paper proposes an algorithm for color image segmentation by region growing combined with the image enhancement based on the Bezier model. Using Bezier curve model has a direct impact on the quality of the image, and will enhance the boundary differences between the objects and their background making the image segmentation task easier. The segmentation starts from a seed in the form of 3*3 image blocks to avoid the noise point. It grows up the region by adding adjacent pixels that are satisfied with the homogeneous criteria with the seed point, expand point and the growing region respectively. Using the perceptual color clustering, color images is quantized and the similar colors are classified based on NBS color distance. The experimental results illuminate that the algorithm the paper proposed is effective.
Wavelet approach to image transformation
Authors: Li Min Cui, Yuan Yan Tang, Fu ChengLiao, Xiang Chu Feng
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

Image distortion can be characterized by the image transformation model. Once the distorted image is approximated by a certain image transformation model, we can apply its inversetransformation to remove the distortion. Consequently, finding a mathematical form to approximate the distorted image plays a key role in the restoration. In this paper, a novel wavelet-basedmethod is presented, which consists of three phases: (1) the partial differential equation is converted in to boundary integral equation and representation by an indirect method; (2) the boundary integral equation and representation are changed to plane integral equation and representation by boundary measure formula; (3) the plane integral equation and representation are then solved b yl wavelet collocation. The performance of our method is evaluated by numerical experiments.
Observations of IPv6 traffic on a 6to4 relay
Authors: Pekka Savola
Venue: ACM SIGCOMM Computer Communication Review (2005)

FUNET has been operating a public, globally-used 6to4 (RFC 3056) relay router since November 2001. The traffic has been logged and is now analyzed to gather information of 6to4 and IPv6 deployment.Among other figures, we note that the number of 6to4 capable nodes has increased by an order of magnitude in half a year: in April 2004, there are records of about 2 million different 6to4 nodes using this particular relay. Vast majority of this is just testing the availability of the relay, done by the Microsoft Windows systems, but the real traffic has also increased over time.While the observed 6to4 traffic has typically consisted of relatively simple system-level applications, or applications by power users, the emergence of peer-to-peer applications such as BitTorrent was also observed.
Advanced Decision Systems: description of the CODEX system as used for MUC-3
Authors: Laura Blumer Balcom, Richard M. Tong
Venue: Proceedings of the 3rd conference on Message understanding (1991)

ADS has been developing an approach to text processing, called CODEX, COntext directed Data EXtraction), that couples a concept-based, probabilistic keyword pattern matcher, called RUBRIC, with a probabilistic, generalized graph composition chart parser, called CAUCUS. We configure these two key technologies together for a variety of natural language sorting and gisting applications to provide greater depth of analysis (higher precision) than keyword-based techniques alone, as well as higher throughput and greater breadth of coverage than parsing techniques alone.
Getting in Touch with a Cognitive Character
Authors: Torsten Bierz, Peter Dannenmann, Kai Hergenrother, Martin Bertram, Henning Barthel, Gerik Scheuermann, Hans Hagen
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

We provide computer-animated characters with haptic interaction, allowing human users to interfere with cognitive characters. Our work presents an interface between control and animation of virtual characters (CONTACT) and HapTEK, a framework for haptic interaction of a human hand with virtual reality (VR). This way, humancomputer interaction becomes truly bidirectional, i.e. an animated character directly provides feedback to a human user, and vice versa, introducing a new quality with respect to the behavior of both. Our system for the first time offers the opportunity for human and artificial intelligence to get in touch.
An Enhanced Parallel Loop Self-Scheduling Scheme for Cluster Environments
Authors: Chao-Tung Yang, Kuan-Wei Cheng, Kuan-Ching Li
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In this paper, a parallel loop self-scheduling scheme for heterogeneous PC cluster systems is proposed. Though the proposed scheme does allow users to choose parameters before the execution initialization phase, there are still weaknesses that motivate us to go further with new improvements in that scheme. For instance, a decision on a fixed and monotonous parameter can easily lead to invalid schedule by using previous input information. Thus, it is proposed in this paper a new scheme, where the scheduling parameter can be adjusted dynamically and fit into most widely available computer systems, in order to provide higher overall performance.
Realization and characterization of SU-8 micro cylindrical lenses for in-plane micro optical systems
Authors: J. Hsieh, C.-J. Weng, H.-L. Yin, H.-H. Lin, H.-Y. Chou
Venue: Microsystem Technologies (2005)

This study presents a new method of fabricating and integrating micro cylindrical lenses (MCLs) into an in-plane micro optical system. The characterizations of MCLs, which are made of SU-8 negative photoresist, are also reported in this study. Many demands, especially for arbitrary lens shapes and accurate alignment, can be met by the proposed method. The measurements of size revealed that SU-8 MCLs swelled, but the amount of swelling maintained constant for at least six months. Two factors were demonstrated to govern the swelling of SU-8 structures, and can be compensated for in the design of the mask. The SU-8 MCLs are shown to exhibit function with a satisfactory optical property. Fluorescence is collimated and focused in a micro channel, demonstrating the potential of MCLs to detect laser-induced-fluorescence (LIF). The fluorescence behavior of SU-8 is also examined herein. The advantages of rapid prototyping and easy integration of SU-8 MCLs have a range of many applications, especially in in-plane micro optical configurations.
REPLICA: A Bitstream Manipulation Filter for Module Relocation in Partial Reconfigurable Systems
Authors: H. Kalte, G. Lee, M. Porrmann, U. Ruckert
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

The feature of partial reconfiguration provided by currently available Field Programmable Gate Arrays (FPGAs) makes it possible to change hardware modules while others keep working. The combination of this feature and the high gate capacity enables the integration of dynamic systems that can be adapted to changing demands during runtime. Placing the dynamically changing modules along a horizontal communication infrastructure does not only provide communication facilities it also enables the relocation of pre-synthesized modules by bitstream manipulations. The exact placement of an incoming module is determined according to the current resource allocation, which results in an online placement problem. In order to prevent any extra configuration overhead for the relocation process, we developed the REPLICA (Relocation per online Configuration Alteration) filter, which is capable of performing the necessary bitstream manipulations during the regular download process. The filter architecture, a Configuration Manager and an evaluation example are presented in this paper.
Comments on "Asymptotic expansion of a Bessel function integral using hypergeometric functions" by L.J. Landau and N.J. Luswili
Authors: B. J. Stoyanov
Venue: Journal of Computational and Applied Mathematics (2005)

In a recent paper Landau and Luswili (J. Comput. Appl. Math. 132 (2001) 387) used generalized hypergeometric functions to obtain a complete asymptotic expansion for the integral ∫0π/2Jµ(λsin θ)Jv(λ sin θ) dθ, where Jµ is the µth-order Bessel function of the first kind and λ is a large parameter tending to infinity. The purpose of this note is to point out that the same complete asymptotic expansion for this integral (as well as another one for a Hankel-type integral) has previously been obtained by Stoyanov et al. (J. Comput. Appl. Math. 50 (1994) 533) by using the same method. In addition, an alternative, simpler representation of the algebraic series contribution to the asymptotic expansion is provided. A few errors are also corrected and additional relevant references indicated.
On Bandwidth Adjusted Multicast Communications in Pipeline Router Architecture
Authors: Young-Cheol Bang, Hyunseung Choo
Venue: The Journal of Supercomputing (2005)

We have developed a novel algorithm to adjust link-bandwidths of a given multicast tree, which sends a message with size r from a source to a multiple destinations taking into consideration pipelined router. The algorithm that we have developed tries to minimize the end-to-end delay time and resources such as bandwidths of a multicast tree, and performs admirably well in any given multicast tree. Our evaluation shows that the proposed algorithm dramatically reduces the end-to-end delay time and resources reserved to satisfy the time-constraints.