ppxscal/embedding_network huggingface dataset:
Generation of views of TV content using TV viewers' perspectives expressed in live chats on the web
Authors: Hisashi Miyamori, Satoshi Nakamura, Katsumi Tanaka
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

We propose a method of generating views of TV programs based on viewer's perspectives expressed in live chats on the Web. Important scenes in a program and responses by particular viewers can be extracted efficiently by statistically computing and/or recognizing live chat data obtained in sync with the broadcast content. We show that by using the computed results, views can be generated that indicate the momentum of reactions by viewers and scenes of interest to particular viewers whose preferences are similar to those of the viewer, etc. This is a new way of viewing TV content from various perspectives.
QoS Measurement Issues with DAML-QoS Ontology
Authors: Chen Zhou, Liang-Tien Chia, Bu-Sung Lee
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

With the industry's efforts in promoting the use of Web services, a huge number of Web services are being developed for the web. To improve the service provider's competition advantage, it is necessary to support QoS-Aware service discovery mechanism as well as the corresponding measurement system. In this paper we present a QoS measurement framework based on the DAML-QoS Ontology, together with the measurement code generator. The DAML-QoS Ontology is designed to specify QoS constraints for Web services It works as a complement to DAML-S to provide QoS-Aware service discovery. This paper focuses on its measurement framework to check the service provider's runtime compliance with the advertised service level. The code generator helps to generate the measurement code according to the DAMLQoS specification. This Ontology level specification tries to reduce the service's integration complexity and achieve better interoperability, automation and extensibility.
Dynamic reconfiguration with virtual services
Authors: Daniel F. Savarese
Venue:  (2005)

We present a new architecture (virtual services) and accompanying implementation for dynamically adapting and reconfiguring the behavior of network services. Virtual services are a compositional middleware system that transparently interposes itself between a service and a client, overlaying new functionality with configurations of modules organized into processing chains. Virtual services allow programmers and system administrators to extend, modify, and reconfigure dynamically the behavior of existing services for which source code, object code, and administrative control are not available. Virtual service module processing chains are instantiated on a per connection or invocation basis, thereby enabling the reconfiguration of individual connections to a service without affecting other connections to the same service. To validate our architecture, we have implemented a virtual services software development toolkit and middleware server. Our experiments demonstrate that virtual services can modularize concerns that cut across network services. We show that we can reconfigure and enhance the security properties of services implemented as either TCP client-server systems, such as an HTTP server, or as remotely invocable objects, such as a Web service. We demonstrate that virtual services can reconfigure the following security properties and abilities: authentication, access control, secrecy/encryption, connection monitoring, security breach detection, adaptive response to security breaches, concurrent and dynamically mutable implementation of multiple security policies for different clients.
Linking the Business View to Requirements Engineering: Long-Term Product Planning by Roadmapping
Authors: Laura Lehtola, Marjo Kauppinen, Sari Kujala
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Companies moving into the software product business and growing in size face new challenges that cannot be tackled completely with old practices. For example, the future development steps of the off-the-shelf products cannot be negotiated with just one or a few customers any more. This means that practitioners should be able to take aspects such as their company¿s own strategy and available market information more effectively into account in such decision-making. However, usually the company or business unit strategy is so high level that the gap to single requirements documents is far too long. Roadmapping is one technique that companies have used for long-term product planning in order to link the business view to requirements engineering (RE), and to make more business oriented product development decisions. In addition, roadmapping has been used to share a common understanding about the future development steps of products with different stakeholders. However, the application of the technique is not always easy. This paper gives an overview of roadmapping as a technique, and describes lessons learned from one Finnish software product company that has developed and evaluated its own roadmapping processes in their organization.
DSFM fitting of Implied Volatility Surfaces
Authors: Szymon Borak, Matthias Fengler, Wolfgang Hiirdle
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Implied volatility is one of the key issues in modern quantitative finance, since plain vanilla option prices contain vital information for pricing and hedging of exotic and illiquid options. European plain vanilla options are nowadays widely traded, which results in a great amount of highdimensional data especially on an intra day level. The data reveal a degenerated string structure. Dynamic Semiparametric Factor Models (DSFM) are tailored to handle complex, degenerated data and yield low dimensional representations of the implied volatility surface (IVS). We discuss estimation issues of the model and apply it to DAX option prices.
Asynchronous Mediation for Integrating Business and Operational Processes
Authors: Philippe Lalanda, Luc Bellissard, Roland Balter
Venue: IEEE Internet Computing (2006)

