Let G be a finite group, let V be an FG-module of finite dimension d, and denote by β(V ,G) the minimal number m such that the invariant ring S(V ) is generated by finitely many elements of degree at most m. A classical result of E. Noether says that β(V ,G) 6 |G| provided that charF is coprime to |G|!. If charF divides |G|, then no bounds for β(V ,G) are known except for very special choices o...

The power conversion efficiency of the market-dominating silicon photovoltaics approaches its theoretical limit. Bifacial solar operation with harvesting additional light impinging on module back and perovskite/silicon tandem device architecture are among most promising for further increasing energy yield from a limited area. Herein, output cells in monofacial bifacial is calculated, first time...

In this paper, we introduce a new problem, called Top-k SAT, that consists in enumerating the Top-k models of a propositional formula. A Top-k model is defined as a model with less than k models preferred to it with respect to a preference relation. We show that Top-k SAT generalizes two well-known problems: the partial Max-SAT problem and the problem of computing minimal models. Moreover, we p...

The Square Kilometre Array (SKA) is the largest radio interferometer under construction in world. Its immense amount of visibility data poses a considerable challenge to subsequent processing by science processor (SDP). Baseline dependent averaging (BDA), which reduces based on baseline distribution interferometer, has become focus SKA SDP development. This paper developed and implemented full-...

This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and knapsack. For a constant number of scenarios, we establish fully polynomial-time approximation schemes for the min-max versions of these problems, using relationships between multi-objective and min-max optimization. Us...

We characterized the level of risk of boll weevil, Anthonomus grandis grandis Boheman, reintroduction to an eradication zone posed by dispersal from cotton modules during and after transport to the gin. Mark-release-recapture experiments in August and September in Texas indicated that most weevils disperse rapidly from the module surface, temperature permitting, unless confined under a module t...

Reconfiguration allows a self-reconfiguring modular robot to adapt to its environment. The reconfiguration planning problem is one of the key algorithmic challenges in realizing self-reconfiguration. Many existing successful approaches rely on grouping modules together to act as meta-modules. However, we are interested in reconfiguration planning that does not impose fixed meta-module relations...

The editorial materials in top medical and public health journals are opportunities for experts to offer thoughts that might influence the trajectory of the field. To date, while some studies have examined gender bias in the publication of editorial materials in medical journals, none have studied public health journals. In this perspective, we studied the gender ratio ...

We study the existence of integer solutions to max-linear optimization problems. Specifically, we show that, in a generic case, the integer max-linear optimization problem can be solved in strongly polynomial time. This extends results from our previous papers where polynomial methods for this generic case were given.