Front tracking with moving-least-squares surfaces

The representation of interfaces by means of the algebraic moving-least-squares (AMLS) technique is addressed. This technique, in which the interface is represented by an unconnected set of points, is interesting for evolving fluid interfaces since there is]to surface connectivity. The position of the surface points can thus be updated without concerns about the quality of any surface triangulation. We introduce a novel AMLS technique especially designed for evolving-interfaces applications that we denote RAMLS (for Robust AMLS). The main advantages with respect to previous AMLS techniques are: increased robustness, computational efficiency, and being free of user-tuned parameters. Further, we propose a new front-tracking method based on the Lagrangian advection of the unconnected point set that defines the RAMLS surface. We assume that a background Eulerian grid is defined with some grid spacing h. The advection of the point set makes the surface evolve in time. The point cloud can be regenerated at any time (in particular, we regenerate it each time step) by intersecting the gridlines with the evolved surface, which guarantees that the density of points on the surface is always well balanced. The intersection algorithm is essentially a ray-tracing algorithm, well-studied in computer graphics, in which a line (ray) is traced so as to detect all intersections with a surface. Also, the tracing of each gridline is independent and can thus be performed in parallel. Several tests are reported assessing first the accuracy of the proposed RAMLS technique, and then of the front-tracking method based on it. Comparison with previous Eulerian, Lagrangian and hybrid techniques encourage further development of the proposed method for fluid mechanics applications. (C) 2008 Elsevier Inc. All rights reserved.

Design/Evaluation of A Methodology For Performance Optimization Of Indexable Carbide Inserts

In this project, two broad facets in the design of a methodology for performance optimization of indexable carbide inserts were examined. They were physical destructive testing and software simulation.For the physical testing, statistical research techniques were used for the design of the methodology. A five step method which began with Problem definition, through System identification, Statistical model formation, Data collection and Statistical analyses and results was indepthly elaborated upon. Set-up and execution of an experiment with a compression machine together with roadblocks and possible solution to curb road blocks to quality data collection were examined. 2k factorial design was illustrated and recommended for process improvement. Instances of first-order and second-order response surface analyses were encountered. In the case of curvature, test for curvature significance with center point analysis was recommended. Process optimization with method of steepest ascent and central composite design or process robustness studies of response surface analyses were also recommended.For the simulation test, AdvantEdge program was identified as the most used software for tool development. Challenges to the efficient application of this software were identified and possible solutions proposed. In conclusion, software simulation and physical testing were recommended to meet the objective of the project.

Role of the surface state and structural feature in the thermoreversible sol-gel transition of a zirconyl aqueous precursor modified by sulfuric acid

The sols produced by admixture of ZrOCl2 acidified solutions to hot H2SO4 aqueous solutions were studied to clarify the effects of Cl- and SO42- ions on the kinetic stability of nanoparticles and to obtain some new evidence concerning the mechanism of a thermoreversible sol-gel transition observed in this system. The study of suspensions prepared with different molar ratios R-S = [Zr]/[SO42-] and R-Cl = [Zr]/[Cl-] revealed domains of composition of formation of thermoreversible gels, thermostable sols, and powder precipitation. The effects of R-S and R-Cl on the structural features of nanoparticles and on the particle solution interface were systematically analyzed for samples of thermoreversible and thermostable sol domains. Small-angle X-ray scattering measurements revealed the presence of small fractal aggregates in all samples of thermoreversible domains, while compact packing aggregates of primary particles are present in the thermostable sol. Extended X-ray absorption fine structure and elemental chemical analysis revealed that irrespective of the nominal value of R-S and R-Cl all studied samples of the thermoreversible domain are constituted by a well-defined compound possessing an inner core made of hydroxyl and oxo groups bridging together zirconium atoms surrounded on the surface by complexing sulfate ligands. zeta potentials of powders extracted by freeze-drying from the thermoreversible gel revealed a point of surface charge inversion attributed to the specific adsorption of SO42- ion. Thermoreversible gel formation is rationalized by considering the effect of the specific adsorption on the electrical double-layer repulsion together with the temperature dependency of the physical chemical properties of ions in solution.

Involutions whose fixed set has three or four components: a small codimension phenomenon

