
	Where results make sense

Topic: Path (computing)

Related Topics

Left Hand Path

The Noble Eightfold Path

critical path

Eulerian path

path integral

path connected

Path Records

Hamiltonian path

Kittanning Path

South West Coast Path

Path graph theory

In the News (Fri 1 Jan 10)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Path - Wikipedia, the free encyclopedia
		Path in hiking, often synonymous with a trail, although trail generally implies longer distances, unsurfaced ground, and natural terrain, whereas a path, particularly in an urban setting, can be much shorter, have a paved surface, and meander through landscaped areas.
		Path (graph theory), a sequence of vertices of a graph.
		Path (computing), in computer file systems, the general form of a complete file or directory name.
	en.wikipedia.org /wiki/Path (208 words)

	ACM Computing Surveys : Geometric Path Planning
		Computing shortest paths is one of the most fundamental topics in computational geometry.
		For computing shortest paths in the 3-D space with polyhedral obstacles, Canny and Reif [Canny 1987] showed that the problem is NP-hard, and several efficient approximation algorithms have been discovered (e.g., [Choi 1994]).
		For instance, many path algorithms extensively exploit the structures of specific geometric environments (e.g., obstacles are polygons on a perfectly ``flat'' land, obstacles are stationary and are of fixed shapes, etc), and hence their efficiency hinges heavily on certain properties of these (probably simplified) environments.
	www.cs.brown.edu /people/rt/sdcr/chen/chen.html (1760 words)

	United States Patent Application: 0040218583
		The computing device places a telephone call by communicating a telephone number to the CTIA using the data communication protocol, causing the CTIA to convert the telephone number into a sequence of DTMF signals that are communicated to the telephone network according to the telephone network protocol.
		However, because computer line terminals 156a and 156b are connected to both SLIC chip 114 and balance circuit 120a, the telephone can be used to communicate with the telephone network and the computing device at the same time.
		The computing device will then instruct the CTIA to switch the telephone state switch so that the telephone is coupled to the computing device and also route the audio data of the VOIP call from the headset connected to the computing device over to the USB port that is coupled to the CTIA.
	appft1.uspto.gov /netacgi/nph-Parser?Sect1=PTO1&Sect2=HITOFF&d=PG01&p=1&u=/netahtml/PTO/srchnum.html&r=1&f=G&l=50&s1="20040218583".PGNR.&OS=DN/20040218583&RS=DN/20040218583 (11167 words)

	United States Patent Application: 0040153496
		The method includes computing a tentative backup path through the data transport network, the tentative backup path including a plurality of segments, and ascertaining for one or more segments if the segment is shared by working paths having a common potential point of failure.
		Note that a backup path with a shared segment is different from a backup path solution in which the backup path is shared in its entirety by other working paths originating and terminating on the same end nodes.
		As indicated earlier, the tentative backup path is computed such that it does not share any SRs of the working path D-20-B-22-E by any of a number of different algorithms available in the literature, such as a Dikjstra type computation algorithm over colored graphs.
	appft1.uspto.gov /netacgi/nph-Parser?Sect1=PTO1&Sect2=HITOFF&d=PG01&p=1&u=/netahtml/PTO/srchnum.html&r=1&f=G&l=50&s1="20040153496".PGNR.&OS=DN/20040153496&RS=DN/20040153496 (2876 words)

	[No title] (Site not responding. Last check: 2007-10-13)
		When the visibility of an end to end complete path spanning multiple domains is not available at the head end node, one approach described in the document consists of using a per-domain path computation scheme used during LSP setup to determine the inter-domain LSP path as it traverses multiple domains.
		Per-domain path computation algorithm Regardless of the nature of the inter-domain TE LSP (contiguous, stitched or nested), a similar set of mechanisms for local TE LSP path computation (next hop resolution) can be used.
		Path optimality/diversity Since the inter-domain path is computed on a per domain (area, AS) basis, one cannot guarantee that the shortest inter-domain path can be found.
	www.faqs.org /ftp/internet-drafts/draft-vasseur-ccamp-inter-domain-pd-path-comp-00.txt (5934 words)

	Method for Computing Microwave Path Characteristics (Site not responding. Last check: 2007-10-13)
		Microwave path characteristics are determined by numerous factors including: the free space attenuation between antennae, antenna gain, losses in the cables connecting the radio equipment to the antenna, the radio equipment itself and the topology of the terrain between the antennae.
		In computing a path's characteristics all of the factors are relatively straightforward except that of the terrain's topology which must take into account the heights of land masses, trees and buildings at various points along the path.
		The most common computer systems currently available in communications sales engineering facilities where this application is used are PCs using the DOS operating system (they are not presently used to do long path calculations as a result of time limitations).
	www.cosc.brocku.ca /Offerings/4F90/info/mwave.htm (368 words)

	TechOnLine - A Bright Path Beckons for Embedded Computing, But Watch the Potholes (Site not responding. Last check: 2007-10-13)
		Embedded computing has long been the starving orphan of the processor wars, which had semiconductor vendors focused first on the workstation then the personal computing markets.
		These applications include wearable computers such as wristwatch sized PDAs, networked homes in which every wall outlet, light switch, and appliance can be controlled over the Internet, and wireless communications between all of your information devices so that they automatically connect into a network no matter where you go.
		If embedded computing is to truly take the starring role in electronics development in the coming years, software development needs to rise to the occasion.
	www.techonline.com /community/related_content/3941 (885 words)

	Computer Access and Usage Policy
		PATH at the Univeristy of California Berkeley operates and maintains a collection of servers, workstations, microcomputers, and associated peripherals in order to promote its instructional, research, and administrative efforts.
		Because the goals of PATH are primarily educational in nature, computer systems are generally open to perusal and investigation by users, and security controls may be less restrictive than they would be in other environments.
		PATH facilities may not be used for any activity that is commercial in nature without first obtaining written permission to do so.
	www.path.berkeley.edu /systemsupport/usagepolicy.htm (1397 words)

	THE PATH TO THE 150
		It was the emergence of the federal High Performance Computing and Communications (HPCC) Initiative that opened the path to the 150, and a successful proposal from Oak Ridge National Laboratory (ORNL) to the Department of Energy (DOE) Office of Scientific Computing (OSC) that comprised the first step onto this path.
		However, the technical path along which the CCS moved initially to reach "today," with its Intel Paragon XP/S 150 centerpiece, had a very different origination - the first machine was a 32 processor Kendall Square KSR1, delivered in September of 1991, prior to the existence of the CCS.
		At this point, Intel modified the structure of its forefront Paragon nodes to the MP form, three processors per node, two for computing and one for message passing; this was to be the architecture of the XP/S 150.
	www.ccs.ornl.gov /history/Path2Dday.html (1169 words)

	4.5 Computing a reaction path.
		We are using the CASSCF method to compute the geometry of the transition state as well as the Hessian.
		Decrease the theshold for redundant coords 27 6 19
		As was explained when we selected the active space for the geometry optimizations, we performed several tests at different stages in the reaction path and observed that the smallest meaningful active space, two electrons in two orbitals, was sufficient in all the cases.
	vergil.chemistry.gatech.edu /manuals/molcas5/tutorials/node41.html (4959 words)

	DNA Computing
		His DNA computing experiment is known as the “start of a new era”, forging an unprecedented link between computational science and life science.
		All computers in existence today make use of binary code -1’s and 0’s, or on’s and off’s on the circuits of a computer chip, forming the basis for every calculation a computer performs, from simple addition to the most complex differential equations.
		Adleman used DNA to solve a system of six vertices, which is not difficult for modern computers, but as the number of cities grows, so does the number of paths between them, making a 1,000 city path impossible to solve for even the best supercomputers.
	www.casi.net /D.BioInformatics1/D.Fall2000ClassPage/DC1/dc.htm (2738 words)

	Bang path - Computing Reference - eLook.org
		directs people to route their mail to computer bigsite (presumably a well-known location accessible to everybody) and from there through the computer foovax to the account of user me on barbox.
		convention (see glob) to give paths from several big computers, in the hope that one's correspondent might be able to get mail to one of them reliably.
		Bang paths of 8 to 10 hops were not uncommon in 1981.
	www.elook.org /computing/bang-path.htm (151 words)

	Ubiquitous Computing
		The initial incarnation of ubiquitous computing was in the form of "tabs", "pads", and "boards" built at Xerox PARC, 1988-1994.
		Ubicomp helped kick off the recent boom in mobile computing research, although it is not the same thing as mobile computing, nor a superset nor a subset.
		It is invisible, everywhere computing that does not live on a personal device of any sort, but is in the woodwork everywhere.
	www.ubiq.com /hypertext/weiser/UbiHome.html (794 words)

	Shortest paths and topological ordering
		Rather than computing one distance d(s,t), we'll compute d(s,x) for all vertices x.
		That there are two kinds of shortest paths: those formed by a single edge (s,t), and those in which the path from s to t goes through some other vertices; let's say x is the last vertex the path goes through before t.
		Then in the second case, the overall path must be formed by concatenating a path from s to x with edge (x,t).
	www.ics.uci.edu /~eppstein/161/960208.html (1605 words)

	BOOT.INI and ARC Path Naming Conventions and Usage
		The path to each Windows NT installation is described in a single line in the BOOT.INI file for x86-based computers, however, on RISC-based computers a set of four lines is used in the computer firmware BOOT- options to point to a single Windows NT installation.
		For the purpose of explaining this example, the partitions are numbered from 1 through 7, with partition 1 and 2 identifying disks one and two on the primary channel of the EIDE controller, partition 3 on the secondary channel, and partitions 4, 5, 6, and 7 on the SCSI drive.
		When creating a new boot entry for a RISC computer the firmware steps you through a series of prompts which aids you in defining the paths correctly; so unless you are editing a boot entry that is not working any more, you should never have to directly edit the ARC paths on a RISC computer.
	support.microsoft.com /?id=102873 (1709 words)

	CTOW 4-4-2003 (Site not responding. Last check: 2007-10-13)
		One method is to insert the path and filename into a cell of the worksheet using a simple Excel function.
		The second is to insert the path and file name into the header or footer of the spreadsheet.
		Computing Tips of the Week are archived at http://www.uwc.edu/training/ctow.
	www.uwc.edu /training/ctow/CTOW4_4_03.htm (637 words)

	Network Computing \| Online Only Column \| Resisting The Path Of Least Resistance \| Full Article \| April 16, 2001 (Site not responding. Last check: 2007-10-13)
		But in my "private life" as a systems architect and a consumer of computing technology, I find that politics have inescapably entered my world, and I'm not happy about it.
		I want real competition in the marketplace, because that's the only way we're going to have true innovation and to avoid the stagnation of a world where the only choice is whatever a single source (or its captive partners) wants to give us.
		I find I'm inclined to resist the path of least resistance because I think I can see where it leads, and it's not a good place for the industry or for me personally.
	www.networkcomputing.com /columnists/1208colhoffman.html (3234 words)

	distributed
		If a problem is split across several processors, either on the same computer, or on different machines distributed over a network, which communicate either via message passing or through a shared memory mechanism, it can be solved in much less time than by performing the computation on a single processor.
		A Hamiltonian path exists in a graph only if there is a connected path from a designated starting node to a designated output node that visits each node of the graph exactly once.
		The computational complexity for each time unit is dominated by step 2 of the algorithm, which requires n compares, where n is the number of nodes in the graph.
	www.isi.edu /~lerman/etc/distributed.html (1740 words)

	HP researchers propose new path to optical quantum computing
		Researchers from HP Laboratories in Bristol, UK, have proposed an approach to distributed optical quantum computing with a technique that is highly efficient, flexible and scalable.
		Optical quantum computing — using photons instead of electrons for computation — is one possible approach to quantum computing.
		Dr Spiller points out that light can be used for both quantum computing and quantum communication at the same time, which would not be the case with a solid-state system, where “static” quantum information would have to be mapped onto light to communicate it.
	www.physorg.com /news4924.html (875 words)

	Hierarchical Routing Algorithms (Site not responding. Last check: 2007-10-13)
		The result is shown graphically on a map as well as textually in terms of direction in a separate window.
		The routing algorithm routes around the incident to suggest the blue path as the new smallest travel time path.
		The old optimal path prior to the incident is shown in red for comparison.
	www.cs.umn.edu /research/shashi-group/slide/routing.html (319 words)

	Islamset - Computing with DNA: Rediscovering Biology ,Hamiltonian Path Problem, Seven Days in a Lab, A New Field ... (Site not responding. Last check: 2007-10-13)
		In the computation, this path is represented by GCAGTCG-GACTGGGCTATGTCCGA, a DNA sequence of length 24.
		An electronic computer stores information as sequences of zeros and C ones in memory and manipulates that to information with the operations available on the processor chip.
		Your job (the Hamiltonian Path Problem) is to determine if a sequence of connecting flights (a path) exists that starts in Atlanta (the start vertex) and ends in Detroit (the end vertex), while passing through each of the remaining cities (Boston and Chicago) exactly once.
	www.islamset.com /healnews/dna/dna.html (4075 words)

	The bumpy path to PetaFlop/s scale computing (Site not responding. Last check: 2007-10-13)
		They are based on a 16M atom simulation on 32K nodes and are close to the perfect scaling which is expected for the full machine, explained the speakers.
		This is a high order hydrodynamics code for computing fluid instabilities and a turbulent mix.
		BlueGene/L is the fastest computer in the world, at only a half of the size of its eventual configuration at LLNL this summer, the speakers proudly stated.
	www.hoise.com /primeur/05/articles/live/LV-PL-06-05-7.html (1508 words)

	AMD takes its own path toward 64-bit computing - Computerworld (Site not responding. Last check: 2007-10-13)
		In preparation for the rapidly approaching dawn of 64-bit computing, Advanced Micro Devices Inc. (AMD) today detailed the heart of its strategy: a processor code named Sledgehammer that company officials said will be able to run both 32-bit and 64-bit applications.
		Rival Intel Corp. released the specifications for its upcoming Itanium 64-bit processor via the Internet in May. However, Intel designed Itanium as a dedicated 64-bit device and is leaving advances in 32-bit computing to next-generation versions of its Pentium processor.
		Initially, the primary use of 64-bit computing is expected to be in running large enterprise-level applications that require more than 4GB of memory -- applications most commonly found in large databases.
	www.computerworld.com /printthis/2000/0,4814,48412,00.html (612 words)

	What is OSPF? - A Word Definition From the Webopedia Computer Dictionary
		Short for Open Shortest Path First, an interior gateway routing protocol developed for IP networks based on the shortest path first or link-state algorithm.
		The advantage of shortest path first algorithms is that they results in smaller more frequent updates everywhere.
		The disadvantage of shortest path first algorithms is that they require a lot of CPU power and memory.
	www.webopedia.com /TERM/O/OSPF.html (300 words)

	Computing the Shortest Path: A* Search Meets Graph Theory
		We study the problem of finding a shortest path between two vertices in a directed graph.
		This is an important problem with many applications, including that of computing driving irections.
		We also develop new bidirectional variants of A* search and investigate several variants of the new algorithms to find those that are most efficient in practice.
	research.microsoft.com /research/pubs/view.aspx?tr_id=727 (172 words)

	Home Office Computing: The Path of Lease Resistance - Industry Trend or Event
		"I didn't purchase [the computer], because it's really not advantageous to do that [from a tax standpoint]" says Breland, who makes payments of about $140 monthly and plans to buy the portable at fair-market value when his three-year lease ends.
		Computers, which get faster and cheaper than their predecessors in six months or so, are less useful after just two or three years.
		For such short terms, Dacey says, an operating lease may not be a self-employed worker's best bet compared to paying cash, or financing and depreciating a purchase.
	www.findarticles.com /p/articles/mi_m1563/is_1_19/ai_69067016 (1254 words)

	HPC Computing Environments (Site not responding. Last check: 2007-10-13)
		Before anyone can access a high performance computing system at OSC, they must have a valid account for the given system.
		All high performance computing systems at OSC run a flavor of UNIX.
		If you hard-code your PATH, it will break the modules software which all of the OSC systems use to make software packages available, and as a result you may not be able to compile or submit batch jobs.
	www.osc.edu /hpc/computing/gen-perf.shtml (652 words)

Try your search on: Qwika (all wikis)