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

A Review of the Current Task Offloadingd* algorithms,Strategies and Approach in Edge Computing Systems

Computer Modeling in Engineering & Sciences 2023年第1期134卷 35-88页

作者： Abednego Acheampong Yiwen Zhang Xiaolong Xu daniel Appiah Kumah School of Computer Science and Technology Anhui UniversityHefei230039China School of Computer and Software Nanjing University of Information Science and TechnologyNanjing210044China

Task offloading is an important concept for edge computing and the Internet of Things(IoT)because computationintensive tasksmust beoffloaded tomore resource-powerful remote *** has several advantages,including increased battery life,lower latency,and better application performance.A task offloading method determines whether sections of the full application should be run locally or offloaded for execution *** offloading choice problem is influenced by several factors,including application properties,network conditions,hardware features,and mobility,influencing the offloading system’s operational *** study provides a thorough examination of current task offloading and resource allocation in edge computing,covering offloading strategies,algorithms,and factors that influence *** offloading and partial offloading strategies are the two types of offloading ***d* algorithms for task offloading and resource allocation are then categorized into two parts:machine learningd* algorithms and non-machine learning *** examine and elaborate ond* algorithms like Supervised Learning,Unsupervised Learning,and Reinforcement Learning(RL)under machine *** the non-machine learningd* algorithm,we elaborate ond* algorithms like non(convex)optimization,Lyapunov optimization,Game theory,Heuristicd* algorithm,dynamic Voltage Scaling,Gibbs Sampling,and Generalized Benders decomposition(GBd).Finally,we highlight and discuss some research challenges and issues in edge computing.

关键词： Task offloading machine learning algorithm game theory dynamic voltage scaling

来源：评论

学校读者我要写书评

暂无评论

Mathematical formulation and a novel two-staged* algorithm for double-row layout problem with fixed loading and unloading points

引用

JOURNAL OF MANUFACTURING SYSTEMS 2023年 69卷 242-254页

作者： Ji, dan Zhang, Zeqiang Liang, Wei Wang, Can He, Zongxing Southwest Jiaotong Univ Sch Mech Engn Chengdu 610031 Peoples R China Technol & Equipment Rail Transit Operat & Maintena Chengdu 610031 Peoples R China

Loading and unloading operations are frequent and important in the production workshop. Thus, this paper proposes a novel double-row layout problem, which involves the location planning of material loading and unloading points of the facility in the layout;It needs to solve the sequence and precise coordinates of facilities with safety clearance to ensure the safety of the layout. Subsequently, a mixed-integer programming model and an improved discrete differential evolutiond* algorithm with linear programming are developed to minimize material handling costs. Thed* algorithm includes four efficient operations in optimization: the annealing mech-anism, random strategy, variable neighborhood search strategy, and double-threshold termination mode. Thereafter, compared with the computational results of benchmark cases, the validity of the model and the efficiency of thed* algorithm are verified. In the basic problem, the calculation results of thed* algorithm are compared with manyd* algorithms in the literature, and thed* algorithm still performs well. Finally, thed* algorithm is applied to solve the reducer workshop and provides a better layout scheme.

关键词： double-row layout Fixed loading and unloading points Safety clearance Mixed-integer programming model Improved discrete differential evolution algorithm Two-staged* algorithm

来源：评论

学校读者我要写书评

暂无评论

MapReduce for Graphs Processing: New Big datad* algorithm for 2-Edge Connected Components and Future Ideas

引用

IEEE ACCESS 2023年 11卷 54986-55001页

作者： dahiphale, devendra Univ Maryland Dept Comp Sci & Elect Engn Baltimore MD 21250 USA

