Methods of Image Compression by PHL Transform

In this paper an image data compression scheme based on Periodic Haar Piecewise-Linear (PHL) transform and quantization tables is proposed. Effectiveness of the compression for different classes of images is evaluated. The comparison of the compression quality using PHL and DCT transforms is given.     

Wave propagation in delaminated beam

The wave propagation model investigated herein is based on the known fact that material discontinuities affect the propagation of elastic waves in solids. The change in certain material characteristics, such as a local change in stiffness or inertia caused by a crack or the presence of material damage, will affect the propagation of transmitted elastic waves and will modify the received signal. Wave frequencies associated with the highest detection sensitivity depend, among other things, on the type of structure, the type of material, and the type of damage. This paper presents a method of wave propagation, which can be further used to detect small delaminations in beam-like structures. The considered beam is modelled by spectral finite elements.     

Constraint Lingo: towards high‐level constraint programming

Logic programming requires that the programmer convert a problem into a set of constraints based on predicates. Choosing the predicates and introducing appropriate constraints can be intricate and error prone. If the problem domain is structured enough, we can let the programmer express the problem in terms of more abstract, higher‐level constraints. A compiler can then convert the higher‐level program into a logic‐programming formalism. The compiler writer can experiment with alternative low‐level representations of the higher‐level constraints in order to achieve a high‐quality translation. The programmer can then take advantage of both a reduction in complexity and an improvement in runtime speed for all problems within the domain. We apply this analysis to the domain of tabular constraint‐satisfaction problems. Examples of such problems include logic puzzles solvable on a hatch grid and combinatorial problems such as graph coloring and independent sets. The proper abstractions for these problems are rows, columns, entries, and their interactions. We present a higher‐level language, Constraint Lingo, dedicated to problems in this domain. We also describe how we translate programs from Constraint Lingo into lower‐level logic formalisms such as the logic of propositional schemata. These translations require that we choose among competing lower‐level representations in order to produce efficient results. The overall effectiveness of our approach depends on the appropriateness of Constraint Lingo, our ability to translate Constraint Lingo programs into high‐quality representations in logic formalisms, and the efficiency with which logic engines can compute answer sets. We comment on our computational experience with these tools in solving both graph problems and logic puzzles. Copyright © 2004 John Wiley & Sons, Ltd.     

Effect of the post-deposition annealing on electrical characteristics of MIS structures with HfO2/SiO2 gate dielectric stacks

In this work, we report on effects of post-deposition annealing on electrical characteristics of metal–insulator–semiconductor (MIS) structures with HfO₂/SiO₂ double gate dielectric stacks. Obtained results have shown the deterioration of electro-physical properties of MIS structures, e.g. higher interface traps density in the middle of silicon forbidden band (D_itmb), as well as non-uniform distribution and decrease of breakdown voltage (U_br) values, after annealing above 400 °C. Two potential hypothesis of such behavior were proposed: the formation of interfacial layer between hafnia and silicon dioxide and the increase of crystallinity of HfO₂ due to the high temperature treatment. Furthermore, the analysis of conduction mechanisms in investigated stacks revealed Poole–Frenkel (P–F) tunneling at broad range of electric field intensity.     

Gender approaches to evolutionary multi-objective optimization using pre-selection of criteria

A novel idea to perform evolutionary computations (ECs) for solving highly dimensional multi-objective optimization (MOO) problems is proposed. Following the general idea of evolution, it is proposed that information about gender is used to distinguish between various groups of objectives and identify the (aggregate) nature of optimality of individuals (solutions). This identification is drawn out of the fitness of individuals and applied during parental crossover in the processes of evolutionary multi-objective optimization (EMOO). The article introduces the principles of the genetic-gender approach (GGA) and virtual gender approach (VGA), which are not just evolutionary techniques, but constitute a completely new rule (philosophy) for use in solving MOO tasks. The proposed approaches are validated against principal representatives of the EMOO algorithms of the state of the art in solving benchmark problems in the light of recognized EC performance criteria. The research shows the superiority of the gender approach in terms of effectiveness, reliability, transparency, intelligibility and MOO problem simplification, resulting in the great usefulness and practicability of GGA and VGA. Moreover, an important feature of GGA and VGA is that they alleviate the ‘curse’ of dimensionality typical of many engineering designs.     

New method for the on-line signature verification based on horizontal partitioning

Verification of identity based on the analysis of dynamic signatures is an important problem of biometrics. The effectiveness of the verification significantly increases when the dynamic characteristics of signature (e.g. velocity of the pen) are considered. These characteristics are individual for each user and difficult to imitate. The effectiveness of the verification can be further improved by using partitioning. In this paper we propose a new method which uses partitioning. In our method partitions represent areas of high and low speed of signature and high and low pen?s pressure. All selected partitions are used by our algorithm, but more important in the classification process are these partitions, in which the signatures of the user acquired during training phase are more stable. Moreover, final classification is interpretable. In this paper we present the simulation results of the proposed method for the two databases: SVC2004 and BioSecure Database.     

A new approach to the learning effect: Beyond the learning curve restrictions

In this paper, we bring into the scheduling field a new model of the learning effect, where in two ways the existing approach is generalized. First we relax one of the rigorous constraints, and thus in our model each job can provide different experience to the processor. Second we formulate the job processing time as a non-increasing k-stepwise function, that, in general, is not restricted to a certain learning curve, thereby it can accurately fit every possible shape of a learning function. Furthermore, we prove that the problem of makespan minimization with the considered model is polynomially solvable if every job provides the same experience to the processor, and it becomes NP-hard if the experiences are diversified. The most essential result is a pseudopolynomial time algorithm that solves optimally the makespan minimization problem with any function of an experience-based learning model reduced into the form of the k-stepwise function.     

Tracking Changes in the Spring Barley Gene Pool in Poland during 120 Years of Breeding

This study was undertaken to investigate the diversity and population structure of 83 spring barley (Hordeum vulgare L.) cultivars, which corresponded to 120 years of this crop’s breeding in Poland. The analysis was based on 11,655 DArTseq-derived SNPs evenly distributed across seven barley chromosomes. Five groups were assigned in the studied cultivars according to the period of their breeding. A decrease in observed heterozygosity within the groups was noted along with the progress in breeding, with a simultaneous increase in the inbreeding coefficient value. As a result of breeding, some of the unique allelic variation present in old cultivars was lost, but crosses with foreign materials also provided new alleles to the barley gene pool. It is important to mention that the above changes affected different chromosomes to varying degrees. The internal variability of the cultivars ranged from 0.011 to 0.236. Internal uniformity was lowest among the oldest cultivars, although some highly homogeneous ones were found among them. This is probably an effect of genetic drift or selection during their multiplications and regenerations in the period from breeding to the time of analysis. The population genetic structure of the studied group of cultivars appears to be quite complex. It was shown that their genetic makeup consists of as many as eleven distinct gene pools. The analysis also showed traces of directed selection on chromosomes 3H and 5H. Detailed data analysis confirmed the presence of duplicates for 11 cultivars. The performed research will allow both improvement of the management of barley genetic resources in the gene bank and the reuse of this rich and forgotten variability in breeding programs and research.