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.

Demonstrating the effects of multi-path propagation and advantages of diversity antenna techniques

In this paper, experimental investigations are performed into assessing the quality of communication link between Bluetooth devices in an indoor environment, as an initial step of demonstrating benefits of diversity and smart antenna techniques in mobile computing.

Meeting the challenge on the path to democracy: discursive strategies in governmental declarations

The communicative practice in the ex-GDR was complex and diverse, although public political discourse had been fairly ritualized. Text-types characteristic of the Communist Party discourse were full of general (superordinate) terms semantic specification was hardly possible (propositional reduction). Changes in the social world result in changes in the communicative practice as well. However, a systematic comparision of text-types across cultures and across ideological boundaries reveals both differences in the textual macro- and superstructures and overlapping as well as universal features, probably related to functional aspects (discourse of power). Six sample texts of the text-type `government declaration', two produced in the ex-GDR, four in the united Germany, are analysed. Special attention is paid to similarities and differences (i) in the textual superstructure (problem-solution schema), (ii) in the concepts that reflect the aims of political actions (simple worlds), (iii) in the agents who (are to) perform these actions (concrete vs abstract agents). Similarities are found mainly in the discursive strategies, e.g. legitimization text actions. Differences become obvious in the strategies used for legitimization, and also in the conceptual domains referred to by the problem-solution schema. The metaphors of construction, path and challenge are of particular interest in this respect.

A path-dependent contingent-claims approach to capacity investments

This note presents a contingent-claims approach to strategic capacity planning. We develop models for capacity choice and expansion decisions in a single firm environment where investment is irreversible and demand is uncertain. These models illustrate specifically the relevance of path-dependent options analysis to planning capacity investments when the firm adopts demand tracking or average capacity strategies. It is argued that Asian/average type real options can explain hysteresis phenomena in addition to providing superior control of assets in place.

The Internet's unexploited path diversity

The connectivity of the Internet at the Autonomous System level is influenced by the network operator policies implemented. These in turn impose a direction to the announcement of address advertisements and, consequently, to the paths that can be used to reach back such destinations. We propose to use directed graphs to properly represent how destinations propagate through the Internet and the number of arc-disjoint paths to quantify this network's path diversity. Moreover, in order to understand the effects that policies have on the connectivity of the Internet, numerical analyses of the resulting directed graphs were conducted. Results demonstrate that, even after policies have been applied, there is still path diversity which the Border Gateway Protocol cannot currently exploit.

Interferometric optical path difference measurement using sinusoidal frequency modulation of a diode laser

We describe a technique applicable to interferometric systems illuminated by a laser diode, whereby the optical path difference is recovered by means of sinusoidal modulation of the laser emission frequency.

Clustering algorithm based on minimal path loss ratio for vehicular communication

Emerging vehicular comfort applications pose a host of completely new set of requirements such as maintaining end-to-end connectivity, packet routing, and reliable communication for internet access while on the move. One of the biggest challenges is to provide good quality of service (QoS) such as low packet delay while coping with the fast topological changes. In this paper, we propose a clustering algorithm based on minimal path loss ratio (MPLR) which should help in spectrum efficiency and reduce data congestion in the network. The vehicular nodes which experience minimal path loss are selected as the cluster heads. The performance of the MPLR clustering algorithm is calculated by rate of change of cluster heads, average number of clusters and average cluster size. Vehicular traffic models derived from the Traffic Wales data are fed as input to the motorway simulator. A mathematical analysis for the rate of change of cluster head is derived which validates the MPLR algorithm and is compared with the simulated results. The mathematical and simulated results are in good agreement indicating the stability of the algorithm and the accuracy of the simulator. The MPLR system is also compared with V2R system with MPLR system performing better. © 2013 IEEE.

Clustering algorithm based on minimal path loss ratio for vehicular communication

Emerging vehicular comfort applications pose a host of completely new set of requirements such as maintaining end-to-end connectivity, packet routing, and reliable communication for internet access while on the move. One of the biggest challenges is to provide good quality of service (QoS) such as low packet delay while coping with the fast topological changes. In this paper, we propose a clustering algorithm based on minimal path loss ratio (MPLR) which should help in spectrum efficiency and reduce data congestion in the network. The vehicular nodes which experience minimal path loss are selected as the cluster heads. The performance of the MPLR clustering algorithm is calculated by rate of change of cluster heads, average number of clusters and average cluster size. Vehicular traffic models derived from the Traffic Wales data are fed as input to the motorway simulator. A mathematical analysis for the rate of change of cluster head is derived which validates the MPLR algorithm and is compared with the simulated results. The mathematical and simulated results are in good agreement indicating the stability of the algorithm and the accuracy of the simulator. The MPLR system is also compared with V2R system with MPLR system performing better. © 2013 IEEE.