Miracle-dz/UniFAR-FTUs huggingface dataset:
Universal Finite Memory Coding of Binary Sequences

This work considers the problem of universal coding of binary sequences, where the universal encoder has limited memory. Universal coding refers to a situation where a single, universal, encoder can achieve the optimal performance for a large class of models or data sequences, without knowing the model in advance, and without tuning the encoder to the data. In the previous work on universal coding, specific universal machines, whose performance attained the theoretical limits, were suggested. However, these machines require unlimited amount of memory. This work investigates the case where the universal machines are with limited resources, i.e., finite-state machines. To simplify the problem, this work considers universal finite-state machines that assign probabilities to the next bit. It ignores the additional number of states needed to translate the assigned probabilities into code bits. In most cases examined, this work provides lower bounds on the performance, which describe the optimal rate (as a function of number of states) that the entropy, or the empirical entropy, can be attained. In addition, in most cases, this work presents specific machines whose performance is compared to these bounds. While the general problem of universal coding with limited resources is still open, this work provides a set of basic results that will be useful in analyzing the general problem. These results thus provide an important step in understanding the problem of limited resources universal coding.
The guinea pig I region. I. A structural and genetic analysis

The Ia antigens of the guinea pig have been shown to play a central role in the regulation of the immune response. We have previously partially characterized the chemical structure of these antigens. In this communication, we further characterize the structure of the five Ia antigens already described, as well as two new Ia antigens. Evidence is presented which shows that these seven Ia antigens can be organized into three distinct groups, each with a characteristic structure. The Ia.2 determinant of strain 2 and the Ia.3 and Ia.5 determinants of strain 13 animals are found on molecules composed of a 25,000 dalton chain and a 33,000 dalton chain in noncovalent association, or else are individually expressed on nonlinked 33,000 and 25,000 dalton molecules. The Ia.4 and Ia.5 determinants of strain 2 and the Ia.7 determinant of strain 13 are borne on 58,000 dalton molecules in which two chains are linked by disulfide bonds. The Ia.1 and Ia.6 determinants of strain 13 are found on a molecule of 26,000-27,000 daltons. Ia.6 of strain 2 has yet to be definitively assigned. Furthermore, in strain 13 animals the Ia.3 and Ia.5 determinants are borne on the same molecule, as are the Ia.1 and Ia.6 determinants. In strain 2 animals, the Ia.4 and Ia.5 determinants are found on the same molecule. On the basis of chemical structure, we have divided the guinea pig I region into three subregions. The accompanying paper presents evidence of associations between particular Ia genes and Ir genes.
Attenuated Mycobacterium tuberculosis SO2 Vaccine Candidate Is Unable to Induce Cell Death

It has been proposed that Mycobacterium tuberculosis virulent strains inhibit apoptosis and trigger cell death by necrosis of host macrophages to evade innate immunity, while non-virulent strains induce typical apoptosis activating a protective host response. As part of the characterization of a novel tuberculosis vaccine candidate, the M. tuberculosis phoP mutant SO2, we sought to evaluate its potential to induce host cell death. The parental M. tuberculosis MT103 strain and the current vaccine against tuberculosis Bacillus Calmette-Guérin (BCG) were used as comparators in mouse models in vitro and in vivo. Our data reveal that attenuated SO2 was unable to induce apoptotic events neither in mouse macrophages in vitro nor during lung infection in vivo. In contrast, virulent MT103 triggers typical apoptotic events with phosphatidylserine exposure, caspase-3 activation and nuclear condensation and fragmentation. BCG strain behaved like SO2 and did not induce apoptosis. A clonogenic survival assay confirmed that viability of BCG- or SO2-infected macrophages was unaffected. Our results discard apoptosis as the protective mechanism induced by SO2 vaccine and provide evidence for positive correlation between classical apoptosis induction and virulent strains, suggesting apoptosis as a possible virulence determinant during M. tuberculosis infection.
Reengineering Process Based on the Unified Process

This paper presents a reverse-engineering process for legacy information systems understanding and maintenance that takes its main steps from the unified process (UP). We show that the reconstruction of the use-case model of the system is central to the recovery of the architecture of the system. First, the use-cases allow us to recover the model of the business process the system supports. Second, these use-cases are analyzed to rebuild the corresponding system analysis model representing the high level architecture. The latter is used as the "hypothetical architecture" to lead the search for the corresponding software elements in the system. Third, the use-case model is used as the source of the scenarios to be run to find the software elements that implement the business functions. Then the "hypothetical architecture" can be compared to the components identified by running the scenarios. As a result, a matching can be made between the business functions of the business model and the software elements of the system. This helps the maintenance engineer to understand the purpose of these elements
Muli-Issue Multi-Threaded Stream Processor

The MISP processor is a programmable media processor which supports multi-issuing, multi-threading and stream processing techniques. MISP executes applications that have been mapped to the stream programming model. The stream model decomposes applications into a set of computation kernels that operate on data streams. This mapping exposes the inherent locality and parallelisms in media applications. MISP exploits thread level (TLP), data level (DLP), sub-word (SP) and instruction level (ILP) parallelisms inherent in media applications. Full simulator of MISP has been implemented and several media workloads composed of EEMBC benchmarks have been applied. Also we applied test programs on imagine stream processor. The simulation results show MISP gains IPC of more than 2.08 times and performance of more than 1.86 times over imagine. The synthesis results show area overhead per thread addition in MISP is about 7% without changing clock frequency
Enhanced physically-based animation of deformable bodies using shape-matching

We present a simplified approach for the animation of geometrically complex deformable objects represented by tetrahedral meshes. Our prototype system detects and responds to collisions of objects that are subject to elastic deformations of variable stiffness. The proposed approach combines several techniques, namely, collision detection using spatial hashing, collision response with consistent penetration depth obtained by propagation, estimated displacement vectors for the deformation region, and binary search to separate objects. The dynamics is based on shape-matching and a modal analysis scheme, using an Euler explicit-implicit integrator. Preliminary results show that collisions between objects containing several hundreds tetrahedra can be animated in real time.
Analyzing Integrity Protection in the SELinux Example Policy

In this paper, we present an approach for analyzing the integrity protection in the SELinux example policy. The SELinux example policy is intended as an example from which administrators customize to create a policy for their site's security goals, but the complexity of the model and size of the policy make this quite complex. Our aim is to provide an access control model to express site security goals and resolve them against the SELinux policy. Ultimately, we aim to define a minimal trusted computing base (TCB) that satisfies Clark-Wilson integrity, by first testing for the more restrictive Biba integrity policy and resolving conflicts using Clark-Wilson semantics. Our policy analysis tool, Gokyo, implements the following approach: (1) it represents the SELinux example policy and our integrity goals; (2) it identifies conflicts between them; (3) it estimates the resolutions to these conflicts; and (4) provides information for deciding upon a resolution. Using Gokyo, we derive a proposal for a minimal TCB for SELinux includes 30 subject types, and we identify the work remaining to ensure that TCB is integrity-protected. Our analysis is performed on the SELinux example policy for Linux 2.4. 19.
Learning Intelligent Modification Strategies in Design Synthesis

A method that exploits machine learning to aid modification-based computational design synthesis is presented. The algorithm makes use of statistical inference to identify appropriate modification strategies that guide the selection of modifications to develop a design solution. The procedure is especially suited to computational design tasks that cannot be easily formulated for standard algorithms. In line with the needs of most practical design tasks, the technique is oriented towards multi-objective search, yielding an archive of pareto-optimally directed design solutions. Results of application to example design tasks, truss synthesis and bitmap design, are presented.
A cooperative framework for path loss calibration and indoor mobile positioning

In this paper, we propose a solution for avoiding extensive time consuming path loss calibrations when performing RSS-to-distance conversions for indoor mobile positioning with heterogeneous mobiles. By exploiting RSS measurements and ad-hoc link communications we prove the concept of cooperative calibration and demonstrate it in a WLAN 802.11 network. Moreover the results obtained in the cooperative calibration phase will be applied to the cooperative mobile positioning algorithm developed in previous works.
Postal address block location in real time

The CEDAR real-time address block location system, which determines candidates for the location of the destination address from a scanned mail piece image, is described. For each candidate destination address block (DAB), the address block location (ABL) system determines the line segmentation, global orientation, block skew, an indication of whether the address appears to be handwritten or machine printed, and a value indicating the degree of confidence that the block actually contains the destination address. With 20-MHz Sparc processors, the average time per mail piece for the combined hardware and software system components is 0.210 seconds. The system located 89.0% of the addresses as the top choice. Recent developments in the system include the use of a top-down segmentation tool, address syntax analysis using only connected component data, and improvements to the segmentation refinement routines. This has increased top choice performance to 91.4%. <<ETX>>
A dynamic configuration model for power-efficient virtualized server clusters

The rising energy costs for keeping up large-scale server clusters is becoming an increasingly important concern for many businesses. In this paper, we present a dynamic configuration model for consolidating multiple services or applications in virtualized server clusters aimed at optimizing power consumption. Dynamic configurations in the cluster include turning servers off in periods of low activity and turning them back on when the demand increases. In our model, we incorporate the often ignored switching penalty in order to avoid frequent and undesirable turning servers on/off. In addition, our model takes advantage of the dynamic voltage/frequency scaling capability of current processor architectures to further optimize power consumption. We present simulation results that to evaluate the quality of the solutions and the scalability of the proposed model.
Phase-based feature detection in fetal ultrasound images

Detection of image features is an essential step in many medical applications. However, it is very challenging to accurately extract important features from ultrasound data that is corrupted by various imaging artifacts. Traditional intensity-based methods generally have poor performance in detecting salient features from ultrasound images. In contrast, phase-base approaches have been shown to perform well in these images because they are theoretically intensity invariant. In this paper, we extend previous phase-based methods to the field of fetal ultrasound images to detect both symmetric and asymmetric features, which correspond to ridge-like and step edge-like object boundaries, respectively. This is achieved by exploiting local phase-based measures computed from a 2D isotropic analytic signal: monogenic signal. Experimental results in clinical images demonstrate the outperformance of the proposed approach.
TAKELAB: Medical Information Extraction and Linking with MINERAL

Medical texts are filled with mentions of diseases, disorders, and other clinical conditions, with many different surface forms relating to the same condition. We describe MINERAL, a system for extraction and normalization of disease mentions in clinical text, with which we participated in the Task 14 of SemEval 2015 evaluation campaign. MINERAL relies on a conditional random fields-based model with a rich set of features for mention detection, and a semantic textual similarity measure for entity linking. MINERAL reaches joint extraction and linking performance of 75.9% relaxedF1score (strict score of 72.7%) and ranks fourth among 16 participating teams.
Galactic Evolution of Beryllium and Oxygen

We discuss the early evolution of beryllium and oxygen in our Galaxy by comparing abundances of these elements for halo and disk metal-poor stars. Both, O and Be rise as we go progressively to more metal-rich stars, showing a slope 0.41 +-0.09 ([Be/O] vs [Fe/H]) for stars with [Fe/H] < -1. This relationship provides an observational constraint to the actually proposed Galactic Cosmic Ray theories.
Patterns and Rewrite Rules for Systematic Code Generation (From High-Level Functional Patterns to High-Performance OpenCL Code)

Computing systems have become increasingly complex with the emergence of heterogeneous hardware combining multicore CPUs and GPUs. These parallel systems exhibit tremendous computational power at the cost of increased programming effort. This results in a tension between achieving performance and code portability. Code is either tuned using device-specific optimizations to achieve maximum performance or is written in a high-level language to achieve portability at the expense of performance. We propose a novel approach that offers high-level programming, code portability and high-performance. It is based on algorithmic pattern composition coupled with a powerful, yet simple, set of rewrite rules. This enables systematic transformation and optimization of a high-level program into a low-level hardware specific representation which leads to high performance code. We test our design in practice by describing a subset of the OpenCL programming model with low-level patterns and by implementing a compiler which generates high performance OpenCL code. Our experiments show that we can systematically derive high-performance device-specific implementations from simple high-level algorithmic expressions. The performance of the generated OpenCL code is on par with highly tuned implementations for multicore CPUs and GPUs written by experts
The impact of modeling the overshooting effect in subthreshold region for Nanoscale CMOS inverter

Some aspects should be considered in Nanoscale MOSFETS models, such as power dissipation, channel length modulation, and the overshooting effect. In this paper we study the impact of considering the overshooting effect in a previous nanoscale model, by including the subthreshold region where the overshooting effect appears. Results show a positive impact of modeling the overshooting effect on the output transient response accuracy compared to HSPICE.
A Pattern Language for Documenting Software Architectures

The process of creating the architecture of a software system results in a documentation, which is recognized as a key artifact for stakeholder communication, early analysis of the system, support for quality attributes and trouble-free maintenance. The problem of software architecture documentation remains to a large extent unsolved; however the past few years, significant advances have been made in the field from research academic and industrial centers. This paper introduces an approach for recording the results that have been achieved hitherto in the field of documenting software architectures, by formatting them in the shape of patterns. We aim at assembling knowledge and experience in the field from industry and academia, with respect to the few issues that the community has reached consensus. Furthermore, by codifying this knowledge and experience in the form of patterns, we hope for a wider dissemination of architectural documentation concepts and practices to the community and thus a further advance of the field.
Prediction of the post-translational modification sites on dengue virus E protein and deciphering their role in pathogenesis

Dengue virus, a member of the flavivirus family, is a mosquito-borne viral pathogen for which any specific treatment or control of infection by vaccination is yet to be conclusive. The envelope glycoprotein, E, mediates viral entry by membrane fusion. Elucidation of post-translational modification sites in E protein followed by sequence alignment produced stretches of residues which are conserved in most of the members of flaviviruses. Presence of protein kinase A (PKA) and protein kinase G (PKG) phosphorylation sites predicts that E protein may activate PKA and PKG through phosphorylation which is responsible for inhibition of platelet activation, and thereby causing thrombocytopenia. Here, we attempt to decipher the novel role of Dengue virus E protein in pathogenesis.
Taming uncertainty in distributed systems with help from the network

Network and process failures cause complexity in distributed applications. When a remote process does not respond, the application cannot tell if the process or network have failed, or if they are just slow. Without this information, applications can lose availability or correctness. To address this problem, we propose Albatross, a service that quickly reports to applications the current status of a remote process---whether it is working and reachable, or not. Albatross is targeted at data centers equipped with software defined networks (SDNs), allowing it to discover and enforce network partitions: Albatross borrows the old observation that it can be better to cause a problem than to live with uncertainty, and applies this idea to networks. When enforcing partitions, Albatross avoids disruption by disconnecting only individual processes (not entire hosts), and by allowing them to reconnect if the application chooses. We show that, under Albatross, distributed applications can bypass the complexity caused by network failures and that they become more available.
Adaptive Nonseparable Wavelet Transform via Lifting & its Application to content based Image Retrieval

The Paper Adaptive Nonseparable Wavelet Transform via Lifting and its Application to Content-Based Image Retrieval. Adapt a multidimensional wavelet filter bank, based on the nonseparable lifting scheme framework. The lifting scheme there are two linear filter denoted P (prediction) and U ( update) are defined as Neville filters of order N and Ǹ, respectively. We are applying the Haar wavelet transform & wavelet decomposition of the image then we enter the Neville filter order & optimization the Neville filter. Lifting scheme on quincunx grids perform wavelet decomposition of 2-D signal (image) and corresponding reconstruction tools for image as well as a function for computation of moments. The wavelet scheme rely on the lifting scheme use the splitting of rectangular grid into quincunx grid. The proposed methods apply the genetic algorithm wide range of problems, from optimization problem inductive concept learning, scheduling, and layout problem. In this project we did comparison between separable wavelet and nonseparable wavelet. We calculate the retrieval rate of separable and nonseparable.Retrieval rate is more means maximum features can be extracted. This method is applied to content-based image retrieval (CBIR) an image signature is derived from this new adaptive non-separable wavelet transform. In CBIR we are used Texture feature for retrieving the image. Images are scanned through its particular characteristics now some degree of freedom is given to the algorithm to find the image from its weight so term nonseparable lifting is used and through the wavelet transformation Image primal and dual wavelet is taken into consideration for the application.
Mathematical Programming Approach to Improve Website Structure for Effective User Navigation

Due to tremendous growth of web applications. It increases the complexity of web applications and web navigation. Designing well-structured website has been long challenge because while creating website web developers understanding of a how website should be structured can be different from that of user’s preferences. Such differences result in cases users having difficulty to locate desired information on website. While various methods have been proposed to reorganize Webpages to improve users navigation using users navigation data but it still causes disorienting users and increases user’s cognitive load. There is a need to improve the efficiency and the performance of a website for effective user navigation. Recommendations play an important role towards this direction. Our Recommendation is based on user Browsing patterns. Our approach presents a comprehensive overview of web mining methods and techniques used for the evaluation of reconciling systems to achieve better web navigation in order to improve the efficiency of web site. In this Paper we will propose Mathematical programming model to improve user navigation while minimizing alteration to current structure. Using our model it will possible to obtain optimal solution very quickly.
Estimating the intensity of ward admission and its effect on emergency department access block

Emergency department access block is an urgent problem faced by many public hospitals today. When access block occurs, patients in need of acute care cannot access inpatient wards within an optimal time frame. A widely held belief is that access block is the end product of a long causal chain, which involves poor discharge planning, insufficient bed capacity, and inadequate admission intensity to the wards. This paper studies the last link of the causal chain—the effect of admission intensity on access block, using data from a metropolitan hospital in Australia. We applied several modern statistical methods to analyze the data. First, we modeled the admission events as a nonhomogeneous Poisson process and estimated time‐varying admission intensity with penalized regression splines. Next, we established a functional linear model to investigate the effect of the time‐varying admission intensity on emergency department access block. Finally, we used functional principal component analysis to explore the variation in the daily time‐varying admission intensities. The analyses suggest that improving admission practice during off‐peak hours may have most impact on reducing the number of ED access blocks. Copyright © 2012 John Wiley & Sons, Ltd.