Miracle-dz/UniFAR-FTUs huggingface dataset:
CPM EQUALIZATION OF ISI DUE TO BAND-LIMITING

We examine and compare three approaches to the problem of equalization of band-limited CPM signals, with a view towards practical implementation. The performance benchmark approach is to use a max likelihood sequence estimator for equalization (MLSE). The first alternative approach – used in conjunction with MLSE – is to shorten the channel impulse response so that a low complexity MLSE equalizer can be utilized. Thereto the channel truncation structure by Falconer and Magee is adapted to CPM signals, and uses a pre-filter to shape the overall response of the channel to a desired impulse response of short duration. Simulation results show that near MLSE performance can be obtained while reducing the complexity of the MLSE equalizer. In the second alternative approach, we focus on eliminating the group delay variations inside the channel passband using an FIR pre-filter, before MLSE processing. Assuming the channel to be time-invariant, an FIR group delay compensator is designed so that the resulting group delay is more constant over the filter passband. Simulation results show that reducing the channel passband group delay variation reduces the amount of ISI and improves the resulting bit error rate (BER) performance. The group delay compensation approach is simpler than channel shortening, while approaching it in terms of BER performance.
Differences in University Students’ Cultural Dispositions and Psychological Health Levels According to Morality

The purpose of the present study is to examine the relationship between moral value and cultural dispositions and psychological health among university students. The data were obtained through structured survey research conducted with 326 students in four universities in D City. According to the results of one-way ANOVA analysis result, none of 9 categories of the sub factors of cultural dispositions and psychological health showed the difference among the three morality level groups. The discussion and limitation of this result are noted.
PPAR-α and -γ agonists attenuate diabetic kidney disease in the apolipoprotein E knockout mouse

Backgound. Peroxisome proliferator-activated receptor (PPAR)-a and PPAR-g agonists are widely used in diabetes. In addition to their effects on lipid and glucose homeostasis, these agents have been postulated to have independent renoprotective actions. In the current study, we assess the efficacy of the PPAR-a agonist, gemfibrozil, the PPAR-g agonist rosiglitazone and the non-thiazolidinedione PPAR-a/g coagonist, compound 3q, on kidney structure and function in streptozotocin-treated apolipoprotein E knockout mice. Methods. Control and streptozotocin-diabetic mice were randomized to receive rosiglitazone (20 mg/kg/ day), gemfibrozil (100 mg/kg/day), or compound 3q (3 mg/kg/day) by gavage, or no treatment for a period of 20 weeks. Renal fibrosis was assessed by standard histology and collagen IV immunohistochemistry. Kidney function was assessed by urinary albumin excretion and creatinine clearance. Results. Diabetes in this model was associated with an increase in glomerulosclerosis, tubulointerstitial fibrosis and increased collagen IV deposition in the glomeruli and tubules. All three agents significantly attenuated glomerulosclerosis, tubulointerstitial expansion and collagen IV deposition. The increase in albuminuria and the decline in kidney function associated with diabetes in this model were also attenuated by each of these agents, with no superiority observed among various treatment groups. These renoprotective effects were observed in the absence of changes in glucose, insulin or lipid levels or a reduction in blood pressure. Conclusions. Combined with their independent antiatherosclerotic actions, and their important effects on dyslipidaemia and insulin resistance, PPAR agonists may be useful for the prevention of diabetic complications, including kidney disease, even in type 1 diabetes.
A BRANCH-AND-CUT ALGORITHM FOR THE CAPACITATED LOCATION-ROUTING PROBLEM

This paper describes a branch-and-cut algorithm for the Capacitated LocationRouting Problem (CLRP). In the CLRP customers with known demands must be served from capacitated facilities by an unlimited fleet of homogeneous, capacitated vehicles. The problem is to select a subset of potential facilities and to design vehicle routes around these facilities so that every customer is visited exactly once and capacities are respected. The problem is formulated as a two-index vehicle-flow problem with homogeneous vehicles. We present strengthenings of some known valid inequalities and introduce new families that improve the formulation. Results of computational experiments show that our formulation with the additional cuts provides tight lower bounds that are competitive with the ones reported in the literature for other vehicle-flow formulations. Moreover, our algorithm solves an open instance containing 88 customers and 8 facilities.
Families of hyperelliptic curves

