A construction of pooling designs with surprisingly high degree of error correction

It is well known that many famous pooling designs are constructed from mathematical structures by the “containment matrix” method. In this paper, we propose another method and obtain a family of pooling designs with surprisingly high degree of error correction based on a finite set. Given the numbers of items and pools, the error-tolerant property of our designs is much better than that of Macula?s designs when the size of the set is large enough.     

Point-weight designs with design conditions on t points

This paper examines some of the properties of point-weight incidence structures, i.e. incidence structures for which every point is assigned a positive integer weight. In particular it examines point-weight designs with a design condition that stipulates that any two “identical” sets of t points must lie on the same number of blocks. We introduce a new class of designs with this property: row-sum designs, and examine the basic properties of row-sum point-weight designs and their similarities to classical (non-point-weight) designs and the point-weight designs of Horne [On point-weighted designs, Ph.D. Thesis, Royal Holloway, University of London, 1996].     

“Bricks-and-mortar” vs. “clicks-and-mortar”: An equilibrium analysis

The Internet has provided traditional retailers a new means with which to serve customers. Consequently, many “bricks-and-mortar” retailers have transformed to “clicks-and-mortar” by incorporating Internet sales. Examples of companies making such a transition include Best Buy, Wal-Mart, Barnes & Noble, etc. Despite the increasing prevalence of this practice, several fundamental questions remain: (1) Does it pay off to go online? (2) Which is the equilibrium industry structure? (3) What is the implication of this business model for consumers? We study these issues in an oligopoly setting and show that clicks-and-mortar arises as the equilibrium channel structure. However, we find that this equilibrium does not necessarily imply higher profits for the firms: in some cases, rather, it emerges as a strategic necessity. Consumers are generally better off with clicks-and-mortar retailers. If firms align with pure e-tailers to reach the online market, we show that a prisoner’s dilemma-type equilibrium may arise.     

Embedding processes in combinatorial game theory

Berlekamp asked the question “What is the habitat of ∗2?” (See Guy, 1996 [6].) It is possible to generalize the question and ask “For a game G, what is the largest n such that ∗n is a position of G?” This leads to the concept of the nim dimension. In Santos and Silva (2008) [8] a fractal process was proposed for analyzing the previous questions. For the same purpose, in Santos and Silva (2008) [9], an algebraic process was proposed. In this paper we implement a third idea related to embedding processes. With Alan Parr’s traffic lights, we exemplify the idea of estimating the “difficulty” of the game and proving that its nim dimension is infinite.     

Exponential decay for a viscoelastically damped timoshenko beam

Of concern is a viscoelastic beam modelled using the Timoshenko theory. It is well-known that the system is exponentially stable if the kernel in the memory term is sub-exponential. That is, if the product of the kernel with an exponential function is a summable function. In this article we address the questions: What if the kernel is tested against a different function (say Gamma) other than the exponential function? Would there still be stability? In the affirmative, what kind of decay rate we get? It is proved that for a non-decreasing function “Gamma” whose “logarithmic derivative” is decreasing to zero we have a decay of order Gamma to some power and in the case it decreases to a different value than zero then the decay is exponential.     

Usefulness of resale price maintenance under different levels of sales-effort cost and system-parameter uncertainties

This paper on “resale price maintenance” (RPM) has three main parts:

(i)

Using a simple and parsimonious model, we show that even with only one retailer, a “supplier” or “manufacturer” (hereafter “Manu”) should impose minimum-RPM under some circumstances but maximum-RPM in others. These two sets of circumstances are defined by a very simple formula.     

On the maximum total sample size of a group sequential test about bivariate binomial proportions

For testing “univariate” binomial proportions, it has been proven that, under mild conditions, there exist group sequential designs which satisfy the pre-specified Type I error and power of the single-stage design while the sample size is bounded above by that of the single-stage design (Kepner and Chang, 2003). In this article, we extend this result and prove the existence of such group sequential designs for various decision rules in the space of bivariate binomial variables. We also demonstrate how to obtain the actual group sequential designs for detecting changes in bivariate binomial variables.     

