This study proposed a novel decoupling method for four planar inverted-F antennas (PIFAs) operating at 2.0GHz (f0). The edge-to-edge and center-to-center spacings of the adjacent PIFAs are extremely small (0.05λ0 and 0.17λ0, respectively), resulting in strong mutual coupling among them. In our previous study, we proposed a structure consisting of parasitic elements (PEs) and a bridge line (BL) for the decoupling of two PIFAs. One attractive feature of the proposed method is that no adjustment of the original structure and size of the PIFAs is necessary. However, as the number of PIFAs increases to four, their decoupling becomes considerably more complicated, and impedance mismatch is also an issue to be considered. Therefore, in this study, PEs and BLs are functionally developed to simultaneously achieve low mutual coupling and improved impedance matching of the four PIFAs. The simulated results showed that loading the proposed PEs and BLs onto the four PIFAs could reduce as well as maintain all mutual coupling for less than -10dB, and simultaneously improve impedance matching. Therefore, the total antenna efficiency at 2.0GHz could be significantly improved from 64.2% to 84.8% for PIFA1 and PIFA4, and from 35.9% to 74.2% for PIFA2 and PIFA3. Four PIFAs with PEs and BLs were fabricated and measured to validate the simulation results.

This study considered an extension of a sparse regularization method with scaling, especially in thresholding methods that are simple and typical examples of sparse modeling. In this study, in the setting of a non-parametric orthogonal regression problem, we developed and analyzed a thresholding method in which soft thresholding estimators are independently expanded by empirical scaling values. The scaling values have a common hyper-parameter that is an order of expansion of an ideal scaling value to achieve hard thresholding. We simply refer to this estimator as a scaled soft thresholding estimator. The scaled soft thresholding method is a bridge method between soft and hard thresholding methods. This new estimator is indeed consistent with an adaptive LASSO estimator in the orthogonal case; i.e., it is thus an another derivation of an adaptive LASSO estimator. It is a general method that includes soft thresholding and non-negative garrote as special cases. We subsequently derived the degree of freedom of the scaled soft thresholding in calculating the Stein's unbiased risk estimate. We found that it is decomposed into the degree of freedom of soft thresholding and the remainder term connecting to the hard thresholding. As the degree of freedom reflects the degree of over-fitting, this implies that the scaled soft thresholding has an another source of over-fitting in addition to the number of un-removed components. The theoretical result was verified by a simple numerical example. In this process, we also focused on the non-monotonicity in the above remainder term of the degree of freedom and found that, in a sparse and large sample setting, it is mainly caused by useless components that are not related to the target function.

In this study, a novel decoupling method using parasitic elements (PEs) connected by a bridge line (BL) for two planar inverted-F antennas (PIFAs) is proposed. The proposed method is developed from a well-known decoupling method that uses a BL to directly connect antenna elements. When antenna elements are connected directly by a BL, strong mutual coupling can be reduced, but the resonant frequency shifts to a different frequency. Hence, to shift the resonant frequency toward the desired frequency, the original size of the antenna elements must be adjusted. This is disadvantageous if the method is applied in cases where the design conditions render it difficult to connect the antennas directly or adjust the original antenna size. Therefore, to easily reduce mutual coupling in such a case, a decoupling method that does not require both connecting antennas directly and adjusting the original antenna size is necessitated. This study demonstrates that using PEs connected by a BL reduces the mutual coupling from -6.6 to -14.1dB, and that the resonant frequency is maintained at the desired frequency (2.0GHz) without having to adjust the original PIFAs size. In addition, impedance matching can be adjusted to the desired frequency, resulting in an improved total antenna efficiency from 77.4% to 94.6%. This method is expected to be a simple and effective approach for reducing the mutual coupling between larger numbers of PIFA elements in the future.

In this paper, experimental data of non-arcing circuit breaking phenomena in electrical contacts are presented. A dark bridge that is a non-luminous bridge between electrical contacts is an effective factor for the non-arcing circuit break. A facility of a cantilever system was established to precisely control a position of an electrode. By using this facility, dark bridges between contacts were made and the dark bridges were observed by a microscopic camera system.

Most wireless networks are specified as using the data link protocol, i.e. layer 2 (L2). Recently, IoT and big data processing have promoted the use of wireless sensor networks to connect and send data to data center applications over the Internet. To do so, the implementation of an IP stack on the wireless node, or the gateway of the IP and wireless L2 network, has been proposed. Both approaches were developed to allow applications on the IP network to access L2 wireless network nodes. However, since wireless sensor networks do not require any network protocol, an IP is not essential for collecting data. Therefore, we propose a novel bridging VPN for connecting wireless networks, in which the application and wireless end nodes are not required to acknowledge an IP address or network protocol. In this way, the IP network merely serves to transport the data link frames of wireless networks. We believe that this is another style of IoT and recommend that this VPN be used as a test bed for small IoT businesses and institutions before they start to implement an IP stack on their systems.

Crack detection is a vital task to maintain a bridge's health and safety condition. Traditional computer-vision based methods easily suffer from disturbance of noise and clutters for a real bridge inspection. To address this limitation, we propose a two-stage crack detection approach based on Convolutional Neural Networks (CNN) in this letter. A predictor of small receptive field is exploited in the first detection stage, while another predictor of large receptive field is used to refine the detection results in the second stage. Benefiting from data fusion of confidence maps produced by both predictors, our method can predict the probability belongs to cracked areas of each pixel accurately. Experimental results show that the proposed method is superior to an up-to-date method on real concrete surface images.

As semiconductor device manufacturing technology evolves toward higher integration and reduced feature size, the gap between the defect level estimated at the design stage and that reported for fabricated devices has become wider, making it more difficult to control total manufacturing cost including test cost and cost for field failure. To estimate fault coverage more precisely considering occurrence probabilities of faults, we have proposed weighted fault coverage estimation based on critical area corresponding to each fault. Previously different fault models were handled separately; thus, pattern compression efficiency and runtime were not optimized. In this study, we propose a fast test pattern generation scheme that considers weighted bridge and open fault coverage in an integrated manner. The proposed scheme applies two-step test pattern generation, wherein test patterns generated at second step that target only bridge faults are reordered with a search window of fixed size, achieving O(n) computational complexity. Experimental results indicate that with 10% of the initial target fault size and a fixed, small window size, the proposed scheme achieves approximately 100 times runtime reduction when compared to simple greedy-based reordering, in exchange for about 5% pattern count increment.

This paper focuses mainly on issues related to the pricing of American options under a fuzzy environment by taking into account the clustering of the underlying asset price volatility, leverage effect and stochastic jumps. By treating the volatility as a parabolic fuzzy number, we constructed a Levy-GJR-GARCH model based on an infinite pure jump process and combined the model with fuzzy simulation technology to perform numerical simulations based on the least squares Monte Carlo approach and the fuzzy binomial tree method. An empirical study was performed using American put option data from the Standard & Poor's 100 index. The findings are as follows: under a fuzzy environment, the result of the option valuation is more precise than the result under a clear environment, pricing simulations of short-term options have higher precision than those of medium- and long-term options, the least squares Monte Carlo approach yields more accurate valuation than the fuzzy binomial tree method, and the simulation effects of different Levy processes indicate that the NIG and CGMY models are superior to the VG model. Moreover, the option price increases as the time to expiration of options is extended and the exercise price increases, the membership function curve is asymmetric with an inclined left tendency, and the fuzzy interval narrows as the level set α and the exponent of membership function n increase. In addition, the results demonstrate that the quasi-random number and Brownian Bridge approaches can improve the convergence speed of the least squares Monte Carlo approach.

