Miracle-dz/UniFAR-FTUs huggingface dataset:
Varmosa : Just-intime Binary Translation of MASSACHUSETTS INSTITUTE Operating System Kernels OF TECHNOLOGY by JUL 202009

This thesis presents a just-in-time binary translation scheme that dynamically switches between system emulation with a slower but more memory efficient instruction interpreter, and a faster, more memory intensive binary translator. In testing, this hybrid intepreter/translator scheme reduced the size of the binary translation cache by up to 99% with a slowdown less than a factor of 5x in the worst case, and less than a 2x in the best case compared to a pure binary translation scheme. With only a 10% decrease in performance, upwards of 49% memory reduction is demonstrated. Additionally, a technique of guest kernel introspection and profiliiig using binary translation is presented. Thesis Supervisor: Larry Rudolph Title: Principle Research Scientist, Computer Science and Artificial Intelligence Laboratory
Performance Analysis of Disk Arrays under Failure

Disk arrays (RAID) have been proposed as a possible approach to solving the emerging I/O bottleneck problem. The performance of a RAID system when all disks are operational and the MTTF,,, (mean time to system failure) have been well studied. However, the performance of disk arrays in the presence of failed disks has not received much attention. The same techniques that provide the storage efficient redundancy of a RAID system can also result in a significant performance hit when a single disk fails. This is of importance since single disk failures are expected to be relatively frequent in a system with a large number of disks. In this paper we propose a new variation of the RAID organization that has significant advantages in both reducing the magnitude of the performance degradation when there is a single failure and can also reduce the MTTF,,,. We also discuss several strategies that can be implemented to speed the rebuild of the failed disk and thus increase the MTTF,,,. The efficacy of these strategies is shown to require the improved properties of the new RAID organization. An analysis is carried out to quantify the tradeoffs.
Bragg Waveguides with Low-index Liquid Cores References and Links

The spectral properties of light confined to low-index media by binary layered structures is discussed. A novel phase-based model with a simple analytical form is derived for the approximation of the center of arbitrary bandgaps of binary layered structures operating at arbitrary effective indices. An analytical approximation to the sensitivity of the bandgap center to changes in the core refractive index is thus derived. Experimentally, significant shifting of the fundamental bandgap of a hollow-core Bragg fiber with a large cladding layer refractive index contrast is demonstrated by filling the core with liquids of various refractive indices. Confirmation of these results against theory is shown, including the new analytical model, highlighting the importance of considering material dispersion. The work demonstrates the broad and sensitive tunability of Bragg structures and includes discussions on refractive index sensing. Optical characterization of arch-shaped ARROW waveguides with liquid cores, " Opt.mode mitigation in an optofluidic chip for particle manipulation and sensing, " Opt. Wavelength-scalable hollow optical fibres with large photonic bandgaps for CO 2 laser transmission, " Nature 420, 650–653 (2002). Experimental demonstration of spectral broadening in an all-silica Bragg fiber, " Opt. High-power single-mode antiresonant reflecting optical waveguide-type vertical-cavity surface-emitting lasers, " IEEE J. Design and analysis of an integrated antiresonant reflecting optical waveguide refractive-index sensor, " Appl. Antiresonant reflecting optical waveguides in SiO 2-Si multilayer structures, " Appl. Antiresonant reflecting photonic crystal optical waveguides, " Opt. Light and gas confinement in hollow-core photonic crystal fibre based photonic microcells, " J. Eur. Liquid-core low-refractive-index-contrast Bragg fiber sensor, " Appl. Novel low-loss bandgaps in all-silica Bragg fibers, " J. Light-Characterization of omnidirectional bandgaps in multiple frequency ranges of one-dimensional photonic crystals, " J.
Effect of Media Opacity on Retinal Nerve Fiber Layer Thickness Measurements by Optical Coherence Tomography

