Search for: All records

ObjectiveIdentify factors that impact parents’ decisions about allowing an unaccompanied child to ride in an autonomous vehicle (AV). BackgroundAVs are being tested in several U.S. cities and on highways in multiple states. Meanwhile, suburban parents are using ridesharing services to shuttle children from school to extracurricular activities. Parents may soon be able to hire AVs to transport children. MethodNineteen parents of 8- to 16-year-old children, and some of their children, rode in a driving simulator in autonomous mode, then were interviewed. Parents also participated in focus groups. Topics included minimum age for solo child passengers, types of trips unaccompanied children might take, and vehicle features needed to support child passengers. ResultsParents would require two-way audio communication and prefer video feeds of vehicle interiors, seatbelt checks, automatic locking, secure passenger identification, and remote access to vehicle information. Parents cited convenience as the greatest benefit and fear that AVs could not protect passengers during unplanned trip interruptions as their greatest concern. ConclusionManufacturers have an opportunity to design family-friendly AVs from the outset, rather than retrofit them to be safe for child passengers. More research, especially usability studies where families interact with technology prototypes, is needed to understand how AV design impacts child passengers. ApplicationPotential applications of this research include not only designing vehicles that can be used to safely transport children, seniors who no longer drive, and individuals with disabilities but also developing regulations, policies, and societal infrastructure to support safe child transport via AVs. 

Networks are known as perfect tools for modeling various types of systems. In the literature of network mining, frequent subgraph mining is considered as the essence of mining network data. In this problem, the dataset is composed of networks representing multiple independent systems or one system at multiple time stamps. The cores of mining frequent subgraphs are graph and subgraph isomorphism. Due to the complexities of these problems, the frequent subgraph mining algorithms proposed in the literature employ various heuristics for candidate generation, duplicate subgraphs pruning, and support computation. In this survey, we provide a classification of proposed algorithms in the literature. The algorithms for static networks have found numerous applications. Therefore, these algorithms will be reviewed in detail. Besides, it is discussed that consideration of temporality of data can impact the derived insight and attracted substantial attention in recent years. However, prior surveys have not comprehensively examined the algorithms of frequent subgraph mining in a database of temporal networks represented as network snapshots. Therefore, the algorithms proposed for mining frequent subgraphs in temporal networks are reviewed. Moreover, most of the surveys have focused on main-memory algorithms. Here, we review disk-based, parallel, and distributed algorithms proposed for mining frequent subgraphs. 

Motor vehicle crashes remain a significant problem. Advanced driver assistance systems (ADAS) have the potential to reduce crash incidence and severity, but their optimization requires a comprehensive understanding of driver-specific errors and environmental hazards in real-world crash scenarios. Therefore, the objectives of this study were to quantify contributing factors using the Strategic Highway Research Program 2 (SHRP 2) Naturalistic Driving Study (NDS), identify potential ADAS interventions, and make suggestions to optimize ADAS for real-world crash scenarios.