Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Hosseini, E." wg kryterium: Wszystkie pola


Wyświetlanie 1-3 z 3
Tytuł:
Effect of moisture content on textural attributes of dried figs
Autorzy:
Ansari, S.
Maftoon-Azad, N.
Farahnaky, A.
Hosseini, E.
Badii, F.
Powiązania:
https://bibliotekanauki.pl/articles/26171.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Instytut Agrofizyki PAN
Tematy:
food
dried product
moisture content
textural property
dried fruit
fig
food analysis
Opis:
Due to their soft texture consumers prefer moist figs, which has motivated fig processors to increase the production of this product. However, as water enhances the browning reaction rate, moisture content optimisation of moist figs is very im- portant. Processed figs must have suitable texture softness with browning kept to a minimum. The purpose of this study was to exa- mine the effect of moisture content on the textural attributes of dried figs. Hardness, compression energy, gradient, gumminess and chewiness of fig samples decreased with moisture content exponentially, whereas the trend of springiness and cohesiveness with change of moisture content was nearly constant. Moreover, in the texture profile analysis plot of rehydrated figs, the presence of negative area is an indication of adhesiveness which was zero in control dried figs. The results of the texture profile analysis tests proved the existence of a critical moisture content of about 18.4%, above which no significant effect of moisture content on textural parame- ters was found. The glass-rubber transition results from differential scanning calorimeter may explain the different texture profile analysis attributes of dried figs compared with rehydrated figs.
Źródło:
International Agrophysics; 2014, 28, 4
0236-8722
Pojawia się w:
International Agrophysics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multiplicative Algorithm for Correntropy-Based Nonnegative Matrix Factorization
Autorzy:
Hosseini-Asl, E.
Zurada, J. M.
Powiązania:
https://bibliotekanauki.pl/articles/108758.pdf
Data publikacji:
2013
Wydawca:
Społeczna Akademia Nauk w Łodzi
Tematy:
Nonnegative Matrix Factorization (NMF)
Correntropy
Multiplicative Algorithm
Document Clustering
Opis:
Nonnegative matrix factorization (NMF) is a popular dimension reduction technique used for clustering by extracting latent features from highdimensional data and is widely used for text mining. Several optimization algorithms have been developed for NMF with different cost functions. In this paper we evaluate the correntropy similarity cost function. Correntropy is a nonlinear localized similarity measure which measures the similarity between two random variables using entropy-based criterion, and is especially robust to outliers. Some algorithms based on gradient descent have been used for correntropy cost function, but their convergence is highly dependent on proper initialization and step size and other parameter selection. The proposed general multiplicative factorization algorithm uses the gradient descent algorithm with adaptive step size to maximize the correntropy similarity between the data matrix and its factorization. After devising the algorithm, its performance has been evaluated for document clustering. Results were compared with constrained gradient descent method using steepest descent and L-BFGS methods. The simulations show that the performance of steepest descent and LBFGS convergence are highly dependent on gradient descent step size which depends on σ parameter of correntropy cost function. However, the multiplicative algorithm is shown to be less sensitive to σ parameterand yields better clustering results than other algorithms. The results demonstrate that clustering performance measured by entropy and purity improve the clustering. The multiplicative correntropy-based algorithm also shows less variation in accuracy of document clusters for variable number of clusters. The convergence of each algorithm is also investigated, and the experiments have shown that the multiplicative algorithm converges faster than L-BFGS and steepest descent method.
Źródło:
Journal of Applied Computer Science Methods; 2013, 5 No. 2; 89-104
1689-9636
Pojawia się w:
Journal of Applied Computer Science Methods
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
New Optical Solitons of the Longitudinal Wave Equation in a Magnetoelectro-Elastic Circular Rod
Autorzy:
Hosseini, K.
Mayeli, P.
Yazdani Bejarbaneh, E.
Zhou, Qin
Powiązania:
https://bibliotekanauki.pl/articles/1029813.pdf
Data publikacji:
2018-01
Wydawca:
Polska Akademia Nauk. Instytut Fizyki PAN
Tematy:
nonlinear longitudinal wave equation
magneto-electro-elastic circular rod
modified Kudryashov method
new optical solitons
Opis:
This paper studies a nonlinear partial differential equation known as the nonlinear longitudinal wave equation which describes the propagation of optical solitons in a magnetoelectro-elastic circular rod. Mentioned task is performed by solving this nonlinear equation using the well-designed modified Kudryashov method, producing a series of new optical solitons. The capability of the modified Kudryashov method in handling the nonlinear longitudinal wave equation in a magnetoelectro-elastic circular rod is confirmed.
Źródło:
Acta Physica Polonica A; 2018, 133, 1; 20-22
0587-4246
1898-794X
Pojawia się w:
Acta Physica Polonica A
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies