High-resolution (2 km) high-frequency (hourly) SST data from 2015-2020 provided by the Advanced Himawari Imager (AHI) onboard the Japanese Himawari-8 geostationary satellite positioned over 140.7°E were used to study spatial and temporal variability of the China Coastal Front (CCF) in the East China Sea. The hourly SST data were processed with the Belkin and O’Reilly (2009) algorithm to generate long-term mean monthly maps of SST gradient magnitude (GM) and frontal frequency (FM) using a GM threshold of 0.1°C/km. Horizontal structure of SST field in the vicinity of the CCF was investigated from cross-frontal distributions of SST along 8 parallels from 31°N to 24°N. The high resolution (2 km) monthly distributions of SST along these 8 parallels were used to determine inshore and offshore boundaries of the CCF and calculate the CCF strength defined as the total cross-frontal SST step dSST=Offshore SST – Inshore SST. The CCF emerges in November, fully develops in December and peaks in strength in January-February. The front’s fragmentation and shrinking/weakening begins in February and March, respectively. In winter (December-February), the front’s strength dSST exceeds 5°C offshore the Zhejiang-Fujian coast and could be as high as 7.5°C when nearshore waters cool down to 7°C. In winter, the front’s strength decreases downstream from 31°N to 24°N. The CCF changes its physical nature as the seasons progress. In winter, the CCF is a water mass front between cold and fresh water coming from the north and warm and salty water coming from the south. In summer, the CCF becomes a coastal upwelling front maintained largely by southerly winds. In winter, the CCF’s cross-frontal structure in the SST field is ramp-shaped, with SST increasing monotonously in the offshore direction. In summer, the CCF’s cross-frontal structure in the SST field is V-shaped or U-shaped, featuring a minimum SST formed by cold upwelled water at some distance from the shore. Thus, the summer SST structure effectively consists of two fronts, a nearshore and offshore, with a minimum SST in-between. Across the inshore/offshore front, the SST decreases/increases in the offshore direction. The local bathymetry, especially the relatively steep shelf slope between 20-m and 50-m isobath, steers the front, which does not meander in winter offshore the Zhejiang-Fujian coast. As the cold season progresses, the front’s axis gradually shifts into deeper waters, from ~20 m to ~50 m.

Information-theoretically provable unique true random numbers, which cannot be correlated or controlled by an attacker, can be generated based on quantum measurement of vacuum state and universal-hashing randomness extraction. Quantum entropy in the measurements decides the quality and security of the random number generator (RNG). At the same time, it directly determines the extraction ratio of true randomness from the raw data, in other words, it obviously affects quantum random bits generating rate. In this work, we commit to enhancing quantum entropy content in the vacuum noise based quantum RNG. We have taken into account main factors in this proposal to establish the theoretical model of quantum entropy content, including the effects of classical noise, the optimum dynamical analog-digital convertor (ADC) range, the local gain and the electronic gain of the homodyne system. We demonstrate that by amplifying the vacuum quantum noise, abundant quantum entropy is extractable in the step of post-processing even classical noise excursion, which may be deliberately induced by an eavesdropper, is large. Based on the discussion and the fact that the bandwidth of quantum vacuum noise is infinite, we propose large dynamical range and moderate TIA gain to pursue higher local oscillator (LO) amplification of vacuum quadrature and broader detection bandwidth in homodyne system. High true randomness extraction ratio together with high sampling rate is attainable. Experimentally, an extraction ratio of true randomness of 85.3% is achieved by finite enhancement of the laser power of the LO when classical noise excursions of the raw data is obvious.

Antiphospholipid syndrome (APS) is characterized by venous or arterial thrombosis and/or adverse pregnancy outcome in the presence of persistent laboratory evidence of antiphospholipid antibodies (aPL). Preeclampsia (PE) complicates about 10-17% of pregnancies with APS. However, only early onset PE (< 34 weeks of gestation) belongs to the clinical criteria of APS. The similarities in the pathophysiology of early onset PE and APS emphasize an association of these two syndromes. Overall, both are the result of a defective trophoblast invasion and decidual transformation at early gestation. Women with APS are at increased risk for prematurity; the reasons are mostly iatrogenic due to placental dysfunction, such as PE or FGR. Interestingly, women with APS have also an increased risk for preterm delivery, even in the absence of FGR and PE and therefore not indicated but spontaneous. The basic treatment of APS in pregnancy is low-dose-aspirin and low-molecular- weight-heparin. Nevertheless, up to 20-30% of women develop complications at early and late gestation despite basic treatment. Several additional treatment options have been proposed, with Hydroxychloroquine (HCQ) being one of the most efficient. Additionally, nutritional interventions, such as intake of vitamin D have shown promising beneficial effects. Curcumin, due to its antioxidant and anti-inflammatory properties, might be considered as additional intervention as well.

This paper focuses on robust multi-criteria traffic network equilibrium problems with path capacity constraints. The concepts of robust vector equilibrium and robust vector equilibrium with respect to worst case are introduced, respectively. To generate a subset of robust vector equilibrium, an equivalent min-max optimization problem is constructed. In addition, a direct search algorithm, in which the step size without derivatives and redundant parameters, for solving this min-max problem is proposed. To find a subset of robust vector equilibrium with respect to worst case, an equivalent smoothing optimization problem based on a variant version of ReLU activation function is established. Numerical experiments are also presented to expound the advantages of the algorithms.

The main problem in pursuing multiple extended targets tracking is distinguishing the origins of the measurements. The association of measurements to the possible origins within the target’s extent is difficult, especially for the occlusions or the detection blind zone which cause the intermittent measurements. To solve the problem, a hierarchical network-based tracklets data association algorithm is proposed. At the low level, the min cost network flow model is used to extract possible tracklets from the divided measurement set. At the high-level, the trajectories are estimated from the tracks produced by the previous low level network. The experimental results show that the hierarchical network-based tracklets data association algorithm outperforms the JPDA and RFS-based method when the measurement is intermittently unavailable.

Load variations in any power system result in losses escalation and voltage drops. With the sensible and optimal allocation of distributed generators (DGs), these problems could be considerably mitigated. It has been seen in the priorly existing methods that ideally allocation of DGs has been carried out during fixed loads and constant power requirements. However, in real scenarios the loads are always variable and allocation of DGs must be done in accordance to the variations of the connected load. Therefore, the current paper addressed the aforementioned problem by distinctive optimal allocation of DGs for each variability of 24hour load horizon. However, the single exclusive solution is considered among all allocations of 24 hours. The min-max regret concept has been utilized in order to deal with such methodology. Altogether, 24 scenarios are analyzed wherein each scenario corresponds to a specific hour of the respective day. The optimal allocation of DGs in terms of their optimal sizing and placement has been carried out by using three algorithms including battle royal optimization (BRO), accelerated particle swarm optimization (APSO) and genetic algorithm (GA). The multi-objective optimization problem is evaluated on the basis of minimum value criterion of the multi-objective index (MO). MO comprises of active and reactive power losses and voltage deviation. Hence, in order to find robustness of proposed technique, Conseil international des grands réseaux electriques (CIGRE’s) MV benchmark model incorporating 14 buses has been considerably used as a test network. In the end the results of three proposed algorithms have been compared.