检索结果-南通市图书馆

Tabu search algorithm combined with global perturbation for packing arbitrary sized circles into a circular container

在线全文

学校读者我要写书评

暂无评论

science china(Information sciences) 2013年第9期56卷 140-153页

作者： huang wenqi FU ZhangHua XU RuChu school of computer science and technology Huazhong University of Science and Technology

The arbitrary sized circle packing problem (ACP) is concerned about how to pack a number of arbitrary sized circles into a smallest possible circular container without overlapping. As a classical NP-hard problem, ACP is theoretically important and is often encountered in practical applications. Based on the already existing Quasi-physical method, this paper proposes a hybrid algorithm named GP-TS which combines tabu search with global perturbation to solve the two-dimensional ACP. The Quasi-physical method is a continuous optimization method which is used to obtain a local optimal configuration from any initial configuration. The tabu search procedure iteratively updates the incumbent configuration with its best neighboring configuration according to some forbidden rule and aspiration criterion. If the configuration obtained by the tabu search procedure does not satisfy the constraints, the global perturbation operator is subsequently applied in order that the search jumps out of the current local optimum without destroying the incumbent configuration too much. After that, the tabu search procedure is launched again. GP-TS is performed by repeating this process until the stop criterion is met. Computational experiments based on 3 sets of representative instances show that GP-TS can improve many best known results within reasonable time.

关键词： packing tabu search global perturbation quasi-physical quasi-human

Integrating AIDS-Agent Model and GIS

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Integrating AIDS-Agent Model and GIS

两种面向宇航应用的高可靠性抗辐射加固技术静态随机存储器单元

2012 International Conference on Network and Computational Intelligence(ICNCI 2012)

作者： Shuangyun Peng 1 + kun Yang 1 and Bangmei huang 2 1 school of Tourism and Geographical science Yunnan Normal university kunming china 2 kunming NO.10 Middle school kunming china

GIS is difficult to handle dynamic spatial information,especially spatial information with temporal and spatial *** agent can describe and deal with the intelligence,random geographical phenomenon,and the individual agent model can simulate the process of change over *** GIS and agent model can solve the GIS analysis of the phenomenon of dynamic geographic processing *** paper focuses on research the method of ***,sorting out the current mainstream integration approaches of Agent model and ***,using a component-based embedded integrated way for the agent’s own characteristics and is now the mainstream of development ***,an example of the integration experiment is tested based on AIDS spread.

关键词： Integrate AIDS-Agent model GIS

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

电子与信息学报 2024年第10期46卷 4072-4080页

作者：闫爱斌李坤黄正峰倪天明徐辉合肥工业大学微电子学院合肥230601 安徽工程大学集成电路学院芜湖241000 安徽理工大学计算机科学与工程学院淮南232001

CMOS尺寸的大幅缩小引发电路可靠性问题。该文介绍了两种高可靠的基于设计的抗辐射加固(RHBD)10T和12T抗辐射加固技术(SRAM)单元,它们可以防护单节点翻转(SNU)和双节点翻转(DNU)。10T单元主要由两个交叉耦合的输入分离反相器组成,该单... 详细信息

CMOS尺寸的大幅缩小引发电路可靠性问题。该文介绍了两种高可靠的基于设计的抗辐射加固(RHBD)10T和12T抗辐射加固技术(SRAM)单元,它们可以防护单节点翻转(SNU)和双节点翻转(DNU)。10T单元主要由两个交叉耦合的输入分离反相器组成,该单元可以通过其内部节点之间的反馈机制稳定地保持存储的值。由于仅使用少量晶体管,因此其在面积和功耗方面开销也较低。基于10T单元,提出了使用4个并行存取访问管的12T单元。与10T单元相比,12T单元的读/写访问时间更短,且具有相同的容错能力。仿真结果表明,所提单元可以从任意SNU和部分DNU中恢复。此外,与先进的加固SRAM单元相比,所提RHBD 12T单元平均可以节省16.8%的写访问时间、56.4%的读访问时间和10.2%的功耗,而平均牺牲了5.32%的硅面积。

关键词： CMOS 静态随机存储器单元抗辐射加固单节点翻转双节点翻转

一种基于关联程度的高效用数量比频繁模式挖掘算法

在线全文

学校读者我要写书评

暂无评论

计算机工程与科学 2024年第9期46卷 1702-1710页

作者：王辉李燕丁丁吴坤黄雅平中国铁道科学研究院电子计算技术研究所北京100081 北京交通大学计算机科学与技术学院北京100044 交通数据分析与挖掘北京市重点实验室北京100044

高效用频繁模式挖掘算法运用数据项的重要度信息,能够从数据中挖掘出更重要的频繁模式,而高效用数量比频繁模式挖掘算法可以进一步研究频繁模式中数据项的数量比例关系,是目前数据挖掘领域中的研究课题。从提高算法性能和实用性的角度... 详细信息

高效用频繁模式挖掘算法运用数据项的重要度信息,能够从数据中挖掘出更重要的频繁模式,而高效用数量比频繁模式挖掘算法可以进一步研究频繁模式中数据项的数量比例关系,是目前数据挖掘领域中的研究课题。从提高算法性能和实用性的角度出发对高效用数量比频繁模式挖掘算法进行优化,提出了一种基于关联程度的高效用数量比频繁模式挖掘算法RHUQI-Miner。RHUQI-Miner首先提出关联程度的概念,依据关联程度构建项目关联程度结构,并给出关联剪枝优化策略,寻找关联程度更高的项目集合,减少冗余和无效的频繁模式;随后运用修正模式长度策略,修正挖掘过程中项集的效用信息,使算法可根据实际数据情况控制输出频繁模式的长度,进一步提升算法的性能,提高算法的实用性。通过对RHUQI-Miner在动车组PHM系统车载故障数据集上的实验结果进行分析,表明该算法能够有效减少挖掘过程中的时间以及内存消耗,可以得出该算法适用于铁路实际数据和业务的有效结论。

关键词：高效用数量比频繁模式挖掘关联剪枝修正模式长度

Prediction of the lowest energy configuration for Lennard-Jones clusters

同方期刊数据库博看期刊评论

在线全文

学校读者我要写书评

暂无评论

science china Chemistry 2011年第7期54卷 985-991页

作者： LAI XiangJing XU RuChu huang wenqi school of computer science and technology Huazhong University of Science and Technology Wuhan 43007'4 China

Based on the work of previous researchers, a new unbiased optimization algorithm—the dynamic lattice searching method with two-phase local search and interior operation (DLS-TPIO)—is proposed in this paper. This algorithm is applied to the optimization of Lennard-Jones (LJ) clusters with N=2–650, 660, and 665–680. For each case, the putative global minimum reported in the Cambridge Cluster Database (CCD) is successfully found. Furthermore, for LJ533 and LJ536, the potential energies obtained in this study are superior to the previous best results. In DLS-TPIO, a combination of the interior operation, two-phase local search method and dynamic lattice searching method is adopted. At the initial stage of the optimization, the interior operation reduces the energy of the cluster, and gradually makes the configuration ordered by moving some surface atoms with high potential energy to the interior of the cluster. Meanwhile, the two-phase local search method guides the search to the more promising region of the configuration space. In this way the success rate of the algorithm is significantly increased. At the final stage of the optimization, in order to decrease energy of the cluster further, the positions of surface atoms are further optimized by using the dynamic lattice searching method. In addition, a simple new method to identify the central atom of icosahedral configurations is also presented. DLS-TPIO has higher computing speed and success rates than some well-known unbiased optimization methods in the literature.

关键词： global optimization Lennard-Jones clusters interior operation two-phase local search dynamic lattice searching

同方期刊数据库

Cryptanalysis and Improvement of a New Certificateless Signature Scheme in the Standard Model

在线全文

学校读者我要写书评

暂无评论

china Communications 2021年第1期18卷 151-160页

作者： Chenhuang Wu Hui huang kun Zhou Chunxiang Xu school of computer science and Engineering University of Electronic Science and Technology of ChinaChengdu 611731China Key Laboratory of Financial Mathematics(Putian university) Fujian Province UniversityPutian 351100China school of computer Minnan Normal UniversityZhangzhou 363000China

Digital signature,as an important cryptographic primitive,has been widely used in many application scenarios,such as e-commerce,authentication,cloud computing,and so *** Public Key Cryptography(PKC)can get rid of the certificate management problem in the traditional Public Key Infrastructure(PKI)and eliminate the key-escrow problem in the identity-based ***,a new Certificateless Signature(CLS)scheme has been proposed by Kyung-Ah Shim(IEEE SYSTEMS JOURNAL,2018,13(2)),which claimed to achieve provable security in the standard ***,we present a concrete attack to demonstrate that the scheme cannot defend against the Type I *** this type of attack,the adversary can replace the public key of the signer,and then he plays the role of the signer to forge a legal certificateless signature on any ***,we give an improved CLS scheme to resist such an *** terms of the efficiency and the signature length,the improved CLS is preferable to the original scheme and some recently proposed CLS schemes in the case of precomputation.

