ppxscal/embedding_network huggingface dataset:
A mobile voice communication system in medical setting: love it or hate it?
Authors: Charlotte Tang, Sheelagh Carpendale
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Hospital work coordination and collaboration often requires mobility for acquiring proper information and resources. In turn, the spatial distribution and the mobility of clinicians can curtail the opportunities for effective communications making collaboration difficult. In this situation, a mobile hands-free voice communication system, Vocera, was introduced to enhance communication. It supports quick and impromptu conversations among coworkers for work coordination and collaboration anytime and anywhere. We study this deployment and present our findings concerning the impact of this communication system on the information flow. Our information flow framework's communication strategies help contrast the information processes before and after the deployment of Vocera.
An Abstract Layered Model for Hypermedia Document System
Authors: Ken C. K. Law, Horace H. S. Ip, Fang Wei
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In this paper, we propose a layered model for hypermedia document systems and use this model in the design and implementation of a prototype hypermedia document system. The model consists of three layers: a Runtime Layer (RTL), a Document Description Layer (DOCDL) and a Storage Layer (SRL). The DOCDL contributes to defining the logical structure. It not only constrains the structure of the SRL, but also forms a bridge between the RTL and the SRL. In the DOCDL, an extended Open Document Architecture (ODA) architecture is employed for describing the logical structure of the document. In addition, we present a technique for automatically generating and updating database schema given a document logical structure. For the RTL, the document logical structure is visualized to help users to retrieve information, and as a means for multimedia data capturing. The advantages and benefits of this approach are to allow the design and implementation of hypermedia systems to be automated and much simplified. The approach also caters for the continuous updating the document logical structure such as adding an extra data object. The paper applies the proposed model to the design and implementation of a multimedia document system for medical documents.
On stochastic dynamic programming for solving large-scale planning problems under uncertainty
Authors: M. Pilar Cristobal, Laureano F. Escudero, Juan F. Monge
Venue: Computers and Operations Research (2009)

The stochastic dynamic programming approach outlined here, makes use of the scenario tree in a back-to-front scheme. The multi-period stochastic problems, related to the subtrees whose root nodes are the starting nodes (i.e., scenario groups), are solved at each given stage along the time horizon. Each subproblem considers the effect of the stochasticity of the uncertain parameters from the periods of the given stage, by using curves that estimate the expected future value (EFV) of the objective function. Each subproblem is solved for a set of reference levels of the variables that also have nonzero elements in any of the previous stages besides the given stage. An appropriate sensitivity analysis of the objective function for each reference level of the linking variables allows us to estimate the EFV curves applicable to the scenario groups from the previous stages, until the curves for the first stage have been computed. An application of the scheme to the problem of production planning with logical constraints is presented. The aim of the problem consists of obtaining the planning of tactical production over the scenarios along the time horizon. The expected total cost is minimized to satisfy the product demand. Some computational experience is reported. The proposed approach compares favorably with a state-of-the-art optimization engine in instances on a very large scale. Scope and purpose: For quite some time, we have known that traditional methods of deterministic optimization are not suitable to capture the truly dynamic nature of most real-life problems, in view of the fact that the parameters which represent information concerning the future are uncertain. Many of the problems in planning under uncertainty, have logical constraints that require 0-1 variables in their formulation and can be solved via stochastic integer programming using scenario tree analysis. Given the dimensions of the deterministic equivalent model (DEM) of the stochastic problem, certain decomposition approaches can be considered by exploiting the structure of the models. Traditional decomposition schemes, such as the Benders and Lagrangean approaches, do not appear to provide the solution for large-scale problems (mainly in the cardinality of the scenario tree) in affordable computing effort. In this work, a stochastic dynamic programming approach is suggested, which we feel is particularly suited to exploit the scenario tree structure and, therefore, very amenable to finding solutions to very large-scale DEMs. The pilot case used involves a classical tactical production planning problem, where the structure is not exploited by the proposed approach so that it is generally applicable.
Near Field Communication Network Services
Authors: Jorma Ylinen, Mikko Koskela, Lari Iso-Anttila, Pekka Loula
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

Near Field Communication (NFC) provides means to close-range contactless identification and communication for mobile phones and other devices alike. NFC is a new technology but it is maturing fast as it is being standardized. The first NFC services have mostly been simple applications but with the expansion of NFC technology and its application areas there is an urgent need to move from stand-alone applications to operator driven service creation and delivery model. In this paper we present a new NFC gateway protocol for network driven services. It is designed to allow network based service creation and delivery for operators and lightweight applications for end users. We also demonstrate and evaluate our implementation of the proposed NFC gateway protocol.
Lower bounds for projective designs, cubature formulas and related isometric embeddings
Authors: Yu. I. Lyubich
Venue: European Journal of Combinatorics (2009)