Finding connectivity in graphs has numerous applications, such as social network analysis, data mining, intra-city or inter-cities connectivity, neural network, and many more. The deluge of graph applications makes graph connectivity problems extremely important and worthwhile to explore. Currently, there are many single-noded* algorithms for graph mining and analysis;however, thosed* algorithms primarily apply to small graphs and are implemented on a single machine node. Finding 2-edge connected components (2-ECCs) in massive graphs (billions of edges and vertices) is impractical and time-consuming, even with the best-known single-noded* algorithms. Processing a big graph in a parallel and distributed fashion saves considerable time to finish processing. Moreover, it enables stream data processing by allowing quick results for vast and continuous nature data sets. This research proposes a distributed and paralleld* algorithm for finding 2-ECCs in big undirected graphs (subsequently called ``BiECCA'') and presents its time complexity analysis. The proposed* algorithm is implemented on a MapReduce framework and uses an existingd* algorithm to find connected components (CCs) in a graph as a sub-step. Finally, we suggest a few novel ideas and approaches as extensions to our work.

关键词： Graph distributed algorithm connected component big data MapReduce undirected small star large star analysis seriald* algorithms parallel cascaded jobs Hadoop streaming connectivity

来源：评论

学校读者我要写书评

暂无评论

Efficacy of an Automated* algorithm for Screening diabetic Retinopathy in Gradable and Ungradable Images in Real-Time Conditions

引用

TELEMEdICINE ANd E-HEALTH 2023年第6期29卷 896-902页

作者： John, Sheila Srinivasan, Sangeetha Ram, Keerthi Sivaprakasam, Mohanasankar Natarajan, Sundaram Sankara Nethralaya Dept Teleophthalmol Chennai India Vis Res Fdn Chennai India IIT Madras Healthcare Technol Innovat Ctr Chennai India Aditya Jyot Eye Hosp Pvt Ltd Mumbai India Sankara Nethralaya Dept Teleophthalmol 41 Coll Rd Chennai 600006 India

Background: To examine the effectiveness of a computer-assisted device (CAd) for diabetic retinopathy (dR) screening from retinal photographs at a vitreoretinal outpatient department (VR OPd), telecamps, and diabetes outpatient clinic by an ophthalmologist. In particular, the effectiveness of CAd in gradable and ungradable retinal images was examined. Methods: A total of 848 eyes of 485 patients underwent 45 degrees retinal photographs at the VR OPd of a tertiary care hospital in southern India. A total of 939 eyes of 472 patients with diabetes were examined in the telecamps conducted in remote villages in Tamil Nadu, a state in southern India. A total of 2,526 eyes of 1,263 patients were examined in a diabetes clinic using 45 degrees field retinal photographs. Thed* algorithm was validated under physiological dilatation (without pharmacological dilatation) in all three arms. Results: Seventy-one percent of 848 eyes in VR OPd, 13% of 939 eyes in telecamps, and 7% of 2,526 eyes in diabetes clinic were diagnosed to have dR. Thed* algorithm showed 78.3% sensitivity and 55.1% specificity for all images and 78.9% sensitivity and 56.8% specificity for gradable images in the VR OPd;80.1% sensitivity and 79.2% specificity for all images and 84.8% sensitivity and 80.0% sensitivity for gradable images in telecamps;63.0% sensitivity and 79.6% specificity for all images and 63.2% sensitivity and 78.1% specificity for gradable images in the diabetes clinic. Thed* algorithm had an overall accuracy of 76.4%. The ungradable rate was variable. Conclusion: Thed* algorithm performs equally well in identifying dR from gradable and ungradable photographs and may be used for dR screening in a rural setting with limited or no access to eye care.

关键词： algorithm diabetic retinopathy screening sensitivity specificity telemedicine

来源：评论

学校读者我要写书评

暂无评论

A Review on Generative Adversarial Networks:d* algorithms, Theory, and Applications

引用

IEEE TRANSACTIONS ON KNOWLEdGE ANd dATA ENGINEERING 2023年第4期35卷 3313-3332页

