Miracle-dz/UniFAR-FTUs huggingface dataset:
Micron-Scale Friction and Sliding Wear of Polycrystalline Silicon Thin Structural Films in Ambient Air

Micron-scale static friction and wear coefficients, surface roughness, and resulting wear debris have been studied for sliding wear in polycrystalline silicon in ambient air at micro- Newton normal loads using on-chip sidewall test specimens, fabricated with the Sandia SUMMiT VTM process. With increasing number of wear cycles friction coefficients increased by a factor of two up to a steady-state regime, concomitant with a decay (after an initial sharp increase) in the wear coefficients and roughness. Wear coefficients were orders of magnitude smaller than reported macroscale values, suggesting that the wear resistance is higher at micrometer dimensions. Based on our observations, a sequence of micron-scale wear mechanisms is proposed involving: 1) a short adhesive wear regime (< 104 cycles), where the oxide is worn away and the first silicon debris particles form and 2) a regime dominated by abrasive wear, where silicon particles (50-100 nm) are created by fracture through the grains (~500 nm). These particles subsequently oxidize and agglomerate into larger debris clusters, while "ploughing" by this debris leads to abrasive grooves associated with local cracking events rather than plastic deformation.
Automatic selection of illustrations for teaching image processing

We present a system to automatically select images in an image database in order to be used as an illustration of an image processing or analysis process. This question is related to the teleteaching of image processing using already implemented libraries of algorithms, in the context of a teleteaching European project. We first give a Bayesian approach of the problem, with the use of image basis. Then we present how to use the Haar transform for this purpose. Finally, we give examples and discuss our approach.
CCSL: A Connected Coverage Strategy Based on Logistic Layers in Wireless Sensor Networks

This paper mainly studies the problem of connected coverage control in wireless sensor networks and proposes a strategy called CCSL (connected coverage strategy based on logistic layers) based on the relationship of coverage and connectivity. The strategy adopts the logistic layers to solve coverage and connectivity problems independently. By doing this, CCSL can achieve the optimization of both connectivity and coverage. What's more, CCSL uses a "tree cutting" arithmetic to induce the redundancy nodes and save energy. Our research about connected coverage problem includes not only the specific algorithm of CCSL but also a framework of protocol easily extended. Experimental results show that CCSL can reduce the energy consumption by turning off the connectivity redundancy nodes and coverage redundancy nodes, so it prolongs the network lifetime effectively.
Robust Solutions to Uncertain Semidefinite Programs

In this paper we consider semidefinite programs (SDPs) whose data depend on some unknown but bounded perturbation parameters. We seek "robust" solutions to such programs, that is, solutions which minimize the (worst-case) objective while satisfying the constraints for every possible value of parameters within the given bounds. Assuming the data matrices are rational functions of the perturbation parameters, we show how to formulate sufficient conditions for a robust solution to exist as SDPs. When the perturbation is "full," our conditions are necessary and sufficient. In this case, we provide sufficient conditions which guarantee that the robust solution is unique and continuous (Holder-stable) with respect to the unperturbed problem's data. The approach can thus be used to regularize ill-conditioned SDPs. We illustrate our results with examples taken from linear programming, maximum norm minimization, polynomial interpolation, and integer programming.
On Exchange Rate Regimes, Exchange Rate Fluctuations, and Fundamentals

The authors develop a two-country, two-sector general equilibrium business cycle model with nominal rigidities featuring deviations from the law of one price. The paper shows that a model with these features can quantitatively account for the empirical fact that of the statistical properties of most macroeconomic variables, only the volatility of the real and nominal exchange rates has dramatically changed after the fall of the Bretton Woods system. In particular, the authors replicate some explicit nonstructural tests proposed in the literature with simulated data from their artificial economy. The authors find that while the variability of observed fundamentals (e.g., output, money supply, and interest rates) is barely affected by the exchange rate regime, that of the exchange rate increases substantially under flexible rates.
Investment-specic technological progress in the United Kingdom

This paper analyses the impact of rapid technological change in the information and communications technology (ICT) sector on economic growth. Technological change in the ICT sector leads to a fall in the relative price of ICT goods, which leads firms to invest more heavily in high-tech goods. The approach is to build a dynamic general equilibrium model that is consistent with key stylised facts of the UK economy. The model is used to quantify the contribution to long-run growth of technological progress that is specific to the ICT sector. It is found that technological progress that is specific to the ICT sector might account for around 20%-30% of long-run labour productivity growth. But this conclusion depends crucially on how ICT prices are measured. It is shown that shocks to technological progress that is specific to production of ICT investment goods can have very different macroeconomic implications from a shock that applies to production of all goods. It is demonstrated that a permanent increase in the growth rate of ICT-specific technological progress will increase the investment expenditure share of GDP but lower the aggregate depreciation rate, while an increase in the return to investment in ICT will increase both the expenditure share and the depreciation rate.
A novel controller for a voltage source sine wave transformerless boost inverter

