Miracle-dz/UniFAR-FTUs huggingface dataset:
An Efficient Machine Translation System for English to Indian Languages Using Hybrid Mechanism

Machine Translation is an essential approach for localization, and is especially appropriate in a linguistically diversenation like India. Automatic translation between languages which are morphologically rich and syntactically different is generally regarded as a complex task. A number of machine translation systems have been proposed in literature. But, conventional rule-based machine translation system is costly in terms of formulating rules. It introduces inconsistencies, and it is inflexible to be robust. Statistical MT is an approach that automatically attains knowledge from a vast amount of training data. This approach is characterized by the use of machine learning techniques. But, still there is scope for better performance of the system. In this paper, a Hybrid Machine Translation (HMT) approach is proposed which is the combination of rule based and statistical technique for translating text from English to Indian languages such as Tamil, Malayalam and Hindi. The rule based machine translation technique, involves the formation of rules which helps to re-order the syntactic structures of the source language sentence along with its dependency information which brings close to the structure of the target sentence. The parser identifies the syntactical elements in English sentences and suggests its Indian languages translation taking into account various grammatical forms of those Indian languages. Context Free Grammars (CFG) is used in generation of the language structures, and then the errors in the translated sentences are corrected by applying a statistical technique. Simplifying and segmenting an input language text becomes mandatory in order to improve the machine translation quality. The experimental results show that the proposed approach competes with the machine translation methods reported in the literature and it provides the best translated output in each language.
New Techniques to Reduce Sidelobes in OFDM System

In this paper, we consider out-of-band radiations caused by high sidelobes in orthogonal frequency division multiplexing (OFDM) system. Suppression of sidelobes in OFDM system allows higher spectral efficiency and less interference with existing legacy systems in OFDM based overlay system. We combine different sidelobe suppression techniques to suppress the sidelobes in OFDM system. The multiple-choice sequence (MCS) is combined with cancellation carriers (CCs) and also MCS is combined with subcarrier weighting (SW) technique. MCS is applied prior to CCs or SW techniques. Simulation results show that combining MCS with CCs and MCS with SW techniques the sidelobes in OFDM system can be significantly reduced, which allow a successful co-existance between OFDM overlay system and an existing legacy system.
Structural Aspects of the System/360 Model 85 II: The Cache

The cache, a high-speed buffer establishing a storage hierarchy in the Model 85, is discussed in depth in this part, since it represents the basic organizational departure from other SYSTEM/360 computers. Discussed are organization and operation of the cache, including the mechanisms used to locate and retrieve data needed by the processor. The internal performance studies that led to use of the cache are described, and simulated performance of the chosen configuration is compared with that of a theoretical system having an entire 80-nanosecond main storage. Finally, the effects of varying cache parameters are discussed and tabulated.
#secondcivilwarletters from the front: Discursive illusions in a trending Twitter hashtag

When conservative media personality and conspiracy theorist Alex Jones warned of an impending Second Civil War to be initiated by Democrats, he instigated a viral hashtag on Twitter – #secondcivilwarletters – which drew tweets of political commentary and critique in a style mimicking war letters from the American Civil War. Using a sample of these tweets, this article explores the evocation of discursive illusions already established within mainstream and alternative media discourse about contemporary partisan politics in America – that is, the divide between the Republicans and the Democrats and how they categorise each other. To do this we adopt Bhatia’s framework of the discourse of illusion and its three main components of linguistic and semiotic action, historicity and social impact. The analysis reveals the extent to which this illusion has permeated the consciousness of the users as they present their ideological beliefs and positions in this new media context.
Modeling Energy Dynamics in Mice with Skeletal Muscle Hypertrophy Fed High Calorie Diets

Retrospective and prospective studies show that lean mass or strength is positively associated with metabolic health. Mice deficient in myostatin, a growth factor that negatively regulates skeletal muscle mass, have increased muscle and body weights and are resistant to diet-induced obesity. Their leanness is often attributed to higher energy expenditure in the face of normal food intake. However, even obese animals have an increase in energy expenditure compared to normal weight animals suggesting this is an incomplete explanation. We have previously developed a computational model to estimate energy output, fat oxidation and respiratory quotient from food intake and body composition measurements to more accurately account for changes in body composition in rodents over time. Here we use this approach to understand the dynamic changes in energy output, intake, fat oxidation and respiratory quotient in muscular mice carrying a dominant negative activin receptor IIB expressed specifically in muscle. We found that muscular mice had higher food intake and higher energy output when fed either chow or a high-fat diet for 15 weeks compared to WT mice. Transgenic mice also matched their rate of fat oxidation to the rate of fat consumed better than WT mice. Surprisingly, when given a choice between high-fat diet and Ensure® drink, transgenic mice consumed relatively more calories from Ensure® than from the high-fat diet despite similar caloric intake to WT mice. When switching back and forth between diets, transgenic mice adjusted their intake more rapidly than WT to restore normal caloric intake. Our results show that mice with myostatin inhibition in muscle are better at adjusting energy intake and output on diets of different macronutrient composition than WT mice to maintain energy balance and resist weight gain.
Title Growth of the zeta function for a quadratic map and the dimension of the Julia set Permalink

We show that the zeta function for the dynamics generated by the map z → z2+c, c < −2, can be estimated in terms of the dimension of the corresponding Julia set. That implies a geometric upper bound on the number of its zeros, which are interpreted as resonances for this dynamical systems. The method of proof of the upper bound is used to construct a code for counting the number of zeros of the zeta function. The numerical results support the conjecture that the upper bound in terms of the dimension of the Julia set is optimal. Mathematics Subject Classification: 3 7F10, 37C30, 37M99, 37N20 (Some figures in this article are in colour only in the electronic version)
REDUCING THE ENERGY CONSUMPTION IN WIRELSESS SENSOR NETWORKS USING SINK RELOCATION MECHANISM

Base Station (BS) location and physical topology of a network play an important role in a Wireless Sensor Networks (WSN) because the BS position governs the lifetime of networks. Optimizing the topology reduces the issues that arise due to the location of the destination node. During network formation, some nodes have tends to have that have longer distance to BS. In this case, data has to travel a longer distance to reach a BS. The node failure in WSN occurs majorly due to the exhaustion of the battery and replacing this is a difficult task. Therefore, these long transmissions have effects on network’s lifetime by wasting node’s energy. This can be overcome by relocating the BS using a clustered WSN. This proposed approach discussed about all possible locations to find the optimal position of BS in Low energy Aware Clustering hierarchy (LEACH) which is an energy-efficient protocol and shows the effects of BS Location in the WSN and the obtained results are compared with the original Leach and Leach-B
SVD-based group recommendation approaches: an experimental study of Moviepilot

Nowadays most recommender systems are made for individuals. However, there is a need to offer recommendations to a group rather than an individual in many scenarios, such as interactive TV watched in a family, friends traveling together. Taking consideration of group information as an additional context has also been a challenge in context-aware recommender systems. In this work, we propose some SVD-based group recommendation methods through aggregating ratings of group members with different group decision strategies, including weighted, least misery, and hybrid ones. These methods are divided into two categories: SVD-based aggregation profiles and aggregation predictions methods. The former ones employ "group aggregation first, SVD-based prediction later", while the latter ones are opposite. Finally we conduct some experiments on the Moviepilot dataset released for the Challenge on Context-Aware Movie Recommendation (CAMRa2011) to evaluate the effectiveness of different SVD-based group recommendation approaches, and analyze the results.
CodePLC: A Network Coding MAC Protocol for Power Line Communication

