O Ministério da Saúde define os idosos como \"pessoas com idade igual ou superior a 60 (sessenta) anos\". A população brasileira ganhou 4,8 milhões de idosos de 2012 a 2017, superando a marca dos 30,2 milhões. Em estudos 6,9% dos idosos foram identificados como frágeis e 47% apresentaram fragilidade intermediária. As divisões de Nutrição e Metabolismo do departamento de Ciências da Saúde e de Geriatria do departamento de Clínica Médica do Hospital das Clínicas de Ribeirão Preto, investiram na identificação de idosos frágeis na comunidade, uma adaptação do projeto francês Gerontopole de Toulouse. No entanto o protocolo inicial foi feito em fichas de papel, a informação em papel está disponível somente a um profissional ao mesmo tempo, possui baixa mobilidade e está sujeito a ilegibilidade, ambiguidade, perda de dados, dificuldade de pesquisa coletiva, falta de padronização, dificuldade de acesso, e requer amplos espaços para arquivamento. Neste trabalho foi desenvolvida uma plataforma web / mobile para avaliação e diagnóstico de fragilidade em idosos. Foi utilizada a arquitetura de projetos MVC, e as linguagens PHP, JavaScript, CSS3 e HTML5. O sistema possui as funcionalidades de cadastro, edição e deleção para todas as escalas, pacientes e usuários, também é possível gerar relatórios das escalas. Os usuários avaliaram o sistema no teste de usabilidade WAMMI resultando na pontuação 75 de 100. A maior parte das recomendações de usabilidade e segurança da Sociedade Brasileira de Informática em Saúde foram atendidas pelo software desenvolvido / The Ministry of Health defines the elderly as \"persons aged 60 or over (60)\". The Brazilian population gained 4.8 million elderly people from 2012 to 2017, surpassing the mark of 30.2 million. In studies 6.9% of the elderly were identified as fragile and 47% presented intermediate frailty. The Nutrition and Metabolism and Geriatrics divisions of the Clinical Medicine Department of the Hospital das Clínicas of Ribeirão Preto invested in the identification of fragile elderly in the community, an adaptation of the French Gerontopole project in Toulouse. However the initial protocol was made in paper chips, paper information is available only to a professional at the same time, has low mobility and is subject to illegibility, ambiguity, loss of data, difficulty in collective research, lack of standardization, difficult to access, and requires ample space for archiving. In this project a web / mobile platform was developed to evaluate and diagnose frailty in the elderly. The MVC project architecture was used, along with the languages PHP, JavaScript, CSS3 and HTML5. The system has the registration, editing and deletion features for all scales, patients and users, it is also possible to generate reports of scales. The users evaluated the system in the WAMMI usability test resulting in a score of 75 out of 100. Most of the usability and security recommendations of the Brazilian Society of Health Informatics were met by the software developed

Tao Suyi. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2005. / Includes bibliographical references (leaves 51-53). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Background --- p.2 / Chapter 1.1.1 --- Mobile Phone Applications --- p.3 / Chapter 1.1.2 --- Location Methods --- p.4 / Chapter 1.1.3 --- Location Algorithms --- p.9 / Chapter 1.2 --- AoA Localization --- p.10 / Chapter 1.3 --- The NLOS Problem --- p.11 / Chapter 2 --- AoA Localization --- p.13 / Chapter 2.1 --- Conventional Approach to AoA Localization --- p.14 / Chapter 2.2 --- Least Squares Approach to AoA Localization --- p.16 / Chapter 2.2.1 --- Ordinary Least Squares Approach (OLS) by Pages-Zamora --- p.16 / Chapter 2.2.2 --- The Weighted Least Squares Approach (WLS) --- p.18 / Chapter 2.3 --- Approximate Maximum Likelihood Method (AML) for AoA Localization --- p.19 / Chapter 2.4 --- Simulations --- p.21 / Chapter 3 --- Analysis and Mitigation of NLoS Effects --- p.26 / Chapter 3.1 --- The Non-Line-of-Sight (NLoS) Effects --- p.26 / Chapter 3.2 --- NLoS Mitigation in AoA Localization --- p.27 / Chapter 3.2.1 --- A Selective Model to Suppress NLOS Errors --- p.27 / Chapter 3.2.2 --- Dimension Determination and LOS Identification --- p.29 / Chapter 3.3 --- Simulations --- p.34 / Chapter 3.3.1 --- Experiment 1 --- p.34 / Chapter 3.3.2 --- Experiment 2 --- p.38 / Chapter 4 --- Conclusions and Suggestions for Future Work --- p.42 / Chapter 4.1 --- Conclusions --- p.42 / Chapter 4.2 --- Suggestions for future work --- p.44 / Chapter A --- Derivation of the Cramer Rao Lower Bound (CRLB) for AoA Localization --- p.45 / Chapter A.1 --- CRLB for all LoS --- p.45 / Chapter A.2 --- CRLB for both LoS and NLoS --- p.46 / Chapter B --- Derivation of the Error Covariance for OLS and WLS Estima- tors --- p.48 / Chapter B.1 --- Error Covariance for OLS Estimator --- p.49 / Chapter B.2 --- Error Covariance for WLS Estimator --- p.50 / Bibliography --- p.51

