ppxscal/embedding_network huggingface dataset:
On a Queueing NetWork Model for Cellular Mobile Telecommunications Networks
Authors: Richard J. Boucherie, Nico M. Van Dijk
Venue: Operations Research (2000)

This paper presents a queueing network description of a cellular mobile communications network. These cellular networks are characterised by the call lengths, the fresh call arrival rate, and the handover rates, as well as the capacity restrictions on the number of calls because of limited bandwidth. In the resulting queueing network the routing probabilities depend on the age of the customers. This queueing network is amenable to analysis via known methods. In particular, insensitivity results are generalised to also include capacity restrictions under age-dependent routing and to include call holding time distributions of customers moving from one queue to another.
E-banking and customer preferences in Malaysia: an empirical investigation
Authors: M. Sadiq Sohail, Balachandran Shanmugham
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

This paper examines the current trends in the e-commerce revolution that has set in motion in the Malaysian banking sector and reports on an empirical research that was carried out in Malaysia to study the customers' preference for electronic banking and the factors, which they considered influenced the adoption of electronic banking. Results based on the analysis of data relating to 300 respondents indicate that while there is no significant differences between the age and educational qualifications of the electronic and conventional banking users, some differences exists on other demographic variables. Analysis further reveals that accessibility of Internet, a wareness of e-banking, and customers' reluctance to change are the factors that significantly affected the usage of e-banking in Malaysia. The paper discusses on the implications of these. Limitations of the study are highlighted and further research directions are suggested.
Interactive mathematics textbooks
Authors: Robert Sinclair
Venue: ACM SIGPLAN Notices (2003)

An interactive mathematics textbook presupposes the existence of a language in which it may be written. We approach the specification of such a language from the point of view of what functions it must perform. Special attention needs to be paid to a clear separation of the roles of the author and the reader. We present examples created with the help of a prototype interactive viewer.
A Self-Efficacy Theory Explanation for the Management of Remote Workers in Virtual Organizations
Authors: D. Sandy Staples, John S. Hulland, Christopher A. Higgins
Venue: Organization Science (1999)

The current study is a first step in investigating how virtual organizations can manage remote employees effectively. The research used self-efficacy theory to build a model that predicts relationships between antecedents to employees' remote work self-efficacy assessments and their behavioral and attitudinal consequences. The model was tested using responses from 376 remote managed employees in 18 diverse organizations. Overall, the results indicated that remote employees' self-efficacy assessments play a critical role in influencing their remote work effectiveness, perceived productivity, job satisfaction, and ability to cope. Furthermore, strong relationships were observed between employees' remote work self-efficacy judgments and several antecedents, including remote work experience and training, best practices modeling by management, computer anxiety, and IT capabilities. Because many of these antecedents can be controlled managerially, these findings suggest important ways in which a remote employee's work performance can be enhanced, through the intermediary effect of improved remote work self-efficacy. The current study also provides a basis for future research in the remote work area through its development and testing of a remote management framework.
An Estimation Problem for Quasilinear Stochastic Partial Differential Equations
Authors: I. A. Ibragimov
Venue: Problems of Information Transmission (2003)

A problem of estimating a functional parameter &thetas;(x) and functionals &Phi;(&thetas;) based on observation of a solution u&epsiv;(t, x) of the stochastic partial differential equation du_{\varepsilon}(t) = \sum_{\vert k \vert \leq 2p}ak Dxku&epsiv;dt + &thetas;(x)g(u&epsiv;, t, x) + &epsiv;dw(t) is considered. The asymptotic problem setting, as the noise intensity &epsiv; &rarr; 0, is investigated. 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
Implementing Real-Time Optimization Models: A Case Application From The Motor Carrier Industry
Authors: Warren B. Powell, Arun Marar, Jack Gelfand, Steve Bowers
Venue: Operations Research (2002)

Online models for real-time operations planning face a host of implementation issues that do not arise in more strategic arenas. We use the seemingly simple problem of assigning drivers to loads in the truckload motor carrier industry as an instance to study the issues that arise in the process of implementing a real-time dispatch system. Although the project was moderately successful, our focus is not on documenting the benefits, but rather on summarizing the challenges that arose. The most significant theme running through the implementation hurdles we encountered was the lack of information available to the model. Computers are very good at processing vast quantities of information; humans are very good at challenging the information that is in the computer and augmenting computer-provided data with head knowledge. Our study includes a careful comparison of actual decisions with model recommendations, using a six-month database of actual transactions. This comparison is the first we have seen of its kind and provides the most rigorous evaluation of an online dispatch model that we have seen. Although the model was well used, the results demonstrate that significant improvements could have been obtained if the level of model utilization had been even higher.
Sequential Inspection Under Capacity Constraints
Authors: David D. Yao, Shaohui Zheng
Venue: Operations Research (1999)

We study the inspection process in the context of multistage batch manufacturing, focusing on interstage coordination under capacity limits. The problem is formulated as a constrained Markov decision program. We establish the optimality of a sequential policy that is characterized by a sequence of thresholds, with certain randomization at the thresholds. We further show that such an optimal policy can be completely derived through solving a linear program, and that randomization is needed at no more than two threshold values. We discuss an application in semiconductor wafer fabrication, which motivates our study.
Bayesian analysis of massive datasets via particle filters
Authors: Greg Ridgeway, David Madigan
Venue: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining (2002)

Markov Chain Monte Carlo (MCMC) techniques revolutionized statistical practice in the 1990s by providing an essential toolkit for making the rigor and flexibility of Bayesian analysis computationally practical. At the same time the increasing prevalence of massive datasets and the expansion of the field of data mining has created the need to produce statistically sound methods that scale to these large problems. Except for the most trivial examples, current MCMC methods require a complete scan of the dataset for each iteration eliminating their candidacy as feasible data mining techniques.In this article we present a method for making Bayesian analysis of massive datasets computationally feasible. The algorithm simulates from a posterior distribution that conditions on a smaller, more manageable portion of the dataset. The remainder of the dataset may be incorporated by reweighting the initial draws using importance sampling. Computation of the importance weights requires a single scan of the remaining observations. While importance sampling increases efficiency in data access, it comes at the expense of estimation efficiency. A simple modification, based on the "rejuvenation" step used in particle filters for dynamic systems models, sidesteps the loss of efficiency with only a slight increase in the number of data accesses.To show proof-of-concept, we demonstrate the method on a mixture of transition models that has been used to model web traffic and robotics. For this example we show that estimation efficiency is not affected while offering a 95% reduction in data accesses.
Numerical simulation of some biomechanical problems
Authors: J. Nedoma, Z. Klézl, J. Fousek, Z. Kestřánek, J. Stehlík
Venue: Mathematics and Computers in Simulation (2003)

The paper is concerned with the numerical solution of non-linear conservation laws, and the contribution biomechanical models of spine and of loaded wrist are formulated and analysed. The models are based on a contact problem in non-linear elastic rheology. The stress-strain relation is derived from a positive definite strain energy density function. For a weak solution of the problem, a variational inequality approach is used. Then the secant modules method and the finite element method are applied. First, the model of the weight bearing wrist, and secondly, the model of the Chance's fracture of lumbar spine are discussed.
An alternative faculty recruitment source
Authors: Joanne Sexton
Venue: Journal of Computing Sciences in Colleges (2003)

During the Sixth Annual CCSC Northeastern Conference (April 2001), a panel was convened to discuss faculty recruitment and retention. The purpose of this article is to identify a potential, alternative faculty recruitment source - the military retiree. This article further describes why your program should consider a military retiree as a future faculty member; two recent trends you may want to take advantage of; tips to ensure the success of your new hire; and, who to contact to develop recruitment leads, especially if your institution is not located near a military facility.
Mathematical model of the male urinary tract
Authors: M. Horák, J. Křen
Venue: Mathematics and Computers in Simulation (2003)

The paper presents a simplified mathematical model of the interaction between the urine flow and the male urethra and bladder. Urine is assumed to be a Newtonian fluid. The flow is considered as non-stationary, isothermal and turbulent. The urethra wall, featuring elastic properties, experiences large displacements and strains. The dynamic forces are included in the urethra wall motion. When fully extended the urethra attains the shape of an axisymetric tube. An iterative method based on the uncoupled approach is developed.
A solution to the problem of (A,B)-invariance for series
Authors: Ines Klimann
Venue: Theoretical Computer Science (2003)

