cometadata/datacite-rtg-text-other-reclassification-records huggingface dataset:
title: Le geografie della Commedia.
title: Un itinerario per l’immaginario contemporaneo
titleType: Subtitle
Creators: name: Corazza, Giovanna
Publisher: name: Università Ca’ Foscari Venezia
Year: 2018
Subjects: Dante Alighieri
geografia letteraria
ricezione della Commedia di Dante Alighieri
paesaggio italiano
tutela del paesaggio storico

description: The geo-landscape images in Dante’s Comedy, enhanced in an odeporic key by the nineteenth- century cult of the poet, are today at the center of local tourist itineraries aimed at a wide and diversified audience. While this practice presents specific critical issues, it can nevertheless contribute on one hand to the highlighting of a generally understudied aspect of the poem, on the other to the growth of collective awareness of the value of the historical landscape as a cultural asset.
Comparative analysis of chemical constituents and bioactivities of the extracts from leaves, seed coats and embryoids of Ginkgo biloba L.
Creators: name: Chen, Xuanxuan
name: Zhong, Wu
name: Shu, Changqing
name: Yang, Hong
name: Li, Erhu
Publisher: name: Taylor & Francis
Year: 2020
Subjects: subject: Biochemistry
subject: Pharmacology
subject: Biotechnology
subject: Environmental Sciences not elsewhere classified
subject: Chemical Sciences not elsewhere classified
subject: Ecology
subject: FOS: Biological sciences
subject: Biological Sciences not elsewhere classified
subject: Information Systems not elsewhere classified
subject: Plant Biology

description: A total of 25 compounds including terpenoids, flavonoids, biflavonoids and ginkgolic acids were identified and quantified with a reliable, simple, and simultaneous method from Ginkgo leaves, seed coats and embryoids with different tree ages (approximately identified as 25, 500, 1000 and 2000 years). Leaves had the highest amount of total bioactive compounds. Seed coats had moderate contents of flavonoids, which was 15 times higher than embryoids. Furthermore, the effects of tree ages on bioactive compounds differ in three parts. The contents of bilobalide, ginkgolide J, ginkgolide C, ginkgolide B, ginkgolide A in embryoids and seed coats were highest from 500-year-old tree, while in leaves were highest from 25-year-old tree. This work first investigated the extensive bioactive compounds in ginkgo leaves, seed coats and embryoids from Ginkgo trees older than 500-year, it gives good reference for making better use of Ginkgo products.
Improving the efficiency of diluents for heavy oil pipeline transportation
Creators: name: Hu, Haoyang
Publisher: name: University of Calgary
Year: 2008

description: Bibliography: p. 79-84
description: With the projected increase in the Canadian production of heavy oil and bitumen, the transportation issues are likely to come to the forefront. The occurrence of asphaltene association in heavy oil is a contributing factor in high viscosity of heavy oils. The asphaltene aggregates formed by asphaltene self-association can also precipitate by the variation of temperature, pressure or oil compositions. Precipitated asphaltenes can form deposits on the wall of pipelines so as to reduce the effective transportation volume. Therefore, if the asphaltene association can be inhibited, it will improve the efficiency of heavy oil transportation significantly. In this research, different solvents and their combinations were tested to evaluate their dilution effects on heavy oils and their abilities for inhibiting asphaltene association. Diluents were formulated by combining aromatic and polar solvents. Analysis of experimental results showed that polar solvents can be beneficial, when combined with non-polar diluents, in inhibiting asphaltenes association and reducing oil viscosity. The ability of a solvent for inhibiting asphaltene association improves mildly with increasing its aromaticity. Several surfactants were evaluated as additives to inhibit the asphaltenes' association. These surfactants were tested with heavy oil diluted with a common solvent by measuring their impact on the diluted oil viscosity. The surfactants were also tested on solution of asphaltenes in m-xylene to isolate their abilities for inhibiting asphaltene association. Our results suggested that generalization on optimal molecular structure of surfactants for inhibiting asphaltene association in heavy oil pipeline transportation has to account for the presence of resins and other oil constituents.
Genus distributions for bouquets of circles
Creators: name: Gross, Jonathan L.
name: Robbins, David P.
name: Tucker, Thomas W.
Publisher: name: Columbia University
Year: 1987
Subjects: Computer science

description: The genus distribution of a graph G is defined to be the sequence {gm} such that gm is the number of different imbeddings of G in the closed orientable surface of genus m. A counting formula of D. M. Jackson concerning the cycle structure of permutations is used to derive the genus distribution for any bouquet of circles Bn. It is proved that all these genus distributions for bouquets are strongly unimodal.
The problem with the geometric discord
Creators: name: Piani, Marco
Publisher: name: arXiv
Year: 2012
Subjects: subject: Quantum Physics (quant-ph)
subject: FOS: Physical sciences

description: We argue that the geometric discord introduced in [B. Dakic, V. Vedral, and C. Brukner, Phys. Rev. Lett. 105, 190502 (2010)] is not a good measure for the quantumness of correlations, as it can increase even under trivial local reversible operations of the party whose classicality/non-classicality is not tested. On the other hand it is known that the standard, mutual-information based discord does not suffer this problem; a simplified proof of such a fact is given.
description: 5 pages. Changes in ver 2: typos corrected, added short proof of monotonicity of standard quantum discord under one-side action. This note is meant to stimulate discussion in the community: comments are welcome
Understanding image registration : towards a descriptive language of computer vision
Creators: name: Oldridge, Steve W.
Publisher: name: University of British Columbia
Year: 2011

