نتایج جستجو برای: computer terminals
تعداد نتایج: 594251 فیلتر نتایج به سال:
Given a capacitated graph G = (V, E) and a set of terminals K ⊆ V , how should we produce a graph H only on the terminals K so that every (multicommodity) flow between the terminals in G could be supported in H with low congestion, and vice versa? (Such a graph H is called a flow-sparsifier for G.) What if we want H to be a “simple” graph? What if we allow H to be a convex combination of simple...
Introduction: Wastewaters resulting from seasonal processing such as pistachio processing industry are one of the most important factors of environmental pollution. High concentration of pollutants are the qualitative characteristics of wastewaters that due high consumption of water and energy resources as well as high levels production of waste have a good potential to realization of projects ...
Communication media terminals, such as PDAs, cell phones, and mobile PCs, are devices that are used globally and are a part of our daily lives. Most people have access to such media terminals. Various interactive agents, such as robotic agents (for example, Gravot et al., 2006; Imai et al., 2003) and embodied conversational agents (ECA) appearing on a computer display (for example, Cassell et a...
Given a capacitated graph G = (V,E) and a set of terminals K ⊆ V , how should we produce a graph H only on the terminals K so that every (multicommodity) flow between the terminals in G could be supported in H with low congestion, and vice versa? (Such a graph H is called a flowsparsifier for G.) What if we want H to be a “simple” graph? What if we allow H to be a convex combination of simple g...
In applications such as design of integrated circuits (chips), it is sometimes required to connect the terminals (receivers) and the central vertex (source) by a weight-minimal tree where the signal delays between the source and the terminals are the same or differ by a minimal value. Simple necessary conditions for existence of the desired tree, heuristic rules for displacement of the terminal...
The synaptic relationships formed by medial lemniscal (ML) or spinothalamic tract (STT) axon terminals with neurons of the somatosensory ventroposterolateral thalamic nucleus of the macaque monkey have been examined quantitatively by electron microscopy. ML and STT axons were labeled by the anterograde axon transport of WGA-HRP following injection of the tracer into the contralateral dorsal col...
puters using toggle switches, punched cards, and punched paper tape. In the 1970s, the common control mechanism was the keyboard on teletypes and on video terminals. In the 1980s, with the advent of graphical user interfaces, people found that a new mode of interaction with the computer was useful. The concept of a pointer—the mouse—evolved. Its popularity grew such that the mouse is now a stan...
The first computers were very expensive and large in size. Therefore the only economic way to use them was remote computing: connect to the central computer by a light terminal. With the development of Integrated Circuits the components started to be cheaper and smaller, therefore the terminals started to support computing. Their processing power is currently enough for many applications, howev...
Previous immunocytochemical results from five monkeys with cortical focal epilepsy produced by alumina gel showed a severe decrease at seizure foci of axon terminals that contained glutamic acid decarboxylase (GAD), the synthesizing enzyme for the inhibitory neurotrasmitter, GABA. These data indicated a functional loss of GABAergic terminals but did not show: (1) whether this loss was caused by...
Given a capacitated undirected graph G = (V,E) with a set of terminals K ⊂ V , a mimicking network is a smaller graph H = (VH , EH) that exactly preserves all the minimum cuts between the terminals. Specifically, the vertex set of the sparsifier VH contains the set of terminals K and for every bipartition U,K − U of the terminals K, the size of the minimum cut separating U from K − U in G is ex...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید