Reviewerly/exHarmony huggingface dataset:
<i>REGALS</i>: data analysis at the SAS frontier

SAS experiments at the frontier often seek to measure macromolecular components whose concentrations vary, as in ligand titrations, time-resolved methods, or chromatographic separations.These experiments produce large datasets that must be processed to extract the individual component scattering curves.Mathematically, the problem is related to matrix factorization and can be solved by singular value decomposition (SVD).However, the basis vectors from SVD are usually non-physical, and there is the additional problem of finding linear combinations that satisfy physically motivated restraints.Previously, we used evolving factor analysis (EFA) to analyze sizeexclusion chromatography (SEC) SAXS experiments with overlapping peaks [1].The method was integrated into a well-known software package [2] and has been used by many research groups.However, EFA cannot handle severe peak overlap or changing background.To address a wider class of problems, we developed a computational method called REGALS (for REGularized Alternating Least Squares) that performs matrix factorization such that "physically-meaningful" solutions are enforced by regularization.Regularization functions chosen by the user are applied separately to each component and can include smoothness and extent of the concentration peak, smoothness of the SAXS profile, or smoothness and maximum dimension of the real-space P(r) function.We recently applied REGALS to ion-exchange (IEX) SAXS data, which cannot be analyzed by EFA because the salt gradient produces a changing background [3].In my presentation I will describe the further development of REGALS and its performance on challenging chromatography datasets.In addition, I will explore the method's potential for other types of experiments, including equilibrium titrations and time-resolved SAXS.Finally, I will describe the REGALS software package, which is free and open-source and includes both Python and MATLAB implementations.
New Interference Effects from Light Gauge Bosons in Neutrino-Electron Scattering

We point out that light gauge boson mediators could induce new interference effects in neutrino-electron scattering that can be used to enhance the sensitivity of neutrino-flavor-selective high-intensity neutrino experiments, such as DUNE. We particularly emphasize a destructive interference effect, leading to a deficit between the Standard Model expectation and the experimental measurement of the differential cross-sections, which is prominent only in either the neutrino or the antineutrino mode, depending on the mediator couplings. Therefore, the individual neutrino (or antineutrino) mode could allow for sensitivity reaches superior to the combined analysis, and moreover, could distinguish between different types of gauge boson mediators.
Out-of-Manifold Regularization in Contextual Embedding Space for Text Classification

Recent studies on neural networks with pre-trained weights (i.e., BERT) have mainly focused on a low-dimensional subspace, where the embedding vectors computed from input words (or their contexts) are located. In this work, we propose a new approach to finding and regularizing the remainder of the space, referred to as out-of-manifold, which cannot be accessed through the words. Specifically, we synthesize the out-of-manifold embeddings based on two embeddings obtained from actually-observed words, to utilize them for fine-tuning the network. A discriminator is trained to detect whether an input embedding is located inside the manifold or not, and simultaneously, a generator is optimized to produce new embeddings that can be easily identified as out-of-manifold by the discriminator. These two modules successfully collaborate in a unified and end-to-end manner for regularizing the out-of-manifold. Our extensive evaluation on various text classification benchmarks demonstrates the effectiveness of our approach, as well as its good compatibility with existing data augmentation techniques which aim to enhance the manifold.
SHARE: a System for Hierarchical Assistive Recipe Editing

The large population of home cooks with dietary restrictions is under-served by existing cooking resources and recipe generation models. To help them, we propose the task of controllable recipe editing: adapt a base recipe to satisfy a user-specified dietary constraint. This task is challenging, and cannot be adequately solved with human-written ingredient substitution rules or existing end-to-end recipe generation models. We tackle this problem with SHARE: a System for Hierarchical Assistive Recipe Editing, which performs simultaneous ingredient substitution before generating natural-language steps using the edited ingredients. By decoupling ingredient and step editing, our step generator can explicitly integrate the available ingredients. Experiments on the novel RecipePairs dataset -- 83K pairs of similar recipes where each recipe satisfies one of seven dietary constraints -- demonstrate that SHARE produces convincing, coherent recipes that are appropriate for a target dietary constraint. We further show through human evaluations and real-world cooking trials that recipes edited by SHARE can be easily followed by home cooks to create appealing dishes.
On the interplay between interpretation and reasoning in compelling fallacies

