scholarly journals Reduction of programs execution time for tasks related to sequences or matrices

2020 ◽  
Vol 75 ◽  
pp. 04019
Author(s):  
Oleksandr Mitsa ◽  
Yurii Horoshko ◽  
Serhii Vapnichnyi
Keyword(s):  
Computer Science ◽  
Execution Time ◽  
Time Complexity ◽  
Matrix Multiplication ◽  
Matrix Form ◽  
The Third

The article discusses three approaches to reducing runtime of the programs, which are solutions of Olympiad tasks on computer science, related to sequences or matrices. The first approach is based on the representation of some sequences in matrix form and then the program of calculating the members of the sequence will have asymptotics equal to the time complexity of the exponentiation algorithm and will be O(log (n)). The second approach is to upgrade the known code to obtain significant reduction of the program runtime. This approach is very important to know for scientists who write code for scientific researches and are faced with matrix multiplication operations. The third approach is based on reducing time complexity by search for regularities; the author's task is presented and this approach is used to solve it.

ABOUT THE PROBLEM OF CLASSIFICATION OF THE CONCEPTS OF INFORMATICS STUDIED AT SECONDARY SCHOOL

2018 ◽  
pp. 4-7
Author(s):  
S. I. Zenko
Keyword(s):  
Secondary School ◽  
Foreign Language ◽  
Computer Science ◽  
Parts Of Speech ◽  
The Third ◽  
The Cross ◽  
Definition Of

The article raises the problem of classification of the concepts of computer science and informatics studied at secondary school. The efficiency of creation of techniques of training of pupils in these concepts depends on its solution. The author proposes to consider classifications of the concepts of school informatics from four positions: on the cross-subject basis, the content lines of the educational subject "Informatics", the logical and structural interrelations and interactions of the studied concepts, the etymology of foreign-language and translated words in the definition of the concepts of informatics. As a result of the first classification general and special concepts are allocated; the second classification — inter-content and intra-content concepts; the third classification — stable (steady), expanding, key and auxiliary concepts; the fourth classification — concepts-nouns, conceptsverbs, concepts-adjectives and concepts — combinations of parts of speech.

scholarly journals Computing the Atom Graph of a Graph and the Union Join Graph of a Hypergraph

Algorithms ◽  
2021 ◽  
Vol 14 (12) ◽  
pp. 347
Author(s):  
Anne Berry ◽  
Geneviève Simonet
Keyword(s):  
Real Number ◽  
Time Complexity ◽  
Matrix Multiplication ◽  
Efficient Algorithms ◽  
Join Graph ◽  
Current Value ◽  
Minimal Separator

