首页 > 最新文献

Proceedings of the 2020 ACM International Conference on Intelligent Computing and its Emerging Applications最新文献

英文 中文
Intelligent Controlling System in Aquaculture 水产养殖智能控制系统
Yung-Cheng Yao, Xing-Rui Huang, Cheng-Yi Liu, Po-Wei Lin
In traditional fish farms, all work requires a lot of human resources. Whether it is feeding fish, temperature monitoring, etc. These tasks require a lot of manpower. Due to lack of manpower or human negligence, the fish dies, and then cause economic losses to the owners of the fish farms. In this study, two computers are used for image processing. One is to run image processing to detect objects when an object intrudes in the fish farm and use the Arduino to control the pan/tilt motor to rotate the lens and laser to drive away the invading object. Another computer is used as a real-time image server, and the user can use the APP to receive real-time image of fish farm.
在传统的养鱼场,所有的工作都需要大量的人力资源。是否喂鱼、温度监测等。这些任务需要大量的人力。由于缺乏人力或人为疏忽,鱼死亡,然后给养鱼场的业主造成经济损失。本研究使用两台计算机进行图像处理。一是在鱼场有物体入侵时,进行图像处理,检测物体,利用Arduino控制平移/倾斜电机旋转镜头和激光,将入侵物体赶走。另一台计算机作为实时图像服务器,用户可以通过APP接收养鱼场的实时图像。
{"title":"Intelligent Controlling System in Aquaculture","authors":"Yung-Cheng Yao, Xing-Rui Huang, Cheng-Yi Liu, Po-Wei Lin","doi":"10.1145/3440943.3444351","DOIUrl":"https://doi.org/10.1145/3440943.3444351","url":null,"abstract":"In traditional fish farms, all work requires a lot of human resources. Whether it is feeding fish, temperature monitoring, etc. These tasks require a lot of manpower. Due to lack of manpower or human negligence, the fish dies, and then cause economic losses to the owners of the fish farms. In this study, two computers are used for image processing. One is to run image processing to detect objects when an object intrudes in the fish farm and use the Arduino to control the pan/tilt motor to rotate the lens and laser to drive away the invading object. Another computer is used as a real-time image server, and the user can use the APP to receive real-time image of fish farm.","PeriodicalId":310247,"journal":{"name":"Proceedings of the 2020 ACM International Conference on Intelligent Computing and its Emerging Applications","volume":"100 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120978984","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Effective Optimizer based on Global and Local Searched Experiences for Short-term Electricity Consumption Forecasting 基于全局和局部搜索经验的短期电力消费预测优化方法
Zhe Xiao, Zhi-Yan Fang, Chun-Wei Tsai
A precise forecasting for the future short-term electricity consumption will be quite useful for making a good plan for the power demand management. Since deep neural network (DNN) provides an effective way for the short-term load forecasting, one of the focuses of this research is thus to use it to construct the prediction model. The gradient-based optimizers (GBOs) have been widely used in DNN algorithms in recent years; however, they make it easy for DNN to trap in poor local regions during the training process. In this research, we propose a new optimizer that is based on the searched experiences to solve this problem to enhance the performance of GBOs. More precisely, the proposed optimizer integrates the best position searched, Lévy flight, and gradient descent to preserve not only the diversification but also the intensification of search during the training process. To evaluate the performance of the proposed optimizer, we compare it with several state-of-the-art GBOs for DNN; namely, Adagrad, RMSprop, and Adam, for training a forecasting model for the short-term electricity consumption forecasting problem. The simulation results show that the proposed optimizer outperforms all the other GBOs in terms of the mean absolute percentage error.
对未来短期用电量进行准确的预测,将有助于制定合理的电力需求管理计划。由于深度神经网络(DNN)为短期负荷预测提供了一种有效的方法,因此利用深度神经网络构建预测模型是本研究的重点之一。基于梯度的优化器(GBOs)近年来在深度神经网络算法中得到了广泛的应用;然而,这使得DNN在训练过程中很容易被困在贫困的局部地区。在本研究中,我们提出了一种新的基于搜索经验的优化器来解决这个问题,以提高gbo的性能。更准确地说,该优化器将搜索最佳位置、lsamvy飞行和梯度下降结合起来,在训练过程中既保持了搜索的多样化,又保持了搜索的集约性。为了评估所提出的优化器的性能,我们将其与几种最先进的DNN gbo进行比较;即Adagrad, RMSprop和Adam,用于训练短期用电量预测问题的预测模型。仿真结果表明,该优化器在平均绝对百分比误差方面优于所有其他gbo。
{"title":"An Effective Optimizer based on Global and Local Searched Experiences for Short-term Electricity Consumption Forecasting","authors":"Zhe Xiao, Zhi-Yan Fang, Chun-Wei Tsai","doi":"10.1145/3440943.3444723","DOIUrl":"https://doi.org/10.1145/3440943.3444723","url":null,"abstract":"A precise forecasting for the future short-term electricity consumption will be quite useful for making a good plan for the power demand management. Since deep neural network (DNN) provides an effective way for the short-term load forecasting, one of the focuses of this research is thus to use it to construct the prediction model. The gradient-based optimizers (GBOs) have been widely used in DNN algorithms in recent years; however, they make it easy for DNN to trap in poor local regions during the training process. In this research, we propose a new optimizer that is based on the searched experiences to solve this problem to enhance the performance of GBOs. More precisely, the proposed optimizer integrates the best position searched, Lévy flight, and gradient descent to preserve not only the diversification but also the intensification of search during the training process. To evaluate the performance of the proposed optimizer, we compare it with several state-of-the-art GBOs for DNN; namely, Adagrad, RMSprop, and Adam, for training a forecasting model for the short-term electricity consumption forecasting problem. The simulation results show that the proposed optimizer outperforms all the other GBOs in terms of the mean absolute percentage error.","PeriodicalId":310247,"journal":{"name":"Proceedings of the 2020 ACM International Conference on Intelligent Computing and its Emerging Applications","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125324305","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Towards Story-based Summarization of Narrative Multimedia 基于故事的叙事多媒体总结
O-Joun Lee, Jin-Taek Kim, Eunsoon You
This study aims at summarizing narrative works (i.e., creative works that contain stories) in the consideration of their stories and types of required summaries. Various methods for story-based summarization have been proposed as a practical application of the character network analysis (i.e., a social network among characters that appeared in a story). However, the existing methods do not consider that summaries have different requirements according to their types (e.g., trailers, highlights, and recaps). These methods consist of three parts: (i) discretizing narrative works into regular units (e.g., scenes or shots), (ii) measuring the narrative significance of each unit, and (iii) generating summaries based on the narrative significance. Most of the existing studies have proposed their unique significance measurements based on individual narrative features. Also, since these methods have not considered the diverse types of summaries, they have simply selected top-N narrative units according to the measurements. In this study, we first introduce and redefine the narrative significance measurements. Subsequently, we propose a method for summarizing a narrative work regarding the requirements of the summaries by integrating the various significance measurements.
本研究旨在总结叙事性作品(即包含故事的创造性作品),考虑其故事和所需摘要的类型。作为人物网络分析(即故事中出现的人物之间的社会网络)的实际应用,已经提出了各种基于故事的总结方法。然而,现有的方法并没有考虑到摘要根据其类型(例如,预告片、亮点和概述)有不同的要求。这些方法包括三个部分:(i)将叙事作品离散为规则单元(例如场景或镜头),(ii)测量每个单元的叙事意义,(iii)根据叙事意义生成总结。现有的研究大多基于个体叙事特征提出了其独特的意义度量方法。此外,由于这些方法没有考虑不同类型的摘要,它们只是根据测量选择了top-N的叙述单位。在本研究中,我们首先引入并重新定义了叙事意义度量。随后,我们提出了一种通过整合各种显著性测量来总结关于摘要要求的叙述工作的方法。
{"title":"Towards Story-based Summarization of Narrative Multimedia","authors":"O-Joun Lee, Jin-Taek Kim, Eunsoon You","doi":"10.1145/3440943.3444719","DOIUrl":"https://doi.org/10.1145/3440943.3444719","url":null,"abstract":"This study aims at summarizing narrative works (i.e., creative works that contain stories) in the consideration of their stories and types of required summaries. Various methods for story-based summarization have been proposed as a practical application of the character network analysis (i.e., a social network among characters that appeared in a story). However, the existing methods do not consider that summaries have different requirements according to their types (e.g., trailers, highlights, and recaps). These methods consist of three parts: (i) discretizing narrative works into regular units (e.g., scenes or shots), (ii) measuring the narrative significance of each unit, and (iii) generating summaries based on the narrative significance. Most of the existing studies have proposed their unique significance measurements based on individual narrative features. Also, since these methods have not considered the diverse types of summaries, they have simply selected top-N narrative units according to the measurements. In this study, we first introduce and redefine the narrative significance measurements. Subsequently, we propose a method for summarizing a narrative work regarding the requirements of the summaries by integrating the various significance measurements.","PeriodicalId":310247,"journal":{"name":"Proceedings of the 2020 ACM International Conference on Intelligent Computing and its Emerging Applications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126854617","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Automatic Seed Generation based Hybrid Fuzzing for Code Coverage Efficiency 基于混合模糊的代码覆盖效率自动种子生成
Soonhong Kwon, Yangseo Choi, Jong‐Hyouk Lee
Based on the 4th Industrial Revolution, numerous ICT technologies are developing, and for this reason, IoT devices are formed around us. Accordingly, hackers are inflicting financial and physical damage to our lives by using software vulnerabilities in IoT devices around us based on intelligent hacking technology. Automated security vulnerability response systems are required to respond to attacks through continuously occurring software vulnerabilities. In this paper, we analyze the hybrid fuzzing system that complements the technical limitations of the existing fuzzing technology as the base technology for an automated security vulnerability response system. In addition, we propose a hybrid fuzzing system based on an automatic seed generation mechanism for coverage efficiency in order to find vulnerabilities inherent in software quickly and efficiently.
基于第四次工业革命,众多ICT技术正在发展,因此,物联网设备在我们周围形成。因此,黑客利用基于智能黑客技术的物联网设备的软件漏洞,对我们的生活造成了经济和物质上的损失。需要自动化的安全漏洞响应系统来响应通过不断发生的软件漏洞进行的攻击。在本文中,我们分析了混合模糊测试系统,它补充了现有模糊测试技术的技术局限性,作为自动化安全漏洞响应系统的基础技术。此外,为了快速有效地发现软件固有的漏洞,我们提出了一种基于覆盖效率的自动种子生成机制的混合模糊测试系统。
{"title":"Automatic Seed Generation based Hybrid Fuzzing for Code Coverage Efficiency","authors":"Soonhong Kwon, Yangseo Choi, Jong‐Hyouk Lee","doi":"10.1145/3440943.3444744","DOIUrl":"https://doi.org/10.1145/3440943.3444744","url":null,"abstract":"Based on the 4th Industrial Revolution, numerous ICT technologies are developing, and for this reason, IoT devices are formed around us. Accordingly, hackers are inflicting financial and physical damage to our lives by using software vulnerabilities in IoT devices around us based on intelligent hacking technology. Automated security vulnerability response systems are required to respond to attacks through continuously occurring software vulnerabilities. In this paper, we analyze the hybrid fuzzing system that complements the technical limitations of the existing fuzzing technology as the base technology for an automated security vulnerability response system. In addition, we propose a hybrid fuzzing system based on an automatic seed generation mechanism for coverage efficiency in order to find vulnerabilities inherent in software quickly and efficiently.","PeriodicalId":310247,"journal":{"name":"Proceedings of the 2020 ACM International Conference on Intelligent Computing and its Emerging Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125494951","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Construction of Diving Record Wearable Device Based on IOT 基于物联网的潜水记录可穿戴设备的构建
Yen-Chiao Chuang, Cheng-Lung Wu, I-Yun Chen, Chien-Hung Wu
There are various potential hazards that may occur in diving, but some risks can be prevented through advance planning, such as diving decompression risk is one of them. This article construction of diving record wearable device based on IOT. The instructor can set the diving height and time according to the situation of each student, and there is an emergency button set on the wearable device. When students have any problems, they can use AIS communication to send messages to the coach ship, and the coach ship can immediately locate and rescue. This article mainly uses GPS and Beacon for positioning to understand the student's position and height. This article uses the IoT sensor to understand the student's movement rate and height to avoid the danger that the student's ascent rate is too fast or the altitude is too high.
潜水中可能会发生各种潜在的危险,但有些风险是可以通过提前规划来预防的,比如潜水减压风险就是其中之一。本文构建了基于物联网的潜水记录可穿戴设备。教练可以根据每个学生的情况设置潜水高度和时间,可穿戴设备上设置有紧急按钮。当学生遇到任何问题时,他们可以使用AIS通信向教练船发送信息,教练船可以立即定位和救援。本文主要使用GPS和Beacon进行定位,了解学生的位置和高度。本文使用IoT传感器了解学生的移动速度和高度,以避免学生上升速度过快或高度过高的危险。
{"title":"Construction of Diving Record Wearable Device Based on IOT","authors":"Yen-Chiao Chuang, Cheng-Lung Wu, I-Yun Chen, Chien-Hung Wu","doi":"10.1145/3440943.3444345","DOIUrl":"https://doi.org/10.1145/3440943.3444345","url":null,"abstract":"There are various potential hazards that may occur in diving, but some risks can be prevented through advance planning, such as diving decompression risk is one of them. This article construction of diving record wearable device based on IOT. The instructor can set the diving height and time according to the situation of each student, and there is an emergency button set on the wearable device. When students have any problems, they can use AIS communication to send messages to the coach ship, and the coach ship can immediately locate and rescue. This article mainly uses GPS and Beacon for positioning to understand the student's position and height. This article uses the IoT sensor to understand the student's movement rate and height to avoid the danger that the student's ascent rate is too fast or the altitude is too high.","PeriodicalId":310247,"journal":{"name":"Proceedings of the 2020 ACM International Conference on Intelligent Computing and its Emerging Applications","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131561026","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reunion Block for High Magnification Histopathology Microscopic Image Analysis 用于高倍组织病理学显微图像分析的团聚块
Hyun-Cheol Park, Sang-Woong Lee
The input image scale must be considered in the microsatellite instability recognition method through deep learning image analysis. Since pathological images can observe various features through high magnification, an image analysis method capable of analyzing high-resolution images is required. Although CNN has excellent image analysis capabilities, the size of input images is limited. If we want to analyze an area bigger than the input image size of the CNN, the area should be reduced or crop. In this paper, we propose a recombination block that extracts and combines features in patch units to handle microsatellite images made up of high-resolution images.
基于深度学习图像分析的微卫星不稳定性识别方法必须考虑输入图像的尺度。由于病理图像可以通过高倍放大观察到各种特征,因此需要一种能够分析高分辨率图像的图像分析方法。虽然CNN具有出色的图像分析能力,但是输入图像的大小是有限的。如果我们想要分析比CNN输入图像尺寸更大的区域,则应该减少或裁剪该区域。在本文中,我们提出了一种提取和组合斑块单元特征的重组块来处理由高分辨率图像组成的微卫星图像。
{"title":"Reunion Block for High Magnification Histopathology Microscopic Image Analysis","authors":"Hyun-Cheol Park, Sang-Woong Lee","doi":"10.1145/3440943.3444356","DOIUrl":"https://doi.org/10.1145/3440943.3444356","url":null,"abstract":"The input image scale must be considered in the microsatellite instability recognition method through deep learning image analysis. Since pathological images can observe various features through high magnification, an image analysis method capable of analyzing high-resolution images is required. Although CNN has excellent image analysis capabilities, the size of input images is limited. If we want to analyze an area bigger than the input image size of the CNN, the area should be reduced or crop. In this paper, we propose a recombination block that extracts and combines features in patch units to handle microsatellite images made up of high-resolution images.","PeriodicalId":310247,"journal":{"name":"Proceedings of the 2020 ACM International Conference on Intelligent Computing and its Emerging Applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127417402","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Whale Optimization Algorithm for Hyperparameter Optimization in Network-Wide Traffic Speed Prediction 全网流量速度预测中超参数优化的鲸鱼优化算法
Zhang-Han Zhuang, Ming-Chao Chiang
Since there are way too many possible combinations of hyperparameters for training a desired deep neural network (DNN) model, finding out a set of suitable values for them is typically a difficult topic for the researchers when they use DNN for solving forecasting problems. In addition to manual tuning and trial-and-error for hyperparameters, how to automatically determine the values of hyperparameters has become a critical problem in recent years. In this study, we present a metaheuristic algorithm based on the whale optimization algorithm (WOA) to select suitable hyperparameters for the DNN because WOA demonstrates brilliant convergence speed in many optimization problems and the local optima avoidance mechanism is devised to prevent the searches from trapping into suboptimal solution easily. To validate the feasibility of the proposed algorithm, we compared it with several state-of-the-art hyperparameter selection algorithms for DNN in solving the network-wide traffic speed prediction problem. The experimental results show that WOA not only behaves much more stable but also outperforms all the other hyperparameter selection algorithms compared in this study in terms of the mean square error, mean average error, and mean average percentage error.
由于训练所需的深度神经网络(DNN)模型有太多可能的超参数组合,因此当研究人员使用DNN解决预测问题时,为它们找到一组合适的值通常是一个难题。除了对超参数进行人工调优和试错之外,如何自动确定超参数的值已成为近年来的一个关键问题。在本研究中,我们提出了一种基于鲸鱼优化算法(WOA)的元启发式算法来选择适合深度神经网络的超参数,因为WOA在许多优化问题中具有出色的收敛速度,并且设计了局部最优避免机制来防止搜索容易陷入次优解。为了验证所提出算法的可行性,我们将其与几种最先进的深度神经网络超参数选择算法进行比较,以解决网络范围内的交通速度预测问题。实验结果表明,WOA不仅表现得更加稳定,而且在均方误差、平均误差和平均百分比误差方面都优于本研究中比较的所有其他超参数选择算法。
{"title":"The Whale Optimization Algorithm for Hyperparameter Optimization in Network-Wide Traffic Speed Prediction","authors":"Zhang-Han Zhuang, Ming-Chao Chiang","doi":"10.1145/3440943.3444729","DOIUrl":"https://doi.org/10.1145/3440943.3444729","url":null,"abstract":"Since there are way too many possible combinations of hyperparameters for training a desired deep neural network (DNN) model, finding out a set of suitable values for them is typically a difficult topic for the researchers when they use DNN for solving forecasting problems. In addition to manual tuning and trial-and-error for hyperparameters, how to automatically determine the values of hyperparameters has become a critical problem in recent years. In this study, we present a metaheuristic algorithm based on the whale optimization algorithm (WOA) to select suitable hyperparameters for the DNN because WOA demonstrates brilliant convergence speed in many optimization problems and the local optima avoidance mechanism is devised to prevent the searches from trapping into suboptimal solution easily. To validate the feasibility of the proposed algorithm, we compared it with several state-of-the-art hyperparameter selection algorithms for DNN in solving the network-wide traffic speed prediction problem. The experimental results show that WOA not only behaves much more stable but also outperforms all the other hyperparameter selection algorithms compared in this study in terms of the mean square error, mean average error, and mean average percentage error.","PeriodicalId":310247,"journal":{"name":"Proceedings of the 2020 ACM International Conference on Intelligent Computing and its Emerging Applications","volume":"224 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128284330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Whole Slide Image Classification and Segmentation using Deep Learning 基于深度学习的全幻灯片图像分类和分割
S. Poudel, Sang-Woong Lee
Whole slide imaging is now being used across the world in pathology labs for an accurate diagnosis of biopsy specimens. However, due to the large size of these images, an automatic deep learning-based method is highly desirable for diagnosing. Herein, we propose a two-step methodology for the classification and segmentation of whole-slide image (WSI). First, the patches are extracted from the image and fed into deep learning based techniques like U-Net with its corresponding mask for the accurate segmentation. Further, the cancerous patches are trained for the classification task. During inference, the predicted segmented mask are evaluated in the classification model. Our experimental results demonstrated that the proposed methodology can be used for accurate segmentation and classification.
整个切片成像现在被用于世界各地的病理实验室活检标本的准确诊断。然而,由于这些图像的尺寸很大,因此非常需要基于自动深度学习的诊断方法。在此,我们提出了一种两步整张幻灯片图像的分类和分割方法。首先,从图像中提取斑块,并将其与相应的掩码一起输入到基于深度学习的U-Net技术中进行精确分割。此外,癌变斑块被训练用于分类任务。在推理过程中,在分类模型中对预测的分段掩码进行评估。实验结果表明,该方法可用于准确的分割和分类。
{"title":"Whole Slide Image Classification and Segmentation using Deep Learning","authors":"S. Poudel, Sang-Woong Lee","doi":"10.1145/3440943.3444357","DOIUrl":"https://doi.org/10.1145/3440943.3444357","url":null,"abstract":"Whole slide imaging is now being used across the world in pathology labs for an accurate diagnosis of biopsy specimens. However, due to the large size of these images, an automatic deep learning-based method is highly desirable for diagnosing. Herein, we propose a two-step methodology for the classification and segmentation of whole-slide image (WSI). First, the patches are extracted from the image and fed into deep learning based techniques like U-Net with its corresponding mask for the accurate segmentation. Further, the cancerous patches are trained for the classification task. During inference, the predicted segmented mask are evaluated in the classification model. Our experimental results demonstrated that the proposed methodology can be used for accurate segmentation and classification.","PeriodicalId":310247,"journal":{"name":"Proceedings of the 2020 ACM International Conference on Intelligent Computing and its Emerging Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129324652","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Differential Privacy Protection with Group Onion Routing based on AI-based URL Classification 基于ai URL分类的组洋葱路由差分隐私保护
I. Liu, Yung-Lin Chang, Jung-Shian Li, Chuan-Gang Liu
Due to the rapid spread of tablet computers, smartphones, and other mobile information devices, wireless communication technology is fully developed and deployed widely. Mobile Internet access has been a main and important way to communicate the world in daily and it privacy protection also catches much attentions. The Onion Router, better known as Tor, is a technique for anonymous communication over internet without regional restrictions for privacy protection. Apart from this, Tor can reach sites that normal search engine cannot search. As the opinion of Tor, the transmitted data has been encrypted layer by layer, just like onion, before it reaching server. Our research proposed a system predicting URL's category with the use of machine learning technique before visiting. According to the category prediction, we represent different privacy level with three kinds of RSA key lengths on onion routing. Depending on various situations, our system can obtain the balance between security and time cost. Hence, our proposed scheme can make onion routing more flexible and efficiently.
随着平板电脑、智能手机等移动信息设备的迅速普及,无线通信技术得到了充分的发展和广泛的部署。移动互联网接入已经成为人们日常与世界交流的主要和重要方式,其隐私保护也受到人们的关注。洋葱路由器,更广为人知的名字是Tor,是一种不受区域隐私保护限制的匿名互联网通信技术。除此之外,Tor还可以到达普通搜索引擎无法搜索到的网站。根据Tor的观点,传输的数据在到达服务器之前就像洋葱一样被层层加密。本研究提出了一种利用机器学习技术在访问前预测URL类别的系统。根据类别预测,我们在洋葱路由上用三种RSA密钥长度表示不同的隐私级别。根据不同的情况,我们的系统可以在安全性和时间成本之间取得平衡。因此,我们提出的方案可以使洋葱路由更加灵活和高效。
{"title":"Differential Privacy Protection with Group Onion Routing based on AI-based URL Classification","authors":"I. Liu, Yung-Lin Chang, Jung-Shian Li, Chuan-Gang Liu","doi":"10.1145/3440943.3444717","DOIUrl":"https://doi.org/10.1145/3440943.3444717","url":null,"abstract":"Due to the rapid spread of tablet computers, smartphones, and other mobile information devices, wireless communication technology is fully developed and deployed widely. Mobile Internet access has been a main and important way to communicate the world in daily and it privacy protection also catches much attentions. The Onion Router, better known as Tor, is a technique for anonymous communication over internet without regional restrictions for privacy protection. Apart from this, Tor can reach sites that normal search engine cannot search. As the opinion of Tor, the transmitted data has been encrypted layer by layer, just like onion, before it reaching server. Our research proposed a system predicting URL's category with the use of machine learning technique before visiting. According to the category prediction, we represent different privacy level with three kinds of RSA key lengths on onion routing. Depending on various situations, our system can obtain the balance between security and time cost. Hence, our proposed scheme can make onion routing more flexible and efficiently.","PeriodicalId":310247,"journal":{"name":"Proceedings of the 2020 ACM International Conference on Intelligent Computing and its Emerging Applications","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127268850","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Proposed On-site Document Sharing System using FIDO 提出了基于FIDO的现场文档共享系统
Ming-Ying Lee, Hanbyeol Kang, Jun-Seok Kwak, Donghyun Kim, Hye-Lim Jeong, Jung-Taek Seo
With the advancement of information and communication technology, online file exchange such as document delivery, business reporting, and submission of reports within or between companies has been widely used. With the increase in convenience, however, security threats have also increased due to the high risk of external leak of files exchanged online. Although companies employ network separation by building an internal corporate network, this has a drawback, i.e., files cannot be used outside such as a work-from-home environment. To solve this problem, this paper proposes a secure file sharing system using the Fast IDentify Online (FIDO) technique. This service is expected to contribute to the improvement of file sharing security because it can encrypt and decrypt files through FIDO authentication when viewing internal files from outside.
随着信息通信技术的发展,企业内部或企业之间的文件传递、业务报告、报告提交等在线文件交换得到了广泛的应用。然而,随着便利性的增加,由于在线交换的文件外泄的风险很高,安全威胁也随之增加。虽然公司通过建立内部公司网络来采用网络隔离,但这有一个缺点,即文件不能在外部使用,例如在家工作的环境。为了解决这一问题,本文提出了一种基于快速在线识别(FIDO)技术的安全文件共享系统。预计该服务将有助于提高文件共享安全性,因为当从外部查看内部文件时,它可以通过FIDO身份验证对文件进行加密和解密。
{"title":"Proposed On-site Document Sharing System using FIDO","authors":"Ming-Ying Lee, Hanbyeol Kang, Jun-Seok Kwak, Donghyun Kim, Hye-Lim Jeong, Jung-Taek Seo","doi":"10.1145/3440943.3444740","DOIUrl":"https://doi.org/10.1145/3440943.3444740","url":null,"abstract":"With the advancement of information and communication technology, online file exchange such as document delivery, business reporting, and submission of reports within or between companies has been widely used. With the increase in convenience, however, security threats have also increased due to the high risk of external leak of files exchanged online. Although companies employ network separation by building an internal corporate network, this has a drawback, i.e., files cannot be used outside such as a work-from-home environment. To solve this problem, this paper proposes a secure file sharing system using the Fast IDentify Online (FIDO) technique. This service is expected to contribute to the improvement of file sharing security because it can encrypt and decrypt files through FIDO authentication when viewing internal files from outside.","PeriodicalId":310247,"journal":{"name":"Proceedings of the 2020 ACM International Conference on Intelligent Computing and its Emerging Applications","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127204628","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Proceedings of the 2020 ACM International Conference on Intelligent Computing and its Emerging Applications
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1