Log in

Relevant bibliographies by topics / Intersection map / Journal articles

To see the other types of publications on this topic, follow the link: Intersection map.

Journal articles on the topic 'Intersection map'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Intersection map.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Xiong, Lu, Zhenwen Deng, Yuyao Huang, et al. "Traffic Intersection Re-Identification Using Monocular Camera Sensors." Sensors 20, no. 22 (2020): 6515. http://dx.doi.org/10.3390/s20226515.

Full text

Abstract:

Perception of road structures especially the traffic intersections by visual sensors is an essential task for automated driving. However, compared with intersection detection or visual place recognition, intersection re-identification (intersection re-ID) strongly affects driving behavior decisions with given routes, yet has long been neglected by researchers. This paper strives to explore intersection re-ID by a monocular camera sensor. We propose a Hybrid Double-Level re-identification approach which exploits two branches of Deep Convolutional Neural Network to accomplish multi-task including classification of intersection and its fine attributes, and global localization in topological maps. Furthermore, we propose a mixed loss training for the network to learn the similarity of two intersection images. As no public datasets are available for the intersection re-ID task, based on the work of RobotCar, we propose a new dataset with carefully-labeled intersection attributes, which is called “RobotCar Intersection” and covers more than 30,000 images of eight intersections in different seasons and day time. Additionally, we provide another dataset, called “Campus Intersection” consisting of panoramic images of eight intersections in a university campus to verify our updating strategy of topology map. Experimental results demonstrate that our proposed approach can achieve promising results in re-ID of both coarse road intersections and its global pose, and is well suited for updating and completion of topological maps.

APA, Harvard, Vancouver, ISO, and other styles

2

Kilani, Omar, Maged Gouda, Jonas Weiß, and Karim El-Basyouny. "Safety Assessment of Urban Intersection Sight Distance Using Mobile LiDAR Data." Sustainability 13, no. 16 (2021): 9259. http://dx.doi.org/10.3390/su13169259.

Full text

Abstract:

This paper proposes an automated framework that utilizes Light Detection and Ranging (LiDAR) point cloud data to map and detect road obstacles that impact drivers’ field of view at urban intersections. The framework facilitates the simulation of a driver’s field of vision to estimate the blockage percentage as they approach an intersection. Furthermore, a collision analysis is conducted to examine the relationship between poor visibility and safety. The visibility assessment was used to determine the blockage percentage as a function of intersection control type. The safety assessment indicated that intersections with limited available sight distances (ASD) exhibited an increased risk of collisions. The research also conducted a sensitivity analysis to understand the impact of the voxel size on the extraction of intersection obstacles from LiDAR datasets. The findings from this research can be used to assess the intersection without the burden of manual intervention. This would effectively support transportation agencies in identifying hazardous intersections with poor visibility and adopt policies to enhance urban intersections’ operation and safety.

APA, Harvard, Vancouver, ISO, and other styles

3

Biasi, Carlos, and Alice Kimie Miwa Libardi. "Remarks on the bordism intersection map." Tsukuba Journal of Mathematics 30, no. 1 (2006): 171–80. http://dx.doi.org/10.21099/tkbjm/1496165035.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Zhang, Zhonggui, Yi Ming, and Gangbing Song. "A New Approach to Identifying Crash Hotspot Intersections (CHIs) Using Spatial Weights Matrices." Applied Sciences 10, no. 5 (2020): 1625. http://dx.doi.org/10.3390/app10051625.

Full text

Abstract:

In this paper we develop a new approach to directly detect crash hotspot intersections (CHIs) using two customized spatial weights matrices, which are the inverse network distance-band spatial weights matrix of intersections (INDSWMI) and the k-nearest distance-band spatial weights matrix between crash and intersection (KDSWMCI). This new approach has three major steps. The first step is to build the INDSWMI by forming the road network, extracting the intersections from road junctions, and constructing the INDSWMI with road network constraints. The second step is to build the KDSWMCI by obtaining the adjacency crashes for each intersection. The third step is to perform intersection hotspot analysis (IHA) by using the Getis–Ord Gi* statistic with the INDSWMI and KDSWMCI to identify CHIs and test the Intersection Prediction Accuracy Index (IPAI). This approach is validated by comparison of the IPAI obtained using open street map (OSM) roads and intersection-related crashes (2008–2017) from Spencer city, Iowa, USA. The findings of the comparison show that higher prediction accuracy is achieved by using the proposed approach in identifying CHIs.

APA, Harvard, Vancouver, ISO, and other styles

5

Chen, Banqiao, Chibiao Ding, Wenjuan Ren, and Guangluan Xu. "Extended Classification Course Improves Road Intersection Detection from Low-Frequency GPS Trajectory Data." ISPRS International Journal of Geo-Information 9, no. 3 (2020): 181. http://dx.doi.org/10.3390/ijgi9030181.

Full text

Abstract:

The requirements of location-based services have generated an increasing need for up-to-date digital road maps. However, traditional methods are expensive and time-consuming, requiring many skilled operators. The feasibility of using massive GPS trajectory data provides a cheap and quick means for generating and updating road maps. The detection of road intersections, being the critical component of a road map, is a key problem in map generation. Unfortunately, low sampling rates and high disparities are ubiquitous among floating car data (FCD), making road intersection detection from such GPS trajectories very challenging. In this paper, we extend a point clustering-based road intersection detection framework to include a post-classification course, which utilizes the geometric features of road intersections. First, we propose a novel turn-point position compensation algorithm, in order to improve the concentration of selected turn-points under low sampling rates. The initial detection results given by the clustering algorithm are recall-focused. Then, we rule out false detections in an extended classification course based on an image thinning algorithm. The detection results of the proposed method are quantitatively evaluated by matching with intersections from OpenStreetMap using a variety of distance thresholds. Compared with other methods, our approach can achieve a much higher recall rate and better overall performance, thereby better supporting map generation and other similar applications.

APA, Harvard, Vancouver, ISO, and other styles

6

Liu, Minshi, Ling Zhang, Junlian Ge, Yi Long, and Weitao Che. "Map Matching for Urban High-Sampling-Frequency GPS Trajectories." ISPRS International Journal of Geo-Information 9, no. 1 (2020): 31. http://dx.doi.org/10.3390/ijgi9010031.

Full text

Abstract:

As a fundamental component of trajectory processing and analysis, trajectory map-matching can be used for urban traffic management and tourism route planning, among other applications. While there are many trajectory map-matching methods, urban high-sampling-frequency GPS trajectory data still depend on simple geometric matching methods, which can lead to mismatches when there are multiple trajectory points near one intersection. Therefore, this study proposed a novel segmented trajectory matching method in which trajectory points were separated into intersection and non-intersection trajectory points. Matching rules and processing methods dedicated to intersection trajectory points were developed, while a classic “Look-Ahead” matching method was applied to non-intersection trajectory points, thereby implementing map matching of the whole trajectory. Then, a comparative analysis between the proposed method and two other new related methods was conducted on trajectories with multiple sampling frequencies. The results indicate that the proposed method is not only competent for intersection matching with high-frequency trajectory data but also superior to two other methods in both matching efficiency and accuracy.

APA, Harvard, Vancouver, ISO, and other styles

7

Wang, Min, Xun Bao, Lei Zhu, and Yuan Lu Bao. "A Map-Matching Method Using Intersection-Based Parallelogram Criterion." Advanced Materials Research 403-408 (November 2011): 2746–50. http://dx.doi.org/10.4028/www.scientific.net/amr.403-408.2746.

Full text

Abstract:

Accuracy of independent GPS navigation systems is tied to the map-matching algorithm, which overcomes GPS error and traffic map error to map vehicle GPS tracks onto corresponding roads. The paper proposed an improved map-matching algorithm in which an intersection-based dynamic parallelogram criterion is used to improve the accuracy of navigation systems greatly.

APA, Harvard, Vancouver, ISO, and other styles

8

Ort, Teddy, Krishna Murthy, Rohan Banerjee, et al. "MapLite: Autonomous Intersection Navigation Without a Detailed Prior Map." IEEE Robotics and Automation Letters 5, no. 2 (2020): 556–63. http://dx.doi.org/10.1109/lra.2019.2961051.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

HOHMEYER, MICHAEL E. "A SURFACE INTERSECTION ALGORITHM BASED ON LOOP DETECTION." International Journal of Computational Geometry & Applications 01, no. 04 (1991): 473–90. http://dx.doi.org/10.1142/s021819599100030x.

Full text

Abstract:

A robust and efficient surface intersection algorithm that is implementable in floating point arithmetic, accepts surfaces algebraic or otherwise and which operates without human supervision is critical to boundary representation solid modeling. To the author's knowledge, no such algorithms has been developed. All tolerance-based subdivision algorithms will fail on surfaces with sufficiently small intersections. Algebraic techniques, while promising robustness, are presently too slow to be practical and do not accept non-algebraic surfaces. Algorithms based on loop detection hold promise. They do not require tolerances except those associated with machine associated with machine arithmetic, and can handle any surface for which there is a method to construct bounds on the surface and its Gauss map. Published loop detection algorithms are, however, still too slow and do not deal with singularities. We present a new loop detection criterion and discuss its use in a surface intersection algorithms. The algorithm, like other loop detection based intersection algorithms, subdivides the surfaces into pairs of sub-patches which do not intersect in any closed loops. This paper presents new strategies for subdividing surfaces in a way that causes the algorithms to run quickly even when the intersection curve(s) contain(s) singularities.

APA, Harvard, Vancouver, ISO, and other styles

10

Saito, Hiroshi. "Even-Relative-Dimensional Vanishing Cycles in Bivariant Intersection Theory." Nagoya Mathematical Journal 187 (September 2007): 49–73. http://dx.doi.org/10.1017/s0027763000025848.

Full text

Abstract:

AbstractFor a smooth variety proper over a curve having a fibre with isolated ordinary quadratic singularities, it is well-known that we have the vanishing cycles associated to the singularities in the étale cohomology of the geometric generic fibre. The base-change by a double cover of the base curve ramified at the image of the singular fibre has singularities corresponding to the singularities in the fibre. In this note, we show that in the even relative-dimensional case, there exist elements of the bivariant Chow group of the base-change with supports in the singularities and hence their images in the bivariant Chow group with supports in the special fibre and that the usual cohomological vanishing cycles are obtained as their images by a natural map, a kind of “cycle map” so that the elements in the bivariant Chow groups can be regarded as the vanishing cycles. The bivariant Chow group with supports in the special fibre has a ring structure and the natural map is a ring homomorphism to the cohomology ring of the geometric generic fibre. Also discussed is the relation of the bivariant Chow group with supports in the special fibre to the specialization map of Chow groups.

APA, Harvard, Vancouver, ISO, and other styles

11

Machado, Andreia, Araci Hack, and Maria José Sousa. "Globalization: Intersection Between Communication, Innovation and Knowledge." JOURNAL OF INTERNATIONAL BUSINESS RESEARCH AND MARKETING 4, no. 4 (2019): 22–27. http://dx.doi.org/10.18775/jibrm.1849-8558.2015.44.3003.

Full text

Abstract:

