Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Engineering (44)
- Electrical and Computer Engineering (19)
- Databases and Information Systems (16)
- Other Computer Sciences (16)
- Systems Architecture (16)
-
- Mechanical Engineering (8)
- Mining Engineering (8)
- Aerospace Engineering (7)
- Operations Research, Systems Engineering and Industrial Engineering (6)
- Biology (4)
- Life Sciences (4)
- Mathematics (4)
- Statistics and Probability (4)
- Chemical Engineering (3)
- Psychology (3)
- Social and Behavioral Sciences (3)
- Chemistry (2)
- Computational Engineering (2)
- Computer Engineering (2)
- Architectural Engineering (1)
- Architecture (1)
- Artificial Intelligence and Robotics (1)
- Biochemical and Biomolecular Engineering (1)
- Civil and Environmental Engineering (1)
- Cognition and Perception (1)
- Cognitive Psychology (1)
- Keyword
-
- Security (21)
- Federated learning (15)
- Deep learning (12)
- Cloud computing (11)
- Edge computing (11)
-
- Internet (10)
- IoT (9)
- Sensor networks (9)
- Anomaly detection (8)
- Drone (8)
- Internet of Things (8)
- Routing (8)
- Wireless sensor networks (8)
- Crowdsourcing (7)
- Data Warehouses (7)
- Optimization (7)
- Privacy (7)
- Algorithms (6)
- Anomaly Detection (6)
- Big data (6)
- Deep Learning (6)
- Formal Specification (6)
- Information Resources (6)
- Large language models (6)
- Mobility (6)
- Parallel Algorithms (6)
- WHOWEDA (6)
- Approximation algorithms (5)
- Compression (5)
- Distributed (5)
- Publication Year
Articles 781 - 810 of 919
Full-Text Articles in Computer Sciences
Performance Evaluation Of Linear Hash Structure Model In A Nested Transaction Environment, Malik Ayed Tubaishat, Sanjay Kumar Madria, Bharat Bhargava
Performance Evaluation Of Linear Hash Structure Model In A Nested Transaction Environment, Malik Ayed Tubaishat, Sanjay Kumar Madria, Bharat Bhargava
Computer Science Faculty Research & Creative Works
We design and implement a linear hash algorithm in nested transaction environment to handle large amount of data with increased concurrency. Nested transactions allow parallel execution of transactions, and handle transaction aborts, thus provides more concurrency and efficient recovery. We use object-oriented methodology in the implementation which helped in designing the programming components independently. In our model, buckets are modeled as objects and linear hash operations are modeled as methods. The papers contribution is novel in the sense that the system, to our knowledge, is the first to implement linear hashing in a nested transactions environment. We have built a …
Anatomy Of The Coupling Query In A Web Warehouse, Sourav S. Bhowmick, Wee Keong Ng, Sanjay Kumar Madria, Ee Peng Lim
Anatomy Of The Coupling Query In A Web Warehouse, Sourav S. Bhowmick, Wee Keong Ng, Sanjay Kumar Madria, Ee Peng Lim
Computer Science Faculty Research & Creative Works
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 …
Controlling Web Query Execution In A Web Warehouse, Sanjay Kumar Madria, Sourav S. Bhowmick
Controlling Web Query Execution In A Web Warehouse, Sanjay Kumar Madria, Sourav S. Bhowmick
Computer Science Faculty Research & Creative Works
Most of the contemporary Web query systems have limited capabilities in controlling Web query execution. Such query facility is important as it gives us an opportunity to optimize the evaluation of a Web query. We address this issue in the context of our Web warehousing system called WHOWEDA (Warehouse Of Web Data). Specifically, we investigate different types of constraints (related to query execution) which may be imposed on a Web query such as number of query results, time of execution, restrict the evaluation of a query to specified set of Web sites, etc. An important feature of our approach is …
Quantitative Analysis Of Transmission Power Control In Wireless Ad-Hoc Networks, Seung Jong Park, R. Sivakumar
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 …
Adaptive Information Filtering: Concepts And Algorithms, Daniel R. Tauritz
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 …
A Distributed Discrete-Time Neural Network Architecture For Pattern Allocation And Control, A.T. Chronopoulos, Jagannathan Sarangapani
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.
Node Splitting Algorithms In Tree-Structured High-Dimensional Indexes For Similarity Search, Yongjian Fu, Jui Che Teng, S. R. Subramanya
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 …
A Transaction Model To Improve Data Availability In Mobile Computing, Sanjay Kumar Madria, Bharat Bhargava
A Transaction Model To Improve Data Availability In Mobile Computing, Sanjay Kumar Madria, Bharat Bhargava
Computer Science Faculty Research & Creative Works
We incorporate a prewrite operation before a write operation in a mobile transaction to improve data availability. A prewrite operation does not update the state of a data object but only makes visible the future value that the data object will have after the final commit of the transaction. Once a transaction reads all the values and declares all the prewrites, it can pre-commit at mobile host (MH) (computer connected to unreliable mobile communication network). The remaining transaction's execution (writes on database) is shifted to the mobile service station (MSS) (computer connected to the reliable fixed network). Writes on database …
A Visual Query System For The Specification And Scientific Analysis Of Continual Queries, Jennifer Leopold, A. Ambler, M. Heimovics, T. Palmer
A Visual Query System For The Specification And Scientific Analysis Of Continual Queries, Jennifer Leopold, A. Ambler, M. Heimovics, T. Palmer
Computer Science Faculty Research & Creative Works
The lack of a facility that would allow nonprogrammers to easily formulate temporal ad hoc analyses over a network of heterogeneous, constantly-updated data sources has been a significant impediment to research, particularly in the scientific community. In this paper we describe WebFormulate, an Internet-based system which facilitates the development of analyses using information obtained from databases on the Internet. The main distinction between this system and existing Internet facilities to retrieve information and assimilate it into computations is that WebFormulate provides the necessary facilities to perform continual queries, developing and maintaining dynamic links such that computations and reports automatically maintain …
Reorganizing Web Sites Based On User Access Patterns, Yongjian Fu, Mario Creado, Chunhua Ju
Reorganizing Web Sites Based On User Access Patterns, Yongjian Fu, Mario Creado, Chunhua Ju
Computer Science Faculty Research & Creative Works
In this paper, an approach for reorganizing Web sites based on user access patterns is proposed. The approach consists of three steps: preprocessing, page classification, and site reorganization. In preprocessing, pages on a Web site are processed to create an internal representation of the site, and page access information of its users is extracted from its server log. In page classification, the Web pages on the site are classified into two categories, index pages and content pages, based on the page access information. After the pages are classified, in site reorganization, the Web site is examined to find better ways …
Mobile Data Management, Sanjay Kumar Madria, Sourav S. Bhowmick
Mobile Data Management, Sanjay Kumar Madria, Sourav S. Bhowmick
Computer Science Faculty Research & Creative Works
The management of data in the mobile computing environment offers new challenging problems. Existing software needs to be upgraded to accommodate this environment. To do so, the critical parameters need to be understood and defined. We have surveyed some problems and existing solutions
Performance Evaluation Of Hybrid Coding Of Images Using Wavelet Transform And Predictive Coding, S. R. Subramanya, Chaman Sabharwal
Performance Evaluation Of Hybrid Coding Of Images Using Wavelet Transform And Predictive Coding, S. R. Subramanya, Chaman Sabharwal
Computer Science Faculty Research & Creative Works
Image compression techniques are necessary for the storage of huge amounts of digital images using reasonable amounts of space, and for their transmission with limited bandwidth. Several techniques such as predictive coding, transform coding, subband coding, wavelet coding, and vector quantization have been used in image coding. While each technique has some advantages, most practical systems use hybrid techniques which incorporate more than one scheme. They combine the advantages of the individual schemes and enhance the coding effectiveness. This paper proposes and evaluates a hybrid coding scheme for images using wavelet transforms and predictive coding. The performance evaluation is done …
Workstation Clusters For Parallel Computing, J. Stone, Fikret Erçal
Workstation Clusters For Parallel Computing, J. Stone, Fikret Erçal
Computer Science Faculty Research & Creative Works
Workstation clusters have become an increasingly popular alternative to traditional parallel supercomputers for many workloads requiring high performance computing. The use of parallel computing for scientific simulations has increased tremendously in the last ten years, and parallel implementations of scientific simulation codes are now in widespread use. There are two dominant parallel hardware/software architectures in use today: distributed memory, and shared memory. Systems implementing shared memory provide cooperating processes with a shared memory address space that can be accessed by all processors. In shared memory systems, parallel processing occurs through the use of shared data structures, or through emulation of …
Software Quality Function Deployment, Xiaoqing Frank Liu
Software Quality Function Deployment, Xiaoqing Frank Liu
Computer Science Faculty Research & Creative Works
Any product development involves projecting its potential success in achieving its functional and commercial goals. Better quality designs that match customer needs and preferences and integrate other lifecycle issues early in the software development process are more likely to be competitive. Thus, there is significant concern in industry about quality product design, which is addressed by quality function deployment (QFD). QFD uses matrices to organize and relate pieces of data to each other. These matrices are often combined to form a basic tool of QFD, called a House of Quality (HoQ). QFD was developed in the Kobe shipyards as a …
Web Schemas In Whoweda, Sourav S. Bhowmick, Wee Keong Ng, Sanjay Kumar Madria
Web Schemas In Whoweda, Sourav S. Bhowmick, Wee Keong Ng, Sanjay Kumar Madria
Computer Science Faculty Research & Creative Works
The term schema denotes whatever way a data model chooses to model its data. In this paper we discuss schemas of a set of HTML or XML documents retrieved from the Web in the context of our web warehousing system called WHOWEDA (Warehouse of Web Data). Web schemas are used to bind a web table that contains a collection of interlinked web documents called web tuples. These schemas specify some of the metadata, content and structural properties (in the form of predicates) shared by some of the Web documents and hyperlinks in the web table. They also summarize the hyperlink …
Editorial, Sanjay Kumar Madria, Mukesh Mohania, Bharat Bhargava
Editorial, Sanjay Kumar Madria, Mukesh Mohania, Bharat Bhargava
Computer Science Faculty Research & Creative Works
No abstract provided.
Adaptive Information Filtering: Evolutionary Computation And N-Gram Representation, Daniel R. Tauritz, Ida G. Sprinkhuizen-Kuyper
Adaptive Information Filtering: Evolutionary Computation And N-Gram Representation, Daniel R. Tauritz, Ida G. Sprinkhuizen-Kuyper
Computer Science Faculty Research & Creative Works
Adaptive Information Filtering (AIF) is concerned with filtering information streams in 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 a user can change). The research described in this paper details the progress made in a prototype AIF system based on weighted n-gram analysis and evolutionary computation. A major advance is the design and implementation of an n-gram class library allowing experimentation with different values of n instead of solely with 3-grams as in the past. The new prototype system was tested on …
Detecting And Representing Relevant Web Deltas Using Web Join, Sanjay Kumar Madria, Wee Keong, Ee-Peng Lim, Sourav S. Bhowmick
Detecting And Representing Relevant Web Deltas Using Web Join, Sanjay Kumar Madria, Wee Keong, Ee-Peng Lim, Sourav S. Bhowmick
Computer Science Faculty Research & Creative Works
We show how to detect and represent Web deltas, i.e., changes in Web information, that are relevant to a user's query in the context of our Web warehousing system called WHOWEDA (Warehouse of Web Data). In WHOWEDA, Web information are materialized views stored in Web tables and can be manipulated and analyzed using a set of Web algebraic operators. We present a mechanism to detect relevant Web deltas using Web join and outer Web join. We show how to represent these changes using delta Web tables.
Reducing Cognitive Overheads In A Web Warehouse Using Reverse-Osmosis, Sanjay Kumar Madria, Wee Keong Ng, Ee-Peng Lim, Sourav S. Bhowmick
Reducing Cognitive Overheads In A Web Warehouse Using Reverse-Osmosis, Sanjay Kumar Madria, Wee Keong Ng, Ee-Peng Lim, Sourav S. Bhowmick
Computer Science Faculty Research & Creative Works
This paper provides a quantitative analysis of reducing cognitive overheads in a Web warehouse using an important class of operation called reverse osmosis. The analysis is used to examine two different cognitive overheads of locating relevant nodes or information and display time of a Web table. A reverse-osmosis operation enables us to eliminate in relevant information from a collection of Web documents stored in the form of a Web table. We call such an operation reverse-osmosis because it is analogous to the reverse osmosis process in the field of water purification. We discuss a formal algorithm of the reverse-osmosis operation
A Systolic Image Difference Algorithm For Rle-Compressed Images, Fikret Erçal, Mark Allen, Hao Feng
A Systolic Image Difference Algorithm For Rle-Compressed Images, Fikret Erçal, Mark Allen, Hao Feng
Computer Science Faculty Research & Creative Works
A new systolic algorithm which computes image differences in run-length encoded (RLE) format is described. The binary image difference operation is commonly used in many image processing applications including automated inspection systems, character recognition, fingerprint analysis, and motion detection. The efficiency of these operations can be improved significantly with the availability of a fast systolic system that computes the image difference as described in this paper. It is shown that for images with a high similarity measure, the time complexity of the systolic algorithm is small and, in some cases, constant with respect to the image size. A formal proof …
Association Rules For Web Data Mining In Whoweda, Sanjay Kumar Madria, C. Raymond, M. Mohania, Sourav S. Bhowmick
Association Rules For Web Data Mining In Whoweda, Sanjay Kumar Madria, C. Raymond, M. Mohania, Sourav S. Bhowmick
Computer Science Faculty Research & Creative Works
The authors discuss association rules which can be discovered from Web data. The association rules are discussed within the scope of our WHOWEDA (warehouse of Web data) project. WHOWEDA is supported by a Web data model and a set of algebraic operators. The Web data model allows a uniform and integrated view of Web data gathered using a user''s query graph. A user''s query graph describes the query by example (what the user perceives as the query) and the Web coupling query gathers instances of such a query graph from the Web and stores them in the form of subgraphs …
Anomalous Moisture Diffusion In Viscoelastic Polymers: Modeling And Testing, S. Roy, W. X. Xu, Seung Jong Park, K. M. Liechti
Anomalous Moisture Diffusion In Viscoelastic Polymers: Modeling And Testing, S. Roy, W. X. Xu, Seung Jong Park, K. M. Liechti
Computer Science Faculty Research & Creative Works
It is now well known that Fick's Law is frequently inadequate for describing moisture diffusion in polymers or polymer composites. Non-Fickian or anomalous diffusion typically occurs when the rates of diffusion and viscoelastic relaxation in a polymer are comparable, and the ambient temperature is below the glass transition temperature (Tg) of the polymer. As a result, it is necessary to take into account the time-dependent response of a polymer, analogous to viscoelastic relaxation of mechanical properties, in constructing such a model. In this paper, a simple yet robust methodology is proposed that would allow characterization of non-Fickian diffusion coefficients from …
Optimal Power Allocation In Cdma Forward Link Using Dependency Between Pilot And Traffic Channels, Seung Jong Park, Dongwoo Kim, Chang Yeon Kim
Optimal Power Allocation In Cdma Forward Link Using Dependency Between Pilot And Traffic Channels, Seung Jong Park, Dongwoo Kim, Chang Yeon Kim
Computer Science Faculty Research & Creative Works
This paper shows a new method for minimizing the transmit power on CDMA forward link channels. Different from previous works, the proposed method uses the dependency that exists between the respective signal qualities of the pilot channel and traffic channels. Since present CDMA forward link exploits coherent demodulation with continuously transmitting pilot signals, the stronger the pilot channel is, the less traffic power may be required while the same transmission quality is maintained. With laboratory tests, the dependency is graphed. And then an optimal pilot signal quality is found, which minimizes the total transmit power. Considering various mobile environments, -10 …
Mining Multiple-Level Association Rules In Large Databases, Jiawei Han, Yongjian Fu
Mining Multiple-Level Association Rules In Large Databases, Jiawei Han, Yongjian Fu
Computer Science Faculty Research & Creative Works
A top-down progressive deepening method is developed for efficient mining of multiple-level association rules from large transaction databases based on the Apriori principle. A group of variant algorithms is proposed based on the ways of sharing intermediate results, with the relative performance tested and analyzed. The enforcement of different interestingness measurements to find more interesting rules, and the relaxation of rule conditions for finding `level-crossing' association rules, are also investigated in the paper. Our study shows that efficient algorithms can be developed from large databases for the discovery of interesting and strong multiple-level association rules.
A Systolic Algorithm To Process Compressed Binary Images, Fikret Erçal, Mark Allen, Hao Feng
A Systolic Algorithm To Process Compressed Binary Images, Fikret Erçal, Mark Allen, Hao Feng
Computer Science Faculty Research & Creative Works
A new systolic algorithm which computes image differences in run-length encoded (RLE) format is described. The binary image difference operation is commonly used in many image processing applications including automated inspection systems, character recognition, fingerprint analysis, and motion detection. The efficiency of these operations can be improved significantly with the availability of a fast systolic system that computes the image difference as described in this paper It is shown that for images with a high similarity measure, the time complexity of the systolic algorithm is small and in some cases constant with respect to the image size. The time for …
Join Index Hierarchy: An Indexing Structure For Efficient Navigation In Object-Oriented Databases, Jiawei Han, Zhaohui Xie, Yongjian Fu
Join Index Hierarchy: An Indexing Structure For Efficient Navigation In Object-Oriented Databases, Jiawei Han, Zhaohui Xie, Yongjian Fu
Computer Science Faculty Research & Creative Works
A novel indexing structure - join index hierarchy - is proposed to handle the 'gotos on disk' problem in object-oriented query processing. The method constructs a hierarchy of join indices and transforms a sequence of pointer chasing operations into a simple search in an appropriate join index file, and thus accelerates navigation in object-oriented databases. The method extends the join index structure studied in relational and spatial databases, supports both forward and backward navigations among objects and classes, and localizes update propagations in the hierarchy. Our performance study shows that partial join index hierarchy outperforms several other indexing mechanisms in …
A Model-Based Approach For Compression Of Fingerprint Images, Fikret Erçal, M. Gokmen, Ilker Ersoy
A Model-Based Approach For Compression Of Fingerprint Images, Fikret Erçal, M. Gokmen, Ilker Ersoy
Computer Science Faculty Research & Creative Works
We propose a new fingerprint image compression scheme based on the hybrid model of an image. Our scheme uses the essential steps of a typical automated fingerprint identification system (AFIS) such as enhancement, binarization and thinning to encode fingerprint images. The decoding process is based on reconstructing a hybrid surface by using the gray values on ridges and valleys. In this compression scheme, the ridge skeleton is coded efficiently by using differential chain codes. The valley skeleton is derived from the ridge skeleton and the gray values along the ridge and valley skeletons are encoded using the discrete cosine transform. …
Pi-Web Join In A Web Warehouse, Sanjay Kumar Madria, Wee Keong Ng, Ee-Peng Lim, Sourav S. Bhowmick
Pi-Web Join In A Web Warehouse, Sanjay Kumar Madria, Wee Keong Ng, Ee-Peng Lim, Sourav S. Bhowmick
Computer Science Faculty Research & Creative Works
With the enormous amount of data stored in the World Wide Web, it is increasingly important to design and develop powerful web warehousing tools. The key objective of our web warehousing project, called WHOWEDA (Warehouse of Web Data), is to design and implement a web warehouse that materializes and manages useful information from the web. We introduce the concept of Π-web join in the context of WHOWEDA. Pi-web join operator is a web information manipulation operator to combine relevant web information residing in two web tables. Informally, it is the combination of web join and web project operators which filter …
Cost-Benefit Analysis Of Web Bag In A Web Warehouse, Sanjay Kumar Madria, Wee Keong Ng, Ee-Peng Lim, Sourav S. Bhowmick
Cost-Benefit Analysis Of Web Bag In A Web Warehouse, Sanjay Kumar Madria, Wee Keong Ng, Ee-Peng Lim, Sourav S. Bhowmick
Computer Science Faculty Research & Creative Works
Sets and bags are closely related structures and have been studied in relational databases. A bag is different from a set in that it is sensitive to the number of times an element occurs, while a set is not. In this paper, we introduce the concept of a Web bag in the context of a World Wide Web warehouse called WHOWEDA (WareHouse Of WEb DAta) which we are currently building. Informally, a Web bag is a Web table which allows multiple occurrences of identical Web types. A Web bag helps one to discover useful knowledge from a Web table, such …
A Www Based Software Metrics Environment For Software Process Management And Software Product Quality Improvement, Xiaoqing Frank Liu, Ravi Viswanathan
A Www Based Software Metrics Environment For Software Process Management And Software Product Quality Improvement, Xiaoqing Frank Liu, Ravi Viswanathan
Computer Science Faculty Research & Creative Works
The software process needs to be continuously improved to develop high quality software. However, with increasing specialization in the workforce and decentralization in the workplace, software process planning, monitoring, analysis and dynamic tuning in a heterogeneous distributed environment becomes a challenge. We describe a tool which takes advantage of emerging Internet technology to implement a software metrics environment for software process management and software quality improvement. The tool uses a dimensional analytic model to visualize the software development process. The system offers facilities to monitor the status and quality attributes of projects being developed at multiple sites and on multiple …