Miracle-dz/UniFAR-FTUs huggingface dataset:
Imaging framework to assess bone ultrastructure organization

Bone’s remarkable mechanical properties are a result of its hierarchical structure. Bone’s building blocks on an ultrastructural level are the mineralized collagen fibrils, made up of collagen fibrils and crystal platelets. The organization of bone’s ultrastructure has been the matter of numerous studies based on a variety of imaging techniques in the past decades. These techniques either exploit physical principles such as polarization, diffraction or scattering to examine bone ultrastructure orientation and arrangement or directly image the fibrils at the sub-micrometer scale. They make use of diverse probes such as visible light, X-rays and electrons at different scales, from centimeters down to nanometers. They allow imaging of bone sections or surfaces in two dimensions (2D) or investigating bone tissue truly in 3D, in vivo or ex vivo, and sometimes in combination with in situ mechanical experiments. The purpose of this review is to summarize and discuss this broad range of imaging techniques and the different modalities of their use, in order to discuss their advantages and limitations for the assessment of bone ultrastructure organization: the orientation and arrangement of mineralized collagen fibrils.
A Framework for Empirical Models of Dynamic Demand∗

This paper provides a framework for modeling dynamic demand. A recent literature estimates the dynamics of consumer demand in a variety of different contexts, including durable goods, storable goods, and subscription services. To make these estimation problems tractable, researchers typically restrict consumer expectations using an Inclusive Value Sufficiency (IVS) assumption. Some versions of IVS make assumptions on flow utilities and others on continuation values. A flow utility assumption is more palatable because flow utilities map closely to fundamentals. However, we show that a flow utility assumption requires a further assumption that there are sets of products with common continuation values. We argue that these two sets of assumptions result in different economic implications and hence are suitable in different contexts. We also show that most models employ an assumption on the separability of utility from holdings from utility for new purchases, and we discuss this restriction. Finally, we categorize the assumptions made by various empirical models within our unified framework. ∗We wish to thank Igal Hendel, Robin Lee, Aviv Nevo, Pasquale Schiraldi and Philipp Schmidt-Dengler and participants at the 2013 Demand Estimation and Modeling Conference for helpful discussions on these topics. NSF Grants SES-0551348 and SES-0922540 provided support.
No. 029/2020/MKT Consumer Choices Across Seemingly Disparate Product Categories

This research takes a first step in modeling latent processes that govern consumer decision making by examining consumption across seemingly disparate categories. Marketing activities today are coordinated in a variety of categories and in a variety of formats, and consumers naturally shop around a globe of unrelated product categories that are beyond the traditionally defined “shopping basket”. We propose a hierarchical multinomial processing tree model to empirically examine the driver, which is defined as the “latent trait”, which governs consumer choices across five seemingly disparate product categories: media consumption, automobile purchases, financial investments, soft drinks and cell phone plans through a dataset consisting of 5,014 consumers in the United States. We further investigate how consumer behavior systematically varies from one category to another and finally suggest new approaches to segment and profile consumers based on latent traits across multiple categories. In doing so, this paper contributes to the consumer decision literature in three ways: 1) theoretically, the latenttrait approach provides rich support in examining the underlying psychological processes; 2) methodologically, the relative merits of models with continuous versus discrete representations of consumer heterogeneity are discussed; and, 3) substantively, new insights on targeting and profiling based on latent processes rather than observed behavior are presented with respect to managing across seemingly unrelated product categories.
Appendix-Learning To Navigate The Synthetically Accessible Chemical Space Using Reinforcement Learning

