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

13th International Conference on Information and Communication Technology and System (ICTS)

作者： Sunaryono, Dwi Iman, Annas Nuril Purwitasari, Diana Raharjo, Agus Budi Inst Teknol Sepuluh Nopember Fac Intelligent Elect & Informat Technol Dept Informat Engn Surabaya Jawa Timur Indonesia

ISBN: (纸本)9781665440592

Before the zoning policy, students or their parents tend to choose a recognized school with high educational quality despite its distance. New Student Admissions or Penerimaan Peserta Didik Baru (PPDB) is a school zoning enrollment system that aims to reduce the student travel distance. The online-based PPDB system requires home location input supplemented with legal documents as validation mechanism. However, falsifying home residence or enrollment fraud could not be identified by the PPDB system. This study examines the possible fraud cases from the PPDB enrollment ranks data. The ranks data forms a graph relationship between the registrant and the school. Every data contains a longitude-latitude point, and it is the main factor for accepting based on PPDB policy. The process is trying to analyze the connection between distance gap distribution derived from the ranks data, with the concurrent fraud cases. Because the distance gap distribution still has a missing value on several gap points, it is useful to use KDE (Kernel Density Estimation) to estimate those unknown values. KDE will result in estimated distance gap distribution. The distance gap distribution is affected by the residence location that is plotted on a geo map. When there's an uncommon location of some registrant it will create fluctuation on the distance gap distribution. The gap distribution value exceeds the estimated distance gap distribution from this situation and will be detected as an enrollment fraud. The process to detect enrollment fraud is handled with a graph algorithm. The graph algorithm traverses the graph data and gets ranked registrant from a school. The data are grouped every two meters and check whether its count does not exceed the estimated distance gap distribution. The graph algorithm builds over the PPDB system and tests several manipulated residence locations. It could detect those manipulated data and has a fast process since it only took less than one second.

关键词： PPDB enrollment fraud graph algorithm

来源：评论

学校读者我要写书评

暂无评论

GA-ADE: a novel approach based on graph algorithm to improves the detection of adverse drug events

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2018年第3期77卷 3493-3507页

作者： Wu, Xingcheng Zhu, Jia Xiao, Danyang Lin, Xueqin Ding, Rui South China Normal Univ Sch Comp Sci Guangzhou Guangdong Peoples R China

The adverse drug event (ADE) is an unexpected and harmful consequence of drug usege. Identifying the association between the use of drugs and adverse events from biomedical literature can contribute a lot to drug safety supervision. Such identification can not only assist drug safety monitoring, but also correct known dependencies among events. In this paper,we propose a novel approach based on graph algorithm to detect adverse drug events(GA-ADE). In our approach, we first construct a graph using candidate ADE extracted from biomedical literature. We then propose a method to select important vertices from the graph as core vertices, and design a Personal Rank algorithm using the core vertices for clustering to build subgraphs. Lastly, the correlation between the drug and the event is calculated based on the subgraphs. Experiments show that our approach is feasible.

关键词： Adverse drug events detection Personal Rank Deep Walk graph algorithm Clustering

来源：评论

学校读者我要写书评

暂无评论

Fabric defect detection via low-rank decomposition with gradient information and structured graph algorithm

引用

INFORMATION SCIENCES 2021年 546卷 608-626页

作者： Shi, Boshan Liang, Jiuzhen Di, Lan Chen, Chen Hou, Zhenjie Changzhou Univ Sch Comp Sci & Artificial Intelligence Changzhou 213164 Jiangsu Peoples R China Jiangnan Univ Sch Artificial Intelligence & Comp Sci Wuxi 214122 Jiangsu Peoples R China Univ N Carolina Dept Elect & Comp Engn Charlotte NC 28213 USA

The low rank decomposition model shows the potential of fabric defect detection, in which a matrix is decomposed into a sparse matrix representing the defect free region (background) and identifying the defect area (foreground). However, there are still two shortcomings. Firstly, when the texture of defect image has high gradient feature, the sparse matrix obtained by the existing model still retains a large number of edges of undetected regions. Secondly, due to the imprecision of prior information, most models will misjudge the defect free points around the defect block when dealing with the small defect area or the defect area containing multiple cycles. In order to solve these problems, this paper proposes a fabric defect detection method based on low rank decomposition of gradient information and structured graph algorithm: 1) structured graphics algorithm, according to the characteristics of fabric defect image, fabric defect image is divided into defect free block with local feature and defect damage period. 2) In the merging process, an adaptive threshold is set according to the number of cycles contained in the current block to encourage intra lattice merging and prevent the merging of defective blocks and surrounding non defective blocks. 3) The defect prior information calculated from the segmentation results is used to guide matrix decomposition to weaken the defect free region and highlight the defect area under the sparse term. We evaluated our model on a standard database and compared it with the four latest methods. The total TPR and fpr of this method are 87.3% and 1.21% respectively on box, star and point databases, which is the best performance. (c) 2020 Elsevier Inc. All rights reserved.

关键词： Defect detection graph algorithm Cycle information Low-rank decomposition Prior knowledge

来源：评论

学校读者我要写书评

暂无评论

A graph algorithm for the time constrained shortest path

引用

CONNECTION SCIENCE 2022年第1期34卷 1500-1518页

作者： Liu, Pan Huang, Wulan Shanghai Business Sch Fac Business Informat Shanghai Peoples R China Shanghai Key Lab Comp Software Testing & Evaluat Shanghai Peoples R China

Highly efficient algorithms for solving the time constrained shortest path problem have been highlighted over the past decades to reduce the cost of vehicle travel in the road network. The paper presents a novel graph algorithm comprising three stages to acquire a time constrained shortest path between any two nodes on the map. In the first stage, the undirected graph is transformed into a directed graph (DT graph) by deleting edges that must not be included in any of the time constrained shortest paths. A variant DT tree with the destination as the root and the source as the leaf is then constructed from the DT graph in the second stage. By finding the minimal difference value between leaves and the root of the variant DT tree, we can eventually obtain a time constrained shortest path from the variant DT tree in the third stage. Experimental results show that our algorithm not only requires less running time than some classical graph algorithms but also can work immediately in the first stage without knowing the information of both the destination and a specific time constraint.

关键词： Time constrained shortest path graph algorithm DT graph variant DT tree

来源：评论

学校读者我要写书评

暂无评论

SimUrb - software for identifying similar municipalities by comparing Urban indices using a graph algorithm

引用

EARTH SCIENCE INFORMATICS 2019年第4期12卷 699-714页

作者： Dolezalova, Jitka Burian, Jaroslav Popelka, Stanislav Palacky Univ Olomouc Dept Geoinformat 17 Listopadu 12 Olomouc 77900 Czech Republic

The paper describes the SimUrb tool, which was used to calculate the similarity between municipalities (or other territorial units) according to several characteristics (attributes). The SimUrb tool allows similar groups between ordered sequences to be found. The tool was designed to work with hundreds of records. In order to find similar groups, the tool employs graph theory, in which similar groups are represented as cliques on a simple graph. The Bron-Kerbosch algorithm was used to search for them. The degree of similarity was determined from a metric based on the Euclidean distance between strings. Finding all non-trivial cliques would have been difficult or impossible for such data to be feasible in this study. Therefore, the SimUrb tool was used to find similar groups as the largest disjoint cliques in the respective graph. A case study is introduced in the second part of the paper to illustrate SimUrb's functionality. The results of standard grouping methods (two methods offered by ArcGIS software) and groups defined under official planning documents were compared to the results from the SimUrb software. We concluded that SimUrb can be used in many applications where the user needs to define groups of objects with the same degree of similarity.

关键词： graph algorithm SimUrb Similarity Groups

来源：评论

学校读者我要写书评

暂无评论

Iligra: An efficient inverse line graph algorithm

引用

Journal of Mathematical Modelling and algorithms 2015年第1期14卷 13-33页

作者： Liu, Dajie Trajanovski, Stojan Van Mieghem, Piet Delft University of Technology P.O. Box 5031 Delft 2600 GA Netherlands

