Cloud properties and their seasonal and diurnal variability from TOVS path-B

Eight years of cloud properties retrieved from Television Infrared Observation Satellite-N (TIROS-N) Observational Vertical Sounder (TOVS) observations aboard the NOAA polar orbiting satellites are presented. The relatively high spectral resolution of these instruments in the infrared allows especially reliable cirrus identification day and night. This dataset therefore provides complementary information to the International Satellite Cloud Climatology Project (ISCCP). According to this dataset, cirrus clouds cover about 27% of the earth and 45% of the Tropics, whereas ISCCP reports 19% and 25%, respectively. Both global datasets agree within 5% on the amount of single-layer low clouds, at 30%. From 1987 to 1995, global cloud amounts remained stable to within 2%. The seasonal cycle of cloud amount is in general stronger than its diurnal cycle and it is stronger than the one of effective cloud amount, the latter the relevant variable for radiative transfer. Maximum effective low cloud amount over ocean occurs in winter in SH subtropics in the early morning hours and in NH midlatitudes without diurnal cycle. Over land in winter the maximum is in the early afternoon, accompanied in the midlatitudes by thin cirrus. Over tropical land and in the other regions in summer, the maximum of mesoscale high opaque clouds occurs in the evening. Cirrus also increases during the afternoon and persists during night and early morning. The maximum of thin cirrus is in the early afternoon, then decreases slowly while cirrus and high opaque clouds increase. TOVS extends information of ISCCP during night, indicating that high cloudiness, increasing during the afternoon, persists longer during night in the Tropics and subtropics than in midlatitudes. A comparison of seasonal and diurnal cycle of high cloud amount between South America, Africa, and Indonesia during boreal winter has shown strong similarities between the two land regions, whereas the Indonesian islands show a seasonal and diurnal behavior strongly influenced by the surrounding ocean. Deeper precipitation systems over Africa than over South America do not seem to be directly reflected in the horizontal coverage and mesoscale effective emissivity of high clouds.

Rovibrational energy levels of hydrogen peroxide, studied by MULTIMODE with a reaction path Hamiltonian

Recently. Carter and Handy [J. Chem. Phys. 113 (2000) 987] have introduced the theory of the reaction path Hamiltonian (RPH) [J. Chem. Phys. 72 (1980) 99] into the variational scheme MULTIMODE, for the calculation of the J = 0 vibrational levels of polyatomic molecules, which have a single large-amplitude motion. In this theory the reaction path coordinate s becomes the fourth dimension of the moment-of-inertia tensor, and must be treated separately from the remaining 3N - 7 normal coordinates in the MULTIMODE program. In the modified program, complete integration is performed over s, and the M-mode MULTIMODE coupling approximation for the evaluation of the matrix elements applies only to the 3N - 7 normal coordinates. In this paper the new algorithm is extended to the calculation of rotational-vibration energy levels (i.e. J > 0) with the RPH, following from our analogous implementation for rigid molecules [Theoret. Chem. Acc. 100 (1998) 191]. The full theory is given, and all extra terms have been included to give the exact kinetic energy operator. In order to validate the new code, we report studies on hydrogen peroxide (H2O2), where the reaction path is equivalent to torsional motion. H2O2 has previously been studied variationally using a valence coordinate Hamiltonian; complete agreement for calculated rovibrational levels is obtained between the previous results and those from the new code, using the identical potential surface. MULTIMODE is now able to calculate rovibrational levels for polyatomic molecules which have one large-amplitude motion. (C) 2003 Elsevier B.V. All rights reserved.

Judgments of path, not heading, guide locomotion

To steer a course through the world, people are almost entirely dependent on visual information, of which a key component is optic flow. In many models of locomotion, heading is described as the fundamental control variable; however, it has also been shown that fixating points along or near one's future path could be the basis of an efficient control solution. Here, the authors aim to establish how well observers can pinpoint instantaneous heading and path, by measuring their accuracy when looking at these features while traveling along straight and curved paths. The results showed that observers could identify both heading and path accurately (similar to 3 degrees) when traveling along straight paths, but on curved paths they were more accurate at identifying a point on their future path (similar to 5 degrees) than indicating their instantaneous heading (similar to 13 degrees). Furthermore, whereas participants could track changes in the tightness of their path, they were unable to accurately track the rate of change of heading. In light of these results, the authors suggest it is unlikely that heading is primarily used by the visual system to support active steering.

Verification and FPGA circuits of a block-2 fast path-based predictor

