Results 51 to 60 of about 5,484 (263)
Covering Numbers for Simple Algebraic Groups
AbstractLet G be a simple algebraic group over an algebraically closed field, and let C be a noncentral conjugacy class of G. The covering number cn(G,C) is defined to be the minimal k such that G = Ck, where Ck = {c1c2⋯ck : ci ∈ C}. We prove that $cn(G,C) \le c \frac {\dim G}{\dim C}$ c n (
Liebeck, M, Simion, I
openaire +2 more sources
Correcting the apparent priming effect resolves systematic biases in Asian rice fertilizer nitrogen accounting. Net soil retention drops below 7%, while 48% of fertilizer escapes, inflicting US$98.53 billion in annual reactive‐nitrogen damages. High‐resolution mapping uncovers N‐risk archetypes across 42% of the rice area, delivering a spatially ...
Xiuyun Liu +5 more
wiley +1 more source
We report the solid‐state ball milling, a traditional, reliable, mass‐productive material processing, to prepare the air‐stable and dual‐phase GeSe2‐x nanoparticles with extended photodetection feasibility toward optical‐wavelength regions. We further display photonic multi‐valued logic (MVL) circuit through the employment of a hybrid PMMA/GeSe2‐x ...
An‐Ting Tsai +8 more
wiley +1 more source
Path Transmissibility Analysis Considering Two Types of Correlations in Hydropower Stations
A new vibration model is built by introducing the head-cover vibration transfer path based on a previous analysis of the vertical vibration model for hydropower station units and powerhouses.
Baoping Zhi, Zhenyue Ma
doaj +1 more source
Cleaning Data With Selection Rules
In this paper, we propose and study a type of tuple-level constraint that arises from the selection operator $\sigma $ of relational algebra and that closely resembles the concepts of tuple-level denial constraints.
Toon Boeckling +2 more
doaj +1 more source
Updatable Closed‐Form Evaluation of Arbitrarily Complex Multiport Network Connections
The inverse design of electrically large wave devices often uses reduced‐order multiport models with discrete optimization, requiring many evaluations of complex interconnections between subsystems that differ only in a few blocks. This paper introduces a closed‐form framework enabling efficient Woodbury low‐rank updates of related, previous ...
Hugo Prod'homme, Philipp del Hougne
wiley +1 more source
Automatic Deduction in Dynamic Geometry using Sage [PDF]
We present a symbolic tool that provides robust algebraic methods to handle automatic deduction tasks for a dynamic geometry construction. The main prototype has been developed as two different worksheets for the open source computer algebra system Sage,
Francisco Botana, Miguel A. Abánades
doaj +1 more source
Low‐Power Control Of Resistance Switching Transitions in First‐Order Memristors
Joule losses are a serious concern in modern integrated circuit design. In this regard, minimizing the energy necessary for programming memristors should be handled with care. This manuscript presents an optimal control framework, allowing to derive energy‐efficient programming voltage protocols for resistance switching devices. Following this approach,
Valeriy A. Slipko +3 more
wiley +1 more source
On the dimension of the minimal vertex cover semigroup ring of an unmixed bipartite graph
In a paper in 2008, Herzog, Hibi and Ohsugi introduced and studied the semigroup ring associated to the set of minimal vertex covers of an unmixed bipartite graph.
Cristina Bertone, Vincenzo Micale
doaj
A heuristic method for bi-decomposition of partial Boolean functions
The problem of decomposition of a Boolean function is to represent a given Boolean function in the form of a superposition of some Boolean functions whose number of arguments are less than the number of given function.
Yu. V. Pottosin
doaj +1 more source

