نتایج جستجو برای: quasi simple

تعداد نتایج: 535873  

Journal: :CoRR 2018
Danilo Gligoroski Kristian Gjøsteen Katina Kralevska

Orthogonal and quasi-orthogonal matrices have a long history of use in digital image processing, digital and wireless communications, cryptography and many other areas of computer science and coding theory. The practical benefits of using orthogonal matrices come from the fact that the computation of inverse matrices is avoided, by simply using the transpose of the orthogonal matrix. In this pa...

2005
SALVADOR HERNÁNDEZ

This paper deals mainly with the Chu duality of discrete groups. Among other results, we give sufficient conditions for an FC group to satisfy Chu duality and characterize when the Chu quasi-dual and the Takahashi quasi-dual of a group G coincide. As a consequence, it follows that when G is a weak sum of a family of finite simple groups, if the exponent of the groups in the family is bounded th...

Journal: :Mathematical Structures in Computer Science 2011
Mateusz Kostanek Pawel Waszkiewicz

We generalize the construction of the formal ball model for metric spaces due to A. Edalat and R. Heckmann to obtain computational models for separated Q-categories. We fully describe (a) Yoneda complete and (b) continuous Yoneda complete Q-categories via their formal ball models. Our results yield solutions to two open problems in the theory of quasi-metric spaces: we show that (a) a quasi-met...

2004
Luigi Malesani Leopoldo Rossetto Paolo Tenti Paolo Tomasin

The paper introduces the family of quasi-direct converters, i.e., forced-commutated adddac converters including small energy storage devices in the dc link. In particular, the case of three-phase to three-phase quasi-direct converter is considered. Since energy storage minimization calls for instantaneous inputloutput power balance, a proper control strategy is needed. The paper describes a sim...

Journal: :journal of algebra and related topics 2014
a. abbasi d. hassanzadeh-lelekaami

the notions of quasi-prime submodules and developed  zariski topology was introduced by the present authors in cite{ah10}. in this paper we use these notions to define a scheme. for an $r$-module $m$, let $x:={qin qspec(m) mid (q:_r m)inspec(r)}$. it is proved that $(x, mathcal{o}_x)$ is a locally ringed space. we study the morphism of locally ringed spaces induced by $r$-homomorphism $mrightar...

Journal: :ACS nano 2017
Huajun Chen You Seung Rim Isaac Caleb Wang Chao Li Bowen Zhu Mo Sun Mark S Goorsky Ximin He Yang Yang

Ultrasensitive field-effect transistor-based biosensors using quasi-two-dimensional metal oxide semiconductors were demonstrated. Quasi-two-dimensional low-dimensional metal oxide semiconductors were highly sensitive to electrical perturbations at the semiconductor-bio interface and showed competitive sensitivity compared with other nanomaterial-based biosensors. Also, the solution process made...

1997
Q Ni Y Yuan

In this paper we propose a subspace limited memory quasi-Newton method for solving large-scale optimization with simple bounds on the variables. The limited memory quasi-Newton method is used to update the variables with indices outside of the active set, while the projected gradient method is used to update the active variables. The search direction consists of three parts: a subspace quasi-Ne...

2004
A. Gehring S. Selberherr

We study the calculation of quasi-bound states in nMOS inversion channels and their impact on direct tunneling currents through the dielectric layer. For typical device parameters, the gate leakage in inversion is dominated by this tunneling component. However, a strong inaccuracy arises, if the eigenvalues of the closed system are used for the quasi-bound state tunneling current. We propose si...

2007
MARTIN W. LIEBECK

We present a black-box polynomial-time Monte Carlo algorithm which, given as input a quasi-simple group of Lie type, finds its characteristic.

Journal: :Math. Comput. 1997
Q. Ni Ya-Xiang Yuan

In this paper we propose a subspace limited memory quasi-Newton method for solving large-scale optimization with simple bounds on the variables. The limited memory quasi-Newton method is used to update the variables with indices outside of the active set, while the projected gradient method is used to update the active variables. The search direction consists of three parts: a subspace quasi-Ne...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید