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

5th National Conference on Advances in Enterprise Architecture, NCAEA 2021

作者： Shapour, Samin Kamandi, Ali University of Tehran Department of Algorithms and Computation Tehran Iran

ISBN: (纸本)9781665407915

With due attention to the development of cyberspace and its strategic importance for organizations, some tools are needed to plan information technology systematically. Assessment of e-readiness is a prerequisite for precise and strategic planning for a balanced and all-inclusive information technology both at national and organizational levels. In recent years, numerous models have been proposed by universities and associations that each comes with specific functions. However, to gain a detailed assessment of the e-readiness of organizations, customized models are needed to cover the most critical and pertinent aspects of a particular industry or organization. Hitherto no specific methodology is presented to compose or customize such a model. This paper presents a framework and a process to design and customize e-readiness assessment for a specific organization. The proposed method of this paper, which is customized in assessment frameworks, is based on a well-known software engineering method called situational method engineering. © 2021 IEEE.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

A Flexible Divisive Algorithm for Overlapping Community Detection Based on Community Structure

SSRN

引用

SSRN 2024年

作者： Moeini, Ali Javan, Abolfazl Khoshnood, Asieh Hosseini, Mahsa Hafizi Department of Algorithms and Computation School of Engineering Science College of Engineering University of Tehran 16 Azar Tehran Tehran*** Iran

The proliferation of networks has brought forth a multitude of challenges in the field. Among these challenges, the identification of communities stands as a crucial issue. In this study, we tackle the problem of detecting overlapping communities by harnessing the concept of community and leveraging the vertex Betweenness centrality measure. The algorithm proposed in this paper showcases remarkable controllability and adaptability, making it suitable for a wide array of complex networks with diverse structures. Furthermore, this article presents a comprehensive analysis of the algorithm's complexity, shedding light on its computational efficiency. Moreover, in this paper, the proposed algorithm will be evaluated on two real network datasets "E-mail network" and "Youtube online social network". The simulation results on real datasets show the favorable performance of the proposed algorithm. © 2024, The Authors. All rights reserved.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Unveiling Medical Insights: Advanced Topic Extraction from Scientific Articles

Unveiling Medical Insights: Advanced Topic Extraction from S...

引用

34th Medical Informatics Europe Conference, MIE 2024

作者： Bitaraf, Ehsan Jafarpour, Maryam Shool, Sina Saboori Amleshi, Reza Rajaie Cardiovascular Medical and Research Center Iran University of Medical Sciences Tehran Iran Department of Algorithms and Computation School of Engineering Science College of Engineering University of Tehran Tehran Iran Center for Medical Data Science Medical University of Vienna Vienna Austria

ISBN: (纸本)9781643685335

In the ever-evolving landscape of medical research and healthcare, the abundance of scientific articles presents both a treasure trove of knowledge and a daunting challenge. Researchers, clinicians, and data scientists grapple with vast amounts of unstructured information, seeking to extract meaningful insights that can drive advancements in the biomedical domain including, research trends, patient care, drug discovery, and disease understanding. This paper utilizes the topic extraction algorithms on Breast Cancer Research to shed light on the current trends and the path to follow in this field. We utilized TextRank and Large Language Models (LLM) using the TripleA tool to extract topics in the field, analyzing and comparing the results. © 2024 The Authors.

关键词： Drug discovery

来源：评论

学校读者我要写书评

暂无评论

Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time 40

Fully Dynamic Maximum Independent Sets of Disks in Polylogar...

引用

40th International Symposium on computational Geometry, SoCG 2024

作者： Bhore, Sujoy Nöllenburg, Martin Tóth, Csaba D. Wulms, Jules Department of Computer Science and Engineering Indian Institute of Technology Bombay Mumbai India Institute of Logic and Computation Algorithms and Complexity Group TU Wien Austria Department of Mathematics California State University Northridge Los AngelesCA United States Department of Computer Science Tufts University MedfordMA United States Department of Mathematics and Computer Science TU Eindhoven Netherlands

ISBN: (纸本)9783959773164

A fundamental question is whether one can maintain a maximum independent set (MIS) in polylogarithmic update time for a dynamic collection of geometric objects in Euclidean space. For a set of intervals, it is known that no dynamic algorithm can maintain an exact MIS in sublinear update time. Therefore, the typical objective is to explore the trade-off between update time and solution size. Substantial efforts have been made in recent years to understand this question for various families of geometric objects, such as intervals, hypercubes, hyperrectangles, and fat objects. We present the first fully dynamic approximation algorithm for disks of arbitrary radii in the plane that maintains a constant-factor approximate MIS in polylogarithmic expected amortized update time. Moreover, for a fully dynamic set of n unit disks in the plane, we show that a 12-approximate MIS can be maintained with worst-case update time O(log n), and optimal output-sensitive reporting. This result generalizes to fat objects of comparable sizes in any fixed dimension d, where the approximation ratio depends on the dimension and the fatness parameter. Further, we note that, even for a dynamic set of disks of unit radius in the plane, it is impossible to maintain O(1 + Ε)-approximate MIS in truly sublinear update time, under standard complexity assumptions. Our results build on two recent technical tools: (i) The MIX algorithm by Cardinal et al. (ESA 2021) that can smoothly transition from one independent set to another;hence it suffices to maintain a family of independent sets where the largest one is an O(1)-approximate MIS. (ii) A dynamic nearest/farthest neighbor data structure for disks by Kaplan et al. (DCG 2020) and Liu (SICOMP 2022), which generalizes the dynamic convex hull data structure by Chan (JACM 2010), and quickly yields a "replacement" disk (if any) when a disk in one of our independent sets is deleted. © Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, and Jules Wulms.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Triple A (AAA): A Tool to Analyze Scientific Literature Metadata with Complex Network Parameters 9

