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

Teaching Fundamentals Concepts of Informatics 1

学校读者我要写书评

暂无评论

丛书名： Lecture Notes in Computer Science

1000年

作者： Juraj Hromkovič Richard Královič Jan Vahrenhold

ISBN: (数字)9783642113765

ISBN: (纸本)9783642113758

The International Conference on Informatics in Secondary Schools: Evolution and Perspective (ISSEP) is an emerging forum for researchers and practitioners in the area of computer science education with a focus on secondary schools. The ISSEP series started in 2005 in Klagenfurt, and continued in 2006 in Vilnius, and in 2008 in Torun. ´ The 4th ISSEP took part in Zurich. This volume presents 4 of the 5 invited talks and 14 regular contributions chosen from 32 submissions to ISSEP 2010. The ISSEP conference series is devoted to all aspects of computer science teaching. In the preface of the proceedings of ISSEP 2006, Roland Mittermeir wrote: “ISSEP aims at educating ‘informatics proper’ by showing the beauty of the discipline, hoping to create interest in a later professional career in c- puting, and it will give answers di?erent from the opinion of those who used to familiarize pupils with the basics of ICT in order to achieve computer lit- acy for the young generation. ” This is an important message at this time, when several countries have reduced teaching informatics to educating about current softwarepackagesthatchangefromyeartoyear. ThegoalofISSEPistosupport teaching of the basic concepts and methods of informatics, thereby making it a subject in secondary schools that is comparable in depth and requirements with mathematics or natural sciences. As we tried to present in our book “Algori- mic Adventures.

关键词： Computers and Education Science Education The Computing Profession Computers and Society Mathematics Education Learning & Instruction

Limited-Memory Matrix Adaptation for Large Scale Black-box Optimization

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Loshchilov, Ilya Glasmachers, Tobias Beyer, Hans-Georg Research Group on Machine Learning for Automated Algorithm Design University of Freiburg Germany Institut für Neuroinformatik Ruhr-Universität Bochum Germany Research Center Process and Product Engineering Vorarlberg University of Applied Sciences Dornbirn Austria

The Covariance Matrix Adaptation Evolution Strategy (CMA-ES) is a popular method to deal with nonconvex and/or stochastic optimization problems when the gradient information is not available. Being based on the CMA-ES, the recently proposed Matrix Adaptation Evolution Strategy (MA-ES) provides a rather surprising result that the covariance matrix and all associated operations (e.g., potentially unstable eigendecomposition) can be replaced in the CMA-ES by a updated transformation matrix without any loss of performance. In order to further simplify MA-ES and reduce its O(n2) time and storage complexity to O(nlog(n)), we present the Limited-Memory Matrix Adaptation Evolution Strategy (LM-MA-ES) for efficient zeroth order large-scale optimization. The algorithm demonstrates state-of-the-art performance on a set of established large-scale benchmarks. We explore the algorithm on the problem of generating adversarial inputs for a (non-smooth) random forest classifier, demonstrating a surprising vulnerability of the classifier. Copyright © 2017, The Authors. All rights reserved.

关键词： Covariance matrix

A Framework for Change Management in Business Process Modeling

学校读者我要写书评

暂无评论

A Framework for Change Management in Business Process Modeli...

2012 International Conference on Network and Computer Science(ICNCS 2012)

作者： Maryam Yarmohammadi Ali Moeini Majid Moradi Members of Young Researchers Club Department of Information ManagementScience and Research BranchIslamic Azad UniversityTehranIran Department of Algorithm and Computation Faculty of EngineeringUniversity of Tehran ICT Group E-Learning CenterIran University of Science and Technology

With the growing competition in the markets,the business processes of an organization must make necessary adjustments according to the new *** other words,Changes in business processes as a key component of any organization,along with the success of the organization and aligned with the business environment and customer needs,seems *** is important is the ability to change and verify the accuracy of the process,before it is *** this research,we propose a framework for applying the changes and verify these,based on the business process methodology and the integration between UML2.0 activity diagram as a standard technique for business processes modeling and colored petri net as an executable model.

关键词： change management in business process modeling,UML2.0 activity diagram,colored petri net

Ripple Analysis and Reduction of a Dual-PM Direct-Drive Machine by a Harmonic Current Injection Approach

学校读者我要写书评

暂无评论

Ripple Analysis and Reduction of a Dual-PM Direct-Drive Mach...

