最新刊期
卷 41 ， 期 8 ， 2013
- 摘要：Program slicing is a technique for simplifying programs by focusing on selected aspects of semantics.This paper extends our previously presented intraprocedural monadic slicing to handle procedures.It presents backfilling labels based monadic approach to compute static slices of a program with call-by-value-result procedures.It first uses some given labels to initialize the monadic slices of the corresponding formal parameters at the beginning of a procedure;then analyzes this procedure through intraprocedural monadic slicing methods,whose slice result can be used to obtain the dependences among the parameters.It lastly obtains the final slice tables by backfilling the corresponding given labels.The algorithms in this paper make the best of the slice result from intraprocedural monadic slicing algorithms,without the need of a characteristic graph,a system dependence graph,or similar intermediate structure.They can also address calling-context problem through the dependence relations among the corresponding parameters.Furthermore,they reserve the excellent properties of compositionality and language-flexibility from intraprocedural monadic slicing algorithms.关键词：monadic slicing methods;modular monadic semantics;interprocedural programs;dependences among the parameters;compositionality4|4|2更新时间：2025-07-16
- 摘要：MMDE,regarded as a MMD-based feature extraction method,has been successfully used.However,when the feature extraction problems of the original input space have been solved,the MMDE lacks the suitability to some extent.Therefore,we propose Maximum Local Weighted Mean Discrepancy(MLMD)by integrating the theory and technique of local learning methods.The measurement considers fully the internal local structure between domains;at the same time,the global distribution discrepancy can be reflected by the local distribution discrepancy.We also,based on the above measurement,propose Maximum Local Weighted Mean Discrepancy Embedding(MWME),which not only fulfills transfer learning task but also has certain local learning capability.The MWME can complete traditional feature extraction as well as domain adaptation learning in two domains whose distributions are different but relative,thus indicating its better robustness and adaptation.Tests show the above-proposed advantages of the MLMD criterion and the MWME method.关键词：maximum mean discrepancy embedding;maximum local weighted mean discrepancy;maximum local weighted mean discrepancy embedding;feature extraction;transfer learning2|3|4更新时间：2025-07-16
- 摘要：For solving the multiple-goal problem in RoboCup,a novel multiple-goal Reinforcement Learning algorithm,named LRGM-Sarsa(λ),is proposed.The algorithm estimates the lost reward of the greatest mass of every sub goal and trades off the long term reward of the sub goals to get a composite policy.In the single learning module,B error function,which is based on MSBR error function is proposed.B error function has guaranteed the convergence of the value prediction with the non-linear function approximation.The probability funciton of selecting actions and the parameter α are also improved with respect to B error function.This algorithm is applied to the training of shooting in Robocup 2D.The experimental results show that the proposed algorithm is more stable and converges faster.关键词：multiple-goal;adaptive Sarsa(λ);lost reward of greatest mass;reinforcement learning;robocup 2D2|2|2更新时间：2025-07-16
- 摘要：An algorithm framework of the numerical inversion of Laplace transforms(NILT)based on a class of probability density function,which belongs to the sequence of δ-type functions with exponential term exp(-st)was presented.If the probability density function defined for all positive variables in the abscissa has and only has an extremum abscissa corresponding to the modal value of random variables,the expectation of a continuous function of random variables can be expressed by the Laplace transform of this function.It is shown that the traditional Stehfest's and Post-Widder's NILT algorithm are two special cases of the proposed algorithm framework.Moreover,an example using the δ-type Gamma distribution density function is given to demonstrate that the novel framework can help to develop new NILT algorithms.关键词：numerical inversion of Laplace transforms;generalized function;sequence of δ-type functions;probability density function2|2|0更新时间：2025-07-16
- 摘要：State/Event Fault Tree (SEFT) is a modeling technique for describing the causal chains which lead to failure in complex systems.One important way for capturing the safety parameters of systems is quantitatively analyzing the probabilistic characteristic of system failures.As lack of precise semantics,SEFT can only be quantitatively analyzed after its semantics being precisely described.In this paper,we present a quantitative analysis method of SEFT based on Interactive Markov Chain (IMC).Firstly,Interface Interactive Markov Chain (Interface-IMC) is proposed based on refining the interactive action of IMC into input and output actions.Secondly,the precise semantics of SEFT is described based on Interface-IMC.Thirdly,a quantitative analysis method is presented based on formal semantic model of SEFT.Finally,the method in this paper is illustrated by modeling and quantitatively analyzing SEFT of aircraft landing gear system.关键词：safety analysis;state/event fault tree;interactive Markov chain;quantitative analysis;formal method2|3|12更新时间：2025-07-16
- 摘要：The file system reconstruction is an effective way of recovering the forensic data from Flash memory.However,the traditional reconstruction methods need a precondition that is there are both the logical image and the physical image of flash memory at the same time and that is usually not satisfied in practice.In this paper,we propose a method for reconstructing the File Allocation Table (FAT) file system of Flash device when only a physical image of Flash memory is acquired.After introducing the statistical methods to identify the logical address bytes and the page state byte from the physical image,we propose the new algorithm to reconstruct the newest FAT file system which is based on the newest value of the page state.At last,take the special flash devices with MTK6229 controllers as examples,we expound the methods related to reconstructing the FAT file system and verify the reconstruction algorithm.关键词：digital forensics;flash memory;physical image;file system reconstruction;spare area2|2|1更新时间：2025-07-16
- 摘要：Portrait is a kind of art form,which can catch the features of a person,hide the details and keep the personal privacy.In this paper,an algorithm for automatic generation of human portrait with multiple expressions is presented.The Active Shape Model is used to extract facial features,and the set of Facial Animation Parameters is used to synthesis the multiple expressions for a neutral face.And with the gradient domain of the image and the Non-Photorealistic Rendering,the portrait-liked face images with multiple expressions can be generated automatically.The generated portraits are effective and vivid.They can be applied in non-photorealistic computer graphics and entertainment,such as video,network,newspapers and magazines.关键词：portrait;multiple expression;feature deformation5|3|1更新时间：2025-07-16
- 摘要：This paper proposed a visual perception and edge preserving illumination invariant face recognition method,which on one hand employs a visual perception based image gradient to replace the image special gradient to make the method be more consistent with the human visual system,and on the other hand,proposes a novel diffusion equation to overcome the edge sharpening problem.The novel method can preserve the image edge and meanwhile can eliminate the halo effect and spot effect to some extent.Experimental results on EYaleB and CMU PIE databases show that the proposed method outperforms other compared methods,which illustrates the effectiveness of the proposed method.关键词：face recognition;illumination invariant face image;visual perception;anisotropic diffusion;edge preserving3|2|6更新时间：2025-07-16
- 摘要：Different from 1D signals,2D images have obvious texture information.Based on the basic framework of block-based compressed sensing,we propose a block-based adaptive compressed sensing of image using texture information,which exploits the property that different texture would produce varied information content.The adaptability lies in two aspects:one is the adaptive sampling and another is the adaptive threshold.Two different filters are introduced,which forms two kinds of new algorithms,respectively.The proposed algorithms are applied to nature and medical test images.The results show that our improved algorithms provide superior performance on both the reconstructed image quality and the visual effect.关键词：block-based compressed sensing;texture information;adaptive sampling;adaptive threshold;filter2|2|18更新时间：2025-07-16
- 摘要：Skyline query has recently received a lot of attention in information service community.The TPAOSS (Three-Phase Algorithm for Optimizing Skyline Scalar) algorithm has two performance drawbacks:(1) in the third phase of TPAOSS,as the number of objects on net nodes increases,the length of bloom filter will increases exponentially,which will seriously influence the efficiency of obtaining replicated values and the occupation size of memory;(2) the TPAOSS algorithm does not consider the computation efficiency of local or global subspace skyline queries in each net node.Motivated by these facts,we propose EPSSQDN (Efficient Processing of Subspace Skyline Queries in Distributed Networks),an algorithm for efficient processing of subspace skyline queries in SPA distributed networks.Moreover,in order to further reduce the computation cost of subspace skyline queries and decrease the volume of data transferred,we present an efficient optimized techniques.Furthermore,we present extensive experiments that demonstrate our method is more advantageous than the TPAOSS algorithm.关键词：skyline query;SUPER-PEER architecture;information service;query optimization2|2|2更新时间：2025-07-16
- 摘要：Connected Dominating Sets (CDS) has been proposed as the virtual backbone to alleviate the broadcasting storm problem and perform some other tasks such as data gathering in wireless sensor networks.Many previous researches mainly focus on how to construct a small virtual backbone for high efficient data gathering,which is modeled as the Minimum Connected Dominating Set (MCDS) problem.However,the MCDS cannot balance the energy consumptions among nodes,which shorten the network lifetime.Therefore,it is desirable to construct an energy-balanced CDS.In this paper,a novel distributed schema,called EBCDS (Energy-Balanced Connected Dominating Sets) algorithm is proposed to balance the energy consumption of the network and enlarge the network lifetime.In EBCDS,each node in the CDS has high energy and large degree,and these nodes form a virtual backbone in the network.By transmitting data through the backbone with small routing space,each node can preserve its energy effectively.Moreover,the nodes in the backbone would not die quickly because of lacking of energy.Theoretical analyses show that EBCDS can construct a CDS with O(nlogn) message complexity,and simulations results prove the efficiency of the proposed algorithm in terms of energy consumption and network lifetime.关键词：energy-balanced;connected dominating sets;data gathering;Wireless sensor networks2|3|10更新时间：2025-07-16
- 摘要：In view of the large hierarchical Network Biswapped Network(BSN),paper suggests a simple and effective load balancing strategy CDE-X.This new scheme overcomes the unworthiness of the large-scale hierarchical network's traditional scheme in which the calculation of the complex high order Laplacian matrix's eigenvalues.In the new method,most load balancing iterations are carried out in the factor network,therefore,CDE-X only needs to know the factor network's structure and the Laplacian eigenvalues,which improves the iterative convergence speed in the process of iterative balancing,and reduces the calculation complexity of the flows,and reduce the communication flows.According to the comparison theory,CDE-X not only reduces the computational complexity,but also reduces the iteration steps,which is more simple and effective than the traditional strategy X,and more applicable to the large scale hierarchical network BSN.关键词：Biswapped Network(BSN);Laplacian matrix;eigenvalues;iteration2|2|0更新时间：2025-07-16
- 摘要：Through the research of mobile robot trajectory tracking control problem,this paper proposes fuzzy PID-P type open-closed loop nonlinear discrete iterative learning control(ILC) method based on the kinematic model of mobile robot.The PID-P type iterative learning convergence condition and certification procedure are presented.The fuzzy control principle is used to set PID parameters of three learning gain matrixes.This control method improves the ability of tracking repeatly specific trajectory for mobile robot,and has the characteristics of simple algorithm.Simulation results show that the use of fuzzy open-closed-loop PID-P type iterative learning control algorithm for trajectory tracking is feasible and effective.关键词：mobile robot;iterative learning control;trajectory tracking;fuzzy control2|2|16更新时间：2025-07-16
- 摘要：There are 2r kinds of allocation of don't care terms for an ISFPRM(Incompletely Specified Fixed Polarity Reed-Muller) circuits with r don't care terms,so the area and power of corresponding FPRM(Fixed Polarity Reed-Muller) circuits are different.This paper proposes an area and power optimization algorithm based on PSGA(Genetic Algorithm Based on Predatory Search Strategy) algorithm.Firstly,through the research of ISFPRM expansions and fast tabular technique,a conversion approach of ISFPRM expansions between different allocation of don't care terms is generalized and the corresponding FPRM expansions are deduced.Then,the area and power of these FPRM circuits are estimated.Lastly,the best allocation of don't care terms is searched by PSGA algorithm.The results of experiments show that the area and power of ISFPRM circuits have obviously decreased compared with the results irrespective of don't care terms.关键词：genetic algorithm based on predatory search strategy(PSGA) algorithm;incompletely specified fixed polarity reed-muller(ISFPRM)circuits;area optimization;power optimization2|2|9更新时间：2025-07-16
- 摘要：GaAs photocathode with avalanche electron multiplier is a new type photocathode and fabricated by adding the avalanche electron multiplication layer in typical GaAs photocathode,the hot clean temperature、electron gain and other performance of the photocathode component are investigated.The I-V characteristic of the photocathode component after and before hot cleaning was measured and analyzed.The experimental results were shown that photocathode component can endure 580℃ hot cleaning temperature and got electron gain 12.6,the radiation sensitivity is greater or equal to 3.87mA/w at 880nm of wave length,the dark current density is less than or equal to 6.79×10-5mA/cm2.关键词：GaAs;photocathode;avalanche mulitplication;electron gain;negative electron affinity2|2|0更新时间：2025-07-16
- 摘要：According to the particle swarm algorithm that easily falls into the local optimal solution and the problem of low search accuracy,this paper proposes reduced adaptive particle swarm optimization algorithm for generating test data automatically.First,this paper reduces the evolution equations of particle swarm and presents evolution equations without velocity.Then this paper proposes adaptive adjustment scheme based on inertia weight and inertia weight is directly acted on the particle position.According to the particle fitness and particle aggregation degree,the population will be divided into three parts.The experiments show that our approach can effectively improve the efficiency of generating test data automatically.关键词：particle swarm algorithm;automatic test data generation;reduce the evolution equation;inertia weight;adaptive adjustment scheme;particle aggregation degree2|2|12更新时间：2025-07-16
- 摘要：CDN (Content Delivery Network) is a novel overlay network,which deploys surrogates on the edge or backbone of network in order to reduce the access delay;it improves the efficiency of content delivery on the global load balance component.In current status,CDN has been a core Internet application as the development of multimedia and network technologies.In this paper,the evolution of CDN and its architecture are introduced;the key component of CDN and mechanism are presented;the taxonomy of CDNs and the performance measured strategies are reviewed.The developing trends of CDN and further topics in this area are also analyzed.关键词：overlay network;content delivery network;content routing;load balance;performance measure2|2|4更新时间：2025-07-16
- 摘要：The security of Cobra-H64/128 block cipher under related-key differential cryptanalysis was studied.For Cobra-H64,we use related-key differential attack to get the whole 128 bits key with probability 1 based on the new constructed related-key differential and loopholes in CP box,and the corresponding computational complexity is 2^40.5 Cobra-H64 encryptions,the data complexity is 2^40.5 chosen-plaintexts,the memory complexity is 2^22 bits.To recover the whole 256 bits key of Cobra-H128,we need a computational complexity of 2^76 Cobra-H128 encryptions,a data complexity of 2^76 chosen-plaintexts,a memory complexity of 2^16.2 bits.The analysis results show that Cobra-H64/128 are unsafe under related-key differential attacks.关键词：cryptanalysis;Cobra-H64/128 block cipher;related-key differential attack;differential transmission characteristic;bit transmission property2|2|2更新时间：2025-07-16
- 摘要：A new robust watermarking algorithm based on conjugate symmetric sequency-ordered complex Hadamard transform (CS-SCHT) is proposed in this paper.At the phase of embedding,the magnitude of the CS-SCHT coefficients of host image is selected as support of watermark,and a new human visual system is designed to improve the invisibility of marked image.Kolmogorov-Smirno method is used to estimate the approximate distribution of the coefficients' magnitude,and then a locally optimal detector is constructed based on the approximate distribution.Experimental results show that the CS-SCHT is suitable for watermark application,and the proposed detector and human visual system can provide good performance.关键词：conjugate symmetric sequency-ordered complex hadamard transform;human visual system;detection;approximate distribution;locally optimal detector2|3|1更新时间：2025-07-16
- 摘要：Orthogonal kernel matching pursuit (OKMP) for constructing sparse kernel models has been recently introduced,in which a greedy scheme is utilized to select a single element per iteration.To improve the efficiency and performance of the greedy-scheme-based OKMP,a greedier algorithm is considered.The main contribution is the development of a new selection strategy that effectively selects several elements in each iteration.The efficiency is achieved by reducing the regressor steps,thus the computation time of the orthogonalization that each newly selected regressors to all the selected terms before is saved.A pruned algorithm is proposed based on the similarity of the atoms to improve the accuracy of the approximation.Numerical results and computational complexity analysis show that this new scheme is capable of producing a much sparser regression model with better generalization than the conventional approaches.关键词：greedier strategy;orthogonal;kernel matching pursuit;sparse2|2|6更新时间：2025-07-16
- 摘要：For the privacy preserving problem in the data mining technology of the social networks,weights of the connected edge of the networking and their preserving is very important.We develop a privacy preserving strategy based on data perturbation algorithm.The strategy applies the greedy perturbation algorithm to perturb edge weighs so that the shortest path of the network can be kept,and its length can be similar with that of the original one.The results of simulation calculation show that the perturbation strategy can march with the expected theoretical analysis results.关键词：data mining;social network;privacy preserving;greedy perturbation algorithm2|2|12更新时间：2025-07-16
- 摘要：Longitudinal analysis of brain anatomical change can predict the growth or atrophy of human brain and provide a necessary foundation for clinical medicine application and research.However,due to different imaging machine or model and a long time interval of each image in different time point,the 3D image segmentation method can not provide adequate longitudinal stability of brain tissue variation.In this paper,we propose a 4D brain image level set segmentation model based on spatio-temporal information continuity.This model contain three terms:data term created by global and local information,spatial and temporal smooth term respectively.The data term reflects the intensity information of the image in each time point.The spatial and temporal term can keep the segmentation results smooth variation in these two dimensions.The experiments demonstrate that the proposed method can obtain a temporally consistent and spatially adaptive longitudinal brain image segmentation results.关键词：brain MR image;longitudinal segmentation;spatio-temporal dimension2|2|1更新时间：2025-07-16
- 摘要：To improve the VRM's step-up response speed,the optimal loading of a traditional buck converter was analyzed,based on that the dual-input buck converter was proposed,then its steady work process and the optimal loading operation process was described.The additional power switching conditions were given by the optimal loading threshold.Finally,the comparative simulation study was carried out for both.The simulation and experimental results show that the dual input buck converter is faster response speed and smaller output voltage drop amount than the traditional buck converter,and the simple structure,easy to design and implement,suitable as the VRM main circuit.关键词：VRM;optimal load transient performance;dual-input buck converter;loading threshold2|2|0更新时间：2025-07-16
- 摘要：The probability hypothesis density(PHD)filter has been proved to be an efficient method for the multi-target tracking in the presence of false alarms,missed detections and an unknown number of targets.However,in the original PHD filter,a large amount of information of the existing targets will be immediately discarded by the PHD filter once they cannot be detected by a sensor at a given time.To resolve the information loss problem of missed true targets,we modify the predication and update equations of the PHD filter and propose a modified PHD filter with the capability of information hold.A Gaussian mixture implementation of the modified PHD filter for linear Gaussian models is also presented.The simulation results demonstrate that the proposed filter can achieve better tracking performance of multiple targets than the original PHD filter in the presence of missed detections.关键词：multi-target tracking;probability hypothesis density filter;Gaussian mixture implementation;linear Gaussian models2|2|8更新时间：2025-07-16
- 摘要：Nanoscale magnetic logic device is an emerging field-coupled computing paradigm,which can be used to realize nonvolatile and ultra low power magnetic logic circuits.However,stray fields and temperature fluctuation-induced thermal effects sometimes make device and circuit's switching unreliable.In this paper,switching behavior of nanomagnet with symmetrically missing isoceles triangle areas is in detail investigated; an approach of implementing reliable circuit switching by particular nanomagnet shape is proposed.Pipelined RS flip-flop circuit is designed with nanomagnet of particular shape; OOMMF is employed to simulate the circuit.The results show that the flip-flop constructed with nanomagnet of particular shape can not only perform reliable pipelining computing,but also demonstrate efficient device scaling and operability at high temperature.关键词：reliability;shape engineering;magnetic quantum cellular automata;nanomagnet;RS flip-flop2|2|3更新时间：2025-07-16
- 摘要：In this paper,on the basis of research of 1-bit detecting-correcting for ternary Hamming code,further research is carried out.With the form of extended ternary Hamming code proposed,the principle of Single Error Correction and Double Error Detection is proposed by analysis of the error in extended ternary Hamming code.By the two error-correcting tables presented the method of error correction of ternary Hamming code is obtained.Then the graph of error detection and correction conceptual structure of extended ternary Hamming code and its functional components are put forward in the ternary optical computer.The work provides a new approach for the design of detecting and correcting system optically.关键词：ternary optical computer (TOC);extended ternary hamming code;single error correction and double error detection (SEC-DED);error-correcting tables2|3|1更新时间：2025-07-16
- 摘要：After the bottle-neck of the adaptive compile system for Dalvik being analyzed,according to the scenery when the threshold counter decrements to zero,a lot of waiting time will be caused by system initialization,the strategy based on threshold reset is introduced.According to some applications centralized with hot-spot codes,which will caused a great deal of compiling work to be suspended,a strategy of dynamic adaptive threshold based on a result feedback mechanism,is implemented.It could maximize the performance enhanced by the dynamic compilation scheme.Compared to the Dalvik before optimization,the experimental result based on the platform of Galaxy S of Samsung Corporation indicates that the execution efficiency of loop operations is improved by 7% on average after optimized by the threshold reset strategy,the execution efficiency of conditional jump operations and instruction dispatch are improved by 5% on average and 8% assisted by the dynamic adaptive threshold scheme.关键词：Dalvik;Adaptive compilation system;threshold reset;dynamic adaptive threshold2|2|1更新时间：2025-07-16
- 摘要：In cognitive radio networks,spectrum handover occurs when a secondary user changes frequency due to the appearance of a primary user.Proactive spectrum handover may result in aggraded bandwidth utilization performance and degraded packet loss probability.Here,we develop a proactive spectrum handover mechanism by using an efficient packet scheduling algorithm,to reduce unusable channel.It effectively integrates two algorithms:spectrum hole filling algorithm and packet migration algorithm,to minimize packet loss probability and reduce the bandwidth fragment.The efficiency of the mechanism is validated by simulation results.关键词：cognitive radio networks;spectrum handover;packet scheduling2|2|1更新时间：2025-07-16
- 摘要：For the constant false alarm rate(CFAR)detector of coherent radar in time-frequency domain,there is always a wide performance gap between the theoretical model and the practical result.Ultimately,this problem is caused by the imperfect model of the clutter,as well as the limited samples.A novel method of estimating the detection threshold is proposed in this paper.The method is based on the least square criteria and derived from the relationship between the CFAR detection threshold and the probability of false alarm.The implementation for the proposed method is given as well.Simulation results confirm the validity of the proposed method.关键词：coherent radar;constant false alarm rate(CFAR);range-Doppler;sea clutter;least square method2|2|5更新时间：2025-07-16
- 摘要：In this paper,A method of computing steady-state responses of the nonlinear discrete systems to multiple input frequencies is presented by applying Picard Iteration Principle and knowledge of matrix theory and the general solutions of the nonlinear discrete systems to multiple input frequencies is given.By way of this algorithm,the steady-state responses of a nonlinear discrete system to the multiple input frequencies can be obtained by solving steady-state responses of the same linear discrete systems to different multiple input.In this paper,Lipschitz which can guarantee that there is a sole steady-state response of a nonlinear discrete system is presented through rigorous mathematical derivation and proof.The judging method is also presented to judge whether a nonlinear discrete system meet Lipschitz or not.Programs are developed using the MATLAB language based on the presented solution and plenty of typical examples are simulated to compute responses using these programs.Numerous computing results indicate that the method presented in the paper is correct and convergence is fast.关键词：nonlinear discrete systems;multiple input frequencies;picard iteration;Lipschitz;mathematical derivation2|2|3更新时间：2025-07-16
- 摘要：Traditional particle swarm optimization(PSO)algorithm tends to suffer from premature convergence;we proposed an elite opposition-based learning strategy in which elite particles are introduced to generate their opposite solutions by opposition-based learning.This mechanism can expand the search area and is helpful to enhance the global explorative ability of PSO.Meanwhile,a differential evolutionary mutation strategy is presented to avoid the best particle being trapped into local optima,since this may cause search stagnation of the whole swarm.This strategy adopts differential evolution algorithm to search for the neighborhoods of the global best particle and is helpful to enhance the exploitation ability of PSO.We compared our algorithm with some state-of-the-art PSOs on 14 benchmarks,the results show that our algorithm obtains better solution accuracy and quicker convergence speed.关键词：global optimization;particle swarm optimization;elite opposition-based learning;differential evolutionary mutation;population-based selection5|2|60更新时间：2025-07-16
- 摘要：In the Context-Aware location services,the opening characteristic of the mobile network brings some security risks for personal mobility data.The spatial-temporal correlation of the mobility data is a great challenge for protecting privacy of the users.To solve the background knowledge attack based on the spatial-temporal correlation,we proposed a privacy protection method based on multi-dimensional trajectory anonymity in this paper.This method is built on the anonymous trajectory data collection system and achieves the protection of user privacy through spatial-temporal anonymity algorithm based on the multi-user collaboration privacy protection mode.The experimental results demonstrated that this method can prevent the background knowledge attack based on the position and moving mode effectively and meets the demands of the privacy protect of k-Anonymity.关键词：privacy protect;anonymity;personal mobility data;location-based service2|2|7更新时间：2025-07-16
- 摘要：To solve the different Quality of Services(QoS)for data flows over wireless networks,based on the classical LV(Lotka-Volterra)model,this paper proposes a bio-inspired competition models for differential QoS services.The mapping relationship between wireless networks and ecosystem is set up.Traffic flows will be assigned with different priorities according to IEEE 802.11e protocol,and its sending rate can be calculated as the output of the proposed model through limited iterations(e.g,instantaneous value and steady-state value).The simulation results reveal that the proposed model achieves better performance than EDCA in terms of adaptability,scalability and fairness.关键词：QoS differential services;bio-inspired competition model;LV model;congestion2|2|0更新时间：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