Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons™

Open Access. Powered by Scholars. Published by Universities.®

2002

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 541 - 570 of 603

Full-Text Articles in Computer Sciences

A Policy-Based Resource Brokering Environment For Computational Grids, Ahmed Hamdan Al-Theneyan Jan 2002

A Policy-Based Resource Brokering Environment For Computational Grids, Ahmed Hamdan Al-Theneyan

Computer Science Theses & Dissertations

With the advances in networking infrastructure in general, and the Internet in particular, we can build grid environments that allow users to utilize a diverse set of distributed and heterogeneous resources. Since the focus of such environments is the efficient usage of the underlying resources, a critical component is the resource brokering environment that mediates the discovery, access and usage of these resources. With the consumer's constraints, provider's rules, distributed heterogeneous resources and the large number of scheduling choices, the resource brokering environment needs to decide where to place the user's jobs and when to start their execution in a …


Geometric Integrators For Hamiltonian Pdes, Dmitry Karpeev Jan 2002

Geometric Integrators For Hamiltonian Pdes, Dmitry Karpeev

Computer Science Theses & Dissertations

We consider methods for systematic construction of algorithms for a class of time-dependent PDEs with Hamiltonian structure. These systems possess phase space geometry and constants of the motion that need to be preserved by the integration algorithm to reflect the qualitative features of the system.

We exploit the structure of Hamiltonian systems, in particular their variational formulation based on a Lagrangian, and the dual covariant formulation, to expose the geometric features of the system that have natural analogs when discretized. We emphasize the local space-time approach to the constructions, making them amenable to parallelization and preconditioning using domain decomposition methods, …


An Investigation Into The Concepts And Applicability Of Agent Technologies, Anne White Jan 2002

An Investigation Into The Concepts And Applicability Of Agent Technologies, Anne White

Theses

The software world is one of great richness and diversity

Even though the concept of software agents date back to the days of AI (Artificial Intelligence) work (1970’s) the word “Agent” is currently in vogue in the computing press and computer science communities.

This thesis presents a review of the ongoing evolution of software agents, places agents in context within today’s software domain, and takes a closer look at the ongoing debate of what really constitutes an '"Agenf\ The numerous dimensions of classification are studied and an opinion of the attributes that an agent should encompass is put forward. Leading …


A Study Of The Influences Of Computer Interfaces And Training Approaches On End User Training Outcomes, Raj Gururajan Jan 2002

A Study Of The Influences Of Computer Interfaces And Training Approaches On End User Training Outcomes, Raj Gururajan

Theses: Doctorates and Masters

Effective and efficient training is a key factor in determining the success of end user computing (EUC) in organisations. This study examines the influences of two application interfaces, namely icons and menus, on training outcomes. The training outcomes are measured in terms of effectiveness, efficiency and perceived ease of use. Effectiveness includes the keystrokes used to accomplish tasks, the accuracy of correct keystrokes, backtracks and errors committed. Efficiency includes the time taken to accomplish the given tasks. Perceived ease of use rates the ease of the training environment including training materials, operating system, application software and associated resources provided to …


The Use Of A Genetic Algorithm To Evolve Networks For A Natural Language Processing Task, Alexander E. Dimov '02 Jan 2002

The Use Of A Genetic Algorithm To Evolve Networks For A Natural Language Processing Task, Alexander E. Dimov '02

Honors Projects

In this project a novel approach was taken for performing a natural language task. The task requires a neural network to predict the grammatical category of the next word in a stream of sentences. There are two main reasons why this task is interesting. In natural language processing, it is sometimes very difficult to determine the grammatical category of a word in a sentence when that word could belong to different grammatical categories depending on the context. For example, the word "run" can either be a noun or a verb in a certain sentence. The ability to correctly determine the …


A Distributed Discrete-Time Neural Network Architecture For Pattern Allocation And Control, A.T. Chronopoulos, Jagannathan Sarangapani Jan 2002

A Distributed Discrete-Time Neural Network Architecture For Pattern Allocation And Control, A.T. Chronopoulos, Jagannathan Sarangapani

Computer Science Faculty Research & Creative Works

No abstract provided.


Performance Modeling And Prediction For The Scalable Solution Of Partial Differential Equations On Unstructured Grids, Dinesh Kumar Kaushik Jan 2002

Performance Modeling And Prediction For The Scalable Solution Of Partial Differential Equations On Unstructured Grids, Dinesh Kumar Kaushik

Computer Science Theses & Dissertations

This dissertation studies the sources of poor performance in scientific computing codes based on partial differential equations (PDEs), which typically perform at a computational rate well below other scientific simulations (e.g., those with dense linear algebra or N-body kernels) on modern architectures with deep memory hierarchies. We identify that the primary factors responsible for this relatively poor performance are: insufficient available memory bandwidth, low ratio of work to data size (good algorithmic efficiency), and nonscaling cost of synchronization and gather/scatter operations (for a fixed problem size scaling). This dissertation also illustrates how to reuse the legacy scientific and engineering software …


Fast Inner Product Computation On Short Buses, R. Lin, S. Olariu Jan 2002

Fast Inner Product Computation On Short Buses, R. Lin, S. Olariu

Computer Science Faculty Publications

We propose a VLSI inner product processor architecture involving broadcasting only over short buses (containing less than 64 switches). The architecture leads to an efficient algorithm for the inner product computation. Specifically, it takes 13 broadcasts, each over less than 64 switches, plus 2 carry-save additions (tcsa) and 2 carry-lookahead additions (tcla) to compute the inner product of two arrays of N = 29 elements, each consisting of m = 64 bits. Using the same order of VLSI area, our algorithm runs faster than the best known fast inner product algorithm of Smith and Torng …


A Set Of New Sea Ice Feature Descriptors For Sar Images, Leen-Kiat Soh Jan 2002

A Set Of New Sea Ice Feature Descriptors For Sar Images, Leen-Kiat Soh

School of Computing: Technical Reports

In this paper, we present a set of algorithms for describing sea ice features in SAR images. These algorithms we have implemented and incorporated in the ARKTOS software package, an intelligent sea ice classification. These algorithms have unique characteristics. Some are extensions or adaptations of existing image processing techniques to the specific problem domain of satellite sea ice classification, while some are innovative designs, inspired by the aforementioned problem domain. These feature descriptors may be generalized to other remote sensing applications.


Two Algorithms For Shaped-Based Porosity Measures, Leen-Kiat Soh Jan 2002

Two Algorithms For Shaped-Based Porosity Measures, Leen-Kiat Soh

School of Computing: Technical Reports

In this paper, we present two algorithms for shape-based porosity measures. Specifically, we describe two innovative attributes called perimeter porosity and area porosity as feature descriptors. Perimeter porosity refers to how “porous” or “weak” an image object is, while area porosity determines the degree of “branchiness” of an object. We show the applicability of the two measures through a SAR sea ice image classification example.


An Analytical Model For Virtual Topology Reconfiguration In Optical Networks And A Case Study, Xi Yang, Byrav Ramamurthy Jan 2002

An Analytical Model For Virtual Topology Reconfiguration In Optical Networks And A Case Study, Xi Yang, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

An analytical model for Virtual Topology Reconfiguration (VTR) in optical networks is developed. It aims at the optical networks with a circuit-based data plane and an IPlike control plane. By identifying and analyzing the important factors impacting the network performance due to VTR operations on both planes, we can compare the benefits and penalties of different VTR algorithms and policies. The best VTR scenario can be adaptively chosen from a set of such algorithms and policies according to the real-time network situations. For this purpose, a cost model integrating all these factors is created to provide a comparison criterion independent …


Dynamic Routing In Translucent Wdm Optical Networks, Xi Yang, Byrav Ramamurthy Jan 2002

Dynamic Routing In Translucent Wdm Optical Networks, Xi Yang, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Translucent WDM optical networks use sparse placement of regenerators to overcome the impairments and wavelength contention introduced by fully transparent networks, and achieve a performance close to fully opaque networks with much less cost. Our previous study proved the feasibility of translucent networks using sparse regeneration technique. We addressed the placement of regenerators based on static schemes allowing only fixed number of regenerators at fixed locations. This paper furthers the study by proposing a suite of dynamical routing schemes. Dynamic allocation, advertisement and discovery of regeneration resources are proposed to support sharing transmitters and receivers between regeneration and access functions. …


Dynamic Traffic Grooming Algorithms For Reconfigurable Sonet Over Wdm Networks, Shu Zhang, Byrav Ramamurthy Jan 2002

Dynamic Traffic Grooming Algorithms For Reconfigurable Sonet Over Wdm Networks, Shu Zhang, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

The emergence of Wavelength Division Multiplexing (WDM) technology provides the capability for increasing the bandwidth of Synchronous Optical Network (SONET) rings by grooming low-speed traffic streams onto different high-speed wavelength channels. Since the cost of SONET add-drop multiplexers (SADM) at each node dominates the total cost of these networks, how to assign the wavelength, groom in the traffic and bypass the traffic through the intermediate nodes has received a lot of attention from researchers recently.


Constraint Modeling And Reformulation In The Context Of Academic Task Assignment, Robert Glaubius, Berthe Y. Choueiry Jan 2002

Constraint Modeling And Reformulation In The Context Of Academic Task Assignment, Robert Glaubius, Berthe Y. Choueiry

School of Computing: Conference and Workshop Papers

We discuss the modeling and reformulation of a resource allocation problem, the assignment of graduate teaching assistants (GTAs) to courses. Our research contributes the following:

• Formulation of the GTA assignment problem as a nonbinary CSP.

• Design of a new convention for consistency checking to deal with over-constrained problem.

• Definition of a new network-decomposable nonbinary confinement constraint.

• Evaluation of the reformulation of confinement and equality constraints on 3 real-world data sets.


Constraint Modeling And Reformulation In The Context Of Academic Task Assignment, Robert Glaubius, Berthe Y. Choueiry Jan 2002

Constraint Modeling And Reformulation In The Context Of Academic Task Assignment, Robert Glaubius, Berthe Y. Choueiry

School of Computing: Conference and Workshop Papers

We discuss the modeling and reformulation of a resource allocation problem, the assignment of Graduate Teaching Assistants to courses in the University of Nebraska-Lincoln Computer Science Department. We formulate this problem as a non-binary Constraint Satisfaction Problem (CSP) and provide a new convention for consistency checking to deal with the over-constraindness of the problem and the practical requirement of our application. We introduce a new decomposable non-binary constraint, which we call confinement constraint, and describe its relevance in practical requirements of our application. We introduce an new decomposable non-binary constraint, which we call confinement constraint, and describe its relevance in …


A Novel Method To Improve The Test Efficiency Of Vlsi Tests, Hailong Cui, Sharad C. Seth, Shashank K. Mehta Jan 2002

A Novel Method To Improve The Test Efficiency Of Vlsi Tests, Hailong Cui, Sharad C. Seth, Shashank K. Mehta

School of Computing: Conference and Workshop Papers

This paper considers reducing the cost of test application by permuting test vectors to improve their defect coverage. Algorithms for test reordering are developed with the goal of minimizing the test cost. Best and worst case bounds are established for the performance of a reordered sequence compared to the original sequence of test application. SEMATECH test data and simulation results are used throughout to illustrate the ideas.


Automated Ontology Learning For A Semantic Web, Christopher N. Hammack, Qingfeng Lin, Hai Huang, Stephen Scott, Sharad C. Seth Jan 2002

Automated Ontology Learning For A Semantic Web, Christopher N. Hammack, Qingfeng Lin, Hai Huang, Stephen Scott, Sharad C. Seth

School of Computing: Technical Reports

By expressing web page content in a format that machines can understand, the semantic web provides huge possibilities for the Internet and for machine reasoning. Unfortunately, there is a considerable distance between the present-day World Wide Web and the semantic web of the future. The process of annotating the Web to make it semantic web-ready is quite long and not without resistance. In this paper one mechanism for semanticizing the Web is presented. This system is known as AutoSHOE, and it is capable of categorizing pages according to one of the present HTML semantic representations (Simple HTML Ontology Extensions) by …


Centralized Vs. Distributed Connection Management Schemes Under Different Traffic Patterns In Wavelength-Convertible Optical Networks, Lu Shen, Byrav Ramamurthy Jan 2002

Centralized Vs. Distributed Connection Management Schemes Under Different Traffic Patterns In Wavelength-Convertible Optical Networks, Lu Shen, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Centralized and Distributed methods are two connection management schemes in wavelength convertible optical networks. In the earlier work, the centralized scheme is said to have lower network blocking probability than the distributed one. Hence, much of the previous work in connection management has focused on the comparison of different algorithms in only distributed scheme or in only centralized scheme. However, we believe that the network blocking probability of these two connection management schemes depends, to a great extent, on the network traffic patterns and reservation times. Our simulation results reveal that the performance improvement (in terms of blocking probability) of …


End To End Congestion Control In High-Speed Networks, Sarangapani Jagannathan Jan 2002

End To End Congestion Control In High-Speed Networks, Sarangapani Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

This paper proposes an adaptive methodology to prevent congestion in packet switched networks such as the Internet, where the internal network nodes convey very little information to the ingress nodes. Two architectures of preventing the congestion are presented: the first one when the traffic arrival rates, and bottleneck queue levels are known and the other when these are unknown. In the latter, the network traffic is estimated online using an adaptive system by measuring the buffer occupancy. In both architectures, the congestion is controlled by adjusting the transmission rates of non real-time and certain real-time sources in response to the …


Distributed Power Control In Wireless Communication Systems, Sarangapani Jagannathan, A. T. Chronopoulos, S. Ponipireddy Jan 2002

Distributed Power Control In Wireless Communication Systems, Sarangapani Jagannathan, A. T. Chronopoulos, S. Ponipireddy

Electrical and Computer Engineering Faculty Research & Creative Works

Energy efficiency is a measure of performance in wireless networks. Therefore, controlling the transmitter power at a given node increases not only battery operating life, but also overall system capacity by successfully admitting new links. It is essential to find effective means of power control in point-to-point, broadcasting and multicasting scenarios. Wireless networking presents formidable challenges, and we consider the problem of unicast or point-to-point (peer-to-peer) communication in wireless networks in the presence of other nodes. We study the feasibility of admitting new links in an wireless network operating area while maintaining quality of service (QoS), in terms of signal-to-interference …


A Hybrid System Theoretic Approach For Admission Controller Design In Multimedia Networks, Sarangapani Jagannathan Jan 2002

A Hybrid System Theoretic Approach For Admission Controller Design In Multimedia Networks, Sarangapani Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

A novel real-time discrete-event admission control (AC) scheme for high-speed networks is proposed with the aim of attaining a desired quality of service (QoS) and high network utilization. The AC uses the available capacity from a novel adaptive bandwidth estimation scheme, a congestion indicator derived from a congestion controller, peak bit/cell rate (PBR/PCR) estimate from new sources, along with the desired QoS metrics, and makes decisions whether to 'admit' or 'reject' new sources. The novel aspect of the proposed approach is the application of hybrid system theory to prove the performance of the admission controller, stability and the development of …


Federating Heterogeneous Digital Libraries By Metadata Harvesting, Xiaoming Liu Jan 2002

Federating Heterogeneous Digital Libraries By Metadata Harvesting, Xiaoming Liu

Computer Science Theses & Dissertations

This dissertation studies the challenges and issues faced in federating heterogeneous digital libraries (DLs) by metadata harvesting. The objective of federation is to provide high-level services (e.g. transparent search across all DLs) on the collective metadata from different digital libraries. There are two main approaches to federate DLs: distributed searching approach and harvesting approach. As the distributed searching approach replies on executing queries to digital libraries in real time, it has problems with scalability. The difficulty of creating a distributed searching service for a large federation is the motivation behind Open Archives Initiatives Protocols for Metadata Harvesting (OAI-PMH). OAI-PMH supports …


Online Chatting System For Online Community System, Boon Hong Lim Jan 2002

Online Chatting System For Online Community System, Boon Hong Lim

Student Works (2000-2009)

Online Community is a web application that provides a complete and efficient communication environment for the online user. Any online user can create a community to connect a group of online users. Therefore, online user can create a private area to share their information and knowledge with other online user in the secure environment. Online community can be divided into 3 main modules Online Information System, Administration System and Online Chatting System. This project is focus on the on the Online Chatting System. Online Chatting System is a java Chat application that based on the Online Community. The main purpose …


Sistem Maklumat Latihan Industri, Mazlin Idrus Nor Edelina Jan 2002

Sistem Maklumat Latihan Industri, Mazlin Idrus Nor Edelina

Student Works (2000-2009)

SMLI merupakan satu sistem capaian segala maklumat mengenai Latihan Industri dari capaian borang-borang untuk diisi kepada pangkalan data para pelajar y ng mengikuti Latihan Industri untuk setiap sesi. Dengan adanya sistem ini, dapat memudahkan pihak pentadbir yang menguruskan program Latihan Industri kerana setiap penghantaran data dan pemprosesan data dapat dilakukan didalam sistem ini. SML1 mempunyai kelebihan dan kepentingannya yang tersendiri. Antaranya sistem ini membekalkan maklumat mengenai program Latihan Industri yang diadakan. Selain itu ciri-ciri keselamatan juga ditekankan di dalam sistem ini. Dengan ciri keselamatan ini setiap data yang dihantar ke dalam pangkalan data terdiri daripada data yang sah dan daripada …


Course Info Center (Cic), Shih Wei How Jan 2002

Course Info Center (Cic), Shih Wei How

Student Works (2000-2009)

Course Info Center ( CIC ) is a web-based system that bring out an easiest way for company's staff to find the information about the training courses search by their training's need. Chapter one of the report is showing out the introduction, objective, scope, and the reason why we build out the CIC system. The overview of the project in this chapter is considering the whole system's introduction. For the specific part, it can be found in Chapter Three and Chapter Four which are including the system analysis and system design. Before we make the decision to choose the development …


