ppxscal/embedding_network huggingface dataset:
Reverse Pricing in Supply Chains: An Assessment of Sourcing Strategies
Authors: Yll Mujaj, Joerg Leukel, Stefan Kirn
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

Reverse pricing as a special form of dynamic pricing has become a growing interest in e-commerce. It gives buyers an active role: The price of a transaction is not given by the supplier, but is mainly determined by the buyer's bid. This paper extends the coverage of current reverse pricing models to sourcing. The reason is that sourcing strategies, such as global, local, and multiple sourcing, greatly determine both structure and behavior of supply chains. The contribution is a new coordination mechanism that integrates reverse pricing and sourcing strategies. Our simulation study shows that this mechanism helps reducing order and inventory variances.
Web Design in Easy Steps, 4th edition
Authors: Richard Quick
Venue:  (2007)

Among the millions of websites on the Internet, there are few that truly stand out as both aesthetically pleasing and financially successful. Web Design in Easy Stepsguides the reader through the steps necessary to execute an attractive and well-visited website. Beginning from the initial planning and setup, and moving on to the basics of site promotion, everything in this guide is explained in simple, user-friendly language.
Implementation of the reconfiguration port scheduling on the erlangen slot machine
Authors: Florian Dittmann, Elmar Weber, Norma Montealegre
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

Despite the possibility to execute several hardware tasks in parallel on an FPGA, partial reconfiguration is sequential. There exist only one reconfiguration port which is used exclusively during the reconfiguration of a task. Single processor scheduling algorithms for task reconfiguration with preemption are evaluated in a real time application implemented on the Erlangen Slot Machine. The Erlangen Slot Machine besides having reconfigurable connection of peripherals to pins of the FPGA, offers a large Virtex II FPGA, in which a reasonable number of slots can be implemented. In the example, the scheduling algorithm is implemented on the PowerPC processor available on the board. Among other results, preemption in the reconfiguration phase is shown.
Development of a Legible Deaf-Signing Virtual Human
Authors: F. Pezeshkpour, I. Marshall, R. Elliott, J. A. Bangham
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Many deaf people rely on sign language as their primary mode of communication. They will enjoy enhanced information access if media applications can provide signed commentaries. The advent of multimedia makes such provision possible. We outline here a prototype real-time subtitle-to-signing translation system, based on the adaptation and integration of existing software components. We describe the development of a framework, using the Tcl/Tk environment, that supports the integration of distributed system components using a basic communications infrastructure. We discuss the development of a virtual human (avatar), deployed in this framework, to perform the signing.
Rules and Apriori Algorithm in Non-deterministic Information Systems
Authors: Hiroshi Sakai, Ryuji Ishibashi, Kazuhiro Koba, Michinori Nakata
Venue: Transactions on Rough Sets IX (2008)

This paper presents a framework of rule generation in Non-deterministic Information Systems (NISs), which follows rough sets based rule generation in Deterministic Information Systems (DISs). Our previous work about NISs coped with certain rules, minimal certain rules and possible rules. These rules are characterized by the concept of consistency. This paper relates possible rules to rules by the criteria support and accuracy in NISs. On the basis of the information incompleteness in NISs, it is possible to define new criteria, i.e., minimum support, maximum support, minimum accuracy and maximum accuracy. Then, two strategies of rule generation are proposed based on these criteria. The first strategy is Lower Approximation strategy, which defines rule generation under the worst condition. The second strategy is Upper Approximation strategy, which defines rule generation under the best condition. To implement these strategies, we extend Apriori algorithm in DISs to Apriori algorithm in NISs. A prototype system is implemented, and this system is applied to some data sets with incomplete information.
An entity-based integration framework for modeling and evaluating data enhancement products
Authors: Greg Holland, John Talburt
Venue: Journal of Computing Sciences in Colleges (2009)

This paper describes ongoing research to develop a comprehensive, formal framework for modeling and analyzing information products derived through multi-source, entity-based integration. It describes how a previously proposed framework for defining integration selection operators can be extended to model data enhancement products, and suggests a methodology for evaluating such products based on four key factors - entities, attributes, utility, and cost. Even though many organizations make substantial investments in developing and maintaining entity-based enhancement products, little work has been done to develop evaluation models that accurately assess the impact of adding, dropping, or replacing sources in an effort to optimize the quality and economic performance of the product.
Symbolic computation of Jacobi elliptic function solutions to nonlinear differential-difference equations
Authors: Xuelin Yong, Xin Zeng, Zhiyong Zhang, Yufu Chen
Venue: Computers Mathematics with Applications (2009)

