- Zhi Liu;Shijie Sun;Ju Xing;Zhe Fu;Xiaohe Hu;Jianwen Pi;Xiaofeng Yang;Yunsong Lu;Jun Li;
With the proliferation of cloud services and development of fine-grained virtualization techniques, the Cloud Management System(CMS) is required to manage multiple resources efficiently for the large-scale, highdensity computing units. Specifically, providing guaranteed networking Service Level Agreement(SLA) has become a challenge. This paper proposes MN-SLA(Modular Networking SLA), a framework to provide networking SLA and to enable its seamless integration with existing CMSes. Targeting at a modular, general, robust, and efficient design, MN-SLA abstracts general interacting Application Programming Interfaces(APIs) between CMS and SLA subsystem, and it is able to accomplish the integration with minor modifications to CMS. The evaluations based on large scale simulation show that the proposed networking SLA scheduling is promising in terms of resource utilization, being able to accommodate at least 1.4× the number of instances of its competitors.
2018年06期 v.23 635-644页 [查看摘要][在线阅读][下载 897K] [下载次数：52 ] |[网刊下载次数：0 ] |[引用频次：2 ] |[阅读次数：0 ] - Zhi Liu;Shijie Sun;Ju Xing;Zhe Fu;Xiaohe Hu;Jianwen Pi;Xiaofeng Yang;Yunsong Lu;Jun Li;
With the proliferation of cloud services and development of fine-grained virtualization techniques, the Cloud Management System(CMS) is required to manage multiple resources efficiently for the large-scale, highdensity computing units. Specifically, providing guaranteed networking Service Level Agreement(SLA) has become a challenge. This paper proposes MN-SLA(Modular Networking SLA), a framework to provide networking SLA and to enable its seamless integration with existing CMSes. Targeting at a modular, general, robust, and efficient design, MN-SLA abstracts general interacting Application Programming Interfaces(APIs) between CMS and SLA subsystem, and it is able to accomplish the integration with minor modifications to CMS. The evaluations based on large scale simulation show that the proposed networking SLA scheduling is promising in terms of resource utilization, being able to accommodate at least 1.4× the number of instances of its competitors.
2018年06期 v.23 635-644页 [查看摘要][在线阅读][下载 897K] [下载次数：52 ] |[网刊下载次数：0 ] |[引用频次：2 ] |[阅读次数：0 ] - Yonglong Zhang;Haiyan Qin;Bin Li;Jin Wang;Sungyoung Lee;Zhiqiu Huang;
As an emerging "human problem solving strategy", crowdsourcing has attracted much attention where requesters want to employ reliable workers to complete specific tasks. Task assignment is an important branch of crowdsourcing. Most existing studies in crowdsourcing have not considered self-interested individuals' strategy. To guarantee truthfulness, auction has been regarded as a promising method to charge the requesters for the tasks completed and reward the workers for performing the tasks. In this study, an online task assignment scenario is considered where each worker has a set of experienced skills, whereas a specific task is budget-constrained and requires one or more skills. In this scenario, the crowdsourcing task assignment was modeled as a reverse auction where the requesters are buyers and the workers are sellers. Three incentive mechanisms, namely, Truthful Mechanism for Crawdsourcing-Vickrey-Clarke-Grove(TMC-VCG), TMC-Simple Task(ST) for a simple task case,and TMC-Complex Task(CT) for a complex task case are proposed. Here, a simple task case means that the requester asks for a single skill, and a complex task case means that the requester asks for multiple skills. The related properties of each of the three mechanisms are determined theoretically. Moreover, the truthfulness is verified, and other performances are evaluated by extensive simulations.
2018年06期 v.23 645-659页 [查看摘要][在线阅读][下载 689K] [下载次数：45 ] |[网刊下载次数：0 ] |[引用频次：6 ] |[阅读次数：0 ] - Yonglong Zhang;Haiyan Qin;Bin Li;Jin Wang;Sungyoung Lee;Zhiqiu Huang;
As an emerging "human problem solving strategy", crowdsourcing has attracted much attention where requesters want to employ reliable workers to complete specific tasks. Task assignment is an important branch of crowdsourcing. Most existing studies in crowdsourcing have not considered self-interested individuals' strategy. To guarantee truthfulness, auction has been regarded as a promising method to charge the requesters for the tasks completed and reward the workers for performing the tasks. In this study, an online task assignment scenario is considered where each worker has a set of experienced skills, whereas a specific task is budget-constrained and requires one or more skills. In this scenario, the crowdsourcing task assignment was modeled as a reverse auction where the requesters are buyers and the workers are sellers. Three incentive mechanisms, namely, Truthful Mechanism for Crawdsourcing-Vickrey-Clarke-Grove(TMC-VCG), TMC-Simple Task(ST) for a simple task case,and TMC-Complex Task(CT) for a complex task case are proposed. Here, a simple task case means that the requester asks for a single skill, and a complex task case means that the requester asks for multiple skills. The related properties of each of the three mechanisms are determined theoretically. Moreover, the truthfulness is verified, and other performances are evaluated by extensive simulations.
2018年06期 v.23 645-659页 [查看摘要][在线阅读][下载 689K] [下载次数：45 ] |[网刊下载次数：0 ] |[引用频次：6 ] |[阅读次数：0 ] - Lerong Ma;Lejian Liao;DANDan Song;Jingang Wang;
Knowledge Bases(KBs) are valuable resources of human knowledge which contribute to many applications. However, since they are manually maintained, there is a big lag between their contents and the upto-date information of entities. Considering a target entity in KBs, this paper investigates how Cumulative Citation Recommendation(CCR) can be used to effectively detect its worthy-citation documents in large volumes of stream data. Most global relevant models only consider semantic and temporal features of entity-document instances,which does not sufficiently exploit prior knowledge underlying entity-document instances. To tackle this problem,we present a Mixture of Experts(ME) model by introducing a latent layer to capture relationships between the entity-document instances and their latent class information. An extensive set of experiments was conducted on TREC-KBA-2013 dataset. The results show that the model can significantly achieve a better performance gain compared to state-of-the-art models in CCR.
2018年06期 v.23 660-670页 [查看摘要][在线阅读][下载 220K] [下载次数：35 ] |[网刊下载次数：0 ] |[引用频次：4 ] |[阅读次数：0 ] - Lerong Ma;Lejian Liao;DANDan Song;Jingang Wang;
Knowledge Bases(KBs) are valuable resources of human knowledge which contribute to many applications. However, since they are manually maintained, there is a big lag between their contents and the upto-date information of entities. Considering a target entity in KBs, this paper investigates how Cumulative Citation Recommendation(CCR) can be used to effectively detect its worthy-citation documents in large volumes of stream data. Most global relevant models only consider semantic and temporal features of entity-document instances,which does not sufficiently exploit prior knowledge underlying entity-document instances. To tackle this problem,we present a Mixture of Experts(ME) model by introducing a latent layer to capture relationships between the entity-document instances and their latent class information. An extensive set of experiments was conducted on TREC-KBA-2013 dataset. The results show that the model can significantly achieve a better performance gain compared to state-of-the-art models in CCR.
2018年06期 v.23 660-670页 [查看摘要][在线阅读][下载 220K] [下载次数：35 ] |[网刊下载次数：0 ] |[引用频次：4 ] |[阅读次数：0 ] - Jaihui Chen;Chik How Tan;Xiaoyu Li;
Multivariate Public Key Cryptography(MPKC) has intensively and rapidly developed during the past three decades. MPKC is a promising candidate for post-quantum cryptography. However, designing it is universally regarded as a difficult task to design a secure MPKC foundation scheme, such as an encryption scheme and key exchange scheme. In this work, we investigate the security of a new public key cryptosystem that is based on the Morphism of Polynomials(MP). The public key cryptosystem proposed by Wang et al.(Wuhan University, China)comprises a key exchange scheme and encryption scheme. Its security can be provably reduced to the hardness of solving a new difficult problem, namely, the Decisional Multivariate Diffie Hellman(DMDH) problem. This problem is a variant of the MP problem, which is difficult to solve by random systems. We present a proposition that reduces the DMDH problem to an easy example of the MP problem. Then, we propose an efficient algorithm for the Key Recover Attack(KRA) on the schemes of the public key cryptosystem. In practice, we are able to entirely break the cryptosystem's claimed parameter of 96 security levels in less than 17.252 s. Furthermore, we show that finding parameters that yield a secure and practical scheme is impossible.
2018年06期 v.23 671-679页 [查看摘要][在线阅读][下载 205K] [下载次数：20 ] |[网刊下载次数：0 ] |[引用频次：1 ] |[阅读次数：0 ] - Jaihui Chen;Chik How Tan;Xiaoyu Li;
Multivariate Public Key Cryptography(MPKC) has intensively and rapidly developed during the past three decades. MPKC is a promising candidate for post-quantum cryptography. However, designing it is universally regarded as a difficult task to design a secure MPKC foundation scheme, such as an encryption scheme and key exchange scheme. In this work, we investigate the security of a new public key cryptosystem that is based on the Morphism of Polynomials(MP). The public key cryptosystem proposed by Wang et al.(Wuhan University, China)comprises a key exchange scheme and encryption scheme. Its security can be provably reduced to the hardness of solving a new difficult problem, namely, the Decisional Multivariate Diffie Hellman(DMDH) problem. This problem is a variant of the MP problem, which is difficult to solve by random systems. We present a proposition that reduces the DMDH problem to an easy example of the MP problem. Then, we propose an efficient algorithm for the Key Recover Attack(KRA) on the schemes of the public key cryptosystem. In practice, we are able to entirely break the cryptosystem's claimed parameter of 96 security levels in less than 17.252 s. Furthermore, we show that finding parameters that yield a secure and practical scheme is impossible.
2018年06期 v.23 671-679页 [查看摘要][在线阅读][下载 205K] [下载次数：20 ] |[网刊下载次数：0 ] |[引用频次：1 ] |[阅读次数：0 ] - Chao Li;Lei Jiang;Fanrui Sun;Kang Zhang;
Shape grammars are well-known tools to explore abstract systems of shapes and their relationships.Although there has been much research on the use of shape grammars in the field of architectural styles, there has been little investigation into the concept of circulation using shape grammars. Circulation is a tool used in architecture and interior design and is formed by connecting the points left by the movement of human beings through indoor or outdoor spaces. This study shows that shape grammars are also helpful in this particular field by presenting how a parametric shape grammar is applied to generate circulation designs, and the system automatically generates four basic types of complex circulations. According to the specific conditions and requirements of each commercial space, different forms of circulation can be specified and generated.
2018年06期 v.23 680-689页 [查看摘要][在线阅读][下载 892K] [下载次数：40 ] |[网刊下载次数：0 ] |[引用频次：2 ] |[阅读次数：0 ] - Chao Li;Lei Jiang;Fanrui Sun;Kang Zhang;
Shape grammars are well-known tools to explore abstract systems of shapes and their relationships.Although there has been much research on the use of shape grammars in the field of architectural styles, there has been little investigation into the concept of circulation using shape grammars. Circulation is a tool used in architecture and interior design and is formed by connecting the points left by the movement of human beings through indoor or outdoor spaces. This study shows that shape grammars are also helpful in this particular field by presenting how a parametric shape grammar is applied to generate circulation designs, and the system automatically generates four basic types of complex circulations. According to the specific conditions and requirements of each commercial space, different forms of circulation can be specified and generated.
2018年06期 v.23 680-689页 [查看摘要][在线阅读][下载 892K] [下载次数：40 ] |[网刊下载次数：0 ] |[引用频次：2 ] |[阅读次数：0 ] - Manal El Bajta;Ali Idri;Joaquín Nicolás Ros;José Luis Fernández-Alemán;Juan Manuel Carrillo de Gea;Félix García;Ambrosio Toval;
Global Software Development(GSD) is a well established field of software engineering with the benefits of a global environment. Software Project Management(SPM) plays a key role in the success of GSD. As a result, the need has arisen to study and evaluate the downsides of SPM for GSD, to thereby pave the way for the development of new methods, techniques, and tools with which to tackle them. This paper aims to identify and classify research on SPM approaches for GSD that are available in the literature, to identify their current weaknesses and strengths, and to analyze their applications in industry. We performed a Systematic Mapping Study(SMS) based on six classification criteria. Eighty-four papers were selected and analyzed. The results indicate that interest in SPM for GSD has been increasing since 2006. As a class of approaches, the most frequently reported methods(40%) are those used for coordination, planning, and monitoring, along with estimation techniques that can be used to better match a distributed project. SPM for GSD requires further investigation by researchers and practitioners, particularly with respect to cost and time estimations. These findings will help overcome the challenges that must to be considered in future SPM research for GSD, especially regarding collaboration and time-zone differences.
2018年06期 v.23 690-714页 [查看摘要][在线阅读][下载 479K] [下载次数：172 ] |[网刊下载次数：0 ] |[引用频次：9 ] |[阅读次数：0 ] - Manal El Bajta;Ali Idri;Joaquín Nicolás Ros;José Luis Fernández-Alemán;Juan Manuel Carrillo de Gea;Félix García;Ambrosio Toval;
Global Software Development(GSD) is a well established field of software engineering with the benefits of a global environment. Software Project Management(SPM) plays a key role in the success of GSD. As a result, the need has arisen to study and evaluate the downsides of SPM for GSD, to thereby pave the way for the development of new methods, techniques, and tools with which to tackle them. This paper aims to identify and classify research on SPM approaches for GSD that are available in the literature, to identify their current weaknesses and strengths, and to analyze their applications in industry. We performed a Systematic Mapping Study(SMS) based on six classification criteria. Eighty-four papers were selected and analyzed. The results indicate that interest in SPM for GSD has been increasing since 2006. As a class of approaches, the most frequently reported methods(40%) are those used for coordination, planning, and monitoring, along with estimation techniques that can be used to better match a distributed project. SPM for GSD requires further investigation by researchers and practitioners, particularly with respect to cost and time estimations. These findings will help overcome the challenges that must to be considered in future SPM research for GSD, especially regarding collaboration and time-zone differences.
2018年06期 v.23 690-714页 [查看摘要][在线阅读][下载 479K] [下载次数：172 ] |[网刊下载次数：0 ] |[引用频次：9 ] |[阅读次数：0 ] - Anh Tran Huu;Heyan Huang;Yuhang Guo;Shumin Shi;Ping Jian;
Statistical machine translation for low-resource language suffers from the lack of abundant training corpora. Several methods, such as the use of a pivot language, have been proposed as a bridge to translate from one language to another. However, errors will accumulate during the extensive translation pipelines. In this paper,we propose an approach to low-resource language translation by exploiting the pronunciation correlations between languages. We find that the pronunciation features can improve both Chinese-Vietnamese and VietnameseChinese translation qualities. Experimental results show that our proposed model yields effective improvements,and the translation performance(bilingual evaluation understudy score) is improved by a maximum value of 1.03.
2018年06期 v.23 715-723页 [查看摘要][在线阅读][下载 588K] [下载次数：56 ] |[网刊下载次数：0 ] |[引用频次：7 ] |[阅读次数：0 ] - Anh Tran Huu;Heyan Huang;Yuhang Guo;Shumin Shi;Ping Jian;
Statistical machine translation for low-resource language suffers from the lack of abundant training corpora. Several methods, such as the use of a pivot language, have been proposed as a bridge to translate from one language to another. However, errors will accumulate during the extensive translation pipelines. In this paper,we propose an approach to low-resource language translation by exploiting the pronunciation correlations between languages. We find that the pronunciation features can improve both Chinese-Vietnamese and VietnameseChinese translation qualities. Experimental results show that our proposed model yields effective improvements,and the translation performance(bilingual evaluation understudy score) is improved by a maximum value of 1.03.
2018年06期 v.23 715-723页 [查看摘要][在线阅读][下载 588K] [下载次数：56 ] |[网刊下载次数：0 ] |[引用频次：7 ] |[阅读次数：0 ] - Wei Li;Xiaowei Cui;Mingquan Lu;
This paper describes a robust integrated positioning method to provide ground vehicles in urban environments with accurate and reliable localization results. The localization problem is formulated as a maximum a posteriori probability estimation and solved using graph optimization instead of Bayesian filter. Graph optimization exploits the inherent sparsity of the observation process to satisfy the real-time requirement and only updates the incremental portion of the variables with each new incoming measurement. Unlike the Extended Kalman Filter(EKF) in a typical tightly coupled Global Navigation Satellite System/Inertial Navigation System(GNSS/INS)integrated system, optimization iterates the solution for the entire trajectory. Thus, previous INS measurements may provide redundant motion constraints for satellite fault detection. With the help of data redundancy, we add a new variable that presents reliability of GNSS measurement to the original state vector for adjusting the weight of corresponding pseudorange residual and exclude faulty measurements. The proposed method is demonstrated on datasets with artificial noise, simulating a moving vehicle equipped with GNSS receiver and inertial measurement unit. Compared with the solutions obtained by the EKF with innovation filtering, the new reliability factor can indicate the satellite faults effectively and provide successful positioning despite contaminated observations.
2018年06期 v.23 724-732页 [查看摘要][在线阅读][下载 682K] [下载次数：181 ] |[网刊下载次数：0 ] |[引用频次：59 ] |[阅读次数：0 ] - Wei Li;Xiaowei Cui;Mingquan Lu;
This paper describes a robust integrated positioning method to provide ground vehicles in urban environments with accurate and reliable localization results. The localization problem is formulated as a maximum a posteriori probability estimation and solved using graph optimization instead of Bayesian filter. Graph optimization exploits the inherent sparsity of the observation process to satisfy the real-time requirement and only updates the incremental portion of the variables with each new incoming measurement. Unlike the Extended Kalman Filter(EKF) in a typical tightly coupled Global Navigation Satellite System/Inertial Navigation System(GNSS/INS)integrated system, optimization iterates the solution for the entire trajectory. Thus, previous INS measurements may provide redundant motion constraints for satellite fault detection. With the help of data redundancy, we add a new variable that presents reliability of GNSS measurement to the original state vector for adjusting the weight of corresponding pseudorange residual and exclude faulty measurements. The proposed method is demonstrated on datasets with artificial noise, simulating a moving vehicle equipped with GNSS receiver and inertial measurement unit. Compared with the solutions obtained by the EKF with innovation filtering, the new reliability factor can indicate the satellite faults effectively and provide successful positioning despite contaminated observations.
2018年06期 v.23 724-732页 [查看摘要][在线阅读][下载 682K] [下载次数：181 ] |[网刊下载次数：0 ] |[引用频次：59 ] |[阅读次数：0 ] - Chaokun Yan;Jingjing Ma;Huimin Luo;Jianxin Wang;
In recent years, there have been rapid developments in various bioinformatics technologies, which have led to the accumulation of a large amount of biomedical data. The biomedical data can be analyzed to enhance assessment of at-risk patients and improve disease diagnosis, treatment, and prevention. However, these datasets usually have many features, which contain many irrelevant or redundant information. Feature selection is a solution that involves finding the optimal subset, which is known to be an NP problem because of the large search space.Considering this, a new feature selection approach based on Binary Chemical Reaction Optimization algorithm(BCRO) and k-Nearest Neighbors(KNN) classifier is presented in this paper. Tabu search is integrated with CRO framework to enhance local search capacity. KNN is adopted to evaluate the quality of selected candidate subset. The results for an experiment conducted on nine standard medical datasets demonstrate that the proposed approach outperforms other state-of-the-art methods.
2018年06期 v.23 733-743页 [查看摘要][在线阅读][下载 779K] [下载次数：49 ] |[网刊下载次数：0 ] |[引用频次：13 ] |[阅读次数：0 ] - Chaokun Yan;Jingjing Ma;Huimin Luo;Jianxin Wang;
In recent years, there have been rapid developments in various bioinformatics technologies, which have led to the accumulation of a large amount of biomedical data. The biomedical data can be analyzed to enhance assessment of at-risk patients and improve disease diagnosis, treatment, and prevention. However, these datasets usually have many features, which contain many irrelevant or redundant information. Feature selection is a solution that involves finding the optimal subset, which is known to be an NP problem because of the large search space.Considering this, a new feature selection approach based on Binary Chemical Reaction Optimization algorithm(BCRO) and k-Nearest Neighbors(KNN) classifier is presented in this paper. Tabu search is integrated with CRO framework to enhance local search capacity. KNN is adopted to evaluate the quality of selected candidate subset. The results for an experiment conducted on nine standard medical datasets demonstrate that the proposed approach outperforms other state-of-the-art methods.
2018年06期 v.23 733-743页 [查看摘要][在线阅读][下载 779K] [下载次数：49 ] |[网刊下载次数：0 ] |[引用频次：13 ] |[阅读次数：0 ] - Jianjiang Li;Jie Wang;Bin Lyu;Jie Wu;Xiaolei Yang;
MapReduce is currently the most popular programming model for big data processing, and Hadoop is a well-known MapReduce implementation platform. However, Hadoop jobs suffer from imbalanced workloads during the reduce phase and inefficiently utilize the available computing and network resources. In some cases, these problems lead to serious performance degradation in MapReduce jobs. To resolve these problems, in this paper,we propose two algorithms, the Locality-Based Balanced Schedule(LBBS) and Overlapping-Based Resource Utilization(OBRU), that optimize the Locality-Enhanced Load Balance(LELB) and the Map, Local reduce, Shuffle,and final Reduce(MLSR) phases. The LBBS collects partition information from input data during the map phase and generates balanced schedule plans for the reduce phase. OBRU is responsible for using computing and network resources efficiently by overlapping the local reduce, shuffle, and final reduce phases. Experimental results show that the LBBS and OBRU algorithms yield significant improvements in load balancing. When LBBS and OBRU are applied, job performance increases by 15% from that of models using LELB and MLSR.
2018年06期 v.23 744-753页 [查看摘要][在线阅读][下载 588K] [下载次数：81 ] |[网刊下载次数：0 ] |[引用频次：13 ] |[阅读次数：0 ] - Jianjiang Li;Jie Wang;Bin Lyu;Jie Wu;Xiaolei Yang;
MapReduce is currently the most popular programming model for big data processing, and Hadoop is a well-known MapReduce implementation platform. However, Hadoop jobs suffer from imbalanced workloads during the reduce phase and inefficiently utilize the available computing and network resources. In some cases, these problems lead to serious performance degradation in MapReduce jobs. To resolve these problems, in this paper,we propose two algorithms, the Locality-Based Balanced Schedule(LBBS) and Overlapping-Based Resource Utilization(OBRU), that optimize the Locality-Enhanced Load Balance(LELB) and the Map, Local reduce, Shuffle,and final Reduce(MLSR) phases. The LBBS collects partition information from input data during the map phase and generates balanced schedule plans for the reduce phase. OBRU is responsible for using computing and network resources efficiently by overlapping the local reduce, shuffle, and final reduce phases. Experimental results show that the LBBS and OBRU algorithms yield significant improvements in load balancing. When LBBS and OBRU are applied, job performance increases by 15% from that of models using LELB and MLSR.
2018年06期 v.23 744-753页 [查看摘要][在线阅读][下载 588K] [下载次数：81 ] |[网刊下载次数：0 ] |[引用频次：13 ] |[阅读次数：0 ] -
<正>The publication of Tsinghua Science and Technology was started in 1996. Since then, it has been an international academic journal sponsored by Tsinghua University and published bimonthly. This journal aims at presenting the state-of-the-art scientific achievements in computer science and other IT fields. From 2012, the journal enters into IEEE Xplore Digital Library with the open access mode. In 2015, Tsinghua Science and Technology has been indexed in the Science Citation
2018年06期 v.23 754页 [查看摘要][在线阅读][下载 43K] [下载次数：56 ] |[网刊下载次数：0 ] |[引用频次：1 ] |[阅读次数：0 ] <正>The publication of Tsinghua Science and Technology was started in 1996. Since then, it has been an international academic journal sponsored by Tsinghua University and published bimonthly. This journal aims at presenting the state-of-the-art scientific achievements in computer science and other IT fields. From 2012, the journal enters into IEEE Xplore Digital Library with the open access mode. In 2015, Tsinghua Science and Technology has been indexed in the Science Citation
2018年06期 v.23 754页 [查看摘要][在线阅读][下载 43K] [下载次数：56 ] |[网刊下载次数：0 ] |[引用频次：1 ] |[阅读次数：0 ] -
<正>~~
2018年06期 v.23 755-758页 [查看摘要][在线阅读][下载 69K] [下载次数：18 ] |[网刊下载次数：0 ] |[引用频次：0 ] |[阅读次数：0 ] <正>~~
2018年06期 v.23 755-758页 [查看摘要][在线阅读][下载 69K] [下载次数：18 ] |[网刊下载次数：0 ] |[引用频次：0 ] |[阅读次数：0 ] -
<正>Tsinghua Science and Technology(Tsinghua Sci Technol, an academic journal sponsored by Tsinghua University,is published bimonthly. This journal aims at presenting the up-to-date scientific achievements with high creativity and great significance in computer and electronic engineering. Contributions all over the world are welcome.
2018年06期 v.23 759页 [查看摘要][在线阅读][下载 69K] [下载次数：15 ] |[网刊下载次数：0 ] |[引用频次：0 ] |[阅读次数：0 ] <正>Tsinghua Science and Technology(Tsinghua Sci Technol, an academic journal sponsored by Tsinghua University,is published bimonthly. This journal aims at presenting the up-to-date scientific achievements with high creativity and great significance in computer and electronic engineering. Contributions all over the world are welcome.
2018年06期 v.23 759页 [查看摘要][在线阅读][下载 69K] [下载次数：15 ] |[网刊下载次数：0 ] |[引用频次：0 ] |[阅读次数：0 ]