ppxscal/embedding_network huggingface dataset:
Reflected Brownian motion in the quadrant: tail behavior of the stationary distribution
Authors: J. Michael Harrison, John J. Hasenbein
Venue: Queueing Systems: Theory and Applications (2009)

Let Z be a two-dimensional Brownian motion confined to the non-negative quadrant by oblique reflection at the boundary. Such processes arise in applied probability as diffusion approximations for two-station queueing networks. The parameters of Z are a drift vector, a covariance matrix, and a "direction of reflection" for each of the quadrant's two boundary rays. Necessary and sufficient conditions are known for Z to be a positive recurrent semimartingale, and they are the only restrictions imposed on the process data in our study. Under those assumptions, a large deviations principle (LDP) is conjectured for the stationary distribution of Z, and we recapitulate the cases for which it has been rigorously justified. For sufficiently regular sets B, the LDP says that the stationary probability of xB decays exponentially as x¿¿, and the asymptotic decay rate is the minimum value achieved by a certain function I(¿) over the set B. Avram, Dai and Hasenbein (Queueing Syst.: Theory Appl. 37, 259---289, 2001) provided a complete and explicit solution for the large deviations rate function I(¿). In this paper we re-express their solution in a simplified form, showing along the way that the computation of I(¿) reduces to a relatively simple problem of least-cost travel between a point and a line.
Data Stream Algorithms via Expander Graphs
Authors: Sumit Ganguly
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

We present a simple way of designing deterministic algorithms for problems in the data stream model via lossless expander graphs. We illustrate this by considering two problems, namely, k-sparsity testing and estimating frequency of items.
The theoretical foundation and validity of a component-based usability questionnaire
Authors: W. -P. Brinkman, R. Haakma, D. G. Bouwhuis
Venue: Behaviour & Information Technology (2009)

Although software engineers extensively use a component-based software engineering (CBSE) approach, existing usability questionnaires only support a holistic evaluation approach, which focuses on the usability of the system as a whole. Therefore, this paper discusses a component-specific questionnaire for measuring the perceived ease-of-use of individual interaction components. A theoretical framework is presented for this compositional evaluation approach, which builds on Taylor's layered protocol theory. The application and validity of the component-specific measure is evaluated by re-examining the results of four experiments. Here, participants were asked to use the questionnaire to evaluate a total of nine interaction components used in a mobile phone, a room thermostat, a web-enabled TV set and a calculator. The applicability of the questionnaire is discussed in the setting of a new usability study of an MP3 player. The findings suggest that at least part of the perceived usability of a product can be evaluated on a component-based level.
Harnessing AutoCAD Civil 3D 2009, 1st edition
Authors: Phillip J. Zimmerman
Venue:  (2008)

Focusing on best practice and presenting relevant exercises that familiarizing users with the commands, design components, and software tools, Harnessing AutoCAD Civil 3D 2009 offers all the information needed to learn the fundamentals of this widely used civil engineering program. The books comprehensive coverage includes straightforward explanations of program functionality plus exercises demonstrating how its concepts fit into civil engineering design. The books logical organization fully lays out the process for performing all of the tasks required to create Civil 3D objects.
Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
Authors: Alfred Auslender, Marc Teboulle
Venue: Mathematical Programming: Series A and B (2009)

