Ensuring Healthy American Indian Generations for Tomorrow through Safe and Healthy Indoor Environments

A grant from the One-University Open Access Fund at the University of Kansas was used to defray the author’s publication fees in this Open Access journal. The Open Access Fund, administered by librarians from the KU, KU Law, and KUMC libraries, is made possible by contributions from the offices of KU Provost, KU Vice Chancellor for Research & Graduate Studies, and KUMC Vice Chancellor for Research. For more information about the Open Access Fund, please see http://library.kumc.edu/authors-fund.xml.American Indians (AI) have the highest rate of severe physical housing problems in the U.S. (3.9%). Little information exists about the environmental hazards in AI homes. The purposes of this paper are to discuss challenges that were encountered when recruiting AI for a home-and employment-based environmental health assessments, highlight major successes, and propose recommendations for future indoor environmental health studies. The Center for American Indian Community Health (CAICH) and Children’s Mercy Hospital’s Center for Environmental Health and Allergy and Immunology Research Lab collaborated to provide educational sessions and healthy home assessments for AI. Through educational trainings, more than 240 AI were trained on the primary causes of health problems in homes. A total of 72 homes and places of employment were assessed by AI environmental health specialists. The top three categories with the most concerns observed in the homes/places of employment were allergens/dust (98%), safety/injury (89%) and chemical exposure (82%). While some information on smoking inside the home was collected, these numbers may have been underreported due to stigma. This was CAICH’s first endeavor in environmental health and although challenges arose, many more successes were achieved

Gestural Turing Test. A Motion-Capture Experiment for Exploring Believability In Artificial Nonverbal Communication.

One of the open problems in creating believable characters in computer games and collaborative virtual environments is simulating adaptive human-like motion. Classical artificial intelligence (AI) research places an emphasis on verbal language. In response to the limitations of classical AI, many researchers have turned their attention to embodied communication and situated intelligence. Inspired by Gestural Theory, which claims that speech emerged from visual, bodily gestures in primates, we implemented a variation of the Turing Test, using motion instead of text for messaging between agents. In doing this, we attempt to understand the qualities of motion that seem human-like to people. We designed two gestural AI algorithms that simulate or mimic communicative human motion using the positions of the head and the hands to determine three moving points as the signal. To run experiments, we implemented a networked-based architecture for a Vicon motion capture studio. Subjects were shown both artificial and human gestures, and were told to declare whether it was real or fake. Techniques such as simple gesture imitation were found to increase believability. While we require many such experiments to understand the perception of humanness in movement, we believe this research is essential to developing a truly believable character

Teaching AI competencies in engineering using projects and open educational resources

A major challenge in engineering education is to empower students to use their acquired technical skills to solve real-world problems. In particular, methods of Artificial Intelligence (AI) need to be studied as tools in their respective application contexts. This puts pressure on university lecturers concerning the didactical design and elaboration of a course, and requires them to move towards a practice-based learning approach. Moreover, working on real-world problems leads to uncertainties for the lecturer and their students. Before and during the course, it is not always clear which methods will be used to solve the problem, respectively which competencies the participants need to acquire. Therefore, we propose to combine two established approaches: a project-based learning approach and the use of digital, curated learning content provided by Open Education Resources (OERs). We hypothesise that a practical study project solving a real-world problem using a combination of OERs and project-based learning is beneficial to AI education. Furthermore, we show implementations of our concept in three different courses. The first results indicate that student-centred tasks lead to high intrinsic motivation. At the same time, lecturers have to deal with a modified and extended role: They are no longer the broadcaster of knowledge but rather a guide within the learning process. Using the combination of OERs and project-based learning, the courses are attractive and exciting for students and lecturers without becoming unmanageable

Meaningful Explanations of Black Box AI Decision Systems

Black box AI systems for automated decision making, often based on machine learning over (big) data, map a user's features into a class or a score without exposing the reasons why. This is problematic not only for lack of transparency, but also for possible biases inherited by the algorithms from human prejudices and collection artifacts hidden in the training data, which may lead to unfair or wrong decisions. We focus on the urgent open challenge of how to construct meaningful explanations of opaque AI/ML systems, introducing the local-to-global framework for black box explanation, articulated along three lines: (i) the language for expressing explanations in terms of logic rules, with statistical and causal interpretation; (ii) the inference of local explanations for revealing the decision rationale for a specific case, by auditing the black box in the vicinity of the target instance; (iii), the bottom-up generalization of many local explanations into simple global ones, with algorithms that optimize for quality and comprehensibility. We argue that the local-first approach opens the door to a wide variety of alternative solutions along different dimensions: a variety of data sources (relational, text, images, etc.), a variety of learning problems (multi-label classification, regression, scoring, ranking), a variety of languages for expressing meaningful explanations, a variety of means to audit a black box

Robot task planning and explanation in open and uncertain worlds

A long-standing goal of AI is to enable robots to plan in the face of uncertain and incomplete information, and to handle task failure intelligently. This paper shows how to achieve this. There are two central ideas. The first idea is to organize the robot's knowledge into three layers: instance knowledge at the bottom, commonsense knowledge above that, and diagnostic knowledge on top. Knowledge in a layer above can be used to modify knowledge in the layer(s) below. The second idea is that the robot should represent not just how its actions change the world, but also what it knows or believes. There are two types of knowledge effects the robot's actions can have: epistemic effects (I believe X because I saw it) and assumptions (I'll assume X to be true). By combining the knowledge layers with the models of knowledge effects, we can simultaneously solve several problems in robotics: (i) task planning and execution under uncertainty; (ii) task planning and execution in open worlds; (iii) explaining task failure; (iv) verifying those explanations. The paper describes how the ideas are implemented in a three-layer architecture on a mobile robot platform. The robot implementation was evaluated in five different experiments on object search, mapping, and room categorization

Optimization and Robustness in Planning and Scheduling Problems. Application to Container Terminals

Tesis por compendioDespite the continuous evolution in computers and information technology, real-world combinatorial optimization problems are NP-problems, in particular in the domain of planning and scheduling. Thus, although exact techniques from the Operations Research (OR) field, such as Linear Programming, could be applied to solve optimization problems, they are difficult to apply in real-world scenarios since they usually require too much computational time, i.e: an optimized solution is required at an affordable computational time. Furthermore, decision makers often face different and typically opposing goals, then resulting multi-objective optimization problems. Therefore, approximate techniques from the Artificial Intelligence (AI) field are commonly used to solve the real world problems. The AI techniques provide richer and more flexible representations of real-world (Gomes 2000), and they are widely used to solve these type of problems. AI heuristic techniques do not guarantee the optimal solution, but they provide near-optimal solutions in a reasonable time. These techniques are divided into two broad classes of algorithms: constructive and local search methods (Aarts and Lenstra 2003). They can guide their search processes by means of heuristics or metaheuristics depending on how they escape from local optima (Blum and Roli 2003). Regarding multi-objective optimization problems, the use of AI techniques becomes paramount due to their complexity (Coello Coello 2006). Nowadays, the point of view for planning and scheduling tasks has changed. Due to the fact that real world is uncertain, imprecise and non-deterministic, there might be unknown information, breakdowns, incidences or changes, which become the initial plans or schedules invalid. Thus, there is a new trend to cope these aspects in the optimization techniques, and to seek robust solutions (schedules) (Lambrechts, Demeulemeester, and Herroelen 2008). In this way, these optimization problems become harder since a new objective function (robustness measure) must be taken into account during the solution search. Therefore, the robustness concept is being studied and a general robustness measure has been developed for any scheduling problem (such as Job Shop Problem, Open Shop Problem, Railway Scheduling or Vehicle Routing Problem). To this end, in this thesis, some techniques have been developed to improve the search of optimized and robust solutions in planning and scheduling problems. These techniques offer assistance to decision makers to help in planning and scheduling tasks, determine the consequences of changes, provide support in the resolution of incidents, provide alternative plans, etc. As a case study to evaluate the behaviour of the techniques developed, this thesis focuses on problems related to container terminals. Container terminals generally serve as a transshipment zone between ships and land vehicles (trains or trucks). In (Henesey 2006a), it is shown how this transshipment market has grown rapidly. Container terminals are open systems with three distinguishable areas: the berth area, the storage yard, and the terminal receipt and delivery gate area. Each one presents different planning and scheduling problems to be optimized (Stahlbock and Voß 2008). For example, berth allocation, quay crane assignment, stowage planning, and quay crane scheduling must be managed in the berthing area; the container stacking problem, yard crane scheduling, and horizontal transport operations must be carried out in the yard area; and the hinterland operations must be solved in the landside area. Furthermore, dynamism is also present in container terminals. The tasks of the container terminals take place in an environment susceptible of breakdowns or incidences. For instance, a Quay Crane engine stopped working and needs to be revised, delaying this task one or two hours. Thereby, the robustness concept can be included in the scheduling techniques to take into consideration some incidences and return a set of robust schedules. In this thesis, we have developed a new domain-dependent planner to obtain more effi- cient solutions in the generic problem of reshuffles of containers. Planning heuristics and optimization criteria developed have been evaluated on realistic problems and they are applicable to the general problem of reshuffling in blocks world scenarios. Additionally, we have developed a scheduling model, using constructive metaheuristic techniques on a complex problem that combines sequences of scenarios with different types of resources (Berth Allocation, Quay Crane Assignment, and Container Stacking problems). These problems are usually solved separately and their integration allows more optimized solutions. Moreover, in order to address the impact and changes that arise in dynamic real-world environments, a robustness model has been developed for scheduling tasks. This model has been applied to metaheuristic schemes, which are based on genetic algorithms. The extension of such schemes, incorporating the robustness model developed, allows us to evaluate and obtain more robust solutions. This approach, combined with the classical optimality criterion in scheduling problems, allows us to obtain, in an efficient in way, optimized solution able to withstand a greater degree of incidents that occur in dynamic scenarios. Thus, a proactive approach is applied to the problem that arises with the presence of incidences and changes that occur in typical scheduling problems of a dynamic real world.Rodríguez Molins, M. (2015). Optimization and Robustness in Planning and Scheduling Problems. Application to Container Terminals [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/48545TESISCompendi

A general framework of high-performance machine learning algorithms : application in structural mechanics

Data-driven models utilizing powerful artificial intelligence (AI) algorithms have been implemented over the past two decades in different fields of simulation-based engineering science. Most numerical procedures involve processing data sets developed from physical or numerical experiments to create closed-form formulae to predict the corresponding systems’ mechanical response. Efficient AI methodologies that will allow the development and use of accurate predictive models for solving computational intensive engineering problems remain an open issue. In this research work, high-performance machine learning (ML) algorithms are proposed for modeling structural mechanics-related problems, which are implemented in parallel and distributed computing environments to address extremely computationally demanding problems. Four machine learning algorithms are proposed in this work and their performance is investigated in three different structural engineering problems. According to the parametric investigation of the prediction accuracy, the extreme gradient boosting with extended hyper-parameter optimization (XGBoost-HYT-CV) was found to be more efficient regarding the generalization errors deriving a 4.54% residual error for all test cases considered. Furthermore, a comprehensive statistical analysis of the residual errors and a sensitivity analysis of the predictors concerning the target variable are reported. Overall, the proposed models were found to outperform the existing ML methods, where in one case the residual error was decreased by 3-fold. Furthermore, the proposed algorithms demonstrated the generic characteristic of the proposed ML framework for structural mechanics problems.The EuroCC Project (GA 951732) and EuroCC 2 Project (101101903) of the European Commission. Open access funding provided by University of Pretoria.https://link.springer.com/journal/466hj2024Civil EngineeringSDG-09: Industry, innovation and infrastructur