<p>This essay presents a survey that was conducted on 52 college students regarding their opinions on advertisement received to the mobile phone. The questionnaire survey focused on what college students think of advertising to the mobile phone and what attitude they have towards it. The thoughts behind this study are that advertisement to the mobile phones is something that is getting more popular when the mobile phone is getting more advanced. The result of the study showed that college students are not that interested in receiving advertisement to their mobile phones. Several of the college students that participated in the study already get advertisement to their mobile phones, advertisement that they don't want because it doesn't reflect their interests. The study showed that if the advertisement sent to the respondents was to get more customized to their personal interest they might consider receiving it.</p>

Originally presented as the author's thesis (Swiss Federal Institute of Technology), Diss. ETH No. 16687. / Summary in German and English, text in English. Includes bibliographical references (p. 175-180).

No description available.

Nowadays, we can get the wireless devices easily, such as cell phone, PDA, etc. It can make the life convenient. The P2P network which has been constructed by the wireless devices does not need the central server. They can communicate by themselves. Not only have protected in the privacy, but also add the convenience. The reason is that the devices are portable, we can get the newest information. Some P2P software focuses on the sharing. They can share files with other peer. The file can separate into several modes. The software will share these nodes. Every peer shares his own node, and it will speed up the rate of sharing. There are some selfish peers in this environment, and they will not want to share their own node. Moreover, some of them share the incorrect file. The software will solve this kind of problem by some mechanism. And it set some incentive mechanism to make the sharing to go on. Because the wireless devices are portable, we can use these devices for exchanging immediate information. Sharing the files is similar to the exchanging. Both of the users trust each other. They can exchange automatically. So, our research has designed a reputation based mechanism for exchanging. The users can evaluate each other to exchanging the information automatically. By this mechanism, the user in our system will exchange continuously. We can reach our purpose which makes the user in our environment can exchange automatically.

Network decontamination is a well known mobile agent problem with many applications. We assume that all nodes of a network are contaminated (e.g., by a virus) and a set of agents is deployed to decontaminate them. An agent passing by a node decontaminates it, however a decontaminated node can be recontaminated if any of its neighbours is contaminated. In the vast literature a variety of models are considered and different assumptions are made on the power of the agents. In this thesis we study variation of the decontamination problem in mesh and tori topologies, under the assumption that when a node is decontaminated, it is immune to recontamination for a predefined amount of time t (called immunity time). After the immunity time is elapsed, recontamination can occur. We focus on three different models: mobile agents (MA), cellular automata (CA), and mobile cellular automata (MCA). The first two models are commonly studied and employed in several other contexts, the third model is introduced in this thesis for the first time. In each model we study the temporal decontamination problem (adapted to the particular setting) under a variety of assumptions on the capabilities of the decontaminating elements (agents for MA and MCA, decontaminating cells for CA). Some of the parameters we consider in this study are: visibility of the active elements, their ability to make copies of themselves, their ability to communicate, and the possibility to remember their past actions (memory). We describe several solutions in the various scenarios and we analyze their complexity. Efficiency is evaluated slightly differently in each model, but essentially the effort is in the minimization of the number of simultaneous decontaminating elements active in the system while performing the decontamination with a given immunity time.

Low motivation levels experienced by students with exceptionalities in the area of mathematics are often cited as a major factor negatively affecting their potential for success (Baird & Scott, 2009; Reichrath, de Witte, & Winkens, 2010). In the wake of many ongoing experiments using new mobile technology and tablet devices in schools, this study examines the use of iPads from Apple in a secondary mathematics classroom and its potential effect on the motivation of students with exceptionalities. In addition, the study also takes an exploratory approach to documenting the factors impacting the planning, implementation and student use of mobile devices in the classroom. A total of 16 students, 1 teacher and 1 educational assistant participated in this study. A mixed methodology approach was taken which included collecting evidence from surveys and scales as well as from descriptive journals, interviews and observational field notes. In order to assess the students’ level of motivation, the four attributes from Keller’s 2006 ARCS Model were used as the basic analysis framework. These were: attention, relevance, confidence and satisfaction (Keller, ARCS Model, 2006). Preliminary analysis of the attributes indicates relative consistency over the course of the study, with some minor oddities explained further in the conclusions. An extensive list of exploratory findings regarding planning, implementation and student use of mobile devices in the mathematics classroom with students with exceptionalities indicated both positive and negative aspects regarding the integration of the devices. Some positive aspects include the ability to meet the needs of different levels, and types, of learners with a number of applications, as well as a noticed increase in the collaboration and healthy competition among students. Contrary to this, some negative aspects include the lack of availability of topic-specific applications and the level of frustration experienced by some student in the initial stages of learning a new application. / UOIT

A novel algorithm for the simplified tele-operation of mobile-manipulator systems is presented. The algorithm allows for unified, intuitive, and coordinated control of mobile manipulators, systems comprised of a robotic arm mounted on a mobile base. Unlike other approaches, the mobile-manipulator system is modeled and controlled as two separate entities rather than as a whole. The algorithm consists of thee states. In the rst state a 6-DOF (degree-of-freedom) joystick is used to freely control the manipulator's position and orientation. The second state occurs when the manipulator approaches a singular configuration, a con guration where the arm instantaneously loses a DOF of motion capability. This state causes the mobile base to proceed in such a way as to keep the end-effector moving in its last direction of motion. This is done through the use of a constrained optimization routine. The third state is triggered by the user: once the end-effector is in the desired position, the mobile base and manipulator both move with respect to one another keeping the end-effector stationary and placing the manipulator into an ideal configuration. The proposed algorithm avoids the problems of algorithmic singularities and simplifies the control approach. The algorithm has been implemented on the Jasper Mobile-Manipulator System. Test results show that the developed algorithm is effective at moving the system in an intuitive manner.

Network decontamination is a well known mobile agent problem with many applications. We assume that all nodes of a network are contaminated (e.g., by a virus) and a set of agents is deployed to decontaminate them. An agent passing by a node decontaminates it, however a decontaminated node can be recontaminated if any of its neighbours is contaminated. In the vast literature a variety of models are considered and different assumptions are made on the power of the agents. In this thesis we study variation of the decontamination problem in mesh and tori topologies, under the assumption that when a node is decontaminated, it is immune to recontamination for a predefined amount of time t (called immunity time). After the immunity time is elapsed, recontamination can occur. We focus on three different models: mobile agents (MA), cellular automata (CA), and mobile cellular automata (MCA). The first two models are commonly studied and employed in several other contexts, the third model is introduced in this thesis for the first time. In each model we study the temporal decontamination problem (adapted to the particular setting) under a variety of assumptions on the capabilities of the decontaminating elements (agents for MA and MCA, decontaminating cells for CA). Some of the parameters we consider in this study are: visibility of the active elements, their ability to make copies of themselves, their ability to communicate, and the possibility to remember their past actions (memory). We describe several solutions in the various scenarios and we analyze their complexity. Efficiency is evaluated slightly differently in each model, but essentially the effort is in the minimization of the number of simultaneous decontaminating elements active in the system while performing the decontamination with a given immunity time.