Intersection Of Objects Research Articles

Sustainable Development Calling for Policy Analytics and (Wittgensteinian Turn Towards) Economics of Moderation

As post-MDGs (Millennium Development Goals) international policy focus turns toward establishing Sustainable Development Goals (SDGs) as the global development agenda beyond the year 2015, it is becoming clear that the conceptual framework underpinning sustainable development is still loosely defined as the intersection of environmental sustainability, economic development and social equity objectives. Likewise, attempts and quantifying and analysing developmental sustainability never aggregate meaningfully from the sourced environmental, economic and social indices. In this paper the author has these objectives: to seek greater conceptual clarity vis-a-vis SDGs as the object of analysis, debate and policymaking, to attempt to infuse economics of moderation proper as the requisite paradigm which internalises and institutionalises SDGs at the core of our socio-political-economic reforms, to posit cultural integrity as the fourth integral component to developmental sustainability, and finally to call for active academic-methodological research into the construction and calibration of policy analytics that leverage off of those already available environmental-sustainability, economic-development and social-equity indices. Only then will the imperative urgency of action emerge as self-evident, politically subscribed and morally compelling.

GPU ray tracing

The NVIDIA® OptiX™ ray tracing engine is a programmable system designed for NVIDIA GPUs and other highly parallel architectures. The OptiX engine builds on the key observation that most ray tracing algorithms can be implemented using a small set of programmable operations. Consequently, the core of OptiX is a domain-specific just-in-time compiler that generates custom ray tracing kernels by combining user-supplied programs for ray generation, material shading, object intersection, and scene traversal. This enables the implementation of a highly diverse set of ray tracing-based algorithms and applications, including interactive rendering, offline rendering, collision detection systems, artificial intelligence queries, and scientific simulations such as sound propagation. OptiX achieves high performance through a compact object model and application of several ray tracing-specific compiler optimizations. For ease of use it exposes a single-ray programming model with full support for recursion and a dynamic dispatch mechanism similar to virtual function calls.

Tracking Method in Consideration of Existence of Similar Object around Target Object

Tracking methods based on the particle filter uses frequently the appearance information of the target object to calculate the likelihood. The method using it often fails in tracking when the target object intersects with other objects with similar appearances. We propose a new approach for tracking objects with similar patterns in a video sequence taken by a moving camera. The proposed method based on the particle filter is robust to the intersection with other objects. Two state transition functions are defined for robust tracking. The method changes the function depending on the situation. In addition, the likelihood is calculated by using four factors which are the information of the color, the velocity, the distance between the objects and the values calculated by the probability background model. The method detects objects which are similar to the target object and which exist around the target object. This prevents the method from tracking other object mistakenly. Results are demonstrated by experiments using real video sequences.

Objects Collision Detection in Virtual Scene

An algorithm of two stages collision detection is presented for moving objectives in virtual scene. Firstly, AABB bounding box was used to test the intersection of interesting objects in coarse detection stage. Then combining space projection with Z-buffer algorithm, the potential intersecting objects in previous step were tested in precision detection stage, thus we can obtain objects collision data information and complete object collision detection. Finally experimental results show that the algorithm is more efficiency than traditional bounding box detection, the improved technology can realize further accurate collision detection.

FKM Based Approach for Hybrid Video Segmentation

In digital storage media, Video segmentation is one of the popular and important techniques.The challenging problem in digital storage media is video segmentation. In this hybrid video segmentation technique, initially similar shots are segmented. Then subsequently the track frames in every shot are assorted using the extracted objects of every frame which highly mostly reduces the processing time. Here it yields the effective video segmentation results by performing intersection on the segmented results provided by both the frame difference method as well as consecutive frame intersection method. In frame difference method, it considers the key frame as background and it segments the dynamic objects whereas in the frame difference method, it segments the static and dynamic objects by intersection of objects in consecutive frames. This new hybrid video segmentation technique is developed using FKM clustering approach and is evaluated by varying video sequences and then efficiency is analyzed by calculating the statistical measures and kappa coefficient.

Tamils and Greater India: Some issues of connected histories

The idea of connected histories has been in vogue for some time especially in the context of maritime history and linkages in the early modern period. A central and distinguishing feature of connected histories is to understand and contextualize movements and intersections of people, objects and ideas. In the nineteenth century, especially within the framework of empire, new modalities of migration and self-representation emerged to complicate the ideas of region and identity. One such mode of representation was the idea of Greater India that had multiple public manifestations. This article is an attempt to ask fresh questions mostly about the afterlife of the idea, of its deployment in journalistic practice and to investigate how and whether the Tamil experience in South East Asia was written into it in a meaningful and sustained way.

Calling It Mammon

Competitive funding by the European Union for community projects in Northern Ireland operates according to a political logic in which some groups and projects (deemed progressive, modern and generally secular) are prioritised, while others (discursively positioned as anachronistic, traditional and religious) are precluded. In this process, EU processes of statecraft seek to instrumentalise grassroots organisations as means to the many ends of a disenchanted, modern EU federation. In turn, overtly religious groups (among them churches, parachurches, and confraternities of various kinds) adapt to these conditions by instrumentalising EU processes and goals to the general end of securing a future place for religiosity in the 'new' Northern Ireland. This paper discusses the intersection of religious objectives and ideologies with that of European modernism in the context of two organisations: the Orange Order and the Divine Fellowship Congregation (DFC). Speci fically, I argue that both associations have developed distinctive forms of practice (the 'Orangefest' and 'Utopia' projects, respectively) that re-conceive what is possible for modern EU-funded initiatives. This adaptation has implications for both sets of institutions, in that each is transformed through articulation with the other.

Semialgebraic Range Reporting and Emptiness Searching with Applications

In a typical range-emptiness searching (resp., reporting) problem, we are given a set P of n points in $\mathbb{R}^d$, and we wish to preprocess it into a data structure that supports efficient range-emptiness (resp., reporting) queries, in which we specify a range $\sigma$, which, in general, is a semialgebraic set in $\mathbb{R}^d$ of constant description complexity, and we wish to determine whether $P\cap\sigma=\emptyset$, or to report all the points in $P\cap\sigma$. Range-emptiness searching and reporting arise in many applications and have been treated by Matoušek [Comput. Geom. Theory Appl., 2 (1992), pp. 169–186] in the special case where the ranges are half-spaces bounded by hyperplanes. As shown in Matoušek's work, the two problems are closely related, and they have solutions (for the case of half-spaces) with similar performance bounds. In this paper we extend the analysis to general semialgebraic ranges and show how to adapt Matoušek's technique without the need to linearize the ranges into a higher-dimensional space. This yields more efficient solutions to several useful problems, and we demonstrate the new technique in four applications with the following results: (i) An algorithm for ray shooting amid balls in $\mathbb{R}^3$, which uses $O(n)$ storage and $O^*(n)$ preprocessing (we use the notation $O^*(n^\gamma)$ to mean an upper bound of the form $C(\varepsilon)n^{\gamma+\varepsilon}$, which holds for any $\varepsilon>0$, where $C(\varepsilon)$ is a constant that depends on $\varepsilon$) and answers a query in $O^*(n^{2/3})$ time, improving the previous bound of $O^*(n^{3/4})$. (ii) An algorithm that preprocesses, in $O^*(n)$ time, a set P of n points in $\mathbb{R}^3$ into a data structure with $O(n)$ storage, so that, for any query line $\ell$ (or, for that matter, any simply shaped convex set), the point of P farthest from $\ell$ can be computed in $O^*(n^{1/2})$ time. This in turn yields an algorithm that computes the largest-area triangle spanned by P in time $O^*(n^{26/11})$, as well as nontrivial algorithms for computing the largest-perimeter or largest-height triangle spanned by P. (iii) An algorithm that preprocesses, in $O^*(n)$ time, a set P of n points in $\mathbb{R}^2$ into a data structure with $O(n)$ storage, so that, for any query $\alpha$-fat triangle $\Delta$, we can determine, in $O^*(1)$ time, whether $\Delta\cap P$ is empty. Alternatively, we can report, in $O^*(1)+O(k)$ time, the points of $\Delta\cap P$, where $k=|\Delta\cap P|$. (iv) An algorithm that preprocesses, in $O^*(n)$ time, a set P of n points in $\mathbb{R}^2$ into a data structure with $O(n)$ storage, so that, given any query semidisk c, or a circular cap larger than a semidisk, we can determine, in $O^*(1)$ time, whether $c\cap P$ is empty, or report the k points in $c\cap P$ in $O^*(1)+O(k)$ time. Adapting the recent techniques of [B. Aronov and S. Har-Peled, SIAM J. Comput., 38 (2008), pp. 899–921, B. Aronov, S. Har-Peled, and M. Sharir, On approximate halfspace range counting and relative epsilon-approximations, in Proceedings of the 23rd ACM Symposium Comput. Geom., 2007, pp. 327–336, B. Aronov and M. Sharir, SIAM J. Comput., 39 (2010), pp. 2704–2725], we can turn our solutions into efficient algorithms for approximate range counting (with small relative error) for the cases mentioned above. Our technique is closely related to the notions of nearest- or farthest-neighbor generalized Voronoi diagrams and of the union or intersection of geometric objects, where sharper bounds on the combinatorial complexity of (decompositions of complements of) these structures yield faster range-emptiness searching or reporting algorithms.

Quantum algorithmic methods for computational geometry

In this paper we develop novel quantum algorithms based on Quantum Multi-Object Search (QMOS) for convex hulls and general object intersection reporting, with applications to computer graphics. These algorithms are developed and described using standard concepts from computer science by encapsulating the physics of quantum computation within black-box subroutines.

Cosmological intersecting brane solutions in string theory

The recent discovery of an explicit dynamical description of p-branes makes it possible to investigate the existence of intersection of such objects. We generalize the solutions depending on the overall transverse space coordinates and time to those which depend also on the relative transverse space and satisfy new intersection rules. We give classification of these dynamical intersecting brane solutions involving two branes, and discuss the application of these solutions to cosmology and show that these give Friedmann–Lemaitre–Robertson–Walker cosmological solutions.

The ellipse: a historical and mathematical journey

PREFACE. CHAPTER 1: INTRODUCTION. CHAPTER 2: THE TRAIL: STARTING OUT. 2.1 A Sticky Matter. 2.2 Numbers. 2.2.1 Integers, Rational Numbers, and Irrational Numbers. 2.2.2 The Size of the Irrational Numbers. 2.2.3 Suitability of Rationals and the Decimal System. 2.2.4 Rational and Irrational Outcomes. CHAPTER 3: THE SPACE: GEOMETRY. 3.1 Euclidean Space, Dimension and Rescaling. 3.1.1 Euclidean Space and Objects. 3.1.2 Euclidean Space in Higher Dimensions. 3.1.3 Unit Measurements and Measures of Objects. 3.1.4 Rescaling, Measurement, and Dimension. 3.1.5 Koch's Snowflake, a Fractal Object. 3.2 Measurements of Various Objects. 3.2.1 Pythagorean Theorem, Length of the Hypotenuse. 3.2.2 Cavalieri's Theorem in Two Dimensions. 3.2.3 Cavalieri's Theorem, Archimedes Weighs In. 3.2.4 Simple Applications of Cavalieri s Theorem. 3.2.5 The Circle. 3.2.6 Surface Area of the Cone. 3.2.7 Cavalieri's Theorem a Stronger Version in Three Dimensions. 3.2.8 Generalized Pyramids. 3.2.9 The Sphere as a Generalized Pyramid. 3.2.10 The Surface Area and Volume of the Sphere. 3.2.11 Equal-Area Maps, Another Excursion. CHAPTER 4: THE LANGUAGE: ALGEBRA. 4.1 Cartesian Coordinates and Translation of the Axes. 4.1.1 Intersections of Geometric Objects as Solutions to Equations. 4.1.2 Translation of Axis and Object. 4.2 Polynomials. 4.2.1 Lines. 4.2.2 Parabolas and the Quadratic Equation. 4.3 Circles. 4.3.1 Equations for a Circle. 4.3.2 Archimedes and the Value of . 4.3.3 Tangent Lines to a Circle. 4.4 The Four-Dimensional Sphere. 4.4.1 Pythagorean Theorem in Higher Dimensions. 4.4.2 Measurements in Higher Dimensions and n-Dimensional Cubes. 4.4.3 Cavalieri's Theorem. 4.4.4 Pyramids. 4.4.5 The n-Dimensional Sphere as an n-Dimensional Pyramid 4.4.6 The Three-Dimensional Volume of the Four-Dimensional Sphere's Surface 4.5 Finite Series and Induction. 4.5.1 A Simple Sum. 4.5.2 Induction. 4.5.3 Using Induction as a Solution Method. 4.6 Linear Algebra in Two Dimensions. 4.6.1 Vectors. 4.6.2 The Span of Vectors. 4.6.3 Linear Transformations of the Plane Onto Itself. 4.6.4 The Inverse of a Linear Transformation. 4.6.5 The Determinant. 4.7 The Ellipse. 4.7.1 The Ellipse as a Linear Transformation of a Circle. 4.7.2 The Equation of an Ellipse. 4.7.3 An Excursion into the Foci of an Ellipse. CHAPTER 5: THE UNIVERSAL TOOL: TRIGONOMETRY. 5.1 Trigonometric Functions. 5.1.1 Basic Definitions. 5.1.2 Triangles. 5.1.3 Examples. 5.2 Graphs of the Sine, Cosine, and Tangent Functions. 5.3 Rotations. 5.4 Identities. 5.4.1 Pythagorean Identity. 5.4.2 Negative of an Angle. 5.4.3 Tan( ) in Terms of Sin( ) and Cos( ). 5.4.4 Sines and Cosines of Sums of Angles. 5.4.5 Difference Formulas. 5.4.6 Double-Angle Formulas. 5.4.7 Half-Angle Formulas. 5.5 Lucky 72. 5.6 Ptolemy and Aristarchus. 5.6.1 Construction of Ptolemy's Table. 5.6.2 Remake of Aristarchus. 5.7 Drawing a Pentagon. 5.8 Polar Coordinates. 5.9 The Determinant. CHAPTER 6: THE SLAYER: CALCULUS. 6.1 Studies of Motion and the Fundamental Theorem of Calculus. 6.1.1 Constant Velocity and Two Problems of Motion. 6.1.2 Differential Calculus, Generalizing the First Problem. 6.1.3 Integral Calculus, Generalizing the Second Problem. 6.1.4 Relations Between Differentiation and Integration and the Fundamental Theorem of Calculus. 6.1.5 Integration, Leibniz Notation, and the Fundamental Theorem of Calculus. 6.2 More Motion: Going in Circles. 6.3 More Differential Calculus. 6.3.1 Differentiation Rules. 6.3.2 Notation and the Derivative at a Specified Point. 6.3.3 Higher Order Differentiation and Examples. 6.3.4 Differentiation and the Enquirer. 6.4 More Integral Calculus. 6.4.1 The Antiderivative and the Fundamental Theorem of Calculus. 6.4.2 Methods of Integration. 6.5 Potpourri. 6.5.1 Cavalieri's Theorem and the Fundamental Theorem of Calculus. 6.5.2 Volume of the Sphere and Other Objects with Known Cross-Sectional Areas. CHAPTER 7: EIGHT MINUTES THAT CHANGED HISTORY. 7.1 Newton's Laws of Motion. 7.2 Galilean Checkpoint. 7.3 Constants of Motion and Energy. 7.3.1 Energy of a Tossed Object. 7.3.2 Energy of a System Moving in a Single Dimension. 7.4 Kepler and Newton: Aristarchus Redeemed. 7.4.1 Polar Coordinates. 7.4.2 Angular Momentum. 7.4.3 The Ellipse. EPILOGUE. BIBLIOGRAPHY. INDEX.

