ppxscal/embedding_network huggingface dataset:
Incorporating Patient Breathing Variability into a Stochastic Model of Dose Deposition for Stereotactic Body Radiation Therapy
Authors: Sarah E. Geneser, Robert M. Kirby, Brian Wang, Bill Salter, Sarang Joshi
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

Hypo-fractionated stereotactic body radiation therapy (SBRT) employs precisely-conforming high-level radiation dose delivery to improve tumor control probabilities and sparing of healthy tissue. However, the delivery precision and conformity of SBRT renders dose accumulation particularly susceptible to organ motion, and respiratory-induced motion in the abdomen may result in significant displacement of lesion targets during the breathing cycle. Given the maturity of the technology, sensitivity of dose deposition to respiratory-induced organ motion represents a significant factor in observed discrepancies between predictive treatment plan indicators and clinical patient outcome statistics and one of the major outstanding unsolved problems in SBRT. Techniques intended to compensate for respiratory-induced organ motion have been investigated, but very few have yet reached clinical practice. To improve SBRT, it is necessary to overcome the challenge that uncertainties in dose deposition due to organ motion present. This requires incorporating an accurate prediction of the effects of the random nature of the respiratory process on SBRT dose deposition for improved treatment planning and delivery of SBRT. We introduce a means of characterizing the underlying day-to-day variability of patient breathing and calculate the resulting stochasticity in dose accumulation.
Real-Time Message Routing and Scheduling
Authors: Ronald Koch, Britta Peis, Martin Skutella, Andreas Wiese
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

Exchanging messages between nodes of a network (e.g., embedded computers) is a fundamental issue in real-time systems involving critical routing and scheduling decisions. In order for messages to arrive on time, one has to determine a suitable (short) origin-destination path for each message and resolve conflicts between messages whose paths share a communication link of the network. We provide efficient routing strategies yielding origin-destination paths of bounded dilation and congestion. In particular, we can give good a priori guarantees on the time required to send a given set of messages which, under certain reasonable conditions, implies that all messages can be scheduled to reach their destination on time. Our algorithm uses a path-based LP-relaxation and iterative rounding. Finally, for message routing along a directed path (which is already $\mathcal{NP}$-hard), we identify a natural class of instances for which a simple scheduling heuristic yields provably optimal solutions.
Comprehensive cache performance tuning with a toolset
Authors: Jie Tao
Venue: Future Generation Computer Systems (2010)

Processor speed is increasing exponentially, while the increase in memory speed is relatively slow. This results in the fact that the overall performance of a computing system is increasingly contained by the memory performance. This paper describes an approach for improving the cache hit ratio and thereby the efficiency of the memory system. The approach is based on a set of performance tools which are capable of presenting the cache problems, the reason for them, and the solution for tackling them.
Research on Monitoring Method of Magnetism Balance Adjusting Environment
Authors: Zhiliang Ren, Guang Chen, Yaobo Li, Tao Zhang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

Based on the monitoring requirements of magnetism balance adjusting environment, a monitoring scheme for extracting the distribution parameters in spatial electromagnetic field is raised with the use of multi-elements electromagnetic sensors to make a measuring array. Aiming at the complicated electromagnetic environment and the certain detection mode of target signal, the factors which have an influence on magnetism balance adjusting environment are studied, the monitoring methods in the process of data acquisition and separation are presented, and its validity is validated by the real-measured data.
Rules-Driven of Dynamic Resources Directory for Land Resources Datacenter
Authors: Ji Wei, Wu Xincai
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

The spatial resources include data resources, function resources and authority resources. In order to realize effective integration and management of the spatial resources under the distributed heterogeneous environment, the land resources datacenter has provided the rules-driven of dynamic directory. The composition operators were constructed by relation algebra operations such as selection, projection and join which were compounded effecting on data (function) units; these formally described and quantitatively optimized the expressions of dynamic directory in terms of mathematics. Based on analyzing access control operation hierarchy, authority-function binding model was abstracted by authority operator to simplify the complexity of authority scheduling and to solve the geographic entities granularity based authority control and cross-region different authorization in land business. Finally, resources directory can provide the configurable and extensible on-demand service and achieve the isomorphism of heterogeneous spatial resources in the scheduling management level.
An Efficient Algorithm for Finding Frequent Items in a Stream
Authors: Li Tu, Ling Chen, Shan Zhang
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