Yudin's lower bound [V.A. Yudin, Lower bounds for spherical designs, Izv. Math. 61 (3) (1997) 673-683] for the spherical designs is generalized to the cubature formulas on the projective spaces over a field , and thus to isometric embeddings with . For large p and in some other situations this result is substantially better than known before.
Information system for sonograph neurological measurements
Authors: Mirek Hrubec, Lačezar Ličev, Radim Farana
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

This paper presents a specialized information system for sonograph neurological measurements and investigation. This system has been developed during the completion of grant project GACR 101/06/0491 supported by the Czech Grant Agency.
Memory-level parallelism aware fetch policies for simultaneous multithreading processors
Authors: Stijn Eyerman, Lieven Eeckhout
Venue: ACM Transactions on Architecture and Code Optimization (TACO) (2009)

A thread executing on a simultaneous multithreading (SMT) processor that experiences a long-latency load will eventually stall while holding execution resources. Existing long-latency load aware SMT fetch policies limit the amount of resources allocated by a stalled thread by identifying long-latency loads and preventing the thread from fetching more instructions&mdash;and in some implementations, instructions beyond the long-latency load are flushed to release allocated resources. This article proposes an SMT fetch policy that takes into account the available memory-level parallelism (MLP) in a thread. The key idea proposed in this article is that in case of an isolated long-latency load (i.e., there is no MLP), the thread should be prevented from allocating additional resources. However, in case multiple independent long-latency loads overlap (i.e., there is MLP), the thread should allocate as many resources as needed in order to fully expose the available MLP. MLP-aware fetch policies achieve better performance for MLP-intensive threads on SMT processors, leading to higher overall system throughput and shorter average turnaround time than previously proposed fetch policies.
A picosecond TDC architecture for multiphase PLLs
Authors: Yifei Luo, Gang Chen, Kuan Zhou
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

This paper presented a time-to-digital converter (TDC) embedded PLL in 3D silicon-on-insulator (SOI) process. The difficulty of tier-to-tier interconnection modeling in 3D process is very critical. The proposed TDC effectively eliminates the phase mismatches introduced by interconnection between different tiers among multiphase clocks in the 3D process. The large process variation presented in the 3D integrated circuits requires digital compensation techniques to accurately control the timing. The TDC structure presented in this paper replaced the traditional long Vernier delay line and achieved a 2ps timing resolution. A feedback structure is implemented into the TDC to eliminate the influence of the PVT variations on the timing resolution. The multiphase PLL frequency is 3.8GHz in this paper. Simulation results show that the clock jitter was decreased from 5.98ps to 3.58ps with the proposed TDC phase calibration circuit which presents a significant decrease of phase mismatches.
Fast, Accurate Creation of Data Validation Formats by End-User Developers
Authors: Chris Scaffidi, Brad Myers, Mary Shaw
Venue: Proceedings of the 2nd International Symposium on End-User Development (2009)

Inputs to web forms often contain typos or other errors. However, existing web form design tools require end-user developers to write regular expressions ("regexps") or even scripts to validate inputs, which is slow and error-prone because of the poor match between common data types and the regexp notation. We present a new technique enabling end-user developers to describe data as a series of constrained parts, and we have incorporated our technique into a prototype tool. Using this tool, end-user developers can create validation code more quickly and accurately than with existing techniques, finding 90% of invalid inputs in a lab study. This study and our evaluation of the technique's generality have motivated several tool improvements, which we have implemented and now evaluate using the Cognitive Dimensions framework.
Current micropump technologies and their biomedical applications
Authors: Farid Amirouche, Yu Zhou, Tom Johnson
Venue: Microsystem Technologies (2009)

This paper briefly reviews recent research and developments of micropump designs with a particular emphasis on mechanical micropumps and summarizes their applications in biomedical fields. A comprehensive description of the actuation schemes, flow directing concepts and liquid chamber configurations for micro pumping is provided with illustrative diagrams. Then, a comparative study of current mechanical micropump designs highlighting their advantages and limitations for various applications is presented, based on performance criteria such as actuation voltage and power consumption, ranges of operating frequency and maximum flow rate and backpressure. This study compiles and provides some basic guidelines for selection of the actuation schemes and flow rate requirements in biomedical applications. Different micropumps in biomedical applications, such as blood transport and drug delivery also have been reviewed.
The Method for a Summarization of Product Reviews Using the User's Opinion
Authors: Jung-Yeon Yang, Jaeseok Myung, Sang-goo Lee
Venue: Proceedings of the 2009 International Conference on Information, Process, and Knowledge Management (2009)

