In this paper, we discuss a software tool we have developed for use in undergraduate DBMS courses, that provides: (i) a web-enabled database set up and administration facility for faculty use, and (ii) web-based database projects that may be assigned to students.We discuss the motivation for our work and the objectives underlying the design of the tool. The significance of our work is two-fold. First, it should help the instructor in the set up, management, and monitoring of student database accounts. Second, it provides the students with a feel for the organization and use of contemporary web-enabled database applications.

Organizations that sell products over the Internet usually have a product database located at or near the web hosting server. Web clients use SSL to connect to the web server and order products, which are then entered into the product database. Since web hosting services may be outsourced, the order information needs to be transmitted securely to the corporate database of the enterprise that sells these products. This paper concerns the development of a secure middleware application in Java that connects the web hosting database with the corporate backend database [9]. We discuss the design details of the middleware and implementation issues of some of the software pieces of this puzzle. 1 Background

Most undergraduate curriculums in CS include at least a one semester study of data base management systems.In this paper, we take a closer look at a DBMS course we have offered recently and elaborate on a world wide web based database project in this course; it integrates a number of ideas not only from within DBMS but across other CS areas.We discuss the objectives underlying the design of the project and the ways in which these projects provide students with a feel for the organization and use of contemporary commercial database applications.

In this article we investigate a new algorithm for solving the optimal task assignment problem. The assignment is based on Stone's "throughput" metric with the optimality criteria being the total cost for execution and interprocess communication. Two approaches studied are a new approach based on genetic algorithms and A*, a well known tree search algorithm for solving the same problem. We use the algorithm execution time as a performance criteria for the two algorithms. It is shown that the genetic algorithm techniques are more favorable than A* for larger search spaces while for smaller search spaces A* is preferred.

article Free Access Share on Operating Systems Projects: linking theory, practice and use Authors: Sub Ramakrishnan Bowling Green State University, Department of Computer Science, Bowling Green, Ohio Bowling Green State University, Department of Computer Science, Bowling Green, OhioView Profile , Ann-Marie Lancaster Bowling Green State University, Department of Computer Science, Bowling Green, Ohio Bowling Green State University, Department of Computer Science, Bowling Green, OhioView Profile Authors Info & Claims ACM SIGCSE BulletinVolume 25Issue 1March 1993 pp 256–260https://doi.org/10.1145/169073.169483Online:01 March 1993Publication History 10citation328DownloadsMetricsTotal Citations10Total Downloads328Last 12 Months10Last 6 weeks6 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

C. C. Shen and W. H. Tsai (IEEE Trans. Comput., vol.C-34, no.3, p.197-203 1985) proposed a graph matching algorithm for solving the static task assignment problem. It combines two important ideas: (1) graph homomorphism and (2) application of the A* algorithm. Task-dependent information is used as a heuristic to reduce the search effort in finding an optimal path to the goal node. An examination is made of Shen and Tsai's strategy and their complexity measure. The authors propose some simple alternatives to their algorithm that are effective in reducing the number of nodes generated (and expanded) without sacrificing the optimality criteria.>

The authors address the problem of remote computing in a disturbed environment and describe the features of a simple hybrid protocol for program migration. Simulations indicate that the number of overhead messages can be reduced considerably. The algorithm uses a hybrid scheme (a combination of sender-initiated and receiver-initiated). The first approach is used when the system is heavily loaded, and the second when the system is lightly loaded. The system toggles between these two schemes on a dynamic basis. The algorithm exhibits fairness and collapse of one node does not lead to total system collapse.>