This paper formally derives a new path-based neural branch prediction algorithm (FPP) into blocks of size two for a lower hardware solution while maintaining similar input-output characteristic to the algorithm. The blocked solution, here referred to as B2P algorithm, is obtained using graph theory and retiming methods. Verification approaches were exercised to show that prediction performances obtained from the FPP and B2P algorithms differ within one mis-prediction per thousand instructions using a known framework for branch prediction evaluation. For a chosen FPGA device, circuits generated from the B2P algorithm showed average area savings of over 25% against circuits for the FPP algorithm with similar time performances thus making the proposed blocked predictor superior from a practical viewpoint.

FPGA organization for the fast path-based neural branch predictor

This paper develops cycle-level FPGA circuits of an organization for a fast path-based neural branch predictor Our results suggest that practical sizes of prediction tables are limited to around 32 KB to 64 KB in current FPGA technology due mainly to FPGA area of logic resources to maintain the tables. However the predictor scales well in terms of prediction speed. Table sizes alone should not be used as the only metric for hardware budget when comparing neural-based predictor to predictors of totally different organizations. This paper also gives early evidence to shift the attention on to the recovery from mis-prediction latency rather than on prediction latency as the most critical factor impacting accuracy of predictions for this class of branch predictors.

A relative path attenuation approximation algorithm for DVB-T systems

In the United Kingdom and in fact throughout Europe, the chosen standard for digital terrestrial television is the European Telecommunications Standards Institute (ETSI) ETN 300 744 also known as Digital Video Broadcasting - Terrestrial (DVB-T). The modulation method under this standard was chosen to be Orthogonal Frequency Division Multiplex (0FD4 because of the apparent inherent capability for withstanding the effects of multipath. Within the DVB-T standard, the addition of pilot tones was included that can be used for many applications such as channel impulse response estimation or local oscillator phase and frequency offset estimation. This paper demonstrates a technique for an estimation of the relative path attenuation of a single multipath signal that can be used as a simple firmware update for a commercial set-top box. This technique can be used to help eliminate the effects of multipath(1).

Full interference cancellation for two-path cooperative communications

This paper proposes a full interference cancellation (FIC) approach for two-path cooperative communications. Unlike the single relay schemes, the two-path cooperative scheme involves two relay nodes, so that the source can continuously transmit data to the two relays alternatively and the full bandwidth efficiency with respect to the direct transmission can be retained. The two-path relay scheme may however suffer from inter-relay interference which is caused by the simultaneous transmission of the source and one of the relays at any time. In this paper, first the inter-relay interference is expressed as a single recursive term in the received signal, and then the FIC approach is proposed to fully remove the inter-relay interference. The FIC has not only better performance but also less complexity than existing approaches. Numerical examples are also given to verify the proposed approach.

3D path planning with novel multiple 2D layered approach for complex human-robot interaction

Navigating cluttered indoor environments is a difficult problem in indoor service robotics. The Acroboter concept, a novel approach to indoor locomotion, represents unique opportunity to avoid obstacles in indoor environments by navigating the ceiling plane. This mode of locomotion requires the ability to accurately detect obstacles, and plan 3D trajectories through the environment. This paper presents the development of a resilient object tracking system, as well as a novel approach to generating 3D paths suitable for such robot configurations. Distributed human-machine interfacing allowing simulation previewing of actions is also considered in the developed system architecture.

An oblivious shortest-path routing algorithm for fully connected cubic networks

Fully connected cubic networks (FCCNs) are a class of newly proposed hierarchical interconnection networks for multicomputer systems, which enjoy the strengths of constant node degree and good expandability. The shortest path routing in FCCNs is an open problem. In this paper, we present an oblivious routing algorithm for n-level FCCN with N = 8(n) nodes, and prove that this algorithm creates a shortest path from the source to the destination. At the costs of both an O(N)-parallel-step off-line preprocessing phase and a list of size N stored at each node, the proposed algorithm is carried out at each related node in O(n) time. In some cases the proposed algorithm is superior to the one proposed by Chang and Wang in terms of the length of the routing path. This justifies the utility of our routing strategy. (C) 2006 Elsevier Inc. All rights reserved.

Full interference cancellation for two-path relay cooperative networks

This paper proposes the full interference cancellation (FIC) algorithm to cancel the inter-relay interference (IRI) in the two-path cooperative system. Arising from simultaneous data transmission from the source and relay nodes, IRI may significantly decrease the performance if it is not carefully handled. Compared to the existing partial interference cancellation (PIC) scheme, the FIC approach is more robust yet with less complexity. Numerical results are also given to verify the proposed scheme.