Miracle-dz/UniFAR-FTUs huggingface dataset:
The meaning of craft: Craft makers' descriptions of craft as an occupation

Abstract The aim of this study is to examine how craft makers describe the meaning of craft as an activity in relation to their well-being. The study is based on an analysis of the written narratives of 92 textile craft makers aged 16 to 84. Based on the results, the well-being enhancing nature of craft as a meaningful occupation for those interested in crafting is evident. The significance of craft making as an occupation is described by the following three themes: (a) “the meaning and value of crafts”, (b) “the feelings experienced during craft activity”, and (c) “the holisticity and intentionality of craft-making”. As an activity and a metaphor, craft making helped the participants to adjust to life situations. Elements of craft that enhance well-being can be traced to both the artefacts and the sense of achievement gained in producing them. The effects of craft include personal growth, development of physical and cognitive skills, control of one's body, thoughts, and feelings, as well as cultural and social awareness. The results indicate that the participants noticed the significance of craft as an agony- and stress-reducing and mind-calming activity. Holistic craft and ordinary craft played different roles in maintaining well-being.
High-Throughput Screening in Protein Engineering: Recent Advances and Future Perspectives

Over the last three decades, protein engineering has established itself as an important tool for the development of enzymes and (therapeutic) proteins with improved characteristics. New mutagenesis techniques and computational design tools have greatly aided in the advancement of protein engineering. Yet, one of the pivotal components to further advance protein engineering strategies is the high-throughput screening of variants. Compartmentalization is one of the key features allowing miniaturization and acceleration of screening. This review focuses on novel screening technologies applied in protein engineering, highlighting flow cytometry- and microfluidics-based platforms.
Algebraic incremental maintenance of XML views

Materialized views can bring important performance benefits when querying XML documents. In the presence of XML document changes, materialized views need to be updated to faithfully reflect the changed document. In this work, we present an algebraic approach for propagating source updates to XML materialized views expressed in a powerful XML tree pattern formalism. Our approach differs from the state of the art in the area in two important ways. First, it relies on set-oriented, algebraic operations, to be contrasted with node-based previous approaches. Second, it exploits state-of-the-art features of XML stores and XML query evaluation engines, notably XML structural identifiers and associated structural join algorithms. We present algorithms for determining how updates should be propagated to views, and highlight the benefits of our approach over existing algorithms through a series of experiments.
Membrane association of a 36,000-dalton substrate for tyrosine phosphorylation in chicken embryo fibroblasts transformed by avian sarcoma viruses

A cellular protein of 36,000 daltons becomes phosphorylated at tyrosine in chicken embryo fibroblasts transformed with avian sarcoma viruses. We have used cellular fractionation and immunofluorescence to locate the 36-kdalton protein in virus-transformed and uninfected chicken fibroblasts. The 36-kdalton protein in transformed cells fractionated mainly with high-speed particulate material, and in density gradient separations, the 36-kdalton protein was found in association with light density membranes together with most of the plasma membrane marker. Increasing the concentration of salt or adding ion chelators solubilized some of the 36-kdalton protein that otherwise was pelletable with high g forces. Based on these data, we conclude that this protein is peripherally or indirectly attached to light density membranes, including plasma membranes. Indirect immunofluorescent staining of the 36-kdalton protein in fixed cells revealed that it was located inside the cell in an extensive reticulum apposed to surface membranes. The same pattern of staining was found in both uninfected and virus-transformed cells. Pretreatment of cells with nonionic detergents before fixation altered or abolished 36-kdalton staining. The 36-kdalton protein appeared to be excluded from regions of the cells where actin cables were present. The pattern of staining observed with the anti-36-kdalton antibody was similar, but not identical, to that observed with antiserum against nonerythroid spectrin. Thus, the data obtained by biochemical fractionation and by immunofluorescent staining indicate that the 36-kdalton protein is found in a reticulum at the inner surface of the plasma membrane, possibly in association with cytoskeletal proteins.
Scholarly publishing threatened?

How many invitations did you receive last week to publish your latest research data in a journal with a name very similar to those of our classic scientific journals? The reason for this generosity must be the high chance of cheating researchers so that they pay article processing charges. These journals have been denominated ‘predatory journals’ and have interested a Canadian librarian, Charles Beall, to a very high extent. The so-called ‘Beall’s list of predatory journals’ has become widely recognized (1), and today it contains more than 1000 titles. Since the number of ‘invitations’ seems to increase constantly there must be some authors that are accepting these offers. This might also be one reason for why traditional scientific journals have been facing decreasing numbers of submissions for a while. So when such offers appear in your inbox, do consult this Beall’s list. If indeed, which most often is the case, you find the journal on that list, you should forget about submitting anything to them. There is a great risk that besides losing some money you will also lose control of your manuscript. It might just disappear in cyber space or be blocked/lost in a production process that goes on forever.
A new Neural Network based logistic regression classifier for improving mispronunciation detection of L2 language learners

In this paper, we propose a Neural Network (NN) based, Logistic Regression (LR) classifier for improving phone mispronunciation detection rate in a Computer-Aided Language Learning (CALL) system. A general neural network with multiple hidden layers for extracting useful speech features is first trained with pooled, training data, and then phone-dependent, 2-class logistic regression classifiers are trained as individual, phoneme specific nodes at the output layer. This new NN-based classifier with shared hidden layers streamlines the time-consuming work needed in training multiple individual classifiers separately, i.e., one for a specific phoneme, and learns common feature representation via the shared hidden layers. Its improved performance, when compared with independently trained, phoneme specific classifiers, is verified on a testing database of isolated English words recorded by non-native English learners. Compared with the conventional Goodness of Pronunciation (GOP)-based approach, the NN-based LR classifier improves the precision and recall by 37.1% and 11.7% (absolute), respectively. On the same test data, it also outperforms a Support Vector Machine (SVM)-based classifier, which is widely used for mispronunciation detection, and at a slightly better precision rate, the recall is improved by 10.6% (absolute) and the relative improvement is 21.6%.
Catalytic ethanolysis of Kraft lignin into high-value small-molecular chemicals over a nanostructured α-molybdenum carbide catalyst.

We report the complete ethanolysis of Kraft lignin over an α-MoC1-x /AC catalyst in pure ethanol at 280 °C to give high-value chemicals of low molecular weight with a maximum overall yield of the 25 most abundant liquid products (LP25) of 1.64 g per gram of lignin. The LP25 products consisted of C6 -C10 esters, alcohols, arenes, phenols, and benzyl alcohols with an overall heating value of 36.5 MJ kg(-1) . C6 alcohols and C8 esters predominated and accounted for 82 wt % of the LP25 products. No oligomers or char were formed in the process. With our catalyst, ethanol is the only effective solvent for the reaction. Supercritical ethanol on its own degrades Kraft lignin into a mixture of small molecules and molecular fragments of intermediate size with molecular weights in the range 700-1400, differing in steps of 58 units, which is the weight of the branched-chain linkage C3 H6 O in lignin. Hydrogen was found to have a negative effect on the formation of the low-molecular-weight products.
Cognitive radio implementation in ISM bands with Microsoft SORA

Cognitive radio network research has mostly focused on licensed spectrum sensing and empty spectrum use while protecting licensed band primary users. However, the wide deployment of WiFi access points in unlicensed bands in urban areas brings difficult challenges regarding co-existence of ad hoc mobile users with residential access points. In this paper, we propose a new mobile user protocol for dynamic channel selection via channel workload estimation. The mobile node senses channel usage in unlicensed ISM band and selects the maximum residual capacity channel for own packet transmission. The new protocol is implemented on Microsoft's SORA software defined radio system that enables fast prototyping. We have evaluated the performance using a Campus deployed SORA testbed. Experimental results show the efficiency of our approach in avoiding external interference.
Influence of soil structure and root water uptake strategy on unsaturated flow in heterogeneous media

We analyze the combined effects of the spatial variability of soil hydraulic properties and the water uptake by plant roots on unsaturated water flow. For this analysis, we use a simplified macroscopic root water uptake model which is usually applied only for homogeneous or layered soil and therefore we also determine whether it is applicable for multidimensional heterogeneous media. Analytical solutions for mean and variance of pressure head (first‐order second‐moment approximations) in layered media and numerical solutions of two‐dimensional (2‐D) autocorrelated multi‐Gaussian and non multi‐Gaussian parameter fields are analyzed for steady state and transient flow conditions. For non‐Gaussian topological features, that have little influence on the mean and the variance of the pressure field if root water uptake is ignored, we test whether the influence is significant if root water uptake is accounted for. The results reveal that, in field structures with large patches of coarse material, local regions with pressure head values at the wilting point develop; these are surrounded by wet material. Without a compensation mechanism for local stress, the global transpiration demand is not met if local wilting occurs. Various compensation mechanisms are tested that depend, respectively, on the saturation, the relative conductivity or a strategy where the deficit in the global uptake rate is equally distributed to unstressed locations. The strategies lead to a global actual transpiration rate at the potential value and attenuate the formation of locally wilted areas. Wilted regions can, however, still occur, and may be an artifact of the simplified model concept as root‐soil interactions are neglected. Therefore simplified macroscopic models for root water uptake should be used with caution in heterogeneous media.
SLINERC: The Sydney Language-Independent Named Entity Recogniser and Classifier

