Miracle-dz/UniFAR-FTUs huggingface dataset:
Joint management of finished goods inventory and demand process for a make-to-stock product: a computational approach

In this paper, we consider the joint management of finished goods inventory and demand for a product in a make-to-stock production system. The production process is random with controllable mean rate, and the demand process is stochastic with changeable mean rate dependent on the sale price being high or low. The management issue is how to dynamically adjust the production rate and the sale price to maximize the long run total discounted profit. We show that: 1) the optimal management of the finished goods inventory follows a base stock policy: when the inventory is above certain base stock level, the production is halted; otherwise the maximum production rate is deployed to raise the inventory to the base stock level; and 2) the optimal management of the demand process follows a price switch threshold policy: when the inventory is above the threshold, the low sale price is chosen to sell the product; and below it the high price is chosen to reduce the demand. We provide an algorithm to compute the base stock level and price switch threshold. Extension to multiple price choices is given with proofs highlighted.
Brief announcement: self-stabilizing resource discovery algorithm

Distributed cooperative computing in networks involves marshaling collections of network nodes possessing the necessary computational resources. Before the willing nodes can act in a concerted way they must first discover one another. This is the general setting of the Resource Discovery Problem (RDP). This paper presents a self-stabilizing algorithm that solves RDP in a deterministic synchronous setting. The solution approach is formulated in terms of evolving knowledge graphs, where vertices represent the participating network nodes, and edges represent one node's knowledge about another. Ideally, the diameter of such a graph is one, i.e., each node knows all others. The algorithm works in rounds as it evolves the knowledge graph with the goal of reducing its diameter. This is accomplished by nodes sharing their knowledge through gossip messages. We prove that the algorithm is self-stabilizing, i.e., it tolerates arbitrary perturbations in the nodes' local states and is guaranteed to solve the problem once such failures subside. The algorithm has stabilization time of O(D), and it takes at most 4D + 4 complete round to stabilize, where D is the diameter of the initial knowledge graph, and the corresponding message complexity is O,(|V|j ⋅D), where V is the set of participating nodes.
HCF Reference Scheduler for VBR Traffic

The increasing popularity and deployment of 802.11 wireless networks has necessitated the development of Quality of Service (QoS) enhancements to the protocol suite. The draft 802.11e specification addresses such QoS issues, particularly through the new poll-based Hybrid Coordination Function. Central to this approach is a scheduling algorithm used to allocate Transmission Opportunities (TXOPs) to streams. Much of the traffic requiring stringent QoS bounds is multimedia traffic, often also exhibiting strong Variable Bit Rate (VBR) characteristics. This paper presents a simulation study evaluating the performance of the IEEE 802.11e Reference Scheduler in handling traffic exhibiting such VBR patterns. Our results show that the simplistic scheduling approach of the Reference Scheduler does not cater well for VBR traffic, leading to high levels of delay and unmet QoS guarantees. Keywords-802.11e; Wireless LAN; HCF; Reference Scheduler; QoS; VBR Traffic; Multimedia Traffic
Approximating piecewise-smooth functions

We consider the possibility of using locally supported quasi-interpolation operators for the approximation of univariate nonsmooth functions. In such a case, one usually expects the rate of approximation to be lower than that of smooth functions. It is shown in this paper that prior knowledge of the type of 'singularity' of the function can be used to regain the full approximation power of the quasi-interpolation method. The singularity types may include jumps in the derivatives at unknown locations or even singularities of the form (x — s) α , with unknown s and α. The new approximation strategy includes singularity detection and high-order evaluation of the singularity parameters, such as the above s and α. Using the acquired singularity structure, a correction of the primary quasi-interpolation approximation is computed, yielding the final high-order approximation. The procedure is local, and the method is also applicable to a nonuniform data-point distribution. The paper includes some examples illustrating the high performance of the suggested method, supported by an analysis proving the approximation rates in some of the interesting cases.
MyD88-mediated signals induce the bactericidal lectin RegIIIγ and protect mice against intestinal Listeria monocytogenes infection

Listeria monocytogenes is a food-borne bacterial pathogen that causes systemic infection by traversing the intestinal mucosa. Although MyD88-mediated signals are essential for defense against systemic L. monocytogenes infection, the role of Toll-like receptor and MyD88 signaling in intestinal immunity against this pathogen has not been defined. We show that clearance of L. monocytogenes from the lumen of the distal small intestine is impaired in MyD88−/− mice. The distal ileum of wild-type (wt) mice expresses high levels of RegIIIγ, which is a bactericidal lectin that is secreted into the bowel lumen, whereas RegIIIγ expression in MyD88−/− mice is nearly undetectable. In vivo depletion of RegIIIγ from the small intestine of wt mice diminishes killing of luminal L. monocytogenes, whereas reconstitution of MyD88-deficient mice with recombinant RegIIIγ enhances intestinal bacterial clearance. Experiments with bone marrow chimeric mice reveal that MyD88-mediated signals in nonhematopoietic cells induce RegIIIγ expression in the small intestine, thereby enhancing bacterial killing. Our findings support a model of MyD88-mediated epithelial conditioning that protects the intestinal mucosa against bacterial invasion by inducing RegIIIγ.
One helper source coding problem for a class of correlated sources with memory

We consider the one helper source coding problem posed and investigated by Ahlswede, Körner, and Wyner for a class of information sources with memory. For this class of information sources we give explicit inner and outer bounds of the admissible rate region. We also give one nontrivial example for the inner and outer bounds to match.
DEVELOPMENT OF THE COMPUTER PROGRAM OF CALCULATION OF CONCRETE BORED PILES IN SOIL GROUND OF ASTANA CITY

The current calculating theories of massive constructions are based on the simplified models without consideration of factors settlement as nonhomogeneous environments interaction, the interacting environments nonlinearity or considering them separately and conditionally. Therefore, equivalent numerical model designing of bored piles interaction with the soil mass and designing of a nonlinear technique of numerical calculation of similar systems on its basis is a modern and relevant task, which is an effective tool for a number of relevant geotechnical tasks solutions. The calculation of reinforced concrete bored pile with the real diagrams of a pile material deformation and surrounding rock massif has been presented in the article. The computer program allows receiving the strain-stress state of a pile and the surrounded massif as one heterogeneous body. New calculation approaches of the reinforced concrete bored pile can be used in the standards modernization when transferring from the regulatory framework of Kazakhstan to Euro code according to the reform concept.
A generalized fault diagnosis in dynamic analog circuits

Fault diagnosis of analog circuits is essential for analog and mixed-signal systems testing and maintenance. A new method is proposed in this paper for multiple fault diagnosis of linear analog circuits in frequency domain. Woodbury formula is applied to the modified nodal equation to construct the fault diagnosis equation, which relates the limited measured circuit responses with the multiple faults inside the circuit in a linear way. A recently developed ambiguity group locating technique is modified here to identify the faulty parameters directly. Computation cost is reduced compared to combinatorial search in traditional fault verification methods. Only one node is needed for voltage measurement, but multiple excitations and corresponding measurements on accessible nodes are required for fault identification. Parameter evaluation can provide the exact solution to the deviated values of faulty parameters. The faulty parameter deviations can have any finite values. Example circuits are provided to illustrate the proposed method. Two other methods for multiple analog fault diagnosis sharing the same mechanism as the method proposed in this paper are also briefly described. The proposed method is extremely effective for the circuit with very limited accessible nodes and is also computationally efficient.
Aquaporin Evolution in Fishes

Aquaporins represent a primordial group of transmembrane solvent channels that have been documented throughout the living biota. This facet alone emphasizes the positive selection pressure for proteins associated with intracellular fluid homeostasis. Amongst extant Eukaryota the highest gene copy number can be found in plants and teleosts, a feature that reflects the genomic duplication history in both groups. In this minireview we discuss the discovery, structure, duplication, and diversification of the aquaporin superfamily. We focus on teleosts as the main models, but include data available for other organisms to provide a broader perspective.
Gyrotactic bioconvection at pycnoclines

Abstract Bioconvection is an important phenomenon in aquatic environments, affecting the spatial distribution of motile micro-organisms and enhancing mixing within the fluid. However, stratification arising from thermal or solutal gradients can play a pivotal role in suppressing the bioconvective flows, leading to the aggregation of micro-organisms and growth of their patchiness. We investigate the combined effects by considering gyrotactic motility where the up-swimming cells are directed by the balance of the viscous and gravitational torques. To study this system, we employ a continuum model consisting of Navier–Stokes equations with the Boussinesq approximation coupled with two conservation equations for the concentration of cells and stratification agent. We present a linear stability analysis to determine the onset of bioconvection for different flow parameters. Also, using large-scale numerical simulations, we explore different regimes of the flow by varying the corresponding boundary conditions and dimensionless variables such as Rayleigh number and Lewis number ( $\mathit{Le}$ ) and we show that the cell distribution can be characterized using the ratio of the buoyancy forces as the determinant parameter when $\mathit{Le}\lt 1$ and the boundaries are insulated. But, in thermally stratified fluids corresponding to $\mathit{Le}\gt 1$ , temperature gradients are demonstrated to have little impact on the bioconvective plumes provided that the walls are thermally insulated. In addition, we analyse the dynamical behaviour of the system in the case of persistent pycnoclines corresponding to constant salinity boundary conditions and we discuss the associated inhibition threshold of bioconvection in the light of the stability of linearized solutions.
A connectionist approach to automatic transcription of polyphonic piano music

In this paper, we present a connectionist approach to automatic transcription of polyphonic piano music. We first compare the performance of several neural network models on the task of recognizing tones from time-frequency representation of a musical signal. We then propose a new partial tracking technique, based on a combination of an auditory model and adaptive oscillator networks. We show how synchronization of adaptive oscillators can be exploited to track partials in a musical signal. We also present an extension of our technique for tracking individual partials to a method for tracking groups of partials by joining adaptive oscillators into networks. We show that oscillator networks improve the accuracy of transcription with neural networks. We also provide a short overview of our entire transcription system and present its performance on transcriptions of several synthesized and real piano recordings. Results show that our approach represents a viable alternative to existing transcription systems.
Friendsourcing the unmet needs of people with dementia

The decay of cognitive abilities associated with dementia severely impacts the quality of life of a person and his surrounding ecosystem. First, people with dementia (PwD) increasingly forget the events in their lives leading to depression, isolation and faster cognitive deterioration. Second, their caregivers, besides the emotional burden that having someone close in such a condition carries, are also likely to be overwhelmed with responsibilities and duties in maintaining the PwD with a balanced and decent lifestyle. Our approach tries to address this by providing a prosthetic memory captured in two ways: 1) automatically captures data from the PwD's smartphone and enriches it with automatically retrieved data from the web and, 2) a private social network group (friendsourcing) used to validate and personalize the relevant events in the PwD's life. By sharing the load among a limited but still populated set of trustworthy people we aim to maintain the caregiving process feasible and maintain more people engaged with the PwD. Overall, the ultimate goal is to provide reminiscence, safety and cognitive aids for the PwD that are up-to-date and personally relevant.
Measuring success of open source projects using web search engines

What makes an open source project successful? In this paper we show that the traditional factors of success of open source projects, such as number of downloads, deployments or commits are sometimes inconvenient or even insufficient. We then correlate success of an open source project with its popularity on the Web. We show several ideas of how such popularity could be measured using Web search engines and provide experimental results from quantitative analysis of the proposed measures on representative large samples of open source projects from SourceForge.
FROM COGNITIVE MODELS TO NEUROFUZZY SYSTEMS.

Phenomenological theory of mind based on simple concepts related to human cognition is introduced. Basic concepts of this theory are directly related to neurophysiolo gical events in the brain and may also be extended to explain higher cognitive functions realized by the mind. This theory on the one hand solves fundamental problems in cognitive sciences, explaining puzzling behavior of human conscious experience, and on the other hand leads to useful models of mind in form of neurofuzzy systems. Such systems can compete in pattern recognition and classification tasks with neural networks and in reasoning tasks with expert systems.
Run-Time Scheduling Framework for Event-Driven Applications on a GPU-Based Embedded System

Graphics processing units (GPUs) have been employed in the critical path of applications in embedded systems due to the GPUs' programmability, high-performance, and low power consumption. State-of-the-art GPUs have the capability to process multiple GPU workloads concurrently. Moreover, GPU-based embedded systems have been considered to be essential because of the increased number of throughput-oriented applications and system events. However, existing application scheduling frameworks on a GPU do not have enough flexibility to handle the dynamic behavior of the event-driven applications. This is because in the existing scheduling frameworks: only temporal preemption is considered and one application occupies the GPU at a time. In order to tackle these problems, we propose a novel run-time scheduling framework that considers both temporal and spatial preemptions concurrently. We demonstrate the capability and novelty of our framework compared to the existing scheduling frameworks with realistic benchmark applications and with different execution scenarios. Experimental results show that our scheduling framework is able to guarantee up to 1.37 times as many applications compared to other scheduling frameworks. Moreover, the total amount of timing violation is decreased by up to 54.57%.
Automating Processor Customisation: Optimised Memory Access and Resource Sharing

