Theory of electronic transport in two-dimensional systems in the presence of magnetic fields

The paper of three parts is focused on the Landauer-Büttiker approach to the study of transport in two-dimensional electron systems, with particular attention to the influence of an external magnetic field. In the previous part the total conductance of such a system was shown to be proportional to the transmission current. In the present part we give a detailed proof, based on the linear response theory, to the last statement. The value of the magnetic field may be arbitrary and possible inhomogeneity of the electric field is also considered.The author wishes to thank to Professor P. Steda and Professor L. Smrka for discussions and encouragement.     

Calibration Invariance of the MaxEnt Distribution in the Maximum Entropy Principle

The maximum entropy principle consists of two steps: The first step is to find the distribution which maximizes entropy under given constraints. The second step is to calculate the corresponding thermodynamic quantities. The second part is determined by Lagrange multipliers’ relation to the measurable physical quantities as temperature or Helmholtz free energy/free entropy. We show that for a given MaxEnt distribution, the whole class of entropies and constraints leads to the same distribution but generally different thermodynamics. Two simple classes of transformations that preserve the MaxEnt distributions are studied: The first case is a transform of the entropy to an arbitrary increasing function of that entropy. The second case is the transform of the energetic constraint to a combination of the normalization and energetic constraints. We derive group transformations of the Lagrange multipliers corresponding to these transformations and determine their connections to thermodynamic quantities. For each case, we provide a simple example of this transformation.     

Knowledge Discovery from Medical Data and Development of an Expert System in Immunology

Artificial intelligence is one of the fastest-developing areas of science that covers a remarkably wide range of problems to be solved. It has found practical application in many areas of human activity, also in medicine. One of the directions of cooperation between computer science and medicine is to assist in diagnosing and proposing treatment methods with the use of IT tools. This study is the result of collaboration with the Children’s Memorial Health Institute in Warsaw, from where a database containing information about patients suffering from Bruton’s disease was made available. This is a rare disorder, difficult to detect in the first months of life. It is estimated that one in 70,000 to 90,000 children will develop Bruton’s disease. But even these few cases need detailed attention from doctors. Based on the data contained in the database, data mining was performed. During this process, knowledge was discovered that was presented in a way that is understandable to the user, in the form of decision trees. The best models obtained were used for the implementation of expert systems. Based on the data introduced by the user, the system conducts expertise and determines the severity of the course of the disease or the severity of the mutation. The CLIPS language was used for developing the expert system. Then, using this language, software was developed producing six expert systems. In the next step, experimental verification was performed, which confirmed the correctness of the developed systems.     

Real-World Data Difficulty Estimation with the Use of Entropy

In the era of the Internet of Things and big data, we are faced with the management of a flood of information. The complexity and amount of data presented to the decision-maker are enormous, and existing methods often fail to derive nonredundant information quickly. Thus, the selection of the most satisfactory set of solutions is often a struggle. This article investigates the possibilities of using the entropy measure as an indicator of data difficulty. To do so, we focus on real-world data covering various fields related to markets (the real estate market and financial markets), sports data, fake news data, and more. The problem is twofold: First, since we deal with unprocessed, inconsistent data, it is necessary to perform additional preprocessing. Therefore, the second step of our research is using the entropy-based measure to capture the nonredundant, noncorrelated core information from the data. Research is conducted using well-known algorithms from the classification domain to investigate the quality of solutions derived based on initial preprocessing and the information indicated by the entropy measure. Eventually, the best 25% (in the sense of entropy measure) attributes are selected to perform the whole classification procedure once again, and the results are compared.     

A novel monochromator for experiments with ultrashort X‐ray pulses

Aiming at advancing storage‐ring‐based ultrafast X‐ray science, over the past few years many upgrades have been undertaken to continue improving beamline performance and photon flux at the Femtoslicing facility at BESSY II. In this article the particular design upgrade of one of the key optical components, the zone‐plate monochromator (ZPM) beamline, is reported. The beamline is devoted to optical pump/soft X‐ray probe applications with 100 fs (FWHM) X‐ray pulses in the soft X‐ray range at variable polarization. A novel approach consisting of an array of nine off‐axis reflection zone plates is used for a gapless coverage of the spectral range between 410 and 1333 eV at a designed resolution of E/ΔE = 500 and a pulse elongation of only 30 fs. With the upgrade of the ZPM the following was achieved: a smaller focus, an improved spectral resolution and bandwidth as well as excellent long‐term stability. The beamline will enable a new class of ultrafast applications with variable optical excitation wavelength and variable polarization.     

Determination of nanostructure of liposomes containing two model drugs by X‐ray scattering from a synchrotron source

Small‐angle X‐ray scattering has been employed to study how the introduction of paracetamol and acetylsalicylic acid into a liposome bilayer system affects the system's nanostructure. An X‐ray scattering model, developed for multilamellar liposome systems [Pabst et al. (2000), Phys. Rev. E, 62 , 4000–4009], has been used to fit the experimental data and to extract information on how structural parameters, such as the number and thickness of the bilayers of the liposomes, thickness of the water layer in between the bilayers, size and volume of the head and tail groups, are affected by the drugs and their concentration. Even though the experimental data reveal a complicated picture of the drug–bilayer interaction, they clearly show a correlation between nanostructure, drug and concentration in some aspects. The localization of the drugs in the bilayers is discussed.     

Symmetric homotopy construction

Homotopy continuation methods can be applied to compute all finite solutions to a given polynomial system. Computations will be performed more efficiently if the symmetric structure of the system can be exploited. This paper presents the construction of a symmetric homotopy. Using this homotopy, only the paths according to the generating solutions have to be traced during continuation.     

Intersection Dimensions of Graph Classes

The intersection dimension of a graphG with respect to a classA of graphs is the minimumk such thatG is the intersection of at mostk graphs on vertex setV(G) each of which belongs toA. We consider the question when the intersection dimension of a certain family of graphs is bounded or unbounded. Our main results are (1) ifA is hereditary, i.e., closed on induced subgraphs, then the intersection dimension of all graphs with respect toA is unbounded, and (2) the intersection dimension of planar graphs with respect to the class of permutation graphs is bounded. We also give a simple argument based on [Ben-Arroyo Hartman, I., Newman, I., Ziv, R.:On grid intersection graphs, Discrete Math.87 (1991) 41-52] why the boxicity (i.e., the intersection dimension with respect to the class of interval graphs) of planar graphs is bounded. Further we study the relationships between intersection dimensions with respect to different classes of graphs.