ppxscal/embedding_network huggingface dataset:
Industrial case study of the MICA support system for warehouse workers
Authors: Christian R. Prause, Markus Eisenhauer, Lukas Gillmann
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

Returns caused by the delivery of incorrect items constitute a major problem for non-automated warehouses. Returns not only create extra costs, they also aggravate customers. Most errors in logistics occur during the picking process. MICA --- a mobile assistance system for warehouse workers --- unobtrusively navigates the worker on his way through the warehouse and effectively prevents picking errors using RFID technology. Therefore, MICA reduces error rates, job training periods, and the time required for picking and packing, leading to lower costs for warehouse operators and increased customer satisfaction. In this paper you will read about a case study where the MICA prototype was field-tested in the warehouse of a medium-sized enterprise.
Exploring the sense distributions of homographs
Authors: Reinhard Rapp
Venue: Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Posters & Demonstrations (2006)

This paper quantitatively investigates in how far local context is useful to disam-biguate the senses of an ambiguous word. This is done by comparing the co-occurrence frequencies of particular context words. First, one context word representing a certain sense is chosen, and then the co-occurrence frequencies with two other context words, one of the same and one of another sense, are compared. As expected, it turns out that context words belonging to the same sense have considerably higher co-occurrence frequencies than words belonging to different senses. In our study, the sense inventory is taken from the University of South Florida homograph norms, and the co-occurrence counts are based on the British National Corpus.
Farthest segments and extremal triangles spanned by points in R3
Authors: Steven Bitner, Ovidiu Daescu
Venue: Information Processing Letters (2009)

Given a set S of n points in R^3 we consider finding the farthest line segment spanned by S from a query point q given as part of the input, and finding the minimum and maximum area triangles spanned by S. For the farthest line segment problem we give an O(nlogn) time, O(n) space algorithm, matching the time and space complexities of the planar version. The algorithm is optimal in the algebraic decision tree model. We further prove that the minimum area triangle spanned by S can be found in O(n^2^.^4log^O^(^1^)n) time and space, and the maximum area triangle spanned by S can be found in O(h^2^.^4log^O^(^1^)h+nlogn) time and O(h^2^.^4log^O^(^1^)h+n) space, where h is the number of vertices of the convex hull of S (h=n in the worst case).
Simultaneous Consideration of Spatial Deformation and Tensor Orientation in Diffusion Tensor Image Registration Using Local Fast Marching Patterns
Authors: Hai Li, Zhong Xue, Lei Guo, Stephen T. Wong
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

Diffusion tensor imaging (DTI) plays increasingly important roles in surgical planning, neurological disease diagnosis, and follow-up studies in recent years. In order to compare the tractography obtained from different subjects or the same subject at different timepoints, a key step is to spatially align DTI images. Different from scalar or multi-channel image registration, tensor orientation should be considered in DTI registration. Several DTI registration methods have been proposed before, and some of them are based on first extracting the orientation-invariant features and then registering images using traditional scalar or multi-channel registration techniques followed by tensor reorientation. They essentially do not fully use the tensor information. Other methods such as the piece-wise affine transformation and the diffeomorphic non-linear registration algorithms use analytical gradients of the registration objective functions by considering the reorientation of tensor during the registration. However, only local tensor information such as voxel tensor similarity is utilized in these algorithms, which can be regarded as a counterpart of the traditional intensity similarity-based image registration in the DTI case. This paper proposes a novel DTI image registration algorithm, called fast marching-based simultaneous registration. It not only considers the orientation of tensors but also utilizes the neighborhood tensor information of each voxel, which is extracted from a local fast marching algorithm around voxels of interest. Compared to the voxel-wise tensor similarity-based registration, richer and more distinctive tensor features are used in this algorithm to better define correspondences between DTI images. Thus, more robust and accurate registration results can be obtained. In the experiments, comparative results using the real DTI data show the advantages of the proposed algorithm.
Application of quantum chemical calculations to two non-trivial cases in the field of molecular spectroscopy
Authors: C. Lapouge, J. P. Cornard
Venue: Journal of Computational Methods in Sciences and Engineering (2009)