This paper presents a method to segment single- and multiple-touching characters in offline handwritten Japanese text recognition with practical speed. Distortions due to handwriting and a mix of complex Chinese characters with simple phonetic and alphanumeric characters leave optical handwritten text recognition (OHTR) for Japanese still far from perfection. Segmentation of characters, which touch neighbors on multiple points, is a serious unsolved problem. Therefore, we propose a method to segment them which is made in two steps: coarse segmentation and fine segmentation. The coarse segmentation employs vertical projection, stroke-width estimation while the fine segmentation takes a graph-based approach for thinned text images, which employs a new bridge finding process and Voronoi diagrams with two improvements. Unlike previous methods, it locates character centers and seeks segmentation candidates between them. It draws vertical lines explicitly at estimated character centers in order to prevent vertically unconnected components from being left behind in the bridge finding. Multiple candidates of separation are produced by removing touching points combinatorially. SVM is applied to discard improbable segmentation boundaries. Then, ambiguities are finally solved by the text recognition employing linguistic context and geometric context to recognize segmented characters. The results of our experiments show that the proposed method can segment not only single-touching characters but also multiple-touching characters, and each component in our proposed method contributes to the improvement of segmentation and recognition rates.

A 10 Gbps transmitter bridge chip including four data lanes, which increases the bandwidth using an 8-to-1 serialization, is proposed for a field-programmable gate array (FPGA)-based frame generator to support the protocol of the D-PHY version 1.2 for the mobile industry processor interface (MIPI) display serial interface (DSI).

Shrinking feature sizes and higher levels of integration in semiconductor device manufacturing technologies are increasingly causing the gap between defect levels estimated in the design stage and reported ones for fabricated devices. In this paper, we propose a unified weighted fault coverage approach that includes both bridge and open faults, considering the critical area as the incident rate of each fault. We then propose a test pattern reordering scheme that incorporates our weighted fault coverage with an aim to reduce test costs. Here we apply a greedy algorithm to reorder test patterns generated by the bridge and stuck-at automatic test pattern generator (ATPG), evaluating the relationship between the number of patterns and the weighted fault coverage. Experimental results show that by applying this reordering scheme, the number of test patterns was reduced, on average, by approximately 50%. Our results also indicate that relaxing coverage constraints can drastically reduce test pattern set sizes to a level comparable to traditional 100% coverage stuck-at pattern sets, while targeting the majority of bridge faults and keeping the defect level to no more than 10 defective parts per milion (DPPM) with a 99% manufacturing yield.

Many actual systems, e.g. computer programs, can be modeled as a subclass of Petri nets, called bridge-less workflow nets. For bridge-less workflow nets, we revealed the following properties: (i) any acyclic bridge-less workflow net is free choice; (ii) an acyclic bridge-less workflow net is sound iff it is well-structured; and (iii) any sound bridge-less workflow net is well-structured. We also proposed a necessary and sufficient condition to decide whether a given workflow net is bridge-less, and then constructed a polynomial-time procedure for it.

The bidirectional DC-DC converters that are used in backup power supplies, energy storage systems, and electric vehicles, are described in this paper, because they have recently attracted a lot of attention. First, this paper shows the main use of the bidirectional DC-DC converter, the optimum circuit topology in accordance with its use, and the characteristic properties of the circuits. In addition, the expected characteristics for the next generations of power semiconductor devices for each bidirectional converter circuit are shown.

Industrial applications such as automotive ones require a cheap communication mechanism to send out communication messages from node to node by their deadline time. This paper presents a design paradigm in which we optimize both assignment of a network node to a bus and slot multiplexing of a FlexRay network system under hard real-time constraints so that we can minimize the cost of wire harness for the FlexRay network system. We present a cost minimization problem as a non-linear model. We developed a network synthesis tool which was based on simulated annealing. Our experimental results show that our design paradigm achieved a 50.0% less cost than a previously proposed approach for a virtual cost model.

