Convex-Cyclic Weighted Translations On Locally Compact Groups

A bounded linear operator $T$ on a Banach space $X$ is called a convex-cyclic operator if there exists a vector $x \in X$ such that the convex hull of $Orb(T, x)$ is dense in $X$. In this paper, for given an aperiodic element $g$ in a locally compact group $G$, we give some sufficient conditions for a weighted translation operator $T_{g,w}: f \mapsto w\cdot f*\delta_g$ on $\mathfrak{L}^{p}(G)$ to be convex-cyclic. A necessary condition is also studied. At the end, to explain the obtained results, some examples are given

A qualitative study on personal information management (PIM) in clinical and basic sciences faculty members of a medical university in Iran

Background: Personal Information Management (PIM) refers to the tools and activities to save and retrieve personal information for future uses. This study examined the PIM activities of faculty members of Iran University of Medical Sciences (IUMS) regarding their preferred PIM tools and four aspects of acquiring, organizing, storing and retrieving personal information. Methods: The qualitative design was based on phenomenology approach and we carried out 37 interviews with clinical and basic sciences faculty members of IUMS in 2014. The participants were selected using a random sampling method. All interviews were recorded by a digital voice recorder, and then transcribed, codified and finally analyzed using NVivo 8 software. Results: The use of PIM electronic tools (e-tools) was below expectation among the studied sample and just 37 had reasonable knowledge of PIM e-tools such as, external hard drivers, flash memories etc. However, all participants used both paper and electronic devices to store and access information. Internal mass memories (in Laptops) and flash memories were the most used e-tools to save information. Most participants used "subject" (41.00) and "file name" (33.7 ) to save, organize and retrieve their stored information. Most users preferred paper-based rather than electronic tools to keep their personal information. Conclusion: Faculty members had little knowledge about PIM techniques and tools. Those who organized personal information could easier retrieve the stored information for future uses. Enhancing familiarity with PIM tools and training courses of PIM tools and techniques are suggested

The hidden curriculum of a special education program in a Junior Science College in Malaysia

The purpose of this study was to explore the facets of the hidden curriculum in a Junior Science College from the perspective of students labelled as gifted. This college is set up specifically for gifted and high academic achiever students. A qualitative approach was chosen to gather the data from former students and current teachers of this college. The data was collected from three focus group interviews with 16 former students, individual interviews with four students and 6 teachers, observations of school activities and document reviews. The data was analysed manually, codes and categories were identified and a rich description based on the categories was written to answer the research question. The results showed that the hidden curriculum is the result of the practices, procedures, rules, relationships, structures and physical characteristics of the Special Education Program (SEP). Eight themes were identified which resulted in the learning of intrapersonal and interpersonal skills. The study concluded that the hidden curriculum facilitated the transmission of social norms while the learning improved positive interpersonal and intrapersonal skills in the students, in spite of the restrictive nature of the special education program. According to the results, it can be concluded that flexibility and creativity in instruction promotes positive traits in students and teachers

Simple gene assembly as a rewriting of directed overlap-inclusion graphs

The simple intramolecular model for gene assembly in ciliates consists of three molecular operations, simple Id, simple hi and simple dlad. Mathematical models in terms of signed permutations and signed strings proved limited in capturing some of the combinatorial details of the simple gene assembly process. Brijder and Hoogeboom introduced a new model in terms of overlap-inclusion graphs which could describe two of the three operations of the model and their combinatorial properties. To capture the third operation, we extended their framework to directed overlap-inclusion (DOI) graphs in Azimi et al. (2011) [1]. In this paper we introduce DOI graph-based rewriting rules that capture all three operations of the simple gene assembly model and prove that they are equivalent to the string-based formalization of the model. (C) 2012 Elsevier B.V. All rights reserved