The atom graph of a graph is a graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all possible atom trees of this graph. We provide two efficient algorithms for computing this atom graph, with a complexity in O(min(nωlogn,nm,n(n+m¯)) time, where n is the number of vertices of G, m is the number of its edges, m¯ is the number of edges of the complement of G, and ω, also denoted by α in the literature, is a real number, such that O(nω) is the best known time complexity for matrix multiplication, whose current value is 2,3728596. This time complexity is no more than the time complexity of computing the atoms in the general case. We extend our results to α-acyclic hypergraphs, which are hypergraphs having at least one join tree, a join tree of an hypergraph being defined by its hyperedges in the same way as an atom tree of a graph is defined by its atoms. We introduce the notion of union join graph, which is the union of all possible join trees; we apply our algorithms for atom graphs to efficiently compute union join graphs.

scholarly journals HILL CIPHER ON SHAMIR’S THREE PASS PROTOCOL

2017 ◽  
Author(s):  
hasdiana
Keyword(s):  
Matrix Element ◽  
Execution Time ◽  
Invertible Matrix ◽  
Multidisciplinary Research ◽  
The Third ◽  
Xor Operation ◽  
Hill Cipher ◽  
The Matrix ◽  
Level Of Difficulty ◽  
Time Required

This preprint has been presented in the 3rd International Conference on Multidisciplinary Research, Medan, october 16 – 18, 2014---In this study the authors use the scheme of Shamir's Three Pass Protocol for Hill Cipher operation. Scheme of Shamir's Three Pass Protocol is an attractive scheme that allows senders and receivers to communicate without the key exchange. Hill Cipher is chosen because of the key-shaped matrix, which is expected to complicate the various techniques of cryptanalyst. The results of this study indicate that the weakness of the scheme of Shamir's Three Pass Protocol for XOR operation is not fully valid if it is used for Hill Cipher operations. Cryptanalyst can utilize only the third ciphertext that invertible. Matrix transpose techniques in the ciphertext aims to difficulties in solving this algorithm. The original ciphertext generated in each process is different from the transmitted ciphertext. The level of difficulty increases due to the use of larger key matrix. The amount of time required for the execution of the program depends on the length of the plaintext and the value of the matrix element. Plaintext has the same length produce different execution time depending on the value of the key elements of the matrix used.

Science of Art and Analysis: A Mixture for Undergraduate Non-Specialists

1992 ◽  
Vol 267 ◽  
Author(s):  
W. Stanley Taft ◽  
James W. Mayer
Keyword(s):  
Physical Properties ◽  
Computer Science ◽  
Undergraduate Students ◽  
Analytical Methods ◽  
Art History ◽  
Analytical Techniques ◽  
Cornell University ◽  
The Third ◽  
Works Of Art ◽  
Modern Analytical

ABSTRACTAt Cornell University we are in the third year of teaching an interdisciplinary, undergraduate course on the physical properties and structures of works of Art, and the modern analytical methods used to investigate them: Art, Isotopes, and Analysis. The challenge is to explain concepts familiar to museum scientists and conservators to a group of 150 undergraduate students with a background that ranges from Art History to Computer Science. Painting techniques (Fresco, Tempera, Oil, etc.) are demonstrated to the class. The analytical techniques involve the interactions of electrons, photons, ions and neutrons with pigments and other materials. This instructional approach serves as an introduction to published analyses of works of art.

Elements of Experimental Computing

2019 ◽  
pp. 217-230
Author(s):  
Giuseppe Primiero
Keyword(s):  
Computer Science ◽  
Computational Experiment ◽  
Experimental Science ◽  
The Third

This Chapter starts by considering the third foundation: computing as an experimental science. It overviews the origin of the term, the early positions on experimental computer science and introduces two basic notions of computational hypothesis and computational experiment essential to the understanding of computing as an experimental discipline.

Human Programming

2016 ◽  
Author(s):  
Scott Selisker
Keyword(s):  
Cold War ◽  
Computer Science ◽  
Asian Americans ◽  
Post Cold War ◽  
The Third

The third chapter considers how technological ideas about “programming”—in cybernetics, computer science, and genetics—broadened the applications of automaton discourse and images. Such ideas were used to represent devalued forms of labor, Asian Americans, and post-Cold War fundamentalism.Selisker analyses the history and discorses that inform stereotypes such as hypertechnologicalorientals and new philosophical concepts like posthumanism.

scholarly journals Short-Term Load Forecasting in Smart Grids: An Intelligent Modular Approach

Energies ◽  
2019 ◽  
Vol 12 (1) ◽  
pp. 164 ◽  
Author(s):  
Ashfaq Ahmad ◽  
Nadeem Javaid ◽  
Abdul Mateen ◽  
Muhammad Awais ◽  
Zahoor Ali Khan
Keyword(s):  
Neural Network ◽  
Artificial Neural Network ◽  
Execution Time ◽  
Smart Grids ◽  
Load Forecasting ◽  
Forecast Accuracy ◽  
Forecasting Model ◽  
Exogenous Variables ◽  
Forecasting Models ◽  
The Third

Daily operations and planning in a smart grid require a day-ahead load forecasting of its customers. The accuracy of day-ahead load-forecasting models has a significant impact on many decisions such as scheduling of fuel purchases, system security assessment, economic scheduling of generating capacity, and planning for energy transactions. However, day-ahead load forecasting is a challenging task due to its dependence on external factors such as meteorological and exogenous variables. Furthermore, the existing day-ahead load-forecasting models enhance forecast accuracy by paying the cost of increased execution time. Aiming at improving the forecast accuracy while not paying the increased executions time cost, a hybrid artificial neural network-based day-ahead load-forecasting model for smart grids is proposed in this paper. The proposed forecasting model comprises three modules: (i) a pre-processing module; (ii) a forecast module; and (iii) an optimization module. In the first module, correlated lagged load data along with influential meteorological and exogenous variables are fed as inputs to a feature selection technique which removes irrelevant and/or redundant samples from the inputs. In the second module, a sigmoid function (activation) and a multivariate auto regressive algorithm (training) in the artificial neural network are used. The third module uses a heuristics-based optimization technique to minimize the forecast error. In the third module, our modified version of an enhanced differential evolution algorithm is used. The proposed method is validated via simulations where it is tested on the datasets of DAYTOWN (Ohio, USA) and EKPC (Kentucky, USA). In comparison to two existing day-ahead load-forecasting models, results show improved performance of the proposed model in terms of accuracy, execution time, and scalability.

scholarly journals On a New Formula for Fibonacci’s Family m-step Numbers and Some Applications

Mathematics ◽  
2019 ◽  
Vol 7 (9) ◽  
pp. 805 ◽  
Author(s):  
Monther Rashed Alfuraidan ◽  
Ibrahim Nabeel Joudah
Keyword(s):  
Number Theory ◽  
Time Complexity ◽  
Matrix Multiplication ◽  
Square Roots ◽  
Computational Number Theory ◽  
The Matrix ◽  
Theory Application ◽  
Constant Coefficients ◽  
New Formula

In this work, we obtain a new formula for Fibonacci’s family m-step sequences. We use our formula to find the nth term with less time complexity than the matrix multiplication method. Then, we extend our results for all linear homogeneous recurrence m-step relations with constant coefficients by using the last few terms of its corresponding Fibonacci’s family m-step sequence. As a computational number theory application, we develop a method to estimate the square roots.

Trends in temporal representation and reasoning

1996 ◽  
Vol 11 (3) ◽  
pp. 281-288 ◽  
Author(s):  
Luca Chittaro ◽  
Angelo Montanari
Keyword(s):  
Computer Science ◽  
Knowledge Based Systems ◽  
Logical Foundations ◽  
The Third ◽  
Knowledge Based ◽  
Temporal Representation ◽  
Key West ◽  
Research Areas ◽  
Meaningful Connections ◽  
Or Applications

Time is one of the most relevant topics in AI. It plays a major role in several of AI research areas, ranging from logical foundations to applications of knowledge-based systems. Despite the ubiquity of time in AI, researchers tend to specialise and focus on time in particular contexts or applications, overlooking meaningful connections between different areas. In an attempt to promote crossfertilisation and reduce isolation, the Temporal Representation and Reasoning (TIME) workshop series was started in 1994. The third edition of the workshop was held on May 19–20 1996 in Key West, FL, with S. D. Goodwin and H. J. Hamilton as General Chairs, and L. Chittaro and A. Montanari as Program Chairs. A particular emphasis was given to the foundational aspects of temporal representation and reasoning through an investigation of the relationships between different approaches to temporal issues in AI, computer science and logic.

Sign in / Sign up

Export Citation Format

Share Document