description: Vision researchers have created an incredible range of algorithms and systems to detect, track, recognize, and contextualize objects in a scene, using a myriad of internal models to represent their problem and solution. However in order to effectively make use of these algorithms sophisticated expert knowledge is required to understand and properly utilize the internal models used. Researchers must understand the vision task and the conditions surrounding their problem, and select an appropriate algorithm which will solve the problem most effectively under these constraints. Within this thesis we present a new taxonomy for the computer vision problem of image registration which organizes the field based on the conditions surrounding the problem. From this taxonomy we derive a model which can be used to describe both the conditions surrounding the problem, as well as the range of acceptable solutions. We then use this model to create testbenches which can directly compare image registration algorithms under specific conditions. A direct evaluation of the problem space allows us to interpret models, automatically selecting appropriate algorithms based on how well they perform on similar problems. This selection of an algorithm based on the conditions of the problem mimics the expert knowledge of vision researchers without requiring any knowledge of image registration algorithms. Further, the model identifies the dimensions of the problem space, allowing us to automatically detect different conditions. Extending beyond image registration, we propose a general framework of vision designed to make all vision tasks more accessible by providing a model of vision which allows for the description of what to do without requiring the specification of how the problem is solved. The description of the vision problem itself is represented in such a way that even non-vision experts can understand making the algorithms much more accessible and usable outside of the vision research community.
Bolometric response in graphene based superconducting tunnel junctions
Creators: name: Vora, Heli
name: Kumaravadivel, Piranavan
name: Nielsen, Bent
name: Du, Xu
Publisher: name: arXiv
Year: 2011
Subjects: subject: Mesoscale and Nanoscale Physics (cond-mat.mes-hall)
subject: FOS: Physical sciences

description: We fabricate graphene-TiOx-Al tunnel junctions and characterize their radio frequency response. Below the superconducting critical temperature of Al and when biased within the superconducting gap, the devices show enhanced dynamic resistance which increases with decreasing temperature. Application of radio frequency radiation affects the dynamic resistance through electronic heating. The relation between the electron temperature rise and the absorbed radiation power is measured, from which the bolometric parameters, including heat conductance, noise equivalent power and responsivity, are characterized.
New physics contributions to the forward-backward asymmetry at the Tevatron
Creators: name: Biswal, Sudhansu S.
name: Mitra, Subhadip
name: Santos, Rui
name: Sharma, Pankaj
name: Singh, Ritesh K.
name: Won, Miguel
Publisher: name: arXiv
Year: 2012
Subjects: subject: High Energy Physics - Phenomenology (hep-ph)
subject: FOS: Physical sciences

description: The Tevatron has measured a discrepancy relative to the Standard Model prediction in the forward-backward asymmetry in top quark pair production. This asymmetry grows with the rapidity difference of the two top quarks. It also increases with the invariant mass of the tt pair, reaching, for high invariant masses, 3.4 standard deviations above the Next to Leading Order prediction for the charge asymmetry of QCD. However, perfect agreement between experiment and the Standard Model was found in both total and differential cross section of top quark pair production. As this result could be a sign of new physics we have parametrized this new physics in terms of a complete set of dimension six operators involving the top quark. We have then used a Markov Chain Monte Carlo approach in order to find the best set of parameters that fits the data, using all available data regarding top quark pair production at the Tevatron. We have found that just a very small number of operators are able to fit the data better than the Standard Model.
description: 17 pages, 14 figures
Polarized Neutron Reflectometry at the Presence of Smooth Interfacial Potential
Creators: name: Jahromi, Saeed S.
name: Masoudi, Seyed Farhad
Publisher: name: arXiv
Year: 2011
Subjects: subject: Materials Science (cond-mat.mtrl-sci)
subject: FOS: Physical sciences

description: Polarized neutron reflectometry (PNR) have developed theoretically and experimentally in the past decades. In order to resolve the phase problem in neutron reflectometry, several simulation methods have been proposed such as reference layer and the variation of surroundings. By considering some factors such as smoothness or roughness in simulations, it is tried to gain more compatible results with experiment. In this paper, by using four different functions "Linear, Airy, Eckart and Error function", we investigate the effects of the smoothness of the interfacial potential on reflectivity, polarization of reflected neutrons and determination of the SLD of the sample, using reference layer method with polarized neutrons. We have also proposed a solution in order to gain better results with less noise in output reflectivity data, at the presence of smoothness.
Building a Rich Large-scale Lexical Base for Generation
Creators: name: Jing, Hongyan
name: McKeown, Kathleen
name: Passonneau, Rebecca J.
Publisher: name: Columbia University
Year: 1997
Subjects: Computer science

description: Most large lexical resources have been developed with language interpretation in mind and can not be used directly for generation. we present a rich large-scale lexical base for generation, constructed by merging various linguistic resources. Our approach meets the needs of language generation systems by providing the facilities for mapping from semantic concepts to verb/sense pairs, for identifying the valid subcategorization forms for a given verb sense, and for representing alternations for paraphrasing power. Information from different resources enriches and constrains each other, so the final result is complete as well as accurate. We show by example how this lexical base can be integrated into a generation package and how it simplifies development process while improving system performance.
Depression literacy among middle-aged and elderly chinese
Creators: name: Tieu, Yvonne
Publisher: name: University of Calgary
Year: 2008

description: Bibliography: p. 38-44
description: Previous mental health literacy studies have failed to address age and cultural factors simultaneously. Depression literacy (correct identification of depression, perceived efficacy of treatments, perceived etiology, and prognosis), stigma, and attitudes toward seeking mental health services among middle-aged (55 to 65 years-old) and older (66 to 87 years-old) Chinese-Canadians were assessed through interviews (N = 53). Of those interviewed, 11.3% could correctly identify depression as presented in a case vignette. Age, gender, and acculturation did not influence rates of depression recognition. Furthermore, acculturation and stigma did not predict attitudes toward help-seeking. To examine cross-cultural differences, responses of Chinese-Canadians were compared to a sample of same-aged residents of Alberta who had completed a depression literacy survey over the telephone (N = 869; Wang et al., 2007a). Significant differences in depression literacy, especially rates of correct identification of depression, and stigma between the Chinese-Canadian and Albertan samples were noted.
Natural Language Interfaces to Expert Systems
Creators: name: Moerdler, Galina Datskovsky
Publisher: name: Columbia University
Year: 1985
Subjects: Computer science

description: Currently, a very popular way for expert systems to communicate with their users is via a menu interface. To gather information the system poses a question and the user is given a. number of possible answers and s/he then proceeds to choose the one that s/he thinks best corresponds with the correct answer.
Integrated analytical and empirical learning of approximations for intractable theories
Creators: name: Ellman, Thomas
Publisher: name: Columbia University
Year: 1989
Subjects: Computer science

description: A powerful new technique for learning to solve intractable problems is presented in this dissertation. Although computational theories can be formulated for many problem-solving tasks, such theories are often intractable because they require excessive computational resources. This research has investigated a strategy of sacrificing the correctness of theories in order to gain tractability in return. Initially intractable theories are approximated by adopting generic simplifying assumptions. For instance, one generic assumption asserts that the value of a function is the same for all arguments. Another asserts that a random variable is equally likely to manifest any of its legal values. Although such assumptions are not strictly true, they can greatly simplify otherwise intractable computations. They often result in approximate theories with acceptable levels of accuracy and efficiency. A program called "POLLYANNA" has been developed to investigate this approach to the intractable theory problem. POLLYANNA was developed using the card game hearts and a job scheduling problem as test bed domains. This program combines analytic and empirical learning methods in a generate and test framework. During the analytic phase, candidate approximate theories are generated by systematically applying generic simplifying assumptions to an initially intractable theory. Analytic generation results show that many candidates are semantically equivalent to informally stated heuristic decision rules, including the Dump High Rank rule in the hearts domain and the Soonest Scheduling Deadline First rule in the job scheduling domain. During the empirical phase, candidates are tested against teacher-provided training examples. Measurements of accuracy and efficiency are used to guide a search for approximate theories meeting specified accuracy and efficiency goals. Empirical testing results show the candidates to manifest a gradual tradeoff between accuracy and efficiency. Some approximate theories are efficient but highly prone to errors, while others are more accurate but computationally expensive. Depending on the context in which a computational theory is used, different combinations of accuracy and efficiency are appropriate. This research thus demonstrates a flexible approach to approximate theory formation.
Synthesis for Logical Initializability of Synchronous Finite State Machines
Creators: name: Singh, Montek
name: Nowick, Steven M.
Publisher: name: Columbia University
Year: 1998
Subjects: Computer science

description: A new method is introduced for the synthesis for logical initializability of synchronous state machines. The goal is to synthesize a gate-level implementation that is initializable when simulated by a 3-valued (0,1,X) simulator. The method builds on an existing approach of Cheng and Agrawal, which uses constrained state assignment to translate functional initializability into logical initializability. Here, a different state assignment method is proposed which, unlike the method of Cheng and Agrawal, is guaranteed safe and yet is not as conservative. Furthermore, it is demonstrated that certain new constraints on combinational logic synthesis are both necessary and sufficient to insure that the resulting gate-level circuit is 3-valued simulatable. Interestingly, these constraints are similar to those used for hazard-free synthesis of asynchronous combinational circuits. Using the above constraints, we present a complete synthesis for initializability method, targeted to both two-level and multi-level circuits.
RB: Programmer Specification of Redundancy
Creators: name: Smith, Jonathan M.
name: Maguire, Gerald Q.
Publisher: name: Columbia University
Year: 1987
Subjects: Computer science

description: RB is a programming language for specifying redundancy in various dimensions. Avizienis's notation T I HIS, for Time I Hardware I Software, describes the different types of redundancy possible in a computation: repetition (nT I HIS), redundant hardware (T I nH I S), and program (software) (T I H InS). These can each be controlled by the programmer with RB. RB derives its name from its use of the recovery block notion to specify fault-tolerant segments of software. RB also supplies the programmer with the ability to specify degrees of replication and repetition for a given recovery block alternate; the underlying support software can then take this advice to replicate in time or hardware, based on available resources. An implementation of RB based on the C programming language is described in this paper. This implementation uses a combination of a language preprocessor for C and a runtime library to provide the desired semantics. Modification of RB to support other programming languages, or programmer specification of N-Version Programming as the decision mechanism. is straightforward.
Neutron experiments to search for new spin-dependent interactions
Creators: name: Pokotilovski, Yu. N.
Publisher: name: arXiv
Year: 2011
Subjects: subject: Nuclear Experiment (nucl-ex)
subject: High Energy Physics - Phenomenology (hep-ph)
subject: FOS: Physical sciences

description: The consideration is presented of possible neutron experiments to search for new short-range spin-dependent forces. The spin-dependent nucleon-nucleon interaction between neutron and nuclei may cause different effects: phase shift of a neutron wave in neutron interferometers of different kind, in particular of the Lloyd mirror configuration, neutron spin rotation in the pseudo-magnetic field, and transverse deflection of polarized neutron beam by a slab of substance. Estimates of sensitivity of these experiments are performed.
description: 10 p., 4 fig, Corrected Fig. 4, 1 Ref. added
Software Development Environments for Very Large Software Systems
Creators: name: Kaiser, Gail E.
name: Maarek, Yoelle S.
name: Perry, Dewayne E.
name: Schwanke, Robert W.
Publisher: name: Columbia University
Year: 1987
Subjects: Computer science

description: This technical report consists of the three related papers. Living with Inconsistency in Large Systems describes CONMAN, an environment that identifies and tracks version inconsistencies, permitting debugging and testing to proceed even though the executable image contains certain non-fatal inconsistencies. The next two papers are both from the INFUSE project. Change Management for Very Large Software Systems presents the new non-Euclidean hierarchical clustering algorithm used by the INFUSE change management system to cluster modules according to the strengths of their interdependencies. Models of Software Development Environments presents a general model of software development environments consisting of three components - policies, mechanisms and structures - and classifies existing and proposed environments into the individual, family, city and state classes according to the size of projects that could be adequately supported.
B-T phase diagram of CoCr2O4 in magnetic fields up to 14 T
Creators: name: Pronin, A. V.
name: Uhlarz, M.
name: Beyer, R.
name: Fischer, T.
name: Wosnitza, J.
name: Gorshunov, B. P.
name: Komandin, G. A.
name: Prokhorov, A. S.
name: Dressel, M.
name: Bush, A. A.
name: Torgashev, V. I.
Publisher: name: arXiv
Year: 2011
Subjects: subject: Materials Science (cond-mat.mtrl-sci)
subject: Strongly Correlated Electrons (cond-mat.str-el)
subject: FOS: Physical sciences

description: We have measured the magnetization and specific heat of multiferroic CoCr2O4 in magnetic fields up to 14 T. The high-field magnetization measurements indicate a new phase transition at T* = 5 - 6 K. The phase between T* and the lock-in transition at 15 K is characterized by magnetic irreversibility. At higher magnetic fields, the irreversibility increases. Specific-heat measurements confirm the transition at T*, and also show irreversible behavior. We construct a field-temperature phase diagram of CoCr2O4.
description: 4 pages
Meter as process in groove-based popular music
Creators: name: Attas, Robin Elizabeth Sturton
Publisher: name: University of British Columbia
Year: 2011

description: The various genres of North American popular music developed since the 1950s are distinctive for their use of short repeating accompanimental patterns called grooves. Such groove-based popular music often includes many distinctive metrical features that cannot be reflected in standard hierarchical representations of metric structure, such as polyphonic textures, anacrusis, and syncopation. As a result, one crucial aspect of an important modern musical practice has been analytically underappreciated. The processual theory of meter developed by Christopher Hasty offers an alternative analytical framework that, by characterizing meter in terms of particular and constantly changing durations unfolding in time, has the potential to illuminate the important metric features of grooves in a range of popular music genres. By using and further developing such a comprehensive metrical model, popular music scholars can move beyond an existing vernacular that is often inadequate for in-depth musical discussion, and connect analytical observations to an in-time, felt experience, whether in dancing, listening, or performance contexts. In order to fully explore the benefits of this approach to meter in groove-based popular music, this dissertation analyzes a diverse sample of the repertoire from several perspectives. After a general introduction and establishment of the methodological approach, Chapters 3 and 4 detail metric aspects of specific genres of popular music (disco and Motown), while Chapter 5 focuses on a specific technique of groove composition, the buildup, that occurs in a wide range of musical genres. Chapter 6 incorporates the information gained in the preceding chapters into an analysis of a modern groove composition by Janelle Monáe. Throughout, particular metric features of the groove mentioned above are described and theorized in detail, as is the definition of the groove itself. Metric theory is also augmented with deeper consideration of the interplay of repetition and forward drive; listener shifts in attention among durations of different sizes (level shift); and the role of timbre and production techniques in metric interpretations.
Generic temperature compensation of biological clocks by autonomous regulation of catalyst concentration
Creators: name: Hatakeyama, Tetsuhiro S.
name: Kaneko, Kunihiko
Publisher: name: arXiv
Year: 2011
Subjects: subject: Molecular Networks (q-bio.MN)
subject: Biological Physics (physics.bio-ph)
subject: FOS: Biological sciences
subject: FOS: Physical sciences
subject: J.3
subject: 92B25

description: Circadian clocks ubiquitous in life forms ranging bacteria to multi-cellular organisms, often exhibit intrinsic temperature compensation; the period of circadian oscillators is maintained constant over a range of physiological temperatures, despite the expected Arrhenius form for the reaction coefficient. Observations have shown that the amplitude of the oscillation depends on the temperature but the period does not---this suggests that although not every reaction step is temperature independent, the total system comprising several reactions still exhibits compensation. We present a general mechanism for such temperature compensation. Consider a system with multiple activation energy barriers for reactions, with a common enzyme shared across several reaction steps with a higher activation energy. These reaction steps rate-limit the cycle if the temperature is not high. If the total abundance of the enzyme is limited, the amount of free enzyme available to catalyze a specific reaction decreases as more substrates bind to common enzyme. We show that this change in free enzyme abundance compensate for the Arrhenius-type temperature dependence of the reaction coefficient. Taking the example of circadian clocks with cyanobacterial proteins KaiABC consisting of several phosphorylation sites, we show that this temperature compensation mechanisms is indeed valid. Specifically, if the activation energy for phosphorylation is larger than that for dephosphorylation, competition for KaiA shared among the phosphorylation reactions leads to temperature compensation. Moreover, taking a simpler model, we demonstrate the generality of the proposed compensation mechanism, suggesting relevance not only to circadian clocks but to other (bio)chemical oscillators as well.
description: 21 pages, 12 figures
Debugging Woven Code
Creators: name: Eaddy, Marc
name: Aho, Alfred V.
name: Hu, Weiping
name: McDonald, Paddy
name: Burger, Julian
Publisher: name: Columbia University
Year: 2006
Subjects: Computer science

description: The ability to debug woven programs is critical to the adoption of Aspect Oriented Programming (AOP). Nevertheless, many AOP systems lack adequate support for debugging, making it difficult to diagnose faults and understand the program's structure and control flow. We discuss why debugging aspect behavior is hard and how harvesting results from related research on debugging optimized code can make the problem more tractable. We also specify general debugging criteria that we feel all AOP systems should support. We present a novel solution to the problem of debugging aspect-enabled programs. Our Wicca system is the first dynamic AOP system to support full source-level debugging of woven code. It introduces a new weaving strategy that combines source weaving with online byte-code patching. Changes to the aspect rules, or base or aspect source code are rewoven and recompiled on-the-fly. We present the results of an experiment that show how these features provide the programmer with a powerful interactive debugging experience with relatively little overhead.
Creation and characterization of vortex clusters in atomic Bose-Einstein condensates
Creators: name: White, Angela
name: Barenghi, Carlo
name: Proukakis, Nick
Publisher: name: arXiv
Year: 2012
Subjects: subject: Quantum Gases (cond-mat.quant-gas)
subject: Fluid Dynamics (physics.flu-dyn)
subject: FOS: Physical sciences

description: We show that a moving obstacle, in the form of an elongated paddle, can create vortices that are dispersed, or induce clusters of like-signed vortices in 2D Bose-Einstein condensates. We propose new statistical measures of clustering based on Ripley's K-function which are suitable to the small size and small number of vortices in atomic condensates, which lack the huge number of length scales excited in larger classical and quantum turbulent fluid systems. The evolution and decay of clustering is analyzed using these measures. Experimentally it should prove possible to create such an obstacle by a laser beam and a moving optical mask. The theoretical techniques we present are accessible to experimentalists and extend the current methods available to induce 2D quantum turbulence in Bose-Einstein condensates.
description: 9 pages, 9 figures
Additional file 2 of Primary resistance to first-generation EGFR-TKIs induced by MDM2 amplification in NSCLC
Creators: name: Sun, Dantong
name: Zhu, Yan
name: Zhu, Jingjuan
name: Tao, Junyan
name: Wei, Xiaojuan
name: Wo, Yang
name: Hou, Helei
Publisher: name: figshare
Year: 2020
Subjects: subject: Biophysics
subject: Biochemistry
subject: Cell Biology
subject: Genetics
subject: FOS: Biological sciences
subject: Molecular Biology
subject: Pharmacology
subject: Biotechnology
subject: Biological Sciences not elsewhere classified
subject: Cancer
subject: Hematology
subject: Infectious Diseases
subject: FOS: Health sciences

description: Additional file 2: Figure S1. The potential pathway activated by MDM2 amplification. A1-A4. The GSEA analyses of NSCLC patients based on MDM2 expression; B. The molecules ubiquitinated by MDM2; C. The PPI plot of molecules ubiquitinated by MDM2; D. The enrichment analyses of molecules ubiquitinated by MDM2.
First Survey Questionnaire Addressing Data, Data Handling & Processing in Subprojects of CRC 1266 (SFB 1266)
Creators: name: Strohm, Steffen
Publisher: name: Zenodo
Year: 2023

description: The attached file shows the questions / items included in the first survey on data, data handling and processing in subprojects of CRC 1266 in the early second CRC phase. The survey was conducted in February 2021 and helped to retrieve information similar to what would be described in Data Management Plans. However, the survey focused on already available data or data in use to reveal the complexity to be taken into account in designing the subsequent data (and meta data) collection process and shaping the CRC information system.
Coarsening of Two Dimensional Foam on a Dome
Creators: name: Roth, A. E.
name: Jones, C. D.
name: Durian, D. J.
Publisher: name: arXiv
Year: 2012
Subjects: subject: Soft Condensed Matter (cond-mat.soft)
subject: FOS: Physical sciences

description: In this paper we report on bubble growth rates and on the statistics of bubble topology for the coarsening of a dry foam contained in the narrow gap between two hemispheres. By contrast with coarsening in flat space, where six-sided bubbles neither grow nor shrink, we observe that six sided bubbles grow with time at a rate that depends on their size. This result agrees with the modification to von Neumann's law predicted by J.E. Avron and D. Levine. For bubbles with a different number of sides, except possibly seven, there is too much noise in the growth rate data to demonstrate a difference with coarsening in flat space. In terms of the statistics of bubble topology, we find fewer 3, 4, and 5 sided bubbles, and more 6 and greater sided bubbles, in comparison with the stationary distribution for coarsening in flat space. We also find good general agreement with the Aboav-Weaire law for the average number of sides of the neighbors of an n-sided bubble.
ทัศนคติในการเลือกงานทำและการลาออกจากงานของบัณฑิตบริหารธุรกิจ สาขาการจัดการธุรกิจ มหาวิทยาลัยนเรศวร
Creators: name: ชาตรี ปรีดาอนันทสุข
Publisher: name: คณะบริหารธุรกิจ เศรษฐศาสตร์และการสื่อสาร มหาวิทยาลัยนเรศวร
Year: 2560
Subjects: ทัศนคติ
การเลือกทางาน
การลาออกจากงาน
มหาวิทยาลัยนเรศวร
Attitude
Job Selection
Job Resignation
Naresuan University

description: วารสารบริหารธุรกิจ เศรษฐศาสตร์และการสื่อสาร, 12, 2, 110-118
On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines
Creators: name: Galil, Zvi
name: Kannan, Ravi
name: Szemeredi, Endre
Publisher: name: Columbia University
Year: 1987
Subjects: Computer science

description: We show that the following statements are equivalent: 1. Statement 1. 3-pushdown graphs have sublinear separators. 2. Statement 1∗. k-page graphs have sublinear separators. 3. Statement 2. A one-tape nondeterministic Turing machine can simulate a two-tape machine in subquadratic time. None of the statements is known to be true or false at present. However, our proof of equivalence is quantitative-it relates exactly the separator size of the two kinds of graphs to the running time of the simulation in Statement 2. Using this equivalence we derive several graph-theoretic corollaries. There are known examples where upper bounds on graph properties imply upper bounds on computation time or space. There are other examples where lower bounds on graph properties are used to derive lower bounds on computation time in restricted settings. However, our results may constitute the first example where a graph problem is shown to be equivalent to a problem in computational complexity. In a companion paper we construct graphs and prove a lower bound or their separators. Using the equivalence we prove an almost linear lower bound for the size of separators for 3-pushdown graphs and an almost quadratic lower bound for simulating two-tape nondeterministic Turing machines by one-tape machines. Specifically, for an integers s let ls(n), the s-iterated logarithm function, be defined inductively: l°(n)=n, ls+1(n)=log2(ls(n)) for s⩾0. Then: 1. For every fixed s and all n, there is an n-vertex 3-pushdown graph whose smallest separator contains at least ω(n/ls(n)) vertices.2. There is a language L recognizable in real time by a two-tape nondeterministic Turing machine, but every on-line one-tape nondeterministic Turing machine that recognizes L requires ω(n2/ls(n)) time for any positive integer.
Effectiveness of cold therapy in reducing acute pain among persons with cardiac surgery: A randomized control trial
Creators: name: Pakamas Keawnantawat
name: Sureeporn Thanasilp
name: Sunida Preechawong
Publisher: name: Research and Development Office, Prince of Songkla University
Year: 2018
Subjects: acute pain
cardiac surgery
cold therapy
pain management

description: Songklanakarin Journal of Science and Technology, 40, 6, 1378-1385
Quantum Error Correction with Mixed Ancilla Qubits
Creators: name: Criger, Ben
name: Moussa, Osama
name: Laflamme, Raymond
Publisher: name: arXiv
Year: 2012
Subjects: subject: Quantum Physics (quant-ph)
subject: FOS: Physical sciences

description: Most quantum error correcting codes are predicated on the assumption that there exists a reservoir of qubits in the state $\ket{0}$, which can be used as ancilla qubits to prepare multi-qubit logical states. In this report, we examine the consequences of relaxing this assumption, and propose a method to increase the fidelity produced by a given code when the ancilla qubits are initialized in mixed states, using the same number of qubits, at most doubling the number of gates. The procedure implemented consists of altering the encoding operator to include the inverse of the unitary operation used to correct detected errors after decoding. This augmentation will be especially useful in quantum computing architectures that do not possess projective measurement, such as solid state NMRQIP.
description: 5 pages, 8 figures
Jet Modification in a Brick of QGP Matter
Creators: name: Coleman-Smith, C. E.
name: Qin, G-Y.
name: Bass, S. A.
name: Muller, B.
Publisher: name: arXiv
Year: 2011
Subjects: subject: High Energy Physics - Phenomenology (hep-ph)
subject: FOS: Physical sciences

