527,066 Hits in 4.3 sec

Rethinking Inversion in English Syntax

Ellie Boyadzhieva
2018 English Studies at NBU  
This aim is achieved through the application of the terms operator and operator fronting in the cases of both obligatory and reversive inversion.  ...  The article deals with some internal theoretical controversies in the concept and the use of the term inversion in English syntax as used in some descriptive and most pedagogical grammars of Modern English  ...  Operator fronting is triggered by question formation and negative preposing. Both movements originate in the right periphery of the clause and affect the operator slot on their way to the front.  ... 
doi:10.33919/esnbu.18.1.3 fatcat:gqhtwhxnznhldnnzrpjxu7trcy

Page 3664 of Mathematical Reviews Vol. , Issue 97F [page]

1997 Mathematical Reviews  
Two appen- dices are provided, one giving brief descriptions of Fourier, La- place, Hankel and Mellin transforms and the other giving tables of Kontorovich-Lebedev and Mehler-Fock transforms.  ...  The third part deals with important integral transforms which are used in solving problems of applied mathematics and physics, their inversion formulae and other relations, and their ap- plication in solving  ... 

ROVER: A Framework for the Evolution of Relationships [chapter]

Kajal T. Claypool, Elke A. Rundensteiner, George T. Heineman
2000 Lecture Notes in Computer Science  
Rather we present a flexible schema evolution framework which allows the user to define new relationship transformations as well as to extend the existing ones.  ...  In this paper we present an approach that de-couples the constraints from the schema evolution code, thereby enabling their update without any re-coding effort.  ...  In recent years, research has begun to focus on the issues of supporting more complex schema evolution operations. Breche and Lerner [4, 11] studied the design of a set of more complex operations.  ... 
doi:10.1007/3-540-45393-8_30 fatcat:jltjbflfffbxng65ftwixifimq

On the treatment of uncertainty in experimentally measured frequency response functions

Joshua W R Meggitt
2018 Metrologia  
The importance of this correlation on the propagation of uncertainty is subsequently investigated as part of a numerical and experimental case study, where its influence on the inversion of an uncertain  ...  The uncertainty associated with their measurement is typically modelled on the simplified assumption that additive uncorrelated noise is present.  ...  Moorhouse and A.S. Elliott from The University of Salford, and A. Clot and R.S. Langley from The University of Cambridge for their involvement in this work.  ... 
doi:10.1088/1681-7575/aadeeb fatcat:zroagq35w5hqzee63wcih5rwbe

Using fast matrix multiplication to find basic solutions

Peter A. Beling, Nimrod Megiddo
1998 Theoretical Computer Science  
Consequently, our complexity bounds in their most general form are a function of the complexity of matrix multiplication.  ...  Our technique, which is similar in spirit to that used by Vaidya to find the best complexity bounds for linear programming, is based on reducing much of the computation involved to matrix multiplication  ...  Acknowledgements We are grateful to the referees for many helpful suggestions, and particularly for pointing out the speedup that is possible using fast multiplication of rectangular matrices.  ... 
doi:10.1016/s0304-3975(98)00003-6 fatcat:s4u75vye6zarjkpkfo4w5mgy24

Page 121 of Automation and Remote Control Vol. 53, Issue 1 [page]

1992 Automation and Remote Control  
The paper also commented upon the need of finding inverse operators that can rea- lize such recounting for more complex system classes.  ...  The method is based on recounting the input and output signals of the tested system to the inputs and outputs of every block and comparing the obtained input-output block descriptions with their diagnostic  ... 


Solomon Khmelnik
2001 Zenodo  
As a result of this coding, arithmetic operations on complex numbers may be performed on a single data element which contains both real and imaginary data.  ...  the above described method and to perform complex number arithmetic operations.  ...  , and inversion) associated with arithmetic operations.  ... 
doi:10.5281/zenodo.6479311 fatcat:cx5izks2bbg3fi23wt5fe5jmme

Reduced Computational Complexity Orthogonal Matching Pursuit Using a Novel Partitioned Inversion Technique for Compressive Sensing

Seonggeon Kim, Uihyun Yun, Jaehyuk Jang, Geunsu Seo, Jongjin Kang, Heung-No Lee, Minjae Lee
2018 Electronics  
While solving the least-squares (LS) problem in the OMP algorithm, the complexity of the matrix inversion operation at every loop is reduced by the proposed partitioned inversion that utilizes the inversion  ...  It operates with a sample period of 4 ns, signal reconstruction time of 27 μs, and peak signal to noise ratio (PSNR) of 30.26 dB.  ...  Our device is based on a 16-and 32-bit fixed-point complex operation.  ... 
doi:10.3390/electronics7090206 fatcat:pgghnwwpdrem5l57w7sh2telk4

