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

A decision model for decentralized autonomous organization platform selection: Three industry case studies

Blockchain(Research and Applications) 2023年第2期4卷 82-100页

作者： E.Baninemeh S.Farshidi S.Jansen Department of Information and Computer Science Utrecht UniversityUtrechtthe Netherlands Department of Software Engineering Lappeenranta University of TechnologyLappeenrantaFinland

Context:Decentralized autonomous organizations are a new form of smart contract-based *** autonomous organization platforms,which support the creation of such organizations,are becoming increasingly popular,such as Aragon and *** the best fitting platform is challenging for organizations,as a significant number of decision criteria,such as popularity,developer availability,governance issues and consistent documentation of such platforms,should be ***,decision-makers at the organizations are not experts in every domain,so they must continuously acquire volatile knowledge regarding such ***:Supporting decision-makers in selecting the right decentralized autonomous organization platforms by designing an effective decision model is the main objective of this *** aim to provide more insight into their selection process and reduce time and effort significantly by designing a decision ***:This study presents a decision model for the decentralized autonomous organization platform selection *** decision model captures knowledge regarding such platforms and concepts *** model is based on an existing theoretical framework that assists software engineers with a set of multi-criteria decision-making problems in software ***:We conducted three industry case studies in the context of three decentralized autonomous organizations to evaluate the effectiveness and efficiency of the decision model in assisting *** case study participants declared that the decision model provides significantly more insight into their selection process and reduces time and ***:We observe in the empirical evidence from the case studies that decision-makers can make more rational,efficient,and effective decisions with the decision ***,the reusable form of the captured knowledge regarding decentralized autonomous organization platforms can be

关键词： Decentralized autonomous organization Decision model Multi-criteria decision making Decision support system Decentralized autonomous organization platform Case study research

来源：评论

学校读者我要写书评

暂无评论

Segmentation of Tissue Regions in Whole Slide Images Using Hand-Crafted Image Features 38

Segmentation of Tissue Regions in Whole Slide Images Using H...

引用

38th International Conference on Image and Vision Computing New Zealand, IVCNZ 2023

作者： Clark, Samuel Green, Richard University of Canterbury Computer Science and Software Engineering Christchurch New Zealand

ISBN: (纸本)9798350370515

This paper proposes a method to address the need for accurate and explainable tissue segmentation in whole slide images (WSIs) for computational pathology. The research focuses on developing a machine learning algorithm using hand-crafted image features and a random forest classifier to segment tissue regions in WSIs. Three research questions were formulated and investigated. (RQ1) Can hand-crafted image features be used as the primary features for an explainable ML algorithm to accurately segment tissue regions in WSIsƒ (RQ2) What image features are dominant for classifying whether WSI tiles are within a tissue regionƒ (RQ3) What post-processing techniques are required to improve the accuracy of the tissue segmentation algorithmƒ The proposed algorithm achieved an average accuracy of 98.05%. The results revealed the significant influence of specific image features, such as saturation channel mean and standard deviation, and grey level co-occurrence matrix measures, in accurately classifying tissue tiles within WSIs. More-over, incorporating morphological operations and thresholding as post-processing techniques improved the accuracy of tissue segmentation. The achieved accuracy of 98.05% outperformed existing solutions and demonstrated the effectiveness of the proposed algorithm in reliably segmenting tissue regions from the background of WSIs. This method presents a valuable tissue segmentation pre-processing step that can be used to support future research related to cancer region segmentation. © 2023 IEEE.

关键词： Tissue

来源：评论

学校读者我要写书评

暂无评论

YOLOCSP-PEST for Crops Pest Localization and Classification

引用

computers, Materials & Continua 2025年第2期82卷 2373-2388页

作者： Farooq Ali Huma Qayyum Kashif Saleem Iftikhar Ahmad Muhammad Javed Iqbal Department of Software Engineering University of Engineering and TechnologyTaxila47050Pakistan Department of Computer Science&Engineering College of Applied Studies&Community ServiceKing Saud UniversityRiyadh11362Saudi Arabia Department of Information Technology Faculty of Computing and Information TechnologyKing Abdulaziz UniversityJeddah21589Saudi Arabia Department of Computer Science University of Engineering and TechnologyTaxila47050Pakistan

Preservation of the crops depends on early and accurate detection of pests on crops as they cause several diseases decreasing crop production and quality. Several deep-learning techniques have been applied to overcome the issue of pest detection on crops. We have developed the YOLOCSP-PEST model for Pest localization and classification. With the Cross Stage Partial Network (CSPNET) backbone, the proposed model is a modified version of You Only Look Once Version 7 (YOLOv7) that is intended primarily for pest localization and classification. Our proposed model gives exceptionally good results under conditions that are very challenging for any other comparable models especially conditions where we have issues with the luminance and the orientation of the images. It helps farmers working out on their crops in distant areas to determine any infestation quickly and accurately on their crops which helps in the quality and quantity of the production yield. The model has been trained and tested on 2 datasets namely the IP102 data set and a local crop data set on both of which it has shown exceptional results. It gave us a mean average precision (mAP) of 88.40% along with a precision of 85.55% and a recall of 84.25% on the IP102 dataset meanwhile giving a mAP of 97.18% on the local data set along with a recall of 94.88% and a precision of 97.50%. These findings demonstrate that the proposed model is very effective in detecting real-life scenarios and can help in the production of crops improving the yield quality and quantity at the same time.

关键词： Deep learning classification of pests YOLOCSP-PEST pest detection

来源：评论

学校读者我要写书评

暂无评论

3DSN-Net: A 3-D Scale-Aware convNet With Nonlocal Context Guidance for Kidney and Tumor Segmentation From CT Volumes

引用

IEEE Transactions on Cybernetics 2024年第5期54卷 3299-3312页

作者： Wu, Huisi Zhang, Baiming Li, Zhuoying Qin, Jing Lee, Tong-Yee Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China The Hong Kong Polytechnic University Centre for Smart Health School of Nursing Hong Kong Hong Kong National Cheng-Kung University Department of Computer Science and Information Engineering Tainan70101 Taiwan

Automatic kidney and tumor segmentation from CT volumes is a critical prerequisite/tool for diagnosis and surgical treatment (such as partial nephrectomy). However, it remains a particularly challenging issue as kidneys and tumors often exhibit large-scale variations, irregular shapes, and blurring boundaries. We propose a novel 3-D network to comprehensively tackle these problems;we call it 3DSN-Net. Compared with existing solutions, it has two compelling characteristics. First, with a new scale-aware feature extraction (SAFE) module, the proposed 3DSN-Net is capable of adaptively selecting appropriate receptive fields according to the sizes of targets instead of indiscriminately enlarging them, which is particularly essential for improving the segmentation accuracy of the tumor with large scale variation. Second, we propose a novel yet efficient nonlocal context guidance (NCG) mechanism to capture global dependencies to tackle irregular shapes and blurring boundaries of kidneys and tumors. Instead of directly harnessing a 3-D NCG mechanism, which makes the number of parameters exponentially increase and hence the network difficult to be trained under limited training data, we develop a 2.5D NCG mechanism based on projections of feature cubes, which achieves a tradeoff between segmentation accuracy and network complexity. We extensively evaluate the proposed 3DSN-Net on the famous KiTS dataset with many challenging kidney and tumor cases. Experimental results demonstrate our solution consistently outperforms state-of-the-art 3-D networks after being equipped with scale aware and NCG mechanisms, particularly for tumor segmentation. © 2013 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Timely Status Update in TDMA: Round-Based or User-Based? 4

Timely Status Update in TDMA: Round-Based or User-Based?

引用

4th International Conference on Information science, Parallel and Distributed Systems, ISPDS 2023

作者： Han, Xinhui Feng, Jian College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (纸本)9798350337181

This paper investigates the information freshness of two time division multiple access (TDMA) systems: round-based TDMA and user-based TDMA. The age of information (AoI) metric is used to represent the freshness of information, measured by the time since the generation of the most recently received packet. In a conventional round-based TDMA system, multiple users send their packets in rounds, regardless of whether their packets are successfully received by the receiver, possibly leading to a high average AoI of the system. In contrast, we propose a user-based TDMA system that guarantees successful packet reception for each user through feedback before proceeding to the next user. We evaluate the average AoI and average Peak AoI (PAoI) of both TDMA systems. Our theoretical and simulation results indicate that while both systems exhibit the same average PAoI, the user-based TDMA system has a lower average AoI compared with its round-based counterpart. Our findings provide new insights into the design of TDMA systems with different information freshness requirements. © 2023 IEEE.

关键词： Time division multiple access

来源：评论

学校读者我要写书评

暂无评论

Visual News Ticker Surveillance Approach from Arabic Broadcast Streams

引用

computers, Materials & Continua 2023年第3期74卷 6177-6193页