International Conference on Electrical Machines and Systems (ICEMS)

作者： Yue Ma Shuangxia Niu Weinong Fu Jiaqi Fei Jiahui Huang Electrical and Electronics Engineering The Hong Kong Polytechnic University Hongkong China Computer Science and Control Engineering Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China Han’s Robot Algorithm Team Han’s Laser Smart Equipment Group Co Ltd Shenzhen China

The Dual permanent magnet machine (DPMM) possesses the characteristics of high torque and low speed which is suitable for direct-drive equipment. Because of the low magnetic reluctance of this motor, the torque is very sensitive to dimensional fluctuations. As a synchronous motor, it also suffers from noise and vibration caused by torque ripple. This research analyzes the torque ripple in several different scenarios under the same DPMM electromagnetic design and finds a predictable influence of mechanical tolerances on torque ripple. In order to reduce the torque ripples, this paper proposes a harmonic current injection (HCI) method. A DPMM with a split-tooth structure is simulated and tested in this paper to demonstrate the analysis of torque fluctuations and the effectiveness of HCI.

关键词：

Indexing factors in DNA/RNA sequences

学校读者我要写书评

暂无评论

Communications in Computer and Information Science 2008年 13卷 436-445页

作者： Flouri, Tomàš Iliopoulos, Costas Sohel Rahman, M. Vagner, Ladislav Voràček, Michal Department of Computer Science and Engineering Czech Technical University in Prague Czech Republic Algorithm Design Group Department of Computer Science King's College London Strand London WC2R 2LS United Kingdom Department of CSE BUET Dhaka-1000 Bangladesh

ISBN: (纸本)9783540705987

In this paper, we present the Truncated Generalized Suffix Automaton (TGSA) and present an efficient on-line algorithm for its construction. TGSA is a novel type of finite automaton suitable for indexing DNA and RNA sequences, where the text is degenerate i.e. contains sets of characters. TGSA indexes the so called k-factors, the factors of the degenerate text with length not exceeding a given constant k. The presented algorithm works in O(n2) time, where n is the length of the input DNA/RNA sequence. The resulting TGSA has at most linear number of states with respect to the length of the text. TGSA enables us to find the list occ (u) of all occurrences of a given pattern u in degenerate text x in time {pipe}u{pipe} + {pipe}occ (u){pipe}. © Springer-Verlag Berlin Heidelberg 2008.

关键词： DNA

Quantum-Inspired Fluid Simulation of 2D Turbulence with GPU Acceleration

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Hölscher, Leonhard Rao, Pooja Müller, Lukas Klepsch, Johannes Luckow, Andre Stollenwerk, Tobias Wilhelm, Frank K. BMW Group Munich Germany Theoretical Physics Saarland University Saarbrücken66123 Germany Forschungszentrum Jülich Jülich52425 Germany Quantum Algorithm Engineering NVIDIA Santa ClaraCA United States Ludwigs Maximilian University Munich Munich Germany

Tensor network algorithms can efficiently simulate complex quantum many-body systems by utilizing knowledge of their structure and entanglement. These methodologies have been adapted recently for solving the Navier-Stokes equations, which describe a spectrum of fluid phenomena, from the aerodynamics of vehicles to weather patterns. Within this quantum-inspired paradigm, velocity is encoded as matrix product states (MPS), effectively harnessing the analogy between interscale correlations of fluid dynamics and entanglement in quantum many-body physics. This particular tensor structure is also called quantics tensor train (QTT). By utilizing NVIDIA's cuQuantum library to perform parallel tensor computations on GPUs, our adaptation speeds up simulations by up to 12.1 times. This allows us to study the algorithm in terms of its applicability, scalability, and performance. By simulating two qualitatively different but commonly encountered 2D flow problems at high Reynolds numbers up to 1 × 107using a fourth-order time stepping scheme, we find that the algorithm has a potential advantage over direct numerical simulations in the turbulent regime as the requirements for grid resolution increase drastically. In addition, we derive the scaling χ = O(poly(1/ϵ)) for the maximum bond dimension χ of MPS representing turbulent flow fields, with an error ϵ, based on the spectral distribution of turbulent kinetic energy. Our findings motivate further exploration of related quantum algorithms and other tensor network methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Tensors

