Miracle-dz/UniFAR-FTUs huggingface dataset:
Dietary carbohydrate and lipid source affect cholesterol metabolism of European sea bass (Dicentrarchus labrax) juveniles

Abstract Plant feedstuffs (PF) are rich in carbohydrates, which may interact with lipid metabolism. Thus, when considering dietary replacement of fishery by-products with PF, knowledge is needed on how dietary lipid source (LS) and carbohydrates affect lipid metabolism and other metabolic pathways. For that purpose, a 73-d growth trial was performed with European sea bass juveniles (IBW 74 g) fed four diets differing in LS (fish oil (FO) or a blend of vegetable oils (VO)) and carbohydrate content (0 % (CH–) or 20 % (CH+) gelatinised starch). At the end of the trial no differences among diets were observed on growth and feed utilisation. Protein efficiency ratio was, however, higher in the CH+ groups. Muscle and liver fatty acid profiles reflected the dietary LS. Dietary carbohydrate promoted higher plasma cholesterol and phospholipids (PL), whole-body and hepatic (mainly 16 : 0) lipids and increased muscular and hepatic glycogen. Except for PL, which were higher in the FO groups, no major alterations between FO and VO groups were observed on plasma metabolites (glucose, TAG, cholesterol, PL), liver and muscle glycogen, and lipid and cholesterol contents. Activities of glucose-6-phosphate dehydrogenase and malic enzyme – lipogenesis-related enzymes – increased with carbohydrate intake. Hepatic expression of genes involved in cholesterol metabolism was up-regulated with carbohydrate (HMGCR and CYP3A27) and VO (HMGCR and CYP51A1) intake. No dietary regulation of long-chain PUFA biosynthesis at the transcriptional level was observed. Overall, very few interactions between dietary carbohydrates and LS were observed. However, important insights on the direct relation between dietary carbohydrate and the cholesterol biosynthetic pathway in European sea bass were demonstrated.
Exploring and mitigating privacy threats of HTML5 geolocation API

The HTML5 Geolocation API realizes location-based services via theWeb by granting web sites the geographical location information of user devices. However, the Geolocation API can violate a user's location privacy due to its coarse-grained permission and location models. The API provides either exact location or nothing to web sites even when they only require approximate location. In this paper, we first conduct case studies on numerous web browsers and web sites to explore how they implement and utilize the Geolocation API. We detect 14 vulnerable web browsers and 603 overprivileged web sites that can violate a user's location privacy. To mitigate the privacy threats of the Geolocation API, we propose a novel scheme that (1) supports fine-grained permission and location models, and (2) recommends appropriate privacy settings to each user by inspecting the location sensitivity of each web page. Our scheme can accurately estimate each web page's necessary geolocation degree (estimation accuracy: ~93.5%). We further provide suggestions to improve the Geolocation API.
Climbing the Goal Ladder: How Upcoming Actions Increase Level of Aspiration Expressing Commitment versus Making Progress Remaining Actions Increase Level of Aspiration

Pursuing a series of progressive (e.g., professional) goals that form a goal ladder often leads to a trade-off between moving up to a more advanced level and repeating the same goal level. This article investigates how monitoring one's current goal in terms of remaining actions versus completed actions influences the desire to move up the goal ladder. The authors propose that a focus on remaining (vs. completed) actions increases the motivation to move up to a more advanced level, whereas the focus on completed (vs. remaining) actions increases the satisfaction derived from the present level. They find support for these predictions across several goal ladders, ranging from academic and professional ladders to simple, experimental tasks. They further find that individuals strategically attend to information about remaining (vs. completed) actions to prepare to move up the goal ladder. People's goals, whether they constitute central life objectives or mundane everyday pursuits, often follow a " goal ladder " in which each goal is a step toward another, more challenging goal. For example, people's career paths often follow a goal ladder in which an entry-level position is a step toward a more advanced position in the organization. Even more mundane goals, such as playing a computer game, often include different levels in which a person can move up, for example, by advancing from Level 3 to Level 4. In addition, goal ladders characterize learning goals, such as when people move from a beginner to an intermediate level when they acquire a new skill. The goal ladder can be highly structured, for example, when moving up the military ranks (from private to corporal) or the academic ranks (from assistant to associate). However, at other times, goal ladders are less structured, for example, when people seek to move to a position with more challenges and responsibilities than their current one, sometimes without being aware of their desire to advance. Regardless of the specific features of the goal ladder, individuals face a dilemma between moving up to a more advanced level versus repeating the current level for their next pursuit. Choosing a more advanced level often requires the individual to invest more effort, yet it can offer certain benefits (e.g., greater interest). As such, we explore whether the way individuals monitor their current goal— either in terms of remaining actions or completed actions— influences their aspiration level for their next goal level. We examine, for example, …
Applied Behaviour Analysis and Autism: Science, Profession, and Practice

