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

11th IEEE International Conference on Intelligent Systems, IS 2022

作者： Zapata, Francisco Smith, Eric Kosheleva, Olga Kreinovich, Vladik University of Texas at El Paso Department of Industrial Manufacturing and Systems Engineering El PasoTX79968 United States University of Texas at El Paso Department of Teacher Education El PasoTX79968 United States University of Texas at El Paso Department of Computer Science El PasoTX79968 United States

ISBN: (纸本)9781665456562

In the late 1990s, researchers analyzed what distinguishes great companies from simply good ones. They found several features that are typical for great companies. Interestingly, most of these features seem counter-intuitive. In this paper, we show, on the qualitative level, that from the algorithmic viewpoint, many of these features make perfect sense. Some of the resulting explanations are simple and straightforward, other explanations rely on complex not-well-publicized results from theoretical computer science. © 2022 IEEE.

关键词： algorithmics Good to great companies seemingly counter-intuitive ideas

来源：评论

学校读者我要写书评

暂无评论

Off to new shores: Preparing Primary School Teachers for Teaching algorithmics and Programming 18

Off to new shores: Preparing Primary School Teachers for Tea...

引用

13th Workshop in Primary and Secondary Computing Education (WiPSCE)

作者： Geldreich, Katharina Talbot, Mike Hubwieser, Peter Tech Univ Munich TUM Sch Educ Munich Germany

ISBN: (纸本)9781450365888

In many countries, the demands are getting louder to bring computer science education into primary schools. Curricula and teaching approaches are evolving and educators have to work their way into new topics. Many primary school teachers feel overstrained by these developments and the need for appropriate teacher training is rising. In this paper, we describe the structure and contents of an in-service professional development workshop for primary school teachers without any previous knowledge in computer science ( CS) as well as first results of the pilot run with 40 teachers. Throughout the three-day workshop, the teachers get the chance to follow the students' path of learning by taking a primary school programming course themselves, engage intensively with the underlying algorithmic concepts through in-depth exercises and work on their own ideas for implementations in the classroom.

关键词： Computer Science Education Primary School Teacher Training algorithmics Programming

来源：评论

学校读者我要写书评

暂无评论

algorithmics for Hard Problems [electronic Resource] : Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics

引用

2016年

作者： juraj hromkovič

algorithmics for Hard Problems [electronic Resource] : Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics by Hromkovič, Juraj; published by Berlin, Heidelberg : Springer Berlin H... 详细信息