关键词： certificateless signature standard model attack

Low-noise InGaAs/InP single-photon detector with widely tunable repetition rates

在线全文

学校读者我要写书评

暂无评论

Photonics Research 2019年第3期7卷 I0001-I0006页

作者： YAN LIANG QILAI FEI ZHIhe LIU kun huang hePING ZENG Shanghai Key Laboratory of Modern Optical Systems Engineering Research Center of Optical Instruments and Systems Ministry of EducationSchool of Optical-Electrical and Computer Engineering University of Shanghai for Science and Technology State Key Laboratory of Precision Spectroscopy East China Normal University

InGaAs/InP avalanche photodiodes typically work in the gated Geiger mode to achieve near-infrared singlephoton detection. By using ultrashort gates and combining with the robust spike-canceling technique that consists of the capacitance-balancing and low-pass filtering technique, we demonstrate an InGaAs/InP single-photon detector(SPD) with widely tunable repetition rates in this paper. The operation frequency could be tuned conveniently from 100 MHz to 1.25 GHz with the SPD's performance measured to maintain good performance, making it quite suitable for quantum key distribution, laser ranging, and optical time domain reflectometry. Furthermore,the SPD exhibited extremely low-noise characteristics. The detection efficiency of this SPD could reach 20% with the dark count rate of 2.5 × 10^(-6)∕gate and after-pulse probability of 4.1% at 1 GHz.

关键词： InGaAs/InP single-photon detector achieve near-infrared singlephoton detection robust spike-canceling technique

ClusterSLAM:A SLAM backend for simultaneous rigid body clustering and motion estimation

在线全文

学校读者我要写书评

暂无评论

Computational Visual Media 2021年第1期7卷 87-101页

作者： Jiahui huang Sheng Yang Zishuo Zhao Yu-kun Lai Shi-Min Hu BNRist Department of Computer Science and TechnologyTsinghua UniversityBeijing 100084China Alibaba A.I.Labs Hangzhou 311121China school of computer science and Informatics Cardiff UniversityCardiffCF243AAUK

We present a practical backend for stereo visual SLAM which can simultaneously discover individual rigid bodies and compute their motions in dynamic *** recent factor graph based state optimization algorithms have shown their ability to robustly solve SLAM problems by treating dynamic objects as outliers,their dynamic motions are rarely *** this paper,we exploit the consensus of 3 D motions for landmarks extracted from the same rigid body for clustering,and to identify static and dynamic objects in a unified ***,our algorithm builds a noise-aware motion affinity matrix from landmarks,and uses agglomerative clustering to distinguish rigid *** decoupled factor graph optimization to revise their shapes and trajectories,we obtain an iterative scheme to update both cluster assignments and motion estimation *** on both synthetic scenes and KITTI demonstrate the capability of our approach,and further experiments considering online efficiency also show the effectiveness of our method for simultaneously tracking ego-motion and multiple objects.

关键词： dynamic SLAM motion segmentation scene perception

Energy-Aware GPU Programming at Source-Code Levels

在线全文

学校读者我要写书评

暂无评论

Tsinghua science and technology 2012年第3期17卷 278-286页

作者： Changyou Zhang kun huang Xiang Cui Yifeng Chen Key Laboratory of High Confidence Software Technologies(Peking university)school of Electronics Engineering and computer science Peking UniversityBeijing 100871China

To enhance the energy efficiency and performance of algorithms with Graphics Processing Unit （GPU） accelerators in source-code development, we consider the power efficiency based on data transfer bandwidth and power consumption in key situations. First, a set of primitives is abstracted from program statements. Then, data transfer bandwidth and power consumption in different granularity sizes are consid- ered and mapped into proper primitives. With these mappings, a programmer can intuitively determine the power efficiency and performance in different running states of a thread. Finally, this intuition enables the programmer to tune the algorithm in order to achieve the best energy efficiency and performance. Using these power-aware principles, two Fast Fourier Transform （FFT） methods are compared. The mapping be- tween power consumption and primitives is helpful for algorithm tuning in source-code levels.

关键词： GPU power-aware source-code primitive