To study the molten bridge phenomenon of contacts at the initial breaking process, an experimental device of molten bridge between slowly opening contacts was developed. The system consists of the contact moving control module, the circuit load and the observation module. The molten bridge of copper contact under two load conditions 9,V/19,A and 9,V/7.3,A were studied. The voltage and current characteristics curves of Cu molten bridge were extracted and the resistance and the instantaneous power of the molten bridge were analyzed. The image of the Cu molten bridge diameter was captured by CCD under 9,V/19,A and the influences of the contact force and the separation speed on the molten bridge length and the crater diameter of the anode were studied. The root profile of the Cu contacts after separation was analyzed by digital microscope. Research results show that the Cu molten bridge length has the same changing trend as the diameter of the anode crater. They both decrease with the increment of the separation speed and the decrement of the contact force.

High voltage DC contactors, for operation at voltage levels up to at least about 300,volts, find their increasing markets in applications such as electrical vehicles and aircrafts in which size and weight of cables are of extreme importance. The copper bridge-type contact, cooperated with magnetic field provided by permanent magnets and sealed in an arc chamber filled with high pressure gases, is a mainly used structure to interrupt the DC arc rapidly. Arc characteristic in different gases at different pressure varies greatly. This paper is focused on the arc characteristics of the bridge-type contact system when magnetic field is applied with nitrogen and gas at different pressure. The pressure of the gases varies from 1,atm to 2.5,atm. Arc characteristics, such as arc durations at different stages and arc motions in those gases are comparatively studied. The results are instructive for choosing the suitable arcing atmosphere in a DC bridge-type arc chamber of a contactor.

This paper presents a novel decoupling network consisting of transmission lines and a bridge resistance for a two-element array antenna and evaluates its performance through simulations and measurements. To decouple the antennas, the phase of the mutual admittance between the antenna ports is rotated by using the transmission lines, and a pure resistance working as a bridge resistance is inserted between the two antenna ports to cancel the mutual coupling. The simulation results indicate that the proposed decoupling network can provide a wider bandwidth than the conventional approach. The proposed decoupling network is implemented and tested as a demonstration to confirm its performance. The measurement results indicate that the mutual coupling between the two antenna ports is lowered by about 47dB at the resonant frequency.

Bridge-type contacts are mainly used in high voltage direct current contactors for their performance of arc extinguishment and break capacity. It is also easy to add external magnetic field in them to blow the arc. Experiments on the arc behaviors were carried out when a copper bridge-type contact pair opening a 270V resistive circuit in the air. Influences of the shape of the movable contact, the opening speed and the magnetic flux density on the key behaviors, such as the arc duration, the arc re-ignition and the stability of arcing process, were investigated by using an oscilloscope and a high-speed camera. It was revealed that a uniform magnetic field with proper density could extinguish the arc stably and could reduce the arc re-ignition.

This paper describes Path-Moose, a scalable tree-based shortest path bridging protocol. Both ARP-Path and Path-Moose protocols belong to a new category of bridges that we name All-path, because all paths of the network are explored simultaneously with a broadcast frame distributed over all network links to find a path or set a multicast tree. Path-Moose employs the ARP-based low latency routing mechanism of the ARP-Path protocol on a bridge basis instead of a per-single-host basis. This increases scalability by reducing forwarding table entries at core bridges by a factor of fifteen times for big data center networks and achieves a faster reconfiguration by an approximate factor of ten. Reconfiguration time is significantly shorter than ARP-Path (zero in many cases) because, due to the sharing of network paths by the hosts connected to same edge bridges, when a host needs the path it has already been recovered by another user of the path. Evaluation through simulations shows protocol correctness and confirms the theoretical evaluation results.

In this paper, a sepic-type single-stage electronic ballast (STSSEB) is proposed, which is derived from the combination of a sepic converter and a half-bridge inverter. The ballast can not only step down input voltage directly but achieve high power factor, reduce voltage stress, improve efficiency and lower cost. Since component stress is reduced significantly, the presented ballast can be applied to high voltage mains. Derivation of the STSSEB is first presented. Then, analysis, design and practical consideration for the STSSEB are discussed. A 347 Vac 60 W prototype has been simulated and implemented. Simulations and experimental results have verified the feasibility of the proposed STSSEB.