ppxscal/embedding_network huggingface dataset:
Virtual relighting of a Roman statue head from Herculaneum: a case study
Authors: Jassim Happa, Mark Williams, Glen Turley, Graeme Earl, Piotr Dubla, Gareth Beale, Greg Gibbons, Kurt Debattista, Alan Chalmers
Venue: Proceedings of the 6th International Conference on Computer Graphics, Virtual Reality, Visualisation and Interaction in Africa (2009)

High-fidelity computer graphics offer the possibility for archaeologists to put excavated cultural heritage artefacts virtually back into their original setting and illumination conditions. This enables hypotheses about the perception of objects and their environments to be investigated in a safe and controlled manner. This paper presents a case study of the pipeline for the acquisition, modelling, rapid prototyping and virtual relighting of a Roman statue head preserved at Herculaneum in Italy. The statue head was excavated in 2006, after having been buried during the eruption of Mount Vesuvius in AD79.
Route optimization in nested mobile networks using binding update for top-level MR
Authors: Parin Sornlertlamvanich, Robert Elz, Sinchai Kamolphiwong
Venue: Proceedings of the 4th Asian Conference on Internet Engineering (2008)

Network Mobility (NEMO) Basic Support protocol is an extension Mobile IPv6. NEMO signaling is performed with extended of Mobile IPv6 messages. NEMO Basic Support protocol is concerned with managing the mobility of an entire network, it provides for devices or vehicles which move to another point of attachment to the Internet. NEMO can maintain sessions established between nodes on the mobile network and the global Internet after the Mobile Router (MR) changes its point of attachment. However, NEMO uses a bi-directional tunnel between the MR and its Home Agent (HA), resulting in a pinball route between 2 nodes. In addition, nested mobile networks will further increase the sub-optimality of routing, causing problems for some application. This proposed solution decreases packet delay, network resource usage and processing delay. Also, the bi-directional tunnel can be avoided, and the level of nesting of mobile networks does not increase packet overhead. This solution only requires modification of the MR.
WIMS 2.0: Converging IMS and Web 2.0. Designing REST APIs for the Exposure of Session-Based IMS Capabilities
Authors: David Lozano, Luis A. Galindo, Luis García
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

This paper presents the WIMS 2.0 initiative, a study on the strategies, technologies and service platforms to be used by telecom operators to achieve the convergence with innovative Web 2.0 services in All-IP networks. After analysing the current situation in the world of IP services, a business model change is recommended through the adoption of a user-centric and open-garden philosophy. IMS is identified as the base platform to construct the convergence and the business model change. The study follows a two-sided approach to achieve the convergence: the open exposure of IMS capabilities towards Web 2.0 services and the use of Web 2.0 services to enrich operators' services. Following this approach, a reference model for the new service architecture, the WIMS 2.0 Services Platform, is also proposed. Focusing on the exposure of IMS capabilities as the main topic, the study recommends that IMS capabilities should be exposed through open Web APIs following a RESTful approach. In this regard, and in contrast to other existing RPC approaches, this paper proposes a design for the exposition of session-based IMS capabilities through REST APIs, more concretely, based on the AtomPub protocol.
On reconciling patches and aspects
Authors: Laurent Burgy, Marc E. Fiuczynski, Marco Yuen, Robert Grimm
Venue: Proceedings of the 8th workshop on Aspects, components, and patterns for infrastructure software (2009)

In previous work, we presented a domain-specific enhancement to C, called C4, that lets developers manage program extensions leveraging techniques inspired by the AOSD model as an alternative to the conventional patch approach [3]. Our goal is to offer: (1) tool compatibility letting programmers develop, integrate, modify, and debug C4-based extensions that preserve their existing development workflow and leverages their existing tools rather than requiring additional tools; (2) code understandability of the C4 syntax such that is it straightforward for an uninitiated C programmer to use immediately; and, (3) runtime performance achieving near-zero overhead such that it can be used even in performance critical execution paths. As such C4 source code can be viewed as the result of weaving in AOSD style introductions and advices inline into C program. However, C4 lacked a proper representation of its unwoven form--i.e., what's conventionally in AOSD circles referred to as the pointcut language. This paper makes a case for B4: a patch-based pointcut representation of unwoven C4 and contrasts it with development-oriented pointcut languages belonging to the AspectC family that have been defined for the C programming language.
Adaptive recurrent neural network control using a structure adaptation algorithm
Authors: Chun-Fei Hsu
Venue: Neural Computing and Applications (2009)

