In this article, we consider deterministic (both fluid and discrete) polling systems with N queues with infinite buffers and we show how to compute the best polling sequence (minimizing the average total workload). With two queues, we show that the best polling sequence is always periodic when the system is stable and forms a regular sequence. The fraction of time spent by the server in the first queue is highly noncontinuous in the parameters of the system (arrival rate and service rate) and shows a fractal behavior. Moreover, convexity properties are shown and are used in a generalization of the computation of the optimal control policy (in open loop) for the stochastic exponential case.

We study the optimal admission of arriving customers to a Markovian finite-capacity queue (e.g., M/M/c/N queue) with several customer types. The system managers are paid for serving customers and penalized for rejecting them. The rewards and penalties depend on customer types. The penalties are modeled by a K-dimensional cost vector, K ≥ 1. The goal is to maximize the average rewards per unit time subject to the K constraints on the average costs per unit time. Let Km denote min{K,m − 1}, where m is the number of customer types. For a feasible problem, we show the existence of a Km-randomized trunk reservation optimal policy, where the acceptance thresholds for different customer types are ordered according to a linear combination of the service rewards and rejection costs. Additionally, we prove that any Km-randomized stationary optimal policy has this structure.

The equilibrium distribution arises as the limiting distribution of the forward recurrence time in a renewal process. The purpose of this article is to study the relationships between the equilibrium distributions (including its higher derivates) and the original distributions. Some stochastic order relations and the relations between their aging properties are investigated and some applications in the field of insurance and financial investments are given. In addition, the relation between the equilibrium distribution of a series system and the series system of equilibrium distribution is investigated. Bivariate equilibrium distribution whose reliability properties are consistent with those of the univariate equilibrium distribution is defined.

We consider the problem of estimating passage times in stochastic simulations of Markov chains. Two types of estimator are considered for this purpose: the “simple” and the “overlapping” estimator; they are compared in terms of their asymptotic variance. The analysis is based on the regenerative structure of the process and it is shown that when estimating the mean passage time, the simple estimator is always asymptotically superior. However, when the object is to estimate the expectation of a nonlinear function of the passage time, such as the probability that the passage time exceeds a given threshold, then it is shown that the overlapping estimator can be superior in some cases. Related results in the Reinforcement Learning literature are discussed.

Software reliability is one of important characteristics of software quality, and software release time is an important application of the software reliability model. In this article we consider a software release policy based on a Gamma-Gamma-type Kalman filter as well as the risk cost due to software failures and the cost for debugging in software systems. Under this model, the optimal release time that minimizes the expected cost in every test-debugging stage subject to a reliability constraint is discussed. An example to illustrate the framework of our model is given.

In this article we study a firm that is facing demand from two sources: demand for new items and demand to replace failed items under warranty. We model this setting as a multiperiod single-product inventory problem where the demands for new items in different periods are independent and the demands for replacing failed items depend on the number of the items under warranty. We consider backlogging and emergency supply cases and study both discounted-cost and average-cost criteria. We prove the optimality of the w-dependent base stock ordering policy, where the base stock level is a function of w, the number of items currently under warranty. For the special case where the demand for new products is stationary, we prove the optimality of a stationary w-dependent base stock policy for the finite-horizon discounted-cost and the infinite-horizon discounted- and average-cost cases. We compare the integrated inventory policy with the one that neglects demands from items under warranty.

In this article we first give a characterization of a class of probability transition matrices having closed-form solutions for transient distributions and the steady-state distribution. We propose to apply the stochastic comparison approach to construct bounding chains belonging to this class. Therefore, bounding chains can be analyzed efficiently through closed-form solutions in order to provide bounds on the distributions of the considered Markov chain. We present algorithms to construct upper-bounding matrices in the sense of the ≤st and ≤icx order.

Chebyshev inequality estimates the probability for exceeding the deviation of a random variable from its mathematical expectation in terms of the variance of the random variable. In modern probability theory, the Chebyshev inequality is the most frequently used tool for proving different convergence processes; for example, it plays a fundamental role in proofs of various forms of laws of large numbers. The mathematical expression of the bound on the probability in the Chebyshev inequality is very simple and can be modified easily for different kinds of sequence of random variables (e.g., for the case of sums of independent random variables). This fact lies behind these frequent applications. In this setting, the Chebyshev inequality has pure theoretical “applications” in probability theory and its role is to provide “a guarantee” of convergence but not to give a bound on concrete probability content.

In the present article we consider the Chebyshev inequality as a probability bound that is essential for the translation from its conventional theoretical applications to the practical setting if easy-to-compute multivariate generalizations are derived.

Such an inequality for the random vectors having multivariate Normal distribution is proved. The new inequality gives a lower bound in terms of variances on the probability that the random vector in question falls into an Euclidean ball with center at mean vector. The need and importance of consideration of this kind of multivariate Chebyshev inequality stemmed from several problems in engineering and informational sciences (Hassibi and Boyd [9], Jeng [10], Jeng and Woods [11], Molina, Katseggelos, Mateos, Hermoso, and Segall [13]). Jeng [10] derived an inequality that gives an upper bound for the probability in question. The simultaneous application of the established multivariate Chebyshev inequality and Jeng's inequality is useful in practical problems by providing lower and upper bounds on the probability content.