Power line communication systems face several challenges which degrade data communication quality. To overcome such issues, we propose CodePLC, a network coding Power Line Communication MAC protocol. We use a single relay node to intermediate communication, storing, and forwarding linear combinations of data packets. We evaluate CodePLC performance through simulations of a common topology for a PLC system under a wide range of scenarios. In sum, our results show that in a broadcast like transmission, the use of network coding enhances overall system performance. When compared to a traditional PLC system, we have observed an average of 115% goodput increase. Moreover, our protocol reduces in 112% the average of network occupancy buffers. Finally, CodePLC reduces mean latency by four times.
QoS and energy trade off in distributed energy-limited mesh/relay networks: a queuing analysis

In a distributed multihop mesh/relay network (e.g., wireless ad hoc/sensor network, cellular multihop network), each node acts as a relay node to forward data packets from other nodes. These nodes are often energy-limited and also have limited buffer space. Therefore, efficient power saving mechanisms (e.g., sleeping mechanisms) are required so that the lifetime of these nodes can be extended while at the same time the quality of service (QoS) requirements (e.g., packet delay and packet loss rate) for the relayed packets can be satisfied. In this paper, we present a novel queueing analytical framework to study the tradeoff between the energy saving and the QoS at a relay node. Specifically, by modeling the bursty traffic arrival process as a MAP (Markovian arrival process) and the packet service process as having a phase-type (PH) distribution, we model each node as a MAP/PH/1 nonpreemptive priority queue. The relayed packets and the node's own packets form two priority classes and the medium access control (MAC)/physical (PHY) layer protocol in the transmission protocol stack acts as the server process. Moreover, we use a phase-type vacation model for the energy-saving mechanism in a node when the MAC/PHY protocol refrains from transmitting in order to save battery power. Two different power saving mechanisms due to the standard exhaustive and the number-limited exhaustive vacation models (both in multiple vacation cases) are analyzed to study the tradeoff between the QoS performance of the relayed packets and the energy saving at a relay node. Also, an optimization formulation is presented to design an optimal wakeup strategy for the server process under QoS constraints. We use matrix-geometric method to obtain the stationary probability distribution for the system states from which the performance metrics are derived. Using phase-type distribution for both the service and the vacation processes and combining the priority queueing model with the vacation queueing model make the analysis very general and comprehensive
Preconditioned CG for Image Deblurring 3 1 Introduction 1 . 1 The problem of deblurring

Several methods have been proposed to reduce boundary artifacts in image deblurring. Some of those methods impose certain assumptions on image pixels outside the field-of-view; the most important of these assume reflective or anti-reflective boundary conditions. Boundary condition methods, including reflective and anti-reflective ones, however, often fail to reduce boundary artifacts, and, in some cases, generate their own artifacts, especially when the image to be deblurred does not accurately satisfy the imposed condition. To overcome these difficulties, we suggest using free boundary conditions, which do not impose any restrictions on image pixels outside the field-of-view, and preconditioned conjugate gradient methods, where preconditioners are designed to compensate for the non-uniformity in contributions from image pixels to the observation. Our simulation studies show that the proposed method outperforms reflective and anti-reflective boundary condition methods in removing boundary artifacts. The simulation studies also show that the proposed method can be applicable to arbitrarily shaped images and has the benefit of recovering damaged parts in blurred images.
ARMA parameter estimation: Revisiting a cepstrum-based method

An interesting but apparently forgotten auto-regressive moving-average (ARMA) parameter estimation method, introduced by one of us in 1984, and refined later on by others, is revisited. In the process, we provide a new simpler derivation of the method as well as an enhanced version of its cepstrum-based step. We argue that this method has an appealing advantage over Durbin's method, which is probably the most frequently used non-iterative method for ARMA parameter estimation.
Registration of Pre- and Postresection Ultrasound Volumes With Noncorresponding Regions in Neurosurgery

Brain tissue deforms significantly after opening the dura and during tumor resection, invalidating preoperative imaging data. Ultrasound is a popular imaging modality for providing the neurosurgeon with real-time updated images of brain tissue. Interpretation of postresection ultrasound images is difficult due to large brain shift and tissue resection. Furthermore, several factors degrade the quality of postresection ultrasound images such as the strong reflection of waves at the interface of saline water and brain tissue in resection cavities, air bubbles, and the application of blood-clotting agents around the edges of resection. Image registration allows the comparison of postresection ultrasound images with higher quality preresection images, assists in interpretation of postresection images and may help identify residual tumor, and, as such, is of significant clinical importance. In this paper, we propose a nonrigid symmetric registration (NSR) framework for accurate alignment of pre- and postresection volumetric ultrasound images in near real time. We first formulate registration as minimization of a regularized cost function and analytically derive its derivative to efficiently optimize the cost function. An outlier detection algorithm is proposed and utilized in this framework to identify noncorresponding regions (outliers) and therefore improve the robustness and accuracy of registration. We use an efficient second-order minimization method for fast and robust optimization. Furthermore, we exploit a symmetric and inverse-consistent method to generate realistic deformation fields. The results show that NSR significantly improves the quality of the alignment between pre- and postresection ultrasound images.
Mixed-order and higher-order ambiguity functions

Current automotive radar systems measure the distance, the relative velocity and the direction of objects in their environment. This information enables the car to support the driver. In general, objects cannot be completely separated by their distance or relative velocity, thus order and direction estimations are needed to estimate the number of objects and their direction of arrival. In this paper we start with the antenna array ambiguity function of single objects known from literature and generalize it to multiple objects. Therewith we develop criterions to evaluate the order estimation capabilities of an antenna array and its unique direction estimation of multiple objects. It is shown that some arrays are much more suitable than others for estimating the number of objects. Arrays which can be used to estimate the direction of a single object ambiguityfree are not always able to estimate the direction of two objects uniquely. The proposed criterions can be used to optimize automotive radar antenna arrays to be non-ambiguous up to multiple objects to handle complicated traffic situations correctly.
Die deutsche Version des Musculoskeletal Pain Intensity and Interference Questionnaire for Musicians (MPIIQM-G): Übersetzung und Validierung bei professionellen Orchestermusikern

Viele Musiker leiden an spielbedingten muskuloskelettalen Beschwerden (playing-related disorder, PRMD). Eine Vielzahl epidemiologischer Untersuchungen hinsichtlich spielbedingter Beschwerden bei Musikern setzen keine Selbstbeurteilungsinstrumente ein, insbesondere zur Beurteilung muskuloskelettaler Schmerzintensität und -beeinträchtigung im Kontext von Funktion und psychosozialen Parametern. Ziel dieser Studie war es, den englischsprachigen Fragebogen „Muskuloskeletal Pain Intensity and Interference Questionnaire for Musiciance“ (MPIIQM) in eine deutschsprachige Version (MPIIQM-G) zu übersetzen, kulturübergreifend anzupassen und an einer Population von professionellen Orchestermusikern zu validieren. Die übersetzte und kulturelle adaptierte deutsche Version des Fragebogens wurde an eine Gesamtstichprobe von 367 professionellen Orchestermusikern in Deutschland gesendet, welche die Einschlusskriterien erfüllten. Von dieser Stichprobe beantworteten 124 den Fragebogen. Die psychometrische Analyse zeigte eine klare Zweidimensionalität „Schmerzintensität“ und „Schmerzbeeinträchtigung“. Die interne Konsistenz war sowohl für die Dimensionen „Schmerzintensität“ und „Schmerzbeeinträchtigung“ als für die gesamte Skala sehr hoch. Die Werte des Intraklassen-Korrelationskoeffizienten für die Test-Retest Reliabilität wiesen eine gute bis exzellente Reliabilität auf. Die Subskalen des MPIIQM-G zeigten eine starke Korrelation mit dem „Brief Pain Inventory“ (BPI) und der Kurzversion des „Disabilities of the Arm, Shoulder and Hand“ (QuickDash) sowie eine schwache Korrelation mit der „Fatique Severity Scale“ (FSS). Diese Ergebnisse bestätigten die gute Konstruktvalidität des MPIIQM-G. Sowohl die original englische wie auch die deutsche Version des MPIIQM besitzen ähnlich hohe Gütekriterien. Somit ist der MPIIQM-G ein nützliches Selbsteinschätzungsinstrument für die Messung und Evaluation von muskuloskelettaler Schmerzintensität und -beeinträchtigung bei professionellen Orchestermusikern.
Ece 695 " Statistical Learning Theory " Lecture Notes Lecture 4 *

