Miracle-dz/UniFAR-FTUs huggingface dataset:
RuleTris: Minimizing Rule Update Latency for TCAM-Based SDN Switches

Software-dehned network (SDN) is deemed to enable more dynamic management of data center networks that promptly respond to network events with changes in network policies. Although the SDN controller architecture is increasingly optimized for swift policy updates, the data plane, especially the prevailing TCAM-based flow tables on physical SDN switches, remains unoptimized for fast rule updates, and is gradually becoming the primary bottleneck along the policy update pipeline. In this paper, we present RuleTris, the hrst SDN update optimization framework that minimizes rule update latency for TCAM-based switches. RuleTris employs the dependency graph (DAG) as the key abstraction to minimize the update latency. RuleTris efhciently obtains the DAGs with novel dependency preserving algorithms that incrementally build rule dependency along with the compilation process. Then, in the guidance of the DAG, RuleTris optimizes the rule updates in TCAM to avoid unnecessary entry moves, which are the main cause of TCAM update inefhciency. We prove that RuleTris generates TCAM updates with the minimum number of TCAM entry moves. In evaluation, RuleTris achieves a median of <;12ms and 90-percentile of <;15ms the end-to-end per-rule update latency on our hardware prototype, outperforming the state-of-the-art composition compiler CoVisor by ~20 times.
Clinical Application of a Hybrid RapidArc Radiotherapy Technique for Locally Advanced Lung Cancer

Objective: Radiation treatment planning for locally advanced lung cancer can be technically challenging, as delivery of ≥60 Gy to large volumes with concurrent chemotherapy is often associated with significant risk of normal tissue toxicity. We clinically implemented a novel hybrid RapidArc technique in patients with lung cancer and compared these plans with 3-dimensional conformal radiotherapy and RapidArc-only plans. Materials/Methods: Hybrid RapidArc was used to treat 11 patients with locally advanced lung cancer having bulky mediastinal adenopathy. All 11 patients received concurrent chemotherapy. All underwent a 4-dimensional computed tomography planning scan. Hybrid RapidArc plans concurrently combined static (60%) and RapidArc (40%) beams. All cases were replanned using 3- to 5-field 3-dimensional conformal radiotherapy and RapidArc technique as controls. Results: Significant reductions in dose were observed in hybrid RapidArc plans compared to 3-dimensional conformal radiotherapy plans for total lung V20 and mean (−2% and −0.6 Gy); contralateral lung mean (−2.92 Gy); and esophagus V60 and mean (−16.0% and −2.2 Gy; all P < .05). Contralateral lung doses were significantly lower for hybrid RapidArc plans compared to RapidArc-only plans (all P < .05). Compared to 3-dimensional conformal radiotherapy, heart V60 and mean dose were significantly improved with hybrid RapidArc (3% vs 5%, P = .04 and 16.32 Gy vs 16.65 Gy, P = .03). However, heart V40 and V45 and maximum spinal cord dose were significantly lower with RapidArc plans compared to hybrid RapidArc plans. Conformity and homogeneity were significantly better with hybrid RapidArc plans compared to 3-dimensional conformal radiotherapy plans (P < .05). Treatment was well tolerated, with no grade 3+ toxicities. Conclusion: To our knowledge, this is the first report on the clinical application of hybrid RapidArc in patients with locally advanced lung cancer. Hybrid RapidArc permitted safe delivery of 60 to 66 Gy to large lung tumors with concurrent chemotherapy and demonstrated advantages for reduction in low-dose lung volumes, esophageal dose, and mean heart dose.
Garbage collection and wear leveling for flash memory: Past and future