In this paper, an algorithm is presented to find exact polynomial solutions of nonlinear differential-difference equations(DDEs) in terms of the Jacobi elliptic functions. The key steps of the algorithm are illustrated by the discretized mKdV lattice. A Maple package JACOBI is developed based on the algorithm to automatically compute special solutions of nonlinear DDEs. The effectiveness of the package is demonstrated by applying it to a variety of equations.
A comparison of programming models for multiprocessors with explicitly managed memory hierarchies
Authors: Scott Schneider, Jae-Seung Yeom, Benjamin Rose, John C. Linford, Adrian Sandu, Dimitrios S. Nikolopoulos
Venue: ACM SIGPLAN Notices (2009)

On multiprocessors with explicitly managed memory hierarchies (EMM), software has the responsibility of moving data in and out of fast local memories. This task can be complex and error-prone even for expert programmers. Before we can allow compilers to handle this complexity for us, we must identify the abstractions that are general enough to allow us to write applications with reasonable effort, yet specific enough to exploit the vast on-chip memory bandwidth of EMM multi-processors. To this end, we compare two programming models against hand-tuned codes on the STI Cell, paying attention to programmability and performance. The first programming model, Sequoia, abstracts the memory hierarchy as private address spaces, each corresponding to a parallel task. The second, Cellgen, is a new framework which provides OpenMP-like semantics and the abstraction of a shared address space divided into private and shared data. We compare three applications programmed using these models against their hand-optimized counterparts in terms of abstractions, programming complexity, and performance.
Average-Price-per-Reward Games on Hybrid Automata with Strong Resets
Authors: Marcin Jurdziński, Ranko Lazić, Michał Rutkowski
Venue: Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (2008)

We study price-per-reward games on hybrid automata with strong resets. They generalise priced games previously studied and have applications in scheduling. We obtain decidability results by a translation to a novel class of finite graphs with price and reward information, and games assigned to edges. The cost and reward of following an edge are determined by the outcome of the edge game that is assigned to it.
A lock-free, concurrent, and incremental stack scanning for garbage collectors
Authors: Gabriel Kliot, Erez Petrank, Bjarne Steensgaard
Venue: Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments (2009)

Two major efficiency parameters for garbage collectors are the throughput overheads and the pause times that they introduce. Highly responsive systems need to use collectors with as short as possible pause times. Pause lengths have decreased significantly during the years, especially through the use of concurrent garbage collectors. For modern concurrent collectors, the longest pause is typically created by the need to atomically scan the runtime stack. All practical concurrent collectors that we are aware of must obtain a snapshot of the pointers on each thread's runtime stack, in order to reclaim objects correctly. To further reduce the length of the collector pauses, incremental stack scans were proposed. However, previous such methods employ locks to stop the mutator from accessing a stack frame while it is being scanned. Thus, these methods introduce a potential long and unpredictable pauses for a mutator thread. In this work we propose the first concurrent, incremental, and lock-free stack scanning for garbage collectors, allowing high responsiveness and support for programs that employ fine-synchronization to avoid locks. Our solution can be employed by all concurrent collectors that we are aware of, it is lock-free, it imposes a negligible overhead on the program execution, and it supports the special in-stack references existing in languages like C#.
DELHAIZE
Authors: Jean-François Bourrel
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

Television commercial broadcast in Belgium. Part of the Christmas campaign of the commissioning company, Delhaize.
Finite element approximation of elliptic partial differential equations on implicit surfaces
Authors: Martin Burger
Venue: Computing and Visualization in Science (2009)

The aim of this paper is to investigate finite element methods for the solution of elliptic partial differential equations on implicitly defined surfaces. The problem of solving such equations without triangulating surfaces is of increasing importance in various applications, and their discretization has recently been investigated in the framework of finite difference methods. For the two most frequently used implicit representations of surfaces, namely level set methods and phase-field methods, we discuss the construction of finite element schemes, the solution of the arising discretized problems, and provide error estimates. The convergence properties of the finite element methods are illustrated by computations for several test problems.
On the race of worms, alerts, and patches
Authors: Milan Vojnovic, Ayalvadi J. Ganesh
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

We provide an analytical framework for evaluating the performance of automatic patching systems. We use it to quantify the speed of patch or alert dissemination required for worm containment. Motivated by scalability and trust issues, we consider a hierarchical system where network hosts are organized into subnets, each containing a patch server (termed superhost). Patches are disseminated to superhosts through an overlay connecting them and, after verification, to end hosts within subnets. The analytical framework accommodates a variety of overlays through the novel abstraction of a minimum broadcast curve. It also accommodates filtering of scans across subnets. The framework provides quantitative estimates that can guide system designers in dimensioning automatic patching systems. The results are obtained mathematically and verified by simulation.
Optimal tuning of PID controllers for MIMO bilinear plants
Authors: M. M. Chaikovskii, I. B. Yadykin
Venue: Automation and Remote Control (2009)

