教学课程资源库 更多>>

关键词： 师范生培养“   四新”案例   创新实践能力  

摘要： 针对计算机科学与技术师范专业人才培养中存在的师范教育弱化、教师对实践能力理解不充分,教学中案例资源单一、短缺等问题,通过实践研究,提出面向中学人工智能教育的“四新”师范人才培养理念,明确创新实践能力培养的重要路径,丰富“四新”案例资源,探索“六位一体,做有温度的课程思政”的教学理念。经实践检验效果良好,对人才培养、专业建设、创新实践能力等方面有较好的借鉴意义。

关键词： Linear regression   Computer science   Computational modeling   Support vector machines   Feature extraction   Computer architecture   Symbols   Deep neural networks   adversarial examples   adversarial transferability   generalization ability   robustness  

摘要： This article substantially extends our work published at ECCV (Li et al., 2020), in which an intermediate-level attack was proposed to improve the transferability of some baseline adversarial examples. Specifically, we advocate a framework in which a direct linear mapping from the intermediate-level discrepancies (between adversarial features and benign features) to prediction loss of the adversarial example is established. By delving deep into the core components of such a framework, we show that a variety of linear regression models can all be considered in order to establish the mapping, the magnitude of the finally obtained intermediate-level adversarial discrepancy is correlated with the transferability, and further boost of the performance can be achieved by performing multiple runs of the baseline attack with random initialization. In addition, by leveraging these findings, we achieve new state-of-the-arts on transfer-based l(infinity)and l(2) attacks. Our code is publicly available at https://***/qizhangli/ila-plus-plus-lr.

关键词： Students  

摘要： As computing becomes more powerful and extends the reach of those who wield it, the imperative grows for computing professionals to make ethical decisions regarding the use of that power. We propose the concept of abstracted power to help computer science students understand how technology may distance them perceptually from consequences of their actions. Specifically, we identify technological intermediation and computational thinking as two factors in computer science that contribute to this distancing. To counter the abstraction of power, we argue for increased emotional engagement in computer science ethics education, to encourage students to feel as well as think regarding the potential impacts of their power on others. We suggest four concrete pedagogical approaches to enable this emotional engagement in computer science ethics curriculum, and we share highlights of student reactions to the material. © 2020 IEEE.

关键词： 碛口黑龙庙   水神庙   地域建筑   晋商文化   建筑文化  

摘要： 晋商发迹于明,兴盛于清,衰微于民国。黑龙庙的营建历程正如晋商的发展历程一般,起创于明,庙宇规制完善于清,随着交通发展,晋商衰落,黑龙庙也逐渐鲜为人知。本研究在历史文献查阅、实地调研的基础上,对黑龙庙的营建历史进行梳理,从庙宇的选址、布局到建筑单体的形制及细部装饰着手,探讨晋商文化对黑龙庙的影响。研究发现,黑龙庙营建与晋商文化有着密切的联系,黑龙庙在清末民初逐渐由“水神祭祀场所”转为“晋商的活动中心”,由“娱神”转为“娱商”,展现出以晋商文化为主的多元文化融合风格。探讨晋商文化对黑龙庙的影响,可为不同地域水神庙的建筑文化挖掘与历史传承提供一定参考。

关键词： Resource management   Social networking (online)   Approximation algorithms   Prediction algorithms   Computer science   Optimization   Organizations   Social event arrangement   social network   platform-oriented   approximation algorithms   event time allocation  

摘要： Online Event-based social networks (EBSNs), such as Meetup and Whova, which provide platforms for users to publish, arrange and participate in events, have become increasingly popular. A major challenge for managing EBSNs is to generate the most satisfactory event arrangement, i.e., events are scheduled at the reasonable time to attract maximum number of participants. Existing approaches usually focus on assigning a set of events organized to time intervals, but ignore the competitive relationships among different event organizers, which will lead to event time allocations unacceptable to organizers. Thus, a more intelligent EBSNs platform that allocates social events properly in a global view (i.e., the perspective of platform) is desired. In this paper, we first formally define the problem of Platform-oriented Event Time Allocation (PETA), which contains two parts: the prediction of event feasible time period and the event time allocation. Unfortunately, we find that the PETA problem is NP-hard due to the global conflict constraints on events. Thus, we propose a method to calculate event feasible time period based on event time prediction, and then design a greedy algorithm and two approximation algorithms to solve the PETA problem. Finally, we conduct extensive experiments on both real and synthetic datasets to test the effectiveness and efficiency of the proposed algorithms.

