The nearest-neighbor method is perhaps the simplest of all algorithms for predicting the class of a test example. The training phase is trivial: simply store every training example, with its label. To make a prediction for a test example, first compute its distance to every training example. Then, keep the k closest training examples, where k ≥ 1 is a fixed integer. Look for the label that is m...

the desire and drive for excellence in any endeavor in life requires an effort from the individual; in addition it requires a constellation of features around such individuals that help them to become successful. for surgeons, it is the operating room staff, the administrative and medical assistants and our residents and fellows. however, perhaps the most important contribution to a physician’s...

This paper explores the design history of the nmake shell coprocess. Originally a special purpose uniprocessor executor, the coshell has evolved into a general purpose service that automatically executes shell actions on lightly loaded hosts in a local network. A major thrust of this work has been ease of use. The only privilege required for installation, administration or use is rsh access to ...

The SharedPlans formalization of collaboration (Grosz and Kraus 1999) stipulates that collaborating agents must commit to certain decision-making processes, but it does not specify those processes. This paper presents a mechanism for group decision making that may be applied to the decisions that agents involved in a SharedPlan need to make: adopting the initial commitment, selecting a recipe, ...

The phenomenon of “software evolution” was observed back in the 1970s when the first large software systems were being developed, and it has attracted renewed attention in the 1990s. Yet, the difficulties of software evolution are still treated as problems that pop up unexpectedly in software projects. In this talk, I look at some possible reasons to explain this apparent contradiction and the ...

Although object-oriented languages can help make software more reusable, class libraries can be di cult to use unless the programmer knows the library well. In particular, it can be hard to nd and understand components that a programmer may want to reuse. This study focuses on novice programmers solving programming tasks which require the reuse of components. We take an in-depth look at how the...

This paper introduces a large collection of reusable software components that AT&T is making available in an OpenSource form. This software has been widely used around the world and includes well-known components such as KornShell, Nmake, Graphviz, S o, Vmalloc and Cdt.

General guidelines The questions fall into several categories: (Know). Make sure you know how to solve. Do not submit. (Mandatory). Mandatory questions. (Bonus). Bonus questions. On the submission date we will collect your answers. We will then go over the questions and solve them in class. After that you have a week to write the solutions and submit to us, as long as 1. You write the solutions...

Programming of software agents is a difficult task. As a result, online learning techniques have been used in order to make software agents automatically learn to decide proper condition-action rules from their experiences. However, for complicated problems this approach requires a large amount of time and might not guarantee the optimality of rules. In this paper, we discuss our study to apply...

This paper demonstrates that there is a strategic reason why software firms have followed consumers’ desire to drop software protection. We analyze software protection policies in a price-setting duopoly software industry selling differentiated software packages, where consumers’ preference for particular software is affected by the number of other consumers who ( ) legally or illegally use the...