The main subject is the difference between the coarse moduli space and the stack of hyperelliptic curves. In particular, we compute their Picard groups, giving explicit description of the generators. We also study how many families of hyperelliptic curves may have the same modular map as well as the existence of the tautological family over the coarse moduli space of hyperelliptic curves.
A Classification of Challenges in the Semantic Web Based on the General Architecture

The Semantic Web has the purpose of making information available and understandable for computers and humans. However, some issues and challenges are present during this process. This paper presents a proposal of challenges in the Semantic Web. In this sense, we have considered an organization of three categories based on the general architecture proposed by Berners-Lee: Representation, Reasoning/Querying, and Quality. We also mention some methods for partially solving these challenges, and drawbacks of using machine learning approaches.
Visualizing Large Dynamic Digraphs

In this paper we investigate the problem of visually representing large dynamic directed graphs with many vertices, edges, and time steps. With this work we do not primarily focus on graph details but more on achieving an overview about long graph sequences with the major focus to be scalable in vertex, edge, and time dimensions. To reach this goal we first map each graph to a bipartite layout with vertices in the same order for each graph supporting a preservation of the viewers’ mental map. A sequence of graphs is placed in a left-to-right reading direction. To further reduce link crossings we draw partial links with user-definable lengths and finally apply edge splatting as a concept to emphasize graph structures by color coding the generated density fields. Time-varying visual patterns can be recognized by inspecting the changes in the color coding in certain regions in the display. We illustrate the usefulness of the approach in two case studies investigating call graph sequences changing during software development with 21 releases which is a rather short graph sequence but contains several thousand vertices and edges. Visual scalability in the time dimension is shown in a data set with more than 1,000 graphs from a dynamic social network data set consisting of face-to-face conversation relations acquired during the Hypertext 2009 conference recorded by RFID badges.
Edge-Streett/Edge-Rabin Automata Environment for Formal Verification Using Language Containment

We present the edge-Streett/edge-Rabin environment for doing veriication using language containment. This environment has a number of desirable properties compared with the L-process/L-automaton environment ((Kur87b]), which is a practical language-containment-based formal veriication environment: It contains the L-environment as a subset. It can be exponentially more compact than the L-environment. We present BDD-based algorithms for main veriication functions in this environment, and argue that they are eecient. Furthermore, if the speciications come from the L-environment, our algorithms reduce to the algorithms of HTKB92] and HBK93] for the L-environment. It is in some sense maximal, i.e. language containment check for the next natural extension to our environment is NP-complete (as opposed to polynomial). We have implemented our algorithms in our veriication tool, and will present a exible user interface to this environment.
Force Generation upon T Cell Receptor Engagement

T cells are major players of adaptive immune response in mammals. Recognition of an antigenic peptide in association with the major histocompatibility complex at the surface of an antigen presenting cell (APC) is a specific and sensitive process whose mechanism is not fully understood. The potential contribution of mechanical forces in the T cell activation process is increasingly debated, although these forces are scarcely defined and hold only limited experimental evidence. In this work, we have implemented a biomembrane force probe (BFP) setup and a model APC to explore the nature and the characteristics of the mechanical forces potentially generated upon engagement of the T cell receptor (TCR) and/or lymphocyte function-associated antigen-1 (LFA-1). We show that upon contact with a model APC coated with antibodies towards TCR-CD3, after a short latency, the T cell developed a timed sequence of pushing and pulling forces against its target. These processes were defined by their initial constant growth velocity and loading rate (force increase per unit of time). LFA-1 engagement together with TCR-CD3 reduced the growing speed during the pushing phase without triggering the same mechanical behavior when engaged alone. Intracellular Ca2+ concentration ([Ca2+]i) was monitored simultaneously to verify the cell commitment in the activation process. [Ca2+]i increased a few tens of seconds after the beginning of the pushing phase although no strong correlation appeared between the two events. The pushing phase was driven by actin polymerization. Tuning the BFP mechanical properties, we could show that the loading rate during the pulling phase increased with the target stiffness. This indicated that a mechanosensing mechanism is implemented in the early steps of the activation process. We provide here the first quantified description of force generation sequence upon local bidimensional engagement of TCR-CD3 and discuss its potential role in a T cell mechanically-regulated activation process.
Sedimentation of Free and AttachedCryptosporidium Oocysts and Giardia Cysts in Water