关键词： [electronic algorithmics approximation, combinatorial computer communication networks computer science data transmission systems electronics heuristics telecommunication

来源：评论

学校读者我要写书评

暂无评论

Sorting genomes by prefix double-cut-and-joins

引用

THEORETICAL COMPUTER SCIENCE 2025年 1024卷

作者： Fertin, Guillaume Jean, Geraldine Labarre, Anthony Nantes Univ Ecole Cent Nantes CNRS LS2NUMR 6004 F-44000 Nantes France Univ Gustave Eiffel CNRS Lab Informat Gaspard Monge ENPCESIEE ParisUPEMLIGMUMR 8049 F-77454 Marne la Vallee France

In this paper, we study the problem of sorting unichromosomal linear genomes by prefix double- cut-and-joins (or DCJs) in both the signed and the unsigned settings. Prefix DCJs cut the leftmost segment of a genome and any other segment, and recombine the severed endpoints in one of two possible ways: one of these options corresponds to a prefix reversal, which reverses the order of elements between the two cuts (as well as their signs in the signed case). Our main results are: (1) new structural lower bounds based on the breakpoint graph for sorting by unsigned prefix reversals, unsigned prefix DCJs, and signed prefix DCJs;(2) two polynomial-time algorithms for sorting by prefix DCJs, both in the signed case (which answers an open question of Labarre [1]) and in the unsigned case;(3) a 1-absolute approximation algorithm for sorting by unsigned prefix reversals for a specific class of permutations.

关键词： Genome rearrangements Prefix reversals Prefix DCJs Lower bounds algorithmics Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Approaching the general quantification of functional information

引用

SCIENTIFIC REPORTS 2025年第1期15卷 1-13页

作者： Kudelic, Robert Univ Zagreb Fac Org & Informat Varazhdin Croatia

Information is everywhere, especially in the digital, artificial intelligence, and big data worlds we live in. In fact, information has always played a pivotal role;however, that role is, as the years of history accumulate, becoming even more significant. It is, therefore, a pursuit of scientific inquiry to quantify the functionality and semantics of information-this is also the goal of the article one reads. We have constructively and critically reviewed state-of-the-art approaches, presented challenges, and suggested a new approach that deals with the issues of information quantification. The developed approach represents a method for general quantification of functional information, including the total functional information of a system and the semantics revealed by functionality. Such a general method can potentially have significance far beyond the shores of information quantification, especially considering the importance of information in computer and information science, quantum physics, and chemistry. We have also made first steps of placing functional information in a computational complexity framework, which will potentially foster algorithmics around it, especially in terms of optimality or degeneracy, and possibly even in terms of work around classes of computational complexity.

关键词： Functional information Quantification Complex systems algorithmics

来源：评论

学校读者我要写书评

暂无评论

Proven Distributed Memory Parallelization of Particle Methods

引用

ACM TRANSACTIONS ON PARALLEL COMPUTING 2024年第4期11卷 1-45页

作者： Pahlke, Johannes Sbalzarini, Ivo f. Tech Univ Dresden Fac Comp Sci Dresden Germany Max Planck Inst Mol Cell Biol & Genet Ctr Syst Biol Dresden Dresden Germany

We provide a mathematically proven parallelization scheme for particle methods on distributed-memory computer systems. Particle methods are a versatile and widely used class of algorithms for computer simulations and numerical predictions in various applications, ranging from continuum fluid dynamics to discrete granular flows and molecular dynamics simulations. Particle methods naturally lend themselves to implementation on parallel computing systems. So far, however, a mathematical proof of correctness and equivalence to sequential implementations has only been available for shared-memory parallelism. Here, we leverage a formal definition of the algorithmic class of particle methods to provide a proven parallelization scheme for distributed-memory computers. We prove that thus parallelized particle methods on distributed-memory computers are formally equivalent to their sequential counterpart for a well-defined class of particle methods, and we provide analytical expressions for the speedup and scalability bounds of this class of algorithms in function of their parameters. The parallelization scheme analyzed here is the basis of many real-world software designs for parallel particle methods. The present analysis is, therefore, of direct relevance to existing and new parallel implementations of particle methods and places them on solid theoretical grounds, rationalizing best practices and providing useful scalability and speedup bounds for benchmarking.

关键词： Particle methods simulation algorithms formal definition algorithmics software engineering parallelization distributed memory meshfree methods scalability bounds

来源：评论

学校读者我要写书评

暂无评论

A Unifying Mathematical Definition of Particle Methods

IEEE OPEN JOURNAL OF THE COMPUTER SOCIETY

引用

IEEE OPEN JOURNAL OF THE COMPUTER SOCIETY 2023年第1期4卷 97-108页

作者： Pahlke, Johannes Sbalzarini, Ivo F. Tech Univ Dresden Fac Comp Sci D-01187 Dresden Germany Max Planck Inst Mol Cell Biol & Genet D-01307 Dresden Germany Ctr Syst Biol Dresden D-01307 Dresden Germany Tech Univ Dresden Cluster Excellence Phys Life D-01307 Dresden Germany Ctr Scalable Data Analyt & Artificial Intelligence D-01187 Dresden Germany

Particle methods are a widely used class of algorithms for computer simulation of complex phenomena in various fields, such as fluid dynamics, plasma physics, molecular chemistry, and granular flows, using diverse simulation methods, including Smoothed Particle Hydrodynamics (SPH), Particle-in-Cell (PIC) methods, Molecular Dynamics (MD), and Discrete Element Methods (DEM). Despite the increasing use of particle methods driven by improved computing performance, the relation between these algorithms remains formally unclear, and a unifying formal definition of particle methods is lacking. Here, we present a rigorous mathematical definition of particle methods and demonstrate its importance by applying it to various canonical and non-canonical algorithms, using it to prove a theorem about multi-core parallelizability, and designing a principled scientific computing software based on it. We anticipate that our formal definition will facilitate the solution of complex computational problems and the implementation of understandable and maintainable software frameworks for computer simulation.

关键词： algorithmics formal definition mesh-free methods particle methods simulation algorithms parallelization software engineering

来源：评论

学校读者我要写书评

暂无评论

Deciphering the Nature and Dynamics of Gig-Platform Jobs: Workers’ Hidden Precarity

引用

Social Change 2024年第3期54卷 367 - 384页

作者： Pal, Puja Kumar, Amit Govind Ballabh Pant Social Science Institute (A Constituent Institute of University of Allahabad) Jhusi Uttar Pradesh Prayagraj India CHRIST (Deemed to be University) Delhi-NCR India

The technology-driven gig-platform sector has emerged as a new source of employment generation both globally as well domestically. This recent transformation in the labour market is reshaping the nature of labour practices, labour relations, workers’ rights, and contracts. The sector has huge potential to generate millions of job opportunities by leveraging the use of digital technology. As this sector continues to generate more jobs, such jobs are portrayed as fostering economic growth, while creating ‘meaningful jobs,’ which are mutually beneficial to workers and employers in terms of providing ‘flexibility and freedom,’ ‘better earning opportunity,’ and ‘promoting social inclusion,’ by which it implies that women are increasingly equipped to find better jobs. This article critically examines the developmental roles of platform jobs which are being particularly highlighted within the policy circle, in academic literature, and tech companies through workers’ lens. It delves deeper into the discussion on those very aspects of platform jobs just listed, including the flexibility and freedom debate, workers’ income, and the gender aspect of jobs. In doing so, it carefully examines these aspects with respect to their implications on workers in terms of working conditions and regulatory aspects. The article brings out the workers’ precarity hidden within those developmental aspects of gig-platform jobs. © 2024 CSD.

关键词： algorithmics decent work digital workers flexibility and freedom Gig-platform jobs workers precarity

来源：评论

学校读者我要写书评

暂无评论

Mathematical Versus Computational Thinking with a Computer in the Background 7th

Mathematical Versus Computational Thinking with a Computer i...

引用

7th International Conference on Creative Mathematical Sciences Communication, CMSC 2024

作者： Syslo, Maciej M. Warsaw School of Computer Science Warsaw Poland

ISBN: (纸本)9783031732560

In this article, we focus on the use of mental tools of computational thinking (CT) to solve selected problems in school mathematics. We suggest how to expand and enrich some of the traditional school mathematics topics through the use of CT, and as a result, obtain solutions that use and are supported by the power of informatics as a discipline and computers as computational tools. We show how addressing the computational complexity of problems can help also with developing mathematical thinking (MT). Although the problems are mathematical in nature, they do not appear in teaching mathematics in Poland according to the actual core curriculum, but they do appear in selected informatics classes (All references to the core curriculum in this paper are to the National Core Curriculum approved by the Ministry of National Education of Poland in 2017/2018). In the first part of the work, we briefly refer to computational thinking, mathematical thinking and general problem-solving strategies. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： algorithmics Computational Thinking Mathematical thinking

来源：评论

学校读者我要写书评

暂无评论

On the generation of discrete figures with connectivity constraints

引用

RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS 2024年 58卷

作者： Tremblay, Hugo Vernay, Julien Univ Quebec Chicoutimi Dept Comp Sci & Math Chicoutimi PQ Canada Asobo Studio Bordeaux France

This paper addresses a generalization of polyominoes called (a, b)-connected discrete figures, where a and b represent the connectivity of the foreground (i.e. black pixels) and background (i.e. white pixels), respectively. Formally, a finite set of pixels P is (a, b)-connected if P is a-connected and P is b-connected. By adapting a combinatorial structure enumeration algorithm by J. L. Martin and employing breadth-first search ordering on the pixels of the figures, we sequentially generate all (a, b)-connected discrete figures up to size n = 18, utilizing minimal storage space. This paper presents an extended version of the research presented at the 2022 GASCom conference.

关键词： Combinatorics digital geometry polyominoes exhaustive generation algorithmics parallelization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：