检索结果-内蒙古大学图书馆

Research on the application of search algorithm in computer communication network

JOURNAL OF INTELLIGENT SYSTEMS 2022年第1期31卷 1150-1159页

作者： Ai, Hua Chai, Jianwei Zhang, Jilei Khanna, Shaweta Ghafoor, Kayhan Zrar Langfang Yanjing Vocat & Tech Coll Dept Comp Engn Langfang 065000 Hebei Peoples R China ITS Engn Coll Greater Noida UP India Knowledge Univ Dept Comp Sci Erbil 44001 Iraq

This article mitigates the challenges of previously reported literature by reducing the operating cost and improving the performance of network. A genetic algorithm-based tabu search methodology is proposed to solve the link capacity and traffic allocation (CFA) problem in a computer communication network. An efficient modern super-heuristic search method is used to influence the fixed cost, delay cost, and variable cost of a link on the total operating cost in the computer communication network are discussed. The article analyses a large number of computer simulation results to verify the effectiveness of the tabu search algorithm for CFA problems and also improves the quality of solutions significantly compared with traditional Lagrange relaxation and subgradient optimization algorithms. The experimental results show that with the increase of the weighted coefficient of variable cost, the proportion of variable cost in the total cost increases from 10 to 35%. The growth is relatively slow, and the fixed cost is still the main component. In addition, due to the increase in the variable cost, the tabu search algorithm will also choose the link with large luxury to reduce the variable cost, which makes the fixed cost slightly increase, while the network delay cost and average delay slightly decrease. The proposed method, when compared with the genetic algorithm, has more advantages for large-scale or heavy-load networks.

关键词： search algorithm harmony search algorithm communication network network optimization

来源：评论

学校读者我要写书评

暂无评论

COStar: A D-star Lite-based dynamic search algorithm for codon optimization

引用

JOURNAL OF THEORETICAL BIOLOGY 2014年 344卷 19-30页

作者： Liu, Xiaowu Deng, Riqiang Wang, Jinwen Wang, Xunzhang Sun Yat Sen Univ Sch Life Sci State Key Lab Biocontrol Guangzhou 510275 Guangdong Peoples R China

Codon optimized genes have two major advantages: they simplify de novo gene synthesis and increase the expression level in target hosts. Often they achieve this by altering codon usage in a given gene. Codon optimization is complex because it usually needs to achieve multiple opposing goals. In practice, finding an optimal sequence from the massive number of possible combinations of synonymous codons that can code for the same amino acid sequence is a challenging task. In this article, we introduce COStar, a D-star Lite-based dynamic search algorithm for codon optimization. The algorithm first maps the codon optimization problem into a weighted directed acyclic graph using a sliding window approach. Then, the D-star Lite algorithm is used to compute the shortest path from the start site to the target site in the resulting graph. Optimizing a gene is thus converted to a search in real-time for a shortest path in a generated graph. Using in silico experiments, the performance of the algorithm was shown by optimizing the different genes including the human genome. The results suggest that COStar is a promising codon optimization tool for de nova gene synthesis and heterologous gene expression. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Gene optimization search algorithm Gene synthesis Protein expression

来源：评论

学校读者我要写书评

暂无评论

A search algorithm for linear codes: progressive dimension growth

引用

DESIGNS CODES AND CRYPTOGRAPHY 2007年第2期45卷 213-217页

作者： Asamov, Tsvetan Aydin, Nuh Kenyon Coll Dept Math Gambier OH 43022 USA

This paper presents an algorithm, called progressive dimension growth (PDG), for the construction of linear codes with a pre-specified length and a minimum distance. A number of new linear codes over GF(5) that have b... 详细信息

关键词： new codes minimum distance bounds search algorithm progressive dimension growth (PDG)

来源：评论

学校读者我要写书评

暂无评论

Predicting shallow landslide size and location across a natural landscape: Application of a spectral clustering search algorithm

引用

JOURNAL OF GEOPHYSICAL REsearch-EARTH SURFACE 2015年第12期120卷 2552-2585页

作者： Bellugi, Dino Milledge, David G. Dietrich, William E. Perron, J. Taylor McKean, Jim MIT Dept Earth Atmospher & Planetary Sci Cambridge MA USA Univ Durham Dept Geog Durham England Univ Calif Berkeley Dept Earth & Planetary Sci Berkeley CA 94720 USA US Forest Serv Rocky Mt Res Stn USDA Boise ID USA