Integrating business and operational processes is necessary today to meet the market's increasingly demanding requirements. In particular, it allows rapid decision-making, customized production, and short time-to-market. To address these challenges, the authors built a mediation suite on top of a message-oriented middleware to help develop e-services based on industrial data. This software, based on a domain-specific component model, meets stringent market requirements and is being used in real-life service applications.
Higher order corrections in the approximation of low-dimensional manifolds and the construction of simplified problems with the CSP method
Authors: Mauro Valorani, Dimitris A. Goussis, Francesco Creta, Habib N. Najm
Venue: Journal of Computational Physics (2005)

In systems of stiff Ordinary Differential Equations (ODEs) both fast and slow time scales are encountered. The fast time scales are responsible for the development of low-dimensional manifolds on which the solution moves according to the slow time scales. In this paper, methodologies for constructing highly accurate (i) expressions describing the manifold, and (ii) simplified non-stiff equations governing the slow evolution of the solution on the manifold are developed, according to an iterative procedure proposed in the Computational Singular Perturbation (CSP) method. It is shown that the increasing accuracy achieved with each iteration is directly related to the time rates of change of the CSP vectors spanning the manifold along the solution trajectory. Here, an algorithm is presented which implements these calculations and is validated on the basis of two simple examples.
Advanced statistical Computing for Capacitance Tomography as a Monitoring and Control Tool
Authors: K. Grudzien, A. Romanowski, D. Sankowski, R. G. Aykroyd, R. A. Williams
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Advanced statistical modelling such as Bayesian framework is a powerful methodology and gives great flexibility in terms of physical phenomena modelling. Unfortunately it is usually associated with very time and resource consuming computing. Therefore it was avoided by engineers in the past. Nowadays, rapid development of computer capabilities enables use of such methods. Algorithms reported here are based on Markov chain Monte Carlo (MCMC) methods applied to Bayesian modelling. The important factor is highly iterative approach enabling direct desired parameters estimation, hence omitting the phase of image reconstruction. This property has an important feature of making feasible implementation of automatic industrial process control systems based on process tomography.
A man/machine workload model
Authors: Ronald R. Willis
Venue: ACM SIGSIM Simulation Digest (1976)

The fundamental nature of computer systems is to serve the user. If we wish to evaluate the performance of a computer system, we must therefore seek to characterize its responsiveness to those actions initiated by the user. It is this responsibility that isolates accurate workload distributions as an imperative ingredient in computer systems evaluation, and it is this ingredient that the man/machine workload model addresses.In particular, the model presented here simulates human activity at a terminal in real-time or time-share computer system environments. The use of flowcharts to represent human decision making and a variable language definition capability to code flowchart actions are key to the approach. The techniques described stress automatic and manual verification as well as the ability to accurately represent workloads at the point where workloads originate, the human.With this representative approach, accurate workload generation is a natural outcome. In addition, experience has shown that the man/machine workload model serves to enhance computer system simulation credibility, provide a tradeoff tool for human factors and operations design "what-if" questions, and most importantly, to provide a validation methodology for front-end system design efforts.
On the Feasibility of Optical Circuit Switching for High Performance Computing Systems
Authors: Kevin J. Barker, Alan Benner, Ray Hoare, Adolfy Hoisie, Alex K. Jones, Darren K. Kerbyson, Dan Li, Rami Melhem, Ram Rajamony, Eugen Schenfeld, Shuyi Shao, Craig Stunkel, Peter Walker
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

The interconnect plays a key role in both the cost and performance of large-scale HPC systems. The cost of future high-bandwidth electronic interconnects mushrooms due to expensive optical transceivers needed between electronic switches. We describe a potentially cheaper and more power-efficient approach to building high-performance interconnects.Through empirical analysis of HPC applications, we find that the bulk of inter-processor communication (barring collectives) is bounded in degree and changes very slowly or never. Thus we propose a two-network interconnect: An Optical Circuit Switching (OCS) network handling long-lived bulk data transfers, using optical switches; and a secondary lower-bandwidth Electronic Packet Switching (EPS) network. An OCS could be significantly cheaper, as it uses fewer optical transceivers than an electronic network. Collectives and transient communication packets traverse the electronic network. We present compiler techniques and dynamic run-time policies, using this two-network interconnect. Simulation results show that our approach provides high performance at low cost.
A Document Classification Approach By GA Feature Extraction Based Corner Classification Neural Network
Authors: Weifeng Zhang, Baowen Xu, Zifeng Cui
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