关键词： Protocols   Servers   Recommender systems   Costs   Computer science   Collaboration   Privacy   Privacy-preserving collaborative filtering   PPCF   fully homomorphic encryption  

摘要： Protecting the privacy of users is one of the most important issues in recommender systems, where new items, e.g., books, movies, and friends in online social networking service/sites, are recommended to target users. To identify recommended items, encryption-based privacy-preserving collaborative filtering is widely used to generate recommendations. However, existing solutions are either slow or not scalable. To tackle this issue, in this paper, we first propose a privacy-preserving user-based CF protocol using the BGV fully homomorphic encryption scheme, which is named BGV-CF. By reducing interactions and the amount of communication traffic among users and recommendation servers, the proposed BGV-CF protocol significantly facilitates the recommendation process. Then, we propose an optimized BGV-CF (OBGV-CF) protocol where some computations are offloaded to users during the recommendation process. The security of the proposed schemes is qualitatively analyzed and quantitative analyses of the computation and communication costs are performed. In addition, provable security analysis using random oracles is provided. The BGV-CF and OBGV-CF protocols are implemented using C++, and testbeds using the MovieLens dataset are conducted. Experimental results demonstrate that the proposed BGV-CF and OBGV-CF successfully achieve their design goals.

关键词： Sorting   Memory management   Estimation   Computer science   Upper bound   Merging   Heuristic algorithms   Multiple longest common subsequences(MLCS)   dominant point-based approach   useless match point detection   branch elimination   smaller DAG  

摘要： It is a key issue to find out all longest common subsequences of multiple sequences over a set of finite alphabets, namely MLCS problem, in computational biology, pattern recognition and information retrieval, to name a few. However, it is very challenging to tackle the large-scale MLCS problem effectively and efficiently due to the high complexity of time and space. To this end, this paper will therefore propose a Branch Elimination-based Space and Time efficient algorithm called BEST-MLCS, which includes the following four key strategies: 1) Estimation scheme for the lower bound of the length of MLCS. 2) Estimation scheme for the upper bound of the length of the paths through the current match point. 3) Branch elimination strategy by finding all useless match points and removing the branches not on the longest paths. 4) A new Directed Acyclic Graph (DAG) construction method for constructing the smallest DAG among the existing ones. As a result, the proposed algorithm BEST-MLCS can save a lot of space and time and can handle much larger scale MLCS problems than the existing algorithms. Extensive experiments conducted on biological DNA sequences show that the performance of the proposed algorithm BEST-MLCS outperforms three state-of-the-art algorithms in terms of run-time and memory consumption.

关键词： Computer science   software engineering   requirement engineering   software quality   defect detection  

摘要： In the early stage of software development,a software requirements specification(SRS)is essential,and whether the requirements are clear and explicit is the ***,due to various reasons,there may be a large number of *** generate high-quality software requirements specifications,numerous researchers have developed a variety of ways to improve the quality of *** this paper,we propose a questions extraction method based on SRS elements decomposition,which evaluates the quality of SRS in the form of numerical *** proposed method not only evaluates the quality of SRSs but also helps in the detection of defects,especially the description problem and omission defects in *** verify the effectiveness of the proposed method,we conducted a controlled experiment to compare the ability of checklist-based review(CBR)and the proposed method in the SRS *** CBR is a classicmethod of reviewing SRS *** a lot of practice and improvement for a long time,CBR has excellent review ability in improving the quality of software requirements *** experimental results with 40 graduate studentsmajoring in software engineering confirmed the effectiveness and advantages of the proposed ***,the shortcomings and deficiencies of the proposed method are also observed through the ***,the proposed method has been tried out by engineers with practical work experience in software development industry and received good feedback.