Purpose To assess the effect of ocular media opacity on retinal nerve fiber layer (RNFL) thickness measurements by optical coherence tomography (OCT). Methods In this prospective, non-randomized clinical study, ocular examinations and OCT measurements were performed on 77 cataract patients, 80 laser refractive surgery patients and 90 patients whose signal strength on OCT was different on two consecutive measurements. None of the eyes had preexisting retinal or optic nerve pathology, including glaucoma. Cataracts were classified according to the Lens Opacity Classification System III (LOCS III). All eyes were scanned with the Stratus OCT using the Fast RNFL program before and three months after surgery. Internal fixation was used during scanning and all eyes underwent circular scans around the optic disc with a diameter of 3.4 mm. Results Average RNFL thickness, quadrant thickness and signal strength significantly increased after cataract surgery (P<0.05). Cortical and posterior subcapsular cataracts, but not nuclear cataracts, had a significant influence on RNFL thickness measurements (P<0.05). There was no significant difference between OCT parameters before and after laser refractive surgery. In eyes for which different signal strengths were observed, significantly larger RNFL thickness values were obtained on scans with higher signal strengths. Conclusion OCT parameters are affected by ocular media opacity because of changes in signal strength; cortical cataracts have the most significant effect followed by posterior subcapsular opacities. Laser refractive procedures do not seem to affect OCT parameters significantly.
A survival analysis of patent examination request in Japanese electrical and electronic manufacturers Yoshifumi NAKATA Doshisha University

In this paper, we seek to identify the major determinants of the length of period between filing and examination request for Japanese patent. We consider three factors that may influence request, i.e., value index options for patent, strategy of patent filing and innovation, and environment changes faced by Japanese companies. Our sample covers over 214 listed companies in Japanese electrical and electronic manufacturing sector, and their patent applications between 1988 and 2001. The empirical results showed that, in the early 1990s, large scale firms and firms with high R&D intensity and patent propensity had a tendency to delay their request activity. But during the late 1990s, they turn to accelerate the request activity. Addition to the number of claims, some other indexes of the value of patents, i.e., originality, forward self-citation and external citation are positively related to early examination request through the most periods of our sample. And joint-application and generality show somewhat mixed effects on the request activity. Furthermore, our results revealed that including timevarying factors gave different results for the effect of the term related to competition filing.
“Life if elsewhere”

PurposeThe purpose of this paper is to examine the motives of female childless self-initiated expatriates (SIEs) in deciding to work abroad, so far under-researched.Design/methodology/approachThe study departs from prior research in using a new methodological approach, i.e. the analysis of online diaries (blogs) to explore the motives of a specific population to relocate.FindingsThe emergent model of motivations is based upon four main dimensions that emerged from the socially constructed experience of these single childless female SIEs: escape as main motivation, confrontation to reality, identity reconstruction and purpose of expatriation.Originality/valueThe findings reveal new elements of motivations to move abroad such as the complete absence of the notion of career from the blog posts, replaced, however, by a feminist and existentialist reflection.
The hybrid SZ power spectrum: combining cluster counts and SZ fluctuations to probe gas physics

The Sunyaev-Zeldovich (SZ) effect from a cosmological distribution of clusters carries information on the underlying cosmology, as well as on the clusters' gas physics. In order to study either cosmology or clusters one needs to break the degeneracies between the two. We present a toy model showing how complementary information from the SZ power spectrum and SZ flux counts, both obtained from upcoming SZ cluster surveys, can be used to mitigate the strong cosmological influence (especially that of as) on the SZ fluctuations. Once the strong dependence of the cluster SZ power spectrum on a g is diluted, the cluster power spectrum can be used as a tool to study the cluster's gas physics and its evolution. The method relies on the ability to write the Poisson contribution to the SZ power spectrum in terms of the observed SZ flux counts (hybrid power spectrum). The correlation term can be estimated as the difference between an observed power spectrum and the hybrid power spectrum. We test the algorithm with simulations of SZ surveys.
FUZZY MODELLING OF LIFE CYCLE COSTS OF ALTERNATIVES WITH DIFFERENT LIVES

The necessity of applying fuzzy set theory to life cycle costing (LCC) is highlighted. A computer algorithm for LCC-based decision-making is outlined. This algorithm is based on the fuzzy set theory (FST) and interval analysis. The algorithm is designed around an explicit analytical LCC model. The model was introduced in a form that allows the handling of uncertainties in all input variables for alternatives with different lives. The computer implementation of the model was carefully investigated. The solution of a selected example problem is also included. Analysis results confirm that the proposed model is powerful and transparent. In addition, it is shown that handling of uncertainties within the algorithm is superior to conventional risk assessment techniques. The proposed model is the second in series being developed by the authors to overcome some of the difficulties in the implementation of LCC in the industry. These models will be integrated in a user-friendly LCC-based decision support system.
Physician Burnout: Identifying Triggers and Potential Interventions for Critical Care Physicians

Burnout is a syndrome defined by the three principal components of emotional exhaustion, depersonalization, and diminished feelings of personal accomplishment. Unlike major-depressive disorder, which pervades all aspects of a patient’s life, burnout is a distinct work-related syndrome. When more than half of the physicians are experiencing burn out, the problem is not with the worker – it is the workplace environment (Shanafelt, 2015). Physician burnout can negatively affect the quality of patient care and result in physicians leaving practices and hospitals. Burnout is most likely to occur in jobs that require extensive care of other people. This growing epidemic is also contributing to the lack of medical students who are choosing to pursue primary care as their field of study and practice (Shanafelt, 2015).
A Word Embedding Approach to Identifying Verb-Noun Idiomatic Combinations

Verb–noun idiomatic combinations (VNICs) are idioms consisting of a verb with a noun in its direct object position. Usages of these expressions can be ambiguous between an idiomatic usage and a literal combination. In this paper we propose supervised and unsupervised approaches, based on word embeddings, to identifying token instances of VNICs. Our proposed supervised and unsupervised approaches perform better than the supervised and unsupervised approaches of Fazly et al. (2009), respectively.
Evolutionary particle filter: re-sampling from the genetic algorithm perspective

The sample impoverishment problem in particle filters is investigated from the perspective of genetic algorithms. The contribution of this paper is in the proposal of a hybrid technique to mitigate sample impoverishment such that the number of particles required and hence the computation complexities are reduced. Studies are conducted through the use of Chebyshev inequality for the number of particles required. The relationship between the number of particles and the time for impoverishment is examined by considering the takeover phenomena as found in genetic algorithms. It is revealed that the sample impoverishment problem is caused by the resampling scheme in implementing the particle filter with a finite number of particles. The use of uniform or roulette-wheel sampling also contributes to the problem. Crossover operators from genetic algorithms are adopted to tackle the finite particle problem by re-defining or re-supplying impoverished particles during filter iterations. Effectiveness of the proposed approach is demonstrated by simulations for a monobot simultaneous localization and mapping application.
Spatiotemporal sensor network and mobile robot coordination in constrained environments

This paper presents a multi-robot coordination architecture for a robot-sensor network to track and intercept targets. For a target tracking and interception task, the sensor network continuously tracks the targets and dynamically selects robots to intercept the target. The robots are navigated through the sensor network. The main contribution of this paper lies on providing a scalable, power saving robot selection algorithm for the sensor networks. The robot selection algorithm is addressed based on partitioning among sensor nodes. Through partitioning, the sensor nodes are grouped so that they know which robot to choose if it is the closest to the target. The partitioning is updated with respect to the movement of robots. The proposed algorithms are proven to be effective and verified by simulations
Emergent Structure in Unstructured Epidemic Multicast