The CC4 neural network is a new type of corner classification training algorithm for three-layered feed forward neural networks. CC4 is now successfully used in meta search engine Anvish. When the documents are almost of the same size, CC4 nerual network is an effective document classification algorithm. However, there is great difference in document sizes in general, and CC4 use the whole dictionary as the space of vector which leads to a lot of documents represented by sparse vectors. This paper brings forward feature extraction based neural network GA-CC4. The method of GA feature extraction will extract the feature items really representing the documents in the document set, which will be constructed as the set of feature items. Based on the set of feature items and combining the document frequency, the document can be represented. By this method, the dimensions representing the documents can be reduced, which can solve the precise problem caused by the different document sizes, and it can also map the scalar features to the Boolean input of the neural network by binary coding, by which the quality of input data of neural network is improved.
Enabling Simulation Interoperability
Authors: Katherine L. Morse, Mike Lightner, Reed Little, Bob Lutz, Roy Scrudder
Venue: Computer (2006)

The High Level Architecture provides a common architecture for distributed modeling and simulation, linking simulations and interfaces to live systems.
Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks
Authors: Ronaldo A. Ferreira, Murali Krishna Ramanathan, Asad Awan, Ananth Grama, Suresh Jagannathan
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

Search is a fundamental service in peer-to-peer (P2P) networks. However, despite numerous research efforts,efficient algorithms for guaranteed location of shared content in unstructured P2P networks are yet to be devised. In this paper, we present a simple but highly effective protocol for object location that gives probabilistic guarantees of finding even rare objects independently of the network topology. The protocol relies on randomized techniques for replication of objects (or their references) and for query propagation. We prove analytically, and demonstrate experimentally, that our scheme provides high probabilistic guarantees of success, while incurring minimal overhead. We quantify the performance of our scheme in terms of network messages, probability of success, and response time. We also evaluate the robustness of our protocol in the presence of node failures (departures). Using simulation, we show that our scheme performs no worse than the best known access-frequency based protocols, without compromising access to rare objects.
Mixed-Reality "Party-Line Night Club" - Synchronization of Networked Avatars and Appliances with Mobile Phone Ringtones: Integrating Java3D and LAN-tap Roomware with J2ME
Authors: Shuhei Ishikawa, Yu Saito, Michael Cohen
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

This article describes research on a mobile interface that allows remote control of electric appliances and avatars rendered on a workstation or personal computer to be synchronized with a mobile phone's ringtone. The interface" implemented with DoJa, one of the profiles of J2ME (Java 2, Micro Edition)" controls electric appliances via a "LANtap," an internet-connected power supply, and controls avatars by changing position parameters and attributes on a mobile phone. In a mobile phone network, delay of transmission frequently occurs because of the interference of radio waves. To synchronize appliances and avatars with a ringtone, our interface sends parameters anticipating the network delay. When a short delay occurs, the interface adjusts the time lag between the avatar and the ringtone automatically; when a long delay occurs, it can be adjusted by pushing the mobile phone's keys. We used a 2.5G (2.5th generation) mobile phone for this research. The interface was able to synchronize networked avatars with a slow tempo ringtone for a short time, but the connection speed was not fast enough for quick real-time synchronization. As a proofof- concept, we deployed such phase-locked musical animation roomware with 3D avatars in a virtual space enhanced by entertainment effects displayed in a real space enhanced by some similar effects.
Synchronization of RFID Readers for Dense RFID Reader Environments
Authors: Kin Seong Leong, Mun Leng Ng, Alfio R. Grasso, Peter H. Cole
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

For a dense RFID reader deployment, such as in warehouse RFID deployment, where hundreds of antennas will be positioned in a building, the interference between all these readers must be studied carefully to avoid severe reader collisions. Strict RFID regulations and standards have been imposed, trying to address the problem of reader collision and also the problem of RFID devices interfering with other devices operating in nearby frequency bands. However, these guidelines and regulations are not entirely friendly for dense RFID reader deployment, in some cases it is not possible to have a feasible RFID system while adhering to these regulations. Hence, this paper proposes the synchronization of RFID readers, to enable successful dense RFID reader deployment. A case study targeted at European operations is presented in this paper to visualise the actual synchronization of RFID readers in real life applications. Some fine-tuning methods are also suggested to further improve the performance of readers in a high reader density population area.
Authentication using multiple communication channels
Authors: Shintaro Mizuno, Kohji Yamada, Kenji Takahashi
Venue: Proceedings of the 2005 workshop on Digital identity management (2005)

We discuss an authentication method using multiple communication channels. This method enables on-line service providers to strongly authenticate their users on a non-trusted communication channel (e.g. using a kiosk PC in an Internet café to access the Internet) via trusted communication channels (e.g. a mobile phone network). For the illustration purpose, we use a commonly available configuration in the current marketplace, in which users access service providers through PCs over the Internet and also have mobile phones with user identification capabilities (e.g. UIM), throughout the paper. The method uses a unique identifier (e.g. UIM, device ID or a digital certificate) on a mobile phone terminal to authenticate users so that the users do not have to input any person-identifiable information or to install devices and/or software on the non-trusted PCs?for the authentication. The authentication is done in the following manner. (1) A user reads a session-id of a communication channel between a service provider and a PC using a barcode reader on a mobile phone terminal and (2) sends the session-id through mutual authenticated secure channel over a mobile phone network to the authentication server and (3) the authentication server matches the session-id and binds the user with the corresponding communication channel to provide service to the PC.Our method can also prevent users to be "phished" by double checking the returned authenticator from the service provider.
An Adaptive Multi-Objective Scheduling Selection Framework for Continuous Query Processing
Authors: Timothy M. Sutherland, Bradford Pielech, Yali Zhu, Luping Ding, Elke A. Rundensteiner
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

Adaptive operator scheduling algorithms for continuous query processing are usually designed to serve a single performance objective, such as minimizing memory usage or maximizing query throughput. We observe that different performance objectives may sometimes conflict with each other. Also due to the dynamic nature of streaming environments, the performance objective may need to change dynamically. Furthermore, the performance specification defined by users may itself be multi-dimensional. Therefore, utilizing a single scheduling algorithm optimized for a single objective is no longer sufficient. In this paper, we propose a novel adaptive scheduling algorithm selection framework named AMoS. It is able to leverage the strengths of existing scheduling algorithms to meet multiple performance objectives. AMoS employs a lightweight learning mechanism to assess the effectiveness of each algorithm. The learned knowledge can be used to select the algorithm that probabilistically has the best chance of improving the performance. In addition, AMoS has the flexibility to add and adapt to new scheduling algorithms, query plans and data sets during execution. Our experimental results show that AMoS significantly outperforms the existing scheduling algorithms with regard to satisfying both uni-objective and multi-objective performance requirements.
An Ultra Low Voltage, Low Power, Fully Integrated VCO for GPS in 90 nm RF-CMOS
Authors: L. Aspemyr, D. Linten
Venue: Analog Integrated Circuits and Signal Processing (2006)

A fully integrated 0.6 V VCO for the GPS L1 band is realized in a 90 nm RF-CMOS process. The purpose of the design is to demonstrate how suitable deep submicron CMOS transistors are for ultra low voltage, low power oscillator design. The VCO operates at 6.3 GHz and a divide-by-four circuit buffer provide the wanted 1575.42 MHz signal. Measured phase noise is for a 0.6 V supply voltage and bias current of 2.6 mA ¿122 dBc/Hz at 1 MHz offset, measured for a 1.58 GHz carrier. The phase noise of the VCO has been measured for different bias point showing good agreement between measured results and theory.
A Mixed Finite Element Method for Elasticity in Three Dimensions
Authors: Scot Adams, Bernardo Cockburn
Venue: Journal of Scientific Computing (2005)

We describe a stable mixed finite element method for linear elasticity in three dimensions.
Distributed Agents Researchers around the World, Unite!
Authors: Olivier Marin, Niek Wijngaards
Venue: IEEE Distributed Systems Online (2005)

In its own blurry kind of way, the agent paradigm comes across as one of those whatever-it-is-I-can-fix-it tools we've all dreamed of. And then, as it should be with such dreams, reality intrudes with a vengeance.
A Fast and Stable Approach for Restoration of Warped Document Images
Authors: Kok Beng Chu, Li Zhang, Yu Zhang, Chew Lim Tan
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

We present a framework for acquiring and restoring images of warped documents to their original planar shapes. Image capturing of warped documents often results in warped images. Most digital restoration approaches make use of 2D image processing methods which are dependent on the content of the images. Some recent work attempts to remove this constraint by working directly on the 3D shape of the warped documents. In our framework, we will improve on this recent approach to make it more efficient and stable. First we capture the warped surface representation through a set of active lighting from a laser range scanner onto the document surface. This gives us an accurate 3D representation of the document shape. Next by using a stick constraint and a stable numerical integrator, we can digitally flatten the 3D model to a planar shape. This simple approach avoids potential instability problem and is fast. Restoration results for a few types of warped documents are demonstrated and a significant improvement over the original images can be observed.