Most of the existing algorithms for mining frequent items over data streams do not emphasis the importance of the more recent data items. We present an efficient algorithm where a fading factor lambda is used for computing frequency counts exceeding a user-specified threshold over data streams. Our algorithm lambda-Miner can detect epsilon-approximate frequent items of a data stream using O(epsilon−1) memory space and the processing time for each data item is O(1). Experimental results on several artificial data sets and real data sets show that lambda-Miner performs better than lambda-LC in terms with precision, memory requirement and time cost.
Development of an Expert System as a User Interface for an RFID Application
Authors: Deok Hee Nam
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

The paper presents developing an expert system as a user interface program to decode radio frequency identification codes for simulation and modeling of natural disasters. The entire developed environment for the expert system is intended to integrate all subtasks as a common user interface program to simulate and report the damages due to the catastrophic disasters. To perform the simulation as a part of the entire system, the proposed expert system reads in RFID codes in order to provide the desired information about the damages due to the catastrophic disasters based upon the available fields.
Gesture-Controlled User Input to Complete Questionnaires on Wrist-Worn Watches
Authors: Oliver Amft, Roman Amstutz, Asim Smailagic, Dan Siewiorek, Gerhard Tröster
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

The aim of this work was to investigate arm gestures as an alternative input modality for wrist-worn watches. In particular we implemented a gesture recognition system and questionnaire interface into a watch prototype. We analyzed the wearer's effort and learning performance to use the gesture interface and compared their performance to a classical button-based solution. Moreover we evaluated the system performance to spot wearer gestures and the system responsiveness. Our wearer study showed that the watch achieved a recognition accuracy of more than 90%. Completion times showed a clear decrease from 3 min in the first repetition to 1 min, 49 sec in the last one. Similarly, variance of completion times between wearers decreased during repetitions. Completion time using the button interface was 36 sec. Ratings of physical and concentration effort decreased during the study. Our results confirm that wearer training state is rather reflected in completion time than recognition performance.
Use of Coloured Tracers in Gas Flow Experiments for a Lagrangian Flow Analysis with Increased Tracer Density
Authors: Christian Bendicks, Dominique Tarlet, Bernd Michaelis, Dominique Thévenin, Bernd Wunderlich
Venue: Proceedings of the 31st DAGM Symposium on Pattern Recognition (2009)

In this article a 3-d particle tracking velocimetry system (PTV system) is presented which enables the investigation of relatively fast gaseous (air) flows and tiny turbulences in a small scaled wind tunnel. To satisfy the demand of a high spatial and temporal resolution, a sufficiently high tracer particle concentration has to be applied to the gas. Solving the correspondence problem among different cameras becomes extremely difficult due to ambiguities: Each tracer has to be found in all pictures of the different views during many successive time steps. Here, the correspondence problem is facilitated by the use of coloured particles and the application of suitable classifiers for particle classification.
Touch Affordances
Authors: Karin Slegers, Dries Roeck, Timo Arnall
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

The workshop "Touch Affordances" addresses a concept relevant to human computer interactions based on touch. The main topic is the challenge of applying the notion of affordances to domains related to touch interactions (e.g. (multi)touch screens, RFID NFC, ubiquitous interfaces). The goals of this workshop are to launch a community of researchers, designers, etc. interested in this topic, to create a common understanding of the field of touch affordances and to generate ideas for new research areas for intuitive touch interactions. The workshop will be highly interactive and will have a creative, generative character.
An Improved LSB Information Hiding Algorithm and Its Realization by C#
Authors: Huifang Deng, Meng Xie, Li Zhang, Zhihong Yao
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

In this paper, an improved LSB (Least Significant Bits) information hiding algorithm is proposed according to human visual theory and implemented in the temporal-spatial domain by using C#, and based on this, a system is developed for hiding and extraction of multimedia files. Compared with the traditional LSB method implemented by Matlab, the improved one has obvious advantages in the environmental configuration requirements, the time-consuming in running and ease of use. To be specific, the system realized on .net platform takes less running time and resources, has better extensibility and greater ease-to-use, and other distinct features. Besides, the system developed for hiding and extracting multimedia files based on the method has a wide range of adaptivity and good applicability
Is the World Linear?
Authors: Rudolf Fleischer
Venue: Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday (2009)

Super-resolution is the art of creating nice high-resolution raster images from given low-resolution raster images. Since "nice" is not a well-defined term in mathematics and computer science, we propose a linear model of the world that allows us, under certain conditions, to achieve perfect super-resolution for arbitrarily high resolution. For example, we may now create a larger-than-life picture of Kurt.
Efficient Annotation Visualization Using Distinctive Features
Authors: Seok Kyoo Kim, Sung Hyun Moon, Jun Park, Sang Yong Han
Venue: Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009 (2009)