During training, for the bootstrapping phase of first 3,000 time steps, the agent randomly chooses any valid reaction template T and any valid reactant R. After the bootstrapping phase, a Gaussian noise of mean 0 and standard deviation 0.1 is added to the action outputted by the π network. No noise is added during the inference phase. While updating the critic network, we multiply the normal random noise vector with policy noise of 0.2 and then clip it in the range -0.2 to 0.2. This clipped policy noise is added to the action at the next time step a′ computed by the target actor networks f and π. The actor networks (f and π networks), target critic and target actor networks are updated once every two updates to the critic network. The representation of molecules plays a very important role in the overall performance of PGFS. We have experimented with three feature representations: ECFP, MACCS and custom features from MolDSet (RLV2), and observed that ECFP as state features and RLV2 as action features are the best representations. We used the following features in RLV2: MaxEStateIndex, MinEStateIndex, MinAbsEStateIndex, QED, MolWt, FpDensityMorgan1, BalabanJ, PEOE-VSA10, PEOE-VSA11, PEOE-VSA6, PEOE-VSA7, PEOEVSA8, PEOE-VSA9, SMR-VSA7, SlogP-VSA3, SlogP-VSA5, EState-VSA2, EState-VSA3, EState-VSA4, EState-VSA5, EState-VSA6, FractionCSP3, MolLogP, Kappa2, PEOE-VSA2, SMR-VSA5, SMR-VSA6, EState-VSA7, Chi4v, SMR-VSA10, SlogP-VSA4, SlogP-VSA6, EState-VSA8, EState-VSA9, VSAEState9. Figures 1,2 show the f network loss, policy loss, value loss and the average (inference) reward on a set of randomly chosen 100 initial reactants as the training progresses; for all possible combinations of state and action feature representations; for shaped-QED and shaped-HIV-CCR5 rewards respectively.
Spatial-Temporal Dynamics of a Diffusive Lotka–Volterra Competition Model with a Shifting Habitat II: Case of Faster Diffuser Being aWeaker Competitor

Westudy aLotka–Volterra competition–diffusionmodel that describes the growth, spread and competition of two species in a shifting habitat. Some results have been obtained previously for some cases for the diffusion rates and competitions rates, and in this paper we continue to explore the remaining complementary case for the spatial dynamics of the system. Our main result in this paper reveals an essential difference between the case of faster diffuser being weak competitor and the case of faster diffuser being strong competitor: with the severe habitat worsening with constant speed, for the former the two competing species can co-persist by spreading, whereas for the latter, co-persistence is impossible.
Observation of predator-prey dynamics and the universality class in transitional pipe turbulence

Abstract Near the onset to turbulence in pipes, around Re ∼ 1700− 2000, turbulent puffs decay either directly or, at higher Reynolds numbers through splitting, with characteristic time-scales that exhibit a super-exponential dependence on Reynolds number [3, 1, 7]. The goal of our work [5] is to understand the phenomenology of this transition in terms of standard phase transition concepts, and to calculate the universality class from first principles. Using direct numerical simulations (DNS) of transitional pipe flow, we show that a collective mode, a so-called zonal flow emerges at large scales, activated by anisotropic turbulent fluctuations through an inverse cascade of energy. This zonal flow imposes a shear on the turbulent fluctuations that tends to suppress their anisotropy, leading to stochastic predator-prey dynamics. The effective stochastic theory for the predator-prey modes identified in the DNS reproduces the super-exponential lifetime statistics and phenomenology of pipe flow experiments, correctly predicts the phase diagram of transitional turbulence, and can be mapped exactly to the field theory of directed percolation.
Strict single-mode high power 1018 nm fiber laser operating in multimode Yb-doped fiber

We demonstrate single-mode 1018nm laser emission from a monolithic fiber laser that employs multimode gain fiber. Efficient high order mode suppression is achieved by using a pair of fiber Bragg grating that scribed in the core of single mode fiber. 85 W single-mode 1018 nm laser is obtained with a slope efficiency of 80%. The M value is measured to be 1.06. Keywords— ytterbium doped fiber laser; single mode; mode mismatch; efficiency
Zero-forcing in random regular graphs

The zero forcing process is an iterative graph colouring process in which at each time step a coloured vertex with a single uncoloured neighbour can force this neighbour to become coloured. A zero forcing set of a graph is an initial set of coloured vertices that can eventually force the entire graph to be coloured. The zero forcing number is the size of the smallest zero forcing set. We explore the zero forcing number for random regular graphs, improving on bounds given by Kalinowski, Kam˘cev and Sudakov [15]. We also propose and analyze a degree greedy algorithm for ﬁnding small zero forcing sets using the diﬀerential equations method.
Reliability-Enhanced Task Offloading in Mobile Edge Computing Environments