ABSTRACT Experimental analysis of the sedimentation velocity ofCryptosporidium parvum oocysts and Giardia lamblia cysts was compared with mathematical description of their sedimentation velocities by using measurements of (oo)cyst size and density and the density and viscosity of the sedimentation medium to determine if the sedimentation kinetics of freely suspended oocysts ofC. parvum and cysts of G. lamblia can be described by Stokes’ law. The theoretically calculated sedimentation kinetics showed a good agreement with the experimentally observed kinetics. Both showed a decline in sedimentation velocity over time, caused primarily by variation in (oo)cyst density. The initial apparent sedimentation velocities in Hanks balanced salt solution at 23°C was 0.35 μm · s−1 for oocysts and 1.4 μm · s−1 for cysts. (Oo)cysts that enter the surface water environment by discharges of biologically treated sewage may be attached to sewage particles, and this will affect their sedimentation kinetics. Therefore, (oo)cysts were mixed with settled secondary effluent. (Oo)cysts readily attached to the (biological) particles in effluent; 30% of both cysts and oocysts attached during the first minutes of mixing, and this fraction increased to approximately 75% after 24 h. The sedimentation velocity of (oo)cysts attached to secondary effluent particles increased with particle size and was (already in the smallest size fraction [1 to 40 μm]) determined by the sedimentation kinetics of the effluent particles. The observed sedimentation velocities of freely suspended (oo)cysts are probably too low to cause significant sedimentation in surface water or reservoirs. However, since a significant proportion of both cysts and oocysts attached readily to organic biological particles in secondary effluent, sedimentation of attached (oo)cysts after discharge into surface water will probably be a significant factor in the environmental ecology ofC. parvum and G. lamblia. Attachment to particles influences not only sedimentation of (oo)cysts in surface water but also their behavior in drinking water treatment processes.
A RED discard strategy for ATM networks and its performance evaluation with TCP/IP traffic

In ATM UBR networks supporting TCP traffic, optimal efficiency can only be envisaged if switches adopt a discard mechanism that operates at the packet level rather than the cell level. In this paper, we define a variant of the RED discard strategy suitable for ATM switches. An interesting feature of this ATM-RED is that it has a similar per-VC implementation complexity as the Early Packet Discard (EPD) algorithm. To study the efficiency of the ATM-RED discard strategy, we compare its performance with plain the UBR, EPD and Fair Buffer Acceptance (FBA) discard strategies by means of simulation with TCP/IP traffic. We give comparative results with respect to different performance criteria such as goodput and fairness in various environments, such as end-to-end ATM networks and IP-based networks with an ATM backbone, in both single-bottlenecked and GFC topologies.
Effects of exercise intensity and nutrition advice on myocardial function in obese children and adolescents: a multicentre randomised controlled trial study protocol