In this paper a transformerless voltage source sine wave inverter is proposed. A previously developed tri-state boost converter is utilized for the stepping up operation. In this topology the dynamic response of the inverter is increased, by avoiding the right hand plane zero in the converter's small-signal control-to-output transfer function when operating in the continuous conduction mode. The reference voltage for the tri-state boost converter is determined from the measured output voltage of the sine wave inverter and the calculated instantaneous value of the sine wave. The inverter with the tri-state boost converter and the inverter with a classical boost converter with voltage mode control and current mode control are compared for the dynamic response and efficiency. The analytical work of the design has been verified using a simulation. Furthermore, the boost converter is implemented in hardware to verify the boost inverter calculations. The current mode control and the tri-state logic hardware implementation are ongoing, and it is presented as future work. Finally, two user selectable modes are proposed for the inverter optimized for dynamic performance or efficiency.
A Monte Carlo examination of bias tests in mortgage lending

An exploration of the effectiveness of testing procedures in uncovering discrimination by mortgage lenders, reflecting perceived shortcomings in the scope of data provided by the Home Mortgage Disclosure Act, which indicates that the rejection rate for black mortgage applicants is much higher than for whites. The authors find that for plausible levels of bias, the sample size is critical, but that low levels of bias can be difficult to detect even with large sample sizes.
Configuration Spaces of Linkages in R

