Point Problems Research Articles

Metrics and barycenters for point pattern data

We introduce the transport–transform and the relative transport–transform metrics between finite point patterns on a general space, which provide a unified framework for earlier point pattern metrics, in particular the generalized spike time and the normalized and unnormalized optimal subpattern assignment metrics. Our main focus is on barycenters, i.e., minimizers of a q-th-order Fréchet functional with respect to these metrics. We present a heuristic algorithm that terminates in a local minimum and is shown to be fast and reliable in a simulation study. The algorithm serves as a general plug-in method that can be applied to point patterns on any state space where an appropriate algorithm for solving the location problem for individual points is available. We present applications to geocoded data of crimes in Euclidean space and on a street network, illustrating that barycenters serve as informative summary statistics. Our work is a first step toward statistical inference in covariate-based models of repeated point pattern observations.

Yield Analysis for Electrical Circuit Designs: Many Problems and Some Recent Developments in Electronic Engineering

A high production yield, Y = 1 - p fail, and thus a low failure rate, p fail, is a key requirement for successful chip design and the design of many other technical products and systems. We focus on IC design in the analog and mixedsignal domains, where Monte Carlo (MC) techniques have been a standard method for many years (see Important Monte Carlo Rules Engineers Should Know). Circuits have to be reliable under certain ranges of environmental parameters, such as supply voltage ( V ) and temperature ( T ). Furthermore, the set of semiconductor technology parameters ( P ) varies significantly, from die to die (global variations) to device to device (local variations, called mismatch ). Many circuit tricks are known to minimize all of these influences (for example, using cascodes for a high power-supply rejection, differential pairs to cancel out threshold voltages, special layout techniques, and so on), but at some point problems become hard to anticipate, and further improvements are difficult to achieve. We must accept such variations and need to analyze their impact on production yield, which is a function of these parameters and the specifications (such as design topology and component sizes, among others).

Registration and Fusion of UAV LiDAR System Sequence Images and Laser Point Clouds

The unmanned aerial vehicle (UAV)-mounted mobile LiDAR system (ULS) is widely used for geomatics owing to its efficient data acquisition and convenient operation. However, due to limited carrying capacity of a UAV, sensors integrated in the ULS should be small and lightweight, which results in decrease in the density of the collected scanning points. This affects registration between image data and point cloud data. To address this issue, the authors propose a method for registering and fusing ULS sequence images and laser point clouds, wherein they convert the problem of registering point cloud data and image data into a problem of matching feature points between the two images. First, a point cloud is selected to produce an intensity image. Subsequently, the corresponding feature points of the intensity image and the optical image are matched, and exterior orientation parameters are solved using a collinear equation based on image position and orientation. Finally, the sequence images are fused with the laser point cloud, based on the Global Navigation Satellite System (GNSS) time index of the optical image, to generate a true color point cloud. The experimental results show the higher registration accuracy and fusion speed of the proposed method, thereby demonstrating its accuracy and effectiveness.

Dynamic green location and routing problem for service points

Dynamic green location and routing problem for service points

The positive integral points on the elliptic curve 𝒚𝟐=𝟕𝒑𝒙(𝒙𝟐+𝟖)

The integral point of elliptic curve is a very important problem in both elementary number theory and analytic number theory. In recent years, scholars have paid great attention to solving the problem of positive integer points on elliptic curve 𝑦2 = 𝑘(𝑎𝑥2+𝑏𝑥+𝑐), where 𝑘,𝑎,𝑏,𝑐 are integers. As a special case of 𝑦2 = 𝑘(𝑎𝑥2+𝑏𝑥+𝑐), when 𝑎 = 1,𝑏 = 0,𝑐 = 22𝑡−1, it turns into 𝑦2 = 𝑘𝑥(𝑥2+22𝑡−1), which is a very important case. However ,at present, there are only a few conclusions on it, and the conclusions mainly concentrated on the case of 𝑡 = 1,2,3,4. The case of 𝑡 = 1, main conclusions reference [1] to [7]. The case of 𝑡 = 2, main conclusions reference [8]. The case of 𝑡 = 3, main conclusions reference [9] to [11]. The case of 𝑡 = 4, main conclusions reference [12] and [13]. Up to now, there is no relevant result on the case of 𝑘 = 7𝑝 when 𝑡 = 2, here the elliptic curve is 𝑦2 = 7𝑝(𝑥2 + 8), this paper mainly discusses the positive integral points of it. And we obtained the conclusion of the positive integral points on the elliptic curve 𝑦2 = 7𝑝(𝑥2 + 8). By using congruence, Legendre symbol and other elementary methods, it is proved that the elliptic curve in the title has at most one integer point when 𝑝 ≡ 5,7(𝑚𝑜𝑑8).