Triple A (AAA): A Tool to Analyze Scientific Literature Meta...

引用

9th International Conference on Web Research, ICWR 2023

作者： Jafarpour, Maryam Bitaraf, Ehsan Moeini, Ali Nahvijou, Azin University of Tehran School of Engineering Science College of Engineering Department of Algorithms and Computation Tehran Iran Iran University of Medical Sciences Center for Statistics and Information Technology Tehran Iran Tehran University of Medical Sciences Cancer Research Centre Cancer Institute Tehran Iran

ISBN: (纸本)9798350399691

It is essential to analyze scientific literature when conducting review studies (systematic, narrative, etc.). Review articles can improve in quality by choosing or incorporating papers with high research impact. The quality of research has been measured using a variety of indicators. These metrics primarily address certain characteristics like the citation index. It is impossible to study the caliber of research in any field on an individual basis. It has to do with connections. Therefore, it would be advantageous to create a network of research items. In this study, we introduce a novel tool for the analysis of metadata in scientific literature. We tested our technique on the literature of breast cancer. The tool extracted 49,604 papers resulting in 575,894 nodes and 1,532,328edges. We looked at the topological and structural characteristics of the constructed network, briefly. However, this tool can be utilized in any other domain of interest. © 2023 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Software Reliability Prediction: A Machine Learning and Approximation Bayesian Inference Approach

SSRN

引用

SSRN 2022年

作者： Moeini, Ali Oveisi, Shahrzad Farsi, Mohammad Ali Mirzaei, Sayeh Department of Algorithms and Computation School of Engineering Sciences College of Engineering University of Tehran Tehran Iran Tehran Iran

Reliability growth models are classified into two main groups, namely parametric and non-parametric models. Parametric models (SRGM) are usually based on a set of hypotheses that can eventually affect the accuracy of model predictions. In contrast, non-parametric models (e.g. neural networks) can predict the model based only on the training data without any hypothesis on the model itself. In this paper, a number of methods have been proposed to increase the accuracy of predictions in the context of software reliability. First, we present two gradient-based methods for estimating the parameters of a number of classical SRGM models. We then propose methods involving LSTM Encoder-Decoder and Bayesian approximation in Langevin Gradient and Variational inference neural networks, as well as a training algorithm using genetic algorithm. The proposed models are compared with neural-network-based software reliability models using three real-world software failure datasets. Experimental results show that the proposed non-parametric models outperform most classical parametric and non-parametric models. © 2022, The Authors. All rights reserved.

关键词： Software reliability

来源：评论

学校读者我要写书评

暂无评论

Advancing Cardiovascular Research: A Tailored Knowledge Graph Schema for Scholarly Data

Advancing Cardiovascular Research: A Tailored Knowledge Grap...

引用

International Conference on Web Research (ICWR)

作者： Ehsan Bitaraf Maryam Jafarpour Ali Moeini Sina Shool Mahmood Tara Rajaei Cardiovascular Reserach Institute Iran University of Medical Sciences Tehran Iran Center for Medical Data Science Medical University of Vienna Vienna Austria Department of Algorithms and Computation School of Engineering Sciences College of Engineering University of Tehran Tehran Iran

ISBN: (数字)9798331508913

ISBN: (纸本)9798331508920

This study develops a domain-specific schema for a cardiovascular disease knowledge graph, incorporating scholarly metadata with entities such as diseases, treatments, clinical trials, and genetic interactions. The schema was designed through a review of existing frameworks, ontologies, and knowledge bases. The schema provides a strong basis for furthering cardiovascular research by supporting applications in drug discovery, clinical trial optimization, and personalized medicine.

关键词： Reviews Precision medicine Refining Knowledge graphs Ontologies Metadata Clinical trials Knowledge discovery Drug discovery Optimization

来源：评论

学校读者我要写书评

暂无评论

Building Graphs with Maximum Connectivity 1

Building Graphs with Maximum Connectivity

引用

1st Intermountain Engineering, Technology and Computing, IETC 2020

