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

Digital Commons Network™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 18901 - 18930 of 20576

Full-Text Articles in Entire DC Network

Tr-2002017: Nearly Optimal Toeplitz/Hankel Computations, Victor Y. Pan Jan 2002

Tr-2002017: Nearly Optimal Toeplitz/Hankel Computations, Victor Y. Pan

Computer Science Technical Reports

No abstract provided.


Tr-2002016: Optimization Of Basis Functions For Both Reconstruction And Visualization, Edgar Garduño, Gabor T. Herman Jan 2002

Tr-2002016: Optimization Of Basis Functions For Both Reconstruction And Visualization, Edgar Garduño, Gabor T. Herman

Computer Science Technical Reports

No abstract provided.


Tr-2002019: Improved Algorithms For Computing Determinants And Resultants, Ioannis Z. Emiris, Victor Y. Pan Jan 2002

Tr-2002019: Improved Algorithms For Computing Determinants And Resultants, Ioannis Z. Emiris, Victor Y. Pan

Computer Science Technical Reports

No abstract provided.


Tr-2002020: Inverse Power And Durand-Kerner Iterations For Univariate Polynomial Root-Finding, D. A. Bini, L. Gemignani, V. Y. Pan Jan 2002

Tr-2002020: Inverse Power And Durand-Kerner Iterations For Univariate Polynomial Root-Finding, D. A. Bini, L. Gemignani, V. Y. Pan

Computer Science Technical Reports

No abstract provided.


Tr-2002006: States Of Knowledge, Rohit Parikh Jan 2002

Tr-2002006: States Of Knowledge, Rohit Parikh

Computer Science Technical Reports

No abstract provided.


Tr-2002009: A Formal Semantics For Uml With Real-Time Constructs, Subash Shankar Jan 2002

Tr-2002009: A Formal Semantics For Uml With Real-Time Constructs, Subash Shankar

Computer Science Technical Reports

No abstract provided.


Tr-2002010: Programming Finite-Domain Constraint Propagators In Action Rules, Neng-Fa Zhou Jan 2002

Tr-2002010: Programming Finite-Domain Constraint Propagators In Action Rules, Neng-Fa Zhou

Computer Science Technical Reports

No abstract provided.


Tr-2002014: Iterative Inversion Of Structured Matrices, Gianni Codevico, Victor Y. Pan, Marc Van Barel, Xinmao Wang Jan 2002

Tr-2002014: Iterative Inversion Of Structured Matrices, Gianni Codevico, Victor Y. Pan, Marc Van Barel, Xinmao Wang

Computer Science Technical Reports

No abstract provided.


Tr-2002018: How Frequently Is A Matrix Nonsingular?, Xinmao Wang Jan 2002

Tr-2002018: How Frequently Is A Matrix Nonsingular?, Xinmao Wang

Computer Science Technical Reports

No abstract provided.


Predicting Oral Reading Miscues, Jack Mostow, Joseph Beck, S. Vanessa Winter, Shaojun Wang Jan 2002

Predicting Oral Reading Miscues, Jack Mostow, Joseph Beck, S. Vanessa Winter, Shaojun Wang

Kno.e.sis Publications

This paper explores the problem of predicting specific reading mistakes, called miscues, on a given word. Characterizing likely miscues tells an automated reading tutor what to anticipate, detect, and remediate. As training and test data, we use a database of over 100,000 miscues transcribed by University of Colorado researchers. We explore approaches that exploit different sources of predictive power: the uneven distribution of words in text, and the fact that most miscues are real words. We compare the approaches’ ability to predict miscues of other readers on other text. A simple rote method does best on the most frequent 100 …


A Survey Of Various Frequency Domain Integral Equations For The Analysis Of Scattering From Three-Dimensional Dielectric Objects, Baek Ho Jung, T. K. Sarkar, Y.-S. Chung Jan 2002

A Survey Of Various Frequency Domain Integral Equations For The Analysis Of Scattering From Three-Dimensional Dielectric Objects, Baek Ho Jung, T. K. Sarkar, Y.-S. Chung

Electrical Engineering and Computer Science - All Scholarship

In this paper, we present four different formulations for the analysis of electromagnetic scattering from arbitrarily shaped three-dimensional (3-D) homogeneous dielectric body in the frequency domain. The four integral equations treated here are the electric field integral equation (EFIE), the magnetic field integral equation (MFIE), the combined field integral equation (CFIE), and the PMCHW (Poggio, Miller, Chang, Harrington, and Wu) formulation. For the CFIE case, we propose eight separate formulations with different combinations of expansion and testing functions that result in sixteen different formulations of CFIE. One of the objectives of this paper is to illustrate that not all CFIE …


A Developmental Approach To Intelligence, Doug Blank, Deepak Kumar, Lisa Meeden Jan 2002

A Developmental Approach To Intelligence, Doug Blank, Deepak Kumar, Lisa Meeden

Computer Science Faculty Research and Scholarship

In this paper we present a developmental approach to- ward creating intelligent systems. Although embracing an emergent paradigm, we also propose an architecture such that symbols have their proper place. To explore this methodology, we are developing our system on real robots. Robotic approaches usually invoke the so-called “symbol grounding problem” (Harnad 1990). However, our developmental approach bypasses the problem by generating the symbols. Thus, in a sense, the symbols are inherently grounded to the physical objects they des- ignate. We argue that a general theory of intelligence that takes a top-down perspective will be inherently in- complete.


Interoperable Web Services For Computational Portals, Marlon Pierce, Geoffrey C. Fox, Choonhan Youn, Steve Mock, Kurt Mueller Jan 2002

Interoperable Web Services For Computational Portals, Marlon Pierce, Geoffrey C. Fox, Choonhan Youn, Steve Mock, Kurt Mueller

Electrical Engineering and Computer Science - All Scholarship

Computational web portals are designed to simplify access to diverse sets of high performance computing resources, typically through an interface to computational Grid tools. An important shortcoming of these portals is their lack of interoperable and reusable services. This paper presents an overview of research efforts undertaken by our group to build interoperating portal services around a Web Services model. We present a comprehensive view of an interoperable portal architecture, beginning with core portal services that can be used to build Application Web Services, which in turn may be aggregated and managed through portlet containers.


A Practical Approach To Solve Secure Multi-Party Computation Problems, Wenliang Du, Zhijun Zhan Jan 2002

A Practical Approach To Solve Secure Multi-Party Computation Problems, Wenliang Du, Zhijun Zhan

Electrical Engineering and Computer Science - All Scholarship

Secure Multi-party Computation (SMC) problems deal with the following situation: Two (or many) parties want to jointly perform a computation. Each party needs to contribute its private input to this computation, but no party should disclose its private inputs to the other parties, or to any third party. With the proliferation of the Internet, SMC problems becomes more and more important. So far no practical solution has emerged, largely because SMC studies have been focusing on zero information disclosure, an ideal security model that is expensive to achieve. Aiming at developing practical solutions to SMC problems, we propose a new …


Enabling Technologies For E-Commerce And Erp Integration, Keng Siau, Jake Messersmith Jan 2002

Enabling Technologies For E-Commerce And Erp Integration, Keng Siau, Jake Messersmith

Research Collection School Of Computing and Information Systems

Focuses on a study which analyzed the enabling technologies for integrating Enterprise Resource Planning (ERP) and e-business. Difficulties in integrating ERP and e-business; Architecture supporting ERP and e-commerce; Model for integrating ERP and e-business.


Querying Geographically Dispersed, Heterogeneous Data Stores: The Pperfxchange Approach, Matthew Edward Colgrove Jan 2002

Querying Geographically Dispersed, Heterogeneous Data Stores: The Pperfxchange Approach, Matthew Edward Colgrove

Dissertations and Theses

This thesis details PPerfXchange’s approach for querying geographically dispersed heterogeneous data stores. While elements of PPerfXchange’s method have been implemented for other application areas, PPerfXchange shows how these elements can be applied to parallel performance analysis. The accomplishments of this thesis are:

  • The design of an architecture for PPerfXchange, giving a uniform method to query heterogeneous data stores;
  • A proof of concept prototype implementation of PPerfXchange including a partial implementation of an XQuery processor and a relational database virtual XML document; and
  • Evaluation of PPerfXchange using example parallel performance analysis data.


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 …


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.


Knowledge Management Mechanisms In E-Commerce: A Study Of Online Retailing And Auction Sites, Fiona Fui-Hoon Nah, Keng Siau, Yuhong Tian, Min Ling Jan 2002

Knowledge Management Mechanisms In E-Commerce: A Study Of Online Retailing And Auction Sites, Fiona Fui-Hoon Nah, Keng Siau, Yuhong Tian, Min Ling

Research Collection School Of Computing and Information Systems

Knowledge management is vital to a company's success in this e-commerce era. Not only has the topic of knowledge management attracted much research attention lately, but the management of customer knowledge is also becoming increasingly important. Despite its significance, few research studies have systematically investigated knowledge management in the e-commerce context. None of the studies we reviewed looked at how knowledge management mechanisms were employed in e-commerce. This research presents a comprehensive analysis of the knowledge management mechanisms employed by 14 e-commerce sites that were rated as being the best by Gomez.com, an independent Internet quality measurement firm. Specifically, we …


Protecting The Infrastructure: 3rd Australian Information Warfare & Security Conference 2002, William Hutchinson (Ed.) Jan 2002

Protecting The Infrastructure: 3rd Australian Information Warfare & Security Conference 2002, William Hutchinson (Ed.)

Research outputs pre 2011

The conference is hosted by the We-B Centre (working with a-business) in the School of Management Information System, the School of Computer & Information Sciences at Edith Cowan University. This year's conference is being held at the Sheraton Perth Hotel in Adelaide Terrace, Perth. Papers for this conference have been written by a wide range of academics and industry specialists. We have attracted participation from both national and international authors and organisations.

