检索结果-南通市图书馆

Quasi-physical global optimization method for solving the equal circle packing problem

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(Information sciences) 2011年第7期54卷 1333-1339页

作者： huang wenqi & YE Tao school of computer science and technology,huazhong university of science and technology,wuhan 430074,china 1. school of computer science and technology Huazhong University of Science and Technology Wuhan 430074 China

The equal circle packing problem is a well-known challenge in *** is also a natural,clear and fair test system for global *** paper presents a quasi-physical global optimization algorithm for solving the equal circle packing *** algorithm simulates two kinds of movements of N elastic disks: smooth movement driven by elastic pressures and violent movement driven by strong repulsive forces and attractive *** smooth movement makes the disks reach a locally optimal configuration,while the violent movement makes them jump out of the local optimum trap and reach a more promising *** algorithm is tested on the widely studied instances of N = 1,2,...,*** find better packings than the reported best-known ones on 37 instances and reproduce the best-known results on the remaining 113 instances.

关键词： equal circle packing global optimization quasi-physical method heuristic

Corner occupying theorem for the two-dimensional integral rectangle packing problem

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(Information sciences) 2012年第11期55卷 2466-2472页

作者： huang wenqi1,YE Tao1 & CheN DuanBing2 1school of computer science and technology,huazhong university of science and technology,wuhan 430074,china 2Web sciences Center,school of computer science,university of Electronic science and technology of china,Chengdu 611731,china 1. school of computer science and technology Huazhong University of Science and Technology Wuhan 430074 China2. Web Sciences Center School of Computer Science University of Electronic Science and Technology of China Chengdu 611731 China

This paper proves a corner occupying theorem for the two-dimensional integral rectangle packing problem,stating that if it is possible to orthogonally place n arbitrarily given integral rectangles into an integral rectangular container without overlapping,then we can achieve a feasible packing by successively placing a rectangle onto a bottom-left corner in the *** on this theorem,we might develop e?cient heuristic algorithms for solving the integral rectangle packing *** fact,as a vague conjecture,this theorem has been implicitly mentioned with different appearances by many people for a long time.

关键词： rectangle packing bottom-left corner occupying theorem NP hard

A heuristic algorithm for cube packing with time schedule

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(Information sciences) 2010年第1期53卷 18-29页

作者： LI Wei1, huang wenqi2, JIANG DongChen1 & LIU XiangLong1 1State Key Laboratory of Software Development Environment, Beihang university, Beijing 100191, china 2school of computer science and technology, huazhong university of science and technology, wuhan 430074, china 1. State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China2. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

Packing problem has been proved to be an NP-hard problem. Many algorithms such as simulation annealing algorithm, genetic algorithm and other heuristic algorithms have been proposed to solve twodimensional and three-dimensional packing problem. To solve the cube packing problem with time schedule, this paper first introduces some concepts such as packing level, space distance and average neighbor birth order and then proposes a greedy algorithm. The algorithm tries every feasible corner greedily to calculate the space utilization, packing level, space distance, average neighbor birth order of this placement, and chooses the best placement according to these criteria. Theoretical analysis indicates that the time complexity of this algorithm is O(A2B2C2T 2n5). The experiments show that the average space utilization of non-guillotine cutting test cases is 98.81%, and the average space utilization of guillotine cutting test cases achieves 99.87%. Furthermore, optimal solutions of more than half cases are achieved by this algorithm. The experimental results show that this algorithm can solve the problem of cube packing with time schedule effectively and effciently.

关键词： cube packing problem time schedule packing level space distance average neighbor birth order

Precise control of page cache for containers

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Frontiers of computer science 2024年第2期18卷 17-30页

作者： kun WANG Song WU Shengbang LI Zhuo huang Hao FAN Chen YU Hai JIN National Engineering Research Center for Big Data technology and System Services Computing Technology and System LabCluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Container-based virtualization isbecoming increasingly popular in cloud computing due to its efficiency and *** isolation is a fundamental property of *** works have indicated weak resource isolation could cause significant performance degradation for containerized applications and enhanced resource ***,current studies have almost not discussed the isolation problems of page cache which is a key resource for *** leverage memory cgroup to control page cache ***,existing policy introduces two major problems in a container-based ***,containers can utilize more memory than limited by their cgroup,effectively breaking memory ***,the Os kernel has to evict page cache to make space for newly-arrived memory requests,slowing down containerized *** paper performs an empirical study of these problems and demonstrates the performance impacts on containerized *** we propose pCache(precise control of page cache)to address the problems by dividing page cache into private and shared and controlling both kinds of page cache separately and *** do so,pCache leverages two new technologies:fair account(f-account)and evict on demand(EoD).F-account splits the shared page cache charging based on per-container share to prevent containers from using memory for free,enhancing memory *** EoD reduces unnecessary page cache evictions to avoid the performance *** evaluation results demonstrate that our system can effectively enhance memory isolation for containers and achieve substantial performance improvement over the original page cache management policy.

关键词： page cache memory cgroup container isolation cloud computing

High-resolution mid-infrared single-photon upconversion ranging

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Photonics Research 2024年第6期12卷 1294-1302页

作者： SHUHONG JIANG kun huang TINGTING YU JIANAN FANG BEN SUN YAN LIANG QIANG HAO E.WU MING YAN hePING ZENG State Key Laboratory of Precision Spectroscopy East China Normal UniversityShanghai 200062China Chongqing Key Laboratory of Precision Optics Chongqing Institute of East China Normal UniversityChongqing 401121China Collaborative Innovation Center of Extreme Optics Shanxi UniversityTaiyuan 030006China school of Optical Electrical and computer Engineering University of Shanghai for Science and TechnologyShanghai 200093China Shanghai Research Center for Quantum sciences Shanghai 201315China Guangyang Bay Laboratory Chongqing Institute for Brain and IntelligenceChongqing 400064China

Single-photon laser ranging has widespread applications in remote sensing and target ***,highly sensitive light detection and ranging(lidar)has long been restricted in the visible or near-infrared *** appealing quest is to extend the operation wavelength into the mid-infrared(MIR)region,which calls for an infrared photon-counting system at high detection sensitivity and precise temporal ***,we devise and demonstrate an MIR upconversion lidar based on nonlinear asynchronous optical ***,the infrared probe is interrogated in a nonlinear crystal by a train of pump pulses at a slightly different repetition rate,which favors temporal optical scanning at a picosecond timing resolution and a kilohertz refreshing rate ***,the cross-correlation upconversion trace is temporally stretched by a factor of 2×10^(4),which can thus be recorded by a low-bandwidth silicon *** combination with the time-correlated photon-counting technique,the achieved effective resolution is about two orders of magnitude better than the timing jitter of the detector itself,which facilitates a ranging precision of 4μm under a low detected flux of 8×10^(−5) photons per *** presented MIR time-of-flight range finder is featured with single-photon sensitivity and high positioning resolution,which would be particularly useful in infrared sensing and imaging in photon-starved scenarios.

关键词： resolution lidar repetition

在线全文

学校读者我要写书评

暂无评论

一种用于车间作业调度问题的智能枚举算法

计算机工程与应用 2004年第30期40卷 32-34,67页

作者：曾立平黄文奇华中科技大学计算机科学与技术学院武汉430074

车间作业调度问题是优化组合中一个著名的难题,即使规模不大的算例,优化算法的时间也很长。文章提出了一种求解车间作业调度问题的快速智能枚举算法,选取了22个标准算例作为算法的测试试验集,该算法在较短的时间内找到了17个算例的最优... 详细信息

车间作业调度问题是优化组合中一个著名的难题,即使规模不大的算例,优化算法的时间也很长。文章提出了一种求解车间作业调度问题的快速智能枚举算法,选取了22个标准算例作为算法的测试试验集,该算法在较短的时间内找到了17个算例的最优解,试验结果表明智能枚举算法确实是一种快速的、有效的求解车间作业调度问题的近似算法。

关键词：车问作业调度算法智能枚举

A pure quasi-human algorithm for solving the cuboid packing problem

在线全文

学校读者我要写书评

暂无评论

science in china(Series F) 2009年第1期52卷 52-58页

作者： huang wenqi he kun College of computer science and technology Huazhong University of Science and Technology Wuhan 430074 China

We excavate the wisdom from an old Chinese proverb ＂gold corner, silver side and strawy void＂, and further improve it into ＂maximum value in diamond cave＂ for solving the NP-hard cuboid packing problem. We extract, integrate and formalize the idea by west modern mathematical tools, and propose a pure quasi-human algorithm. The performance of the algorithm is evaluated on two sets of public benchmarks. For 100 strongly heterogeneous difficult benchmarks, experiments show an average packing utilization of 87.31%, which surpasses current best record reported in the literature by 1.83%. For 47 difficult benchmarks without orientation constraint, experiments show an average volume utilization of 92.05%, which improves current best record reported in the literature by 1.05%.

关键词： packing problem NP-hard heuristic quasi-human approach caving degree

基于改进DeepLabv3+的遥感影像道路提取算法

在线全文

学校读者我要写书评

暂无评论

计算机科学 2024年第8期51卷 168-175页

作者：王谦何朗王展青黄坤武汉理工大学理学院武汉430070

道路提取可以帮助人们更好地理解城市环境,是城市交通和城市规划等方面的重要部分,随着深度学习与计算机视觉的发展,利用基于深度学习的语义分割算法从遥感影像中提取道路的技术趋于成熟。针对现有的深度学习道路提取算法存在的提取速... 详细信息

道路提取可以帮助人们更好地理解城市环境,是城市交通和城市规划等方面的重要部分,随着深度学习与计算机视觉的发展,利用基于深度学习的语义分割算法从遥感影像中提取道路的技术趋于成熟。针对现有的深度学习道路提取算法存在的提取速度慢和容易受背景环境因素干扰而产生漏分割、不连续等问题,提出了一种基于ECANet注意力机制和级联空洞空间金字塔池化模块的轻量化算法CE-DeepLabv3+。首先,将主干特征提取网络更换为轻量级的MobileNetv2,减少参数量,提高模型的执行速度;其次,通过增加空洞空间金字塔池化模块的卷积层进一步扩大感受野,再级联不同特征层来增强语义信息的复用性,从而加强对细节特征的提取能力;再次,加入ECANet注意力机制,抑制背景环境中的干扰因素,聚焦道路信息;最后,采用改进的损失函数进行训练,消除了道路与背景样本不均衡对模型性能产生的影响。实验结果表明,改进算法的性能优良,与原始DeepLabv3+算法相比,在分割效率、分割精度上有较大的提升。

关键词：语义分割遥感影像道路提取注意力机制 DeepLabv3+ 级联空洞空间金字塔池化

Detecting somatisation disorder via speech:introducing the Shenzhen Somatisation Speech Corpus

在线全文

学校读者我要写书评

暂无评论

Intelligent Medicine 2024年第2期4卷 96-103页

作者： kun Qian Ruolan huang Zhihao Bao Yang Tan Zhonghao Zhao Mengkai Sun Bin Hu Björn W.Schuller Yoshiharu Yamamoto Key Laboratory of Brain health Intelligent Evaluation and Intervention Ministry of EducationBeijing Institute of TechnologyBeijing 100081China school of Medical technology Beijing Institute of TechnologyBeijing 100081China The First school of Clinical Medicine Southern Medical UniversityGuangzhouGuangdong 510515China Department of Neurology Shenzhen University General HospitalShenzhenGuangdong 518055China Group on Language Audio&MusicImperial College LondonLondon SW72AZUK Embedded Intelligence for health Care and Wellbeing University of AugsburgAugsburg 86159Germany Educational Physiology Laboratory Graduate School of EducationThe University of TokyoTokyo 113-0033Japan

Objective Speech recognition technology is widely used as a mature technical approach in many *** the study of depression recognition,speech signals are commonly used due to their convenience and ease of *** speech recognition is popular in the research field of depression recognition,it has been little studied in somatisation disorder *** reason for this is the lack of a publicly accessible database of relevant speech and benchmark *** this end,we introduced our somatisation disorder speech database and gave benchmark *** By collecting speech samples of somatisation disorder patients,in cooperation with the Shenzhen university General Hospital,we introduced our somatisation disorder speech database,the Shenzhen Somatisation Speech Corpus(SSSC).Moreover,a benchmark for SSSC using classic acoustic features and a machine learning model was proposed in our *** To obtain a more scientific benchmark,we compared and analysed the performance of different acoustic features,i.e.,the full ComPare feature set,or only Mel frequency cepstral coefficients(MFCCs),fundamental frequency(F0),and frequency and bandwidth of the formants(F1-F3).By comparison,the best result of our benchmark was the 76.0%unweighted average recall achieved by a support vector machine with formants F1–*** The proposal of SSSC may bridge a research gap in somatisation disorder,providing researchers with a publicly accessible speech *** addition,the results of the benchmark could show the scientific validity and feasibility of computer audition for speech recognition in somatization disorders.

关键词： Somatisation disorder Machine learning healthcare computer audition