ppxscal/embedding_network huggingface dataset:
The Realization of Campus Emulation System Based on OpenGL and 3D
Authors: Nawen Li
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Scientific visualization, computer animation and virtual reality are the three main active developing trend in the field of computer graphics recently, the kernel technology of which are all 3D graphics with sense of reality. This thesis introduces the realization of campus emulation system based on OpenGL and 3D in details in the environment of VC++.
Extending Spatial Data Infrastructures 3D by Geoprocessing Functionality - 3D Simulations in Disaster Management and environmental Research
Authors: Georg Walenciak, Beate Stollberg, Steffen Neubauer, Alexander Zipf
Venue: Proceedings of the 2009 International Conference on Advanced Geographic Information Systems & Web Services (2009)

The quite new Web Processing Service (WPS) specification of the Open Geospatial Consortium (OGC) is increasing the value of Spatial Data Infrastructures (SDIs) by offering a standard for the actual processing of spatial data. The interface is already used in a range of projects, but up to now mainly in connection with 2D spatial data. In this paper we want to demonstrate that the standard can also be applied in a 3D environment which increases the potential of such 3DSDIs. We implemented two use cases of disaster management and environmental monitoring and discuss the benefits and drawbacks of applying geoprocessing functionality in 3D. The scenarios were integrated and visualized in a Web3D Server (W3DS) viewer and demonstrate how useful it is to present the outcomes of such simulations in the third dimension.
An optimal extension of the centerpoint theorem
Authors: Nabil H. Mustafa, Saurabh Ray
Venue: Computational Geometry: Theory and Applications (2009)

We prove an optimal extension of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all convex sets containing more than 47n points of P. We further prove that this bound is tight. We get this bound as part of a more general procedure for finding small number of points hitting convex sets over P, yielding several improvements over previous results.
MultiTouch menu (MTM)
Authors: Gilles Bailly, Alexandre Demeure, Eric Lecolinet, Laurence Nigay
Venue: Proceedings of the 20th International Conference of the Association Francophone d'Interaction Homme-Machine (2008)

This paper describes a new menu technique called MultiTouch Menu, that is especially well suited for multitouch interactive surfaces. In contrast with traditional menu techniques, the MultiTouch menu makes the most of the new capabilities provided by these new interactive devices: instead of only using two degrees of freedom, it makes it possible to use the five fingers of the hand simultaneously for interacting with applications. By providing several interesting properties, such as eyes-free selection or the ability to navigate seamlessly in the hierarchy of commands, MultiTouch menus make it possible to enrich and facilitate interaction on multitouch devices.
Application note: Embedded sensor technology for real time determination of animal lying time
Authors: Matthew Darr, William Epperson
Venue: Computers and Electronics in Agriculture (2009)

Lameness in dairy animals poses an immediate and significant animal welfare and economic concern. A new sensor has been developed to monitor and record the lying patterns of dairy cows in order to benefit the study of lameness. The sensor utilizes an embedded accelerometer to measure the orientation of the hind leg of an animal based on the relative direction of the gravitational field. A microcontroller with nano-watt power technology facilitates sensor sampling, data recording and time stamping, and interfacing with external hardware systems. The interrupt triggered firmware protocol enabled low power consumption and made efficient use of microcontroller's resources. A single measurement axis, oriented with the vertical position of the animal's hind leg, was found to be sufficient in determining lying activity. In repetitive testing on three unique Holstein dairy cows, the layometer sensor recorded 100% of the lying events and had a total difference in lying time of 2.2% when compared to a human observer. It was also shown that unique sensors provided a statistically similar response when applied to the same test animal. The technology presented within this publication is protected under international patent application PCT/US2008/059234.
Designing for elders: exploring the complexity of relationships in later life
Authors: Siân E. Lindley, Richard Harper, Abigail Sellen
Venue: Proceedings of the 22nd British HCI Group Annual Conference on HCI 2008: People and Computers XXII: Culture, Creativity, Interaction - Volume 1 (2008)

We present a review of literature from the fields of gerontology, HCI and human factors, which focus on the nature of family and peer relationships in old age. We find both simplistic, prevailing models of what it means to be old, as well as deeper insights which often belie these models. In addition, we discover that new technologies are often also based on quite simple assumptions, but that their deployment points to a more complex reality. This paper considers a number of perspectives on relationships in later life, critiques the assumptions underscoring them, and presents an alternative view which we believe is more in line with the perspective of elderly people themselves. We end by discussing what this means in terms of designing new technologies for older people.
3D terrain simulation based on OpenGL
Authors: Deng Fang
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

