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

8th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, ISoLA 2018

作者： Schlick, Rupert Felderer, Michael Majzik, Istvan Nardone, Roberto Raschke, Alexander Snook, Colin Vittorini, Valeria Center for Digital Safety and Security AIT Austrian Institute of Technology GmbH Vienna Austria Department of Computer Science University of Innsbruck Innsbruck Austria Department of Software Engineering Blekinge Institute of Technology Karlskrona Sweden Department of Measurement and Information Systems Budapest University of Technology and Economics Budapest Hungary University of Naples Federico II Naples Italy Institute of Software Engineering and Programming Languages Ulm University Ulm Germany Electronics and Computer Science University of Southampton Southampton United Kingdom

ISBN: (纸本)9783030034269

Formal methods (in a broad sense) have been around almost since the beginning of computer science. Nonetheless, there is a perception in the formal methods community that take-up by industry is low considering the potential benefits. We take a look at possible reasons and give candidate explanations for this effect. To address the issue, we propose a repository of industry-relevant example problems with an accompanying open data storage for experiment results in order to document, disseminate and compare exemplary solutions from formal model based methods. This would allow potential users from industry to better understand the available solutions and to more easily select and adopt a formal method that fits their needs. At the same time, it would foster the adoption of open data and good scientific practice in this research field. © Springer Nature Switzerland AG 2018.

关键词： Formal methods

来源：评论

学校读者我要写书评

暂无评论

Lower bounds and optimal algorithms for smooth and strongly convex decentralized optimization over time-varying networks 21

Lower bounds and optimal algorithms for smooth and strongly ...

引用

Proceedings of the 35th International Conference on Neural Information Processing Systems

作者： Dmitry Kovalev Elnur Gasanov Alexander Gasnikov Peter Richtárik King Abdullah University of Science and Technology Thuwal Saudi Arabia KAUST Moscow Institute of Physics and Technology Moscow Russia and Institute for System Programming of the Russian Academy of Sciences Research Center for Trusted

ISBN: (纸本)9781713845393

We consider the task of minimizing the sum of smooth and strongly convex functions stored in a decentralized manner across the nodes of a communication network whose links are allowed to change in time. We solve two fundamental problems for this task. First, we establish the first lower bounds on the number of decentralized communication rounds and the number of local computations required to find an ∈-accurate solution. Second, we design two optimal algorithms that attain these lower bounds: (i) a variant of the recently proposed algorithm ADOM (Kovalev et al., 2021) enhanced via a multi-consensus subroutine, which is optimal in the case when access to the dual gradients is assumed, and (ii) a novel algorithm, called ADOM+, which is optimal in the case when access to the primal gradients is assumed. We corroborate the theoretical efficiency of these algorithms by performing an experimental comparison with existing state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Learner-centered Design of Computing Education: Research on Computing for Everyone

引用

2015年

作者： Mark Guzdial

ISBN: (数字)9781627053525

Computing education is in enormous demand. Many students (both children and adult) are realizing that they will need programming in the future. This book presents the argument that they are not all going to use programming in the same way and for the same purposes. What do we mean when we talk about teaching everyone to program? When we target a broad audience, should we have the same goals as computer science education for professional software developers? How do we design computing education that works for everyone? This book proposes use of a learner-centered design approach to create computing education for a broad audience. It considers several reasons for teaching computing to everyone and how the different reasons lead to different choices about learning goals and teaching methods. The book reviews the history of the idea that programming isn’t just for the professional software developer. It uses research studies on teaching computing in liberal arts programs, to graphic designers, to high school teachers, in order to explore the idea that computer science for everyone requires us to re-think how we teach and what we teach. The conclusion describes how we might create computing education for everyone.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fast RNA structure alignment for crossing input structures

Fast RNA structure alignment for crossing input structures

引用

作者： Backofen, Rolf Landau, Gad M. Möhl, Mathias Tsur, Dekel Weimann, Oren Bioinformatics Institute of Computer Science Albert-Ludwigs-Universität Freiburg Germany Department of Computer Science University of Haifa Haifa 31905 Israel Department of Computer Science and Engineering NYU-Poly Six MetroTech Center Brooklyn NY 11201-3840 United States Programming Systems Lab Saarland University Saarbrücken Germany Ben-Gurion University Beer-Sheva Israel Massachusetts Institute of Technology Cambridge MA 02139 United States

The complexity of pairwise RNA structure alignment depends on the structural restrictions assumed for both the input structures and the computed consensus structure. For arbitrarily crossing input and consensus structures, the problem is NP-hard. For non-crossing consensus structures, Jiang et al.'s (2002) [9] algorithm computes the alignment in O(n2m2) time where n and m denote the lengths of the two input sequences. If the input structures are also non-crossing, the problem corresponds to tree editing which can be solved in O(m2n(1+lognm)) time (Demaine et al., 2007) [3]. We present a new algorithm that solves the problem for d-crossing structures in O(dm2nlogn) time, where d is a parameter that is one for non-crossing structures, bounded by n for crossing structures, and much smaller than n on many practical examples. Crossing input structures allow for applications where the input is not a fixed structure but is given as base-pair probability matrices. © 2010 Elsevier B.V. All rights reserved.

关键词： RNA

来源：评论

学校读者我要写书评

暂无评论

Multi-criteria Radio Frequency Identification Approach for Manufacturing Company Selection Based on Partitioned Maclaurin Symmetric Mean Operators Under Complex Intuitionistic Fuzzy Set Environment

引用

International Journal of Fuzzy Systems 2024年第5期26卷 1730-1748页

作者： Azam, Muhammad Jana, Chiranjibe Khan, Muhammad Sajjad Ali Pal, Madhumangal Xin, Qin Yang, Shilin Sarkar, Biswajit Faculty of Science Beijing University of Technology Beijing100022 China Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Midnapore721102 India Department of Mathematics Khushal Khan Khattak University Karak Khyber Pakhtunkhwa Karak27200 Pakistan Faculty of Science and Technology University of the Faroe Islands Tórshavn Faroe Islands Department of Industrial Engineering Yonsei University 50 Yonsei-ro Sinchon-dong Seodaemun-gu Seoul03722 Korea Republic of Center for Global Health Research Saveetha Medical College Saveetha Institute of Medical and Technical Sciences Saveetha University Tamil Nadu 600077 Chennai India Department of Industrial Engineering and Management National Taipei University of Technology Taipei City 106344 Taiwan Chennai602105 India

The theory of intuitionistic fuzzy sets (IFSs) plays an essential role to deal with uncertainty and ambiguity. However, the IFSs deal only with anticipation, not periodicity. But, complex IFSs (CIFS) can handle both uncertainties and periodicity at a time. Therefore, this paper focuses on a new multi-criteria decision making (MCDM) approach using Maclaurin symmetric mean (MSM) operator in connection with the CIFS setting. Then, we develop some CIF partitioned based MSM (CIFPMSM) operators and their weighted form by considering that all the criteria can be arranged into some groups. The proposed operators not only deal with the interrelationship among criteria but also deal with the partitioned relationship among criteria. We discuss the properties of these proposed operators and investigate their cases. Finally, a decision-making approach for radio frequency identification (RFID) for manufacturing companies is developed based on the proposed operators and compared the results with the existing method to show the application and feasibility of the proposed method. © The Author(s) under exclusive licence to Taiwan Fuzzy Systems Association 2024.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

A comparative analysis of load balancing algorithms applied to aweather forecast model

A comparative analysis of load balancing algorithms applied ...

引用

IEEE International Symposium on Computer Architecture and High Performance Computing

作者： Rodrigues, Eduardo R. Navaux, Philippe O. A. Panetta, Jairo Fazenda, Alvaro Mendes, Celso L. Kale, Laxmikant V. Institute of Informatics Federal University of Rio Grande do Sul Porto Alegre Brazil Center for Weather Forecast and Climate Studies INPE Cachoeira Paulista Brazil Science and Technology Department Federal University of Sao Paulo Sao Jose dos Campos Brazil Parallel Programming Laboratory University of Illinois at Urbana-Champaign Urbana United States

ISBN: (纸本)9780769542164

Among the many reasons for load imbalance in weather forecasting models, the dynamic imbalance caused by localized variations on the state of the atmosphere is the hardest one to handle. As an example, active thunderstorms may substantially increase load at a certain timestep with respect to previous timesteps in an unpredictable manner - after all, tracking storms is one of the reasons for running a weather forecasting model. In this paper, we present a comparative analysis of different load balancing algorithms to deal with this kind of load imbalance. We analyze the impact of these strategies on computation and communication and the effects caused by the frequency at which the load balancer is invoked on execution time. This is done with-out any code modification, employing the concept of processor virtualization, which basically means that the domain is over-decomposed and the unit of rebalance is a sub-domain. With this approach, we were able to reduce the execution time of a full, real-world weather model. © 2010 IEEE.

关键词： Weather forecasting

来源：评论

学校读者我要写书评

暂无评论

Improving performance of all-to-all communication through loop scheduling in PGAS environments 13

Improving performance of all-to-all communication through lo...

引用

27th ACM International Conference on Supercomputing, ICS 2013

作者： Alvanos, Michail Tanase, Gabriel Farreras, Montse Tiotto, Ettore Amaral, José Nelson Martorell, Xavier Programming Models Barcelona Supercomputer Center Barcelona Spain IBM TJ Watson Research Center Yorktown Heights NY United States Dep. of Computer Architecture Universitat Politècnica de Catalunya Barcelona Spain Static Compilation Technology IBM Toronto Laboratory Toronto ON Canada Dep. of Computing Science University of Alberta Edmonton AB Canada IBM Canada CAS Research Markham ON Canada