Cosmological intersecting brane solutions

The recent discovery of an explicit dynamical description of p-branes makes it possible to investigate the existence of intersection of such objects. We generalize the solutions depending on the overall transverse space coordinates and time to those which depend also on the relative transverse space and satisfy new intersection rules. We give classification of these dynamical intersecting brane solutions involving two branes, and discuss the application of these solutions to cosmology and show that these give Friedmann-Lemaitre-Robertson-Walker cosmological solutions. Finally, we construct the brane world models, using the (cut-)copy-paste method after compactifying the trivial spatial dimensions. We then find that interesting brane world models can be obtained from codimension-one branes and several static branes with higher codimensions. We also classify the behaviors of the brane world near the future/past singularity.

Time and the archaeological archive

This paper begins by reviewing conventional understandings of the historical and archaeological record and questions the lack of problematizing the nature of time in relation to the archive. Drawing on the concept of memory in both mental (testimony) and material terms (trace), the paper argues that we need to address the temporal paradox at the heart of any archive, namely the continuity of the past into the present. Using the concept of palimpsest, the materiality of memory as trace is then explored as a way to understand the intersection of objects and events – and their residues. It is proposed that the trace produces a very different historical ontology to testimony, one that requires different kinds of narrative. Specifically, the residuality that is implicit in the concept of trace references an interia or resilience in the material world where preservation and destruction – memory and forgetting – are entangled with degrees of reversibility to the order of things.