作者： Moeen Tayyab Ayyaz Hussain Usama Mir M.Aqeel Iqbal Muhammad Haneef Department of Computer Science and Software Engineering International Islamic UniversityIslamabad44000Pakistan Department of Computer Science Quaid-i-Azam UniversityIslamabad44000Pakistan Department of Computer Science Senior Member IEEEUniversity of WindsorN9B 3P4Canada Department of Software Engineering Foundation University IslamabadIslamabad44000Pakistan Department of Electrical Engineering Foundation University IslamabadIslamabad44000Pakistan

The news ticker is a common feature of many different news networks that display headlines and other *** ticker recognition applications are highly valuable in e-business and news surveillance for media regulatory *** this paper,we focus on the automatic Arabic Ticker Recognition system for the Al-Ekhbariya news *** primary emphasis of this research is on ticker recognition methods and storage *** that end,the research is aimed at character-wise explicit segmentation using a semantic segmentation technique and words identification *** proposed learning architecture considers the grouping of homogeneousshaped *** incorporates linguistic taxonomy in a unified manner to address the imbalance in data distribution which leads to individual ***,experiments with a novel ArabicNews Ticker(Al-ENT)dataset that provides accurate character-level and character components-level labeling to evaluate the effectiveness of the suggested *** proposed method attains 96.5%,outperforming the current state-of-the-art technique by 8.5%.The study reveals that our strategy improves the performance of lowrepresentation correlated character classes.

关键词： Arabic text recognition optical character recognition deep convolutional network SegNet LeNet

来源：评论

学校读者我要写书评

暂无评论

Towards an active cyber defence framework for smmes in developing countries 22

Towards an active cyber defence framework for smmes in devel...

引用

22nd European Conference on Cyber Warfare and Security, ECCWS 2023

作者： Ntingi, Nombeko Toit, Jaco Du Solms, Sebastian Von Academy of Computer Science and Software Engineering University of Johannesburg South Africa

ISBN: (纸本)9781914587702

Small, medium, and micro enterprises (SMMEs) are obliged to adopt digital technologies to render services to their clients and remain competitive. The COVID-19 global crisis has accelerated the cyberfication of systems and services. The move to digital platforms has afforded SMMEs opportunities to offer their services to a broader geographical area. However, this has also presented opportunities for cybercriminals to invade the digital infrastructure. Adopting digital transformation has put SMMEs in a vulnerable position since they need to manage their cybersecurity while lacking the necessary skills and ICT infrastructure. The inability of SMMEs to defend themselves against cyberattacks compels them to outsource their security needs to external security service providers. These external security service providers offer security services based on a hierarchical operating model. Essential security services are offered at a lower level. If the paying clients require advanced security services, they may be provided as an add-on to the contractual agreement resulting in additional cost. This paper explores the active cyber defence (ACD) approach to enhance cybersecurity defence while minimising service costs. Therefore, the primary objective and outcome of this paper are to identify some of the essential drivers that will contribute towards developing the active cyber defence framework for SMMEs in developing countries. For purposes of clarity, essential drivers are the gaps highlighted during the literature review and will be referred to as "essential drivers" throughout the paper. The essential drivers, together with suggested recommendations, will be consolidated. The essential drivers were drawn from existing literature by going through peer-reviewed academic papers and company whitepapers. To achieve the primary objective, we need to establish whether SMMEs are utilising the services of external security service providers. The external security service providers wi

关键词： Developing countries

来源：评论

学校读者我要写书评

暂无评论

Semi‑supervised contour‑driven broad learning system for autonomous segmentation of concealed prohibited baggage items

引用

Visual Computing for Industry,Biomedicine,and Art 2024年第1期7卷 1-18页

作者： Divya Velayudhan Abdelfatah Ahmed Taimur Hassan Muhammad Owais Neha Gour Mohammed Bennamoun Ernesto Damiani Naoufel Werghi Department of Electrical Engineering and Computer Sciences Center for Cyber‑Physical SystemsKhalifa University of Science and TechnologyAbu Dhabi 127788United Arab Emirates Department of Electrical Computer and Biomedical EngineeringAbu Dhabi UniversityAbu Dhabi 59911United Arab Emirates Department of Computer Science and Software Engineering the University of Western AustraliaPerthWA 6009Australia

With the exponential rise in global air traffic,ensuring swift passenger processing while countering potential security threats has become a paramount concern for aviation *** X-ray baggage monitoring is now standard,manual screening has several limitations,including the propensity for errors,and raises concerns about passenger *** address these drawbacks,researchers have leveraged recent advances in deep learning to design threatsegmentation ***,these models require extensive training data and labour-intensive dense pixelwise annotations and are finetuned separately for each dataset to account for inter-dataset ***,this study proposes a semi-supervised contour-driven broad learning system(BLS)for X-ray baggage security threat instance segmentation referred to as *** research methodology involved enhancing representation learning and achieving faster training capability to tackle severe occlusion and class imbalance using a single training routine with limited baggage *** proposed framework was trained with minimal supervision using resource-efficient image-level labels to localize illegal items in multi-vendor baggage *** specifically,the framework generated candidate region segments from the input X-ray scans based on local intensity transition cues,effectively identifying concealed prohibited items without entire baggage *** multi-convolutional BLS exploits the rich complementary features extracted from these region segments to predict object categories,including threat and benign *** contours corresponding to the region segments predicted as threats were then utilized to yield the segmentation *** proposed C-BLX system was thoroughly evaluated on three highly imbalanced public datasets and surpassed other competitive approaches in baggage-threat segmentation,yielding 90.04%,78.92%,and 59.44%in terms of mIoU on GDXray,SIXray,and Compass-XP,***,the lim

关键词： Baggage X-ray imagery Broad learning systems Threat detection Threat segmentation

来源：评论

学校读者我要写书评

暂无评论

Performance comparison of Dask and Apache Spark on HPC systems for neuroimaging

Performance comparison of Dask and Apache Spark on HPC syste...

引用

作者： Dugré, Mathieu Hayot-Sasson, Valérie Glatard, Tristan Department of Computer Science and Software Engineering Concordia University Montreal Canada

The general increase in data size and data sharing motivates the adoption of Big Data strategies in several scientific disciplines. However, while several options are available, no particular guidelines exist for selecting a Big Data engine. In this paper, we compare the runtime performance of two popular Big Data engines with Python APIs, Apache Spark, and Dask, in processing neuroimaging pipelines. Our experiments use three synthetic neuroimaging applications to process the 606 GB BigBrain image and an actual pipeline to process data from thousands of anatomical images. We benchmark these applications on a dedicated HPC cluster running the Lustre file system while using varying combinations of the number of nodes, file size, and task duration. Our results show that although there are slight differences between Dask and Spark, the performance of the engines is comparable for data-intensive applications. However, Spark requires more memory than Dask, which can lead to slower runtime depending on configuration and infrastructure. In general, the limiting factor was the data transfer time. While both engines are suitable for neuroimaging, more efforts need to be put to reduce the data transfer time and the memory footprint of applications. © 2023 John Wiley & Sons, Ltd.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Temporal Separators with Deadlines 34

Temporal Separators with Deadlines

引用

34th International Symposium on Algorithms and Computation, ISAAC 2023

作者： Harutyunyan, Hovhannes A. Koupayi, Kamran Pankratov, Denis Department of Computer Science and Software Engineering Concordia University Montreal Canada

ISBN: (纸本)9783959772891

We study temporal analogues of the Unrestricted Vertex Separator problem from the static world. An (s, z)-temporal separator is a set of vertices whose removal disconnects vertex s from vertex z for every time step in a temporal graph. The (s, z)-Temporal Separator problem asks to find the minimum size of an (s, z)-temporal separator for the given temporal graph. The (s, z)-Temporal Separator problem is known to be NP-hard in general, although some special cases (such as bounded treewidth) admit efficient algorithms [15]. We introduce a generalization of this problem called the (s, z, t)-Temporal Separator problem, where the goal is to find a smallest subset of vertices whose removal eliminates all temporal paths from s to z which take less than t time steps. Let τ denote the number of time steps over which the temporal graph is defined (we consider discrete time steps). We characterize the set of parameters τ and t when the problem is NP-hard and when it is polynomial time solvable. Then we present a τ-approximation algorithm for the (s, z)-Temporal Separator problem and convert it to a τ2-approximation algorithm for the (s, z, t)-Temporal Separator problem. We also present an inapproximability lower bound of Ω(ln(n) + ln(τ)) for the (s, z, t)-Temporal Separator problem assuming that NP Dtime(nlog log n). Then we consider three special families of graphs: (1) graphs of branchwidth at most 2, (2) graphs G such that the removal of s and z leaves a tree, and (3) graphs of bounded pathwidth. We present polynomial-time algorithms to find a minimum (s, z, t)-temporal separator for (1) and (2). As for (3), we show a polynomial-time reduction from the Discrete Segment Covering problem with bounded-length segments to the (s, z, t)-Temporal Separator problem where the temporal graph has bounded pathwidth. © Hovhannes A. Harutyunyan, Kamran Koupayi, and Denis Pankratov;licensed under Creative Commons License CC-BY 4.0.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：