This paper presents a new and efficient algorithm, ILIGRA, for inverse line graph construction. Given a line graph H, ILIGRA constructs its root graph G with the time complexity being linear in the number of nodes in H. If ILIGRA does not know whether the given graph H is a line graph, it firstly assumes that H is a line graph and starts its root graph construction. During the root graph construction, ILIGRA checks whether the given graph H is a line graph and ILIGRA stops once it finds H is not a line graph. The time complexity of ILIGRA with line graph checking is linear in the number of links in the given graph H. For sparse line graphs of any size and for dense line graphs of small size, numerical results of the running time show that ILIGRA outperforms all currently available algorithms. © Springer Science+Business Media Dordrecht 2014.

关键词： graph algorithm Line graph Root graph

来源：评论

学校读者我要写书评

暂无评论

A robust framework for the generation of random metamaterials based on a graph algorithm

A robust framework for the generation of random metamaterial...

引用

Conference on Metamaterials, Metadevices, and Metasystems

作者： Mahabadi, Rayehe Karimi Chen, Zhi Darai, Chiara Rudin, Cynthia Brinson, L. Catherine Duke Univ Dept Mech Engn & Mat Sci Durham NC 27706 USA Duke Univ Dept Comp Sci & Elect Durham NC USA CALTECH Div Engn & Appl Sci Pasadena CA 91125 USA

ISBN: (纸本)9781510678781;9781510678798

In the realm of metamaterial research, the exploration of random structures presents an innovative path less traveled, compared to the conventional focus on periodic designs. Our study introduces a novel framework for generating random metamaterials using graph algorithms, which ensures connectivity and adaptability across a multitude of base shapes, such as cylinders, triangles, pyramids, and cubes. This flexibility enables the application of our designs across various domains, allowing for the investigation of properties including stiffness, density, and acoustic impedance. By leveraging graph algorithms in our framework, data representation and manipulation become more intuitive and efficient, facilitating the design process. Our approach demonstrates significant versatility in manipulating the macroscale and microscale elements of the designs, providing a tailored fit for specific applications. We present a series of designs, showcasing the ability to control and predict the material's behavior under different conditions. The designs can be effectively implemented across various fields and subjected to multiple analytical studies, encompassing static, dynamic, and eigenfrequency assessments. Properties such as impedance, stiffness, density, and more can be explored, opening the door to a wide array of applications and potential innovations in metamaterial research. We illustrate the computational results for stiffness and acoustic impedance, highlighting the method's efficacy through examples ranging from rod-based to cube-based designs. This framework not only paves the way for advancements in metamaterial research but also opens up new possibilities for innovation in fields requiring customized material properties.

关键词： Metamaterial acoustic design random graph algorithm

来源：评论

学校读者我要写书评

暂无评论

A graph-based algorithm for three-way merging of ordered collections in EMF models

引用

SCIENCE OF COMPUTER PROGRAMMING 2015年 113卷 51-81页

作者： Schwaegerl, Felix Uhrig, Sabrina Westfechtel, Bernhard Univ Bayreuth Chair Appl Comp Sci 1 D-95440 Bayreuth Germany

In EMF models, ordered collections appear as the values of multi-valued structural features. Traditional, text-based version control systems do not sufficiently support three-way merging of ordered collections inside EMF models since they cannot guarantee a consistent result. The operation three-way merging is defined as follows: based on a common base version b, two alternative versions a(1) and a(2) were developed by copying and modifying the base version. To reconcile these changes, a merged version m is to be created as a common successor of a(1) and a(2). In this paper, we present a graph algorithm to solve the problem of three-way merging of ordered collections in EMF models. Each version of a collection can be represented by means of a linearly ordered graph. To create the merged version, these graphs are combined to a merged collection graph using set formula. To create the merged collection, a generalized topological sort is performed on the merged collection graph. Conflicts occur in case the order of elements cannot be deduced automatically;these conflicts are resolved either interactively or by default rules. We have implemented the merge algorithm in our tool BTMerge, which performs a consistency-preserving three-way merge of versions of EMF models being instances of arbitrary Ecore models. Our implementation relies on an alternative form of representing multiple versions of a collection, namely a versioned collection graph which forms a superimposition of collection versions. The algorithm presented here is purely state-based. Matching and merging of collections are clearly separated sub-problems. Insertions and deletions performed on the elements of the collection are propagated into the merged version in a consistent way. Our algorithm makes only minimal assumptions with regard to the underlying product model and thus may be applied to ordered collections inside plain text or XML files. By taking arbitrary move operations into account, the algorithm

关键词： Model-driven software engineering EMF models Version control Three-way merging graph algorithm

来源：评论

学校读者我要写书评

暂无评论

Appropriate graph-algorithm Selection for Edge Devices Using Machine Learning 16

Appropriate Graph-Algorithm Selection for Edge Devices Using...

引用

16th IEEE International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC)

作者： Fukasawa, Yusuke Komatsu, Kazuhiko Sato, Masayuki Kobayashi, Hiroaki Tohoku Univ Grad Sch Informat Sci Sendai Miyagi Japan Tohoku Univ Cybersci Ctr Sendai Miyagi Japan

ISBN: (纸本)9798350393613

As a new information technology, edge computing has attracted much attention in recent years. Edge computing collects, stores, and processes data on the edge devices, such as smartphones and sensors. Edge devices can process data in real time by reducing communication time with central servers. Therefore, various algorithms for preprocessing should be executed on edge devices to provide services rapidly. graph algorithms are one of such candidates, because graph data play an important role in representing a variety of information around us such as maps, SNS, and web structures, which is one of data collected and processed on edge devices. However, since execution time of graph algorithms varies greatly depending on the graph data, the preprocessing on edge devices may take a long time. Therefore, it is necessary to select an appropriate algorithm and process data for edge devices as fast as possible. This paper proposes a method to select the appropriate graph algorithm on edge devices. By using machine learning that takes features of graph data as input, the performances of graph algorithms, such as the execution times, are predicted. Then, the proposed method selects a suitable algorithm for requests of edge users. The evaluation result demonstrates that the proposed method can select the appropriate algorithm from the several algorithms depending on the characteristics of graph data.

关键词： graph graph algorithm machine learning edge computing

来源：评论

学校读者我要写书评

暂无评论

graph Proxy Fusion: Consensus graph Intermediated Multi-View Local Information Fusion Clustering

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2025年 27卷 1736-1747页

作者： Li, Haoran Guo, Yulan You, Jiali You, Xiaojian Ren, Zhenwen Sun Yat Sen Univ Sch Elect & Commun Engn Shenzhen Campus Shenzhen 510275 Peoples R China PengCheng Lab Shenzhen 518055 Peoples R China Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 611731 Peoples R China Southwest Univ Sci & Technol Sch Natl Def Sci & Technol Mianyang 621010 Peoples R China Guangxi Key Lab Digital Infrastruct Nanning 530000 Peoples R China

Multi-view clustering (MVC) can fuse the information of multiple views for robust clustering result, among it two fusion strategies, early-fusion and late-fusion are widely adopted. Although they have derived many MVC methods, there are still two crucial questions: (1) early-fusion forces multiple views to share a consensus latent representation, which compounds the challenge of excavating view-specific diverse local information and (2) late-fusion generates view-partitions independently and then integrates them in the following clustering procedure, where the two procedures cannot guide each other and lack necessary negotiation. In view of this, we propose a novel graph Proxy Fusion (GPF) method to preserve and fuse view-specific local information concertedly in one unified framework. Specifically, we first propose anchor-based local information learning to capture view-specific local structural information in bipartite graphs;meanwhile, a view-consensus graph learned through self-expressiveness-based proxy graph learning module is deemed as a higher-order proxy;following, the novel graph proxy fusion module integrally embeds all lower-order bipartite graphs in the higher-order proxy via higher-order correlation theory. As a novel fusion strategy, the proposed GPF efficiently investigates the valuable consensus and diverse information of multiple views. Experiments on various multi-view datasets demonstrate the superiority of our method.

关键词： graph proxy fusion multi-view clustering graph algorithm graph algorithm graph embedding graph embedding graph embedding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：