Annotation is often used for supplement real objects in Augmented Reality. Previous researches on the annotation have been focused on optimal label placement, where annotations are placed close to the objects while avoiding overlapping. However, optimally placed annotations are still hard to recognize when the number of annotations is large. Human eyes may easily perceive an object by seeing its distinctive features. In this paper, we proposed visualization methods for easily perceivable annotations using distinctive features. The proposed methods are based on studies of effects of colors, depth, style, and transparency of the annotations.
Economical generalized neighbor designs for use in Serology
Authors: Rashid Ahmed, Munir Akhtar, M. H. Tahir
Venue: Computational Statistics Data Analysis (2009)

This paper considers the construction of generalized neighbor designs in circular blocks for several cases, which are useful in Serology. The initial blocks for the proposed designs are developed by using the method of cyclic shifts. Generalized neighbor designs are also constructed in linear blocks for v even. Catalogs of circular binary blocks generalized neighbor designs are compiled for all cases.
Component-Based Modeling for Embedded Systems
Authors: Fulong Chen, Xiaoya Fan, Jianjun Wei
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Component-based modeling is a software/hardware co-design method for application systems. Through defining some components, designers can construct a virtual application system between its requirements and actual product. This method includes behavior and structure modeling for inner-components, interaction and scheduler modeling for inter-components. An embedded system is decomposed into many subsystems-the biggest independent components interacting through interaction ports. A subsystem is composed of a set of smaller components and connectors, and those smaller components are decomposed till they are undividable atomic components. After integrated into one completed system model, its simulation can be carried out, and its performance can be evaluated and used to determine whether that virtual system is implemented accurately and meets the given requirements, or, codes in software and hardware description languages can be generated automatically for the actual product.
Process Algebra: An Algebraic Theory of Concurrency
Authors: Wan Fokkink
Venue: Proceedings of the 3rd International Conference on Algebraic Informatics (2009)

This tutorial provides an overview of the process algebra ACP.
Multitask Efficiencies in the Decision Tree Model
Authors: Andrew Drucker
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

In Direct Sum problems \cite{KRW}, one tries to show that for a given computational model, the complexity of computing a collection $F = \{f_1(x_1), \ldots f_l(x_l)\}$ of finite functions on independent inputs is approximately the sum of their individual complexities. In this paper, by contrast, we study the diversity of ways in which the joint computational complexity can behave when all the $f_i$ are evaluated on a \textit{common} input. We focus on the deterministic decision tree model, with depth as the complexity measure; in this model we prove a result to the effect that the `obvious' constraints on joint computational complexity are essentially the only ones. The proof uses an intriguing new type of cryptographic data structure called a `mystery bin' which we construct using a small polynomial separation between deterministic and unambiguous query complexity shown by Savick\'{y}. We also pose a variant of the Direct Sum Conjecture of \cite{KRW} which, if proved for a single family of functions, could yield an analogous result for models such as the communication model.
Harvesting heterogeneous renewable resources: Uncoordinated, selfish, team-, and community-oriented strategies
Authors: M. Brede, H. J. M. De Vries
Venue: Environmental Modelling Software (2010)

Using the example of a fishing fleet harvesting in different fishing zones with different carrying capacities and growth rates, we investigate strategies for the exploitation of distributed renewable resources by a crowd of agents without centralized coordination. In agent-based simulations we compare the performance of uncoordinated random harvesting, team playing, selfish individualistic and community-oriented (Collective Intelligence or COIN) behaviours operating with long and short time-horizon planning. Demonstrating the usefulness of COIN-based harvesting, more cooperative long-term planning strategies are found to relieve the pressure on the resource, reduce fluctuations and diminish the risk of overharvesting. Further, the outcome of an evolutionary dynamics where strategies in the agent population spread proportional to relative economic performance are strongly influenced by the harvesting pressure. In order of decreasing resource abundance we find that first an uncoordinated random, then a cooperative COIN-strategy and later the selfish strategy for an overharvested resource dominate the agent population. We also report that increasing harvesting pressure increasingly favours short-term and more individualistic strategies.
Graph Decomposition for Improving Memoryless Periodic Exploration
Authors: Adrian Kosowski, Alfredo Navarra
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

