摘要: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 uni verse and human society,which represents the philosophical thinking of ancestor about universe.Observing many significant scientific discoveries and breakthroughs such as the theory of binary discipline,atomic structure,DNA,etc.,we can find the corresponding form and philosophy in the Eight Diagrams and Sixty-four Diagrams.Thus,Philosophical Principles of Computer Architecture Design (PPCAD) is a natural phenomenon and mapping object of both form and mind of the I Ching.Learning from the Eight Diagrams and Sixty-four Diagrams,we aim to provide ideas and strategies for PPCAD.According to basic concept of PPCAD,this paper refines 4 pairs of the fundamental unity of opposites of deduction and then constructs a new version of the I Ching,the Eight Diagrams and Sixty-four Diagrams.Meanwhile,combining the hierarchical model approach in PPCAD,this paper offers the feature and dynamic nature of hierarchical model for the I Ching.In order to facilitate the I Ching model forPPCAD,we selects 10 new examples of Chinese divinatory symbols to illustrate and express it,and we also share our new observation on principles and strategies of PPCAD.Finally,this paper makes a conclusion and proposes the research plans for future works.
关键词:computer architecture;philosophical principles of design;the I Ching;Yi-Zhuan;model
摘要:To satisfy the senders' needs of sending multi-message in the broadcast communication environment,a certificateless signcryption scheme with multi-receiver and multi-message was proposed.The ciphertext no longer contains receivers' identity list to protect receivers' privacy.And,as well,the senders can fulfill sending multi-message in a single operation.Compared with the present scheme,apart from confidentiality and unforgery,this scheme is better in anonymity and has a higher computational efficiency,satisfy the needs of sending multi-message in broadcast communication environment.
摘要:Radio frequency identification(RFID) technology has the ability to automatically identify the target object.An adaptive searching prefix(AS) anti-collision algorithm for RFID based on encoding is proposed to reduce the identified time of the object tag.The reader makes full use of the collision information to adaptively generate a valid query prefix by asking the tags return the collision coded information.With no idle slots for tags to identify,AS reduces the number of queries and consumedly enhances the system efficiency.Besides,it has solved the problems of redundant data in the communication between the reader and the tags and other related issues.The effectiveness of the algorithm has been proved by the theoretical analysis in detail,and the error of the throughput between the values of the theory and the experiment does not exceed 5%.Simulation results show that AS not only achieves much better performance of the system,but also reduces the energy consumption of the tags.It improves the system efficiency by 72% and 20.1% respectively compared with Query Tree algorithm and Adaptive Multi-tree Search algorithm when the number of tags is over 1000,the throughput still maintains at about 61%.
关键词:radio frequency identification (RFID);anti-collision;encoding information bit;adaptive;idle slots
摘要:The nodes in Wireless Sensor Networks(WSNs)are usually powered by battery.It is extremely important to let the nodes deliver data to the destination in an energy-efficient manner such that the WSNs have longer runtime.In this paper,the Energy-efficient Reliable Opportunistic Routing(EROR)is presented.The EROR uses the forwarding cost,which takes into account node's residual energy and the total energy consumption expended by the nodes over a wireless link;chooses the forwarding set consisting of forwarding nodes(FNs),the main FN,and the assistant FNs;and allows a node to change its transmission power to transmit the encoded packets,which are generated by randomly linear network coding,to the forwarding set such that the data are delivered to the destination in a multi-hop,reliable,and energy-efficient way.Simulation results indicate that the EROR outperforms the existing CodePower routing in terms of network lifetime and energy consumption.
关键词:wireless sensor network;opportunistic routing;energy conservation;transmit power control;network coding
摘要:Bluetooth low energy (BLE) is designed for the devices with computational and power limitations.But it has been confirmed that Secure Simple Pairing (SSP) is vulnerable to the MITM attack.We identify the root causes of the problem:the pairing messages being tampered,and the vulnerability of the JW model.In this paper,we propose two hash-based SSP schemes for the devices in Mobile Cloud Computing (MCC).The proposed schemes enhance the SSP security with the help of MCC.Scheme I is applied into the devices which support the PE or OOB model.It uses the hash function to ensure the authenticity and integrity of the pairing messages.Scheme Ⅱ is suitable for the devices which only support the JW model.It improves the security of the JW model through using the hash array.At the end of this paper,we examine the performance for the proposed schemes,and perform the security analysis to show that they can provide the MITM protection against the adversaries with different levels of power.
摘要:To cope with the issue of determining cyclic shift coefficients of the quasi-cyclic sub-matrix in the Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes,a method was presented based on the arithmetic progression to compute the cyclic shift coefficients.By this method,a class of girth eight QC-LDPC codes for any column weight is obtained,and the cyclic shift coefficients can be expressed in simple analytic expressions to reduce required memory usage.Meanwhile,the encoding complexity is linearly proportional to code length due to the lower triangular parity matrix.The simulation result shows that column weight and girth have important influences on code performance.Furthermore,over an Additive White Gauss Noise (AWGN) channel and under the Belief Propagation (BP) decoding algorithm,the simulation results represent that bit error rate of the proposed QC-LDPC codes is no less than the LDPC codes in IEEE 802.11n and 802.16e with short code length,and is close to the LDPC codes in DVB-S2 with long code length.Moreover,the study result also confirms that the proposed algorithm has high flexibility with respect to the design of code length and rate.
摘要:Network virtualization has been proposed as a promising way for running multiple customized virtual networks (VNs) on a shared infrastructure.However,how to provide reliable VN against substrate infrastructure failures has become an increasingly important issue.In this paper,we present a novel VN mapping scheme based on cutset and congestion awareness for the VN topology remain maximizing connected in the event of single substrate node failure.Simulation results show that algorithm can gain more optimal substrate long-term average revenue compared to the previous algorithms without reserving protection resource.
关键词:network virtualization;virtual network mapping;maximizing VN topology connected;cutset and congestion awareness
摘要:The torsion codes and their applications of (1+2 λ)-constacyclic codes over the ring Z2m of arbitrary lengths are studied.The torsion codes of (1+2 λ)-constacyclic codes over Z2m are given firstly.Then by using the torsion codes,the homogeneous distance of some (1+2 λ)-constacyclic codes is obtained and it is proved that all (2m-1-1)-constacyclic self-dual codes over Z2m are Type I.Some extreme Type I codes are constructed from such constacyclic codes.
关键词:constacyclic codes;torsion codes;self-dual codes;distance distribution
摘要:The torsion codes and their applications of (1+2 λ)-constacyclic codes over the ring Z2m of arbitrary lengths are studied.The torsion codes of (1+2 λ)-constacyclic codes over Z2m are given firstly.Then by using the torsion codes,the homogeneous distance of some (1+2 λ)-constacyclic codes is obtained and it is proved that all (2m-1-1)-constacyclic self-dual codes over Z2m are Type I.Some extreme Type I codes are constructed from such constacyclic codes.
关键词:constacyclic codes;torsion codes;self-dual codes;distance distribution
摘要:For atmospheric weak turbulence channel model with lognormal distribution,a class of suitable polar codes was constructed based on Gaussian Approximation method.Then their error correction performance were simulated and analyzed over the channel with different turbulence strengths.Simulation results show that the constructed polar codes can get 1.0dB to 1.4dB coding gains at 1e-5 bit error rate,rather than the heuristic recursive structural polar codes under the same successive cancellation decoding algorithm.Furthermore,the performance of polar coded On-Off Keying (OOK) modulation and Pulse Position modulation (PPM) schemes was compared.The results show that polar coded 2-PPM modulation scheme can obtain better performance under weak turbulence channel conditions.
摘要:The security of CIKS-128 block cipher under related-key differential attack was studied.A related-key differential of high probability was constructed with the differential information leakages in the structure of DDPs and nonlinear functions.By proposing a corresponding key recovery attack based on the related-key differential,the master key of 192 bits was recovered.The rest 64 bits of the master key could be obtained by exhaustive search.The computational complexity,the data complexity and the memory complexity are 277 CIKS-128 block cipher encryptions,277 chosen-plaintexts and 225.4 bytes of storage resources,respectively.Analysis results show that CIKS-128 is unsafe under related-key differential attack.
摘要:Aggregate signature schemes are particularly useful for authentication in resource-constrained wireless networks for realizing batch verification.Certificateless cryptosystems can resolve the certificate management problem or key escrow problem in aggregate signature schemes.This paper firstly analyzed a certificatelss aggregate signature(CLAS) scheme.Then,a more efficient CLAS scheme that requires less bilinear paring operations was provided.The security analysis showed that this scheme can resist the forgery attack under the random oracle model,the security was equal to resolve CDH problem.
关键词:certificateless cryptography;aggregate signature;random oracle model
摘要:It is imperative to take reliable measures against outbreaks of malware to enable large-scale application of mobile wireless sensor networks (MWSNs).An effective measure is through dissemination of security patches to immunize or heal the nodes.Considering the mobile behavior of nodes,a malware propagation dynamic model is proposed based on epidemic theories.We formulate an optimal objective function subject to this model with immunization and heal proportion as optimal control variables.Our goal is to minimize the cost of the two measures and the number of infected nodes.Through stability analysis of equilibrium,we find the threshold whether a malware propagates or dies out.We used Pontryagin's maximum principle to obtain the optimal levels of the two controls.Simulation results show that the model play a significant role in building up the strategies of preventing malware from propagation in MWSNs.
关键词:optimal control pair;epidemic model;basic reproduction number;Pontryagin's maximum principle
摘要:Conflict is an essential concept in Petri net theory.The existing research focuses on the modelling and resolution strategies of conflict problems,but less on the computational complexity of the problems theirselves.In this paper,we propose the conflict set problem for Petri nets,and prove that the conflict set problem is NP-complete.Furthermore,we present a dynamic algorithm for the maximal conflict set enumeration.Our algorithm only computes those conflict sets that are affected by local firing,which avoids enumerating all maximal conflict sets at each marking.The algorithm needs time O(m2n) where m is the number of maximal conflict sets at the current marking and n is the number of transitions.Finally,we show that the maximal conflict set enumeration problem can be solved in O(n2) for free-choice nets and asymmetric choice nets.The results on complexity of thel conflict set problem provide a theoretical reference for solving conflict problems of Petri nets.
关键词:Petri nets;conflict set problem;NP completeness;maximal conflict set enumeration algorithm
摘要:Network physical topology discovery is very important for network management and application,the physical topology discovery based on AFT is a hot topic on current study.However,the incomplete AFT of network nodes in real network leads to the hardness of physical topology discovery.Based on decreasing the demand for the completeness of AFT in topology discovery,this paper defines three constraints of AFT,and proposes a tree-chopping algorithm based on AFT satisfying downstream constraint to discover the physical topology of a subnet.The proposed algorithm decreases the constraints for the completeness of AFT greatly,and demands the loosest constraint in physical topology discovery relying solely on downstream ports.The correctness and efficiency of the proposed algorithm is verified by the simulation experiment,and the algorithm applicability to real network is verified by deploying the algorithm in a real network management system.
摘要:To address the low efficiency problem caused by the approximate large-scale high-dimensional data query,we propose a novel high-dimensional index and KNN query method,called iPBM,which exploits two main problems,including the optimal division on the MapReduce's data block and their contributions to the computing.Specifically,based on the principles of relativity and parallelity,iPBM employs a two-phase partitioning scheme of clustering and zoning to equally split the data to the available blocks,then we design a distributed two-layer index structure and parallel KNN query algorithm.With fully considering the global index,local index and two-dimensional bitcode property,iPBM achieves triple-layers filtering,and thus the number of queried area and the computing cost on the high-dimensional data is minimized.The accuracy,efficiency and scalability of the proposed iPBM are thoroughly evaluated via detailed simulations.
关键词:cloud;MapReduce;KNN query;high-dimensional index
摘要:Based on fuzzy clustering,an unified form is presented for fuzzy clustering algorithm based on fuzzy entropy by introducing the generalized fuzzy entropy into objective function of fuzzy clustering,namely generalized entropy's fuzzy clustering model.Optimization problem for generalized entropy's objective function is solved using Hopfield neural network and multiple synapses based on augmented Lagrange method.After that,the generalized entropy's fuzzy clustering algorithm based on neural network is presented.And convergence of neural network is shown.At the same time,iterative method is given to determine Lagrange multipliers.In experiments,a synthetic data set and some standard UCI data sets are chosen to conduct some experimental studies.And clustering performance is compared with commonly used clustering algorithms.
摘要:For sentiment analysis of web short texts,a topic sentiment combining model (TSCM) is proposed based on LDA and web review behavioral theory,which is founded on the assumption that topic distribution of each sentence in a review is unique and different from that of other sentences.Generative process of TSCM is to first determine sentiment orientation of each word and then topic of each sentence in a review while taking word relation into consideration.Extensive experiments on real-world datasets (Movie and Amazon) show that TSCM significantly outperforms JST,S-LDA,D-PLDA and SAS in terms of the accuracy of sentiment classification and topic detection.
摘要:To solve the problem of low efficiency and poor accuracy on spatial data retrieval,this paper proposes a scene similarity retrieval method based on spatial object shape description model,spatial relationship description model and adaptive scene similarity computing model.Spatial object shape description model can accurately retrieve database objects satisfied with the sample object shape constraints,and improve the space object shape recognition accuracy.Spatial relationship description model can retrieve database scenes satisfied with relationship constraints of the sample scene,and improve the spatial relationship description precision.Adaptive scene similarity computing model can mark and sequence complete or incomplete matching scenes satisfied with shape and relationship constraints,improve the rationality of similarity scores on retrieval results.Experiments of simulative and real scenes show the scene similarity retrieval has a good retrieval performance.
关键词:spatial data retrieval;shape description;spatial relation description;spatial-scene similarity
摘要:In order to reconstruct 3D human pose from multi-view images accurately and effectively,a novel human pose estimation algorithm based on multi-kernel sparse coding is proposed.First,for the ambiguity of human pose estimation between the consecutive frames,we describe multi-view images using a special HA-SIFT descriptor,in which the human body local topology,relative coordinates and appearance information are encoded simultaneously;then,an objective function is established within the framework of multi-kernel learning,it takes both intrinsic manifold structure of the feature space and geometrical information of the pose space into consideration.The sparse coding,over-complete dictionary and multi-kernel weight are updated by optimizing the objective function iteratively in the Hilbert space;finally,the corresponding 3D human pose of the unknown input image is estimated by a linear combination of the bases of the human pose dictionary.The experimental results show that our proposed method provides higher accuracy of human pose estimation compared with kernel sparse coding,Laplace sparse coding and Bayesian sparse coding.
摘要:The Riemann integral form of limit of arithmetic mean value of a non-negative and Riemann integrable function with multiple variables in a bounded closed domain is proposed and proved.Secondly,the existence theorem of limit of generalized truth degree of a formula in n-valued R0 propositional logic is obtained.Thirdly,the theory of generalized truth degrees is proposed in continuously valued R0 propositional logic by combining of the Riemann integral form of limit of arithmetic mean value of a non-negative and Riemann integrable function with multiple variables in a bounded closed domain and the existence theorem of limit of generalized truth degree of a formula in n-valued R0 propositional logic,which provides the foundation for establishing theories of approximate reasoning and generalized integral semantics based on locally finite theory in R0 propositional logic.
关键词:quantitative logic;Riemann integral;R0propositional logic;locally finite theory;generalized truth degree
摘要:Gene memory is an important part of electronic cell,and the existing genes memory structure cannot take into account the reliability and hardware cost.A novel gene memory structure named partial-DNA cyclic memory was presented,and only part of the system's entire DNA was stored with correlated redundancy.The lost genes caused by faulty cells could be obtained through gene update according to the faulty cells' neighbor cells.The stored gene number is independent form the scale of embryonics array and target circuit,and can be set according to actual demand in design process.Theoretical analysis and simulation results show that the novel gene memory not only to achieve the embryonics array's functional differentiation and self-repair,but also reducing hardware overhead while keeping system reliability.The proposed gene memory can be used to design larger scale self-repair chip.
关键词:embryonics array;self-repair;partial-DNA cyclic memory;gene shift;gene backup number
摘要:A spatial Gamut Mapping Algorithm(GMA) was proposed in order to avoid the detail loss produced by pointwise GMAs.Firstly,the bilateral filter was employed to decompose the original image into a base layer image(containing image-edge information) and a detail layer image(containing image-texture information).Then the base layer image was gamut-clipped by the pointwise GMA that emphasizes chroma over luminance preservation.After the first gamut mapping process,the detail layer was added to the gamut-clipped base layer image.Finally,the merged image was gamut-clipped again by another pointwise GMA that emphasizes luminance over chroma preservation to get the final gamut-mapped image.The influences of different bilateral filter parameters on gamut mapping results and halo-artifacts were analyzed.The psychophysical experimental results show that the proposed spatial GMA with proper bilateral filtering parameters performs significantly better than standard pointwise GMAs and has almost same performance as another classical spatial GMA.In addition,the proposed spatial GMA can reduce the halo-artifacts much more effectively.
摘要:Medical image fusion has very important application value for medical image analysis and diseases diagnosis.According to the characteristics of multi modality medical image and human visual features,a new medical image fusion algorithm in NSCT (nonsubsampled coutourlet,NSCT) domain is proposed.Firstly,source images after registration are decomposed into low and high frequency sub-bands using NSCT.According to the low frequency subbands concentrating the majority energy of the source image and determining the image coutour,a fusion rule based on weighted region average energy combined with average gradient is adopted in low frequency subband coefficients.Moreover,according to human visual system which is more sensitive to contrast and edge,texture of image,the fusion strategy based on directive contrast integrated with the improved energy of Laplacian and PCNN (Pulse Coupled Neural Network,PCNN) are used to fuse high-frequency subbands.Furthermore,a closed loop feedback is introduced into the fusion rules of low and high frequency subbands to obtain optimal fused weights adaptively by using WSSIM (Weighted Structure Similarity,WSSIM) which highly consistent with the HVS(human visual features,HVS) as objective function.Finally,a lot of experiments of fusion of images including gray images and color images based on different fusion methods are conducted.The experiment results are analyzed in terms of visual quality and objective evaluation.The experiment results show that the proposed algorithm can effectively preserve information and significantly improve the performance of fusion image in terms of quantity of information,dispersed gray scale,visual quality and objective evaluation index.
关键词:medical image fusion;HVF (Human Visual Features);WSSIM (Weighted Structure Similarity);NSCT (Nonsubsampled Coutourlet);directive contrast integrated with the improved energy of Laplacian;PCNN (Pulse Coupled Neural Network)
摘要:To further enhance the illumination robustness of facial gradient features,an illumination robust low-rank relative gradient histogram feature extraction method (LR-RGHF) is proposed based on the property that low-rank decomposition can separate the intrinsic characteristic and sparse noise of an image effectively.In the first place,the relative gradient magnitude image and gradient direction information of each pixel is obtained by doing relative gradient operation on face image.In the next place,in order to remove the edge error caused by uneven illumination distribution,the relative gradient magnitude image is decomposed into its low-rank component and sparse noise component using low-rank decomposition.Finally,the low-rank component of relative gradient magnitude image is decomposed into several sub images according to its gradient direction information,each of the sub images is then filtered and encoded using local binary pattern to form the LR-RGHF.Experimental on the classical FERET subset and representative illumination subsets,YaleB and PIE subsets,illustrated that the recognition performance of LR-RGHF outperforms the recognition performances of relative gradient histogram feature (RGHF),patterns of oriented edge magnitudes (POEM) and low rank facial feature.On YaleB subset,the recognition accuracies of LR-RGHF are at least 4% higher than RGHF.Experimental results demonstrate that LR-RGHF reveals strong illumination robustness for face recognition,especially for uneven illumination distribution.
摘要:This paper considers how to obtain the maximum sum-rates by using the orthogonal random beamforming (ORBF) technique under the constraint on the average number of feedback users in the context of facing inter-beam interference scenarios.Aiming to solve this problem,a novel ORBF algorithm based on clustering and feedback threshold is proposed.The users are divided into multiple clusters according to their SNRs.The corresponding feedback threshold in each cluster is calculated by the tool of extreme value theory.Finally,the new ORBF algorithm is constructed based on clustering and multiple thresholds.We make some theoretical analysis on the algorithm and derive the upper bound of sum-rates loss;the scaling law of multiuser diversity gain is also exhibited.Simulation results not only verify the validity of our analysis but also show that,when compared with the classical ORBF technique,the proposed algorithm can considerably reduce the feedback load with a good sum-rates performance.
摘要:In current reconfigurable compiling approach for solving affine subscript operations,the automatic generated feeding memory system is not optimal,especially to support an iteration pipeline structure.This paper presents a parameterized parallel memory template to mine parallelism and reusability of data,which is considered to address the lack of such aspect in reconfigurable compilers at hand.According to the analysis of characteristics of data access to affine subscript arrays in pipeline iteration,our template configures alternative sub-structures such as parallel multi-bank memory,sequential access memory,RAW Buffer and Smart Buffer.Furthermore,in phase of calculating parameter values to fill the template,the memory data dependence graph method is used,in which approach the flexibility of way to create memory structure is kept.The experimental result shows that compared with related works,the compiler can generate reconfigurable hardware performing a higher execution speed with less resources usage by employ the proposed memory template.
关键词:affine array subscript;compiler for reconfigurable computing;memory architecture;data reuse;template
摘要:To overcome the deterioration of azimuth resolution caused by errors of monopulse response curve (MRC) in practical processing,this paper proposes an autofocusing algorithm for monopulse imaging technique.By applying iterative steps,this algorithm automatically extracts the echo signals of isolated strong scatterers from the received data,and employs them to accurately estimate the actual MRC.The estimated curve is then used in the procedure of monopulse imaging to autofocus the image in azimuth.As is verified by simulation and experimental results,this algorithm can effectivelyreduce the impact of MRC errors on monopulse imaging and is robust to most of the ground scenes,making it feasible in practical processing.
摘要:Principal Components Analysis Network (PCANet) is a feature extraction method based on deep learning theory and unsupervised learning modes,which overcomes the shortcoming of hand-crafted features and its efficiency has been only proved in several literatures for picture processing.In this paper,PCANet is applied to process the one dimensional signals for the first time in order to overcome the disadvantages of hand-crafted features from EEG signals in deception detection.PCANet is used to extract features from raw EEG signals in the deception detection experiment.The feature vectors were fed into three classifiers including Support Vector Machine (SVM) to classify the guilty and innocent subjects.The experimental result was compared with the results from other classifiers and the mode of using raw EEG signals as features.The experimental results show that the proposed method PCANet_SVM obtains the highest training and testing accuracy,which indicates the efficiency of extracting features from EEG signals and provides a new solution of detecting lying.
摘要:For the pilot-symbol-assisted-modulation (PSAM) short burst carrier synchronization,wepropose a simplified diagonal cross correlation carrier estimation algorithm based on phase un-wrapping method (PUW-SDCC).First according to the idea of the autocorrelation estimation,a diagonal cross correlation (DCC) algorithm is designed,and then a simplified DCC algorithm is derived by employing the exponent approximation of a complex signal.Finally,a PUW-SDCC algorithm is obtained by combining several phase un-wrapping (PUW) methods which are based on Monte-Carlo simulation.Simulation results show that the proposed algorithm achieves an estimation range at half of the data rate and has both higher accuracy and adequate complexity compared with those available,and more suitable for short burst communication.
摘要:This paper proposes an equalizer for lithium-ion battery and two different balancing strategies are used according to battery charging and discharging states.In battery charging state,the battery cell with the highest energy is balanced and discharged by the equalizer to improve charge capacity of the whole battery pack.In battery discharging state,the battery cell with the lowest energy is balanced and charged by the equalizer to improve discharge capacity of the whole battery pack.The balancing circuit uses an inductor as the energy storage element and the equivalent balancing circuits are the typical boost-buck chopper circuit and the buck chopper circuit,further the balancing current is controllable and adjustable.This paper draws working principle and control strategies of the equalizer.Furthermore the simulation and actual balancing experiments have been completed.Finally,the feasibility of the equalizer suggested in this paper is verified according to the balancing experimental results.
摘要:The convergence characteristics of Multi-scale Quantum Harmonic Oscillator Algorithm (MQHOA) prove that single scale convergence process cannot simultaneously get global search accuracy and local search accuracy.Only by multi-scale iteration can we gradually get the accurate position of the global optimum solution.MQHOA solves the optimization problem by two nested convergence processes:Quantum Harmonic Oscillator convergence process (QHO process) and Multi-scale convergence process (M process).QHO process shrinks the searching areas by the manner harmonic oscillator's wave function moving from high-energy state to low-energy state.M process shrinks the search areas by half cutting to improve searching precision.The wave function convergence theorem proves that sampling distribution is Gauss distribution when QHO process is convergent.By the wave function diagram in different energy level and scale,we can track the algorithm iterative process explicitly.The experiments demonstrate the shape of ground-state wave function,the existence of zero-point energy on the ground state,all of which exactly match the physical model of MQHOA.
摘要:To solve the problem that traditional spectrum sensing methods require a prior knowledge of the noise power and the primary user signal,and are vulnerable to noise uncertainty,signal set cardinality and contiguity based wideband spectrum sensing schemes are proposed for cognitive radios.The proposed schemes perform wideband spectrum sensing in two phases:estimation of the cardinality of occupied subbands set and decisions of the occupied subband location.Through different cardinality estimations,performance can be effectively improved by exploiting occupied subbands continuity feature.Theoretical analysis and simulation results verify that the proposed algorithm demands no a prior knowledge of the noise power and the primary user signal,and is robust against the noise power uncertainty problem.It can effectively discern subbands status blindly,compared with the conventional spectrum sensing methods.
关键词:cognitive radio;wideband spectrum sensing;subspace identification;energy detection;spectrum function
摘要:The truncating Fourier and continue wavelet representation of a discontinuous piecewise smooth signal will introduce an unneglectable error which was named as the Gibbs phenomenon. In this paper, we proposed an effective piecewise smooth signal approximation method. Firstly, a set of normal orthogonal piecewise polynomials was constructed according to the given positions of breaking points, and it has the properties of orthogonality, convergence and reproduction. Then the signal was orthogonal decomposed under this basis and the best square approximation result could be obtained using reconstruction. The numerical experiments show that our method have the higher accuracy approximation results than the other basis.
摘要:The application model in the Internet has shifted into information sharing,while the architecture is still based on the end-to-end communication.The conflict between them is becoming increasingly acute.To solve such a mismatch,ICN (Information-Centric Networking) is proposed.In this paper,a basic architecture framework for ICNs is first proposed,functional modules and properties are adopted to explore the design of ICN.Then,the relationships between ICN and other future network technologies are analyzed,the experiment platform and the deployment of ICN are discussed.Finally,crucial issues and future researches are concluded.
摘要:Wireless nanosensor networks (WNSNs) employing nano-electromagnetic communications,known as electromagnetic nanonetworks,are composed of many nanosensors communicating with each other.Because the nanosensors' energy is extremely limited,the energy efficiency become an important issue in electromagnetic nanonetworks.Firstly,WNSNs using terahertz communication are outlined.Then the state of the art in communication energy of electromagnetic nanonetworks is reviewed,in terms of on-off keying modulation and energy-efficient low-weight channel coding.Finally,the next research focuses of energy-efficient coding for electromagnetic nanonetworks are discussed.So far,Chinese literatures on WNSNs are rare.This work is hoped to forward the internal focuses and research on WNSNs.
摘要:Plan synthesis in an open world is challenging,since some objects in an open world might be unknown,then we need to consider various scenarios before planning.One way to solve this problem is to employ sensors to observe unknown objects,assuming the sensors are capable of correctly capturing all information needed for planning.Different with previous work,we turn to the crowd for help before doing planning.We assume there are abundant annotators available to provide information needed before planning,however there is possibly a substantial amount of discrepancy from the crowd in practice.It is thus challenging to solve the planning problem with possibly noisy information provided by the crowd.We propose a novel approach with two phases.We first build a set of propositions with variables,and collect values from crowd for those propositions.We then estimate the actual values of variables and transform the problem in an open world into a normal planning problem and solve it.Finally,we empirically exhibit the effectiveness of our approach.