Miracle-dz/UniFAR-FTUs huggingface dataset:
Letter to sound rules for accented lexicon compression

This paper presents trainable methods for generating letter to sound rules from a given lexicon for use in pronouncing out-ofvocabulary words and as a method for lexicon compression. As the relationship between a string of letters and a string of phonemes representing its pronunciation for many languages is not trivial, we discuss two alignment procedures, one fully automatic and one hand seeded which produce reasonable alignments of letters to phones (or epsilon). Top Down Induction Tree models are trained on the aligned entries. We show how combined phoneme/stress prediction is better than separate prediction processes, and still better when including in the model the last phonemes transcribed and part of speech information. For the lexicons we have tested, our models have a word accuracy (including stress) of 78% for OALD, 62% for CMU and 94% for BRULEX, allowing substantial reduction in the size of these lexicons.
A Connection-Centric Survey of Recommender Systems Research

Recommender systems attempt to reduce information overload and retain customers by selecting a subset of items from a universal set based on user preferences. While research in recommender systems grew out of information retrieval and filtering, the topic has steadily advanced into a legitimate and challenging research area of its own. Recommender systems have traditionally been studied from a content-based filtering vs. collaborative design perspective. Recommendations, however, are not delivered within a vacuum, but rather cast within an informal community of users and social context. Therefore, ultimately all recommender systems make connections among people and thus should be surveyed from such a perspective. This viewpoint is under-emphasized in the recommender systems literature. We therefore take a connection-oriented viewpoint toward recommender systems research. We posit that recommendation has an inherently social element and is ultimately intended to connect people either directly as a result of explicit user modeling or indirectly through the discovery of relationships implicit in extant data. Thus, recommender systems are characterized by how they model users to bring people together: explicitly or implicitly. Finally, user modeling and the connection-centric viewpoint raise broadening and social issues--such as evaluation, targeting, and privacy and trust--which we also briefly address.
Deep Structure of the Lunar South Pole‐Aitken Basin

The South Pole‐Aitken basin is a gigantic impact structure on the far side of the Moon, with an inner rim extending approximately 2,000 km in the long axis dimension. The structure and history of this basin are illuminated by gravity and topography data, which constrain the subsurface distribution of mass. These data point to the existence of a large excess of mass in the Moon's mantle under the South Pole‐Aitken basin. This anomaly has a minimum mass of 2.18 × 1018 kg and likely extends to depths of more than 300 km. Plausible sources for this anomaly include metal from the core of a differentiated impactor or oxides from the last stage of magma ocean crystallization. Although the basin‐forming impact event likely excavated the vast majority of the preexisting crust, the present‐day crust of the basin interior is at least 16 km thick in undisturbed regions.
THE EFFECTIVENESS OF BEST MANAGEMENT PRACTICES ON WATER QUALITY IN THE ATTOYAC BAYOU WATERSHED OF EAST TEXAS

i ACKNOWLEDGEMENTS . iii TABLE OF CONTENTS . iv LIST OF FIGURES . vii LIST OF TABLES . xiii LIST OF APPENDIX TABLES . xv LIST OF ACRONYMS . xx INTRODUCTION . 1 OBJECTIVES . 4 LITERATURE REVIEW . 5 Previous Studies of the Attoyac Bayou Watershed . 5 Water Quality Parameters . 8 Escherichia coli . 8 Nutrients . 14 Specific Conductivity . 19 Total Dissolved Solids . 20 Total Suspended Solids . 21 Secchi Depth . 22 Dissolved Oxygen . 23 pH . 24 Water Temperature . 25 Stream Discharge . 27 Potential Sources of Pollution . 28 Residential On-Site Sewage Facilities . 32 Livestock . 33 Wildlife and Feral Animals . 34 Poultry . 36 Wastewater Treatment Facilities . 37 Oil and Natural Gas Drilling . 39 v Pets . 39 Illegal Dumping . 40 Seasonal Variation and Persistence . 41 Proposed Best Management Practices for the Attoyac Bayou Watershed . 42 Best Management Practices for Livestock . 43 Best Management Practices for Feral Hogs . 45 Best Management Practices for On-Site Sewage Facilities . 47 METHODS OF STUDY . 53 Study Watersheds . 53 Sample Locations . 57 Field Monitoring Equipment . 60 Sample Collection . 61 Quality Control/Quality Assurance. 63 Documentation . 64 Analytical Method . 65 Statistical Analysis. 67 RESULTS AND DISCUSSION . 71 Water Quality Standards . 72 Statistical and Data Analysis . 74 Escherichia coli . 75 Ammonia-N . 87 Nitrate-N . 98 Nitrite-N . 108 Chloride . 109 Sulfate . 118 Total Dissolved Solids . 128 Total Phosphorus . 137 Total Suspended Solids . 147 Secchi Depth . 158 Specific Conductivity . 162 Dissolved Oxygen . 167 pH . 172
A Corpus-Based Approach for Building Semantic Lexicons