Advances in technological possibilities have made communication present in different media and spaces. By enabling interaction between different countries, by becoming a facilitator between knowledge and innovation in the globalized world, it has opened frontiers by providing innovations in various sectors of the knowledge society. In this sense, the objective in this article is to map the intersection of communication, innovation and knowledge in the globalized world. To that end, the methodology used in the research was the systematic search of literature that pointed out that the intersection is motivated by the use of innovative technologies in the process of knowledge sharing, and studies are still scarce in this area. It is possible to perceive, further, that this intersection is branched out, through Social Sciences, Business, Management and Accounting, Computer Science, Medicine, Engineering, Decision Sciences, Nursing, Arts and Humanities, Economics, Econometrics and Finance, Psychology, aligned Health Professions, Agricultural and Biological Sciences, Biochemistry, Genetics and Molecular Biology, Energy, Environmental Science, Mathematics, Materials Science, Multidisciplinary, Neuroscience, Pharmacology, Toxicology and Pharmaceutical and Veterinary.

APA, Harvard, Vancouver, ISO, and other styles

12

Huang, J., M. Deng, Y. Zhang, and H. Liu. "COMPLEX ROAD INTERSECTION MODELLING BASED ON LOW-FREQUENCY GPS TRACK DATA." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLII-2/W7 (September 12, 2017): 23–28. http://dx.doi.org/10.5194/isprs-archives-xlii-2-w7-23-2017.

Full text

Abstract:

It is widely accepted that digital map becomes an indispensable guide for human daily traveling. Traditional road network maps are produced in the time-consuming and labour-intensive ways, such as digitizing printed maps and extraction from remote sensing images. At present, a large number of GPS trajectory data collected by floating vehicles makes it a reality to extract high-detailed and up-to-date road network information. Road intersections are often accident-prone areas and very critical to route planning and the connectivity of road networks is mainly determined by the topological geometry of road intersections. <b>A few studies paid attention on detecting complex road intersections and mining the attached traffic information</b> (e.g., connectivity, topology and turning restriction) from massive GPS traces. To the authors’ knowledge, recent studies mainly used high frequency (1&amp;thinsp;s sampling rate) trajectory data to detect the crossroads regions or extract rough intersection models. <b>It is still difficult to make use of low frequency (20&amp;ndash;100&amp;thinsp;s) and easily available trajectory data to modelling complex road intersections geometrically and semantically</b>. The paper thus attempts to construct precise models for complex road intersection by using low frequency GPS traces. We propose to firstly extract the complex road intersections by a LCSS-based (Longest Common Subsequence) trajectory clustering method, then delineate the geometry shapes of complex road intersections by a K-segment principle curve algorithm, and finally infer the traffic constraint rules inside the complex intersections.

APA, Harvard, Vancouver, ISO, and other styles

13

Guillory, Carroll. "Some conditions on Douglas algebras that imply the invariance of the minimal envelope map." International Journal of Mathematics and Mathematical Sciences 26, no. 10 (2001): 615–24. http://dx.doi.org/10.1155/s0161171201004148.

Full text

Abstract:

We give general conditions on certain families of Douglas algebras that imply that the minimal envelope of the given algebra is the algebra itself. We also prove that the minimal envelope of the intersection of two Douglas algebras is the intersection of their minimal envelope.

APA, Harvard, Vancouver, ISO, and other styles

14

Rito, Carlos. "A surface with canonical map of degree 24." International Journal of Mathematics 28, no. 06 (2017): 1750041. http://dx.doi.org/10.1142/s0129167x17500410.

Full text

Abstract:

We construct a complex algebraic surface with geometric genus [Formula: see text], irregularity [Formula: see text], self-intersection of the canonical divisor [Formula: see text] and canonical map of degree [Formula: see text] onto [Formula: see text].

APA, Harvard, Vancouver, ISO, and other styles

15

Weber, Andrzej. "A morphism of intersection homology induced by an algebraic map." Proceedings of the American Mathematical Society 127, no. 12 (1999): 3513–16. http://dx.doi.org/10.1090/s0002-9939-99-05081-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Wang, Chunxiang, Hairu Huang, Yang Ji, Bing Wang, and Ming Yang. "Vehicle Localization at an Intersection Using a Traffic Light Map." IEEE Transactions on Intelligent Transportation Systems 20, no. 4 (2019): 1432–41. http://dx.doi.org/10.1109/tits.2018.2851788.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Iwata, Satoru, Kazuo Murota, and Maiko Shigeno. "A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences." Mathematics of Operations Research 22, no. 4 (1997): 803–13. http://dx.doi.org/10.1287/moor.22.4.803.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Carey, Leeanne, Alistair Walsh, Achini Adikari, et al. "Finding the Intersection of Neuroplasticity, Stroke Recovery, and Learning: Scope and Contributions to Stroke Rehabilitation." Neural Plasticity 2019 (May 2, 2019): 1–15. http://dx.doi.org/10.1155/2019/5232374.

Full text

Abstract:

Aim. Neural plastic changes are experience and learning dependent, yet exploiting this knowledge to enhance clinical outcomes after stroke is in its infancy. Our aim was to search the available evidence for the core concepts of neuroplasticity, stroke recovery, and learning; identify links between these concepts; and identify and review the themes that best characterise the intersection of these three concepts. Methods. We developed a novel approach to identify the common research topics among the three areas: neuroplasticity, stroke recovery, and learning. A concept map was created a priori, and separate searches were conducted for each concept. The methodology involved three main phases: data collection and filtering, development of a clinical vocabulary, and the development of an automatic clinical text processing engine to aid the process and identify the unique and common topics. The common themes from the intersection of the three concepts were identified. These were then reviewed, with particular reference to the top 30 articles identified as intersecting these concepts. Results. The search of the three concepts separately yielded 405,636 publications. Publications were filtered to include only human studies, generating 263,751 publications related to the concepts of neuroplasticity (n=6,498), stroke recovery (n=79,060), and learning (n=178,193). A cluster concept map (network graph) was generated from the results; indicating the concept nodes, strength of link between nodes, and the intersection between all three concepts. We identified 23 common themes (topics) and the top 30 articles that best represent the intersecting themes. A time-linked pattern emerged. Discussion and Conclusions. Our novel approach developed for this review allowed the identification of the common themes/topics that intersect the concepts of neuroplasticity, stroke recovery, and learning. These may be synthesised to advance a neuroscience-informed approach to stroke rehabilitation. We also identified gaps in available literature using this approach. These may help guide future targeted research.

