基于Web的Internet化学资源挖掘

简要讨论了基于Web的Internet上化学资源挖掘的两种主要手段,着重介绍了利用搜索引擎和化学主题资源检索化学资源的具体方法。     

提取心脏截面图像上内腔的边缘曲线

针对心脏截面图像上内腔边缘形状起伏较大的特点 ,利用一种基本思想称为径向半径搜寻的方法 ,获取内腔边缘的包络曲线 .首先介绍的径向半径搜寻方法较以往的方法提高了对不光滑边缘轮廓提取的精确程度 ,然后对该方法进行改进 ,从而使心脏内腔边缘曲线的提取方法在鲁棒性、准确性方面较以往的方法有较大的提高 ,并具有普遍性     

电子超市易用性评估及链接结构优化模型

用无权有向图来描述网站结构，提出以网站是否方便顾问访问相关商品网页为标准的网站评估方法，建立了一种网站结构优化的数学模型，并采用禁忌搜索算法（TS）对问题进行求解，通过一个随机网站结构的例子，说明更新算法比布尔矩阵乘法以及重复调用广度优先算法进行TS领域搜索具有更高的效率，实例研究表明所述方法可以帮助网站设计者通过减少量的链接得到更加方便顾客使用的网站结构。     

Subset threshold autoregression

We develop in this paper an efficient way to select the best subset threshold autoregressive model. The proposed method uses a stochastic search idea. Differing from most conventional approaches, our method does not require us to fix the delay or the threshold parameters in advance. By adopting the Markov chain Monte Carlo techniques, we can identify the best subset model from a very large of number of possible models, and at the same time estimate the unknown parameters. A simulation experiment shows that the method is very effective. In its application to the US unemployment rate, the stochastic search method successfully selects lag one as the time delay and five best models from more than 4000 choices. Copyright © 2003 John Wiley & Sons, Ltd.     

基于时效性的垂直搜索及其应用

基于时效性信息的特征,构建了一个用来提高专业搜索的"查全、准、新率"的垂直搜索引擎. 以航空机票价格为例,分析了时效性信息的获取和过滤技术,并给出了基于时效性垂直搜索引擎的关键程序.     

障碍可越路线规划的符号图方法

本文给出２—Ｄ路线规划问题在障碍可越情况下的启发式符号方法．这一方法利用推理规则在由图像信息导出的连通图知识结构上进行启发式符号Ａ搜索以对空间关系进行分析和分类，以符号描述形式给出两声间路线规划方案．     

EQUILIBRIUM ALGORITHMS WITH NONMONOTONE LINE SEARCH TECHNIQUE FOR SOLVING THE TRAFFIC ASSIGNMENT PROBLEMS

This paper presents a unified bination algorithms （such as FrankWolfe problems. Global convergence results are framework of the nonmonotone convex comAlgorithm） for solving the traffic assignment established under mild conditions. The line search procedure used in our algorithm includes the nonmonotone Armijo rule, the non- monotone Goldstein rule and the nonmonotone Wolfe rule as special cases. So, the new algorithm can be viewed as a generalization of the regular convex combination algorithm.     

Distributed and Parallel Component Library

Software component library is the essential part of reuse-based software development. It is shown that making use of a single component library to store all kinds of components and from which components are searched is very inefficient. We construct multi-libraries to support software reuse and use PVM as development environments to imitate Iargescale computer, which is expected to fulfill distributed storage and parallel search of components efficiently and improve software reuse.     

利用早停可微架构搜索的三维点云模型分类

针对现有三维点云分类网络采用人工设计费时费力的问题,提出早停可微架构搜索(early-stopping differentiable architecture search,ES-DARTS)算法。利用从人工设计网络架构中提取到的先验知识,预定义一个包含高效候选操作的搜索空间,可快速搜索出适用于三维模型分类任务的高性能网络模型;通过追踪网络搜索阶段各候选操作的权重变化,找出跳跃连接操作在双重优化过程中发挥不公平竞争作用的临界点并在此处停止搜索,以保证各候选操作之间的稳定性,解决DARTS算法搜索过程中易出现性能崩溃的问题。提出的算法在ModelNet40数据集上达到了93.2%的识别准确率,比当前人工设计的主流网络具有更高的识别准确率。