conclusions our findings may be applied by manufacturers to design prostheses more compatible with asian populations. alterations to the shape of components should be considered to provide optimal coverage. patients and methods during 2013, 150 consecutive patients (96 males and 54 females) from the outpatient department of orthopedic surgery of rasoul akram hospital with knee ct scans were stu...

The multiobjective two person matrix game problem with fuzzy payoffs is considered in this paper. It is assumed that fuzzy payoffs are triangular fuzzy numbers. The problem is converted to several multiobjective matrix game problems with interval payoffs by using the $alpha$-cuts of fuzzy payoffs. By solving these problems some $alpha$-Pareto optimal strategies with some interval outcomes are o...

We present a polynomial time dynamic programming algorithm for optimal partitions in the shortest path metric induced by a tree. This resolves, among other things, the exact complexity status of the optimal partition problems in one dimensional geometric metric settings. Our method of solution could be also of independent interest in other applications. We discuss also an extension of our metho...

Accurate policy evaluation is central to optimal policymaking, but difficult to achieve. Most often, analysts have to work with observational data and cannot directly observe the counterfactual of a policy to assess its effect accurately. In this paper, we craft a quasi-experimental design and apply two relatively new methods—the differencein-differences estimation and the synthetic controls me...

A factor 2 approximation algorithm for the problem of finding a minimum-cost bbalanced cut in planar graphs is presented, for b ≤ 1 3 . We assume that the vertex weights are given in unary; for the case of binary vertex weights, a pseudoapproximation algorithm is presented. This problem is of considerable practical significance, especially in VLSI design. The natural algorithm for this problem ...

Many computer vision problems are naturally formulated as random fields, specifically MRFs or CRFs. The introduction of graph cuts has enabled efficient and optimal inference in associative random fields, greatly advancing applications such as segmentation, stereo reconstruction and many others. However, while fast inference is now widespread, parameter learning in random fields has remained an...

We describe a deterministic parallel algorithm for linear programming in fixed dimension d that takes poly(log log n) time in the common concurrent read concurrent write (CRCW) PRAM model and does optimal O(n) work. In the exclusive read exclusive write (EREW) model, the algorithm runs in O(logn · log logd−1 n) time. Our algorithm is based on multidimensional search and effective use of approxi...

In this appendix, we will show how the higher order energy potentials can be minimized using graph cuts. Since, graph cuts can efficiently minimize submodular functions, we will transform our higher order energy function (Eq. 9) to a submodular second order energy function. For the case of both αβ-swap and αexpansion move making algorithms, we will explain this transformation and the process of...