C~n中单位多圆柱上一类α次殆星映照第四项齐次展开式的精确估计

本文主要研究在Cn中单位多圆柱上一类α次殆星映照第四项齐次展开式的精确估计,主要结果表明在一定的限制条件下多复变数中有关α次殆星映照第四项齐次展开式的Bieberbach猜想成立,并推广了已有的结论.     

亚洲传播研究的蓬勃发展与未来：中国视角与日本视角（上）

中国学者与日本学者就“亚洲传播研究的蓬勃发展及未来”这一问题进行对话,其中的问题包括：亚洲传手轻研究蓬勃发展的情况如何？为什么亚洲传播研究者尚未终止欧洲中心传播范式的统治？亚洲传播研究的目的与意义何在？哪些亚洲本土文化概念可以为亚洲传播理论的发展做出贡献？如何评价亚洲传播研究？     

亚洲传播研究的蓬勃发展与未来:中国视角与日本视角(下)

中国学者与日本学者就亚洲传播研究的蓬勃发展及未来这一问题进行对话,其中的问题包括:亚洲传播研究蓬勃发展的情况如何?为什么亚洲传播研究者尚未终止欧洲中心传播范式的统治?亚洲传播研究的目的与意义何在?哪些亚洲本土文化概念可以为亚洲传播理论的发展做出贡献?如何评价亚洲传播研究?     

The Reflexive Producer: The Influence of Farmer Knowledge Upon the Use of Bt Corn*

Abstract This paper examines the influence of farmer knowledge upon decision making processes. Drawing upon the sociological debates around the ideas of reflexive modernity and biotechnology as well as from classic adoption and diffusion studies, I explore the influences upon farmers' use of Bacillus thuringiensis (Bt) corn. Utilizing survey data gathered from corn farmers in Minnesota and Wisconsin, I argue that farmers are ‘reflexive’ actors who actively negotiate between ‘expert’ and ‘local’ knowledges when deciding to plant Bt corn. Furthermore, I hypothesize that farmers are more likely to be influenced by their first‐hand or local experiences than by state or expert observations.     

SCHEDULING HYBRID FLOWSHOPS IN PRINTED CIRCUIT BOARD ASSEMBLY LINES*

We treat a three‐stage hybrid flowshop for the production of printed circuit boards (PCB), suggested to us by a real‐life production situation. The problem is to determine a schedule that minimizes the makespan for a given demand profile over a finite planning horizon. We propose a global procedure that utilizes genetic algorithms and three subproblems. The performance of the procedure is evaluated via experimentation over thousands of problem realizations that are randomly generated. The experimental results show the efficiency of the global procedure and provides qualitative answers to the allocation of machines to the various stages.     

A Game-Theoretic Approach to Quantity Discount Problems*

The traditional quantity discount problem is analyzed from the perspective of game theory, including both noncooperative and cooperative models. For the noncooperative case, the Stackelberg equilibrium is derived. For the cooperative case, the Pareto Optimality criteria are used to find a group of optimal strategies. Both scenarios are illustrated through an example which quantifies the benefits resulting from cooperation between the buyer and the seller for game-theoretic solutions using geometric programming.     

OPTIMAL AND NEAR OPTIMAL CONTROL OF A TWO-PART-TYPE STOCHASTIC MANUFACTURING SYSTEM WITH DYNAMIC SETUPS

This paper deals with a manufacturing system consisting of a single machine subject to random failures and repairs. The machine can produce two types of parts. When the production is switched from one part type to the other, a random setup time is incurred at a constant cost rate. The objective is to track the demand, while keeping the work-in-process as close as possible to zero for both products. The problem is formulated as an optimal stochastic control problem. The optimal policy is obtained numerically by discretizing the continuous time continuous state opti-mality conditions using a Markov chain approximation technique. The discretized optimality conditions are shown to correspond to an infinite horizon, discrete time, discrete state dynamic programming problem. The optimal setup policy is shown to have two different structures depending on the parameters of the system. A heuristic policy is proposed to approximate the optimal setup policy. Simulation results show that the heuristic policy is a very good approximation for sufficiently reliable systems.