最新刊期
卷 43 ， 期 8 ， 2015
- 摘要：The identification efficiency of a RFID system decreases when a reader attempts to identify a large number of tags, because a collision occurs.Dynamic slots collision tracking tree algorithm (DSCTTA) reduces the prefix and iteration overhead by using time-divided responding scheme, meanwhile a lot of idle time slots are generated.In this paper, an improved dynamic slots collision tracking tree anti-collision algorithm (IDSCTTA) is proposed to prevent the tag collision by combining DSCTTA with bits change method (BCM).IDSCTTA not only has all the advantages of DSCTTA, but also can suppress the generation of idle slots therefore improve the system throughput and reduce the identification delay.Simulation results show that, IDSCTTA can effectively reduce the identification delay and improve the slot efficiency.And the greater the number of tags is, the better the algorithm performance is.关键词：RFID(radio frequency identification);anti-collision;collision tracking tree;idle slot;bits change method3|5|0更新时间：2025-07-16
- 摘要：This paper presents a novel dynamic fault-tolerant scheduling model for real-time tasks on multiple observation satellites.In this model, the primary/backup policy is employed to tolerate one satellite's permanent failure at one time instant.On the basis of the fault-tolerant model, we propose a novel fault-tolerant satellite scheduling algorithm called FTSS.To improve the resource utilization, the overlapping technology is adopted.According to the satellite feature with time windows, we analyze the overlapping mechanism on satellites and combine them into FTSS.In addition, the FTSS employs the task merging strategies that are used to decrease the task count needed to execute and thus further enhance the schedulability.To demonstrate the superiority of our FTSS, we conduct simulation experiments to compare FTSS with three baseline algorithms.The experimental results indicate that FTSS efficiently improves the scheduling quality of others and is suitable for satellite fault-tolerant scheduling.4|2|5更新时间：2025-07-16
- 摘要：Bilingual named entity recognition and alignment are important for many natural language processing.Named entity translation can improve a lot the performance of the system like statistical machine translation or cross-language information retrieval.Quality of Chinese word segmentation does have a big impact over named entity (NE) recognition and bilingual NE extraction.Bilingual alignment information provides indications for NE recognition and word segmentation.Accordingly, based on the characteristics of NE recognition, NE alignment, and word segmentation, this paper proposes an optimization algorithm of Chinese word segmentation.By correcting word segmentation error and adjusting word segmentation granularity, the optimization algorithm can enhance extraction effect of Chinese-English NE translation and performance of statistical machine translation.The experimental result on Chinese-English news corpus shows the efficiency of our algorithm.关键词：word segmentation;named-entity recognition;alignment;machine translation3|2|5更新时间：2025-07-16
- 摘要：Aiming at the difficulty of searching Pareto front for complex multi-objective optimization, a Memetic learning strategy which combines many of population preying-competition mechanism with reinforcement learning mechanism and evolutionary computation model was designed.Inspired by ecological principle, such as the population evolution and the competition between predator populations and prey populations, a multi-objective Memtic optimization algorithm (multi-objective Memetic algorithm based on ecological population preying-competition model, ECPM-MOMA) was proposed.In ECPM-MOMA, Preying-competition and Reinforcement Learning operator was designed and applied for global search.Memetic search operator was also applied for local search in the population evolution process.Experimental results show that the proposed algorithm has better convergence performance and distribution characteristics.The ecological preying-competition strategy and evolutionary computation model is effective for solving complex multi-objective optimization problems.关键词：multi-objective optimization;preying-competition;evolutionary algorithm;Memetic computation2|3|3更新时间：2025-07-16
- 摘要：L1 tracker is one of the most effective methods in dealing with the occlusions for sparseness of coding coefficients of objects.However, the existing sparse coding algorithms do not use special sparse structure of coding coefficients in L1 tracker.In this paper, we propose a two-stage sparse coding algorithm for visual tracking based on constrained sparsity of target template coefficients and spatial continuity structure of trivial template coefficients with block coordinate optimization theory.At the first stage, the algorithm solves sparsity-constrained coding coefficients on target template set using orthogonal matching pursuit.At the second stage, the algorithm finds sparse coding coefficients with spatial continuity on trivial template set via dynamic group sparse coding.Robust visual tracking is achieved using the proposed sparse coding algorithm in particle filter framework.The experimental results demonstrate that the proposed tracking method has better robustness and higher precision than the state-of-the-art trackers.关键词：L1 tracker;sparse coding;sparsity-constrained;spatial continuity structure2|3|3更新时间：2025-07-16
- 摘要：The non-negative matrix factorization (NMF) is widly used in data fusion for the advantage of feature extraction, and the particle filter (PF) is an effective method for the state estimation of non-linear and non-Gaussian dynamic systems.Therefore, an infrared small target tracking algorithm based on improved particle filter is proposed.Current and previous particle distribute weights are fused by NMF in order to reduce the precision error caused by particle divergence in classic PF method.So the tracking error of sheltered and disappeared target can be avoided.Experimental results show that the proposed method has better tracking precision and is more stability for small target tracking than the classic PF method.关键词：deep space;infrared small target tracking;particle filter;non-negative matrix factorization(NMF)2|2|7更新时间：2025-07-16
- 摘要：A detection algorithm of pitch modulation information hiding in G.729A low bit-rate speech codec is proposed.The analysis of speech stream showed that pith modulation information hiding would change the pitch symbiotic characteristics of adjacent speech frames.We designed a model to quantify these pitch symbiotic characteristics for steganalysis.However, the dimension of quantitative feature vector of pitch symbiotic characteristics was too high, so PCA (Principal Component Analysis) was employed to reduce the dimension of the feature vector.Finally, we built a pitch modulation information hiding detector based on the dimension reduced feature vector and SVM (Support Vector Machine) classifier.Experiments on different speech datasets show that the proposed steganalysis algorithm is very effective: the accuracy is more than 96% when speech length equals to or is greater than 2s.So this paper gives an effective method for compression domain information hiding detection.关键词：pitch modulation information hiding;symbiotic characteristics;steganography detection;principal component analysis (PCA);support vector machine (SVM)2|2|0更新时间：2025-07-16
- 摘要：The traditional segmentation method which is based on local information search technique gives little regard for the global information of the image and ignores the randomness and uncertainty of image segmentation.In view of this, this paper proposes a new segmentation method which is based on cloud model, graph theory and mutual information.Firstly, we could use the cloud model to reflect the uncertainty and randomness when pixel cluster into regions.Secondly, when the graph theory method is introduced into a quasi-optimal cut sets, we could obtain a globally optimal segmentation.Thirdly, by using the multidimensional characteristics which are showed by regional concept of cloud model, we could use a comprehensive heterogeneity measure to improve border weights, and therefore improve the ability to distinguish regional dissimilarity.From the experimental results, the proposed method can produce meaningful, complete and internal-homogeneity divided region, moreover, the segmentation accuracy can meet the basic human visual requirements.关键词：cloud model;wavelet denoising;harris operator;mutual information;graph theory;minimal spanning tree2|3|3更新时间：2025-07-16
- 摘要：To solve the engine parameter adjustment problem of cognitive radio networks, an artificial physics multi-objective optimization algorithm was proposed.According to its binary encoded features of cognitive parameters, Hamming distance based individual ranking method was designed and particle updated equation was improved, and finally the Pareto optimal set were achieved.Simulation results show that under the multi-carrier environment, the proposed algorithm can adjust transmission power and modulation mode according to the changing of channel and cognitive user demands.So it meets the demands for parameters optimization.关键词：artificial physics;multi-objective optimization;cognitive engine;parameters adjustments2|2|2更新时间：2025-07-16
- 摘要：Finding the shortest path in a graph is a fundamental operation that allows complex relationships discovering in a graph database.This paper considers top-k shortest-path queries on RDF(Resource Description Framework) graphs.To solve this problem, we provide a component-based index for path queries and present an approach to answer the top-k shortest-path query.To efficiently process queries, we propose frequent path strategy and structural pruning.For frequent path strategy, we precompute the top-k shortest-paths between frequent entities obtained from the frequent paths.For the structural pruning, we find out the termination condition for queries by considering the structural information of component-based index and derive two lemmas to guide this pruning mechanism.Experiments results show that the query runtime is improved by 92% using our answering approach and the construction time of our index for RDF graphs is speeded up by 56%.Meanwhile, the size of this index is only 0~0.2 times larger than that of the raw graphs.关键词：resource description framework(RDF) graph;shortest path query;graph database;Top-k;query processing4|2|0更新时间：2025-07-16
- 摘要：In order to improve the overall performance of multi-objective particle swarm optimization algorithm (MOPSO) in solving complicated multi-objective optimization problems, a multi-objective particle swarm optimization algorithm integrating multiply strategies (MSMOPSO) was proposed in the paper.A new initialization approach of combining uniformization and randomization was adopted in the MSMOPSO.Secondly, a disturbance item was added to the particle's velocity updating formula.Thirdly, a simplified k-nearest neighbor approach was applied to preserve the diversity of external archive.Finally, every non-dominated particle in the external archive was assigned the property of lifespan and the lifespan value would be adjusted dynamically during the run of the MSMOPSO.The experimental results illustrate that the proposed algorithm significantly outperforms the other five peer competitors in terms of GD, SP on ZDT and DTLZ test instances set.关键词：particle swarm optimization;integrating multiply strategies;multi-objective optimization problem;multi-objective particle swarm optimization algorithm2|2|17更新时间：2025-07-16
- 摘要：This paper proposes a mining algorithm of all-weighted positive and negative association rules based on dynamic item weight, which can solve the problems of negative patterns mining based on dynamic item weight.This algorithm took the dynamic item weight dependent on transaction records into consideration, and adopted the itemset pruning method and pattern evaluation framework so as to discover effective all-weighted positive & negative association rules via simple calculation and comparison of weight ratio and dimension ratio from the itemset.The experimental results show that this algorithm can prevent ineffective patterns, which makes the maximal declines of the mining time and number of the candidate itemsets by up to 94.09% and 88.16% respectively compared with the existing unweighted positive and negative association rule mining algorithms.关键词：data mining;all-weighted association rule;negative association rule;frequent itemset2|2|9更新时间：2025-07-16
- 摘要：Infeasible paths are one of the most important parts to cost the test resources.Before path testing, infeasible paths detecting in a program can save test resources efficiently.This paper presents a static method to detect infeasible paths which is based on sub-path expansion.First, the proposed method generates sub-path set, and the feasibility issues will be converted into inequalities.Second, the constraint solver is used to solve the inequalities, and then we can distinguish the sub-paths into three parts:one part is infeasible sub-paths, the second part is feasible sub-paths, and the third part is undetermined.The paths that are expanded from the latter two parts will be tested again to determine their feasibility.Eventually, the feasibility of all the paths is detected.Most of the detecting work is on sub-path set, so our method makes an effective solution to the path-explosion problem.Experimental results show that the proposed method can detect infeasible paths more accurately and effectively.关键词：software testing;sub-path expansion;infeasible path detection;constraint solving2|2|1更新时间：2025-07-16
- 摘要：Although users can self-generate personalized data for describing preferences more comprehensively, user-created data is not rigorous and uncontrollable, which leads to enormous data of low quality with serious noise.On managing complex network, more attentions should be placed on high quality information that has been or will be produced by experts who have knowledge in specific fields in order to avoid being restricted to written knowledge.This paper finds experts by constructing and analyzing interest profiles of users and proposes a screening method for detecting abnormal pseudo-experts.Due to the small number of authoritative experts in networks, which provide a limited amount of information, experts defined in this paper not only include authoritative experts, but also ordinary users that have a lot of knowledge in a certain field.Experiments illustrate the correctness and effectiveness of the algorithm, and the low complexity renders it suitable in handling massive user node information.关键词：expert finding;interest analysis;interest graph;complex network analysis2|2|2更新时间：2025-07-16
- 摘要：Aiming at the publication of weighted social networks, a random perturbation method based on vector similarity is proposed.It can protect network structures and edge weights in multiple release scenarios.It constructs vector set models by segmentation based on vertex cluster using edge space theory.It adopts weighted Euclidean distance as similarity metrics to construct the released candidate sets according to the threshold.It randomly selects vectors from candidate sets to construct the published weighted social networks.The proposed method can resist multiple vertex recognition attacks, force attackers to re-identify in a large result set that the existential probabilities of the vectors are same, and increase the uncertainty of recognition.The experimental results demonstrate that it can preserve individuals' privacy security, meanwhile it can protect some structure characteristics for networks analysis and improve data utility.关键词：social networks;edge weight;privacy preserving;vector set model;weighted Euclidean distance2|3|2更新时间：2025-07-16
- 摘要：With the unceasing expanding of network scale, many classic detection algorithms of overlapping communities cannot work efficiently in large-scale complex network.Detecting the overlapping community algorithm based on vital node expanding in parallel framework GraphLab (DOCVN) is introduced to identify the overlapping communities.In this algorithm, nodes with high PageRank value are regarded as vital nodes, and then the affiliation degree of other nodes to these vital nodes are computed.After that, kernel communities and expanding communities are identified respectively.Finally, the kernel communities and expanding communities are combined into some overlapping communities by judging whether they connect tightly.And the importance weight of each node in its community is also computed.Experimental results show that the algorithm is more effective than the existing parallel algorithms like PD (Propinquity Dynamics) to identify large-scale overlapping communities.关键词：large-scale complex network;GraphLab;overlapping community identification;social network;kernel community2|4|3更新时间：2025-07-16
- 摘要：A novel non-wearable human-computer interaction (HCI) method has been proposed based on facial orientation.An active shape model is employed to locate some feature points in the facial contour which can be able to overcome the effects of illumination and facial posture variation.Some redundant information can be simplified.Moreover, HCI can be made in a real time.After a 2D facial geometric model being built based on the maximal triangulation of facial contour features, a calibrated Kinect sensor is used to map the geometric model into 3D coordinate.In order to determine the interacting target, the normal direction of facial orientation is calculated dynamically by a temporal median filter.Non-wearable and natural HCI modal can be realized in which the user can move freely without wearing any equipment or auxiliary markers.Besides, the need of comfort and diversity can be met simultaneously during HCI.Experiment results indicate that the developed approach is efficient and can be used to natural non-wearable HCI.关键词：human-computer interaction;facial orientation;non-wearable;facial geometric model4|3|1更新时间：2025-07-16
- 摘要：In order to solve the problem of how to evaluate the trusted degree of the nodes in the resource-constrained and topology-changed Ad Hoc networks, a scheme for evaluation of Ad Hoc nodes based on trust degree calculation and triple thresholds control has been put forward, improving the previous literature on the node trust evaluation mechanism.The accusation-based threshold is adopted to hang on a suspect node rapidly.The trust degree calculation-based threshold is used to revoke a node only when its trust value has reached the threshold value preseted according to safety requirements.The warning-based threshold is set to limit a potentially suspect node to launch a series of continuous malicious accusations to a legitimate node.Analysis and simulations show that the proposed scheme overcomes node revocation arbitrarily in the previous schemes in which node revocation is based on the number of accusations.Triple thresholds ensure a rapid response to malicious nodes, quantification of node trust and more accurate revocation of malicious nodes;moreover, it prevents illegal nodes from accusing legitimate nodes in collusion and then avoids a wrong revocation.关键词：Ad Hoc networks;trust degree calculation;triple thresholds control;node revocation2|2|0更新时间：2025-07-16
- 摘要：An improved finite-difference time-domain (FDTD) scheme is presented to simulate wave propagation in general Davidson-Cole media.Four improvements are made in this paper:(1)extending to media with multiple relaxation times from ones with single relaxation time;(2)extending to magnetic media from nonmagnetic ones;(3)preserving the term of static ionic conductivity in the Davidson-Cole model;(4)supplementing an example for a three-dimensional (3D) problem.The main difficulty in this scheme is appearance of fractional derivatives.Firstly, the complex permittivity of the medium may be approximated by the Padé polynomials;then, a set of auxiliary differential equations (ADEs) of integer order are derived by the inverse Fourier transform (IFM), this difficulty is thus circumvented.The feasibility and validity of the presented scheme is preliminarily demonstrated by the results and analyses of several examples.3|2|0更新时间：2025-07-16
- 摘要：Based on typical polarization Monte Carlo model, this paper proposed a media concentration coefficient representation, and developed a 3D simulation system of the light scattering transmission in the different concentration media.The feasibility of the concentration coefficient, and the polarization properties of light scattering and transmission in the different concentration media are further analyzed.Simulation experimental results showed that, the proposed method can be used to represent the scattering media concentration coefficient in the typical polarization Monte Carlo model.Scattering media concentration directly affects the intensity of each component of the Stokes vector and degree of polarization.Each component intensity of Stokes vector is approximate to the exponential decay as the media concentration increases.Polarization degree is "inverted N" as the concentration coefficient increases during the light transmission in the scattering media.关键词：scattering;polarization properties;Monte Carlo;concentration coefficient4|3|4更新时间：2025-07-16
- 摘要：The transmission and reception of information in VANET has the property of randomness and uncertainty.Due to the inadaptability of IEEE 802.11p broadcast protocol to the dynamic changes of VANET topology, researchers proposed VANET broadcasting protocol on the basis of specific application requirements.Therefore, the key is how to analyze and verify the performance and reliability of the updated protocol.Automated quantitative verification can analyze the properties of the system requirements and provide the maximum or minimum probability.However, PTCL and rPATL are found not to precisely represent the strategies of the users in the quantitative verification process delivered by researchers.For this purpose, the method namely, ‘Quantitative Model Verification based on Probabilistic Strategy Logic' is proposed.Firstly, interval probabilistic timed interface automata are applied to model the behavior for each role in the system, then probabilistic strategy logic is adopted to describe the properties to meet the requirements and quantitative validation algorithm is given.Finally, the method is applied to the VANET information broadcast protocol.The proposed model can select a reasonable strategy revolving the external changes and analyze the maximum probability for a successful transmission of information broadcast.关键词：vchicular ad hoc networks(VANET);quantitative verification;probabilistic system based on roles;probabilistic strategy logic2|3|1更新时间：2025-07-16
- 摘要：In the continuous casting process, the internal temperature of billet is difficult to be measured real-time and the surface temperature is difficult to be measured accurately.The steady-state heat transfer models can't be used for simulation the actual casting operations which vary frequently.A real-time heat transfer model was developed, especially the influencing factors of model were analyzed.Considering the interference of scales which strip randomly on the billet surface to the temperature measurement, the CCD (charge coupled device) surface temperature measurement system was developed.Combined with numerical analysis method, the real temperatures of billet were restored.The impact of scales was effectively eliminated and the fluctuation of measured surface temperature within the range of ±10℃.The temperature field measurement of billet was realized based on multi-information fusion of CCD temperature measurement system, measured shell thickness and numerical analysis method.This provides the basis that the surface temperatures take into account to closed-loop control and dynamic optimization water distribution.关键词：continuous casting;model;CCD thermometer;temperature measurement2|2|1更新时间：2025-07-16
- 摘要：Based on the direct sum decomposition of linear codes over Fp+vFp(v2=v), the minimum support hierarchy of linear codes over Fp+vFp and their dual codes are studied by means of the Torsion codes and parity check matrice of these linear codes.With these results the Hamming distance of linear codes over Fp+vFp are determined in terms of that of linear codes over the finite field Fpand an explicit construction for linear codes over Fp+vFp are given with the Hamming distance d, wherepis a prime and dis a positive integer.关键词：Fp+vFp;support;minimum support hierarchy;Hamming distance2|2|1更新时间：2025-07-16
- 摘要：Open-domain question answering is becoming a hot topic in the fields of natural language processing and information retrieval.Question classification, as an important component of question answering, has shown its significant influence on the overall performance of question answering systems.It can help reduce the search space and choose the exact search strategy to find answers.In this paper, we present a through overview of the state-of-the-art approaches to question classification, in terms of category/dataset, feature extraction, classification methods and performance metrics.Firstly, we give a detailed analysis of the supervised learning based question classification approaches.Then, we introduce some related work on question classification, such as kernel methods, semi-supervised learning methods, active learning and transfer learning methods, and so on.Finally, we give some possible research directions on question classification.关键词：open-domain question answering;question classification;machine learning;feature extraction;classifier design3|2|4更新时间：2025-07-16
- 摘要：In order to reduce the computational complexity of the conventional selective mapping (SLM) algorithm in the space frequency block coding multiple input multiple output orthogonal frequency division multiplexing (SFBC MIMO-OFDM) system, this paper proposes to produce more candidate sequence pairs with different peak to average power ratio (PAPR) by the time domain cyclic shift and equivalent SFBC of signals.The receiving part can restore cyclic shift factor and phase rotation factor by comparing the distance of the inversed rotation sequences and its nearest constellation points.The simulation results show that the proposed method can effectively reduce the PAPR of SFBC MIMO-OFDM system.In addition, the proposed method can reduce the computation complexity of the conventional SLM significantly and can obtain similar bit error rate (BER) performance as the conventional SLM with perfect side information.关键词：space frequency block coding multiple input multiple output orthogonal frequency division multiplexing (SFBC MIMO-OFDM);selective mapping (SLM);peak to average power ratio (PAPR);cyclic shift;blind detection2|2|4更新时间：2025-07-16
- 摘要：The reconfigurable computing system became an important choice according to accelerating compute-intensive applications.Among most compute-intensive applications, the matrix triangularization decomposition always was in the central position of research subjects and presented a great value to solve linear equation systems and matrix eigenvalue problems in science or engineering area.This paper analyzed the linear computing process of triangularization and proposed a hardware-adaptive parallel sub-matrix identity updating algorithm and a high-performance parallel structure hardware template for matrix triangularization on FPGA (Field Programmable Gate Array) according to the common triangularization computing process of the matrix triangularization decomposition.The research focused on the high-performance FPGA parallel structure implementation and optimization methods for the LU matrix triangularization decomposition.In theoretical analysis, the proposed algorithm presents better pipeline-parallelism and data-parallelism during the matrix triangularization process.The experimental result shows that the proposed structure gets over decuple speedup compared to general-purpose processors and the previous works in vital performance.关键词：matrix triangularization decomposition;triangularization process;parallel algorithm;LU decomposition;field programmable gate array2|2|2更新时间：2025-07-16
- 摘要：Dynamic frame slotted ALOHA (DFSA) is a popular anti-collision technique to resolve a tag collision problem in ultrahigh-frequency (UHF) radio-frequency identification (RFID) systems.In DFSA, the reader needs to accurately estimate tag backlog and set a new frame size for identifying the backlog.Thus, collision detection (CD) and tag backlog estimation play important roles in DFSA.Existing CD schemes do not respond efficiently enough to detect a collision and result in a degradation of identification performance.To reduce computation load and improve identification performance, a feasible anti-collision algorithm that combines collision detection and tag backlog estimation is designed to make the performance more efficient.Theoretical analysis and simulation results show that the performance of the proposed algorithm is better than most existing anti-collision solutions.The results obtained were useful for the design of fast, efficient readers.关键词：radio frequency identification (RFID);anti-collision;Aloha;time efficiency2|2|8更新时间：2025-07-16
- 摘要：BWDSP is a word addressed VLIW DSP supporting clustering and SIMD.Based on open source compiling infrastructure open64, key technologies of compiler are developed for BWDSP which consist of optimized processing of address register, instruction clustering combined multi-heuristic factors, register allocation and instruction scheduling on clustering architecture.The key optimization technologies of BWDSP compiler on its hardware architecture include vectorization based on dependence analysis, application of effective instruction and recognization of zero overhead loop.Some general attention points for compiler development based on open source compiler infrastructure are presented after the development experience on BWDSP compiler is summarized.关键词：address register;clustering;vectorization;zero overhead loop2|2|1更新时间：2025-07-16
- 摘要：Let R(pm, k) denote the polynomial residue ring Fpm[u]/<uk>, where pj－1+1≤k≤pj and uk=0 for some positive prime number p and positive integer j.Based on a kind of matrix over Fpm, a new Gray map from R(pm, k) to Fppmj is defined.It is proved that the Gray image of a linear (1+u) constacyclic code of an arbitrary length N over R(pm, k) is a distance invariant linear cyclic code of length pjN over Fpm.Moreover, the generator polynomial of the Gray image of such a constacyclic code is determined, and some optimal linear cyclic codes over F3, F5 and F7 are constructed via the Gray map.关键词：linear code;cyclic code;constacyclic code;gray map;optimal code4|2|2更新时间：2025-07-16
- 摘要：In order to increase the calculating angle of parabolic equation and improve the calculation accuracy when solving the problem of multiple reflection field, such as indoor propagation environments, the Pade two-way parabolic equation is presented.Its discrete difference format is deduced via the Crank-Nicolson finite difference method.Besides, the finite difference scheme of field on the upper and lower boundaries is educed by using the impedance boundary condition to the indoor ceiling and floor, whose correctness is verified compared with ray tracing method.The characteristics of indoor radio wave propagation in a single-storey building including one furniture are simulated by two-way parabolic equation.The results show that the two-way parabolic equation is reliable and agreeable to the physical laws.Finally, the two-dimensional parabolic equation model is applied to computing the indoor distribution characteristics of electromagnetic waves, when two double-floor buildings exist.关键词：Pade two-way parabolic equation;finite difference;interior;radio wave propagation2|2|1更新时间：2025-07-16
- Technical support is provided by Beijing Founder electronics co., LTD 京ICP备09064830号-19
京公网安备11010802024621 - It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
- Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.
0