A simple method for separating the dissipation factors associated with both conductor losses and dielectric losses of printed circuit boards in microwave frequencies is presented. This method utilizes the difference in dependence of two dissipation factors on the dimensions of bounded stripline resonators using a single printed circuit board specimen as a center strip conductor. In this method, the separation is made through a procedure involving the comparison of the measured values of the total dissipation factor with those numerically calculated for the resonators. A method, which is based on a TEM wave approximation and uses Green's function and a variational principle, is used for the numerical calculation. Both effective conductivity for three kinds of industrial copper conductor supported with a substrate of polymide film and dielectric loss tangent of the substrates are determined using this method from the values of the unloaded Q measured at the 10 GHz region. Radiation losses from the resonator affecting the accuracy of the separation are discussed, as well as the values of the effective conductivity of metals on the polyimide substrate which is calculated using the above method. The resulting values of the effective conductivity agree with those using the triplateline method within 10%.

The spike timings of neurons are irregular and are considered to be a one-dimensional point process. The Bayesian approach is generally used to estimate the time-dependent firing rate function from sequences of spike timings. It can also be used to estimate the firing rate from only a single sequence of spikes. However, the rate function has too many degrees of freedom in general, so approximation techniques are often used to carry out the Bayesian estimation. We applied the transfer matrix method, which efficiently computes the exact marginal distribution, to the estimation of the firing rate and developed an algorithm that enables the exact results to be obtained for the Bayesian framework. Using this estimation method, we investigated how the mismatch of the prior hyperparameter value affects the marginal distribution and the firing rate estimation.

In this paper, we present a numerical analysis for resonant characteristics of the TM010 mode of a cylindrical cavity containing a dielectric rod and a conductive layer on its metal walls. This analysis uses the mode matching method for calculation. Error in complex permittivity of a loaded dielectric rod measured using a layered cavity is evaluated as a function of thickness and layered conductor conductivity. A thick layered cavity is necessary for precise measurement of material properties using the cavity resonator method at microwave and millimeter-wave frequencies.

In this paper, we calculated resonant frequency and unloaded Q-factor for the TM0i0 resonant mode excited in a cylindrical cavity composed of walls with finite conductivity and with a dielectric rod loaded coaxially along the central axis. Formulation for the calculation is made using the mode-matching method. Convergence of the calculation is checked. Values calculated by the present method for various combinations of dimensions, permittivity, and conductivity of the inner-components of cavity are compared with those calculated by a conventional method formulated using loss-less electromagnetic fields of cavity. Although the difference between the values calculated by those two methods is usually small, it is found that the difference increases as permittivity of dielectric rod increases and becomes about 10-6 in reciprocal of unloaded Q-factor of the loaded cavity in a presented case.

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, we show the effectiveness of software shaping through evaluation of our extensions to the internet transport protocols, TCP (Transmission Control Protocol) and UDP (User Datagram Protocol). These extensions are aimed at efficient realization of bulk data transfer and continuous media communication. The extensions are to be used with resource reservation, a possible and promising approach to resolve transport issues that the current TCP/IP networks cannot support. Although it seems straightforward to utilize dedicated bandwidth set up via resource reservation, filling up the reserved pipe is not so trivial. Performance analysis shows that, by applying the traffic shaping extensions, not only is the reserved pipe easily filled up, but the timely data delivery required by continuous media communication is also provided. Our experiments with a real system also show that overheads introduced by the new extensions are small enough to permit their practical use. The extensions are implemented in the UNIX system kernel.

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 having exactly n vertices and with the maximum degree exactly D. The algorithm uses O(n) space and generates such triangulations in O(1) time per triangulation without duplications.

Connected cars generate a huge amount of Internet of Things (IoT) sensor information called Controller Area Network (CAN) data. Recently, there is growing interest in collecting CAN data from connected cars in a cloud system to enable life-critical use cases such as safe driving support. Although each CAN data packet is very small, a connected car generates thousands of CAN data packets per second. Therefore, real-time CAN data collection from connected cars in a cloud system is one of the most challenging problems in the current IoT. In this paper, we propose an Edge computing-enhanced network Redundancy Elimination service (EdgeRE) for CAN data collection. In developing EdgeRE, we designed a CAN data compression architecture that combines in-vehicle computers, edge datacenters and a public cloud system. EdgeRE includes the idea of hierarchical data compression and dynamic data buffering at edge datacenters for real-time CAN data collection. Across a wide range of field tests with connected cars and an edge computing testbed, we show that the EdgeRE reduces bandwidth usage by 88% and the number of packets by 99%.