Applied Behaviour Analysis (ABA) is recognised as the scientific basis of effective interventions in many educational, social, and medical fields, including autism. In this chapter, the basic tenets of ABA are described and briefly reviewed. Autism aetiology, diagnosis and prevalence are sketched out and the remainder of the chapter focuses on ABA-based interventions for children with autism. The chapter concludes with an exami - nation of internationally recognised training standards for behaviour analysts.
Isolation and Characterization of Human Recombinant Antibodies Endowed with the Antigen-specific , Major Histocompatibility Complex-restricted Specificity of T Cells Directed toward the Widely Expressed Tumor T-cell Epitopes of the Telomerase Catalytic Subunit 1

The recent characterization of MHC-displayed tumor-associated antigens that recognize effector cells of the immune system has created new perspectives for cancer therapy. Antibodies that recognize these tumorassociated MHC-peptide complexes with the same specificity as the T-cell antigen receptor will therefore be valuable tools for immunotherapy as well as for studying antigen presentation in human cancers. Most tumorassociated antigens are expressed in only one or a few tumor types; however, recently specific T-cell epitopes derived from the telomerase catalytic subunit (hTERT) that are widely expressed in many cancers were identified and shown to be recognized by CTLs derived from cancer patients. We selected a large nonimmune repertoire of phage Fab antibodies on recombinant human class I HLA-A2 complexes displaying two distinct antigenic T-cell epitopes derived from hTERT. We isolated a surprisingly large panel of high-affinity human recombinant Fab antibodies that exhibited peptide-specific, MHC-restricted binding characteristics of T cells. The analyzed Fabs not only recognize the cognate MHC-peptide complex in a recombinant soluble form but also the native complex as displayed on the surface of antigen-presenting cells and hTERT-expressing tumor cells. These findings demonstrate for the first time the ability to transform the unique fine specificity but low intrinsic affinity of TCRs on T cells into high-affinity soluble antibody molecules endowed with a T-cell antigen receptor-like specificity. These molecules may prove to be very important and widely applicable for monitoring the expression of specific MHC-peptide complexes on the surface of tumor and immune cells, for structure-function studies of TCR-peptide-MHC interactions, as well as for developing new targeting agents for immunotherapy.
A probabilistic algorithm for finding the minimum-size stopping sets of LDPC codes

On the binary erasure channel, the performance of LDPC codes decoded by iterative algorithms is dominated by small-size stopping sets, especially minimal stopping sets. In this paper, we propose a probabilistic algorithm for computing the minimum size of stopping sets of LDPC codes. In this algorithm, we generate efficiently small-size stopping sets by using the relation between small-size stopping sets and low-weight codewords. In numerical experiments, we could compute the minimum size of stopping sets of LDPC codes of length about 500, 1000 and 5000 with high reliability, and could find smaller stopping sets than that found by conventional methods.
It's Time for Low Latency

The operating systems community has ignored network latency for too long. In the past, speed-of-light delays in wide area networks and unoptimized network hard-ware have made sub-100µs round-trip times impossible. However, in the next few years datacenters will be deployed with low-latency Ethernet. Without the burden of propagation delays in the datacenter campus and network delays in the Ethernet devices, it will be up to us to finish the job and see this benefit through to applications. We argue that OS researchers must lead the charge in rearchitecting systems to push the boundaries of low-latency datacenter communication. 5-10µs remote procedure calls are possible in the short term - two orders of magnitude better than today. In the long term, moving the network interface on to the CPU core will make 1µs times feasible.
Default and Credit Constraint in General equilibrium

We study an economy where infinitely living agents face uninsurable shocks and are allowed default on their debt. After having defaulted, agents are excluded from the economy. We present a equilibrium definition allowing for both credit constraints and default inequilibrium. Indeed, existing theories introduce either default of credit constraint in general equilibrium, but never both. We prove that the optimal allocation includes both credit constraints and default, while the market allocation is associated with too much credit and too many default in equilibrium.
Grounding Nursing Simulations in Caring: An Innovative Approach

Nursing is a discipline of knowledge and a field of professional practice grounded in caring (Christine E. Lynn College of Nursing Philosophy, 2005). Simulation in nursing education generally does not take an approach that recognizes the unique individual who is dynamically interconnected with others and the environment in a caring relationship. The challenge has been to develop simulation scenarios that integrate and appreciate multiple ways of knowing in nursing. This paper describes a process for assuring that the learning of nursing using simulation technology is grounded in caring.
Cyp26 enzymes generate the retinoic acid response pattern necessary for hindbrain development

