BackgroundAn increasing number of older adults drive automobiles. Given that the prevalence of dementia is rising, it is necessary to address the issue of driving retirement. The purpose of this study is to evaluate how a self-administered decision aid contributed to decision making about driving retirement by individuals living with dementia. The primary outcome measure in this study was decisional conflict. Knowledge, decision, satisfaction with decision, booklet use and booklet acceptability were the secondary outcome measures.MethodsA mixed methods approach was adopted. Drivers with dementia were recruited from an Aged Care clinic and a Primary Care center in NSW, Australia. Telephone surveys were conducted before and after participants read the decision aid.ResultsTwelve participants were recruited (mean age 75, SD 6.7). The primary outcome measure, decisional conflict, improved following use of the decision aid. Most participants felt that the decision aid: (i) was balanced; (ii) presented information well; and (iii) helped them decide about driving. In addition, mean knowledge scores improved after booklet use.ConclusionsThis decision aid shows promise as an acceptable, useful and low-cost tool for drivers with dementia. A self-administered decision aid can be used to assist individuals with dementia decide about driving retirement. A randomized controlled trial is underway to evaluate the effectiveness of the tool.

No abstract

This paper describes a method for constructing a minimal deterministic finite automaton (DFA) from a regular expression. It is based on a set of graph grammar rules for combining many graphs (DFA) to obtain another desired graph (DFA). The graph grammar rules are presented in the form of a parsing algorithm that converts a regular expression R into a minimal deterministic finite automaton M such that the language accepted by DFA M is same as the language described by regular expression R.The proposed algorithm removes the dependency over the necessity of lengthy chain of conversion, that is, regular expression → NFA with ε-transitions → NFA without ε-transitions → DFA → minimal DFA. Therefore the main advantage of our minimal DFA construction algorithm is its minimal intermediate memory requirements and hence, the reduced time complexity. The proposed algorithm converts a regular expression of size n in to its minimal equivalent DFA in O(n.log 2 n) time. In addition to the above, the time complexity is further shortened to O(n.log e n) for n ≥ 75.

Cryptography plays a major role in securing data. It is used to ensure that the contents of a message are confidentially transmitted and would not be altered. Network security is most vital component in information security as it refers to all hardware and software function, characteristics, features, operational procedures, accountability, access control, and administrative and management policy. Cryptography is central to IT security challenges, since it underpins privacy, confidentiality and identity, which together provide the fundamentals for trusted e-commerce and secure communication. There is a broad range of cryptographic algorithms that are used for securing networks and presently continuous researches on the new cryptographic algorithms are going on for evolving more advanced techniques for secures communication.

Because of recent breakthroughs in information technology, the Internet of Things (IoT) is becoming increasingly popular in a variety of application areas. Wireless sensor networks (WSN) are a critical component of IoT systems, and they consist of a collection of affordable and compact sensors that are utilized for data collecting. WSNs are used in a variety of IoT applications, such as surveillance, detection, and tracking systems, to sense the surroundings and transmit the information to the user's device.Smart gadgets, on the other hand, are limited in terms of resources, such as electricity, bandwidth, memory, and computation. A fundamental issue in the IoT-based WSN is to achieve energy efficiency while also extending the network's lifetime, which is one of the limits that must be overcome. As a result, energy-efficient clustering and routing algorithms are frequently employed in the IoT system. As a result of this inspiration, the authors of this research describe an Energy Aware Clustering and Multihop Routing Protocol with mobile sink (EACMRP-MS) technique for IoT supported WSN. The EACMRP-MS technique's purpose is to efficiently reduce the energy consumption of IoT sensor nodes, consequently increasing the network efficiency of the IoT system.The suggested EACMRP-MS technique initially relies on the Tunicate Swarm Algorithm (TSA) for cluster head (CH) selection and cluster assembly, as well as the TSA. Furthermore, the type-II fuzzy logic (T2FL) technique is used for the optimal selection of multi-hop routes, with multiple input parameters being used to achieve this. Finally, a mobile sink with route adjustment scheme is presented to further increase the energy efficiency of the IoT system. This scheme allows for the adjustment of routes based on the trajectory of the mobile sink, which further improves the energy efficiency of the system. Using a detailed experimental analysis and simulation findings, it was discovered that the EACMRP-MS technique outperformed the most recent state of the art methods in terms of a variety of evaluation metrics, indicating that it is a promising alternative.

No abstract

No abstract

No abstract