DEADLOCK ALGORITHM FOR ADVANCED SYNTACTICAL ANALYSIS AND ITS APPLICATION TO PROGRAMMING LANGUAGES FOR QUANTUM COMPUTERS

When developing promising programming languages designed to support the work of supercomputers, including quantum ones, there is a need for research related to testing the developed language under conditions when parsers do not yet exist for it. In particular, in the process of developing a programming language for a quantum computer, it becomes necessary to parse a certain program written in a new programming language, which, like all programming languages, belongs to the class of context-free languages (cf-languages). The problem of syntactical analysis of the monomials of cf-languages was posed in the 50-60s of the last century, however, there are some discrepancies in its formulation, and therefore there is a need to clarify the formulation of this problem. In this regard, we will call the expanded problem of parsing the problem of developing a stupid (non-stop, irrevocable) algorithm that allows establishing whether a given monomial can be deduced using a system of products that form a cf-language grammar, and also find all the conclusions of this monomial at once if the latter exists. The description of the monomial inference is understood as follows: it is necessary to determine for which products from the grammar of the cf-language, how many times and in what order they are used to derive this monomial, which is equivalent to constructing all the output trees. The article has developed a deadlockless algorithm for solving the extended problem of parsing, based on the method of hierarchy of marked brackets. The marked brackets order shows what products they are assigned to, and allows you to trace the order of its use. The algorithm uses the method of successive approximations to solve the Chomsky-Schützenberger system of equations associated with the cf-language grammar. The developed algorithm has a simple software implementation; an assessment of the complexity of the algorithm is also given.

Simulations for Supporting and Assessing Science Literacy

Simulations have become core supports for learning in the digital age. For example, economists, mathematicians, and scientists employ simulations to model complex phenomena. Learners, too, are increasingly able to take advantage of simulations to understand complex systems. Simulations can display phenomena that are too large or small, fast or slow, or dangerous for direct classroom investigations. The affordances of simulations extend students' opportunities to engage in deep, extended problem solving. National and international studies are providing evidence that technologies are enriching curricula, tailoring learning environments, embedding assessment, and providing tools to connect students, teachers, and experts locally and globally. This chapter describes a portfolio of research and development that has examined and documented the roles that simulations can play in assessing and promoting learning, and has developed and validated sets of simulation-based assessments and instructional supplements designed for formative and summative assessment and customized instruction.

Consumer Management in Internet Age: A Study of Indian Car Buyers Digital Communication Adoption by Applying Competing Models

Consumer management has always been a challenging task for marketers. The task becomes even more challenging in internet age witnessing proliferation of emerging marketing practices with each passing year. Digital marketing communication has emerged as the most preferred communication alternative in recent years. Consumer have adopted digital communication in their buying decision process for number of product categories, still the adoption has not been studied adequately for products lying in extended problem solving category. This study compares the most popular technology adoption models to predict the intentions of Indian car buyers to use digital communication while making a car buying decision to better under the consumer management. Primary data was obtained from 801 car buyers consisting of both actual and potential buyers from Delhi. Structural equation modeling was used to evaluate and compare the models in terms of overall fit, explanatory power and significance. The results of the study revealed that Decomposed Theory of Planned Behaviour in explaining the digital communication adoption which could be used by the marketers for better consumer management.

Implementation and Results of a New Problem Solving Approach in Physics Teaching

Teaching problem solving is one of the most important topics of physics education while students have big troubles with physics problem solving. The aim of this research is to investigate the impact of extended problem-solving strategy instruction on the development of pre-service science teacher’s problem-solving, critical thinking, metacognitive awareness, and logical reasoning skills. Extended Problem-Solving Strategy has been developed for university physics courses by researcher. This strategy has importantance in terms of covering many previous strategies in physics education literature and including many new steps. The model of the research consisted of an experimental design with pre-test and post-test control groups. Pre-services randomly assigned to the experimental (N=30) and control groups (N=30). The results of the research indicate that the post scores of the experimental group students significantly higher than control group students after the implementations in terms of metacognitive awareness, critical thinking, problem solving and logical thinking skills.This research revealed the positive effects of the “Extended Problem-Solving Strategy” implementation in the physics course at the university level on the skills which are listed among the 21st Century skills and each of these skills affects the other skills positively