Retinoic acid (RA) is essential for normal vertebrate development, including the patterning of the central nervous system. During early embryogenesis, RA is produced in the trunk mesoderm through the metabolism of vitamin A derived from the maternal diet and behaves as a morphogen in the developing hindbrain where it specifies nested domains of Hox gene expression. The loss of endogenous sources of RA can be rescued by treatment with a uniform concentration of exogenous RA, indicating that domains of RA responsiveness can be shaped by mechanisms other than the simple diffusion of RA from a localized posterior source. Here, we show that the cytochrome p450 enzymes of the Cyp26 class, which metabolize RA into polar derivatives, function redundantly to shape RA-dependent gene-expression domains during hindbrain development. In zebrafish embryos depleted of the orthologs of the three mammalian CYP26 genes CYP26A1, CYP26B1 and CYP26C1, the entire hindbrain expresses RA-responsive genes that are normally restricted to nested domains in the posterior hindbrain. Furthermore, we show that Cyp26 enzymes are essential for exogenous RA to rescue hindbrain patterning in RA-depleted embryos. We present a `gradient-free' model for hindbrain patterning in which differential RA responsiveness along the hindbrain anterior-posterior axis is shaped primarily by the dynamic expression of RA-degrading enzymes.
In the Spotlight: Analyzing Sequential Attention Effects in Protest Reporting

During waves of contention, international media attention can be of crucial importance for activists and protest participants. However, media attention is a scarce resource and the competition over news coverage is high. While some emphasize the agenda-setting power of news outlets and argue that receiving coverage is determined by factors outside the protest movement, others suggest a dynamic relationship between media attention and activism where social movement organizations are assumed to have some agency to make it to the news. In this article, we contribute to the latter and analyze how protest can endogenously trigger more coverage. Building on insights from communication science, we argue that widely covered protests attract media attention and temporarily lower the selection threshold for subsequent incidents. Using fine-grained data on anti-regime protest in all authoritarian countries between 2003 and 2012, we find robust empirical evidence for this hypothesis. We also show that this effect becomes weaker and eventually disappears with increasing spatial and temporal distance from a highly salient event. These findings are important for research in contentious politics, since they allow us to gauge the extent to which protest activity on the ground may under certain circumstances be overreported in the media.
Letter Special Section on Selected Papers from the 11th Workshop on Circuits and Systems in Karuizawa an Algorithm for Petri Nets Reachability by Unfoldings

SUMMARY This paper proposes an algorithm for analyzing the reachability property of Petri nets by the use of unfoldings. It is known that analyzing the reachability by using unfoldings requires exponential time and space to the size of unfolding. The algorithm is based on the branch and bound technique, and experimental results show efficiency of the algorithm.
Content-based Image Retrieval in Medical Applications

Summary Objectives: To develop a general structure for semantic image analysis that is suitable for content-based image retrieval in medical applications and an architecture for its efficient implementation. Methods: Stepwise content analysis of medical images results in six layers of information modeling incorporating medical expert knowledge (raw data layer, registered data layer, feature layer, scheme layer, object layer, knowledge layer). A reference database with 10,000 images categorized according to the image modality, orientation, body region, and biological system is used. By means of prototypes in each category, identification of objects and their geometrical or temporal relationships are handled in the object and the knowledge layer, respectively. A distributed system designed with only three core elements is implemented: (i) the central database holds program sources, processing scheme descriptions, images, features, and administrative information about the workstation cluster; (ii) the scheduler balances distributed computing; and (iii) the web server provides graphical user interfaces for data entry and retrieval, which can be easily adapted to a variety of applications for content-based image retrieval in medicine. Results: Leaving-one-out experiments were distributed by the scheduler and controlled via corresponding job lists offering transparency regarding the viewpoints of a distributed system and the user. The proposed architecture is suitable for content-based image retrieval in medical applications. It improves current picture archiving and communication systems that still rely on alphanumerical descriptions, which are insufficient for image retrieval of high recall and precision.
Radio observations of the Horologium-Reticulum supercluster – I. A3158: excess star-forming galaxies in a merging cluster?

We present 1.4- and 2.5-GHz Australia Telescope Compact Array (ATCA) observations of the galaxy cluster A3158 (z= 0.0597) which is located within the central part of the Horologium-Reticulum supercluster (HRS). Spectroscopic data for the central part of the HRS suggest that A3158 is in a dynamically important position within the supercluster and that it is moving toward the double cluster system A3125/A3128 which marks the centre of the HRS. A total of 110 radio galaxies are detected in a 35-arcmin radius about the cluster at 1.4 GHz, of which 30 are also detected at 2.5 GHz. We examine the source counts and compute the radio luminosity function (RLF) at 1.4 GHz from the subset of 88 sources found within the full-width half-power area of the ATCA beam. Comparison of the source counts in the area over the background, as computed by Prandoni et al., shows some evidence of an excess of galaxies with L1.4 GHz≤ 2 × 1022 W Hz−1 . This result seems to indicate a star-forming population and is a result similar to that found recently by Owen et al. for the merging cluster A2125. In addition we find that the RLF for early-type galaxies (E and S0) below log P1.4∼ 22.5 is lower than that found for a composite cluster environment but is similar to the early-type RLF for clusters in the centre of the Shapley supercluster which are believed to be in the latter stages of merging. This result implies that the cores of superclusters are environments where radio emission, particularly resultant from active galactic nucleus (AGN), is suppressed in the later stages of merging. Thus, radio observations of clusters might be sensitive indicators of the precise merger stage of the cluster but more observational evidence is still required to establish this trend.
Significance of Antioxidant Potential of Plants and its Relevance to Therapeutic Applications

Oxidative stress has been identified as the root cause of the development and progression of several diseases. Supplementation of exogenous antioxidants or boosting endogenous antioxidant defenses of the body is a promising way of combating the undesirable effects of reactive oxygen species (ROS) induced oxidative damage. Plants have an innate ability to biosynthesize a wide range of non-enzymatic antioxidants capable of attenuating ROS- induced oxidative damage. Several in vitro methods have been used to screen plants for their antioxidant potential, and in most of these assays they revealed potent antioxidant activity. However, prior to confirming their in vivo therapeutic efficacy, plant antioxidants have to pass through several physiopharmacological processes. Consequently, the findings of in vitro and in vivo antioxidant potential assessment studies are not always the same. Nevertheless, the results of in vitro assays have been irrelevantly extrapolated to the therapeutic application of plant antioxidants without undertaking sufficient in vivo studies. Therefore, we have briefly reviewed the physiology and redox biology of both plants and humans to improve our understanding of plant antioxidants as therapeutic entities. The applications and limitations of antioxidant activity measurement assays were also highlighted to identify the precise path to be followed for future research in the area of plant antioxidants.
Deriving the convex hull of a polynomial partitioning set through lifting and projection ∗

Relaxations of the bilinear term, x1x2 = x3, play a central role in constructing relaxations of factorable functions. This is because they can be used directly to relax products of functions with known relaxations. In this paper, we provide a compact, closed-form description of the convex hull of this and other more general bivariate monomial terms (which have similar applications in relaxation constructions) in the space of the original variables assuming that the variables and the monomial are restricted to lie in a hyperrectangle. This description is obtained as an intersection of convex hulls of related packing, x1x b2 2 ≤ x3, and covering, x b1 1 x b2 2 ≥ x3, sets, where b1 and b2 are constants greater than or equal to one. The convex hull of each packing/covering set is first obtained as an intersection of semi-infinite families of linear inequalities, each derived using lifting techniques. Then, each family is projected into a few linear/nonlinear inequalities which are fully characterized in the space of the original problem variables.
Fluid-Fluid Collision for Particle-Based Immiscible Fluid Animation

In this paper, we propose a new fluid-fluid collisi on model for particle-based immiscible fluid animation . Our model consists of two components, namely, colli sion detection and collision response. An interesti ng feature is that our model not only can prevent immi scible fluids from mixing with each other, but also can allow one fluid to run through or to wrap around an other fluid. The model is very flexible and can wor k with many existing particle-based fluid models. The animation results are presented and show that the p roposed model can produce many interesting fluid anim tions.
Classification theorems for the C*-Algebras of graphs with sinks

We consider graphs E which have been obtained by adding one or more sinks to a fixed directed graph G. We classify the C*-algebra of E up to a very strong equivalence relation, which insists, loosely speaking, that C*(G) is kept fixed. The main invariants are vectors WE: G0 → ℕ which describe how the sinks are attached to G; more precisely, the invariants are the classes of the WE in the cokernel of the map A – I, where A is the adjacency matrix of the graph G.
Efficient space/time compression to reduce test data volume and testing time for IP cores

We present 2D (space/time) compression techniques that reduce test data volume and test application time for scan testing of intellectual property (IP) cores. We start with a set of test cubes and use the well-known concept of scan chain compatibility to determine a small number c of tester channels that are needed to drive m scan chains (c /spl Lt/ m). Next, we exploit logic dependencies between the test data for the scan chains to design a single-level decompression circuit based on two-input gates. We refer to these procedures collectively as width (space) compression. We then determine a small set of test patterns that can provide complete fault coverage when they are applied to the circuit under test using the c tester channels; this procedure is referred to as height (time) compression. In this way, structural information about the IP cores is not necessary for fault simulation, dynamic compaction, or test generation. The hardware overhead of the proposed approach is limited to the fan-out structure and a very small number of gates between the tester-driven external scan pins and the internal scan chains. Results are presented for the ISCAS-89 benchmarks and for four industrial circuits.