The main objective of this this cross-sectional study was to analyze the influence of lifestyle fac-tors (diet, physical activity, sleep), which can affect the concentrations of fecal short-chain fatty acids (SCFAs) and SCFAs potential role in modulating cardiometabolic disease risk by interact-ing with biochemical and body composition parameters. The study comprised 77 healthy, non-obese individuals, aged 30-45 years who were assessed in the light of SCFAs concentration in stool, diet, physical activity level and sleep duration. Moreover, body composition measurement and patients’ biochemical parameters were included in the analysis. We have indicated a signifi-cant negative correlation between several SCFAs [especially acetic acid (AA), isobutyric acid (IBA), butyric acid (BA), isovaleric acid (IVA) and valeric acid (VA)] with BMI, VAT/SAT ratio (visceral to subcutaneous fat ratio) and percentage of fat mass in a group of females enrolled in the study as well as with waist circumference (WC) in case of both sexes included in the study. Moreover, the results of our study acknowledged the importance of a diet in shaping SCFAs pro-file - we noticed the significant negative associations between energy and fat intake and some SCFAs in males [IBA, IVA, VA, isocaproic acid (ICA)]. In terms of fiber intake, we noticed elevat-ed concentrations of vast majority of SCFAs and amount of SCFAs in total in case of both sexes included in the study. These strong correlations reflect the fact that diet shapes the composition of the gut microbiota and SCFAs (main microbial metabolites) are synthesized from dietary fiber. Furthermore, we noticed that in a group of women, the concentration of AA, propionic acid (PA) and ICA as well as the total concentration of SCFAs showed a significant positive association with their sleep duration. We concluded that SCFAs can have a potential role in modulating car-diometabolic disease risk by interacting with adiposity parameters and diet. In addition, this potential direct link between diet and SCFAs may at least partly contribute to sleep improvement.

To secure logic circuits against the illegal copying the insertion of the so-called key bit inputs using XOR/XNOR gates has been proposed in . The inserted gates modify (lock) the behavior of the original circuit and only the correct choice of the secret key bits guarantees the equivalent behaviour of the locked circuit to the original circuit. To break this kind of security, i.e. to find the secret key bits, there was a SAT solver based attack proposed in . The aim of this work is to experimentally verify this attack on several locked circuits with various number of primary inputs and outputs and with various number of gates. Except for the random placement of the key gates we evaluate also the positioning with chaining elimination. The obtained and presented results show that we were able to unlock 10 of 11 circuits within few minutes on a common PC.

In a previous paper we defined the Black-and-White SAT problem which has exactly two solutions, where each variable is either true or false. We showed that Black-and-White $2$-SAT problems represent strongly connected directed graphs. We presented also the strong model of communication graphs. In this work we introduce two new models, the weak model, and the Balatonbogl\'{a}r model of communication graphs. A communication graph is a directed graph, where no self loops are allowed. In this work we show that the weak model of a strongly connected communication graph is a Black-and-White SAT problem. We prove a powerful theorem, the so called Transitions Theorem. This theorem states that for any model which is between the strong and the weak model, we have that this model represents strongly connected communication graphs as Blask-and-White SAT problems. We show that the Balatonbogl\'{a}r model is between the strong and the weak model, and it generates $3$-SAT problems, so the Balatonbogl\'{a}r model represents strongly connected communication graphs as Black-and-White $3$-SAT problems. Our motivation to study these models is the following: The strong model generates a $2$-SAT problem from the input directed graph, so it does not give us a deep insight how to convert a general SAT problem into a directed graph. The weak model generates huge models, because it represents all cycles, even non-simple cycles, of the input directed graph. We need something between them to gain more experience. From the Balatonbogl\'{a}r model we learned that it is enough to have a subset of a clause, which represents a cycle in the weak model, to make the Balatonbogl\'{a}r model more compact. We still do not know how to represent a SAT problem as a directed graph, but this work gives a strong link between two prominent fields of formal methods: SAT problem and directed graphs.

