Exact average coverage probabilities and confidence coefficients of confidence intervals for discrete distributions

For a confidence interval (L(X),U(X)) of a parameter θ in one-parameter discrete distributions, the coverage probability is a variable function of θ. The confidence coefficient is the infimum of the coverage probabilities, inf  _θ P _θ (θ∈(L(X),U(X))). Since we do not know which point in the parameter space the infimum coverage probability occurs at, the exact confidence coefficients are unknown. Beside confidence coefficients, evaluation of a confidence intervals can be based on the average coverage probability. Usually, the exact average probability is also unknown and it was approximated by taking the mean of the coverage probabilities at some randomly chosen points in the parameter space. In this article, methodologies for computing the exact average coverage probabilities as well as the exact confidence coefficients of confidence intervals for one-parameter discrete distributions are proposed. With these methodologies, both exact values can be derived.     

A new generalization of the Weibull-geometric distribution with bathtub failure rate

In this paper, the researchers attempt to introduce a new generalization of the Weibull-geometric distribution. The failure rate function of the new model is found to be increasing, decreasing, upside-down bathtub, and bathtub-shaped. The researchers obtained the new model by compounding Weibull distribution and discrete generalized exponential distribution of a second type, which is a generalization of the geometric distribution. The new introduced model contains some previously known lifetime distributions as well as a new one. Some basic distributional properties and moments of the new model are discussed. Estimation of the parameters is illustrated and the model with two known real data sets is examined.     

Disaster response on September 11, 2001 through the lens of statistical network analysis

The rescue and relief operations triggered by the September 11, 2001 attacks on the World Trade Center in New York City demanded collaboration among hundreds of organisations. To shed light on the response to the September 11, 2001 attacks and help to plan and prepare the response to future disasters, we study the inter-organisational network that emerged in response to the attacks. Studying the inter-organisational network can help to shed light on (1) whether some organisations dominated the inter-organisational network and facilitated communication and coordination of the disaster response; (2) whether the dominating organisations were supposed to coordinate disaster response or emerged as coordinators in the wake of the disaster; and (3) the degree of network redundancy and sensitivity of the inter-organisational network to disturbances following the initial disaster. We introduce a Bayesian framework which can answer the substantive questions of interest while being as simple and parsimonious as possible. The framework allows organisations to have varying propensities to collaborate, while taking covariates into account, and allows to assess whether the inter-organisational network had network redundancy—in the form of transitivity—by using a test which may be regarded as a Bayesian score test. We discuss implications in terms of disaster management.     

Applications and Implementation A SEPARABLE PROGRAMMING APPROACH TO EXPECTED COVERAGE: AN APPLICATION TO AMBULANCE LOCATION

The maximum expected covering location problem (MEXCLP) is reformulated using a separable programming approach. The resulting formulation—nonlinear maximum expected covering location problem (NMEXCLP)—guarantees optimality and also solves more quickly than previous heuristic approaches. NMEXCLP allows two important extensions. First, minor formulation changes allow the specification of the minimum number of times each node is to be covered in order to satisfy expected coverage criteria. Second, coverage matrices can be constructed that consider two different types of coverage simultaneously. Both extensions are useful for ambulance location problems and are demonstrated in that setting.     

跨国公司区位决定因素的变化--兼论作为东道国的发展中国家的政策思考

随着经济全球化和一体化进程的不断加快以及国际生产体系的不断完善,跨国公司对外直接投资在各国之间的分布呈不平衡的发展态势.这种地理分布格局的变化,标志着东道国投资环境以及推动国际生产区位选择的经济因素发生了改变,这反映出政策自由化、技术进步和企业战略三个层面的变化.所以,发展中东道国需要着力于产业群集、区位优势组合以及投资促进政策的发展,以便更好地吸引跨国公司和外国直接投资.     

从三国鼎立看谋士集团的重要作用

学界所谓三国能在群雄混战中割据一方,各有立国之本：魏占天时,吴占地利,蜀占人和。其实,得天下的战略表面看来有天地人各种因素,说穿了只有一条：人才,尤其是谋士。谋士集团在三国鼎立中有着举足轻重的作用。     

Benchmark Schedules for Subcontracted Operations: Decentralization Inefficiencies that Arise from Competition and First‐Come‐First‐Served Processing*