作者： Gui, Jie Sun, Zhenan Wen, Yonggang Tao, dacheng Ye, Jieping Southeast Univ Sch Cyber Sci & Engn Nanjing 211100 Jiangsu Peoples R China Purple Mt Labs Nanjing 210000 Peoples R China Univ Michigan Dept Computat Med & Bioinformat Ann Arbor MI USA Chinese Acad Sci Ctr Res Intelligent Percept & Comp Beijing 100190 Peoples R China Nanyang Technol Univ Sch Comp Sci & Engn Singapore 639798 Singapore JD Explore Acad Beijing Peoples R China Univ Sydney Sch Comp Sci Camperdown Australia Beike Beijing 100085 Peoples R China Univ Michigan Ann Arbor MI 48109 USA

Generative adversarial networks (GANs) have recently become a hot research topic;however, they have been studied since 2014, and a large number ofd* algorithms have been proposed. Nevertheless, few comprehensive studies explain the connections among different GAN variants and how they have evolved. In this paper, we attempt to provide a review of the various GAN methods from the perspectives ofd* algorithms, theory, and applications. First, the motivations, mathematical representations, and structures of most GANd* algorithms are introduced in detail, and we compare their commonalities and differences. Second, theoretical issues related to GANs are investigated. Finally, typical applications of GANs in image processing and computer vision, natural language processing, music, speech and audio, the medical field, and data science are discussed.

关键词： Generators Generative adversarial networks data models Linear programming Natural language processing Machine learningd* algorithms Inferenced* algorithms deep learning generative adversarial networks algorithm theory applications

来源：评论

学校读者我要写书评

暂无评论

Novel Optimization Methodology of design Parameters in High-Speed differential Via for PCIe Gen5 Channels Based on Particle Swarm Optimizationd* algorithm

引用

IEEE TRANSACTIONS ON COMPONENTS PACKAGING ANd MANUFACTURING TECHNOLOGY 2023年第10期13卷 1545-1552页

作者： Cho, Chulhee Kim, Kwangho Lee, Manho Shin, Jaeyoung Yoon, Sungjin Lee, Youngjae Song, Chayoung Choi, Wooshin Kwak, Myoungbo Choi, Youngdon Choi, Jung-Hwan Ko, Hyungjong Samsung Elect Memory Div Hwaseong 18448 South Korea

In high-speed serializer/deserializer (Serdes) channels, reducing impedance mismatches at the differential via is crucial to minimize signal reflection. However, due to the complex 3-d structure of the differential via, obtaining optimal design parameters for impedance matching can be a time-consuming process. This article introduces an equation-based time-domain reflectometry (TdR) estimation model for the differential via, which is validated by comparing it with a commercial model of the coupled transmission line. In addition, this article proposes a method to optimize the design parameters of the differential via using a figure of merit (FOM) based on TdR impedance in a particle swarm optimization (PSO)d* algorithm. The optimization procedure is applied to an actual printed circuit board (PCB) design, and the simulation results, including TdR, ${S}$ -parameters, and bit error rate (BER) at 1E -12 contours, validate the optimization performance. To further verify the optimization performance in a realistic scenario, test coupons are fabricated, and the TdR impedance is measured, demonstrating excellent performance in real-world conditions.

关键词： algorithm channels design parameters differ-ential via high speed optimization particle swarm optimization (PSO) peripheral component interconnect express (PCIe) printed circuit board (PCB) signal integrity time-domain reflec-tometry (TdR)

来源：评论

学校读者我要写书评

暂无评论

General ELLRFS-dAZNd* algorithm for solving future linear equation system under various noises

引用

NEUROCOMPUTING 2023年 515卷 145-156页

作者： Guo, Jinjin Tan, Ning Zhang, Yunong Sun Yat sen Univ Sch Comp Sci & Engn Guangzhou 510006 Peoples R China Guangdong Polytech Normal Univ Sch Comp Sci Guangzhou 510665 Peoples R China

