首页 > 最新文献

Computer science & information technology最新文献

英文 中文
LEA-DNS: DNS Resolution Validity and Timeliness Guarantee Local Authentication Extension with Public Blockchain LEA-DNS: DNS解析的有效性和时效性保证本地认证扩展,Public区块链
Pub Date : 2021-06-19 DOI: 10.5121/csit.2021.110801
Ting Xiong, Shaojing Fu, Xiaochun Luo, Tao Xie
While the Domain Name System (DNS) is an infrastructure of the current network, it still faces the problem of centralization and data authentication according to its concept and practice. Decentralized storage of domain names and user local verification using blockchain may be effective solutions. However, since the blockchain is an add-only type database, domain name changes will cause out of date records to still be correct when using the Simplified Payment Verification (SPV) mechanism locally. This paper mainly introduces Local Enhanced Authentication DNS (LEA-DNS), which allows domain names to be stored in public blockchain database to provide decentralization feature and is compatible with the existing DNS. It achieves the validity and timeliness of local domain name resolution results to ensure correct and up to date with the Merkle Mountain Range and RSA accumulator technologies. Experiments show that less than 3.052Kb is needed for each DNS request to be validated, while the validation time is negligible, and only 9.44Kb of data need to be stored locally by the web client. Its compatibility with the existing DNS system and the lightness of the validation protocols indicate that this is a system suitable for deployment widely.
虽然域名系统(DNS)是当前网络的基础设施,但根据其概念和实践,它仍然面临着集中化和数据认证的问题。域名的去中心化存储和使用区块链的用户本地验证可能是有效的解决方案。然而,由于区块链是一个仅添加类型的数据库,在本地使用简化支付验证(SPV)机制时,域名更改将导致过期记录仍然正确。本文主要介绍了本地增强认证DNS(LEA-DNS),它允许域名存储在公共区块链数据库中,以提供去中心化功能,并与现有DNS兼容。它实现了本地域名解析结果的有效性和及时性,以确保Merkle Mountain Range和RSA累加器技术的正确性和最新性。实验表明,每个DNS请求需要小于3.052Kb才能进行验证,而验证时间可以忽略不计,并且web客户端只需要本地存储9.44Kb的数据。它与现有DNS系统的兼容性和验证协议的轻便性表明,这是一个适合广泛部署的系统。
{"title":"LEA-DNS: DNS Resolution Validity and Timeliness Guarantee Local Authentication Extension with Public Blockchain","authors":"Ting Xiong, Shaojing Fu, Xiaochun Luo, Tao Xie","doi":"10.5121/csit.2021.110801","DOIUrl":"https://doi.org/10.5121/csit.2021.110801","url":null,"abstract":"While the Domain Name System (DNS) is an infrastructure of the current network, it still faces the problem of centralization and data authentication according to its concept and practice. Decentralized storage of domain names and user local verification using blockchain may be effective solutions. However, since the blockchain is an add-only type database, domain name changes will cause out of date records to still be correct when using the Simplified Payment Verification (SPV) mechanism locally. This paper mainly introduces Local Enhanced Authentication DNS (LEA-DNS), which allows domain names to be stored in public blockchain database to provide decentralization feature and is compatible with the existing DNS. It achieves the validity and timeliness of local domain name resolution results to ensure correct and up to date with the Merkle Mountain Range and RSA accumulator technologies. Experiments show that less than 3.052Kb is needed for each DNS request to be validated, while the validation time is negligible, and only 9.44Kb of data need to be stored locally by the web client. Its compatibility with the existing DNS system and the lightness of the validation protocols indicate that this is a system suitable for deployment widely.","PeriodicalId":72673,"journal":{"name":"Computer science & information technology","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45061229","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
Hierarchical Virtual Bitmaps for Spread Estimation in Traffic Measurement 用于流量测量中扩频估计的分层虚拟位图
Pub Date : 2021-05-29 DOI: 10.5121/CSIT.2021.110718
Olufemi O. Odegbile, Chaoyi Ma, Shigang Chen, D. Melissourgos, Haibo Wang
This paper introduces a hierarchical traffic model for spread measurement of network traffic flows. The hierarchical model, which aggregates lower level flows into higher-level flows in a hierarchical structure, will allow us to measure network traffic at different granularities at once to support diverse traffic analysis from a grand view to fine-grained details. The spread of a flow is the number of distinct elements (under measurement) in the flow, where the flow label (that identifies packets belonging to the flow) and the elements (which are defined based on application need) can be found in packet headers or payload. Traditional flow spread estimators are designed without hierarchical traffic modeling in mind, and incur high overhead when they are applied to each level of the traffic hierarchy. In this paper, we propose a new Hierarchical Virtual bitmap Estimator (HVE) that performs simultaneous multi-level traffic measurement, at the same cost of a traditional estimator, without degrading measurement accuracy. We implement the proposed solution and perform experiments based on real traffic traces. The experimental results demonstrate that HVE improves measurement throughput by 43% to 155%, thanks to the reduction of perpacket processing overhead. For small to medium flows, its measurement accuracy is largely similar to traditional estimators that work at one level at a time. For large aggregate and base flows, its accuracy is better, with up to 97% smaller error in our experiments.
本文介绍了一种用于网络流量分布度量的分层流量模型。层次化模型在层次化结构中将低级流聚合到高级流中,它将允许我们同时测量不同粒度的网络流量,以支持从宏观视图到细粒度细节的各种流量分析。流的扩展是流中不同元素(在测量中)的数量,其中流标签(标识属于流的数据包)和元素(根据应用程序需要定义)可以在包头或有效负载中找到。传统的流量扩展估计器在设计时没有考虑层次化的流量建模,并且在应用于流量层次的各个层次时产生很高的开销。在本文中,我们提出了一种新的分层虚拟位图估计器(HVE),它在不降低测量精度的情况下,以与传统估计器相同的成本同时执行多级流量测量。我们实现了所提出的解决方案,并基于真实的流量轨迹进行了实验。实验结果表明,由于减少了单包处理开销,HVE将测量吞吐量提高了43%至155%。对于中小型流量,它的测量精度在很大程度上与传统的一次只在一个水平上工作的估计器相似。对于大的集料和基流,它的精度更好,在我们的实验中误差减少了97%。
{"title":"Hierarchical Virtual Bitmaps for Spread Estimation in Traffic Measurement","authors":"Olufemi O. Odegbile, Chaoyi Ma, Shigang Chen, D. Melissourgos, Haibo Wang","doi":"10.5121/CSIT.2021.110718","DOIUrl":"https://doi.org/10.5121/CSIT.2021.110718","url":null,"abstract":"This paper introduces a hierarchical traffic model for spread measurement of network traffic flows. The hierarchical model, which aggregates lower level flows into higher-level flows in a hierarchical structure, will allow us to measure network traffic at different granularities at once to support diverse traffic analysis from a grand view to fine-grained details. The spread of a flow is the number of distinct elements (under measurement) in the flow, where the flow label (that identifies packets belonging to the flow) and the elements (which are defined based on application need) can be found in packet headers or payload. Traditional flow spread estimators are designed without hierarchical traffic modeling in mind, and incur high overhead when they are applied to each level of the traffic hierarchy. In this paper, we propose a new Hierarchical Virtual bitmap Estimator (HVE) that performs simultaneous multi-level traffic measurement, at the same cost of a traditional estimator, without degrading measurement accuracy. We implement the proposed solution and perform experiments based on real traffic traces. The experimental results demonstrate that HVE improves measurement throughput by 43% to 155%, thanks to the reduction of perpacket processing overhead. For small to medium flows, its measurement accuracy is largely similar to traditional estimators that work at one level at a time. For large aggregate and base flows, its accuracy is better, with up to 97% smaller error in our experiments.","PeriodicalId":72673,"journal":{"name":"Computer science & information technology","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43828515","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
Managing the Complexity of Climate Change 应对气候变化的复杂性
Pub Date : 2021-03-27 DOI: 10.2139/ssrn.3636845
S. Turnbull
This paper indicates how the knowledge of complex systems can be put into practice to counter climate change. A contribution of the paper is to show how individual behaviour, institutional analysis, political science and management can be grounded and integrated into the complexity of natural systems to introduce mutual sustainability. Bytes are used as the unit of analysis to explain how nature governs complexity on a more reliable and comprehensive basis than can be achieved by humans using markets and hierarchies. Tax incentives are described to increase revenues while encouraging organisations to adopt elements of ecological governance found in nature and in some social organisations identified by Ostrom and the author. Ecological corporations provide benefits for all stakeholders. This makes them a common good to promote global common goods like enriching democracy from the bottom up while countering: climate change, pollution, and inequalities in power, wealth and income.
本文指出如何将复杂系统的知识应用于应对气候变化的实践。这篇论文的一个贡献是展示了个人行为、制度分析、政治科学和管理如何能够扎根并整合到自然系统的复杂性中,以引入相互的可持续性。字节被用作分析单位,用来解释自然如何在比人类使用市场和等级制度更可靠、更全面的基础上管理复杂性。税收激励被描述为增加收入,同时鼓励组织采用自然界和奥斯特罗姆和作者确定的一些社会组织中发现的生态治理要素。生态公司为所有利益相关者提供利益。这使它们成为促进全球共同利益的共同利益,比如在应对气候变化、污染以及权力、财富和收入不平等的同时,自下而上地丰富民主。
{"title":"Managing the Complexity of Climate Change","authors":"S. Turnbull","doi":"10.2139/ssrn.3636845","DOIUrl":"https://doi.org/10.2139/ssrn.3636845","url":null,"abstract":"This paper indicates how the knowledge of complex systems can be put into practice to counter climate change. A contribution of the paper is to show how individual behaviour, institutional analysis, political science and management can be grounded and integrated into the complexity of natural systems to introduce mutual sustainability. Bytes are used as the unit of analysis to explain how nature governs complexity on a more reliable and comprehensive basis than can be achieved by humans using markets and hierarchies. Tax incentives are described to increase revenues while encouraging organisations to adopt elements of ecological governance found in nature and in some social organisations identified by Ostrom and the author. Ecological corporations provide benefits for all stakeholders. This makes them a common good to promote global common goods like enriching democracy from the bottom up while countering: climate change, pollution, and inequalities in power, wealth and income.","PeriodicalId":72673,"journal":{"name":"Computer science & information technology","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42783012","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
A Color Image Blind Digital Watermarking Algorithm Based on QR Code 基于QR码的彩色图像盲数字水印算法
Pub Date : 2021-03-27 DOI: 10.5121/CSIT.2021.110405
Xue Gong, Wan-Cyun Li
With the rapid development of network technology and multimedia, the current color image digital watermarking algorithm has the problems of small capacity and poor robustness. In order to improve the capacity and anti-attack ability of digital watermarking. A color image blind digital watermarking algorithm based on QR code is proposed. The algorithm combines Discrete Wavelet Transform (DWT) and Discrete Cosine Transform (DCT). First, the color image was converted from RGB space to YCbCr space, and the Y component was extracted and the second-level discrete wavelet transform is performed; secondly, the LL2 subband was divided into blocks and carried out discrete cosine transform; finally, used the embedding method to embed the Arnold transform watermark information into the block. The experimental results show that the PSNR of the color image embedded with the QR code is 56.7159 without being attacked. After being attacked, its PSNR is more than 30dB and NC is more than 0.95. It is proved that the algorithm has good robustness and can achieve blind watermark extraction.
随着网络技术和多媒体技术的飞速发展,目前的彩色图像数字水印算法存在容量小、鲁棒性差的问题。为了提高数字水印的容量和抗攻击能力。提出了一种基于二维码的彩色图像盲数字水印算法。该算法结合了离散小波变换(DWT)和离散余弦变换(DCT)。首先,将彩色图像从RGB空间转换为YCbCr空间,提取Y分量并进行二阶离散小波变换;其次,将LL2子带划分为块,并进行离散余弦变换;最后,利用嵌入方法将Arnold变换水印信息嵌入到块中。实验结果表明,在不受攻击的情况下,嵌入二维码的彩色图像的PSNR为56.7159。经过攻击后,其PSNR大于30dB,NC大于0.95。实验证明,该算法具有良好的鲁棒性,可以实现水印的盲提取。
{"title":"A Color Image Blind Digital Watermarking Algorithm Based on QR Code","authors":"Xue Gong, Wan-Cyun Li","doi":"10.5121/CSIT.2021.110405","DOIUrl":"https://doi.org/10.5121/CSIT.2021.110405","url":null,"abstract":"With the rapid development of network technology and multimedia, the current color image digital watermarking algorithm has the problems of small capacity and poor robustness. In order to improve the capacity and anti-attack ability of digital watermarking. A color image blind digital watermarking algorithm based on QR code is proposed. The algorithm combines Discrete Wavelet Transform (DWT) and Discrete Cosine Transform (DCT). First, the color image was converted from RGB space to YCbCr space, and the Y component was extracted and the second-level discrete wavelet transform is performed; secondly, the LL2 subband was divided into blocks and carried out discrete cosine transform; finally, used the embedding method to embed the Arnold transform watermark information into the block. The experimental results show that the PSNR of the color image embedded with the QR code is 56.7159 without being attacked. After being attacked, its PSNR is more than 30dB and NC is more than 0.95. It is proved that the algorithm has good robustness and can achieve blind watermark extraction.","PeriodicalId":72673,"journal":{"name":"Computer science & information technology","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48687460","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
Investigating Data Sharing in Speech Recognition for an Under-Resourced Language: The Case of Algerian Dialect 资源不足语言语音识别中的数据共享研究——以阿尔及利亚方言为例
Pub Date : 2021-03-20 DOI: 10.5121/CSIT.2021.110308
M. Menacer, K. Smaïli
The Arabic language has many varieties, including its standard form, Modern Standard Arabic (MSA), and its spoken forms, namely the dialects. Those dialects are representative examples of under-resourced languages for which automatic speech recognition is considered as an unresolved issue. To address this issue, we recorded several hours of spoken Algerian dialect and used them to train a baseline model. This model was boosted afterwards by taking advantage of other languages that impact this dialect by integrating their data in one large corpus and by investigating three approaches: multilingual training, multitask learning and transfer learning. The best performance was achieved using a limited and balanced amount of acoustic data from each additional language, as compared to the data size of the studied dialect. This approach led to an improvement of 3.8% in terms of word error rate in comparison to the baseline system trained only on the dialect data.
阿拉伯语有许多变体,包括其标准形式现代标准阿拉伯语(MSA)和口语形式方言。这些方言是资源不足的语言的代表性例子,自动语音识别被认为是一个尚未解决的问题。为了解决这个问题,我们记录了几个小时的阿尔及利亚方言口语,并用它们来训练基线模型。之后,通过将影响该方言的其他语言的数据整合到一个大型语料库中,并研究三种方法:多语言训练、多任务学习和迁移学习,该模型得到了提升。与所研究方言的数据大小相比,使用来自每种额外语言的有限且平衡的声学数据量可以获得最佳性能。与仅根据方言数据训练的基线系统相比,这种方法在单词错误率方面提高了3.8%。
{"title":"Investigating Data Sharing in Speech Recognition for an Under-Resourced Language: The Case of Algerian Dialect","authors":"M. Menacer, K. Smaïli","doi":"10.5121/CSIT.2021.110308","DOIUrl":"https://doi.org/10.5121/CSIT.2021.110308","url":null,"abstract":"The Arabic language has many varieties, including its standard form, Modern Standard Arabic (MSA), and its spoken forms, namely the dialects. Those dialects are representative examples of under-resourced languages for which automatic speech recognition is considered as an unresolved issue. To address this issue, we recorded several hours of spoken Algerian dialect and used them to train a baseline model. This model was boosted afterwards by taking advantage of other languages that impact this dialect by integrating their data in one large corpus and by investigating three approaches: multilingual training, multitask learning and transfer learning. The best performance was achieved using a limited and balanced amount of acoustic data from each additional language, as compared to the data size of the studied dialect. This approach led to an improvement of 3.8% in terms of word error rate in comparison to the baseline system trained only on the dialect data.","PeriodicalId":72673,"journal":{"name":"Computer science & information technology","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41338237","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
Optimization of Random Forest Model for Assessing and Predicting Geological Hazards Susceptibility in Lingyun County 凌云县地质灾害易感评价与预测的随机森林模型优化
Pub Date : 2021-03-02 DOI: 10.21203/RS.3.RS-231323/V1
C. Kong, Junzuo Wang, Xiaogang Ma, Yiping Tian, Zhiting Zhang, Kai Xu
The random forest (RF) model is improved by the optimization of unbalanced geological hazards dataset, differentiation of continuous geological hazards evaluation factors, sample similarity calculation, and iterative method for finding optimal random characteristics by calculating out-of-bagger errors. The geological hazards susceptibility evaluation model based on optimized RF (OPRF) was established and used to assess the susceptibility for Lingyun County. Then, ROC curve and field investigation were performed to verify the efficiency for different geological hazards susceptibility assessment models. The AUC values for five models were estimated as 0.766, 0.814, 0.842, 0.846 and 0.934, respectively, which indicated that the prediction accuracy of the OPRF model can be as high as 93.4%. This result demonstrated that the geological hazards susceptibility assessment model based on OPRF has the highest prediction accuracy. Furthermore, the OPRF model could be extended to other regions with similar geological environment backgrounds for geological hazards susceptibility assessment and prediction.
通过优化不平衡地质灾害数据集、区分连续地质灾害评价因子、样本相似性计算以及通过计算袋外误差来寻找最佳随机特征的迭代方法,对随机森林模型进行了改进。建立了基于优化RF(OPRF)的地质灾害易感评价模型,并将其应用于凌云县地质灾害的易感评价。然后,进行ROC曲线和现场调查,以验证不同地质灾害易感性评估模型的有效性。五个模型的AUC值分别估计为0.766、0.814、0.842、0.846和0.934,表明OPRF模型的预测准确率可高达93.4%。这一结果表明,基于OPRF的地质灾害易感性评估模型具有最高的预测准确度。此外,OPRF模型可以扩展到具有相似地质环境背景的其他地区,用于地质灾害易感性评估和预测。
{"title":"Optimization of Random Forest Model for Assessing and Predicting Geological Hazards Susceptibility in Lingyun County","authors":"C. Kong, Junzuo Wang, Xiaogang Ma, Yiping Tian, Zhiting Zhang, Kai Xu","doi":"10.21203/RS.3.RS-231323/V1","DOIUrl":"https://doi.org/10.21203/RS.3.RS-231323/V1","url":null,"abstract":"The random forest (RF) model is improved by the optimization of unbalanced geological hazards dataset, differentiation of continuous geological hazards evaluation factors, sample similarity calculation, and iterative method for finding optimal random characteristics by calculating out-of-bagger errors. The geological hazards susceptibility evaluation model based on optimized RF (OPRF) was established and used to assess the susceptibility for Lingyun County. Then, ROC curve and field investigation were performed to verify the efficiency for different geological hazards susceptibility assessment models. The AUC values for five models were estimated as 0.766, 0.814, 0.842, 0.846 and 0.934, respectively, which indicated that the prediction accuracy of the OPRF model can be as high as 93.4%. This result demonstrated that the geological hazards susceptibility assessment model based on OPRF has the highest prediction accuracy. Furthermore, the OPRF model could be extended to other regions with similar geological environment backgrounds for geological hazards susceptibility assessment and prediction.","PeriodicalId":72673,"journal":{"name":"Computer science & information technology","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47968613","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
DSurvey: A Blockchain-Enhanced Survey Platform for the Data Economy DSurvey:面向数据经济的区块链增强调查平台
Pub Date : 2021-01-23 DOI: 10.5121/CSIT.2021.110112
A. Bonti, Akanksha Saini, Thien Pham, M. Abdelrazek, Lorenzo Pinto
The data economy is predicted to boom and become a 156B dollars business by 2025. In this demo we introduce the use of distributed ledger technologies (DLT) applied to digital surveys in order to create an ecosystem where data becomes a central piece of a complex economy. Our system allows for interesting key features; ownership, traceability, secure profiles, and anonymity where required. Also, the most important feature, is the incentive mechanism that rewards all participants, both users creating surveys and those answering the surveys. DSurvey (decentralized survey) is a novel application framework that aims at moving away from the large commercial data sink paradigm whose business is restricted to gathering data and reselling it. Our solution makes so that no central data sink exists, and it always belongs to the creator, who are able to know who is using it, and receive royalties.
数据经济预计将蓬勃发展,到2025年将成为1560亿美元的业务。在这个演示中,我们介绍了应用于数字调查的分布式账本技术(DLT)的使用,以创建一个生态系统,使数据成为复杂经济的核心部分。我们的系统允许有趣的关键功能;所有权、可追溯性、安全配置文件以及必要时的匿名性。此外,最重要的功能是奖励所有参与者的激励机制,包括创建调查的用户和回答调查的用户。DSurvey(去中心化调查)是一个新颖的应用程序框架,旨在摆脱大型商业数据汇模式,该模式的业务仅限于收集数据和转售数据。我们的解决方案确保不存在中央数据汇,它始终属于创建者,他们能够知道谁在使用它,并获得版税。
{"title":"DSurvey: A Blockchain-Enhanced Survey Platform for the Data Economy","authors":"A. Bonti, Akanksha Saini, Thien Pham, M. Abdelrazek, Lorenzo Pinto","doi":"10.5121/CSIT.2021.110112","DOIUrl":"https://doi.org/10.5121/CSIT.2021.110112","url":null,"abstract":"The data economy is predicted to boom and become a 156B dollars business by 2025. In this demo we introduce the use of distributed ledger technologies (DLT) applied to digital surveys in order to create an ecosystem where data becomes a central piece of a complex economy. Our system allows for interesting key features; ownership, traceability, secure profiles, and anonymity where required. Also, the most important feature, is the incentive mechanism that rewards all participants, both users creating surveys and those answering the surveys. DSurvey (decentralized survey) is a novel application framework that aims at moving away from the large commercial data sink paradigm whose business is restricted to gathering data and reselling it. Our solution makes so that no central data sink exists, and it always belongs to the creator, who are able to know who is using it, and receive royalties.","PeriodicalId":72673,"journal":{"name":"Computer science & information technology","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47264362","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
Clinical Assessment and Management of Covid-19 Patients using Artificial Intelligence 应用人工智能对新冠肺炎患者进行临床评估和管理
Pub Date : 2020-12-26 DOI: 10.5121/csit.2020.102007
R. Phalnikar, S. Dixit, Harsha V. Talele
The COVID-19 infection caused by Novel Corona Virus has been declared a pandemic and a public health emergency of international concern. Infections caused by Corona Virus have been previously recognized in people and is known to cause Middle East Respiratory Syndrome (MERS) and Severe Acute Respiratory Syndrome (SARS). Unlike the earlier infections, COVID19 spreads alarmingly and the experience and volume of the scientific knowledge on the virus is small and lacks substantiation. To manage this crisis, Artificial intelligence (AI) promises to play a key role in understanding and addressing the COVID-19 crisis. It tends to be valuable to identify the infection, analyse it, treat it and also predict the stages of infection. Artificial intelligence algorithms can be applied to make diagnosis of COVID-19 and stepping up research and therapy. The paper explains a detailed flowchart of COVID-19 patient and discusses the use of AI at various stages. The preliminary contribution of the paper is in identifying the stages where the use of Artificial Intelligence and its allied fields can help in managing COVID-19 patient and paves a road for systematic research in future.
新冠病毒引起的新冠肺炎感染已被宣布为国际关注的大流行病和突发公共卫生事件。冠状病毒引起的感染以前已经在人身上被发现,并已知会导致中东呼吸综合征(MERS)和严重急性呼吸综合征。与早期的感染不同,新冠肺炎19的传播速度惊人,有关该病毒的科学知识的经验和数量很少,缺乏证据。为了应对这场危机,人工智能(AI)承诺在理解和应对新冠肺炎危机方面发挥关键作用。识别感染、分析、治疗以及预测感染阶段往往是有价值的。人工智能算法可以应用于新冠肺炎的诊断和加强研究和治疗。本文介绍了新冠肺炎患者的详细流程图,并讨论了人工智能在各个阶段的使用。该论文的初步贡献是确定人工智能及其相关领域的使用可以帮助管理新冠肺炎患者的阶段,并为未来的系统研究铺平道路。
{"title":"Clinical Assessment and Management of Covid-19 Patients using Artificial Intelligence","authors":"R. Phalnikar, S. Dixit, Harsha V. Talele","doi":"10.5121/csit.2020.102007","DOIUrl":"https://doi.org/10.5121/csit.2020.102007","url":null,"abstract":"The COVID-19 infection caused by Novel Corona Virus has been declared a pandemic and a public health emergency of international concern. Infections caused by Corona Virus have been previously recognized in people and is known to cause Middle East Respiratory Syndrome (MERS) and Severe Acute Respiratory Syndrome (SARS). Unlike the earlier infections, COVID19 spreads alarmingly and the experience and volume of the scientific knowledge on the virus is small and lacks substantiation. To manage this crisis, Artificial intelligence (AI) promises to play a key role in understanding and addressing the COVID-19 crisis. It tends to be valuable to identify the infection, analyse it, treat it and also predict the stages of infection. Artificial intelligence algorithms can be applied to make diagnosis of COVID-19 and stepping up research and therapy. The paper explains a detailed flowchart of COVID-19 patient and discusses the use of AI at various stages. The preliminary contribution of the paper is in identifying the stages where the use of Artificial Intelligence and its allied fields can help in managing COVID-19 patient and paves a road for systematic research in future.","PeriodicalId":72673,"journal":{"name":"Computer science & information technology","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44656067","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
Biometric Foetal Contour Extraction using Hybrid Level Set 基于混合水平集的生物特征胎儿轮廓提取
Pub Date : 2020-12-26 DOI: 10.5121/csit.2020.102002
Rachana Jaiswal, S. Satarkar
In medical imaging, accurate anatomical structure extraction is important for diagnosis and therapeutic interventional planning. So, for easier, quicker and accurate diagnosis of medical images, image processing technologies may be employed in analysis and feature extraction of medical images. In this paper, some modifications to level set algorithm are made and modified algorithm is used for extracting contour of foetal objects in an image. The proposed approach is applied on foetal ultrasound images. In traditional approach, foetal parameters are extracted manually from ultrasound images. Due to lack of consistency and accuracy of manual measurements, an automatic technique is highly desirable to obtain foetal biometric measurements. This proposed approach is based on global & local region information for foetal contour extraction from ultrasonic images. The primary goal of this research is to provide a new methodology to aid the analysis and feature extraction from foetal images.
在医学影像学中,准确的解剖结构提取对诊断和治疗介入计划具有重要意义。因此,为了更容易、更快速、更准确地诊断医学图像,可以将图像处理技术应用于医学图像的分析和特征提取。本文对水平集算法进行了一些改进,并将改进后的算法用于图像中胎儿物体的轮廓提取。该方法已应用于胎儿超声图像。传统的方法是从超声图像中手动提取胎儿参数。由于人工测量缺乏一致性和准确性,因此非常需要一种自动技术来获得胎儿生物特征测量。提出了一种基于全局和局部信息的超声图像胎儿轮廓提取方法。本研究的主要目的是提供一种新的方法来帮助胎儿图像的分析和特征提取。
{"title":"Biometric Foetal Contour Extraction using Hybrid Level Set","authors":"Rachana Jaiswal, S. Satarkar","doi":"10.5121/csit.2020.102002","DOIUrl":"https://doi.org/10.5121/csit.2020.102002","url":null,"abstract":"In medical imaging, accurate anatomical structure extraction is important for diagnosis and therapeutic interventional planning. So, for easier, quicker and accurate diagnosis of medical images, image processing technologies may be employed in analysis and feature extraction of medical images. In this paper, some modifications to level set algorithm are made and modified algorithm is used for extracting contour of foetal objects in an image. The proposed approach is applied on foetal ultrasound images. In traditional approach, foetal parameters are extracted manually from ultrasound images. Due to lack of consistency and accuracy of manual measurements, an automatic technique is highly desirable to obtain foetal biometric measurements. This proposed approach is based on global & local region information for foetal contour extraction from ultrasonic images. The primary goal of this research is to provide a new methodology to aid the analysis and feature extraction from foetal images.","PeriodicalId":72673,"journal":{"name":"Computer science & information technology","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42089613","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
Multi Image Steganography using Distributed LSB Algorithm and Secret Text Recovery on Stego Image Corruption 基于分布式LSB算法的多图像隐写术和密文恢复
Pub Date : 2020-12-26 DOI: 10.5121/csit.2020.102005
Jagan Raj Jayapandiyan, C. Kavitha, K. Sakthivel
In this proposed research work, an attempt has been made to use multiple image files for steganography encoding along with the capability of secret text recovery in the event of any image corruption during the transit. This algorithm is effective on the security factor of secret image since the embedded checksum will validate for any unauthorized users or intruders attempt to corrupt the picture in any aspect. If any of the stego image underwent any steganalysis or MiM attack, then this proposed algorithm can effectively regenerate the content of one stego image using other intact stego images received in the receiving end.
在这项拟议的研究工作中,已经尝试使用多个图像文件进行隐写术编码,以及在传输过程中出现任何图像损坏时进行秘密文本恢复的能力。该算法对秘密图像的安全系数是有效的,因为嵌入的校验和将验证任何未经授权的用户或入侵者试图在任何方面破坏图片。如果任何一个隐写图像经历了任何隐写分析或MiM攻击,那么所提出的算法可以使用接收端接收到的其他完整的隐写图像来有效地重新生成一幅隐写图像的内容。
{"title":"Multi Image Steganography using Distributed LSB Algorithm and Secret Text Recovery on Stego Image Corruption","authors":"Jagan Raj Jayapandiyan, C. Kavitha, K. Sakthivel","doi":"10.5121/csit.2020.102005","DOIUrl":"https://doi.org/10.5121/csit.2020.102005","url":null,"abstract":"In this proposed research work, an attempt has been made to use multiple image files for steganography encoding along with the capability of secret text recovery in the event of any image corruption during the transit. This algorithm is effective on the security factor of secret image since the embedded checksum will validate for any unauthorized users or intruders attempt to corrupt the picture in any aspect. If any of the stego image underwent any steganalysis or MiM attack, then this proposed algorithm can effectively regenerate the content of one stego image using other intact stego images received in the receiving end.","PeriodicalId":72673,"journal":{"name":"Computer science & information technology","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46901870","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
期刊
Computer science & information technology
全部 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