نتایج جستجو برای: optimal arrangement

تعداد نتایج: 400362  

Journal: :Discrete & Computational Geometry 2003
Stefan Langerman William L. Steiger

Given a set of n hyperplanes h1, . . . , hn ∈ R d the hyperplane depth of a point P ∈ R is the minimum number of hyperplanes that a ray from P can meet. The hyperplane depth of the arrangement is the maximal depth of points P not in any hi. We give an optimal O(n logn) deterministic algorithm to compute the hyperplane depth of an arrangement in dimension d = 2.

2015
Matias Korman Sheung-Hung Poon Marcel Roeloffzen

Given a collection L of line segments, we consider its arrangement and study the problem of covering all cells with line segments of L. That is, we want to find a minimum-size set L′ of line segments such that every cell in the arrangement has a line from L′ defining its boundary. We show that the problem is NP-hard, even when all segments are axis-aligned. In fact, the problem is still NP-hard...

2015
Pao-Hung Lin Cong-Lin Sie Ching-An Chen Hsuan-Chen Chang Yi-Ting Shih Hsin-Yueh Chang Wei-Jhih Su Kuei-Yi Lee

In this study, we performed thermal chemical vapor deposition for growing vertically aligned carbon nanotube (VACNT) bundles for a field emitter and applied photolithography for defining the arrangement pattern to simultaneously compare square and hexagonal arrangements by using two ratios of the interbundle distance to the bundle height (R) of field emitters. The hexagon arrangement with R = 2...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه بوعلی سینا - دانشکده علوم پایه 1391

abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...

Journal: :Journal of Graph Theory 2017
César Hernández-Vélez Jesús Leaños Gelasio Salazar

4 A drawing of a graph is pseudolinear if there is a pseudoline arrangement such that 5 each pseudoline contains exactly one edge of the drawing. The pseudolinear crossing 6 number c̃r(G) of a graph G is the minimum number of pairwise crossings of edges in 7 a pseudolinear drawing of G. We establish several facts on the pseudolinear crossing 8 number, including its computational complexity and i...

2010
Drew Armstrong Brendon Rhoades

This paper is about two arrangements of hyperplanes. The first — the Shi arrangement — was introduced by Jian-Yi Shi to describe the Kazhdan-Lusztig cells in the affine Weyl group of type A. The second — the Ish arrangement — was recently defined by the first author who used the two arrangements together to give a new interpretation of the q, t-Catalan numbers of Garsia and Haiman. In the prese...

Optimal capacitor placement, considering power system loss reduction, voltage profile improvement, line reactive power decrease and power factor correction, is of particular importance in power system planning and control. The distribution system operator calculates the optimal place, number and capacity of capacitors based on two major purposes: active power loss reduction and return on invest...

Journal: :Physical review letters 2012
Jeffrey Aguilar Alex Lesov Kurt Wiesenfeld Daniel I. Goldman

We study vertical jumping in a simple robot comprising an actuated mass-spring arrangement. The actuator frequency and phase are systematically varied to find optimal performance. Optimal jumps occur above and below (but not at) the robot's resonant frequency f(0). Two distinct jumping modes emerge: a simple jump, which is optimal above ff(0), is achievable with a squat maneuver, and a peculiar...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید