2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML)最新文献

筛选
英文 中文
Regression analysis for Dependent current status data 相关电流状态数据的回归分析
2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML) Pub Date : 2022-03-01 DOI: 10.1109/CACML55074.2022.00111
H. Yan, Yuting Zhou, Xuemei Yang
{"title":"Regression analysis for Dependent current status data","authors":"H. Yan, Yuting Zhou, Xuemei Yang","doi":"10.1109/CACML55074.2022.00111","DOIUrl":"https://doi.org/10.1109/CACML55074.2022.00111","url":null,"abstract":"In the current state data, each individual is observed only once, and the only available information is whether the failure event of interest occured during the observation time. In other words, the current state data cannot observe any individual's specific survival time or the failure time, therefore, it is significant different from the normal right-censored data. In this paper, we use the Cox model to construct the model of interested failure time and observation time, because the model contains not only regression coefficient of finite dimension, but also the unknown function of infinite dimension, and there are covariables which cannot be observed, so it is difficult to directly maximize the likelihood function. Therefore, the non-observable latent variable is introduced to describe the dependence of two kinds of time, the step function is used to approximate the unknown function to reduce the difficulty of non-parametric part, further the parameter estimation is given by the EM algorithm, the consistency and asymptotic of the estimators are also certified. Some data simulations are performed, whose results show that the method presented here performed well under a limited sample. In the following paper, a group of mouse experiments demonstrating that the sterile environment has no significant effect on tumor inhibition. This paper only considered the current state data and the Cox model, In the futher, the statistical inference problem under other more general and more complex models can be further considered.","PeriodicalId":137505,"journal":{"name":"2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129877122","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
Lnnovation of Application Mode of Credit Data in E-commerce Platform 电子商务平台信用数据应用模式创新
2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML) Pub Date : 2022-03-01 DOI: 10.1109/CACML55074.2022.00095
Deng Feng
{"title":"Lnnovation of Application Mode of Credit Data in E-commerce Platform","authors":"Deng Feng","doi":"10.1109/CACML55074.2022.00095","DOIUrl":"https://doi.org/10.1109/CACML55074.2022.00095","url":null,"abstract":"Credit data has an important influence on the operation mode and operation strategy of network platform. In this paper, through the network shopping penetration of high taobao platform to explore credit data to the platform enterprise income and the influence of the long-term competitive advantage, to clarify the network credit data on network platform development the important role in the process of interaction, at the same time analysis of taobao of credit data using the shortcomings and improve the measures, in order to help enterprise development system and perfecting the credit database.","PeriodicalId":137505,"journal":{"name":"2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129023501","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
Cancer metastasis fast location based on coarse-to-fine network 基于粗到细网络的肿瘤转移快速定位
2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML) Pub Date : 2022-03-01 DOI: 10.1109/CACML55074.2022.00044
Rui-cang Wang, Yun Gu, Jie Yang
{"title":"Cancer metastasis fast location based on coarse-to-fine network","authors":"Rui-cang Wang, Yun Gu, Jie Yang","doi":"10.1109/CACML55074.2022.00044","DOIUrl":"https://doi.org/10.1109/CACML55074.2022.00044","url":null,"abstract":"The Whole Slide Images(WSIs) play a very important role in breast cancer diagnosis and the pathologist need to locate the lymph node metastasis on the such the gigapixel pathology image. Recently, the deep convolutional neural network has show the promise of metastases localization, it is still a challenge to fast locate the metastases. Either divide WSIs into small patches and perform classification or scan the bigger image block on WSIs in inference. In either way, the algorithm needs to be performed at the finest magnification, which greatly limits inference time. In this paper, we propose a cascade coarse to fine network to expedite the speed of to locate metastases in WSIs, which contain the coarse network to handle the low magnification to find the rough metastases speedily and the fine network efficiently reclassifies the positive responses at high magnification. The experiment is performed on the Camelyon16 dataset demonstrated that the proposed method compared to the previous method is the fastest and also can achieve the localization average FROC score of 81.0 on the test set.","PeriodicalId":137505,"journal":{"name":"2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128805232","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
Semi-online Algorithms on Two Hierarchical Machines with Reassignment 两重分配层次机器的半在线算法
2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML) Pub Date : 2022-03-01 DOI: 10.1109/CACML55074.2022.00129
Shuliang Zhao
{"title":"Semi-online Algorithms on Two Hierarchical Machines with Reassignment","authors":"Shuliang Zhao","doi":"10.1109/CACML55074.2022.00129","DOIUrl":"https://doi.org/10.1109/CACML55074.2022.00129","url":null,"abstract":"This paper studies the reassignment schedule problem on two identical machines with hierarchy. When the first machine has a hierarchy of 1 and the second machine has a hierarchy of 2, under the limitation of hierarchy constraints, after all jobs are assigned, we discuss the three situations of reassigning a job, maximizing the minimum machine load. The first situation is reassigning the last job in the sequence equivalent to the online situation, and the competitive ratio of any online algorithm is boundless; the second situation is reassigning the last job on the machine M2, proposing the optimal algorithm with a competitive ratio of 2; and the third situation is that reassigning any job is equivalent to the buffer size of 1. Addition, any k jobs with hierarchy 2 are reassigned, under the limitation of hierarchy constraints, and the competitive ratio of any online algorithm is at least 2.","PeriodicalId":137505,"journal":{"name":"2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML)","volume":"418 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123269706","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
Secret Numerical Interval Decision Protocol for Protecting Private Information and Its Application 隐私信息保密数字区间决策协议及其应用
2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML) Pub Date : 2022-03-01 DOI: 10.1109/CACML55074.2022.00126
Shaofeng Lu, Chengzhe Lv, W. Wang, Changqing Xu, Huadan Fan, Yuefeng Lu, Yulong Hu, Wenxing Li
{"title":"Secret Numerical Interval Decision Protocol for Protecting Private Information and Its Application","authors":"Shaofeng Lu, Chengzhe Lv, W. Wang, Changqing Xu, Huadan Fan, Yuefeng Lu, Yulong Hu, Wenxing Li","doi":"10.1109/CACML55074.2022.00126","DOIUrl":"https://doi.org/10.1109/CACML55074.2022.00126","url":null,"abstract":"Cooperative secure computing based on the relationship between numerical value and numerical interval is not only the basic problems of secure multiparty computing but also the core problems of cooperative secure computing. It is of substantial theoretical and practical significance for information security in relation to scientific computing to continuously investigate and construct solutions to such problems. Based on the Goldwasser-Micali homomorphic encryption scheme, this paper propose the Morton rule, according to the characteristics of the interval, a double-length vector is constructed to participate in the exclusive-or operation, and an efficient cooperative decision-making solution for integer and integer interval security is designed. This solution can solve more basic problems in cooperative security computation after suitable transformations. A theoretical analysis shows that this solution is safe and efficient. Finally, applications that are based on these protocols are presented.","PeriodicalId":137505,"journal":{"name":"2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML)","volume":"369 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116539340","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
Detecting Water Quality Using KNN, Bayesian and Decision Tree 基于KNN、贝叶斯和决策树的水质检测
2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML) Pub Date : 2022-03-01 DOI: 10.1109/CACML55074.2022.00061
X. Jia
{"title":"Detecting Water Quality Using KNN, Bayesian and Decision Tree","authors":"X. Jia","doi":"10.1109/CACML55074.2022.00061","DOIUrl":"https://doi.org/10.1109/CACML55074.2022.00061","url":null,"abstract":"In this study, we have analyzed water quality using different approaches: descriptive analysis and machine learning. First, we get the data source from kaggle website. After processing the data, we use Python sklearn package for data mining. Firstly, the machine learning data mining method is selected through description analysis. Finally, we choose KNN, Bayesian algorithm and decision tree to analyze the water data from kaggle website. The goal is to divide the data into available and unavailable by machine learning algorithm. Finally, through these three methods, we get the results of three methods and make some corresponding comparison and analysis.","PeriodicalId":137505,"journal":{"name":"2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122672976","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}
引用次数: 1
Intellegent Coal Gangue Sorting System Based on YOLOv5 基于YOLOv5的煤矸石智能分选系统
2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML) Pub Date : 2022-03-01 DOI: 10.1109/CACML55074.2022.00088
Pan Xin, Z. Dong
{"title":"Intellegent Coal Gangue Sorting System Based on YOLOv5","authors":"Pan Xin, Z. Dong","doi":"10.1109/CACML55074.2022.00088","DOIUrl":"https://doi.org/10.1109/CACML55074.2022.00088","url":null,"abstract":"Aiming at the problem of relying on manpower and consuming a lot of resources in the sorting of gangue in the traditional coal industry, the self-made training set of gangue and coal, combined with the YOLO algorithm of target detection, realized the identification and distinction of gangue and coal. Experiments show that the method is fast and can more accurately distinguish coal and gangue, and achieves the expected effect.","PeriodicalId":137505,"journal":{"name":"2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133514643","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
Adaptive Multi-tasking Framework for Video Action Proposal Localization 视频动作提案定位的自适应多任务框架
2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML) Pub Date : 2022-03-01 DOI: 10.1109/CACML55074.2022.00023
H. Jia
{"title":"Adaptive Multi-tasking Framework for Video Action Proposal Localization","authors":"H. Jia","doi":"10.1109/CACML55074.2022.00023","DOIUrl":"https://doi.org/10.1109/CACML55074.2022.00023","url":null,"abstract":"This paper focuses on the improvement of the accuracy of activity detection for multi-camera/extended video stream. Most existing methods typically sample frames from video, which is applied by sliding window method. Action localization in video can be divided into different phases: temporal proposal generation and action classification. In the part of proposal generation stage, most of the works choose the static sampling method, that is, in the evaluation stage, the same sampling rules are followed for any input videos. We figure that there is also guidance information for generating a proposal in the training data. In this paper, We propose a Adaptive Multi-tasking Framework, to deliver proposals according to the input video automatically. For each video, we can first establishes a mapping from visual signals to proposal bounding, the starting and ending frames for the proposal, and then combine the generated proposal with state-of-art model SlowFast to finish the action classification task. The framework in this practice was defined as Adaptive Proposal Generation Network(APGN). We train and test our model on the VIRAT dataset, which consists of real outdoor video with non-actors actions. We hope that the accuracy of activity detection will be enhanced by combining our model with some existing activity detection network which based on the old fashion methods. By testing with SlowFast network, we achieve the improvement of Mean Average Precision(mAP) by more than 10 percent. We believe that by replacing the typical sliding window framework with our proposed framework, other models can enhance accuracy and performance, which we will explore more in the future work.","PeriodicalId":137505,"journal":{"name":"2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114480167","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
Design of Automatic Recycling Robot Based on YOLO Target Detection 基于YOLO目标检测的自动回收机器人设计
2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML) Pub Date : 2022-03-01 DOI: 10.1109/CACML55074.2022.00059
Chuan Li, Manming Shu, Ling Du, Haoyue Tan, Lang Wei
{"title":"Design of Automatic Recycling Robot Based on YOLO Target Detection","authors":"Chuan Li, Manming Shu, Ling Du, Haoyue Tan, Lang Wei","doi":"10.1109/CACML55074.2022.00059","DOIUrl":"https://doi.org/10.1109/CACML55074.2022.00059","url":null,"abstract":"In order to achieve automatic item grasping and recovery, we propose a system design method based on YOLO v4 automatic recovery robot, using the higher computing power of Jetson Nano and STM32F103ZET6 computing units, processing image information to control the operation of the robot system, with six degrees of freedom PWM robot arm to accurately grasp the items. After system testing, the average item recognition rate exceeds 98.5%, and the recovery success rate exceeds 96%, truly achieving automatic search, grasp, recovery, and return end-to-end operation.","PeriodicalId":137505,"journal":{"name":"2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114841452","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
ST-COVID: a Deep Multi-View Spatio-temporal Model for COVID-19 Forecasting ST-COVID:一种新型冠状病毒肺炎深度多视角时空预测模型
2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML) Pub Date : 2022-03-01 DOI: 10.1109/CACML55074.2022.00133
Chang Ju, Jingping Wang, Yingjun Zhang, Hui Yin, Hua Huang, Hongli Xu
{"title":"ST-COVID: a Deep Multi-View Spatio-temporal Model for COVID-19 Forecasting","authors":"Chang Ju, Jingping Wang, Yingjun Zhang, Hui Yin, Hua Huang, Hongli Xu","doi":"10.1109/CACML55074.2022.00133","DOIUrl":"https://doi.org/10.1109/CACML55074.2022.00133","url":null,"abstract":"The outbreak of COVID-19 has caused a dramatic loss of human life worldwide. Reliable prediction results are crucial on pandemic prevention and control in the early stage. However, it is a very challenging task due to insufficient data and dynamic virus spread pattern. Unlike most existing works only considering local data for a given region, we propose a spatio-temporal prediction model (ST-COVID) for COVID-19 forecasting to borrow experience from historical observations of other regions. Specifically, our proposed model consists of two views: spatial view (modeling global spatial connectivity with neighbor regions in geography and semantic space via GCNs), temporal view (extracting local and global latent temporal trend via CNNs and GRU). Extensive experiments on two real-world datasets at state and county level in US indicate that the proposed model outperforms over nine baselines in both short-term and long-term prediction.","PeriodicalId":137505,"journal":{"name":"2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117323618","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信