APA, Harvard, Vancouver, ISO, and other styles

19

Yang, Jing, Jie Zhu, Yizhong Sun, and Jianhua Zhao. "Delimitating Urban Commercial Central Districts by Combining Kernel Density Estimation and Road Intersections: A Case Study in Nanjing City, China." ISPRS International Journal of Geo-Information 8, no. 2 (2019): 93. http://dx.doi.org/10.3390/ijgi8020093.

Full text

Abstract:

An urban, commercial central district is often regarded as the heart of a city. Therefore, quantitative research on commercial central districts plays an important role when studying the development and evaluation of urban spatial layouts. However, conventional planar kernel density estimation (KDE) and network kernel density estimation (network KDE) do not reflect the fact that the road network density is high in urban, commercial central districts. To solve this problem, this paper proposes a new method (commercial-intersection KDE), which combines road intersections with KDE to identify commercial central districts based on point of interest (POI) data. First, we extracted commercial POIs from Amap (a Chinese commercial, navigation electronic map) based on existing classification standards for urban development land. Second, we calculated the commercial kernel density in the road intersection neighborhoods and used those values as parameters to build a commercial intersection density surface. Finally, we used the three standard deviations method and the commercial center area indicator to differentiate commercial central districts from areas with only commercial intersection density. Testing the method using Nanjing City as a case study, we show that our new method can identify seven municipal, commercial central districts and 26 nonmunicipal, commercial central districts. Furthermore, we compare the results of the traditional planar KDE with those of our commercial-intersection KDE to demonstrate our method’s higher accuracy and practicability for identifying urban commercial central districts and evaluating urban planning.

APA, Harvard, Vancouver, ISO, and other styles

20

BAUES, HANS-JOACHIM, and ROMAN MIKHAILOV. "INTERSECTION OF SUBGROUPS IN FREE GROUPS AND HOMOTOPY GROUPS." International Journal of Algebra and Computation 18, no. 05 (2008): 803–23. http://dx.doi.org/10.1142/s0218196708004652.

Full text

Abstract:

We show that the intersection of three subgroups in a free group is related to the computation of the third homotopy group π3. This generalizes a result of Gutierrez–Ratcliffe who relate the intersection of two subgroups with the computation of π2. Let K be a two-dimensional CW-complex with subcomplexes K1, K2, K3 such that K = K1 ∪ K2 ∪ K3 and K1 ∩ K2 ∩ K3 is the 1-skeleton K1 of K. We construct a natural homomorphism of π1(K)-modules [Formula: see text] where Ri = ker {π1(K1) → π1(Ki)}, i = 1,2,3 and the action of π1(K) = F/R1R2R3 on the right-hand abelian group is defined via conjugation in F. In certain cases, the defined map is an isomorphism. Finally, we discuss certain applications of the above map to group homology.

APA, Harvard, Vancouver, ISO, and other styles

21

Buchholz, Arne, and Hannah Markwig. "Tropical covers of curves and their moduli spaces." Communications in Contemporary Mathematics 17, no. 01 (2014): 1350045. http://dx.doi.org/10.1142/s0219199713500454.

Full text

Abstract:

We define the tropical moduli space of covers of a tropical line in the plane as weighted abstract polyhedral complex, and the tropical branch map recording the images of the simple ramifications. Our main result is the invariance of the degree of the branch map, which enables us to give a tropical intersection-theoretic definition of tropical triple Hurwitz numbers. We show that our intersection-theoretic definition coincides with the one given in [B. Bertrand, E. Brugallé and G. Mikhalkin, Tropical open Hurwitz numbers, Rend. Semin. Mat. Univ. Padova 125 (2011) 157–171] where a Correspondence Theorem for Hurwitz numbers is proved. Thus we provide a tropical intersection-theoretic justification for the multiplicities with which a tropical cover has to be counted. Our method of proof is to establish a local duality between our tropical moduli spaces and certain moduli spaces of relative stable maps to ℙ1.

APA, Harvard, Vancouver, ISO, and other styles

22

Leng, Guojun, and Baoyan Duan. "Topology optimization of planar truss structures with continuous element intersection and node stability constraints." Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 226, no. 7 (2011): 1821–31. http://dx.doi.org/10.1177/0954406211427370.

Full text

Abstract:

This article presents a general nonlinear formulation for the topology optimization of planar truss structures. The novelty of this article is that element intersection is described in terms of a continuous intersection factor. The Heaviside function is used to map the element cross-sectional area to intersection properties. Therefore, the intersection feature is described by a continuous and differentiable function. The topology optimization model is hence set as a ground-structure method by simultaneously including constraints on element intersection and cinematic stability of nodes. The latter is also described by a continuous function. Three test cases are presented to demonstrate the validity of the proposed approach. Unlike mixed integer programming, the number of design cycles does not change much as the number of design variables increases.

APA, Harvard, Vancouver, ISO, and other styles

23

Journal, Baghdad Science. "A note on an –module with -pure intersection property." Baghdad Science Journal 6, no. 3 (2009): 596–602. http://dx.doi.org/10.21123/bsj.6.3.596-602.

Full text

Abstract:

Let be a ring. Given two positive integers and , an module is said to be -presented, if there is an exact sequence of -modules with is -generated. A submodule of a right -module is said to be -pure in , if for every -Presented left -module the canonical map is a monomorphism. An -module has the -pure intersection property if the intersection of any two -pure submodules is again -pure. In this paper we give some characterizations, theorems and properties of modules with the -pure intersection property.

APA, Harvard, Vancouver, ISO, and other styles

