检索结果-南通市图书馆

random sampling Scattered Data with Multivariate Bernstein Polynomials

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Annals of Mathematics,Series B 2014年第4期35卷 607-618页

作者： Feilong CAO Sheng XIA Department of Mathematics China Jiliang University

In this paper, the multivariate Bernstein polynomials defined on a simplex are viewed as sampling operators, and a generalization by allowing the sampling operators to take place at scattered sites is studied. Both stochastic and deterministic aspects are applied in the study. On the stochastic aspect, a Chebyshev type estimate for the sampling operators is established. On the deterministic aspect, combining the theory of uniform distribution and the discrepancy method, the rate of approximating continuous fimction and Lp convergence for these operators are studied, respectively.

关键词： Approximation Bernstein polynomials random sampling Scattereddata

维普期刊数据库

random sampling and performance analysis for Networked Systems

在线全文

学校读者我要写书评

暂无评论

Random Sampling and performance analysis for Networked Syste...

MMSE-based random sampling for iterative detection for large-scale MIMO systems

第36届中国控制会议

作者： Zibao Lu Yan Zhuang Lei Yuan School of Control Science and Engineering Dalian University of Technology College of Physics and Electronic Information Anhui Normal University

ISBN: (纸本)9781538629185

This paper investigates networked control systems using random sampling method which can be tuned by a continue time Markov *** sampling instants are modeled by using jumps between states of a continue time Markov *** there is a jump from a state in the Markov chain to a state that represent a subsystem in the networked system,we sample that particular subsystem and transmit its state measurement across the shared communication network to the corresponding *** minimizing a cost function which was introduced for this Markov Chain,we extract an optimal scheduling policy to fairly allocate the network resources among the *** statistical properties of this scheduling policy are studied to compute upper bounds for the closed-loop performance of the networked system.A numerical example has shown the usefulness of the proposed results.

关键词： Networked systems random sampling Markov chain

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Journal of Communications and Information Networks 2016年第2期1卷 29-36页

作者： CHOI Jinho BAI Lin School of Information and Communications Gwangju Institute of Science and Technology(GIST)Gwangju 500-712Korea School of Electronic and Information Engineering Beihang UniversityBeijing 100191China

Although large-scale MIMO can offer a high spectral efficie ncy,there are a number of difficulties in its *** those,the computational complexity of MIMO detection is crucial and may limit its use at devices of limited computing power such as users’mobile *** sampling for large-scale MIMO detection of low complexity were *** particular,a MMSE approach for random sampling,was formulated from which an iterative detector can be derived for better performances.

关键词： random sampling MMSE large-scale MIMO

A Pseudo random Number Generator under Windows Using Refined Descriptive sampling

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computer Technology and Application 2013年第2期4卷 85-92页

作者： Latifa Ourbih-Baghdali Megdouda Ourbih-Tari Abdenasser Dahmani Department of Infrastructures Base (DIB) ENSTP Kouba Algiers 16000 Algeria Laboratory of Applied Mathematics Department of Mathematics FES University of Bejaia Bejaia 06000 Algeria

In this paper, we propose a software component under Windows that generates pseudo random numbers using RDS （Refined Descriptive sampling） as required by the simulation. RDS is regarded as the best sampling method as shown in the literature. In order to validate the proposed component, its implementation is proposed on approximating integrals. The simulation results from RDS using ＂RDSRnd＂ generator were compared to those obtained using the generator ＂Rnd＂ included in the Pascal programming language under Windows. The best results are given by the proposed software component.

关键词： random sampling refined descriptive sampling software component simulation integral.

Compressed sensing digital receiver and orthogonal reconstructing algorithm for wideband ISAR radar

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2015年第2期58卷 21-30页

作者： HOU QingKai LIU Yang FAN LiJie SU ShaoYing National University of Defense Technology

This paper proposes a novel design of intermediate frequency(IF) digital receiver for wideband inverse synthetic aperture radar(ISAR) based on compressed sensing(CS). For the convenience in engineering application, we use random sampling in the digital receiver and make it possible to digitize the wideband IF signal using a commercial off-the-shelf analog-to-digital converter with sub-Nyquist sample rate. Besides, a novel basis for the sparse representation of real-valued ISAR radar echoes is built in this paper, and an orthogonal CS reconstructing algorithm is proposed based on this. Using our proposed method, the complex-valued range profile of target can be directly reconstructed from the subsampled real raw echo. The phase information of target range profile, which is very important for the coherent processing in ISAR imaging, is well reserved during the reconstruction. As a result, the down converter and matched filter, which are essential in conventional radar receiver, can be eliminated in our CS digital receiver. A series of simulation validates our design and demonstrates the feasibility of the sub-Nyquist sampling. The simulation results of ISAR imaging verify the validity and superiority of the proposed orthogonal reconstructing method.

关键词： compressed sensing ISAR imaging digital receiver random sampling orthogonal receiver

Adaptive Data Wiping Scheme with Adjustable Parameters for Ext4 File System

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2017年第2期26卷 392-398页

作者： ZHANG Peng NIU Shaozhang HUANG Zhenpeng QIN Xiaohua Beijing Key Laboratory of Intelligent Telecommunication Software and Multimedia Beijing University of Posts and Telecommunications School of Physics Electrical Engineering Ningxia University

