cometadata/datacite-rtg-text-other-reclassification-records huggingface dataset:
Energy- and Performance-Driven NoC Communication Architecture Synthesis Using a Decomposition Approach
Creators: name: Ogras, Umit Y.
name: Marculescu, Radu
Publisher: name: arXiv
Year: 2007
Subjects: subject: Hardware Architecture (cs.AR)
subject: FOS: Computer and information sciences

description: In this paper, we present a methodology for customized communication architecture synthesis that matches the communication requirements of the target application. This is an important problem, particularly for network-based implementations of complex applications. Our approach is based on using frequently encountered generic communication primitives as an alphabet capable of characterizing any given communication pattern. The proposed algorithm searches through the entire design space for a solution that minimizes the system total energy consumption, while satisfying the other design constraints. Compared to the standard mesh architecture, the customized architecture generated by the newly proposed approach shows about 36% throughput increase and 51% reduction in the energy required to encrypt 128 bits of data with a standard encryption algorithm.
description: Submitted on behalf of EDAA (http://www.edaa.com/)
Synchronisation of Partial Multi-Matchings via Non-negative Factorisations
Creators: name: Bernard, Florian
name: Thunberg, Johan
name: Goncalves, Jorge
name: Theobalt, Christian
Publisher: name: arXiv
Year: 2018
Subjects: subject: Computer Vision and Pattern Recognition (cs.CV)
subject: Optimization and Control (math.OC)
subject: Machine Learning (stat.ML)
subject: FOS: Computer and information sciences
subject: FOS: Mathematics

description: In this work we study permutation synchronisation for the challenging case of partial permutations, which plays an important role for the problem of matching multiple objects (e.g. images or shapes). The term synchronisation refers to the property that the set of pairwise matchings is cycle-consistent, i.e. in the full matching case all compositions of pairwise matchings over cycles must be equal to the identity. Motivated by clustering and matrix factorisation perspectives of cycle-consistency, we derive an algorithm to tackle the permutation synchronisation problem based on non-negative factorisations. In order to deal with the inherent non-convexity of the permutation synchronisation problem, we use an initialisation procedure based on a novel rotation scheme applied to the solution of the spectral relaxation. Moreover, this rotation scheme facilitates a convenient Euclidean projection to obtain a binary solution after solving our relaxed problem. In contrast to state-of-the-art methods, our approach is guaranteed to produce cycle-consistent results. We experimentally demonstrate the efficacy of our method and show that it achieves better results compared to existing methods.
Characterising mixing and soot production using a Lagrangian Statistical Method
Creators: name: Kampanas, Vassilis
Publisher: name: Loughborough University
Year: 2022
Subjects: classificationCode: 409999
subject: Other engineering not elsewhere classified

description: This PhD thesis uses a Lagrangian Statistical Method (LSM) to investigate the time histories of mixing hence and soot development for massless particles tracked within an LES calculation. This provides the advantage of investigating soot development using an inexpensive post-processing technique. The method comprises tracking massless particles through the flow and recording the local temperature and composition at the particle location, as well as the age of the particle. This can be used to give statistical information about various aspects of mixing and soot production, such as distributions of mixture fraction or residence times. The history for each particle can then be used in a post-processing step to predict the soot development in time for that particle path. This has been used to compare Large Eddy Simulations (LES) of reacting flows in both a laboratory combustor and a geometry representative of an annular sector from an aircraft engine combustor. The Lagrangian Statistical Method proved to be a cost effective and efficient low-order method to characterise the reacting flow mixing, provide soot estimates based on unsteady histories of particle properties and reveal new knowledge in combustor regions, such as the primary zone, where measurements of long duration sooting flames are challenging. LSM provides also a convenient, preliminary design tool, a decoupled post-processing method and a rapid test bed on which soot models can be tested/assessed with realistic time histories of gas phase conditions without needing to run the full CFD simulation.
Comparative Phylogeography of bats in South America
Creators: name: Cortes-Delgado, Natalia
Publisher: name: University of Illinois at Chicago
Year: 2024

description: South America is megadiverse. It provides habitat for 25% of all mammal species and holds the world’s richest bat fauna. Such species diversity is the result of varied habitats and climatic conditions, but it is also a consequence of a long evolutionary history and changing geographic setting. The Andes, the longest terrestrial mountain chain in the world, has been recognized as one of the crucial factors in the shaping of species diversity and distribution patterns in South America. It has served to isolate lowland populations and connect montane ones, while presenting a great diversity of habitats along its slopes. The Andes support one of the richest bat faunas in the world, but the drivers of this diversity are not well understood especially in view of bat vagility. To establish the effect of the Andes on bat population structure, the species Sturnira bogotensis, Sturnira erythromos, Artibeus fraterculus, and Glossophaga soricina will be the main focus. These species are of great interest, owed to their widespread and contrasting distributions on both the east and west sides of the Andes. Both species of Sturnira are highland species, while A. fraterculus and G. soricina are lowland species. It is expected that the highland species will be more capable of dispersing through montane passes, and so, would have higher gene flow and thus weaker population structure than the lowland species.
This work has two main aims. First, to analyze the evolutionary processes that are related to genetic structure in bat populations. Second, evaluate the effect of the Andes uplift on the divergence and structuring of populations of species of the bat genera Sturnira, Artibeus and Glossophaga. Using ultraconserved elements (UCEs) and one mitochondrial gene as markers, it was found that the lowland bat Glossophaga soricina, is composed by two lineages separated by the Andes. In contrast, populations of the also lowland bat Artibeus fraterculus present on the East side of the Andes showed slight structure caused by the Andes, which could be related to recent colonization. Lastly, according to phylogenetic analyses the highland bats Sturnira bogotensis and Sturnira erythromos do not displayed structure as expected, which could be related to their vagility, the use of low passes, and the use of the Andean cloud forests as north -south corridors.
Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds
Creators: name: Sanjit A. Seshia
name: Bryant, Randal
Publisher: name: Carnegie Mellon University
Year: 2005
Subjects: subject: 80399 Computer Software not elsewhere classified
subject: FOS: Computer and information sciences

description: Given a formula in quantifier-free Presburger arithmetic, if it has a satisfying solution, there is one whose size, measured in bits, is polynomially bounded in the size of the formula. In this paper, we consider a special class of quantifier-free Presburger formulas in which most linear constraints are difference (separation) constraints, and the non-difference constraints are sparse. This class has been observed to commonly occur in software verification. We derive a new solution bound in terms of parameters characterizing the sparseness of linear constraints and the number of non-difference constraints, in addition to traditional measures of formula size. In particular, we show that the number of bits needed per integer variable is linear in the number of non-difference constraints and logarithmic in the number and size of non-zero coefficients in them, but is otherwise independent of the total number of linear constraints in the formula. The derived bound can be used in a decision procedure based on instantiating integer variables over a finite domain and translating the input quantifier-free Presburger formula to an equi-satisfiable Boolean formula, which is then checked using a Boolean satisfiability solver. In addition to our main theoretical result, we discuss several optimizations for deriving tighter bounds in practice. Empirical evidence indicates that our decision procedure can greatly outperform other decision procedures.
Recruitment Market Trend Analysis with Sequential Latent Variable Models
Creators: name: Zhu, Chen
name: Zhu, Hengshu
name: Xiong, Hui
name: Ding, Pengliang
name: Xie, Fang
Publisher: name: arXiv
Year: 2017
Subjects: subject: Artificial Intelligence (cs.AI)
subject: Computers and Society (cs.CY)
subject: FOS: Computer and information sciences
subject: 62H25

description: Recruitment market analysis provides valuable understanding of industry-specific economic growth and plays an important role for both employers and job seekers. With the rapid development of online recruitment services, massive recruitment data have been accumulated and enable a new paradigm for recruitment market analysis. However, traditional methods for recruitment market analysis largely rely on the knowledge of domain experts and classic statistical models, which are usually too general to model large-scale dynamic recruitment data, and have difficulties to capture the fine-grained market trends. To this end, in this paper, we propose a new research paradigm for recruitment market analysis by leveraging unsupervised learning techniques for automatically discovering recruitment market trends based on large-scale recruitment data. Specifically, we develop a novel sequential latent variable model, named MTLVM, which is designed for capturing the sequential dependencies of corporate recruitment states and is able to automatically learn the latent recruitment topics within a Bayesian generative framework. In particular, to capture the variability of recruitment topics over time, we design hierarchical dirichlet processes for MTLVM. These processes allow to dynamically generate the evolving recruitment topics. Finally, we implement a prototype system to empirically evaluate our approach based on real-world recruitment data in China. Indeed, by visualizing the results from MTLVM, we can successfully reveal many interesting findings, such as the popularity of LBS related jobs reached the peak in the 2nd half of 2014, and decreased in 2015.
description: 11 pages, 30 figure, SIGKDD 2016
Superinjection in diamond p-i-n diodes: bright single-photon electroluminescence of color centers beyond the doping limit
Creators: name: Khramtsov, Igor A.
name: Fedyanin, Dmitry Yu.
Publisher: name: arXiv
Year: 2018
Subjects: subject: Applied Physics (physics.app-ph)
subject: Mesoscale and Nanoscale Physics (cond-mat.mes-hall)
subject: Optics (physics.optics)
subject: FOS: Physical sciences

description: Efficient generation of single photons on demand at a high repetition rate is a key to the practical realization of quantum-communication networks and optical quantum computations. Color centers in diamond are considered to be the most promising platform for building such single-photon sources owing to the outstanding emission properties of color centers at room temperature. However, their efficient electrical excitation remains a challenge due to the inability to create a high density of free electrons in diamond. Here, we show that using the self-gating effect in a diamond p-i-n diode, one can overcome the doping problem and inject four orders of magnitude more carriers into the i-region of the diamond diode than the doping of the n-region allows. This high density of free electrons can be efficiently used to boost the single-photon electroluminescence process and enhance the brightness of the single-photon source by more than three orders of magnitude. Moreover, we show that such a high single-photon emission rate can be achieved at exceptionally low injection current densities of only 0.001 A/mm$^2$, which creates the backbone for the development of low-power and cost-efficient diamond quantum optoelectronic devices for quantum information technologies.
description: 4 figures and 7 figures in Supplemental Material
Non-unimodular reductions and N = 4 gauged supergravities
Creators: name: Petropoulos, P. Marios
Publisher: name: arXiv
Year: 2007
Subjects: subject: High Energy Physics - Theory (hep-th)
subject: FOS: Physical sciences

description: We analyze the class of four-dimensional N = 4 supergravities obtained by gauging the axionic shift and axionic rescaling symmetries. These theories are formulated with the machinery of embedding tensors and shown to be deducible from higher dimensions using a Scherk--Schwarz reduction with a twist by a non-compact symmetry. This allows to evade the usual unimodularity requirement and completes the dictionary between heterotic gaugings and fluxes, at least for the "geometric sector".
description: 15 pages
title: Universität Bayreuth-aktuell : ubt aktuell, Nr. 1 – 2020
Creators: name: Universität Bayreuth, Pressestelle
Publisher: name: University of Bayreuth
Year: 2018
Subjects: subject: ubtaktuell
subject: Universität Bayreuth
subject: Uni Bayreuth
subject: Campus
subject: Neuigkeiten
subject: 050
subject: 070

description: Das Campusmagazin der Universität Bayreuth
Secant and Popov-like Conditions in Power Network Stability
Creators: name: Monshizadeh, Nima
name: Lestas, Ioannis
Publisher: name: arXiv
Year: 2018
Subjects: subject: Optimization and Control (math.OC)
subject: FOS: Mathematics

description: The problem of decentralized frequency control in power networks has received an increasing attention in recent years due to its significance in modern power systems and smart grids. Nevertheless, generation dynamics including turbine-governor dynamics, in conjunction with nonlinearities associated with generation and power flow, increase significantly the complexity in the analysis, and are not adequately addressed in the literature. In this paper we show how incremental secant gain conditions can be used in this context to deduce decentralized stability conditions with reduced conservatism. Furthermore, for linear generation dynamics, we establish Popov-like conditions that are able to reduce the conservatism even further by incorporating additional local information associated with the coupling strength among the bus dynamics. Various examples are discussed throughout the paper to demonstrate the significance of the results presented.
Lower bounds for the greatest possible number of colors in interval edge colorings of bipartite cylinders and bipartite tori
Creators: name: Petrosyan, Petros A.
name: Karapetyan, Gagik H.
Publisher: name: arXiv
Year: 2007
Subjects: subject: Discrete Mathematics (cs.DM)
subject: FOS: Computer and information sciences

description: An interval edge t-coloring of a graph G is a proper edge coloring of G with colors 1,2...,t such that at least one edge of G is colored by color i,i=1,2...,t, and the edges incident with each vertex v are colored by d_{G}(v) consecutive colors, where d_{G}(v) is the degree of the vertex v in G. In this paper interval edge colorings of bipartite cylinders and bipartite tori are investigated.
description: 3 pages
Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds
Creators: name: Sanjit A. Seshia
name: Bryant, Randal
Publisher: name: Carnegie Mellon University
Year: 2004
Subjects: subject: 80399 Computer Software not elsewhere classified
subject: FOS: Computer and information sciences

description: Institute for Software Research
ARCFISH – Digital Twin of the Ocean for Arctic Fisheries
Creators: name: Hamre, Torill
name: Higgins, Ruth
name: Maar, Marie
name: Viðarsson, Jónas R.
name: Ágústsson, Þorsteinn
name: Margeirsson, Sveinn
name: Hestnes, Arne Johan
Publisher: name: Zenodo
Year: 2024

description: Poster for the first Sustainable Blue Economy Partnership Symposium, Brussels, 13-14 February 2024.
Analog and Digital Circuit Design in 65 nm CMOS: End of the Road?
Creators: name: Gielen, Georges
name: Dehaene, Wim
name: Christie, Phillip
name: Draxelmayr, Dieter
name: Janssens, Edmond
name: Maex, Karen
name: Vucurevich, Ted
Publisher: name: arXiv
Year: 2007
Subjects: subject: Hardware Architecture (cs.AR)
subject: FOS: Computer and information sciences

description: This special session adresses the problems that designers face when implementing analog and digital circuits in nanometer technologies. An introductory embedded tutorial will give an overview of the design problems at hand : the leakage power and process variability and their implications for digital circuits and memories, and the reducing supply voltages, the design productivity and signal integrity problems for embedded analog blocks. Next, a panel of experts from both industrial semiconductor houses and design companies, EDA vendors and research institutes will present and discuss with the audience their opinions on whether the design road ends at marker "65nm" or not.
description: Submitted on behalf of EDAA (http://www.edaa.com/)
Customer Segmentation and Personalization in Banking
Creators: name: Amit Jha
name: Anil Kumar
Publisher: name: Zenodo
Year: 2019

description: This studies article explores the pivotal role of patron segmentation and personalization inside the dynamic landscape of the banking enterprise. In a generation characterised by means of digital transformation and evolving patron options, know-how and catering to various patron needs have become vital for financial establishments. The examine employs a complete approach to analyse the implementation and impact of customer segmentation strategies, inspecting their efficacy in improving client experience and loyalty. Through a combination of quantitative and qualitative methodologies, the studies investigates the various segmentation standards hired through banks, which includes demographics, conduct, and transaction records. Additionally, the thing delves into the technological advancements driving customized banking offerings, including artificial intelligence, machine learning, and information analytics. The findings shed light on the effectiveness of personalised offerings in fostering more potent purchaser relationships, optimizing advertising techniques, and ultimately improving the overall monetary overall performance of banks. The implications of this research enlarge past theoretical frameworks, providing sensible insights for banking executives, marketers, and policymakers to refine their tactics to consumer engagement. As monetary institutions navigate an more and more aggressive panorama, the know-how gleaned from this examine serves as a treasured resource for crafting cantered and customized solutions that align with the various and evolving desires of their purchaser base. Ultimately, the item contributes to the continuing discourse at the destiny of banking in an era wherein patron-centricity is paramount.
Deciding Bit-Vector Arithmetic with Abstraction
Creators: name: Bryant, Randal
name: Kroening, Daniel
name: Ouaknine, Joel
name: Sanjit A. Seshia
name: Strichman, Ofer
name: Brady, Bryan
Publisher: name: Carnegie Mellon University
Year: 2007
Subjects: subject: 80399 Computer Software not elsewhere classified
subject: FOS: Computer and information sciences

description: We present a new decision procedure for finite-precision bitvector arithmetic with arbitrary bit-vector operations. Our procedure alternates between generating under- and over-approximations of the original bit-vector formula. An under-approximation is obtained by a translation to propositional logic in which some bit-vector variables are encoded with fewer Boolean variables than their width. If the underapproximation is unsatisfiable, we use the unsatisfiable core to derive an over-approximation based on the subset of predicates that participated in the proof of unsatisfiability. If this over-approximation is satisfiable, the satisfying assignment guides the refinement of the previous underapproximation by increasing, for some bit-vector variables, the number of Boolean variables that encode them. We present experimental results that suggest that this abstraction-based approach can be considerably more efficient than directly invoking the SAT solver on the original formula as well as other competing decision procedures.
UV/Optical Detections of Candidate Tidal Disruption Events by GALEX and CFHTLS
Creators: name: Gezari, S.
name: Basa, S.
name: Martin, D. C.
name: Bazin, G.
name: Forster, K.
name: Milliard, B.
name: Halpern, J. P.
name: Friedman, P. G.
name: Morrissey, P.
name: Neff, S. G.
name: Schiminovich, D.
name: Seibert, M.
name: Small, T.
name: Wyder, T. K.
Publisher: name: arXiv
Year: 2007
Subjects: subject: Astrophysics (astro-ph)
subject: FOS: Physical sciences

description: We present two luminous UV/optical flares from the nuclei of apparently inactive early-type galaxies at z=0.37 and 0.33 that have the radiative properties of a flare from the tidal disruption of a star. In this paper we report the second candidate tidal disruption event discovery in the UV by the GALEX Deep Imaging Survey, and present simultaneous optical light curves from the CFHTLS Deep Imaging Survey for both UV flares. The first few months of the UV/optical light curves are well fitted with the canonical t^(-5/3) power-law decay predicted for emission from the fallback of debris from a tidally disrupted star. Chandra ACIS X-ray observations during the flares detect soft X-ray sources with T_bb= (2-5) x 10^5 K or Gamma > 3 and place limits on hard X-ray emission from an underlying AGN down to L_X (2-10 keV) 10^44-10^45 ergs/s. The temperature, luminosity, and light curves of both flares are in excellent agreement with emission from a tidally disrupted main sequence star onto a central black hole of several times 10^7 msun. The observed detection rate of our search over ~ 2.9 deg^2 of GALEX Deep Imaging Survey data spanning from 2003 to 2007 is consistent with tidal disruption rates calculated from dynamical models, and we use these models to make predictions for the detection rates of the next generation of optical synoptic surveys.
description: 28 pages, 27 figures, 11 tables, accepted to ApJ, final corrections from proofs added
HEBS: Histogram Equalization for Backlight Scaling
Creators: name: Iranli, Ali
name: Fatemi, Hanif
name: Pedram, Massoud
Publisher: name: arXiv
Year: 2007
Subjects: subject: Other Computer Science (cs.OH)
subject: FOS: Computer and information sciences

description: In this paper, a method is proposed for finding a pixel transformation function that maximizes backlight dimming while maintaining a pre-specified image distortion level for a liquid crystal display. This is achieved by finding a pixel transformation function, which maps the original image histogram to a new histogram with lower dynamic range. Next the contrast of the transformed image is enhanced so as to compensate for brightness loss that would arise from backlight dimming. The proposed approach relies on an accurate definition of the image distortion which takes into account both the pixel value differences and a model of the human visual system and is amenable to highly efficient hardware realization. Experimental results show that the histogram equalization for backlight scaling method results in about 45% power saving with an effective distortion rate of 5% and 65% power saving for a 20% distortion rate. This is significantly higher power savings compared to previously reported backlight dimming approaches.
description: Submitted on behalf of EDAA (http://www.edaa.com/)
title: ADCO, Cartulaire des Dominicains de Dijon (1286), Cart. 221 (H 53), 170 folios, f. 0070
Creators: name: de la Côte d'Or, Archives départementales
name: Archives Départementales De La Côte-D'Or
name: Petot, Frédérique
name: Projet CBMA
name: CG21/F.PETOT/2012
name: Petot, Frédéric
Publisher: name: NAKALA - https://nakala.fr (Huma-Num - CNRS)
publisherIdentifier: https://ror.org/04ces3204
publisherIdentifierScheme: ROR
Year: 2020
Subjects: subject: LaMOP
subject: Laboratoire de Médiévistique Occidentale de Paris
subject: cartulaire
subject: Corpus Burgundiae Medii Aevi
subject: Chartes de la Bourgogne du Moyen Âge

description: Cartulaire des Dominicains de Dijon (1286), Archives départementales de la Côte-d'Or, Cart. 221 (H 53), 170 folios. Numérisation en mode image.
description: Relation: http://www.cbma-project.eu/
description: Bibliographic citation: Cartulaire des Dominicains de Dijon (1286), Archives départementales de la Côte-d'Or, Cart. 221 (H 53), 170 folios, f. 0070, in Projet CBMA - Corpus Burgundiae Medii Aevi [Ressource en ligne], https:// manuscrits.cbma-project.eu/
description: Provenance: https://catalogue.bnf.fr/ark:/12148/cb15250518p
description: Provenance: http://www.idref.fr/02643413X/id
description: Provenance: https://www.geonames.org/6453767
description: Provenance: Dijon
description: Provenance: http://www.wikidata.org/entity/Q7003
Asymptotics for scalar perturbations from a neighborhood of the bifurcation sphere
Creators: name: Angelopoulos, Yannis
name: Aretakis, Stefanos
name: Gajic, Dejan
Publisher: name: arXiv
Year: 2018
Subjects: subject: General Relativity and Quantum Cosmology (gr-qc)
subject: Analysis of PDEs (math.AP)
subject: FOS: Physical sciences
subject: FOS: Mathematics

description: In our previous work [Y. Angelopoulos, S. Aretakis, and D. Gajic, Late-time asymptotics for the wave equation on spherically symmetric stationary backgrounds, in Advances in Mathematics 323 (2018), 529-621] we showed that the coefficient in the precise leading-order late-time asymptotics for solutions to the wave equation with smooth, compactly supported initial data on Schwarzschild backgrounds is proportional to the time-inverted Newman-Penrose constant (TINP), that is the Newman-Penrose constant of the associated time integral. The time integral (and hence the TINP constant) is canonically defined in the domain of dependence of any Cauchy hypersurface along which the stationary Killing field is non-vanishing. As a result, an explicit expression of the late-time polynomial tails was obtained in terms of initial data on Cauchy hypersurfaces intersecting the future event horizon to the future of the bifurcation sphere. In this paper, we extend the above result to Cauchy hypersurfaces intersecting the bifurcation sphere via a novel geometric interpretation of the TINP constant in terms of a modified gradient flux on Cauchy hypersurfaces. We show, without appealing to the time integral construction, that a general conservation law holds for these gradient fluxes. This allows us to express the TINP constant in terms of initial data on Cauchy hypersurfaces for which the time integral construction breaks down.
description: 31 pages, 16 figures
Debugging Interactive Applications
Creators: name: Myers, Brad
name: Ferrency, Alan
name: McDaniel, Rich
name: Dannenberg, Roger
Publisher: name: Carnegie Mellon University
Year: 1996
Subjects: subject: 80399 Computer Software not elsewhere classified
subject: FOS: Computer and information sciences

description: Although interactive, direct manipulation applications are known to be difficult to design and implement, the toolkits with which they are built generally do not contain any particular support for debugging. The Amulet toolkit contains a comprehensive collection of monitoring and debugging tools, including an interactive ‘‘Inspector.’’ These tools are provided in a machine-independent way in C++ without using hooks into the compiler, symbol tables or the run-time stack. Some of these capabilities are based on well-known techniques, but others are innovations that have never been provided before. Based on our experience with writing and debugging interactive applications, we have provided tools to address the most common and difficult programming bugs. The capabilities include: viewing values of objects as they change; breaking into the debugger when values change; viewing the inheritance and grouping hierarchies of objects; feedback for why objects are not visible or not interactive; tracing of constraint dependencies; and various techniques to search for objects. In addition, programmers can edit the values displayed in the Inspector, supporting rapid prototyping without requiring a C++ interpreter. These features make debugging interactive applications written using Amulet is substantially easier than with other toolkits.
The Halpha-based Star Formation Rate Density of the Universe at z=0.84
Creators: name: Villar, Víctor
name: Gallego, Jesús
name: Pérez-González, Pablo G.
name: Pascual, Sergio
name: Noeske, Kai
name: Koo, David C.
name: Barro, Guillermo
name: Zamorano, Jaime
Publisher: name: arXiv
Year: 2007
Subjects: subject: Astrophysics (astro-ph)
subject: FOS: Physical sciences

description: We present the results of an Halpha near-infrared narrow-band survey searching for star-forming galaxies at redshift z=0.84. This work is an extension of our previous narrow-band studies in the optical at lower redshifts. After removal of stars and redshift interlopers (using spectroscopic and photometric redshifts), we build a complete sample of 165 Halpha emitters in the Extended Groth strip and GOODS-N fields with L(Halpha)>10^41 erg/s. We compute the Halpha luminosity function at z=0.84 after corrections for [NII] flux contamination, extinction, systematic errors, and incompleteness. Our sources present an average dust extinction of A(Halpha)=1.5 mag. Adopting Halpha as a surrogate for the instantaneous star formation rate (SFR), we measure a extinction-corrected SFR density of 0.17+-0.03 M_sun/yr/Mpc3. Combining this result to our prior measurements at z=0.02, 0.24, and 0.40, we derive an Halpha-based evolution of the SFR density proportional to (1+z)^beta with beta=3.8+-0.5. This evolution is consistent with that derived by other authors using different SFR tracers.
description: 19 pages, 14 figures, accepted for publication in ApJ
FPGA Architecture for Multi-Style Asynchronous Logic
Creators: name: Huot, N.
name: Dubreuil, H.
name: Fesquet, L.
name: Renaudin, M.
Publisher: name: arXiv
Year: 2007
Subjects: subject: Hardware Architecture (cs.AR)
subject: FOS: Computer and information sciences

description: This paper presents a novel FPGA architecture for implementing various styles of asynchronous logic. The main objective is to break the dependency between the FPGA architecture dedicated to asynchronous logic and the logic style. The innovative aspects of the architecture are described. Moreover the structure is well suited to be rebuilt and adapted to fit with further asynchronous logic evolutions thanks to the architecture genericity. A full-adder was implemented in different styles of logic to show the architecture flexibility.
description: Submitted on behalf of EDAA (http://www.edaa.com/)
An Accurate SER Estimation Method Based on Propagation Probability
Creators: name: Asadi, Ghazanfar
name: Tahoori, Mehdi B.
Publisher: name: arXiv
Year: 2007
Subjects: subject: Hardware Architecture (cs.AR)
subject: FOS: Computer and information sciences

description: In this paper, we present an accurate but very fast soft error rate (SER) estimation technique for digital circuits based on error propagation probability (EPP) computation. Experiments results and comparison of the results with the random simulation technique show that our proposed method is on average within 6% of the random simulation method and four to five orders of magnitude faster.
description: Submitted on behalf of EDAA (http://www.edaa.com/)
Endemicity and prevalence of multipartite viruses under heterogeneous between-host transmission
Creators: name: Valdano, Eugenio
name: Manrubia, Susanna
name: Gómez, Sergio
name: Arenas, Alex
Publisher: name: arXiv
Year: 2018
Subjects: subject: Physics and Society (physics.soc-ph)
subject: Populations and Evolution (q-bio.PE)
subject: FOS: Physical sciences
subject: FOS: Biological sciences

description: Multipartite viruses replicate through a puzzling evolutionary strategy. Their genome is segmented into two or more parts, and encapsidated in separate particles that appear to propagate independently. Completing the replication cycle, however, requires the full genome, so that a systemic infection of a host requires the concurrent presence of several particles. This represents an apparent evolutionary drawback of multipartitism, while its advantages remain unclear. A transition from monopartite to multipartite viral forms has been described in vitro under conditions of high multiplicity of infection, suggesting that cooperation between defective mutants is a plausible evolutionary pathway towards multipartitism. However, it is unknown how the putative advantages that multipartitism might enjoy at the microscopic level affect its epidemiology, or if an explicit advantange is needed to explain its ecological persistence. To disentangle which mechanisms might contribute to the rise and fixation of multipartitism, we investigate the interaction between viral spreading dynamics and host population structure. We set up a compartmental model of the spread of a virus in its different forms and explore its epidemiology using both analytical and numerical techniques. We uncover that the impact of host contact structure on spreading dynamics entails a rich phenomenology of ecological relationships that includes cooperation, competition, and commensality. We find that multipartitism might rise to fixation even in the absence of explicit microscopic advantages. Multipartitism allows the virus to colonize environments that could not be invaded by the monopartite form, facilitated by homogeneous contacts among hosts. We conjecture that these features might have led to an increase in the diversity and prevalence of multipartite viral forms concomitantly with the expansion of agricultural practices.
description: 27 pages, 4 figures, 1 table
Additional file 3 of PTENP1 is a ceRNA for PTEN: it’s CRISPR clear
Creators: name: Vitiello, Marianna
name: Evangelista, Monica
name: Zhang, Yang
name: Salmena, Leonardo
name: Pandolfi, Pier Paolo
name: Poliseno, Laura
Publisher: name: figshare
Year: 2020
Subjects: subject: Physical Sciences not elsewhere classified
subject: Molecular Biology
subject: Biological Sciences not elsewhere classified
subject: Developmental Biology
subject: Cancer
subject: Plant Biology
subject: FOS: Biological sciences

description: Additional file 3. Supplementary Figure 1. a sgRNA-PTENP1 sequence. b (left) PTENP1 genomic sequence recognized by sgRNA-PTENP1 (bold), and PAM sequence (5'-TGG-3', underlined). (right) Orthologous PTEN genomic sequence. sgRNA-PTENP1 cannot mediate the cleavage of PTEN because of 4 mismatches (red), one of which falls in the PAM sequence. c Electropherogram of PTENP1 genomic sequence, where the consequences of the cut by Cas9/sgRNA-PTENP1 are shown. The electropherogram was obtained by PCR analysis of the genomic DNA extracted from DU145-Cas9/sgRNA-PTENP1 double infected cells, 3 days after Cas9 induction using 2ug/ml doxycycline. The primers used for amplification were: Fw- attcgtcttctccccattcc; Rv-tctgcaggaaatcccatagc.
Data-Intensive Supercomputing: The case for DISC
Creators: name: Bryant, Randal
Publisher: name: Carnegie Mellon University
Year: 2007
Subjects: subject: 80399 Computer Software not elsewhere classified
subject: FOS: Computer and information sciences

description: Google and its competitors have created a new class of large-scale computer systems to support Internet search. These “Data-Intensive Super Computing” (DISC) systems differ from conventional supercomputers in their focus on data: they acquire and maintain continually changing data sets, in addition to performing large-scale computations over the data. With the massive amounts of data arising from such diverse sources as telescope imagery,medical records, online transaction records, and web pages, DISC systems have the potential to achieve major advances in science, health care, business efficiencies, and information access. DISC opens up many important research topics in system design, resource management, programming models, parallel algorithms, and applications. By engaging the academic research community in these issues, we can more systematically and in a more open forum explore fundamental aspects of a societally important style of computing.
A variant of the Mordell-Lang conjecture
Creators: name: Ghioca, Dragos
name: Hu, Fei
name: Scanlon, Thomas
name: Zannier, Umberto
Publisher: name: arXiv
Year: 2018
Subjects: subject: Number Theory (math.NT)
subject: Algebraic Geometry (math.AG)
subject: FOS: Mathematics
subject: 11G10, 14K15

description: The Mordell-Lang conjecture (proven by Faltings, Vojta and McQuillan) states that the intersection of a subvariety $V$ of a semiabelian variety $G$ defined over an algebraically closed field $\mathbb{k}$ of characteristic $0$ with a finite rank subgroup $Γ\le G(\mathbb{k})$ is a finite union of cosets of subgroups of $Γ$. We explore a variant of this conjecture when $G$ is a product of an abelian variety $A$ defined over $\mathbb{k}$ with the additive group $\mathbb{G}_a$.
description: minor changes; to appear in Math. Res. Lett
Data Structures for Efficient Broker Implementation
Creators: name: Tomasic, Anthony
name: Gravano, Louis
name: Lue, Calvin
name: Schwarz, Peter
name: Haas, Laura
Publisher: name: Carnegie Mellon University
Year: 1997
Subjects: subject: 80399 Computer Software not elsewhere classified
subject: FOS: Computer and information sciences

description: With the profusion of text databases on the Internet, it is becoming increasingly hard to find the most useful databases for a given query. To attack this problem, several existing and proposed systems employ brokers to direct user queries, using a local database of summary information about the available databases. This summary information must effectively distinguish relevant databases, and must be compact while allowing efficient access. We offer evidence that one broker, GlOSS, can be effective at locating databases of interest even in a system of hundreds of databases, and examine the performance of accessing the GlOSS summaries for two promising storage methods: the grid file and partitioned hashing. We show that both methods can be tuned to provide good performance for a particular workload (within a broad range of workloads), and discuss the tradeoffs between the two data structures. As a side effect of our work, we show that grid files are more broadly applicable than previously thought; in particular, we show that by varying the policies used to construct the grid file we can provide good performance for a wide range of workloads even when storing highly skewed data.
Study of the process $e^+e^- \to π^+π^-η$ using initial state radiation
Creators: name: The BABAR Collaboration
Publisher: name: arXiv
Year: 2018
Subjects: subject: High Energy Physics - Experiment (hep-ex)
subject: FOS: Physical sciences

description: We study the process $e^+e^- \to π^+π^-ηγ$, where the photon is radiated from the initial state. About 8000 fully reconstructed events of this process are selected from the BaBar data sample with an integrated luminosity of 469~fb$^{-1}$. Using the $π^+π^-η$ invariant mass spectrum we measure the $e^+e^- \to π^+π^-η$ cross section in the $e^+e^-$ center-of-mass energy range from 1.15 to 3.5 GeV. The cross section is well described by the Vector-Meson Dominance model with four $ρ$-like states. We observe $49\pm9$ events of the $J/ψ$ decay to $π^+π^-η$, and measure the product $Γ_{J/Ψ\to e^+e^-} \text{B}_{J/Ψ\to π^+π^-η} = 2.34 \pm 0.43_{\text{stat}} \pm 0.16_{\text{syst}}$~eV.
description: 17 pages, 21 postscript figues, submitted to Phys. Rev. D
The CODEX-ESPRESSO experiment: cosmic dynamics, fundamental physics, planets and much more..
Creators: name: Cristiani, S.
name: Avila, G.
name: Bonifacio, P.
name: Bouchy, F.
name: Carswell, B.
name: D'Odorico, S.
name: D'Odorico, V.
name: Delabre, B.
name: Dekker, H.
name: Dessauges, M.
name: Dimarcantonio, P.
name: Garcia-Lopez, R.
name: Grazian, A.
name: Haehnelt, M.
name: Herreros, J. M.
name: Israelian, G.
name: Levshakov, S.
name: Liske, J.
name: Lovis, C.
name: Manescau, A.
name: Martin, E.
name: Mayor, M.
name: Megevand, D.
name: Molaro, P.
name: Murphy, M.
name: Pasquini, L.
name: Pepe, F.
name: Perez, J.
name: Queloz, D.
name: Rebolo, R.
name: Santin, P.
name: Shaver, P.
name: Span, P.
name: Udry, S.
name: Vanzella, E.
name: Viel, M.
name: Zapatero, M. R.
name: Zerbi, F.
name: Zucker, S.
Publisher: name: arXiv
Year: 2007
Subjects: subject: Astrophysics (astro-ph)
subject: FOS: Physical sciences

description: CODEX, a high resolution, super-stable spectrograph to be fed by the E-ELT, the most powerful telescope ever conceived, will for the first time provide the possibility of directly measuring the change of the expansion rate of the Universe with time and much more, from the variability of fundamental constants to the search for other earths. A study for the implementation at the VLT of a precursor of CODEX, dubbed ESPRESSO, is presently carried out by a collaboration including ESO, IAC, INAF, IoA Cambridge and Observatoire de Geneve. The present talk is focused on the cosmological aspects of the experiment.
description: 6 pages Latex, to appear in the proceedings of `A Century of Cosmology', S. Servolo, August 2007, to be published in Il Nuovo Cimento
Improving the Process-Variation Tolerance of Digital Circuits Using Gate Sizing and Statistical Techniques
Creators: name: Neiroukh, Osama
name: Song, Xiaoyu
Publisher: name: arXiv
Year: 2007
Subjects: subject: Hardware Architecture (cs.AR)
subject: FOS: Computer and information sciences

description: A new approach for enhancing the process-variation tolerance of digital circuits is described. We extend recent advances in statistical timing analysis into an optimization framework. Our objective is to reduce the performance variance of a technology-mapped circuit where delays across elements are represented by random variables which capture the manufacturing variations. We introduce the notion of statistical critical paths, which account for both means and variances of performance variation. An optimization engine is used to size gates with a goal of reducing the timing variance along the statistical critical paths. We apply a pair of nested statistical analysis methods deploying a slower more accurate approach for tracking statistical critical paths and a fast engine for evaluation of gate size assignments. We derive a new approximation for the max operation on random variables which is deployed for the faster inner engine. Circuit optimization is carried out using a gain-based algorithm that terminates when constraints are satisfied or no further improvements can be made. We show optimization results that demonstrate an average of 72% reduction in performance variation at the expense of average 20% increase in design area.
description: Submitted on behalf of EDAA (http://www.edaa.com/)
Biology of Applied Digital Ecosystems
Creators: name: Briscoe, G.
name: Sadedin, S.
name: Paperin, G.
Publisher: name: arXiv
Year: 2007
Subjects: subject: Neural and Evolutionary Computing (cs.NE)
subject: Multiagent Systems (cs.MA)
subject: FOS: Computer and information sciences

description: A primary motivation for our research in Digital Ecosystems is the desire to exploit the self-organising properties of biological ecosystems. Ecosystems are thought to be robust, scalable architectures that can automatically solve complex, dynamic problems. However, the biological processes that contribute to these properties have not been made explicit in Digital Ecosystems research. Here, we discuss how biological properties contribute to the self-organising features of biological ecosystems, including population dynamics, evolution, a complex dynamic environment, and spatial distributions for generating local interactions. The potential for exploiting these properties in artificial systems is then considered. We suggest that several key features of biological ecosystems have not been fully explored in existing digital ecosystems, and discuss how mimicking these features may assist in developing robust, scalable self-organising architectures. An example architecture, the Digital Ecosystem, is considered in detail. The Digital Ecosystem is then measured experimentally through simulations, with measures originating from theoretical ecology, to confirm its likeness to a biological ecosystem. Including the responsiveness to requests for applications from the user base, as a measure of the 'ecological succession' (development).
description: 9 pages, 4 figure, conference
Single-particle Relaxation Time in Doped Semiconductors beyond the Born Approximation
Creators: name: Marchetti, Gionni
Publisher: name: arXiv
Year: 2018
Subjects: subject: Materials Science (cond-mat.mtrl-sci)
subject: FOS: Physical sciences

description: We compare the magnitudes of the single-particle relaxation time accurately computed by the variable phase approach are with those computed in the first Born approximation for doped semiconductors such as Si and GaAs, assuming that the Coulomb impurities are randomly distributed centers. We find that for typical dopant concentrations in Si the Born approximation can overestimate the single-particle relaxation time by roughly 40\% and underestimate it by roughly 30\%. It is shown that in the case of GaAs the discrepancies are typically less severe. Our analysis shows that in general these large discrepancies in Si arise from strong violations of the Friedel sum rule. This breakdown occurs in a range of doping densities for which the random phase approximation starts to break down. Moreover, our results suggest that a multi-ion correction to the electron-impurity scattering is needed for high dopant concentrations.
description: 8 pages, 6 figures, final version accepted for publication by J. Appl. Physics
title: ADCO, Ordre cistercien et abbaye de Cîteaux : comptes pour l'ordre (1337-1347), comptes du boursier (1377-1402) (11 H 1160), f. 00421
Creators: name: de la Côte-d'Or, Archives départementales
name: Archives Départementales De La Côte-D'Or
name: Petot, Frédérique
name: Projet CBMA
name: CBMA/CG21/F.PETOT/2017
name: Petot, Frédéric
Publisher: name: NAKALA - https://nakala.fr (Huma-Num - CNRS)
publisherIdentifier: https://ror.org/04ces3204
publisherIdentifierScheme: ROR
Year: 2020
Subjects: subject: Corpus Burgundiae Medii Aevi
subject: Chartes de la Bourgogne du Moyen Âge
subject: LaMOP
subject: Laboratoire de Médiévistique Occidentale de Paris
subject: comptes

description: Ordre cistercien et abbaye de Cîteaux : comptes pour l'ordre (1337-1347), comptes du boursier (1377-1402), Archives départementales de la Côte-d'Or, (11 H 1160). Numérisation en mode image.
description: Relation: http://www.cbma-project.eu/
description: Bibliographic citation: Ordre cistercien et abbaye de Cîteaux : comptes pour l'ordre (1337-1347), comptes du boursier (1377-1402), Archives départementales de la Côte-d'Or, (11 H 1160), f. 00421, in Projet CBMA - Corpus Burgundiae Medii Aevi \[Ressource en ligne\], https:// manuscrits.cbma-project.eu/
description: Provenance: abbaye de Cîteaux
description: Provenance: http://www.wikidata.org/entity/Q843261
description: Provenance: https://www.geonames.org/3024876
description: Provenance: http://www.idref.fr/030974844/id
description: Provenance: https://catalogue.bnf.fr/ark:/12148/cb12228351v
РАЗВИТИЕ ТЕХНОЛОГИЙ И ОТКРЫТИЕ НАУК
Creators: name: Абдувалиев Мунарбек Насиридинович Студент Ошского государственного университета
Publisher: name: Zenodo
Year: 2024

description: современное общество переживает эпоху бурного развития технологий и научных открытий, оказывающих глубокое влияние на все стороны нашей жизни. В данной статье мы рассмотрим основные направления этого развития, его влияние на общество и его дальнейшие перспективы.

Ключевые слова: технологии, нанотехнологии, новые технологии, искусственный интеллект, человек.