An extended Chinese remainder system

Chinese remainder theorem is a widely-known result in number theory proven by Euler, according to Wikipedia. The proof actually yields an efficient method to solve a modular system with pair-wise coprime moduli. With a little improvement, we are able to extend the method to non-coprime moduli (by using lcm, gcd to manipulate each pair of moduli). Now, to add more flavor to this well-studied problem, we extend each modular congruence to a multi-choice one. With the system consisting of multi-choice congruence like this, how efficient can your algorithm solve it? We show that if one has ever loved reading Prasolov's books including geometry, number, discere maths, then one can move on reading several words below to deduce that this extended problem is not an easy one.

Flow shop scheduling with low carbon emission and variable machining parameters

Synergistic improvement on low carbon manufacturing is not taken full consideration in flow shop scheduling in literatures. To fill the gap, this article extends a flow shop scheduling problem by considering low carbon emission and variable machining parameters. The difference between the extended scheduling problem and the traditional one is that the former investigates the comprehensive effects of machine and scheduling levels on production throughput and environmental impact. A mathematical model of the extended problem is formulated to find the Pareto frontier, which is the set of scheduling solutions that are all Pareto efficient. Moreover, two problem-specific scheduling methods are presented and their effects on the considered problem are proved. A novel multi-objective heuristic is developed to deal with the extended problem because it is a non-deterministic polynomial acceptable problem. An actual case is studied to demonstrate the feasibility and applicability of the proposed extended problem and two scheduling methods. These finds can be employed in manufacturing execution systems and do not require additional cost.

Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs

We introduce and study the rescheduling on a single machine to minimize the maximum lateness under the sequence disruptions of original jobs. In the problem, each original job [Formula: see text] has a constraint disruption on its sequence respect to an original optimal schedule [Formula: see text], i.e., [Formula: see text]. That is, if [Formula: see text] is the [Formula: see text]th job in [Formula: see text], then it is required that the position index [Formula: see text] of [Formula: see text] in a schedule for all jobs satisfies [Formula: see text]. By introducing the positive sequence disruption [Formula: see text] and the negative sequence disruption [Formula: see text], three problems are considered in this paper: problem (P1) is [Formula: see text], problem (P2) is [Formula: see text], and problem (P3) is [Formula: see text]. We show that the three problems are equivalent and can be solved in [Formula: see text] time. Then we study an extension of problem (P2): [Formula: see text]. We show that the extended problem can be solved in [Formula: see text] time.

Hidden Symmetry in a Kuramoto–Sivashinsky Initial-Boundary Value Problem

We investigate the bifurcation structure of the Kuramoto–Sivashinsky equation with homogeneous Dirichlet boundary conditions. Using hidden symmetry principles, based on an extended problem with periodic boundary conditions and [Formula: see text] symmetry, we show that the zero solution exhibits two kinds of pitchfork bifurcations: one that breaks the reflection symmetry of the system with Dirichlet boundary conditions and one that breaks a shift-reflect symmetry of the extended system. Using Lyapunov–Schmidt reduction, we show both to be supercritical. We extend the primary branches by means of numerical continuation, and show that they lose stability in pitchfork, transcritical or Hopf bifurcations. Tracking the corresponding secondary branches reveals an interval of the viscosity parameter in which up to four stable equilibria and time-periodic solutions coexist. Since the study of the extended problem is indispensable for the explanation of the bifurcation structure, the Kuramoto–Sivashinsky problem with Dirichlet boundary conditions provides an elegant manifestation of hidden symmetry.