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

作者： Li, Lei University of Connecticut

学位级别：Ph.D., Doctor of Philosophy

Genes, as functional fragments of DNA sequences, evolve inside genomes through evolutionary events such as gene duplication, gene loss, and horizontal gene transfer. These evolutionary events are often assumed to affect entire genes, rather than parts of genes. However, it is well understood that a majority of genes in eukaryotes consist of multiple protein domainsthat can be independently lost or gained during evolution. Despite the fact that a large amount of research has been conducted on protein domains, existing research generally focuses on detecting domains and on studying the domain content of genes. Thus, the study of domain evolution itself is still in its infancy, and the relationship between domain level, gene level, and species level evolution has not been sufficiently *** reconciliation is a powerful technique for inferring gene family evolution and is used to study the evolution of gene families inside species trees. In this dissertation, we develop an expanded reconciliation model that also accounts for domain evolution and explicitly captures the interdependence of domain, gene, and species level evolution. We show that the problem of finding an optimal reconciliation under this new Domain-Gene-Species (DGS) reconciliation model is NP-hard, and devise an effective heuristic algorithm as well as an ILP-based exact algorithm for the problem. Both algorithms are tested on a genome-wide data set containing thousands of domain families and gene families from 12 fly species. We also present an extended version of DGS model which reconciles multiple domain trees, multiple gene trees and a species tree simultaneously.

关键词： Phylogeny Protein Domain Reconciliation Integer Linear Programming dynamic algorithm

来源：评论

学校读者我要写书评

暂无评论

On Finding Optimal (dynamic) Arborescences

引用

algorithmS 2023年第12期16卷 559-559页

作者： Espada, Joaquim Francisco, Alexandre P. Rocher, Tatiana Russo, Luis M. S. Vaz, Catia Invest & Desenvolvimento Lisboa INESC ID Inst Engn Sistemas & Comp P-1000029 Lisbon Portugal Univ Lisbon Inst Super Tecn P-1049001 Lisbon Portugal Inst Politecn Lisboa Inst Super Engn Lisboa P-1959007 Lisbon Portugal

