Network scienceNetwork science is an academic field which studies complex networks such as telecommunication networks, computer networks, biological networks, cognitive and semantic networks, and social networks, considering distinct elements or actors represented by nodes (or vertices) and the connections between the elements or actors as links (or edges). The field draws on theories and methods including graph theory from mathematics, statistical mechanics from physics, data mining and information visualization from computer science, inferential modeling from statistics, and social structure from sociology.
Dual graphIn the mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each pair of faces in G that are separated from each other by an edge, and a self-loop when the same face appears on both sides of an edge. Thus, each edge e of G has a corresponding dual edge, whose endpoints are the dual vertices corresponding to the faces on either side of e.
Extended precisionExtended precision refers to floating-point number formats that provide greater precision than the basic floating-point formats. Extended precision formats support a basic format by minimizing roundoff and overflow errors in intermediate values of expressions on the base format. In contrast to extended precision, arbitrary-precision arithmetic refers to implementations of much larger numeric types (with a storage count that usually is not a power of two) using special software (or, rarely, hardware).
Graph drawingGraph drawing is an area of mathematics and computer science combining methods from geometric graph theory and information visualization to derive two-dimensional depictions of graphs arising from applications such as social network analysis, cartography, linguistics, and bioinformatics. A drawing of a graph or network diagram is a pictorial representation of the vertices and edges of a graph. This drawing should not be confused with the graph itself: very different layouts can correspond to the same graph.
Traffic calmingTraffic calming uses physical design and other measures to improve safety for motorists, pedestrians and cyclists. It has become a tool to combat speeding and other unsafe behaviours of drivers in the neighbourhoods. It aims to encourage safer, more responsible driving and potentially reduce traffic flow. Urban planners and traffic engineers have many strategies for traffic calming, including narrowed roads and speed humps. Such measures are common in Australia and Europe (especially Northern Europe), but less so in North America.
Distributed computingA distributed system is a system whose components are located on different networked computers, which communicate and coordinate their actions by passing messages to one another. Distributed computing is a field of computer science that studies distributed systems. The components of a distributed system interact with one another in order to achieve a common goal. Three significant challenges of distributed systems are: maintaining concurrency of components, overcoming the lack of a global clock, and managing the independent failure of components.
Dalian Commodity ExchangeThe Dalian Commodity Exchange (DCE) () is a Chinese futures exchange based in Dalian, Liaoning province, China. It is a non-profit, self-regulating and membership legal entity established on February 28, 1993. Dalian Commodity Exchange trades in futures contracts underlined by a variety of agricultural and industrial produce on a national scale. As of 2015, DCE has listed a total of 16 futures products, including corn, corn starch, soybean (gmo and non-gmo), soybean meal, soybean oil, RBD palm olein, egg, fiberboard, blockboard, linear low-density polyethylene (LLDPE), polyvinyl chloride (PVC), polypropylene (PP), coke, coking coal and iron ore.
Computational complexityIn computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory.
Beowulf clusterA Beowulf cluster is a computer cluster of what are normally identical, commodity-grade computers networked into a small local area network with libraries and programs installed which allow processing to be shared among them. The result is a high-performance parallel computing cluster from inexpensive personal computer hardware. The name Beowulf originally referred to a specific computer built in 1994 by Thomas Sterling and Donald Becker at NASA. The name "Beowulf" comes from the Old English epic poem of the same name.
Cycling infrastructureCycling infrastructure is all infrastructure cyclists are allowed to use. Bikeways include bike paths, bike lanes, cycle tracks, rail trails and, where permitted, sidewalks. Roads used by motorists are also cycling infrastructure, except where cyclists are barred such as many freeways/motorways. It includes amenities such as bike racks for parking, shelters, service centers and specialized traffic signs and signals. The more cycling infrastructure, the more people get about by bicycle.