In the previous lectures, our set-up was as follows. We had a set X of elements and a distribution P over the set X × {0, 1}. The distribution defines the probability (or density) for each element x ∈ X to “come up”, and the probability for a certain property of x to hold or not to hold. If (x, 1) “comes up,” then x has the property, and if (x, 0) “comes up,” then x does not have the property. The learning problem consists in predicting, given x generated by P , whether or not this property holds. We are given an independent, identically distributed (i.i.d.) sample S ∈ (X × {0, 1}) of distribution P that contains m pairs (xi, yi), i = 1, 2, . ,m, where xi ∈ X and yi ∈ {0, 1}, and we use S to find a function h : X → {0, 1} that takes x and predicts y in a new pair (x, y). The prediction function h, called a hypothesis, must be selected from a given set H of functions, called the hypothesis class. Ideally, we should choose h ∈ H such that it minimizes the true error E (h) defined as E (h) := P [(x, y) ∼ P : h(x) 6= y] In practice, however, all we can do is to choose h ∈ H that minimizes the training error E(h) which equals
Comparison of two middleware data dissemination services in a wide-area distributed system

The paper provides an experimental comparison of two middleware data dissemination services: a distributed object based service, and a message based service. The paper compares these two services in the context of a common application: a wide area network collaboratory, namely the Upper Atmospheric Research Collaboratory (UARC). UARC is an example of an application that reliably streams data from a set of suppliers to a set of receivers. This comparison highlights the tradeoffs between ease of implementation and performance for a data streaming middleware service. By relying on a rigid language primitive, namely remote method invocation, the object based dissemination service gave up the control over its transport policies. In contrast, the lower level socket based service was specifically constructed to provide a flexible interface to its applications. This flexibility allowed the middleware to better support data delivery to a heterogeneous set of receivers. This is important in a wide area distributed system where hosts are connected together over a broad spectrum of network links. The paper provides a concrete example of the effects of high level design choices in the implementation of a wide area distributed system's communication middleware.
DIVA: Applying Decision Theory to Collaborative Filtering

This paper describes DIVA, a decision-theoretic agent for recommending movies that contains a number of novel features. DIVA represents user preferences using pairwise comparisons among items, rather than numeric ratings. It uses a novel similarity measure based on the concept of the probability of conflict between two orderings of ¯ items. The system has a rich representation of preference, distinguishing between a user’s general taste in movies and his immediate interests. It takes an incremental approach to preference elicitation in which the user can provide feedback if not satisfied with the recommendation list. We empirically evaluate the performance of the system using the EachMovie collaborative filtering database.
Communication Eecient Linear System Computations on Folded Hypercube Architectures

abstract This paper presents algorithms for solving FFT and a class of matrix operations for the folded hypercube. An emphasis will be placed on showing where the folded hypercube can have an advantage in processing speed or in exibility of implementation over other architectures. This paper will refer to literature on hypercube algorithms and discusses methods of implementing hypercube algorithms to run on folded cubes. In addition, we give methodologies to embed multidimensional arrays and butterry networks onto the folded hypercube with optimal expansion and dilation. In our embedding schemes, it has been assumed that the node load as well as link congestion equal to unity.