Miracle-dz/UniFAR-FTUs huggingface dataset:
On the Pressure Gradient Force over Steep Topography in Sigma Coordinate Ocean Models

Abstract The error in computing the pressure gradient force near steep topography using terms following (σ) coordinates is investigated in an ocean model using the family of vertical differencing schemes proposed by Arakawa and Suarez. The truncation error is estimated by substituting known buoyancy profiles into the finite difference hydrostatic and pressure gradient terms. The error due to “hydrostatic inconsistency,” which is not simply a space truncation error, is also documented. The results show that the pressure gradient error is spread throughout the water column, and it is sensitive to the vertical resolution and to the placement of the grid points relative to the vertical structure of the buoyancy field being modeled. Removing a reference state, as suggested for the atmosphere by Gary, reduces the truncation error associated with the two lowest vertical modes by a factor of 2 to 3. As an example, the error in computing the pressure gradient using a standard 10-level primitive equation model appl.
Answering queries using views (extended abstract)

We consider the problem of computing answers to queries by using materialized views. Aside from its potential in optimizing query evaluation, the problem also arises in applications such as Global Information Systems, Mobile Computing and maintaining physical data independence. We consider the problem of finding a rewriting of a query that uses the materialized views, the problem of finding minimal rewritings, and finding complete rewritings (i.e., rewritings that use only the views). We show that all the possible rewritings can be obtained by considering cent ainment mappings from the views to the query, and that the problems we consider are NP-complete when both the query and the views are conjunctive and don’t involve builtin comparison predicates. We show that the problem has two independent sources of complexity (the number of possible containment mappings, and the complexity of deciding which literals from the original query can be deleted). We describe a polynomial time algorithm for finding rewritings, and show that under certain conditions, it will find the minimal rewriting. Finally, we analyze the complexity of the problems when the queries and views may be disjunctive and involve built-in comparison predicates.
A Note on Current-Bedded Moines Near Garve, Wester Ross

Abstract A locality in the Moine series at which well preserved currentbedding may be viewed in three dimensions is described. An analysis of the foreset dip directions shows that the sediment was deposited by current flowing in a direction slightly east of north. The form of the current-bedding is described and the significance of the observations briefly discussed.
Constructions of Binary Optimal Locally Repairable Codes via Intersection Subspaces

Locally repairable codes (LRCs), which can recover any symbol of a codeword by reading only a small number of other symbols, have been widely used in real-world distributed storage systems, such as Microsoft Azure Storage and Ceph Storage Cluster. Since binary linear LRCs can significantly reduce coding and decoding complexity, constructions of binary LRCs are of particular interest. The aim of this paper is to construct dimensional optimal binary locally repairable codes with disjoint local repair groups. We introduce how to connect intersection subspaces with binary locally repairable codes and construct dimensional optimal binary linear LRCs with locality $2^b$ ($b\geq 3$) and minimum distance $d\geq 6$ by employing intersection subspaces deduced from the direct sum. This method will sufficiently increase the number of possible repair groups of dimensional optimal LRCs, and thus efficiently expanding the range of the construction parameters while keeping the largest code rates compared with all known binary linear LRCs with minimum distance $d\geq 6$ and locality $2^b$ ($b\geq 3$).
Don't Give Me That Story! -- A Human-Centered Framework for Usable Narrative Planning

OF DISSERTATION Don’t give me that story! – A human-centered framework for usable narrative planning Interactive or branching stories are engaging and can be embedded into digital systems for a variety of purposes, but their size and complexity makes it difficult and time-consuming for humans to author them. Narrative planning algorithms can automatically generate large branching stories with guaranteed causal consistency, using a hand-authored library of story content pieces. The usability of such a system depends on both the quality of the narrative model upon which it is built and the ability of the user to create the story content library. Current narrative planning algorithms use either a limited or no model of character belief, which typically leads to undesireable stories and difficult domain authoring challenges. Domain authoring is further complicated by a lack of intelligent tools for summarizing the content that a domain can produce so that its author can effectively evaluate it. In this work I extend a prior narrative planning framework to model deeply nested character beliefs, thus avoiding common character omniscience problems without overburdening the domain author. Human subjects evaluations demonstrate that the belief model tracks nested beliefs correctly, and that it improves overall character believability in solution spaces over previous models. This model makes domain authoring more intuitive, but also adds complexity to the story generation algorithm, making the planner’s output even harder for the author to predict. As a step toward more intelligent domain authoring tools, I present a novel method for measuring story similarity by encoding important story information into a fixedlength numeric vector. This enables automatic clustering of stories based on their semantic similarity, facilitating high-level communication of large story spaces. I compare the story similarity metric to assessments made by humans, and find the metric to be highly accurate in judging how similar two stories are to each other. I then demonstrate its use in clustering solution spaces, and evaluate two strategies for summarizing the content of the resulting clusters. I find both techniques to be more effective than a control in communicating large story spaces to humans. These contributions together advance the usability of narrative planning algorithms by improving their underlying narrative model and providing a basis for more intelligent domain authoring tools.
Fracture Simulation and Multi-Directional Rock Quality Designation