We propose a novel methodology to generate application specific instruction processors (ASIPs) including custom instructions. Our implementation balances performance and area requirements by making custom instructions reusable across similar pieces of code. In addition to arithmetic and logic operations, table look-ups within custom instructions reduce costly accesses to global memory. We present synthesis and cycle-accurate simulation results for six embedded benchmarks running on customised processors. Reusable custom instructions achieve an average 319% speedup with only 5% additional area. The maximum speedup of 501% for the advanced encryption standard (AES) requires only 3.6% additional area
Research and Practice in Talent Identification and Development—Some Thoughts on the State of Play

Although there has been considerable growth in talent identification and development research in sport over the last 20 years, in this commentary we argue that the mixed quality (e.g., the uncritical employment of retrospective and autobiographical data) and lack of applied focus of much of this research, together with organizational inertia, means that relatively little has changed in the applied landscape at the systems level. In an effort to clarify and redirect work in this important area, we propose the Performance-Outcome-Process continuum, a structure that examines ideas based on what and how they contribute to the talent development process and the multiple approaches that exist. Reflecting a pracademic focus, and the need to generate effective and applicable answers, we also highlight the importance of understanding the processes and underlying mechanisms of development-focused constructs to best support the integration of these ideas into applied talent development procedures. To close the research–practice divide, we conclude by suggesting a pragmatic approach that prioritizes both the quality of research and the importance of applied impact, at least in research that claims to be for sport.
Montreal cognitive assessment in assessing clinical severity and white matter hyperintensity in Alzheimer's disease with normal control comparison.

PURPOSE Use Taiwanese version of the Montreal Cognitive Assessment (MoCA) in evaluating patients in different stages of Alzheimer's disease (AD) and correlate with white matter change. METHODS Ninety-seven normal controls (NC), 52 very-mild AD (clinical dementia rating [CDR] = 0.5), 48 mild AD (CDR = 1) and 38 moderate AD (CDR = 2) patients were enrolled for the MoCA, Mini- Mental State Examination (MMSE) and the Cognitive Assessment Screening Instrument (CASI). White matter hyperintensities (WMHs) on brain MRI were visually rated and classified as deep or periventricular WMHs. RESULTS In NC group, education (β = 0.326) but not age (β = -0.183, p = 0.069), was significantly related to MoCA score. However, while we added two points to the AD patients with less than 6 years education, the effects of education disappeared as compared with those of 7 years of education. For all educational levels, the cutoff value of MoCA for very-mild AD was 22/23 (sensitivity = 82.7%, specificity = 87.6%). No significant differences were found in the areas under the curves that differentiated NC from the patients with AD for MoCA and MMSE (differences = 0.008, p = 0.490), or for MoCA and CASI (differences = 0.023, p = 0.082). Total WMHs, frontal deep and periventricular WMHs were inversely correlated with the attention and delayed-recall subdomain. CONCLUSION The MoCA is a good clinical tool for screening very-mild stage AD if the educational effects are carefully considered. The correlation between the executive subdomains with the frontal WMHs also makes it a useful tool for detecting subtle WMHs.
The quasispecies regime for the simple genetic algorithm with ranking selection

We study the simple genetic algorithm with a ranking selection mechanism (linear ranking or tournament). We denote by $\ell$ the length of the chromosomes, by $m$ the population size, by $p_C$ the crossover probability and by $p_M$ the mutation probability. We introduce a parameter $\sigma$, called the selection drift, which measures the selection intensity of the fittest chromosome. We show that the dynamics of the genetic algorithm depend in a critical way on the parameter $$\pi \,=\,\sigma(1-p_C)(1-p_M)^\ell\,. $$ If $\pi 1$, then the genetic algorithm operates in a quasispecies regime: an advantageous mutant invades a positive fraction of the population with probability larger than a constant $p^*$ (which does not depend on $m$). We estimate next the probability of the occurrence of a catastrophe (the whole population falls below a fitness level which was previously reached by a positive fraction of the population). The asymptotic results suggest the following rules: $\pi=\sigma(1-p_C)(1-p_M)^\ell$ should be slightly larger than $1$; $p_M$ should be of order $1/\ell$; $m$ should be larger than $\ell\ln\ell$; the running time should be of exponential order in $m$. The first condition requires that $ \ell p_M +p_C< \ln\sigma$. These conclusions must be taken with great care: they come from an asymptotic regime, and it is a formidable task to understand the relevance of this regime for a real-world problem. At least, we hope that these conclusions provide interesting guidelines for the practical implementation of the simple genetic algorithm.