Increase In Time Cost Research Articles

A compression method of educational material for special disciplines of technical University

The article is devoted to the development of a compression method of the educational material for special disciplines of the technical University. The urgency of solving the problem of compression of the educational material, as well as compression of the information in general, is due to the world trends in the development of science and technology, as well as the requirements that modern educational standards impose on the programs disciplines of higher professional education. A review of the works of other authors, in which the problem of compression of educational material has been investigated, is made in the article. The need for new pedagogical developments, practically oriented directly to professional disciplines, was noted. The possibility of compressing the teaching material of a special discipline is ensured by the commonality of the questions studied, as well as the using the same mathematical apparatus, approaches and methods in determining the main relations. The practical orientation of the subject and the readiness of the audience in the natural sciences and general technical disciplines also matter. This is revealed on the basis of the analysis of modern pedagogical technologies and methods of knowledge engineering, as well as special discipline features. The compression method of an educational material, which uses several pedagogical technologies, is developed. The construction of educational process on a large-block basis, the construction of educational process advanced basis, methodical and didactical reconstruction of educational material are used. Deductive and inductive ways of presentation of educational material are also used. Compression is achieved when structuring the educational material of the discipline. Separate sections of the discipline are combined into semantic groups and read in parallel without possible repetitions. The principle of parallel presentation of the material forms the basis of the concept of the developed method of compression. This principle makes it possible to implement an “open architecture” of the method: there is the possibility of prompt correction or expansion of the content of discipline without significant increase in time costs for the presentation. An interpretation of the proposed method as the procedure of graphs theory is given. The structure of the discipline is modeled as a directed weighted graph (the graph of discipline) with the separation of bipartite subgraphs. The educational elements are represented as vertices of the graph. The rib of the graph models the means of the mathematical apparatus, which establishes the connection between the vertices. The vertices weight is detected as a time spent on the explanation of element contents. The rib weight is detected as a time that spent on the explanation of connection between such vertices. Non-adjacent vertices form a bipartite subgraph of educational elements from one semantic group. The properties of adjacency matrix for the graph of discipline were defined in the article. There was proposed the algorithm of the forming graph of discipline with minimum of weight which contains the bipartite subgraphs – semantic groups of elements. Examples of the implementation of the compression method, confirming its universality are given. The bipartite subgraphs of disciplines are constructed for separate sections of disciplines “Building Mechanics”, “Theoretical Foundations of the Finite Element Method” and “Design of Flying Machines”, the principle of the “open architecture” of the method is shown. The testing of the developed method for compliance with the requirements for modern pedagogical technology was conducted. It is shown that the logic of the implementation of the compression method corresponds to the subject logic of the special discipline of the higher technical educational institution, as well as to the logic of mastering the learning material by the students.

Motivational intensity modulates the effects of positive emotions on set shifting after controlling physiological arousal

Recent research on the construct of emotion suggests the integration of a motivational dimension into the traditional two-dimension (subjective valence and physiological arousal) model. The motivational intensity of an emotional state should be taken into account while investigating the emotion-cognition relationship. This study examined how positive emotional states varying in motivational intensity influenced set shifting, after controlling the potential confounding impacts of physiological arousal. In Experiment 1, 155 volunteers performed a set-shifting task after being randomly assigned to five states: high- vs. low-motivating positive affect (interest vs. serenity), high- vs. low-motivating negative affect (disgust vs. anxiety), and neutral state. Eighty-five volunteers participated in Experiment 2, which further examined the effects of higher vs. lower degree of interest. Both experiments measured and compared participants' physiological arousal (blood pressure and pulse rate) under the normal and experimental conditions as the covariate. Results showed no difference in switching performance between the neutral and serenity groups. As compared with the neutral state, the high-motivating positive affect significantly increased set-switching reaction time costs, but reduced error rate costs; the higher the motivational intensity, the greater the time-costs impairment. This indicates a role of the high-motivating positive affect in regulating the balance between the flexible and stable cognitive control. Motivational intensity also modulated the effects of negative emotional states, i.e., disgust caused a larger increase in time costs than anxiety. Further exploration into neurobiological mechanisms that may mediate the emotional effects on set shifting is warranted.

A numerical method applied to forced and natural convection flows over arbitrary geometry

In this study, a numerical method based on Cartesian mesh method and gridless approach applied to forced and natural convection flows over arbitrary geometry is proposed. In the proposed method, a preconditioning method developed by the authors has been coupled with the building-cube method, owing to its simplicity and efficiency in mesh generation, implementation of solution algorithm, and post-processing. A gridless approach is further introduced as a wall boundary treatment for its adaptability to complex physics and arbitrary geometry problems. In this study, first, two classical cases of steady forced convection flow past a circular cylinder and natural convection flow over a circular cylinder are tested; the advantages of the gridless approach over the immersed boundary method are clearly shown. Then, further tests of unsteady forced convection flow past two side-by-side circular cylinders and natural convection flow over a Y-shaped fin are also conducted, which show that the present numerical method is also qualified for flow problems involving complex physics and arbitrary geometries. In addition, computational cost comparisons show that the time cost increase caused by the introduction of the gridless approach is within 20% for all test cases considered.

Overlapping B +-trees: An implementation of a transaction time access method

A new variation of Overlapping B +-trees is presented, which provides efficient indexing of transaction time and keys in a two dimensional key-time space. Modification operations (i.e. insertions, deletions and updates) are allowed at the current version, whereas queries are allowed to any temporal version, i.e. either in the current or in past versions. Using this structure, snapshot and range-timeslice queries can be answered optimally. However, the fundamental objective of the proposed method is to deliver efficient performance in case of a general pure-key query (i.e. ‘history of a key’). The trade-off is a small increase in time cost for version operations and storage requirements.

Optimal machining conditions with dual criteria and applications to scheduling

A bicriterion machining economics problem is presented, considering the minimization of the unit production cost and the maximization of the production rate. The bicriterion machining time is first defined as a weighted average of the maximum production rate machining time and of the minimum unit cost machining time using a weighted-sums technique and an arbitrary weighting factor. Then using a vector-maximum approach, a bicriterion machining lime is defined through the introduction of an optimal weighting factor. This weighting factor reflects the relative importance of the two criteria and it is a function of the delay time cost, that is, the cost associated with the difference in actual processing times between the two criteria. It is shown that the vector-maximum approach outperforms the weighting-sums technique. Furthermore, the bicriterion machining lime leans towards the maximum production rate machining time as the delay time cost increases. It is also shown that the actual processing time is prop...