The papers cover many topics, all within the field of information warfare and its applications, now and into the future.

The papers have been grouped into six streams: …


Anatomy Of A Coupling Query In A Web Warehouse, Sourav S. Bhowmick, Sanjay Kumar Madria, Wee-Keong Ng, Ee Peng Lim Jan 2002

Anatomy Of A Coupling Query In A Web Warehouse, Sourav S. Bhowmick, Sanjay Kumar Madria, Wee-Keong Ng, Ee Peng Lim

Research Collection School Of Computing and Information Systems

To populate a data warehouse specifically designed for Web data, i.e. web warehouse, it is imperative to harness relevant documents from the Web. In this paper, we describe a query mechanism called coupling query to glean relevant Web data in the context of our web warehousing system called Warehouse Of Web Data (WHOWEDA). Coupling query may be used for querying both HTML and XML documents. Some of the important features of our query mechanism are ability to query metadata, content, internal and external (hyperlink) structure of Web documents based on partial knowledge, ability to express constraints on tag attributes and …


Mechanical Response Of Nets Of Graphical Objects, Rakesh Kumar Bajaj Jan 2002

Mechanical Response Of Nets Of Graphical Objects, Rakesh Kumar Bajaj

Masters Theses

"This research produces networks of graphical objects that respond to human manipulation in a fashion that would be deemed physically reasonable. That is, a graphical network is given a mechanics-like behavior in the presence of the human interaction. In this approach, nonlinear models replace commonly used linear models to mimic physical reality better. Software solutions are provided via a class library useful for such interactive visual modeling"--Abstract, page iii.


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 …


Study Of Relative Effectiveness Of Features In Content-Based Image Retrieval, S. R. Subramanya, Jui Che Teng, Yongjian Fu Jan 2002

Study Of Relative Effectiveness Of Features In Content-Based Image Retrieval, S. R. Subramanya, Jui Che Teng, Yongjian Fu

Electrical and Computer Engineering Faculty Research & Creative Works

Content-based retrieval in image databases requires appropriate features of images to be derived and used in the indexing and searching process. Fast and accurate retrieval is crucial from a user point of view. The kinds of features used, their organization in suitable data structures, and the similarity search scheme, directly affect the speed and quality of content-based retrieval. In this paper, we evaluate the relative significance of three different image features - geometry, moments, and Fourier descriptors in the context of content-based retrieval, and present experimental results. The evaluation metrics are retrieval quality and search time. These could be used …


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 …


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 …


Adaptive Information Filtering: Concepts And Algorithms, Daniel R. Tauritz Jan 2002

Adaptive Information Filtering: Concepts And Algorithms, Daniel R. Tauritz

Computer Science Faculty Research & Creative Works

Adaptive information filtering is concerned with filtering information streams in dynamic (changing) environments. The changes may occur both on the transmission side — the nature of the streams can change — and on the reception side — the interests of the user (or group of users) can change. While information filtering and information retrieval have a lot in common, this dissertation’s primary concern is with the differences. The temporal nature of information filtering necessitates more flexible document representation methods than does information retrieval where all the occurring terms are known in advance. Also, information filtering typically maintains user interest profiles …


Quantitative Analysis Of Transmission Power Control In Wireless Ad-Hoc Networks, Seung Jong Park, R. Sivakumar Jan 2002

Quantitative Analysis Of Transmission Power Control In Wireless Ad-Hoc Networks, Seung Jong Park, R. Sivakumar

Computer Science Faculty Research & Creative Works

In this paper, we address the issue of transmission power control in wireless ad-hoc networks. In general, it is assumed that the minimum transmission power required to keep the network connected achieves the optimal throughput performance in an ad-hoc network. In contrast, we show that using the minimal transmission range might not always result in optimal throughput performance. Using both throughput and throughput per unit energy as the optimization criteria, we demonstrate that the optimal transmission power is generically a function of the number of stations, the network size, and the traffic load. In particular, we observe that the optimal …


Node Splitting Algorithms In Tree-Structured High-Dimensional Indexes For Similarity Search, Yongjian Fu, Jui Che Teng, S. R. Subramanya Jan 2002

Node Splitting Algorithms In Tree-Structured High-Dimensional Indexes For Similarity Search, Yongjian Fu, Jui Che Teng, S. R. Subramanya

Computer Science Faculty Research & Creative Works

Content-based searches and retrievals in multimedia and image databases use high-dimensional indexing structures for organizing the features of the objects. Most of those index structures are tree-structured whose nodes have a limit on the number of entries describing the subtrees rooted at those nodes. When index trees are built by repeated insertion of entries, nodes need to be split and the tree balanced accordingly. Node-splitting algorithms eventually determine the final structure of the tree which will have a profound effect on the search performance. This paper presents a comparative study of several node splitting algorithms for a typical high-dimensional indexing …