Miracle-dz/UniFAR-FTUs huggingface dataset:
Using the Fiber Preparations in Meat Processing

Due to the growing segment of dietary fiber preparations on the World market and to the need to expand the range of food products within the Scientific Concepts of Functional Foods in Europe, the authors studied the properties of the roughage, developed the ways of their dispensing use in food products with the required and improved characteristics to be ensured. The studies identified the chemical composition, the safety characteristics, the functional and technological properties, and the microstructure of the wheat fiber products of the series "Vitacel" (produced by «J. Rettenmaier & SohneGmbH», Germany). The microstructural analysis helped to prove the capillary-fiber structure of the fiber "Vitacel", which provides high water retention. The fact that the food fiber preparations have significant sorption capacity and a high degree of swelling has been experimentally proved. The rational doses and the hydration conditions in the meat systems have been substantiated. Based on the research results, we can conclude that the fiber of the series "Vitacel" has a number of positive functional and technological properties that allows recommending it for all kinds of meat, fish, and confectionery products.
A Human Face Recognition Software Development Applying PCA

A wide range of studies were researched to explore numerous image processing technologies. A human face recognition (HFR) system is without exception, and is an ever changing and evolving domain which had improved relentlessly. It is widely known that a HFR is increasingly being deployed in a wide range of real world applications. However, the application of HFR system is not commonly used as opposed to other biometric identifications such as fingerprint or smart card verifications. A HFR system is developed based on the Principal Component Analysis (PCA) algorithm. It is intended to be used for a library verification systems developed on a stand-alone computer. It was been designed to retrieve data of the recognized students resided in the training database. To test the system performance, the experiment is conducted on 50 different students" images. Finally, it concludes that although PCA approach is one of the legacy and well established feature extraction method, it can still deliver and produce high accuracy results.
A dynamic model of feed intake regulation in dairy cows . Model evaluation

The objective of this work was the evaluation of a feed intake regulation model for dairy cows described in a previous paper. Sensibility analysis revealed that the model is sensible mainly to those parameters defining the upper limit of NDF rumen digesta. The level of sensibility varies with the energy content of the diet evaluated and with the time in the lactation cycle where the sensibility analysis is done. A total of 17 treatments from a series of experiments were used to compare experimentally observed feed intake and body condition score (BCS) of dairy cows with model predictions of these variables. Feed intake, either throughout the whole lactation period or as an average for a certain period of it, is predicted by the model with an acceptable degree of accuracy for most of the treatments. Typical curves of feed intake are predicted by the model for most of the treatments. Accuracy of prediction of BCS depends on the treatment being evaluated. However, losses of BCS are predicted at the beginning of the lactation period followed by a gradual increase in BCS. The interplay between energy transactions and rumen digesta load constitutes an acceptable framework on which mechanistic models of feed intake regulation can be developed.
Embedding graphs into colored graphs

If X is a graph, K a cardinal, then there is a graph Y such that if the vertex set of Y is s-colored, then there exists a monocolored induced copy of X; moreover, if X does not contain a complete graph on ce vertices, neither does Y. This may not be true, if we exclude noncomplete graphs as subgraphs. It is consistent that there exists a graph X such that for every graph Y there is a two-coloring of the edges of Y such that there is no monoeolored induced copy of X. Similarly, a triangle-free X may exist sueh that every Y must contain an infinite complete graph, assuming that coloring Y's edges with countably many colors a monocolored copy of X always exists. 0. Introduction. In this paper we deal with the generalization of partition theory which investigates the existence of monocolored prescribed subgraphs of multicolored graphs satisfying certain conditions. As usual we will need partition symbols to make the formulation of the results and problems feasible. (0.1) Y ) (X)l X y > (X)2 mean that the following statements are true. If the vertices/edges of Y are ey-colored then there exists a monocolored copy of X c Y, respectively. (0.2) Y (X)1, Y (X)2 mean the existence of monocolored copies of X which are induced subgraphs of Y. Clearly, the Erdos-Rado generalization of Ramsey's theorem yields an obvious existence theorem of type VX BY in (0.1), and the meaningful results concerning this symbol are of the form VX E BY E g for certain classes , g of graphs. The existence problem for the symbols (0.2) is nontrivial, though it is quite easy for the first symbol and here the problem has to be investigated under additional restrictions on X and Y. As to t symbol Y (X)2 the stat m nt VX BY Y (X)2 forey < ,X and Y) finite was proved by three diderent sets of authors [4, 10, 20] and it was extended for countable graphs X in [10] wher Vt W V0Xt < W HtY < 2w y (X)2 was proved. One of the main observations of this paper is that (contrary to the intuitive expectation of combinatorialists that this kind of Ramsey property always holds Received by the editors March 21, 1986 and, in revised form, April 15, 1987. 1980 Mathematics Subject Classification (1985 Revision). Primary 03E05; Secondary 03E35, 04A20, 05C65.
Foraging effort in Magellanic penguins in coastal Patagonia, Argentina

In long-lived species such as seabirds, foraging success is considered to be related to breeding success, so quantification of foraging parameters during the breeding season should help understand population trends. Using GPS units, we studied the foraging effort of 55 breeding Magellanic penguins Spheniscus magellanicus from 5 colonies in coastal Patagonia, Argentina (42 to 54°S): Punta Norte, Bahia Bustamante, Puerto Deseado, Puerto San Julian and Isla Martillo, in an attempt to relate this to differences in breeding population trends. Measures of foraging effort—trip duration, total distance covered and maximun distance of the foraging trips from the breeding colony—decreased with increasing rate of population change. This information sug- gests that there are large differences in foraging effort and success among Patagonian penguin colonies, and penguins from Bahia Bustamante and Puerto Deseado, which are in the centre of the geographic range, require the highest foraging effort but are the least successful. It is plausible that lower population growth rates in these 2 colonies stem from the differences in food availabil- ity rather than any other process on land.
Dog Breed Identification

Pattern recognition(PR) is realized as a human recognition process which can be completed by computer technology. We should first enter useful information of identifying the object into the computer. For this reason, we must abstract the recognition object and establish its mathematical model to describe it and replace the recognition object for what the machine can process[1]. The description of this object is the pattern. Simply speaking, the pattern recognition is to identify the category to which the object belongs, such as the face in face recognition. Our project is based on PR which is to identify the dog’s breed. In our project, based on 10,000+ images of 120 breeds of dogs, we use 4 methods to do the identification. Each method has a different training model. The four models are ResNet18, VGG16, DenseNet161, and AlexNet. Based on our models, we also make some improvements on the optimization methods to increase our identification accuracy. After our comparisons, we find that the DenseNet model is the best, and we take it as our prime model. Our best accuracy can be up to 85.14%.
Local Routing with Simultaneous Transmission Attempts to Several Adjacent Nodes

This study introduces an efficient algorithm for local packet routing using twohop splitting of packet flows within a narrow (one hop away) routing corridor along a global end-to-end routing path. The main concept of the proposed algorithm is based on an attempt for simultaneous transmission of same packet from a local relaying node to two (or more) first neighbors within the routing corridor, which are connected to the global path to be followed by the packet flow. The transmission attempt is terminated as soon as the packet is successfully transmitted to one of the said first neighbors. Therefore, the fastest transmission at an instant of time allows one to speed up the local packet relaying.
VARIATION OF DOLLY VARDEN SALVELINUS MALMA IN NORTHWESTERN

Dolly Varden (Salvelinus malma (Walbaum)) are native to northwestern North America and northeast Asia. Current taxonomical classifications within S. malma are ambiguous due to the morphological and ecological plasticity observed throughout their range. Uncertainty exists regarding the number and status of geographic variants of S. malma throughout their North American distribution. The objective of this study was to define the number and distribution of natural Dolly Varden taxa below the species level in northern North America, and to assign those taxa to an appropriate level. Morphological characteristics were explored using analysis of variance (ANOVA) and principal component analysis in order to assess the geographic patterns of variation. Allozyme frequency data were collected from the literature and were used to construct trees representative of phylogenetic relationships. The patterns of variation observed correspond to an existing hypothesis that differentiates between a northern and southern form. Phylogenetic analysis indicates the northern and southern forms represent different ancestral clades, which may be indicative of subspecific taxa. The location of the boundary between the northern and southern form suggests the variation may stem from an historic separation during the late Pleistocene glaciation.
Influence of Customized Demand Generation as a Strategy to Increase Uptake of Voluntary Counseling and Testing Services amongst Sex Workers in Mumbai and Thane

Background: To demonstrate that customized demand generation leads to increased voluntary HIV counseling and testing (VCT) among Sex Workers (SWs). Methods: FHI 360 Aastha implemented Vivek intervention among SWs in Mumbai and Thane, India using customized demand generation through outreach services for VCT. Program monitoring data and integrated counseling and testing center tracking sheets were used to assess the intervention effect. Results: Higher proportion of registered SWs tested during: 1) Vivek months than other months (17% vs. 5%, p
EVALUATION OF STRUCTURAL RELIABILITY USING SIMULATION

Reliability is defined in EN 1990 (Eurocode 0 – Basis of structural design, [1]) as “the ability of a structure or a structural member to fulfill the specified requirements, including the design working life, for which it has been designed”. Reliability is usually expressed in probabilistic terms and it covers safety, serviceability and durability of a structure (see [1]). The following relation between the “probability of failure” Pf and the index of reliability is given in EN 1990, Annex C:
Improved equivalent circuit and analytical model for amorphous silicon solar cells and modules

An improved equivalent circuit for hydrogenated amorphous silicon (a-Si:H) solar cells and modules is presented. It is based on the classic combination of a diode with an exponential current-voltage characteristic, of a photocurrent source plus a new term representing additional recombination losses in the i-layer of the device. This model/equivalent circuit matches the I(V) curves of a-Si:H cells over an illumination range of six orders of magnitude. The model clearly separates effects related to the technology of the device (series and parallel resistance) and effects related to the physics of the p-i-n junction (recombination losses). It also allows an effective /spl mu//spl tau/ product in the i-layer of the device to be determined, characterizing its state of degradation.
Secure Multi-Agent Quantum Communication: Towards the Most Efficient Scheme (A Pedagogical Remark)

In many economic and financial applications, it is important to have secure communications. At present, communication security is provided mostly by RSA coding, but the emergent quantum computing can break this encoding, thus making it not secure. One way to make communications absolutely secure is to use quantum encryption. The existing schemes for quantum encryption are aimed at agent-to-agent communications; however, in practice, we often need secure multi-agent communications, where each of the agents has the ability to securely send messages to everyone else. In principle, we can repeat the agent-to-agent scheme for each pair of agents, but this requires a large number of complex preliminary quantum communications. In this paper, we show how to minimize the number of such preliminary communications – without sacrificing reliability of the all-pairs scheme. 1 Need for Secure Group Communications Need for secure communications. In e-commerce and e-finance, it is important to preserve privacy and confidentiality of all the transactions. In other words, we need to make sure that e-commerce and e-finance are based on a secure communication scheme. How communications are made secure now. At present, secure communications are based mostly on the RSA algorithm; see, e.g., [1]. In this scheme, the communicator A selects two large prime numbers P1 and P2 that he/she keeps private, and releases their product P = P1 · P2 into the public domain. This public code P can then be used any anyone to encode the messages they send to A. To decode the messages, one needs to know the factors P1 and P2. Since A knows these factors, A can decode these messages.
Transition in swimming direction in a model self-propelled inertial swimmer

Author(s): Dombrowski, Thomas; Jones, Shannon K; Katsikis, Georgios; Bhalla, Amneet Pal Singh; Griffith, Boyce E; Klotsa, Daphne | Abstract: We propose a reciprocal, self-propelled model swimmer at intermediate Reynolds numbers ($Re$). Our swimmer consists of two unequal spheres that oscillate in antiphase generating nonlinear steady streaming (SS) flows. We show computationally that the SS flows enable the swimmer to propel itself, and also switch direction as $Re$ increases. We quantify the transition in the swimming direction by collapsing our data on a critical $Re$ and show that the transition in swimming directions corresponds to the reversal of the SS flows. Based on our findings, we propose that SS can be an important physical mechanism for motility at intermediate $Re$.
Control Over Gaussian Channels With and Without Source–Channel Separation

We consider the problem of controlling an unstable linear plant with Gaussian disturbances over an additive white Gaussian noise channel with an average transmit power constraint, where the signaling rate of communication may be different from the sampling rate of the underlying plant. Such a situation is quite common since sampling is done at a rate that captures the dynamics of the plant and that is often lower than the signaling rate of the communication channel. This rate mismatch offers the opportunity of improving the system performance by using coding over multiple channel uses to convey a single control action. In a traditional, separation-based approach to source and channel coding, the analog message is first quantized down to a few bits and then mapped to a channel codeword whose length is commensurate with the number of channel uses per sampled message. Applying the separation-based approach to control meets its challenges: first, the quantizer needs to be capable of zooming in and out to be able to track unbounded system disturbances, and second, the channel code must be capable of improving its estimates of the past transmissions exponentially with time, a characteristic known as anytime reliability. We implement a separated scheme by leveraging recently developed techniques for control over quantized-feedback channels and for efficient decoding of anytime-reliable codes. We further propose an alternative, namely, to perform analog joint source–channel coding, by this avoiding the digital domain altogether. For the case where the communication signaling rate is twice the sampling rate, we employ analog linear repetition as well as Shannon–Kotel’nikov maps to show a significant improvement in stability margins and linear-quadratic costs over separation-based schemes. We conclude that such analog coding performs better than separation, and can stabilize all moments as well as guarantee almost-sure stability.
Parkinsonism and Related Disorders

Background: Impaired olfaction is an important feature in Parkinson's disease (PD) and other neurological diseases. A variety of smell identification tests exist such as “Sniffin’ Sticks” and the University of Pennsylvania Smell Identification Test (UPSIT). An important part of research is being able to replicate findings or combining studies in a meta-analysis. This is difficult if olfaction has been measured using different metrics. We present conversion methods between the: UPSIT, Sniffin’ 16, and Brief-SIT (B-SIT); and Sniffin’ 12 and Sniffin’ 16 odour identification tests. Methods: We used two incident cohorts of patients with PD who were tested with either the Sniffin’ 16 (n 1⁄4 1131) or UPSIT (n 1⁄4 980) and a validation dataset of 128 individuals who took both tests. We used the equipercentile and Item Response Theory (IRT) methods to equate the olfaction scales. Results: The equipercentile conversion suggested some bias between UPSIT and Sniffin’ 16 tests across the two groups. The IRT method shows very good characteristics between the true and converted Sniffin’ 16 (delta mean 1⁄4 0.14, median 1⁄4 0) based on UPSIT. The equipercentile conversion between the Sniffin’ 12 and 16 item worked well (delta mean 1⁄4 0.01, median 1⁄4 0). The UPSIT to B-SIT conversion showed evidence of bias but amongst PD cases worked well (mean delta 1⁄4 0.08, median 1⁄4 0). Conclusion: We have demonstrated that one can convert UPSIT to B-SIT or Sniffin’ 16, and Sniffin’ 12 to 16 scores in a valid way. This can facilitate direct comparison between tests aiding future collaborative analyses and evidence synthesis. © 2016 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
The Study of Ideological Manipulation in Persian Translations of Noam Chomsky’s Media Control Based on Farahzad’s Translation Criticism Model

Abstract Critical Discourse Analysis as an interdisciplinary approach aims at making transparent the connections between discourse practices and social practices and provides ways of looking into translations from a critical standpoint.Farahzad is among the scholars who presented her specific CDA model inspired by Fairclough’s approach. The present Critical Discourse Analysis (CDA)-based study aimed to explore the probable ideological manipulations exerted in the three translations of a single English political book called "Media Control" by "Noam Chomsky. " This comparative qualitative study was conducted based on Farahzad’s (2011) three-dimensional CDA model. The textual, paratextual, and semiotic as-pects were critically scrutinized. At textual level, it was revealed that different manipulative strategies, mostly addition, deletion, and deliberate lexical selection were applied by the translators to incorporate their own ideologiesand stances.At paratextual level, the existence of extended footnoteswasobserved , and at semiotic level, the book covers’ designs and colour combinations which were the indicators of the translators’ lines of thoughts and ideologies were analyzed.
Mechanical Properties and Conversion Relations of Strength Indexes for Stone/Sand-Lightweight Aggregate Concrete

This is a study of the basic mechanical properties of specified density shale aggregate concrete, which is based on different replacement rates in stone-lightweight aggregate concrete (stone-LAC) and sand-lightweight aggregate concrete (sand-LAC). They were prepared by replacing the ceramsite and pottery sand with stone and river sand, respectively. Many tests were performed regarding the basic mechanical property indexes, including tests of cube compressive strength, axial compressive strength, splitting tensile strength, flexural strength, elastic modulus and Poisson’s ratio. The failure modes of specified density shale aggregate concrete were obtained. The effects of replacement rates on the mechanical property indexes of specified density shale aggregate concrete were analyzed. Calculation models were implemented for elastic modulus, for the conversion relations between the axial compressive strength and the cube compressive strength, and for the relations between the tension-compression ratio and Poisson’s ratio. It was shown that when the replacement rate of stone or river sand increased from 0% to 100%, the cube compressive strength of stone-LAC and sand-LAC increased, respectively, by 55% and 25%, the axial compressive strength increased, respectively, by 91% and 72%, splitting tensile strength increased, respectively, by 99% and 44%, and the flexural strength increased, respectively, by 46% and 26%. Similarly, the elastic modulus of stone-LAC and sand-LAC increased, respectively, by 16% and 30%. However, Poisson’s ratio for stone-LAC decreased first and then increased, eventually increased by 11%; Poisson’s ratio for sand-LAC only reduced gradually, eventually reduced by 67%. After introducing the influence parameter for the replacement rate, the established calculation models become simple and practical, and the calculation accuracies are favorable.
Genetic-Gated Networks for Deep Reinforcement Learning

We introduce the Genetic-Gated Networks (G2Ns), simple neural networks that combine a gate vector composed of binary genetic genes in the hidden layer(s) of networks. Our method can take both advantages of gradient-free optimization and gradient-based optimization methods, of which the former is effective for problems with multiple local minima, while the latter can quickly find local minima. In addition, multiple chromosomes can define different models, making it easy to construct multiple models and can be effectively applied to problems that require multiple models. We show that this G2N can be applied to typical reinforcement learning algorithms to achieve a large improvement in sample efficiency and performance.
Concentration of symplectic volumes on Poisson homogeneous spaces

For a compact Poisson-Lie group $K$, the homogeneous space $K/T$ carries a family of symplectic forms $\omega_\xi^s$, where $\xi \in \mathfrak{t}^*_+$ is in the positive Weyl chamber and $s \in \mathbb{R}$. The symplectic form $\omega_\xi^0$ is identified with the natural $K$-invariant symplectic form on the $K$ coadjoint orbit corresponding to $\xi$. The cohomology class of $\omega_\xi^s$ is independent of $s$ for a fixed value of $\xi$. In this paper, we show that as $s\to -\infty$, the symplectic volume of $\omega_\xi^s$ concentrates in arbitrarily small neighbourhoods of the smallest Schubert cell in $K/T \cong G/B$. This strengthens earlier results [9,10] and is a step towards a conjectured construction of global action-angle coordinates on $Lie(K)^*$ [4, Conjecture 1.1].