ppxscal/embedding_network huggingface dataset:
TypeRight: a keyboard with tactile error prevention
Authors: Alexander Hoffmann, Daniel Spelmezan, Jan Borchers
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

TypeRight is a new tactile input device for text entry. It combines the advantages of tactile feedback with error prevention methods of word processors. TypeRight extends the standard keyboard so that the resistance to press each key becomes dynamically adjustable through software. Before each keystroke, the resistance of keys that would lead to a typing error according to dictionary and grammar rules is increased momentarily to make them harder to press, thus avoiding typing errors rather than indicating them after the fact. Two user studies showed that TypeRight decreases error correction rates by an average of 46%.
Brief paper: Backstepping controller design for a class of stochastic nonlinear systems with Markovian switching
Authors: Zhao-Jing Wu, Xue-Jun Xie, Peng Shi, Yuan-qing Xia
Venue: Automatica (Journal of IFAC) (2009)

A more general class of stochastic nonlinear systems with irreducible homogenous Markovian switching are considered in this paper. As preliminaries, the stability criteria and the existence theorem of strong solutions are first presented by using the inequality of mathematic expectation of a Lyapunov function. The state-feedback controller is designed by regarding Markovian switching as constant such that the closed-loop system has a unique solution, and the equilibrium is asymptotically stable in probability in the large. The output-feedback controller is designed based on a quadratic-plus-quartic-form Lyapunov function such that the closed-loop system has a unique solution with the equilibrium being asymptotically stable in probability in the large in the unbiased case and has a unique bounded-in-probability solution in the biased case.
Growth and characterization of ZnO nanowires on p-type GaN
Authors: I. C. Robin, M. Lafossas, J. Garcia, M. Rosina, E. Latu-Romain, P. Ferret, P. Gilet, A. Tchelnokov, M. Azize, J. Eymery, G. Feuillet
Venue: Microelectronics Journal (2009)

ZnO nanowires were grown by catalyst-free metal-organic vapour-phase epitaxy on top of a p-type GaN buffer. The optical properties of the ZnO nanowires were investigated by temperature-dependent and time-resolved photoluminescence and compared to those of ZnO nanowires directly grown on sapphire. The luminescence intensity decrease with temperature of the nanowires grown on GaN reveals an original behavior since it is constant over 120K, showing the existence of strong localization centers. In addition, the temperature-dependent decay time measurements indicate a lower density of non-radiative channels for the nanowires grown on GaN.
The ARM Cortex-A8 Microprocessor IEEE Std 1500 Wrapper
Authors: Teresa McLaurin, Stylianos Diamantidis, Iraklis Diamantidis
Venue: IEEE Design Test (2009)

This article describes the test wrapper implementation of a popular embedded microprocessor, along with an automated approach for verifying the wrapper's compliance to the standard.
Monetary Policy Rule in Transitional China: A Selection Based on the Result of Simulation
Authors: Li Li, Liu Yang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Abstract: By using the quarterly data of 1996-2005 in China, this paper evaluates the usefulness of a monetary policy rule designed for developed economies. Drawing on our econometric analysis, we argue that the model comes closer to the data of China ,it is an ideal framework for chinese monetary policy analysis. The paper also suggests to make modifications of the typical policy rule to explain Chinese economy better.
Data placement for scientific applications in distributed environments
Authors: Ann Chervenak, Ewa Deelman, Miron Livny, Mei-Hui Su, Rob Schuler, Shishir Bharathi, Gaurang Mehta, Karan Vahi
Venue: Proceedings of the 8th IEEE/ACM International Conference on Grid Computing (2007)

Scientific applications often perform complex computational analyses that consume and produce large data sets. We are concerned with data placement policies that distribute data in ways that are advantageous for application execution, for example, by placing data sets so that they may be staged into or out of computations efficiently or by replicating them for improved performance and reliability. In particular, we propose to study the relationship between data placement services and workflow management systems. In this paper, we explore the interactions between two services used in large-scale science today. We evaluate the benefits of prestaging data using the Data Replication Service versus using the native data stage-in mechanisms of the Pegasus workflow management system. We use the astronomy application, Montage, for our experiments and modify it to study the effect of input data size on the benefits of data prestaging. As the size of input data sets increases, prestaging using a data placement service can significantly improve the performance of the overall analysis.
Computer-aided prognosis of neuroblastoma on whole-slide images: Classification of stromal development
Authors: O. Sertel, J. Kong, H. Shimada, U. V. Catalyurek, J. H. Saltz, M. N. Gurcan
Venue: Pattern Recognition (2009)