A simple fracture network model is proposed based on the negative exponential distribution of the discontinuities in all directions. In the fracture generating procedure the midpoint coordinates of each fracture is generated by a uniform distribution function; the fracture directions are simulated by normal probability distributions and the fracture lengths are derived from a logarithmic-normal distribution. Three different sets of fractures are presented on a planar surface with different random seeds. The main purpose of this paper is to asses the rock quality designation, (RQD), on the basis of one, two and three directional fracture sets. However, all of the previous studies up to date theoretically or practically were confined to one direction only. A graphical procedure is presented for depicting the population estimate of the average number of discontinuities along a scanline. The substitution of this estimate into the relevant RQD equation provides the rock quality estimation in a better representative manner than the classical estimates.
The Effect of Field Training Officers on Police Use of Force

Over the past decade, police use of force has become an increasingly charged political issue with growing calls for reform. One of the few reforms where advocates and the policing community have reached a consensus is on the need for improved and expanded training. In this paper, we study an under researched but nearly universal approach whereby a recruit is paired with a senior officer during a phase referred to as ”field training”. In particular, we consider the link between a field training officer’s prior propensity to use force and a recruit’s subsequent enforcement behavior. We leverage a unique setting where recruits are as good as randomly assigned to field training officers and where we have detailed information on the universe of calls for service. We document meaningful differences across field training officers in terms of their propensity to use force prior to being paired with a recruit. Further, we find that a one standard deviation increase in a field training officer’s propensity to use force is associated with a 12 percent increase in their recruit’s subsequent propensity to use force. The effect of having a more aggressive field training officer persists for as much as two and a half years after the recruit completes training. ∗Adger: Texas A&M University; Ross: Claremont Graduate University Sloan: Claremont Graduate University, carlywill.sloan@cgu.edu Acknowledgments: We are grateful for useful comments from Steve Ross, the Dallas Police Department, and participants at the 2021 Southern Economic Association Conference as well as the Association for Public Policy & Management Conference. Sloan and Ross are also grateful to the Russell Sage Foundation (G2011-30016) for financial support of our project ” Does More Training Mitigate Disparities in Police Use of Force? ”. We are also grateful to Felipe Goncalves and Emily Weisburst for sharing DPD overtime and shift data with us.
PLCL1 suppresses tumor progression by regulating AMPK/mTOR-mediated autophagy in renal cell carcinoma

Background: Autophagy has been increasingly recognized as a critical regulatory mechanism in the maintenance of cellular homeostasis. A previous study showed that phospholipase C-like protein 1 (PLCL1) is associated with the lipid metabolism of clear cell renal cell carcinoma (ccRCC). However, it is unclear whether PLCL1 regulates autophagy, thereby in�uencing the progression of ccRCC. Results: Bioinformatics analysis revealed and con�rmed that expression of PLCL1 is decreased in tumors and is correlated with prognosis in ccRCC patients. Elevated PLCL1 levels decreased proliferation capacity and invasion while promoting apoptosis, but PLCL1 knockdown reversed these changes in ccRCC cells compared to controls. Mechanistic investigations con�rmed that PLCL1 induces autophagy by activating the AMPK/mTOR pathway and interacting with DEPP. The results in mouse models demonstrated that PLCL1 inhibits ccRCC tumor growth. Conclusion: Our data suggest that PLCL1 suppresses ccRCC progression by activating the AMPK/mTOR pathway and interacting with DEPP, initiating autophagy and inducing apoptosis. PLCL1 may be a promising target for the treatment of ccRCC patients.
Optimal Wavelet Reconstructions from Fourier Samples via Generalized Sampling I. Generalized Sampling