This work investigates the problem of future linear equation system under various noises. Firstly, a con-tinuous advanced zeroing neurodynamic (CAZN) model under noise is developed to solve continuous lin-ear equation system. Subsequently, by combining a general explicit linear left-right four-step (ELLRFS) formula with the CAZN model, a general ELLRFS discrete advanced zeroing neurodynamic (ELLRFS-dAZN)d* algorithm under noise is proposed to solve the future linear equation system. Theoretical analyses and results manifest the convergence performance of the general ELLRFS-dAZNd* algorithm under various noises. Moreover, numerical experimental results, including those based on a UR5 manipulator, validate the effectiveness and robustness of the general ELLRFS-dAZNd* algorithm under various noises. Numerical experimental results based on mobile acoustic source localization further substantiate the superiority of the general ELLRFS-dAZNd* algorithm under constant noise. Finally, physical experimental results based on a Kinova JACO2 manipulator substantiate the practicability of the general ELLRFS-dAZNd* algorithm under bounded random *** 2022 Elsevier B.V. All rights reserved.

关键词： Future linear equation system discrete advanced zeroing neurodynamic algorithm Various noises Mobile acoustic source localization Physical experiment

来源：评论

学校读者我要写书评

暂无评论

Evaluating the Impact of a Ki-67 decision Supportd* algorithm on Pathology Residents' Scoring Accuracy

引用

JOURNAL OF IMAGING INFORMATICS IN MEdICINE 2025年 1-7页

作者： Aygun, Mine Ilayda Sengor Yalcin, Ozben Uzel, Burak Kulduk, Gamze Comunoglu, Cem Univ Hlth Sci Bagcilar Res & Training Hosp Dept Pathol Istanbul Turkiye Univ Hlth Sci Prof Dr Cemil Tascioglu City Hosp Dept Pathol Istanbul Turkiye Virasoft Co New York NY USA

Ki-67 scoring is of essential importance in the evaluation of breast cancer. We evaluated a Ki-67d* algorithm as a decision support tool to improve accuracy for pathology residents. We retrospectively evaluated Ki-67 scores on whole slide images (WSI) obtained from 156 consecutive breast cancer patients. Two senior pathologists determined the 2.1 mm(2) hotspot to be evaluated. Ki-67 scores from senior pathologists were compared with results generated by thed* algorithm, results from 10 pathology residents, and results from pathology residents with the assistance of thed* algorithm. In addition to numerical results from thed* algorithm, residents were also presented with a visual representation of nuclei that were counted and excluded. Statistical analysis was performed using Wilcoxon and intra-class correlation (ICC) tests. The mean Ki-67 scores from senior pathologists and thed* algorithm were 23 +/- 18 and 24 +/- 18, respectively (ICC, 0.98). Ki-67 scores from the residents were 19 +/- 16 and 22 +/- 16, without and with input from thed* algorithm, respectively. With input from thed* algorithm, residents' scores were significantly closer to those obtained by senior pathologists (p = 0.008). Residents modified their scores in 53.8% of the cases where 74% of the better scores were characterized by an increase in the original scores. The results obtained by the Ki-67d* algorithm were highly correlated with those assessed by senior pathologists. We demonstrated that thed* algorithm may serve as a decision support tool for residents to align their results with those of senior pathologists.

关键词： algorithm decision support Ki-67 Resident

来源：评论

学校读者我要写书评

暂无评论

deep feature selection using local search embedded social ski-driver optimizationd* algorithm for breast cancer detection in mammograms

引用

NEURAL COMPUTING & APPLICATIONS 2023年第7期35卷 5479-5499页

作者： Pramanik, Payel Mukhopadhyay, Souradeep Mirjalili, Seyedali Sarkar, Ram Jadavpur Univ Dept Comp Sci & Engn Kolkata India Torrens Univ Australia Ctr Artificial Intelligence Res & Optimisat Brisbane Qld 4006 Australia Yonsei Univ Yonsei Frontier Lab Seoul South Korea Obuda Univ Univ Res & Innovat Ctr H-1034 Budapest Hungary

