A New Era Of Education: Incorporating Machine Teachers Into Education, Jihyun Kim

Journal of Communication Pedagogy

This editorial briefly discusses the potential of machine agents in education that can assist in creating more positive and meaningful teaching and learning environments. Then, it introduces three articles, two empirical research studies and one research-based instructional activity, compromising a special section on “Machine Teachers in Education” of Journal of Communication Pedagogy. Collectively, these articles help us better understand the role of machines in education and facilitate intellectual dialogues.

A Brief Bibliometric Survey Of Explainable Ai In Medical Field, Nilkanth Mukund Deshpande, Shilpa Shailesh Gite

Library Philosophy and Practice (e-journal)

_{^{Background: This study aims to analyze the work done in the field of explainability related to artificial intelligence, especially in the medical field from 2004 onwards using the bibliometric methods.}}

_{^{Methods: different articles based on the topic leukemia detection were retrieved using one of the most popular database- Scopus. The articles are considered from 2004 onwards. Scopus analyzer is used for different types of analysis including documents by year, source, county and so on. There are other different analysis tools such as VOSviewer Version 1.6.15. This is used for the analysis of different units such as co-authorship, co-occurrences, citation analysis …}}

Hr Process Automation: A Bibliometric Analysis, Shubham Mishra, Monica Kunte, Netra Neelam, Sanjay Bhattacharya, Preeti Mulay

Library Philosophy and Practice (e-journal)

Automation is interpreted as the replacement of manual operations by electronics and computer-controlled systems. Human resource management is an indispensable part of every firm be it the space of retail, healthcare, education or any other sector. Activities such as hiring new workers, training, or making sure that local labour laws are obeyed with HR processes and are a crucial part of every organisation. HR has typically been believed of as an extremely manual department procedure. Employees are accustomed to doing this manually and getting the job done themselves. But everything around the HR processes are changing rapidly. HR Automation is …

Artificial Intelligence And Game Theory Controlled Autonomous Uav Swarms, Janusz Kusyk, M. Umit Uyar, Kelvin Ma, Eltan Samoylov, Ricardo Valdez, Joseph Plishka, Sagor E. Hoque, Giorgio Bertoli, Jefrey Boksiner

Publications and Research

Autonomous unmanned aerial vehicles (UAVs) operating as a swarm can be deployed in austere environments, where cyber electromagnetic activities often require speedy and dynamic adjustments to swarm operations. Use of central controllers, UAV synchronization mechanisms or pre-planned set of actions to control a swarm in such deployments would hinder its ability to deliver expected services. We introduce artificial intelligence and game theory based flight control algorithms to be run by each autonomous UAV to determine its actions in near real-time, while relying only on local spatial, temporal and electromagnetic (EM) information. Each UAV using our flight control algorithms positions itself …

Function And Dissipation In Finite State Automata - From Computing To Intelligence And Back, Natesh Ganesh

Doctoral Dissertations

Society has benefited from the technological revolution and the tremendous growth in computing powered by Moore's law. However, we are fast approaching the ultimate physical limits in terms of both device sizes and the associated energy dissipation. It is important to characterize these limits in a physically grounded and implementation-agnostic manner, in order to capture the fundamental energy dissipation costs associated with performing computing operations with classical information in nano-scale quantum systems. It is also necessary to identify and understand the effect of quantum in-distinguishability, noise, and device variability on these dissipation limits. Identifying these parameters is crucial to designing …

Transparency And Algorithmic Governance, Cary Coglianese, David Lehr

All Faculty Scholarship

Machine-learning algorithms are improving and automating important functions in medicine, transportation, and business. Government officials have also started to take notice of the accuracy and speed that such algorithms provide, increasingly relying on them to aid with consequential public-sector functions, including tax administration, regulatory oversight, and benefits administration. Despite machine-learning algorithms’ superior predictive power over conventional analytic tools, algorithmic forecasts are difficult to understand and explain. Machine learning’s “black-box” nature has thus raised concern: Can algorithmic governance be squared with legal principles of governmental transparency? We analyze this question and conclude that machine-learning algorithms’ relative inscrutability does not pose a …

Comparison Of Google Image Search And Resnet Image Classification Using Image Similarity Metrics, David Smith

Computer Science and Computer Engineering Undergraduate Honors Theses

In this paper, we compare the results of ResNet image classification with the results of Google Image search. We created a collection of 1,000 images by performing ten Google Image searches with a variety of search terms. We classified each of these images using ResNet and inspected the results. The ResNet classifier predicted the category that matched the search term of the image 77.5% of the time. In our best case, with the search term “forklift”, the classifier categorized 92 of the 100 images as forklifts. In the worst case, for the category “hammer”, the classifier matched the search term …

Exploring The Relationship Of The Closeness Of A Genetic Algorithm's Chromosome Encoding To Its Problem Space, Kevin Mccullough

Master's Theses

For historical reasons, implementers of genetic algorithms often use a haploid binary primitive type for chromosome encoding. I will demonstrate that one can reduce development effort and achieve higher fitness by designing a genetic algorithm with an encoding scheme that closely matches the problem space. I will show that implicit parallelism does not result in binary encoded chromosomes obtaining higher fitness scores than other encodings. I will also show that Hamming distances should be understood as part of the relationship between the closeness of an encoding to the problem instead of assuming they should always be held constant. Closeness to …