description: We have implemented the LPM effect into a microscopic transport model with partonic degrees of freedom by following the algorithm of Zapp & Wiedemann. The Landau-Pomeranchuk-Migdal (LPM) effect is a quantum interference process that modifies the emission of radiation in the presence of a dense medium. In QCD this results in a quadratic length dependence for radiative energy loss. This is an important effect for the modification of jets by their passage through the QGP. We verify the leading parton energy loss in the model against the leading order Baier-Dokshitzer-Mueller-Peigne-Schiff-Zakharov (BDMPS-Z) result. We apply our model to the recent observations of the modification of di-jets at the LHC.
description: Presented at Panic 11
Change Management Support for Large Software Systems
Creators: name: Kaiser, Gail E.
name: Perry, Dewayne E.
name: Schwanke, Robert W.
Publisher: name: Columbia University
Year: 1986
Subjects: Computer science

description: This technical report consists of three related papers in the area of management of source code changes for large software systems. Infuse: A Toolfor Automatically Managing and Coordinating Source Changes in Large Systems presents Infuse, a software engineering environment that automatically panitions the source code files to be changed in order to limit the complexity of change propagation and negotiation of conflicting changes. Workspaces and Experimental Databases: Automated Support for Cooperation Among Programmers describes Infuse in more detail, focusing on the interactions between Infuse and source code modification tools. Smarter Recompilation presents an algorithm that could be used by Infuse or other software engineering environments to reduce recompilation costs after source code changes.
A Syntactic Omni-Font Character Recognition System
Creators: name: Wolberg, George
Publisher: name: Columbia University
Year: 1987
Subjects: Computer science

description: The author introduces a syntactic omni-font character recognition system that recognizes a wide range of fonts, including handprinted characters. A structural pattern-matching approach is used. Essentially, a set of loosely constrained rules specify pattern components and their interrelationships. The robustness of the system is derived from the orthogonal set of pattern descriptors, location functions, and the manner in which they are combined to exploit the topological structure of characters. By virtue of the new pattern description language, PDL, the user may easily write rules to define new patterns for the system to recognize. The system also features scale-invariance and user-definable sensitivity to tilt orientation. The system has achieved a 95. 2% recognition rate.
Способы регулирования реактивной мощности в энергосистемах
Creators: name: Владимировна, Шевченко Валентина
name: Матвеенко Павел Иванович
Publisher: name: Zenodo
Year: 2013
Subjects: реактивная энергия
синхронные компенсаторы
средства компенсации
турбогенераторы
ТГ