Matrix Operations Design Tool for FPGA and VLSI Systems

Semih Aslan, Jafar Saniie
2016 Circuits and Systems  
These operations range from simple addition to more complex matrix operations such as LU and QR factorizations. The proposed platform can improve design time by reducing verification cycle.  ...  The RTL-based design and verification of one or more of these functions could be time-consuming.  ...  [6] for their valuable support.  ... 
doi:10.4236/cs.2016.72005 fatcat:uhsww5ebmbh25ln7qj57ejylci

Page 2297 of Mathematical Reviews Vol. , Issue 80F [page]

1980 Mathematical Reviews  
This leads to a concise description of the n-ary operations in the PROP 9X* @@*.  ...  The main theorem asserts that if @ is a theory with exactly one constant, then % @@ is completely determined by its unary and binary operations.  ... 

Complexity Analysis of H.264 Decoder for FPGA Design

Tuomas Lindroth, Nastooh Avessta, Jukka Teuhola, Tiberiu Seceleanu
2006 2006 IEEE International Conference on Multimedia and Expo  
Here, we present the process flow of these parts using basic algebraic operators. The analysis of the required logic elements to implement the decoder, on various platforms, is presented.  ...  Since H.264 standard only specifies the syntax and semantics of the video stream and not the video codec itself, the selection process may be directed based upon the temporal complexity of different parts  ...  Inverse quantization has three different variations: one for residual, one for luma DC coefficients and one for chroma DC coefficients.  ... 
doi:10.1109/icme.2006.262765 dblp:conf/icmcs/LindrothATS06 fatcat:j6ejdjuaq5cc3ce5opm6u5pgzq

Improving Usability of Interactive Graphics Specification and Implementation with Picking Views and Inverse Transformations [article]

Stéphane Conversy
2011 arXiv   pre-print
The architecture is based on the use of picking views and inverse transforms from the graphics to the data.  ...  This paper shows how the MDPC architecture improves the usability of the specification and the implementation of graphical interaction.  ...  Note the symmetry or anti-symmetry of functions and their inverse.  ... 
arXiv:1105.2890v1 fatcat:encu7fx3tncr7lwxpcvs5w7bam

Inverse Problems Are Solvable on Real Number Signal Processing Hardware [article]

Holger Boche and Adalbert Fono and Gitta Kutyniok
2022 arXiv   pre-print
The study of this question is inherently related to the underlying computing model and hardware, since the admissible operations of any implemented algorithm are defined by the computing model and the  ...  Thus, the algorithmic solvability of inverse problems is of significant importance.  ...  Kutyniok was supported in part by the ONE Munich Strategy Forum (LMU Munich, TU Munich, and the Bavarian Ministery for Science and Art) as well as  ... 
arXiv:2204.02066v2 fatcat:efvvpd2z7bbkhdjdyme6eusiaa

Description Logics for Ontologies [chapter]

Ulrike Sattler
2003 Lecture Notes in Computer Science  
To give a broader view of DLs, some standard expressive means in DLs are mentioned as well as their modal logic counterparts and their effect on the complexity of the inference problems.  ...  It is clear that, to be of use as an ontology language, a description logic has to provide adequate expressive power, and we are thus concerned with the well-known trade-off between complexity and expressiveness  ...  modal logic equivalent and their influence on the computational complexity.  ... 
doi:10.1007/978-3-540-45091-7_7 fatcat:k6yz5bk5zveffiorjohakrqfay

Formal Description for SaaS Undo [chapter]

Hernán Merlino, Oscar Dieste, Patricia Pesado, Ramón García-Martínez
2013 Lecture Notes in Business Information Processing  
We present a formal description when to use this service under alignments of software as a service.  ...  The use of services strategy simplifies greatly the design of the undo process and encapsulates most of the functionalities required.  ...  The research reported in this paper has been partially funded by grants UNLa-SCyT-33A167 and UNLa-SCyT-33B112 of the National University of Lanus (Argentine) and by grants TIN2008-00555 and HD2008-00046  ... 
doi:10.1007/978-3-642-39336-5_22 fatcat:cixlt7z32nbzfc2446alfgctt4
« Previous Showing results 1 — 15 out of 527,066 results