Single-Peaked Opinion Updates

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Bredereck, Robert George, Anne-Marie Israel, Jonas Kellerhals, Leon Algorithm Engineering Humboldt-Universität Berlin Germany Institut für Informatik TU Clausthal Germany Analytical Solutions and Reasoning University of Oslo Germany Research Group Efficient Algorithms Technische Universität Berlin Germany Algorithmics and Computational Complexity Technische Universität Berlin Germany

We consider opinion diffusion for undirected networks with sequential updates when the opinions of the agents are single-peaked preference rankings. Our starting point is the study of preserving single-peakedness. We identify voting rules that, when given a single-peaked profile, output at least one ranking that is single peaked w.r.t. a single-peaked axis of the input. For such voting rules we show convergence to a stable state of the diffusion process that uses the voting rule as the agents’ update rule. Further, we establish an efficient algorithm that maximises the spread of extreme opinions. Copyright © 2022, The Authors. All rights reserved.

关键词： Machine learning

Anisotropy Correction of Medical Image Data Employing Patch Similarity

学校读者我要写书评

暂无评论

Anisotropy Correction of Medical Image Data Employing Patch ...

IEEE International Symposium on Computer-Based Medical Systems

作者： Mohammad H. Keyhani Wissam El Hakimi Stefan Wesarg TU Darmstadt Algorithm Engineering Hochschulstrasse 10 64289 Darmstadt Germany TU Darmstadt Interact. Graph. Syst. Group Fraunhoferstr. 5 64283 Darmstadt Germany Fraunhofer IGD Cogn. Comp. & Med. Imaging Fraunhoferstr. 5 64283 Darmstadt Germany

ISBN: (纸本)9781479910526

CT or MR image data is typically anisotropic. But, it is desirable to base image processing as well as diagnosis on isotropic image data. In this work, we propose a novel method for correcting anisotropy of 3D image data sets by employing the recurrence of small 2D patches across different scales. We base our method on previous work dealing with super-resolution of single natural 2D images, show the applicability of that approach also to medical images, and extend it to a 3D solution for anisotropy correction. Our results show that the image quality can be significantly improved. For clinical CT and MRI data, we present feedback from the clinical end user.

关键词： Correction Medical Image

Parameterized Saga of First-Fit and Last-Fit Coloring

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Agrawal, Akanksha Lokshtanov, Daniel Panolan, Fahad Saurabh, Saket Verma, Shaily Department of Computer Science and Engineering Indian Institute of Technology Madras India Department of Computer Science University of California Santa Barbara United States School of Computing University of Leeds United Kingdom Theoretical Computer Science The Institute of Mathematical Sciences HBNI India Department of Informatics University of Bergen Norway Algorithm Engineering Group Hasso Plattner Institute Germany

The classic greedy coloring (first-fit) algorithm considers the vertices of an input graph G in a given order and assigns the first available color to each vertex v in G. In the Grundy Coloring problem, the task is to find an ordering of the vertices that will force the greedy algorithm to use as many colors as possible. In the Partial Grundy Coloring, the task is also to color the graph using as many colors as possible. This time, however, we may select both the ordering in which the vertices are considered and which color to assign the vertex. The only constraint is that the color assigned to a vertex v is a color previously used for another vertex if such a color is available. Partial Grundy coloring of a graph corresponds to the vertex coloring produced by the greedy coloring heuristics called last-fit coloring, which assigns the last available color to each vertex in the given order. Whether Grundy Coloring and Partial Grundy Coloring admit fixed-parameter tractable (FPT) algorithms, algorithms with running time f(k)nO(1), where k is the number of colors, was posed as an open problem by Zaker and by Effantin et al., respectively. Recently, Aboulker et al. (STACS 2020 and algorithmica 2022) resolved the question for Grundy Coloring in the negative by showing that the problem is W[1]-hard. For Partial Grundy Coloring, they obtain an FPT algorithm on graphs that do not contain Ki,j as a subgraph (a.k.a. Ki,j-free graphs). Aboulker et al. re-iterate the question of whether there exists an FPT algorithm for Partial Grundy Coloring on general graphs and also asks whether Grundy Coloring admits an FPT algorithm on Ki,j-free graphs. We give FPT algorithms for Partial Grundy Coloring on general graphs and for Grundy Coloring on Ki,j-free graphs, resolving both the questions in the affirmative. We believe that our new structural theorems for partial Grundy coloring and "representative-family" like sets for Ki,j-free graphs that we use in obtaining our results may have wi

关键词： Graph algorithms