Subcontracting has become a prominent business practice across many industries. Subcontracting of industrial production is generally based on short‐term need for additional processing capacity, and is frequently employed by manufacturers to process customer orders more quickly than using only in‐house production. In this article, we study a popular business model where multiple manufacturers, each capable of processing his entire workload in‐house, have the option to subcontract some of their operations to a single third party with a flexible resource. Each manufacturer can deliver customer orders only after his entire batch of jobs, processed in‐house and at the third party, is completed. The third party facility is available to several manufacturers who compete for its use. Current business practice of First‐Come‐First‐Served (FCFS) processing of the subcontracted workloads as well as the competitive Nash equilibrium schedules developed in earlier studies result in two types of inefficiencies; the third party capacity is not maximally utilized, and the manufacturers incur decentralization cost. In this article, we develop models to assess the value created by coordinating the manufacturers' subcontracting decisions by comparing two types of centralized control against FCFS and Nash equilibrium schedules. We present optimal and/or approximate algorithms to quantify the third party underutilization and the manufacturers' decentralization cost. We find that both inefficiencies are more severe with competition than they are when the third party allocates capacity in an FCFS manner. However, in a decentralized setting, a larger percentage of the players prefer Nash equilibrium schedules to FCFS schedules. We extend our analysis to incomplete information scenarios where manufacturers reveal limited demand information, and find that more information dramatically benefits the third party and the manufacturers, however, the marginal benefit of additional information is decreasing. Finally, we discuss an extension wherein each manufacturer's objective takes into account asymmetries in subcontracting, in‐house processing, and delay costs.     

The web proxy location problem in general tree of rings networks

The Web proxy location problem in general networks is an NP-hard problem. In this paper, we study the problem in networks showing a general tree of rings topology. We improve the results of the tree case in literature and get an exact algorithm with time complexity O(nhk), where n is the number of nodes in the tree, h is the height of the tree (the server is in the root of the tree), and k is the number of web proxies to be placed in the net. For the case of networks with a general tree of rings topology we present an exact algorithm with O(kn ²) time complexity.This research has been supported by NSF of China (No. 10371028) and the Educational Department grant of Zhejiang Province (No. 20030622).     

价格促销对消费者品牌选择的影响研究

本文通过实验方法探索性地研究了价格促销对消费者品牌选择的非对称影响。研究表明:消费者对不同产品的价格敏感性有所不同;较贵重的笔记本电脑、手机等耐用消费品行业中的低端品牌在与高端品牌的短期价格竞争中会获得更多市场份额,而对较廉价的洗发水等非耐用消费品来说,高端品牌将会在降价促销时获益更多。本文研究结论与国外同类研究结论有所不同,对企业的定价决策有重要的理论指导意义。     

Analyzing the Homeland Security of the U.S.-Mexico Border

We develop a mathematical optimization model at the intersection of homeland security and immigration, that chooses various immigration enforcement decision variables to minimize the probability that a terrorist can successfully enter the United States across the U.S.-Mexico border. Included are a discrete choice model for the probability that a potential alien crosser will attempt to cross the U.S.-Mexico border in terms of the likelihood of success and the U.S. wage for illegal workers, a spatial model that calculates the apprehension probability as a function of the number of crossers, the number of border patrol agents, and the amount of surveillance technology on the border, a queueing model that determines the probability that an apprehended alien will be detained and removed as a function of the number of detention beds, and an equilibrium model for the illegal wage that balances the supply and demand for work and incorporates the impact of worksite enforcement. Our main result is that detention beds are the current system bottleneck (even after the large reduction in detention residence times recently achieved by expedited removal), and increases in border patrol staffing or surveillance technology would not provide any improvements without a large increase in detention capacity. Our model also predicts that surveillance technology is more cost effective than border patrol agents, which in turn are more cost effective than worksite inspectors, but these results are not robust due to the difficulty of predicting human behavior from existing data. Overall, the probability that a terrorist can successfully enter the United States is very high, and it would be extremely costly and difficult to significantly reduce it. We also investigate the alternative objective function of minimizing the flow of illegal aliens across the U.S.-Mexico border, and obtain qualitatively similar results.