We evaluate resolution models for resource allocation in a GMPLS distributed control plane for heterogeneous all-optical networks. In a practical regional-to-backbone network environment, the local resolution model is advantageous in resource utilization, protocol compatibility and scalability. We demonstrate a lookup procedure, which inter-works with OSPF-TE and RSVP-TE protocols and allocates resources in the local resolution model.

A "rooted" plane triangulation is a plane triangulation with one designated vertex r and one designated edge incident to r on the outer face. In this paper we give a simple algorithm to generate all connected rooted plane triangulations with at most m edges. The algorithm uses O(m) space and generates such triangulations in O(1) time per triangulation without duplications. The algorithm does not output entire triangulations but the difference from the previous triangulation. By modifying the algorithm we can generate all connected (non-rooted) plane triangulations with at most m edges in O(m3) time per triangulation.

The demand for wireless mobile communications has grown at a very high rate, recently. In order to solve the non-uniform traffic rates, the use of cell splits is unavoidable for balancing the traffic rate and maximizing total system capacity. For cell planning, a DS-CDMA cellular system can be comprise of different cell sizes because of different demands and population density of the service area. In this paper, we develop a general model to study the forward link capacity and outage probability of a DS-CDMA cellular system with mixed cell sizes. The analysis of outage probability is carried out using the log-normal approximation. When a macrocell is split into the three microcells, as an example, we calculate the multi-cross interferences between macrocells and microcells, and the forward link capacities for the microcells and the neighboring macrocells. The maximum allowable capacity plane for macrocell and microcell is also investigated. The numerical results and discussions with previous published results of reverse link are summarized.

A plane quadrangulation is a plane graph such that each inner face has exactly four edges on its contour. This is a planar dual of a plane graph such that all inner vertices have degree exactly four. A based plane quadrangulation is a plane quadrangulation with one designated edge on the outer face. In this paper we give a simple algorithm to generate all biconnected based plane quadrangulations with at most f faces. The algorithm uses O(f) space and generates such quadrangulations in O(1) time per quadrangulation without duplications. By modifying the algorithm we can generate all biconnected (non-based) plane quadrangulations with at most f faces in O(f3) time per quadrangulation.

A "based" plane triangulation is a plane triangulation with one designated edge on the outer face. In this paper we give a simple algorithm to generate all biconnected based plane triangulations with at most n vertices and with maximum degree at most D. The algorithm uses O(n) space and generates such triangulations in O(1) time per triangulation without duplications. The algorithm does not output entire triangulation but the difference from the previous triangulation. By modifying the algorithm we can generate all biconnected based plane triangulations with exactly n vertices and maximum degree at most D in O(1) time per triangulation, and all biconnected (non-based) plane triangulations with exactly n vertices and maximum degree at most D in O(n3) time per triangulation without duplications.

In this paper, the power plane resonance problem in a multi-layered PCB is numerically analyzed by applying the alternating-direction implicit (ADI) FDTD method. This method is extremely suitable for analyzing the power plane resonance problems having locally fine structures of two closely located planes. This paper also analyzes the effect of the decoupling capacitor, which is one of the solutions for reducing the resonance problem. The results of the ADI-FDTD agree well with those of the conventional FDTD and the analytic solutions, and the computational CPU time is reduced to about a half of that of the conventional FDTD.

This paper presents a flexible learning algorithm for the binary neural network that can realize a desired Boolean function. The algorithm determines hidden layer parameters using a genetic algorithm. It can reduce the number of hidden neurons and can suppress parameters dispersion. These advantages are verified by basic numerical experiments.

In this paper, we describe a novel technique to extract a polyhedral description from panoramic range data of a scene taken by a panoramic laser range finder. First, we introduce a reasonable noise model of the range data acquired with a laser radar range finder, and derive a simple and efficient approximate solution of the optimal fitting of a local plane in the range data under the assumed noise model. Then, we compute the local surface normals using the proposed method and extract stable planar regions from the range data by using both the distribution information of local surface normals and their spatial information in the range image. Finally, we describe a method which builds a polyhedral description of the scene using the extracted stable planar regions of the panoramic range data with 360 field of view in a polar coordinate system. Experimental results on complex real range data show the effectiveness of the proposed method.

Microstrip antennas with meshed ground planes are suitable for radiation elements of large satellite phased array antennas. Although they have some mechanical advantages such as the possibility of antenna weight reduction, they also cause electrical problems such as the resonant frequency shift and F/B ratio degradation. The first purpose of this paper is the analytical understanding of the resonant frequency shift, for which two perturbational methods are proposed. One has a closed form expression that provides some useful design data. The other is to solve the integral equations by using the periodicity of the meshed ground plane, which gives more accurate results. The second purpose of this paper is to investigate the backward radiation from the meshed ground plane analytically, for which we derive an analysis method from the calculated results of the resonant frequency shift. The proposed methods are verified with the measured ones.

A plane drawing of a graph is called a floorplan if every face (including the outer face) is a rectangle. A based floorplan is a floorplan with a designated base line segment on the outer face. In this paper we give a simple algorithm to generate all based floorplans with at most n faces. The algorithm uses O(n) space and generates such floorplans in O(1) time per floorplan without duplications. The algorithm does not output entire floorplans but the difference from the previous floorplan. By modifying the algorithm we can generate without duplications all based floorplans having exactly n faces in O(1) time per floorplan. Also we can generate without duplications all (non-based) floorplans having exactly n faces in O(n) time per floorplan.

