Study to analyze the influence of sprouting of the wheat grain on the grinding process

Several studies have been carried out on the grinding characteristic of three species of common wheat (Triticum aestivum, ssp. vulgare). The three-day germinated kernels were pulverized in a micro hammer mill equipped with a changeable screen. The moisture of samples was 12% (w.b.). The results showed that the sprouting of wheat had a significant influence on the grinding process. The average particle size of the pulverized material obtained from the sprouted kernels was almost always significantly lower than those from the sound kernels. The highest changes were observed in the increase of the fraction of particles below a size of 200 μm, caused by sprouting. The sprouting caused a decrease in the value of specific grinding energy in all cultivars. Based on the parameters of screen openings and cultivar, the values of specific grinding energy ranged from 35.5 to 141.6 kJ kg⁻¹ and from 41.4 to 164.3 kJ kg⁻¹ for the sprouted and sound kernels, respectively. In addition, the other values of grinding energy indices confirmed that sprouting significantly reduced the grinding energy requirements. The average value of the grinding ability index was 3.9 and 4.8 kJ m⁻² for the sprouted and sound wheat, respectively. Whereas, sprouting caused a decrease in the average value of the grinding index from 71.2 to 58.0 kJ kg⁻¹ mm^0.5.     

Kinetic Studies of Newly Patented Aminoalkanol Derivatives with Potential Anticancer Activity as Competitive Inhibitors of Prostate Acid Phosphatase

Background: Acid phosphatase and its regulation are important objects of biological and clinical research and play an important role in the development and treatment of prostate and bone diseases. The newly patented aminoalkanol (4-[2-hydroxy-3-(propan-2-ylamino)propyl]-1,7-dimethyl-8,9-diphenyl-4-azatricyclo[5.2.1.02,6]dec-8-ene-3,5,10-trione hydrochloride) (I) and (4-[3-(dimethylamino)-2-hydroxypropyl]-1,7-dimethyl-8,9-diphenyl-4-azatricyclo[5.2.1.02,6]dec-8-ene-3,5,10-trione hydrochloride) (II) derivatives have potential anticancer activity, and their influence on enzymatic activity can significantly impact the therapeutic effects of acid phosphatase against many diseases. Therefore, in this study, we investigated the action of compounds (I) and (II) on acid phosphatase. Methods: Capillary electrophoresis was used to evaluate the inhibition of acid phosphatase. Lineweaver–Burk plots were constructed to compare the Km of this enzyme in the presence of inhibitors (I) or (II) with the Km in solutions without these inhibitors. Results: Compound (I) showed a stronger competitive inhibition against acid phosphatase, whereas derivative (II) showed a weaker competitive type of inhibition. The detailed kinetic studies of these compounds showed that their type and strength of inhibition as well as affinity depend on the kind of substituent occurring in the main chemical molecule. Conclusions: This study is of great importance because the disclosed inhibition of acid phosphatase by compounds (I) and (II) raises the question of whether these compounds could have any effect on the treatment possibilities of prostate diseases.     

Reversal Activity and Toxicity of Heparin-Binding Copolymer after Subcutaneous Administration of Enoxaparin in Mice

Uncontrolled bleeding after enoxaparin (ENX) is rare but may be life-threatening. The only registered antidote for ENX, protamine sulfate (PS), has 60% efficacy and can cause severe adverse side effects. We developed a diblock copolymer, heparin-binding copolymer (HBC), that reverses intravenously administered heparins. Here, we focused on the HBC inhibitory activity against subcutaneously administered ENX in healthy mice. BALB/c mice were subcutaneously injected with ENX at the dose of 5 mg/kg. After 110 min, vehicle, HBC (6.25 and 12.5 mg/kg), or PS (5 and 10 mg/kg) were administered into the tail vein. The blood was collected after 3, 10, 60, 120, 360, and 600 min after vehicle, HBC, or PS administration. The activities of antifactors Xa and IIa and biochemical parameters were measured. The main organs were collected for histological analysis. HBC at the lower dose reversed the effect of ENX on antifactor Xa activity for 10 min after antidote administration, whereas at the higher dose, HBC reversed the effect on antifactor Xa activity throughout the course of the experiment. Both doses of HBC completely reversed the effect of ENX on antifactor IIa activity. PS did not reverse antifactor Xa activity and partially reversed antifactor IIa activity. HBC modulated biochemical parameters. Histopathological analysis showed changes in the liver, lungs, and spleen of mice treated with HBC and in the lungs and heart of mice treated with PS. HBC administered in an appropriate dose might be an efficient substitute for PS to reverse significantly increased anticoagulant activity that may be connected with major bleeding in patients receiving ENX subcutaneously.     

The Impact of Selected Bacterial Sexually Transmitted Diseases on Pregnancy and Female Fertility

Sexually transmitted infections (STIs) caused by Neisseria gonorrhoeae, Chlamydia trachomatis and Mycoplasma genitalium are a common cause of pelvic inflammatory disease (PID) which can lead to tubal factor infertility (TFI). TFI is one of the most common causes of infertility, accounting for 30% of female fertility problems. STIs can also have an impact on pregnancy, leading to adverse pregnancy outcomes. Escalating antibiotic resistance in Neisseria gonorrhoeae and Mycoplasma genitalium represents a significant problem and can be therapeutically challenging. We present a comprehensive review of the current treatment options, as well as the molecular approach to this subject. We have given special attention to molecular epidemiology, molecular diagnostics, current and new treatments, and drug resistance.     

