ppxscal/embedding_network huggingface dataset:
Multiple lot-sizing decisions with an interrupted geometric yield and variable production time
Authors: Hsi-Mei Hsu, Tai-Sheng Su, Muh-Cherng Wu, Liang-Chuan Huang
Venue: Computers and Industrial Engineering (2009)

This study examines a multiple lot-sizing problem for a single-stage production system with an interrupted geometric distribution, which is distinguished in involving variable production lead-time. In a finite number of setups, this study determined the optimal lot-size for each period that minimizes total expected cost. The following cost items are considered in optimum lot-sizing decisions: setup cost, variable production cost, inventory holding cost, and shortage cost. A dynamic programming model is formulated in which the duration between current time and due date is a stage variable, and remaining demand and work-in-process status are state variables. This study then presents an algorithm for solving the dynamic programming problem. Additionally, this study examines how total expected costs of optimal lot-sizing decisions vary when parameters are changed. Numerical results show that the optimum lot-size as a function of demand is not always monotonic.
Energy Efficient Clustering Algorithm in Wireless Sensor Networks Based on Geometric Programming
Authors: Wei Li
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

A wireless network consisting of a large number of small sensors with low-power transceivers can be an effective tool for gathering data in a variety of environments. The data collected by each sensoris communicated through the network to a single processing centerthat uses all reported data to determine characteristics of theenvironment or detect an event. A critical aspect of applicationswith wireless sensor networks is net work lifetime.Power-constrained wireless sensor networks are usable as long asthey can communicate sensed data to a processing node. Sensing andcommunications consume energy, therefore judicious power managementcan effectively extend network lifetime. In this paper we propose a geometric programming model to extend the sensornetwork life time by clustering sensor nodes into groups. Also, an efficient algorithm for solving this programming, use a newly developediterative method, is established. The method can be applied to the case where other objectives and constraints are taken into account. Simulation results show the efficiency of the proposed algorithm.
A Convex Method for Locating Regions of Interest with Multi-instance Learning
Authors: Yu-Feng Li, James T. Kwok, Ivor W. Tsang, Zhi-Hua Zhou
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II (2009)

In content-based image retrieval (CBIR) and image screening, it is often desirable to locate the regions of interest (ROI) in the images automatically. This can be accomplished with multi-instance learning techniques by treating each image as a bag of instances (regions). Many SVM-based methods are successful in predicting the bag labels, however, few of them can locate the ROIs. Moreover, they are often based on either local search or an EM-style strategy, and may get stuck in local minima easily. In this paper, we propose two convex optimization methods which maximize the margin of concepts via key instance generation at the instance-level and bag-level, respectively. Our formulation can be solved efficiently with a cutting plane algorithm. Experiments show that the proposed methods can effectively locate ROIs, and they also achieve performances competitive with state-of-the-art algorithms on benchmark data sets.
A Kernel Fuzzy Clustering Algorithm with Spatial Constraint Based on Improved Expectation Maximization for Image Segmentation
Authors: Xuchao Li, Suxuan Bian
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

In this paper, an unsupervised image segmentation algorithm is proposed, which combines spatial constraints with a kernel fuzzy c-means (KFCM) clustering algorithm. Conventional KFCM clustering segmentation algorithm does not incorporate the spatial context information of image, which makes it sensitive to the noise and intensity variations. In order to overcome the shortcomings, the contents of image is characterized by Gaussian mixture model, and the parameters of model are estimated by modified expectation maximization (EM) algorithm, which overcomes the classical EM algorithm drawbacks that easily trap in local maxima and be susceptible to initial value. According to the maximum a posterior theorem, we can get the pixel maximum posterior pobability. We redefine the objective function of the KFCM algorithm which incorporates the pixel maximum posteriori pobability, by minimizing the fuzzy objective function, the fuzzy segmentation algorithm is derived. The experimental results on a synthetic image and a real magnetic resonance image show that the proposed algorithm is more effective than the conventional FCM algorithm without local spatial constraints.
Identity Based Group Signatures from Hierarchical Identity-Based Encryption
Authors: Nigel P. Smart, Bogdan Warinschi
Venue: Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography (2009)

A number of previous papers explored the notion of identity-based group signature. We present a generic construction of identity-based group signatures. Our construction is based on the Naor transformation of a identity-based signature out of an identity-based encryption, adjusted to hierarchical identity-based encryption. We identify sufficient conditions on the underlying HIBE so that the scheme that results from our transformation meets our security definitions. Finally, we suggest a couple of extensions enabled by our construction, one of which is to hierarchical identity-based group signatures.
Deriving Box-Spline Subdivision Schemes
Authors: N. A. Dodgson, U. H. Augsdörfer, T. J. Cashman, M. A. Sabin
Venue: Proceedings of the 13th IMA International Conference on Mathematics of Surfaces XIII (2009)

We describe and demonstrate an arrow notation for deriving box-spline subdivision schemes. We compare it with the z-transform, matrix, and mask convolution methods of deriving the same. We show how the arrow method provides a useful graphical alternative to the three numerical methods. We demonstrate the properties that can be derived easily using the arrow method: mask, stencils, continuity in regular regions, safe extrusion directions. We derive all of the symmetric quadrilateral binary box-spline subdivision schemes with up to eight arrows and all of the symmetric triangular binary box-spline subdivision schemes with up to six arrows. We explain how the arrow notation can be extended to handle ternary schemes. We introduce two new binary dual quadrilateral box-spline schemes and one new $\sqrt2$ box-spline scheme. With appropriate extensions to handle extraordinary cases, these could each form the basis for a new subdivision scheme.
Integer Linear Programming in Computational Biology
Authors: Ernst Althaus, Gunnar W. Klau, Oliver Kohlbacher, Hans-Peter Lenhof, Knut Reinert
Venue: Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday (2009)

Computational molecular biology (bioinformatics) is a young research field that is rich in NP-hard optimization problems. The problem instances encountered are often huge and comprise thousands of variables. Since their introduction into the field of bioinformatics in 1997, integer linear programming (ILP) techniques have been successfully applied to many optimization problems. These approaches have added much momentum to development and progress in related areas. In particular, ILP-based approaches have become a standard optimization technique in bioinformatics. In this review, we present applications of ILP-based techniques developed by members and former members of Kurt Mehlhorn's group. These techniques were introduced to bioinformatics in a series of papers and popularized by demonstration of their effectiveness and potential.
Autonomous Mobile Robot: Path Planning Using Backward Chaining
Authors: Illani Mohd Nawi, Mohd Azlan Shah Abdul Rahim
Venue: Proceedings of the Advances in Electrical and Electronics Engineering - IAENG Special Edition of the World Congress on Engineering and Computer Science 2008 (2008)

This project concerns the design and fabrication of the Autonomous Mobile Robot (AMR) prototype, utilizing backward chaining as a mainframe in helping the robot to generate a self-understanding of the area of work and mobilization to a destination desired by the user. Further explanation of backward chaining is included. The main objective of this project is to create and develop a Path Planning Mobile Robot able to avoid obstacles in its path and reach a target designated position from its starting point utilizing 4 wheel-based rover body, sensors, linear motors and microcontrollers. The paper describes the design process of the AMR development, from the initiation of idea to development of algorithms, to virtual prototype development of AMR mechanisms and controller board, to fabrication, to mobility, obstacle avoidance and path planning test. Two methods of path planning are presented, using compass bearing in undetermined space and predetermined path. Obstacle avoidance and path planning algorithms has been tested using the completed design of AMR body.
MCTS Self-Paced Training Kit: Microsoft .NET Framework 3.5 ASP.NET Application Development, 1st edition
Authors: Mike Snell, Tony Northrup, Glenn Johnson
Venue: Self-Paced Training Kit (2009)

Ace your preparation for the skills measured by MCTS Exam 70-562 and on the job. Work at your own pace through a series of lessons and reviews that fully cover each exam objective. Then, reinforce and apply what you ve learned through real-world case scenarios and practice exercises. This official Microsoft study guide is designed to help you make the most of your study time. Maximize your performance on the exam by learning to: Program a new application; add and configure server controls Manage data input, user state, and security Implement data source controls and data-bound controls Use AJAX-enabled forms and scripts Create and consume XML Web services and WFC services Design for accessibility, globalization, and mobility Debug, deploy, monitor, and troubleshoot applications Assess your skills with the practice tests on CD. You can work through hundreds of questions using multiple testing modes to meet your specific learning needs. You get detailed explanations for right and wrong answers including a customized learning path that describes how and where to focus your studies. Your kit includes: 15% exam discount from Microsoft. Offer expires 12/31/13. Details inside. Official self-paced study guide. Practice tests with multiple, customizable testing options and a learning plan based on your results. 325 practice and review questions. Code samples in Microsoft Visual Basic and Visual C# on CD. 90-day trial of Microsoft Visual Studio 2008 Professional Edition. Case scenarios, exercises, and best practices. Fully searchable eBook of this guide, plus sample chapters from related books.
Manipulating the quota in weighted voting games
Authors: Michael Zuckerman, Piotr Faliszewski, Yoram Bachrach, Edith Elkind
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

Weighted voting games provide a popular model of decision making in multiagent systems. Such games are described by a set of players, a list of players' weights, and a quota; a coalition of the players is said to be winning if the total weight of its members meets or exceeds the quota. The power of a player in such games is traditionally identified with her Shapley-Shubik index or her Banzhaf index, two classical power measures that reflect the player's marginal contributions under different coalition formation scenarios. In this paper, we investigate by how much the central authority can change a player's power, as measured by these indices, by modifying the quota. We provide tight upper and lower bounds on the changes in the individual player's power that can result from a change in quota. We also study how the choice of quota can affect the relative power of the players. From the algorithmic perspective, we provide an efficient algorithm for determining whether there is a value of the quota that makes a given player a dummy, i.e., reduces his power (as measured by both indices) to 0. On the other hand, we show that checking which of the two values of the quota makes this player more powerful is computationally hard, namely, complete for the complexity class PP, which is believed to be significantly more powerful than NP.
Multi-resolution Mechanism for SVG
Authors: Dong Li, Linsheng Deng
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Interest in Scalable Vector Graphics (SVG) is increasing rapidly. Based on XML, SVG can be easily used on Web application. But the progressive transmission technology of SVG has still not been developed well. To address this, we propose a multi-resolution storage model, progressive transmission mechanism and along with some implementations for the SVG data. In the model, a SVG file is partitioned into several small files each of which belongs to either a profile file type or a detail file type. The loading of profiles are controlled by users, and the corresponding detail files can be progressively loaded and rendered automatically one by one according to the actual display size on the client side or as the user’s requests. Thus, the transmission of unnecessary data can be avoided in some cases. To verify the feasibility of the mechanism, primary results from comparison experiments between the multi-resolution method and the non multi-resolution method were provided.
The Effects of Camera System on Caregivers' Behaviors to Persons with Dementia
Authors: Taro Sugihara, Kenichi Nakagawa, Xi Liu, Tsutomu Fujinami
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Addressing Diversity. Part I: Held as Part of HCI International 2009 (2009)

We installed a camera system into a group home to investigate how such a device may help caregivers in responding to the behaviors of the persons with dementia. We studied how their behaviors have changed by introducing the system into the home through video recording and a series of interviews. We found that the system enables caregivers to optimize their responses to the persons with dementia depending on their degree of mobility.
Design Control System of Telescope Force Actuators Based on Linux
Authors: Shuai Xiaoying, Zhang Zhenchao, Wang You, Ni Jijun
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

By analyzing the characteristics of large telescope and the function structure of telescope actuator control system, distributed Ethernet force actuators control system is applied. To improve the performance of stability and real-time, developed software of force actuators control system in real-time Linux, a hiberarchy schedule scheme based on RTAI is presented. Adopt QT designer to design the user interface of control system in master computer. Master computer and controllers intercommunicate asynchronously no-block via QServerSocket, QSocket and DSocket, design communicate frame format. In order to communicate among processes, SLOT and SIGNAL are adopted. Finally depicted the main algorithm of data received in main controller.
Disambiguating noun compounds
Authors: Su Nam Kim, Timothy Baldwin
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

This paper is concerned with the interaction between word sense disambiguation and the interpretation of noun compounds (NCs) in English. We develop techniques for disambiguating word sense specifically in NCs, and then investigate whether word sense information can aid in the semantic relation interpretation of NCs. To disambiguate word sense, we combine the one sense per collocation heuristic with the grammatical role of polysemous nouns and analysis of word sense combinatories. We built supervised and unsupervised classifiers for the task and demonstrate that the supervised methods arc superior to a number of baselines and also a benchmark state-of-the-art WSD system. Finally, we show that WSD can significantly improve the accuracy of NC interpretation.
Overview of Meta-analyses Investigating Vibrotactile versus Visual Display Options
Authors: Linda R. Elliott, Michael D. Coovert, Elizabeth S. Redden
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

The literature is replete with studies that investigated the effectiveness of vibrotactile displays; however, individual studies in this area often yield discrepant findings that are difficult to synthesize. In this paper, we provide an overview of a comprehensive review of the literature and meta-analyses that organized studies to enable comparisons of visual and tactile presentations of information, to yield information useful to researchers and designers. Over six hundred studies were initially reviewed and coded along numerous criteria that determined appropriateness for meta-analysis categories. Comparisons were made between conditions that compared (a) adding a tactile cue to a baseline condition, (b) a visual cue with a multimodal (visual and tactile) presentation, and (c) a visual cue with a tactile cue. In addition, we further categorized within these comparisons with regard to type of information, that ranged from simple alerts and single direction cues to more complex tactile patterns representing spatial orientation or short communications.
Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
Authors: Ignacio Cascudo, Hao Chen, Ronald Cramer, Chaoping Xing
Venue: Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology (2009)

This work deals with "MPC-friendly" linear secret sharing schemes (LSSS), a mathematical primitive upon which secure multi-party computation (MPC) can be based and which was introduced by Cramer, Damgaard and Maurer (EUROCRYPT 2000). Chen and Cramer proposed a special class of such schemes that is constructed from algebraic geometry and that enables efficient secure multi-party computation over fixed finite fields (CRYPTO 2006). We extend this in four ways. First, we propose an abstract coding-theoretic framework in which this class of schemes and its (asymptotic) properties can be cast and analyzed. Second, we show that for every finite field ${\mathbb F}_q$, there exists an infinite family of LSSS over ${\mathbb F}_q$ that is asymptotically good in the following sense: the schemes are "ideal," i.e., each share consists of a single ${\mathbb F}_q$-element, and the schemes have t-strong multiplication on n players, where the corruption tolerance $\frac{3t}{n-1}$ tends to a constant ¿(q) with 0 < ¿(q) < 1 when n tends to infinity. Moreover, when $|{\mathbb F}_q|$ tends to infinity, ¿(q) tends to 1, which is optimal. This leads to explicit lower bounds on $\widehat{\tau}(q)$, our measure of asymptotic optimal corruption tolerance. We achieve this by combining the results of Chen and Cramer with a dedicated field-descent method. In particular, in the ${\mathbb F}_2$-case there exists a family of binary t-strongly multiplicative ideal LSSS with $\frac{3t}{n-1}\approx 2.86\%$ when n tends to infinity, a one-bit secret and just a one-bit share for every player. Previously, such results were shown for ${\mathbb F}_q$ with q ¿ 49 a square. Third, we present an infinite family of ideal schemes with t-strong multiplication that does not rely on algebraic geometry and that works over every finite field ${\mathbb F}_q$. Its corruption tolerance vanishes, yet still $\frac{3t}{n-1}= \Omega(1/(\log\log n)\log n)$. Fourth and finally, we give an improved non-asymptotic upper bound on corruption tolerance.
Bimanual Interaction with Interscopic Multi-Touch Surfaces
Authors: Johannes Schöning, Frank Steinicke, Antonio Krüger, Klaus Hinrichs, Dimitar Valkov
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

Multi-touch interaction has received considerable attention in the last few years, in particular for natural two-dimensional (2D) interaction. However, many application areas deal with three-dimensional (3D) data and require intuitive 3D interaction techniques therefore. Indeed, virtual reality (VR) systems provide sophisticated 3D user interface, but then lack efficient 2D interaction, and are therefore rarely adopted by ordinary users or even by experts. Since multi-touch interfaces represent a good trade-off between intuitive, constrained interaction on a touch surface providing tangible feedback, and unrestricted natural interaction without any instrumentation, they have the potential to form the foundation of the next generation user interface for 2D as well as 3D interaction. In particular, stereoscopic display of 3D data provides an additional depth cue, but until now the challenges and limitations for multi-touch interaction in this context have not been considered. In this paper we present new multi-touch paradigms and interactions that combine both traditional 2D interaction and novel 3D interaction on a touch surface to form a new class of multi-touch systems, which we refer to as interscopic multi-touch surfaces (iMUTS). We discuss iMUTS-based user interfaces that support interaction with 2D content displayed in monoscopic mode and 3D content usually displayed stereoscopically. In order to underline the potential of the proposed iMUTS setup, we have developed and evaluated two example interaction metaphors for different domains. First, we present intuitive navigation techniques for virtual 3D city models, and then we describe a natural metaphor for deforming volumetric datasets in a medical context.
Primitive Based Action Representation and Recognition
Authors: Sanmohan, Volker Krüger
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

There has been a recent interest in segmenting action sequences into meaningful parts (action primitives) and to model actions on a higher level based on these action primitives. Unlike previous works where action primitives are defined a-priori and search is made for them later, we present a sequential and statistical learning algorithm for automatic detection of the action primitives and the action grammar based on these primitives. We model a set of actions using a single HMM whose structure is learned incrementally as we observe new types. Actions are modeled with sufficient number of Gaussians which would become the states of an HMM for an action. For different actions we find the states that are common in the actions which are then treated as an action primitive.