ppxscal/embedding_network huggingface dataset:
Registration Based on Projective Reconstruction Technique for Augmented Reality Systems
Authors: M. L. Yuan, S. K. Ong, A. Y. C. Nee
Venue: IEEE Transactions on Visualization and Computer Graphics (2005)

In AR systems, registration is one of the most difficult problems currently limiting their application. In this paper, we propose a simple registration method using projective reconstruction. This method consists of two steps: embedding and tracking. Embedding involves specifying four points to build the world coordinate system on which a virtual object will be superimposed. In tracking, a projective reconstruction technique is used to track these four specified points to compute the model view transformation for augmentation. This method is simple, as only four points need to be specified at the embedding stage and the virtual object can then be easily augmented onto a real scene from a video sequence. In addition, it can be extended to a scenario using the projective matrix that has been obtained from previous registration results using the same AR system. The proposed method has three advantages: 1) It is fast because the linear least square method can be used to estimate the related matrix in the algorithm and it is not necessary to calculate the fundamental matrix in the extended case. 2) A virtual object can still be superimposed on a related area even if some parts of the specified area are occluded during the whole process. 3) This method is robust because it remains effective even when not all the reference points are detected during the whole process, as long as at least six pairs of related reference points correspondences can be found. Some experiments have been conducted to validate the performance of the proposed method.
Probability distribution of an integral quadratic functional on the trajectories of a complex-valued Ornstein-Uhlenbeck process
Authors: Yu. P. Virchenko, A. S. Mazmanishvili
Venue: Cybernetics and Systems Analysis (2005)

The local limiting theorem for probability distribution density of random values of an additive quadratic functional over the trajectories of the complex-valued Ornstein-Uhlenbeck process is proved. The additive functional support is extended unlimitedly. A guaranteed estimate of the asymptotic formula derived is given.
Synthesizing multimodal utterances for conversational agents: Research Articles
Authors: Stefan Kopp, Ipke Wachsmuth
Venue: Computer Animation and Virtual Worlds (2004)

Conversational agents are supposed to combine speech with non-verbal modalities for intelligible multimodal utterances. In this paper, we focus on the generation of gesture and speech from XML-based descriptions of their overt form. An incremental production model is presented that combines the synthesis of synchronized gestural, verbal, and facial behaviors with mechanisms for linking them in fluent utterances with natural co-articulation and transition effects. In particular, an efficient kinematic approach for animating hand gestures from shape specifications is presented, which provides fine adaptation to temporal constraints that are imposed by cross-modal synchrony. Copyright &copy; 2004 John Wiley & Sons, Ltd.
An Application of Classification Analysis for Skewed Class Distribution in Therapeutic Drug Monitoring - The Case of Vancomycin
Authors: Jian-Xun Chen, Tsang-Hsiang Cheng, Agnes L. F. Chan, Hue-Yu Wang
Venue: Proceedings of the IDEAS Workshop on Medical Information Systems: The Digital Hospital (2004)

Vancomycin can induce potent adverse side effects if drug concentration is not controlled within a narrow safety range.Therefore, therapeutic drug monitoring (TDM) is followed to adjust dose and help monitor treatment effects.Because TDM are not helpful in patients taking vancomycin for the first time, use it to ensure medication safety has a limitation.This study aimed at using decision tree induction to predict outcomes of vancomycin.Research results demonstrate that the asymmetric distribution among classes in the TDM data would result in prediction deviation.An ideal model with good prediction efficacy could be established by adjusting the ration among outcome classes through "over-sampling for expanding minority data".The prediction model would be helpful in controlling the positive and negative effects of vancomycin treatment, improving care at the patient level and improving costs at the social level.Some interesting decision rules derived from the decision tree were analyzed its clinical meanings.Precious prescription knowledge is thus extracted and accumulated.
A Comparison of MPI and Process Networks
Authors: Thomas M. Parks
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 5 - Volume 06 (2005)

The Message Passing Interface (MPI) is a popular communication library that supports the SIMD model of parallel computing. Process networks (PN), where processes communicate through first-in-first-out channels, support the MIMD model of parallel computing. Java implementations of bothMPI and PN are available. We show that the communication primitives available in MPI, such as send/receive, scatter/gather, and broadcast can be emulated in PN. We present benchmark results comparing the performance of mpiJava and to own pn library.
Using the ACM Technique to Refine Protein Spots in 2DGE Images
Authors: Jeanne Chen, Tung-Shou Chen, Tzu-Hsin Tsai, Hui-Fang Tsai, Mingli Hsieh, Shih-Shan Tang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