Breast cancer has become a common malignancy in women. However, early detection and identification of this disease can save many lives. As computer-aided detection helps radiologists in detecting abnormalities efficiently, researchers across the world are striving to develop reliable models to deal with. One of the common approaches to identifying breast cancer is through breast mammograms. However, the identification of malignant breasts from mass lesions is a challenging research problem. In the current work, we propose a method for the classification of breast mass using mammograms which consists of two main stages. At first, we extract deep features from the input mammograms using the well-known VGG16 model while incorporating an attention mechanism into this model. Next, we apply a meta-heuristic called Social Ski-driver (SSd)d* algorithm embedded with Adaptive Beta Hill Climbing based local search to obtain an optimal features subset. The optimal features subset is fed to the K-nearest neighbors (KNN) classifier for the classification. The proposed model is demonstrated to be very useful for identifying and differentiating malignant and healthy breasts successfully. For experimentation, we evaluate our model on the digital database for screening mammography (ddSM) database and achieve 96.07% accuracy using only 25% of features extracted by the attention-aided VGG16 model. The Python code of our research work is publicly available at: https://***/Ppayel/BreastLocalSearchSSd.

关键词： Mammogram images Breast cancer deep learning Social ski-driver Optimization Local search algorithm

来源：评论

学校读者我要写书评

暂无评论

Colonic gallstone ileus: a systematic literature review with a diagnostic-therapeuticd* algorithm

引用

UPdATES IN SURGERY 2023年第5期75卷 1071-1082页

作者： Augustin, Goran Bruketa, Tomislav Kunjko, Kristian Romic, Ivan Mikus, Mislav Vrbanic, Adam Tropea, Alessandro Univ Zagreb Sch Med Zagreb Croatia Univ Hosp Ctr Zagreb Dept Surg Zagreb Croatia Univ Hosp Ctr Zagreb Dept Gynecol & Obstet Kispaticeva 12 Zagreb 10000 Croatia Univ Pittsburgh Dept Treatment & Study Abdominal Dis & Abdominal T IRCCS ISMETTMed Ctr Palermo Italy

Rare complication of gallstone disease is gallstone ileus. The common location is the small intestine, followed by the stomach. The rarest location is colonic gallstone ileus (CGI). To summarize and define the most appropriate diagnostic methods and therapeutic options for CGI based on the paucity of published data. Literature searches of English-, German-, Spanish-, Italian-, Japanese-, dutch- and Portuguese language articles included and Italian-language articles using PubMed, EMBASE, Web of Science, The Cochrane Library, and Google Scholar. Additional studies were identified from the references of retrieved studies. 113 cases of CGI were recorded with a male to female patient ratio of 1:2.9. The average patient age was 77.7 years (range 45-95 years). The usual location of stone impaction was the sigmoid colon (85.8%), followed by a descending colon (6.6%), transverse colon (4.7%), rectum (1.9%), and lastly, ascending colon (0.9%). Gallstones ranged from 2 to 10 cm. The duration of symptoms was variable (1 day to 2 months), with commonly reported abdominal distension, obstipation, and vomiting;85.2% of patients had previous biliary symptoms. diverticular disease was present in 81.8% of patients. during the last 23 years, CT scan was the most common imaging method (91.5%), confirming the ectopic gallstone in 86.7% of cases, pneumobilia in 65.3%, and cholecytocolonic fistula in 68%. The treatment option included laparotomy with cololithotomy and primary closure (24.7%), laparotomy and cololithotomy with diverting stoma (14.2%), colonic resection with anastomosis (7.9%), colonic resection with a colostomy (12.4%), laparoscopy with cololithotomy with primary closure (2.6%), laparoscopy with cololithotomy with a colostomy (0.9%), colostomy without gallstone extraction (5.3%), endoscopic mechanical lithotripsy (success rate 41.1%), extracorporeal shock wave lithotripsy (1.8%). The cholecystectomy rate was 46.7%;during the initial procedure 25%, and as a separate procedu

关键词： Gallstone ileus Cholecystocolonic fistula Risk factors diagnosis Therapy algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：