نتایج جستجو برای: minimal processing

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

The aim of this article is to study the concept of unique solvability of max-min fuzzy neutrosophic soft matrix equation and strong regularity of fuzzy neutrosophic soft matrices over Fuzzy Neutrosophic Soft Algebra (FNSA). A Fuzzy Neutrosophic Soft Matrix (FNSM) is said to have Strong, Linear Independent (SLI) column (or, in the case of fuzzy neutrosophic soft square matrices, to be strongly r...

Journal: :journal of food biosciences and technology 0

abstract: vacuum deep-fat frying is a new technology that can be used to improve the quality attributes of fried food because of the low temperatures employed and minimal exposure to oxygen. in this paper the effect of frying process parameters, namely frying time, frying temperature and pressure on the quality factors of fried kiwi slices was studied. a laboratory scale vacuum frying apparatus...

2011
Didier Auroux Laurent D. Cohen Mohamed Masmoudi

We combine in this paper the topological gradient, which is a powerful method for edge detection in image processing, and a variant of the minimal path method in order to find connected contours. The topological gradient provides a more global analysis of the image than the standard gradient and identifies the main edges of an image. Several image processing problems (e.g., inpainting and segme...

2011
Y. Ahipo Didier Auroux Laurent D. Cohen Mohamed Masmoudi

We combine in this paper the topological gradient, which is a powerful method for edge detection in image processing, and a variant of the minimal path method in order to find connected contours. The topological gradient provides a more global analysis of the image than the standard gradient, and identifies the main edges of an image. Several image processing problems (e.g. inpainting and segme...

1999
Kees van der Laan

A plea is made for a reappraisal of TEX’s capabilities of expansion in the gullet of minimal marked up scripts into complete marked up scripts. Attention is focused on expansion of implicitly marked up table data by spaces and e-o-l-s into data separated by \cs and \rs , the abstract but explicit column and row separators, respectively. The ultimate aim is that the processing tool can’t be dist...

2013
Daniil A. Zorin

The problem dealt with in this paper is the design of a parallel embedded system with the minimal number of processors. The system is designed to solve signal processing tasks using data collected from antenna arrays. Simulated annealing algorithm is used to find the minimal number of processors and the optimal system configuration.

Journal: :Interfaces and Free Boundaries 2021

Minimal partition problems consist in finding a of domain into given number components order to minimize geometric criterion. In applicative fields such as image processing or continuum mechanics, it is standard incorporate this objective an interface energy that accounts for the lengths interfaces between components. The present work focused on thetheoretical and numerical treatment minimal wi...

Journal: :The journals of gerontology. Series B, Psychological sciences and social sciences 2006
Jacob J Sosnoff Karl M Newell

We tested the hypothesis that increases in minimal visual motor processing (VMP) time in older adults contribute to age-related increases in force variability. We manipulated the intermittency rate of visual information feedback over a 100-fold range as young (20-29 years old) and old (60-79 years old) participants produced isometric force output to a visually presented target. The force output...

2010
Jun Fang Zhisheng Huang

Reasoning with inconsistent ontologies is to use an inconsistency reasoner to get meaningful answers from inconsistent ontologies. In this paper, we propose an improved inconsistency reasoner which selects some consistent subsets by using minimal inconsistent sets(MIS) and a resolution method to improve the run-time performance of the reasoning processing. A minimal inconsistent set contains a ...

Journal: :Comput. J. 2003
Florentin Ipate

One approach to formally specifying a system is to use a form of extended finite-state machine called a stream X-machine. A stream X-machine is a type of X-machine that describes a system as a finite set of states, each with an internal store, called memory, and a number of transitions between the states. A stream X-machine may be modelled by a finite automaton (the associated finite automaton)...

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

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