Digital Commons Network^™

Measuring The Effects Of Thread Placement On The Kendall Square Ksr1, Amy Apon, T D. Wagner, E Smirni, M Madhukar, L W. Dowdy

Publications

This paper describes a measurement study of the effects of thread placement on memory access times on the Kendall Square multiprocessor, the KSRl. The KSRl uses a conventional shared memory programming model in a distributed memory architecture. The architecture is based on a ring of rings of 64-bit superscalar microprocessors. The KSRl has a Cache-Only Memory Architecture (COMA). Memory consists of the local cache memoria attached to each processor. Whenever an address is accessed, the data item is automatically copied to the local cache memory module, 80 that access times for subsequent references will be minimal. If a local cache …

A Network Management Tool For The University Of Tennessee At Chattanooga Using Simple Network Management Protocol, Ghasem Shojaie

Masters Theses and Doctoral Dissertations

This research is an attempt to develop a general purpose network management tool, using the Simple Network Management Protocol, for the University of Tennessee at Chattanooga (UTC). This tool is intended to be a non vendor specific application that runs on very low cost hardware, yet provides the primary functions one needs to monitor the health of network devices such as routers and bridges. The Simple Network Management Protocol was chosen because it is an industry standard. It has fewer operators than other network management protocols; therefore, it is simpler to implement. Because of the type of network that is …

Memory-Adaptive External Sorting, Hwee Hwa Pang, Michael J. Carey, Miron Livny

Research Collection School Of Computing and Information Systems

In real-time and goal-oriented database systems, the amount of memory assigned to queries that sort or join large relations may fluctuate due to contention from other higher priority transactions. This study focuses on techniques that enable external sorts both to reduce their buffer usage when they lose memory, and to effectively utilize any additional buffers that are given to them. We also show how these techniques can be extended to work with sort-merge joins. A series of experiments confirms that our proposed techniques are useful for sorting and joining large relations in the face of memory fluctuations.

X.500 Directory Service Support For Electronic Mail, Mihai G. Sirbu, Fikret ErçAl

Computer Science Technical Reports

One of the difficult problems on the Internet is finding the electronic mail addresses of users. In practice, there are some indirect ways of finding these addresses such as the finger program in UNIX, but almost all of these methods require the user to know the exact host name of the destination. What is most desirable is an automated mechanism which provides the e-mail addresses of users if some minimal information about the destination site is known.

This thesis describes the design of such a directory service support system, based on the X.500 Series of CCITT Recommendation, for the elm …

Genetic Algorithm With 3-Parent Uniform Crossover, L. Vincent Edmondson, Billy E. Gillett

Computer Science Technical Reports

A new genetic algorithm which uses a 3-parent uniform crossover operator is developed and analyzed. Uniform crossover operators are shown to be based on the premise that all bit-level genetic information should be passed from parents to children. The 3-parent uniform crossover operator is shown to adhere to this premise. The 3-parent uniform crossover operator is shown to be better than the 2-parent uniform crossover operator on the De Jong test functions.

Two new genetic algorithms which use 3-parent traditional crossover operators are developed and analyzed. The first uses a strategy of randomly selecting 3 of the 6 children resulting …

Ccis Networking - July 1993, Nova University

CCIS Networking / SCIS Networking magazines

No abstract provided.

On Object Semantic Similarity In Heterogeneous Database Integration, Xiangning Lui, Omran A. Bukhres

Department of Computer Science Technical Reports

No abstract provided.

Policy And Procedures Manual: Department Of Computer Sciences, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Performance Analysis Of Interconnected Lans With Server/Client Configuration, Jiangling Du, Robert H. Deng, Chi Chung Ko

Research Collection School Of Computing and Information Systems

In this paper, we study the end-to-end performance of interconnected local area networks (LAN) with server/client configuration. The system uses bridges to connect two token-ring LANs through a high-speed communication link. A server station located on one LAN receives requests from client-stations on the same LAN as well as on the remote LAN, processes the requests, and returns responses to the client-stations. The end-to-end connections of the interconnected network are modelled as single-chain and multiple-chain closed queueing systems, which are solved by an iterative algorithm based on the MVA (mean value analysis) method. The performance examples are shown in terms …

A Framework For Data Sharing In Computer Supported Cooperative Environments, Mohamed Youssef Eltoweissy

Computer Science Theses & Dissertations

Concurrency control is an indispensable part of any information sharing system. Co-operative work introduces new requirements for concurrency control which cannot be met using existing applications and database management systems developed for non-cooperative environments. The emphasis of concurrency control in conventional database management systems is to keep users and their applications from inadvertently corrupting data rather than support a workgroup develop a product together. This "insular" approach is necessary because applications that access the database have been built with the assumptions that they have exclusive access to the data they manipulate and that users of these applications are generally oblivious …

Paper Abstracts, Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1993

Paradigm Shifts in the Mathematical Sciences

Introduction (1993), Russell Howell

ACMS Conference Proceedings 1993

Paradigm Shifts in the Mathematical Sciences

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 6, June 1993, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Ua66/3/2 Computer Science Alumni Newsletter, Vol. 8, Wku Computer Science

WKU Administration Documents

Newsletter created by WKU Computer Science for alumni of the program. This issue includes list of faculty research and scholarly activity and results of alumni survey.

Assessment Of The Accuracy Of Three Methods Of Computerized Growth Prediction Of The Soft Tissue Profile, In Untreated Individuals, Pat Diciccio

Loma Linda University Electronic Theses, Dissertations & Projects

This study was performed to determine the accuracy and reliability of the long range growth predictions for profile structures by three computer software systems (QuickCeph™ for Apple Macintosh™ systems. Rocky Mountain Data Systems™ for IBM™ mainframe systems, and Facial Print™ for IBM™ personal computers), on untreated individuals. The total sample consisted of 90 Caucasian children from the Burlington Growth Centre. These were subdivided into groups of 15 children in each of mesiofacial, dolichofacial, and brachyfacial growth types for both males and females, with Angle class I occlusions, normal overbite, and normal overjet. Points measured consisted of 14 skeletal and soft …

The 1981, 1986, And 1990 Long Term Plans Of The Department Of Computer Sciences, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Shastra -- An Architecture For Deveopment Of Collaborative Appplications, Vinod Anupam, Chandrajit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Feasible Offset And Optimal Offset For Single-Layer Channel Routing, Ronald I. Greenberg, Jau-Der Shih

Computer Science: Faculty Publications and Other Works

The paper provides an efficient method to find all feasible offsets for a given separation in a VLSI channel routing problem in one layer. The prior literature considers this task only for problems with no single-sided nets. When single-sided nets are included, the worst-case solution time increases from Theta(n) to Omega(n^2), where n is the number of nets. But, if the number of columns c is O(n), one can solve the problem in time O(n^{1.5}lg n ), which improves upon a `naive' O(cn) approach. As a corollary of this result, the same time bound suffices to find the optimal offset …

Anns An X Window Based Version Of The Afit Neural Network Simulator, Ching-Seh Wu

Theses and Dissertations

This thesis presents an X Window based neural network simulation environment developed at Air Force Institute of Technology (AFIT) using the techniques of modern software engineering. This artificial neural network simulator is a tool running on Sun SPARCstations and supporting two user modes: end-users and client-programmers. End-users interact with neural network paradigms developed by client-programmers for the purpose of studying and analyzing the execution of a particular Neural Network (NN) paradigm, or class of NN algorithms. Client programmers maintain the system and use this environment for the development of new NN paradigms or algorithms for end-users. The development follows a …

A Decision Criteria To Select An Associative-Memory Organization That Minimizes The Execution Time Of A Mix Of Associative-Search Operations, David W. Banton

Theses and Dissertations

The dissertation develops a decision criteria to select an associative-memory organization that minimizes the execution time of a mix of associative-search operations and a decision criteria to estimate the layout dimensions of each organization for a specified memory size. The dissertation reclassifies Feng's associative-search operations into three hardware-influenced categories: bit-position independent (BPI), record-content independent (RCI); bit-position dependent (BPD), RCI; and BPD, record-content dependent (RCD). It develops a relationship between the categories and three associative-memory organizations: the CAM, the bit-serial word-parallel associative memory (BSWPAM) , and the extreme-search associative memory (ESAM). A version of the CAM, three versions of the BSWPAM, …

Algorithms For Generation Of Path-Methods In Object-Oriented Databases, Ashish Mehta

Dissertations

A path-method is a mechanism in object-oriented databases (OODBs) to retrieve or to update information relevant to one class that is not stored with that class but with some other class. A path-method is a method which traverses from one class through a chain of connections between classes to access information at another class. However, it is a difficult task for a user to write path-methods, because it might require comprehensive knowledge of many classes of the conceptual schema, while a typical user has often incomplete or even inconsistent knowledge of the schema.

This dissertation proposes an approach to the …

Dmodel And Dalgebra : A Data Model And Algebra For Office Documents, Fortune Solani Mhlanga

Dissertations

This dissertation presents a data model (called D_model) and an algebra (called D_ algebra) for office documents. The data model adopts a very natural view of modeling office documents. Documents are grouped into classes; each class is characterized by a "frame template", which describes the properties (or attributes) for the class of documents. A frame template is instantiated by providing it with values to form a "frame instance" which becomes the synopsis of the document of the class associated with the frame template. Different frame instances can be grouped into a folder. Therefore, a folder is a set of frame …

Megsdf Mega-System Development Framework, Tamar Zemel

Dissertations

A framework for developing large, complex software systems, called Mega-Systems, is specified. The framework incorporates engineering, managerial, and technological aspects of development, concentrating on an engineering process. MegSDF proposes developing Mega-Systems as open distributed systems, pre-planned to be integrated with other systems, and designed for change.

At the management level, MegSDF divides the development of a Mega-System into multiple coordinated projects, distinguishing between a meta-management for the whole development effort, responsible for long-term, global objectives, and local managements for the smaller projects, responsible for local, temporary objectives.

At the engineering level, MegSDF defines a process model which specifies the tasks …

Implementation Of An Object-Oriented University Database Using Vodak/Vml Prototype-2/C++, Bheeman Lingan, Madhumathi Tulasiram

Theses

Object-oriented database (OODB) technology has become very popular and successful in recent years. Currently, there are many commercial object-oriented database systems available that are used for developing large and complex real world applications. In addition, there are many research prototypes of object-oriented databases available. In a joint research project of the CIS Dept at NJIT and GMD-IPSI an object-oriented data model called the Dual Model was developed. Using this Dual Model a university environment database schema was designed. This univesity database schema was implemented using the VODAK/VML OODB prototype - 1. The university database was then reimplemented using the C++ …

The State Of Computer Science Facilities Of Schools Across The United States That Are Comparable To Illinois Wesleyan University, Sarah A. Bartz '93

Honors Projects

The purpose of this study is to compare Illinois Wesleyan's academic computer facilities with those at other comparable U.S. colleges and universities. This study also investigates factors affecting these facilities such as the methods other institutions use to deal with and plan for the constantly changing computer world. To obtain this information a survey was mailed to over 250 institutions across the U.S. that were considered comparable to IWU. These institutions include the Associated Colleges of the Midwest, the Oberlin Group, and some of the top colleges and universities in the U.S. as ranked in U.S. News and World Report's …

Diagnosis Of Malignant Melanoma Using A Neural Network, Anurag Chawla, Fikret ErçAl

Computer Science Technical Reports

Malignant melanoma is the deadliest form of all skin cancers. Approximately 32,000 new cases of malignant melanoma were diagnosed in 1991, with approximately 80 percent of patients expected to survive five years [1], Fortunately, if detected early, even malignant melanoma may be treated successfully. Thus, in recent years, there has been a rising interest in the automated detection and diagnosis of skin cancer, particularly malignant melanoma [2]. In this thesis, a novel neural network approach for the automated distinction of melanoma from three benign categories of tumors which exhibit melanoma-like characteristics is presented. The approach is based on devising new …

An Analysis Of Modern Cryptosystems, Thomas Gerald Sauder, Chung You Ho

Computer Science Technical Reports

Since the ancient Egyptian empire, man has searched for ways to protect information from getting into the wrong hands. Julius Caesar used a simple substitution cipher to protect secrets. During World War II, the Allies and the Axis had codes that they used to protect information. Now that we have computers at our disposal, the methods used to protect data in the past are ineffective. More recently, computer scientists and mathematicians have been working diligently to develop cryptosystems which will provide absolute security in a computing environment.

The three major cryptosystems in use today are DES, RSA, and the Knapsack …

The Interpolating Random Spline Cryptosystem And The Chaotic-Map Public-Key Cryptosystem, Fengi Hwu, Chung You Ho

Computer Science Technical Reports

The feasibility of implementing the interpolating cubic spline function as encryption and decryption transformations is presented. The encryption method can be viewed as computing a transposed polynomial. The main characteristic of the spline cryptosystem is that the domain and range of encryption are defined over real numbers, instead of the traditional integer numbers. Moreover, the spline cryptosystem can be implemented in terms of inexpensive multiplications and additions.

Using spline functions, a series of discontiguous spline segments can execute the modular arithmetic of the RSA system. The similarity of the RSA and spline functions within the integer domain is demonstrated. Furthermore, …

The Design, Analysis, And Implementation Of Parallel Simulated Annealing And Parallel Genetic Algorithms For The Composite Graph Coloring Problem, Brent S. Elmer, Billy E. Gillett

Computer Science Technical Reports

The composite graph coloring problem (CGCP) is similar to the standard graph coloring problem (SGCP). Associated with each vertex of a composite graph is a positive integer which represents the chromaticity of that vertex. This number is the number of consecutive integers (colors) which must be assigned to the vertex. The goal of the CGCP is to color the graph with as few colors as possible. The largest integer used in the coloring is called the chromatic number of the graph. The CGCP is proven to be NP-complete.

Exact, heuristic, and stochastic methods are analyzed and compared. Exact methods are …

Considerations For Rapidly Converging Genetic Algorithms Designed For Application To Problems With Expensive Evaluation Functions, Richard Patrick Rankin, Ralph W. Wilkerson

Computer Science Technical Reports

A genetic algorithm is a technique designed to search large problem spaces using the Darwinian concepts of evolution. Solution representations are treated as living organisms. The procedure attempts to evolve increasingly superior solutions. As in natural genetics, however, there is no guarantee that the optimum organism will be produced.

One of the problems in producing optimal organisms in a genetic algorithm is the difficulty of premature convergence. Premature convergence occurs when the organisms converge in similarity to a pattern which is sub-optimal, but insufficient genetic material is present to continue the search beyond this sub-optimal level, called a local maximum. …