查询词典 shortest route problem

The results showed that karyotypic type of Ya01-21was 2n=104＝100m+4sm（4SAT）, Chromosome length ratio of the longest and the shortest 4.25, the average arm-ratio 1.35, belonging to 2C type of chromosome. Molecule identified combine with chromosome studied indicated that Ya01-21 was a progenies of Erianthus arundinaceum. following the law of n+n; ITS identify showed that Ya01-21 is a progenies of Erianthus arundinaceum, the somatic chromosome karyotypic type of Ya01-36 was 2n=132＝130m+2sm, Chromosome length ratio of the longest and the shortest 3.94, the average arm-ratio 1.27, belonging to 2B type of chromosome, combining the advance of characters the law of 2n+n can be resumed.

研究结果表明，崖城01－21的体细胞染色体核型公式为2n＝104＝100m+4sm（4SAT），最长与最短染色体的长度比为4.25，平均臂比1.35，染色体属2C型，分子鉴定结合细胞学研究认为其为斑茅的真实后代，其染色体遗传为n+n；崖城01－36经ITS签定为真实杂种，其体细胞染色体核型公式为2n＝132＝130m+2sm，最长与最短染色体的长度比为3.94，平均臂比1.27，染色体属2B型，结合其性状的进展，推断亲本向其传递染色体可能以2n+n的方式进行。

B Mine the core of consortium based on the Six Degrees of Separation and describe Shortest Path based on LINk wEight algorithm SPLINE（Shortest Path based on LINk wEight）.

b 基于六度分割和最短路径社团核心成员挖掘，讨论了计算节点间的最短路径，根据六度分割定理的剪枝，基于SPLINE算法和中心度挖掘犯罪子团伙中的核心的技术。

A fine-grained genetic algorithm based algorithm which is for the parameters optimization problem of agent model is proposed. The fine-grained genetic algorithm is used to solve the parameters optimization problem of agent model. As to the parameters optimization problem of the agents colony model, the first step is to define the concept of "the parameters mode of the combat agents colony" to describe the parameters of the combat agent colony model. Then the genetic algorithm is used to solve the optimization problem with the parameters mode of the combat agent colony model as the genetic individual. Besides the algorithm, the algorithm dispatch tactic is also considered. And the two level sequence dispatch tactic and the two level nesting dispatch tactic are put forward for those complex parameters optimization problem. At last, the model parameters optimization under antagonism codition is studied. The means to solve this problem is to translate it into a kind of antagonism problem, then use the competitive co-evolutionary genetic algorithms to solve it.

其中：提出了一种基于细粒度模型的作战智能体模型参数优化求解算法，用细粒度模型遗传算法求解作战智能体模型参数优化问题；提出了"作战智能体群体参数模式"的概念，对作战智能体群体模型参数进行形式化描述，再以作战智能体群体参数模式为遗传个体，应用遗传算法求解作战智能体群体模型参数的优化问题；研究了上述优化问题求解算法的调度策略，提出了分层模型参数优化算法的双层顺序调度策略和双层嵌套调度策略，解决复杂的模型参数优化问题；将对抗条件下作战模型参数的优化问题转化为一种对抗性问题，应用竞争性共同进化遗传算法，进行求解。

At last, the article indicates that there are some problems in capital management and put forward that we should improve capital management on nine facets we should change the role of government in capital management perfect law system environment of capital management , emphasis on internal recombination of enterprise , strengthen daytimeaudit and supervise in capital management to avoid profit package, strengthen adjustment of the right of assets , strengthen the role of invest bank in capital management , pay attention to recombination of immateriality assets ,emphasis on imagine package in the recombination enterprise ,call the ability of entrepreneur and so on to perfect capital management and solve some problems which enterprise confronts (1) solve the problem of poor enterprise (2) solve the problem of prepotent enterprise expansion (3) solve the problem of irrational form of recoinbinatiori enterprise (4)solve the problem of single right structure of enterprise (5)solve the problem of irrational asset collocation to induce bad effect (6)solve the problem of lack increment in development of enterprise (7)solve the problem of irrational structure so we induce enterprise to coruscate flesh vigor continually,and stock market will develop and boom continually.

最后提出了资本经营中存在的一些问题，提出要从九个方面着手改进资本经营，通过对政府在资本经营中角色的转换、健全和完善资本经营的法制环境、加强企业内部的重组、加强资本经营的审计与监督、防止利润包装、加强产权结构的调整、加强投资银行在资本经营中的作用、重视无形资产的重组、加强重组企业的形象包装和呼唤企业家才能等方面改善资本经营，解决企业经营所面临的一些问题：（1）解决劣势企业问题；（2）解决优势企业扩张问题；（3）解决企业重组形式不合理的问题；（4）解决企业产权结构一元化问题；（5）解决资源配置效益低下问题；（6）解决发展中增量不足的问题；（7）解决结构不合理的问题，这样才能使企业不断焕发出新的活力，证券市场才能不断繁荣发展。

In this paper, we have proposed a flexible encryption blocks selection buyer-seller watermarking protocol integrated the RSA asymmetric encryption system and homomorphism mechanism to protect the ownership of digital contents and fit real life. And consider the secondhand transaction in the real life. We also propose a buyer-reseller watermarking protocol based on the flexible encrypt blocks selection buyer-seller watermarking protocol to offer a solution of secondhand transaction. In our scheme, it's more light data transport requirement than other schemes. All roles in protocol will benefit by their participation. Our scheme can overcome various of the known attacks and security problems in the buyer-seller watermark protocol, such as buyer's right problem, unbinding problem, piracy tracing problem, conspiracy problem, buyer's participation in the dispute resolution problem, man-in-the-middle attack problem and anonymous problem. Furthermore, the seller and arbiter can verify the buyer's watermark without decrypting it in our scheme.

本文除应用RSA非对称式加密与秘密同态机制，提出了一个符合现实生活中买卖交易行为、可弹性调整加密范围数位内容买卖浮水印协定，强化了目前研究中对於数位内容买-卖浮水印协定的安全性，并进一步的考量二手商品交易行为，在可弹性调整加密范围数位内容买卖浮水印协定基础上，提出一个结合数位内容二手买卖与盗版追踪的二手数位内容买卖浮水印协定，达到让参予买卖的角色可以在安全的情形下完成二手数位内容所有权的移转并从中获取相对应利益的目标的数位内容转卖浮水印协定来增强了目前数位内容买卖浮水印协定研究中对於二手交易欠缺之处，解决了数位内容买卖浮水印协定中所可能遭遇的重要安全性议题，如：买方权益、盗版追踪、资讯不连结、共谋、买方需要参与仲裁、中间者攻击及匿名性问题。

Machine study algrithm for artificial intelligence and neural network, it can solve the problem of shortest route

人工智能及神经网络的机器学习算法，经典的遗传算法，在实际中可以解决选路问题及最短路径问题。

The realization of traveling salesman problem, to find the shortest route through all the points and back to square one.

详细说明：旅行商问题的实现，用来寻找一个最短的路线通过所有的点并回到原点。

Dijkstra algorithm and matrix iterative algorithm are important algorithms of the shortest route problem.In order to find which of the two algorithms is more efficient,the two algorithms were discussed,and their program flows were introduced.

Dijkstra算法和矩阵迭代算法都是最短路径问题的经典算法，为了研究这2种算法的计算效率，介绍了2种算法的基本思路和程序流程；通过对时间复杂度、结果和时间的关系指标进行多次计算，表现2者之间的效率差异。

It researches on the approach to achieve continuous connections of container multimodal transport logistics system. Based on the idea of continuous connections the paper discusses the container transport choosing route problem. It combines the appropriate adimensionalize method in the appraisement method and mathematic model and resolves the problem that the unit of time and cost disunite and sets up the time-cost transportation route optimizing model which is an innovation on the basis of previous studies and gives an example to validate the model using the LINDO software.

在"无缝衔接"的思想下研究集装箱运输路径选择问题，在前人的研究上进行了创新，将评价方法中的合适的无量纲化方法与数学模型结合，解决了时间和成本单位不统一的问题，建立了时间—成本运输径路优化模型，并举例验证应用LINDO软件进行求解，说明了此模型的正确性。

It researches on the approach to achieve continuous connections of container multimodal transport logistics system. Based on the idea of continuous connections the paper discusses the container transport choosing route problem. It combines the appropriate adimensionalize method in the appraisement method and mathematic model and resolves the problem that the unit of time and cost disunite and sets up the time-cost transportation route optimizing model which is an innovation on the basis of previous studies and gives an example to validate the model using the LINDO software.

在&无缝衔接&的思想下研究集装箱运输路径选择问题，在前人的研究上进行了创新，将评价方法中的合适的无量纲化方法与数学模型结合，解决了时间和成本单位不统一的问题，建立了时间—成本运输径路优化模型，并举例验证应用LINDO软件进行求解，说明了此模型的正确性。

Liapunov—Schmidt method is one of the most important method in the bifurcation theory.

Liapunov—Schmidt方法是分叉理论的最重要方法之一。

Be courteous -- even when people are most discourteous to you .

要有礼貌──即使当別人对你最不礼貌的时候。