The inequality is attractive by its being easy to compute and its similarity to the original Chebyshev inequality, in contrast to well-known complicated multivariate Chebyshev inequalities. The present article also gives some insights into the very origin of the Chebyshev inequality, which makes the article self-contained.

In the present article, we consider a class of reliability structures that can be efficiently described through a finite Markov chain (Markov chain imbeddable systems) and investigate its closeness with respect to the increasing failure rate (IFR) property. More specifically we derive a sufficient condition for the system's lifetime to have increasing failure rate when the identical and independent components comprising it own this property. As an application of the general theory, we establish an alternative proof of the IFR property preservation for the k-out-of-n system and derive some related results for the family of weighted k-out-of-n systems.

Spinning up a Power®ball—a hand-held gyroscopic toy or exerciser that exhibits rotor spin-up when applying appropriate torque to its casing—is a fairly easy task for a human but rather complex to perform with a robot. To accomplish the task of spinning up the rotor of the Power®ball with a robot, we measured the motion of a human and identified the conditions an individual uses for a successful spin-up. Several control approaches were applied to the device mainly using feedback information from the velocity counter and force/torque sensor to synchronize the torque exerted by the device and the motion of the robot. Best human imitation was achieved with two modified learning methods with highest rotor speeds in excess of 1480 rad/s, rating among top 100 world Power®ball players.

Back at the beginning of 2000, I was a member of a working group tasked to come up with some guidelines for revamping my University's website.During one of our meetings, someone made the suggestion thatdecisions about howto structure and present information on the website should be driven by the kinds of questions that users come to the site with.Suddenly a light went on, and there appeared an idea for data gathering that might provide us withsome useful information. To find out what people really wanted to know whenthey visited the website, we would replace the University's searchengine by a page that invited the user to type in his or her query as a full natural language question. Appropriately chosen examples would be given todemonstrate that using real questions delivered better pages as a result. The data gathered would tell us what people were really looking for, more than could be gleaned from conventional search queries, and would therefore help usto better structure the information available on the website.

We examine the ML pattern-matching anomalies of useless clauses and non-exhaustive matches. We state the definition of these anomalies, building upon pattern matching semantics, and propose a simple algorithm to detect them. We have integrated the algorithm in the Objective Caml compiler, but we show that the same algorithm is also usable in a non-strict language such as Haskell. Or-patterns are considered for both strict and non-strict languages.

This paper addresses problems to achieve transparency and contact stability for teleoperation that consists of unconstrained and constrained motions. The adaptive bilateral control with a local force compensator is developed, based on adaptive impedance control and contact force driven compensation with auto-switching functions. Without any knowledge about robotic and environment dynamics and with a communication delay, the developed method guarantees good adaptive tracking performance in unconstrained motion and reduction of oscillating contacts in constrained motion. Based on an actual haptic device and a virtual manipulator, haptic simulations are presented to demonstrate adaptive transparency and contact stability in the presence of communication delay.

This paper addresses the views of students of blended language learning (BLL) – a particular learning and teaching environment, that combines face-to-face (f2f) and computer-assisted language learning (CALL). In this instance, the ‘blend’ consisted of learners’ independent self-study phases at a computer, with a CD-ROM, and traditional f2f classroom learning. This paper explores this BLL environment from the participants’ perspective and focuses on three learners who left the class. The aim of the study was to understand the reasons behind those students’ decision to leave, so that ideas might be developed for the successful implementation of BLL environments in the future that would appeal to all learners. The analysis showed that students left the class for three reasons: a perceived lack of support and connection/complementarity between the f2f and computer-assisted components of the ‘blend’; a perceived lack of usage of the paper medium for reading and writing; and the rejection of the computer as a medium of language learning. The paper concludes by pointing out implications for the possible future of BLL.

We present two case studies of two different pedagogical tasks in a Computer Assisted Language Learning environment called Grim. The main design principle in Grim is to support ‘Focus on Form’ in second language pedagogy. Grim contains several language technology-based features for exploring linguistic forms (static, rule-based and statistical), intended to be used while writing. Our question is, in what ways does Grim support Focus on Form in actual classroom use. We have explored this question within sociocultural theory, emphasizing tool mediation and how tools shape the learner’s activity. The first case concerns a text-reconstruction exercise in which students worked in a pair within the Grim environment. The second case was conducted with another group of students, who engaged in collaborative revision of texts, written in advance by one of the students, in student pairs. In both studies, students were instructed and encouraged to use the different features of Grim. Data was collected by recording dialogue during the sessions with Grim. Our results show how learners put the features of Grim into use in their writing tasks. In some instances, the program was used creatively, in combination with external tools such as the users’ own dictionaries, knowledge of other languages, or teachers. In other instances, we note that Grim was used for error correction, rather than as a language resource. The learners’ activities are thus transformed by their use of the program, from the tasks of revision and text-reconstruction into error correction. The application shapes the activity, in conjunction with the pedagogical tasks. We argue for studying the activities of students with CALL tools, in order to find out in detail how tasks and technology concur in use and what view on language and pedagogy they mediate.