This paper proposes an adaptive recurrent neural network control (ARNNC) system with structure adaptation algorithm for the uncertain nonlinear systems. The developed ARNNC system is composed of a neural controller and a robust controller. The neural controller which uses a self-structuring recurrent neural network (SRNN) is the principal controller, and the robust controller is designed to achieve L 2 tracking performance with desired attenuation level. The SRNN approximator is used to online estimate an ideal tracking controller with the online structuring and parameter learning algorithms. The structure learning possesses the ability of both adding and pruning hidden neurons, and the parameter learning adjusts the interconnection weights of neural network to achieve favorable approximation performance. And, by the L 2 control design technique, the worst effect of approximation error on the tracking error can be attenuated to be less or equal to a specified level. Finally, the proposed ARNNC system with structure adaptation algorithm is applied to control two nonlinear dynamic systems. Simulation results prove that the proposed ARNNC system with structure adaptation algorithm can achieve favorable tracking performance even unknown the control system dynamics function.
An Efficient and Robust Self-Storage P2P Reputation System
Authors: Liming Hao, Songnian Lu, Junhua Tang, Shutang Yang
Venue: International Journal of Distributed Sensor Networks (2009)

For the large scale of the network and unreliable nature of peers in most P2P (Peer-to-Peer) systems, it is a challenging task to implement an efficient and robust P2P reputation system. Self-storage P2P reputation systems provide an efficient way to retrieve rating values. Since each peer locally stores its own rating values given by all other peers, it takes only one query message to collect all the rating values of a peer. However, it also gives the owner control over its rating values. One of the challenges of this type of system is to protect the rating values from being maliciously modified by their owners. In existing self-storage P2P reputation systems, other participants are involved in order to ensure the integrity and reliability of the rating values. However, because at least one participant must be contacted during the rating and rating values retrieval processes, they create a high message overhead when deployed in unstructured P2P systems. In this article, we address the efficiency and robustness of P2P reputation systems in fully distributed environments. We propose an innovative self-storage P2P reputation system. In our system, each peer locally stores its own positive rating values given and signed by other peers. On one hand, since it is not likely for a peer to discard any part of the positive rating values or forge the raters' signatures, the integrity and reliability of the self-storage rating values are preserved. On the other hand, based on the self-storage rating values and our reputation value computing algorithm, one step is enough to rate or obtain the whole positive rating values of a peer without other participants or broadcasting messages. Extensive simulations have been conducted to evaluate the performance of our system. Simulation results show that the message overhead of our system is reduced significantly (4 messages for each transaction) compared with existing self-storage P2P reputation systems, which makes our system a scalable reputation system for handling a large number of P2P services. Our system is also robust to malicious behaviors of peers. Simulation results show that the service selection success ratio is greater than 0.8 even when there are 70% malicious peers. Moreover, when those participants are not reachable in existing self-storage P2P reputation systems, the rating values verification process fails, while in our system, no other peer is involved and this type of threat can be totally avoided.
A Methodology for Mapping SysML Activity Diagram to Time Petri Net for Requirement Validation of Embedded Real-Time Systems with Energy Constraints
Authors: Ermeson Andrade, Paulo Maciel, Gustavo Callou, Bruno Nogueira
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

In this paper we use the Activity diagram of the System Modeling Language (SysML) in combination with the new UML profile for Modeling and Analysis of Real-Time and Embedded systems (MARTE) in order to validate functional, timing and low power requirements in early phases of the embedded system development life-cycle. However, SysML lacks a formal semantics and hence it is not possible to apply, directly, mathematical techniques on SysML models for system validation. Thus, a novel approach for automatic translation of SysML Activity diagram into Time Petri Net with Energy constraints (ETPN) is proposed. In order to depict the practical usability of the proposed method, a case study is presented, namely, pulse-oximeter. Besides, the estimates obtained (execution time and energy consumption) from the model are 95% close to the respective measures obtained from the real hardware platform.
Timing variation-aware task scheduling and binding for MPSoC
Authors: HaNeul Chon, Taewhan Kim
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

This work addresses the new problem of timing variation-aware task scheduling and binding (TSB) for multiprocessor system-on-chip (MPSoC) architecture in the system-level design, where tasks have full flexibilities of resource (i.e., processor) sharing to meet the design constraints. With the timing variation of processors' clock speed, it has been observed that considering the effects of resource sharing on the resulting performance yield computation is critically important for accurate design space exploration and evaluation in the system-level design. Unfortunately previous statistical static timing analysis (SSTA) in the system-level has never considered resource sharing in computing the performance yield, or has overly simplified by employing the gate-level SSTAs. In this work, we overcome those limitations by proposing an effective SSTA technique called TSB-SSTA, which schedules and binds tasks to resources in the presence of resource sharing. We also propose a timing variation-aware (TV) framework, called TSB-TV, tightly integrating TSB-SSTA. We have tested the effectiveness of our approach through experimentation with benchmarks, which showed an average of 56.1% improvement in performance yield over conventional methods.
Heuristic factory planning algorithm for advanced planning and scheduling
Authors: Ling-Chieh Kung, Ching-Chin Chern
Venue: Computers and Operations Research (2009)

