- EI核心期刊
The validity of the expressions of the full-cosmic-scope wave-particle duality in the bivergentum theory previously proposed by the author is reviewed, the wave property and the particle property of bivergentums, the abstracted existences of the real physical objects in microscopic, mesoscopic and macroscopic regimes, are intensively investigated and the new conclusion is worked out, i.e. the natural measure of the wave-property level should be the energy residing in unity frequency or the momentum residing in unity wave-number and the natural measure of the particle-property level should be the frequency corresponding to unit energy and the wave-number corresponding to unit momentum. Moreover, a new point of view that the full-cosmic-scope quantization variable takes its minimum value at the macroscopic limit is proposed and the definitions of the "bipolar-ly normalized" wave-property level as well as the same kind of partical-property level are given so that the understanding of the full-cosmic-scope wave-particle duality is improved. Afterwards, the full-cosmic-scope uncertainty principle proposed by the author is modified according to the new point of view. Meantime, the understanding of symitons (a kind of matters predicted by the author) is deepened, the inevitability and the basic rules of the mutual conversion between photons and symitons are pointed out, the quantitative relation between the upper and lower limits of the full-cosmic-scope quantization variable is derived, three typical physical processes, i.e. the spontaneous emission, the stimulated emission and the stimulated absorption, have been interpreted upon the new basis, the relevant fourth physical process is predicted, and the extended Einstein relations including all the four physical processes are given. Consequently, the probabilities of the "lasing" of symitons and the realization of "super-slow light" are deduced. Finally, it is assumed that the probability-wave behavior of every bivergentum originates from the vacuum fluctuation of quantum field. All these works make the bivergentum theory improved towards perfect, and the theory on the mutual interaction between light and matters is extended to the theory on the multi-factor interaction between photons, symitons and matters.
Image registration based on key-point mappings usually provides alignment of integer-pixel precision. Sub-pixel registration is of great challenge to the technique exploiting key-point mappings. The authors proposed an interactive algorithm to address the sub-pixel registration problem. The proposed algorithm comprises two steps,the first step is to input control points and is getting a rough registration by using projection transform and linear least square algorithm, the second step is to adjust the control points with sub-pixel step. The average distance of control points was applied to quantitatively measure registration quality. The evaluation method combined with subjective and objective judgment was used. Experiment shows that the proposed algorithm can achieve sub-pixel registration result. The performance will be more reliable than other registration technique using scale invariant feature transform and partial intensity invariant feature descriptor, and also the performance of multimodal image registration gets significantly improved.
The in-network caching of information centric networking (ICN) can offer help to the massive contents distributions efficiently, the ease link congestion and the traffic redundancy reductions. Traditional caching policies are not conducive to raise content diversity of the whole network and average hit rate of cache nodes. The existing research can solve the problems to some extent, and achieve fair content flow multiplexing, however, almost no consideration of collaboration between nodes is adopted, which directly results in uneven utilization of cache nodes. To solve these problems, study on influence of caching status between neighbor nodes was made, and a cooperative caching strategy based on correlation probability in ICN was presented. Cache node will make caching decision based on the information of path and its neighbor node, so it can control the caching redundancy. Simulation shows that this method can ease the server load, and enrich the content diversity of the whole network. It is of benefit to improve the hit rate of nodes in complex network, and reduce the number of hops.
Most research of Android software protection focuses on how to protect the Dalvik bytecode program. However, the security of native program has not been paid enough attention. In order to prevent possible attacks for Android native program, a protecting method was proposed. By inserting multiple redundant data and integrity check code into the source code, the native program will have abilities to resist dynamic tampering. It also can resist disassembling attack by combining with code encryption technology. Experiment shows that this method can protect the Android native program effectively when attacker tries to crack it by dynamically altering program code or disassembling the program.
A blind watermarking algorithm with strong crop and noise resistibility based on quick response (QR) code for remote sensing image was presented. Firstly, QR code image is generated by use of copyright authentication information. Secondly, the QR code image is scrambled based on Arnold transforms, while the error-correction coding method is introduced to pretreat the watermark image. Finally, considering the properties of the data of remote sensing image, the appropriate strength and position are selected to embed watermark. Watermark detection is the inverse process of embedding watermark. Watermark detection is the inverse process of embedding a watermark, and the majority rule is used to extract and self-correct the watermark information bits. The introduction of QR code effectively enhances the capacity and robustness of the watermark information. Embedded watermark based on the premise of keeping the accuracy of features and statistical properties of remote sensing images was studied. The embedded watermark is not only of good invisibility, but also of strong crop and noise resistibility.
The problem of path invalid or path expired caused by best-effort model transmitting of groups commands under continuously changed Internet parameters comes into notice recently. A new group dynamics genetic algorithm was proposed. The algorithm takes into account the problem from static search and dynamic search. The advantage of the algorithm is keeping astringency short of traditional genetic algorithm. Experiments show that the performance of the algorithm is better than the used algorithms.
A model of the modified Chua's chaotic system was constructed to produce multi-scroll chaotic attractors,replacing the typical Chua's diode with the sign function in the typical Chua's circuit. The method is to make equilibrium point located in the center of two adjacent breakpoints,and keep scrolls and bond orbits alternated with each other. Both model analysis and Matlab simulation show that the system generates 10 scrolls chaotic attractors. Finally,the design of the hardware circuit produces at a maximum of 10 scrolls hardware experimental results. Hardware experiments,analysis and simulation are almost accordance, which further proved the existence of the system.
The impact of selfishness on edge autonomous systems under transit-edge separated Internet was analyzed, and an incoming traffic engineering model based on coalition games was proposed. This model uses network cost as evaluation metrics for incoming traffic engineering performance and establishes relationship as well between network cost and revenues of Internet service provider when this edge autonomous systems(AS) is operating. The coalition achieves maximum revenues by decreasing network cost of the edge AS. Furthermore, the characteristic of coalition was illustrated, followed by the revenue allocation method based on SHAPLEY value. Simulation shows that the incoming traffic engineering based on coalition games can decrease network cost of edge ASes, and the revenue allocation method based on SHAPLEY value is fair to edge ASes joining the core of the coalition. Besides, it is shown that the relationship between revenues and network cost affects the result whether edge ASes can form a coalition.
The energy-saving methods are infrequent on hybrid energy supplies, a new energy-saving management mechanism from cell viewpoint was proposed. The mechanism firstly constructs energy-saving optimization model with hybrid energy supplies and modeling evaluation method for service quality. To resolve the optimization model, a regional energy-saving algorithm from the perspective of cell compensation was analyzed thereafter. Through simulations under urban universal mobile telecommunications system scenarios, it is shown that the mechanism can keep coverage and service quality on acceptable levels, reduce regional interference distributions, and saving about 34% energy for power grid, which takes on significant green economic importance.
For face recognition system used in real-time application,the image feature representation should not only have high discriminative capability,but also the low dimensionality. A new face image representation-local Gabor spatial histogram based on the dominant neighboring pixel (LGSH-DNP) was proposed. Firstly,the face image is filtered by the Gabor filter bank. Each pixel of the resulted filtered images is labeled by the positions of the two neighboring pixels with the highest values,resulting in multiple descriptor images. Secondly,the spatial histogram is extracted from these descriptor images. Finally the weighted intersection histogram similarity measure is used to realize face classification. Extensive experiments are performed on face recognition technology face image database. It verifies the effectiveness of the proposed LGSH-DNP method.
A fast advanced encryption standard (AES) encryption method based on one lookup table for resource-constrained industrial wireless network was presented. A 512-Byte lookup table was constructed by compressing and optimizing the lookup table of the widely used method based on four 1KB lookup tables, It decreases the storage of lookup table and the overhead consumed by the GF(28) multiplications; the round function was optimized as well, decreasing the additional operations caused by the compressed lookup table. Experiment shows that this method saves 72% at the cost of 43% more computation time and power compared with the method based on four 1-KB lookup tables; and saves 55% computation time and 61% power at the cost of 2.5 folds storage consumption compared with the method based on the accelerator on radio chips.
Event area detection is one of the most important applications in complex environment for wireless sensor networks. The nodes in the networks may have faults due to many uncertainty factors (such as temperature, humidity, hardware etc.), which will reduce event detection quality. Considering the spatial correlation for the sensing information of neighboring sensors, a belief model based on network topology was proposed. A Bayesian fault tolerance model was further constructed by synthesizing sensor's own information and its neighbor nodes' information. The model can predict the probability as well as the optimum threshold on whether the event happens. The node makes the final decisions by comparing the two probability values. Simulations show that compared with the optimal threshold decision scheme, the proposed scheme can increase the percentage of the corrected nodes from 65% to 78% when node fault probability is 25%. The scheme can also increase the percentage of the corrected nodes from 50% to 70% when the node fault probability is 30% that reflects better fault-tolerance performance.
Coordinated multi-point transmission/reception(CoMP) is favored in long term evolution advanced (LTE-A) due to its capability in reducing the inter-cell interference and enhancing the throughput for cell-edge users significantly. Aiming at the downlink precoding matrix design for multi-user multi-point joint transmission, the maximization of the average received signal to interference plus noise ratio (SINR) was formulated as optimization problem. By deriving the regularization matrix pencil with the statistical autocorrelation matrix of the prior channel state information matrix, the noise matrix, the multi-user interference matrix and the joint transmission precoding matrix design problem were further translated into the derivation of generalized eigen matrix. The resulting scheme to design the precoding vector maximizes the user equipment SINR by maximizing the beamforming gain and minimizing the multi-user interference and the inter-strings interference. Simulation confirms that the proposed precoding scheme offers significant throughput enhancement with coordinated beamforming gain, as well as good robustness.
The road network capacity lays foundation of the intelligent transportation systems for developing the carrying capacity of road networks; it's no doubt important for traffic control, traffic guidance and traffic demand management. However, the existed work can not entirely solve the problem of real-time calculation of road network capacity, however, it is difficult to control the actual operation traffic flow by traditional road network algorithm, which is a theoretical calculation based offline processing or a survey carried out by manual. A new road network capacity method was proposed based on the vehicular self organization network based immune network theory. The theory completes communication link detections between vehicles and infrastructure, and then the antigen-antibody statistics can be performed for computing vehicles in the network when thinking the principle of antibody recognized antigen. The proposed method not only solves the real-time problem, but also solves the problem of the traditional methods requirements to establish an accurate mathematical model. Finally, an actual road network was selected for experimental verification. Experiments are very close to the capacity obtained with the traditional, and prove the effectiveness of the proposed method.
In orthogonal frequency division multiplexing (OFDM) systems, the validity and accuracy of symbol timing synchronization is seriously impacted by narrowband interference that cannot be eliminated by conventional algorithms. To improve the performance, a new timing metric was proposed with help of a scrambling operation to the preamble symbol in Park's algorithm. Simulations are carried out in TU-6 multipath channel under the narrowband interference. It is shown that the improved algorithm successfully obtains the needed sharp correlation peak to realize accurate timing synchronization. Furthermore, with increase of the number of sub-carriers, the anti-narrowband-interference performance can be obviously promoted. In addition, the improved algorithm also reduces the size of the correlation sub-peaks, which improves the anti-noise performance.
For being not falling in as final targets of attackers, the critical resources in network environments should be protected. It is vital to quantify the threat and impact during the process of multi-stage attacks. Aiming at combine threat quantification of individual attack action and significance value of hosts, as well as large amount of attack dependencies in attack graphs, a methodology for threat evaluation was proposed. The bi-directional threat evaluation presented in this article is able to compute progress attackers already, as well as the threat to goal-resources in attack graph, which can be well applied to real-time attack threat evaluation. The proposed was finally verified in experiment and simulation.
Considering that the nodes with limited energy are prone to be failure in wireless sensor networks and introducing energy and node degree adjustment parameters, an energy efficient scale-free topology model was constructed based on the complex network theory. The node residual energy is limited according to node radius and topological index can be changed within with full consideration of the factors such as the node residual energy and the node degree. Analysis on the topology dynamic behavior and simulation afterwards show that this model has power rate characteristics of scale-free networks and good fault tolerance and the energy balance characteristics.
An improved adaptive multi-particles simulated annealing (AMSA) was proposed to solve high-dimensional optimization problem. Thinking of multi particles, this new algorithm divides the entire high-dimensional space into several parts randomly as well as operates local annealing independently. Currently, when each local reaches steady state, with temperature decreasing, the particles are self-adaptively reduced for less complexity based on the relationship of the particles and their status. Consequently, AMSA can be used to settle high-dimensionally optimizing (universal mobile telecommunications system) automatic cell planning issue. Simulation shows that compared to other heuristic algorithms, it is good to settle high-dimensionally optimizing issue, and AMSA algorithm can achieve better results within a predetermined time.
Conventional lattice reduction aided Tomlinson-Harashima precoding (LRA-THP) is acknowledged complexity. A low-complexity precoding algorithm was proposed for multi-beam satellite systems. Users are grouped based on the distance between them in the proposed algorithm. Then, the matrix inversion and QR decomposition are used to calculate the preprocessing matrix by which the inter-group interference is suppressed. During calculation, the characteristic of multi-beam satellite systems is exploited to reduce the dimension of the preprocessing matrix and the computational complexity can be decreased further by this step. The LRA-THP is employed in each group to eliminate the residual interference. Simulations show that the proposed algorithm can reduce the complexity over the conventional LRA-THP by 92.5% while the performance loss is about 0.2 dB. In addition, compared with the existing group precoding algorithm, the proposed algorithm can achieve the similar performance and has a 69.7% reduction in the computational complexity. The low complexity and flexibility of the proposed algorithm is of higher practical value.
In order to improve the image quality of the decoded WZ (Wyner-Ziv) frame in distributed video coding system,WZ frame reconstruction technology based on generalized Gaussian distribution (GGD) was proposed. The correlation between the side information and the original WZ frame was considered as well. GGD was used for virtual correlation channel model so as to improve the rate distortion (RD) performance. Meanwhile,the condition expectation of the WZ was computed as the reconstructed WZ value for the given quantization interval and the known side information in which GGD is used as correlation noise model. The shape parameter of GGD is fixed to 0.5 so that it won't add extra complexity to the reconstruction technology. The closed-form expression of the optimal reconstructed values was derived. Experiments indicate that the proposed WZ frame reconstruction technology can improve the RD performance and image quality of the decoded WZ frame.
A band rendering method for electromagnetic environment was presented. The electromagnetic environment is represented by electromagnetic radiation power density of radars, when the data band computing is carried, a volumetric data for all bands is got. The volumetric data was then divided into sub-regions for each band based on each radar effect. Ray casting algorithm was used to render electromagnetic environment in which the transfer function was expressed as a set of color lookup tables for each band, different band has different color. Among all color lookup tables, there are some same colors for rendering the combined effects of all bands. A real-time rendering method was carried out using compute unified device architecture. Experiments show that the rendering images can display the distribution of bands and the combined effects of all bands for electromagnetic environment, and are helpful for understanding the electromagnetic environment intuitively.
Vehicular Ad hoc networks (VANETs) have been attracted attentions to the research area for solving the increasingly serious problem of traffic congestion as well as the improving road safety. Besides vehicles with communication capabilities,VANETs also include infrastructure such as roadside units (RSU) which serves as access points. RSU plays animportant role invehicle-to-infrastructurecommunication. The deployment strategies of RSU are critical and should be carefully studied in VANETs. In order to effectively enhance the network performance, the RSU deployment problem was studied under the realistic vehicular mobility traces. A large scale urban vehicular mobility traces in Beijing has been collected, and the method of interpolation has been used to preprocess the traffic traces collected in Beijing; a new RSU deploymentalgorithm that considering both the centricity and uniformity was proposed to deploy RSU in VANETs to optimize the total performance of the network. Realistic vehicular mobility trace-driven simulation experiments show that the new algorithm caneffectively enhance the network performance.
The electric power communication network system as an important information infrastructure of electric system requires high transmission reliability. However, it lacks a clear definition of system reliability and a quantitative measure of the criterion. This article briefly introduced application of transmission performance damage assessment technology in power telecommunication networks, and pointed out the importance of the transmission link damage assessment. The authors used the optical pulse broadening as the evaluation index and calculated the optical pulse broadening to estimate the system transmission penalty. The binary polynomial fitting is used to obtain a more accurate assessment of the linear empirical formula. It was verified by comparing with different simulation parameters to have good feasibility and effectiveness.