Miracle-dz/UniFAR-FTUs huggingface dataset:
On the dimension and multiplicity of local cohomology modules

Abstract This paper is concerned with a finitely generated module M over a (commutative Noetherian) local ring R. In the case when R is a homomorphic image of a Gorenstein local ring, one can use the well-known associativity formula for multiplicities, together with local duality and Matlis duality, to produce analogous associativity formulae for the local cohomology modules of M with respect to the maximal ideal. The main purpose of this paper is to show that these formulae also hold in the case when R is universally catenary and such that all its formal fibres are Cohen–Macaulay. These formulae involve certain subsets of the spectrum of R called the pseudosupports of M; these pseudo-supports are closed in the Zariski topology when R is universally catenary and has the property that all its formal fibres are Cohen–Macaulay. However, examples are provided to show that, in general, these pseudo-supports need not be closed. We are able to conclude that the above-mentioned associativity formulae for local cohomology modules do not hold over all local rings.
Computation of Combined Refraction — Diffraction

This paper treats the derivation of a two-dimensional differential equation, which describes the phenomenon of combined refraction - diffraction for simple harmonic waves, and a method of solving this equation. The equation is derived with the aid of a small parameter development, and the method of solution is based on the finite element technique, together with a source distribution method.
Fast Multipole Method for 3-D elastodynamic boundary integral equations. Application to seismic wave propagation

Simulating wave propagation in 3D configurations is becoming a very active area of research. The main advantage of the BEM is that only the domain boundaries are discretized. As a result, this method is well suited to dealing with unbounded domains. However, the standard BEM leads to fully-populated matrices, which results in high computational costs in CPU time and memory requirements. The Fast Multipole Method (FMM) has dramatically improved the capabilities of BEMs for many areas of application. In this thesis, the FMM is extended to 3D frequency-domain elastodynamics in homogeneous and piecewise-homogeneous media (using in the latter case a FMM-based BE-BE coupling). Improvements of the present FM-BEM are also presented: preconditioning, reduction of the number of moments, and formulation of a multipole expansion for the half space fundamental solutions. Seismological applications are given for canonical problems and the Grenoble valley case.
Self and Society: A Symbolic Interactionist Social Psychology

IN THIS SECTION: 1. ) BRIEF 2. ) COMPREHENSIVE BRIEF TABLE OF CONTENTS: Chapter 1 Introducing Social Psychology and Symbolic Interactionism Chapter 2 Basic Concepts of Symbolic Interactionism Chapter 3 Identity, Social Settings and the Self Chapter 4 Defining Reality and Accounting for Behavior Chapter 5 Understanding and Constructing Social Order Chapter 6 Applications of the Symbolic Interactionist Perspective COMPREHENSIVE TABLE OF CONTENTS: Chapter 1 Introducing Social Psychology and Symbolic Interactionism What is Social Psychology? What is Symbolic Interactionism? Other Theoretical Approaches Learning Theory Psychoanalytic Theory Exchange Theory Phenomenology and Ethnomethodology Social Cognition Social Constructionism Postmodernism Major Tenets of Symbolic Interactionism Chapter 2 Basic Concepts of Symbolic Interactionism Symbols The Nature of Symbols The Consequences of Symbols Objects What is an Object? Objects and Language Acts and Social Acts Phases of the Act Self and the Control of Behavior Self as Object Self as Process Roles and the Definition of Situations Situations Role Role Making and Role Taking Role Taking as a Generalized Skill The Place of Emotions Chapter 3 Identity, Social Settings and the Self Learning the Social World Stages of Socialization Everyday Experience, Self and Impression Management Performances as Cumulative Expectations Conning Consciousness and Individual Agency Identity: The Self as a Social Object How We Produce Situated Identities The Experience of Situated Identity Social and Personal Identity Social Identity Personal Identity Self-Image: Knowing the Self Self-Esteem The Self, Motive, and Motivation Identity and Motivation Self-Esteem and Motivation The Self and the Social Order Limitations on the Choice of Roles Limitations on the Choice of Others Limitations on the Choice of Stories The Self in Contemporary Society Chapter 4 Defining Reality and Accounting for Behavior Role-Making and Role-Taking in Routine Situations Reality Is Not Just There-We Define What Is Real The Cognitive Bases of Role Making and Role Taking Typification Cognitive Theories and Inferential Heuristics Causality Means and Ends Normative Standards Substantive Congruency Aligning Actions Disclaimers Accounts Emotions and Social Interaction Constraint and Social Interaction Chapter 5 Understanding and Constructing Social Order Social Order as Coordinated Activity Influence Creating Social Bonds Solving Problems and Trust The Negotiated Order Talking Explaining Disorder Social Problems Chapter 6 Applications of the Symbolic Interactionist Perspective Variations on Total Institutions
Error estimates for the finite-element approximation of a semilinear elliptic control problem

We consider the finite- element approxim ation of a distributed optimal control problem govemed by a semilinea r ellip­ tic partial differential equation, where pointwise constraints on the control are given. We prove the existence of local approximate so­ lutions converging to a given lo cal reference solu tion. Moreover, we derive error estimates for local solutions in the maximum nonn.
Tractable reasoning in knowledge representation systems

This dissertation addresses some problems raised by the well-known intractability of deductive reasoning in even moderately expressive knowledge representation systems. Starting from boolean constraint propagation (BCP), a previously known linear-time incomplete reasoner for clausal propositional theories, we develop fact propagation (FP) to deal with non-clausal theories, after motivating the need for such an extension. FP is specified using a confluent rewriting systems, for which we present an algorithm that has quadratic-time complexity in general, but is still linear-time for clausal theories. FP is the only known tractable extension of BCP to non-clausal theories; we prove that it performs strictly more inferences than CNF-BCP, a previously-proposed extension of BCP to non-clausal theories. We generalize a refutation reasoner based on FP to a family of sound and tractable reasoners that are "increasingly complete" for propositional theories. These can be used for anytime reasoning, i.e., they provide partial answers even if they are stopped prematurely, and the "completeness" of the answer improves with the time used in computing it. A fixpoint construction based on FP gives an alternate characterization of the reasoners in this family, and is used to define a transformation of arbitrary theories into logically-equivalent "vivid" theories--ones for which our FP algorithm is complete. Our final contribution is to the description of tractable classes of reasoning problems. Based on FP, we develop a new property, called bounded intricacy, which is shared by a variety of tractable classes that were previously presented, for example, in the areas of propositional satisfiability, constraint satisfaction, and OR-databases. Although proving bounded intricacy for these classes requires domain-specific techniques (which are based on the original tractability proofs), bounded intricacy is one more tool available for showing that a family of problems arising in some application is tractable. As we demonstrate in the case of constraint satisfaction and disjunctive logic programs, bounded intricacy can also be used to uncover new tractable classes.
Measurement of the charge asymmetry in top quark pairproduction in pp collisions at √s = 7 TeV using the ATLASdetector

A measurement of the top-antitop production charge asymmetry A_C is presented using data corresponding to an integrated luminosity of 1.04 fb^(−1) of pp collisions at √s = 7 TeV collected by the ATLAS detector at the LHC. Events are selected with a single lepton (electron or muon), missing transverse momentum and at least four jets of which at least one jet is identified as coming from a b-quark. A kinematic fit is used to reconstruct the tt event topology. After background subtraction, a Bayesian unfolding procedure is performed to correct for acceptance and detector effects. The measured value of A_C is A_C =−00190028 (stat)0024 (syst), consistent with the prediction from the MC@NLO Monte Carlo generator of A_C =0.006±0.002. Measurements of A_C in two ranges of invariant mass of the top-antitop pair are also shown.
Partial Information Framework: Basic Theory and Applications