We are developing a computer-aided prognosis system for neuroblastoma (NB), a cancer of the nervous system and one of the most malignant tumors affecting children. Histopathological examination is an important stage for further treatment planning in routine clinical diagnosis of NB. According to the International Neuroblastoma Pathology Classification (the Shimada system), NB patients are classified into favorable and unfavorable histology based on the tissue morphology. In this study, we propose an image analysis system that operates on digitized H&E stained whole-slide NB tissue samples and classifies each slide as either stroma-rich or stroma-poor based on the degree of Schwannian stromal development. Our statistical framework performs the classification based on texture features extracted using co-occurrence statistics and local binary patterns. Due to the high resolution of digitized whole-slide images, we propose a multi-resolution approach that mimics the evaluation of a pathologist such that the image analysis starts from the lowest resolution and switches to higher resolutions when necessary. We employ an offline feature selection step, which determines the most discriminative features at each resolution level during the training step. A modified k-nearest neighbor classifier is used to determine the confidence level of the classification to make the decision at a particular resolution level. The proposed approach was independently tested on 43 whole-slide samples and provided an overall classification accuracy of 88.4%.
Beyond vacuity: towards the strongest passing formula
Authors: Hana Chockler, Arie Gurfinkel, Ofer Strichman
Venue: Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design (2008)

Given an LTL formula &phi; in negation normal form, it can be strengthened by replacing some of its literals with FALSE. Given such a formula and a model M that satisfies it, vacuity and mutual vacuity attempt to find one or a maximal set of literals, respectively, with which &phi; can be strengthened while still being satisfied by M. We study the problem of finding the strongest LTL formula that satisfies M and is in the Boolean closure of strengthened versions of &phi; as defined above. This formula is stronger or equally strong to any formula that can be obtained by vacuity and mutual vacuity. We present our algorithms in the framework of lattice automata.
Distortion Optimized Mobile Multiparty Video Conferencing
Authors: Li Xin, Guan Jianfeng, Zhang Hongke
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

This paper focuses on concurrent real-time multimedia group communication in wireless environment and proposes a video conferencing system to support multiparty streaming video communication on mobile devices. The proposed solution extends Session Initiation Protocol (SIP) to support multicast session negotiation and uses mobile multicast in IP layer for media data distribution. Since wireless network access is shared by multiple video streams, efficient utilization of wireless bandwidth on mobile device is important, especially for real-time video conferencing application with high data rate and stringent delay requirements. In this paper, the rate allocation among multiple group sessions is considered as an optimization problem with the constraints of video quality and wireless link capacity. The proposed rate allocation benefits from lowering bandwidth cost while network degradation is detected and hereby avoids network congestion. The performance of the proposed solution is evaluated in NS-2; the simulation result shows that our scheme can reduce the average packet loss ratio and improve the overall video quality in mobile multiparty video conference.
M3: multi-modal interface in multi-display environment for multi-users
Authors: Satoshi Sakurai, Tokuo Yamaguchi, Yoshifumi Kitamura, Yuichi Itoh, Ryo Fukazawa, Fumio Kishino, Miguel A. Nacenta, Sriram Subramanian
Venue: ACM SIGGRAPH ASIA 2008 artgallery: emerging technologies (2008)

A sophisticated and intuitive interface for multi-display environments where the displays are stitched seamlessly and dynamically according to the users' viewpoints.
Content and semantic context based image retrieval for medical image grid
Authors: Hai Jin, Aobing Sun, Ran Zheng, Ruhan He, Qin Zhang, Yingjie Shi, Wen Yang
Venue: Proceedings of the 8th IEEE/ACM International Conference on Grid Computing (2007)

Physicians create Medical Image Libraries (MILs) to collect typical case images, and utilize CBIR (Content-based Image Retrieval) tools to search feature-similar samples within them to aid clinical intervention and diagnoses. This paper presents a CSBIR (Content and Semantic Context based Image Retrieval) scheme for MedImGrid (Medical Image Grid) to tackle the sharing difficulties of special and heterogeneous MILs within wide areas. The scheme encapsulates distributed CBIR engines, MILs and their metadata as WS (Web Services), and links them in the grid environment. It combines CBIR and semantic context of images to automatically choose the optimal WS set to serve users. Our integrated-features based CSBIR engine for thorax CR (Computer Radiology Image) is related as one instance, which can merge the superiorities of randomly selected CBIR services. MedImGrid CSBIR prototype is based on CGSP (China Grid Supporting Platform) and its loosely coupled structure makes the integration of decentralized CBIR systems within or acros hospitals more efficiently.
Differential Capacitance Analysis
Authors: Marco Bucci, Raimondo Luzzi, Giuseppe Scotti, Andrea Simonetti, Alessandro Trifiletti
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

