Search results for "Implicit"
showing 10 items of 287 documents
Stock Market Bubbles and Monetary Policy Effectiveness
2016
In this paper we provide evidence on the response of stock prices to monetary policy shocks, but conditioning the analysis to the direction of the monetary policy surprises and to the business conditions. We follow a two steps approach: First we use the SVAR approach to identify monetary policy shocks; and then we conduct regression analyses of contemporary stock market returns and monetary policy shocks in order to extract the implicit relationship between these variables in the four scenarios defined. Our results show that monetary policy do not impact on stock market returns in a significant form in the scenario defined by a positive shock and an expansion period, coinciding the poor eff…
GLOBAL DELAY TIME FOR GENERAL DISTRIBUTED NETWORKS WITH APPLICATIONS TO TIMING ANALYSIS OF DIGITAL MOS INTEGRATED CIRCUITS
1989
We consider here a general nerwork composed by n‐distributed parameters lines (with telegraph‐equations models) and m‐capacitors, all connected by a resistive multiport. An asymptotic stability property drives us to define and evaluate a global parameter (“λ‐delay time”) which describes the speed of signals propagation through the network. Because of its simplicity of calculation and its tightness, the given upper bound of the λ‐delay time is useful in timing analysis of MOS integrated chips.
Brevi considerazioni sulle c.d. deliberazioni implicite: superamento della categoria?
2010
Il tema dell’ammissibilità, nel diritto societario italiano, della categoria delle c.d. deliberazioni assembleari implicite è stato autorevolmente studiato in epoca ormai non più recente. Scopo del presente articolo è quello di svolgere alcune, brevi riflessioni sulla problematica in esame, avendo particolare riguardo al modello della Società per azioni. Le considerazioni in oggetto si sviluppano da una sentenza resa dalla Corte di Cassazione, a Sezioni unite, nell’agosto 2008 (Cass. s. u. 29- 08- 2008, n. 21933). Con questa decisione si è stabilito che l’approvazione da parte dell’assemblea del bilancio d’esercizio di una società di capitali contenente una posta relativa al compenso percep…
Criteria for the solubility and non-simplicity of finite groups
2005
Abstract Some criteria of the non-simplicity of a finite group by graph theoretical terms are derived. This is then used to establish conditions under which a finite group is soluble.
Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams
2017
We consider Quantum OBDD model. It is restricted version of read-once Quantum Branching Programs, with respect to “width” complexity. It is known that maximal complexity gap between deterministic and quantum model is exponential. But there are few examples of such functions. We present method (called “reordering”), which allows to build Boolean function g from Boolean Function f, such that if for f we have gap between quantum and deterministic OBDD complexity for natural order of variables, then we have almost the same gap for function g, but for any order. Using it we construct the total function REQ which deterministic OBDD complexity is \(2^{\varOmega (n/log n)}\) and present quantum OBD…
Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs
2014
In the paper we investigate a model for computing of Boolean functions – Ordered Binary Decision Diagrams (OBDDs), which is a restricted version of Branching Programs. We present several results on the comparative complexity for several variants of OBDD models. We present some results on the comparative complexity of classical and quantum OBDDs. We consider a partial function depending on a parameter k such that for any k > 0 this function is computed by an exact quantum OBDD of width 2, but any classical OBDD (deterministic or stable bounded-error probabilistic) needs width 2 k + 1. We consider quantum and classical nondeterminism. We show that quantum nondeterminism can be more efficient …
Unified Metrical Common Fixed Point Theorems in 2-Metric Spaces via an Implicit Relation
2013
We prove some common fixed point theorems for two pairs of weakly compatible mappings in 2-metric spaces via an implicit relation. As an application to our main result, we derive Bryant's type generalized fixed point theorem for four finite families of self-mappings which can be utilized to derive common fixed point theorems involving any finite number of mappings. Our results improve and extend a host of previously known results. Moreover, we study the existence of solutions of a nonlinear integral equation.
Hoffman's Error Bound, Local Controllability, and Sensitivity Analysis
2000
Our aim is to present sufficient conditions ensuring Hoffman's error bound for lower semicontinuous nonconvex inequality systems and to analyze its impact on the local controllability, implicit function theorem for (non-Lipschitz) multivalued mappings, generalized equations (variational inequalities), and sensitivity analysis and on other problems like Lipschitzian properties of polyhedral multivalued mappings as well as weak sharp minima or linear conditioning. We show how the information about our sufficient conditions can be used to provide a computable constant such that Hoffman's error bound holds. We also show that this error bound is nothing but the classical Farkas lemma for linear …
Common fixed points of mappings satisfying implicit contractive conditions
2012
In this article we obtain, in the setting of metric spaces or ordered metric spaces, coincidence point, and common fixed point theorems for self-mappings in a general class of contractions defined by an implicit relation. Our results unify, extend, generalize many related common fixed point theorems from the literature. Mathematics Subject Classification (2000): 47H10, 54H25.
High-fidelity analysis of multilayered shells with cut-outs via the discontinuous Galerkin method
2021
Abstract A novel numerical method for the analysis of multilayered shells with cut-outs is presented. In the proposed approach, the shell geometry is represented via either analytical functions or NURBS parametrizations , while generally-shaped cut-outs are defined implicitly within the shell modelling domain via a level set function . The multilayered shell problem is addressed via the Equivalent-Single-Layer approach whereby high-order polynomial functions are employed to approximate the covariant components of the displacement field throughout the shell thickness. The shell governing equations are then derived from the Principle of Virtual Displacements of three-dimensional elasticity an…