Semantic knowledge can be a great asset to natural language processing systems, but it is usually hand-coded for each application. Although some semantic information is available in general-purpose knowledge bases such as WordNet and Cyc, many applications require domain-specific lexicons that represent words and categories for a particular topic. In this paper, we present a corpus-based method that can be used to build semantic lexicons for specific categories. The input to the system is a small set of seed words for a category and a representative text corpus. The output is a ranked list of words that are associated with the category. A user then reviews the top-ranked words and decides which ones should be entered in the semantic lexicon. In experiments with five categories, users typically found about 60 words per category in 10-15 minutes to build a core semantic lexicon.
A Decomposition Theory for Binary Linear Codes

The decomposition theory of matroids initiated by Paul Seymour in the 1980s has had an enormous impact on research in matroid theory. This theory, when applied to matrices over the binary field, yields a powerful decomposition theory for binary linear codes. In this paper, we give an overview of this code decomposition theory, and discuss some of its implications in the context of the recently discovered formulation of maximum-likelihood (ML) decoding of a binary linear code over a binary-input discrete memoryless channel as a linear programming problem. We translate matroid-theoretic results of Grotschel and Truemper from the combinatorial optimization literature to give examples of nontrivial families of codes for which the ML decoding problem can be solved in time polynomial in the length of the code. One such family is that consisting of codes for which the codeword polytope is identical to the Koetter-Vontobel fundamental polytope derived from the entire dual code Cperp. However, we also show that such families of codes are not good in a coding-theoretic sense-either their dimension or their minimum distance must grow sublinearly with code length. As a consequence, we have that decoding by linear programming, when applied to good codes, cannot avoid failing occasionally due to the presence of pseudocode words.
Societal Implicit Memory and his Speed on Tracking Extrema over Dynamic Environments using Self-Regulatory Swarms

In order to overcome difficult dynamic optimization and environment extrema tracking problems, We propose a Self-Regulated Swarm (SRS) algorithm which hybridizes the advantageous characteristics of Swarm Intelligence as the emergence of a societal environmental memory or cognitive map via collective pheromone laying in the landscape (properly balancing the exploration/exploitation nature of our dynamic search strategy), with a simple Evolutionary mechanism that trough a direct reproduction procedure linked to local environmental features is able to self-regulate the above exploratory swarm population, speeding it up globally. In order to test his adaptive response and robustness, we have recurred to different dynamic multimodal complex functions as well as to Dynamic Optimization Control problems, measuring reaction speeds and performance. Final comparisons were made with standard Genetic Algorithms (GAs), Bacterial Foraging strategies (BFOA), as well as with recent Co-Evolutionary approaches. SRS's were able to demonstrate quick adaptive responses, while outperforming the results obtained by the other approaches. Additionally, some successful behaviors were found. One of the most interesting illustrate that the present SRS collective swarm of bio-inspired ant-like agents is able to track about 65% of moving peaks traveling up to ten times faster than the velocity of a single individual composing that precise swarm tracking system.
Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators

We present two new data structure tools—disjoint set union with bottom-up linking, and pointer-based radix sort—and combine them with bottom-level microtrees to devise the first linear-time pointer-machine algorithms for off-line least common ancestors, minimum spanning tree (MST) verification, randomized MST construction, and computing dominators in a flowgraph.
Comparing Recurrent and Convolutional Architectures for English-Hindi Neural Machine Translation

In this paper, we empirically compare the two encoder-decoder neural machine translation architectures: convolutional sequence to sequence model (ConvS2S) and recurrent sequence to sequence model (RNNS2S) for English-Hindi language pair as part of IIT Bombay’s submission to WAT2017 shared task. We report the results for both English-Hindi and Hindi-English direction of language pair.
Lessons from Three Views of the Internet Topology

Network topology plays a vital role in understanding the performance of network applications and protocols. Thus, recently there has been tremendous interest in generating realistic network topologies. Such work must begin with an understanding of existing network topologies, which today typically consists of a relatively small number of data sources. In this paper, we calculate an extensive set of important characteristics of Internet AS-level topologies extracted from the three data sources most frequently used by the research community: traceroutes, BGP, and WHOIS. We find that traceroute and BGP topologies are similar to one another but differ substantially from the WHOIS topology. We discuss the interplay between the properties of the data sources that result from specific data collection mechanisms and the resulting topology views. We find that, among metrics widely considered, the joint degree distribution appears to fundamentally characterize Internet AS-topologies: it narrowly defines values for other important metrics. We also introduce an evaluation criteria for the accuracy of topology generators and verify previous observations that generators solely reproducing degree distributions cannot capture the full spectrum of critical topological characteristics of any of the three topologies. Finally, we release to the community the input topology datasets, along with the scripts and output of our calculations. This supplement should enable researchers to validate their models against real data and to make more informed selection of topology data sources for their specific needs.
On determining the fair bandwidth share for ABR connections in ATM networks

The available bit rate (ABR) service is designed to fairly allocate the bandwidth unused by higher priority services. The network indicates to the ABR sources the rates at which they should transmit to minimize their cell loss. Switches must constantly measure the demand and available capacity, and divide the capacity fairly among the contending connections. In order to compute the fair and efficient allocation for each connection, a switch needs to determine the effective number of active connections. We propose a method for determining the number of active connections and the fair bandwidth share for each. We prove the efficiency and fairness of the proposed method analytically, and simulate it for a number of configurations.
The secrecy capacity of the MIMO wiretap channel

We consider the MIMO wiretap channel, that is a MIMO broadcast channel where the transmitter sends some confidential information to one user which is a legitimate receiver, while the other user is an eavesdropper. Perfect secrecy is achieved when the transmitter and the legitimate receiver can communicate at some positive rate, while insuring that the eavesdropper gets zero bits of information. In this paper, we compute the perfect secrecy capacity of the multiple antenna MIMO broadcast channel, where the number of antennas is arbitrary for both the transmitter and the two receivers. Our technique involves a careful study of a Sato-like upper bound via the solution of a certain algebraic Riccati equation.
Connected Text Recognition Using Layered HMMs and Token Passing

We present a novel approach to lexical error recovery on textual input. An advanced robust tokenizer has been implemented that can not only correct spelling mistakes, but also recover from segmentation errors. Apart from the orthographic considerations taken, the tokenizer also makes use of linguistic expectations extracted from a training corpus. The idea is to arrange Hidden Markov Models (HMM) in multiple layers where the HMMs in each layer are responsible for different aspects of the processing of the input. We report on experimental evaluations with alternative probabilistic language models to guide the lexical error recovery process.
Long‐Term Stability and Clinical Utility of Amplified Atrial Electrograms in a Single‐Lead ICD System with Floating Atrial Electrodes

Available atrial electrograms in implantable cardioverter defibrillators (ICDs) improve arrhythmia diagnosis, allow monitoring for atrial fibrillation, and may reduce the risk of inappropriate therapies. A recently introduced ICD system using a single‐lead with floating atrial electrodes provides diagnostic capability of a dual‐chamber system without placing an additional lead. Data on long‐term clinical performance of this system are limited.
Feedback Capacity of Stationary Gaussian Channels