For a biologist, accurate protein information on 2DGE images is very important for making decisive diagnostics. The proposed scheme in this paper is to combine a local threshold technique with the ACM technique to enhance detections for protein spots. First, the 2DGE image is normalized with thresholds calculated using Otsuýs algorithm. The normalized image is then transformed into a black-and-white local threshold image where the ACM technique is applied to increase detections for protein spots. With this technique, more lighter-colored protein spots can be detected.
Identifying concepts across languages: a first step towards a corpus-based approach to automatic ontology alignment
Authors: Grace Ngai, Marine Carpuat, Pascale Fung
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

The growing importance of multilingual information retrieval and machine translation has made multilingual ontologies an extremely valuable resource. Since the construction of an ontology from scratch is a very expensive and time consuming undertaking, it is attractive to consider ways of automatically aligning monolingual ontologies, which already exist for many of the world's major languages.
Learnable topic-specific web crawler
Authors: A. Rungsawang, N. Angkawattanawit
Venue: Journal of Network and Computer Applications (2005)

Topic-specific web crawler collects relevant web pages of interested topics from the Internet. There are many previous researches focusing on algorithms of web page crawling. The main purpose of those algorithms is to gather as many relevant web pages as possible, and most of them only detail the approaches of the first crawling. However, no one has ever mentioned some important questions, such as how the crawler performs during the next crawling attempts, can the crawler learn from experience to crawl more relevant web pages in an incremental way, etc. In this paper, we present an algorithm that covers the discussion of both the first and the consecutive crawling. For efficient result of the next crawling, we derive the information of previous crawling attempts to build some knowledge bases: starting URLs, topic keywords and URL prediction. These knowledge bases are used to build the experience of the learnable topic-specific web crawler to produce better result for the next crawling. Preliminary evaluation illustrates that the proposed web crawler can learn from experience to better collect the web pages under interest during the early period of consecutive crawling attempts.
Performance Implications of Periodic Checkpointing on Large-Scale Cluster Systems
Authors: A. J. Oliner, R. K. Sahoo, J. E. Moreira, M. Gupta
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 18 - Volume 19 (2005)

Large-scale systems like BlueGene/L are susceptible to a number of software and hardware failures that can affect system performance. Periodic application checkpointing is a common technique for mitigating the amount of work lost due to job failures, but its effectiveness under realistic circumstances has not been studied. In this paper, we analyze the system-level performance of periodic application checkpointing using parameters similar to those projected for BlueGene/L systems. Our results reflect simulations on a toroidal interconnect architecture, using a real job log from a machine similar to BlueGene/L, and with a real failure distribution from a large-scale cluster. Our simulation studies investigate the impact of parameters such as checkpoint overhead and checkpoint interval on a number of performance metrics, including bounded slowdown, system utilization, and total work lost. The results suggest that periodic checkpointing may not be an effective way to improve the average bounded slowdown or average system utilization metrics, though it reduces the amount of work lost due to failures. We show that overzealous checkpointing with high overhead can amplify the effects of failures. The study also suggests that new metrics and checkpointing techniques may be required to effectively handle job failures on large-scale machines like BlueGene/L.
Enabling rich human-agent interaction for a calendar scheduling agent
Authors: Andrew Faulring, Brad A. Myers
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The RhaiCAL system provides novel visualizations and interaction techniques for interacting with an intelligent agent, with an emphasis on calendar scheduling. After an agent interprets natural language containing meeting information, a user can easily correct mistakes using RhaiCAL's clarification dialogs, which provide the agent with feedback to improve its performance. When an agent proposes actions to take on the user's behalf, it can ask the user to confirm them. RhaiCAL uses novel visualizations to present the proposal to the user and allow them to modify the proposal, and informs the agent of the user's actions in a manner that supports long-term learning of the user's preferences. We have designed a high-level XML-based language that allows an agent to express its questions and proposed actions without mentioning user interface details, and that enables RhaiCAL to generate high-quality user interfaces.
The oddmuse wiki engine
Authors: Brian Tanaka
Venue: Linux Journal (2005)

Get your company or project information organized with a system that lets everyone contribute fixes.
A fine-grained peer sharing technique for delivering large media files over the internet
Authors: Mengkun Yang, Zongming Fei
Venue: Web content caching and distribution: proceedings of the 8th international workshop (2004)

In this paper we propose a fine-grained peer sharing technique for delivering large media files in content distribution networks. The replica servers are divided into groups, and those in the same group cooperate with each other. The key difference of the technique from conventional peer to peer systems is that the unit of peer sharing is not a complete media file, but at a finer granularity, in order to increase the flexibility of replica servers for handling client requests. We design a protocol for peers to exchange the information about available resources with each other, and a scheduling algorithm to coordinate the delivery process from multiple replica servers to a client. Our simulations show that the fine-grained peer sharing approach can reduce the initial latency of clients and the rejection rate of the system significantly over a simple peer sharing method.
Book review: Unix Applications Programming - Mastering the Shell by Ray Swartz (Sams & Co., 1990)
Venue: ACM SIGSMALL/PC Notes (1991)