Stablep-branes in Chern-Simons AdS supergravities

We construct static codimension-two branes in any odd dimension $D$, with a negative cosmological constant, and show that they are exact solutions of Chern-Simons (super)gravity theory for (super)${\mathrm{AdS}}_{D}$ coupled to external sources. The stability of these solutions is analyzed by counting the number of preserved supersymmetries. It is shown that static massive ($D\ensuremath{-}3$)-branes are unstable unless some suitable gauge fields are added and the brane is extremal. In particular, in three dimensions, a 0-brane is recognized as the negative mass counterpart of the Ba\~nados-Teitelboim-Zanelli black hole. For these 0-branes, we write explicitly magnetically charged Bogomol'nyi-Prasad-Sommerfield states with various numbers of preserved supersymmetries within the $OSp(p\ensuremath{\mid}2)\ifmmode\times\else\texttimes\fi{}OSp(q\ensuremath{\mid}2)$ supergroups. In five dimensions, we prove that stable 2-branes with magnetic charge always exist for the generic supergroup $SU(2,4\ensuremath{\mid}N)$, where $N\ensuremath{\ne}4$. For the special case $N=4$, in which Chern-Simons supergravity requires the addition of a nontrivial gauge field configuration in order to preserve the maximal number of degrees of freedom, we show for two different static 2-branes that they are Bogomol'nyi-Prasad-Sommerfield states (one of which is the ground state), and from the corresponding algebra of charges we show that the energy is bounded from below. In higher dimensions, our results admit a straightforward generalization, although there are presumably more solutions corresponding to different intersections of the elementary objects.

OptiX

The NVIDIA® OptiX™ ray tracing engine is a programmable system designed for NVIDIA GPUs and other highly parallel architectures. The OptiX engine builds on the key observation that most ray tracing algorithms can be implemented using a small set of programmable operations. Consequently, the core of OptiX is a domain-specific just-in-time compiler that generates custom ray tracing kernels by combining user-supplied programs for ray generation, material shading, object intersection, and scene traversal. This enables the implementation of a highly diverse set of ray tracing-based algorithms and applications, including interactive rendering, offline rendering, collision detection systems, artificial intelligence queries, and scientific simulations such as sound propagation. OptiX achieves high performance through a compact object model and application of several ray tracing-specific compiler optimizations. For ease of use it exposes a single-ray programming model with full support for recursion and a dynamic dispatch mechanism similar to virtual function calls.

OptiX

