检索结果-内蒙古大学图书馆

International Conference on Software Engineering (ICSE)

作者： Lin Shi Fangwen Mu Yumin Zhang Ye Yang Junjie Chen Xiao Chen Hanzhi Jiang Ziyou Jiang Qing Wang Laboratory for Internet Software Technologies Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China School of Systems and Enterprises Stevens Institute of Technology Hoboken NJ USA College of Intelligence and Computing Tianjin University Tianjin China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Science &#x0026 Technology on Integrated Information System Laboratory Institute of Software Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781665495899

In community-based software development, developers frequently rely on live-chatting to discuss emergent bugs/errors they encounter in daily development tasks. However, it remains a challenging task to accurately record such knowledge due to the noisy nature of interleaved dialogs in live chat data. In this paper, we first formulate the task of identifying and synthesizing bug reports from commu-nity live chats, and propose a novel approach, named BugListener, to address the challenges. Specifically, BugListener automates three sub-tasks: 1) Disentangle the dialogs from massive chat logs by using a Feed-Forward neural network; 2) Identify the bug-report dialogs from separated dialogs by leveraging the Graph neural net-work to learn the contextual information; 3) Synthesize the bug reports by utilizing Transfer Learning techniques to classify the sentences into: observed behaviors (OB), expected behaviors (EB), and steps to reproduce the bug (SR). BugListener is evaluated on six open source projects. The results show that: for bug report identification, BugListener achieves the average Fl of 77.74%, im-proving the best baseline by 12.96%; and for bug report synthesis task, BugListener could classify the OB, EB, and SR sentences with the F1 of 84.62%, 71.46%, and 73.13%, improving the best baselines by 9.32%,12.21%,10.91%, respectively. A human evaluation study also confirms the effectiveness of Bug Listener in generating relevant and accurate bug reports. These demonstrate the significant potential of applying BugListener in community-based software development, for promoting bug discovery and quality improvement.

关键词： computer bugs Transfer learning Neural networks Collaboration Predictive models Software Behavioral sciences

来源：评论

学校读者我要写书评

暂无评论

BugListener: Identifying and Synthesizing Bug Reports from Collaborative Live Chats

arXiv

引用

arXiv 2022年

作者： Shi, Lin Mu, Fangwen Zhang, Yumin Yang, Ye Chen, Junjie Chen, Xiao Jiang, Hanzhi Jiang, Ziyou Wang, Qing Laboratory for Internet Software Technologies Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Science & Technology on Integrated Information System Laboratory Institute of Software Chinese Academy of Sciences Beijing China School of Systems and Enterprises Stevens Institute of Technology HobokenNJ United States Tianjin University College of Intelligence and Computing Tianjin China

In community-based software development, developers frequently rely on live-chatting to discuss emergent bugs/errors they encounter in daily development tasks. However, it remains a challenging task to accurately record such knowledge due to the noisy nature of interleaved dialogs in live chat data. In this paper, we first formulate the task of identifying and synthesizing bug reports from community live chats, and propose a novel approach, named BugListener, to address the challenges. Specifically, BugListener automates three sub-tasks: 1) Disentangle the dialogs from massive chat logs by using a Feed-Forward neural network;2) Identify the bug-report dialogs from separated dialogs by leveraging the Graph neural network to learn the contextual information;3) Synthesize the bug reports by utilizing Transfer Learning techniques to classify the sentences into: observed behaviors (OB), expected behaviors (EB), and steps to reproduce the bug (SR). BugListener is evaluated on six open source projects. The results show that: for bug report identification, BugListener achieves the average F1 of 77.74%, improving the best baseline by 12.96%;and for bug report synthesis task, BugListener could classify the OB, EB, and SR sentences with the F1 of 84.62%, 71.46%, and 73.13%, improving the best baselines by 9.32%, 12.21%, 10.91%, respectively. A human evaluation study also confirms the effectiveness of BugListener in generating relevant and accurate bug reports. These demonstrate the significant potential of applying BugListener in community-based software development, for promoting bug discovery and quality improvement. Copyright © 2022, The Authors. All rights reserved.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Incorporation of Ordinal Optimization into Learning Automata for High Learning Efficiency

Incorporation of Ordinal Optimization into Learning Automata...

引用

IEEE International Conference on Automation Science and Engineering

作者： JunQi Zhang Cheng Wang Di Zang MengChu Zhou Department of Computer Science and Technology the Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Department of Electrical and Computer Engineering New Jersey Institute of Technology

ISBN: (纸本)9781467381840

