Risk and quality control in a supply chain: competitive and collaborative approaches

This paper provides a quantitative and comparative economic and risk approach to strategic quality control in a supply chain, consisting of one supplier and one producer, using a random payoff game. Such a game is first solved in a risk-neutral framework by assuming that both parties are competing with each other. We show in this case that there may be an interior solution to the inspection game. A similar analysis under a collaborative framework is shown to be trivial and not practical, with a solution to the inspection game being an ‘all or nothing’ solution to one or both the parties involved. For these reasons, the sampling random payoff game is transformed into a Neyman–Pearson risk constraints game, where the parties minimize the expected costs subject to a set of Neyman–Pearson risk (type I and type II) constraints. In this case, the number of potential equilibria can be large. A number of such solutions are developed and a practical (convex) approach is suggested by providing an interior (partial sampling) solution for the collaborative case. Numerical examples are developed to demonstrate the procedure used. Thus, unlike theoretical approaches to the solution of strategic quality control random payoff games, the approach we construct is both practical and consistent with the statistical risk Neyman–Pearson approach.     

Global Parametric Sufficient Optimality Conditions for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized （η,ρ）-invex Functions

In this paper,we discuss a large number of sets of global parametric sufficient optimality condi-tions under various gcneralized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programmingproblem.     

A fluid system with coupled input and output,and its application to bottlenecks in ad hoc networks

This paper studies a fluid queue with coupled input and output. Flows arrive according to a Poisson process, and when n flows are present, each of them transmits traffic into the queue at a rate c/(n+1), where the remaining c/(n+1) is used to serve the queue. We assume exponentially distributed flow sizes, so that the queue under consideration can be regarded as a system with Markov fluid input. The rationale behind studying this queue lies in ad hoc networks: bottleneck links have roughly this type of sharing policy. We consider four performance metrics: (i) the stationary workload of the queue, (ii) the queueing delay, i.e., the delay of a ‘packet’ (a fluid particle) that arrives at the queue at an arbitrary point in time, (iii) the flow transfer delay, i.e., the time elapsed between arrival of a flow and the epoch that all its traffic has been put into the queue, and (iv) the sojourn time, i.e., the flow transfer time increased by the time it takes before the last fluid particle of the flow is served. For each of these random variables we compute the Laplace transform. The corresponding tail probabilities decay exponentially, as is shown by a large-deviations analysis. F. Roijers’ work has been carried out partly in the SENTER-NOVEM funded project Easy Wireless.     

椭圆强非局域空间光孤子

对傍轴椭圆高斯光束在具有椭圆对称响应特性的强非局域非线性介质中的演化规律进行研究，得到了光束各参量演化的精确解析解，分析了单向空间光孤子和强非局域椭圆空间光孤子的形成条件，发现了椭圆光孤子的相移与介质响应函数的椭圆率有关. 关键词： 椭圆对称强非局域响应介质 椭圆强非局域空间光孤子 相移     

Properties of<Emphasis Type="Italic">B</Emphasis><Subscript>c</Subscript> meson

The mass spectrum ofcb meson is investigated with an effective quark-antiquark potential of the form -α_c/r +Ar ^νwith ν varying from 0.5 to 2.0. TheS andP-wave masses, pseudoscalar decay constant, weak decay partial widths in spectator model and the lifetime ofB _cmeson are computed. The properties calculated here are found to be in good agreement with other theoretical and experimental values at potential index,ν = 1     

A graphical approach to computing Selmer groups of congruent number curves

Let E _n:y ²=x ³−n ² x denote the family of congruent number elliptic curves. Feng and Xiong (2004) equate the nontriviality of the Selmer groups associated with E _n to the presence of certain types of partitions of graphs associated with the prime factorization of n. In this paper, we extend the ideas of Feng and Xiong in order to compute the Selmer groups of E _n. 2000 Mathematics Subject Classification Primary—11G05; Secondary—14H52, 14H25, 05C90     

Selection Principles and Sierpinski Sets

We show that a set of real numbers is a Sierpinski set if, and only if, it satisfies a selection property similar to the familiar Menger property.     

A New View on Fuzzy Hypermodules

We describe the relationship between the fuzzy sets and the algebraic hyperstructures. In fact, this paper is a continuation of the ideas presented by Davvaz in （Fuzzy Sets Syst., 117： 477- 484, 2001） and Bhakat and Das in （Fuzzy Sets Syst., 80： 359-368, 1996）. The concept of the quasicoincidence of a fuzzy interval value with an interval-valued fuzzy set is introduced and this is a natural generalization of the quasi-coincidence of a fuzzy point in fuzzy sets. By using this new idea, the concept of interval-valued （α,β）-fuzzy sub-hypermodules of a hypermodule is defined. This newly defined interval-valued （α,β）-fuzzy sub-hypermodule is a We shall study such fuzzy sub-hypermodules and sub-hypermodules of a hypermodule. generalization of the usual fuzzy sub-hypermodule. consider the implication-based interval-valued fuzzy     

Performance Analysis for Mobile Ad Hoc Network in Random Graph Models with Spatial Reuse

In this paper,we present a random graph model with spatial reuse for a mobile ad hoc network(MANET) based on the dynamic source routing protocol.Many important performance parameters of theMANET are obtained,such as the average flooding distance (AFD),the probability generating function of theflooding distance,and the probability of a flooding route to be symmetric.Compared with the random graphmodel without spatial reuse,this model is much more effective because it has a smaller value of AFD and alarger probability for finding a symmetric valid route.     

Learning Theory Estimates via Integral Operators and Their Approximations

The regression problem in learning theory is investigated with least square Tikhonov regularization schemes in reproducing kernel Hilbert spaces (RKHS). We follow our previous work and apply the sampling operator to the error analysis in both the RKHS norm and the L² norm. The tool for estimating the sample error is a Bennet inequality for random variables with values in Hilbert spaces. By taking the Hilbert space to be the one consisting of Hilbert-Schmidt operators in the RKHS, we improve the error bounds in the L² metric, motivated by an idea of Caponnetto and de Vito. The error bounds we derive in the RKHS norm, together with a Tsybakov function we discuss here, yield interesting applications to the error analysis of the (binary) classification problem, since the RKHS metric controls the one for the uniform convergence.