排序方式: 共有34条查询结果,搜索用时 15 毫秒
1.
Wireless Personal Communications - Chronic kidney disease (CKD) is a gradual loss of kidney function over the period of time and it is irrevocable once functionality reaches the critical state.... 相似文献
2.
In this paper we investigate information-theoretic image coding techniques that assign longer codes to improbable, imprecise and non-distinct intensities in the image. The variable length coding techniques when applied to cropped facial images of subjects with different facial expressions, highlight the set of low probability intensities that characterize the facial expression such as the creases in the forehead, the widening of the eyes and the opening and closing of the mouth. A new coding scheme based on maximum entropy partitioning is proposed in our work, particularly to identify the improbable intensities related to different emotions. The improbable intensities when used as a mask decode the facial expression correctly, providing an effective platform for future emotion categorization experiments. 相似文献
3.
Ignazio Renato Bellobono Seba Calgari Maria Cristina Leonardi Elena Selli Ernestina Dubini Paglia 《大分子材料与工程》1981,100(1):135-146
Photochemically induced grafting and graft-polymerization of 4-(N-ethyl-N-2-acryloxyethyl)amino-4′-nitro-azobenzene I , brought into contact in the solid state with cellulose by evaporation of solvent from monomer solutions, has been investigated kinetically at 30°C. Two constant rate periods were observed. The first one was interpreted on the basis of a self-sensitized grafting mechanism of monomeric or oligomeric species of I , photochemically initiated by hydrogen abstraction from the cellulose surface. The second one was explained as a self-sensitized photochemically induced graft-polymerization of I on the first grafted layer. Some particular features, such as concurrent photodegradation of the first grafted layer at low surface coverage, are discussed in the light of the proposed mechanism. 相似文献
4.
Pietro Canepa Nazzareno Marignetti Umberto Rognoni Seba Calgari 《Water research》1988,22(12):1491-1494
The purpose of this work was to verify the combined application of membranes and adsorption processes to the treatment of vegetation waters coming from olive oil factories. The described pilot plant worked for about 6 months using polysulfone ultrafiltration membranes, absorbing polymers and polypiperazine amide reverse osmosis membranes. The process was optimized so that from wastewater entering with a COD content of about 90,000 ppm it was possible to obtain a COD reduction of about 99% with the recovery of polyphenols to use in alimentary industries and of a “concentrated paste” for oil extraction, phurphurale production or combustion. Also evaluated was the economical feasibility of industrial application calculating that the total cost of the treatment was close to 3 c per liter. 相似文献
5.
Tarhana is a traditional cereal-based fermented food produced with a mixture of yoghurt and flour. The main microbiota in the fermentation of tarhana is yeast, together with lactic acid bacteria. In this study, the yeast microbiota of home-made tarhana (HMT) and plant-type tarhana (PTT) dough samples was evaluated and compared during fermentation. Culture-dependent LSU and ITS-5.8S rDNA sequence analysis of yeast isolates collected during the tarhana dough fermentation clarified 45 selected isolates representing different clusters. These yeast isolates displayed high homologywith species Pichia kudriavzevii (11), Candida glabrata (11), Candida humilis (10), Saccharomyces cerevisiae (7), Kluyveromyces marxianus (4), Kazachstania servazzi (1), and Kazachstania unispora (1). Additionally, both culture-dependent and PCR-Denaturated Gradient Gel Electrophoresis (PCR-DGGE) analyses showed that S. cerevisiae, P. kudriavzevii and K. marxianus were abundant in the fermentation of HMT dough samples whereas P. kudriavzevii, C. humilis, and C. glabrata dominated the PTT dough samples. It was concluded that tarhana fermentation was accomplished with the presence of a wide variety of yeast species that mainly included P. kudriavzevii in both HMT and PTT dough samples. 相似文献
6.
P Seba 《Canadian Metallurgical Quarterly》1996,53(19):13024-13028
7.
Photochemically induced grafting and graft polymerization of 4-(N-ethyl, N-2-acryloxyethyl) amino, 4′-nitro, azobenzene(I), brought into contact with polyamide and polypropylene fibers by evaporation of solvent from toluene solutions, has been investigated kinetically at 45°C. Two constant-rate periods were observed. The first one was interpreted on the basis of an autosensitized grafting mechanism of monomeric or oligomeric species of (I), photochemically initiated by hydrogen abstraction from the polymer surface. This first step occurred at a rate dependent on the chemical nature of the substrate being faster for polyamide than for polypropylene by a factor of about 1.25; it was followed by a brief induction period, after which a transient autoacceleration led to a second constant rate process, independent of the substrate. This latter step was explained as an autosensitized photochemically induced graft polymerization of (I) on the first grafted layer. 相似文献
8.
9.
Sofiane Lagraa Hamida Seba Riadh Khennoufa Abir M׳Baya Hamamache Kheddouci 《Pattern recognition》2014
Graphs are universal modeling tools. They are used to represent objects and their relationships in almost all domains: they are used to represent DNA, images, videos, social networks, XML documents, etc. When objects are represented by graphs, the problem of their comparison is a problem of comparing graphs. Comparing objects is a key task in our daily life. It is the core of a search engine, the backbone of a mining tool, etc. Nowadays, comparing objects faces the challenge of the large amount of data that this task must deal with. Moreover, when graphs are used to model these objects, it is known that graph comparison is very complex and computationally hard especially for large graphs. So, research on simplifying graph comparison gainedan interest and several solutions are proposed. In this paper, we explore and evaluate a new solution for the comparison of large graphs. Our approach relies on a compact encoding of graphs called prime graphs. Prime graphs are smaller and simpler than the original ones but they retain the structure and properties of the encoded graphs. We propose to approximate the similarity between two graphs by comparing the corresponding prime graphs. Simulations results show that this approach is effective for large graphs. 相似文献
10.