The aim of this article is to study a standard problem of control theory, the (A,B)-invariance problem, which amounts to computing a maximal element X subject to conditions of the form AX ≤ X + B and X ≤ K. We give a solution to the problem in the framework of formal series over particular complete idempotent semirings. Over finite idempotent semirings, we show that, under the assumption that B and K are recognizable series, the maximal solution exists and is also recognizable. We obtain a similar result for the infinite tropical semiring, with additional hypothesis that the series A is a language, but the notion of recognizable series has to be extended to the weaker notion of pseudo-recognizable series.
Point matching under non-uniform distortions
Authors: Tatsuya Akutsu, Kyotetsu Kanaya, Akira Ohyama, Asao Fujiyama
Venue: Discrete Applied Mathematics (2003)

This paper discusses the pattern matching problem for points under non-uniform distortions, which arises from the analysis of two-dimensional (2-D) electrophoresis images. First, we provide a formal definition of the problem. Next, we prove that it is NP-hard in two (or more) dimensions. This proof is based on a reduction from planar 3SAT. Then we present a simple polynomial time algorithm for a special and one-dimensional case of the problem, which is based on dynamic programming. We also present a practical heuristic algorithm for identifying a match between two sets of spots in 2-D gel electrophoresis images obtained from genomic DNA.
The Operational Airline Crew Scheduling Problem
Authors: Mirela Stojkovic, Francois Soumis, Jacques Desrosiers
Venue: Transportation Science (1998)

This paper describes the operational airline crew scheduling problem and represents a first published attempt to solve it. The problem consists of modifying, as necessary, personalized planned monthly assignments of airline crew members during day-to-day operations. It requires overing, at minimal cost, all flight segments from a given time period with available crew while minimizing the disturbances of crew members. To generate modified pairings for selected crew members, both the classical crew pairing problem and the problem of constructing personalized monthly assignments must be treated simultaneously. An optimization approach is proposed for the problem in which the flight schedule is fixed and represents input data. The problem is mathematically formulated as a Set Partitioning type problem, and a column generation method embedded in a branch-and-bound search tree has been implemented to solve it. Good results, from the point of view of both solution times and achieved objectives, have been obtained on generated test problems. Because the solution time is reasonable, several different scenarios of the same problem may be solved. A final decision can then be made by considering all scenarios and choosing the one whose solution is the best in the given situation.
Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors
Authors: Miroslav N. Velev, Randal E. Bryant
Venue: Journal of Symbolic Computation (2003)

We compare SAT-checkers and decision diagrams on the evaluation of Boolean formulae produced in the formal verification of both correct and buggy versions of superscalar and VLIW microprocessors. The microprocessors are described in a high-level hardware description language, based on the logic of equality with uninterpreted functions and memories (EUFM). The formal verification is done with Burch and Dill's correctness criterion, using flushing to map the state of the implementation processor to the state of the specification. The EUFM correctness formula is translated to an equivalent Boolean formula by exploiting the property of positive equality, and using the automatic tool EVC. We identify the SAT-checkers Chaff and BerkMin as significantly outperforming the rest of the SAT tools when evaluating the Boolean correctness formulae. We examine ways to enhance the performance of Chaff and BerkMin by variations when generating the Boolean formulae. We reassess optimizations we developed earlier to speed up the formal verification.
The impact of automated assistance on the information retrieval process
Authors: Bernard J. Jansen, George K. Kroner
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Advanced information retrieval systems providing automated assistance offer the opportunity to greatly enhance the effectiveness of the information retrieval process. One issue in designing such systems is determining the effect that the automated assistance has on the tasks and sequence of tasks within this process. Using verbal protocol data and transaction log analysis, we present a taxonomy of tasks when utilizing information retrieval systems with automated assistance, along with a temporal analysis of when interaction with the automated assistance occurs. Results indicate that there is a predictable pattern of user interaction with automated assistance with implications for the design of information retrieval systems.
Knowledge Worker Communications and Recipient Availability: Toward a Task Closure Explanation of Media Choice
Authors: Detmar Straub, Elena Karahanna
Venue: Organization Science (1998)

Recent innovations in organizational forms, such as delayered management, empowered workers, telework, and ad hoc work groups, have created a need to ensure that communication between dispersed knowledge workers can be supported. The movement toward a less cohesive workplace suggests a need to deploy computer-based media, but it is not clear which media should be deployed and under what circumstances. Addressing such significant issues must begin with insights into why knowledge workers choose particular media for particular tasks in the first place. Prior research theorizing about media choice has focused on: (1) task, (2) medium, (3) the fit between task and medium, and (4) social environment. It has not sufficiently considered the role of the availability of the intended recipient or the interaction between recipient availability and task social presence variables which could have a significant impact on media choice. To examine the effects of these two factors, the authors conducted an initial exploratory study and a subsequent controlled factor study. In the initial study, an analysis of 1,669 hypothetical scenarios from 100 knowledge workers at a worldwide transportation company indicated that social presence (SP) theory proves to be a good predictor of media choice, as does the recipient availability construct. The analysis also suggested that the interaction between recipient availability and task social presence might be a good predictor. With a partial replication, randomized treatment design, including 1,883 scenarios from 257 workers, the controlled factor study at a large financial institution generally confirmed the study hypotheses. The authors examine rival explanations simultaneously along the dimensions of task, medium, fit between task and medium, and social environment. They propose and test a new model of media choice and suggest directions for future testing of a new "task closure" model of media choice. They conclude by offering guidelines for managers deploying electronic communications in the workplace.
Support for dynamic trading and runtime adaptability in mobile environments
Authors: Patty Kostkova, Julie A. McCann
Venue: Adaptive evolutionary information systems (2003)

In this chapter we describe MAGNET, a tuplespace-based framework for dynamic trading of services addressing the needs of application in frequently-changing mobile environments. In addition to user-customized trading, MAGNET enables adaptation to a changed environment by supporting constant monitoring of selected information, mobile adaptability and scalability. In addition to presenting the MAGNET architecture and demonstrating its key features, this chapter brings an overview of dynamic trading in mobile systems and presents a theoretical framework for reconfigurability and adaptability.Firstly, we argue that a key characteristic of mobile applications is the need for up-to-date location-dependent information, and adaptability to local configurations while the physical location of users changes frequently. Then, we discuss MAGNET-a model for dynamic trading and its implementation using a tuplespace paradigm. Further, we provide an extensive description of the support for information monitoring, dynamic adaptability and scalability. Presented features are illustrated on a typical real-world scenario-adaptable resource allocation.
UnQL: a query language and algebra for semistructured data based on structural recursion
Authors: Peter Buneman, Mary Fernandez, Dan Suciu
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2000)

This paper presents structural recursion as the basis of the syntax and semantics of query languages for semistructured data and XML. We describe a simple and powerful query language based on pattern matching and show that it can be expressed using structural recursion, which is introduced as a top-down, recursive function, similar to the way XSL is defined on XML trees. On cyclic data, structural recursion can be defined in two equivalent ways: as a recursive function which evaluates the data top-down and remembers all its calls to avoid infinite loops, or as a bulk evaluation which processes the entire data in parallel using only traditional relational algebra operators. The latter makes it possible for optimization techniques in relational queries to be applied to structural recursion. We show that the composition of two structural recursion queries can be expressed as a single such query, and this is used as the basis of an optimization method for mediator systems. Several other formal properties are established: structural recursion can be expressed in first-order logic extended with transitive closure; its data complexity is PTIME; and over relational data it is a conservative extension of the relational calculus. The underlying data model is based on value equality, formally defined with bisimulation. Structural recursion is shown to be invariant with respect to value equality.
Internet-based distributive knowledge integrated system for product design
Authors: Shouqin Zhou, Kwai-Sang Chin, Youbai Xie, Prasad K. D. V. Yarlagadda
Venue: Computers in Industry (2003)

Aiming to meet demand of product designers on various knowledge resources, an Internet-based distributive knowledge integrated system (IDKIS) is proposed in this paper. The structure of IDKIS and the key issues regarding its implementation is discussed. Based on the STEP standard, a scheme of knowledge representation with neutral form is introduced. To improve the efficiency of knowledge search, an approach of function driven knowledge search (FDKS) is proposed. Furthermore, combining the artificial neural networks (ANN) and active server pages (ASP) techniques, the FDKS can be used within the Internet environment. Finally, a prototype system to demonstrate the feasibility of the IDKIS is developed. The works presented in this paper provide a feasible distributive knowledge integrated scheme to aid designers developing high quality product quickly and efficiently.