Sharing ideas of the path taken : accomplishments of the 1990 RPA Program.

"FS 562."

Operator's, organizational, DS, GS, and depot maintenance manual including repair parts and special tools lists : visual approach path indicator MX-7301/TVN.

Includes index.

The path of empire

Mode of access: Internet.

Cows on Path

Saline Valley Farms was an experiment in cooperative farming and living begun in 1932 by Harold S. Gray.

Choosing organics: A path analysis of factors underlying the selection of organic food among Australian consumers

Path analysis of attitudinal, motivational, demographic and behavioural factors influencing food choice among Australian consumers who had consumed at least some organic food in the preceding 12 months showed that concern with the naturalness of food and the sensory and emotional experience of eating were the major determinants of increasing levels of organic consumption. Increasing consumption was also related to other 'green consumption' behaviours such as recycling and to lower levels of concern with convenience in the purchase and preparation of food. Most of these factors were, in turn, strongly affected by gender and the level of responsibility taken by respondents for food provisioning within their households, a responsibility dominated by women. Education had a slightly negative effect on the levels of concern for sensory and emotional appeal due to lower levels of education among women. Income, age, political and ecological values and willingness to pay a premium for safe and environmentally friendly foods all had extremely minor effects. (C) 2004 Elsevier Ltd. All rights reserved.

Blocking the path from vagueness to four dimensionalism

There is a general form of an argument which I call the 'argument from vagueness' which attempts to show that objects persist by perduring, via the claim that vagueness is never ontological in nature and thus that composition is unrestricted. I argue that even if we grant that vagueness is always the result of semantic indeterminacy rather than ontological vagueness, and thus also grant that composition is unrestricted, it does not follow that objects persist by perduring. Unrestricted mereological composition lacks the power to ensure that there exist instantaneous objects that wholly overlap persisting objects at times, and thus lacks the power to ensure that there exists anything that could be called a temporal part. Even if we grant that such instantaneous objects exist, however, I argue that it does not follow that objects perdure. To show this I briefly outline a coherent version of three dimensionalism that grants just such an assumption. Thus considerations pertaining to the nature of vagueness need not lead us inevitably to accept perdurantism.

Expansion-based algorithms for finding single pair shortest path on surface

Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path planning system, and surface nearest neighbor query in spatial database, etc. Currently, to solve the problem, existing algorithms must traverse the entire polyhedral surface. With the rapid advance in areas like Global Positioning System (CPS), Computer Aided Design (CAD) systems and laser range scanner, surface models axe becoming more and more complex. It is not uncommon that a surface model contains millions of polygons. The single pair shortest path problem is getting harder and harder to solve. Based on the observation that the single pair shortest path is in the locality, we propose in this paper efficient methods by excluding part of the surface model without considering them in the search process. Three novel expansion-based algorithms are proposed, namely, Naive algorithm, Rectangle-based Algorithm and Ellipse-based Algorithm. Each algorithm uses a two-step approach to find the shortest path. (1) compute an initial local path. (2) use the value of this initial path to select a search region, in which the global shortest path exists. The search process terminates once the global optimum criteria are satisfied. By reducing the searching region, the performance is improved dramatically in most cases.