In the last years, we have witnessed a remarkable progress of algorithms solving Boolean satisfiability (SAT). The success of these algorithms has been especially relevant in a large number of industrial or real-world applications, for which these SAT solvers are nowadays an essential core part of their solving processes. Interestingly enough, these applications include a very diverse and heterogeneous range of domains, such as hardware verification, planning, and cryptography, among others. Unfortunately, the reasons of the good performance of these solvers on this variety of industrial benchmarks are not completely understood yet. Since SAT solvers’ efficiency is fundamental in various domains, obtaining a better understanding of these algorithms and the reasons of their good performance is crucial. In order to shed light on this question, SAT solvers are often viewed as complex systems with many interconnected components (e.g., conflict analysis and learning mechanism, database management, search restarts) interacting in many unpredictable ways. There is the common belief that the resulting emergent behavior of these complex systems takes advantage of a certain underlying structure of the SAT formula, which is shared by the majority of these industrial problems regardless the domain they come from. Recently, there have been some attempts of characterizing this structure under the lens of complex networks, with the purpose of better understanding the success of the solvers, and potentially improving them. In this paper, we analyze the structure of industrial SAT instances under the lens of self-similarity, and study how the execution of SAT solvers affect that structure. Many real-world graphs exhibit self-similar structure (with small fractal dimension), which means that after rescaling (replacing groups of nodes by a single node), the same kind of structure can be observed. In our analysis, in which we represent SAT instances as graphs, we observe that many industrial SAT formulas exhibit the same kind of structure. Moreover, we analyze how this structure evolves by effects of learning new clauses during the search. In particular, we observe that learned clauses usually contain variables that are close in the graph representation of the formula. This is, the learning mechanism tends to work locally. On the contrary, this learning mechanism on random SAT formulas –which do not exhibit any structure at all– is unable to generate these local clauses. This difference contributes to explain the success of modern SAT solvers on industrial problems.

Along just over a century of research we moved from learning how to cultivate tissues in a dish to grasping the concepts for creating an entire brain in a vat. As we approach the divisive moment in which we can first detect signs of awareness in such artificially developed organoids, we need to lay foundation for what lays ahead. It is crucial that ethical, legal and moral implications of organoid research are clear and that boundaries are set to separate scientific progress from human life preservation. The largest obstacle may be the definition of consciousness itself, which has arguably been historically neglected by philosophy, psychology and neurosciences at large. One reason may be the difficulties posed by the underlying qualities of awareness, such as its subjective and heterogeneous nature. Another reason may lie on the possibly that consciousness is an overarching emergent property of our brain. For the time being, one can see brain organoids as philosophical zombies, physical analogues of the human brain which mimic sentient human reactions but lack experiential properties of sensation (a.k.a. qualia).

Additive Manufacturing and nanotechnology have been used as basic tools for the manufacture of nanostructured parts with magnetic properties to expand the variety of applications in additive processes by tank photopolymerization. Magnetic cobalt ferrite (CoFe2O4) and barium ferrite (BaFe12O19) nanoparticles with the size distribution of average value DTEM of 12 ± 2.95 nm and 37 ± 12.78 nm, respectively were generat-ed by hydroxide precipitation method. The dispersion of the nanoparticles on commercial resins (Anycubic Green and IRIX White resin) was obtained by mechanochemical reactions carried out in an agate mortar for 20 minutes, at room temperature and with limited exposure to light. The product of each reaction was placed in amber vials, also being kept in a box, to avoid contact with light. The photopolymerization process was carried out only at low concentrations (w/w % nanoparticles/resin) since, at high concentrations, there is no for-mation of pieces due to the high refractive index of ferrites. Raman shift spectroscopy of the final pieces showed that they contain the magnetic nanoparticles, with no apparent chemical changes. The EPR results of the pieces maintain the magnetic properties and apparently, they are not modified during the photopolymer-ization. Although significant differences were found in the dispersion process of the nanoparticles in each piece, we determined that the photopolymerization did not influence the structure and superparamagnetic behavior of ferrite nanoparticles during processing, and the magnetic properties were successfully transferred to the final 3D-printed magnetic obtained piece.