Nonlinear Absorption of Submicrometer Grain‐Size Cobalt‐Doped Magnesium Aluminate Transparent Ceramics

Transparent cobalt‐doped magnesium aluminate spinel (Co:MgAl₂O₄) ceramics with a submicrometer grain size were prepared by spark plasma sintering. For the first time, the nonlinear absorption of Co:MgAl₂O₄ transparent ceramics was experimentally demonstrated. Both ground state absorption (σ_GSA) and excited state absorption (σ_ESA) were estimated using the solid‐state slow saturable absorber model based on absorption saturation measurements performed at 1.535 μm. σ_GSA and σ_ESA for 0.03 at.% Co:MgAl₂O₄ were found to be 4.1 × 10^?19 cm² and 4.0 × 10^?20 cm², respectively. In the case of 0.06 at.% Co:MgAl₂O₄ ceramics, σ_GSA = 2.6 × 10^?19 cm² and σ_ESA= 5.3 × 10^?20 cm² were determined.     

Randomized mutual exclusion on a multiple access channel

In this paper we consider the mutual exclusion problem on a multiple access channel. Mutual exclusion is one of the fundamental problems in distributed computing. In the classic version of this problem, n processes execute a concurrent program that occasionally triggers some of them to use shared resources, such as memory, communication channel, device, etc. The goal is to design a distributed algorithm to control entries and exits to/from the shared resource (also called a critical section), in such a way that at any time, there is at most one process accessing it. In our considerations, the shared resource is the shared communication channel itself (multiple access channel), and the main challenge arises because the channel is also the only mean of communication between these processes. We consider both the classic and a slightly weaker version of mutual exclusion, called \(\varepsilon \)-mutual-exclusion, where for each period of a process staying in the critical section the probability that there is some other process in the critical section is at most \(\varepsilon \). We show that there are channel settings, where the classic mutual exclusion is not feasible even for randomized algorithms, while the \(\varepsilon \)-mutual-exclusion is. In more relaxed channel settings, we prove an exponential gap between the makespan complexity of the classic mutual exclusion problem and its weaker \(\varepsilon \)-exclusion version. We also show how to guarantee fairness of mutual exclusion algorithms, i.e., that each process that wants to enter the critical section will eventually succeed.     

Adaptive rank weighted switching filter for impulsive noise removal in color images

Journal of Real-Time Image Processing - In this paper, a novel approach to the problem of impulsive noise removal in color digital images is presented. The described switching filter is based on...     

Robust gossiping with an application to consensus

We study deterministic gossiping in synchronous systems with dynamic crash failures. Each processor is initialized with an input value called rumor. In the standard gossip problem, the goal of every processor is to learn all the rumors. When processors may crash, then this goal needs to be revised, since it is possible, at a point in an execution, that certain rumors are known only to processors that have already crashed. We define gossiping to be completed, for a system with crashes, when every processor knows either the rumor of processor v or that v has already crashed, for any processor v. We design gossiping algorithms that are efficient with respect to both time and communication. Let t<n be the number of failures, where n is the number of processors. If , then one of our algorithms completes gossiping in O(log²t) time and with O(npolylogn) messages. We develop an algorithm that performs gossiping with O(n^1.77) messages and in O(log²n) time, in any execution in which at least one processor remains non-faulty. We show a trade-off between time and communication in gossiping algorithms: if the number of messages is at most O(npolylogn), then the time has to be at least . By way of application, we show that if n−t=Ω(n), then consensus can be solved in O(t) time and with O(nlog²t) messages.     

Maximum throughput of multiple access channels in adversarial environments

We consider deterministic distributed broadcasting on multiple access channels in the framework of adversarial queuing. Packets are injected dynamically by an adversary that is constrained by the injection rate and the number of packets that may be injected simultaneously; the latter we call burstiness. A protocol is stable when the number of packets in queues at the stations stays bounded. The maximum injection rate that a protocol can handle in a stable manner is called the throughput of the protocol. We consider adversaries of injection rate 1, that is, of one packet per round, to address the question if the maximum throughput 1 can be achieved, and if so then with what quality of service. We develop a protocol that achieves throughput 1 for any number of stations against leaky-bucket adversaries. The protocol has O(n²+\textburstiness){\mathcal{O}(n^2+\text{burstiness})} packets queued simultaneously at any time, where n is the number of stations; this upper bound is proved to be best possible. A protocol is called fair when each packet is eventually broadcast. We show that no protocol can be both stable and fair for a system of at least two stations against leaky-bucket adversaries. We study in detail small systems of exactly two and three stations against window adversaries to exhibit differences in quality of broadcast among classes of protocols. A protocol is said to have fair latency if the waiting time of packets is O(\textburstiness){\mathcal{O}(\text{burstiness})}. For two stations, we show that fair latency can be achieved by a full sensing protocol, while there is no stable acknowledgment based protocol. For three stations, we show that fair latency can be achieved by a general protocol, while no full sensing protocol can be stable. Finally, we show that protocols that either are fair or do not have the queue sizes affect the order of transmissions cannot be stable in systems of at least four stations against window adversaries.     

On the dynamic extent of delimited continuations

We show that breadth-first traversal exploits the difference between the static delimited-control operator shift (alias S) and the dynamic delimited-control operator control (alias F). For the last 15 years, this difference has been repeatedly mentioned in the literature but it has only been illustrated with one-line toy examples. Breadth-first traversal fills this vacuum.