On the general position subset selection problem

Let $f(n,\ell)$ be the maximum integer such that every set of $n$ points in the plane with at most $\ell$ collinear contains a subset of $f(n,\ell)$ points with no three collinear. First we prove that if $\ell \leq O(\sqrt{n})$ then $f(n,\ell)\geq \Omega(\sqrt{\frac{n}{\ln \ell}})$. Second we prove that if $\ell \leq O(n^{(1-\epsilon)/2})$ then $f(n,\ell) \geq \Omega(\sqrt{n\log_\ell n})$, which implies all previously known lower bounds on $f(n,\ell)$ and improves them when $\ell$ is not fixed. A more general problem is to consider subsets with at most $k$ collinear points in a point set with at most $\ell$ collinear. We also prove analogous results in this setting

Factors Affecting Trade in Mexican Imports of Poultry Meat from the United States

U.S. exports of poultry to Mexico have increased steadily since NAFTA came into force in January 1994. The Mexican poultry industry has become increasingly concerned about these exports, arguing that it cannot compete with U.S. products. The Mexicans argue that U.S. poultry exports to Mexico are duty free under NAFTA (as of January 1, 2003). The Mexican industry also argues that U.S. poultry benefits from low-priced feed resulting from U.S. Government farm programs. We analyzed the impact of tariffs and U.S. feed grain programs on U.S. exports of poultry, and find that other factors appear to be more important in explaining trade. Specifically, Mexican preferences for dark meat provide large price incentives for U.S. exporters, while Mexican Government policies in support of its grain sector penalize poultry producers in Mexico.International Relations/Trade,

The detection and classification of blast cell in Leukaemia Acute Promyelocytic Leukaemia (AML M3) blood using simulated annealing and neural networks

This paper was delivered at AIME 2011: 13th Conference on Artifical Intelligence in Medicine.This paper presents a method for the detection and classification of blast cells in M3 with others sub-types using simulated annealing and neural networks. In this paper, we increased our test result from 10 images to 20 images. We performed Hill Climbing, Simulated Annealing and Genetic Algorithms for detecting the blast cells. As a result, simulated annealing is the “best” heuristic search for detecting the leukaemia cells. From the detection, we performed features extraction on the blast cells and we classifying based on M3 and other sub-types using neural networks. We received convincing result which has targeting around 97% in classifying of M3 with other sub-types. Our results are based on real world image data from a Haematology Department.Universiti Sains Islam Malaysia and the Ministry of Higher Education, Malaysi

Which point sets admit a k-angulation?

For k >= 3, a k-angulation is a 2-connected plane graph in which every internal face is a k-gon. We say that a point set P admits a plane graph G if there is a straight-line drawing of G that maps V(G) onto P and has the same facial cycles and outer face as G. We investigate the conditions under which a point set P admits a k-angulation and find that, for sets containing at least 2k^2 points, the only obstructions are those that follow from Euler's formula.Comment: 13 pages, 7 figure

A study to define an in-flight dynamics measurement and data applications program for space shuttle payloads

Data measurement and interpretation techniques were defined for application to the first few space shuttle flights, so that the dynamic environment could be sufficiently well established to be used to reduce the cost of future payloads through more efficient design and environmental test techniques. It was concluded that: (1) initial payloads must be given comprehensive instrumentation coverage to obtain detailed definition of acoustics, vibration, and interface loads, (2) analytical models of selected initial payloads must be developed and verified by modal surveys and flight measurements, (3) acoustic tests should be performed on initial payloads to establish realistic test criteria for components and experiments in order to minimize unrealistic failures and retest requirements, (4) permanent data banks should be set up to establish statistical confidence in the data to be used, (5) a more unified design/test specification philosophy is needed, (6) additional work is needed to establish a practical testing technique for simulation of vehicle transients

Viking dynamics experience with application to future payload design

Analytical and test techniques are discussed. Areas in which hindsight indicated erroneous, redundant, or unnecessarily severe design and test specifications are identified. Recommendations are made for improvements in the dynamic design and criteria philosophy, aimed at reducing costs for payloads

On the connectivity of visibility graphs

The visibility graph of a finite set of points in the plane has the points as vertices and an edge between two vertices if the line segment between them contains no other points. This paper establishes bounds on the edge- and vertex-connectivity of visibility graphs. Unless all its vertices are collinear, a visibility graph has diameter at most 2, and so it follows by a result of Plesn\'ik (1975) that its edge-connectivity equals its minimum degree. We strengthen the result of Plesn\'ik by showing that for any two vertices v and w in a graph of diameter 2, if deg(v) <= deg(w) then there exist deg(v) edge-disjoint vw-paths of length at most 4. Furthermore, we find that in visibility graphs every minimum edge cut is the set of edges incident to a vertex of minimum degree. For vertex-connectivity, we prove that every visibility graph with n vertices and at most l collinear vertices has connectivity at least (n-1)/(l-1), which is tight. We also prove the qualitatively stronger result that the vertex-connectivity is at least half the minimum degree. Finally, in the case that l=4 we improve this bound to two thirds of the minimum degree.Comment: 16 pages, 8 figure

Trading anonymity and order anticipation

Does it matter to market quality if broker identities are revealed after a trade and only to the two traders involved? We find that implementing full anonymity dramatically improves liquidity and reduces trader execution costs. To explain this, we compare theories based on asymmetric information to an order anticipation mechanism, where identity signals trader size, allowing strategic agents to predict the future order flow of large traders. Evidence supports the anticipation hypothesis: liquidity improves most in stocks where trading is heavily concentrated among a few brokers and in stocks susceptible to temporary price pressure. Also, only traders having large market shares benefit from anonymity