We investigate the articulation between domain-general reasoning and interpretive processes in failures of deductive reasoning. We focus on illusory inferences from disjunction-like elements, a broad class of deductive fallacies studied in some detail over the past 15 years. These fallacies have received accounts grounded in reasoning processes, holding that human reasoning diverges from normative standards. A subset of these fallacies however can be analyzed differently: human reasoning is not to blame, instead the premises were interpreted in a non-obvious, yet perfectly predictable and reasonable way. Once we consider these interpretations, the apparent fallacious conclusion is no mistake at all. We give a two-factor account of these fallacies that incorporates both reasoning-based elements and interpretive elements, showing that they are not in real competition. We present novel experimental evidence in favor of our theory. Cognitive load such as induced by a dual-task design is known to hinder the interpretive mechanisms at the core of interpretation-based accounts of the fallacies of interest. In the first experiment of its kind using this paradigm with an inferential task instead of a simpler truth-value-judgment task, we found that the manipulation affected more strongly those illusions where our theory predicts that interpretive processes are at play. We conclude that the best way forward for the field to investigate the elusive line between reasoning and interpretation requires combining theories and methodologies from linguistic semantics and the psychology of reasoning.
Features Of Goodwill Toast As Type Of Nonlinear Text

The article presents the results of analyzing the Karachai-Balkarian goodwill in their discursive implementation in the form of table toasts.For the first time the Karachai-Balkarian language is the bases of considering a goodwill toast as a type of nonlinear text and revealing the peculiarities of the correlation of conventionality and nonlinearity in its compositional and structural-semantic organization.The toast was studied in relation to such communicative units as "discourse", "hypertext", "intertext".It is noted that the text of the toast is characterized not only by the typological features being characteristic for this genre but also by the cultural characteristics of a particular ethnic community and the ones adopted in it traditions of communication, which ensures its multilayerness.It is substantiated that the conventional way of organizing the text of a goodwill toast is not a rigidly fixed model but an open dynamic system having a variety of implementations.It was revealed that the Karachai-Balkarian toast unites the speech events of different communicative and pragmatic nature.The toast text polymorphism is revealed both in its ability to combine the features of texts of different stylistic attribution, for example, the text of a solemn speech and everyday narration, and the potential opportunity to receive various unpredictable directions of semantic development.The nonlinearity of the toast text in the Karachai-Balkarian language is also manifested in intertextual lacunary elements that require linguoculturological commentary as well as in the various cultural layers presented in its structure and related to different periods.
교육서비스품질이 학습전이에 미치는 영향에 있어 학습목표지향성의 조절효과에 관한 연구: 조리 관련 직업전문학교 학생들을 중심으로

The aim of this study was to test the effect of education service quality Perceived by vocational training institute students major of culinary on learning transfer, and moderating effect of learning goal orientation in the above causal relationship. The findings of this study are as follows. First, this study conducted a multi-variate regression analysis to examine the effect of education service quality on learning transfer, and found that both of the three sub-variables of education service of lecture program, educational environment and educational service significant and positive (+) effects on learning transfer. Second, as the result of verifying the moderating effect of learning goal orientation in the relationship between education service quality and learning transfer, it was found that learning goal orientation did effect of moderator. The result from the analysis provides practical implications for learning transfer for student.
INFORMATION LITERACY LEVEL OF STATE UNIVERSITY OF MALANG STUDENTS PARTICIPANT IN NATIONAL STUDENTS SCIENTIFIC WEEK 2018-2019

This study aimed to describe the level of literacy information of State University of Malang students participants in PIMNAS 2018 and 2019 based on six standards of literacy information. This research used descriptive research method with a quantitative approach. The results showed that the information literacy level of the State University of Malang students who participated in the PIMNAS 2018 and 2019 based on six sub-variables, there are average score of identifying information needs was 3.43; average score of information-searching behavior and information sources was 3.15; average score of information search techniques and strategies was 2.96; average score of information organization and evaluation was 3.19; average score of information use and related issues was 3.14; and average score of information sharing and knowledge creation was 3.76. The author argue that the State University of Malang Library should be involved in improving student literacy in the category of using techniques and information search strategies.
Policy Coordination in South Korea

Coordination has been one of the major problems in the field of public administration (Pressman &amp; Wildavsky, 1984; Peters 1998; Bouckaert, Peters, &amp; Verhoest, 2010). However, as the complexity of policy problems increases and the policy environment changes, coordination is becoming more of a serious challenge to administration than ever before (Peters, 2018; Roberts, 2011). The failure of policy coordination can greatly undermine administrative capacity, so a serious approach to coordination is necessary not only theoretically but also practically. This study reviewed policy coordination theories and analyzed prior studies on current Korean policy coordination. In particular, I focused on the concepts, dimensions, mechanisms, and performance of policy coordination. What I found is that the number and variety of coordination studies in Korea is low. Most prior studies on coordination have focused on coordination between central ministries, and their methodology has primary taken the form of a literature review. Empirical studies on coordination performance have been few and far between. Based on these findings, I suggest several implications.
An improved analytical method for Re-Os isotope analysis and its application to GSJ geochemical reference materials, JCu-1 and JZn-1