This paper presents a new decoupling circuit for suppressing radiated emissions due to power plane resonance in multilayer printed circuit boards (PCBs). This circuit is based on transmission line theory, and consists of two decoupling capacitors and one power trace. The two capacitors, one mounted on the power pin of an IC and the other mounted on the common power distribution bus in a board, are connected through the power trace. The characteristic impedance of the trace is much higher than the impedance of the capacitors. In addition, the length of the trace between the capacitors is less than 1/4 the effective wavelength for high frequency (e.g., 1 GHz). Tests we performed on simple PCBs confirm that our decoupling circuit suppresses radiated emissions due to power plane resonance.

High-Tc superconductors convincingly showed that these materials are essentially natural arrays of Josephson junctions formed in atomic scale. In this paper, in-plane aligned a-axis-oriented YBa2Cu3O7-δ (YBCO) thin films were successfully grown on LaSrGaO4(LSGO) (100) substrates which were cleaned by ion-beam. Voltage jumps with hysteresis implying intrinsic Josephson effects are observed in c-axis direction. This result suggest that it is possible to achieve planar intrinsic Josephson devices which have applications in high frequency electronics, such as voltage standards, Josephson masers and so on.

We fabricated ramp-edge junctions with barriers by modifying surface and integrating ground-planes. The fabricated junctions had current-voltage characteristics consistent with the resistive shunted-junction model. We also obtained a 1-sigma spread in the critical current of 7.9% for 100 junctions at 4.2 K. The ground-plane reduced the sheet inductance of a stripline by a factor of 3. The quality of the ground-plane was improved by using an anneal in oxygen atmosphere after fabrication. The sheet inductance of a counter-electrode with a ground-plane was 1.0 pH per square at 4.2 K.

In this paper, we propose a probabilistic approach to derive an approximate polyhedral description from range data. We first compare several least-squares-based methods for estimation of local normal vectors and select the most robust one based on a reasonable noise model of the range data. Second, we extract the stable planar regions from the range data by examining the distributions of the local normal vectors together with their spatial information in the 2D range image. Instead of segmenting the range data completely, we use only the geometries of the extracted stable planar regions to derive a polyhedral description of the range data. The curved surfaces in the range data are approximated by their extracted plane patches. With a probabilistic approach, the proposed method can be expected to be robust against the noise. Experimental results on real range data from different sources show the effectiveness of the proposed method.

We present iterative round-robin matching for an input and output buffered switch with multiple switching planes. The suggested algorithm is based on iSLIP and consists of request, grant and accept steps. The pointer update scheme of iSLIP is altered in the suggested algorithm to enhance the switch performance. Simulation results under Bernoulli traffic show the suggested algorithm is more appropriate than iSLIP for cell scheduling of input and output buffered switches.

Reliable and scalable network technologies are desired to meet the emerging demand for multimedia communication. Asynchronous Transfer Mode (ATM) is a key technology and its importance is widely recognized. An ATM layer service category, Available Bit Rate (ABR), was specified at the ATM Forum in 1996. ABR is intended to meet the requirements of non-real-time applications that assume best effort data transportation. It has distinctive features compared to other ATM layer categories. We proposed Application Program Interfaces (APIs) for ABR that allow applications to use ABR capability directly. The API is now a part of the ATM Forum specification. In this paper, we describe the background and necessity of ABR APIs and explain the primitives for them in detail. In addition to having common API primitives for requesting bandwidth or delay requirements during connection setup, ABR APIs can exchange feedback information during communication. Applications for such APIs are addressed and their effectiveness is shown by demonstrating simulation for the TCP-ABR interworking for a backbone ABR network. Finally, a migration scenario for utilizing such APIs is proposed.

Cost down of millimeter wave components, especially antenna duplexer, is a key for spreading millimeter wave communication systems. An excellent cost-performance antenna duplexer is proposed. It consists of two E-plane filters and a wave-guide circulator. The performance fluctuations due to manufacturing accuracies are studied by simulations and experiments. These results are very useful for cost-down of the practical duplexer without performance degradation.

Rectangular/circular-to-radial waveguide tra-nsformers through a ring slot have been proposed for the feeder of radial line slot antennas (RLSAs) in millimeter wave application. Rotating electric modes are excited by a set of ring slot and perturbation dog bone slot. Basic operation is observed in 12 GHz band. Concentric array radial line slot antennas fed by these transformers are fabricated and the antenna gain of 26.9 dBi with the efficiency more than 60% is measured. The applicability for millimeter wave is verified for 38 GHz band RLSA fed by the rectangular waveguide. The measured gain of the antenna is 22.5 dBi with the efficiency of 53% with the diameter of 46mm and 26.4 dBi with 61% with the diameter of 66mm.

Coupling between two slot antennas on an infinite ground plane and radiation patterns on a finite ground plane are calculated. We introduce a parasitic wire between slot antennas to reduce coupling. Two typical cases with a monopole or a half-loop are considered in this paper. Numerical results show that the reduction of 13.9 dB is obtained by adjusting a monopole height to about a quarter wavelength of the operating frequency. Also a properly adjusted parasitic half-loop reduces the coupling coefficient by 24 dB. Radiation patterns of the antennas on a 365 mm 465 mm ground plane at 1.5 GHz are calculated where the diffracted fields are taken into account. It is found that the parasitic elements little affect the antenna patterns around the +z-axis that is perpendicular to the ground plane although the reduction of coupling between slot antennas is obtained.

When we search from a huge amount of documents, we often specify several keywords and use conjunctive queries to narrow the result of the search. Though the searched documents contain all keywords, positions of the keywords are usually not considered. As a result, the search result contains some meaningless documents. It is therefore effective to rank documents according to proximity of keywords in the documents. This ranking is regarded as a kind of text data mining. In this paper, we propose two algorithms for finding documents in which all given keywords appear in neighboring places. One is based on plane-sweep algorithm and the other is based on divide-and-conquer approach. Both algorithms run in O(n log n) time where n is the number of occurrences of given keywords. We run the algorithms on a large collection of html files and verify its effectiveness.