954 resultados para Personal care product


Relevância:

20.00% 20.00%

Publicador:

Resumo:

The purpose of the project is to identify the role and value of professional services that community pharmacy can provide to people who are at risk of asthma or present with the disease. A literature review has been conducted to inform the development of a Pharmacy Asthma Care Module to pilot in the project

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Ehlers-Danlos syndrome (EDS) is a hereditary disorder of the connective tissue related to collagen metabolism. Deficiency or alteration of the collagen present in the tissues results in some classic signs such as skin hyperelasticity, articular hypermobility, and vascular fragility, among others. In addition, EDS oral manifestations are rarely cited in the literature. The aim of this article is to report a rare case of a young female patient with EDS who presented supernumerary teeth and an odontogenic keratocyst. There is no report in the literature of the simultaneous occurrence of these alterations. The article further highlights the importance of EDS diagnosis in patients who need dental treatment and the due care for their assistance.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Codes C-1,...,C-M of length it over F-q and an M x N matrix A over F-q define a matrix-product code C = [C-1 (...) C-M] (.) A consisting of all matrix products [c(1) (...) c(M)] (.) A. This generalizes the (u/u + v)-, (u + v + w/2u + v/u)-, (a + x/b + x/a + b + x)-, (u + v/u - v)- etc. constructions. We study matrix-product codes using Linear Algebra. This provides a basis for a unified analysis of /C/, d(C), the minimum Hamming distance of C, and C-perpendicular to. It also reveals an interesting connection with MDS codes. We determine /C/ when A is non-singular. To underbound d(C), we need A to be 'non-singular by columns (NSC)'. We investigate NSC matrices. We show that Generalized Reed-Muller codes are iterative NSC matrix-product codes, generalizing the construction of Reed-Muller codes, as are the ternary 'Main Sequence codes'. We obtain a simpler proof of the minimum Hamming distance of such families of codes. If A is square and NSC, C-perpendicular to can be described using C-1(perpendicular to),...,C-M(perpendicular to) and a transformation of A. This yields d(C-perpendicular to). Finally we show that an NSC matrix-product code is a generalized concatenated code.