The book is approximately 400 pages in length exclusive of the appendix. The appendix consists of a set of Bourne Shell quick reference tables, a set of regular expression quick reference tables, a bibliography, and answers to exercises that are introduced in many of the chapters. 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
Multi-View 3D Model Reconstruction: Exploitation of Color Homogeneity in Voxel Mask
Authors: S. S. Wong, K. L. Chan
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This project aims to reconstruct a 3D object model from an image sequence captured by a mobile camera. "Shape-from-Silhouette/Photo-consistency" approach is adopted for the volumetric model reconstruction. To correct the concavity error, a novel voxel mask in 3D space for measuring the color dispersion, instead of using the conventional block matching technique, is proposed to locate the concavity of the object surface. In addition, a new technique for partial surface estimation is implemented to overcome the reconstruction problem due to insufficient texture information or color homogeneity. Finally, a single texture map, which is generated from the original multi-view images, is rendered to the surface model.
Multi-VDD Testing for Analog Circuits
Authors: José Pineda Gyvez, Guido Gronthoud, Rachid Amine
Venue: Journal of Electronic Testing: Theory and Applications (2005)

We present industrial results of a quiescent current testing technique suitable for RF testing. The operational method consists of ramping the power supply and of observing the corresponding quiescent current signatures. When the power supply is swept, all transistors are forced into various regions of operation. This has as advantage that the detection of faults is done for multiple supply voltages and corresponding quiescent currents, enhancing in this form the detectability of faults. We found that this method of structural testing yields fault coverage results comparable to functional RF tests making it a potential and attractive technique for production wafer testing due to its low cost, low testing times and low frequency requirements.
How to make web sites talk together: web service solution
Authors: Hoang Pham Huy, Takahiro Kawamura, Tetsuo Hasegawa
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Integrating web sites to provide more efficient services is a very promising way in the Internet. For example searching house for rent based on train system or preparing a holiday with several constrains such as hotel, air ticket, etc... From resource view point, current web sites in the Internet already provide quite enough information. However, the challenge is these web sites just provide information but do not support any mechanism to exchange them. As a consequence, it is very often that a human user has to take the role to "link" several web sites by browsing each one and get the concrete information. The reason comes from a historical objective. Web sites were developed for human users browsing and so, they do not support any machine-understandable mechanism.Current researches in WWW environment already propose several solutions to make newly web sites become understandable to other web sites so that they can be integrated. However, the question is how to integrate existing web sites to these new one. Evidently, redeveloping all of them is an unacceptable solution. In this paper, we propose a solution of Web Service Gateway to "wrap" existing web sites in Web services. Thus, without any efforts to duplicate the Web sites code, these services inherit all features from the sites while can be enriched with other Web service features like UDDI publishing, semantic describing, etc. This proposal was developed in Toshiba with Web Service Gateway and Wrapper Generator System. By using these systems, several integrated-applications were built and they are also presented and evaluated in this paper.
Design of Survivable Networks: A survey
Authors: Hervé Kerivin, A. Ridha Mahjoub
Venue: Networks (2005)

For the past few decades, combinatorial optimization techniques have been shown to be powerful tools for formulating and solving optimization problems arising from practical situations. In particular, many network design problems have been formulated as combinatorial optimization problems. With the advances of optical technologies and the explosive growth of the Internet, telecommunication networks have seen an important evolution and therefore designing survivable networks has become a major objective for telecommunication operators. Over the past years, much research has been carried out to devise efficient methods for survivable network models, and particularly cutting plane based algorithms. In this paper, we attempt to survey some of these models and the optimization methods used for solving them. &copy; 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 46(1), 1&ndash;21 2005
New Estimators For Efficient GI&#x002F;G&#x002F;1 Simulation
Authors: Chia-Li Wang, Ronald W. Wolff
Venue: Probability in the Engineering and Informational Sciences (2005)

