Search

摘要： The study of training hyperparameters optimisation problems remains underexplored in skin lesion research.This is the first report of using hierarchical optimisation to improve computational effort in a four-dimensional search space for the problem.The authors explore training parameters selection in optimising the learning process of a model to differentiate pigmented lesions characteristics.In the authors'demonstration,pretrained GoogleNet is fine-tuned with a full training set by varying hyperparameters,namely epoch,mini-batch value,initial learning rate,and gradient threshold.The iterative search of the optimal global-local solution is by using the derivative-based method.The authors used non-parametric one-way ANOVA to test whether the classification accuracies differed for the variation in the training parameters.The authors identified the mini-batch size and initial learning rate as parameters that significantly influence the model's learning capability.The authors'results showed that a small fraction of combinations(5%)from constrained global search space,in contrarily to 82%at the local level,can converge with early stopping conditions.The mean(standard deviation,SD)validation accuracies increased from 78.4(4.44)%to 82.9(1.8)%using the authors'system.The fine-tuned model's performance measures evaluated on a testing dataset showed classification accuracy,precision,sensitivity,and specificity of 85.3%,75.6%,64.4%,and 97.2%,respectively.The authors'system achieves an overall better diagnosis performance than four state-of-the-art approaches via an improved search of parameters for a good adaptation of the model to the authors'dataset.The extended experiments also showed its superior performance consistency across different deep networks,where the overall classification accuracy increased by 5%with this technique.This approach reduces the risk of search being trapped in a suboptimal solution,and its use may be expanded to network architecture optimisation for enhanced diagnostic performance.

摘要： This research effort presents an approach to accomplish Multidimensional Scaling (MDS) via the heuristic approach of Simulated Annealing. Multidimensional scaling is an approach used to convert matrix-based similarity (or dissimilarity data) into spatial form, usually via two or three dimensions. Performing MDS has several important applications—Geographic Information Systems, DNA Sequencing, and Marketing Research are just a few. Traditionally, classical MDS decomposes the similarity or dissimilarity matrix into its eigensystem and uses the eigensystem to calculate spatial coordinates. Here, a heuristic search-based approach is used to find coordinates from a dissimilarity matrix that minimizes a cost function. The proposed methodology is used over a variety of problems. Experimentation shows that the presented methodology consistently outperforms solutions obtained via the classical MDS approach, and this approach can be used for other important applications.

摘要： “Did the Xia Dynasty actually exist?”This question has plagued archaeologists for decades.The Xia Dynasty(c.21st century-16th century BC)is often referenced in Chinese historical documents as the first hereditary dynasty.It is considered the first component of the Xia,Shang,and Zhou(c.11th century-256 BC)dynasties in ancient classic literature such as Shi Jing(The Book of Songs)from the pre-Qin period(prior to 221 BC)and Shi Ji(Historical Records),compiled during the Western Han Dynasty(206 BC-AD 24).However,in contrast to the Shang Dynasty(c.16th century-11th century BC),which left oracle bone inscriptions and Yin Ruins as evidence,the Xia Dynasty has not yet been fully recognized by academic circles due to a lack of internal evidence or written materials.

摘要： 金属切削加工方式的多样化,导致所使用的设备、刀具、方法以及工装夹具的多样化,该领域检索存在分类号较多、分类号不准、行业用语包括专业术语和口头化用语繁多,关键词扩展困难、噪音较大等特点.本文通过实际案例分析,阐述了读秀检索在该领域的应用,以提高检索效率.

摘要： A novel subspace projection anti-jamming algorithm based on spatial blind search is proposed,which uses multiple single-constrained subspace projection parallel filters.If the direction of arrival(DOA)of a satellite signal is unknown,the traditional subspace projection anti-jamming algorithm cannot form the correct beam pointing.To overcome the problem of the traditional subspace projection algorithm,multiple single-constrained subspace projection parallel filters are used.Every single-constrained anti-jamming subspace projection algorithm obtains the optimal weight vector by searching the DOA of the satellite signal and uses the output of cross correlation as a decision criterion.Test results show that the algorithm can suppress the jamming effectively,and generate high gain toward the desired signal.The research provides a new idea for the engineering implementation of a multi-beam anti-jamming algorithm based on subspace projection.

摘要： This paper presents the search technique for a lost target. A lost target is random walker on one of two intersected real lines, and the purpose is to detect the target as fast as possible. We have four searchers start from the point of intersection, they follow the so called Quasi-Coordinated search plan. The expected value of the first meeting time between one of the searchers and the target is investigated, also we show the existence of the optimal search strategy which minimizes this first meeting time.

摘要： In this paper, we study the quasi-coordinated search technique for a lost target assumed to move randomly on one of two disjoint lines according to a random walk motion, where there are two searchers beginning their search from the origin on the first line and other two searchers begin their search from the origin on the second line. But the motion of the two searchers on the first line is independent from the motion of the other two searchers on the second line. Here we introduce a model of search plan and investigate the expected value of the first meeting time between one of the searchers and the lost target. Also, we prove the existence of a search plan which minimizes the expected value of the first meeting time between one of the searchers and the target.