Internet of Things (IoT) devices have become an integral part of our lives and are increasingly used in almost every field. Subsequently, there are a large number of latency-sensitive IoT applications (e.g., face recognition and autonomous driving) targeted for mobile edge computing environments. These IoT applications are often split into multiple collaborative tasks and offloaded onto containers or virtual machines (VMs) with certain failure rates and recovery rates. If these containers or VMs are not deployed in the same edge servers, the bandwidth resources of edge clouds must be consumed to transfer data. These factors increase the completion time of IoT applications to different degrees, and then affect their reliability level. Therefore, there exists equilibrium between the reliability level and bandwidth consumption. In this article, we investigate the equilibrium of minimizing the bandwidth consumption of IoT applications while maximizing the reliability level of these IoT applications during task offloading. We propose a multiobjective optimization problem, and transform it to a single-objective optimization problem. Furthermore, we introduce two efficient approaches to acquire two near-optimal solutions. The results of simulation experiments demonstrate that our proposed approaches can observably enhance the reliability level and reduce the bandwidth consumption of IoT applications compared with other related approaches. Meanwhile, we also make a comparative analysis of our proposed approaches.
AUTOMATIC SPEECH RECOGNITION ENGINES ADAPTED FOR EMBEDDED PLATFORMS

Conventional hybrid automatic speech recognition (ASR) engines exploit state-ofthe-art Deep Neural Network (DNN) based acoustic model (AM) trained with Lattice Free-Maximum Mutual Information (LF-MMI) criterion and n-gram Language Model (LM). These systems usually have a large number of parameters and therefore require significant parameter reduction to operate on embedded devices. This thesis studies an impact of the parameter reduction on the overall speech recognition performance. Following three approaches are presented: (i) AM trained in the Kaldi framework with conventional factorized TDNN (TDNN-F) architecture. (ii) the TDNN built in Kaldi is loaded into the Pytorch toolkit using a C++ wrapper. The weights and activation parameters are then quantized and the inference is performed in Pytorch. (iii) post quantization training for fine-tuning. Results obtained on standard Librispeech setup provide an interesting overview of recognition accuracy with respect to applied quantization schemes. Furthermore, this thesis revisits Keyword Spotting (KWS) approaches and demonstrates that LF-MMI AM built to classify context-independent phones can operate well when integrated within a light-weight decoder providing a likelihood ratio based confidence score. The KWS was compared with the conventional lattice-based system on several keyword detection datasets.
A computational study of Exterior Point Simplex Algorithm variations

This paper analyses three variations of a relatively new algorithmic family for the linear problem, the Exterior Point Algorithms. These Simplex type-methods make use also of exterior points, along with the feasible path in order to converge to the optimal solution. We implement them using the well-known 2-phase method for general linear problems, and we use three different strategies to enter phase-2, the one which actually solves the initial problem. All these variations use the same second phase, but not also the first one. We use the advantage of these algorithms that if the current direction crosses the feasible region of our problem, then the algorithm will surely converge to the optimal solution. This attribute gives us the ability to avoid a significant amount of iterations in phase-1 or totally the phase-1 part, if we manage to initialize always the algorithm with such a direction. We compare them to the revised Primal Simplex algorithm and the one that is already built-in in the Matlab R2007b software, using a computational study. The algorithms were tested on randomly generated sparse linear problems of various sizes and densities, the majority of which were optimal. We compared them for the total covered number of iterations as well as the cpu-time needed to solve the problems. As shown, these algorithms outperform the revised Primal Simplex algorithm, both in iterations and solution times
A Survey of User Selection and Sum Rate Maximization

: A cellular network is a communication network.Sumrate maximization is an important factor associated with cellular communication. Basically in cellular communication systems downlink is modelled as broadcast channel which includes one base station and several users, where the base station can transmit data to many user. Lots of resource allocation policies are available to achieve maximum sum rate in broadcast channel.This paper includes different techniques and summaries about the sum rate maximization. The major problem in cellular communication system is the active user selection. Selecting active users among many users is a complex optimization problem
2 2 A pr 2 01 6 Neutron capture reactions relevant to s-process and p-process in the domain of the N = 50 shell closure