作者： Jafarpour, Maryam Shekaramiz, Mohammad Javan, Abolfazl Moeini, Ali University of Tehran Department of Algorithms and Computation Tehran Iran Utah Valley University Engineering Department UT United States

ISBN: (纸本)9781728142913

The increasing data volume and the algorithms complexity in recent years has made topics such as cloud computing extremely important. Meanwhile, improving the communication parameters in cloud computing has led to improvements such as the increase in efficiency, and the reduction of execution time and the energy consumption. The concept of communication can be treated as mathematical modeling with graphs, where the network requirements are evaluated with the graph parameters. Parameters such as connectivity, toughness, tenacity, and graph diameter are commonly used in cloud computing, social networks, networks security, etc. For example, connectivity is one of the major graph parameters that defines the extent of the graph's vulnerability. This parameter is evaluated in two vertex and edge modes. Creating graphs with a maximum vertex connectivity value was proposed by Harary and is referred to as Harary graphs. In this paper, we explore other graphs that have a different structure from Harary graphs and we make an attempt to improve other parameters such as graph diameter and toughness in the proposed graphs. In addition to cloud computing, the theoretical results of the proposed models are applicable in various fields such as social networks, network security, electronic circuit design, geography and urban design, bioinformatics and more. © 2020 IEEE.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

The SBM: A Victim Block Selection Method Based on Min-heap Priority Queues 3

The SBM: A Victim Block Selection Method Based on Min-heap P...

引用

3rd CSI/CPSSI International Symposium on Real-Time and Embedded Systems and Technologies, RTEST 2020

作者： Khanbadr, Asal Marvasti, Mohammadreza Binesh Asghari, Seyyed Amir Khanbadr, Sohrab Kharazmi University Department of Electrical and Computer Engineering Tehran Iran University of Tehran Department of Algorithms and Computation Tehran Iran

ISBN: (数字)9781728175515

ISBN: (纸本)9781728175515

NAND flash memories are widely utilized in embedded systems. However, these memories limited endurance leads to the reduced reliability of flash storage devices. The NAND flash blocks reclamation policy plays a substantial role in its lifetime degradation. The Scoring Based Method (SBM) aims to address this problem. This paper employs priority queues based on a min-heap structure to enhance the lifetime of NAND flash chips in an SSD. The blocks are ordered in the corresponding min-heap based on the factors which directly affect the lifespan of flash blocks. Experiments were conducted using the SSDsim simulation tool. Moreover, the method is evaluated under both write-intensive and read-intensive workloads. The results demonstrate that the SBM enhances the lifetime by at least 2.5 percent compared to its earlier version, and 39.9 percent compared to the rest of the methods. © 2020 IEEE.

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

A note on the complexity of S4.2

引用

Journal of Applied Non-Classical Logics 2021年第2期31卷 108-129页

作者： Chalki, Aggeliki Koutras, Costas D. Zikos, Yorgos Computation Reasoning Laboratory (CoReLab) School of Electrical and Computer Engineering National Technical University of Athens Athens Greece Department of Informatics and Telecommunications University of Peloponnese Tripolis Greece Graduate Programme in Algorithms Logic Discrete Mathematics (ALMA) Department of Informatics Telecommunications National and Kapodistrian University of Athens Athens Greece

(Formula presented.) is the modal logic of directed partial pre-orders and/or the modal logic of reflexive and transitive relational frames with a final cluster. It holds a distinguished position in philosophical logic, where it has been advocated as the ‘correct’ logic of knowledge;it has also found interesting applications in the temporal logic of relativistic spacetime and the metamathematics of forcing in set theory. The satisfiability problem for (Formula presented.) is (Formula presented.) -complete: this is a result established in an AiML 2004 paper of Shapirovsky [(2004). On PSPACE-decidability in transitive modal logic. In R. A. Schmidt, I. Pratt-Hartmann, M. Reynolds, & H. Wansing (Eds.), Advances in modal logic 5 (pp. 269–287). King's College Publications] where the complexity classification of (Formula presented.) emerges as a consequence of a very general method for constructing (Formula presented.) decision procedures for transitive modal logics. We provide here a ‘classical’ proof in the standard Halpern-Moses style of Halpern and Moses [(1992). A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54(2), 319–379]. With little extra work, it is shown that the (Formula presented.) -completeness result extends to (Formula presented.), the multimodal version of (Formula presented.). We prove that the (Formula presented.) -completeness characterisation of monomodal (Formula presented.) persists even if we restrict ourselves to fragments with bounded modal depth, but the problem is (Formula presented.) -complete when it is restricted to formulae with modal depth at most one. The complexity of (Formula presented.) satisfiability for the fragment of the language with a finite number of propositional variables (but unbounded modal depth) remains (Formula presented.) -hard. For a finite language and bounded modal depth, (Formula presented.) -satisfiability can be checked in linear time. © 2021 Informa UK Limi

关键词： complexity of multimodal logics Modal logic S4.2 logic tableaux proof procedures

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：