For simulating GI&#x002F;G&#x002F;1 queues, we investigate estimators of stationary delay-in-queue moments that were suggested but not investigated in our recent article and we develop new ones that are even more efficient. Among them are direct spread estimators that are functions of a generated sequence of spread idle periods and are combinations of estimators. We also develop corresponding conditional estimators of equilibrium idle-period moments and delay moments. We show that conditional estimators are the most efficient; in fact, for Poisson arrivals, they are exact. In simulation runs with both Erlang and hyperexponential arrivals, conditional estimators of mean delay are more efficient than a published method that estimates idle-period moments by factors well over 100 and by factors of over 800 to several thousand for estimating stationary delay variance.
Smart laser-scanner for 3D human-machine interface
Authors: Álvaro Cassinelli, Stéphane Perrin, Masatoshi Ishikawa
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The problem of tracking hands and fingers on natural scenes has received much attention using passive acquisition vision systems and computationally intense image processing. We are currently studying a simple active tracking system using a laser diode, steering mirrors, and a single non-imaging detector, which is capable of acquiring three dimensional coordinates in real time without the need of any image processing at all. Essentially, it is a smart rangefinder scanner that instead of continuously scanning over the full field of view restricts its scanning area, on the basis of a real-time analysis of the backscattered signal, to a very narrow window precisely the size of the target. The complexity of the whole setup is equivalent to that of a portable laser-based barcode reader, making the system compatible with wearable computers.
Decentralised application placement
Authors: Colin Low
Venue: Future Generation Computer Systems (2005)

The broadening of the Grid architecture to include commercial as well as scientific workloads raises the possibility of commercial datacentres allocating computational resources on demand. The Utility Datacentre provides a large pool of computational resources that are allocated to service applications on request. When a service application consists of several components, these may be allocated physical computational resources which are distributed across the datacentre. The quality of placement determines how well or badly the application consumes finite global resources, such as bandwidth in the network backbone. This paper examines the placement problem, develops metrics for placement quality, and provides a decentralised approach to improving placement quality based on rounds of resource trading.
The Bubble Bit Technique as Improvement of HDL-Based Quantum Circuits Simulation
Authors: Mihai Udrescu, Lucian Prodan, Mircea Vladutiu
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

When performed on a classical computer, the simulation of quantum circuits is usually an exponential job. The methodology based on Hardware Description Languages is able to isolate the entanglement as source of simulation complexity. However, it was shown that this methodology is not efficient in the presence of total entanglement, and the probability of such a situation grows exponentially with the number of qubits [11]. The bubble bit technique is designed to avoid the entangled representation of the quantum state, thus allowing the HDL structural description of the quantum circuit, which requires polynomial resources for simulation. We provide experimental runtimes, obtained by simulation of quantum arithmetic and Groverýs algorithm circuits, which indicate substantial runtime speedup.
Analyzing Global Dynamics of a Neural Field Model
Authors: Shigeru Kubota, Kazuyuki Aihara
Venue: Neural Processing Letters (2005)

We study global dynamics of the neural field, or a neural network model that represents densely distributed cortical neurons as a spatially continuous field. By analyzing the Lyapunov functional for the neural field with finite and infinite domains, we show that the state in the finite field necessarily converges to a steady solution and that the infinite field cannot have a limit cycle attractor. We also show that the Lyapunov functional of the neural field model can be considered to be a natural extension of the Lyapunov function of the Hopfield model to the continuous field. The result suggests that the two neural systems have, generally, common global dynamics characterized by the intimately related Lyapunov functional/function.
iCheck Series: iCheck Express Microsoft Access 2003, Student Edition, 1 edition
Venue:  (2005)

iCheck Express Access 2003 was written specifically for high school students. It is age-level and interest-level appropriate. Lessons build on previously learned procedures to maximize the learning process. An Annotated Teacher’s Edition provides point of use instruction and helpful teaching strategies for all student skill levels. This book covers Microsoft Office Exam objectives for Access 2003 Specialist. Required skills for the Microsoft Office Specialist Certification program are listed in each lesson and in the Appendix.
Using XML views for improving graphical query specifications
Authors: Kenneth Messa, Bogdan Czejdo, Minoo Dorrani Cahill
Venue: Journal of Computing Sciences in Colleges (2005)

The ability to query information in an ad hoc manner from different XML data sources is becoming crucial. It is generally agreed that XQuery requires extensive training and is generally not appropriate as an ad hoc language for typical end-users. In this paper we describe a graphical interface to assist in specifying XML queries. Our graphical representation is based on the standard, the Unified Modeling Language, which makes our approach more consistent with current modeling trends. We discuss how to describe XML schemas using UML diagrams and then how to specify graphical queries for the corresponding XML documents.
Instant messaging and course diaries
Authors: Matthew M. Burke
Venue: Journal of Computing Sciences in Colleges (2004)

Having students keep a diary in which they are required to reflect on course material is a proven technique for increasing student mastery of a subject. I am interested in the possibility that using instant messaging as the interface for a diary might offer advantages over a hand-written, paper diary. I discuss my initial experiences using an instant messaging diary and outline future plans for this project.