&amp;lt;p&amp;gt;The Re-Os isotope system is an effective tool in geological studies, especially in radiometric dating. Since both Re and Os are highly siderophile and chalcophile elements, they tend to be concentrated in various sulfide minerals. Therefore, the Re-Os geochronology has been employed for direct age determination of sulfide mineralization [1, 2]. However, conventional analytical methods for the Re-Os dating are complex and consume much time and cost.&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;Here we present an improved analytical method for Re-Os in sulfides combined with acid digestion using HClO&amp;lt;sub&amp;gt;4&amp;lt;/sub&amp;gt; [3] and sparging introduction of Os [4]. In our method, 0.4 g of powdered sulfide was digested by 1 mL of HClO&amp;lt;sub&amp;gt;4&amp;lt;/sub&amp;gt; in addition to 4 mL of inverse aqua regia in Carius tube, and then the Re and Os isotope ratios were measured by MC-ICP-MS. We applied this method to the GSJ geochemical reference materials JCu-1 (copper ore from Kamaishi mine, northeastern Japan) and JZn-1 (zinc ore from Kamioka mine, central Japan). The Re-Os concentrations of JCu-1 and JZn-1 were 255-280 ppt and 4622-4828 ppt for Re, and 39.7-41.7 ppt and 21.7-30.0 ppt for Os, respectively. Furthermore, the analytical results (Re-Os concentrations, &amp;lt;sup&amp;gt;187&amp;lt;/sup&amp;gt;Os/&amp;lt;sup&amp;gt;188&amp;lt;/sup&amp;gt;Os, and &amp;lt;sup&amp;gt;187&amp;lt;/sup&amp;gt;Re/&amp;lt;sup&amp;gt;188&amp;lt;/sup&amp;gt;Os) of separated chalcopyrite from Kamaishi mine showed good agreements with those by the conventional method digesting 0.5 g of sample by 10 mL of inverse aqua regia and measured with N-TIMS.&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;The new method, using less total volume of acids for sample digestion, enables MC-ICP-MS analysis of sulfides with relatively lower Re and Os concentrations. In addition, for Os isotopes, a sparging method using MC-ICP-MS [4] can be utilized as a simplified analytical procedure. This simplified and improved method may be useful for dating a wider range of sulfide deposits efficiently.&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;&amp;amp;#160;&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;1: Nozaki, T. et al. (2013) Sci. Rep. 3, 1889.&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;2: Kato, Y. et al. (2009) Earth Planet. Sci. Lett., 278, 40-49.&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;3: Gao, B. et al. (2019) Microchem. J. 150, 104165.&amp;lt;/p&amp;gt;&amp;lt;p&amp;gt;4: Nozaki, T. et al. (2012) Geostand. Geoanal. Res. 36, 131-148.&amp;lt;/p&amp;gt;
NoCFG: A Lightweight Approach for Sound Call Graph Approximation

Interprocedural analysis refers to gathering information about the entire program rather than for a single procedure only, as in intraprocedural analysis. Interprocedural analysis enables a more precise analysis; however, it is complicated due to the difficulty of constructing an accurate program call graph. Current algorithms for constructing sound and precise call graphs analyze complex program dependencies, therefore they might be difficult to scale. Their complexity stems from the kind of type-inference analysis they use, in particular the use of some variations of points-to analysis. To address this problem, we propose NoCFG, a new sound and scalable method for approximating a call graph that supports a wide variety of programming languages. A key property of NoCFG is that it works on a coarse abstraction of the program, discarding many of the programming language constructs. Due to the coarse program abstraction, extending it to support also other languages is easy. We provide a formal proof for the soundness of NoCFG and evaluations for real-world projects written in both Python and C#. The experimental results demonstrate a high precision rate of 90% (lower bound) and scalability through a security use-case over projects with up to 2 million lines of code.
Innovative ways of distribution for life-saving medicines during emergency situations