PARTIAL INFORMATION FRAMEWORK: BASIC THEORY AND APPLICATIONS Ville A. Satopää Shane T. Jensen Lyle H. Ungar Many real-world decisions depend on accurate predictions of some future outcome. In such cases the decision-maker often seeks to consult multiple people or/and models for their forecasts. These forecasts are then aggregated into a consensus that is inputted in the final decision-making process. Principled aggregation requires an understanding of why the forecasts are different. Historically, such forecast heterogeneity has been explained by measurement error. This dissertation, however, first shows that measurement error is not appropriate for modeling forecast heterogeneity and then introduces information diversity as a more appropriate yet fundamentally different alternative. Under information diversity differences in the forecasts stem purely from differences in the information that is used in the forecasts. This is made mathematically precise in a new modeling framework called the partial information framework. At its most general level, the partial information framework is a very reasonable model of multiple forecasts and hence offers an ideal platform for theoretical analysis. For one, it explains the empirical phenomenon known as extremization. This is a popular technique that often improves the out-of-sample performance of simple aggregators, such as the average or median, by transforming them directly away from the marginal mean of the outcome. Unfortunately, the general framework is too abstract for practical applications. To apply the framework in practice one needs to choose a parametric distribution for the forecasts and outcome. This dissertation motivates and chooses the multivariate Gaussian distribution. The result, known as the Gaussian partial information model, is a very close yet practical specification of the framework. The optimal aggregator under the Gaussian model is shown to outperform the state-of-the-art measurement error aggregators on both synthetic and many different types of real-world forecasts.
Numerical simulations of the stratified oceanic bottom boundary layer

Numerical simulations are used to consider several problems relevant to the turbulent oceanic bottom boundary layer. In the first study, stratified open channel flow is considered with thermal boundary conditions chosen to approximate a shallow sea. Specifically, a constant heat flux is applied at the free surface and the lower wall is assumed to be adiabatic. When the surface heat flux is strong, turbulent upwellings of low speed fluid from near the lower wall are inhibited by the stable stratification. Subsequent studies consider a stratified bottom Ekman layer over a non-sloping lower wall. The influence of the free surface is removed by using an open boundary condition at the top of the computational domain. Particular attention is paid to the influence of the outer layer stratification on the boundary layer structure. When the density field is initialized with a linear profile, a turbulent mixed layer forms near the wall, which is separated from the outer layer by a strongly stable pycnocline. It is found that the bottom stress is not strongly affected by the outer layer stratification. However, stratification reduces turbulent transport to the outer layer and strongly limits the boundary layer height. The mean shear at the top of the boundary layer is enhanced when the outer layer is stratified, and this shear is strong enough to cause intermittent instabilities above the pycnocline. Turbulence-generated internal gravity waves are observed in the outer layer with a relatively narrow frequency range. An explanation for frequency content of these waves is proposed, starting with an observed broad-banded turbulent spectrum and invoking linear viscous decay to explain the preferential damping of low and high frequency waves. During the course of this work, an open-source computational fluid dynamics code has been developed with a number of advanced features including scalar advection, subgrid-scale models for large -eddy simulation, and distributed memory parallelism
The Physics and Evolution of Active Galactic Nuclei

Preface 1. Observations of active galactic nuclei 2. Nonthermal radiation processes 3. Black holes 4. Accretion disks 5. Physical processes in AGN gas and dust 6. The AGN family 7. Main components of AGN 8. Host galaxies of AGN 9. Formation and evolution of AGN 10. Outstanding questions References Index.
The Future Of Work A Guide To A Changing Society

the future of work a guide to a changing society is available in our book collection an online access to it is set as public so you can get it instantly. Our book servers spans in multiple countries, allowing you to get the most less latency time to download any of our books like this one. Kindly say, the the future of work a guide to a changing society is universally compatible with any devices to read.
Understanding Human Values Individual And Societal

understanding human values individual and societal is available in our book collection an online access to it is set as public so you can get it instantly. Our digital library saves in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Kindly say, the understanding human values individual and societal is universally compatible with any devices to read.
Getting directed Hamilton cycle twice faster