The NVIDIA® OptiX™ ray tracing engine is a programmable system designed for NVIDIA GPUs and other highly parallel architectures. The OptiX engine builds on the key observation that most ray tracing algorithms can be implemented using a small set of programmable operations. Consequently, the core of OptiX is a domain-specific just-in-time compiler that generates custom ray tracing kernels by combining user-supplied programs for ray generation, material shading, object intersection, and scene traversal. This enables the implementation of a highly diverse set of ray tracing-based algorithms and applications, including interactive rendering, offline rendering, collision detection systems, artificial intelligence queries, and scientific simulations such as sound propagation. OptiX achieves high performance through a compact object model and application of several ray tracing-specific compiler optimizations. For ease of use it exposes a single-ray programming model with full support for recursion and a dynamic dispatch mechanism similar to virtual function calls.

Approximating the volume of unions and intersections of high-dimensional geometric objects

We consider the computation of the volume of the union of high-dimensional geometric objects. While showing that this problem is #P-hard already for very simple bodies, we give a fast FPRAS for all objects where one can (1) test whether a given point lies inside the object, (2) sample a point uniformly, and (3) calculate the volume of the object in polynomial time. It suffices to be able to answer all three questions approximately. We show that this holds for a large class of objects. It implies that Klee's measure problem can be approximated efficiently even though it is #P-hard and hence cannot be solved exactly in polynomial time in the number of dimensions unless P = NP . Our algorithm also allows to efficiently approximate the volume of the union of convex bodies given by weak membership oracles. For the analogous problem of the intersection of high-dimensional geometric objects we prove #P-hardness for boxes and show that there is no multiplicative polynomial-time 2 d 1 − ε -approximation for certain boxes unless NP = BPP , but give a simple additive polynomial-time ε-approximation.

Development and Evaluation of a Coordinated and Conditional Bus Priority Approach

One problem in existing bus priority strategies is that while a decision is being made to grant priority at an intersection, the bus arrival time at the downstream intersections is not considered. Moreover, only strategies for late buses are discussed; the strategies for early buses are seldom studied. This research tests a different bus priority approach, coordinated and conditional bus priority (CCBP). Coordinated, signalized intersection groups are adopted as control objects. Buses are detected one or more cycles before their arrival at the first intersection of the control object. A CCBP, with two kinds of priority strategies (increasing and decreasing bus delay strategies), is proposed. A model was built to generate the optimal combination of priority strategies for intersection groups so that the real delay of buses would be close to the permitted delay defined by the bus operation system. In the field application, the CCBP approach is compared with other two options: no priority and unconditional priority. Significant reductions on bus delay deviation and bus headway deviation were achieved with the use of the CCBP approach. Application of the CCBP approach resulted in only minor increases in total average delay of motor vehicles. The results of the field application studies performed as part of this study suggested that the CCBP approach could be used to decrease bus delay deviation and enhance the reliability of bus service without significantly affecting the delay of other motor vehicles.

Robust Tracking Method to Intersections of Objects with Similar Patterns

This paper proposes an approach of robust tracking for crossing of similar pattern objects. It is based on the particle filter. As far as only appearance information of a target object is used for the particle filter, it fails in tracking the target object when it intersects other objects with similar patterns. The proposed method uses velocity information of the target object and distance information between the target object and other moving objects in addition to appearance information. The situation judges where the target object exists and how to calculate the likelihood of each particle is changed according to the situation. The proposed method can track targets efficiently and accurately by using the result of background subtraction. Moreover, the method is improved so that it can track objects even when they are hidden wholly by a background object. Results are demonstrated by experiments using real video sequences.

Beyond the Visual: Considering the Archaeology of Colonial Sounds

Many historians and archaeologists have focused on trade goods in the French colonies, yet few have examined how these items were animated in colonial contexts. Here, the issue of colonial performance as it related to trade goods (such as hawk bells, brass tinklers, glass beads) is examined and it is argued that the power of these objects was more than purely visual. Case studies from French Louisiana are presented to discuss the intersection of bodies and objects, of the exotic and the erotic towards understanding the sounds that emanated from colonial communities and households.