Analysis of low bit rate image transform coding

Calculations based on high-resolution quantizations prove that the distortion rate D(R¯) of an image transform coding is proportional to 2^-2R when R¯ is large enough. In wavelet and block cosine bases, we show that if R¯<1 bit/pixel, then D(R¯) varies like R¯^1-2γ, where γ remains of the order of 1 for most natural images. The improved performance of embedded codings in wavelet bases is analyzed. At low bit rates, we show that the compression performance of an orthonormal basis depends mostly on its ability to approximate images with a few nonzero vectors     

DIRECT RESONANCE OF TURBULENT BOUNDARY LAVER OVER COMPLIANT WALLS

１．　ＩＮＴＲＯＤＵＣＴＩＯＮＴｈｅｍａｉｎｇｏａｌｏｆｔｈｉｓｐａｐｅｒｉｓｔｏｅｘｐｌｏｒｅｔｈｅｐｏｓｓｉｂｉｌｉｔｙｔｏｌｅａｒｎｍｏｒｅａｂｏｕｔｔｈｅｍｅｃｈａｎｉｓｍｏｆｔｕｒｂｕｌｅｎｔｂｏｕｎｄａｒｙｌａｙｅｒｆｌｏｗｉｎｔｅｒａｃｔｉｏｎｓａｎｄｉｔｓｅｆｆｅｃｔｓｏｎｃｏｍｐｌｉａｎｔｗａｌｌｐｅｒｆｏｒｍａｎｃｅ．Ｔｈｅｒｅａｒｅｃｅｒｔａｉｎｐｒｅｒｅｑｕｉｓｉｔｅｃｏｎｄｉｔｉｏｎｓｔｏｆｕｒｔｈｅｒｔｈｅｓｔｕｄｙｏｎｔｈｅｍｅｃｈａｎｉｓｍ，ｉ．ｅ．ｔｈｅｃｏ…     

Distributed autonomous wireless channel assignment algorithm withpower control

Local autonomous dynamic channel allocation (LADCA) including power control is essential to accommodating the anticipated explosion of demand for wireless. The authors simulate call performance for users accessing channels in a regular cellular array with a base located at the center of each hexagon. The computer model includes stochastic channel demand and a propagation environment characterized by attenuation with distance as well as shadow fading. The study of LADCA shows that distributed power control and channel access can be combined in an access management policy that achieves satisfactory system capacity and provides desired call performance. The authors report: LADCA/power control is observed to be stable alleviating a major concern about users unaware of the signal to interference problems their presence on a channel might cause to others. There can be substantial inadvertent dropping of calls in progress caused by originating calls. Modeling user time dynamics is essential. LADCA contrasts very favorably with fixed channel allocation (FCA) in a comparative example     

Scientific and artistic investigation of multi-dimensional fractals on the AT & T pixel machine

The pipelined architecture and parallel organization of the AT&T Pixel Machine image computer are described and demonstrated with applications for the visualization of multidimensional fractals, particularly linear fractals and quaternion/ stacked Julia sets. Techniques for pushing the Pixel Machine to its peak abilities are described and apply to more recent parallel image computers as well.     

Error in the UNITY substitution rule for subscripted operators

UNITY, introduced by Chandy and Misra [ChM88], is a programming logic intended to reason about temporal properties of distributed programs. Despite the fact that UNITY does not have the full power of, for example, linear temporal logic, it enjoys popularity due to its simplicity.There was however a serious problem with the Substitution Rule. The logic is incomplete without the rule, and with the rule it is inconsistent.     

Prolog/Rex-a way to extend Prolog for better knowledgerepresentation

Prolog/Rex represents a powerful amalgamation of the latest techniques for knowledge representation and processing, rich in semantic features that ease the difficult task of encoding heterogeneous knowledge of real-world applications. The Prolog/Rex concept mechanism lets a user represent domain entities in terms of their structural and behavioral properties, including multiple inheritance, arbitrary user-defined relations among entities, annotated values (demons), incomplete knowledge, etc. A flexible rule language helps the knowledge engineer capture human expertise and provide flexible control of the reasoning process. Additional Prolog/Rex strength that cannot be found in any other hybrid language made on top of Prolog is language level support for keeping many potentially contradictory solutions to a problem, allowing possible solutions and their implications to be automatically generated and completely explored before they are committed. The same mechanism is used to model time-states, which are useful in planning and scheduling applications of Prolog/Rex     

Partitioned encoding schemes for algorithm-based fault tolerance inmassively parallel systems

Considers the applicability of algorithm based fault tolerance (ABET) to massively parallel scientific computation. Existing ABET schemes can provide effective fault tolerance at a low cost For computation on matrices of moderate size; however, the methods do not scale well to floating-point operations on large systems. This short note proposes the use of a partitioned linear encoding scheme to provide scalability. Matrix algorithms employing this scheme are presented and compared to current ABET schemes. It is shown that the partitioned scheme provides scalable linear codes with improved numerical properties with only a small increase in hardware and time overhead     

Parallel architecture for fast transforms with trigonometric kernel

We present an unified parallel architecture for four of the most important fast orthogonal transforms with trigonometric kernel: Complex Valued Fourier (CFFT), Real Valued Fourier (RFFT), Hartley (FHT), and Cosine (FCT). Out of these, only the CFFT has a data flow coinciding with the one generated by the successive doubling method, which can be transformed on a constant geometry flow using perfect unshuffle or shuffle permutations. The other three require some type of hardware modification to guarantee the constant geometry of the successive doubling method. We have defined a generalized processing section (PS), based on a circular CORDIC rotator, for the four transforms. This PS section permits the evaluation of the CFFT and FCT transforms in n data recirculations and the RFFT and FHT transforms in n-1 data recirculations, with n being the number of stages of a transform of length N=rⁿ. Also, the efficiency of the partitioned parallel architecture is optimum because there is no cycle loss in the systolic computation of all the butterflies for each of the four transforms