首页期刊导航|中国科学:信息科学(英文版)
期刊信息/Journal information
中国科学:信息科学(英文版)
中国科学:信息科学(英文版)

周光召

月刊

1674-733X

informatics@scichina.org

010-64015683

100717

北京东黄城根北街16号

中国科学:信息科学(英文版)/Journal Science China Information SciencesCSCDCSTPCDEISCI
查看更多>>《中国科学》是中国科学院主办、中国科学杂志社出版的自然科学专业性学术刊物。《中国科学》任务是反映中国自然科学各学科中的最新科研成果,以促进国内外的学术交流。《中国科学》以论文形式报道中国基础研究和应用研究方面具有创造性的、高水平的和有重要意义的科研成果。在国际学术界,《中国科学》作为代表中国最高水平的学术刊物也受到高度重视。国际上最具有权威的检索刊物SCI,多年来一直收录《中国科学》的论文。1999年《中国科学》夺得国家期刊奖的第一名。
正式出版
收录年代

    Fixed-time stabilization of output-constrained stochastic high-order nonlinear systems

    Ruiming XIEShengyuan XU
    1-16页
    查看更多>>摘要:In this study,the fixed-time stabilization problem of stochastic high-order nonlinear systems with output constraint and high-order and low-order nonlinearities is addressed.A new coordinate transformation is employed to directly convert output-constrained stochastic systems into an equivalent unconstrained form.By fully extracting the characteristics of system nonlinearities and using the stochastic fixed-time stability theorem,a new design and analysis method is constructed to guarantee that the trivial solution of the closed-loop system is stochastically fixed-time stable while fulfilling the output constraint.

    Online Pareto optimal control of mean-field stochastic multi-player systems using policy iteration

    Xiushan JIANGYanshuang WANGDongya ZHAOLing SHI...
    17-33页
    查看更多>>摘要:In this study,the Pareto optimal strategy problem was investigated for multi-player mean-field stochastic systems governed by Itô differential equations using the reinforcement learning(RL)method.A partially model-free solution for Pareto-optimal control was derived.First,by applying the convexity of cost functions,the Pareto optimal control problem was solved using a weighted-sum optimal control problem.Subsequently,using on-policy RL,we present a novel policy iteration(PI)algorithm based on the H-representation technique.In particular,by alternating between the policy evaluation and policy update steps,the Pareto optimal control policy is obtained when no further improvement occurs in system performance,which eliminates directly solving complicated cross-coupled generalized algebraic Riccati equations(GAREs).Practical numerical examples are presented to demonstrate the effectiveness of the proposed algorithm.

    An online value iteration method for linear-quadratic mean field social control with unknown dynamics

    Bing-Chang WANGShumei LIYing CAO
    34-35页

    Hybrid stochastic control strategy by two-layer networks for dissipating urban traffic congestion

    Xiaojing ZHONGBin PANGFeiqi DENGXueyan ZHAO...
    36-37页

    When debugging encounters artificial intelligence:state of the art and open challenges

    Yi SONGXiaoyuan XIEBaowen XU
    38-80页
    查看更多>>摘要:Both software debugging and artificial intelligence techniques are hot topics in the current field of software engineering.Debugging techniques,which comprise fault localization and program repair,are an important part of the software development lifecycle for ensuring the quality of software systems.As the scale and complexity of software systems grow,developers intend to improve the effectiveness and efficiency of software debugging via artificial intelligence(artificial intelligence for software debugging,AI4SD).On the other hand,many artificial intelligence models are being integrated into safety-critical areas such as autonomous driving,image recognition,and audio processing,where software debugging is highly necessary and urgent(software debugging for artificial intelligence,SD4AI).An AI-enhanced debugging technique could assist in debugging AI systems more effectively,and a more robust and reliable AI approach could further guarantee and support debugging techniques.Therefore,it is important to take AI4SD and SD4AI into consideration comprehensively.In this paper,we want to show readers the path,the trend,and the potential that these two directions interact with each other.We select and review a total of 165 papers in AI4SD and SD4AI for answering three research questions,and further analyze opportunities and challenges as well as suggest future directions of this cross-cutting area.

    A survey of decision making in adversarial games

    Xiuxian LIMin MENGYiguang HONGJie CHEN...
    81-108页
    查看更多>>摘要:In many practical applications,such as poker,chess,drug interdiction,cybersecurity,and na-tional defense,players often have adversarial stances,i.e.,the selfish actions of each player inevitably or intentionally inflict loss or wreak havoc on other players.Therefore,adversarial games are important in real-world applications.However,only special adversarial games,such as Bayesian games,are reviewed in the literature.In this respect,this study aims to provide a systematic survey of three main game models widely employed in adversarial games,i.e.,zero-sum normal-form and extensive-form games,Stackelberg(security)games,and zero-sum differential games,from an array of perspectives,including basic knowledge of game models,(approximate)equilibrium concepts,problem classifications,research frontiers,(approximate)opti-mal strategy-seeking techniques,prevailing algorithms,and practical applications.Finally,promising future research directions are also discussed for relevant adversarial games.

    Jigsaw-Sketch:a fast and accurate algorithm for finding top-k elephant flows in high-speed networks

    Boyu ZHANGHe HUANGYu-E SUNYang DU...
    109-126页
    查看更多>>摘要:Finding top-k elephant flows in high-speed networks is one of the most fundamental network measurement tasks.It is more challenging than per-flow size estimation since the IDs and sizes of top-k flows must be tracked simultaneously.Most existing studies only record the IDs of a small number of elephant flows to fit their estimators in the extremely limited high-speed on-chip memory.However,these solutions need too many memory accesses when a packet arrives to track the elephant flows with high accuracy,which limits their practicability.Therefore,this paper proposes Jigsaw-Sketch,a new algorithm to find the top-k elephant flows with much fewer memory accesses while achieving high memory efficiency and accuracy.In this design,we propose a novel two-stage jigsaw storage scheme,which can capture the candidate top-k flows from massive network steams efficiently,and further find the top-k elephant flows with high memory efficiency and only a few memory accesses for each packet.Extensive experimental results based on real network traces show that Jigsaw-Sketch improves the packet processing throughput by at least 86%,while achieving smaller memory footprints and higher accuracy compared to the SOTA.

    Robust cooperative multi-agent reinforcement learning via multi-view message certification

    Lei YUANTao JIANGLihe LIFeng CHEN...
    127-141页
    查看更多>>摘要:Many multi-agent scenarios require message sharing among agents to promote coordination,hastening the robustness of multi-agent communication when policies are deployed in a message perturbation environment.Major relevant studies tackle this issue under specific assumptions,like a limited number of message channels would sustain perturbations,limiting the efficiency in complex scenarios.In this paper,we take a further step in addressing this issue by learning a robust cooperative multi-agent reinforcement learning via multi-view message certification,dubbed CroMAC.Agents trained under CroMAC can obtain guaranteed lower bounds on state-action values to identify and choose the optimal action under a worst-case deviation when the received messages are perturbed.Concretely,we first model multi-agent communication as a multi-view problem,where every message stands for a view of the state.Then we extract a certificated joint message representation by a multi-view variational autoencoder(MVAE)that uses a product-of-experts inference network.For the optimization phase,we do perturbations in the latent space of the state for a certificate guarantee.Then the learned joint message representation is used to approximate the certificated state representation during training.Extensive experiments in several cooperative multi-agent benchmarks validate the effectiveness of the proposed CroMAC.

    What can we learn from quality assurance badges in open-source software?

    Feng LIYiling LOUXin TANZhenpeng CHEN...
    142-159页
    查看更多>>摘要:In the development of open-source software(OSS),many developers use badges to give an overview of the software and share some key features/metrics conveniently.Among various badges,quality assurance(QA)badges make up a large proportion and are the most prevalent because QA is of vital impor-tance in software development,and ineffective QA may lead to anomalies or defects.In this paper,we focus on QA badges in open-source projects,which present quality assurance information directly and instantly,and aim to produce some interesting findings and provide practical implications.We collect and analyze 100000 projects written in popular programming languages from GitHub and conduct a comprehensive em-pirical study both inside and outside QA badges.Inside QA badges,we build a category classification for all QA badges based on the properties they focus on,which shows the types of QA badges developers use.Then,we analyze the frequency of the properties that QA badges focus on,and property combinations,too,which present their use status.We find that QA badges focus on various properties while developers give different preferences to different properties.The use status also differs between different programming languages.For example,projects written in C focus on Security to a great extent.Our findings also provide implications for developers and badge providers.Outside QA badges,we conduct a correlation analysis between QA badges and some software metrics that have potential relationships with code quality,contribution quality,and popularity.We find that QA badges have statistically significant correlations with various software metrics.

    Retrieval-and-alignment based large-scale indoor point cloud semantic segmentation

    Zongyi XUXiaoshui HUANGBo YUANYangfu WANG...
    160-176页
    查看更多>>摘要:Current methods for point cloud semantic segmentation depend on the extraction of descriptive features.However,unlike images,point clouds are irregular and often lack texture information,making it demanding to extract discriminative features.In addition,noise,outliers,and uneven point distribution are commonly present in point clouds,which further complicates the segmentation task.To address these problems,a novel architecture is proposed for direct and accurate large-scale point cloud segmentation based on point cloud retrieval and alignment.The proposed approach involves using a feature-based point cloud retrieval method for searching for reference point clouds with annotations from a dataset.In the following segmentation stage,an overlap-based point cloud registration method has been developed to align the target and reference point clouds.For accurate and robust alignment,an overlap region estimation module is trained to locate the optimal overlap region between two pieces of point clouds in a coarse-to-fine manner.In the detected overlap region,the global and local features of the points are extracted and combined for feature-metric registration to obtain accurate transformation parameters between the target and reference point clouds.After alignment,the annotated segmentation of the reference is transferred to the target point clouds to obtain accurate segmentation results.Extensive experiments are conducted to show that the developed method outperforms the state-of-the-art approaches in terms of both accuracy and robustness against noise and outliers.