摘要： Purpose–The purpose of this paper is to present design and performance evaluation through simulation of a parking management system(PMS)for a fully automated,multi-story,puzzle-type and robotic parking structure with the overall objective of minimizing customer wait times while maximizing the space utilization.Design/methodology/approach–The presentation entails development and integration of a complete suite of path planning,elevator scheduling and resource allocation algorithms.The PMS aims to manage multiple concurrent requests,in real time and in a dynamic context,for storage and retrieval of vehicles loaded onto robotic carts for a fully automated,multi-story and driving-free parking structure.The algorithm suite employs the incremental informed search algorithm D*Lite with domain-specific heuristics and the uninformed search algorithm Uniform Cost Search for path search and planning.An optimization methodology based on nested partitions and Genetic algorithm is adapted for scheduling of a group of elevators.The study considered a typical business day scenario in the center of a metropolis.Findings–The simulation study indicates that the proposed design for the PMS is able to serve concurrent storage-retrieval requests representing a wide range of Poisson distributed customer arrival rates in real time while requiring reasonable computing resources under realistic scenarios.The customer waiting times for both storage andretrievalrequestsare withinacceptable bounds,whichare set as nomore than 5min,evenin the presence of up to 100 concurrent storage and retrieval requests.The design is able to accommodate a variety of customer arrival rates and presence of immobilized vehicles which are assumed to be scattered across the floors of the structure to make it possible for deployment in real-time environments.Originality/value–The intelligent system design is novel as the fully automated robotic parking structures are just in the process of being matured from a technology standpoint.

摘要： Google Book Search与HathiTrust是本世纪备受瞩目的两大电子文献数据库.通过对比分析这两大典型案例在资源建设方面注重纸质资源数字化、服务方式强调高效与深入、服务效果显著且影响深远等特点,得出对我国高校图书馆数字化建设与服务的启示:建立兼具现实意义与前瞻性的战略规划、优化数字资源建设、提升数据库服务功能、加强多元化联盟建设、注重版权管理、创新项目管理方式.

摘要： 随着互联网技术越来越深入人民的日常生活,各种数据呈爆炸式增长趋势,因此如何从海量的实时数据中迅速地获取用户需要的信息,变得越来越有必要性.电商平台是典型的应用,电商平台每天都会产生海量的交易数据和搜索数据,如何从用户的行为数据分析每个用户的购买习惯,给用户提供有效的推荐,是电商的重要工作,Elastic search搜索算法应用较为广泛.

摘要： As cyber-communities boom on the Internet, searching useful and reliable information in communities such as forums, newsgroups, and blogs is becoming a more and more important task. Unfortunately, most existing information retrieval systems which perform well on document collections and inter-connected web pages do not fit such task well. For example, Popular Internet search methods such as HITS and PageRank rely on the link structure of web pages which is often absent in the postings of cyber-communities. Traditional statistical information retrieval methods which treat the data as documents composed of terms cannot utilize some very important information like who wrote the document and how expert he was on the topic. In this paper, we proposed a novel framework which profiles individual's expertise and utilizes them to rank the postings.

摘要： 本发明请求保护一种基于全动态结构的低功耗Binary‑Search ADC系统，其包括自举采样电路、全动态带前置放大器的比较器阵列和解码器阵列，其中自举采样电路包括电荷泵电路、自举采样开关和采样电容；判决阵列包括每一级的动态前置放大器、动态比较器和后端解码器阵列。本发明的目的在于能够通过使电路中的主要模块全部改进为动态结构，当没有控制时序输入时电路不工作，且控制电路工作的大部分时序信号由电路结构本身产生，从而使功耗得到进一步降低。创新点在于相比较传统架构，本发明基于全动态结构对电路功耗的降低有着显著的效果。本发明的全动态结构不仅能降低电路功耗，而且动态放大器还减小了电路的失调电压影响，保证了精度。

摘要： 本发明公开了一种基于Elastic Search的双活实时数据仓库建设方法，涉及大数据实时计算技术领域，解决了现有技术中实时数据仓库建设存在数据的一致性无法保证的问题；本方案包括以下步骤：获取Elastic Search集群A中每个节点上的索引主分片，读取节点下每个主分片的预写日志记录；对读取的预写日志记录进行判断，将读取的数据通过同步阻塞的方式写入到Elastic Search集群B；将写入失败的数据重新写入，定时检测磁盘上存在的因写入失败而持久化的数据，将运行中的异常错误的消息发送到kafka集群中，接入监控实时告警。本发明可以保证两个集群中的数据完全一致，主要应用于大数据分析领域。

摘要： 本发明提供了一种基于Elastic Search的用户数据处理方法，通过在监测到用户数据对象变更请求时，按照用户数据对象变更请求对目标结构化数据库进行相应的用户数据对象操作；按照用户数据对象变更请求向Elastic Search发起索引调整请求，以使Elastic Search按照索引调整请求更新用户数据对象的Elastic Search数据索引。通过结构化数据库进行用户数据对象的存储，保障了数据一致性的要求，从而通过整合结构化数据库存储以及Elastic Search强大的分布式数据检索能力，解决在保证数据动态扩展属性、强一致性要求下的数据检索能力不足问题，保证数据在使用频率下的性能保证。

