Clustering Algorithms: An Application for Adsorption Kinetic Curves

2021 ◽  
Vol 19 (3) ◽  
pp. 507-514
Author(s):  
Erendira Rendon ◽  
Roberto Alejo ◽  
Jose Luis Garcia Rivas
1981 ◽  
Vol 46 (3) ◽  
pp. 678-686 ◽  
Author(s):  
Arkadij Bezus ◽  
Arlette Zikánová ◽  
Miloš Smutek ◽  
Milan Kočiřík

Adsorption kinetic curves were numerically simulated for the case of simultaneous mass and heat transfer. Proposed and discussed are different methods of model testing, experimental curves fitting and of evaluation of the diffusion and heat transfer coefficients from experimental kinetic curves.


2013 ◽  
Vol 19 (4) ◽  
pp. 867-875 ◽  
Author(s):  
Andreia A. Duarte ◽  
Sérgio L. Filipe ◽  
Luís M.G. Abegão ◽  
Paulo J. Gomes ◽  
Paulo A. Ribeiro ◽  
...  

AbstractRoughness of a positively charged poly(allylamine hydrochloride) (PAH) polyelectrolyte surface was shown to strongly influence the adsorption of 1.2-dipalmitoyl-sn-3-glycero-[phosphorrac-(1-glycerol)] (DPPG) liposomes on it. The adsorption kinetic curves of DPPG liposomes onto a low-roughness PAH layer reveal an adsorbed amount of 5 mg/m2, pointing to liposome rupture, whereas a high-roughness surface leads to adsorbed amounts of 51 mg/m2, signifying adsorption of intact liposomes. The adsorption kinetic parameters calculated from adsorption kinetic curves allow us to conclude that the adsorption process is due to electrostatic interactions and also depends on processes such as diffusion and reorganization of lipids on the surface. Analysis of the roughness kinetics enabled us to calculate a growth exponent of 0.19 ± 0.07 and a roughness exponent of around 0.84, revealing that DPPG liposomes adsorbed onto rough surfaces follow the Villain self-affine model. By relating self-affine surfaces with hydrophobicity, the liposome integrity was explained by the reduction in the number of water molecules on the PAH surface, contributing to counterion anchorage near PAH ionic groups, reducing the liposome/PAH layer electrostatic forces and, consequently, avoiding liposome rupture.


Author(s):  
Mohana Priya K ◽  
Pooja Ragavi S ◽  
Krishna Priya G

Clustering is the process of grouping objects into subsets that have meaning in the context of a particular problem. It does not rely on predefined classes. It is referred to as an unsupervised learning method because no information is provided about the "right answer" for any of the objects. Many clustering algorithms have been proposed and are used based on different applications. Sentence clustering is one of best clustering technique. Hierarchical Clustering Algorithm is applied for multiple levels for accuracy. For tagging purpose POS tagger, porter stemmer is used. WordNet dictionary is utilized for determining the similarity by invoking the Jiang Conrath and Cosine similarity measure. Grouping is performed with respect to the highest similarity measure value with a mean threshold. This paper incorporates many parameters for finding similarity between words. In order to identify the disambiguated words, the sense identification is performed for the adjectives and comparison is performed. semcor and machine learning datasets are employed. On comparing with previous results for WSD, our work has improvised a lot which gives a percentage of 91.2%


2018 ◽  
Author(s):  
yongson hong ◽  
Kye-Ryong Sin ◽  
Jong-Su Pak ◽  
Chol-Min Pak

<p><b>In this paper, the deficiencies and cause of previous adsorption kinetic models were revealed, new adsorption rate equation has been proposed and its validities were verified by kinetic analysis of various experimental data.</b> <b>This work is a new view on the adsorption kinetics rather than a comment on the previous adsorption papers.</b></p>


2017 ◽  
Vol 5 (12) ◽  
pp. 323-325
Author(s):  
E. Mahima Jane ◽  
◽  
◽  
E. George Dharma Prakash Raj

2015 ◽  
pp. 125-138 ◽  
Author(s):  
I. V. Goncharenko

In this article we proposed a new method of non-hierarchical cluster analysis using k-nearest-neighbor graph and discussed it with respect to vegetation classification. The method of k-nearest neighbor (k-NN) classification was originally developed in 1951 (Fix, Hodges, 1951). Later a term “k-NN graph” and a few algorithms of k-NN clustering appeared (Cover, Hart, 1967; Brito et al., 1997). In biology k-NN is used in analysis of protein structures and genome sequences. Most of k-NN clustering algorithms build «excessive» graph firstly, so called hypergraph, and then truncate it to subgraphs, just partitioning and coarsening hypergraph. We developed other strategy, the “upward” clustering in forming (assembling consequentially) one cluster after the other. Until today graph-based cluster analysis has not been considered concerning classification of vegetation datasets.


2008 ◽  
Vol 19 (1) ◽  
pp. 48-61 ◽  
Author(s):  
Ji-Gui SUN

Author(s):  
Yuancheng Li ◽  
Yaqi Cui ◽  
Xiaolong Zhang

Background: Advanced Metering Infrastructure (AMI) for the smart grid is growing rapidly which results in the exponential growth of data collected and transmitted in the device. By clustering this data, it can give the electricity company a better understanding of the personalized and differentiated needs of the user. Objective: The existing clustering algorithms for processing data generally have some problems, such as insufficient data utilization, high computational complexity and low accuracy of behavior recognition. Methods: In order to improve the clustering accuracy, this paper proposes a new clustering method based on the electrical behavior of the user. Starting with the analysis of user load characteristics, the user electricity data samples were constructed. The daily load characteristic curve was extracted through improved extreme learning machine clustering algorithm and effective index criteria. Moreover, clustering analysis was carried out for different users from industrial areas, commercial areas and residential areas. The improved extreme learning machine algorithm, also called Unsupervised Extreme Learning Machine (US-ELM), is an extension and improvement of the original Extreme Learning Machine (ELM), which realizes the unsupervised clustering task on the basis of the original ELM. Results: Four different data sets have been experimented and compared with other commonly used clustering algorithms by MATLAB programming. The experimental results show that the US-ELM algorithm has higher accuracy in processing power data. Conclusion: The unsupervised ELM algorithm can greatly reduce the time consumption and improve the effectiveness of clustering.


Sign in / Sign up

Export Citation Format

Share Document