—We consider the problem of computing wavelet coefficients of compactly supported functions from their Fourier samples. For this, we use the recently introduced framework of generalized sampling in the context of compactly supported orthonormal wavelet bases. Our first result demonstrates that using generalized sampling one obtains a stable and accurate reconstruction, provided the number of Fourier samples grows linearly in the number of wavelet coefficients recovered. We also present the exact constant of proportionality for the class of Daubechies wavelets. Our second result concerns the optimality of generalized sampling for this problem. Under some mild assumptions generalized sampling cannot be outperformed in terms of approximation quality by more than a constant factor. Moreover, for the class of so-called perfect methods, any attempt to lower the sampling ratio below a certain critical threshold necessarily results in exponential ill-conditioning. Thus generalized sampling provides a nearly-optimal solution to this problem. A fundamental problem of signal processing is the reconstruction of signals from a discrete set of measurements. This can be formulated in a Hilbert Space H with inner product ·, ··, where one seeks to reconstruct a function f ∈ H from measurements of the form f, sj for some {sj} j∈N ⊆ S ⊆ H. A key development is the Shannon-Nyquist Sampling Theorem, which stated that bandlimited or compactly supported signals to be fully described via measurements f, e 2πiij· , j ∈ Z, for some appropriate > 0. In particular, f and its Fourier transformˆf (·) = f (x)e −ix· dx can be approximated respectively as follows: fN (t) = |k|≤Nˆf (2πk)e 2πiikt , fN L 2 −→ f, ˆ fN (t) = |k|≤Nˆf (2πk)sinc t + 2πk 2 , ˆ fN L 2 ,L ∞ −→ˆf. However, in many cases, such approximations are not used because the bases generated by the sinc-function or complex exponentials are generally considered inappropriate representation systems for the underlying signals [1]. In fact, many images and signals can be better represented in terms of a different basis (e.g. splines or wavelets) than the basis in which they are sampled (e.g. the Fourier basis). Consequently, there is much interest in generalising the Shannon-Nyquist Sampling Theorem to recover the coefficients of a signal or image in a particular basis from samples taken with respect to another basis[1], this problem is often referred to as generalized sampling. The goal now is to reconstruct in an arbitrary space W …
On Optimal Wavelet Reconstructions from Fourier Samples: Linearity and Universality of the Stable Sampling Rate

In this paper we study the problem of computing wavelet coecients of compactly supported functions from their Fourier samples. For this, we use the recently introduced framework of generalized sampling. Our rst result demonstrates that using generalized sampling one obtains a stable and accurate reconstruction, provided the number of Fourier samples grows linearly in the number of wavelet coecients recovered. For the class of Daubechies wavelets we derive the exact constant of proportionality. Our second result concerns the optimality of generalized sampling for this problem. Under some mild assumptions we show that generalized sampling cannot be outperformed in terms of approximation quality by more than a constant factor. Moreover, for the class of so-called perfect methods, any attempt to lower the sampling ratio below a certain critical threshold necessarily results in exponential ill-conditioning. Thus generalized sampling provides a nearly-optimal solution to this problem. One of the most fundamental problems in sampling theory is the issue of how to recover an object an image or signal, for example from a nite, and typically xed, collection of its measurements. This problem lies at the heart of countless algorithms, with applications ranging from medical imaging to astronomy. An important instance of this problem is the recovery of a compactly supported function from point-wise measurements of its Fourier transform. This problem occurs notably in Magnetic Resonance Imaging (MRI), as well as other applications such as radar. The classical approach for this problem is to recover f by computing a discrete Fourier transform (DFT) of the given data. However, this approach suers from a number of drawbacks, including the sensitivity to motion and the presence of unpleasant Gibbs ringing [31, 52]. Such phenomena can present serious issues in applications. It is known that many real-life images can be much more eciently represented by using wavelets than by their Fourier series. Images may be sparse in wavelets, or their coecients may have improved decay properties. Representing medical images in this way also has several other benets over the classical Fourier representation. These include better compressibility, improved feature detection (see [47, 49] and references therein), and easier and more eective denoising [37, 39, 51]. For these reasons, the use of
Towards Decentralised Cloud Storage with IPFS: Opportunities, Challenges, and Future Directions

Recent data ownership initiatives such as GAIA-X attempt to shift from currently common centralised cloud storage solutions to de-centralised alternatives, which gives users more control over their data. The InterPlanetary File System (IPFS) is a storage architecture which attempts to provide decentralised cloud storage by building on founding principles of P2P networking and content addressing. It combines approaches from previous research, such as Kademlia-based Distributed Hash Tables (DHTs), git’s versioning model with cryptographic hashing, Merkle Trees, and content-based addressing in order to compose a protocol stack that supports both forward and backward compatibility of components. IPFS is used by more than 250k peers per month and serves tens of millions of requests per day, which makes it an interesting large-scale operational network to study. In this editorial, we provide an overview of the IPFS design and its core features, along with the opportunities that it opens as well as the challenges that it faces because of its properties. IPFS provides persistence of names, censorship circumvention, built-in file deduplication with integrity verification, and file delivery to external users via an HTTP gateway, among other properties.
WIDER Working Paper 2014/009 Unpacking women’s health in public-private partnerships