Let G=(V,E) be a directed and weighted graph with a vertex set V of size n and an edge set E of size m such that each edge (u,v)is an element of E has a real-valued weight w(u,c). An arborescence in G is a subgraph T=(V,E ') such that, for a vertex u is an element of V, which is the root, there is a unique path in T from u to any other vertex v is an element of V. The weight of T is the sum of the weights of its edges. In this paper, given G, we are interested in finding an arborescence in G with a minimum weight, i.e., an optimal arborescence. Furthermore, when G is subject to changes, namely, edge insertions and deletions, we are interested in efficiently maintaining a dynamic arborescence in G. This is a well-known problem with applications in several domains such as network design optimization and phylogenetic inference. In this paper, we revisit the algorithmic ideas proposed by several authors for this problem. We provide detailed pseudocode, as well as implementation details, and we present experimental results regarding large scale-free networks and phylogenetic inference. Our implementation is publicly available.

关键词： optimal arborescences Edmonds' algorithm dynamic algorithm algorithm engineering

来源：评论

学校读者我要写书评

暂无评论

Traffic Management algorithm for V2X-Based Flying Fog System 24th

Traffic Management Algorithm for V2X-Based Flying Fog System

引用

24th International Conference on Distributed and Computer and Communication Networks, DCCN 2021

作者： AlSweity, Malik Muthanna, Ammar Elgendy, Ibrahim A. Koucheryavy, Andrey The Bonch-Bruevich Saint-Petersburg State University of Telecommunications Pr. Bolshevikov 22 St. Petersburg193232 Russia 6 Miklukho-Maklaya Street Moscow117198 Russia School of Computer Science and Technology Harbin Institute of Technology Harbin China Department of Computer Science Faculty of Computers and Information Menoufia University Shibin el Kom32511 Egypt

ISBN: (纸本)9783030925062

V2X system support a large number of new services and protocols, therefore, moving to integrated interaction with the surrounding information space, defined as V2X interoperability, should ensure the interoperability of the various networks and systems involved in providing services to users [5]. The data must be transmitted with low latency and high speed between vehicles. This requires the introduction of a new high-speed network, advanced road transport, and telecommunications infrastructure. To ensure the effective functioning of V2X networks, in this paper we propose to use flying fog computing for a reliable and efficient system for simulation model, we used a UAVs as a base station (BS) equipped by a controller (CU) that provide execution of the requests arriving from the users equipment located in the communication range of the BS. Users that are connected with the BS requests flow that arrive at CU, we assume that one cloud server (CS) can serve a number of UAVs. CU is described as a service system which provides execution of some requests simultaneously. We assume that the execution of each request flow from users needs a fixed amount of energy. We’ve noticed that in the case of low traffic intensity the delay value increases with increasing of the part of traffic forwarded to the cloud, the energy consumption lower if the part of redirected traffic is bigger. © 2021, Springer Nature Switzerland AG.

关键词： 5G Core network dynamic algorithm Edge computing

来源：评论

学校读者我要写书评

暂无评论

3-D dynamic Path Planning for UAV Based on Interfered Fluid Flow

3-D Dynamic Path Planning for UAV Based on Interfered Fluid ...

引用

2014中国制导、导航与控制学术会议

作者： Peng Yao Honglun Wang Chang Liu School of Automation Science and Electrical Engineering Beihang UniversityBeijing 100191China Science and Technology on Aircraft Control LaboratoryBeihang UniversityBeijing100191 China School of Automation Science and Electrical EngineeringBeihang UniversityBeijing100191 China

ISBN: (纸本)9781479946983

A 3-D dynamic path-planning algorithm based on interfered fluid flow (DA) is proposed for unmanned aerial vehicle (UAV) in dynamic *** paper first describes the mathematical modeling of convex *** the static algorithm based on interfered fluid flow (SA) is introduced and improved,whose planning path conforms to the general characteristic of phenomenon that running water can avoid rock and arrive at *** updating the information of obstacles and obtaining the relative velocity,we then transform the dynamic problem to static ***,DA is simplified by adopting ***,this dynamic algorithm proves to be efficient for real-time path planning by simulation results.

关键词： autonomous aerial vehicles collision avoidance robot dynamics 3D dynamic path planning DA UAV convex obstacles dynamic algorithm dynamic environment interfered fluid flow mathematical modeling static algorithm unmanned aerial vehicle Aerodynamics Fluid flow Heuristic algorithms Modulation Path planning Planning Vehicle dynamics

来源：评论

学校读者我要写书评

暂无评论

Mit :: Lcs :: Tr :: Mit-Lcs-Tr-521

引用

2016年

Mit :: Lcs :: Tr :: Mit-Lcs-Tr-521 by published by

关键词： acquire algorithm algorithms dynamic dynamic algorithm dynamic figure dynamic lock lock lock algorithms lock throughput mcs mcs static mit-lcs-tr-521 mutual exclusion static static dynamic throughput writer writer bit writer lock

来源：评论

学校读者我要写书评

暂无评论

An Experimental Study of algorithms for Fully dynamic Transitive Closure

引用

ACM Journal of Experimental algorithmics 2008年第pp1–22期12卷 1-22页

作者： Krommidas, Ioannis Zaroliagis, Christos Computer Technology Institute Patras University Campus 26500 Patras N. Kazantzaki Str Greece Dept of Computer Engineering and Informatics University of Patras 26500 Patras Greece

We have conducted an extensive experimental study on algorithms for fully dynamic transitive closure. We have implemented the recent fully dynamic algorithms by King [1999], Roditty [2003], Roditty and Zwick [2002, 2004], and Demetrescu and Italiano [2000, 2005] along with several variants and compared them to pseudo fully dynamic and simple-minded algorithms developed in a previous study [Frigioniet al. 2001]. We tested and compared these implementations on random inputs, synthetic (worst-case) inputs, and on inputs motivated by real-world graphs. Our experiments reveal that some of the dynamic algorithms can really be of practical value in many situations. Categories and Subject Descriptors: G.2.1 [Combinatorics]: Combinatorial algorithms;G.2.2 [Graph Theory]: Graph algorithms, Network problems, Path and circuit problems;G.4 [Mathematical Software]: algorithm design and analysis;D.2.8 [Metrics]: Performance Measures;E.1 [Data Structures]: Graphs and Networks. © 2008, ACM. All rights reserved.

关键词： algorithm Design dynamic algorithm Experimentation Measurement path Performance reachability Transitive closure

来源：评论

学校读者我要写书评

暂无评论

New algorithm for Simulating Grout Diffusion and Migration in Fractured Rock Masses

引用

INTERNATIONAL JOURNAL OF GEOMECHANICS 2020年第3期20卷

作者： Liu, Bin Sang, Haomin Liu, Quansheng Kang, Yongshui Pan, Yucong Lu, Chaobo Zhang, Chuanqing Chinese Acad Sci Inst Rock & Soil Mech State Key Lab Geomech & Geotech Engn Wuhan 430071 Hubei Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China Wuhan Univ Sch Civil Engn Key Lab Safety Geotech & Struct Engn Hubei Prov Wuhan 430072 Hubei Peoples R China Guangxi Transportat Res Inst Nanning Nanning 530000 Guangxi Peoples R China

It is of crucial importance to develop an efficient numerical method to investigate the mechanism of grout diffusion and migration in fractured rock masses. However, most existing models only concentrate on the grout flow in a single fracture and most existing algorithms for large-scale fracture networks have high computational cost. A new dynamic diffusion and migration algorithm for grout was proposed and applied to the two-dimensional fracture network in this paper. Based on the geometric relationship between the fracture network nodes, an effective and feasible generation method of the connectivity matrix was proposed to realize the digitization of the topological structure of the fracture network. Finally, the Fracture Networks Grouting Diffusion Program (FNGDP) was developed to visualize the entire process of grout diffusion and migration in fracture networks. Compared with other algorithms, the proposed algorithm can realistically simulate the grouting process and greatly reduce computing time.

关键词： Fractured rock mass Grout diffusion and migration dynamic algorithm Connectivity matrix Fracture Networks Grouting Diffusion Program (FNGDP)

来源：评论

学校读者我要写书评

暂无评论

First clinical study data from therapeutic use of a novel continuous glucose monitoring system in the ICU

引用

Critical Care 2014年第1期18卷 1-182页

作者： N Scawn N Coulson I Kemp F Andrews V Mather C McGee P Candolfi J Goldstein The Liverpool Heart and Chest Hospital Liverpool UK Edwards Lifesciences Nyon Switzerland

来源：评论

学校读者我要写书评

暂无评论

A New Approach to Load Balancing algorithm in LVS Cluster System

A New Approach to Load Balancing Algorithm in LVS Cluster Sy...

引用

2006年国际电子、工程及科学领域的分布式计算和应用学术研讨会

作者： Wei Ma Center of Computing and Experimenting,South-Central University for Nationalities Wuhan,Hubei 430074,P.R.China Shijue Zheng,Li Gao,Jianhua Du Department of Computer Science,Hua Zhong Normal University Wuhan,Hubei 430079,P.R.China

In order to raise the availability of single server and avoid overload,the employment of sever cluster is an effective *** a means of implementation technology for the server cluster,Linux Virtual Server(LVS) cluster technology employs a load balancer to dispatch requests to the back end cluster servers. In a LVS system,how to provide services for more clients and reduce the average response time of requests is a critical *** to the weakness of current algorithms used in LVS cluster,we present a dynamic load balancing algorithm which can improve the performance of the *** the experiment,we found that our algorithm has better load balancing and faster response time of requests.

关键词： LVS Load Balancing dynamic algorithm

来源：评论

学校读者我要写书评

暂无评论

An approximate matching algorithm for finding (sub-)optimal sequences in S-attributed grammars

引用

BIOINFORMATICS 2002年第sup10期18卷 S250-S259页

作者： Waldispühl, J Behzadi, B Steyaert, JM Ecole Polytech LIX F-91128 Palaiseau France

Motivation: S-attributed grammars (a generalization of classical Context-Free grammars) provide a versatile formalism for sequence analysis which allows to express long range constraints: the RNA folding problem is a typical example of application. Efficient algorithms have been developed to solve problems expressed with these tools, which generally compute the optimal attribute of the sequence w.r.t. the grammar. However, it is often more meaningful and/or interesting from the biological point of view to consider almost optimal attributes as well as approximate sequences;we thus need more flexible and powerful algorithms able to perform these generalized analyses. Results: In this paper we present a basic algorithm which, given a grammar G and a sequence omega, computes the optimal attribute for all (approximate) strings omega(')is an element of L(G) such that d(omega, omega('))less than or equal to M, and whose complexity is O(n(r+1)) in time and O(n(2)) in space (r is the maximal length of the right-hand side of any production of G). We will also give some extensions and possible improvements of this algorithm.

关键词： S-Attribute Grammar Approximate matching dynamic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：