О точках совпадения отображений в обобщенных метрических пространствах

Abstract. Let 𝑋 be a space with ∞-metric 𝜌 (a metric with possibly infinite value) and 𝑌 a space with ∞-distance 𝑑 satisfying the identity axiom. We consider the problem of coincidence point for mappings 𝐹,𝐺:𝑋→𝑌, i.e. the problem of existence of a solution for the equation 𝐹(𝑥)=𝐺(𝑥). We provide conditions of the existence of coincidence points in terms of a covering set for the mapping 𝐹 and a Lipschitz set for the mapping 𝐺 in the space 𝑋×𝑌. An 𝛼-covering set (𝛼>0) of the mapping 𝐹 is a set of (𝑥,𝑦) such that ∃𝑢∈𝑋 𝐹(𝑢)=𝑦, 𝜌(𝑥,𝑢)≤𝛼−1𝑑(𝐹(𝑥),𝑦), 𝜌(𝑥,𝑢)<∞, and a 𝛽 - Lipschitz set (𝛽≥0) for the mapping 𝐺 is a set of (𝑥,𝑦) such that ∀𝑢∈𝑋 𝐺(𝑢)=𝑦⇒𝑑(𝑦,𝐺(𝑥))≤𝛽𝜌(𝑢,𝑥). The new results are compared with the known theorems about coincidence points.

KnoDues – a start-up with a solution to India’s split-expenses problem

Learning outcomes Using the case, students will learn about the following topics: identification of the right shareholder for a start-up. Need for a tech co-founder for an app-based start-up. Delay in building the right team at the right time. Lack of preparedness; a start-up’s challenges in identifying the business model. What was the real pain point (problem identification)? Did the solution meet market expectations (solution quality)?; consumers’ usual social habits. How do people’s habits hinder a product’s survival in the market? Why do consumers continue to behave the same way they have? Technology-related constraints. Case overview/synopsis KnoDues was a mobile application (app)-based start-up in the domain of split expenses. The business idea germinated in early 2015 and became a reality toward the end of 2015. In a developing country context, the case provides rich insights into lean vs traditional start-up formation, founders’ knowledge, opportunity identification, product development and investment. India is a growing economy with ever-increasing smartphone users and internet consumers. Despite its deep-rooted rural-urban divide in the usage of modern technologies, India possesses a vast market opportunity in big cities. Rightly so, KnoDues intended to target the urban youth (between 15 and 35 years of age) population. Although KnoDues was not a unique product or the first of its kind, the founders perceived it to be the “first mover” in the Indian market. In its initial days, the product received an overwhelming response from accelerators and business-plan judges. Although KnoDues achieved more than 20,000 downloads by the end of 2016, customer retention and attracting investors became a difficult task. Founders felt that the difficulty was because of people’s “usual social habits,” and inadequate revenue model. Toward the end of 2017, KnoDues’s founders contemplated on ceasing their business. Complexity academic level Undergraduate, postgraduate and executive. Supplementary materials Teaching Notes are available for educators only. Please contact your library to gain login details or email support@emeraldinsight.com to request teaching notes. Subject code CSS 3: Entrepreneurship.

Modalization of movement: The problem of sensus communis and the limits of phenomenology