This Master’s thesis has the goal to provide effective research on the distribution of life-saving medications using UAVs. In partnership with ASL Citta di Torino and Citta della Salute e della Scienza di Torino represented by the doctors Corrado Calvo, Paola Crosasso, and Daniela Cestino, the project aims at the creation of a new procedure in order to faster the transportation of high priority drugs and blood derivates. This aspect has already been highlighted in the literature, proving drones could potentially overcome the logistic challenges as they are not subjected to traffic delays and they are able to reach regions that lack adequate roads faster. In the first part of this thesis, the research has focused on hospitals’ positions around the city of Torino. Then, several UAVs were identified to be analyzed. The research has been based on currently available mid-size drones in order to show the immediate possibility to turn this project into a real procedure in a small period of time. Also, another important aspect is the reliability of the system. Further on, the definition of different mission scenarios, together with ASL Citta di Torino, led to a narrow selection of considered UAVs. This step has been done using Principal Components Analysis (PCA) method. This machine learning technique allows us to easily compare different features of the drones to select the most appropriate for a specific mission. The second part of the thesis is focused on the delivery simulation from Ospedale Molinette to Ospedale San Giovanni Bosco. The calculation of the trajectory, thanks to the work of dr. Stefano Primatesta, take into consideration the possibility of a crash which could cause injuries and damages. Also, a regulatory section is addressed, relying on the Italian regulator, Ente Nazionale per l’Aviazione Civile (ENAC). In particular, flying restrictions above highly populated urban areas are taken into consideration and could limit the application of this solution.
On the Negation Intensity of a Basic Probability Assignment (Bpa)

How to obtain negation knowledge is a crucial topic, especially in the field of artificial intelligence. Limited work has been done on the negation of a basic probability assignment (BPA), and which has been studied in depth throughout the literature. However, the aspect of the intensity level of negation enforcement has not yet been investigated. Moreover, let us note that the main characteristic of intelligent systems is just the flexibility for the sake of being able to represent knowledge according to each situation. In general, researchers have a tendency to express the need for cognitive range in the negation. Thus, it would seem very useful to find a wide range of negations under intensity levels in a BPA. Based on these ideas, this paper first proposes a new approach of finding a BPA negation and gives a domain of intensity in which the negation is executed, which is called the negation space. Then, we investigate a number of desirable properties and explore their correlation with entropy. Numerical examples show the characteristics of the proposed negation solution. Finally, we validate the efficiency of the proposed method from the point of view of the Dempster-Shafer belief structure.
Towards Quantized Model Parallelism for Graph-Augmented MLPs Based on Gradient-Free ADMM Framework

While Graph Neural Networks (GNNs) are popular in the deep learning community, they suffer from several challenges including over-smoothing, over-squashing, and gradient vanishing. Recently, a series of models have attempted to relieve these issues by first augmenting the node features and then imposing node-wise functions based on Multi-Layer Perceptron (MLP), which are widely referred to as GA-MLP models. However, while GA-MLP models enjoy deeper architectures for better accuracy, their efficiency largely deteriorates. Moreover, popular acceleration techniques such as stochastic-version or data-parallelism cannot be effectively applied due to the dependency among samples (i.e., nodes) in graphs. To address these issues, in this paper, instead of data parallelism, we propose a parallel graph deep learning Alternating Direction Method of Multipliers (pdADMM-G) framework to achieve model parallelism: parameters in each layer of GA-MLP models can be updated in parallel. The extended pdADMM-G-Q algorithm reduces communication costs by introducing the quantization technique. Theoretical convergence to a (quantized) stationary point of the pdADMM-G algorithm and the pdADMM-G-Q algorithm is provided with a sublinear convergence rate $o(1/k)$, where $k$ is the number of iterations. Extensive experiments demonstrate the convergence of two proposed algorithms. Moreover, they lead to a more massive speedup and better performance than all state-of-the-art comparison methods on nine benchmark datasets. Last but not least, the proposed pdADMM-G-Q algorithm reduces communication overheads by up to $45\%$ without loss of performance. Our code is available at \url{https://github.com/xianggebenben/pdADMM-G}.
Prognostic Analysis of User Authentication Mechanisms in Mobile Wallets

Nearest Field Communication transactions become highly regarded as they limit the time required for a user to pay. The advantage of this technology is usually seen by considering the user’s purpose of reading. The first focus of this work deals with the employment of NFC transactions for the merchandiser facet. The hybrid design is planned to use an itinerant as a degree of sale. Also, the comparison of various solutions considering a number of the criterion like the protection assessment that could be a significant concern for e-payment or the ability of integration is finished. Considering the proximity of varied security schemes out there for mobile wallets, a unique approach is planned to attest users through the employment of the touch screen of the itinerant.