Radiative thermal neutron capture cross sections for nuclei participating in s-process and pprocess nucleosynthesis in and around N = 50 closed neutron shell have been calculated in statistical semi-microscopic Hauser-Feshbach approach for the energy range of astrophysical interest. A folded optical-model potential is constructed utilizing the standard DDM3Y real nucleon-nucleon interaction. The folding of the interaction with target radial matter densities, obtained from the relativistic-mean-field approach, is done in coordinate space using the spherical approximation. The standard nuclear reaction code TALYS1.8 is used for cross-section calculation. The cross sections are compared with experimental results and reasonable agreements are found for almost all cases. Maxwellian-averaged cross sections (MACS) for the nuclei are presented at a single thermal energy of 30 keV relevant to s-process. We have also presented the MACS values over a range of energy from 5 to 100 keV for neutron magic nuclei with (N = 50).
A Proof of Theorem 1: General regret bound

Theorem 1 Consider Thompson sampling with prior p0 on a function class F applied to the bandit problem (A, f0, pη) where the reward function f0 is drawn from a p0, all functions f ∈ F are f : A → [0, C] for some C > 0, and the reward noise distribution pη is (σ , b)-sub-exponential. For all problem horizons T ∈ N, nonincreasing functions κ : N→ R+, and parameters α > 0, δ ≤ 1/(2T ), and |λ| ≤ (2Cb)−1, it is the case that
Special elements in Lie algebras

In the second half of the 20th century striking classifications of finite simple groups and modular Lie algebras have been obtained. The classification of all finite simple groups states that a finite simple group is either cyclic, alternating, a group of Lie type, or one of 26 sporadic examples. The classification of finite-dimensional modular simple Lie algebras says that a simple modular Lie algebra in characteristic at least 5 over an algebraically closed field is either classical, of Cartan type, or Melikian. The groups of Lie type and the classical (modular) Lie algebra are strongly related with each other and both form a central part in the conclusions of these classification results. They can be connected by Tits’ unifying geometric concept of buildings. Within the theory of finite simple groups the interaction of groups and geometries has been very fruitful. The geometric method in finite group theory has been one of the key ingredients in the theory of finite simple groups. This successful interaction is a model for the relations between Lie algebras and geometries that we wish to explore. An important step towards this approach to Lie algebras is the study of extremal elements initiated by Cohen. An element x in a Lie algebra L is called extremal if [x, [x, L]] equals the 1-space spanned by x. Cohen et al. [10, 9] have shown that a natural geometry on the 1-spaces of a Lie algebra containing extremal elements is related to a building.
Learning De-biased Representations with Biased Representations– Appendix –

Lemma 1. Assume that f and g are affine mappings f(x) = Ax+a and g(x) = Bx+b whereA ∈ Rm×n andB ∈ Rl×n. Assume further that X is a normal distribution with mean μ and covariance matrix Σ. Then, f(X) ⊥⊥ g(X) if and only if ker(A)⊥ ⊥Σ ker(B)⊥. ⊥⊥ denotes the independence. For a positive semi-definite matrix Σ, we define 〈r, s〉Σ = 〈r,Σs〉. The orthogonality V ⊥Σ W of two subspaces V and W is defined likewise.
Supplementary Material for Striving for Simplicity and Performance in Off-Policy DRL: Output Normalization and Non-Uniform Sampling

Table 1 shows hyperparameters used for SOP, SOP+ERE and SOP+PER. For adaptive SAC, we use our own PyTorch implementation for the comparisons. Our implementation uses the same hyperparameters as used in the original paper (Haarnoja et al., 2018). Our implementation of SOP variants and adaptive SAC share most of the code base. For TD3, our implementation uses the same hyperparamters as used in the authors’ implementation, which is different from the ones in the original paper (Fujimoto et al., 2018). They claimed that the new set of hyperparamters can improve performance for TD3. We now discuss hyperparameter search for better clarity, fairness and reproducibility (Henderson et al., 2018; Duan et al., 2016; Islam et al., 2017).
Anatomia e relações filogenéticas da família Loricariidae (Ostariophysi: Siluriformes) com ênfase na subfamília Hypoptopomatinae