24

Choi, Young-In, Jae-Hoon Cho, and Yong-Tae Kim. "Collision Avoidance Algorithm of Mobile Robots at Grid Map Intersection Point." INTERNATIONAL JOURNAL of FUZZY LOGIC and INTELLIGENT SYSTEMS 20, no. 2 (2020): 96–104. http://dx.doi.org/10.5391/ijfis.2020.20.2.96.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

程, 浩然. "Optimization Method of Intersection Space-Time Matching Based on “Knowledge Map”." Open Journal of Transportation Technologies 09, no. 02 (2020): 92–100. http://dx.doi.org/10.12677/ojtt.2020.92011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Pica, Giuseppe, Mohammadreza Soltanipour, and Stefano Panzeri. "Using intersection information to map stimulus information transfer within neural networks." Biosystems 185 (November 2019): 104028. http://dx.doi.org/10.1016/j.biosystems.2019.104028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Beidleman, James C., and Matthew F. Ragland. "The intersection map of subgroups and certain classes of finite groups." Ricerche di Matematica 56, no. 2 (2007): 217–27. http://dx.doi.org/10.1007/s11587-007-0015-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Riesenhuber, M., H. U. Bauer, D. Brockmann, and T. Geisel. "Breaking Rotational Symmetry in a Self-Organizing Map Model for Orientation Map Development." Neural Computation 10, no. 3 (1998): 717–30. http://dx.doi.org/10.1162/089976698300017719.

Full text

Abstract:

We analyze the pattern formation behavior of a high-dimensional self-organizing map (SOM) model for the competitive projection of ON-center-type and OFF-center-type inputs to a common map layer. We mathematically show, and numerically confirm, that even isotropic stimuli can drive the development of oriented receptive fields and an orientation map in this model. This result provides an important missing link in the spectrum of pattern formation behaviors observed in SOM models. Extending the model by including further layers for binocular inputs, we also investigate the combined development of orientation and ocular dominance maps. A parameter region for combined patterns exists; corresponding maps show a preference for perpendicular intersection angles between iso-orientation lines and ocularity domain boundaries, consistent with experimental observations.

APA, Harvard, Vancouver, ISO, and other styles

29

de Figueiredo, J. C. Bastos, and C. P. Malta. "Lyapunov Graph for Two-Parameters Map: Application to the Circle Map." International Journal of Bifurcation and Chaos 08, no. 02 (1998): 281–93. http://dx.doi.org/10.1142/s0218127498000176.

Full text

Abstract:

In a Lyapunov graph the Lyapunov exponent, λ, is represented by a color in the parameter space. The color shade varies from black to white as λ goes from -∞ to 0. Some of the main aspects of the complex dynamics of the circle map (θn+1=θn+Ω+(1/2π)K sin (2πθn)( mod 1)), can be obtained by analyzing its Lyapunov graph. For K>1 the map develops one maximum and one minimum and may exhibit bistability that corresponds to the intersection of topological structures (stability arms) in the Lyapunov graph. In the bistability region, there is a strong sensitivity to the initial condition. Using the fact that each of the coexisting stable solution is associated to one of the extrema of the map, we construct a function that allows to obtain the boundary separating the set of initial conditions converging to one stable solution, from the set of initial conditions converging to the other coexisting stable solution.

APA, Harvard, Vancouver, ISO, and other styles

30

Zain, Helwiyah, Meliyana Meliyana, and Muhaimin Muhaimin. "ANALISIS KINERJA SIMPANG TIGA TAK BERSINYAL." Jurnal Teknik Sipil Unaya 2, no. 1 (2019): 41–50. http://dx.doi.org/10.30601/jtsu.v2i1.20.

Full text

Abstract:

Simpang Lamlo is one of No-Signal Three-way Junctions in National Road from Banda Aceh to Medan as a Main road and is connected directly to the Cross-Regional Road that is from Beureuneun to Geumpang as the Minor Road and vice versa. The purpose of this study is to analyze the performance of the No-Signal Three-Way Junctions by using the Indonesian Highway Capacity Manual 1997. Data required in this study are primary and secondary data. The primary data is in the form of the condition data of traffic, intersection geometric, and environment. Secondary data includes the population growth and the map of the road network. Traffic data were collected by using video recording on Monday, Wednesday and Saturday at 7.00 a.m. – 9.00 a.m., 12.00 p.m. – 2.00 p.m and 5.00 p.m. – 7.00 pm. These data were processed by using Microsoft Excel based on MKJI 1997 and and the results were made in the form of tables and graphics. From the tables and graphics, it could be known for the traffic volume, composition, and the peak hours occured in the intersections. The calculation on the peak hour with the current highest peak is on Monday, 5.00 p.m. - 6:00 p.m. in which the traffic volume at the intersection is 2737 (smp / hour). The capacity value of the existing condition in Simpang Lamlo is 2762 (smp / hour). The traffic delay in the intersection is 11,63 (det / smp). The degree of saturation at the existing condition is 0.99, higher than the provision in Indonesian Highway Capacity Manual which is 0,75. The intersection delay value is 15.64 (det / smp) and the queue chance at the intersection is 39,43% to 77,98%,

APA, Harvard, Vancouver, ISO, and other styles

31

BANAGL, MARKUS, and LAURENTIU MAXIM. "DEFORMATION OF SINGULARITIES AND THE HOMOLOGY OF INTERSECTION SPACES." Journal of Topology and Analysis 04, no. 04 (2012): 413–48. http://dx.doi.org/10.1142/s1793525312500185.

Full text

Abstract:

While intersection cohomology is stable under small resolutions, both ordinary and intersection cohomology are unstable under smooth deformation of singularities. For complex projective algebraic hypersurfaces with an isolated singularity, we show that the first author's cohomology of intersection spaces is stable under smooth deformations in all degrees except possibly the middle, and in the middle degree precisely when the monodromy action on the cohomology of the Milnor fiber is trivial. In many situations, the isomorphism is shown to be a ring homomorphism induced by a continuous map. This is used to show that the rational cohomology of intersection spaces can be endowed with a mixed Hodge structure compatible with Deligne's mixed Hodge structure on the ordinary cohomology of the singular hypersurface. Regardless of monodromy, the middle degree homology of intersection spaces is always a subspace of the homology of the deformation, yet itself contains the middle intersection homology group, the ordinary homology of the singular space, and the ordinary homology of the regular part.

APA, Harvard, Vancouver, ISO, and other styles

32

Zhang, Haiyan, Yonglong Luo, Qingying Yu, Xiaoyao Zheng, and Xuejing Li. "Map-matching approach based on link factor and hidden Markov model." Journal of Intelligent & Fuzzy Systems 40, no. 3 (2021): 5455–71. http://dx.doi.org/10.3233/jifs-202292.

Full text

Abstract:

An accurate map matching is an essential but difficult step in mapping raw float car trajectories onto a digital road network. This task is challenging because of the unavoidable positioning errors of GPS devices and the complexity of the road network structure. Aiming to address these problems, in this study, we focus on three improvements over the existing hidden Markov model: (i) The direction feature between the current and historical points is used for calculating the observation probability; (ii) With regard to the reachable cost between the current road section and the destination, we overcome the shortcoming of feature rarefaction when calculating the transition probability with low sampling rates; (iii) The directional similarity shows a good performance in complex intersection environments. The experimental results verify that the proposed algorithm can reduce the error rate in intersection matching and is suitable for GPS devices with low sampling rates.

APA, Harvard, Vancouver, ISO, and other styles

33

Beak, Byungho, Mehdi Zamanipour, K. Larry Head, and Blaine Leonard. "Peer-to-Peer Priority Signal Control Strategy in a Connected Vehicle Environment." Transportation Research Record: Journal of the Transportation Research Board 2672, no. 18 (2018): 15–26. http://dx.doi.org/10.1177/0361198118773567.

Full text

Abstract:

This paper presents a methodology that enhances the priority signal control model in the multi-modal intelligent traffic signal system (MMITSS). To overcome the range limit of vehicle to infrastructure (V2I) and the intersection geometry message (MAP) distance limits, peer-to-peer intersection communications are utilized to send priority requests from adjacent intersections. Through integrated communication, the peer priority control strategy can create a signal plan for prioritized vehicles that considers longer term (headway) arrival times. Transit vehicles are considered in this study. The longer-term signal plan provides a flexible signal schedule that allows local phase actuation. The peer priority strategy is effective in reducing the number of stops and delay for priority eligible vehicles, while minimizing the negative impact on regular vehicles. To validate the strategy, a simulation experiment was designed to compare fully actuated control, coordination, and MMITSS priority control using two different VISSIM simulation networks (Arizona and Utah). The result shows that the peer-to-peer long term planning strategy can improve transit service reliability while limiting the adverse impact on other traffic.

APA, Harvard, Vancouver, ISO, and other styles

34

Oh, Cheol, and Stephen G. Ritchie. "Real-Time Inductive-Signature-Based Level of Service for Signalized Intersections." Transportation Research Record: Journal of the Transportation Research Board 1802, no. 1 (2002): 97–104. http://dx.doi.org/10.3141/1802-12.

Full text

Abstract:

The Highway Capacity Manual (HCM) presents a procedure for estimating signalized intersection control delay, which is used to determine level of service (LOS) and to evaluate intersection performance. The HCM is used extensively by traffic engineers. However, it is intended as an offline decision support tool for planning and design. To meet user requirements of advanced traffic management and information systems, new LOS criteria are required for real-time intersection analysis. The objective of this research was to demonstrate a technique for development of such LOS criteria. The study used a new measure of effectiveness, called reidentification delay (RD), derived from analysis of vehicle inductive signatures and reidentification of vehicles traveling through a major signalized intersection in the city of Irvine, California. Two main issues regarding real-time LOS criteria were tackled. The first was how to determine the threshold values partitioning the LOS categories. To provide reliable real-time traffic information, the threshold values should be decided on so that RDs within the same LOS category would represent similar traffic conditions as much as possible. RDs in different LOS categories should also represent dissimilar traffic conditions. The second issue concerned the aggregation interval to use for RD in deriving LOS categories. An investigation of both fixed and cycle-based aggregation intervals was conducted. Several clustering techniques were then employed to derive LOS categories, including k-means, fuzzy, and self-organizing map approaches. The resulting real-time LOS criteria were then determined. The procedures used in this study are readily transferable to other signalized intersections for the derivation of real-time LOS.

APA, Harvard, Vancouver, ISO, and other styles

35

Konno, Kazuhiro. "Even canonical surfaces with small K2, I." Nagoya Mathematical Journal 129 (March 1993): 115–46. http://dx.doi.org/10.1017/s0027763000004347.

Full text

Abstract:

Let S be a minimal algebraic surface of general type defined over the complex number field C, and let K denote the canonical bundle. According to [10], we call S a canonical surface if the rational map ФK associated with | K | induces a birational map of S onto the image X. We denote by Q (X) the intersection of all hyperquadrics through X.

APA, Harvard, Vancouver, ISO, and other styles

36

Sun, M. K., and P. G. Guyenet. "Medullospinal sympathoexcitatory neurons in normotensive and spontaneously hypertensive rats." American Journal of Physiology-Regulatory, Integrative and Comparative Physiology 250, no. 5 (1986): R910—R917. http://dx.doi.org/10.1152/ajpregu.1986.250.5.r910.

Full text

Abstract:

Aortic depressor nerve discharge (AND), lumbar sympathetic nerve discharge (SND), and single-unit activity of medullospinal pressure-sensitive neurons of nucleus paragigantocellularis lateralis (PGCL neurons) were recorded in halothane-anesthetized 16-wk-old spontaneously hypertensive rats (SHRs) and normotensive Wistar-Kyoto (WKY) rats. The relationship between these variables and mean arterial pressure (MAP) was investigated. The gain of baroreceptor afferents was not significantly different between the strains, but corner MAP (intersection between linear ascending portion of curve and noise) was 38 mmHg higher in SHRs. The relationship between SND and MAP and that between PGCL neuronal activity and MAP were both characterized by a plateau (maximal activity) at low MAP followed by a linear reduction reaching zero at a level called cutoff MAP. The theoretical intersection between the plateau and the linear decremental portion of these curves was defined as a corner MAP. Values of corner MAP determined at the three levels (AND, SND, PGCL) were identical in a given strain and reset by a common value in SHRs (38-40 mmHg). The gain of baroreceptor reflex measured at all three sites as the slope of the linear incremental (AND) or decremental (PGCL and sympathetic chain) portion of the activity-MAP relationship was the same in WKY rats and in SHRs. Cutoff MAP measured in PGCL was identical to that measured in peripheral sympathetic system for a given strain. There was no significant difference in maximal discharge rate of PGCL neurons nor in lumbar SND and no interstrain difference in the proportion of SND that was suppressible by arterial baroreceptor feedback.(ABSTRACT TRUNCATED AT 250 WORDS)

APA, Harvard, Vancouver, ISO, and other styles

37

Al-qutwani, Majed, and Xingwei Wang. "Smart Traffic Lights over Vehicular Named Data Networking." Information 10, no. 3 (2019): 83. http://dx.doi.org/10.3390/info10030083.

Full text

Abstract:

The existing traffic light system fails to deal with the increase in vehicular traffic requirements due to fixed time programming. Traffic flow suffers from vehicle delay and congestion. A new networking technology called vehicular ad hoc networking (VANET) offers a novel solution for vehicular traffic management. Nowadays, vehicles communicate with each other (V2V), infrastructure (V2I), or roadside units (V2R) using IP-based networks. Nevertheless, IP-based networks demonstrate low performance with moving nodes as they depend on communication with static nodes. Currently, the research community is studying a new networking architecture based on content name called named data networking (NDN) to implement it in VANET. NDN is suitable for VANET as it sends/receives information based on content name, not content address. In this paper, we present one of VANET’s network applications over NDN, a smart traffic light system. Our system solves the traffic congestion issue as well as reducing the waiting time of vehicles in road intersections. This system replaces the current conventional system with virtual traffic lights (VTLs). Instead of installing traffic lights at every intersection, we utilize a road side unit (RSU) to act as the intersection controller. Instead of a light signal, the RSU collects the orders of vehicles that have arrived or will arrive at the intersection. After processing the orders according to the priority policy, the RSU sends an instant message for every vehicle to pass the intersection or wait for a while. The proposed system mimics a human policeman intersection controlling. This approach is suitable for autonomous vehicles as they only receive signals from the RSU instead of processing many images. We provide a map of future work directions for enhancing this solution to take into account pedestrian and parking issues.

APA, Harvard, Vancouver, ISO, and other styles

38

Kiem, Young-Hoon, and Jun Li. "Quantum singularity theory via cosection localization." Journal für die reine und angewandte Mathematik (Crelles Journal) 2020, no. 766 (2020): 73–107. http://dx.doi.org/10.1515/crelle-2019-0018.

Full text

Abstract:

AbstractWe generalize the cosection localized Gysin map to intersection homology and Borel–Moore homology, which provides us with a purely topological construction of the Fan–Jarvis–Ruan–Witten invariants and some GLSM invariants.

APA, Harvard, Vancouver, ISO, and other styles

39

Biasi, Carlos, and Osamu Saeki. "On the self-intersection set and the image on a generic map." MATHEMATICA SCANDINAVICA 80 (December 1, 1997): 5. http://dx.doi.org/10.7146/math.scand.a-12609.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Tu, Lai, and Chung-Ming Huang. "Forwards: A Map-Free Intersection Collision-Warning System for All Road Patterns." IEEE Transactions on Vehicular Technology 59, no. 7 (2010): 3233–48. http://dx.doi.org/10.1109/tvt.2010.2051344.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Li, Fuxiang, Fucai Zhou, Heqing Yuan, Zifeng Xu, and Qiang Wang. "Bilinear-map accumulator-based verifiable intersection operations on encrypted data in cloud." Concurrency and Computation: Practice and Experience 28, no. 11 (2016): 3238–53. http://dx.doi.org/10.1002/cpe.3783.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Hosono, S., A. Klemm, S. Theisen, and S. T. Yau. "Mirror symmetry, mirror map and applications to complete intersection Calabi-Yau spaces." Nuclear Physics B 433, no. 3 (1995): 501–52. http://dx.doi.org/10.1016/0550-3213(94)00440-p.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Derr, Robert Ladislas. "Artist, Robert Ladislas Derr uses die rolls and cameras to map his walk through cities worldwide." Surveillance & Society 7, no. 2 (2009): 94–97. http://dx.doi.org/10.24908/ss.v7i2.4135.

Full text

Abstract:

Chance, psychogeographical walk performances through cities with the direction determined by viewers’ die rolls. The die indicates that Derr move forward, backward, right, left, spin, and stand in place. He accepts thirty die rolls and then proceeds on the walk wearing four video cameras. When spin or stand in place are the command, he completes each for one minute. The directional commands take him to the next intersection. After walking with the video cameras, Derr returns to each intersection encountered and photographs the four views, creating a photographic cartography as well. The final videos are exhibited in an immersive four-channel video installation.

APA, Harvard, Vancouver, ISO, and other styles

44

