Miracle-dz/UniFAR-FTUs huggingface dataset:
A Part-of-Speech-Based Search Algorithm for Translation Memories

The retrieval of related sentences in state-of-the-art translation memory systems is based on orthographic similarities. This often leads to poor search results, since orthographically similar sentences are not necessarily semantically related. In this paper we propose a search algorithm that aims to reduce this problem by taking part-of-speech information into account. It requires that the parallel sentences stored in the translation memory are processed using standard tools for word alignment and part-of-speech tagging. The work described is part of an ongoing project in example-based machine translation
Demo: Closer to Cloud-RAN: RAN as a Service

Commoditization and virtualization of wireless networks are changing the economics of mobile networks to help network providers (e.g., MNO, MVNO) move from proprietary and bespoke hardware and software platforms toward an open, cost-effective, and flexible cellular ecosystem. In addition, rich and innovative local services can be efficiently created through cloudification by leveraging the existing infrastructure. In this work, we present RANaaS, which is a cloudified radio access network delivered as a service. RANaaS provides the service life-cycle of an on-demand, elastic, and pay as you go 3GPP RAN instantiated on top of the cloud infrastructure. We demonstrate an example of real-time cloudified LTE network deployment using the OpenAirInterface LTE implementation and OpenStack running on commodity hardware as well as the flexibility and performance of the platform developed.
Maximizing Area Coverage in Directional Sensor Networks by Using Virtual Force Scheme

A directional sensor network is composed of many directional sensor nodes. Unlike conventional omni-directional sensors that always have an omni-angle of sensing range, directional sensors may have a limited angle of sensing range due to technical constraints or cost considerations. Area coverage is still an essential issue in a directional sensor network. In this paper, we study the area coverage problem in directional sensor networks with mobile sensors, which can move to the coverage holes to get better coverage ratio. In order to increase the coverage ratio, each sensor will move from overlapped regions to coverage holes after random deployment. The movements of sensors are adjusted round-by-round so that the coverage ratio is gradually improved. To guide the moving direction of each sensor, we introduce a virtual forces based coverage algorithm for directional sensor networks. Our proposed scheme consists of four different forces caused by neighboring sensors and uncovered regions in the field. By applying the resultant force from these four different forces to directional sensors, coverage holes are eliminated quickly. Simulation results show the effectiveness of our scheme in term of the coverage improvement.
Multi-video summarization based on Video-MMR

This paper presents a novel and effective approach for multi-video summarization: Video Maximal Marginal Relevance (Video-MMR), which extends a classical algorithm of text summarization, Maximal Marginal Relevance. Video-MMR rewards relevant keyframes and penalizes redundant keyframes, as MMR does with text fragments. Two variants of Video-MMR are suggested, and we propose a criterion to select the best combination of parameters for Video-MMR. Then, we compare two summarization strategies: Global Summarization, which summarizes all the individual videos at the same time, and Individual Summarization, which summarizes each individual video independently and concatenates the results. Finally, Video-MMR algorithm is compared with popular K-means algorithm, supported by user-made summary.
Shortest Paths with Higher-Order Regularization

This paper describes a new method of finding thin, elongated structures in images and volumes. We use shortest paths to minimize very general functionals of higher-order curve properties, such as curvature and torsion. Our method uses line graphs to find the optimal path on a given discretization, often in the order of seconds on a single computer. The curves are then refined using local optimization making it possible to recover very smooth curves. We are able to place constraints on our curves such as maximum integrated curvature, or a maximum curvature at any point of the curve. To our knowledge, we are the first to perform experiments in three dimensions with curvature and torsion regularization. The largest graphs we process have over a hundred billion arcs. Experiments on medical images and in multi-view reconstruction show the significance and practical usefulness of higher order regularization.
Blooms of Single Bacterial Species in a Coastal Lagoon of the Southwestern Atlantic Ocean

ABSTRACT We investigated seasonal differences in community structure and activity (leucine incorporation) of the planktonic bacterial assemblage in the freshwater and brackish-water zones of a shallow coastal lagoon of the southwestern Atlantic Ocean. Alphaproteobacteria formed the dominant microbial group in both zones throughout the sampling period. After an intrusion of marine water, members of the SAR11 lineage became abundant in the brackish-water zone. These bacteria were apparently distributed over the lagoon during the following months until they constituted almost 30% of all prokaryotic cells at both sampling sites. At the first sampling date (March 2003) a single alphaproteobacterial species unrelated to SAR11, Sphingomonas echinoides, dominated the microbial assemblages in both zones of the lagoon concomitantly with a bloom of filamentous cyanobacteria. Pronounced maxima of leucine incorporation were observed once in each zone of the lagoon. In the freshwater zone, this highly active microbial assemblage was a mix of the typical bacteria lineages expected in aquatic systems. By contrast, a single bacterial genotype with >99% similarity to the facultative pathogen gammaproteobacterial species Stenotrophomonas maltophilia formed >90% of the bacterial assemblage (>107 cell ml−1) in the brackish-water zone at the time point of highest bacterial leucine incorporation. Moreover, these bacteria were equally dominant, albeit less active, in the freshwater zone. Thus, the pelagic zone of the studied lagoon harbored repeated short-term blooms of single bacterial species. This finding may have consequences for environmental protection.
Axonal neuregulin 1 is a rate limiting but not essential factor for nerve remyelination

Neuregulin 1 acts as an axonal signal that regulates multiple aspects of Schwann cell development including the survival and migration of Schwann cell precursors, the ensheathment of axons and subsequent elaboration of the myelin sheath. To examine the role of this factor in remyelination and repair following nerve injury, we ablated neuregulin 1 in the adult nervous system using a tamoxifen inducible Cre recombinase transgenic mouse system. The loss of neuregulin 1 impaired remyelination after nerve crush, but did not affect Schwann cell proliferation associated with Wallerian degeneration or axon regeneration or the clearance of myelin debris by macrophages. Myelination changes were most marked at 10 days after injury but still apparent at 2 months post-crush. Transcriptional analysis demonstrated reduced expression of myelin-related genes during nerve repair in animals lacking neuregulin 1. We also studied repair over a prolonged time course in a more severe injury model, sciatic nerve transection and reanastamosis. In the neuregulin 1 mutant mice, remyelination was again impaired 2 months after nerve transection and reanastamosis. However, by 3 months post-injury axons lacking neuregulin 1 were effectively remyelinated and virtually indistinguishable from control. Neuregulin 1 signalling is therefore an important factor in nerve repair regulating the rate of remyelination and functional recovery at early phases following injury. In contrast to development, however, the determination of myelination fate following nerve injury is not dependent on axonal neuregulin 1 expression. In the early phase following injury, axonal neuregulin 1 therefore promotes nerve repair, but at late stages other signalling pathways appear to compensate.
Fast Algorithms for Burst Detection

Events occur in every aspect of our lives. An unexpectedly large number of events occurring within some certain measurement (e.g. within some time duration or a spatial region) is called a burst, suggesting unusual behaviors or activities. Bursts come up in many natural and social processes. It is a challenging task to monitor the occurrence of bursts whose lasting duration is unknown in a fast data stream environment. This work describes efficient data structures and algorithms for high performance burst detection under different settings. Our view is that bursts, as unusual phenomena, constitute a useful preliminary primitive in a knowledge discovery hierarchy. Our intent is to build a high performance primitive detection algorithm to support high-level data mining tasks. The work starts with an algorithmic framework including a family of data structures and a heuristic optimization algorithm to choose an efficient data structure given the inputs. The advantage of this framework is that it is adaptive to different inputs. Experiments on both synthetic data and real world data show the new framework significantly outperforms existing techniques over a variety of inputs: Furthermore, we present a greedy dynamic detection algorithm which handles the changing data. It evolves the structure to adapt to the incoming data. It achieves better performance on both synthetic and real data streams than a static algorithm in most cases. We have applied this framework to several real world applications in physics, stock trading and website traffic monitoring. All the case studies show that our framework has real time response. We extend this framework to multi-dimensional data and use it in an epidemiology simulation to detect infectious disease outbreak and spread.
A Small Genome amidst the Giants: Evidence of Genome Reduction in a Small Tubulinid Free-Living Amoeba