In this paper, we illustrate the contribution of the quantum chemical calculations to the simulation of two types of spectra. In a first part, the calculations of theoretical resonance Raman spectra of transient species are presented. The comparison of the theoretical and experimental spectra allows validating the methodology. From calculation results, the molecular structure and the spectra assignment of radicals have been deduced. In a second part, the TD-DFT methodology is applied to the determination of the preferential chelating site involved in the metal fixation by a ligand possessing several complexing functions in competition. We show that the use of UV-visible spectroscopy combined with quantum chemical calculations is well adapted to resolve the molecular structure of a complex. The reaction pathway calculations allow a better understanding of the regioselectivity of the complexation mechanism.
System Description: H-PILoT
Authors: Carsten Ihlemann, Viorica Sofronie-Stokkermans
Venue: Proceedings of the 22nd International Conference on Automated Deduction (2009)

This system description provides an overview of H-PILoT (Hierarchical Proving by Instantiation in Local Theory extensions), a program for hierarchical reasoning in extensions of logical theories with functions axiomatized by a set of clauses. H-PILoT reduces deduction problems in the theory extension to deduction problems in the base theory. Specialized provers and standard SMT solvers can be used for testing the satisfiability of the formulae obtained after the reduction. For local theory extensions this hierarchical reduction is sound and complete and --- if the formulae obtained this way belong to a fragment decidable in the base theory --- H-PILoT provides a decision procedure for testing satisfiability of ground formulae, and can also be used for model generation.
A dispersion-relation-preserving algorithm for a nonlinear shallow-water wave equation
Authors: P. H. Chiu, Long Lee, Tony W. H. Sheu
Venue: Journal of Computational Physics (2009)

The paper presents an iterative algorithm for studying a nonlinear shallow-water wave equation. The equation is written as an evolution equation, involving only first-order spatial derivatives, coupled with the Helmholtz equation. We propose a two-step iterative method that first solves the evolution equation by the implicit midpoint rule and then solves the Helmholtz equation using a three-point sixth-order compact scheme. The first-order derivative terms in the first step are approximated by a sixth-order dispersion-relation-preserving scheme that preserves the physically inherent dispersive nature. The compact Helmholtz solver, on the other hand, allows us to use relatively few nodal points in a stencil, while achieving a higher-order accuracy. The midpoint rule is a symplectic time integrator for Hamiltonian systems, which may be a preferable method to solve the spatially discretized evolution equation. To give an assessment of the dispersion-preserving scheme, we provide a detailed analysis of the dispersive and dissipative errors of this algorithm. Via a variety of examples, we illustrate the efficiency and accuracy of the proposed scheme by examining the errors in different norms and providing the rates of convergence of the method. In addition, we provide several examples to demonstrate that the conserved quantities of the equation are well preserved by the implicit midpoint time integrator. Finally, we compare the accuracy, elapsed computing time, and spatial and temporal rates of convergence among the proposed method, a complete integrable particle method, and the local discontinuous Galerkin method.
Brief paper: Limitations in remote stabilization over unreliable channels without acknowledgements
Authors: Hideaki Ishii
Venue: Automatica (Journal of IFAC) (2009)

We consider the remote control of linear systems using unreliable communication channels where transmitted messages may be randomly lost and aim at clarifying the limitations arising there. In particular, we study the case without acknowledgement messages from the actuator to the remote controller regarding the arrival of the control input. It is shown that for a class of plants, stabilization is possible if and only if the loss rates satisfy critical bounds which have been known in the literature when acknowledgements are available. We present a constructive proof employing a nonlinear controller that makes control input estimation.
A Logic-Based Framework for Reasoning about Composite Data Structures
Authors: Ahmed Bouajjani, Cezara Drăgoi, Constantin Enea, Mihaela Sighireanu
Venue: Proceedings of the 20th International Conference on Concurrency Theory (2009)

We define a logic, called CSL, for the specification of complex data structures, and we show its use in program verification. Our framework allows to handle programs with dynamic linked structures and arrays carrying unbounded data, as well as the composition of these structures. The formulas in CSL allow a limited form of alternation between existential and universal quantifiers and they can express (1) constraints on reachability between positions in the heap following some pointer fields, (2) linear constraints on the lengths of the lists and the indexes of the arrays, and (3) constraints on the values of the data attached to these positions. For data constraints, the logic CSL is parameterized by a first-order logic over the considered data domain. We prove that the satisfiability problem of CSL is decidable whenever the underlying data logic is decidable and that CSL is closed under the computation of the strongest post-condition in the considered class of programs.
Ethics, Roles and Relationships in Interaction Design in Developing Regions
Authors: Anxo Ceriejo-Roibas, Andy Dearden, Susan Dray, Phil Gray, John Thomas, Niall Winters
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