Let T : M → M be a smooth involution on a closed smooth manifold and F = n j=0 F j the fixed point set of T, where F j denotes the union of those components of F having dimension j and thus n is the dimension of the component of F of largest dimension. In this paper we prove the following result, which characterizes a small codimension phenomenon: suppose that n ≥ 4 is even and F has one of the following forms: 1) F = F n ∪ F 3 ∪ F 2 ∪ {point}; 2) F = F n ∪ F 3 ∪ F 2 ; 3) F = F n ∪ F 3 ∪ {point}; or 4) F = F n ∪ F 3 . Also, suppose that the normal bundles of F n, F 3 and F 2 in M do not bound. If k denote the codimension of F n, then k ≤ 4. Further, we construct involutions showing that this bound is best possible in the cases 2) and 4), and in the cases 1) and 3) when n is of the form n = 4t, with t ≥ 1.

Effective Surface Water Quality Policies: A Contrast of Policies in the United States and the European Union

The United States and the European Union each have their own policy approach to protect surface water quality. Both policy approaches are similar in many ways. Both rely heavily on command and control. However, there are differences in the application of the details. Both the U.S. and E.U. began current efforts to protect surface water quality in the 1970s, yet quality continues to less than desired in both places. Both have reduced point source pollutants but have had difficulty controlling non-point source pollutants even though policies have been in place for many decades. The successes and failures of the two policies are studied in this project to determine which aspects of both policies will best protect surface water quality in an increasingly complex future.

Hardness results for computing optimal locally Gabriel graphs

Delaunay and Gabriel graphs are widely studied geo-metric proximity structures. Motivated by applications in wireless routing, relaxed versions of these graphs known as Locally Delaunay Graphs (LDGs) and Lo-cally Gabriel Graphs (LGGs) have been proposed. We propose another generalization of LGGs called Gener-alized Locally Gabriel Graphs (GLGGs) in the context when certain edges are forbidden in the graph. Unlike a Gabriel Graph, there is no unique LGG or GLGG for a given point set because no edge is necessarily in-cluded or excluded. This property allows us to choose an LGG/GLGG that optimizes a parameter of interest in the graph. We show that computing an edge max-imum GLGG for a given problem instance is NP-hard and also APX-hard. We also show that computing an LGG on a given point set with dilation ≤k is NP-hard. Finally, we give an algorithm to verify whether a given geometric graph G= (V, E) is a valid LGG.

Vertex Cover Gets Faster and Harder on Low Degree Graphs

The problem of finding an optimal vertex cover in a graph is a classic NP-complete problem, and is a special case of the hitting set question. On the other hand, the hitting set problem, when asked in the context of induced geometric objects, often turns out to be exactly the vertex cover problem on restricted classes of graphs. In this work we explore a particular instance of such a phenomenon. We consider the problem of hitting all axis-parallel slabs induced by a point set P, and show that it is equivalent to the problem of finding a vertex cover on a graph whose edge set is the union of two Hamiltonian Paths. We show the latter problem to be NP-complete, and also give an algorithm to find a vertex cover of size at most k, on graphs of maximum degree four, whose running time is 1.2637(k) n(O(1)).

Two player game variant of the Erdos-Szekeres problem

The classical Erdos-Szekeres theorem states that a convex k-gon exists in every sufficiently large point set. This problem has been well studied and finding tight asymptotic bounds is considered a challenging open problem. Several variants of the Erdos-Szekeres problem have been posed and studied in the last two decades. The well studied variants include the empty convex k-gon problem, convex k-gon with specified number of interior points and the chromatic variant. In this paper, we introduce the following two player game variant of the Erdos-Szekeres problem: Consider a two player game where each player playing in alternate turns, place points in the plane. The objective of the game is to avoid the formation of the convex k-gon among the placed points. The game ends when a convex k-gon is formed and the player who placed the last point loses the game. In our paper we show a winning strategy for the player who plays second in the convex 5-gon game and the empty convex 5-gon game by considering convex layer configurations at each step. We prove that the game always ends in the 9th step by showing that the game reaches a specific set of configurations.

On Locally Gabriel Geometric Graphs

Let be a set of points in the plane. A geometric graph on is said to be locally Gabriel if for every edge in , the Euclidean disk with the segment joining and as diameter does not contain any points of that are neighbors of or in . A locally Gabriel graph(LGG) is a generalization of Gabriel graph and is motivated by applications in wireless networks. Unlike a Gabriel graph, there is no unique LGG on a given point set since no edge in a LGG is necessarily included or excluded. Thus the edge set of the graph can be customized to optimize certain network parameters depending on the application. The unit distance graph(UDG), introduced by Erdos, is also a LGG. In this paper, we show the following combinatorial bounds on edge complexity and independent sets of LGG: (i) For any , there exists LGG with edges. This improves upon the previous best bound of . (ii) For various subclasses of convex point sets, we show tight linear bounds on the maximum edge complexity of LGG. (iii) For any LGG on any point set, there exists an independent set of size .

Results on proximal and generalized weak proximal contractions including the case of iteration-dependent range sets

This paper presents some further results on proximal and asymptotic proximal contractions and on a class of generalized weak proximal contractions in metric spaces. The generalizations are stated for non-self-mappings of the forms for and , or , subject to and , such that converges uniformly to T, and the distances are iteration-dependent, where , , and are non-empty subsets of X, for , where is a metric space, provided that the set-theoretic limit of the sequences of closed sets and exist as and that the countable infinite unions of the closed sets are closed. The convergence of the sequences in the domain and the image sets of the non-self-mapping, as well as the existence and uniqueness of the best proximity points, are also investigated if the metric space is complete. Two application examples are also given, being concerned, respectively, with the solutions through pseudo-inverses of both compatible and incompatible linear algebraic systems and with the parametrical

基于Stewart平台六维力传感器的分区静态标定方法

基于Stewart平台的六维力传感器具有结构紧凑、刚度大、量程宽等特点,它在工业机器人、空间站对接等领域具有广泛的应用前景。好的标定方法是正确使用传感器的基础。由于基于Stewart平台的六维力传感器是一个复杂的非线性系统,所以采用常规的线性标定方法必将带来较大的标定误差从而影响其使用性能。标定的实质是,由测量值空间到理论值空间的映射函数的确定过程。由函数逼近理论可知,当只在已知点集上给出函数值时,可用多项式或分段多项式等较简单函数逼近待定函数。基于上述思想,本文将整个测量空间划分为若干连续的子测量空间,再对每个子空间进行线性标定,从而提高了整个测量系统的标定精度。实验分析结果表明了该标定方法有效。

Compact operators without extended eigenvalues

A complex number lambda is called an extended eigenvalue of a bounded linear operator T on a Banach space B if there exists a non-zero bounded linear operator X acting on B such that XT = lambda TX. We show that there are compact quasinilpotent operators on a separable Hilbert space, for which the set of extended eigenvalues is the one-point set {1}.

Rendimiento operativo de la tamizacion doble ajustada por raza para la deteccion de aneuploidias en poblacion colombiana

Actualmente, los algoritmos utilizados para la detección de alteraciones cromosómicas se han basado en los resultados obtenidos de poblaciones caucásicas, afrocaribeñas y asiáticas, las cuales, no tienen las mismas características de la raza mestiza. De allí, surgió el interés de realizar un estudio que permitiera determinar los valores de los marcadores serológicos, empleados en la tamización de aneuploidías, en población latina, para establecer un punto de corte ajustado a la raza mestiza. Se encuentra en desarrollo un estudio de validación de prueba diagnóstica, cuyos avances se presentan a continuación. En esta investigación, hasta el momento, se han incluido 1418 pacientes entre 11-13.6 semanas, sometidas a tamización combinada para la detección de aneuploidías. Se realizó un ajuste por raza de valores de medianas y sus múltiplos para los marcadores y se determinó el rendimiento operativo de la prueba luego de dicho ajuste. Posteriormente, se realizó una comparación entre ambas pruebas. Los niveles de B-hCG son 17.1 % más bajos en población mestiza colombiana, comparado con población caucásica y los niveles de PAPP-A son 19% inferiores. Las tasas de detección de la prueba, utilizando los valores convencionales, son del 60 % y, luego del ajuste por raza, es del 53 %. Haciendo el cálculo de riesgo, utilizando los nuevos múltiplos de mediana, no existen diferencias en aplicar la tamización con los valores convencionales entre las semanas 11 y 12 pero, en semana 13, los valores aplicados a población caucásica presentan una mejor tasa de detección que utilizar la prueba ajustada.

Lecture notes

Lecture notes in LaTex

Lecture notes pdf

Lecture notes in PDF