No abstract available.

ISBN: (纸本)9781450321303

No abstract available.

关键词： unified parallel c partitioned global address space performance evaluation one-sided communication

来源：评论

学校读者我要写书评

暂无评论

Performance Characterization of SPEC CPU2006 Benchmarks on Intel and AMD Platform

Performance Characterization of SPEC CPU2006 Benchmarks on I...

引用

International Workshop on Education technology and Computer science, ETCS

作者： Shengmei Li Buqi Cheng Xingyu Gao Lin Qiao Zhizhong Tang Department of Computer Science and Technology Tsinghua University Beijing China Programming Systems Laboratory Intel China Research Center Limited Beijing China Chinese Academy and Sciences Beijing China

For understanding the performance differences caused by different computer architectures and optimization technologies, the paper characterizes performance of SPEC CPU2006 benchmarks both on Intel and AMD platform. Using the performance events collected by Performance Monitor Unit, we compare their performance differences and analyze the causes from the features of architectures and the optimization technologies. Our results and analysis help the programmers better understand the memory performance and branch prediction performance which are caused by architectures and guide them in the optimization. The analysis also help the processor architects better balance among the key architecture factors such as memory disambiguation and hardware prefetch when doing architecture design decision.

关键词： Microarchitecture Decoding Educational technology Paper technology programming profession Performance analysis Computer science Computer architecture Hardware Prefetching

来源：评论

学校读者我要写书评

暂无评论

Communication acceleration of local gradient methods via an accelerated primal-dual algorithm with inexact prox 22

Communication acceleration of local gradient methods via an ...

引用

Proceedings of the 36th International Conference on Neural Information Processing Systems

作者： Abdurakhmon Sadiev Dmitry Kovalev Peter Richtárik King Abdullah University of Science and Technology Thuwal Saudi Arabia and Moscow Institute of Physics and Technology Dolgoprudny Russia and Institute for System Programming of the Russian Academy of Sciences Research Center for Trusted Artificial Intelligence Moscow Russia King Abdullah University of Science and Technology Thuwal Saudi Arabia

ISBN: (纸本)9781713871088

Inspired by a recent breakthrough of Mishchenko et al. [2022], who for the first time showed that local gradient steps can lead to provable communication acceleration, we propose an alternative algorithm which obtains the same communication acceleration as their method (ProxSkip). Our approach is very different, however: it is based on the celebrated method of Chambolle and Pock [2011], with several nontrivial modifications: i) we allow for an inexact computation of the prox operator of a certain smooth strongly convex function via a suitable gradient-based method (e.g., GD, Fast GD or FSFOM), ii) we perform a careful modification of the dual update step in order to retain linear convergence. Our general results offer the new state-of-the-art rates for the class of strongly convex-concave saddle-point problems with bilinear coupling characterized by the absence of smoothness in the dual function. When applied to federated learning, we obtain a theoretically better alternative to ProxSkip: our method requires fewer local steps (O(k1/3) or O(k1/4), compared to O(k1/2) of ProxSkip), and performs a deterministic number of local steps instead. Like ProxSkip, our method can be applied to optimization over a connected network, and we obtain theoretical improvements here as well.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Development of a visual programming tool called SmrAI for function testing to mitigate the shortage of programming personnel in the manufacturing

Computer Software

引用

Computer Software 2022年第4期39卷 61-74页

作者： Sugiyama, Ko-Ichiro Okuda, Satsuki Tanabe, Tsubasa Takao, Kouji Higashi, Hirohito Tanaka, Kazuaki Dept. of Information Engineering National Institute of Technology Matsue College Japan NIPPO Co. Ltd. Japan Ruby Programming Shounendan Japan Shimane IT Open-innovation Center Japan Faculty of Computer Science and Systems Engineering Kyushu Institute of Technology Japan

We have developed a visual programming tool called SmrAI for function testing, and investigated whether wrapping existing source code with Scratch Blocks is an effective means of mitigating the shortage of programming personnel in the manufacturing. SmrAI is based on Smalruby, which can convert Scratch Blocks into Ruby code. In addition, SmrAI introduces two new sets of Blocks that wrap existing Ruby libraries for function testing. Since existing tools and libraries were utilized, the cost of developing SmrAI was low, and there were no changes in the function testing procedure. We conducted a verification test using staff members who were familiar with the function testing process but had little or no programming experience, and confirmed that they were able to program using SmrAI and that they had confidence in its business applications. These results are expected to contribute to the diversification and increase of programming personnel responsible for function test programming. © 2022 Japan Society for Software science and technology. All rights reserved.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：