Cellular decomposition in Fe-26Ni-(2-3)Ti-Nb steels with an addition of aluminium or molybdenum

Cellular decomposition in three Fe-26Ni-(2-3)Ti-Nb type steels was investigated. One of these steels was alloyed with molybdenum while the two others, differing in grain size, contained an addition of aluminium. In Ni26AITi3Nb and Ni26MoTi2Nb steels quenched from 1223 K in water, the first colonies of decomposition were observed after holding for 4 h at 923 K. A longer holding at this temperature resulted in growth of decomposition cells in the steel with molybdenum while in the steels with aluminium, a halting of the decomposition and the appearance of isolated plates of the phase was observed. In Ni26MoTi2Nb and Ni26Al2Ti3Nb steels, quenched in water and subsequently cold treated in liquid nitrogen, repeated heating in the temperature range 293–999.9 K at a rate of 2.5,10 and 40 Kmin^–1 and cooling at a rate 320 Kmin^–1 favoured the cellular decomposition more markedly in the steel with molybdenum. On cooling to room temperature, austenite within the decomposition cells transformed into martensite. The tendency to cellular decomposition depended to a higher degree on the factors which stabilize austenite as well as on the presence of precipitates in grain boundaries, than on the grain size.     

The effect of anterior lesions to the medial forebrain bundle on the motor activity evoked by a sensory deficit (sensory drive) in rats]

The orbito-frontal cortex and postcommissural MFB lesions evoked two major effects. The first one consisted in an increased need for light stimulation while the second one concerned changes in anxiety level with different results depending on the lesion location (cortical ot subcortical). The second effect is in agreement with P. Simonov's hypothesis concerning the different configurations of the CNS structures. Upon destruction of the orbito-frontal area, the dominant role in behaviour regulation is taken over by the "emotional part" of the brain, whereas the destruction of the postcommissural MFB (reduction of the amygdalar influence on the hypothalamus) creates conditions for functional prevalence of the "informational brain".     

Deciding k-Colorability of P 5-Free Graphs in Polynomial Time

The problem of computing the chromatic number of a P ₅-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show that for every fixed integer k, there exists a polynomial-time algorithm determining whether or not a P ₅-free graph admits a k-coloring, and finding one, if it does.     

A parallel direct solver for the self-adaptive hp Finite Element Method

In this paper we present a new parallel multi-frontal direct solver, dedicated for the hp Finite Element Method (hp-FEM). The self-adaptive hp-FEM generates in a fully automatic mode, a sequence of hp-meshes delivering exponential convergence of the error with respect to the number of degrees of freedom (d.o.f.) as well as the CPU time, by performing a sequence of hp refinements starting from an arbitrary initial mesh. The solver constructs an initial elimination tree for an arbitrary initial mesh, and expands the elimination tree each time the mesh is refined. This allows us to keep track of the order of elimination for the solver. The solver also minimizes the memory usage, by de-allocating partial LU factorizations computed during the elimination stage of the solver, and recomputes them for the backward substitution stage, by utilizing only about 10% of the computational time necessary for the original computations. The solver has been tested on 3D Direct Current (DC) borehole resistivity measurement simulations problems. We measure the execution time and memory usage of the solver over a large regular mesh with 1.5 million degrees of freedom as well as on the highly non-regular mesh, generated by the self-adaptive hp$hp$-FEM, with finite elements of various sizes and polynomial orders of approximation varying from p=1$p=1$ to p=9$p=9$. From the presented experiments it follows that the parallel solver scales well up to the maximum number of utilized processors. The limit for the solver scalability is the maximum sequential part of the algorithm: the computations of the partial LU factorizations over the longest path, coming from the root of the elimination tree down to the deepest leaf.     

Michell cantilevers constructed within a half strip. Tabulation of selected benchmark results

The paper delivers the benchmark results for the Michell cantilevers constructed within a half strip, for selected values of the σ _T /σ _C ratio, σ _T , σ _C being the admissible stresses in tension and compression, respectively.     

On the generalized Hyers-Ulam stability of multi-quadratic mappings

A mapping f:Vⁿ?W, where V is a commutative group, W is a linear space, and n≥2 is an integer, is called multi-quadratic if it is quadratic in each variable. In this paper, we prove the generalized Hyers-Ulam stability of multi-quadratic mappings in Banach spaces and complete non-Archimedean spaces.     

Immune-based algorithms for dynamic optimization

The main problem with biologically inspired algorithms (like evolutionary algorithms or particle swarm optimization) when applied to dynamic optimization is to force their readiness for continuous search for new optima occurring in changing locations. Immune-based algorithm, being an instance of an algorithm that adapt by innovation seem to be a perfect candidate for continuous exploration of a search space. In this paper we describe various implementations of the immune principles and we compare these instantiations on complex environments.     

Speeding up global optimization with the help of intelligent supervisors

It is shown in the paper that Developmental Genetic Programming is an efficient tool for evolutionary development of intelligent supervisors that solve an extension of Resource-Constrained Project Scheduling Problem. The extension assumes that resources are only partially available. It also assumes that renewable resources affect the project cost. The cost should be as low as possible and a deadline of the project must be met. This is apparent with regard to software houses and building enterprises. Computational experiments showed that supervisors find solutions of the problem much faster than other genetic approaches. A specific property of the supervisor is that it has various strategies of allocating the resources to the tasks. The supervisor uses the strategies in order to develop a procedure for producing the best schedule for the whole project. The analysis of the evolutionary process was performed and experimental results were compared with the optimal ones obtained by means of the exhaustive search method.     

Erotetic Search Scenarios and Three-Valued Logic

Our aim is to model the behaviour of a cognitive agent trying to solve a complex problem by dividing it into sub-problems, but failing to solve some of these sub-problems. We use the powerful framework of erotetic search scenarios (ESS) combined with Kleene’s strong three-valued logic. ESS, defined on the grounds of Inferential Erotetic Logic, has appeared to be a useful logical tool for modelling cognitive goal-directed processes. Using the logical tools of ESS and the three-valued logic, we will show how an agent could solve the initial problem despite the fact that the sub-problems remain unsolved. Thus our model not only indicates missing information but also specifies the contexts in which the problem-solving process may end in success despite the lack of information. We will also show that this model of problem solving may find use in an analysis of natural language dialogues.