We study subgradient projection type methods for solving non-differentiable convex minimization problems and monotone variational inequalities. The methods can be viewed as a natural extension of subgradient projection type algorithms, and are based on using non-Euclidean projection-like maps, which generate interior trajectories. The resulting algorithms are easy to implement and rely on a single projection per iteration. We prove several convergence results and establish rate of convergence estimates under various and mild assumptions on the problem&#x2019;s data and the corresponding step-sizes.
Unifying simulation and optimization of strategic sourcing and transportation
Authors: Malak Al-Nory, Alexander Brodsky
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Proposed and developed is a framework and an extensible library of simulation modeling components for strategic sourcing and transportation. The components include items, suppliers, volume-discount schedules, aggregators, procurement rules, and less-than-truck-load delivery. Service models are classes in the Java programming language extended with decision variables, assertions, and business objective constructs. The optimization semantics of the framework is based on finding an instantiation of real values into the decision variables in the service object constructor, that satisfies all the assertions and leads to the optimal business objective. The optimization is not done by repeated simulation runs, but rather by automatic compilation of the simulation model in Java into a mathematical programming model in AMPL and solving it using an external solver.
Streamlining office procedures: an analysis using the information control net model
Authors: Carolyn L. Cook
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The purpose of this paper is to acquaint the reader with a model for office procedures, the Information Control Net model, and a particular type of transformation that can be performed on an Information Control Net (ICN) model, streamlining. The ICN formalism is intended to aid office managers and office analysts in describing and evaluating procedures. Streamlining is a technique for reducing the ICN model of a procedure to a model of the necessary information flow and elementary information-processing of the procedure. Streamlining highlights the origin and destination of information in a procedure and allows the modeler to vary the route the information takes. Streamlining an ICN model of a procedure illuminates information-processing needs, activity by activity, in a way that may be useful for evaluating or changing the original procedure.
An approach to detecting relevant updates to cached data using XML and active databases
Authors: Essam Mansour, Hagen Höpfner
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Client/server information systems use caching techniques to reduce the volume of transmitted data as well as response time and, especially in the case of systems with mobile clients, to reduce energy consumptions. Updating the server database might cause inconsistencies between server data and cached data. Guaranteeing consistency at least demands to invalidate outdated caches. To avoid invalidation of caches that are not affected by a particular update one must check the relevancy of each update for each cache. It has been proven, that this can only be done on a stateful server. This paper presents the purely database system (DBS) based DRUpE method for checking the relevance of server side updates to cached data by analyzing the intersection between modified data and cached data. A non-empty intersection means that the update operations are relevant to the cached data. The necessary cache descriptions are stored in form of XML-documents inside the DBS. The paper introduces the used XML-model XReal as well as the relevancy proof-of-concept system Uptime. The main contribution of our work is that the system utilizes the DBS utilities to detect update relevance, notify clients and manage the required repository of the queries issued by the clients. Hence, no additional middleware is required in order to realize consistency aware client/server information systems, even if clients are small footprinted mobile devices.
Digital Signal Processing: A Practitioner's Approach
Authors: Kaluri V. Rangarao, Ranjan K. Mallik
Venue:  (2006)

Digital signal processing is essential for improving the accuracy and reliability of a range of engineering systems, including communications, networking, and audio and video applications. Using a combination of programming and mathematical techniques, it clarifies, or standardizes the levels or states of a signal, in order to meet the demands of designing high performance digital hardware. Written by authors with a wealth of practical experience working with digital signal processing, this text is an excellent step-by-step guide for practitioners and researchers needing to understand and quickly implement the technology. Split into six, self-contained chapters, Digital Signal Processing: A Practitioners Approach covers: basic principles of signal processing such as linearity, stability, convolution, time and frequency domains, and noise; descriptions of digital filters and their realization, including fixed point implementation, pipelining, and field programmable gate array (FGPA) implementation; Fourier transforms, especially discrete (DFT), and fast Fourier transforms (FFT); case studies demonstrating difference equations, direction of arrival (DoA), and electronic rotating elements, and MATLAB programs to accompany each chapter. A valuable reference for engineers developing digital signal processing applications, this book is also a useful resource for electrical and computer engineering graduates taking courses in signal processing.
Back to Interval Temporal Logics
Authors: Angelo Montanari
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Interval-based temporal reasoning naturally arises in a variety of fields, including artificial intelligence (temporal knowledge representation, systems for temporal planning and maintenance, qualitative reasoning, theories of events), theoretical computer science (specification and design of hardware components, concurrent real-time processes), temporal databases (event modeling, temporal aggregation), and computational linguistics (analysis of progressive tenses, semantics and processing of natural languages) [10].
Periodic review stochastic inventory models with service level constraint
Authors: Chih-Young Hung, Kuo-Chen Hung, Wen-Han Tang, Robert Lin, Chi-Kae Wang
Venue: International Journal of Systems Science (2009)

