SRS: Spatial-tagged radio-mapping system combining LiDAR and mobile-phone data for indoor location-based services

One of the most challenging issues in radio received signal strength (RSS)-based localization systems is the generation and distribution of a radio map with a coordinate system linked with spatial information in a large indoor space. This study proposes a novel spatial-tagged radio-mapping system (SRS) that effectively combines the heterogeneous properties of LiDAR and mobile phones to simultaneously perform both spatial and radio mappings. The SRS consists of synchronization, localization, and map building processes, and enables real-time spatial and radio mapping. In the synchronization process, the distance range, motion data, and radio signals obtained through the LiDAR and mobile phone are collected in nodal units according to the sensing time. In the localization process, a feature variance filter is used to control the number of features generated from LiDAR and estimate the positions at which the nodes are generated in real time according to the motion data and radio signals. In map building, the estimated positions of the nodes are used to extract spatial and radio maps by using a unified location coordinate system. To ensure mobility, the SRS is manufactured in the form of a backpack supporting LiDAR and a mobile phone; the usefulness of the system is experimentally verified. The experiments are performed in a large indoor shopping mall with a complex structure. The experimental results demonstrated that a common coordinate system could be used to build spatial and radio maps with high accuracy and efficiency in real time. In addition, the field applicability of the SRS to location-based services is experimentally verified by applying the constructed radio map to well-known fingerprinting algorithms using the heterogeneous mobile phones.     

Modeling unaccounted-for gas among residential natural gas consumers using a comprehensive fuzzy cognitive map

Residential natural gas consumption depends on several factors. Available tools and methods to identify, categorize, and validate effective factors have some limitations, making consumption modeling more complex. Once a comprehensive model of effective consumption factors is developed for residential gas consumers, it can predict consumption. In addition, such a model could be used to verify the accuracy of measuring devices in order to reduce unaccounted for gas (UFG). The key factors affecting residential gas consumption were identified based on previous studies and their mutual effects were analyzed using a fuzzy cognitive mapping (FCM) method. The most significant factors and their effects on natural gas consumption in the residential sector were determined. In this study, for the first time, the expected consumption for each consumer was estimated using a consumption index. Generally, if the estimated consumption is significantly different from the amount recorded by the meter, it could suggest a potential source of UFG. The proposed method was applied to the data collected from the residential gas consumers of a small region in Iran (Dasht-e Arjan region, Fars province), and the results demonstrate the effectiveness of the proposed method.     

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)).     

Parallel chaos optimization algorithm with migration and merging operation

Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm.     

综放高瓦斯矿井煤层瓦斯涌出量综合预测

为了成功预测竹林山煤矿综放高瓦斯矿井大采高工作面煤层瓦斯涌出量,以主采3号煤层为主要研究对象,针对3号煤层以往开采情况,通过布设测点测量其煤层瓦斯含量和了解相邻矿井瓦斯含量,采用分源预测法、回归法及统计法等预测方法得到了3号煤层瓦斯含量的分布规律,并绘制了3号煤层的瓦斯含量等值线图。对矿井不同生产时期的瓦斯含量进行预测,得到了生产前期、中期及后期采区的最大绝对瓦斯涌出量和最大相对瓦斯涌出量,说明了竹林山煤矿各个时期均属于高瓦斯矿井。     

Genetic algorithm and self organizing map based fuzzy hybrid intelligent method for color image segmentation

The grouping of pixels based on some similarity criteria is called image segmentation. In this paper the problem of color image segmentation is considered as a clustering problem and a fixed length genetic algorithm (GA) is used to handle it. The effectiveness of GA depends on the objective function (fitness function) and the initialization of the population. A new objective function is proposed to evaluate the quality of the segmentation and the fitness of a chromosome. In fixed length genetic algorithm the chromosomes have same length, which is normally set by the user. Here, a self organizing map (SOM) is used to determine the number of segments in order to set the length of a chromosome automatically. An opposition based strategy is adopted for the initialization of the population in order to diversify the search process. In some cases the proposed method makes the small regions of an image as separate segments, which leads to noisy segmentation. A simple ad hoc mechanism is devised to refine the noisy segmentation. The qualitative and quantitative results show that the proposed method performs better than the state-of-the-art methods.     

[Zr0.73(Cu0.59Ni0.41)0.27]87Al13合金过冷液相区热塑性成形研究

为探究[Zr_(0.73)(Cu_(0.59)Ni_(0.41))_(0.27)]_(87)Al_(13)非晶合金的热塑性成形性能以及绘制其对应的热加工图谱,用Gleeble3500型热模拟压缩实验机对该非晶合金进行不同参数下的热模拟压缩实验。结果表明,合金在压缩过程中变形行为由牛顿流变演变为非牛顿流变;同时,过高或过低的热加工温度均能导致合金晶化;进一步对数据分析得到该合金在不同热塑性成形参数下的功率耗散图与流变失稳图,并绘制出相应的热加工谱图,谱图分析结果表明,该合金在温度为420与430℃、应变速率为10~(-3) s~(-1)时具有较高功率耗散系数且没有失稳区域,因此,合金可选的热塑性加工参数为温度420～430℃,应变速率10~(-3) s~(-1)。     

The organization of biological sequences into constrained and unconstrained parts determines fundamental properties of genotype–phenotype maps

Biological information is stored in DNA, RNA and protein sequences, which can be understood as genotypes that are translated into phenotypes. The properties of genotype–phenotype (GP) maps have been studied in great detail for RNA secondary structure. These include a highly biased distribution of genotypes per phenotype, negative correlation of genotypic robustness and evolvability, positive correlation of phenotypic robustness and evolvability, shape-space covering, and a roughly logarithmic scaling of phenotypic robustness with phenotypic frequency. More recently similar properties have been discovered in other GP maps, suggesting that they may be fundamental to biological GP maps, in general, rather than specific to the RNA secondary structure map. Here we propose that the above properties arise from the fundamental organization of biological information into ‘constrained'' and ‘unconstrained'' sequences, in the broadest possible sense. As ‘constrained'' we describe sequences that affect the phenotype more immediately, and are therefore more sensitive to mutations, such as, e.g. protein-coding DNA or the stems in RNA secondary structure. ‘Unconstrained'' sequences, on the other hand, can mutate more freely without affecting the phenotype, such as, e.g. intronic or intergenic DNA or the loops in RNA secondary structure. To test our hypothesis we consider a highly simplified GP map that has genotypes with ‘coding'' and ‘non-coding'' parts. We term this the Fibonacci GP map, as it is equivalent to the Fibonacci code in information theory. Despite its simplicity the Fibonacci GP map exhibits all the above properties of much more complex and biologically realistic GP maps. These properties are therefore likely to be fundamental to many biological GP maps.     

Non-chaotic and chaotic propagation of stationary and dynamic images through MVKS turbulence

Anisoplanatic electromagnetic (EM) propagation across a turbulent atmosphere has been recently examined for an unmodulated carrier propagating over an image-bearing transparency through optical lensing, and for the embedded information inside a carrier recovered using heterodyning and digital demodulation. Carrier modulation yielded better recovery than simple lens-based imaging. A possible mitigation strategy is proposed whereby the image information is encrypted on an RF chaotic carrier, thereafter secondarily embedded onto an optical carrier. Results based on the modified von Karman (MVKS) and the Hufnagel-Valley (H-V) models showed that the signal/image recovery under turbulence is improved compared with non-chaotic propagation. The case of time-varying/dynamic images is also taken up; it is demonstrated via cross-correlation products that turbulence is mitigated by the use of chaotic carrier encryption. Overall, transmission via chaos offers mitigation against distortions due to turbulence along with the security feature inherent via the chaos keys which prevent signal recovery without key-matching.     

地统计克立格插值法在工程土方计算中的应用

土方计算是工程中经常碰到的问题。尝试利用地统计学的克立格插值法来计算土方，将其应用于余姚市泗门镇土地整理工程中进行实测试验。介绍了其基本的原理和公式，并与利用数字高程模型计算得到的土方工程量进行了比较，发现地统计插值法可较精确地确定设计标高和土方量，证明该方法的可行性和优越性。