This paper proposes a new kind of side-channel attack where the correlation between processed data and total capacitance seen looking into the power supply pin of a cryptographic device is exploited. The attack is introduced and advantages and drawbacks with respect to the well-known power analysis are discussed.The attack implementation and experimental results attacking a static CMOS implementation of a 8051 microprocessor core are provided and a comparison between the proposed technique and power analysis is carried out. The obtained results are promising and future activities are planned to assess the performance of this new side-channel analysis when attacking secure implementations.
Optical wireless modem for office communication
Authors: Takatoshi Minami, Kenjiro Yano, Takashi Touge, Hisashi Morikawa, Osamu Takahashi
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

A novel type of optical wireless modem, suitable for office communication, is described. Two types of modems, satellite and terminal, each of which consists of head and body, have been developed. The satellite head is usually attached to a ceiling or wall, and the terminal is placed adjacent to a data terminal. The full-duplex mode of data transmission up to 19.2 kbit/s, with the error rate less than 10-6, is realized between the satellite and the terminal which is placed anywhere in the service area of 10 m radius around the satellite head under the fluorescent light. In this paper, the configurations, specifications, main design features and performances of the modem are described. Some applications are also discussed.
Handling Multiple Bottlenecks, Service Differentiation, and Demand Uncertainty in Media on Demand Infrastructures
Authors: Thomas Setzer
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

This paper introduces admission control models for accepting or denying requests to differentiated media streaming services to avoid overload and to use multiple scarce server resources efficiently. The decision models are based on deterministic and stochastic mathematical programming techniques and use a number of heuristics to determine model parameters at run-time. In contrast to existing admission control approaches, the models address the problem of allocating multiple scarce resources, allow for fine grained service differentiation, and for adaptive admission control as demand forecasts are updated on every incoming service request and feedback is used regarding current resource utilization levels to dynamically adjust admission control policies. Experiments are described to illustrate the benefits of using the adaptive admission control models over static admission control rules.
Photogeist: an augmented reality photography game
Authors: Cody Watts, Ehud Sharlin
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

In this paper, we present Photogeist, a photography-based augmented reality game in which players use a physical handheld camera device to take pictures of floating virtual ghosts. Players must creep, sneak, and maneuver themselves through physical space in order to approach their ghostly subjects and snap a picture using their paranormal camera. In this paper, we describe Photogeist's inspiration, design, implementation and resultant gameplay. A brief discussion of related games is also included.
A Global Terminal Adaptive Synchronization for the Modified Chua's Circuits with Input Uncertainties and Unknown Parameters
Authors: Jinhua Wu, Junwei Lei, Jinyong Yu
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

A global terminal adaptive controller is designed for the modified Chua’s circuits with iuput uncertainties and unknown parameters, and the synchronization is achieved in finite time by adopting the concept of global terminal control. It can be concluded that the synchronization can achieved successfully with the assumption that the sign of uncertain parameter of input is known. And the parameters can be estimated accurately when the number of parameters satisfies some conditions, otherwise the synchronization can achieved but the parameters can’t be estimated effectively. At last, the numerical simulation shows the effectiveness of this proposed method and the conclusions.
An improved SCIM-based service invocation mechanism for integrated services in IMS
Authors: Yu-mei Wang, Kai Yang, Rong-juan Li, Lin Zhang
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

This Paper firstly introduces the concepts of service capability and integrated service in IMS (IP Multimedia Subsystem). Then we propose a service invocation mechanism for integrated services in IMS based on the service composition entity SCIM (Service Capability Interaction Manager) as well as the service invocation mechanism of Initial Filter Criteria (iFC) specified by 3GPP. In order to achieve the service composition function of this mechanism, we give the specific definition of Core Service Capability and Auxiliary Service Capability that compose an integrated service, and propose to add an extended SIP (Session Initiation Protocol) header called "Serv-ID" to SIP messages, which enables service capabilities to tell SCIM their identities effectively to match the service triggering criteria. In the last part of the paper, we elaborate how the mechanism works and how the iFC plays its role in the mechanism through an example of triggering the Multimedia Message integrated service.
Universal augmentation schemes for network navigability
Authors: Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, Zvi Lotker
Venue: Theoretical Computer Science (2009)