摘要： 本发明请求保护一种共用比较器的两通道时域交织型Binary‑Search ADC系统，其包括两通道自举采样选通电路、共用比较器的两通道比较电路、编码器电路和两通道数选电路，其中两通道自举采样选通电路包括子两通道数选电路、自举采样开关和采样电容；共用比较器的两通道比较电路包括每一级的三级动态比较器、时序选通逻辑和输出选通逻辑。本发明的目的在于能够使两通道时域交织型Binary‑Search ADC共用比较器，减少了一半的比较器数目，极大的降低了电路的功耗和版图面积。创新点在于相比传统两通道时域交织Binary‑Search ADC架构，本发明基于共用比较器的两通道电路对电路功耗和版图面积的降低有着显著的效果。

摘要： 本发明属于大数据技术领域，尤其涉及一种基于Elastic Search的血缘关系表示方法。拟解决现有技术中提到的基于图数据库下的血缘管理，存在后期使用、学习和维护管理成本高的问题。提供了如下技术方案，解析单元获取待解析的SQL语句，并对SQL语句进行解析得到表名、字段以及表与表之间的相互依赖数据结构；分析单元遍历步骤1中得到的结果，并将结果中的关系依次存入到Elastic Search中；展示单元查询Elastic Search中索引，得到血缘关系数据，前端进行血缘关系展示。通过将血缘关系数据用E l ast ic Search展示，将计算与存储有机结合一起，可以充分发挥E l ast ic Search的快速查询和维护管理方便的特性，降低了对于血缘关系的学习使用，管理和维护成本。

摘要： 本发明涉及计算机技术的技术领域，尤其是涉及一种基于JPS算法的寻路方法及系统，基于JPS算法的寻路方法包括以下步骤：S10：打开对应的美术地图，并打开地图编辑器，导出地图，创建寻路系统的载体；S20：通过场景编辑器打开对应的导出地图，编辑可行走、怪物、战斗、安全等区域信息，建立自动寻路系统必要的辨识信息；S30：导出场景配置，从上述过程生成的数据中获取JPS算法所需的加速数据信息；S40：读取上一步骤所获得的数据信息，对该二维数组进行分类，使用JPS算法加速配置，x_boundary和y_boundary字段，加速计算出跳点，快速得出寻路路径。本发明具有使游戏更加智能化，减轻玩家负担的效果。

摘要： 本发明涉及一种基于Selective Search和LeNet‑5的液体泄漏检测方法，包括下列步骤：从供暖站点的监控系统中截取管道状态的监控视频，包括存在管道的液体泄漏和其他干扰物体的图片；对采集视频的每张图片通过算法Selective Search从供暖管道所在的静态场景中提取出疑似泄漏液体的候选区域，包括泄漏的液体和其他干扰物体两种图片；将候选区域的数据集划分训练数据集和测试数据集；设置网络模型LeNet‑5的参数；对VGG‑16模型进行训练，并进行超参数的调整。

摘要： 本发明请求保护一种基于全动态结构的低功耗Binary‑Search ADC系统，其包括自举采样电路、全动态带前置放大器的比较器阵列和解码器阵列，其中自举采样电路包括电荷泵电路、自举采样开关和采样电容；判决阵列包括每一级的动态前置放大器、动态比较器和后端解码器阵列。本发明的目的在于能够通过使电路中的主要模块全部改进为动态结构，当没有控制时序输入时电路不工作，且控制电路工作的大部分时序信号由电路结构本身产生，从而使功耗得到进一步降低。创新点在于相比较传统架构，本发明基于全动态结构对电路功耗的降低有着显著的效果。本发明的全动态结构不仅能降低电路功耗，而且动态放大器还减小了电路的失调电压影响，保证了精度。

摘要： 本发明提供了一种Elastic Search集群间数据迁移方法、装置及系统，可用于人工智能技术领域，所述方法包括：将源ES集群中所有待迁移索引写入预设迁移队列中；根据迁移配置文件确定并行迁移的并行任务数量和迁移速度；启动所述并行任务数量对应的数据迁移进程根据所述迁移速度分别将所述并行任务数量对应的待迁移索引传输至目标ES集群，本发明可实现不同版本ES集群的数据批量迁移，提高ES集群的数据迁移效率。

摘要： 本发明公开一种基于Ternary Search Trie的电力设备模型特征匹配方法，包括以下步骤：步骤a，使用递归的方法将专业电力设备名称存放在三叉字典查找树中，建立起电力专业词库；步骤b，将电力专业词库中电力语术进行分词操作，统一数字书写；步骤c，基于分词的效果，计算电力设备模型特征语义相似度。本发明提供的一种基于Ternary Search Trie的电力设备模型特征匹配方法，选用三叉查询字典树，具备存储高效，查询快速优点；对设备名称进行数字书写统一，具有电力设备命名实体识别功能；考虑词序以及阿拉伯数字和特殊字符之间的相似性，适用于针对非常规设备编号的相似度计算问题。