Introduction The prevalence of paediatric obesity is increasing, and with it, lifestyle-related diseases in children and adolescents. High-intensity interval training (HIIT) has recently been explored as an alternate to traditional moderate-intensity continuous training (MICT) in adults with chronic disease and has been shown to induce a rapid reversal of subclinical disease markers in obese children and adolescents. The primary aim of this study is to compare the effects of HIIT with MICT on myocardial function in obese children and adolescents. Methods and analysis Multicentre randomised controlled trial of 100 obese children and adolescents in the cities of Trondheim (Norway) and Brisbane (Australia). The trial will examine the efficacy of HIIT to improve cardiometabolic outcomes in obese children and adolescents. Participants will be randomised to (1) HIIT and nutrition advice, (2) MICT and nutrition advice or (3) nutrition advice. Participants will partake in supervised exercise training and/or nutrition sessions for 3 months. Measurements for study end points will occur at baseline, 3 months (postintervention) and 12 months (follow-up). The primary end point is myocardial function (peak systolic tissue velocity). Secondary end points include vascular function (flow-mediated dilation assessment), quantity of visceral and subcutaneous adipose tissue, myocardial structure and function, body composition, cardiorespiratory fitness, autonomic function, blood biochemistry, physical activity and nutrition. Lean, healthy children and adolescents will complete measurements for all study end points at one time point for comparative cross-sectional analyses. Ethics and dissemination This randomised controlled trial will generate substantial information regarding the effects of exercise intensity on paediatric obesity, specifically the cardiometabolic health of this at-risk population. It is expected that communication of results will allow for the development of more effective evidence-based exercise prescription guidelines in this population while investigating the benefits of HIIT on subclinical markers of disease. Trial registration number NCT01991106.
An Interposed I/O Scheduling Framework for Latency and Throughput Guarantees

Cloud storage system is becoming a trend in production environments for its economic benefits. With such architecture, storage resource is consolidated to provide multiplexing service for concurrent applications. Therefore, storage centers must be able to guarantee multi-dimensional Quality of Service for various applications. However, satisfying performance targets for each workload is challenging, because they compete for storage resource and have various performance targets in terms of throughput or latency. In this paper, we design and implement a novel scheduler, called Arbitrator, to maintain per-application performance no matter in terms of throughput or latency. In our scheduling framework, we introduce a factor to reflect how applications are sensitive to deadline missing. The scheduler employs a feedback mechanism to monitor latency guarantees and throughput allocation for each application, and compute how much applications deviate from their performance targets. Based on the estimation, Arbitrator makes the scheduling decision to achieve latency guarantee and proportional sharing of bandwidth. We implement Arbitrator in Linux kernel and evaluate its effectiveness, and the results show the scheduler has good ability to maintain satisfactory performance for applications.
p-Coumaroyl-CoA:monolignol transferase (PMT) acts specifically in the lignin biosynthetic pathway in Brachypodium distachyon

Grass lignins contain substantial amounts of p-coumarate (pCA) that acylate the side-chains of the phenylpropanoid polymer backbone. An acyltransferase, named p-coumaroyl-CoA:monolignol transferase (OsPMT), that could acylate monolignols with pCA in vitro was recently identified from rice. In planta, such monolignol-pCA conjugates become incorporated into lignin via oxidative radical coupling, thereby generating the observed pCA appendages; however p-coumarates also acylate arabinoxylans in grasses. To test the authenticity of PMT as a lignin biosynthetic pathway enzyme, we examined Brachypodium distachyon plants with altered BdPMT gene function. Using newly developed cell wall analytical methods, we determined that the transferase was involved specifically in monolignol acylation. A sodium azide-generated Bdpmt-1 missense mutant had no (<0.5%) residual pCA on lignin, and BdPMT RNAi plants had levels as low as 10% of wild-type, whereas the amounts of pCA acylating arabinosyl units on arabinoxylans in these PMT mutant plants remained unchanged. pCA acylation of lignin from BdPMT-overexpressing plants was found to be more than three-fold higher than that of wild-type, but again the level on arabinosyl units remained unchanged. Taken together, these data are consistent with a defined role for grass PMT genes in encoding BAHD (BEAT, AHCT, HCBT, and DAT) acyltransferases that specifically acylate monolignols with pCA and produce monolignol p-coumarate conjugates that are used for lignification in planta.
A cost-effective main memory organization for future servers

Today, the amount of main memory in mid-range servers is pushing practical limits with as much as 192 GB memory in a 24 processor system. Further, with the onset of multi-threaded, multi-core processor chips, it is likely that the number of memory chips per processor chip will start to increase, making DRAM cost and size an even larger burden. We investigate in this paper an alternative main memory organization - a two-level non-inclusive memory hierarchy - where the second level is substantially slower than the first level, with the aim of reducing total system cost and spatial requirements of servers of today and the future. We quantitatively investigate how big and how slow the second level can be. Surprisingly, we find that only 30% of the entire memory resources typically needed must be accessed at DRAM speed whereas the rest can be accessed at a speed that is an order of magnitude slower with a negligible (1.2% on average) performance impact. We also present a cost-effective implementation of how to manage such a hierarchy and how it can bring down memory cost by leveraging memory compression and sharing of memory resources among servers.
Keyframe Extraction from Human Motion Capture Data Based on a Multiple Population Genetic Algorithm

To reduce reconstruction errors during keyframe extraction and to control the optimal compression ratio, this study proposes a method for keyframe extraction from human motion capture data based on a multiple population genetic algorithm. The fitness function is defined to meet the goals of minimal reconstruction errors and the optimal compression rate, where multiple initial populations are subjected to co-evolution. The multiple population genetic algorithm considers global and local search. Experimental results showed that the algorithm can effectively extract the keyframe from motion capture data and it satisfied the desired reconstruction error.
Empirical Analysis of Virtual Carrier Sense Flooding Attacks Over Wireless Local Area Network

Problem statement: Wireless Local Areas (WLANs) are subject to different types of vulnerabilities. Denial of Service (DoS) attack is the most current challenging issue on the WLANs. The objectives of the study were to (i) Provide an empirical analysis to conduct a series of wireless virtual carrier sense DoS attacks using wireless co ntrol frames vulnerabilities, (ii) Design a testbed to compared and analyzed the damage that these attacks can imposed on wireless networks, and (iii) Evaluated the effectiveness of such attacks on perf ormance of WLAN in term of data transmission rate. Approach: The testbed employed ubuntu distribution along a n etwork analyzer, Atheros chipset, and frame injection to the tested WLAN. All experiments were placed on two phases: Targeting wireless access point and targeting wireless client . Each phase presented the results of experiments u nder three circumstances: Before, during, and after the attacks. Results: Even when virtual carrier sense communication was disabled in the tested WLAN, still the target nodes answered to these forgery frames which made the attacks easier. Attacks over the wir eless clients were more effective than the access p oint. In VCS-RTS-C the rate of data transmission from 3547.384 B sec -1 decreased to 9.185 B sec -1 . In contrast with VCS-CTS-C, it decreased from 4959.887-44.740 B sec -1 and amount of decrease for VCS-ACK-C was from 7057.401-136.96 B sec -1 . The obtained results demonstrated that during the attacks the target clients were completely disconne cted from the wireless network and unable to do any communication. Conclusion: The influence of wireless virtual carrier sense at tacks on performance of the wireless network was analyzed. The data transmi ssion rate of the tested WLAN under the attacks was compared with the transmission rate of the WLAN operated under normal conditions. The obtained results confirmed the attacks could easily overwhelmed and shut down the wireless network.
Opposition based Particle Swarm Optimization with student T mutation (OSTPSO)

Particle swarm optimization (PSO) is a stochastic algorithm, used for the optimization problems, proposed by Kennedy [1] in 1995. PSO is a recognized algorithm for optimization problems, but suffers from premature convergence. This paper presents an Opposition-based PSO (OPSO) to accelerate the convergence of PSO and at the same time, avoid early convergence. The proposed OPSO method is coupled with the student T mutation. Results from the experiment performed on the standard benchmark functions show an improvement on the performance of PSO.