We consider a general framework in which a memoryless robot periodically explores all the nodes of a connected anonymous graph by following local information available at each vertex. For each vertex v, the endpoints of all edges adjacent to v are assigned unique labels from the range 1 to deg(v) (the degree of v). The generic exploration strategy is implemented using a right-hand-rule transition function: after entering vertex v via the edge labeled i, the robot proceeds with its exploration, leaving via the edge having label [i mod deg(v)]+1 at v.A lot of attention has been given to the problem of labeling the graph so as to achieve a periodic exploration having the minimum possible length ¿. It has recently been proved [Czyzowicz et al., Proc. SIROCCO'09 [1]] that $\pi \leq 4\frac13 n$ holds for all graphs of n vertices. Herein, we provide a new labeling scheme which leads to shorter exploration cycles, improving the general bound to ¿ ≤ 4 n ¿ 2. This main result is shown to be tight with respect to the class of labelings admitting certain connectivity properties. The labeling scheme is based on a new graph decomposition which may be of independent interest.
Oracle inequalities for support vector machines that are based on random entropy numbers
Authors: I. Steinwart
Venue: Journal of Complexity (2009)

In this paper, we present a new technique for bounding local Rademacher averages of function classes induced by a loss function and a reproducing kernel Hilbert space (RKHS). At the heart of this technique lies the observation that certain expectations of random entropy numbers can be bounded by the eigenvalues of the integral operator associated with the RKHS. We then work out the details of the new technique by establishing two new oracle inequalities for support vector machines, which complement and generalize previous results.
Noninterference for a Practical DIFC-Based Operating System
Authors: Maxwell Krohn, Eran Tromer
Venue: Proceedings of the 2009 30th IEEE Symposium on Security and Privacy (2009)

The Flume system is an implementation of decentralized information flow control (DIFC) at the operating system level.Prior work has shown Flume can be implemented as a practical extension tothe Linux operating system, allowing real Web applications to achieve useful security guarantees.However, the question remains if the Flume system is actually secure.This paper compares Flume with other recent DIFC systems like Asbestos, arguing that the latter is inherently susceptible to certain wide-bandwidth covert channels, and proving their absence in Flume by means of a noninterference proof in the Communicating Sequential Processes formalism.
Graph-Based Object Class Discovery
Authors: Shengping Xia, Edwin R. Hancock
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

We are interested in the problem of discovering the set of object classes present in a database of images using a weakly supervised graph-based framework. Rather than making use of the "Bag-of-Features (BoF)" approach widely used in current work on object recognition, we represent each image by a graph using a group of selected local invariant features. Using local feature matching and iterative Procrustes alignment, we perform graph matching and compute a similarity measure. Borrowing the idea of query expansion , we develop a similarity propagation based graph clustering (SPGC) method. Using this method class specific clusters of the graphs can be obtained. Such a cluster can be generally represented by using a higher level graph model whose vertices are the clustered graphs, and the edge weights are determined by the pairwise similarity measure. Experiments are performed on a dataset, in which the number of images increases from 1 to 50K and the number of objects increases from 1 to over 500. Some objects have been discovered with total recall and a precision 1 in a single cluster. 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
Decision-Support for Optimizing Supply Chain Formation Based on CSET Model
Authors: Yang Hang, Simon Fong, Zhuang Yan
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

Supply chain formation problem is one of the important research topics in e-Commence. In an e-Marketplace where buyers and sellers meet and trade online, dynamic supply chains can be formed among them by mediating agents. SET and CSET are two typical make-to-order supply chain models. CSET represents a scenario that has a central authority in charge of the formation, management and dissolution of a sup-ply chain. The principal authority selects the partners under certain principles which may either aim for maximizing profits of the whole supply chain or for ensuring every partner to re-ceive a job for communal prosperity. In SET, every supply chain partner uses local knowledge to compete for jobs at each supply chain level. We have implemented a Java-based simu-lator for simulating the process of dynamic supply chain for-mation. The simulator can operate in both modes whose results may be useful in decision-support in supply chain planning.
Language resources for a network-based dictionary
Authors: Veit Reuer
Venue: Proceedings of the Workshop on Enhancing and Using Electronic Dictionaries (2004)

In order to facilitate the use of a dictionary for language production and language learning we propose the construction of a new network-based electronic dictionary along the lines of Zock (2002). However, contrary to Zock who proposes just a paradigmatic network with information about the various ways in which words are similar we would like to present several existing language resources (LRs) which will be integrated in such a network resulting in more linguistic levels than one with paradigmatically associated words. We argue that just as the mental lexicon exhibits various, possibly interwoven layers of networks, electronic LRs containing syntagmatic, morphological and phonological information need to be integrated into an associative electronic dictionary.