The Sydney Language Independent Named Entity Recogniser and Classifier (SLINERC) is a multi-stage system for the recognition and classification of named entities. Each stage uses a decision graph learner to combine statistical features with results from prior stages. Earlier stages are focused upon entity recognition, the division of non-entity terms from entities. Later stages concentrate on the classification of these entities into the desired classes. The best over-all f-values are 73.92 and 71.36 for the Spanish and Dutch datasets, respectively.
Molecular mechanism for Rabex-5 GEF activation by Rabaptin-5

Rabex-5 and Rabaptin-5 function together to activate Rab5 and further promote early endosomal fusion in endocytosis. The Rabex-5 GEF activity is autoinhibited by the Rabex-5 CC domain (Rabex-5CC) and activated by the Rabaptin-5 C2-1 domain (Rabaptin-5C21) with yet unknown mechanism. We report here the crystal structures of Rabex-5 in complex with the dimeric Rabaptin-5C21 (Rabaptin-5C212) and in complex with Rabaptin-5C212 and Rab5, along with biophysical and biochemical analyses. We show that Rabex-5CC assumes an amphipathic α-helix which binds weakly to the substrate-binding site of the GEF domain, leading to weak autoinhibition of the GEF activity. Binding of Rabaptin-5C21 to Rabex-5 displaces Rabex-5CC to yield a largely exposed substrate-binding site, leading to release of the GEF activity. In the ternary complex the substrate-binding site of Rabex-5 is completely exposed to bind and activate Rab5. Our results reveal the molecular mechanism for the regulation of the Rabex-5 GEF activity. DOI: http://dx.doi. org/10.7554/eLife.02687. 001
The Role of PASTA in Network Measurement

Poisson arrivals see time averages (PASTA) is a well-known property applicable to many stochastic systems. In active probing, PASTA is invoked to justify the sending of probe packets (or trains) at Poisson times in a variety of contexts. However, due to the diversity of aims and analysis techniques used in active probing, the benefits of Poisson-based measurement, and the utility and role of PASTA, are unclear. Using a combination of rigorous results and carefully constructed examples and counterexamples, we map out the issues involved and argue that PASTA is of very limited use in active probing. In particular, Poisson probes are not unique in their ability to sample without bias. Furthermore, PASTA ignores the issue of estimation variance and the central need for an inversion phase to estimate the quantity of interest based on what is directly observable. We give concrete examples of when Poisson probes should not be used, explain why, and offer initial guidelines on suitable alternative sending processes.
A Deep Learning Algorithm of Neural Network for the Parameterization of Typhoon‐Ocean Feedback in Typhoon Forecast Models

Two algorithms based on machine learning neural networks are proposed—the shallow learning (S‐L) and deep learning (D‐L) algorithms—that can potentially be used in atmosphere‐only typhoon forecast models to provide flow‐dependent typhoon‐induced sea surface temperature cooling (SSTC) for improving typhoon predictions. The major challenge of existing SSTC algorithms in forecast models is how to accurately predict SSTC induced by an upcoming typhoon, which requires information not only from historical data but more importantly also from the target typhoon itself. The S‐L algorithm composes of a single layer of neurons with mixed atmospheric and oceanic factors. Such a structure is found to be unable to represent correctly the physical typhoon‐ocean interaction. It tends to produce an unstable SSTC distribution, for which any perturbations may lead to changes in both SSTC pattern and strength. The D‐L algorithm extends the neural network to a 4 × 5 neuron matrix with atmospheric and oceanic factors being separated in different layers of neurons, so that the machine learning can determine the roles of atmospheric and oceanic factors in shaping the SSTC. Therefore, it produces a stable crescent‐shaped SSTC distribution, with its large‐scale pattern determined mainly by atmospheric factors (e.g., winds) and small‐scale features by oceanic factors (e.g., eddies). Sensitivity experiments reveal that the D‐L algorithms improve maximum wind intensity errors by 60–70% for four case study simulations, compared to their atmosphere‐only model runs.
Privacy-preserving activity scheduling on mobile devices

