基于全U网络的混凝土路面裂缝检测算法

针对现有的混凝土裂缝检测算法在各种复杂环境中检测精度不够、鲁棒性不强的问题,根据深度学习理论和U-net模型,提出一种全U型网络的裂缝检测算法。首先,依照原U-net模型路线构建网络;然后,在每个池化层后都进行一次上采样,恢复其在池化层之前的特征图规格,并将其与池化之前的卷积层进行融合,将融合之后的特征图作为新的融合层与原U-net网络上采样之后的网络层进行融合;最后,为了验证算法的有效性,在测试集中进行实验。结果表明,所提算法的平均精确率可达到83.48%,召回率为85.08%,F1为84.11%,相较于原U-net分别提升了1.48%,4.68%和3.29%,在复杂环境中也能提取完整裂缝,保证了裂缝检测的鲁棒性。     

Secure image encryption scheme using 4D-Hyperchaotic systems based reconfigurable pseudo-random number generator and S-Box

This paper introduces the design of a hardware efficient reconfigurable pseudorandom number generator (PRNG) using two different feedback controllers based four-dimensional (4D) hyperchaotic systems i.e. Hyperchaotic-1 and -2 to provide confidentiality for digital images. The parameter's value of these two hyperchaotic systems is set to be a specific value to get the benefits i.e. all the multiplications (except a few multiplications) are performed using hardwired shifting operations rather than the binary multiplications, which doesn't utilize any hardware resource. The ordinary differential equations (ODEs) of these two systems have been exploited to build a generic architecture that fits in a single architecture. The proposed architecture provides an opportunity to switch between two different 4D hyperchaotic systems depending on the required behavior. To ensure the security strength, that can be also used in the encryption process in which encrypt the input data up to two times successively, each time using a different PRNG configuration. The proposed reconfigurable PRNG has been designed using Verilog HDL, synthesized on the Xilinx tool using the Virtex-5 (XC5VLX50T) and Zynq (XC7Z045) FPGA, its analysis has been done using Matlab tool. It has been found that the proposed architecture of PRNG has the best hardware performance and good statistical properties as it passes all fifteen NIST statistical benchmark tests while it can operate at 79.101-MHz or 1898.424-Mbps and utilize only 0.036 %, 0.23 %, and 1.77 % from the Zynq (XC7Z045) FPGA's slice registers, slice LUTs, and DSP blocks respectively. Utilizing these PRNGs, we design two 16 × 16 substitution boxes (S-boxes). The proposed S-boxes fulfill the following criteria: Bijective, Balanced, Non-linearity, Dynamic Distance, Strict Avalanche Criterion (SAC) and BIC non-linearity criterion. To demonstrate these PRNGs and S-boxes, a new three different scheme of image encryption algorithms have been developed: a) Encryption using S-box-1, b) Encryption using S-box-2 and, c) Two times encryption using S-box-1 and S-box-2. To demonstrate that the proposed cryptosystem is highly secure, we perform the security analysis (in terms of the correlation coefficient, key space, NPCR, UACI, information entropy and image encryption quantitatively in terms of (MSE, PSNR and SSIM)).     

Multiple clusterings of heterogeneous information networks

Machine Learning - Traditional clustering algorithms focus on a single clustering result; as such, they cannot explore potential diverse patterns of complex real world data. To deal with this...     

Heterometallic sulfide cluster [Ag6Sn6S20]10 −: Solvothermal syntheses and characterizations of silver thiostannates with lanthanide complex counter cations

Novel organic hybrid silver thiostannates [Hen]₄[Ln(en)₄]₂[Ag₆Sn₆S₂₀]·3en (Ln = Er, 1; Tm, 2; Yb, 3) were prepared by the reactions of Ln₂O₃, Ag, Sn and S in ethylenediamine (en) under solvothermal conditions. Six SnS₄ tetrahedra and six AgS₃ triangles are connected into the heterometallic sulfide cluster [Ag₆Sn₆S₂₀]^10 − via edge-sharing. In the [Ag₆Sn₆S₂₀]^10 − cluster, a hexanuclear Ag₆S₆ core is enclosed by two Sn₃S₁₀ fragments. The Ag₆S₆ core is the first As–S cluster stabilized by inorganic SnS₄ ligands. In 1–3, all Ln^3 + ions are in 8-fold coordination environments that involved four bidentate en ligands, forming bicapped trigonal prisms. Compounds 1–3 show well-defined absorption edges with band gaps in the range of 2.18–2.47 eV.     

Hierarchical multi-reservoir optimization modeling for real-world complexity with application to the Three Gorges system

High dimensionality in real-world multi-reservoir systems greatly hinders the application and popularity of evolutionary algorithms, especially for systems with heterogeneous units. An efficient hierarchical optimization framework is presented for search space reduction, determining the best water distributions, not only between cascade reservoirs, but also among different types of hydropower units. The framework is applied to the Three Gorges Project (TGP) system and the results demonstrate that the difficulties of multi-reservoir optimization caused by high dimensionality can be effectively solved by the proposed hierarchical method. For the day studied, power output could be increased by 6.79 GWh using an optimal decision with the same amount of water actually used; while the same amount of power could be generated with 2.59 × 10⁷ m³ less water compared to the historical policy. The methodology proposed is general in that it can be used for other reservoir systems and other types of heterogeneous unit generators.     

An adaptive image steganographic scheme based on Noise Visibility Function and an optimal chaotic based encryption method

Steganography is the science of hiding secret message in an appropriate digital multimedia in such a way that the existence of the embedded message should be invisible to anyone apart from the sender or the intended recipient. This paper presents an irreversible scheme for hiding a secret image in the cover image that is able to improve both the visual quality and the security of the stego-image while still providing a large embedding capacity. This is achieved by a hybrid steganography scheme incorporates Noise Visibility Function (NVF) and an optimal chaotic based encryption scheme. In the embedding process, first to reduce the image distortion and to increase the embedding capacity, the payload of each region of the cover image is determined dynamically according to NVF. NVF analyzes the local image properties to identify the complex areas where more secret bits should be embedded. This ensures to maintain a high visual quality of the stego-image as well as a large embedding capacity. Second, the security of the secret image is brought about by an optimal chaotic based encryption scheme to transform the secret image into an encrypted image. Third, the optimal chaotic based encryption scheme is achieved by using a hybrid optimization of Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) which is allowing us to find an optimal secret key. The optimal secret key is able to encrypt the secret image so as the rate of changes after embedding process be decreased which results in increasing the quality of the stego-image. In the extracting process, the secret image can be extracted from the stego-image losslessly without referring to the original cover image. The experimental results confirm that the proposed scheme not only has the ability to achieve a good trade-off between the payload and the stego-image quality, but also can resist against the statistics and image processing attacks.     

Distributed wireless power transfer in sensor networks with multiple Mobile Chargers

We investigate the problem of efficient wireless power transfer in wireless sensor networks. In our approach, special mobile entities (called the Mobile Chargers) traverse the network and wirelessly replenish the energy of sensor nodes. In contrast to most current approaches, we envision methods that are distributed and use limited network information. We propose four new protocols for efficient charging, addressing key issues which we identify, most notably (i) what are good coordination procedures for the Mobile Chargers and (ii) what are good trajectories for the Mobile Chargers. Two of our protocols (DC, DCLK) perform distributed, limited network knowledge coordination and charging, while two others (CC, CCGK) perform centralized, global network knowledge coordination and charging. As detailed simulations demonstrate, one of our distributed protocols outperforms a known state of the art method, while its performance gets quite close to the performance of the powerful centralized global knowledge method.