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

Estimating adaptation effort in industry 4.0-enabled systems: Introducing two complexity indices with an evolvable network graph approach

引用

JOURNAL OF INDUSTRIAL INFORMATION INTEGRATION 2024年 40卷

作者： Mabkhot, Mohammed M. Ferreira, Pedro Eaton, William Lohse, Niels Loughborough Univ Intelligent Automat Ctr Wolfson Sch Mech Elect & Mfg Engn Loughborough LE11 3TU England

One of the key aims of Industry 4.0 is to create more responsive systems. Responsiveness enables coping with new market requirements or introducing new products, as demonstrated by the COVID-19 challenges. However, there are currently no effective methods for measuring the responsiveness or reconfigurability of a system, or for quantifying the effort required to adapt it from one state to another. Adapting a production cell from its current state to a new adapted state requires a significant amount of information about dismantling, reintegrating, and handling physical equipment, as well as updating the software controller. Practitioners often only consider adaptation options for simple process parametrization or at the end of a system's life cycle, overlooking many potential adaptation opportunities. This paper proposes an evolvable network graph approach for supporting reconfiguration decisions by estimating the effort required to adapt the physical structure. Two complexity indexes have been developed to quantify the adaptation activities. An estimation algorithm infers the effort from the difference in the adaptation graphs that represent alternative options. The approach is illustrated in a laboratory-scale cell and applied in two industrial-sized cells, quantifying adaptation times of approximately 58, 7, and 122 h, respectively. This is equivalent to 3129.6 pound, 356.04 pound, and 6118.8 pound, utilizing average hourly rates for system integrators and equipment handlers. The results show that the approach can effectively quantify the adaptation effort for different equipment sizes and connections, estimating the adaptation cost and time from the graph change quickly at around a millisecond and with minimal computational resources.

关键词： Effort estimation Adaptive reconfigurable cell Responsive systems Industry 4.0 System complexity network graph

来源：评论

学校读者我要写书评

暂无评论

Constructing a network graph of File Tracking Results Against Information Leakage 17

Constructing a Network Graph of File Tracking Results Agains...

引用

17th Annual Asia Joint Conference on Information Security (AsiaJCIS)

作者： Yano, Tomohiko Kuzuno, Hiroki Magata, Kenichi SECOM CO LTD Intelligent Syst Lab Mitaka Tokyo Japan Kobe Univ Grad Sch Engn Kobe Hyogo Japan

ISBN: (纸本)9781665473927

It is important for organizations to take measures against information leakage. Confidential files can be leaked through various channels, so it is necessary to have a method to prevent information leakage against various threats. Some of the previous works have utilized the difference of users' legitimate file access patterns, and other works use strings about confidential files, or the similarity of confidential files in the organizations. However, the former works are difficult to detect traitors and unintentional perpetrators, and latter works are difficult to perform when confidential files are significantly transformed through encryption or encoding. Therefore, we need a method for discovering information leakage that are independent of the subjects and of the file transformation formats. In this paper, we present a novel method for file tracking and visualization to assist the discovery of information leakage. In our file tracking method, we track all user processes that read confidential files and files written by these processes. Therefore, tracking is possible whoever manipulate the confidential files and even who even when the data is heavily transformed from the original files. In our visualization method, we present these file tracking results in the form of a network graph. We represent what process the confidential file is read and what file is written by process, by using the flow of a network graph based on the result of confidential file tracking. By using our proposed network graph, it is possible to track events briefly even when the file transforms into another file through multiple events. Additionally, in order to reduce the events needed to focus on as information leakage, we prune the network graph based on past read and write events. By pruning the network graph, visibility is expected to be improved. Our experiment shows that we observed the results of the network graph when files under two information leakage scenarios were moved and copi

关键词： Information leakage network graph Pruning

来源：评论

学校读者我要写书评

暂无评论

Predictions of Drug Metabolism Pathways Through CYP 3A4 Enzyme By Analysing Drug-Target Interactions network graph 13

Predictions of Drug Metabolism Pathways Through CYP 3A4 Enzy...

引用

