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).     

Problems with Maximum Likelihood Estimation and the 3 Parameter Gamma Distribution

The three parameters involved are scale a , shape 𝜌 , and location s . Maximum likelihood estimators are (\hata, \hat\rho, \hats) . Using recent work on the second order variances, skewness, and kurtosis we establish the facts, that if the location parameter s is to be estimated, then the asymptotic variances only exist if 𝜌 >2, asymptotic skewness only exists if 𝜌 >3, and 2nd order variances and third order fourth central moments only exist if 𝜌 >4. The result of these limitations is that in general very large sample sizes may be needed to avoid inference problems. We also include new continued fractions for the asymptotic covariances of the maximum likelihood estimators considered.     

Fiber optical network design problems: A case for Turkey

In this paper, we consider problems originating from one of the largest Internet service providers operating in Turkey. The company mainly faces two different design problems: the green field design (area with no Internet access) and the copper field re-design (area with limited access over copper networks). In the green field design problem, the aim is to design a least cost fiber optical network that will provide high bandwidth Internet access from a given central station to a set of aggregated demand nodes. Such an access can be provided either directly by installing fibers or indirectly by utilizing passive splitters. Insertion loss, bandwidth level and distance limitations should simultaneously be considered in order to provide a least cost design to enable the required service level. In the re-design of the copper field application, the aim is to improve the current service level by augmenting the network with fiber optical wires, specifically by adding cabinets to copper rings in the existing infrastructure and by constructing direct fiber links from cabinets to distant demand nodes. Mathematical models are constructed for both problem specifications. Extensive computational results based on realistic data from Kartal (45 nodes) and Bakırköy (74 nodes) districts in Istanbul show that the proposed models are viable exact solution methodologies for moderate dimensions.     

Accurate computation of single and product moments of order statistics under progressive censoring

An accurate procedure is proposed to calculate approximate moments of progressive order statistics in the context of statistical inference for lifetime models. The study analyses the performance of power series expansion to approximate the moments for location and scale distributions with high precision and smaller deviations with respect to the exact values. A comparative analysis between exact and approximate methods is shown using some tables and figures. The different approximations are applied in two situations. First, we consider the problem of computing the large sample variance–covariance matrix of maximum likelihood estimators. We also use the approximations to obtain progressively censored sampling plans for log-normal distributed data. These problems illustrate that the presented procedure is highly useful to compute the moments with precision for numerous censoring patterns and, in many cases, is the only valid method because the exact calculation may not be applicable.     

MARKET PENETRATION AND LOCATIONAL CONFLICT IN FRANCHISE SYSTEMS*

This paper addresses the questions of market penetration and locational conflict in a franchise system of distribution. The models developed provide a means to evaluate alternative scenarios and the effects of various franchise policies. It is shown that the market penetration and location goals of the members of a franchise system coincide only under a very limited set of circumstances.     

Determinants of recent immigrants’ location choices: quasi-experimental evidence

This paper exploits a Danish spatial dispersal policy on refugees, which can be regarded as a natural experiment to investigate the influence of regional factors on recent immigrants’ location choices. The main push factors are lack of co-nationals and immigrants. Additional push factors are lack of rental, including social, housing and lack of institutions for qualifying education, which explain why recent immigrants are attracted to large cities. Finally, placed refugees tend to leave locations with relatively high regional unemployment, and there is indirect evidence of welfare seeking.

网络社交历史与中国早期网民个体生活空间变迁

中国最早的网络移民自始至终伴随了中国互联网的发展,他们的网络使用行为形成了一段不长但至少可以追溯的历史。早期的网络社交将个体从现实物理空间局限中解放出来,具有高蹈于日常生活之上的虚拟色彩;随着网络空间中现实好友的增多和移动位置社交的兴起,网络空间的虚拟色彩渐渐褪去;如今,日常生活中的人际交往不再是在某一单一空间中进行,人们不断地在物理空间与网络空间切换,亦或同时在场。     

A new nonparametric bivariate test for two sample location problem

A strictly nonparametric bivariate test for two sample location problem is proposed. The proposed test is easy to apply and does not require the stringent condition of affine-symmetry or elliptical symmetry which is required by some of the major tests available for the same problem. The power function of the proposed test is calculated. The asymptotic distribution of the proposed test statistic is found to be normal. The power of proposed test is compared with some of the well-known tests under various distributions using Monte Carlo simulation technique. The power study shows that the proposed test statistic performs better than most of the test statistics for almost all the distributions considered here. As soon as the underlying population structure deviates from normality, the ability of the proposed test statistic to detect the smallest shift in location increases as compared to its competitors. The application of the test is shown by using a data set.     

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.     

Robust methods in econometrics

This survey of recent developments in robust estimation and inference is directed primarily toward econometricians. It is argued that many of the techniques in common use in econometrics are highly sensitive to unverified hypotheses. Recent progress in designing alternative robust procedures is described and some prospects for future developments are discussed.