This paper studies the configuration space of all possible positions of a linkage in R n. For example, it shows that for every compact algebraic set, there is a linkage whose configuration space is analytically isomorphic to a finite number of copies of the algebraic set. If flexible edges are allowed, any compact set given by polynomial equalities and inequalities is the configuration space of a linkage. This paper also studies semiconfiguration spaces of all possible positions of a finite number of points on a linkage. For example any compact semialgebraic set is such a semiconfiguration space. Loosely speaking, a linkage is an ideal mechanical device consisting of a bunch of stiff rods sometimes attached at their ends by rotating joints. A realization of a linkage in R n is some way of placing this linkage in R n. The configuration space for a linkage is the space of all such realizations, which can be determined by looking at all possible positions of the ends of all the rods. A semiconfiguration space of a linkage is the space of all possible positions of only some of ends of the rods, we ignore the other ends. For example, what figure does a particular point on the linkage trace out? In this paper we will give characterizations of configuration spaces and semicon-figuration spaces of linkages as well as of cabled linkages, for n ≥ 3. (In a cabled linkage you also can attach flexible cables between rods.) The characterizations of these spaces for n = 2, planar linkages, was studied in [3], [1], and [2]. The results for n ≥ 3 turn out to be analogous to the n = 2 results, but in a couple of places the proofs are different. In particular, we can completely characterize semiconfig-uration spaces, we can characterize configuration spaces of cabled linkages up to analytic isomorphism, and we can characterize configuration spaces of linkages up to analytically trivial finite covers. Let us now define linkages more precisely. Suppose L is a finite one dimensional simplicial complex, in other words, a finite set V(L) of vertices and a finite set E(L) of edges between certain pairs of vertices. An abstract linkage is a finite one dimensional simplicial complex L with a mapping ℓ : E(L) → (0, ∞). You should think of ℓ as giving the length of each edge. A realization of an abstract linkage (L, …
Information theoretic analysis of multicell decoding and Amplify-and-Forward cooperation between mobiles for TDMA cellular systems

Cooperation between base stations and collaborative transmission between mobile terminals are two technologies currently under study as promising paradigms for next generation communications systems. In this paper, a first look to the interplay between these two approaches is provided by studying the per-cell achievable sum-rate (throughput) of different cooperative protocols under a simplified model for the uplink of a TDMA cellular system. The analysis is limited to non-regenerative (amplify-and-forward) cooperation between terminals. It is shown that while AF cooperation is generally advantageous for single cell processing (i.e., with no collaboration between base stations), its benefits when combined with multicell processing are limited to the regime of low to moderate transmission rates.
Neural Implications of Investment Banking Experience in Decision-Making Under Risk and Ambiguity

Financial decision-making is governed by cognitive and emotional processes. However, it is possible to learn how to manage both before making a decision based on experience. Electroencephalography might provide some insight into what is behind these choices by analyzing the slow negativity preceding a risky decision, known as the decision preceding negativity (DPN). The DPN is involved in cognitive processes associated with the elaboration of the planned response as well as the anticipation of the affective motivational stimuli. Using monetary gamble under risk (outcome probabilities are known) and ambiguity (outcome probabilities are unknown), we studied the DPN in a group of investment bankers, to see if individual financial experience influences anticipatory potentials that precede choices. Our results showed that investment bankers are able to shorten their anticipatory decision-making process by having a DPN closer to motor response. As this occurs, the prefrontal and orbitofrontal brain areas under risk were activated due to the role that emotions play in financial decision-making. On the other hand, under the ambiguity condition, activation of the prefrontal areas was caused by cognitive regulation of emotion. Our conclusion is that financial experience also influences risky choices by shortening the decision-making process while balancing cognitive and emotional processes, which depend on the amount of missing information.
Can aquatic flightless birds allocate Automotive Safety requirements?

Many emerging safety standards use the concept of Safety Integrity Levels (SILs) for guiding designers on how to specify system safety requirements and then allocate these requirements to elements of the system architecture. These standards include the new automotive safety standard ISO 26262 in which SILs are called automotive SILs (or ASILs) and these will be used to illustrate the application of the techniques presented in this paper. In this paper, we propose a new approach in which the allocation of ASILs is performed by a new nature-inspired metaheuristic known as Penguins Search Optimisation Algorithm (PeSOA). PeSOA mimics the collaborative hunting strategy of penguins, using the metaphor of oxygen reserves as a search intensification operator. This allows the penguins to preserve energy, consuming it only in areas of the search space that are rich in good solutions. The performance of the approach is evaluated by applying it to a benchmark hybrid braking system case study, demonstrating performance that is an improvement to those reported in the literature.
An Experimental Study on the Complexity of Left-deep Join Ordering Problems for Cyclic Queries Fakultt at F Ur Informatik

Not only in deductive databases, logic programming, and constraint satisfaction problems but also in object bases where each single dot in a path expression corresponds to a join, the optimizer is faced with the problem of ordering large numbers of joins. This might explain the renewed interest in the join ordering problem. Although many join ordering techniques have been invented and benchmarked over the last years, little is known on the actual eeectiveness of the developed methods and the cases where they are bound to fail. The problem attacked is the discovery of parameters and their qualitative innuence on the complexity of single problem instances and on the eeectiveness of join ordering techniques including search procedures , heuristics, and probabilistic algorithms. Thus an extensive analysis of the search space is carried out, with particular emphasis on the existence of phase transitions in this space and on the innuence the parameters have on these transitions. Having these parameters on hand serves two important tasks. (1) For a given heuristic, parameter combinations can be identiied where it performs nearly optimal and others where it performs badly. Hence, on the one hand, we can be conndent about the results of a heuristic for well determined cases and, on the other hand, can avoid the application of a heuristic where it is bound to fail. (2) When benchmarking join ordering heuristics, one had|up to now|to choose a benchmark arbitrarily. Given the parameters which innuence the complexity of a join ordering problem it becomes possible to consciously design challenging benchmarks.
Remembering Object Position in the Absence of Vision: Egocentric, Allocentric, and Egocentric Decentred Frames of Reference

In three experiments we examined whether memory for object locations in the peripersonal space in the absence of vision is affected by the correspondence between encoding and test either of the body position or of the reference point. In particular, the study focuses on the distinction between different spatial representations, by using a paradigm in which participants are asked to relocate objects explored haptically. Three frames of reference were systematically compared. In experiment 1, participants relocated the objects either from the same position of learning by taking as reference their own body (centred egocentric condition) or from a 90° decentred position (allocentric condition). Performance was measured in terms of linear distance errors and angular distance errors. Results revealed that the allocentric condition was more difficult than the centred egocentric condition. In experiment 2, participants performed either the centred egocentric condition or a decentred egocentric condition, in which the body position during the test was the same as at encoding (egocentric) but the frame of reference was based on a point decentred by 90°. The decentred egocentric condition was found to be more difficult than the centred egocentric condition. Finally, in experiment 3, participants performed in the decentred egocentric condition or the allocentric condition. Here, the allocentric condition was found to be more difficult than the decentred egocentric condition. Taken together, the results suggest that also in the peripersonal space and in the absence of vision different frames of reference can be distinguished. In particular, the decentred egocentric condition involves a frame of reference which seems to be neither allocentric nor totally egocentric.
Advances in Medical Education and Practice Dovepress Promoting Interprofessionalism: Initial Evaluation of a Master of Science in Health Professions Education Degree Program Sangeeta Lamba

you hereby accept the Terms. Non-commercial uses of the work are permitted without any further permission from Dove Medical Press Limited, provided the work is properly attributed. For permission for commercial use of this work, please see paragraphs 4.2 and 5 of our Terms Abstract: This survey study assessed former students' perceptions on the efficacy of how well a newly implemented master's in health professions education degree program achieved its academic aims. These academic aims were operationalized by an author-developed scale to assess the following domains: a) developing interprofessional skills and identity; b) acquiring new academic skills; and c) providing a student-centered environment. The respondents represented a broad range of health care providers, including physicians, nurses, and occupational and physical therapists. Generalizability-theory was applied to partition the variance of the scores. Student's overwhelmingly responded that the program successfully achieved its academic aims.
A Cross-Layer Approach to Measure the Robustness of Integrated Circuits

The demands on system robustness and its immunity against perturbations are getting increasingly important. Nearly everybody has an intuitive understanding of what robustness means, but there is no proper way how to measure robustness of integrated circuits already during the design phase. Therefore, a general cross-layer robustness model and methods to quantitatively measure robustness are presented. Moreover, these methods are refined to predict the robustness against degradation of digital circuits due to aging effects.
A preliminary study on continuous authentication methods for photoplethysmographic biometrics

Recent studies in biometrics focus on one dimensional physiological signals commonly acquired in medical applications, like electrocardiogram (ECG), electroencephalograms (EEG), phonocardiogram (PCG), and photoplethysmogram (PPG). In this context, an important application is in continuous authentication scenarios since physiological signals are frequently captured for long time periods in order to monitor the health status of the patients.
A general framework to encode heterogeneous information sources for contextual pattern mining

Traditional pattern mining methods usually work on single data sources. However, in practice, there are often multiple and heterogeneous information sources. They collectively provide contextual information not available in any single source alone describing the same set of objects, and are useful for discovering hidden contextual patterns. One important challenge is to provide a general methodology to mine contextual patterns easily and efficiently. In this paper, we propose a general framework to encode contextual information from multiple sources into a coherent representation---Contextual Information Graph (CIG). The complexity of the encoding scheme is linear in both time and space. More importantly, CIG can be handled by any single-source pattern mining algorithms that accept taxonomies without any modification. We demonstrate by three applications of the contextual association rule, sequence and graph mining, that contextual patterns providing rich and insightful knowledge can be easily discovered by the proposed framework. It enables Contextual Pattern Mining (CPM) by reusing single-source methods, and is easy to deploy and use in real-world systems.
Small and Large Price Changes and the Propagation of Monetary Shocks

We document the presence of both small and large price changes in individual price records from the CPI in France and the US. After correcting for measurement error and cross-section heterogeneity, the size-distribution of price changes has a positive excess kurtosis. We propose an analytical menu cost model that encompasses several classic models, as Taylor (1980), Calvo (1983), Reis (2006), Golosov and Lucas (2007) and accounts for observed cross-sectional patterns. We show that the ratio of kurtosis to the frequency of price changes is a sufficient statistics for the real effects of monetary policy in a large class of models.
Evolutionary dynamics on small-order graphs

Abstract We study the stochastic birth-death model for structured finite populations popularized by Lieberman et al. [E. Lieberman, C. Hauert and M. A. Nowak (2005), Evolutionary dynamics on graphs, Nature, Vol. 433, pp. 312–316]. We consider all possible connected undirected graphs of orders three through eight. For each graph, using the Monte Carlo Markov Chain simulations, we determine the fixation probability of a mutant introduced at every possible vertex. We show that the fixation probability depends on the vertex and on the graph. A randomly placed mutant has the highest chances of fixation in a star graph, closely followed by star-like graphs, and the fixation probability is lowest for regular and almost regular graphs. We also find that within a fixed graph, the fixation probability of a mutant has a negative correlation with the degree of the starting vertex.
An algorithm for nonconvex functional minimization and applications to image restoration

In this paper, we propose a new dual algorithm for the minimization of discrete nonconvex functionals, called half-linear regularization. Our approach alternates the calculation of a explicit weight with the minimization of a convex functional with respect to the solution. This minimization corresponds to the weighted total variation which is solved via the well-known Chambolle's algorithm. Finally, we present experimental results by applying it to some image restoration problems as denoising and deconvolution.
A synthetic workload generator for cluster computing

Summary form only given. The major issue today on cluster and grid computing is the efficient resource management. The evaluation of scheduling strategies is hard because of the generation of jobs under realistic scenario. This is true for rigid jobs (where the number of processors is fixed) and even more for moldable ones. We present an approach to generate realistic workloads for this kind of jobs. The model we propose is based on the analysis of one year of utilization of the I-cluster, a 225 processors cluster. From this log we extract a typical load for this kind of parallel machines and introduce a way to generate synthetic realistic workloads in an automatic way. This work was done as a way to test scheduling strategies taking into account both rigid and moldable jobs so as the workload generator may handle moldable jobs.