最新刊期
卷 45 ， 期 11 ， 2017
- 摘要：The I Ching is one of the most precious cultural heritages of the Chinese nation.It contains ancient people's understanding,philosophy and dialectics of the universe and human society,which represents the philosophical thinking of ancestor about universe.We study the hierarchy design in computer architecture from the perspective of the I Ching and classify layers of the hierarchical architecture into yin and yang property,which helps us better understand the essence of hierarchy design and brings design models and theories.In order to give evaluations of the hierarchical model for architecture design,we establish a theory of hierarchical unity of opposites and combination of hardness with softness,which can promote the coordinated development between hierarchical components.By discussing the hierarchical connection relationship of trigrams and the hierarchical model of Six Yao,this paper expands the development and evolution of the I Ching hierarchical model.It also clarifies the approach and reasoning of hierarchical model design by the examples of SDN hierarchical model and cloud computing hierarchical model.Finally,this paper makes a conclusion and proposes the research plans for future works.关键词：computer architecture;hierarchy design;I Ching;hierarchy of Six Yao;model567|704|1更新时间：2025-07-16
- 摘要：An interference robust synchronization algorithm with Neyman-Pearson-like test weighted lp-Correlation (lp-NPWC) for the timing synchronization of an Orthogonal Frequency Division Multiplexing (OFDM) system is presented by a Zadoff-Chu (ZC) sequence.The analytical results show that our Neyman-Pearson-like test weighted synchronization algorithm can reduce the multipath effects on the lp correlation synchronization,where p=1 or 2.Especially,when p=1,it is found that our algorithm is robust to the noise with a heavy-tailed distribution and fake peaks caused by a cyclic prefix.Both experiment and simulation results verify the effectiveness of analytical ones,while our algorithm is shown with higher synchronization accuracy than those of the known ones in literature.关键词：orthogonal frequency division multiplexing (OFDM);ZC sequence;timing offset estimation;lp-correlation;Neyman-Pearson test;heavy-tailed noise;multipath effect118|259|0更新时间：2025-07-16
- 摘要：Loop is an important program structure in computer.Many applications need to estimate the maximum iteration number of loops in programs by loop bound analysis.Existing loop bound analysis uses conservative methods to derive outer loop bounds,which estimates the bounds higher than the real ones.In this paper,we propose an automatic inner bound analysis,which generates bounds slightly lower than the real ones.When users combine the inner bound analysis with traditional outer bound analysis,they can restrict every real loop bound in an interval and get more information about the loops.We implement the inner bound analysis by a scope-condition guided symbolic execution.The insight of our technique is that when symbolic execution substitutes program inputs by symbols in its derivation,it generates loop bounds for all valid inputs and generates corresponding test cases that make the inner bounds feasible.We optimize the technique and evaluate it on several benchmarks.The results show that the analysis is precise and efficient.关键词：loop bound analysis;symbolic execution;software testing227|293|0更新时间：2025-07-16
- 摘要：The existing salient region detection algorithms based on visual stimulus and prior knowledge are difficult to detect some complicated salient regions.The human vision system can distinguish these complicated salient regions because of the rich semantic knowledge in the human visual system.We construct a semantic salient region detection network using the fully convolutional structure.Learning the mapping from the low-level features to the human semantic cognition,our network can extract semantic salient region effectively.Aiming to the defects of the semantic salient region map,we introduce the color information,object boundary information and spatial consistency information to derive accurate superpixel-level foreground and background probability.At last,we fuse the foreground and background probability,semantic information and spatial consistency information to derive the final salient region map.The experiments comparing with the state-of-the-art 15 algorithms on 6 data sets demonstrate the effectiveness of our algorithm.关键词：semantic information;fully convolutional network;color appearance model;salient region detection179|474|4更新时间：2025-07-16
- 摘要：A new method of fast pattern synthesis is presented in this paper.Under the framework of alternating projection (AP),the amplitudes of desired pattern is firstly constrained.Then the method adopts an auxiliary phase function to obtain the optimized phases of desired pattern.Finally,the required excitations can be obtained from a constrained least mean squares (CLMS),which is solved by the proximal splitting method.Compared with other methods based on AP,the optimization of pattern phase is helpful to improve the convergence speed and performance of the algorithm.The synthesized results show its high performance in the pattern synthesis with or without excitation constraints.The proposed method is suitable for the arbitrary arrays and has good generalization capability.关键词：pattern synthesis;alternating projection;optimization of pattern phase;embedded element pattern;excitation constraints191|317|0更新时间：2025-07-16
- 摘要：To recover the position of occlusion,an occlusion recovery method based on projective constraints under orthographic projection is presented.Utilizing the property that both the row and the column space of image matrix are projective subspaces,the method applies Singular Value Decomposition(SVD) to get the image matrix's row and column metric constraints,and replaces occlusion solution by iteratively solving the minimum of a quadratic function.The experiments with both simulated and real data show that the proposed method has the advantages of fast convergence speed and small error.关键词：occlusion;projective;singular value decomposition;quadratic function94|207|1更新时间：2025-07-16
- 摘要：Aimed to the poor discrimination of the traditional histogram feature,a Hierarchical Structure Histogram (HSH) is proposed in this paper.Firstly,it transforms the target image into hierarchical sub images according to the intensity value.Then,it calculates the histograms based on the structure image element for each hierarchical sub image according to the predefined structure image element.Finally,it integrates the histograms to obtain the final hierarchical structure feature.Take image matching and visual tracking as two representative examples,a lot of experiments were carried out based on the proposed feature.The experimental results indicate that the proposed feature owns better discriminative performance and local description performance than the referenced features.The similarity map obtained from the HSH-based image matching has a much more discriminative single-humped characteristic.The HSH feature can also dramatically decrease the tracking errors for visual tracking.关键词：image matching;visual tracking;histogram feature;hierarchical structure histogram98|298|3更新时间：2025-07-16
- 摘要：Super-resolution (SR) image reconstruction has developed into a powerful tool to enhance the image resolution for the systems with low-cost imaging sensors.A direct but efficient approach to super-resolve a low-resolution image is based on prior knowledge learning.But the existing methods do not consider matched high-level features in the images with structured edges,resulting in some smooth image artifacts.A second-order directional total generalized variation (DTGV) regularization based method is proposed to explore the underlying high-level information of the data in this paper.More specifically,second-order DTGV acts as not only an additional prior but also an effective constraint to reduce the image artifacts and remove the noise.Results from several texture images demonstrate that the proposed approach can generate high-resolution image details and tend to produce high-frequency textures.关键词：super-resolution;directional total generalization variation;optimization algorithm;regularization constrains154|359|3更新时间：2025-07-16
- 摘要：Touchless fingerprint recognition with high acceptance,high security,hygiene advantages,is currently a hot research field of biometrics,The background areas of touchless fingerprints are more complex than those of the contact,Fingerprint image will appear rotation and translation phenomenon,What's more,the contrast of the ridge and valley lines is much lower,These factors seriously affected the performance of the touchless fingerprint recognition.So the general methods for contact fingerprint images are difficult to achieve good effect.Firstly,In this paper,a method is put out to preprocess the images reasonably aiming at these features.Secondly,the Otsu based on the Cb component of the YCbCr model is adopted to extract the finger area.When the fingerprint images are enhanced,combining the high frequency emphasis filtering and iterative adaptive histogram equalization technique is adopted firstly and then the simplified Gabor function template is used to enhance them again.thirdly,this paper proposed a new method of extracting the ROI fingerprint area.lastly,AR-LBP algorithm is adopted for feature extraction and the nearest neighbor classifier is used for feature matching.Experimental results show that the proposed method in this paper can achieve good image identify results.关键词：touchless fingerprint;high frequency emphasis filtering;Otsu;adaptive histogram equalization;ROI area;AR-LBP algorithm437|365|1更新时间：2025-07-16
- 摘要：Firstly,two alternative equivalent forms of GPoCTL state formulas,"until","always",are given respectively.Secondly,it shows that the model checking problem of GPoCTL can be reduced to which of CTL,its algorithm is given through the method of cut set,and whose availability is explained with an example analysis,as a result,the time complexity of the algorithm is obtained.Finally,the properties of the GPoCTL model checking problem with fairness assumptions,which are similar to the GPoCTL,are studied by the similar method with GPoCTL.关键词：possibility theory;computation tree logic;model checking;time complexity;reduction142|240|3更新时间：2025-07-16
- 摘要：In order to alleviate the contradiction between the massive mobile data traffic and the limited capacity of wireless backhaul links,a cooperative content caching algorithm is proposed for Software-Defined Radio Access Networks (SD-RAN),where the Macro-cell Base Station (MBS) equipped with centralized control logic and programmable interfaces,coordinates the content caching performed at the Small-cell Base Stations (SBSs).Moreover,in order to strike a balance between the local hit ratio and miss ratio,a cooperative caching algorithm is proposed by dividing the cache space of each SBS into two portions,one for storing the most popular contents that are the same across SBSs,one for storing unique contents to facilitate inter-SBSs cooperation.The optimal partition factor at which the average content provisioning cost of the SD-RAN is minimized is analytically obtained in a closed form.关键词：software-defined radio access networks;content popularity;cooperative caching;content provisioning cost258|325|1更新时间：2025-07-16
- 摘要：Axiomatic extensions of n-valued Goguen propositional logic system is first studied in this paper,which is denoted as ∏ ~, Δ.Using the randomization method of valuation sets,the definition of Γ-k randomized truth degree of formula relative to local finite theory Γ under the k conjunction is given.The MP rule,HS rule,and some related properties are also discussed.Then,the definitions of Γ-k randomized similarity degree and Γ-k randomized pseudo-metric in ∏~,Δ between two formulas are given,and some desirable properties about Γ-k randomized similarity degree and Γ-k randomized pseudo-metric relative to local finite theory Γ under conjunction are obtained.Finally,the paper introduces the concepts of randomized relative divergence degree and relative randomized consistency degree of theory Γ relative to the fixed theory Γ0 in ∏~,Δ,and obtains the relationship between relative randomized divergence degree and relative randomized consistency degree.关键词：Goguen propositional logic system;-k randomized truth degree;-k randomized similarity degree;Γ-k randomized pseudo-metric;relative randomized divergence degree;relative randomized consostency degree67|185|0更新时间：2025-07-16
- 摘要：An improved fast classification algorithm based on Brain Emotional Learning (BEL) and Genetic Algorithm (GA) is proposed to enhance the accuracy and efficiency.Inspired by the neurobiology research of emotional learning mechanism in amygdala and orbitofrontal cortex,the BEL model is constructed to mimic the mechanism of emotional stimulus processing in human brain.For the short path in the emotional brain,BEL can speed up the learning process.Furthermore,the learning weights in BEL are optimized by GA in order to improve the accuracy.Experiments using UCI datasets are performed,by which the results show that GA-BEL classification obtains higher accuracy and less computing time compared to other classifiers,in both small and large sample datasets.关键词：fast classification;brain emotional learning;genetic algorithm;datasets228|388|0更新时间：2025-07-16
- 摘要：This paper studies the problem of energy efficiently multiple objects tracking in wireless sensor network.Tracking a group of similar objects by trajectories clustering instead of tracking every single object can reduce the transmission energy and prolong network lifetime.However,due to hardware limitations of sensors,low sampling rate,as well as complex natures of surroundings,the locations of moving objects may not be precisely obtained,thus uncertainty inherently exists in trajectories.Ignoring the uncertainty will reduce the accuracy of the mining algorithms and affect the object tracking.This paper presents group objects tracking method based on uncertain trajectories clustering.In trajectory mining phase,we build Markov chain model for each uncertain trajectory and then give a new trajectory similarity measure.Finally,we present the uncertain trajectory clustering algorithm UTK-means to cluster the similar trajectories into groups.In group tracking phase,the locations of groups are transmitted to Base Station periodically.Experiments results demonstrate the good mining quality and energy-saving efficiency of our method.关键词：object tracking;sensor network;uncertain trajectory clustering;Markov model148|338|2更新时间：2025-07-16
- 摘要：A fuzzy C-means clustering based evolutionary algorithm called FCEA was proposed to optimize multiobjective optimization problems.In the process of iteration of this algorithm,a fuzzy C-means clustering method is firstly employed to implement a fuzzy partition of the population so as to discover the population distribution structure and to obtain a membership matrix of the population at each generation.According to the distribution structure,a membership based tournament selection strategy (MBTS) is designed to select neighboring solutions from the population for recombination and to guide search.The experiments present that MBTS significantly contributes to the performance of FCEA.Comparison experiments show that the proposed FCEA outperforms MOEA/D-DE,NSGAⅡ,SPEA2 and SMS-EMOA on solving GLT test suite with complicated Pareto Front (PF) shapes.关键词：evolutionary algorithm;multiobjective optimization;fuzzy C-means cluster;membership selection149|330|4更新时间：2025-07-16
- 摘要：In this paper,we propose routing algorithms for permutation-reverse and permutation-rotation operations based on Inverse Butterfly and Butterfly Networks respectively.The algorithms utilize self-routing and self-reconfigurable characteristics of the networks,and are capable of completing all reverse and rotation operations of arbitrary permutation-P.Their computational complexities are low and the hardware implementations are simple.Following this,we extend the functions of the previous permutation operations based on the networks with our proposed algorithms.And then,permutation-reverse,permutation-rotation and permutation-reverse-rotation hardware units are developed and synthesized in SMIC 65-nm process.The results show that when the reverse operations are extended in previous designs,the area of the original circuits is only increased by 6%,and the latency of original circuits is almost not affected.In addition,when the rotation and reverse-rotation operations are extended in previous designs,the area of the original circuits is increased by 18% and 21%,and the latency of them is increased by 30%,while the functions of original circuits are expanded 2 times.关键词：Inverse Butterfly/Butterfly Network;self-routing;permutation-reverse algorithms;permutation-rotation algorithm200|276|0更新时间：2025-07-16
- 摘要：Minimum attribute reduction is the optimum problem in the attribute reduction of the rough sets theory.To seek the minimum attribute reduction,the attribute reduction algorithm based on the particle swarm optimization (ARPSO algorithm)beats the traditional attribute reduction algorithm.In existed ARPSO algorithms,the positive region is usually taken as the heuristic information,however,it is not precision enough to measure the uncertainty.The mutual information is a more efficient tool to measure the uncertainty in the rough sets theory.To handle this problem,an attribute reduction algorithm based on the particle swarm optimization takes the mutual information(MIPSO algorithm)as a term in the fitness function,The proposed MIPSO algorithm improves the regional shock search embedded particle swarm optimization algorithm(RSPSO)by enhancing the speed which the particle is close to the attractor,preventing from being local optimum early and finding the optimum as soon as possible.Consequently,the global convergence of the MIPSO algorithm is guaranteed as soon as possible.The experimental results show that the proposed MIPSO algorithm not only improves the optimization ability,accelerates the speed and improves the accuracy,but also can keep the mutual information value of all attributes before reducing approximately equal to the value of remaining attributes after reducing.关键词：mutual information;particle swarm optimization;minimum attribute reduction;rough set;local search schemes173|306|5更新时间：2025-07-16
- 摘要：A simple and practical approach is required immediately to safeguard the Domain Name System (DNS) because there are increasing attacks on DNS (such as DNS cache poisoning) and various problems when deploying Domain Name System Security Extensions (DNSSEC) on a large scale.In this paper,we present Mimic DNS (M-DNS),a non-intrusive,tolerant and proactive security architecture,to deal with it.M-DNS is comprised of a scheduler and a server pool which consists of several heterogeneous DNS servers.The scheduler dynamically schedules the DNS servers to handle the requests in parallel and adopts the vote results from the majority of the servers to determine valid responses.Simulation results demonstrate that compared with current traditional frameworks,approximating 10 orders of magnitude reduction in cache poisoning attack probability is acquired when employing M-DNS.关键词：DNS;DNS cache poisoning attack;mimic security defense;dynamic heterogeneous redundancy166|505|21更新时间：2025-07-16
- 摘要：In the Electronic Health Record system,users update their health data frequently.If users keep the authentication of these data with the signature scheme in existence,it will lead to the leakage of their identity privacy and huge computation cost.Aiming at tackling the problems above,we propose a novel scheme called attribute-based sanitizable signature supporting dendritic access structure which obfuscates the user identity with attribute sets and introduces an authorized semi-trust third-party-sanitizer.The security analysis demonstrates that our scheme achieves the anonymity of users and is unforgeable under selective-predicate chosen-message attack in the standard model.Through comparison,our scheme not only reduces the signing computation overhead of users,but also supports the dendritic access structure which can provide flexibly fine-grained access control under large-scale attribute sets.关键词：attribute-based signature;sanitizable signature;electronic health records;standard model;unforgeable;anonymity153|261|4更新时间：2025-07-16
- 摘要：This paper studied the multipath mitigation in Global Navigation Satellite System (GNSS).A novel efficient algorithm with moderate computation burden is proposed,which firstly acquire the received data to obtain a rough estimation the satellite signal parameters.Then the Weighted RELAXation (WRELAX) technology,which was proposed to estimate the spatial parameter initially,is generalized to the space-time domain,termed as ST-RELAX.By using the ST-RELAX algorithm,the space-time parameters,e.g.direction of arrival (DOA),time delay and amplitude of both the line of sight (LOS) signal and the multipath are estimated.In addition,based on the code delay obtained from the acquisition process,the code delay searching interval in the 2-D parameter estimation process can be limited to reduce the computation burden.Hence,both the spatial and the time domain information can be used,the multipath can be mitigated more efficiently.Finally,the simulation results show that the proposed algorithm is superior to the traditional multipath mitigation algorithms.关键词：global navigation satellite system (GNSS);global positioning system (GPS);multipath;coherent signal;weighted relaxation (WRELAX)90|291|0更新时间：2025-07-16
- 摘要：The Distance Regularized Level Set Evolution (DRLSE) model is sensitive to initial contour and weak boundary images.Meanwhile,it is easy to leak from the weak edges and the curve sometimes converges slowly.To these issues,an improved level set evolution method is proposed in the paper,which combines target gray level statistical information with image gradient information.The boundary stopping function in the model of DRLSE is replaced by a target information function based on image information.And the constant coefficient associated with the weighted area was modified as an adaptive variable sign coefficient to deal with slow convergence and weak edge leakage.Experiments show that this method is free of initial contour.Besides,it reduces the time of image segmentation and improves the quality of segmentation.关键词：level set;distance regularized;active contour model;image segmentation68|261|1更新时间：2025-07-16
- 摘要：In order to improve the recognition rate of lower limb motion pattern,(a novel lower limb motion recognition method was designed by fusion of surface electromyography (sEMG) signal and acceleration signal.Firstly,the sEMG signal was decomposed into a set of product functions(PFs)by Local mean decomposition(LMD),and the multiscale permutation entropy(MPE) of PFs was calculated.Then,one scale permutation entropy was selected as the feature of sEMG by the Laplacian score.The feature vector is composed by this sEMG feature and the permutation entropy of acceleration signal.Finally,based on the combination of inter-class Euclidean distance and intra-class sample distribution,an improved support vector machine based binary tree(ISVM-BT) was designed.The feature vector was inputted into this SVM to recognize the lower limb motion.The experimental results indicate that the proposed method achieved 98.62% at the average recognition rate for seven daily activities,and has higher accuracy than other methods.关键词：lower limb motion pattern recognition;surface electromyography (sEMG);acceleration signal;multiscale permutation entropy(MPE);improved support vector machine based binary tree(ISVM-BT)33|368|4更新时间：2025-07-16
- 摘要：Repair traffic is not always optimal when repair bandwidth is optimal.The former is relative to physical network topology.This paper aimed at reducing repair traffic based on routing codes.First,we modeled data transmission in physical networks based on information flow graph so that we could get the necessary and sufficient condition to feasibility of routing codes.And we found that routing codes could be realized based on regenerating codes.Then,we designed a protocol working on application layers to generate repair trees in Fat-tree,and a heuristic algorithm to generate repair trees in CamCube,which were both in agreement with their own design features of datacenter networks.Simulations about data-repair processes in systems using minimum-storage regenerating codes show that routing codes can reduce repair traffic efficiently,and performance of the two generation schemes of repair trees are both good in their own adapted networks.In fact,repair traffic had about 50% and 30% reductions in Fat-tree and CamCube respectively when the number of providers was small.关键词：datacenter;physical networks;repair bandwidth;repair traffic;regenerating codes31|321|0更新时间：2025-07-16
- 摘要：Considering the impact of the joint frequency-phase offset estimation frequency error on the phase offset estimation in short burst communication systems,a symmetrical frame structure is introduced.First,based on a generalized (asymmetrical) frame structure we give a concept of the symmetrical frame structure and then develop the corresponding data-aided (DA) and non-data-aided (NDA) Cramer-Rao Bounds (CRBs) for the carrier parameter estimation.Then,according to the above CRB characteristic a joint frequency-phase offset estimation is proposed using the symmetrical frame structure.Taking the maximum likelihood (ML) based joint frequency-phase offset estimation for an example,simulation results show that the phase offset estimation based on the symmetrical frame structure can achieve lower mean square error (MSE) and have better ability against the large frequency offset compared with the phase offset estimation based on the asymmetrical frame structure.关键词：joint frequency-phase offset estimation;symmetrical frame structure;frequency-phase offset estimation decoupling;carrier synchronization44|222|1更新时间：2025-07-16
- 摘要：Considering the multi-fault problem in Software-Defined Network(SDN),a segment routing based multi-fault recovery and re-breakdown avoidance mechanism is proposed.In order to achieve fast recovery of failures,a linkage-loop backup system aiming at fast recovery for multi-fault problem is proposed with SR technology in dataplane.To avoid second failure caused by breakdown in some links due to the overload problem in failure recovery,an optimal traffic smoothing algorithm is proposed to balance the traffic among links where the traffic goes beyond the threshold.Experiments result show that compared with the schemes OAM-Based and Fast Failover,the proposed scheme improves the success rate of failure recovery by 6.7% and 8.5%,and the cost in controller is only 9% of the traditional OpenFlow scheme.At the same time,the proposed scheme also deals with the overload problem in failure recovery,which protects the network in failure avoidance scope.关键词：software-defined network;segment routing;multi-fault recovery;fault avoidance;traffic balance47|349|2更新时间：2025-07-16
- 摘要：Efficient routing is a challenging problem in multi-layered satellite networks where the time-varying topology leads to the absence of continuous and stable paths. Most previous researches either leverage IP architecture to achieve addressing and routing which usually leads to poor routing efficiency in such dynamic scenarios or design specialized architecture by using scheduling based control strategy which makes it hard to achieve efficient cooperative networking with other systems. In this paper, we propose SNDN (Satellite Named Data Networking), a distributed routing method with high routing efficiency and multicast performance. Specifically, we construct two schemes to generate the time varying FIB (Forwarding Information Base) and PIT (Pending Interest Table), and also design an efficient routing algorithm that can calculate the fastest time-related routes under both dense and sparse scenarios by using a time varying graph method. Nodes can generate FIB/PIT or update the entries concurrently with packet forwarding either by extracting the source routing information that attached in the selectors field of packet header or calculating by themselves if needed. Extensive simulation results verify the efficiency and performance of SNDN and demonstrate that it is a useful attempt on the routing problem of multi-layered satellite networks.关键词：content routing;satellite routing;time-varying forwarding table;time-varying graph algorithm32|389|5更新时间：2025-07-16
- 摘要：Aiming at reducing misclassification costs,this paper studies the design of reject options for ECOC multi-classification based on its properties.The first level of reject option is constructed in the process of bipartitions to recognize an instance whose real labels does not belong to the meta-subclasses.Meanwhile,the second reject rule is presented in the dichotomizers based on posterior probabilities and cost matrix to make the minimum-risk Bayesian decision.Finally,different decoding strategies are analysed according to different reject output.The relationship between the number of rejected positions and the minimum Hamming distance of matrix is discussed.The two-stage reject rule makes the ECOC multi-classification with rejection come true and reduce the misclassification error and costs.关键词：multi-classification;error-correcting output codes;rejection option;support vector domain description;Bayesian decision55|208|0更新时间：2025-07-16
- 摘要：Ultra-short baseline (USBL) underwater acoustic positioning systems utilizing narrow band signals are always confronted with the contradiction between phase-difference ambiguity and positioning accuracy.When the signal frequency is high,it is difficult to construct an array with an interval less than a half-wavelength which is always employed in traditional ambiguity resolution technique.Aiming at this problem,a phase-difference ambiguity resolution method based on the generalized maximum likelihood (GML) rule is proposed.Firstly,with vectors of the ambiguity integers initialized,the ambiguity resolution problem is formulated as problem of multiple composite hypothesis testing.Then decision can be made through the GML rule and direction of arrival is obtained.With inter-sensor spacing exceeding half the wavelength,the proposed method effectively extends the unambiguous array aperture and constraint on array configuration is easy to be met.Additionally,under full consideration of the statistical characteristics of observation data,accuracy of direction estimation approaches the Cramer-Rao bound.Simulation results verify the effectiveness of the proposed method.关键词：phase-difference ambiguity;direction finding;multiple composite hypothesis testing;ultra-short baseline (USBL) positioning77|294|2更新时间：2025-07-16
- 摘要：The memristor used in the neural morphology circuit is becoming more mature at present,but it applied to real-time control circuit has yet to be perfect.In this paper,the two-joint robot arm is used as research object,and a memristor PID (M-PID) control system for real-time circuit system is designed by combining the memristor with the traditional PID controller.By using the switching threshold of the MOS transistor,this paper innovative designed a memristor control circuit with zero state interval,which can effectively avoid the oscillation caused by frequent switching of the controller.The proposed control algorithm is analyzed from step response and position tracking using Matlab simulation software.The simulation results show that the proposed M-PID control algorithm can effectively improve the steady-state and dynamic quality of the two-joint robot arm control system.关键词：real-time control system;memristor with voltage threshold;memristor PID(M-PID);robot arm70|292|1更新时间：2025-07-16
- 摘要：Micro-blog user authority is one of the important factors to evaluate the reliability of micro-blog information.In this paper,a quantitative evaluation model of micro-blog user authority is proposed based on multi-feature fusion.Firstly,the concept of user authority is proposed,which is defined by two parts.the user influence and the convinced degree.In the case that the user domain influence factor is not considered,we extracted four user characteristics which include the user information spread influence,the user information integrity degree,the user activity degree and the user platform authentication index based on the Sina Weibo data and construct the user authority quantitative calculation model.Then,we determine the weight of the four user characteristics based on the analytical hierarchy process and the extraction algorithms of them are given respectively.At the same time,we put forward the UIRank model based on the followed value and the follow relationship network between the users which is used to calculate the user information spread influence and proved to be more effective than the famous PageRank algorithm through experiments.The experimental results show that the method proposed in this paper is more reasonable to calculate the user authority of micro-blog user,and it provide a feasible scheme for the quantitative evaluation of the user authority.关键词：micro-blog;user authority;user influence;UIRank;analytical hierarchy process39|338|10更新时间：2025-07-16
- 摘要：the effects of YON interfacial passivation layer (IPL) on the interfacial and electrical properties of Ge metal-oxide-semiconductor (MOS) capacitor with HfO2 gate dielectric are investigated.The YON IPL is fabricated by two different approaches:one is to sputter Y2O3 target in Ar+N2 to directly form YON,and another is to sputter Y target in Ar+N2 to deposit YN first and then perform annealing in N2+O2 to convert YN to YON.Experimental results and XPS analyses indicate that the latter could suppress formation of the Ge oxides at/near the YON/Ge interface more efficiently to achieve more excellent interfacial and electrical properties as compared to the former,since the YN can absorb oxygen diffused to the interface to form YON prior to the Ge surface.As a result,small capacitance equivalent thickness (1.65 nm),high k value (18.9),low interface-state density (7.79×1011 cm-2eV-1) and equivalent oxide-charge density (-3.54×1012 cm-2),small gate leakage current density (2.74×10-4 A/cm2 at Vg=Vfb+1 V) and good high-field stressing reliability have been obtained.关键词：Ge metal-oxide-semiconductor;interfacial passivation layer;YON;interface-state density40|248|1更新时间：2025-07-16
- 摘要：Using opposition-based learning can improve the performance of particle swarm optimization (PSO) algorithm.However,the current opposition-based learning particle swarm optimization algorithms calculate the opposite solution by using coordinates of the candidate solution,the maximum and the minimum of a population,without making full use of the search experience of the population.A neighborhood centroid opposition-based learning strategy is proposed to improve this issue.First,the neighborhood centroid is used as reference point for the generation of the opposite particle,absorbing the population search experience and maintaining diversity.Second,contraction factor is used to expand the reverse search space,increasing the probability of finding a better solution.Experiments are conducted on typical benchmark functions,CEC'13 test functions and also on a practical engineering optimization problem.The results verify the effectiveness of the neighborhood centroid opposition-based learning and the competitiveness of the NCOPSO.关键词：opposition-based learning;neighborhood centroid;diversity;particle swarm optimization (PSO)64|441|25更新时间：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