IEEE/ACM International Conference on Advances in Social networks Analysis and Mining (ASONAM)

作者： Albrijawi, M. Taleb Ibrahim, Amrou Haj Alhajj, Reda Univ Calgary Dept Comp Sci Calgary AB Canada Istanbul Medipol Univ Dept Comp Engn Istanbul Turkey Univ Southern Denmark Dept Heath Informat Odense Denmark

ISBN: (纸本)9781450391283

The available data of drugs and their targets has increased widely in recent years. Far from the traditional way of studying the drug-target interactions, we propose a network-based computational method to identify new targets for known drugs. In this study, the Stanford Biomedical network Dataset Collection (BIOSNAP Datasets) is used. A network graph is constructed and analyzed to study the relationship between the drugs and their targets. Different centrality and similarity measures analyses are applied and predict new potential metabolism pathways for five drugs, namely (Wortmannin, Voacamine, Vancomycin, Dactinomycin and Arundic acid) through Cytochrome P450 3A4 enzyme in the liver. The application of network theory to the analysis of this dataset reveals a new significant approach. Finally the molecular docking is performed to confirm the results. Also, the importance of the presented method in drug discovery is highlighted/pointed out.

关键词： Drug-target interactions network network graph Metabolism pathways Drug discovery Cytochrome P450 enzyme family CYP3A4

来源：评论

学校读者我要写书评

暂无评论

Sparsity measure of a network graph: Gini index

引用

INFORMATION SCIENCES 2018年 462卷 16-39页

作者： Goswami, Swati Murthy, C. A. Das, Asit K. Indian Stat Inst Machine Intelligence Unit 203 BT Road Kolkata 700108 India Indian Inst Engn Sci & Technol Dept Comp Sci & Technol Sibpur 711103 Howrah India

This article explores the problem of formulating a general measure of sparsity of network graphs. Based on an available definition sparsity of a dataset, namely Gini index, it provides a way to define sparsity measure of a network graph. We name the sparsity measure so introduced as sparsity index. Sparsity measures are commonly associated with six properties, namely, Robin Hood, Scaling, Rising Tide. Cloning, Bill Gates and Babies. Sparsity index directly satisfies four of these six properties;does not satisfy Cloning and satisfies Scaling for some specific cases. A comparison of the proposed index is drawn with Edge Density (the proportion of the sum of degrees of all nodes in a graph compared to the total possible degrees in the corresponding fully connected graph), by showing mathematically that as the edge density of an undirected graph increases, its sparsity index decreases. The paper highlights how the proposed sparsity measure can reveal important properties of a network graph. Further, a relationship has been drawn analytically between the sparsity index and the exponent term of a power law distribution (a distribution known to approximate the degree distribution of a wide variety of network graphs). To illustrate application of the proposed index, a community detection algorithm for network graphs is presented. The algorithm produces overlapping communities with no input requirement on number or size of the communities;has a computational complexity O(n(2)), where n is the number of nodes of the graph. The results validated on artificial and real networks show its effectiveness. (C) 2018 Elsevier Inc. All rights reserved.

关键词： network graph Sparsity measure Gini index Edge density Degree distribution Power law network community detection algorithm

来源：评论

学校读者我要写书评

暂无评论

Temporal Statistical Analysis of Degree Distributions in an Undirected Landline Phone Call network graph Series

引用

DATA 2017年第4期2卷 33-33页

作者： Gjermeni, Orgeta Univ Ismail Qemali Dept Math Str Kosova Vlore 9400 Albania

This article aims to provide new results about the intraday degree sequence distribution considering phone call network graph evolution in time. More specifically, it tackles the following problem. Given a large amount of landline phone call data records, what is the best way to summarize the distinct number of calling partners per client per day? In order to answer this question, a series of undirected phone call network graphs is constructed based on data from a local telecommunication source in Albania. All network graphs of the series are simplified. Further, a longitudinal temporal study is made on this network graphs series related to the degree distributions. Power law and log-normal distribution fittings on the degree sequence are compared on each of the network graphs of the series. The maximum likelihood method is used to estimate the parameters of the distributions, and a Kolmogorov-Smirnov test associated with a p-value is used to define the plausible models. A direct distribution comparison is made through a Vuong test in the case that both distributions are plausible. Another goal was to describe the parameters' distributions' shape. A Shapiro-Wilk test is used to test the normality of the data, and measures of shape are used to define the distributions' shape. Study findings suggested that log-normal distribution models better the intraday degree sequence data of the network graphs. It is not possible to say that the distributions of log-normal parameters are normal.

关键词： longitudinal degree distribution network graph phone call data power law log-normal

来源：评论

学校读者我要写书评

暂无评论

graphDecoder: Recovering Diverse network graphs From Visualization Images via Attention-Aware Learning

引用

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER graphICS 2024年第7期30卷 3074-3088页

作者： Song, Sicheng Li, Chenhui Li, Dong Chen, Juntong Wang, Changbo East China Normal Univ Sch Comp Sci & Technol Shanghai 200062 Peoples R China

DNGs are diverse network graphs with texts and different styles of nodes and edges, including mind maps, modeling graphs, and flowcharts. They are high-level visualizations that are easy for humans to understand but difficult for machines. Inspired by the process of human perception of graphs, we propose a method called graphDecoder to extract data from raster images. Given a raster image, we extract the content based on a neural network. We built a semantic segmentation network based on U-Net. We increase the attention mechanism module, simplify the network model, and design a specific loss function to improve the model's ability to extract graph data. After this semantic segmentation network, we can extract the data of all nodes and edges. We then combine these data to obtain the topological relationship of the entire DNG. We also provide an interactive interface for users to redesign the DNGs. We verify the effectiveness of our method by evaluations and user studies on datasets collected on the internet and generated datasets.

关键词： Attention mechanism chart mining information visualization network graph semantic segmentation

来源：评论

学校读者我要写书评

暂无评论

Vividgraph: Learning to Extract and Redesign network graphs From Visualization Images

引用

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER graphICS 2023年第7期29卷 3169-3181页

作者： Song, Sicheng Li, Chenhui Sun, Yujing Wang, Changbo East China Normal Univ Sch Comp Sci & Technol Shanghai 200050 Peoples R China

network graphs are common visualization charts. They often appear in the form of bitmaps in articles, web pages, magazine prints, and designer sketches. People often want to modify graphs because of their poor design, but it is difficult to obtain their underlying data. In this article, we present Vividgraph, a pipeline for automatically extracting and redesigning graphs from static images. We propose using convolutional neural networks to solve the problem of graph data extraction. Our method is robust to hand-drawn graphs, blurred graph images, and large graph images. We also present a graph classification module to make it effective for directed graphs. We propose two evaluation methods to demonstrate the effectiveness of our approach. It can be used to quickly transform designer sketches, extract underlying data from existing graphs, and interactively redesign poorly designed graphs.

关键词： Data mining Semantics Image color analysis Image segmentation Data visualization Pipelines Image edge detection Information visualization network graph data extraction chart recognition semantic segmentation redesign

来源：评论

学校读者我要写书评

暂无评论

Evaluating Optimistic Synchronization of network graphs in Mobile networks With MEC Support 12

Evaluating Optimistic Synchronization of Network Graphs in M...

引用

12th International Conference on Cloud networking (CloudNet)

作者： Frei, Matthias German, Reinhard Djanatliev, Anatoli Fraunhofer Inst Integrated Circuits IIS Erlangen Germany Univ Erlangen Nurnberg Dept Comp Sci Comp Networks & Commun Syst Erlangen Germany

ISBN: (纸本)9798350313062;9798350313079

Future networks with well-developed Multi-Access Edge Computing (MEC) resources, where network nodes and distributed service instances can form a dense topology, face the challenge of distributing service data among many nodes. In particular, frequent data changes require an efficient update mechanism. System flexibility and user mobility, e.g, cellular hand-overs, or unpredictable service deployment or node changes, pose additional challenges. In this paper, a method is proposed and evaluated, how network graph-structured data can be distributed and synchronized between many nodes. The design considers especially the challenges of mobile networks with dynamic changes. At the example of a MEC scenario, the method is evaluated using a system-level simulation environment with fifth generation (5G) cellular communication, mobile as well as locally bound nodes, and dynamic service deployment changes. network and computing resources are represented and shared using a graph. To gain deeper insight into the performance of our model, the time and bandwidth resources required to replicate graph updates to all clients in the 5G network are evaluated. Hereby, the impact of different background network traffic, of information-dependent graph update frequencies, and of the connectivity type can be shown. Finally, by implementing a practical example, the maintenance overhead for synchronizing the graph data to have a local information source is compared to the time required when querying remote information sources.

关键词： MEC edge computing data structures network graph data sharing distribution synchronization replication

来源：评论

学校读者我要写书评

暂无评论

Product representation via networks methodology for exposing project risks

引用

RESEARCH IN ENGINEERING DESIGN 2023年第4期34卷 421-442页

作者： Efrati, Shlomi Reich, Yoram Tel Aviv Univ Sch Mech Engn & Syst Engn Res Initiat TAU SERI Tel Aviv Israel

One of the significant factors in the time to market of a technology-based product development project is effective risk management. Both the system engineer and the project manager must work together to map and manage the risks in the project throughout its lifetime. Risks in the project arise from various reasons, which are not necessarily quantifiable, but all of which must be managed by the project team. We propose a methodology for calculating the risk level origin in each system element or component, taking into account its role within the system containing these elements and its availability in the project timeline. This risk level can be used as an additional decision support tool for the project stakeholders. For this purpose, we present a four-step process for (1) graph network mapping of products, (2) applying network algorithms, (3) weighting with information from the project management discipline, and (4) calculating risk index for identifying risks. The resulting level of risk index will enable the project team to map and manage efficiently and effectively the risks arising from the system components throughout the life of the development project. To demonstrate the methodology, we analyzed two products from different fields and at different levels of abstraction. We derived from each case the risk index for the use of the project personnel.

关键词： network graph System engineer Project manager Product design Risk management Degree centrality Betweenness centrality

来源：评论

学校读者我要写书评

暂无评论

Topological Evaluation of Certain Computer networks by Contraharmonic-Quadratic Indices

引用

Computers, Materials & Continua 2023年第2期74卷 3795-3810页

作者： Ahmed M.Alghamdi Khalid Hamid Muhammad Waseem Iqbal M.Usman Ashraf Abdullah Alshahrani Adel Alshamrani Department of Software Engineering College of Computer Science and EngineeringUniversity of JeddahJeddah21493Saudi Arabia Department of Computer Science Superior UniversityLahore54000Pakistan Department of Software Engineering Superior UniversityLahore54000Pakistan Department of Computer Science GC Women UniversitySialkot53310Pakistan Department of Computer Science and Artificial Intelligence College of Computer Science and EngineeringUniversity of JeddahJeddah21493Saudi Arabia Department of Cybersecurity College of Computer Science and Engineering at University of JeddahJeddah21493Saudi Arabia

In various fields,different networks are used,most of the time not of a single kind;but rather a mix of at least two *** kinds of networks are called bridge networks which are utilized in interconnection networks of PC,portable networks,spine of internet,networks engaged with advanced mechanics,power generation interconnection,bio-informatics and substance intensify *** number that can be entirely calculated by a graph is called graph *** mathematical graph invariants have been portrayed and utilized for connection investigation during the latest twenty ***,no trustworthy evaluation has been embraced to pick,how much these invariants are associated with a network graph or subatomic *** this paper,it will discuss three unmistakable varieties of bridge networks with an incredible capacity of assumption in the field of computer science,chemistry,physics,drug industry,informatics and arithmetic in setting with physical and manufactured developments and networks,since Contraharmonic-quadratic invariants(CQIs)are recently presented and have different figure qualities for different varieties of bridge graphs or *** study settled the geography of bridge graphs/networks of three novel sorts with two kinds of CQI and Quadratic-Contraharmonic Indices(QCIs).The deduced results can be used for the modeling of the above-mentioned networks.

关键词： Bridge networks invariants Quadratic-Contraharmonic Indices maple network graph molecular graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：