OEM product design in a price competition with remanufactured product

An original equipment manufacturer (OEM) produces new products and often faces a dilemma when determining the level of interchangeability in its product design. The interchangeability is considered as a degree to which the product can be disassembled without force, and thus an increasing degree of interchangeability would decrease the OEM's production cost, but it would also lower a remanufacturer's cost in cannibalizing used items. Decreasing the level of interchangeability to deter the remanufacturer, on the other hand, would simultaneously increase the production costs of the OEM. We thus formulate a two-period supply chain model consisting of two chain members, an OEM and a remanufacturer, to investigate the product design decision of the OEM and both chain members' competitive pricing strategies. We then characterize the equilibrium decisions and profits with regard to costs and consumers' preference for the remanufactured product. We also evaluate a strategic game in which the OEM chooses the degree of interchangeability, and the remanufacturer determines its collection strategy. We find that the product-design strategy is effective for the OEM in competing with the remanufacturer, but it is not necessarily harmful to the remanufacturer.     

并行工程产品开发过程定量化建模与计划制订

由于现有的一些并行工程定量化模型中修改设计微循环的细节特征描述得还不够充分 ,本文提出了一种新的基于产品 -工艺设计活动对网络的定量化模型来描述并行工程产品开发过程 ,并且给出了产品 -工艺设计活动对平均持续时间与产品或工艺设计活动资源占用率的计算方法 .在此基础上 ,将并行工程产品开发过程的计划制订问题建模成一个有资源约束的项目调度问题 .与其它此类问题不同的是 ,在本文中 ,分配给产品开发项目的各类资源的数量不是事先给定的 ,而是与最优产品开发计划一起获得的 ,所以这是一个资源分配与计划制订的集成优化问题 .本文提出了一种新的基于分枝定界的算法来解决此问题并引入一个启发式规则来提高算法的搜索效率     

股权众筹投融资方的最优策略分析

分析了股权众筹融资方和投资方的最优策略.依据股权众筹的流程,构建了股权众筹过程中投融资方利益博弈的3阶段模型,并在同时满足融资方与投资方预期收益最大化的条件下,求解了相应的最优化问题并给出了投融资方最优策略的解析式.研究结果表明,在参数满足一定条件时,股权众筹投融资方均存在最优策略,且最优策略受边际收益、项目成功概率、预期回报率等因素的影响.     

浅谈建筑幕墙设计中的成本控制

建筑幕墙成本控制的重点在设计阶段 ,设计方案对成本的控制是决定性的。设计对项目成本的控制是战略性、全局性的 ,而施工过程的管理对项目成本的控制是战术性、局部性的。幕墙设计中如何达到控制成本的目的至关重要。把技术与经济融为一体 ,在设计中既保证幕墙安全、实用、美观 ,又做到控制和降低成本 ,是施工企业适应市场的关键     

Decision settings analysis – a tool for analysis and design of human activity systems

The paper describes a methodology to be used for analysis and design of human activity systems. The methodology is based on an analysis of the decision settings whereas most other decision analysis methodologies are analysing the process. The decision concept is analysed and discussed. A distinction between programmed and programmable as well as non-programmed and non-programmable decisions is proposed. A classification of different information types for decision making is presented. A methodology based on a systemic and systematic analysis of the information requirements of an organization is proposed. This methodology also indicates organizational discrepancies and information imbalances. The methodology focuses the settings of the decisions on all levels of organizations. The methodology can be regarded as a dynamic, learning system. The author proposes further research on the individuals decision making abilities.     

Designing and integrating composite networks for monitoring multivariate gaussian pollution fields

Networks of ambient monitoring stations are used to monitor environmental pollution fields such as those for acid rain and air pollution. Such stations provide regular measurements of pollutant concentrations. The networks are established for a variety of purposes at various times so often several stations measuring different subsets of pollutant concentrations can be found in compact geographical regions. The problem of statistically combining these disparate information sources into a single 'network' then arises. Capitalizing on the efficiencies so achieved can then lead to the secondary problem of extending this network. The subject of this paper is a set of 31 air pollution monitoring stations in southern Ontario. Each of these regularly measures a particular subset of ionic sulphate, sulphite, nitrite and ozone. However, this subset varies from station to station. For example only two stations measure all four. Some measure just one. We describe a Bayesian framework for integrating the measurements of these stations to yield a spatial predictive distribution for unmonitored sites and unmeasured concentrations at existing stations. Furthermore we show how this network can be extended by using an entropy maximization criterion. The methods assume that the multivariate response field being measured has a joint Gaussian distribution conditional on its mean and covariance function. A conjugate prior is used for these parameters, some of its hyperparameters being fitted empirically.     