Some examples for the Poincaré and Painlevé problems

In 1891, Poincaré started a series of three papers in which he tried to answer the following question (cf. [21-23]): “Is it possible to decide if an algebraic differential equation in two variables is algebraically integrable?” (in the sense that it has a rational first integral). More or less at the same time P. Painlevé asked the following question: “Is it possible to recognize the genus of the general solution of an algebraic differential equation in two variables which has a rational first integral?”. In this paper we give examples of one-parameter families which show that both problems have a negative answer. With some of the families we can also answer a question posed by M. Brunella in [5].     

Some remarks on the meaning of equality in Diophantos’s Arithmetica

Diophantos in Arithmetica, without having defined previously any concept of “equality” or “equation,” employs a concept of the unknown number as a tool for solving problems and finds its value from an equality ad hoc created. In this paper we analyze Diophantos’s practices in the creation and simplification of such equalities, aiming to adduce more evidence on certain issues arising in recent historical research on the meaning of the “equation” in Diophantos’s work.     

Average optimality for continuous-time Markov decision processes with a policy iteration approach

This paper deals with the average expected reward criterion for continuous-time Markov decision processes in general state and action spaces. The transition rates of underlying continuous-time jump Markov processes are allowed to be unbounded, and the reward rates may have neither upper nor lower bounds. We give conditions on the system's primitive data and under which we prove the existence of the average reward optimality equation and an average optimal stationary policy. Also, under our conditions we ensure the existence of ?-average optimal stationary policies. Moreover, we study some properties of average optimal stationary policies. We not only establish another average optimality equation on an average optimal stationary policy, but also present an interesting “martingale characterization” of such a policy. The approach provided in this paper is based on the policy iteration algorithm. It should be noted that our way is rather different from both the usually “vanishing discounting factor approach” and the “optimality inequality approach” widely used in the previous literature.     

A note on single-machine group scheduling problems with position-based learning effect

In many situations, the skills of workers continuously improve when repeating the same or similar tasks. This phenomenon is known as the “learning effect” in the literature. However, most studies considering the learning effect ignore the fact that production efficiency can be increased by grouping various parts and products with similar designs and/or production processes. This phenomenon is known as “group technology” in the literature. In this paper, we propose a new group scheduling learning model where the learning effect not only depends on the job position, but also depends on the group position. We then show that the makespan and the total completion time problems remain polynomially solvable under the proposed model.     

Problem posing via “what if not?” strategy in solid geometry — a case study

The study describes the kinds of problems posed by pre-service teachers on the basis of complex solid geometry tasks using the “what if not?” strategy and the educational value of such an activity. Twenty-eight pre-service teachers participated in two workshops in which they had to pose problems on the basis of given problems. Analysis of the posed problems revealed a wide range of problems including those containing a change of one of the numerical data to another specific one, to a proof problem. Different kinds of posed problems enlightened some phenomena such as a bigger frequency of posed problems with another numerical value and a lack of posed problems including formal generalization. We also discuss the educational strengths of problem posing in solid geometry using the “what if not?” strategy, which could make the learner rethink the geometrical concepts he uses while creating new problems, make connections between the given and the new concepts and as a result deepen his understanding of them.     

Single-machine group scheduling problems with deteriorated and learning effect

In many realistic situation, a job processed later consumes more time than the same job when it is processed earlier, this phenomenon is known as deteriorated effect. The skills of workers continuously improve when repeating the same or similar tasks, this phenomenon is as the “learning effect” in the literature. However, most studies considering the deteriorated and learning effect ignore the fact that production efficiency can be increased by grouping various parts and products with similar designs and/or production processes. This phenomenon is known “group technology” in the literature. In this paper, we propose a new group scheduling with deteriorated and learning model where the learning effect not only depends on job position, but also depends on the group position; the deteriorated effect depends on its starting time of the job. We then show that the single-machine makespan and the total completion time problems remain polynomial optimal solvable under the proposed model. In addition, we show the maximum lateness have a polynomial optimal solution under certain agreeable restriction.     