One of the most persistent problems in accounting for the constitution of subjective experience is the question of the unity of consciousness. In the phenomenological tradition this question is often approached through concepts such as ipseity, pre-reflective consciousness, ownership, and first-person perspective. Since Aristotle, the question of unity in an experiencing subject has been associated with the notion of “common sensibles” and the concept of “ sensus communis” as that which joins the proper sense modalities in a single center. In this article it is argued that both the classical and the phenomenological solutions to the problem of unity point to the central challenge of how to account for the experience of movement and it is questioned whether a phenomenology of movement gets us closer to an understanding of sensus communis as a primordial relational force in the body–world formation.

Part of speech tagging for Polish

Abstract In this paper we discuss the current state of the art in part-of-speech tagging for Polish. We introduce the problem of POS tagging and point out the key issues in tagging inflected languages, which make this task more difficult in the case of Polish than e.g. English. We also discuss the most important language resources connected with POS tagging, as well as the task of morphological analysis, as it is commonly used as a preliminary step in tagging. We describe the methods that have been applied to the problem of POS tagging for Polish to date and discuss the most current, neural-network based methods in more detail. Finally, we conclude with a general view of this field in the context of Polish and discuss possible future research directions.

Near-Optimal Path Planning for a Car-Like Robot Visiting a Set of Waypoints With Field of View Constraints

This letter considers two variants of a shortest path problem for a car-like robot visiting a set of waypoints. The sequence of waypoints to be visited is specified in the first variant while the robot is allowed to visit the waypoints in any sequence in the second variant. The shortest path problem is first solved for two waypoints with heading angle constraints at the waypoints using the Pontryagin's minimum principle. Using the results for the two point problem, tight lower and upper bounds on the length of the shortest path are developed for visiting $n$ points by relaxing the requirement that the arrival angle must be equal to the departure angle of the robot at each waypoint. Theoretical bounds are also provided on the length of the feasible solutions obtained by the proposed algorithm. Simulation results verify the performance of the bounds for instances with 20 waypoints.

Prawo – osoba – śmierć. Część II: Teoria Daniela Sperlinga a polski system prawny

This article is divided into two parts. In the first part, which was published in 2018, we presented arguments in support of the concept of posthumous interests. Posthumous interests are understood as events that constitute a benefit or a harm to the deceased person, who no longer exists. A right is the interest of a person, which is recognized and protected by law. In the second part, we examine the possibility of applying the theory of posthumous interests in the Polish legal system. We address the following issues: medical confidentiality, protection of medical data after the death of a patient, author’s moral rights, protection of the memory of the deceased, the law on orders and decorations, and the legal status of human corpses. The theoretical background for this article was the book by Daniel Sperling Posthumous Interest, in which the author outlined the problem in point from the perspective of the common law regime.

A unified framework of rapid exponential stability and optimal feedback control for nonlinear systems

A novel framework of rapid exponential stability and optimal feedback control is investigated and analyzed for a class of nonlinear systems through a variant of continuous Lyapunov functions and Hamilton–Jacobi–Bellman equation. Rapid exponential stability means that the trajectories of nonlinear systems converge to equilibrium states in accelerated time. The sufficient conditions of rapid exponential stability are developed using continuous Lyapunov functions for nonlinear systems. Furthermore, according to a variant of continuous Lyapunov functions, a rapid exponential stability is guaranteed which satisfies some canonical conditions and Hamilton–Jacobi–Bellman equation for controlled nonlinear systems. It is can be seen that the solution of Hamilton–Jacobi–Bellman equation is a continuous Lyapunov function, and, therefore, rapid exponential stability and optimality are guaranteed for nonlinear systems. Last, the main result of this article is investigated via a nonlinear model of a spacecraft with one axis of symmetry through simulations and is used to check rapid exponential stability. Moreover, for the disturbance problem of initial point, a rapid exponential stable controller can reject the large-scale disturbances for controlled nonlinear systems. In addition, the proposed optimal feedback controller is applied to the tracking trajectories of 2-degree-of-freedom manipulator, and the numerical results have illustrated high efficiency and robustness in real time. The simulation results demonstrate the use of the rapid exponential stability and optimal feedback approach for real-time nonlinear systems.