Consider the random graph process where we start with an empty graph on n vertices, and at time t, are given an edge et chosen uniformly at random among the edges which have not appeared so far. A classical result in random graph theory asserts that whp the graph becomes Hamiltonian at time (1=2+o(1))nlogn. On the contrary, if all the edges were directed randomly, then the graph has a directed Hamilton cycle whp only at time (1 + o(1))nlogn. In this paper we further study the directed case, and ask whether it is essential to have twice as many edges compared to the undirected case. More precisely, we ask if at time t, instead of a random direction one is allowed to choose the orientation of et, then whether it is possible or not to make the resulting directed graph Hamiltonian at time earlier than nlogn. The main result of our paper answers this question in the strongest possible way, by asserting that one can orient the edges on-line so that whp, the resulting graph has a directed Hamilton cycle exactly at the time at which the underlying graph is Hamiltonian.
Reections on \Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes"

A t-error-correcting code over a q-ary alphabet Fq is a set C ⊆ Fq such that for any received vector r ∈ Fq there is at most one vector c ∈ C that lies within a Hamming distance of t from r. The minimum distance of the code C is the minimum Hamming distance between any pair of distinct vectors c1, c2 ∈ C. In his seminal work introducing these concepts, Hamming pointed out that a code of minimum distance 2t+ 1 is a t-error-correcting code. It also pointed out the obvious fact that such a code is not a t′-error-correcting code for any t′ > t. We conclude that a code can correct half as many errors as its distance and no more. The mathematical correctness of the above statements are indisputable, yet the interpretation is quite debatable. If a message encoded with a t-error-correcting code ends up getting corrupted in t′ > t places, the decoder may simply throw it hands up in the air and cite the above paragraph. Or, in an alternate notion of decoding, called list decoding, proposed in the late 1950s by Elias [10] and Wozencraft [43], the decoder could try to output a list of codewords within distance t′ of the received vector. If t′ is not much larger than t and the errors are caused by a probabilistic (non-malicious) channel, then most likely this list would have only one element — the transmitted codeword. Even if the errors are caused by a malicious jammer, the list cannot contain too many codewords provided t′ is not too much larger than t. Thus, in either case, the receiver is in a better position to recover the transmitted codeword under the model of list decoding. List decoding was initiated mainly as a mathematical tool that allowed for a better understanding of some of the classical parameters of interest in information and coding theory. Elias [10] used this notion to get a better handle on the error-exponent in the strong forms of Shannon’s coding theorem. The notion also plays a dominant role in the Elias-Bassalygo [34, 4] upper bound on the rate of a code as a function of its relative distance. Through the decades the notion has continued to be investigated in a combinatorial context; and more recently has seen a spurt of algorithmic results. The paper being reflected on [23] was motivated by a gap between the combinatorial understanding of Reed-Solomon codes, and the known algorithmic performance. Below we summarize the combinatorial state of knowledge, and describe the main result of [23], and also use the opportunity to survey some of the rich body of algorithmic results on list decoding that have emerged in the recent past. We also muse upon some useful asymptotic perspectives that eased the way for some of this progress, and reflect on some possibilities for future work.
Grade point average assessment for metaheuristic GMPP techniques of partial shaded PV systems

Photovoltaic (PV) maximum power point tracker (MPPT) is compulsory in PV systems to improve its output power and efficiency. Conventional techniques can track the maximum power under uniform irradiances efficiently and accurately. Nevertheless, in case of partial shading conditions where multiple peaks are generated, these conventional techniques may stick at any local peak of the P – V curve of the PV energy systems. Metaheuristic techniques have been applied to PV energy systems to overcome this limitation, where most of these techniques can catch the global MPP (GMPP) easily and efficiently. In case of dynamic change of partial shading, most of these techniques need reinitialisation to disperse the search agents to look again for a new position and value of GMPP. This study introduces a brief description, assessment and evaluation for these techniques. In addition, it proposes a novel assessment criterion based on grade point average for evaluating and ranking the 20 famous metaheuristic and hybrid GMPP techniques. This evaluation methodology can help researchers, designer and decision maker to choose the best option for MPPT of dynamic change of partially shading PV energy systems.
Über einige Randintegrale der Elastomechanik

