The discrete Pascal transform and its applications

We introduce a new discrete polynomial transform constructed from the rows of Pascal’s triangle. The forward and inverse transforms are computed the same way in both the oneand two-dimensional cases, and the transform matrix can be factored into binary matrices for efficient hardware implementation. We conclude by discussing applications of the transform in

Closed Time-like Curves and Inertial Frame Dragging: How to Time Travel via Spacetime Rotation

As the number of solutions to the Einstein equations with realistic matter sources that admit closed time-like curves (CTC's) has grown drastically, it has provoked some authors [10] to call for a physical interpretation of these seemingly exotic curves that could possibly allow for causality violations. A first step in drafting a physical interpretation would be to understand how CTC's are created because the recent work of [16] has suggested that, to follow a CTC, observers must counter-rotate with the rotating matter, contrary to the currently accepted explanation that it is due to inertial frame dragging that CTC's are created. The exact link between inertialframe dragging and CTC's is investigated by simulating particle geodesics and the precession of gyroscopes along CTC's and backward in time oriented circular orbits in the van Stockum metric, known to have CTC's that could be traversal, so the van Stockum cylinder could be exploited as a time machine. This study of gyroscopeprecession, in the van Stockum metric, supports the theory that CTC's are produced by inertial frame dragging due to rotating spacetime metrics.

Efficient computation of discrete polynomial transforms

This letter presents a new recursive method for computing discrete polynomial transforms. The method is shown for forward and inverse transforms of the Hermite, binomial, and Laguerre transforms. The recursive flow diagrams require only 2 additions, 2( +1) memory units, and +1multipliers for the +1-point Hermite and binomial transforms. The recursive flow diagram for the +1-point Laguerre transform requires 2 additions, 2( +1) memory units, and 2( +1) multipliers. The transform computation time for all of these transforms is ( )

Backward Extensions of Recursively Generated Weighted Shifts and Quadratic Hyponormality

Given the weight sequence for a subnormal recursively generated weighted shift on Hilbert space, one approach to the study of classes of operators weaker than subnormal has been to form a backward extension of the shift by prefixing weights to the sequence. We characterize positive quadratic hyponormality and revisit quadratic hyponormality of certain such backward extensions of arbitrary length, generalizing earlier results, and also show that a function apparently introduced as a matter of convenience for quadratic hyponormality actually captures considerable information about positive quadratic hyponormality.

Mental Health and Aging at the 2005 White House Conference on Aging: Two Steps Forward, One Step Back

Success! At the 2005 White House Conference on Aging, three-quarters of the 1,200 national delegates voted to improve “recognition, assessment, and treatment of mental illness and depression among older Americans.” This resulted in mental health being ranked as #8 of the final 50 WHCoA policy resolutions resulting from the conference. Joining this resolution in the “top ten” were two resolutions intimately tied to hopes for addressing the mental health needs of older adults—at #6 “Support Geriatric Education and Training for Health Care Professionals, Paraprofessionals, Health Profession Students and Direct Care Workers,” and #9 “Attain Adequate Numbers of Healthcare Personnel in All Professions Who are Skilled, Culturally Competent, and Specialized in Geriatrics.”