ppxscal/embedding_network huggingface dataset:
Reconstructing RSA Private Keys from Random Key Bits
Authors: Nadia Heninger, Hovav Shacham
Venue: Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology (2009)

We show that an RSA private key with small public exponent can be efficiently recovered given a 0.27 fraction of its bits at random. An important application of this work is to the "cold boot" attacks of Halderman et al. We make new observations about the structure of RSA keys that allow our algorithm to make use of the redundant information in the typical storage format of an RSA private key. Our algorithm itself is elementary and does not make use of the lattice techniques used in other RSA key reconstruction problems. We give an analysis of the running time behavior of our algorithm that matches the threshold phenomenon observed in our experiments.
Video Super Resolution Using Duality Based TV-L1 Optical Flow
Authors: Dennis Mitzel, Thomas Pock, Thomas Schoenemann, Daniel Cremers
Venue: Proceedings of the 31st DAGM Symposium on Pattern Recognition (2009)

In this paper, we propose a variational framework for computing a superresolved image of a scene from an arbitrary input video. To this end, we employ a recently proposed quadratic relaxation scheme for high accuracy optic flow estimation. Subsequently we estimate a high resolution image using a variational approach that models the image formation process and imposes a total variation regularity of the estimated intensity map. Minimization of this variational approach by gradient descent gives rise to a deblurring process with a nonlinear diffusion. In contrast to many alternative approaches, the proposed algorithm does not make assumptions regarding the motion of objects. We demonstrate good experimental performance on a variety of real-world examples. In particular we show that the computed super resolution images are indeed sharper than the individual input images.
Multipath Inter-domain Routing Based on Subdividing Locators
Authors: Dan Li, Binqiang Wang, Wanwei Huang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Although benefit comes with multipath routing, large deployment in today’s Internet seems elusive. Decoupling IP dual roles could improve the scalability of routing systems which gives some light on multipath inter-domain routing, but overload in routers or reallocate new routing identifier is still a great challenge. In this paper, we inherit the decoupling idea but subdivide the topological locator into coarse/fine-grained locator. Then, we give a proposal in cooperation of terminals and routers, which will consume little overhead in packets forwarding than Tunnel or NAT techniques. In addition, a multipath routing method based on coarse-grained locator is offered. Simulations with Internet topology information show that scalability and reliable probability between AS pairs could be improved greatly.
Design of an Expert System for Pulping Based on Fuzzy BP Network
Authors: Kuang Yin, Wei Yuhua
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Pulping process is an important link in paper industry. To control the pulping time and get homogenized and well-proportioned pulp, pulper was improved by an expert system based on BP network and fuzzy controller. Pulp consistency and variation concentration are the inputs and pulping time is the output of the system. By empirical data, membership functions of consistency, variation concentration and pulping time were set up and sixteen fuzzy control rules were made. Combined with BP network, the number of input neurons was fourteen and the number of output neurons was eight. All control rules were training samples and simulation was completed by MATLAB. The results show that comparing with traditional fuzzy controller, capacity of the expert system is improved because of the memory and association of BP network. So the expert system can get knowledge directly from experience and reason automatically, without time-consuming searching in tables. The expert system has been used for about one year in Sichuan Hongyuan Group and the capacity can be used as needed.
Sketch-Based Interfaces and Modeling (SBIM): Sketching piecewise clothoid curves
Authors: James McCrae, Karan Singh
Venue: Computers and Graphics (2009)

We present a novel approach to sketching 2D curves with minimally varying curvature as piecewise clothoids. A stable and efficient algorithm fits a sketched piecewise linear curve using a number of clothoid segments with G^2 continuity based on a specified error tolerance. Further, adjacent clothoid segments can be locally blended to result in a G^3 curve with curvature that predominantly varies linearly with arc length. We also handle intended sharp corners or G^1 discontinuities, as independent rotations of clothoid pieces. Our formulation is ideally suited to conceptual design applications where aesthetic fairness of the sketched curve takes precedence over the precise interpolation of geometric constraints. We show the effectiveness of our results within a system for sketch-based road and robot-vehicle path design, where clothoids are already widely used.
Ungreedy methods for Chinese deterministic dependency parsing
Authors: Xiangyu Duan, Jun Zhao, Bo Xu
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Deterministic dependency parsing has often been regarded as an efficient parsing algorithm while its parsing accuracy is a little lower than the best results reported by more complex parsing models. In this paper, we compare deterministic dependency parsers with complex parsing methods such as generative and discriminative parsers on the standard data set of Penn Chinese Treebank. The results show that, for Chinese dependency parsing, deterministic parsers outperform generative and discriminative parsers. Furthermore, based on the observation that deterministic parsing algorithms are greedy algorithms which choose the most probable parsing action at every step, we propose three kinds of ungreedy deterministic dependency parsing algorithms to globally model parsing actions. Results show that ungreedy deterministic dependency parsers perform better than original deterministic dependency parsers while maintaining the same time complexity, and our best parser improves much over all other parsers.
Computer Vision and Computer Graphics Analysis of Paintings and Drawings: An Introduction to the Literature
Authors: David G. Stork
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

In the past few years, a number of scholars trained in computer vision, pattern recognition, image processing, computer graphics, and art history have developed rigorous computer methods for addressing an increasing number of problems in the history of art. In some cases, these computer methods are more accurate than even highly trained connoisseurs, art historians and artists. Computer graphics models of artists' studios and subjects allow scholars to explore ``what if'' scenarios and determine artists' studio praxis. Rigorous computer ray-tracing software sheds light on claims that some artists employed optical tools. Computer methods will not replace tradition art historical methods of connoisseurship but enhance and extend them. As such, for these computer methods to be useful to the art community, they must continue to be refined through application to a variety of significant art historical problems.
Connotation and Architecture of Green Production Logistics in Manufacturing Enterprises
Authors: Wu Xiaozhen
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Green production logistics applies the theories and methods of green manufacturing to the production logistics system. To combine with the process control theory, logistics simulation technique and information technology, green production logistics is capable of reducing the harm to the environment and improving the energy utilization rate of the production logistics system. The connotation and the problem field of green production logistics are introduced in this paper. The green characteristics of production logistics are analyzed. Then, ways to implement green production logistics are discussed and its architecture is proposed including technological basis, data support and green realization of job shop layer. At last, application mode of this architecture is studied based on PDM, which will provide theoretical basis on implementation and application of green production logistics in the workshop production of manufacturing enterprises in China.
Active learning for the identification of nonliteral language
Authors: Julia Birke, Anoop Sarkar
Venue: Proceedings of the Workshop on Computational Approaches to Figurative Language (2007)

In this paper we present an active learning approach used to create an annotated corpus of literal and nonliteral usages of verbs. The model uses nearly unsupervised word-sense disambiguation and clustering techniques. We report on experiments in which a human expert is asked to correct system predictions in different stages of learning: (i) after the last iteration when the clustering step has converged, or (ii) during each iteration of the clustering algorithm. The model obtains an f-score of 53.8% on a dataset in which literal/nonliteral usages of 25 verbs were annotated by human experts. In comparison, the same model augmented with active learning obtains 64.91%. We also measure the number of examples required when model confidence is used to select examples for human correction as compared to random selection. The results of this active learning system have been compiled into a freely available annotated corpus of literal/nonliteral usage of verbs in context.
Expressive Processing: Digital Fictions, Computer Games, and Software Studies
Authors: Noah Wardrip-Fruin
Venue:  (2009)

What matters in understanding digital media? Is looking at the external appearance and audience experience of software enoughor should we look further? In Expressive Processing, Noah Wardrip-Fruin argues that understanding what goes on beneath the surface, the computational processes that make digital media function, is essential. Wardrip-Fruin suggests that it is the authors and artists with knowledge of these processes who will use the expressive potential of computation to define the future of fiction and games. He also explores how computational processes themselves express meanings through distinctive designs, histories, and intellectual kinships that may not be visible to audiences. Wardrip-Fruin looks at "expressive processing" by examining specific works of digital media ranging from the simulated therapist Eliza and the first major story-generation system Tale-Spin to the complex city-planning game SimCity. Digital media, he contends, offer particularly intelligible examples of things we need to understand about software in general; if we understand, for instance, the capabilities and histories of artificial intelligence techniques in the context of a computer game, we can use that understanding to judge the use of similar techniques in such higher-stakes social contexts as surveillance. Most books on digital media focus on what the machines of digital media look like from the outside but ignore the computational machines that make digital media possible. With this book--the first to approach computational processes from the perspective of media, games, and fiction--Wardrip-Fruin examines both the outside and the inside of digital media's machines. Software Studies series
ConvoCons: Encouraging Affinity on Multitouch Interfaces
Authors: Michael A. Oren, Stephen B. Gilbert
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

This paper describes the design of ConvoCons, a system to promote affinity of group members working in a co-located multitouch environment. The research includes an exploratory study that led to the development of ConvoCons as well as the iterative evolution of the ConvoCon system, design trade-offs made, and empirical observations of users that led to design changes. This research adds to the literature on social interaction design and offers interface designers guidance on promoting affinity and increased collaboration via the user interface.
Object Matching in Distributed Video Surveillance Systems by LDA-Based Appearance Descriptors
Authors: Liliana Lo Presti, Stan Sclaroff, Marco Cascia
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

Establishing correspondences among object instances is still challenging in multi-camera surveillance systems, especially when the cameras' fields of view are non-overlapping. Spatiotemporal constraints can help in solving the correspondence problem but still leave a wide margin of uncertainty. One way to reduce this uncertainty is to use appearance information about the moving objects in the site. In this paper we present the preliminary results of a new method that can capture salient appearance characteristics at each camera node in the network. A Latent Dirichlet Allocation (LDA) model is created and maintained at each node in the camera network. Each object is encoded in terms of the LDA bag-of-words model for appearance. The encoded appearance is then used to establish probable matching across cameras. Preliminary experiments are conducted on a dataset of 20 individuals and comparison against Madden's I-MCHR is reported.
Approximating the Behaviours of Physarum polycephalum for the Construction and Minimisation of Synthetic Transport Networks
Authors: Jeff Jones
Venue: Proceedings of the 8th International Conference on Unconventional Computation (2009)

The single celled organism Physarum polycephalum efficiently constructs and minimises dynamical nutrient transport networks resembling proximity graphs. We present a model multi-agent population which collectively approximates the network behaviours of Physarum. We demonstrate spontaneous transport network formation and evolution and show that the collective population also exhibits quasi-physical emergent properties, allowing the collective population to be considered as a virtual computing material - a synthetic plasmodium. This material is used as an unconventional method to approximate spatially represented geometry problems. We demonstrate three different methods for the construction, evolution and minimisation of Physarum-like transport networks which approximate Steiner trees, relative neighbourhood graphs, convex hulls and concave hulls. The results span the Toussaint hierarchy of proximity graphs, suggesting that the foraging and minimising behaviours of Physarum reflect interplay between maximising foraging area and minimising transport distance. The properties and behaviours of the synthetic virtual plasmodium may be useful in future physical instances of unconventional computing devices, and may also provide clues to the generation of emergent computation behaviours by Physarum. 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
Differential phase shifters using corrugated, ridge, and fin loaded waveguides
Authors: Angel Mediavilla, José A. Pereda, Oscar González, Alicia Casanueva, Joseph Helszajn, Ralph Levy
Venue: International Journal of RF and Microwave Computer-Aided Engineering (2009)

One means of converting the port conditions of a magic-tee into those of a 90&deg; hybrid is to introduce external sections of waveguide at the symmetrical H-plane output ports having the necessary 90&deg; phase difference. The purpose of this article is to describe a number of realizations of such differential phase shifters (DPS), including an exact synthesis procedure not requiring computer optimization. A typical design consists of a capacitively loaded waveguide for one section and an essentially inductive waveguide for the other. The latter is simply a uniform waveguide of reduced width when compared with that of the capacitive section. An example capacitive ridge DPS exhibits a maximum phase error of &plusmn;2&deg; over a 20&percnt; bandwidth in WR75 waveguide with a return loss of better than 40 dB and an insertion loss <0.06 dB. &copy; 2009 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2009.
The SemEval-2007 WePS evaluation: establishing a benchmark for the web people search task
Authors: Javier Artiles, Julio Gonzalo, Satoshi Sekine
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

This paper presents the task definition, resources, participation, and comparative results for the Web People Search task, which was organized as part of the SemEval-2007 evaluation exercise. This task consists of clustering a set of documents that mention an ambiguous person name according to the actual entities referred to using that name.
HR Changes in Driving Scenes with Danger and Difficulties Using Driving Simulator
Authors: Yukiyo Kuriyagawa, Mieko Ohsuga, Ichiro Kageyama
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

To provide a safe and comfortable driving environment, extracting a variety of stress scenes experienced by drivers and utilizing them for investigating actual causes and ways to assist drivers is effective. To find scenes that could be investigated efficiently in this way, we proposed a method based on changes in a driver's physiological indices that emotional changes may have caused. In this paper, we examined the possibility of applying this method to experimental situations using a driving simulator (DS). An experiment using a DS has an advantage over one done in a real life situation in that the experimental parameters can be controlled. This paper examines the relationship between a driver's emotional changes and physiological changes during driving. As a result, we suggest that whether an event is recognized and how much emotion it caused can be estimated by combining measurements of changes in heart rate (HR), skin conductance (SC), and respiration.
Model on Selecting the Strategic Partner for Construction Project Owners
Authors: Liu Jianbing, Li Zhiming, Ren Hong
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

The partners of construction project is a new kind of construction project management method, the ideal project partners selected is an important topic that the project owners construction . In this paper, the improved TOPSIS method and the principle of linear programming are introduced to built the model of selecting the partners for the project owners, the comprehensive evaluation systems are designed, then ,according to the above evaluation systems, the improved TOPSIS way was applied to screening the project partners , linear programming and entropy principle are used to optimize the project partners, which are used to build the three stages model selection. The use of that party Contractor selection method can be optimized to achieve the project parties to which the project owners select the partners . The above methods are applied to optimize to select the partners for project owners, the project partners can achieve "win-win" results, the harmonious management of the project can be realized.
Determination of Gender and Age Based on Pattern of Human Motion Using AdaBoost Algorithms
Authors: Santoso Handri, Shusaku Nomura, Kazuo Nakamura
Venue: Proceedings of the FIRA RoboWorld Congress 2009 on Advances in Robotics (2009)

Automated human identification by their walking behavior is a challenge attracting much interest among machine vision researchers. However, practical systems for such identification remain to be developed. In this study, a machine learning approach to understand human behavior based on motion imagery was proposed as the basis for developing pedestrian safety information systems. At the front end, image and video processing was performed to separate foreground from background images. Shape-width was then analyzed using 2D discrete wavelet transformation to extract human motion features. Finally, an adaptive boosting (AdaBoost) algorithm was performed to classify human gender and age into its class. The results demonstrated capability of the proposed systems to classify gender and age highly accurately.
Importance of Data Standardization in Privacy-Preserving K-Means Clustering
Authors: Chunhua Su, Justin Zhan, Kouichi Sakurai
Venue: Database Systems for Advanced Applications: DASFAA 2009 International Workshops: BenchmarX, MCIS, WDPP, PPDA, MBC, PhD, Brisbane, Australia, April 20 - 23, 2009 (2009)

Privacy-preserving k-means clustering assumes that there are at least two parties in the secure interactive computation. However, the existing schemes do not consider the data standardization which is an important task before executing the clustering among the different database. In this paper, we point out without data standardization, some problems will arise from many applications of data mining. Also, we provide a solution for the secure data standardization in the privacy-preserving k-means clustering.
A Dynamic Algorithm for Reachability Games Played on Trees
Authors: Bakhadyr Khoussainov, Jiamou Liu, Imran Khaliq
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

Our goal is to start the investigation of dynamic algorithms for solving games that are played on finite graphs. The dynamic game determinacy problem calls for finding efficient algorithms that decide the winner of the game when the underlying graph undergoes repeated modifications. In this paper, we focus on turn-based reachability games. We provide an algorithm that solves the dynamic reachability game problem on trees. The amortized time complexity of our algorithm is O(logn), where n is the number of nodes in the current graph.
Process-Based Collaboration in Global Software Engineering
Authors: Harald Klein, Andreas Rausch, Edward Fischer
Venue: Proceedings of the 2009 Fourth IEEE International Conference on Global Software Engineering (2009)

Globalization is one of the big trends in software development. Development projects need a variety of different resources with appropriate expert knowledge to be successful. More and more of these resources are nowadays obtained from specialized organizations and countries all over the world, varying in development approaches, processes, and culture. As seen with early outsourcing attempts, collaboration may fail due to these differences. Hence, the major challenge in global software engineering is to streamline collaborating organizations towards a successful conjoint development. Based on typical collaboration scenarios, this paper presents a structured approach to integrate processes in a comprehensible way.
Graph Theoretic Topological Analysis of Web Service Networks
Authors: Hyunyoung Kil, Seog-Chan Oh, Ergin Elmacioglu, Wonhong Nam, Dongwon Lee
Venue: World Wide Web (2009)

Using graph theory, we analyze the topological landscape of web service networks formed by real-world data set, either downloaded from web service repositories or crawled by a search engine. We first propose a flexible framework to study syntactic web service matchmaking in a unified manner. Under the framework, then, the data set is analyzed from diverse perspectives and granularity. By and large, the data set is shown to exhibit small world network well and power-law-like distribution to some extent. Finally, using random graph theory, we demonstrate how to accurately estimate the size of the giant component of such web service networks.