An EM‐based adaptive multiple target tracking filter

Tracking targets of interest is one of the major research areas in radar surveillance systems. We formulate the problem as incomplete data estimation and apply EM to the MAP estimate. The resulting filter has a recursive structure analogous to the Kalman filter. The advantage is that the measurement‐update deals with multiple measurements in parallel and the parameter‐update estimates the system parameters on the fly. Experiments tracking separate targets in parallel show that tracking maintenance ratio of the proposed system is better than that of NNF and RMS position error is smaller than that of PDAF. Also, the system parameters are correctly obtained even from incorrect initial values. Copyright © 2001 John Wiley & Sons, Ltd.     

Optimal tradeoffs for location-based routing in large-scale ad hoc networks

Existing location-based routing protocols are not versatile enough for a large-scale ad hoc environment to simultaneously meet all of the requirements of scalability, bandwidth efficiency, energy efficiency, and quality-of-service routing. To remedy this deficiency, we propose an optimal tradeoff approach that: 1) constructs a hybrid routing protocol by combining well-known location-update schemes (i.e., proactive location updates within nodes' local regions and a distributed location service), and 2) derives its optimal configuration, in terms of location-update thresholds (both distance and time-based), to minimize the overall routing overhead. We also build a route-discovery scheme based on an Internet-like architecture, i.e., first querying the location of a destination, then applying a series of local-region routing until finding a complete route by aggregating the thus-found partial routes. To find the optimal thresholds for the hybrid protocol, we derive the costs associated with both location updates and route discovery as a function of location-update thresholds, assuming a random mobility model and a general distribution for route request arrivals. The problem of minimizing the total cost is then cast into a distributed optimization problem. We first prove that the total cost is a convex function of the thresholds, and then derive the optimal thresholds. Finally, we show, via simulation, that our analysis results indeed capture the real behavior.     

A single-chip storage LSI for home networks

Network direct attached storage (NDAS) is a network storage architecture that allows direct attachment of existing ATA/ATAPI devices to Ethernet without a separate server. Unlike other architectures such as NAS, SAN, and USB mass storage, no server computer intervenes between the storage and the client hosts. We describe an NDAS disk controller (NDC) amenable to low-cost single-chip implementation that processes a simplified L3/L4 protocol and converts commands between ATA/ATAPI and Ethernet, while the remaining complex tasks are performed by remote hosts. Unlike NAS architectures that use TCP/IP, NDAS uses a TCP-like lean protocol that lends itself well to high-performance hardware realization. Thanks to the simple NDAS architecture and protocol, an NDC implemented on a single 4 mm /spl times/ 4 mm chip in 0.18 /spl mu/m CMOS technology achieves a maximum throughput of 55 Mbytes/s on gigabit Ethernet, which is comparable to that of a high-performance disk locally attached to a host computer.     

Synthesis of LiFePO4 with fine particle by co-precipitation method

LiFePO₄ is a potential candidate for the cathode material of the lithium secondary batteries. A co-precipitation method was adopted to prepare LiFePO₄ because it is simple and cheap. Nitrogen gas was needed to prevent oxidation of Fe²⁺ in the aqueous solution. The co-precipitated precursor shows the high reactivity with the reductive gas, and the single phase of LiFePO₄ is successfully synthesized with the aid of carbon under less reductive conditions. LiFePO₄ fine powder prepared by co-precipitation method shows high rate capability, impressive specific capacity and cycle property.     

Solution of a multidimensional inverse radiation problem by means of mode reduction

The Karhunen–Loève Galerkin procedure is employed to solve an inverse radiation problem of determining the time‐varying strength of a heat source, which mimics flames in a furnace, from temperature measurements in three‐dimensional participating media where radiation and conduction occur simultaneously. The inverse radiation problem is solved through the minimization of a performance function, which is expressed by the sum of square residuals between calculated and observed temperature, using a conjugate gradient method. Through the Karhunen–Loève Galerkin procedure, one can represent the system dynamics with a minimum degree of freedom, and consequently the amount of computation required in the solution of the inverse problem is reduced drastically when the present technique is adopted. Copyright © 2004 John Wiley & Sons, Ltd.     

Workplane illuminance prediction method for daylighting control systems

A new prediction method with an interior light sensor for the workplane illuminance in daylighting control systems is introduced. Based on radiosity theory, the spatial distributions of daylight and electric light in the space are discussed and the prediction method is developed. An experimental verification of the technique is performed in an outdoor test-room for a double-glazed window system with a motorized venetian blind integrated between the two glazings. Electric light and daylight predictions were performed in accordance with the proposed method. The results showed that the electric light workplane illuminance can be predicted with high accuracy (±5 lux error with a linear correlation) and that the daylight workplane illuminance can be predicted within ±20 lux (with a linear correlation) for any sky conditions (overcast, clear sky, or variable) with the window system controlled to prevent direct daylight transmission. This method is useful for integrated control of motorized daylighting devices and dimmable electric lights.