Recently, storage systems have observed a great leap in performance, reliability, endurance, and cost, due to the advance in non-volatile memory technologies, such as NAND flash memory. However, although delivering better performance, shock resistance, and energy efficiency than mechanical hard disks, NAND flash memory comes with unique characteristics and operational constraints, and cannot be directly used as an ideal block device. In particular, to address the notorious write-once property, garbage collection is necessary to clean the outdated data on flash memory. However, garbage collection is very time-consuming and often becomes the performance bottleneck of flash memory. Moreover, because flash memory cells endure very limited writes (as compared to mechanical hard disks) before they are worn out, the wear-leveling design is also indispensable to equalize the use of flash memory space and to prolong the flash memory lifetime. In response, this paper surveys state-of-the-art garbage collection and wear-leveling designs, so as to assist the design of flash memory management in various application scenarios. The future development trends of flash memory, such as the widespread adoption of higher-level flash memory and the emerging of three-dimensional (3D) flash memory architectures, are also discussed.
Fully distributed scalable smoothing and mapping with robust multi-robot data association

In this paper we focus on the multi-robot perception problem, and present an experimentally validated end-to-end multi-robot mapping framework, enabling individual robots in a team to see beyond their individual sensor horizons. The inference part of our system is the DDF-SAM algorithm [1], which provides a decentralized communication and inference scheme, but did not address the crucial issue of data association. One key contribution is a novel, RANSAC-based, approach for performing the between-robot data associations and initialization of relative frames of reference. We demonstrate this system with both data collected from real robot experiments, as well as in a large scale simulated experiment demonstrating the scalability of the proposed approach.
An Etymological Approach to Cross-Language Orthographic Similarity. Application on Romanian

In this paper we propose a computational method for determining the orthographic similarity between Romanian and related languages. We account for etymons and cognates and we investigate not only the number of related words, but also their forms, quantifying orthographic similarities. The method we propose is adaptable to any language, as far as resources are available.
A novel method to design triple-mode SIW filter based on the complementary split ring resonators (CSRRs)

In this paper, a novel approach to design triple-mode SIW filter is proposed. A rectangular SIW cavity with two degenerate modes and the complementary split ring resonators (CSRRs) etched on the top plane of this cavity are combined to implement a triple-mode filter. The filter has high out-of-band rejection and sharp skirt selectivity due to three transmission zeros appearing. Another advantage of this method is that the operating bandwidth of this filter can be controlled by changing the external dimensions of CSRRs and the position of the perturbed metallic vias. Finally, an example of triple mode filter is given and the measured results show its good performance.
Mitochondrial uncoupling protein 2 in pancreatic β‐cells

Pancreatic β‐cells have remarkable bioenergetics in which increased glucose supply upregulates the cytosolic ATP/ADP ratio and increases insulin secretion. This arrangement allows glucose‐stimulated insulin secretion (GSIS) to be regulated by the coupling efficiency of oxidative phosphorylation. Uncoupling protein 2 (UCP2) modulates coupling efficiency and may regulate GSIS. Initial measurements of GSIS and glucose tolerance in Ucp2−/− mice supported this model, but recent studies show confounding effects of genetic background. Importantly, however, the enhancement of GSIS is robustly recapitulated with acute UCP2 knockdown in INS‐1E insulinoma cells. UCP2 protein level in these cells is dynamically regulated, over at least a fourfold concentration range, by rapid proteolysis (half‐life less than 1 h) opposing regulated gene transcription and mRNA translation. Degradation is catalysed by the cytosolic proteasome in an unprecedented pathway that is currently known to act only on UCP2 and UCP3. Evidence for proteasomal turnover of UCP2 includes sensitivity of degradation to classic proteasome inhibitors in cells, and reconstitution of degradation in vitro in mitochondria incubated with ubiquitin and the cytosolic 26S proteasome. These dynamic changes in UCP2 content may provide a fine level of control over GSIS in β‐cells.
Developmental Cognitive Neuroscience Neural Correlates of Retaliatory and Prosocial Reactions to Social Exclusion: Associations with Chronic Peer Rejection

Social exclusion is a distressing experience and can lead to both retaliatory and prosocial reactions toward the sources of exclusion. The way people react to social exclusion has been hypothesized to be shaped through chronic exposure to peer rejection. This functional Magnetic Resonance Imaging study examined associations between chronic peer rejection and retaliatory (i.e. punishing) and prosocial (i.e. forgiving) reactions to social exclusion and the neural processes underlying them. Chronically rejected (n = 19) and stably highly accepted adolescents (n = 27) distributed money between themselves and unknown others who previously included or excluded them in a virtual ball-tossing game (Cyberball). Decreasing the excluders' monetary profits (i.e., punishment) was associated with increased activity in the ventral stria-tum, dorsolateral prefrontal cortex (PFC) and parietal cortex in both groups. Compared to stably highly accepted adolescents, chronically rejected adolescents exhibited higher activity in the dorsal striatum and lateral prefrontal cortex – brain regions implicated in cognitive control – when they refrained from punishment and shared their money equally with (i.e. forgave) the excluders. These results provide insights into processes that might underlie the maintenance of peer rejection across development, such as difficulties controlling the urge to retaliate after exclusion.
Optimizing PaaS provider profit under service level agreement constraints. (Optimisation du profit des fournisseurs PaaS sous des contraintes de contrat de service)

L'informatique en nuage (cloud computing) est un paradigme emergent qui revolutionne l'utilisation et la commercialisation des services informatiques. De nos jours, l'impact socio-economique de l'informatique en nuage et plus particulierement des services de PaaS (plate-forme en tant que service) devient essentiel, puisque le nombre d'utilisateurs et de fournisseurs des cloud PaaS est en pleine croissance. L'objectif principal des fournisseurs de cloud PaaS est de generer le maximum de profit des services qu'ils fournissent. Cela les oblige a faire face a un certain nombre de defis, tels que la gestion efficace des ressources sous-jacentes et la satisfaction des SLAs (contrat de service) des applications hebergees. Dans cette these, nous considerons un environnement PaaS hybride de cloud bursting, ou le fournisseur PaaS possede un nombre limite de ressources privees et a la possibilite de louer des ressources publiques. Ce choix permet au fournisseur PaaS d'avoir un controle complet sur les services heberges dans les ressources privees et de profiter de ressources publiques pour gerer les periodes de pointe. De plus, nous proposons une solution rentable pour gerer un tel systeme PaaS sous des contraintes de SLA. Nous definissons une politique d'optimisation de profit qui, a chaque requete d'un nouveau client, evalue le cout d'hebergement de son application en utilisant les ressources publiques et privees et choisit l'option qui genere le plus de profit. Pendant les periodes de pointe la politique considere deux autres options. La premiere option consiste a emprunter quelques ressources aux applications en cours d'execution tout en considerant le paiement de penalites si leur qualite de service est affectee. La seconde option consiste a attendre que des ressources privees soient liberes tout en considerant le paiement de penalites si la qualite de service de la nouvelle application est affectee. En outre, nous avons concu et mis en œuvre une architecture de cloud PaaS, appelee Meryn, qui integre la politique d'optimisation proposee, supporte le cloud bursting et heberge des applications du type batch et MapReduce. Les resultats de notre evaluation montrent l'efficacite de notre approche dans l'optimisation du profit du fournisseur. En effet, comparee a une approche de base, notre approche fournit jusqu'a 11.59 % et 9.02 % plus de profits pour le fournisseur dans respectivement les simulations et les experiences.
Formal Modeling of mTOR Associated Biological Regulatory Network Reveals Novel Therapeutic Strategy for the Treatment of Cancer

Cellular homeostasis is a continuous phenomenon that if compromised can lead to several disorders including cancer. There is a need to understand the dynamics of cellular proliferation to get deeper insights into the prevalence of cancer. Mechanistic Target of Rapamycin (mTOR) is implicated as the central regulator of the metabolic pathway involved in growth whereas its two distinct complexes mTORC1 and mTORC2 perform particular functions in cellular propagation. To date, mTORC1 is a well defined therapeutic target to inhibit uncontrolled cell division, while the role of mTORC2 is not well characterized. Therefore, the current study is designed to understand the signaling dynamics of mTOR and its partner proteins such as PI3K, PTEN, mTORC2, PKB (Akt), mTORC1, and FOXO. For this purpose, a qualitative model of mTOR-associated Biological Regulatory Network (BRN) is constructed to predict its regulatory behaviors which may not be predictable otherwise. The depleted expression of PTEN and FOXO along with the overexpression of PI3K, mTORC2, mTORC1 and Akt is predicted as a stable steady state which is in accordance with their observed expression levels in the progression of various cancers. The qualitative model also predicts the homeostasis of all the entities in the form of qualitative cycles. The significant qualitative (discrete) cycle is identified by analyzing betweenness centralities of the qualitative (discrete) states. This cycle is further refined as a linear hybrid automaton model with the production (activation) and degradation (inhibition) time delays in order to analyze the real-time constraints for its existence. The analysis of the hybrid model provides a formal proof that during homeostasis the inhibition time delay of Akt is less than the inhibition time delay of mTORC2. In conclusion, our observations characterize that in homeostasis Akt is degraded with a faster rate than mTORC2 which suggests that the inhibition of Akt along with the activation of mTORC2 may be a better therapeutic strategy for the treatment of cancer.
Development of Rapidly Evolving Intron Markers to Estimate Multilocus Species Trees of Rodents

One of the major challenges in the analysis of closely related species, speciation and phylogeography is the identification of variable sequence markers that allow the determination of genealogical relationships in multiple genomic regions using coalescent and species tree approaches. Rodent species represent nearly half of the mammalian diversity, but so far no systematic study has been carried out to detect suitable informative markers for this group. Here, we used a bioinformatic pipeline to extract intron sequences from rodent genomes available in databases and applied a series of filters that allowed the identification of 208 introns that adequately fulfilled several criteria for these studies. The main required characteristics of the introns were that they had the maximum possible mutation rates, that they were part of single-copy genes, that they had an appropriate sequence length for amplification, and that they were flanked by exons with suitable regions for primer design. In addition, in order to determine the validity of this approach, we chose ten of these introns for primer design and tested them in a panel of eleven rodent species belonging to different representative families. We show that all these introns can be amplified in the majority of species and that, overall, 79% of the amplifications worked with minimum optimization of the annealing temperature. In addition, we confirmed for a pair of sister species the relatively high level of sequence divergence of these introns. Therefore, we provide here a set of adequate intron markers that can be applied to different species of Rodentia for their use in studies that require significant sequence variability.
Recombineering: Genetic Engineering in Bacteria Using Homologous Recombination

The bacterial chromosome and plasmids can be engineered in vivo by homologous recombination using PCR products and synthetic oligonucleotides as substrates. This is possible because bacteriophage‐encoded recombination functions efficiently recombine sequences with homologies as short as 35 to 40 bases. This recombineering allows DNA sequences to be inserted or deleted without regard to location of restriction sites. This unit first describes preparation of electrocompetent cells expressing the recombineering functions and their transformation with double‐stranded DNA (dsDNA) or single‐stranded DNA (ssDNA). Support protocols describe a two‐step method of making genetic alterations without leaving any unwanted changes, and a method for retrieving a genetic marker (cloning) from the E. coli chromosome or a coelectroporated DNA fragment and moving it onto a plasmid. A method is also given to screen for unselected mutations. Additional protocols describe removal of defective prophage, methods for recombineering.
Multi-Task Learning and Algorithmic Stability

In this paper, we study multi-task algorithms from the perspective of the algorithmic stability. We give a definition of the multi-task uniform stability, a generalization of the conventional uniform stability, which measures the maximum difference between the loss of a multi-task algorithm trained on a data set and that of the multi-task algorithm trained on the same data set but with a data point removed in each task. In order to analyze multi-task algorithms based on multi-task uniform stability, we prove a generalized McDiarmid's inequality which assumes the difference bound condition holds by changing multiple input arguments instead of only one in the conventional McDiarmid's inequality. By using the generalized McDiarmid's inequality as a tool, we can analyze the generalization performance of general multi-task algorithms in terms of the multi-task uniform stability. Moreover, as applications, we prove generalization bounds of several representative regularized multi-task algorithms.
Loss of Function of TET2 Cooperates with Constitutively Active KIT in Murine and Human Models of Mastocytosis

Systemic Mastocytosis (SM) is a clonal disease characterized by abnormal accumulation of mast cells in multiple organs. Clinical presentations of the disease vary widely from indolent to aggressive forms, and to the exceedingly rare mast cell leukemia. Current treatment of aggressive SM and mast cell leukemia is unsatisfactory. An imatinib-resistant activating mutation of the receptor tyrosine kinase KIT (KIT D816V) is most frequently present in transformed mast cells and is associated with all clinical forms of the disease. Thus the etiology of the variable clinical aggressiveness of abnormal mast cells in SM is unclear. TET2 appears to be mutated in primary human samples in aggressive types of SM, suggesting a possible role in disease modification. In this report, we demonstrate the cooperation between KIT D816V and loss of function of TET2 in mast cell transformation and demonstrate a more aggressive phenotype in a murine model of SM when both mutations are present in progenitor cells. We exploit these findings to validate a combination treatment strategy targeting the epigenetic deregulation caused by loss of TET2 and the constitutively active KIT receptor for the treatment of patients with aggressive SM.
NISp1-10: Bank Transfer over Quantum Channel with Digital Checks

In recent years, many quantum cryptographic schemes have been proposed. However, it seems that there are many technical difficulties to realize them (except Quantum Key Distributions) as practical applications. In this paper, we propose a bank transfer (i.e., funds or Electronic Funds Transfer) system utilizing both classical and quantum cryptography to provide theoretically unbreakable security. This system can be realized using current technologies (e.g., linear polarizers and Faraday rotators) and requires no additional authentication and no key distribution scheme. However, a trusted third party must keep all member banks' private keys for encryption, authentication and also for functions to generate classical digital signatures.
Dielectric dissipation factor and resistivity of liquid refrigerants and dependency on temperature

In order to increase the power density of electrical equipment the direct cooling of live parts by using refrigerants is a promising solution. R134a and R227ea are two refrigerants which are widely used due to their favorable low vapor pressure characteristics. In this study they are analyzed concerning their resistivity and their dielectric dissipation factor. The physical quantities are measured by using a plate-plate arrangement according to IEC 60093. In two separate experiments the refrigerants are then stressed at different temperatures ranging from 20 °C up to 90 °C by a DC-voltage of ±500 V and a low AC-voltage of max. 5 V, respectively. The experiments show that R134a tends to exhibit a lower resistivity compared to R227ea. The dielectric dissipation factor of R134a is significantly higher than in case of R227ea. In R134a the high dielectric dissipation factor leads to a marked energy dissipation in the liquid refrigerant even at low electric voltage stress. There is evidence that low electric field strengths are sufficient to cause decomposition of R134a.
Toward symbolic performance prediction of parallel programs

Critical analyses in performance estimators for parallel programs require an algorithm that count the number of integer solutions to a set of inequalities. Most current performance estimators are restricted to linear inequalities for this analysis. In this paper we describe a symbolic algorithm which can estimate the number of integer solutions to a set of both linear and non-linear inequalities. The result is either an integer value or a symbolic expression depending on whether the inequalities contain non-loop variables. We have implemented this algorithm and use it as part of P/sup 3/T, a performance estimator for data parallel programs. We demonstrate the usefulness of this algorithm by predicting the work load of all processors for a parallel program and compare it to measurements taken on an iPSC/860 hypercube system.