Abstract This study investigates the genomic characteristics of Echinamoeba silvestris, a small-sized amoeba within the Tubulinea clade of the Amoebozoa supergroup. Despite Tubulinea’s significance in various fields, genomic data for this clade have been scarce. E. silvestris presents the smallest free-living amoeba genome within Tubulinea and Amoebozoa to date. Comparative analysis reveals intriguing parallels with parasitic lineages in terms of genome size and predicted gene numbers, emphasizing the need to understand the consequences of reduced genomes in free-living amoebae. Functional categorization of predicted genes in E. silvestris shows similar percentages of ortholog groups to other amoebae in various categories, but a distinctive feature is the extensive gene contraction in orphan (ORFan) genes and those involved in biological processes. Notably, among the few genes that underwent expansion, none are related to cellular components, suggesting adaptive processes that streamline biological processes and cellular components for efficiency and energy conservation. Additionally, our investigation into noncoding and repetitive elements sheds light on the evolution of genome size in amoebae, with E. silvestris distinguished by low percentage of repetitive elements. Furthermore, the analysis reveals that E. silvestris has the lowest mean number of introns per gene among the species studied, providing further support for its observed compact genome. Overall, this research underscores the diversity within Tubulinea, highlights knowledge gaps in Amoebozoa genomics, and positions E. silvestris as a valuable addition to genomic data sets, prompting further exploration of complexities in Amoebozoa diversity and genome evolution.
Directional gradient vector flow for snakes

Snakes, or active contour models, have been widely used in image segmentation. However, most present snake models cannot discern between positive and negative step edges. In this paper, a new type of dynamic external force for snakes named directional gradient vector flow (DGVF) is proposed to solve this problem by incorporating directional gradient information. It makes use of the gradients in both x and y directions and deals with the external force field for the two directions separately. In snake deformation, the DGVF field is utilized dynamically according to the orientation of snake in each iteration. Experiment results demonstrate that the DGVF snake provides a better segmentation than GVF snake in situations when edges of different directions are present and may pose confusion for segmentation.
International Journal of Advanced and Innovative Research a Literature Survey on Component Testing in Component Based Software Engineering

— Component-based software engineering (CBSE) today offers rapid development of system using fewer resources and efforts. The CBSE gave the idea of reuse and cutting down the development cost. Thus component based testing becomes more complicated if we have not reliable and bug free components. We can find the reliable and bug free components only if the components are tested by a suitable testing tool. In this review paper our aims to find the existing component testing techniques and tools in CBSE. This systematic literature survey is based on International Journals collected from multiple-stage selection process. These journals have been published within the time span of 1999-2010.
Tree based MPLS routing

MPLS (MultiProtocol Label Switching) is a new technology proposed by the IETF [4,10] for network routing, and is being increasingly deployed by the largest Internet service providers. The MPLS technology differs from conventional network protocols in a crucial way: instead of reading the entire packet header at all switching points, the analysis of the packet header is done just once, when the packet header is assigned a stack of labels, and thenceforth, each switching point or router just gets to look at the label at the top of the stack (and the ingress edge), and based only on this information, it has to make a decision about the next-hop node [17,16]. In another departure from conventional routing and in particular from IP source routing, where the entire packet route is explicitly put in the header and popped off along the route, the router can not only pop the top label, it can push other labels on top of the stack.The two parameters of interest in designing MPLS routing protocols are the number of labels used, and the depth of the stack used for routing. Clearly, both cannot be simultaneously minimized, and there is often an interesting trade-off between label size and stack depth: it is obvious that if k labels are used, one must have a stack depth of logk n.In fact, it was not known whether this bound could be achieved even for trees; the best stack depth previously achieved with a constant number of labels was O(log2 n). In this paper, we show that one can indeed get asymptotically optimal upper bounds and route on trees using k labels and a maximum stack depth of O(logk n), and that this trade-off can be achieved using a simpler and more intuitive protocol than the one given in [9]. These tree-routing ideas are then shown to give better routing protocols for planar graphs as well. In particular, we show how to route along near-shortest paths (of length at most (1 + ε) times the shortest-path) with O(log2 n/ε) labels and logarithmic stack depth. We also apply them to graphs with smaller separators, including most large ISP networks.
Comparable long‐term outcomes after reduced‐intensity conditioning versus myeloablative conditioning allogeneic stem cell transplantation for adult high‐risk acute lymphoblastic leukemia in complete remission

The role of reduced‐intensity conditioning (RIC) in adult acute lymphoblastic leukemia (ALL) remains unclear because of the small sample size, short follow‐up duration, various regimens for conditioning and graft‐versus‐host disease (GVHD) prophylaxis, and the heterogeneity of selection criteria for transplantation. We compared long‐term outcomes of 60 consecutive RIC transplants (fludarabine plus melphalan) with 120 myeloablative conditioning (MAC) transplants (total body irradiation plus cyclophosphamide) for adult high‐risk ALL in first or second complete remission. All transplants received a uniform strategy of pretransplant chemotherapy and GVHD prophylaxis. Compared to MAC transplants, RIC transplants had older age (46 years vs. 33 years, P < 0.001) and higher proportions of transplantation using peripheral blood (93.3% vs. 13.3%; P < 0.001) but otherwise showed similar characteristics. After a median follow‐up of 67 months, RIC transplants showed comparable nonrelapse mortality (21.2% vs. 24.3%) and disease‐free survival (50.8% vs. 54.9%) to MAC transplants, although relapse risk was higher (34.2% vs. 26.4%; HR, 2.07; P = 0.019) in multivariate analysis. Other independent factors associated with better outcomes were the presence of chronic GVHD and transplantation in first complete remission. Interestingly, the negative impact of RIC on relapse risk was seen only for Philadelphia‐positive ALL transplants (32.7% vs. 19.6%; HR, 3.46; P = 0.020), while no difference was found between RIC and MAC for Philadelphia‐negative ALL transplants (35.0% vs. 32.1%; HR, 1.39; P = 0.429). RIC can be considered as a reasonable choice for providing a sufficient long‐term graft‐versus‐leukemia effect for adult high‐risk ALL patients ineligible for MAC. Am. J. Hematol. 88:634–641, 2013. © 2013 Wiley Periodicals, Inc.
Efficacy of Ethiprole Applied Alone and in Combination with Conventional Insecticides for Protection of Stored Wheat and Stored Corn

Abstract The insecticidal pyrazole ethiprole, applied at rates of 7.5 and 10.0 ppm either alone or in combination treatments with deltamethrin, piperonyl butoxide, and chlorpyrifos-methyl, was evaluated as a protectant of stored wheat and stored corn. The commodities were treated with six treatment combinations, including an untreated control, and held for 6 mo at 22, 27, or 32°C and 57% RH. Bioassays were conducted monthly by exposing the rice weevil, Sitophilus oryzae (L.), and the red flour beetle, Tribolium castaneum (Herbst), on treated wheat and the maize weevil, Sitophilus zeamais (Motschulsky), and the red flour beetle on treated corn. The storage temperature of wheat did not significantly affect mortality of exposed insects (P ≥ 0.05). All rice weevils were dead after 1 wk in all treatments, and no F1 adults were produced. Mortality of red flour beetles was not dependent on either chemical treatment or bioassay month, and no F1 adults were produced. The storage temperature of corn did not significantly affect mortality of exposed insects (P ≥ 0.05). Mortality of maize weevils varied from 77.9 to 100% in all chemical treatments, and no F1 adults were produced. Mortality of red flour beetles was also variable among treatments and bioassay month and no F1 adults were produced. This is the first published report of a study in which pyrazoles have been evaluated against stored-grain insects.
Role of protein kinase C in caerulein induced expression of substance P and neurokinin-1-receptors in murine pancreatic acinar cells

Substance P (SP) is involved in the pathophysiology of acute pancreatitis (AP) via binding to its high‐affinity receptor, neurokinin‐1‐receptor (NK1R). An up‐regulation of SP and NK1R expression was observed in experimental AP and in caerulein‐stimulated pancreatic acinar cells. However, the mechanisms that lead to this up‐regulation are not fully understood. In this study, we showed the role of protein kinase C (PKC) in caerulein‐induced SP and NK1R production in isolated mouse pancreatic acinar cells. Caerulein (10−7 M) stimulation rapidly activated the conventional PKC‐α and novel PKC‐δ as observed by the phosphorylation of these molecules. Pre‐treatment of pancreatic acinar cells with Gö6976 (1–10 nM) and rottlerin (1–10 μM) inhibited PKC‐α and PKC‐δ phosphorylation, respectively, but not the other way round. At these concentrations used, PKC‐α and PKC‐δ inhibition reversed the caerulein‐induced up‐regulation of SP and NK1R, indicating an important role of PKCs in the modulation of SP and NK1R expression. Further experiments looking into signalling mechanisms showed that treatment of pancreatic acinar cells with both Gö6976 and rottlerin inhibited the activation of extracellular signal‐regulated kinase 1/2 (ERK1/2) and c‐Jun N‐terminal kinase (JNK). Inhibition of PKC‐α or PKC‐δ also affected caerulein‐induced transcription factor activation, as represented by nuclear factor‐κB and AP‐1 DNA‐binding activity. The findings in this study suggested that PKC is upstream of the mitogen‐activated protein kinases and transcription factors, which then lead to the up‐regulation of SP/NK1R expression in caerulein‐treated mouse pancreatic acinar cells.
Intermediary Spleen Microvasculature in Canis familiaris– Morphological Evidences of a Closed and Open Type

Numerous studies have been made regarding circulation via the red pulp of the spleen, and intense controversy surrounds the question as to whether or not endothelial continuity exists between arterial and venous vessels. Aware of this intense controversy, and in order to perform investigation over the spleen of dogs infected with a parasitic disease (future reports shall be done), the authors studied the vascularization of the normal dog spleen in order to define its normal pattern and evaluate the eventual changes of the circulation pattern under the parasitic condition. These studies led us to report, unequivocally, using complementary vascular replective techniques, that the normal dog's intermediary circulation is morphologically closed and of the open kind also. These findings are contrary to the thesis that defends the existence of a physiologically closed and morphologically open circulation in the dog spleen.
Maintaining constant frame rates in 3D texture-based volume rendering

3D texture-based volume rendering is a popular way of realizing direct volume visualization on graphics hardware. However, the slice-oriented texture memory layout of many current CPUs may lead to a strongly view-dependent performance, which reduces the fields of application of volume rendering. In this short technical note, we propose a slight modification of texture-based volume rendering that maintains roughly constant frame rates on any GPU architecture. The idea is to split the volume into smaller sub-volumes. These bricks can be oriented in different directions; thus the varying performance for different viewing directions is averaged out
Removing excess topology from isosurfaces

Many high-resolution surfaces are created through isosurface extraction from volumetric representations, obtained by 3D photography, CT, or MRI. Noise inherent in the acquisition process can lead to geometrical and topological errors. Reducing geometrical errors during reconstruction is well studied. However, isosurfaces often contain many topological errors in the form of tiny handles. These nearly invisible artifacts hinder subsequent operations like mesh simplification, remeshing, and parametrization. In this article we present a practical method for removing handles in an isosurface. Our algorithm makes an axis-aligned sweep through the volume to locate handles, compute their sizes, and selectively remove them. The algorithm is designed to facilitate out-of-core execution. It finds the handles by incrementally constructing and analyzing a Reeb graph. The size of a handle is measured by a short nonseparating cycle. Handles are removed robustly by modifying the volume rather than attempting "mesh surgery. " Finally, the volumetric modifications are spatially localized to preserve geometrical detail. We demonstrate topology simplification on several complex models, and show its benefits for subsequent surface processing.