Bandyopadhyay, Pradipta, and S. Dutta. "Farthest points and the farthest distance map." Bulletin of the Australian Mathematical Society 71, no. 3 (2005): 425–33. http://dx.doi.org/10.1017/s0004972700038430.

Full text

Abstract:

In this paper, we consider farthest points and the farthest distance map of a closed bounded set in a Banach space. We show, inter alia, that a strictly convex Banach space has the Mazur intersection property for weakly compact sets if and only if every such set is the closed convex hull of its farthest points, and recapture a classical result of Lau in a broader set-up. We obtain an expression for the subdifferential of the farthest distance map in the spirit of Preiss' Theorem which in turn extends a result of Westphal and Schwartz, showing that the subdifferential of the farthest distance map is the unique maximal monotone extension of a densely defined monotone operator involving the duality map and the farthest point map.

APA, Harvard, Vancouver, ISO, and other styles

45

Denim, Fethi, Abdelkrim Nemra, Kahina Louadj, Abdelghani Boucheloukh, Mustapha Hamerlain, and Abdelouahab BAZOULA Bazoula. "Cooperative Visual SLAM based on Adaptive Covariance Intersection." Journal of Advanced Engineering and Computation 2, no. 3 (2018): 151. http://dx.doi.org/10.25073/jaec.201823.91.

Full text

Abstract:

Simultaneous localization and mapping (SLAM) is an essential capability for Unmanned Ground Vehicles (UGVs) travelling in unknown environments where globally accurate position data as GPS is not available. It is an important topic in the autonomous mobile robot research. This paper presents an Adaptive De-centralized Cooperative Vision-based SLAM solution for multiple UGVs, using the Adaptive Covariance Intersection (ACI) supported by a stereo vision sensor. In recent years, SLAM problem has gotten a specific consideration, the most commonly used approaches are the EKF-SLAM algorithm and the FAST-SLAM algorithm. The primary, which requires an accurate process and an observation model, suffers from the linearization problem. The last mentioned is not suitable for real-time implementation. In our work, the Visual SLAM (VSLAM) problem could be solved based on the Smooth Variable Structure Filter (SVSF) is proposed. This new filter is robust and stable to modelling uncertainties making it suitable for UGV localization and mapping problem. This new strategy retains the near optimal performance of the SVSF when applied to an uncertain system, it has the added benefit of presenting a considerable improvement in the robustness of the estimation process. All UGVs will add data features sorted by the ACI that estimate position on the global map. This solution gives, as a result, a large reliable map constructed by a group of UGVs plotted on it. This paper presents a Cooperative SVSF-VSLAM algorithm that contributes to solve the Adaptive Cooperative Vision SLAM problem for multiple UGVs. The algorithm was implemented on three mobile robots Pioneer 3-AT, using stereo vision sensors. Simulation results show eciency and give an advantage to our proposed algorithm, compared to the Cooperative EKF-VSLAM algorithm mainly concerning the noise quality. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

APA, Harvard, Vancouver, ISO, and other styles

46

ZIBRAT, ZACHARY H., and ANDREW J. SZERI. "SADDLE-TYPE TORUS BRAIDS IN QUASIPERIODICALLY DRIVEN SYSTEMS: CROSSOVER MAPS OF TRANSVERSALLY INTERSECTING MANIFOLDS." International Journal of Bifurcation and Chaos 18, no. 10 (2008): 3001–12. http://dx.doi.org/10.1142/s0218127408022214.

Full text

Abstract:

In [Spears et al., 2005] it was demonstrated that insight into the geometry and topology of attractors for nonlinear oscillators driven by n incommensurate frequencies may be obtained from the study of n Poincaré maps defined on global cross-sections. The attractors take the form of stable torus braids. Here, attention is focused on saddle-type torus braids in similar systems. Transverse intersections of stable and unstable manifolds are computed using the phase slice method, along with the application of the crossover map. This neatly maps from one global Poincaré section to another. As such, it can be used to compute lobe intersection geometries in the remaining n - 1 Poincaré sections after doing so by the phase slice method in the first.

APA, Harvard, Vancouver, ISO, and other styles

47

Kim, Eui Myoung. "Methodology of Identifying Crime Vulnerable Road and Intersection Using Digital Map Version 2.0." Journal of Korean Society for Geospatial Information System 22, no. 4 (2014): 135–42. http://dx.doi.org/10.7319/kogsis.2014.22.4.135.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Jeong, Yewon. "Moduli map of second fundamental forms on a nonsingular intersection of two quadrics." Mathematische Annalen 372, no. 1-2 (2017): 1–54. http://dx.doi.org/10.1007/s00208-017-1556-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Uchiyama, Hideaki, Hideo Saito, Myriam Servières, and Guillaume Moreau. "AR Geovisualization Framework Based on On-line Geographic Data Matching between a Map with Intersections and its Intersection Database on GIS." Journal of The Institute of Image Information and Television Engineers 64, no. 4 (2010): 563–69. http://dx.doi.org/10.3169/itej.64.563.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Wahid, Nur H. A. A., Ali H. M. Murid, and Mukhiddin I. Muminov. "Analytical Solution for Finding the Second Zero of the Ahlfors Map for an Annulus Region." Journal of Mathematics 2019 (August 28, 2019): 1–11. http://dx.doi.org/10.1155/2019/6961476.

Full text

Abstract:

The Ahlfors map is a conformal mapping function that maps a multiply connected region onto a unit disk. It can be written in terms of the Szegö kernel and the Garabedian kernel. In general, a zero of the Ahlfors map can be freely prescribed in a multiply connected region. The remaining zeros are the zeros of the Szegö kernel. For an annulus region, it is known that the second zero of the Ahlfors map can be computed analytically based on the series representation of the Szegö kernel. This paper presents another analytical method for finding the second zero of the Ahlfors map for an annulus region without using the series approach but using a boundary integral equation and knowledge of intersection points.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!