Randomly generating portfolio-selection covariance matrices with specified distributional characteristics

In portfolio selection, there is often the need for procedures to generate “realistic” covariance matrices for security returns, for example to test and benchmark optimization algorithms. For application in portfolio optimization, such a procedure should allow the entries in the matrices to have distributional characteristics which we would consider “realistic” for security returns. Deriving motivation from the fact that a covariance matrix can be viewed as stemming from a matrix of factor loadings, a procedure is developed for the random generation of covariance matrices (a) whose off-diagonal (covariance) entries possess a pre-specified expected value and standard deviation and (b) whose main diagonal (variance) entries possess a likely different pre-specified expected value and standard deviation. The paper concludes with a discussion about the futility one would likely encounter if one simply tried to invent a valid covariance matrix in the absence of a procedure such as in this paper.     

Comparison results for nonlinear degenerate Dirichlet and Neumann problems with general growth in the gradient

This paper deals with both Dirichlet and Neumann problems for a class of nonlinear degenerate elliptic equations with general growth in the gradient. First, we give an existence result of a spherically symmetric solution to the “symmetrized” problems with data depending only on the radials. Second, we prove that the solutions of the original problems can be compared, under a rearrangement, with the solutions of the “symmetrized” problems.     

Semicontinuity of the solution set of parametric multivalued vector quasiequilibrium problems

In this paper we establish sufficient conditions for the solution set of parametric multivalued vector quasiequilibrium problems to be semicontinuous. All kinds of semicontinuity are considered: lower semicontinuity, upper semicontinuity, Hausdorff upper semicontinuity and closedness. Moreover, we investigate both the “weak” and “strong” solutions of quasiequilibrium problems.     

2-Universally complete Riesz spaces and inverse-closed Riesz spaces

In this paper we show mainly two results about uniformly closed Riesz subspaces of ?^X containing the constant functions. First, for such a Riesz subspace E, we solve the problem of determining the properties that a real continuous functiondefined on a proper open interval of ?should have in order that the conditions “E is closed under composition with ” and “E is closed under inversion in X” become equivalent. The second result, reformulated in the more general frame of the Archimedean Riesz spaces with weak order unit e, establishes that E (e-uniformly complete and e-semisimple) is closed under inversion in C(Spec E) if and only if E is 2-universally e-complete.     

A metric approach to asymptotic analysis

We introduce a notion of “firm” (or uniform) asymptotic cone to an unbounded subset of a normed space. We relate this notion to a concept of “firm” asymptotic function. We use these notions to study boundedness properties which can be applied to continuity questions for some operations on sets and functions. Such questions arise in stability analysis of Hamilton-Jacobi equations. We present some other applications such as an extension of a theorem of Dieudonné and existence results in optimization and fixed point theory.     

Large investor trading impacts on volatility

We begin with this paper a series devoted to a tentative model for the influence of hedging on the dynamics of an asset. We study here the case of a “large” investor and solve two problems in the context of such a model namely the question of the fair value (or liquidative value) of a “large” position and the question of pricing or hedging an option. In order to do so, we use a utility maximization approach and some new results in stochastic control theory.     

The affect heuristic

This paper introduces a theoretical framework that describes the importance of affect in guiding judgments and decisions. As used here, “affect” means the specific quality of “goodness” or “badness” (i) experienced as a feeling state (with or without consciousness) and (ii) demarcating a positive or negative quality of a stimulus. Affective responses occur rapidly and automatically—note how quickly you sense the feelings associated with the stimulus word “treasure” or the word “hate”. We argue that reliance on such feelings can be characterized as “the affect heuristic”. In this paper we trace the development of the affect heuristic across a variety of research paths followed by ourselves and many others. We also discuss some of the important practical implications resulting from ways that this heuristic impacts our daily lives.