Joost-pieter Katoen, Berry Schoenmakersb, Communicated M. Rem · 1993
Let P be a permutation defined on sequences of length N. A sequence of N values is said to be P-invariant when it does not change when permuted according to P. A program is said to recognize P-invariant segments when it determines for each segment of N successive input values whether it is P-invariant. In this paper we derive a program scheme that generates efficient parallel programs for the recognition of P-invariant segments. The programs consist of a chain of cells extended with a linear number of links between non-neighbouring cells. Under reasonable conditions on P. these programs correspond to systolic arrays with both constant response time and constant latency (independent of N). Efficient systolic arrays for problems such as palindrome recogni-tion or perfect shuffle recognition can be constructed automatically in this way. This is illustrated for the palindrome recognition problem.
Cited by 0
L.-E. Thorelli · 1994
A summary of research within the NUTEK supported project "Communicative Computer Systems" is presented. 1 Introduction We call computer systems able to accept data at a high rate, and react quickly to stimuli encoded in the incoming bit streams, communicative. Communicative computer systems (CCS) are needed as frontend subsystems in telecommunication applications, multimedia applications, and generally in advanced embedded systems. Important technical requirements on a CCS are: high i/o bandwidth, fast context switch, predictable (preferably constant) execution times. Modular structure, allowing a CCS to be configured to the needs of the application system, is also desirable. We envisage a CCS as a set of communicating processing elements organised in a structure thet reflects the parallelism, workload, and reliability requirements of the given application. Such a processing element should support lightweight processes (threads) efficiently. The programming model of a CCS must allow s...
Cited by 0
Bartłomiej Biegajło · Linguistics Beyond and Within (LingBaW) · 2019
The paper seeks to explore a practical application of Natural Semantic Metalanguage in defining two core concepts in computer programming, i.e. the concept of a variable and the concept of a constant. The investigation of both programming concepts is carried out with reference to Apple’s Swift programming language, which is now the dominant language in creating applications designed for Apple’s devices. The explications of a variable and a constant developed in this paper are tentative definitions of the most fundamental functionalities behind the two programming concepts. They are meant to ease the learning experience of programming enthusiasts who are at the early stages of their learning path.
Cited by 1Open access
Toshio Odanaka · Journal of Information and Optimization Sciences · 1982
We consider a generalization of perhaps tbe best known type of inventory problem, that in which orders are placed and received from time to time during the process. A simplified version of this problem leads to the famous Wilson lot-size formula. As is well known, this is a continuous time formulation in which the demand rate and optimal crder size are assumed constant. Most succeeding work which considered a time-varying demand rate bas used a discrete-time formulation. There have been many such words. In the book by Bensousan, a continuous time model with time-varying demand rate and impulse ordering is considered. We shall give graphical methods of dynamic programming for the model of Bensousan. In spite of the advent of the high speed computer, tbere are still good reasons for retaining a strong interest in graphical techniques.
Cited by 1
Moshe Deutsch, A. Notea, Dvora Pal · Applied Optics · 1989
We present a method for reconstructing the radial density profile of a cylindrically symmetric object from a single x-ray projection, when the profile consists of a number of different constant sections. A forward Abel transform based algorithm is employed whereby the profile is recovered recursively, onion peelinglike, starting from the outside diameter of the object and moving in. Distortions originating in the Gibbs phenomenon, unavoidable in most available Abel inversion methods, are completely eliminated. The method is simple enough to be carried out on a handheld calculator or a spreadsheet program on a personal computer, and no elaborate computer fits or application programming are required. The method is demonstrated by inverting a simulated three-section noisy set of data and is shown to yield results of a quality equal to that of a recent powerful Abel inversion method, based on full nonlinear least-squares computer fits.
Cited by 13
Mohammed Joghlaf, Yahya Ababou, Salaheddine Sayouri · Journal of Applied Mathematics and Physics · 2021
In this paper, a mathematical relation was found between interatomic Hooke’s force constant and both the bulk modulus and interatomic distance in solid crystals, considering that the forces which have effect on an atom are only those resulted from the neighboring atoms, and the forces are subject to Hooke’s law as the deflections of atoms from their equilibrium positions are very small. This work has been applied on some solid semiconducting crystals of diatomic primitive cell, including crystals of mono-atomic primitive cell automatically, by using linear statistical fitting with computer programming and, then, using mathematical analysis, proceeding from the vibrational dispersion relation of solid linear lattice, these two methods have been used in the process in order to support each other and for the result to be satisfying and reasonable. This is a contribution to the process of using computer programming in physics to facilitate mathematical analyses and obtain the required relations and functions by designing and developing appropriate computer programs in line with the macro and micro natures of materials. The importance of this is in enhancing our understanding of the interatomic actions in cells and of the crystal structure of materials in general and semiconductors in particular, as it is a step of the initial steps to facilitate the process of calculating energies and extracting mathematical relations between correlation energy and temperature as well as between sub-fusion and fusion energies with temperature.
Cited by 1Open access
Narasareddy Gari, Mourya Reddy · NDSU Repository (North Dakota State University) · 2019
All Computer Science majors are required to take introductory programming (CS1) as a fundamental course which has a high dropout rate. Researchers report that CS1 students lack motivation and need constant resource support. Motivated by these factors, we developed a cyberlearning environment embedded with learning engagement strategies such as Collaborative Learning, Social Interaction and Gamification. The purpose of research is to investigate the impact the cyberlearning environment had on student acquisition of programming concepts. I conducted a series of studies to empirically validate these learning engagement strategies in the context of student learning outcomes. The results of my dissertation have shown that Gamification and Social Interaction when combined or used individually had more positive impact on student learning when compared to that of other learning engagement strategies.
Cited by 0
Rafael Mellado, Claudio Cubillos · Journal of Computer Assisted Learning · 2024
Abstract Background Effective learning in computer programming courses has been a constant challenge for university teachers and has become a relevant competence for current professionals. The literature on gamification in learning presents mixed results, mainly due to problems in instructional design and inconsistency in gamification. Studies with positive empirical results on computer programming formative activities and showing under what conditions gamification is effective still need to be included. Objectives This study aimed to quantify the effects of gamification techniques in software tools that support computer programming learning applied to data‐structures university students. The study focused on determining whether there are differences in learning when using gamification techniques in online exercising formative activities. The effects of gamification on learning objectives with diverse complexity are studied. Methods The study was conducted on computer engineering university students following a pretest‐intervention‐posttest design. They were divided into control and experimental groups, where both used a bank of exercises in Moodle to support learning. The experimental group considered gamification techniques, including points, leaderboards, and badges. Results and Conclusions Gamification techniques significantly outperformed in learning gains in exercising activities without gamification. Regarding learning complexity, increasing taxonomic complexity did not negatively affect gamification learning effects.
Cited by 22Open access
Neil D. Jones · 1993
The constant speedup theorem, so well known from Turing machine based complexity theory, is shown false for a natural imperative programming language I that manipulates tree-structured data. This relieves a tension between general programming practice, where linear factors are essential, and complexity theory, where linear time changes are traditionally regarded as trivial. Specifically, there is a constant b such that for any a > 0 there is a set X recognizable in time a · b · n but not in time a · n. Thus LIN, the collection of all sets recognizable in linear time by deterministic I-programs, contains an infinite hierarchy ordered by constant coefficients. Constant hierarchies also exist for larger time bounds T (n), provided they are time-constructable. Second, a problem is exhibited which is complete for the nondeterministic linear time sets NLIN with respect to a natural notion of deterministic linear-time reduction. Third, Kleene’s Second Recursion Theorem in essence shows that for any program p defined with self-reference, there is an equivalent nonreflexive program q. This is proven for an extension I↑ of I. Further, q can be simulated by an I program at most constantly slower than p. Language I↑ allows calls to the language’s own interpretation function, and even to its running time function (without the usual high costs for nested levels of interpretation). The results all hold as well for a stronger language I allowing selective updating of tree-structured data. The results are robust in that classes LIN and NLIN are identical for I , Isu↑, Schonhage’s Storage Modification Machines, Knuth/Tarjan’s pointer machines, and successor RAMs [13,14,11]. where n is the size of the input. DIKU, Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen East, Denmark, E-mail: neil@diku.dk. If the “more realistic and precise measure” of SMM computation time is used [13], and similarly for the other models.
Cited by 31
Mohammad Mahdi Jahanara, Sajin Koroth, Igor Shinkar · arXiv (Cornell University) · 2020
Non-signaling strategies are a generalization of quantum strategies that have been studied in physics over the past three decades. Recently, they have found applications in theoretical computer science, including to proving inapproximability results for linear programming and to constructing protocols for delegating computation. A central tool for these applications is probabilistically checkable proof (PCPs) systems that are sound against non-signaling strategies. In this paper we show, assuming a certain geometrical hypothesis about noise robustness of non-signaling proofs (or, equivalently, about robustness to noise of solutions to the Sherali-Adams linear program), that a slight variant of the parallel repetition of the exponential-length constant-query PCP construction due to Arora et al. (JACM 1998) is sound against non-signaling strategies with constant locality. Our proof relies on the analysis of the linearity test and agreement test (also known as the direct product test) in the non-signaling setting.
Cited by 1Open access
Steffen Zschaler, Kelly Coate, Andrew Coles · Research Portal (King's College London) · 2015
Programming is widely acknowledged to be difficult to teach to 1 st -year computer-science undergraduates ( e.g., Williams et al 2013). At King’s College London, we are facing problems also experienced by others: Cohorts of newly starting students (up to 240 in our case) are extremely diverse in terms of prior knowledge and experience of programming (Pedroni et al 2009); Programming is a skill that is best learned through practice, requiring high levels of supervision and feedback, yet the size of new student cohorts is continually increasing while the supervision capacity remains near constant. At King’s, programming has been taught primarily across the first two terms of the first year of study. The provision has been structured in large weekly lectures, followed by lab sessions and small group tutorials. In addition, students were required to complete two large pieces of coursework in the second term, which required them to build a mid-sized piece of software on their own. Overall, the provision has followed a rather conventional format. One key problem of the approach seemed to be that the students did not get to practice programming enough through the year. As a result, some students tended to get lost very early in the year as their self-confidence decreased. Even when we organised a hackathon (a one-day programming competition), many students did not participate because they felt they weren’t “good enough at programming”. In order to address these concerns, we have now radically redesigned the non-lecture elements of the course, in particular in the second term. Two principles guide our changes: Students should engage in as much practical programming as possible during their time at King’s and should produce software in formats that can be used as evidence for employability; Students should benefit from tight feedback cycles for their programming work. In order to achieve this we have almost completely removed any individual programming tasks, replacing them with pair-programming in the labs (inspired by forms of agile software development, where programmers work in pairs rather than individually) and group work for the coursework. Discussions in small group tutorials have been replaced by Coder Dojos, where students collaboratively solve a programming problem: two students pair-program at the lectern computer with the entire class providing suggestions; after a short time, a new set of students takes over the computer. As a result we have been able to substantially increase time-on-task for practical programming. This is partly due to the fact that all programming tasks except for the Coder Dojos are now formally assessed, and the pairing of students also helps and motivates students to overcome the initial block when faced with a new problem, as also reported by Williams et al (2002). We are also seeing evidence of students learning from each other, implying that pair-programming and group work have also helped improve supervision and feedback cycles despite resource limitations. As part of a College-wide Changing Classrooms initiative at King’s, we are in the process of evaluating the impact of these changes, through observations, data on achievement and student feedback. This presentation will report the preliminary findings of this project.
Cited by 0Open access
Juan Francisco Muñoz Rosas, Pedro J. Fernández, E. Álvarez et al. · Scientia Iranica · 2020
The constant c4[n] is commonly used in the construction of control charts and the estimation of process capability indices, where n denotes the sample size. Assuming the Normal distribution the unbiased estimator of the population standard deviation is obtained by dividing the sample standard deviation by the constant c4[n]. An alternative expression for c4[n] is proposed, and the mathematical induction technique is used to prove its validity. Some desirable properties are described. First, the suggested expression provides the exact value of c4[n]. Second, it is not a recursive formula in the sense it does not depend on the previous sample size. Finally, the value of c4[n] can be directly computed for large sample sizes. Such properties suggest that the proposed expression may be a convenient solution in computer programming, and it has direct applications in statistical quality control.
Cited by 2Open access
Chen Liu, Chaoran Pang, Lin Wang et al. · 2024
Symbolic regression represents a critical challenge in computer science, aiming to derive accurate equations for given datasets. The classical symbolic regression algorithm, Neuro-Encoded Expression Programming (NEEP), mitigates the inherent issue of output volatility due to input perturbations caused by the discrete coding in previous evolutionary algorithms. It achieves this by converting discrete coding into continuous coding through neural networks. However, the NEEP model itself confronts two significant challenges. Firstly, it disregards the distance relationships among symbols during the mapping process, thus complicating the post-mapping search. Secondly, it neglects the issue of constant optimization, making the discovery of precise expressions challenging. Addressing these concerns, this study proposes an embedding module during pre-training to impart distance information to symbols, inspired by pre-training methodologies in Natural Language Processing (NLP). This enhancement expedites the search process. Furthermore, to tackle constant optimization challenges, this paper proposes a novel encoding approach to overcome the limitations of traditional placeholder methods that impede expressive capabilities. This new encoding facilitates constant optimization without disrupting the original equation. Experimental results substantiate a significant enhancement in the convergence of DICO-NEEP across various symbolic regression problems.
Cited by 0
Hongda Li, Bowen Dong · Journal of Physics Conference Series · 2023
Abstract A set of portable constant pulse current sources with STM32 as the control core is developed, which mainly involves the SCM control module, operational amplifier circuit module, pulse output module, power module, key module, and display module. Based on the traditional constant-current source circuit design, the real-time display control system is constructed by software programming optimization, which has the characteristics of portable and strong stability. By connecting the field effect tube and operational amplifier in series to form a feedback loop, the current output accuracy is improved and the stability of the current output is ensured. The experimental results show that after the op-amp circuit is introduced into the series feedback system, the front and rear order circuit can be more stable, and ensure the reference voltage is stable at the same time, through the duty cycle of PWM wave to adjust the current output, so that the constant current source output 0~2mA adjustable low-frequency stable current. At the same time, in terms of human-computer interaction, in addition to the use of buttons to adjust the current at both ends of the load, a small OLED display screen is used to display the current, voltage, and pulse frequency in real time. The experiment shows that the instrument has high stability and load adaptability, and has high practical value.
Cited by 2Open access
Robert E. Beasley · Apress eBooks · 2020
An assignment operation sets the value of a variable, constant, or other item in the code behind of a Page class. The assignment statement is so fundamental to computer programming that every procedural/imperative programming language requires such a statement—regardless of its syntax. The general syntax of an assignment statement in the C# programming language is
Cited by 1
Mohammad Mahdi Jahanara, Sajin Koroth, Igor Shinkar · arXiv (Cornell University) · 2020
Non-signaling strategies are a generalization of quantum strategies that have\nbeen studied in physics over the past three decades. Recently, they have found\napplications in theoretical computer science, including to proving\ninapproximability results for linear programming and to constructing protocols\nfor delegating computation. A central tool for these applications is\nprobabilistically checkable proof (PCPs) systems that are sound against\nnon-signaling strategies.\n In this paper we show, assuming a certain geometrical hypothesis about noise\nrobustness of non-signaling proofs (or, equivalently, about robustness to noise\nof solutions to the Sherali-Adams linear program), that a slight variant of the\nparallel repetition of the exponential-length constant-query PCP construction\ndue to Arora et al. (JACM 1998) is sound against non-signaling strategies with\nconstant locality.\n Our proof relies on the analysis of the linearity test and agreement test\n(also known as the direct product test) in the non-signaling setting.\n
Cited by 0Open access
Erika Fechová, Jozef Kmec · Applied Mechanics and Materials · 2014
This paper deals with evaluation of n strain hardening exponent and C material constant at various velocities of the strain rate according to EN 10002-1. Dependence of tensile stress on elongation is carried out at INSTRON shredder in digital form and it is directly introduced into MATLAB working environment. To determine these material parameters suitable material models (Krupkowsky model) and MATLAB programming pack, mainly its Curve Fitting toolbox, which provides the library of standard linear, nonlinear and nonparametric models (e.g. polynomial, rational, etc.), are used. At automobile crash tests kinetic energy conversion into energy of deformation (where it is necessary to know n , C ) is theoretically calculated at certain velocities so that the solid parts of the car body would be protected from damage. It would be the best to compare correctness of those calculations to the test carried out at a real model or by simulation created on the computer with necessary software equipment.
Cited by 3
Valéria Espíndola Lessa · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · 2018
This research is part of the thematic about the process of mathematical conceptualization mediated by computer programming. Thinking about the conceptual elaboration movement of Mathematics and about the use of technologies in the educational process is fundamental, considering the growing use of technological apparatuses in today's society and the possibilities it presents for education. From the theoretical reference of Gérard Vergnaud's Conceptual Field Theory, more precisely in concepts of situations, operative invariants and representations, and elements of Seymour Papert's Constructivist Theory, notably the model of the learning spiral proposed by José Armando Valente, the research sought to answer the following question: How are the processes of representation and understanding of the operative invariants of the Linear Functional Field of Experiments manifest in two students of the Technical Course in Informatics of the IFRS – Campus Erechim, based on a didactic strategy mediated by computer programming? For that, a qualitative research was carried out with theoretical study on the conceptual bases and empirical study with the students. In this direction, the Conceptual Field of Linear Functions was constituted, in the sense of delimiting the conceptual field of interest in the research, in which the main operative invariants associated to the situations were categorized: IO1 - variable, IO2 - rate of variation, IO3 - fixed rate and IO4 - one-to-one correspondence, which served as analysis categories. Also, a didactic strategy was created based on the use of computer programming and the contribution of the Theory of Learning Styles, in order to serve as a research tool and also as a contribution of the thesis to the didactic elaboration in the school. The empirical research data were produced by performing the situations on Linear Functions with the Scratch programming environment by two selected students, associated with the method of interactive observation. With this, it was possible to identify the operative and predicative forms of the operative invariants and to interpret the representations and understandings to then describe the associated theorems. As results, the research pointed to the extension of the concept of variable (IO1), providing more complex generalization processes and the possibility of concretization and dynamization of the concept of constant rate of variation (IO2). In addition, it allowed to show that the process of manifestation of the representation and understanding of the operative invariants of the Linear Functions Conceptual Field happened through actions of concretization, dynamization, comprehension and reformulation provided, respectively, by the stages of description, execution, reflection and debugging the spiral of conceptualization, based on a didactic strategy mediated by computer programming.
Cited by 0Open access
David Ittah, J.S. Fraser, Josh Izaac et al. · ArXiv.org · 2025
Continuous improvements in quantum computing hardware are exposing the need for simultaneous advances in software. Large-scale implementation of quantum algorithms requires rapid and automated compilation routines such as circuit synthesis and optimization. As systems move towards fault-tolerance, programming frameworks and compilers must also be capable of compiling and optimizing programs comprising both classical and quantum code. This work takes a step in that direction by providing an implementation of Shor's factoring algorithm, compiled to elementary quantum gates using PennyLane and Catalyst, a library for quantum just-in-time (QJIT) compilation of hybrid workflows. We demonstrate that with QJIT compilation, the algorithm is compiled once per bit width of $N$, the integer being factored, even when $N$-specific optimizations are applied to circuit generation based on values determined at runtime. The implementation is benchmarked up to 32-bit $N$, and both the size of the compiled program and the pure compilation time are found to be constant (under 3 seconds on a laptop computer), meaning code generation becomes tractable even for realistic problem sizes.
Cited by 0Open access
A. Sturniolo, Stefano Costanzi, G Barberá et al. · Nephrology Dialysis Transplantation · 1990
Four stable chronic haemodialysis patients were studied during two periods of 3 weeks: at first a 'standard' haemodialysis (S/HD) was used, followed by 'computer-modulated' haemodialysis (CM/HD). We used a monitor Hospal Monitral-S with Hospal DPM (Display Programmer Module) that allows the programming of 'weight loss rate' and 'dialysate osmolality'. During standard haemodialysis fluid was removed at a constant rate of 1 kg/h with constant sodium dialysate of 143 mmol/l. During computer-modulated haemodialysis the dialysate sodium concentration and the fluid removal of 4 kg per session was modulated by display programmer module.
Cited by 5