An optimal method is proposed for tuning PID controllers for bilinear MIMO plants in the state-space description when the input signals are piece-wise functions of time. The design method for the parameters of the controller is based on optimizing the proximity of the transient responses in the open-loop system and its implicit reference model. The parameters of the bilinear MIMO plant are estimated via parametric identification algorithms and then used in the tuning algorithms. Optimal tuning algorithms are designed for continuous-time PID controllers for bilinear systems. A numerical example of tuning the parameters of a two-channel controller for a bilinear plant is presented. The synthesized controller is shown to demonstrate good performance over a wide range of coordinate-parametric inputs.
An IPv6 Wireless Sensor Network Node-TaraxNode
Authors: Yao XiangMin, Wang WenYong, Xiang Yu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

This paper presents the IPv6 Wireless Sensor Network platform system TaraxNode. It is designed and implemented with independent intellectual property rights. For effectively monitoring, we developed TaraxOS, which includes a cluster-based self-organized multi-hop routing protocol. It is a multi-task, high-powered, low energy-consumed operating system for sensor nodes. TaraxNode containing heterogeneous elements provides numerous benefits at the traditional intelligent monitor system. It is mainly composed of a low power consumed MCU TaraxCore and WSN data acquired unit etc. When applied at the Central air-condition intelligent monitor and control system, it gives excellent result.
Key Rate Available from Mismatched Measurements in the BB84 Protocol and the Uncertainty Principle
Authors: Ryutaroh Matsumoto, Shun Watanabe
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

We consider the mismatched measurements in the BB84 quantum key distribution protocol, in which measuring bases are different from transmitting bases. We give a lower bound on the amount of a secret key that can be extracted from the mismatched measurements. Our lower bound shows that we can extract a secret key from the mismatched measurements with certain quantum channels, such as the channel over which the Hadamard matrix is applied to each qubit with high probability. Moreover, the entropic uncertainty principle implies that one cannot extract the secret key from both matched measurements and mismatched ones simultaneously, when we use the standard information reconciliation and privacy amplification procedure.
CATIA V5 Tutorials Mechanism Design & Animation
Authors: Jonathan M. Weaver, Nader G. Zamani
Venue:  (2007)

This book of tutorials is intended as a training guide for those who have a basic familiarity with part and assembly modeling in CATIA V5 Release 16 wishing to create and simulate the motion of mechanisms within CATIA Digital Mock Up (DMU). The tutorials are written so as to provide a hands-on look at the process of creating an assembly, developing the assembly into a mechanism, and simulating the motion of the mechanism in accordance with some time based inputs. The processes of generating movie files and plots of the kinematic results are covered. The majority of the common joint types are covered. Students majoring in engineering/technology, designers using CATIA V5 in industry, and practicing engineers can easily follow the book and develop a sound yet practical understanding of simulating mechanisms in DMU. Table of Contents 1. Introduction 2. A Block with Constant Acceleration along a Prismatic Joint 3. An Arm Rotating about a Revolute Joint 4. Slider Crank Mechanism 5. Sliding Ladder 6. A Gearing Mechanism 7. Ellipse Generator Mechanism 8. Cam-Follower Mechanism 9. Planetary Gear Mechanism 10. Telescopic Mechanism 11. Robotic Arm 12. Single Cylinder Engine 13. Universal Joint Mechanism 14. C-clamp Mechanism 15. A Mechanism with Coriolis Acceleration 16. Prelude to Human Builder Workbench 17. Exercises Appendix I: Additional Functionalities, Tips and Tricks
Evaluation of a tool-mounted guidance display for computer-assisted surgery
Authors: Kevin Kassil, A. James Stewart
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

We attached a small LCD display and video camera to a surgical drill. The LCD shows the tool position with respect to a planned trajectory, overlaid on video captured by the camera. We performed a user study to determine whether such a tool-mounted guidance display yields faster and more accurate tool placement than the conventional guidance display on a separate computer monitor. Our study showed that the tool-mounted display provides better positional and angular accuracy than the conventional display but that the video camera provides no significant improvement in error.
A New Multiple Kernel Approach for Visual Concept Learning
Authors: Jingjing Yang, Yuanning Li, Yonghong Tian, Lingyu Duan, Wen Gao
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