Binary probability maps using a hidden conditional autoregressive Gaussian process with an application to Finnish common toad data

The Finnish common toad data of Heikkinen and Hogmander are reanalysed using an alternative fully Bayesian model that does not require a pseudolikelihood approximation and an alternative prior distribution for the true presence or absence status of toads in each 10 km×10 km square. Markov chain Monte Carlo methods are used to obtain posterior probability estimates of the square-specific presences of the common toad and these are presented as a map. The results are different from those of Heikkinen and Hogmander and we offer an explanation in terms of the prior used for square-specific presence of the toads. We suggest that our approach is more faithful to the data and avoids unnecessary confounding of effects. We demonstrate how to extend our model efficiently with square-specific covariates and illustrate this by introducing deterministic spatial changes.     

On predictive distributions and Bayesian networks

In this paper we are interested in discrete prediction problems for a decision-theoretic setting, where the task is to compute the predictive distribution for a finite set of possible alternatives. This question is first addressed in a general Bayesian framework, where we consider a set of probability distributions defined by some parametric model class. Given a prior distribution on the model parameters and a set of sample data, one possible approach for determining a predictive distribution is to fix the parameters to the instantiation with the maximum a posteriori probability. A more accurate predictive distribution can be obtained by computing the evidence (marginal likelihood), i.e., the integral over all the individual parameter instantiations. As an alternative to these two approaches, we demonstrate how to use Rissanen's new definition of stochastic complexity for determining predictive distributions, and show how the evidence predictive distribution with Jeffrey's prior approaches the new stochastic complexity predictive distribution in the limit with increasing amount of sample data. To compare the alternative approaches in practice, each of the predictive distributions discussed is instantiated in the Bayesian network model family case. In particular, to determine Jeffrey's prior for this model family, we show how to compute the (expected) Fisher information matrix for a fixed but arbitrary Bayesian network structure. In the empirical part of the paper the predictive distributions are compared by using the simple tree-structured Naive Bayes model, which is used in the experiments for computational reasons. The experimentation with several public domain classification datasets suggest that the evidence approach produces the most accurate predictions in the log-score sense. The evidence-based methods are also quite robust in the sense that they predict surprisingly well even when only a small fraction of the full training set is used.     

Penalized Pseudolikelihood Inference in Spatial Interaction Models with Covariates

Given spatially located observed random variables ( x , z = {( x _i , z _i )} _i , we propose a new method for non-parametric estimation of the potential functions of a Markov random field p ( x | z ), based on a roughness penalty approach. The new estimator maximizes the penalized log-pseudolikelihood function and is a natural cubic spline. The calculations involved do not rely on Monte Carlo simulation. We suggest the use of B-splines to stabilize the numerical procedure. An application in Bayesian image reconstruction is described.     

Bayesian prediction of waiting times in stochastic models

The authors show how saddlepoint techniques lead to highly accurate approximations for Bayesian predictive densities and cumulative distribution functions in stochastic model settings where the prior is tractable, but not necessarily the likelihood or the predictand distribution. They consider more specifically models involving predictions associated with waiting times for semi‐Markov processes whose distributions are indexed by an unknown parameter θ. Bayesian prediction for such processes when they are not stationary is also addressed and the inverse‐Gaussian based saddlepoint approximation of Wood, Booth & Butler (1993) is shown to accurately deal with the nonstationarity whereas the normal‐based Lugannani & Rice (1980) approximation cannot, Their methods are illustrated by predicting various waiting times associated with M/M/q and M/G/1 queues. They also discuss modifications to the matrix renewal theory needed for computing the moment generating functions that are used in the saddlepoint methods.