This article considers the periodic review stochastic inventory models with service level constraint to provide an improved solution procedure. The previous researchers assumed that the objective function is concave down in the lead time so that the minimum must occur on the boundary points of each sub-domain. In this article, we will show that their assumption is questionable since the minimum might not occur at the boundary points of each sub-domain. In a recent paper in International Journal of Systems Science, Ouyang and Chuang studied this problem. However, their solutions contained questionable results and their algorithm might not find the optimal solution due to flaws in their solution procedure. We develop some lemmas to reveal the parameter effects and then present our improved solution procedures for finding the optimal solution for periodic review stochastic inventory models in which the lead time demand is a normal distribution. The savings are illustrated by solving the same examples from Ouyang and Chuang's paper to demonstrate the improvement using our revised algorithm. In the direction of future research, we discuss the comparison between the reordered point being fixed and the reordered point as a new variable.
Centralized Multisensor Unscented Joint Probabilistic Data Association Algorithm
Authors: Xu-jun Guan, Guo-Sheng Rui, Xu Zhou, Xiao-ping Xie
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

A centralized multisensor unscented joint probabilistic data association algorithm, CMSUJPDA, is proposed for the multisensor multitarget tracking problem of the nonlinear system in clutter. In the algorithm, UKF is used for the propagation of state distribution in the nonlinear system at first. Then the association of measurements to track is implemented according to the method of JPDA. Based on this, the CMSUJPDA algorithm is derived by use of the idea of sequential MSJPDA. Due to higher order of accuracy of UKF than EKF, the association probabilities and state estimates in our algorithm are not affected by the linearization error. Hence compared with MSJPDA/EKF, the accuracy and robustness of CMSUJPDA are more favorable. Finally simulation results show the superiority of the proposed algorithm.
A fusion-based approach to digital movie restoration
Authors: Lucia Maddalena, Alfredo Petrosino, Giuliano Laccetti
Venue: Pattern Recognition (2009)

Many algorithms have been proposed in literature for digital movie restoration; unfortunately, none of them ensures a perfect result whichever is the image sequence to be restored. Here we propose a new digital scratch restoration algorithm which achieves accuracy results higher than that of already existing algorithms and naturally adapts for implementation into high-performance computing environments. The basic idea of the proposed algorithm is to adopt several relatively well-settled algorithms for the problem at hand and combine obtained results through suitable image fusion techniques, with the aim of taking advantage of the adopted algorithms' capabilities and, at the same time, limiting their deficiencies. Extensive experiments on real image sequences deeply investigate both accuracy results of the presented scratch restoration approach, which is shown to outperform other existing approaches, and performance of its parallel implementation, which allows for real-time restoration.
Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
Authors: Alfonso E. Gerevini, Patrik Haslum, Derek Long, Alessandro Saetti, Yannis Dimopoulos
Venue: Artificial Intelligence (2009)

The international planning competition (IPC) is an important driver for planning research. The general goals of the IPC include pushing the state of the art in planning technology by posing new scientific challenges, encouraging direct comparison of planning systems and techniques, developing and improving a common planning domain definition language, and designing new planning domains and problems for the research community. This paper focuses on the deterministic part of the fifth international planning competition (IPC5), presenting the language and benchmark domains that we developed for the competition, as well as a detailed experimental evaluation of the deterministic planners that entered IPC5, which helps to understand the state of the art in the field. We present an extension of pddl, called pddl3, allowing the user to express strong and soft constraints about the structure of the desired plans, as well as strong and soft problem goals. We discuss the expressive power of the new language focusing on the restricted version that was used in IPC5, for which we give some basic results about its compilability into pddl2. Moreover, we study the relative performance of the IPC5 planners in terms of solved problems, CPU time, and plan quality; we analyse their behaviour with respect to the winners of the previous competition; and we evaluate them in terms of their capability of dealing with soft goals and constraints, and of finding good quality plans in general. Overall, the results indicate significant progress in the field, but they also reveal that some important issues remain open and require further research, such as dealing with strong constraints and computing high quality plans in metric-time domains and domains involving soft goals or constraints.
Research of Welding Robot Controlled by PMAC and ARM Two Processors
Authors: Xingang Miao, Su Wang, Zheng Yan, Jiang Chen
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

Using the Delta Tau’s PMAC (Programmable Multi-Axis Controller) as the kernel of control, which can carry out all sorts of algorithm in welding robot. Using Philips’ ARM (Advance RISC Machines) as the kernel of peripheral interface, so it can communicate with PMAC by RS-232C, it can communicate with laser seam tracking system by another RS-232C, it can communicate with robot manipulator by CAN-bus, it can communicate with welding machine by Ethernet, and it can communicate with host PC by USB. Using µC/OS-II as operating system in this ARM-based processor, which makes customer’s software Real-time and robust.
Parallel iterative methods for parabolic equations
Authors: Wenrui Hao, Shaohong Zhu
Venue: International Journal of Computer Mathematics (2009)