Learning automata (LA) represent important leaning mechanisms with applications in automated system design, biological system modeling, computer vision, and transportation. They play the critical roles in modeling a process as well as generating the appropriate signal to control it. They update their action probabilities in accordance with the inputs received from the environment and can improve their own performance during operations. The action probability vector in LA takes charge of two functions: 1) The cost of convergence, i.e., the size of sampling budget;2) The allocation of sampling budget among actions to identify the optimal one. These two intertwined functions lead to a problem: The sampling budget mostly goes to the currently estimated optimal action due to its high action probability regardless whether it can help identify the real optimal action or not. This work proposes a new class of LA that separates the allocation of sampling budget from the action probability vector. It uses the action probability vector to determine the size of sampling budget and then uses Optimal computing Budget Allocation (OCBA) to accomplish the allocation of sampling budget in a way that maximizes the probability of identifying the true optimal action. Simulation results verify its significant speedup ranging from 10.93% to 65.94% over the best existing LA algorithms.

关键词： Convergence Optimization Resource management Learning automata Computational modeling Pursuit algorithms Accuracy

来源：评论

学校读者我要写书评

暂无评论

CFDIL: A context-aware feature deep interaction learning for app recommendation

Research Square

引用

Research Square 2021年

作者： Hao, Qingbo Zhu, Ke Wang, Chundong Wang, Peng Mo, Xiuliang Liu, Zhen Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin China School of Computer Science and Engineering Tianjin University of Technology Tianjin China Engineering Research Center of Learning-Based Intelligent System Ministry of Education Tianjin China Graduate School of Engineering Nagasaki Institute of Applied Science Nagasaki Japan

The rapid development of Mobile Internet has spawned various mobile applications (apps). A large number of apps make it difficult for users to choose apps conveniently, causing the app overload problem. As the most effective tool to solve the problem of app overload, the app recommendation has attracted extensive attention of researchers. Traditional recommendation methods usually use historical data of apps used by users to explore their preferences, and then make an app recommendation list for users. Although the traditional app recommendation methods have achieved certain results, the performance of app recommendation still needs to be improved due to the following two reasons. On the one hand, it is difficult to construct traditional app recommendation models when facing with the sparse user-app interaction data. On the other hand, contextual information has a large impact on users’ app usage preferences, which is often overlooked by traditional app recommendation methods. To overcome the aforementioned problems, we proposed a Context-aware Feature Deep Interaction Learning (CFDIL) method to explore user preferences, and then perform app recommendation by learning potential user-app relationships in different contexts. The novelty of CFDIL is as follows: (1) CFDIL incorporates contextual features into users’ preferences modeling by constructing a novel user and app feature portrait. (2) The problem of data sparsity is effectively solved by the use of dense user and app feature portraits, as well as the tensor operations for label sets. (3) CFDIL trains a new deep network structure, which can make accurate app recommendation using the contextual information and attribute information of users and apps. We applied CFDIL on three real datasets and conducted extensive experiments, which showed that CFDIL outperformed the benchmark method. © 2021, CC BY.

关键词： User profile

来源：评论

学校读者我要写书评

暂无评论

Aggregation capacity of wireless sensor networks: Extended network case

Aggregation capacity of wireless sensor networks: Extended n...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Cheng Wang Changjun Jiang Yunhao Liu Xiang-Yang Li Shaojie Tang Huadong Ma Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science University of Tongji Shanghai China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong China TNLIST School of Software Tsinghua University China Department of Computer Science Illinois Institute of Technology Chicago IL USA Department of Computer Science Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781424499199

A critical function of wireless sensor networks (WSNs) is data gathering. While, one is often only interested in collecting a relevant function of the sensor measurements at a sink node, rather than downloading all the data from all the sensors. This paper studies the capacity of computing and transporting the specific functions of sensor measurements to the sink node, called aggregation capacity, for WSNs. It focuses on random WSNs that can be classified into two types: random extended WSN and random dense WSN. All existing results about aggregation capacity are studied for dense WSNs, including random cases and arbitrary cases, under the protocol model (ProM) or physical model (PhyM). In this paper, we propose the first aggregation capacity scaling laws for random extended WSNs. We point out that unlike random dense WSNs, for random extended WSNs, the assumption made in ProM and PhyM that each successful transmission can sustain a constant rate is over-optimistic and unpractical due to transmit power *** derive the first result on aggregation capacity for random extended WSNs under the generalized physical model. Particularly, we prove that, for the type-sensitive perfectly compressible functions and type-threshold perfectly compressible functions, the aggregation capacities for random extended WSNs with n nodes are of order Θ ((log n) -β/2-1 ) and Θ (((log n) -β/2 )/(log log n)), respectively, where β >; 2 denotes the power attenuation exponent in the generalized physical model.

关键词： Wireless sensor networks Signal to noise ratio Interference Throughput Lattices Routing PROM

来源：评论

学校读者我要写书评

暂无评论

Provably Convergent Federated Trilevel Learning

arXiv

引用

arXiv 2023年

作者： Jiao, Yang Yang, Kai Wu, Tiancheng Jian, Chengtao Huang, Jianwei Department of Computer Science and Technology Tongji University China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University China Shanghai Research Institute for Intelligent Autonomous Systems China School of Science and Engineering The Chinese University of Hong Kong Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society China

Trilevel learning, also called trilevel optimization (TLO), has been recognized as a powerful modelling tool for hierarchical decision process and widely applied in many machine learning applications, such as robust neural architecture search, hyperparameter optimization, and domain adaptation. Tackling TLO problems has presented a great challenge due to their nested decision-making structure. In addition, existing works on TLO face the following key challenges: 1) they all focus on the non-distributed setting, which may lead to privacy breach;2) they do not offer any non-asymptotic convergence analysis which characterizes how fast an algorithm converges. To address the aforementioned challenges, this paper proposes an asynchronous federated trilevel optimization method to solve TLO problems. The proposed method utilizes µ-cuts to construct a hyper-polyhedral approximation for the TLO problem and solve it in an asynchronous manner. We demonstrate that the proposed µ-cuts are applicable to not only convex functions but also a wide range of non-convex functions that meet the µ-weakly convex assumption. Furthermore, we theoretically analyze the non-asymptotic convergence rate for the proposed method by showing its iteration complexity to obtain ϵ-stationary point is upper bounded by (Formula Presented). Extensive experiments on real-world datasets have been conducted to elucidate the superiority of the proposed method, e.g., it has a faster convergence rate with a maximum acceleration of approximately 80%. Copyright © 2023, The Authors. All rights reserved.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Recent progress of integrated circuits and optoelectronic chips

引用

Science China(Information Sciences) 2021年第10期64卷 103-135页

作者： Yue HAO Shuiying XIANG Genquan HAN Jincheng ZHANG Xiaohua MA Zhangming ZHU Xingxing GUO Yahui ZHANG Yanan HAN Ziwei SONG Yan LIU Ling YANG Hong ZHOU Jiangyi SHI Wei ZHANG Min XU Weisheng ZHAO Biao PAN Yangqi HUANG Qi LIU Yimao CAI Jian ZHU Xin OU Tiangui YOU Huaqiang WU Bin GAO Zhiyong ZHANG Guoping GUO Yonghua CHEN Yong LIU Xiangfei CHEN Chunlai XUE Xingjun WANG Lixia ZHAO Xihua ZOU Lianshan YAN Ming LI School of Microelectronics Xidian University State Key Laboratory of Integrated Service Networks Xidian University National Integrated Circuit Innovation Center School of Microelectronics Fudan University School of Integrated Circuit Science and Engineering Beihang University China Center for Information Industry Development Frontier Institute of Chip and System Fudan University Institute of Microelectronics Peking University Nanjing Electronic Devices Institute State Key Laboratory of Functional Material for Informatics Shanghai Institute of Microsystem and Information Technology Chinese Academy of Sciences Institute of Microelectronics Tsinghua University Center for Carbon-based Electronics Department of Electronics Peking University CAS Key Laboratory of Quantum Information University of Science and Technology of China CAS Center for Excellence and Synergetic Innovation Center in Quantum Information and Quantum Physics University of Science and Technology of China Origin Quantum Computing Company Limited Key Laboratory of Flexible Electronics & Institute of Advanced Materials Nanjing Tech University State Key Laboratory of Electronic Thin Films and Integrated Devices School of Optoelectronic Science and EngineeringUniversity of Electronic Science and Technology of China National Laboratory of Solid State Microstructures & College of Engineering and Applied Sciences Nanjing University State Key Laboratory on Integrated Optoelectronics Institute of Semiconductors Chinese Academy of Sciences Center of Materials Science and Optoelectronics Engineering University of Chinese Academy of Sciences State Key Laboratory of Advanced Optical Communication Systems and Networks School of Electronics Engineering and Computer Science Peking University School of Electrical and Electronic Engineering Tiangong University Center for Information Photonics and Communications School of Information Science and TechnologySouthwest Jiaotong University School of Electronic Electrical and Communication Engineering