In epidemic or gossip-based multicast protocols, each node simply relays each message to some random neighbors, such that all destinations receive it at least once with high probability. In sharp contrast, structured multicast protocols explicitly build and use a spanning tree to take advantage of efficient paths, and aim at having each message received exactly once. Unfortunately, when failures occur, the tree must be rebuilt. Gossiping thus provides simplicity and resilience at the expense of performance and resource efficiency. In this paper we propose a novel technique that exploits knowledge about the environment to schedule payload transmission when gossiping. The resulting protocol retains the desirable qualities of gossip, but approximates the performance of structured multicast. In some sense, instead of imposing structure by construction, we let it emerge from the operation of the gossip protocol. Experimental evaluation shows that this approach is effective even when knowledge about the environment is only approximate.
Energy-Efficient Resource Allocation in OFDMA Systems with Hybrid Energy Harvesting Base Station

We study resource allocation algorithm design for energy-efficient communication in an orthogonal frequency division multiple access (OFDMA) downlink network with hybrid energy harvesting base station (BS). Specifically, an energy harvester and a constant energy source driven by a non-renewable resource are used for supplying the energy required for system operation. We first consider a deterministic offline system setting. In particular, assuming availability of non-causal knowledge about energy arrivals and channel gains, an offline resource allocation problem is formulated as a non-convex optimization problem over a finite horizon taking into account the circuit energy consumption, a finite energy storage capacity, and a minimum required data rate. We transform this non-convex optimization problem into a convex optimization problem by applying time-sharing and exploiting the properties of non-linear fractional programming which results in an efficient asymptotically optimal offline iterative resource allocation algorithm for a sufficiently large number of subcarriers. In each iteration, the transformed problem is solved by using Lagrange dual decomposition. The obtained resource allocation policy maximizes the weighted energy efficiency of data transmission (weighted bit/Joule delivered to the receiver). Subsequently, we focus on online algorithm design. A conventional stochastic dynamic programming approach is employed to obtain the optimal online resource allocation algorithm which entails a prohibitively high complexity. To strike a balance between system performance and computational complexity, we propose a low complexity suboptimal online iterative algorithm which is motivated by the offline algorithm. Simulation results illustrate that the proposed suboptimal online iterative resource allocation algorithm does not only converge in a small number of iterations, but also achieves a close-to-optimal system energy efficiency by utilizing only causal channel state and energy arrival information.
Evaluación de la estructura del componente regular de los programas departamentales de hábitos y estilos de vida saludable, Colombia, 2014-2015

Community programs of physical training are a promising strategy to struggle against sedentariness. In Colombia, there is a National Program for Healthy Habits and Lifestyle. To ascentain the program structure from its general evaluation purpose becomes essential to know its relevance and coherence. THis study aims to evaluate the structure and variability of the regular component of the Province Programs for Healthy Habits and Lifestyle, Colombia 2014-2015. This research consisted of a documentary analysis, an assessment of logical models, and a semi-structured interview. The logic processing of the data showed differences regarding the diagnosis and a consensus was found regarding the setting out of objectives, which are set in reply to the needs and problems of the population and are addressed through hardly variable strategies. The goals proposed in the programs, for future developments, should take into account the user’s behavior and context.
Free water transport, small pore transport and the osmotic pressure gradient three-pore model of peritoneal transport.

membrane/fibre matrix model can explain how osmotic fluid flow can occur from the peritoneal tissue to the peritoneal cavity against a glucose concentration gradient, and against a hydrostatic pressure gradient, at the same time as fluid and macromolecules move from the peritoneal cavity to the peritoneal tissue, by hydrostatic pressure driven flow. Concerning the ‘glycocalyx (fibre matrix) hypothesis’, it may be regarded as a ‘soft’ hypothesis since it is hard to test experimentally. Actually, the pore theory and the fibre matrix theory are mathematically similar, and there is no way of actually distinguishing between the two models. In fact, the bimodal (‘small pore’/‘large pore’) solute selectivity of the TPM can be accurately described by the presence of a dense, but heterogeneous, fibre matrix filling out all spaces in between the endothelial cells of the capillary barrier. In this commentary I shall first review the key features of the TPM and how these have contributed to a deeper understanding of the physiology of peritoneal exchange. Especially I will discuss the puzzling discrepancy between the clearance of tracer macromolecules from the peritoneal cavity into the tissues (KE) and the net reabsorption of fluid from the peritoneal cavity to plasma. Second, arguments will be raised that the endothelial glycocalyx does not satisfy the criteria for being a highly size-selective barrier in the TPM.
Fair Comparison and Evaluation of Quantization Schemes for PHY-based Key Generation

The generation of symmetric cryptographic keys out of wireless channel properties represents a promising approach for the establishment of secured communication links. Despite the tremendous number of different channel-based key generation protocols, there is little research on security evaluation and fair comparison of those systems. We present suitable metrics and a source model for a security evaluation of quantization schemes for physical layer security systems. By analyzing recent key generation techniques, we evaluate performances and security tradeoffs.
Maximum Flow Routing in Multihop Wireless Networks

Path selection in multihop wireless networks is a hard problem. Given a performance goal, the best approach remains unclear. In hardwired networks, network flow may be maximized by using shortest path over link weights that are determined by a linear program to a multicommodity flow formulation. In this poster we generalize this linear program to include interference and mobility. We show that "In a static wireless multihop network If we route packets using any other algorithm than shortest path with links weights determined by the solution of the dual problem of maximizing the minimum spare capacity after adding the interference constraints, then the network flow saturates before reaching the maximum when we increase the demands, while we can always increase demands until we reach the maximum flow supported by the network, if we use shortest path with links weights determined as stated above. The same is true for mobile wireless multi-hop networks under protocol interference model if nodes are available within each other transmission, interference ranges within constant probabilities".
Measuring the Slope of the Dust Extinction Law and the Power Spectrum of Dust Clouds Using Differentially Reddened Globular Clusters

We present three methods for measuring the slope of the Galactic dust extinction law, RV, and a method for measuring the fine-scale structure of dust clouds in the direction of differentially reddened globular clusters. We apply these techniques to BVI photometry of stars in the low-latitude Galactic globular cluster NGC 4833, which displays spatially variable extinction/reddening about a mean ⟨AV⟩ ≈ 1. An extensive suite of Monte Carlo simulations is used to characterize the efficacy of the methods. The essence of the first two methods is to determine, for an assumed value of RV, the relative visual extinction δAV of each cluster horizontal-branch (HB) star with respect to an empirical HB locus; the locus is derived from the color-magnitude diagram (CMD) of a subset of stars in a small region near the cluster center for which differential extinction/reddening are relatively small. A star-by-star comparison of δAV from the (B - V, V) CMD with that from the (V - I, V) CMD is used to find the optimal RV. In the third method RV is determined by minimizing the scatter in the HB in the (B - V, V) CMD after correcting the photometry for extinction and reddening using the dust maps of Schlegel, Finkbeiner, & Davis. The weighted average of the results from the three methods gives RV = 3.0 ± 0.4 for the dust along the line of sight to NGC 4833. The fine-scale structure of the dust is quantified via the difference, (ΔAV)ij ≡ (δAV)i - (δAV)j, between pairs of cluster HB stars (i, j) as a function of their angular separation rij. The variance (mean square scatter) of (ΔAV)ij is found to have a power-law dependence on angular scale: var(r) ∝ rβ, with β = +0.9 ± 0.1. This translates into an angular power spectrum P(κ) ∝ κα, with the index α = -1.9 ± 0.1 for r ∼ 1′–5′, where κ ≡ 1/r. The dust angular power spectrum on small scales (from optical data) matches smoothly onto the larger scale power spectrum derived from Schlegel et al.'s far-infrared map of the dust thermal emission.