As the number of transactions in E-market places is growing, more and more product information and product reviews are posted on the Internet. Because customers want to purchase good products, product reviews became most important information. But, because of the massive volume of reviews, customers can’t read all reviews. In order to solve this problem, a lot of research is being carried out in Opinion Mining. Through the Opinion Mining, we can know about contents of whole product reviews. Traditionally research on Natural Language Processing was applied to the Opinion Mining area in early stage. Recently, the computational statistics are applied to handle massive volume of reviews. In this research, we suggest a method for summarization of product reviews using the user’s opinion, feature occurrences, and the rate of review in order to improve the performance of existing methods. With this method, we can handle massive volumes of reviews in a short time efficiently. We guarantee the correctness of the review summary by finding out the semantic meaning of reviews. Besides, we show these advantages through some experiments.
Collaborative approach to network behaviour analysis based on hardware-accelerated FlowMon probes
Authors: Martin Rehak, Michal Pechoucek, Martin Grill, Karel Bartos, Vojtech Krmicek, Pavel Celeda
Venue: International Journal of Electronic Security and Digital Forensics (2009)

Network behaviour analysis techniques are designed to detect intrusions and other undesirable behaviour in computer networks by analysing the traffic statistics. We present an efficient framework for integration of anomaly detection algorithms working on the identical input data. This framework is based on high-speed network traffic acquisition subsystem and on trust modelling, a well-established set of techniques from the multi-agent system field. Trust-based integration of algorithms results in classification with lower error rate, especially in terms of false positives. The presented system is suitable for both online and offline processing, and introduces a relatively low computational overhead compared to deployment of isolated anomaly detection algorithms.
Scene adaptive MPEG encoding algorithm using the P-picture-based analysis
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Abstract: Presents a novel scene-adaptive MPEG encoding algorithm using parameters encoded in P-pictures. In the MPEG format, a P-picture can have two types of macroblock: intra-coded macroblocks and forward-predicted macroblocks. The proposed algorithm defines a correlation function based on the number of different types of macroblocks and applies this function to detect scene changes in the video sequence. The frame type is then adaptively arranged according to the detection result. Because of motion compensation, the scene change detection is very reliable. Since all the encoded parameters are available during the encoding process, only minimal additional computation is needed. Therefore, this algorithm is faster and more accurate than those approaches using histogram matching.
Bounded-degree spanning tree problems: models and new algorithms
Authors: R. Cerulli, M. Gentili, A. Iossa
Venue: Computational Optimization and Applications (2009)

Given a connected graph G, a vertex v of G is said to be a branch vertex if its degree is greater than 2. We consider two problems arising in the context of optical networks: Finding a spanning tree of G with the minimum number of branch vertices and Finding a spanning tree of G such that the degree sum of the branch vertices is minimized. For these NP-hard problems, heuristics, that give good quality solutions, do not exist in the literature. In this paper we analyze the relation between the problems, provide a single commodity flow formulation to solve the problems by means of a solver and develop different heuristic strategies to compute feasible solutions that are compared with the exact ones. Our extensive computational results show the algorithms to be very fast and effective.
Real-time elliptical head contour detection under arbitrary pose and wide distance range
Authors: Wei Zou, Yuan Li, Kui Yuan, De Xu
Venue: Journal of Visual Communication and Image Representation (2009)

In this paper, we propose a real time elliptical head contour detection method based on quadrant arcs, which is efficient and robust to arbitrary head pose and wide distance range. First, the moving object area is detected according to background model which is built on three color channels. Then, all the valid elliptical arcs are extracted out from connected edges, and classified into four kinds of quadrant arc sets according to their gradient information. Finally, the arcs lying in different sets are combined to fit out the elliptical head contour based on the least square method. Experimental results confirm the robustness and the accuracy of this method under arbitrary head pose and wider distance range, as well as the real time property, strong robustness to long or short hair and with or without hat.
Detection of artery section area using artificial immune system algorithm
Authors: Kamil Riha, Peng Chen, Dongmei Fu
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

This article presents the complete chain of a method for the detection of artery section area in its perpendicular cut. The main components of the complete method are the Hough transformation for the detection of initial circle parameters and the method of discrimination-based artificial immune system for the classification of pixels located inside and outside of the artery. The source image for this processing procedure is an ultrasound B-mode picture. The main goal of this work is to find the curve of the heart cycle of blood pressure in an ultrasound video-sequence which contains a short sample (a few seconds) of pulsating geometric dimensions of the carotis comunis artery in time.
Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware
Authors: Nalini Venkatasubramanian
Venue: Middleware Conference (2007)

Nowadays, middleware technologies are the main infrastructure to support the development and execution of distributed systems, providing design abstractions, programming models and tools, frameworks, protocols, deployment mechanisms, and runtime services. Due to its broad scope, middleware research encompasses different research areas, such as distributed systems, operating systems, networking, multimedia systems, databases, programming languages, and software engineering. This volume contains the proceedings of the Eighth Middleware Conference, held in Newport Beach, California, USA, November 26--30, 2007. Middleware is a series of conferences that started in 1998 with the aim of being the premier conference on middleware research and technology, where researchers from academia and industry can present and discuss the latest middleware results. The focus of the conference is the design, implementation, deployment, and evaluation of distributed systems platforms and architectures for future computing environments. This year, we had 108 submissions from 25 different countries, among which the top 22 papers were selected for inclusion in the technical program of the conference. All papers were evaluated by at least three reviewers with respect to their originality, technical merit, presentation quality, and relevance to the conference themes. The selected papers present the latest results and breakthroughs on middleware research in areas including peer-to-peer computing, event-based and publish/subscribe architectures, mobile and ubiquitous systems, grid and cluster computing, sensor networks, component- and Web-based middleware, virtual machines, adaptive and autonomic systems, communication protocols and architectures, scalability, fault-tolerance, quality-of-service, resource management, multimedia streaming, and novel development paradigms and tools. Middleware 2007 also featured an Experience Papers session, which consisted of papers with focus on applications and experience from the use of middleware. From the research paper submissions, four papers were invited to be presented in this session. Another eight papers were recommended for inclusion in the conference's Work-in-Progress Papers program. Apart from the papers, the program included seven workshops, a doctoral symposium, invited talks, poster and demo presentations, and panels. We hope that the attendees enjoyed this year's Middleware Conference, gained new knowledge and insights from our program, participated in the presentations and discussions, and met others working on projects similar to theirs.
On the use of memory and resources in minority games
Authors: Ricardo M. Araujo, Luis C. Lamb
Venue: ACM Transactions on Autonomous and Adaptive Systems (TAAS) (2009)

The use of resources in multiagent learning systems is a relevant research problem, with a number of applications in resource allocation, communication and synchronization. Multiagent distributed resource allocation requires that agents act on limited, localized information with minimum communication overhead in order to optimize the distribution of available resources. When requirements and constraints are dynamic, learning agents may be needed to allow for adaptation. One way of accomplishing learning is to observe past outcomes, using such information to improve future decisions. When limits in agents' memory or observation capabilities are assumed, one must decide on how large should the observation window be. We investigate how this decision influences both agents' and system's performance in the context of a special class of distributed resource allocation problems, namely dispersion games. We show by using several numerical experiments over a specific dispersion game (the Minority Game) that in such scenario an agent's performance is non-monotonically correlated with her memory size when all other agents are kept unchanged. We then provide an information-theoretic explanation for the observed behaviors, showing that a downward causation effect takes place.
An improved time-adaptive self-organizing map for high-speed shape modeling
Authors: Mohammad Izadi, Reza Safabakhsh
Venue: Pattern Recognition (2009)

In this paper, an improved active contour model based on the time-adaptive self-organizing map with a high convergence speed and low computational complexity is proposed. For this purpose, the active contour model based on the original time-adaptive self-organizing map is modified in two ways: adaptation of the speed parameter and reduction of the number of neurons. By adapting the speed parameter, the neuron motion speed is determined based on the distance of each neuron from the shape boundary which results in an increase in the speed of convergence of the contour. Using a smaller number of neurons, the computational complexity is reduced. To achieve this, the number of neurons used in the contour is determined based on the boundary curvature. The proposed model is studied and compared with the original time-adaptive self-organizing map. Both models are used in several experiments including a tracking application. Results reveal the higher speed and very good performance of the proposed model for real-time applications.