Predicting shallow landslide size and location across landscapes is important for understanding landscape form and evolution and for hazard identification. We test a recently developed model that couples a search algorithm with 3-D slope stability analysis that predicts these two key attributes in an intensively studied landscape with a 10 year landslide inventory. We use process-based submodels to estimate soil depth, root strength, and pore pressure for a sequence of landslide-triggering rainstorms. We parameterize submodels with field measurements independently of the slope stability model, without calibrating predictions to observations. The model generally reproduces observed landslide size and location distributions, overlaps 65% of observed landslides, and of these predicts size to within factors of 2 and 1.5 in 55% and 28% of cases, respectively. Five percent of the landscape is predicted unstable, compared to 2% recorded landslide area. Missed landslides are not due to the search algorithm but to the formulation and parameterization of the slope stability model and inaccuracy of observed landslide maps. Our model does not improve location prediction relative to infinite-slope methods but predicts landslide size, improves process representation, and reduces reliance on effective parameters. Increasing rainfall intensity or root cohesion generally increases landslide size and shifts locations down hollow axes, while increasing cohesion restricts unstable locations to areas with deepest soils. Our findings suggest that shallow landslide abundance, location, and size are ultimately controlled by covarying topographic, material, and hydrologic properties. Estimating the spatiotemporal patterns of root strength, pore pressure, and soil depth across a landscape may be the greatest remaining challenge.

关键词： shallow landslides landslide size and location hillslope geomorphology spectral clustering search algorithm computational modeling

来源：评论

学校读者我要写书评

暂无评论

A progressive damage model associated with dynamic fracture toughness and IFF criterion with a fast search algorithm of fracture angle

引用

COMPOSITE STRUCTURES 2024年 329卷

作者： Zhang, Zhuo Zhang, Kai Zheng, Bailin Tongji Univ Sch Aerosp Engn & Appl Mech Shanghai 200092 Peoples R China

This paper presents a quick search algorithm of the fracture angle of inter-fiber fracture (IFF) criterion and a progressive damage model considering the dynamic fracture toughness effect. The fracture angle determination of the IFF criterion is necessary and time-consuming, which has limited its practicality. Therefore, to accurately calculate stress exposure factors under various combinations of stress states, a highly efficient algorithm is needed. In this paper, a novel algorithm using stress tractions on the fracture plane and the golden section search (GSS) is promoted. Through a series of simulation tests, this novel algorithm has been proven to be exact and efficient compared with other two common algorithms, which saves an average of 63.2 % and 28.1 % of the time in 1 million calculations and 2 h 2 min 4 sec and 39 min 2 sec in simulations. Additionally, fracture toughness, which controls material damage evolution process, also has strain-rate effect like elastic modulus and strength. Hence, a new progressive damage model considering the dynamic fracture toughness effect is proposed. The results of dynamic compression and ballistic impact tests and simulations demonstrate the fidelity of the novel damage model.

关键词： CFRP search algorithm Dynamic fracture toughness Dynamic transverse compression Ballistic impact

来源：评论

学校读者我要写书评

暂无评论

Full-Featured search algorithm for Negative Electron-Transfer Dissociation

引用

JOURNAL OF PROTEOME REsearch 2016年第8期15卷 2768-2776页

作者： Riley, Nicholas M. Bern, Marshall Westphall, Michael S. Coon, Joshua J. Univ Wisconsin Dept Chem 1101 Univ Ave Madison WI 53706 USA Prot Metr Inc San Carlos CA 94070 USA Univ Wisconsin Genome Ctr Wisconsin Madison WI 53706 USA Univ Wisconsin Dept Biomol Chem Madison WI 53706 USA

Negative electron-transfer dissociation (NETD) has emerged as a premier tool for peptide anion analysis, offering access to acidic post-translational modifications and regions of the proteome that are intractable with traditional positive-mode approaches. Whole-proteome scale characterization is now possible with NETD, but proper informatic tools are needed to capitalize on advances in instrumentation. Currently only one database search algorithm (OMSSA) can process NETD data. Here we implement NETD search capabilities into the Byonic platform to improve the sensitivity of negative-mode data analyses, and we benchmark these improvements using 90 min LC-MS/MS analyses of tryptic peptides from human embryonic stem cells. With this new algorithm for searching NETD data, we improved the number of successfully identified spectra by as much as 80% and identified 8665 unique peptides, 24 639 peptide spectral matches, and 1338 proteins in activated-ion NETD analyses, more than doubling identifications from previous negative-mode characterizations of the human proteome. Furthermore, we reanalyzed our recently published large-scale, multienzyme negative-mode yeast proteome data, improving peptide and peptide spectral match identifications and considerably increasing protein sequence coverage. In all, we show that new informatics tools, in combination with recent advances in data acquisition, can significantly improve proteome characterization in negative-mode approaches.

关键词： negative mode peptide anions negative electron-transfer dissociation activated ion search algorithm two-dimensional target decoy multiple proteases

来源：评论

学校读者我要写书评

暂无评论