The feedback capacity of additive stationary Gaussian noise channels is characterized as the solution to a variational problem. Toward this end, it is proved that the optimal feedback coding scheme is stationary. When specialized to the first-order autoregressive moving-average noise spectrum, this variational characterization yields a closed-form expression for the feedback capacity. In particular, this result shows that the celebrated Schalkwijk-Kailath coding scheme achieves the feedback capacity for the first-order autoregressive moving-average Gaussian channel, positively answering a long-standing open problem studied by Butman, Schalkwijk-Tiernan, Wolfowitz, Ozarow, Ordentlich, Yang-Kavcic-Tatikonda, and others. More generally, it is shown that a k-dimensional extension of the Schalkwijk-Kailath coding scheme achieves the feedback capacity for any autoregressive moving-average noise spectrum of order k. Simply put, the optimal transmitter iteratively refines the receiver's knowledge of the intended message
Development of a liquid chromatography-mass spectrometry method for determination of agrimol B in rat plasma: application to preclinical pharmacokinetics.

A sensitive and accurate liquid chromatography coupled with mass spectrometry (LC-MS) method was developed for the determination of agrimol B, a main active ingredient isolated from Agrimonia pilosa Ledeb. , in rat plasma. Chromatographic separation was achieved on a Zorbax CN column (150 × 4.6 mm, 5 µm), with isocratic elution consisting of acetonitrile and water (15:85, v/v) at a flow rate of 0.6 mL/min. Agrimol B and dryocrassin ABBA, an internal standard (IS), were analyzed by selected ion monitoring at m/z transitions of 681.3 and 819.4, respectively. This assay exhibited a good linearity with a correlation coefficient >0.99 and showed no endogenous interference with the analyte and IS. The limit of quantification of agrimol B was 8.025 ng/mL with acceptable precision and accuracy. The method was successfully applied in the pharmacokinetic study of agrimol B in rats after intravenous (1 mg/kg) and oral (2, 5 and 10 mg/kg) doses of agrimol B. The absolute bioavailability of agrimol B was 16.4-18.0% in rat. Our study clarifies the pharmacokinetic behavior of agrimol B in animals.
Morphometerical observations of intestine in Japanese quail

The present study was conducted on duodenum, jejunum, ileum, caecum and colorectum of Japanease quail. The weight of the duodenum on day 7th and 42nd was 0.47±0.05 g and 1.45±0.09 g, respectively. The length of the duodenum was found to be 8.60±0.36 cm and 14.13±0.55 cm on the same observation days. The weight and length of the jejunum ranged from 0.47±0.07 g to 1.62±0.19 g and 11.99±0.33 cm to 23.70±1.10 cm on day 7th and 42nd old birds, respectively. The values for the weight and length of the ileum were 0.30±0.03 g to 1.32±0.12 g and 10.21±0.80 cm to 20.88±1.61 cm, respectively at 7th and 42nd old birds of age. The weight and length of caecum were ranged from 0.22±0.03 g to 1.13±0.18 g and 4.13±0.07 cm to 7.69±0.30 cm. The values for the weight and length of the colorectum were 0.10±0.01 g to 0.51±0.05 g and 3.36±0.16 cm to 6.93±0.33 cm. The total length and weight of the five constituents, i.e. duodenum, jejunum, ileum, caecum and colorectum together formed the entire weight and length of the intestine which ranged from 1.55±0.08 g to 6.02±0.43 g and 37.97±1.04 to 73.34±1.61 cm, respectively at 7th and 42nd old birds of age.
Three-Dimensional Face Orientation and Gaze Detection from a Single Image

Gaze detection and head orientation are an important part of many advanced human-machine interaction applications. Many systems have been proposed for gaze detection. Typically, they require some form of user cooperation and calibration. Additionally, they may require multiple cameras and/or restricted head positions. We present a new approach for inference of both face orientation and gaze direction from a single image with no restrictions on the head position. Our algorithm is based on a face and eye model, deduced from anthropometric data. This approach allows us to use a single camera and requires no cooperation from the user. Using a single image avoids the complexities associated with of a multi-camera system. Evaluation tests show that our system is accurate, fast and can be used in a variety of applications, including ones where the user is unaware of the system.
The effect of differentiated dietary protein level on the performance of breeder quails

