the automatic assignment of protein secondary structure from three dimensional coordinates is an essentialstep in the characterization of protein structure.although, the recognition of secondary structures suchas alpha-helices and beta-sheets seem straightforward, but there are many different definitions, eachregarding different criteria. we have developed a newalgorithm for protein helix assig...

In this paper, we introduce and study a generalized Yosida approximation operator associated to H(·, ·)-co-accretive operator and discuss some of its properties. Using the concept of graph convergence and resolvent operator, we establish the convergence for generalized Yosida approximation operator. Also, we show an equivalence between graph convergence for H(·, ·)-co-accretive operator and gen...

grapes are among the world most planted horticultural crops. since the last century, attempts have been made to improve the quality of grapes in the world. meanwhile, the necessity of having knowledge about the history of progenies families led to the link between genealogy and breeding. considering some previous mislabeling, in order to find out the accuracy of the controlled crosses as well a...

A basic belief assignment can have up to 2 focal elements, and combining them with a simple conjunctive operator will need O(2) operations. This article proposes some techniques to limit the size of the focal sets of the bbas to be combined while preserving a large part of the information they carry. The first section revisits some well-known definitions with an algorithmic point of vue. The se...

We study neutrino masses and mixing in the context of flavor models with A4 symmetry, three scalar doublets in the triplet representation, and three lepton families. We show that there is no representation assignment that yields a dimension-5 mass operator consistent with experiment. We then consider a type-I seesaw with three heavy right-handed neutrinos, explaining in detail why it fails, and...

Online resource allocation problems are difficult because the operator must make irrevocable decisions rapidly and with limited (or nonexistent) information on future requests. We propose a mathematical-programming-based framework that takes into account all the available forecasts and the limited computational time. We combine Benders decomposition, which allows us to measure the expected futu...

We present two constraint models for the Minimising Open Stacks Problem (MOSP). Our first model is based on that reported in [1], and our second is a refinement and is more space efficient. We also present two reduction operators for the MOSP. One reduction operator is applied as a pre-process to remove elements of the problem that are provably redundant, the second dynamically reduces the prob...

This work proposes a novel Energy-aware Network Operator Search (ENOS) approach to address the energy-accuracy trade-offs of deep neural network (DNN) accelerator. In recent years, hardware-friendly inference operators such as binary-weight, multiplication-free, and deep-shift have been proposed improve computational efficiency DNN However, simplifying invariably comes at lower ac...

The Distributed and Flexible Job-shop Scheduling problem (DFJS) considers the scheduling of distributed manufacturing environments, where jobs are processed by a system of several Flexible Manufacturing Units (FMUs). Distributed scheduling problems deal with the assignment of jobs to FMUs and with determining the scheduling of each FMU, in terms of assignment of each job operation to one of the...