ppxscal/embedding_network huggingface dataset:
Research on Applying Unidirectional Loop Layout to Optimize Facility Layout in Workshop Based on Improved Genetic Algorithm
Authors: Yi Zhang, Hu Zhang, Min-min Xia, Tong-tong Lu, Li-ling Jiang
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

As a type of layout which can bring the material transport high flexibility, unidirectional loop layout is widely used in modern workshop layout. This paper deploys research around how to apply a unidirectional loop layout to optimize the facility layout in workshop. Firstly, it establishes a mathematic model of the optimization problem according to optimization objective and restriction condition. Secondly, in order to make a solution of this unidirectional loop facility layout problem, it puts forward an improved genetic algorithm based on multipoint crossover operator of parent and child competition. Finally, through the analysis of practical example of optimizing facility layout in blade workshop, it has verified the feasibility and validity of the method applied in the paper, and also proved the good results of using the improved genetic algorithm put forward in the paper to solve the facility layout problem.
Analysis of UDP Traffic Usage on Internet Backbone Links
Authors: Min Zhang, Maurizio Dusi, Wolfgang John, Changjia Chen
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

It is still an accepted assumption that Internet traffic is dominated by TCP. However, the rise of new streaming applications (e.g. IPTV such as PPStream, PPLive) and new P2P protocols (e.g. uTP) trying to avoid traffic shaping techniques (such as RST packet injection) are expected to increase the usage of UDP as transport protocol. Since UDP lacks congestion-control, this could potentially raise serious concerns about fairness and stability in the Internet. The goal of this paper is to shed some lights on the assumption that TCP is the dominant transport protocol on the Internet. We evaluate the amount of UDP and TCP traffic, in terms of flows, packets and bytes, on traces collected in the period 2002-2009 on several backbone links located in the US and Sweden. According to our best available data,the use of UDP as transport protocol is gaining popularity in the recent years, especially in terms of flow numbers. A first analysis suggests that most UDP flows use random high ports and carry few packets and little data. This indicates that the recent increases in UDP traffic are a side product of the general increase of P2P traffic, using random ports in order to evade detection and utilizing UDP as signaling traffic for establishing P2P overlay networks.
Online Mentoring Programs
Authors: Gary A. Berg
Venue: eLearn (2009)

One-to-one relationships, facilitated through the Internet, is changing how personal and professional mentoring occurs. Despite the pervasiveness of large lecture courses found in colleges, the core of learning at the graduate level and beyond formal education is one-to-one dialogue between a mentor and a learner. The Internet and trends in e-learning have finally made mentoring practical and cost effective. 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
Social Practice: Becoming Enculturated in Human-Computer Interaction
Authors: Justine Cassell
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

We present a new approach to the design, development and evaluation of embodied conversational agents (ECAs) that allows them to index identity through culturally and socially authentic verbal and non-verbal behaviors. This approach is illustrated with research we are carrying out with children who speak several dialects of American English, and the subsequent implementation and first evaluation of a virtual peer based on that research. Results suggest that issues of identity in ECAs are more complicated than previous approaches might suggest, and that ECAs themselves may play a role in understanding issues of identity and language use in ways that have promise for educational applications.
On codeword design in metric DNA spaces
Authors: Vinhthuy Phan, Max H. Garzon
Venue: Natural Computing: an international journal (2009)

Finding a large set of single DNA strands that do not crosshybridize to themselves and/or to their complements is an important problem in DNA computing, self-assembly, and DNA memories. We describe a theoretical framework to analyze this problem, gauge its computational difficulty, and provide nearly optimal solutions. In this framework, codeword design is reduced to finding large sets of strands maximaly separated in a DNA space and the size of such sets depends on the geometry of these metric spaces. We show that codeword design is NP-complete using any single reasonable measure that approximates the Gibbs energy, thus practically excluding the possibility of finding any procedure to find maximal sets efficiently. Second, we extend a technique known as shuffling to provide a construction that yields provably nearly-maximal codes. Third, we propose a filtering process that removes strands creating pairs with low Gibbs energies, as approximated by the nearest-neighbor model. These two steps produce large codes of thermodynamic high quality. The proposed framework can be used to gain an understanding of the Gibbs energy landscapes for DNA strands on which much of DNA computing and self-assembly are based.
User-assisted intrinsic images
Authors: Adrien Bousseau, Sylvain Paris, Frédo Durand
Venue: ACM Transactions on Graphics (TOG) (2009)

For many computational photography applications, the lighting and materials in the scene are critical pieces of information. We seek to obtain intrinsic images, which decompose a photo into the product of an illumination component that represents lighting effects and a reflectance component that is the color of the observed material. This is an under-constrained problem and automatic methods are challenged by complex natural images. We describe a new approach that enables users to guide an optimization with simple indications such as regions of constant reflectance or illumination. Based on a simple assumption on local reflectance distributions, we derive a new propagation energy that enables a closed form solution using linear least-squares. We achieve fast performance by introducing a novel downsampling that preserves local color distributions. We demonstrate intrinsic image decomposition on a variety of images and show applications.
Content Based Image Retrieval Using Adaptive Inverse Pyramid Representation
Authors: Mariofanna Milanova, Roumen Kountchev, Stuart Rubin, Vladimir Todorov, Roumiana Kountcheva
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)

This paper presents a new approach for content-based image retrieval using cognitive representation with pyramidal decomposition. This approach corresponds to the hypothesis of the human way for object recognition based on consecutive approximations with increased resolution for the selected regions of interest. The method is based on object model creation with Inverse Difference Pyramid controlled by neural network. The method's basic advantages are the high flexibility and the ability to create general models for various views and scaling with relatively low computational complexity. The method is suitable for great number of applications --- medicine, digital libraries, electronic galleries, geographic information systems, documents archiving, digital communication systems, etc.
Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates
Authors: Xinxin Fan, Guang Gong, David Jao
Venue: Selected Areas in Cryptography: 15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14-15, Revised Selected Papers (2009)

In recent years there has been much interest in the development and the fast computation of bilinear pairings due to their practical and myriad applications in cryptography. Well known efficient examples are the Weil and Tate pairings and their variants such as the Eta and Ate pairings on the Jacobians of (hyper-)elliptic curves. In this paper, we consider the use of projective coordinates for pairing computations on genus 2 hyperelliptic curves over prime fields. We generalize Chatterjee et. al.'s idea of encapsulating the computation of the line function with the group operations to genus 2 hyperelliptic curves, and derive new explicit formulae for the group operations in projective and new coordinates in the context of pairing computations. When applying the encapsulated explicit formulae to pairing computations on supersingular genus 2 curves over prime fields, theoretical analysis shows that our algorithm is faster than previously best known algorithms whenever a field inversion is more expensive than about fifteen field multiplications. We also investigate pairing computations on non-supersingular genus 2 curves over prime fields based on the new formulae, and detail the various techniques required for efficient implementation.
Random Tensors and Planted Cliques
Authors: S. Charles Brubaker, Santosh S. Vempala
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor's entries denote the parity of the number of edges in subgraphs induced by r distinct vertices. For r = 2, it is the adjacency matrix with 1's for edges and ¿ 1's for nonedges. It is well-known that the 2-norm of the adjacency matrix of a random graph is $O(\sqrt{n})$. Here we show that the 2-norm of the r-parity tensor is at most $f(r)\sqrt{n}\log^{O(r)}n$, answering a question of Frieze and Kannan [1] who proved this for r = 3. As a consequence, we get a tight connection between the planted clique problem and the problem of finding a vector that approximates the 2-norm of the r-parity tensor of a random graph. Our proof method is based on an inductive application of concentration of measure.
ECC Is Ready for RFID --- A Proof in Silicon
Authors: Daniel Hein, Johannes Wolkerstorfer, Norbert Felber
Venue: Selected Areas in Cryptography: 15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14-15, Revised Selected Papers (2009)

This paper presents the silicon chip ECCon, an Elliptic Curve Cryptography processor for application in Radio-Frequency Identification. The circuit is fabricated on a 180 nm CMOS technology. ECCon features small silicon size (15K GE) and has low power consumption (8.57 μW). It computes 163-bit ECC point-multiplications in 296k cycles and has an ISO 18000-3 RFID interface. ECCon's very low and nearly constant power consumption makes it the first ECC chip that can be powered passively. This major breakthrough is possible because of a radical change in hardware architecture. The ECCon datapath operates on 16-bit words, which is similar to ECC instruction-set extensions. A number of innovations on the algorithmic and on the architectural level substantially increased the efficiency of 163-bit ECC. ECCon is the first demonstration that the proof of origin via electronic signatures can be realized on RFID tags in 180 nm CMOS and below.
Non-contiguous word sequences for information retrieval
Authors: Antoine Doucet, Helena Ahonen-Myka
Venue: Proceedings of the Workshop on Multiword Expressions: Integrating Processing (2004)

The growing amount of textual information available electronically has increased the need for high performance retrieval. The use of phrases was long seen as a natural way to improve retrieval performance over the common document models that ignore the sequential aspect of word occurrences in documents, considering them as "bags of words". However, both statistical and syntactical phrases showed disappointing results for large document collections. In this paper we present a recent type of multi-word expressions in the form of Maximal Frequent Sequences (Ahonen-Myka, 1999). Mined phrases rather than statistical or syntactical phrases, their main strengths are to form a very compact index and to account for the sequentiality and adjacency of meaningful word co-occurrences, by allowing for a gap between words. We introduce a method for using these phrases in information retrieval and present our experiments. They show a clear improvement over the well-known technique of extracting frequent word pairs.
Fuzzy-GIST for emotion recognition in natural scene images
Authors: Qing Zhang, Minho Le
Venue: Proceedings of the 2009 IEEE 8th International Conference on Development and Learning (2009)

Emotion modeling evoked by natural scenes is challenging issue. In this paper, we propose a novel scheme for analyzing the emotion reflected by a natural scene, considering the human emotional status. Based on the concept of original GIST, we developed the fuzzy-GIST to build the emotional feature space. According to the relationship between emotional factors and the characters of image, L*C*H* color and orientation information are chosen to study the relationship between human's low level emotions and image characteristics. And it is realized that we need to analyze the visual features at semantic level, so we incorporate the fuzzy concept to extract features with semantic meanings. Moreover, we treat emotional electroencephalography (EEG) using the fuzzy logic based on possibility theory rather than widely used conventional probability theory to generate the semantic feature of the human emotions. Fuzzy-GIST consists of both semantic visual information and linguistic EEG feature, it is used to represent emotional gist of a natural scene in a semantic level. The emotion evoked by an image is predicted from fuzzy-GIST by using a support vector machine, and the mean opinion score (MOS) is used for performance evaluation for the proposed scheme. The experiments results show that positive and negative emotions can be recognized with high accuracy for a given dataset.
Designing for mobile interaction: looking for a pragmatic middleground
Authors: Elena Nazzi
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

The theme of this PhD project is designing for mobile interaction with devices and services, for the accessing, making, and sharing of information, taking into account the dynamic physical and social settings that embrace this interaction. To narrow down this theme, the whole project focuses on the exploitation of social interaction --- in particular among senior citizens --- to enhance and support mobile interaction.
Business Process Re-engineering Risk Assessment Based on a New Improved FAHP
Authors: Yonggui He, Lianfu Jiang, Bo Li
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

The high failure ratio of BPR makes it necessary to evaluate the risks in the process of BPR actualization. In this paper, Based on study findings and the actual survey of enterprises for BPR risk assessment we set up the model of BPR risk assessment. The model is helpful to the manager in decision-making. In addition, the research data and Empirical Analysis of results will help enterprises to improve the flow and optimize the limited resources, so as to improve the performance of BPR.
Algorithmic Minimal Sufficient Statistic Revisited
Authors: Nikolay Vereshchagin
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

We express some criticism about the definition of an algorithmic sufficient statistic and, in particular, of an algorithmic minimal sufficient statistic. We propose another definition, which might have better properties.
One-Way Functions and the Berman-Hartmanis Conjecture
Authors: Manindra Agrawal, Osamu Watanabe
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

The Berman-Hartmanis conjecture states that all NP-complete sets are P-isomorphic each other. On this conjecture, we first improve the previous result of Agrawal and show that all NP-complete sets are P/poly-time computable 1,li-reducible to each other based on the assumption that there exist regular one-way functions that cannot be inverted by randomized polynomial-time algorithms. Secondly, we show that, besides the above assumption, if all one-way functions have some easy part to invert, then all NP-complete sets are P/poly-isomorphic to each other.
Numerical modeling of interaction of a current with a circular cylinder near a rigid bed
Authors: M. Salih Kirkgoz, A. Alper Oner, M. Sami Akoz
Venue: Advances in Engineering Software (2009)

The numerical modeling of 2D turbulent flow around a smooth horizontal circular cylinder near a rigid bed with gap ratio G/D=0.3 at Reynolds number Re"D=9500 is investigated. Ansys^(R) 10.0-FLOTRAN program package is used to solve the governing equations by FEM, and the performance of the standard k-@e, standard k-@w, and SST turbulence models are examined. A sensitivity study for the three turbulence models is carried out on three computational meshes with different densities near the cylinder surface. The computational velocity fields and the Strouhal numbers from the present simulations are compared with those obtained from the PIV measurement. It is found that the time-averaged velocity field of the flow in the proximity of the cylinder is closely affected by the mesh resolution near the cylinder surface, and the mesh refinement in radial direction improves the results of present simulations. The shedding of vortices in the cylinder wake is not predicted by k-@e model on all the three meshes. The results for the time-averaged velocity field show that the numerical modeling using either of k-@w and SST turbulence models on the finest mesh used on the cylinder surface is reasonably successful.
Human-Centered Distributed Conversational Modeling: Efficient Modeling of Robust Virtual Human Conversations
Authors: Brent Rossen, Scott Lind, Benjamin Lok
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

Currently, applications that focus on providing conversations with virtual humans require extensive work to create robust conversational models. We present a new approach called Human-centered Distributed Conversational Modeling. Using this approach, users create conversational models in a distributed manner. To do this, end-users interact with virtual humans to provide new stimuli (questions and statements), and domain-specific experts (e.g. medical/psychology educators) provide new virtual human responses. Using this process, users become the primary developers of conversational models. We tested our approach by creating an example application, Virtual People Factory. Using Virtual People Factory, a pharmacy instructor and 186 pharmacy students were able to create a robust conversational model in 15 hours. This is approximately 10% of the time typical in current approaches and results in more comprehensive coverage of the conversational space. In addition, surveys demonstrate the acceptability of this approach by both educators and students.
On the fractional Adams method
Authors: Changpin Li, Chunxing Tao
Venue: Computers Mathematics with Applications (2009)

The generalized Adams-Bashforth-Moulton method, often simply called ''the fractional Adams method'', is a useful numerical algorithm for solving a fractional ordinary differential equation: D"*^@ay(t)=f(t,y(t)),y^(^k^)(0)=y"0^(^k^),k=0,1,...,n-1, where @a>0,n=@?@a@? is the first integer not less than @a, and D"*^@ay(t) is the @ath-order fractional derivative of y(t) in the Caputo sense. Although error analyses for this fractional Adams method have been given for (a) 01, y@?C^1^+^@?^@a^@?[0,T], (c) 01, f@?C^3(G), there are still some unsolved problems-(i) the error estimates for @a@?(0,1), f@?C^3(G), (ii) the error estimates for @a@?(0,1), f@?C^2(G), (iii) the solution y(t) having some special forms. In this paper, we mainly study the error analyses of the fractional Adams method for the fractional ordinary differential equations for the three cases (i)-(iii). Numerical simulations are also included which are in line with the theoretical analysis.
Hybrid Harmonic Averaging Operator and its Application to Decision Making
Authors: Guiwu Wei
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

By combining the advantage of the weighted harmonic averaging (WHA) operator and ordered weighted harmonic averaging (OWHA) operator, this paper first develops hybrid harmonic averaging (HHA) operator for aggregating data information, and then proposes a HHA operator-based method for multiple attribute decision making(MADM) problems. The HHA operator generalizes both the WHA and OWHA operators, and reflects the importance degrees of both the given argument and the ordered position of the argument. Finally, a numerical example is used to illustrate the applicability and effectiveness of the proposed method.
An Improved Clonal Selection Classifier Incorporating Fuzzy Clustering
Authors: Gang Li, Jian Zhuang, Hongning Hou, Dehong Yu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Inspired by complementary strategies, a hybrid supervised artificial immune classifier is put forward, which is on the basis of the clonal selection principle, and combined with the Fuzzy C-Means clustering (FCM) algorithm. With the help of FCM clustering, the initial antibodies that image features of data set are extracted effectively, and then a clonal selection algorithm named CLONALG is adopted for each training instance to constitute the memory cells. Finally, classification is performed in a K-Nearest Neighbor approach with the developed set of memory cells. Experimental results on five benchmark datasets from UCI machine learning repository demonstrate the effectiveness of the algorithm as a classification technique. Compared with general CLOALG algorithm for classification, the hybrid classifier not only decrease the computational time, but also can generate less memory cells without sacrificing classification accuracy.
BioEx: a novel user-interface that accesses images from abstract sentences
Authors: Hong Yu, Minsuk Lee
Venue: Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX (2006)

Images (i.e., figures or tables) are important experimental results that are typically reported in bioscience full-text articles. Biologists need to access the images to validate research facts and to formulate or to test novel research hypotheses. We designed, evaluated, and implemented a novel user-interface, BioEx, that allows biologists to access images that appear in a full-text article directly from the abstract of the article.
Circuit Complexity of Regular Languages
Authors: Michal Kouck&#x00fd;
Venue: Theory of Computing Systems (2009)

We survey the current state of knowledge on the circuit complexity of regular languages and we prove that regular languages that are in AC0 and ACC0 are all computable by almost linear size circuits, extending the result of Chandra et al. (J.&#x00a0;Comput. Syst. Sci. 30:222&#x2013;234, 1985). As a consequence we obtain that in order to separate ACC0 from NC1 it suffices to prove for some &#x03b5;>0 an &#x03a9;(n 1+&#x03b5; ) lower bound on the size of ACC0 circuits computing certain NC1-complete functions.