An efficient search algorithm for obtaining the optimal replenishment strategies in assembly-type just-in-time supply chain systems

引用

JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING 2018年第2期35卷 118-128页

作者： Yao, Ming-Jong Hsu, Tien-Cheng Natl Chiao Tung Univ Dept Transportat & Logist Management Hsinchu Taiwan Changhua Christian Hosp Informat Syst Dept Changhua Taiwan

An assembly-type just-in-time (JIT) supply chain system is composed of a main serial supply chain and several branching serial supply chains merging to the main supply chain. Under the assumption of constant demand rate, the replenishment problem in the assembly-type JIT supply chain systems can be formulated as a mixed-integer non-linear programming problem. We conduct thorough theoretical analysis on the properties of the objective function value curve in this study. Following our theoretical analysis, we propose a search algorithm that effectively solves an optimal solution. Our numerical experiments show that the average run time of the proposed algorithm grows in a linear order of the problem size, and the proposed algorithm may serve as an efficient solution approach for the decision-maker.

关键词： Kanban supply chain just-in-time mixed integer non-linear programming search algorithm

来源：评论

学校读者我要写书评

暂无评论

A Modified Quantum search algorithm

引用

INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS 2018年第12期57卷 3668-3681页

作者： Mehri-Dehnavi, Hossein Dashtianeh, Hasan Kuchaksaraei, Hossein Yahyavi Khoshdareh, Masumeh Mahmoodi Movahhedian, Hossein Rahimi, Robabeh Babol Noshirvani Univ Technol Dept Phys Shariati Ave Babol Sar *** Iran Shahrood Univ Technol Dept Phys Seventh Tir Sq Shahrood Iran Univ Chicago Dept Radiat & Cellular Oncol Chicago IL 60637 USA Univ Miami Sch Med Miami FL USA

We show that by adding a workspace qubit to Ahmed Younes, et al. algorithm (Younes et al. AIP Conf. Proc. 734:171, 2004, 2008), and applying newly defined partial diffusion operators on subsystems, the algorithm's... 详细信息

关键词： search algorithm Quantum algorithm Grover search algorithm

来源：评论

学校读者我要写书评

暂无评论

Biomedical Document Clustering Based on Accelerated Symbiotic Organisms search algorithm

引用

INTERNATIONAL JOURNAL OF SWARM INTELLIGENCE REsearch 2021年第4期12卷 169-185页

作者： Boushaki, Saida Ishak Bendjeghaba, Omar Kamel, Nadjet Univ MHammed Bouguera Boumerdes Comp Sci Dept Boumerdes Algeria Univ Mhammed Bouguera Boumerdes LREEI Boumerdes Algeria Ferhat Abbas Univ Setif 1 Comp Sci Dept LRSD Setif Algeria

Clustering is an important unsupervised analysis technique for big data mining. It finds its application in several domains including biomedical documents of the MEDLINE database. Document clustering algorithms based on metaheuristics is an active research area. However, these algorithms suffer from the problems of getting trapped in local optima, need many parameters to adjust, and the documents should be indexed by a high dimensionality matrix using the traditional vector space model. In order to overcome these limitations, in this paper a new documents clustering algorithm (ASOS-LSI) with no parameters is proposed. It is based on the recent symbiotic organisms search metaheuristic (SOS) and enhanced by an acceleration technique. Furthermore, the documents are represented by semantic indexing based on the famous latent semantic indexing (LSI). Conducted experiments on well-known biomedical documents datasets show the significant superiority of ASOS-LSI over five famous algorithms in terms of compactness, f-measure, purity, misclassified documents, entropy, and runtime.

关键词： Biomedical Documents Clustering Latent Semantic Indexing Metaheuristic Optimization Symbiotic Organisms search algorithm Vector Space Model

来源：评论

学校读者我要写书评

暂无评论

IBFS: A search algorithm based on index scheme in unstructured P2P network

IBFS: A search algorithm based on index scheme in unstructur...

引用

1st International Workshop on Education Technology and Computer Science

作者： Xu, Jingdong Qin, Jing Li, Xiao Wang, Jun Nankai Univ Dept Comp Sci Tianjin 300071 Peoples R China

ISBN: (纸本)9780769535579

In unstructured P2P file sharing systems, the ununiform distribution of file popularity causes damage to the usability of the system. The search for rare files has more chance to fail. Flooding algorithm with indices which are exchanged randomly based on Gossip protocol provides a success guarantee in a probability sense. However, the problem of low success rate and large numbers of messages still exist for queries of rare files. In this paper, we propose an index scheme and IBFS, a search algorithm based on node's information capacity. In contrast to the former, our method reduces 50% bandwidth consumption on average and performs efficient object discovery, making the system more stable and available..

关键词： P2P index scheme search algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：