In this paper, we present a novel multiple kernel method to learn the optimal classification function for visual concept. Although many carefully designed kernels have been proposed in the literature to measure the visual similarity, few works have been done on how these kernels really affect the learning performance. We propose a Per-Sample Based Multiple Kernel Learning method (PS-MKL) to investigate the discriminative power of each training sample in different basic kernel spaces. The optimal, sample-specific kernel is learned as a linear combination of a set of basic kernels, which leads to a convex optimization problem with a unique global optimum. As illustrated in the experiments on the Caltech 101 and the Wikipedia MM dataset, the proposed PS-MKL outperforms the traditional Multiple Kernel Learning methods (MKL) and achieves comparable results with the state-of-the-art methods of learning visual concepts.
A data model for trip planning in multimodal transportation systems
Authors: Joel Booth, Prasad Sistla, Ouri Wolfson, Isabel F. Cruz
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

This paper introduces the problem of modeling urban transportation systems in a database where certain aspects of the data are probabilistic in nature. The transportation network is composed of multiple modes (e.g., automobile, bus, train, pedestrian) that the user can alternate between. A trip -- a path between an origin and destination subject to some constraints -- is the central concept. How these trips and the network can be represented as both a graph and relational model, as well as the requirements for querying are the main contributions of this paper. A set of operators are defined to work over these transportation concepts and they are integrated within a SQL-like syntax to express queries over the uncertain transportation network. Additionally, the paper shows how this model can be integrated within other moving objects and spatio-temporal data models, and how these graph-based queries can be processed.
Fixed rank solutions of the matrix equation with statistical applications
Authors: Y. Liu
Venue: International Journal of Computer Mathematics (2009)

By applying the canonical correlation decomposition of matrix pairs, the general fixed rank least square solutions of matrix equation Xβ=Y are derived. As statistical applications, an algorithm for computing the least square estimator of the multivariate reduced rank regression model Y=Xβ+ε, r(β)=t is given.
Reversible image hiding scheme using predictive coding and histogram shifting
Authors: Piyu Tsai, Yu-Chen Hu, Hsiu-Lien Yeh
Venue: Signal Processing (2009)

In this paper, a reversible image hiding scheme based on histogram shifting for medical images is proposed. As we know, the histogram-based reversible data hiding is limited by the hiding capacity, which is influenced by the overhead of position information that has to be embedded in the host image. To solve this problem, the similarity of neighboring pixels in the images was explored by using the prediction technique and the residual histogram of the predicted errors of the host image was used to hide the secret data in the proposed scheme. In addition, the overlapping between peak and zero pairs was used to further increase the hiding capacity. According to the experimental results, a higher hiding capacity was obtained and a good quality stego-image was preserved in the proposed scheme. The hiding capacity provided by the proposed scheme was approximately three times that of the original histogram-based method. Compared to the histogram-based method, the quality of the stego-image improved about 1.5dB when the same amounts of secret data were embedded.
Comparison of estimated reference evapotranspiration by using neural networks in the Sahelian zone
Authors: Seydou Traore, Yu-Min Wang, Tienfuan Kerh
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The irrigation management in Burkina Faso still faced to climatic data unavailability for estimating the ETo with the recommended Penman-Monteith (PM) equation. Recently, to overcome the climatic data unavailability difficulty, a reference model for Burkina Faso (RMBF) using only temperature as input has been developed for irrigation management purpose in two production sites, Banfora and Ouagadougou. In this study, four alternative methods to PM, including the generalized regression neural network (GRNN), RMBF, Hargreaves (HRG) and Blaney-Criddle (BCR) were employed to study their performances in three production sites, Dori, Bogande and Fada N'gourma. The minimum climatic data were set to the maximum and minimum air temperature as input variables collected from 1996 to 2006. The performance from GRNN was higher than RMBF, HRG and BCR. In addition, by the typical Sahelian climatic condition, the wind velocity has been found as a sensitive parameter in the ETo estimation. Obviously, using GRNN with limited climatic variables for ETo estimation is more reliable than the other alternative methods.
Over the mortar finite element method
Authors: Razvan Raducanu
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

The present paper introduces a possible implementation of the mortar finite element method in electrostatics. It presents the equations of the linear electrostatics, and the main features of the mortar finite element method in contrast to the classical finite element method [6]. Within the frame of the mortar finite element method one can couple different discretization schemes, the method being famous over its flexibility. In order to facilitate an easier way to couple the discretization schemes involved we will take advantage of a dual Lagrange multiplier space. The mortar finite element method is used to solve a plane problem in the context of linear electrostatics. An algorithm for implementing numerically this method is also proposed. Finally, a numerical example is discussed and conclusions are drawn.