Hui lan ji yao : 2 juan ; An lan ji yao : 2 juan /

Block print.

Yu lan Tang que shi : 2 juan /

On double leaves, oriental style, in case.

Ru lan ji : 20 juan /

On double leaves, oriental style, in 1 case.

Yun lan fu chao. 8 juan /

Block print.

Shi lan tang shi ke /

Block print.

Cen hua ju shi lan jing lu : 8 juan, wai ji : 2 juan /

Double leaves, oriental style, in case.

Bi suan bian lan : 5 juan.

Double leaves, oriental style, in case.

Jiu huang bei lan : 4 juan /

Double leaves, oriental style, in case.

1326 senesi Martından Şubatı gayesine kadar Hazine-yi Celile'den memurin-i Maliye'ye yazılan muharrerat-ı umumiye suretlerini muhtevi mecmuadir.

Includes index.

International wireless telegraph : [hearings, Sixtieth Congress, first session.] An international wireless telegraph convention, with service regulations annexed thereto, a supplementary agreement, and a final protocol, all signed at Berlin on November 3, 1906, by delegates of the United States and those of several other powers, and hearings thereon before the Committee on Foreign Relations, United States Senate, ...

Mode of access: Internet.

International wireless telegraphy : hearing before the Committee on Foreign Relations, United States Senate, Sixty-second Congress, on an International Wireless Telegraphy Convention, with service regulations annexed thereto, a supplementary agreement, and a final protocol, all signed at Berlin on November 3, 1906, by delegates of the United States and those of several other powers. February 21, 1912.

Mode of access: Internet.

The Year-book of Wireless Telegraphy & Telephony

Mode of access: Internet.

Functionally partitioned module-based programmable architecture for wireless base-band processing

A specialised reconfigurable architecture is targeted at wireless base-band processing. It is built to cater for multiple wireless standards. It has lower power consumption than the processor-based solution. It can be scaled to run in parallel for processing multiple channels. Test resources are embedded on the architecture and testing strategies are included. This architecture is functionally partitioned according to the common operations found in wireless standards, such as CRC error correction, convolution and interleaving. These modules are linked via Virtual Wire Hardware modules and route-through switch matrices. Data can be processed in any order through this interconnect structure. Virtual Wire ensures the same flexibility as normal interconnects, but the area occupied and the number of switches needed is reduced. The testing algorithm scans all possible paths within the interconnection network exhaustively and searches for faults in the processing modules. The testing algorithm starts by scanning the externally addressable memory space and testing the master controller. The controller then tests every switch in the route-through switch matrix by making loops from the shared memory to each of the switches. The local switch matrix is also tested in the same way. Next the local memory is scanned. Finally, pre-defined test vectors are loaded into local memory to check the processing modules. This paper compares various base-band processing solutions. It describes the proposed platform and its implementation. It outlines the test resources and algorithm. It concludes with the mapping of Bluetooth and GSM base-band onto the platform.

Vertical handover supporting pervasive computing in future wireless networks

A variety of current and future wired and wireless networking technologies can be transformed into a seamless communication environments through application of context-based vertical handovers. Such seamless communication environments are needed for future pervasive/ubiquitous systems. Pervasive systems are context aware and need to adapt to context changes, including network disconnections and changes in network Quality of Service (QoS). Vertical handover is one of many possible adaptation methods. It allows users to roam freely between heterogeneous networks while maintaining the continuity of their applications. This paper proposes a vertical handover mechanism suitable for multimedia applications in pervasive systems. The paper focuses on the handover decision making process which uses context information regarding user devices, user location, network environment and requested QoS. (C) 2004 Elsevier B.V. All rights reserved.

Genetic algorithms with applications in wireless communications

Genetic algorithms (GAs) are known to locate the global optimal solution provided sufficient population and/or generation is used. Practically, a near-optimal satisfactory result can be found by Gas with a limited number of generations. In wireless communications, the exhaustive searching approach is widely applied to many techniques, such as maximum likelihood decoding (MLD) and distance spectrum (DS) techniques. The complexity of the exhaustive searching approach in the MLD or the DS technique is exponential in the number of transmit antennas and the size of the signal constellation for the multiple-input multiple-output (MIMO) communication systems. If a large number of antennas and a large size of signal constellations, e.g. PSK and QAM, are employed in the MIMO systems, the exhaustive searching approach becomes impractical and time consuming. In this paper, the GAs are applied to the MLD and DS techniques to provide a near-optimal performance with a reduced computational complexity for the MIMO systems. Two different GA-based efficient searching approaches are proposed for the MLD and DS techniques, respectively. The first proposed approach is based on a GA with sharing function method, which is employed to locate the multiple solutions of the distance spectrum for the Space-time Trellis Coded Orthogonal Frequency Division Multiplexing (STTC-OFDM) systems. The second approach is the GA-based MLD that attempts to find the closest point to the transmitted signal. The proposed approach can return a satisfactory result with a good initial signal vector provided to the GA. Through simulation results, it is shown that the proposed GA-based efficient searching approaches can achieve near-optimal performance, but with a lower searching complexity comparing with the original MLD and DS techniques for the MIMO systems.