Augmented graphs were introduced for the purpose of analyzing the ''six degrees of separation between individuals'' observed experimentally by the sociologist Standley Milgram in the 60's. We define an augmented graph as a pair (G,M) where G is an n-node graph with nodes labeled in {1,...,n}, and M is an nxn stochastic matrix. Every node u@?V(G) is given an extra link, called a long range link, pointing to some node v, called the long range contact of u. The head v of this link is chosen at random by Pr{u->v}=M"u","v. In augmented graphs, greedy routing is the oblivious routing process in which every intermediate node chooses from among all its neighbors (including its long range contact) the one that is closest to the target according to the distance measured in the underlying graph G, and forwards to it. The best augmentation scheme known so far ensures that, for any n-node graph G, greedy routing performs in O(n) expected number of steps. Our main result is the design of an augmentation scheme that overcomes the O(n) barrier. Precisely, we prove that for any n-node graph G whose nodes are arbitrarily labeled in {1,...,n}, there exists a stochastic matrix M such that greedy routing in (G,M) performs in O@?(n^1^/^3), where the O@? notation ignores the polylogarithmic factors. We prove additional results when the stochastic matrix M is universal to all graphs. In particular, we prove that the O(n) barrier can still be overcame for large graph classes even if the matrix M is universal. This however requires an appropriate labeling of the nodes. If the node labeling is arbitrary, then we prove that the O(n) barrier cannot be overcome with universal matrices.
Computer science education at private colleges and universities
Authors: Antonio M. Lopez,  Jr., James W. McGuffee, Jim Purser, Jay-Evan J. Tevis
Venue: Journal of Computing Sciences in Colleges (2009)

The goal of this panel will be to discuss the various ways that computer science education may be implemented at a private college or university. This will include a discussion of how the mission of each school affects the computer science educational experience for students that attend these schools.
A note on locally bounded L-topological vector spaces
Authors: Hua-Peng Zhang, Jin-Xuan Fang
Venue: Information Sciences: an International Journal (2009)

In this note, we give a counterexample showing that Theorem 5 in [C.-H. Yan, J.-X. Fang, Locally bounded L-topological vector spaces, Information Sciences 159 (2004) 273-281] is incorrect and offer a modified version of this theorem.
Fair Round-Robin: A Low Complexity Packet Schduler with Proportional and Worst-Case Fairness
Authors: Xin Yuan, Zhenhai Duan
Venue: IEEE Transactions on Computers (2009)

Round robin based packet schedulers generally have a low complexity and provide long-term fairness. The main limitation of such schemes is that they do not support short-term fairness. In this paper, we propose a new low complexity round robin scheduler, called Fair Round Robin (FRR), that overcomes this limitation. FRR has similar complexity and long-term fairness properties as the stratified round robin scheduler, a recently proposed scheme that arguably provides the best quality-of-service properties among all existing round robin based low complexity packet schedulers. FRR offers better short-term fairness than stratified round robin and other existing round robin schedulers.
The Moment
Authors: Verena Fels
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

The moment of enlightment sometimes comes unexpectedly ...
Preemptive scheduling in the presence of transportation times
Authors: Mourad Boudhar, Amina Haned
Venue: Computers and Operations Research (2009)

In this paper, we consider the problem of scheduling n independent jobs preemptively on m identical parallel machines, to minimize the total completion time (makespan). Each job J"i (i=1,n@?) has a processing time p"i and the transportation of an interrupted job from a machine M"j to another machine M"j"^"' requires d"j"j"^"' units of time. We propose a linear programming formulation in real and binary decision variables and we prove that the problem is NP-hard. Some subproblems are analyzed and solved by polynomial algorithms. Finally we present some heuristics and give some lower bounds of the makespan.
An adaptive security model using agent-oriented MDA
Authors: Liang Xiao
Venue: Information and Software Technology (2009)

Model-driven architecture (MDA) supports model-centred software development via successive model transformation. In MDA, the reusability of models is improved as well as the traceability of requirements. Agent-oriented model-driven architecture (AMDA) associates adaptive agents with a business-oriented interaction model and lets agents dynamically interpret their behaviour from the continuously maintained model via which the current business needs are deployed at runtime. The continuous re-interpretation rather than discrete re-transformation of models means immediate requirements deployment after re-configuration, no system down time being required to affect changes and results in a development process that is oriented to business experts rather than developers. Adopting the adaptive agent model, an AMDA paradigm, we put forward a security-aware model-driven mechanism by using an extension of the role-based access control (RBAC) model. For this purpose, the concept of agent role proposed in agent-oriented software engineering (AOSE) is integrated with the one proposed in RBAC. Agent duties are specified in an interaction model and describe the roles that agents can play to fulfil their functional responsibilities. Agent rights are specified in a security policy rule model attached to the interaction model and describe constraints upon agent capabilities caused by their associated social roles. The role-based interaction and policy-driven model incorporates both agent rights and duties. Hence, functional requirements and non-functional security constraint requirements are put together, related by the concept of role. Consequently, agents can continuously use the re-configurable model to play their roles in order to fulfil their responsibilities, and at the same time respect the security constraints. The major contribution from the approach is a method for building adaptive and secure MAS, following model-driven architecture. The approach is illustrated with an actual British railway management system.