For the problems of the parabolic equations in one-and two-dimensional space, the parallel iterative methods are presented to solve the fully implicit difference schemes. The methods presented are based on the idea of domain decomposition in which we divide the linear system of equations into some non-overlapping sub-systems, which are easy to solve in different processors at the same time. The iterative value is proved to be convergent to the difference solution resulted from the implicit difference schemes. Numerical experiments for both one-and two-dimensional problems show that the methods are convergent and may reach the linear speed-up.
Simulation of the research process
Authors: Muaz Niazi, Abdul Rauf Baig, Amir Hussain, Saeed Bhatti
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper presents first steps towards the development of a formal model of the research process. We evaluate the use of simulation as a tool for the evaluation of research strategies in nascent research organizations faced with the absence of significant data. We start by modeling the research process by using the "Publish or Perish" paradigm, a well-known criteria of evaluation of research. We demonstrate the use of this model for researchers to evaluate the effects of selection of a particular publishing venue over time. We then perform various experiments using this basic idea. By means of various visualization techniques, we see how researchers with similar publishing policies might self-organize in the form of groups. We also evaluate the effects of giving higher weights to articles in journals and see where the effects of publishing in these venues breaks even for both top as well as average acceptance rates.
Design and implementation of PLC-based monitoring control system for three-phase induction motors fed by PWM inverter
Authors: Yasar Birbir, H. Selcuk Nogay
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

This paper presents a design and implementation of a monitoring and control system for the three-phase induction motor based on programmable logic controller (PLC) technology. Also, the implementation of the hardware and software for speed control and protection with the results obtained from tests on induction motor performance is provided. The PLC correlates the operational parameters to the speed requested by the user and monitors the system during normal operation and under trip conditions. Tests of the induction motor system driven by inverter and controlled by PLC prove a higher accuracy in speed regulation as compared to a conventional V/f control system. The efficiency of PLC control is increased at high speeds up to 95% of the synchronous speed. Thus, PLC proves themselves as a very versatile and effective tool in industrial control of electric drives.
A Novel Trust-based Cooperative Node Selection Scheme in Wireless Sensor Networks
Authors: Yu Zhang, Qiongli Liu, Yueming Cai, Weiwei Yang, Youyun Xu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

For communication between the cluster head node (CHN) and the distant data fusion center (DFC) with the cooperation of intra-cluster nodes in wireless sensor networks (WSNs), reliable handling of packets by the cooperative node (CN) is difficult to ensure. In this paper, we propose a novel CN selection scheme based on trust for WSNs. This scheme can choose one of high trust nodes to assist in the transmission of CHN, which aims to improve the transmission performance over cooperative communication in the presence of potential malicious nodes. First, we establish a trust model to improve the reliability of transmission by CN in WSNs, which is based on both the direct trust and the indirect trust of nodes. Then the CHN selects a node based on the proposed trust model to aid the CHN in transmission. Simulation results show that the proposed scheme can mitigate the impact of the potential malicious nodes on transmission performance and the simulation results also demonstrate the efficiency of the proposed scheme.
A vision based human robot interface for robotic walkthroughs in a biotech laboratory.
Authors: Martin Wojtczyk, Giorgio Panin, Claus Lenz, Thorsten Röder, Suraj Nair, Erwin Roth, Alois Knoll, Rüdiger Heidemann, Klaus Joeris, Chun Zhang, Mark Burnett, Tom Monica
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

Both Robots and Personal Computers established new markets about 30 years ago and were enabling factors in Automation and Information Technology. However, while you can see Personal Computers in almost every home nowadays, the domain of Robots in general still is mostly restricted to industrial automation. Due to the physical impact of robots, a safe design is essential, which most robots still lack of and therefore prevent their application for personal use, although a slow change can be noticed by the introduction of dedicated robots for specific tasks, which can be classified as service robots. Moreover, as more and more robots are designed as service robots, their developers face the challenge of reducing the machines' complexity and providing smart user interface methods. Ideally the robot would be able to cooperate with a human, just like another human would.