description: На русском: [Шевченко В.В., Матвеенко П.И. Способы регулирования реактивной мощности в энергосистемах // Материалы 5-й межвузовской научно-технической конференции преподавателей, молодых ученых и студентов "Энерго- и ресурсосберегающие технологии при эксплуатации машин и оборудования", 11-12 декабря 2013 года, секция "Усовершенствование технологических режимов и надежность машин". - Украина, Донецк: Донецкий институт железнодорожного транспорта, 2013. - С. 53-54. https://doi.org/10.5281/zenodo.2555511]

Для обеспечения баланса активной и реактивной мощностей в энергосистеме Украины предложено использовать турбогенераторы, срок эксплуатации которых истекает, в режиме синхронных компенсаторов на постоянной основе.

Ключевые слова: реактивная энергия, синхронные компенсаторы, средства компенсации, турбогенераторы.

Репозиторий НТУ "ХПИ" - открыть pdf
Способы регулирования реактивной мощности в энергосистемах
Creators: name: Владимировна, Шевченко Валентина
name: Матвеенко Павел Иванович
Publisher: name: Zenodo
Year: 2013
Subjects: реактивная энергия
синхронные компенсаторы
средства компенсации
турбогенераторы
ТГ

description: На русском: [Шевченко В.В., Матвеенко П.И. Способы регулирования реактивной мощности в энергосистемах // Материалы 5-й межвузовской научно-технической конференции преподавателей, молодых ученых и студентов "Энерго- и ресурсосберегающие технологии при эксплуатации машин и оборудования", 11-12 декабря 2013 года, секция "Усовершенствование технологических режимов и надежность машин". - Украина, Донецк: Донецкий институт железнодорожного транспорта, 2013. - С. 53-54. https://doi.org/10.5281/zenodo.2555511]

Для обеспечения баланса активной и реактивной мощностей в энергосистеме Украины предложено использовать турбогенераторы, срок эксплуатации которых истекает, в режиме синхронных компенсаторов на постоянной основе.

Ключевые слова: реактивная энергия, синхронные компенсаторы, средства компенсации, турбогенераторы.

Репозиторий НТУ "ХПИ" - открыть pdf

Збірка тез конференції (назва українською): [Енерго- і ресурсозберігаючі технології при експлуатації машин та  устаткування. Тези міжвузівської науково-технічної конференції: 11-12 грудня 2013  р.,  Донецьк: ДонІЗТ,  2013. – 117 с. https://doi.org/10.5281/zenodo.2555512] Скачать pdf

Опубліковані матеріали присвячені проблемам енерго- і ресурсозберігаючих  технологій  при ремонті та експлуатації машин і устаткування, в тому числі і на залізничному транспорті. Матеріали  науково-технічної конференції надруковані мовою оригінала у редакції авторів.
Electron-Mediated Nuclear-Spin Interactions Between Distant NV Centers
Creators: name: Bermudez, A.
name: Jelezko, F.
name: Plenio, M. B.
name: Retzker, A.
Publisher: name: arXiv
Year: 2011
Subjects: subject: Quantum Physics (quant-ph)
subject: FOS: Physical sciences

description: We propose a scheme enabling controlled quantum coherent interactions between separated nitrogen-vacancy centers in diamond in the presence of strong magnetic fluctuations. The proposed scheme couples nuclear qubits employing the magnetic dipole-dipole interaction between the electron spins and, crucially, benefits from the suppression of the effect of environmental magnetic field fluctuations thanks to a strong microwave driving. This scheme provides a basic building block for a full-scale quantum information processor or quantum simulator based on solid-state technology.
description: replaced with published verion
Calculating optical absorption spectra for large systems using linear-scaling density-functional theory
Creators: name: Ratcliff, Laura E.
name: Hine, Nicholas D. M.
name: Haynes, Peter D.
Publisher: name: arXiv
Year: 2011
Subjects: subject: Materials Science (cond-mat.mtrl-sci)
subject: FOS: Physical sciences

description: A new method for calculating optical absorption spectra within linear-scaling density-functional theory (LS-DFT) is presented, incorporating a scheme for optimizing a set of localized orbitals to accurately represent unoccupied Kohn-Sham states. Three different schemes are compared and the most promising of these, based on the use of a projection operator, has been implemented in a fully-functional LS-DFT code. The method has been applied to the calculation of optical absorption spectra for the metal-free phthalocyanine molecule and the conjugated polymer poly(para-phenylene). Excellent agreement with results from a traditional DFT code is obtained.
description: Accepted for publication in Physical Review B
Updating Distance Maps When Objects Move
Creators: name: Boult, Terrance E.
Publisher: name: Columbia University
Year: 1987
Subjects: Computer science

description: Using a discrete distance transform one can quickly build a map of the distance from a goal to every point in a digital map. Using this map, one can easily solve the shortest path problem from any point by simply following the gradient of the distance map. This technique can be used in any number of dimensions and can incorporate obstacles of arbitrary shape (represented in the digital map) including pseudo-obstacles caused by unattainable configurations of a robotic system. This paper further extends the usefulness of the digital distance transform technique by providing an efficient means for dealing with objects which undergo motion. In particular, an algorithm is presented that allows one to update only those portions of the distance map that will potentially change as an object moves. The technique is based on an analysis of the distance transform as a problem in wave propagation. The regions that must be checked for possible update when an object moves are those that are in its "shadow~, or in the shadow of objects that are partially in the shadow of the moving object. The technique can handle multiple goals, and multiple objects moving and interacting in an arbitrary fashion. The algorithm is demonstrated on a number of synthetic two dimensional examples.
The Theory of Minimum-Knowledge Protocols
Creators: name: Haber, Stuart
Publisher: name: Columbia University
Year: 1987
Subjects: Computer science

description: This paper explores the complexity-theoretic approach to the transmission of knowledge that was introduced by Goldwasser, Micali. and Rackoff, and further studied by a number of authors. Roughly speaking, a protocol designed to solve a given computational problem is said to be minimum-knowledge if its outputs give no more information than an oracle for the problem would give to a user whose computational resources are polynomially bounded. This notion has important consequences for the design of cryptographic protocols. A few slightly different definitions have been given in the literature: some of the results included here have been published previously without proofs. This paper proposes a uniform definition. collects the known results and proves them, and describes the problems that are still not understood.
High Quality, Efficient Hierarchical Document Clustering Using Closed Interesting Itemsets
Creators: name: Malik, Hassan H.
name: Kender, John R.
Publisher: name: Columbia University
Year: 2006
Subjects: Computer science

description: High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to improve the efficiency of hierarchical document clustering. In this paper, we introduce the notion of "closed interesting" itemsets (i.e. closed itemsets with high interestingness). We provide heuristics such as "super item" to efficiently mine these itemsets and show that they provide significant dimensionality reduction over closed frequent itemsets. Using "closed interesting" itemsets, we propose a new hierarchical document clustering method that outperforms state of the art agglomerative, partitioning and frequent-itemset based methods both in terms of FScore and Entropy, without requiring dataset specific parameter tuning. We evaluate twenty interestingness measures on nine standard datasets and show that when used to generate "closed interesting" itemsets, and to select parent nodes, Mutual Information, Added Value, Yule's Q and Chi-Square offers best clustering performance, regardless of the characteristics of underlying dataset. We also show that our method is more scalable, and results in better run-time performance as compare to leading approaches. On a dual processor machine, our method scaled sub-linearly and was able to cluster 200K documents in about 40 seconds.