A new GIS model for ecologically suitable distributions of medicinal plants

BackgroundThe endangered rate of medicinal plant exceeds that of endangered plant species. However, blindly introducing medicinal plants in regions without comprehensively considering the involved environmental factors results in diseases and insect pests and the consequent overproof pesticide residue as well as reduces the quality of herbal medicine produced.MethodsGlobal Medicinal Plant Geographic Information System (GMPGIS) was developed to analyze environmental information of ecologically suitable regions, thus guiding the conservation and introduction of medicinal plants. This system is based on theories and methods from multiple disciplines, including computer science, geoinformatics, ecology, and traditional herbal medicine. Using a range-based method, the previously established ecologically suitable regions were evaluated. This new method effectively resolved the problem of outlier points, and its functions were implemented in Python. The system automatically calculates the Euclidean distance of climatic factors and intersection of soil factors, thus identifying regions with high ecological similarity and those are climatically and edaphically suitable for the cultivation of medicinal plants.ResultsThese results, validated using real-world regions, revealed that GMPGIS is highly accurate in screening ecologically suitable regions for the cultivation of medicinal plants worldwide.ConclusionsOverall, because of these features, the GMPGIS is considered as a suitable distribution analysis system for global medicinal plant cultivation.

Coincidence points and common fixed points for three mappings with integral type implicit contraction conditions on ordered metric spaces

In this paper, by using the known class Ψ∗ of 5-dimensional functions determined by the known classes {C ,Φu}, we discuss the existence problems of coincidence points for three mappings of integral type with semiimplicit contraction conditions and obtain a common fixed point theorem for two mappings on ordered metric spaces. Finally, we give a sufficient condition under which there exists a unique common fixed point.

ВЛАСТЬ И НАКАЗАНИЕ В ГЕНЕАЛОГИЧЕСКОМ ПРОЕКТЕ М. ФУКО

The article proposes analytical reconstruction of the French philosopher and historian M. Foucault’s interpretation strategy related to the genealogical project The History of Punishment. The object of cognition marginalization is content moment of this reconstruction, as contributing to both the transformation of the research subject field and the genealogical identification of the object. There are defined the rules of reconstruction, contributing to the diffusion of the methodological approach to power in the genealogy of M. Foucault. The article substantiates the position that the use of some individual rules of reconstruction cannot lead to methodological unity in the genealogical project due to the marginal-positive identification of the object and the structure of The History of Punishment. Comparison of J. Deleuze’s functional analysis and M. Foucault’s genealogical approach to the problem of power points to the diffusion of the method, which is unable to localize its object in the social space. In many ways, this will be facilitated by the use of the visual model as an epistemological one, which is traditional for Foucault’s research. All the dynamic and structural characteristics that are used in Foucault’s genealogy to analyze the concept of Microphysics of power will be reduced to marginal anthropology. In the genealogical period of the French thinker’s work, marginal anthropology is regarded as a way of constructing genealogical reality. Genealogical description as a method of a marginal object description is viewed as a consequence of methodological diffusion. The phenomenon of disciplinary power is considered as a marginal construction, deriving the concept of normal-abnormal from the totality of disciplinary practices, structuring the European society. M. Foucault’s focus on marginal anthropology will serves as a basis for the transition to The History of Sexuality project.

Nokta Etiketi Yerleştirme Problemi için Hızlı Sezgisel Eniyileme Yöntemleri

Point label placement problem is the problem of labeling points in graphical display systems such as mapbased ones in order to minimize conflicts of labels and thus to maximize legibility. Algorithmic complexity of the general problem is proven to be NP-hard. Addressing this problem is becoming more important in dynamic and real-time environments, where both display properties or point elements are subject to change, since those systems have potential use widely and in large scale. In this study, heuristic optimization methods are proposed to facilitate fast and goodquality labeling in such dynamic environments. The methods are two-phased and comprised of several combinations of greedy construction and local search methods. Performances of the methods are examined in terms of solution quality and run time. The eliminative, two-criteria method outperform other methods in this study and the methods proposed in the literature.

Singular Points of Curves

In this paper, we consider the key problem of geometric modeling, connected with the construction of the intersection curves of surfaces. Methods for constructing the intersection curves in complex cases are found: by touching and passing through singular points of surfaces. In the first part of the paper, the problem of determining the tangent line of two surfaces given in parametric form is considered. Several approaches to the solution of the problem are analyzed. The advantages and disadvantages of these approaches are revealed. The iterative algorithms for finding a point on the line of tangency are described. The second part of the paper is devoted to methods for overcoming the difficulties encountered in solving a problem for singular points of intersection curves, in which a regular iterative process is violated. Depending on the type of problem, the author dwells on two methods. The first of them suggests finding singular points of curves without using iterative methods, which reduces the running time of the algorithm of plotting the intersection curve. The second method, considered in the final part of the article, is a numerical method. In this part, the author introduces a function that achieves a global minimum only at singular points of the intersection curves and solves the problem of minimizing this function. The application of this method is very effective in some particular cases, which impose restrictions on the surfaces and their arrangement. In conclusion, this method is considered in the case when the function has such a relief, that in the neighborhood of the minimum point the level surfaces are strongly elongated ellipsoids. All the images given in this article are the result of the work of algorithms on methods proposed by the author. Images are built in the author’s software environment.

Equilibrium point smooth escape algorithm for local route of unmanned surface vehicles

For the problem of local equilibrium point in local path planning, a local equilibrium point smooth escape algorithm is proposed. In this method, a confirmation rule for obstructing obstacles is established to confirm obstacles obstructing routes of an unmanned surface vehicle and causing local equilibrium point from multiple detecting targets. A model for tracking point confirmation is constructed to guide the unmanned surface vehicle to bypass obstructing obstacles safely while tracking points. A tracking point smooth switching model is constructed to ensure smooth change of heading planned by the algorithm in tracking point switching. The idea of ‘wall-following’ algorithm and curve smoothing idea are integrated in the model and then a heading planning method escaping local equilibrium point is given. Simulation results show that the above algorithm can guide the unmanned surface vehicle out of the area where it is trapped when it falls into a local equilibrium point. The algorithm can improve the traceability of planned paths with a heading change rate much lower than that of conventional algorithms.

A Study on a Generalized Relaxed Curvature Energy Action

We investigate the variational problem of the generalized relaxed elastic line defined as the problem of finding critical points of the functional obtained by adding the twisting energy to the bending energy functional, on a non-degenerate surface in Minkowski 3-space. There arise two different situations for the curve $\alpha $ given on any non-degenerate surface S in Minkowski 3-space according to the absolute value expression in the curvature and torsion formulas. We study the problem for both cases and as a result we characterize the generalized relaxed elastic line with an Euler-Lagrange equation and 3 boundary conditions in both cases. Finally, we search special solutions for the differential equation system obtained with regard to the geodesic curvature, geodesic torsion and normal curvature of the curve.

Robust Point Set Registration Using Signature Quadratic Form Distance.

Point set registration is a problem with a long history in many pattern recognition tasks. This paper presents a robust point set registration algorithm based on optimizing the distance between two probability distributions. A major problem in point to point algorithms is defining the correspondence between two point sets. This paper follows the idea of some probability-based point set registration methods by representing the point sets as Gaussian mixture models (GMMs). By optimizing the distance between the two GMMs, rigid transformations (rotation and translation) between two point sets can be obtained without having to find a correspondence. Previous studies have used L2, Kullback Leibler, etc. distance to measure similarity between two GMMs; however, these methods have problems with robustness to noise and outliers, especially when the covariance matrix is large, or a local minimum exists. Therefore, in this paper, the signature quadratic form distance is derived to measure the distribution similarity. The contribution of this paper lies in adopting the signature quadratic form distance for the point set registration algorithm. The experimental results show the precision and robustness of this algorithm and demonstrate that it outperforms other state-of-the-art point set registration algorithms regarding factors, such as noise, outliers, missing partial structures, and initial misalignment.