|
Isochrone Map
An isochrone map in geography and urban planning is a map that depicts the area accessible from a point within a certain time threshold. An wikt:isochrone, isochrone (iso = equal, chrone = time) is defined as "a line drawn on a map connecting points at which something occurs or arrives at the same time". In hydrology and transportation planning isochrone maps are commonly used to depict areas of equal travel time. The term is also used in cardiology as a tool to visually detect abnormalities using body surface distribution. History Early examples of Isochrone maps include the Francis Galton, Galton's ''Isochronic Postal Charts'' and ''Isochronic Passage Charts'' of 1881 and 1882, Collins Bartholomew, Bartholomew's ''Isochronic Distance Map and Chart'' first published 1889, and Albrecht Penck, Albrecht Penck's ''Isochronenkarte'' first published 1887. Where as Galton and the Bartholomews published maps depicting the days or weeks it took to travel long distances, Albrecht furthe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rail Transport
Rail transport (also known as train transport) is a means of transport using wheeled vehicles running in railway track, tracks, which usually consist of two parallel steel railway track, rails. Rail transport is one of the two primary means of land transport, next to road transport. It is used for about 8% of passenger and rail freight transport, freight transport globally, thanks to its Energy efficiency in transport, energy efficiency and potentially high-speed rail, high speed.Rolling stock on rails generally encounters lower friction, frictional resistance than rubber-tyred road vehicles, allowing rail cars to be coupled into longer trains. Power is usually provided by Diesel locomotive, diesel or Electric locomotive, electric locomotives. While railway transport is capital intensity, capital-intensive and less flexible than road transport, it can carry heavy loads of passengers and cargo with greater energy efficiency and safety. Precursors of railways driven by human or an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mode Of Transport
A mode of transport is a method or way of travelling, or of transporting people or cargo. The different modes of transport include air, water, and land transport, which includes rails or railways, road and off-road transport. Other modes of transport also exist, including pipelines, cable transport, and space transport. Human-powered transport and animal-powered transport are sometimes regarded as distinct modes, but they may lie in other categories such as land or water transport. In general, '' transportation'' refers to the moving of people, animals, and other goods from one place to another, and ''means of transport'' refers to the transport facilities used to carry people or cargo according to the chosen mode. Examples of the means of transport include automobile, airplane, ship, truck, and train. Each mode of transport has a fundamentally different set of technological solutions. Each mode has its own infrastructure, vehicles, transport operators and operations. An ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Accessibility (transport)
In Transportation planning, transport planning, accessibility refers to a measure of the ease of reaching (and interacting with) destinations or activities distributed in space, e.g. around a city or country. Accessibility is generally associated with a place (or places) of origin. A place with "high accessibility" is one from which many destinations can be reached or destinations can be reached with relative ease. "Low accessibility" implies that relatively few destinations can be reached for a given amount of time/effort/cost or that reaching destinations is more difficult or costly from that place. The concept can also be defined in the other direction, and we can speak of a place having accessibility ''from'' some set of surrounding places. For example, one could measure the accessibility of a store to customers as well as the accessibility of a potential customer to some set of stores. In time geography, accessibility has also been defined as "person based" rather than "pla ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
National Oceanic And Atmospheric Administration
The National Oceanic and Atmospheric Administration (NOAA ) is an American scientific and regulatory agency charged with Weather forecasting, forecasting weather, monitoring oceanic and atmospheric conditions, Hydrography, charting the seas, conducting deep-sea exploration, and managing fishing and protection of marine mammals and endangered species in the US exclusive economic zone. The agency is part of the United States Department of Commerce and is headquartered in Silver Spring, Maryland. History NOAA traces its history back to multiple agencies, some of which are among the earliest in the federal government: * United States Coast and Geodetic Survey, formed in 1807 * National Weather Service, Weather Bureau of the United States, formed in 1870 * United States Fish Commission, Bureau of Commercial Fisheries, formed in 1871 (research fleet only) * NOAA Commissioned Corps, Coast and Geodetic Survey Corps, formed in 1917 The most direct predecessor of NOAA was the Enviro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
UNESCO
The United Nations Educational, Scientific and Cultural Organization (UNESCO ) is a List of specialized agencies of the United Nations, specialized agency of the United Nations (UN) with the aim of promoting world peace and International security, security through international cooperation in education, arts, sciences and culture. It has 194 Member states of UNESCO, member states and 12 associate members, as well as partners in the Non-governmental organization, non-governmental, Intergovernmental organization, intergovernmental and private sector. Headquartered in Paris, France, UNESCO has 53 regional field offices and 199 National Commissions for UNESCO, national commissions. UNESCO was founded in 1945 as the successor to the League of Nations' International Committee on Intellectual Cooperation.English summary). UNESCO's founding mission, which was shaped by the events of World War II, is to advance peace, sustainable development and human rights by facilitating collaboratio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Copernicus Publications
Copernicus Publications (also: Copernicus GmbH) is a publisher of scientific literature based in Göttingen, Germany. Founded in 1994, Copernicus Publications currently publishes 28 peer-reviewed open access scientific journals and other publications on behalf of the European Geosciences Union. Copernicus Publications is part of the open-access publishing movement. Initially, the CC BY-NC was used. In 2007, they switched to the CC BY attribution license. Copernicus Publications has been described as the largest open access publisher in the Geo- and Earth system sciences, and it is known as one of the first publishers to embrace public peer review. In 2014, one of their journals was terminated under allegations of nepotistic reviewing and malpractice; see '' Pattern Recognition in Physics#History'' for details. See also * :Copernicus Publications academic journals * Open Access Scholarly Publishers Association The Open Access Scholarly Publishing Association (OASPA) is a no ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Drainage Basin
A drainage basin is an area of land in which all flowing surface water converges to a single point, such as a river mouth, or flows into another body of water, such as a lake or ocean. A basin is separated from adjacent basins by a perimeter, the drainage divide, made up of a succession of elevated features, such as ridges and hills. A basin may consist of smaller basins that merge at river confluences, forming a hierarchical pattern. Other terms for a drainage basin are catchment area, catchment basin, drainage area, river basin, water basin, and impluvium. In North America, they are commonly called a watershed, though in other English-speaking places, " watershed" is used only in its original sense, that of the drainage divide line. A drainage basin's boundaries are determined by watershed delineation, a common task in environmental engineering and science. In a closed drainage basin, or endorheic basin, rather than flowing to the ocean, water converges toward the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Surface Runoff
Surface runoff (also known as overland flow or terrestrial runoff) is the unconfined flow of water over the ground surface, in contrast to ''channel runoff'' (or ''stream flow''). It occurs when excess rainwater, stormwater, meltwater, or other sources, can no longer sufficiently rapidly infiltrate in the soil. This can occur when the soil is #Saturation excess overland flow, saturated by water to its full capacity, and the rain arrives #Infiltration excess overland flow, more quickly than the soil can absorb it. Surface runoff often occurs because wikt:impervious#Adjective, impervious areas (such as roofs and Road surface, pavement) do not allow water to soak into the ground. Furthermore, runoff can occur either through natural or human-made processes. Surface runoff is a major component of the water cycle. It is the primary agent of Soil erosion#Rainfall and runoff, soil erosion by water. The land area producing runoff that drains to a common point is called a drainage basin. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Hull
In geometry, the convex hull, convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, or equivalently as the set of all convex combinations of points in the subset. For a Bounded set, bounded subset of the plane, the convex hull may be visualized as the shape enclosed by a rubber band stretched around the subset. Convex hulls of open sets are open, and convex hulls of compact sets are compact. Every compact convex set is the convex hull of its extreme points. The convex hull operator is an example of a closure operator, and every antimatroid can be represented by applying this closure operator to finite sets of points. The algorithmic problems of finding the convex hull of a finite set of points in the plane or other low-dimensional Euclidean spaces, and its projective duality, dual problem of intersecting Half-space (geome ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph (discrete Mathematics)
In discrete mathematics, particularly in graph theory, a graph is a structure consisting of a Set (mathematics), set of objects where some pairs of the objects are in some sense "related". The objects are represented by abstractions called ''Vertex (graph theory), vertices'' (also called ''nodes'' or ''points'') and each of the related pairs of vertices is called an ''edge'' (also called ''link'' or ''line''). Typically, a graph is depicted in diagrammatic form as a set of dots or circles for the vertices, joined by lines or curves for the edges. The edges may be directed or undirected. For example, if the vertices represent people at a party, and there is an edge between two people if they shake hands, then this graph is undirected because any person ''A'' can shake hands with a person ''B'' only if ''B'' also shakes hands with ''A''. In contrast, if an edge from a person ''A'' to a person ''B'' means that ''A'' owes money to ''B'', then this graph is directed, because owing mon ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Shortest-path Tree
In mathematics and computer science, a shortest-path tree rooted at a vertex ''v'' of a connected, undirected graph ''G'' is a spanning tree ''T'' of ''G'', such that the path distance from root ''v'' to any other vertex ''u'' in ''T'' is the shortest path distance from ''v'' to ''u'' in ''G''. In connected graphs where shortest paths are well-defined (i.e. where there are no negative-length cycles), we may construct a shortest-path tree using the following algorithm: # Compute dist(''u''), the shortest-path distance from root ''v'' to vertex ''u'' in ''G'' using Dijkstra's algorithm or Bellman–Ford algorithm. # For all non-root vertices ''u'', we can assign to ''u'' a parent vertex ''pu'' such that ''p''''u'' is connected to ''u'', and that dist(''p''''u'') + edge_dist(''p''''u'',''u'') = dist(''u''). In case multiple choices for ''pu'' exist, choose ''p''''u'' for which there exists a shortest path from ''v'' to ''p''''u'' with as few edges as possible; this tie-breaking rule ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