This study focuses on solving the factory planning (FP) problem for product structures with multiple final products. In situations in which the capacity of the work center is limited and multiple job stages are sequentially dependent, the algorithm proposed in this study is able to plan all the jobs, while minimizing delay time, cycle time, and advance time. Though mixed integer programming (MIP) is a popular way to solve supply chain factory planning problems, the MIP model becomes insolvable for complex FP problems, due to the time and computer resources required. For this reason, this study proposes a heuristic algorithm, called the heuristic factory planning algorithm (HFPA), to solve the supply chain factory planning problem efficiently and effectively. HFPA first identifies the bottleneck work center and sorts the work centers according to workload, placing the work center with the heaviest workload ahead of the others. HFPA then groups and sorts jobs according to various criteria, for example, dependency on the bottleneck work center, the workload at the bottleneck work center, and the due date. HFPA plans jobs individually in three iterations. First, it plans jobs without preempting, advancing, and/or delaying. Jobs that cannot be scheduled under these conditions are scheduled in the second iteration, which allows preemption. In the final iteration, which allows jobs to be preempted, advanced, and delayed, all the remaining jobs are scheduled. A prototype was constructed and tested to show HFPA's effectiveness and efficiency. This algorithm's power was demonstrated using computational and complexity analysis.
On texture and image interpolation using Markov models
Authors: Shira Nemirovsky, Moshe Porat
Venue: Image Communication (2009)

Markov-type models characterize the correlation among neighboring pixels in an image in many image processing applications. Specifically, a wide-sense Markov model, which is defined in terms of minimum linear mean-square error estimates, is applicable to image restoration, image compression, and texture classification and segmentation. In this work, we address first-order (auto-regressive) wide-sense Markov images with a separable autocorrelation function. We explore the effect of sampling in such images on their statistical features, such as histogram and the autocorrelation function. We show that the first-order wide-sense Markov property is preserved, and use this result to prove that, under mild conditions, the histogram of images that obey this model is invariant under sampling. Furthermore, we develop relations between the statistics of the image and its sampled version, in terms of moments and generating model noise characteristics. Motivated by these results, we propose a new method for texture interpolation, based on an orthogonal decomposition model for textures. In addition, we develop a novel fidelity criterion for texture reconstruction, which is based on the decomposition of an image texture into its deterministic and stochastic components. Experiments with natural texture images, as well as a subjective forced-choice test, demonstrate the advantages of the proposed interpolation method over presently available interpolation methods, both in terms of visual appearance and in terms of our novel fidelity criterion.
APL as a development tool for special-purpose processors
Authors: Samuel Levy, Richard H. Doyle, Ralph M. Heller
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

APL used as a programming language has been implemented in computing systems to provide time-sharing with remote terminals. Since the operative principles guiding the design of APL include simplicity and practicality of application, APL is extremely effective as a development aid for special purpose processors.
The Student's Introduction to MATHEMATICA: A Handbook for Precalculus, Calculus, and Linear Algebra, 2nd edition
Authors: Bruce F. Torrence, Eve A. Torrence
Venue:  (2009)

The unique feature of this compact student's introduction is that it presents concepts in an order that closely follows a standard mathematics curriculum, rather than structure the book along features of the software. As a result, the book provides a brief introduction to those aspects of the Mathematica software program most useful to students. The second edition of this well loved book is completely rewritten for Mathematica 6 including coverage of the new dynamic interface elements, several hundred exercises and a new chapter on programming. This book can be used in a variety of courses, from precalculus to linear algebra. Used as a supplementary text it will aid in bridging the gap between the mathematics in the course and Mathematica. In addition to its course use, this book will serve as an excellent tutorial for those wishing to learn Mathematica and brush up on their mathematics at the same time.
Note: Quasifields of symplectic translation planes
Authors: N. Knarr
Venue: Journal of Combinatorial Theory Series A (2009)

We show that a translation plane is symplectic if and only at least one of its associated quasifields admits a non-degenerate invariant symmetric bilinear form. As an application we prove that a proper desarguesian, Moufang or nearfield plane can never be symplectic. Moreover, we give a purely algebraic characterization of the quasifields which coordinatize symplectic translation planes.
Task-aware virtual machine scheduling for I/O performance.
Authors: Hwanju Kim, Hyeontaek Lim, Jinkyu Jeong, Heeseung Jo, Joonwon Lee
Venue: Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments (2009)