Ein bekanntes Theorem von E. Noether wird verwendet, um Aussagen uber das Verhalten linear-elastischer Felder auf den Bereichsrandern zu gewinnen. In Sonderfallen ergeben sich recht ubersichtliche Formeln, z. B. fur Balken, Platten, Umdrehungskorper und Rotationsschalen.
Firms’ size and use of information and communication technologies

There are strong arguments about the positive effect of information and communication technologies (ICTs) on companies’ performance. This effect is also extensive for micro and small enterprises (MSEs), which tend to adopt ICTs in lower levels in comparison with large companies. In this context, this paper has two goals: to analyze the effect of firms’ size on (a) the relationship between strategic planning and ICTs use; (b) the relationship between ICTs use and interaction with customers. The sample of the study comprises 171 Brazilian MSEs, and we used confirmatory factor analysis and structural equation modeling to test our hypotheses. The main results indicated that even in small companies, size is an important variable to explain the antecedents and consequents of ICTs use. The positive effect of ICTs use was stronger among small companies, reinforcing the relevance of technology for them.
Two Decades of Statistical Machine Translation

Statistical Machine Translation is the general term for the various data-driven methods that apply statistical models as the core mechanism to automatically translating from one language to another. Since the first practical approach was proposed in 1990, many attempts have been made to improve the state of the art. We review them here, make a clear clue of the achievements over the past twenty years, and point out a few promising directions.
Weak antilocalization in HgTe quantum wells with inverted energy spectra

The results of experimental study of the magnetoconductivity of 2D electron gas caused by suppression of the interference quantum correction in HgTe single quantum well heterostructure with the inverted energy spectrum are presented. It is shown that only the antilocalization magnetoconductivity is observed at the relatively high conductivity $\sigma>(20-30)G_0$, where $G_0= e^2/2\pi^2\hbar$. The antilocalization correction demonstrates a crossover from $0.5\ln{(\tau_\phi/\tau)}$ to $1.0\ln{(\tau_\phi/\tau)}$ behavior with the increasing conductivity or decreasing temperature (here $\tau_\phi$ and $\tau$ are the phase relaxation and transport relaxation times, respectively). It is interpreted as a result of crossover to the regime when the two chiral branches of the electron energy spectrum contribute to the weak antilocalization independently. At lower conductivity $\sigma<(20-30)G_0$, the magnetoconductivity behaves itself analogously to that in usual 2D systems with the fast spin relaxation: being negative in low magnetic field it becomes positive in higher one. We have found that the temperature dependences of the fitting parameter $\tau_\phi$ corresponding to the phase relaxation time demonstrate reasonable behavior, close to 1/T, over the whole conductivity range from $5G_0$ up to $130G_0$. However, the $\tau_\phi$ value remains practically independent of the conductivity in distinction to the conventional 2D systems with the simple energy spectrum, in which $\tau_\phi$ is enhanced with the conductivity.
Control Method for Phase-Shift Full-Bridge Center-Tapped Converters Using a Hybrid Fuzzy Sliding Mode Controller

This paper presents a control method for phase-shift full-bridge center-tapped (PSFB-CT) converters using hybrid fuzzy sliding mode controllers (SMCs). Conventionally, the output voltage of a PSFB-CT converter is controlled by using a proportional-integral (PI) controller. However, the dynamic characteristic of the converter is undesirable, and the converter is not robust to disturbances. In order to overcome these disadvantages, the SMC based on PI control has been applied for the PSFB-CT converter. However, there is a chattering problem when the SMC gain is increased to improve the dynamic characteristic. In this paper, a control method for the PSFB-CT converter using fuzzy logic control is proposed. By varying the gain of the SMC through the fuzzy logic control, not only can the dynamic characteristic of the PSFB-CT converter be improved, but the chattering problem can also be relieved. The effectiveness of the proposed control method for the PSFB-CT converter was verified by the simulation and experimental results.