Progress in mobile wireless technology has resulted in the increased use of mobile devices to store and manage users' personal schedules. Users also access popular context-based services, typically provided by third-party providers, by using these devices for social networking, dating and activity-partner searching applications. Very often, these applications need to determine common availabilities among a set of user schedules. The privacy of the scheduling operation is paramount to the success of such applications, as often users do not want to share their personal schedules with other users or third-parties. Previous research has resulted in solutions that provide privacy guarantees, but they are either too complex or do not fit well in the popular user-provider operational model. In this paper, we propose practical and privacy-preserving solutions to the server-based scheduling problem. Our novel algorithms take advantage of the homomorphic properties of well-known cryptosystems in order to privately compute common user availabilities. We also formally outline the privacy requirements in such scheduling applications and we implement our solutions on real mobile devices. The experimental measurements and analytical results show that the proposed solutions not only satisfy the privacy properties but also fare better, in regard to computation and communication efficiency, compared to other well-known solutions.
A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems

Fairness is an important performance criterion in all resource allocation schemes, including those in distributed computer systems. However, it is often specified only qualitatively. The quantitative measures proposed in the literature are either too specific to a particular application, or suffer from some undesirable characteristics. In this paper, we have introduced a quantitative measure called Indiex of FRairness. The index is applicable to any resource sharing or allocation problem. It is independent of the amount of the resource. The fairness index always lies between 0 and 1. This boundedness aids intuitive understanding of the fairness index. For example, a distribution algorithm with a fairness of 0.10 means that it is unfair to 90% of the users. Also, the discrimination index can be defined as 1 - fairness index.
CATS: Cycle Accurate Transaction-driven Simulation with Multiple Processor Simulators

This paper focuses on enhancing performance of cycle accurate simulation with multiple processor simulators. Simulation performance is determined by how often simulators exchange events with one another and how accurately simulators model their behavior. Previous techniques have limited their applicability or sacrificed accuracy for performance. In this paper, we notice that inaccuracy comes from events which arrive between event exchange boundaries. To solve the problem, we propose cycle accurate transaction-driven simulation which maintains event exchange boundaries at bus transactions but compensates for accuracy. The proposed technique is implemented in a publicly available CATS framework and our experiment with 64 processors achieves 1.2M processor cycles/s (200K instructions/s) which is faster than other cycle accurate frameworks by an order of magnitude
DBToaster: A SQL Compiler for High-Performance Delta Processing in Main-Memory Databases

We present DBToaster, a novel query compilation framework for producing high performance compiled query executors that incrementally and continuously answer standing aggregate queries using in-memory views. DBToaster targets applications that require efficient main-memory processing of standing queries (views) fed by high-volume data streams, recursively compiling view maintenance (VM) queries into simple C++ functions for evaluating database updates (deltas). While today's VM algorithms consider the impact of single deltas on view queries to produce maintenance queries, we recursively consider deltas of maintenance queries and compile to thoroughly transform queries into code. Recursive compilation successively elides certain scans and joins, and eliminates significant query plan interpreter overheads. In this demonstration, we walk through our compilation algorithm, and show the significant performance advantages of our compiled executors over other query processors. We are able to demonstrate 1--3 orders of magnitude improvements in processing times for a financial application and a data warehouse loading application, both implemented across a wide range of database systems, including PostgreSQL, HSQLDB, a commercial DBMS 'A', the Stanford STREAM engine, and a commercial stream processor 'B'.
Fsi Analysis of Liquid-Filled Pipes

Most reported work on transient fluid/structure interaction (FSI) in liquid-filled pipes has been carried out in the time domain. When needed, information in the frequency domain (e.g., frequency responses) has been deduced by discrete Fourier transforms. In this paper, the analysis is undertaken directly in the frequency domain and has the advantage of enabling (linear) dispersive terms to be included in a fully coupled manner. In principle, time-domain results (e.g., pressure histories) can be obtained by numerical inverse Laplace transforms. In both domains, the mathematical model has one pair of equations for each mode of wave propagation—e.g., pressure waves in the liquid, flexural waves in the pipe. Axial FSI coupling exists in the equations and also in boundary conditions. The development used herein highlights common features between analysis in the frequency domain and analysis by the method of characteristics (MOC) in the time domain. A general formulation, not restricted to pipe systems, is presented. The method is validated by comparison with an alternative exact analytical solution, with results obtained by discrete Fourier transform from an MOC analysis and by comparison with measured data from a laboratory apparatus.
Bridging Social and Cognitive Psychology

When I was asked to comment on the benefits and costs of bridging cognitive psychology, my own field of research, with social psychology, I thought this was easy—the more so as I have a social-psychological background myself (Schultz-Gambard, Feierabend, & Hommel, 1988; Schultz-Gambard & Hommel, 1987). However, addressing this issue requires one to define what a cognitive and a social psychologist is, and here my confusion began. Let me use an empirical example—an experiment that I conducted for my doctoral dissertation (Hommel, 1993)—to explain why.