2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)最新文献

筛选
英文 中文
Compositional Taint Analysis of Native Codes for Security Vetting of Android Applications 用于Android应用程序安全审查的本机代码的成分污点分析
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2020-10-29 DOI: 10.1109/ICCKE50421.2020.9303643
Seyed Behnam Andarzian, B. T. Ladani
{"title":"Compositional Taint Analysis of Native Codes for Security Vetting of Android Applications","authors":"Seyed Behnam Andarzian, B. T. Ladani","doi":"10.1109/ICCKE50421.2020.9303643","DOIUrl":"https://doi.org/10.1109/ICCKE50421.2020.9303643","url":null,"abstract":"Security vetting of Android applications is one of the crucial aspects of the Android ecosystem. Regarding the state of the art tools for this goal, most of them doesn't consider analyzing native codes and only analyze the Java code. However, Android concedes its developers to implement a part or all of their applications using C or C++ code. Thus, applying conservative manners for analyzing Android applications while ignoring native codes would lead to less precision in results. Few works have tried to analyze Android native codes, but only JN-SAF has applied taint analysis using static techniques such as symbolic execution. However, symbolic execution has some problems when is used in large programs. One of these problems is the exponential growth of program paths that would raise the path explosion issue. In this work, we have tried to alleviate this issue by introducing our new tool named CTAN. CTAN applies new symbolic execution methods to angr in a particular way that it can make JN-SAF more efficient and faster. We have introduced compositional taint analysis in CTAN by combining satisfiability modulo theories with symbolic execution. Our experiments show that CTAN is 26 percent faster than its previous work JN-SAF and it also leads to more precision by detecting more data-leakage in large Android native codes.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115637822","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
Improving the Fault Tolerance and Efficiency of CAN Communication Networks Based on Bus Redundancy 基于总线冗余提高CAN通信网络容错性和效率
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2020-10-29 DOI: 10.1109/ICCKE50421.2020.9303645
Mohamad Reza Pourmoghadam, Yasser Sedaghat, Ismail Ghodsollahee
{"title":"Improving the Fault Tolerance and Efficiency of CAN Communication Networks Based on Bus Redundancy","authors":"Mohamad Reza Pourmoghadam, Yasser Sedaghat, Ismail Ghodsollahee","doi":"10.1109/ICCKE50421.2020.9303645","DOIUrl":"https://doi.org/10.1109/ICCKE50421.2020.9303645","url":null,"abstract":"Distributed embedded systems which are employed in many applications (e.g., automotive, avionics, military, and industrial control systems), generally consist of several processing units that are connected to each other through a communication network. Some of these applications are safety-critical and real-time, therefore, a system or network failure in these applications can result in catastrophic consequences for humans or the environment. This means that in these applications, systems should perform their tasks correctly and moreover, should meet the specified deadlines. Consequently, in a safety-critical real-time distributed embedded system, fault tolerance and network efficiency improvement should be considered, simultaneously. One of the most common communication protocols employed in distributed embedded systems is the Controller Area Network (CAN) communication protocol. Although this communication protocol has a maximum bit rate of 1Mbps and is based on broadcasting on a bus, it has some inherent limitations. In this paper, a technique is proposed which employs bus redundancy and a scheduling algorithm to improve the fault tolerance and the efficiency in CAN communication networks. To evaluate the proposed technique, a CAN-based distributed embedded system composed of four nodes (using ARM microcontrollers, i.e. STM32F4 and STM32F2) has been implemented. The proposed technique has been compared with the other related techniques in CAN network protocol. To perform this comparison, four experiments have been performed in two forms of fault-free and faulty buses. The evaluation results show that the proposed technique improves throughput, response time, and energy consumption parameters compared to a standard CAN, 29%, 37% and 19%, and compared to a redundancy-based technique, 77%, 41% and 21%, respectively.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132646827","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 and optimization of non-volatile memory based on Memristor System 基于忆阻器系统的非易失性存储器设计与优化
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2020-10-29 DOI: 10.1109/ICCKE50421.2020.9303681
Mohammad Hemmati, M. Dolatshahi, S. M. Zanjani
{"title":"Design and optimization of non-volatile memory based on Memristor System","authors":"Mohammad Hemmati, M. Dolatshahi, S. M. Zanjani","doi":"10.1109/ICCKE50421.2020.9303681","DOIUrl":"https://doi.org/10.1109/ICCKE50421.2020.9303681","url":null,"abstract":"Memristor is a type of memory resistor that has analog behaviour. That is, the resistor is programmable between the two modes with the minimum resistance and the maximum resistance, and its values are retained until subsequent voltage implementations. Non-volatility, memory friendliness, analog and high switching performance, minuteness and its capability to integrate with integrated circuits are prominent advantages of this element. In this paper, we perform a physical and behavioural modelling using a structural model designed to evaluate memristor behaviour. Initially, a 4-by-4 cross-over structure is designed. The memory array consists of four vertical nano-wires and four horizontal nano-wires that cross over each other and a memristor is located at the intersection of each nano-wire. In the Memristor structure positive terminal is connected to the vertical nano-wire and its negative terminal to the horizontal nano-wire. The data sequence [1010] in the first column of the array is written in (4, 1), (3, 1), (2, 1), (1,1) cells respectively and then is read from them. Finally, by examining the details of the element behaviour, changing its parameters such as frequency, input voltage and varying Roff and Ron range and employment of a model, designed for simulation, the output results are obtained. Keywords— Memristor, Physical Model, Thin Layer, Logical Operational Implementation","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126984338","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
Improve Performance of RTP Relaying Sessions in IMS Transport Layer With LREProxy 利用LREProxy提高IMS传输层RTP中继会话性能
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2020-10-29 DOI: 10.1109/ICCKE50421.2020.9303608
Mojtaba Esfandiari.S, Seyed Mojtaba Najafi, Morteza Iravani, Sajad Sabri
{"title":"Improve Performance of RTP Relaying Sessions in IMS Transport Layer With LREProxy","authors":"Mojtaba Esfandiari.S, Seyed Mojtaba Najafi, Morteza Iravani, Sajad Sabri","doi":"10.1109/ICCKE50421.2020.9303608","DOIUrl":"https://doi.org/10.1109/ICCKE50421.2020.9303608","url":null,"abstract":"The IP Multimedia Subsystem is an architectural network for delivering IP multimedia services and data. The IMS network has built on three layers which allows for the convergence of different access networks. Each layer in IMS is consisting of various elements and protocols that consequently process signaling or media flow to specific application service. While the Call Session Control Function (CSCF) is the main route decision of the IMS network, the most significant of resources are used by routing and delivering media flow in Transport data layer in IMS network. With raising of request for service in IMS, the usage of resource have been increased. The ingress and egress nodes in IMS network are critical points and could potentially being bottleneck because they have to transmit huge signaling and media packets from and to IMS network. In this paper, we focused on Transport data layer on Edge-Border IMS network to manage and optimize its resources. We propose a new model of proxy that is called Light-RTP-Engine-Proxy (LREProxy). Also we implement our proposed paper as new module for Kamailio, Open Source SIP Server. We demonstrate how to use this module, the usage of resources in IMS network especially Edge-Border and IMS-Transit network have been significantly decreased.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126522681","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
SMIA: a simple way for inference of admixed population ancestors SMIA:一种推断混合种群祖先的简单方法
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2020-10-29 DOI: 10.1109/ICCKE50421.2020.9303686
Farhad Alizadeh, H. Jazayeriy, O. Jazayeri, F. Vafaee
{"title":"SMIA: a simple way for inference of admixed population ancestors","authors":"Farhad Alizadeh, H. Jazayeriy, O. Jazayeri, F. Vafaee","doi":"10.1109/ICCKE50421.2020.9303686","DOIUrl":"https://doi.org/10.1109/ICCKE50421.2020.9303686","url":null,"abstract":"As a result of the migration of ancestral populations and mating between them, most new humans are admixed. Ancestry estimates may be important in pharmacogenetics, complex diseases, and anthropological processes. Many methods and tools have been proposed for the ancestry inference. Most of these methods are complex and require biological and statistical parameters. In this paper, we introduce a simple method to inference of ancestry (SMIA) using the Euclidean distance between the haplotype of admixed individual and ancestral populations. Proposed SMIA used does not require many parameters. The only input parameter in SMIA is the window length. The simulation results show that in windows with a length of 1600-3000 SNPs, SMIA can detect the correct ancestry of the admixed individual with an accuracy of more than 90%.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123687864","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
A novel data cleaning method for learning in imbalanced datasets based on k-nearest neighbors 一种新的基于k近邻的不平衡数据集学习数据清理方法
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2020-10-29 DOI: 10.1109/ICCKE50421.2020.9303625
Rasool Panahi, Nima Sedghiye, Ehsan Nazerfard
{"title":"A novel data cleaning method for learning in imbalanced datasets based on k-nearest neighbors","authors":"Rasool Panahi, Nima Sedghiye, Ehsan Nazerfard","doi":"10.1109/ICCKE50421.2020.9303625","DOIUrl":"https://doi.org/10.1109/ICCKE50421.2020.9303625","url":null,"abstract":"With the expansion of the applications of artificial intelligence and machine learning in various areas, many challenges have arisen in the training of learning algorithms. One of the most important challenges is the learning in imbalanced datasets. The imbalanced data generally refers to a classification problem where the number of data samples per class is not equally distributed. Typically there is a large amount of data for one class (referred to as the majority class) and much fewer data for the other class (referred to as the minority class). In such datasets, learning algorithms are biased toward learning the majority class to reach better accuracy, which leads to the lack of learning in minority class data. This article first introduces a method called neighbor competition scoring (NCS) for assigning scores to samples. Each data point is assigned a lower score if it is farther away from its class samples or closer to the samples of other classes. Then, with the help of these scores, neighbor competition undersampling (NCU) method is presented for undersampling the majority class samples that are less important than other samples. The proposed method has been compared with some popular data-based methods in 10 datasets and has performed better according to the experiments.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130304830","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
Energy Saving in D2D Cellular 6G Networks D2D蜂窝6G网络中的节能技术
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2020-10-29 DOI: 10.1109/ICCKE50421.2020.9303721
Mohammad Hadi Ziyaee Amiri, Amir Mohammad Nazemi, M. Namazi, Khadegeh Jalilian Amri, Faeezeh Ziyaee Amiri
{"title":"Energy Saving in D2D Cellular 6G Networks","authors":"Mohammad Hadi Ziyaee Amiri, Amir Mohammad Nazemi, M. Namazi, Khadegeh Jalilian Amri, Faeezeh Ziyaee Amiri","doi":"10.1109/ICCKE50421.2020.9303721","DOIUrl":"https://doi.org/10.1109/ICCKE50421.2020.9303721","url":null,"abstract":"In this paper we introduce the history of the D2D communication, then We find the optimal way to get higher energy efficiency. Optimal use of radio resources in cellular telecommunication networks with device-to-device (D2D) communication, in which D2D users are in one of three modes of indirect (via base station) and direct (including reusable and proprietary) scenarios. The main goal of this research is to find the optimal energy methods in this type of communication and to select the mode in which D2D communication has a higher energy efficiency mode. In this paper, a solution based on a coalition game is proposed to select the communication modes with the highest energy efficiency. D2D links can decide to leave or join a coalition based on energy efficiency. Eliminating situations that do not provide the required minimum rate and simultaneously considering power and data rates are two new ideas in this research that reduce computational complexity and guarantee energy efficiency increase. By means of simulation in MATLAB environment, the higher energy efficiency of the proposed algorithm is proved at different signal-to-noise ratios.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129059132","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 Improved C4.5 Algorithm using Principle of Equivalent of Infinitesimal and Arithmetic Mean Best Selection Attribute for Large Dataset 基于无限小等价原理和算术平均最优选择属性的C4.5大数据集改进算法
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2020-10-29 DOI: 10.1109/ICCKE50421.2020.9303622
L. J. Muhammad, Muhammed Besiru Jibrin, B. Yahaya, I.A. Mohammed Besiru Jibrin, Abdulkadir Ahmad, Jamila Musa Amshi
{"title":"An Improved C4.5 Algorithm using Principle of Equivalent of Infinitesimal and Arithmetic Mean Best Selection Attribute for Large Dataset","authors":"L. J. Muhammad, Muhammed Besiru Jibrin, B. Yahaya, I.A. Mohammed Besiru Jibrin, Abdulkadir Ahmad, Jamila Musa Amshi","doi":"10.1109/ICCKE50421.2020.9303622","DOIUrl":"https://doi.org/10.1109/ICCKE50421.2020.9303622","url":null,"abstract":"Scaling up the data-mining classification algorithms to very large datasets has been attracting growing interest now a days. Many techniques have been employed to improve those algorithms but efficient data-mining classification algorithms that have a minimal decrease in accuracy with little increase in time complexity remain very important. The C4.5 algorithm is one of the data mining classification algorithms that have been used for uncovering hidden patterns and gleaning useful and novel knowledge in such large datasets. This work proposes a new C4.5 data mining algorithm with a lesser time complexity for large dataset compared with traditional C.45 algorithm, but however for smaller dataset traditional C.45 algorithm has lesser time complexity. The new algorithm was improved using Principle of Equivalent of Infinitesimal and Arithmetic Mean Best Selection Attribute.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128578715","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}
引用次数: 5
Classification of Audio Codecs with Variable Bit- Rates 可变比特率音频编解码器的分类
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2020-10-29 DOI: 10.1109/ICCKE50421.2020.9303637
Atieh Khodadadi, M. Teimouri
{"title":"Classification of Audio Codecs with Variable Bit- Rates","authors":"Atieh Khodadadi, M. Teimouri","doi":"10.1109/ICCKE50421.2020.9303637","DOIUrl":"https://doi.org/10.1109/ICCKE50421.2020.9303637","url":null,"abstract":"A large portion of the Internet bandwidth is used for transmission of multimedia such as audio data. For eavesdropping or network surveillance purposes, the first step of a sniffer may be to determine the codec by which a fragment is generated. This problem is usually modeled as a multi-class classification problem. The basic methods for determining the codec type of each fragment rely on the metadata in the corresponding file header. However, in a non-cooperative context, the whole file is not available. So, generally, statistical features extracted from the fragments combined with machine learning algorithms are used for solving this multi-class classification problem. To date, almost all frameworks implicitly assume fixed and known bit-rates for the employed codecs. However, in practical situations, various rates of a specific codec may be used in a network. In this situation, as it is shown in this paper, the classifiers trained by codecs with fixed bit-rates perform poorly when the test data is generated by various rates of the codecs. In this paper, the classification of audio codec fragments with variable bit-rates is considered, simulated, and analyzed. According to the simulation results, for 1 Kbyte fragments, the accuracy of the proposed random forest classifier is about 89%.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121260616","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
Feature reduction using fuzzy C-means clustering and Firefly algorithm 基于模糊c均值聚类和Firefly算法的特征约简
2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2020-10-29 DOI: 10.1109/ICCKE50421.2020.9303658
Ako Ahmadi, K. Khamforoosh
{"title":"Feature reduction using fuzzy C-means clustering and Firefly algorithm","authors":"Ako Ahmadi, K. Khamforoosh","doi":"10.1109/ICCKE50421.2020.9303658","DOIUrl":"https://doi.org/10.1109/ICCKE50421.2020.9303658","url":null,"abstract":"Feature selection refers to the elimination of many less informative features. In the proposed method, the Firefly Metaheuristic Algorithm (FMA) selects the features through other dataset features at each stage. Features data are clustered using C-means fuzzy clustering to determine clustering accuracy amounts such as Root-Mean-Square Error (RMSE) to specify how useful these features are and how much these selected features have been able to make classify correctly using clustering based on the dataset as well. Regarding this, the target class is predicted according to the selected features, where the results show the optimal performance of the proposed method. Because of using the combination of FMA and FCM clustering, the optimal centers of each cluster are found quickly, the selected feature sets known as the target class representative have the least error value, and the relationship between features are considered as well by completing the iteration of the algorithm.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128136081","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学术官方微信