Data wiping is a useful technology which can prevent possible data recovery in a file *** the growth of the amount of data usually leads to a decline in wiping *** order to make improvement,a novel data wiping scheme for Ext4 file system DWSE is *** includes two proposed algorithms for wiping files and free space *** to a rate of rest blocks which is specified by users,the file wiping algorithm WFile tries to clean part of a selected file for saving *** free space wiping algorithm WFree tries to speed up the process of cleaning dirty blocks by employing a random sampling and hypothesis testing method with two adjustable rates which represent status and content of a block group.A journal cleaning algorithm Clean J is also proposed which tries to clean old records by creating and deleting temporary files for preventing data recovery from a journal *** the help of parameters,users can wipe their data in a balanced way between security and *** experiments are performed on our *** experimental results show that our scheme can wipe files and free space in different security and efficiency with different *** scheme can achieve higher security and efficiency than other two data wiping schemes.

关键词： Data wiping Adjustable parameters Ext4 random sampling Hypothesis testing

Movement History of the Microcontinents from the Tibetan Plateau Based on Paleomagnetic Results with Sufficient sampling Units

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Earth Science 2022年第5期33卷 1072-1080页

作者： Yiming Ma Weimin Ruan Chao Niu Tianshui Yang School of Earth Sciences China University of GeosciencesWuhan 430074China College of Earth Sciences Guilin University of TechnologyGuilin 541004China State Key Laboratory of Biogeology and Environmental Geology China University of GeosciencesBeijing 100083China

Paleomagnetic results cannot be applied in global and regional tectonic reconstructions unless the paleosecular variation has been adequately ***,how many sampling sites and samples are enough to calculate a reliable paleopole remains *** on the relation among the sampling sites N,the precision parameter k,the virtual geomagnetic pole scatter s,and the confidence limit A_(95) of the paleopole,we find that 20 sites(samples)or more are required to yield a paleopole with an A_(95)≈5°based on a review of available paleomagnetic results from the Lhasa,Qiangtang and Tethyan *** samplings of Jurassic virtual geomagnetic poles from the Sangri area show that the Fisher mean pole with neglectable angle deviation can be obtained when sampling sites increase to ***-quality paleomagnetic results,with sites/samples number N/n≥~20–30,show that the Qiangtang,Lhasa,and Tethyan Himalaya moved northward in the Late Permian–Middle Triassic,Jurassic,and Cretaceous,respectively,and then accreted to Asia in the Late Triassic,Late Jurassic–Early Cretaceous and Paleocene–Early Eocene,respectively.

关键词： paleolatitude evolution Fisher mean random sampling sampling sites and samples continental collision tectonics

维普期刊数据库

CFSA-Net:Efficient Large-Scale Point Cloud Semantic Segmentation Based on Cross-Fusion Self-Attention

在线全文

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2023年第12期77卷 2677-2697页

作者： Jun Shu Shuai Wang Shiqi Yu Jie Zhang School of Electrical and Engineering Hubei University of TechnologyWuhan430068China Hubei Key Laboratory for High-Efficiency Utilization of Solar Energy and Operation Control of Energy Storage System Hubei University of TechnologyWuhan430068China School of Mechanical and Electrical Engineering Wuhan Donghu UniversityWuhan430212China

Traditional models for semantic segmentation in point clouds primarily focus on smaller ***,in real-world applications,point clouds often exhibit larger scales,leading to heavy computational and memory *** key to handling large-scale point clouds lies in leveraging random sampling,which offers higher computational efficiency and lower memory consumption compared to other sampling ***,the use of random sampling can potentially result in the loss of crucial points during the encoding *** address these issues,this paper proposes cross-fusion self-attention network(CFSA-Net),a lightweight and efficient network architecture specifically designed for directly processing large-scale point *** the core of this network is the incorporation of random sampling alongside a local feature extraction module based on cross-fusion self-attention(CFSA).This module effectively integrates long-range contextual dependencies between points by employing hierarchical position encoding(HPC).Furthermore,it enhances the interaction between each point’s coordinates and feature information through cross-fusion self-attention pooling,enabling the acquisition of more comprehensive geometric ***,a residual optimization(RO)structure is introduced to extend the receptive field of individual points by stacking hierarchical position encoding and cross-fusion self-attention pooling,thereby reducing the impact of information loss caused by random *** results on the Stanford Large-Scale 3D Indoor Spaces(S3DIS),Semantic3D,and SemanticKITTI datasets demonstrate the superiority of this algorithm over advanced approaches such as RandLA-Net and *** findings underscore the excellent performance of CFSA-Net in large-scale 3D semantic segmentation.

关键词： Semantic segmentation large-scale point cloud random sampling cross-fusion self-attention

Enhanced Multiparty Controlled QSDC Using GHZ State

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Communications in Theoretical Physics 2011年第6期55卷 1007-1011页

作者：高士闳蔡家纬黄宗立 Department of Computer Science and Information Engineering National Cheng Kung University Department of Physics National Cheng Kung University

Recently, Gao et al. [Opt. Commun. 283 （2010） 192] pointed out that Wang et al,＇s multiparty controlled quantum secure direct communication （CQSDC） protocol [Opt. Commun. 266 （2006） 732] has the information leakage problem and proposed an improved protocol. However, in the improved protocol, due to the introduction of an additional random sampling to avoid the weakness, the qubit efficiency is decreased. By introducing the base changing technique to the random sampling in Wang et al. ＇s protocol, this study overcomes the information leakage problem and provides a better qubit efficiency.

关键词： quantum secure direct communication random sampling

维普期刊数据库