A anatomia e osteologia de Parotocinclus maculicauda (Steindachner, 1877) sao descritas e comparadas com outros loricariideos e astroblepideos examinados. O esqueleto de Parotocinclus maculicauda exibe fusoes, reducoes de tamanho e de numero de ossos, entre outros. Novas estruturas ou elementos osseos nao descritos previamente na literatura tradicional, sao descritos. Em adicao, este hypoptopomatineo foi utilizado como um modelo descritivo na busca de caracteres informativos para o estudo filogenetico da subfamilia Hypoptopomatinae. Baseado em 169 caracteres de osteologia e morfologia externa, foi realizada uma analise filogenetica de 114 taxon terminais de loricariideos, especialmente das subfamilias Hypoptopomatinae e Neoplecostominae. Os resultados permitem a re-diagnose da subfamilia Hypoptopomatinae, reconhecendo 24 generos. Cinco agrupamentos monofileticos sao reconhecidos como generos novos, e 34 novas especies sao identificadas. Nao foi encontrado suporte para demonstrar a monofilia de Otothyrini e as tribos previamente reconhecidas dentro de Hypoptopomatinae nao sao mantidas neste estudo. A inclusao de representantes de outras subfamilias de Loricariidae na analise forneceu um melhor entendimento das relacoes filogeneticas e da biodiversidade dos Loricariidae. Complementarmente, uma nova especie de hypoptopomatineo do genero Otocinclus e descrita de duas localidades no alto rio Amazonas. O novo taxon pode ser facilmente distinguido dos outros congeneres, exceto Otocinclus cocama, pela presenca de uma unica marca, fortemente pigmentada, em forma de morcego, na parte posterior da nadadeira caudal. De O. cocama a nova especie e distinguida pelo padrao de colorido, que consiste em uma larga faixa lateral escura.A nova especie e possivelmente mais proximamente relacionada a um clado formado por O. huaorani, O. mariae, O. bororo, O. mura e O. cocama. Finalmente, Otocinclus arnoldi da bacia do rio da Prata e revalidado da sinonimia de O. flexilis, descrito da bacia do rio Jacui. Tambem, Otocinclus mimulus de um tribuitario do Rio Parana, e considerado sinonimo junior de Otocinclus arnoldi.
Preparing for the invasion: efficacy of DNA barcoding to discern the host range of myrtle rust (Puccinia psidii) among species of Myrtaceae

Puccinia psidii is a major threat to members of the Myrtaceae worldwide. New Zealand is still free of P. psidii but possesses signiﬁcant Eucalyptus plantations as well as valuable native tree species such as Metrosideros excelsa and Leptospermum scoparium that could be at risk in the event of an incursion. As part of preparing fora potential incursion, we generated a barcode reference library for . 100 diverse species of Myrtaceae occurring in New Zealand by sequencing internal transcribed spacer (ITS), external transcribed spacer (ETS) and maturase K ( matK ), or by obtaining relevant sequences from GenBank. The Myrtaceae DNA barcoding database will enable rapid identiﬁcation of large numbers of host species in the event of a myrtle rust incursion. We undertook a comparative analysis of the ability for the three mentioned loci to discriminate species. Interspeciﬁc divergence was assessed by mean interspeciﬁc distance, u prime and minimum interspeciﬁc distance; intraspeciﬁc variation was evaluated by mean intraspeciﬁc difference, u and coalescent depth. Overall identiﬁcation efﬁciency of the three loci sequenced was determined using BLAST1 and Near Distance methods. Barcoding gaps between inter-and intraspeciﬁc divergences were also analysed. ITS and ETS share similar mean interspeciﬁc distance, u prime and minimum interspeciﬁc distance values – both higher than obtained for matK . In contrast, in terms of intraspeciﬁc variation, matK had higher values than ITS and ETS in all three metrics analysed. ITS had the highest identiﬁcation success rate for species followed by matK and ETS, respectively, as measured by BLAST1 and Near Distance methods. Overall identiﬁcation success rate increases when a combination of ITS and matK in particular isused.Thesequencedataarenotonlyavaluablereferencecollectionforamyrtlerustresponsebutalsoanationalbotanicalresource.