A workshop to explore ethical and organisational issues associated with interaction design efforts conducted in developing regions of the world. The workshop will discuss the challenges of conducting this type of work in a way that can bring sustainable benefits to people living in developing regions.
SessionMagnifier: a simple approach to secure and convenient kiosk browsing
Authors: Chuan Yue, Haining Wang
Venue: Proceedings of the 11th international conference on Ubiquitous computing (2009)

Many people use public computers to browse the Web and perform important online activities. However, public computers are usually far less trustworthy than peoples' own computers because they are more vulnerable to various security attacks. In this paper, we propose SessionMagnifier, a simple approach to secure and convenient kiosk browsing. The key idea of SessionMagnifier is to enable an extended browser on a mobile device and a regular browser on a public computer to collaboratively support a Web session. This approach simply requires a SessionMagnifier browser extension to be installed on a trusted mobile device. A user can securely perform sensitive interactions on the mobile device and conveniently perform other browsing interactions on the public computer. We implemented SessionMagnifier for Mozilla's Fennec browser and evaluated it on a Nokia N810 Internet Tablet. Our evaluation and analysis demonstrate that SessionMagnifier is simple, secure, and usable.
The Experience of Presence in 3D Web Environment: An Analysis of Korean Second Life
Authors: Sungbok Park, Ha Sung Hwang, Myungil Choi
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

Second Life is a 3D virtual web environment that has aspects of visualization and sense of presence, as well as text and audio interaction. The whole research aims to explore the sense of presence experienced by online users in Korean Second Life assessing with what ways online users who engage in Korean Second Life perceive a sense of presence. This research leads us to understanding possible factors creating the sense of presence in Korean Second Life as well as in 3D web environments of the near future. Instead of providing specific response from research subjects who have experienced Second Life, this paper presents the theoretical backgrounds to speculate on Second Life constructs and features for enhancing users' feeling of presence.
Cross-Platform Analysis with Binarized Gene Expression Data
Authors: Salih Tuna, Mahesan Niranjan
Venue: Proceedings of the 4th IAPR International Conference on Pattern Recognition in Bioinformatics (2009)

With widespread use of microarray technology as a potential diagnostics tool, the comparison of results obtained from the use of different platforms is of interest. When inference methods are designed using data collected using a particular platform, they are unlikely to work directly on measurements taken from a different type of array. We report on this cross-platform transfer problem, and show that working with transcriptome representations at binary numerical precision, similar to the gene expression bar code method, helps circumvent the variability across platforms in several cancer classification tasks. We compare our approach with a recent machine learning method specifically designed for shifting distributions, i.e., problems in which the training and testing data are not drawn from identical probability distributions, and show superior performance in three of the four problems in which we could directly compare.
Clamshell Casting
Authors: Prosenjit Bose, Pat Morin, Michiel Smid, Stefanie Wuhrer
Venue: Algorithmica (2009)

A popular manufacturing technique is clamshell casting, where liquid is poured into a cast and the cast is removed by a rotation once the liquid has hardened. We consider the case where the object to be manufactured is modeled by a polyhedron with combinatorial complexity n of arbitrary genus. The cast consists of exactly two parts and is removed by a rotation around a line in space. The following two problems are addressed: (1) Given a line of rotation l in space, we determine in O(nlog&#x2009;n) time whether there exists a partitioning of the cast into exactly two parts, such that one part can be rotated clockwise around l and the other part can be rotated counterclockwise around l without colliding with the interior of P or the cast. If the problem is restricted further, such a partitioning is only valid when no reflex edge or face of P is perpendicular to l, the algorithm runs in O(n) time. (2) An algorithm running in O(n 4log&#x2009;n) time is presented to find all the lines in space that allow a cast partitioning as described above. If we restrict the problem further and find all the lines in space that allow a cast partitioning as described above, such that no reflex edge or face of P is perpendicular to l, the algorithm&#x2019;s running time becomes O(n 4 &#x03b1;(n)). All of the running times are shown to be almost optimal.
Unfolding of Multirate Data-Flow Graph to Compute Iteration Bound
Authors: Daniel Yuh Chao
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

Parhietal. find the iteration bound (IB) by considering the equivalent single-rate data-flow graph (SRDFG) N' of N, which is generally an exponential time task and the transformed SRDFG is much larger (grows exponentially) than the MRDFG. Ito et al. proposed a novel algorithm to remove node/edge redundancies taking extra time and memory, but losing schedule information of removed nodes. We propose to reduce the MRDFG in a loop-wise fashion (reduce the nodes/edges in a loop as a whole) with fewer nodes/edges. The scheduling of nodes in the MRDFG can be derived from that of the reduced SRDFG., where one invocation of a node n corresponds to a consecutive number of invocations of n in the MRDFG.
Estimating the Information Theoretic Optimal Stego Noise
Authors: Andrew D. Ker
Venue: Proceedings of the 8th International Workshop on Digital Watermarking (2009)

We recently developed a new benchmark for steganography, underpinned by the square root law of capacity, called Steganographic Fisher Information (SFI). It is related to the multiplicative constant for the square root capacity rate and represents a truly information theoretic measure of asymptotic evidence. Given a very large corpus of covers from which the joint histograms can be estimated, an estimator for SFI was derived in [1], and certain aspects of embedding and detection were compared using this benchmark.In this paper we concentrate on the evidence presented by various spatial-domain embedding operations. We extend the technology of [1] in two ways, to convex combinations of arbitrary so-called independent embedding functions. We then apply the new techniques to estimate, in genuine sets of cover images, the spatial-domain stego noise shape which optimally trades evidence --- in terms of asymptotic KL divergence --- for capacity. The results suggest that smallest embedding changes are optimal for cover images not exhibiting much noise, and also for cover images with significant saturation, but in noisy images it is superior to embed with more stego noise in fewer locations.
An HTTP Extension for Secure Transfer of Confidential Data
Authors: Masaru Takesue
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

Users' confidential data in transit on the WWW are protected by the HTTP's authentication scheme or the SSL protocol. However, the former has several weak points in terms of security, while the latter has a few problems against its wide deplotmemt. To alleviate the problems, we propose a scheme for user-initiated server authentication and two schemes for protecting against the Cross-Site-Scripting (XSS) and Cross-Site Reference Forgery (XSRF) attacks. Server authentication fails when when phishing, pharming, and MITM attacks are deployed, leading to the detection of those attacks. The protection schemes can thwart MITM, as well as XSS and XSRF. We integrate our schemes into the HTTP and extend the browser so that the user can start server authentication when a loaded web page has a form for submitting data and the user notifies the browser that his/her submitting data are confidential. The browser invokes the protection schemes when the page has no submission form, since XSS and XSRF are deployed without the user's awareness, i.e., without the submission form.
Playful Holistic Support to HCI Requirements Using LEGO Bricks
Authors: Lorenzo Cantoni, Luca Botturi, Marco Faré, Davide Bolchini
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

This paper presents Real Time Web (RTW), a holistic method for eliciting HCI requirements and strategic design issues of web applications based on the systematic use of LEGO bricks. Capturing, understanding and expressing the requirements for the design of complex web applications can be a daunting task. This is due both to the complex nature of the tasks, and to the biased alignment of stakeholders, who often do not have an analytical understanding of their own needs and goals, and the current, mainly analytical, requirement analysis methods. The paper presents the method, its relationship with existing requirements analysis methods, and some case studies.
Offshoring Test Automation: Observations and Lessons Learned
Authors: Ilkka Tervonen, Timo Mustonen
Venue: Proceedings of the 2009 Fourth IEEE International Conference on Global Software Engineering (2009)

Offshoring (offshore outsourcing) is increasingly used in software-centric projects, specifically in the development phases of software projects. Using a mixture of onsite local staff and remote offshore staff in business-centric projects, such as business consulting, requirements elicitation and software testing, put many challenges to team organizing, charter definition and offshore personnel skills. This study considers challenges of test automation in a company which has been doing offshoring before. The challenges were studied with three test automation offshoring cases that were carried out by Nokia Oyj. Although the subcontractors fulfilled the expectations set by the customer in all cases,subcontractors’ unfamiliarity with test tools to be used and with software to be tested caused extra meetings and training sessions. Lack of resources in the customer’s side also caused additional maintenance work onshore.
An Enhanced Approach of Indoor Location Sensing Using Active RFID
Authors: Xuejing Jiang, Ye Liu, Xiaolei Wang
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

This paper aims to locate a tag position inside the building by using low cost device with minimal location error. The enhancement approach with Received Signal Strength Indication (RSSI) technique is proposed to achieve the target. In this paper, after introducing the existing LANDMARC system, we try to construct the relationship between RSSI and distance from Reader to Tag by experiment. Finally, an enhanced approach to reach higher accuracy of indoor localization is proposed. The proposed enhancement approach utilizes the strategy of putting the tracking tag and its k nearest reference tags in a set, then repeating to calibrate the target coordinate by the error corrections which obtained by members of this set. It is a recursive data processing approach. The calibration will continue until the tracking tag’s coordinate tend to be a stable value. Simulation and experimental comparison are also shown here to prove that the accuracy of localization is improved.