Modern quail breeds and varieties show differentiated nutritional requirements. Particularly the amount of protein consumed, as well as dietary energy to protein ratio determine the production results. The present study was aimed at determining the effect of isoenergetic diets differing in crude protein (CP) content, on the performance of Pharaoh quails. Three groups of birds (I, II and III) were fed with feed mixes containing 21, 19 and 17% CP, respectively. During 23 weeks their laying performance, egg weight, mortality rate, feed consumption and body weight were recorded and egg quality assessed. The dietary CP level did not affect the final body weight of birds significantly, and mortality was similar in all groups. In group III (17% CP of the diet) laying performance was significantly lower than in group I and II, while no differences were found in egg weight and quality. Feed conversion ratio (kg feed per kg eggs laid) was lowest in group III.
Segmentation of Expository Texts by Hierarchical Agglomerative Clustering

We propose a method for segmentation of expository texts based on hierarchical agglomerative clustering. The method uses paragraphs as the basic segments for identifying hierarchical discourse structure in the text, applying lexical similarity between them as the proximity test. Linear segmentation can be induced from the identified structure through application of two simple rules. However the hierarchy can be used also for intelligent exploration of the text. The proposed segmentation algorithm is evaluated against an accepted linear segmentation method and shows comparable results.
On population structure and breeding biology of burrowing crab Dotilla blanfordi Alcock, 1900

Background The present study investigated the population structure and breeding biology of the burrowing brachyuran crab species Dotilla blanfordi Alcock, 1900, which is commonly found on the sandy beach of Bhavnagar, located on the Gulf of Kachchh, Gujarat coast, India. Methods Monthly sampling was conducted from February 2021 to January 2022 at the time of low tide using three line transects perpendicular to the water line, intercepted by a quadrate (0.25 m2) each at three different levels of the middle intertidal region: 20 m, 70 m, and 120 m. The quadrate area was excavated up to 30 cm and sieved for specimen collection. The collected specimens were categorised into different sexes viz., male, non-ovigerous female, or ovigerous female. For the fecundity study of D. blanfordi, the carapace width (mm) as a measure of size as well as their wet weight (g), size, number, and mass of their eggs were also recorded. Results The study revealed sexual dimorphism among the population, with females having significantly smaller sizes as compared to males. The overall population was skewed towards females, with a bimodal distribution of males and females. The occurrence of ovigerous females throughout the year suggests that the population breeds incessantly throughout the year, with the highest occurrence in August and September. A positive correlation was observed between the morphology of crabs (carapace width and wet body weight) and the size, number, and mass of eggs.
Relay Subset Selection in Wireless Networks Using Partial Decode-and-Forward Transmission

This paper considers the problem of selecting a set of relay nodes to assist a transmitting node in a two-hop wireless network. Throughput-maximizing relay subset selection is a difficult problem that depends on variables such as node locations and power constraints. It is proposed that all relays employ partial decode-and-forward operations to improve the tractability of the relay selection problem. This allows relay selection to be transformed into a simpler relay placement problem which motivates two proximity-based relay selection algorithms. These algorithms are compared with a greedy algorithm based on relay channel gains to the sink and an algorithm that randomly selects relays. The diversity gain achieved by employing multiple relay nodes is derived. The proposed proximity-based algorithms offer good performance in terms of the expected achieved rate.
Respiratory deposition model of an inhaled aerosol bolus

The bolus delivery method is designed to deliver a dose to the desired location in the lung, and it has the advantage of fewer side effects and a more efficient way of delivery. Based upon the lung deposition model developed for continuously inhaling aerosols of constant concentration, a mathematical model of aerosol bolus deposition is proposed. The calculated results show that the recovery depends on the bolus penetration depth, flow rate, particle size, breath holding time and bolus volume. Three sets of published experimental data with different controlling factors (particle size, flow rate and breath holding time) are adopted to make the quantitative comparisons with the calculated results. The predictions and data for the low intrinsic motion particles (∼1 μm) have good agreement, as do the coarse particles in the shallow airways region. For females, the recovery was found to be consistently lower than that for males.