The use of virtualization is progressively accommodating diverse and unpredictable workloads as being adopted in virtual desktop and cloud computing environments. Since a virtual machine monitor lacks knowledge of each virtual machine, the unpredictableness of workloads makes resource allocation difficult. Particularly, virtual machine scheduling has a critical impact on I/O performance in cases where the virtual machine monitor is agnostic about the internal workloads of virtual machines. This paper presents a task-aware virtual machine scheduling mechanism based on inference techniques using gray-box knowledge. The proposed mechanism infers the I/O-boundness of guest-level tasks and correlates incoming events with I/O-bound tasks. With this information, we introduce partial boosting, which is a priority boosting mechanism with task-level granularity, so that an I/O-bound task is selectively scheduled to handle its incoming events promptly. Our technique focuses on improving the performance of I/O-bound tasks within heterogeneous workloads by lightweight mechanisms with complete CPU fairness among virtual machines. All implementation is confined to the virtualization layer based on the Xen virtual machine monitor and the credit scheduler. We evaluate our prototype in terms of I/O performance and CPU fairness over synthetic mixed workloads and realistic applications.
The use of CAI at McDonnell Douglas
Authors: Bernard H. Goddard
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Computer Aided Instruction (CAI) gives you increased productivity and reduced training costs. Increased productivity is imperative in today's economic environment--- people must be trained to perform at top quality levels in order to maintain your high productivity. We have done studies at McDonnell Douglas on training costs with both a control group and a test group using identical course material to find out the training costs involved in a conventional classroom situation and in a CAI presentation. Training time can be reduced with CAI---in some cases as much as 50 percent---over conventional classroom training. CAI will give you increased productivity by training your people better, faster, without social disorder, in their assigned area, on the equipment they're going to use, and by reducing the training costs---both by the method of presentation and the lack of travel involved. 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
Identifying MMORPG bots: a traffic analysis approach
Authors: Kuan-Ta Chen, Jhih-Wei Jiang, Polly Huang, Hao-Hua Chu, Chin-Laung Lei, Wen-Chin Chen
Venue: EURASIP Journal on Advances in Signal Processing (2009)

Massively multiplayer online role playing games (MMORPGs) have become extremely popular among network gamers. Despite their success, one of MMORPG's greatest challenges is the increasing use of game bots, that is, autoplaying game clients. The use of game bots is considered unsportsmanlike and is therefore forbidden. To keep games in order, game police, played by actual human players, often patrol game zones and question suspicious players. This practice, however, is labor-intensive and ineffective. To address this problem, we analyze the traffic generated by human players versus game bots and propose general solutions to identify game bots. Taking Ragnarok Online as our subject, we study the traffic generated by human players and game bots. We find that their traffic is distinguishable by 1) the regularity in the release time of client commands, 2) the trend and magnitude of traffic burstiness in multiple time scales, and 3) the sensitivity to different network conditions. Based on these findings, we propose four strategies and two ensemble schemes to identify bots. Finally, we discuss the robustness of the proposed methods against countermeasures of bot developers, and consider a number of possible ways to manage the increasingly serious bot problem.
Irrational Intelligence: Methods, models, structures and algorithms for processing feelings in computer applications
Authors: Walt Froloff
Venue:  (2008)

Irrational Intelligence offers a breakthrough approach in application of feelings intelligence in computer applications and Internet. Feelings represent our uniqueness, individuality and our humanness whose characteristics and abilities are under utilized in present programming. Irrational Intelligence teaches:How to capture and transfer emotions through an interface How to use feelings in to make incremental functions smarter How to use feelings to bridge devices between languages How to process a diversity of feelings in a computing device How to use feelings in applications to enrich communication How to manage serial or multiple concurrent feelings How to use feelings to simplify complexity in computer game How to use feelings in business and Internet How to use feelings in business apps to maximize transactions How to understand the emotive engine that lies within
The EventTable technique: distributed fiducial markers
Authors: Alissa N. Antle, Nima Motamedi, Karen Tanenbaum, Zhen Lesley Xie
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

The EventTable technique is a tangible object tracking technique implemented on a camera vision based tabletop platform. The technique supports an event-driven -- rather than object centric -- tracking technique. Fiducial markers are distributed between objects. When objects are brought into a proximal or connected relationship, a whole marker is formed and recognized by the tracking system. Thus, rather than tracking each individual object, the system tracks user-driven events that occur when two or more objects are proximal. The technique can be used in addition to individual object tracking and touch tracking. This approach provides a reliable and flexible approach to tabletop object tracking for a wide variety of tabletop activities. We describe three prototype applications to illustrate how the distributed marker technique can be applied. We describe the advantages and limitations of this approach. We conclude with a brief discussion of how the EventTable technique enables a shift in human computer interaction research from an information-centric to an action-centric epistemological view on how users' create meaning.