School Management System, Swee Ling Tan Jan 2002

School Management System, Swee Ling Tan

Student Works (2000-2009)

The purpose of this project is to develop a School Management System that utilized information technology to help to manage the school. As a school can be considered as an organization that was head by a principal, a well-managed school is important to make a school a conducive learning environment. School Management System is a client/server application that is develops mainly for secondary school. The aims of developing this system are to help the teachers manage resources and processes. It is also aims to reduce the workload of teachers by automating some of processes. This School Management System will be …


Clinic Management Information System (Cmis), Choong Leong Wong Jan 2002

Clinic Management Information System (Cmis), Choong Leong Wong

Student Works (2000-2009)

Clinic Management Information System or in short (CMIS) is a system that computerize the clinics activities. In the current manual system, lots of problems exist in the management of a clinic. Hand written records are difficult to read. Besides, records are written in papers and placed in the cupboard. There are possibilities that the files misplaced or lost. The stocks of the drugs are difficult to be keeping track. CMIS however eliminate most of the problem facing by manual system. Records are stored securely in the database. Records are easily referred by the users of the system. CMIS is developed …


E-Sekolah (Sistem Rekod Pelajar) Fakulti Sains Komputer & Teknologi Maklumat Universiti Malaya, Kuala Lumpur, Chun Siang Oh Jan 2002

E-Sekolah (Sistem Rekod Pelajar) Fakulti Sains Komputer & Teknologi Maklumat Universiti Malaya, Kuala Lumpur, Chun Siang Oh

Student Works (2000-2009)

Sistem e-Sekolah yang dibangunkan mengandungi beberapa modul yang tersendiri. Modul yang dibincangkan ialah Sistem Rekod Pelajar untuk kegunanaan pihak sekolah menegah secara khasnya dan pihak institusi pendidikan secara umumnya. Sistem ini dibina untuk menyimpan rekod peribadi pelajar. Objektif utama pembinaan sistem ini merupakan satu alternatif kepada kakitangan sekolah untuk menguruskan maklumat pelajar. Di samping itu, sistem ini dapat menggantikan pendaftaran pelajar secara manual. Justeru itu, kerja rutin kakitangan sekolah dapat berjalan lancar. Sistem ini dibangunkan secara berperingkat-peringkat yakni termasuklah fasa permulaan yakni fasa kajian, fasa analisa, fasa rekabentuk, fasa pengkodan dan fasa pengujian. Banyak pengalaman pahit dan manis dapat diperolehi …


Laman Web Info Unix, S. Hamid Marican Mohd Shazwim Jan 2002

Laman Web Info Unix, S. Hamid Marican Mohd Shazwim

Student Works (2000-2009)

Laporan ini adalah tentang projek yang dibangunkan sebagai projek latihan ilmiah. Laporan ini merupakan laoran latihan ilmiah dua. Projek Latihan Ilmiah ini ialah sebuah projek membangunkan laman web yang mengandungi informasi tentang sistem pengendalian UNIX yang dikenali sebagai Laman Web Info UNIX. Laman ini menerangkan fakta-fakta tentang UNIX dengan pada dan jelas. Laman ini dibangunkan supaya menjadi laman yang interaktif dan informatif. Ini adalah untuk menarik lebih ramai pengunjung ke Laman Web Info UNIX yang seterusnya dapat menjadikan laman ini antara laman utama untuk membuat rujukan tentang sistem pengendalian UNIX. Laman web tersebut dapat digunakan oleh pelbagai golongan pengguna tanpa …


Pengenalan Kepada Pc, Ahmad Zaki Muhammad Hadafi Jan 2002

Pengenalan Kepada Pc, Ahmad Zaki Muhammad Hadafi

Student Works (2000-2009)

Projek Latihan llmiah Tahap Akhir I dan II banyak memberi pengajaran dalam selok belok pembangunan sebuah sistem. Projek ini bertujuan membantu pengguna (ditujukan kepada pelajar) dalam memahami teknologi digital terutamanya bermula dari PC atau komputer. Dengan laungan kerajaan untuk melahirkan rakyat celik IT, adalah wajar juga projek ini dilasanakan kerana pengetahuan asas mengenai PC sekurang-kurangnya adalah satu permulaan yang baik. Dalam membangunkan sistem ini, pembangun sistem harus mempunyai atau membuat penyelidikan dalam menghasilkan satu sistem yang berkesan. Amat jelas kekurangan sistem itu jika tiada penyelidikan dilakukan. Namun penyelidikan tersebut juga harus mempunyai hasil yang baik juga bagi menghasilkan sistem yang …