Current VAT rules for cross-border e-commerce companies in the EU are not sustainable, because they are extremely complex and often opaque, due to the lack of tax harmonization. The aim of the research is to explore, using a qualitative method, what kind of harmonization would make the current legislation more uniform, simpler, more transparent, and easier to understand, without conflicting with the rules of any Member State. To this end, the aspects of the new platform regulation introduced on 1 July 2021 and its potential for expansion are assessed through information from possible sales models. The research suggests that the rules on platforms do not cover all possible sales models, which in our view imposes an unnecessary extra administrative burden on some businesses and makes their tax activities less transparent. In the light of the results of the research, we propose that the current EU platform regulation should be extended to cover B2B, B2C transactions and services. As a result of this suggested harmonization, a simpler, more transparent, uniform and sustainable tax system would contribute to the whitening of the economy, generating additional tax revenue for Member States.

The European pear is a climacteric fruit species characterized by high storability. 'Conference', a pear cultivar very popular on the market, can be stored in a CA room without major losses for half a year. However, for ‘Conference’ storage to be successful, the fruit must be harvested fully developed even before it enters the climatic maturation phase. Harvested too early or too late, pears will taste bad, have physiological disorders and will be poorly storable. Among the various methods used to determine the optimal harvest date, the degree-days method, which relies of the sum of active temperatures, seems to be relatively accurate and easy to apply. During 11 years of study, ‘Conference’ pears were harvested on 4 dates (every 4-5 days) chosen based on measurements and observations, and then, after a six-month storage period, the optimum harvest date was determined. During the growing season, temperature was measured using an automatic weather station to calculate the sum of active temperatures from full bloom to the optimal harvest date. Measurements made after storage were analysed and the sum of active temperatures needed for the proper development of ‘Conference’ pear was calculated to be 2469 degree days. The calculations are very accurate because the dispersion calculated using the standard deviation was only 20 °. The base temperature with the smallest error was 0 °. On the basis of the study results, this method can be recommended as useful for determining the optimal harvest date.

This paper aims to outline the effectiveness of modern universal gate quantum computers when utilizing different configurations to solve the B-SAT(Boolean Satisfiability) problem. The quantum computing experiments are performed using Grover’s Search algorithm to find a valid solution. The experiments are performed under different variations to demonstrate their effects on the results. Changing the number of shots, qubit mapping, and using a different quantum processor are all among the experimental variables. The study also branches into a dedicated experiment highlighting a peculiar behavior that IBM quantum processors exhibit when running circuits with a certain number of shots.

Advanced ceramics are recognized as key enabling materials possessing combinations of properties not achievable in other material classes. They are characterized by very high thermal, chemical and mechanical resistance and also usually have a lower density than metals. These properties predestine ceramics for many different applications, especially space applications.In the aerospace sector aerospike nozzles promise performance and application advantages compared to classic bell nozzles but are also inherently more complex to manufacture due to their shape. AM methods drastically simplify or even enable the fabrication of those complex structures while minimising the number of individual parts. The applicability of ceramic AM (“CerAMfacturing”) on rocket engines and especially nozzles is consequently investigated in the frame of the “MACARONIS” project, a cooperation of the Institute of Aerospace Engineering at Technische Universität Dresden and the Fraunhofer Institute for Ceramic Technologies and Systems (IKTS) in Dresden. The goal is to develop novel large size aerospike thrust nozzles including areas of highest resolution and fineness. Finding a suitable AM process that enables the realisation of both aspects is extremely challenging. One possibility could be the hybridization of shaping methods, in that case CerAM VPP (ceramic additive manufacturing via vat photopolymerization) and CerAM FFF (ceramic additive manufacturing via fused filament fabrication) in combination with sinter joining. This contribution focuses on the high resolution CerAM VPP process, in particular the development, characterization and testing of a new photoreactive Al₂O₃ suspension validated by AM of novel aerospike nozzles.

In this paper, several two-dimensional clustering scenarios are given. In those scenarios, soft partitioning clustering algorithms (Fuzzy C-means (FCM) and Possibilistic c-means (PCM)) are applied. Afterward, VAT is used to investigate the clustering tendency visually, and then in order of checking cluster validation, three types of indices (e.g., PC, DI, and DBI) were used. After observing the clustering algorithms, it was evident that each of them has its limitations; however, PCM is more robust to noise than FCM as in case of FCM a noise point has to be considered as a member of any of the cluster.