Integrated circuits(ICs) and optoelectronic chips are the foundation stones of the modern information society. The IC industry has been driven by the so-called "Moore's law" in the past 60 years, and now has entered the post Moore's law era. In this paper, we review the recent progress of ICs and optoelectronic chips. The research status, technical challenges and development trend of devices, chips and integrated technologies of typical IC and optoelectronic chips are focused on. The main contents include the development law of IC and optoelectronic chip technology, the IC design and processing technology, emerging memory and chip architecture, brain-like chip structure and its mechanism, heterogeneous integration, quantum chip technology, silicon photonics chip technology, integrated microwave photonic chip, and optoelectronic hybrid integrated chip.

关键词： integrated circuit semiconductor science and technology optoelectronic device and chip photonic integrated circuit wide bandgap semiconductors silicon photonics hybrid integration quantum chip integrated microwave photonic photonic neural computing

来源：评论

学校读者我要写书评

暂无评论

Tradeoff cache between latency and capacity in chip multiprocessors

引用

Jisuanji Yanjiu yu Fazhan/computer Research and Development 2009年第1期46卷 167-175页

作者： Xiao, Junhua Feng, Zijun Zhang, Longbing Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Graduate School Chinese Academy of Sciences Beijing 100049 China

Chip multiprocessors (CMP) have become the main stream microprocessor architecture. In CMP, the cache, especially the last level cache, is the critical part of its performance and becomes a focus of current research activities. CMP cache faces the conflicting requirements of satisfying both latency and capacity, and has to trade off between techniques that reduce off-chip and cross-chip misses. The private cache design minimizes the cache access latency but reduces the total effective cache capacity. The shared cache design maximizes the effective cache capacity but incurs long hit latency. In this paper, a CMP cache design (tradeoff cache between latency and capacity, TCLC) is proposed. TCLC is a private and shared hybrid design. TCLC can dynamically identify the cache blocks' shared type and optimize them respectively. The private type is optimized through migration policy, the shared read-only type is optimized through replication policy, and the shared read-write type is optimized through center placement policy. TCLC tries to make cache access latency close to private design, and effective cache capacity close to shared design, which can mitigate the impact of the wire delay and reduce the average memory access latency. The experiment results indicate that this proposal performs 13.7% better than a private cache and 12% better than a shared cache.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Register pressure sensitive instruction speculative scheduling technology

引用

Jisuanji Yanjiu yu Fazhan/computer Research and Development 2009年第3期46卷 485-491页

作者： Huang, Lei Feng, Xiaobing Lü, Fang Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Graduate University Chinese Academy of Sciences Beijing 100049 China

Speculation is an important method to overcome control flow constraints during instruction scheduling. On the one hand, speculation can exploit more instruction-level parallelism and improve performance. However, on the other hand, it may also lengthen the live range of variables and increase the register pressure, which in turn results in spilling some variables to memory and deteriorating the performance. Previous work on register pressure sensitive instruction scheduling generally scheduled instructions conservatively when there were too many live variables in the scheduling region. But actually different variables have different spilling costs and different impacts on performance. Here a register pressure sensitive speculative instruction scheduling technology is presented, which not only considers the count of live variables, but also analyzes the benefits and the spilling costs brought by instructions' speculative motions. The decrement of cycles in critical path is calculated as benefit, while the spilled variables are predicted and their spilling cost is used as cost. Only the speculative motion with benefit greater than the cost is permitted in our method. This algorithm has been implemented in Godson Compiler for MIPS architecture. Experiment result shows that the method in this paper can obtain 1.44% speedup on average relative to its register pressure insensitive counterpart on SPEC CPU2000INT benchmarks.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Physical-annotation-based power modeling and estimation method for processor

引用

Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of computer-Aided Design and computer Graphics 2007年第11期19卷 1471-1475页

作者： Huang, Kun Zhang, Ge Wang, Jun Zeng, Hongbo Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China Graduate University Chinese Academy of Sciences Beijing 100049 China

The proposed method is focused on synthesis-based static circuits, and a power modeling library is developed for modeling processors by means of parametric RTL and physical annotation, and all kinds of processor modules are mapped into combinations of basic components. Those models are linked to an architectural simulator, running benchmarks to get power results. The power analysis of benchmark platforms proves to be effective and highly correlated, with an average 10% error and little speed penalty compared with the gate-level power analysis.

关键词： High performance processor Physical annotation Power estimation Power modeling

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：