: There has been a significant increase in funding for health programmes in development over the last two decades, partly due to the formation of public-private partnerships. This paper examines the impact of public-private partnerships from the perspective of women’s health, and asks whether the current culture of funding has led to an increased instrumentalism in women’s health programming, and what effects this has on how women’s health is addressed at the level of practice. The paper is based on research carried out with UK-based non-governmental organizations, and its conclusions raise further challenges for improving women’s health policies and programmes in development.
Retrograde metamorphism of ultrahigh‐temperature granulites from the khondalite belt in Inner Mongolia, North China Craton: evidence from aluminous orthopyroxenes

Orthopyroxene‐sillimanite‐sapphirine‐spinel‐quartz granulites have been reported from the khondalite belt in Inner Mongolia, North China Craton (NCC), which record ultrahigh‐temperature (UHT) metamorphism. These rocks record metamorphic temperatures up to 1050°C and pressures up to 10 kbar during the peak metamorphism, as indicated by diagnostic UHT mineral assemblages such as equilibrium orthopyroxene + sillimanite + quartz, sapphirine + quartz and low‐Zn‐spinel + quartz. To well constrain the retrograde P–T conditions, we investigate orthopyroxenes in different textural settings in these UHT rocks and the results reveal marked variations in alumina contents, indicating a multistage formation. The core of coarse orthopyroxene porphyroblasts and some of the grains associated with sillimanite and quartz have the highest alumina content of up to 7.61–8.05 wt%. Rims of coarse orthopyroxene porphyroblasts and those occurring as coronas surrounding garnet grains have intermediate alumina value ranging from 6.21 to 7.61 wt%. Fine grained orthopyroxenes which form symplectite with cordierite have the lowest alumina content between 5.52 and 6.15 wt%. Based on the XAl–XMg isopleths, orthopyroxenes in different textural associations and textures indicate formation under varying temperature and pressure conditions, ranging from 950°C, 10.5 kbar to 840°C, 8.5 kbar. These results are in accordance with the P–T estimates from previous studies on these rocks using Ti‐in‐zircon geothermometry and pseudosection analysis. The reaction textures and orthopyroxene chemistry suggest an initial stage of isobaric cooling followed by isothermal decompression, and a final stage of cooling. Combined with the available age data which suggest the timing of the UHT event as 1.92 Ga, and the previous models on P–T evolution of the khondalites, our results suggest a complex exhumation of the UHT granulites within the Inner Mongolia Suture Zone associated with the final assembly of the NCC within the Columbia supercontinent during the Palaeoproterozoic. Copyright © 2010 John Wiley & Sons, Ltd.
Candidates for

53 In stressed plants, electrophysiological reactions (elRs) are presumed to contribute to 54 long-distance intercellular communication between distant plant parts. Because of the focus on 55 abiotic stress-induced elRs in the last decades, biotic stress-triggered elRs have been widely 56 ignored. It is likely that the challenge to identify the particular elR types – action potential (AP), 57 variation potential (VP) and system potential (SP) – was responsible for this course of action. 58 Thus, the present survey focused on insect larva feeding ( Spodoptera littoralis, Manduca sexta ) 59 that triggers distant APs, VPs and SPs in monocotyledonous and dicotyledonous plant species 60 ( Hordeum vulgare, Vicia faba, Nicotiana tabacum ). APs were detected only after feeding on the 61 stem/culm, whereas SPs were systemically observed following damage to both stem/culm and 62 leaves. This was reasoned by the unequal vascular innervation of the plant and a selective 63 electrophysiological connectivity of the plant tissue. However, striking variations in voltage 64 patterns were detected for each elR type. Further analyses (also in Brassica napus, Cucurbita 65 maxima ) employing complementary electrophysiological approaches in response to different 66 stimuli revealed various reasons for these voltage pattern variations: an intrinsic plasticity of elRs, 67 a plant-specific signature of elRs, a specific influence of the applied (a)biotic trigger, the impact of 68 the technical approach and/or the experimental set-up. As a consequence thereof, voltage pattern 69 variations, which are not irregular but rather common, need to be included in electrophysiological 70 signalling analysis. Due to their widespread occurrence, systemic propagation, and respective 71 triggers, elRs should be considered as candidates for long-distance communication in higher 72 plants. 73 74
Image Enhancement by CIG Multi-parameter Characterization

This study presents an innovative approach for seismic image enhancement using multi-parameter CIGs. During the imaging, summation-free CIGs are generated and analyzed as constant depth slices at every image location. The signal’s coherency is measured by semblance coefficient for different dip-angles across these depth slices in order to detect the specular directions of the model. The enhanced migration image is achieved by partial stacking of the gathers along these directions only. The ability to analyze the structural parameters of each image point allows us to better handle cases of complicated wave propagation and to improve the image quality at poorly illuminated areas or near complex structural geometry. The proposed method and its practical benefits are demonstrated for synthetic and real datasets.