In this paper the principle of fractal theory and fractal brownion motion(FBM) are analyzed in detail. And it also analyses the physical meaning of FBM's two parameters H and σ. The improved Diamond-Square algorithm is discussed in light of fractal interpolation and use it to simulate cloud, two-dimension texture terrain surface and three-dimension terrain. There are many kinds of effect when you change some parameters.
A Semi-Automatic System to Infer Compex 3-D Shapes from Photographs
Authors: Qian Chen, Gerard Medioni
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

We present a semiautomatic image-based modeling system to make 3-D models from photographs. The human aoperator intervenes only for simple and straightforward tasks. The design of the system is movtivated by potential applications where the geometric shapes fo the objects are complex, and the requirement on the appearance of the models is high. Easy to use is another consideration. We use binocular stereo as the basic model recovery tool, and propose a new volumetric matching algorithm that fully explores the spatial coherence between the two iamges. Inaccuate mathces are mostly clustered around the border area between the foreground and the background, thus easy to be manually removed. To make the system more practical, we insist on using uncalibrated cameras. Experimental resuls on different types of real objects are presented.
The growing use of electronic mail by airlines
Authors: James C. Goodlett
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Electronic mail is one of several computer-based applications which is rapidly becoming a fundamental part of business life. Technology has supplied the data processing and communications industries with the necessary tools to enable them to make the transition from the mailman to direct electronic message delivery.
Multiflows in multihop wireless networks
Authors: Peng-Jun Wan
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

This paper studies maximum multicommodity flow and maximum concurrent flow in multihop wireless networks subject to both bandwidth and interference constraints. The existing proof of the NP-hardness of both problems is too contrived to be applicable to meaningful multihop wireless networks. In addition, all known constant-approximation algorithms for both problems restricted to various network classes are super-exponential in running time. Some of them are simply incorrect. In this paper, we first provide a rigorous proof of the NP-hardness of both problems even in very simple settings. Then, we show that both problems restricted to a broad family of multihop wireless networks admit polynomial-time approximation scheme (PTAS). After that, we develop a unified framework for the design and analysis of polynomial approximation algorithms for both problems. Following such framework, we obtain polynomial constant-approximation algorithms for both problems restricted to a broad network family. The approximation ratios of these algorithms are also better than those known in the literature.
A velocity decomposition approach for moving interfaces in viscous fluids
Authors: J. Thomas Beale, Anita T. Layton
Venue: Journal of Computational Physics (2009)

We present a second-order accurate method for computing the coupled motion of a viscous fluid and an elastic material interface with zero thickness. The fluid flow is described by the Navier-Stokes equations, with a singular force due to the stretching of the moving interface. We decompose the velocity into a ''Stokes'' part and a ''regular'' part. The first part is determined by the Stokes equations and the singular interfacial force. The Stokes solution is obtained using the immersed interface method, which gives second-order accurate values by incorporating known jumps for the solution and its derivatives into a finite difference method. The regular part of the velocity is given by the Navier-Stokes equations with a body force resulting from the Stokes part. The regular velocity is obtained using a time-stepping method that combines the semi-Lagrangian method with the backward difference formula. Because the body force is continuous, jump conditions are not necessary. For problems with stiff boundary forces, the decomposition approach can be combined with fractional time-stepping, using a smaller time step to advance the interface quickly by Stokes flow, with the velocity computed using boundary integrals. The small time steps maintain numerical stability, while the overall solution is updated on a larger time step to reduce computational cost.
Social anxiety and computer-mediated communication during initial interactions: Implications for the hyperpersonal perspective
Authors: Andrew C. High, Scott E. Caplan
Venue: Computers in Human Behavior (2009)

The study examined how the reduced nonverbal cues characteristic of computer-mediated communication (CMC) moderated the potentially negative interpersonal outcomes of social anxiety in initial interactions. Hypotheses predicted that CMC would mitigate the extent to which social anxiety caused interpersonal perceptions of anxiety and that CMC would attenuate the negative association between one's social anxiety and one's partner's conversational satisfaction. A sample (N=206) of undergraduate students were paired in unacquainted dyads and then engaged in initial interaction conversations in either a face-to-face (FtF) or CMC context. The researchers measured social anxiety before the conversation and a number of outcomes after the conversation. The results revealed that CMC is a significant contingent condition to the association between social anxiety and one's partner's perception of this anxiety and a contingent condition to the association between social anxiety and one's partner's conversational satisfaction.
Measurement and model of non-ionizing radiation levels in an urban environment
Authors: C. Pérez-Vega, J. M. Zamanillo, L. F. Herran
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

In this paper, we resume the results of electromagnetic radiation measurements performed in the urban environment of the city of Santander, in Spain from radioelectric systems that operate in the area of the city of Santander, in the North of Spain. They include mobile telephony, radio and television broadcasting, police and private communications in the VHF and UHF bands. Four different measuring equipments were used, two of them wideband with isotropic probes and two, narrowband with dipole antennas. Special attention was put in places such as schools and geriatric residences. Furthermore, a wide survey through the urban area of the city was carried out, collecting more than 20,000 samples at street level which were statistically analyzed.
An oscillatory hebbian network model of short-term memory
Authors: Ransom K. Winder, James A. Reggia, Scott A. Weems, Michael F. Bunting
Venue: Neural Computation (2009)

Recurrent neural architectures having oscillatory dynamics use rhythmic network activity to represent patterns stored in short-term memory. Multiple stored patterns can be retained in memory over the same neural substrate because the network's state persistently switches between them. Here we present a simple oscillatory memory that extends the dynamic threshold approach of Horn and Usher (1991) by including weight decay. The modified model is able to match behavioral data from human subjects performing a running memory span task simply by assuming appropriate weight decay rates. The results suggest that simple oscillatory memories incorporating weight decay capture at least some key properties of human short-term memory. We examine the implications of the results for theories about the relative role of interference and decay in forgetting, and hypothesize that adjustments of activity decay rate may be an important aspect of human attentional mechanisms.
Label space reduction in MPLS networks: how much can a single stacked label do?
Authors: Fernando Solano, Thomas Stidsen, Ramon Fabregat, Jose Luis Marzo
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

Most network operators have considered reducing LSR label spaces (number of labels used) as a way of simplifying management of underlaying Virtual Private Networks (VPNs) and therefore reducing operational expenditure (OPEX). The IETF outlined the label merging feature in MPLS-allowing the configuration of MultiPoint-to-Point connections (MP2P)-as a means of reducing label space in LSRs. We found two main drawbacks in this label space reduction scheme: a it should be separately applied to a set of LSPs with the same egress LSR--which decreases the options for better reductions, and b LSRs close to the edge of the network experience a greater label space reduction than those close to the core. The later implies that MP2P connections reduce the number of labels asymmetrically. In this article we propose a solution to these drawbacks achieved by stacking an additional label onto the packet header. We call this type of reduction Asymmetric Merged Tunnels (AMT). A fast framework for computing the optimal reduction using AMTs is proposed. Our simulations show that the label space can be reduced by up to 20% more than when label merging is used.
High resolution long-period grating temperature sensor
Authors: L. H. Chen, C. C. Chan, J. Sun
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

A simple etched and packaged LPG temperature sensor for biomedical application has been developed and resolution of about 0.005&deg;C is achieved, in comparison with conventional thermometer, which only exhibits 0.01&deg;C. The temperature coefficient of the specially packaged LPG sensor is measured to be 3.776nm/&deg;C, which is 15 times higher than that of the bare LPG fiber inscribed in the same PS1250/1500 photosensitive optical fiber.
Fuzzy c-Means Algorithms for Data with Tolerance Using Kernel Functions
Authors: Yuchi Kanzawa, Yasunori Endo, Sadaaki Miyamoto
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, two new clustering algorithms based on fuzzy c-means for data with tolerance using kernel functions are proposed. Kernel functions which map the data from the original space into higher dimensional feature space are introduced into the proposed algorithms. Nonlinear boundary of clusters can be easily found by using the kernel functions. First, two clustering algorithms for data with tolerance are introduced. One is based on standard method and the other is on entropy-based one. Second, the tolerance in feature space is discussed taking account into soft margin algorithm in Support Vector Machine. Third, two objective functions in feature space are shown corresponding to two methods, respectively. Fourth, Karush-Kuhn-Tucker conditions of two objective functions are considered, respectively, and these conditions are re-expressed with kernel functions as the representation of an inner product for mapping from the original pattern space into a higher dimensional feature space. Fifth, two iterative algorithms are proposed for the objective functions, respectively. Through some numerical experiments, the proposed algorithms are discussed.
GPS Positioning Accuracy Estimation Using Cornish-Fisher Expansion
Authors: Song TianLi, Wang ShuNing, An WeiLian
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

In this paper a new statistic approach based on Cornish-Fisher expansion is introduced for efficient evaluation of positioning accuracy of GPS surveying activities. The proposed approach uses the concept of SEP (spherical error probable) to represent positioning accuracy, and employs a set of equations to estimate its potential observation characteristic. Within the utility context of GPS surveying, the positioning accuracy can be influenced by placing receivers on different points during a period of time. The problem is to determine best valuation in varied surveying sessions. Practical data are used to assess the performance of the proposed approaches.
Tisa: Toward Trustworthy Services in a Service-Oriented Architecture
Authors: Hridesh Rajan, Mahantesh Hosamani
Venue: IEEE Transactions on Services Computing (2008)

Verifying whether a service implementation is conforming to its service-level agreements is important to inspire confidence in services in a service-oriented architecture (SoA). Functional agreements can be checked by observing the published interface of the service, but other agreements that are more non-functional in nature, are often verified by deploying a monitor that observes the execution of the service implementation. A problem is that such a monitor must execute in an untrusted environment. Thus, integrity of the results reported by such a monitor crucially depends on its integrity. We contribute an extension of the traditional SoA, based on hardware-based root of trust, that allows clients, brokers and providers to negotiate and validate the integrity of a requirements monitor executing in an untrusted environment. We make two basic claims: first, that it is feasible to realize our approach using existing hardware and software solutions, and second, that integrity verification can be done at a relatively small overhead. To evaluate feasibility, we have realized our approach using current software and hardware solutions. To measure overhead, we have conducted a case study using a collection of web service implementations available with Apache Axis implementation.
A graph theoretic approach to protein structure selection
Authors: Marco Vassura, Luciano Margara, Piero Fariselli, Rita Casadio
Venue: Artificial Intelligence in Medicine (2009)

Objective: Protein structure prediction (PSP) aims to reconstruct the 3D structure of a given protein starting from its primary structure (chain of amino acidic residues). It is a well-known fact that the 3D structure of a protein only depends on its primary structure. PSP is one of the most important and still unsolved problems in computational biology. Protein structure selection (PSS), instead of reconstructing a 3D model for the given chain, aims to select among a given, possibly large, number of 3D structures (called decoys) those that are closer (according to a given notion of distance) to the original (unknown) one. In this paper we address PSS problem using graph theoretic techniques. Methods and materials: Existing methods for solving PSS make use of suitably defined energy functions which heavily rely on the primary structure of the protein and on protein chemistry. In this paper we present a new approach to PSS which does not take advantage of the knowledge of the primary structure of the protein but only depends on the graph theoretic properties of the decoys graphs (vertices represent residues and edges represent pairs of residues whose Euclidean distance is less than or equal to a fixed threshold). Results: Even if our methods only rely on approximate geometric information, experimental results show that some of the adopted graph properties score similarly to energy-based filtering functions in selecting the best decoys. Conclusion: Our results highlight the principal role of geometric information in PSS, setting a new starting point and filtering method for existing energy function-based techniques.
Living interfaces: the intimate door lock
Authors: Miriam Roy, Fabian Hemmert, Reto Wettach
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

In this paper we introduce a new way to interact intimately with an automated system. The Intimate Door Lock investigates the psychological effects of intimate humanhuman interaction being applied to man-machine interfaces. The door lock, in our prototype, is installed at the inside of a domestic front door, and remains locked until given a kiss by its owner. In our prototype, the element to be kissed is a camera-augmented mirror, which we intended to use as a means of lowering the inhibition level. This work is part of a larger series of experiments in the Living Interfaces project, exploring ways in which reduced life-like movements can be beneficial for Human-Machine Interaction.
Finding Stress Patterns in Microprocessor Workloads
Authors: Frederik Vandeputte, Lieven Eeckhout
Venue: Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers (2008)

Power consumption has emerged as a key design concern across the entire computing range, from low-end embedded systems to high-end supercomputers. Understanding the power characteristics of a microprocessor under design requires a careful study using a variety of workloads. These workloads range from benchmarks that represent typical behavior up to hand-tuned stress benchmarks (so called stressmarks) that stress the microprocessor to its extreme power consumption.This paper closes the gap between these two extremes by studying techniques for the automated identification of stress patterns (worst-case application behaviors) in typical workloads. For doing so, we borrow from sampled simulation theory and we provide two key insights. First, although representative sampling is slightly less effective in characterizing average behavior than statistical sampling, it is substantially more effective in finding stress patterns. Second, we find that threshold clustering is a better alternative than k-means clustering, which is typically used in representative sampling, for finding stress patterns. Overall, we can identify extreme energy and power behaviors in microprocessor workloads with a three orders of magnitude speedup with an error of a few percent on average.
Stealing from an ongoing flow
Authors: Scott D. Novich, Ashutosh Sabharwal
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

In this poster, we present a protocol to enable secondary users to harness residual capacity in a frequency band with primary users. The key contribution of the proposed protocol is that it does not require any knowledge of primary network traffic or topology.