Physical Sciences and Mathematics Commons^™

Asymptotically-Optimal Topological Nearest-Neighbor Filtering, Read Sandström, Jory Denny, Nancy M. Amato

Department of Math & Statistics Faculty Publications

Nearest-neighbor finding is a major bottleneck for sampling-based motion planning algorithms. The cost of finding nearest neighbors grows with the size of the roadmap, leading to a significant computational bottleneck for problems which require many configurations to find a solution. In this work, we develop a method of mapping configurations of a jointed robot to neighborhoods in the workspace that supports fast search for configurations in nearby neighborhoods. This expedites nearest-neighbor search by locating a small set of the most likely candidates for connecting to the query with a local plan. We show that this filtering technique can preserve asymptotically-optimal …

Artificial Intelligence And It Professionals, Sunil Mithas, Thomas Kude, Jonathan W. Whitaker

Management Faculty Publications

How will continuing developments in artificial intelligence (AI) and machine learning influence IT professionals? This article approaches this question by identifying the factors that influence the demand for software developers and IT professionals, describing how these factors relate to AI, and articulating the likely impact on IT professionals.

[Introduction To] Data Structures With Java: A Laboratory Approach, Joe Kent, Lewis Barnett Iii

Bookshelf

This book is designed to present the key topics in the second course for computer science students using the Java programming language. For convenience, we cover exceptions and file operations in Java, although this may have been covered in the first course. We also cover material on the binary representation of data and Java's bitwise operations, with applications.These are topics needed for computer organization an operating systems courses.

[Introduction To] Schaum's Outline Programming With C++, John R. Hubbard

Bookshelf

Tough Test Questions? Missed Lectures? Not Enough Time?

Fortunately for you, there's Schaum's Outlines. More than 40 million students have trusted Schaum's to help them succeed in the classroom and on exams. Schaum's is the key to faster learning and higher grades in every subject. Each Outline presents all the essential course information in an easy-to-follow, topic-by-topic format. You also get hundreds of examples, solved problems, and practice exercises to test your skills.

This Schaum's Outline gives you

• Practice problems with full explanations that reinforce knowledge
• Coverage of the most up-to-date developments in your course field
• In-depth review of practices …

[Introduction To] Schaum's Outlines Fundamentals Of Computing With C++, John R. Hubbard

Bookshelf

This book is intended to be used primarily for self study, preferably in conjunction with a regular course in the fundamentals of computer science using the new ANSI/ISO Standard C++. The book covers topics from the fundamental units of the 1991 A.C.M. computing curricula.

A Macro Extension For The Woody Assembly Language, Lewis Barnett Iii

Department of Math & Statistics Technical Report Series

We discuss an extension to the Woody Assembly Language [Cha94] which allows new instructions to be defined. The mechanism is similar to the C language's #define macros, allowing a name to be supplied for a piece of code which will be expanded in line. Provisions are made for writing new non-destructive branching instructions as well as instructions which are simply new names for commonly used bits of code.

An Algorithmic Palette Tool, Gary R. Greenfield

Department of Math & Statistics Technical Report Series

Our algorithmic tool follows the model of RGB percentage curves, but now the control of these curves is though algorithms that indirectly, and more abstractly, create, evolve, and modify such curves. To fully explain our methods we must first introduce the topic "mutating expressions." This is done in Section Two. In Section Three we document the user-interface problems we dealt with, and finally in Section Four discuss conclusions and suggest ideas for future exploration. Before commencing with the technical details however, we wish to emphasize the nature of the "colorization" problem that led to the conception and development of our …

Merlin's Magic Square Enhanced, Gary R. Greenfield

Department of Math & Statistics Technical Report Series

This paper first considers questions about games related to Merlin's Magic Square from the point of view of group actions. At this juncture, little beyond the formal model is new, but the exposition sets the stage for considering certain "enhanced" versions of these games. The analysis of enhanced games, with the aid of semigroup actions, is carried out in complete detail for an ostensibly simpler (k = 3) game before turning to a Merlin ( k = 4) game. Concluding sections discuss various ways to generalize our games.

To review the solution to Merlin's Magic Square, we begin by introducing …