Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- China Simulation Federation (3880)
- TÜBİTAK (3106)
- Wright State University (1960)
- Old Dominion University (937)
- Singapore Management University (884)
-
- Washington University in St. Louis (730)
- Embry-Riddle Aeronautical University (590)
- Air Force Institute of Technology (443)
- Missouri University of Science and Technology (440)
- Neutrosophic Systems with Applications (375)
- University of Nebraska - Lincoln (274)
- Chulalongkorn University (235)
- University of Central Florida (188)
- Portland State University (158)
- University of Nevada, Las Vegas (152)
- University of Arkansas, Fayetteville (149)
- University of South Carolina (125)
- Purdue University (118)
- Chapman University (114)
- University for Business and Technology in Kosovo (114)
- University of Kentucky (111)
- University of South Florida (104)
- Technological University Dublin (100)
- California Polytechnic State University, San Luis Obispo (79)
- University of New Haven (77)
- University of Dar es Salaam (74)
- New Jersey Institute of Technology (63)
- Michigan Technological University (61)
- University of Texas at El Paso (59)
- University of Malaya (56)
- Keyword
-
- Machine learning (392)
- Computer Science (351)
- Deep learning (301)
- Department of Computer Science and Engineering (285)
- Engineering (253)
-
- Simulation (216)
- Machine Learning (185)
- Artificial intelligence (169)
- Optimization (164)
- Technical writing (158)
- College of Engineering and Computer Science (157)
- Newsletters (157)
- Science news (157)
- Classification (130)
- Genetic algorithm (120)
- Cybersecurity (115)
- Security (108)
- Reinforcement learning (102)
- Computer Engineering (101)
- Computer vision (101)
- Deep Learning (101)
- Neural networks (99)
- Artificial Intelligence (92)
- Path planning (91)
- Particle swarm optimization (88)
- Algorithms (85)
- Clustering (79)
- Image processing (78)
- Robotics (78)
- Virtual reality (77)
- Publication Year
- Publication
-
- Journal of System Simulation (3880)
- Turkish Journal of Electrical Engineering and Computer Sciences (3106)
- Computer Science & Engineering Syllabi (1312)
- Research Collection School Of Computing and Information Systems (857)
- All Computer Science and Engineering Research (683)
-
- Theses and Dissertations (503)
- Neutrosophic Systems with Applications (375)
- Browse all Theses and Dissertations (308)
- Journal of Digital Forensics, Security and Law (300)
- Electrical and Computer Engineering Faculty Research & Creative Works (282)
- Electronic Theses and Dissertations (249)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (235)
- Electrical & Computer Engineering Theses & Dissertations (217)
- Computer Science and Engineering Faculty Publications (184)
- Annual ADFSL Conference on Digital Forensics, Security and Law (174)
- BITs and PCs Newsletter (157)
- School of Computing: Dissertations, Theses, and Student Research (154)
- Faculty Publications (150)
- Electrical & Computer Engineering Faculty Publications (137)
- Dissertations (121)
- Computer Science Faculty Publications (107)
- USF Tampa Graduate Theses and Dissertations (94)
- Computer Science Faculty Publications and Presentations (83)
- Engineering Faculty Articles and Research (81)
- UBT International Conference (73)
- Electrical & Computer Engineering and Computer Science Faculty Publications (71)
- Graduate Theses and Dissertations (69)
- Tanzania Journal of Engineering and Technology (TJET) (69)
- UNLV Theses, Dissertations, Professional Papers, and Capstones (64)
- Doctoral Dissertations (59)
- Publication Type
Articles 15961 - 15990 of 17307
Full-Text Articles in Computer Sciences
An Algorithm For Locating Fundamental Frequency (F0) Markers In Speech, Princy Dikshit
An Algorithm For Locating Fundamental Frequency (F0) Markers In Speech, Princy Dikshit
Electrical & Computer Engineering Theses & Dissertations
Speech has been the principal form of human communication since it began to evolve at least one hundred thousand years ago. Speech is produced by vibrations of the vocal cords. The rate of vibration of the cords is called fundamental frequency (F0) or pitch. The objective of this thesis is to locate pitch period cycles on a cycle-by-cycle basis. The complexity in identifying pitch cycles stems from the highly irregular nature of human speech. Dynamic programming is used to combine two sources of information for pitch period marking. One source of information is the "local" information corresponding to the location …
Development Of A Systems Engineering Model Of The Chemical Separations Process: Final Report, Yitung Chen, Sean Hsieh
Development Of A Systems Engineering Model Of The Chemical Separations Process: Final Report, Yitung Chen, Sean Hsieh
Separations Campaign (TRP)
The whole chemical separation process is complex to the point that definitely requires certain level of systematic coordination. To perform smoothly and meet the target extraction rates among those processes, this research proposed a general-purpose systems engineering model.
A general purposed systems engineering model, Transmutation Research Program System Engineering Model Project (TRPSEMPro), was developed based on the above design concept. The system model includes four main parts: System Manager, Model Integration, Study Plan, and Solution Viewer. TRPSEMPro can apply not only to chemical separation process, but also a general system model.
Software engineering and Object Oriented Analysis and Design (OOA&D) …
Development Of A Systems Engineering Model Of The Chemical Separations Process, Yitung Chen, Sean Hsieh
Development Of A Systems Engineering Model Of The Chemical Separations Process, Yitung Chen, Sean Hsieh
Separations Campaign (TRP)
The whole chemical separation process is complex to the point that definitely requires certain level of systematic coordination. To perform smoothly and meet the target extraction rates among those processes, this research proposed a general-purpose systems engineering model.
A general purposed systems engineering model, Transmutation Research Program System Engineering Model Project (TRPSEMPro), was developed based on the above design concept. The system model includes four main parts: System Manager, Model Integration, Study Plan, and Solution Viewer. System Manager supervises all the case (problem) creation, and functionality definition. Model Integration identifies chemical extraction processes and their execution sequence. Study Plan is …
Techniques And Patterns For Safe And Efficient Real-Time Middleware, Angelo Corsaro
Techniques And Patterns For Safe And Efficient Real-Time Middleware, Angelo Corsaro
All Computer Science and Engineering Research
Over 90 percent of all microprocessors are now used for real-time and embedded applications. The behavior of these applications is often constrained by the physical world. It is therefore important to devise higher-level languages and middleware that meet conventional functional requirements, as well as dependably and productively enforce real-time constraints. Real-Time Java is emerging as a safe, real-time environment. In this thesis we use it as our experimentation platform; however, our findings are easily adapted to other similar platforms. This thesis provides the following contributions to the study of safe and efficient real-time middleware. First, it identifies potential bottlenecks and …
Tcp Processor: Design, Implementation, Operation, And Usage, David V. Schuehler
Tcp Processor: Design, Implementation, Operation, And Usage, David V. Schuehler
All Computer Science and Engineering Research
There is a critical need to perform advanced data processing on network traffic. In order to accom-plish this, protocol processing must first be performed to reassemble individual network packets into consistent data streams representing the exact dataset being transferred between end systems. This task is currently performed by protocol stacks running on end systems. Similar protocol processing opera-tions are needed to process the data on the interior of the network. Given millions of network connections operating on multi-gigabit per second network links, this task is extremely difficult. The TCP-Processor addresses this challenge. It is a hardware circuit designed to perform …
Logic Programs And Connectionist Networks, Pascal Hitzler, Steffen Holldobler, Anthony K. Seda
Logic Programs And Connectionist Networks, Pascal Hitzler, Steffen Holldobler, Anthony K. Seda
Computer Science and Engineering Faculty Publications
Graphs of the single-step operator for first-order logic programs—displayed in the real plane—exhibit self-similar structures known from topological dynamics, i.e., they appear to be fractals, or more precisely, attractors of iterated function systems. We show that this observation can be made mathematically precise. In particular, we give conditions which ensure that those graphs coincide with attractors of suitably chosen iterated function systems, and conditions which allow the approximation of such graphs by iterated function systems or by fractal interpolation. Since iterated function systems can easily be encoded using recurrent radial basis function networks, we eventually obtain connectionist systems which …
Default Reasoning Over Domains And Concept Hierarchies, Pascal Hitzler
Default Reasoning Over Domains And Concept Hierarchies, Pascal Hitzler
Computer Science and Engineering Faculty Publications
W.C. Rounds and G.-Q. Zhang have proposed to study a form of disjunctive logic programming generalized to algebraic domains [1]. This system allows reasoning with information which is hierarchically structured and forms a (suitable) domain. We extend this framework to include reasoning with default negation, giving rise to a new nonmonotonic reasoning framework on hierarchical knowledge which encompasses answer set programming with extended disjunctive logic programs. We also show that the hierarchically structured knowledge on which programming in this paradigm can be done, arises very naturally from formal concept analysis. Together, we obtain a default reasoning paradigm for conceptual …
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 21, Number 1, September 2004, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 21, Number 1, September 2004, 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.
Run-Time Modification Of The Class Hierarchy In A Live Java Development Environment, Joel R. Brandt, Kenneth J. Goldman
Run-Time Modification Of The Class Hierarchy In A Live Java Development Environment, Joel R. Brandt, Kenneth J. Goldman
All Computer Science and Engineering Research
Class hierarchy design is central to object-oriented software development. However, it is sometimes difficult for developers to anticipate all the implications of a design until implementation is underway. To support experimentation with different designs, we extend prior work on live development environments to allow run-time modification of the class hierarchy. The result is a more fluid object-oriented development process, in which immediate feedback from the executing program can be used to guide hierarchy design. This paper presents a framework and developer support for run-time modification of class inheritance relations in JPie, a live visual programming environment for Java. Most notably, …
A Fast And Simple Algorithm For Computing M Shortest Paths In Stage Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar
A Fast And Simple Algorithm For Computing M Shortest Paths In Stage Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar
Electrical & Computer Engineering Faculty Research
We consider the problem of computing m shortest paths between a source node s and a target node t in a stage graph. Polynomial time algorithms known to solve this problem use complicated data structures. This paper proposes a very simple algorithm for computing all m shortest paths in a stage graph efficiently. The proposed algorithm does not use any complicated data structure and can be implemented in a straightforward way by using only array data structure. This problem appears as a sub-problem for planning risk reduced multiple k-legged trajectories for aerial vehicles.
A Development Framework For Rapid Metaheuristics Hybridization, Hoong Chuin Lau, M. K. Lim, W. C. Wan, S. Halim
A Development Framework For Rapid Metaheuristics Hybridization, Hoong Chuin Lau, M. K. Lim, W. C. Wan, S. Halim
Research Collection School Of Computing and Information Systems
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to specific problems. For this reason, a software tool for rapid prototyping of algorithms would save considerable resources. This work presents a generic software framework that reduces development time through abstract classes and software reuse, and more importantly, aids design with support of user-defined strategies and hybridization of meta-heuristics. Most interestingly, we propose a novel way of redefining hybridization with the use of the "request and response" metaphor, which form an abstract concept for hybridization. Different hybridization schemes can now be formed …
A Two-Level Framework For Coalition Formation Via Optimization And Agent Negotiation, Hoong Chuin Lau, Lei Zhang
A Two-Level Framework For Coalition Formation Via Optimization And Agent Negotiation, Hoong Chuin Lau, Lei Zhang
Research Collection School Of Computing and Information Systems
We present a two-level coalition formation approach based on a centralized optimization model on the upper level, and a distributed agent-negotiation model on the lower level. This approach allows us to balance agent self-interests against a high joint utility. Experimental results show that the two-level coalition formation mechanism will increase not only the overall utility of the coalition, but also the individual utility of most participating agents. The results also suggest it is better for the agents to be partially cooperative rather than either fully cooperative or self-interested in our setting.
Direct Least-Squares Ellipse Fitting, Jane Courtney, Annraoi Depaor
Direct Least-Squares Ellipse Fitting, Jane Courtney, Annraoi Depaor
Conference Papers
Many biological and astronomical forms can be best represented by ellipses. While some more complex curves might represent the shape more accurately, ellipses have the advantage that they are easily parameterised and define the location, orientation and dimensions of the data more clearly. In this paper, we present a method of direct least-squares ellipse fitting by solving a generalised eigensystem. This is more efficient and more accurate than many alternative approaches to the ellipse-fitting problem such as fuzzy c-shells clustering and Hough transforms. This method was developed for human body modelling as part of a larger project to design a …
Scheduling Algorithms For Cioq Switches, Prashanth Pappu, Jonathan S. Turner
Scheduling Algorithms For Cioq Switches, Prashanth Pappu, Jonathan S. Turner
All Computer Science and Engineering Research
Most scalable switches are required to buffer packets at both their inputs and outputs to overcome the slow memory speeds of packet queues. This thesis deals with the design of scheduling algorithms for such Combined Input and Output Queued (CIOQ) switches. For crossbar based CIOQ switches, we demonstrate the underperformance of commercially used scheduling algorithms under overload traffic conditions using targeted stress tests and present ideas to develop robust, stress resistant versions of these algorithms that are still simple enough to be implemented in high speed switches. To regulate the flow of traffic in buffered, multi-stage switches, we introduce a …
Feedback Linearization Based Power System Stabilizer Design With Control Limits, Wenxin Liu, Ganesh K. Venayagamoorthy, Donald C. Wunsch, Jagannathan Sarangapani
Feedback Linearization Based Power System Stabilizer Design With Control Limits, Wenxin Liu, Ganesh K. Venayagamoorthy, Donald C. Wunsch, Jagannathan Sarangapani
Electrical and Computer Engineering Faculty Research & Creative Works
In power system controls, simplified analytical models are used to represent the dynamics of power system and controller designs are not rigorous with no stability analysis. One reason is because the power systems are complex nonlinear systems which pose difficulty for analysis. This paper presents a feedback linearization based power system stabilizer design for a single machine infinite bus power system. Since practical operating conditions require the magnitude of control signal to be within certain limits, the stability of the control system under control limits is also analyzed. Simulation results under different kinds of operating conditions show that the controller …
Transport Logistics Planning With Service-Level Constraints, Hoong Chuin Lau, K. M. Ng, Xintao Wu
Transport Logistics Planning With Service-Level Constraints, Hoong Chuin Lau, K. M. Ng, Xintao Wu
Research Collection School Of Computing and Information Systems
In this paper, we study a logistics problem arising in military transport planning. A military organization operates a large fleet of vehicles in a depot to serve the requests of various operational units. Each request has a fixed start and end time, and is served by a prescribed number of vehicles. We address the following two problems: (1) how many vehicles are at least needed to meet a given service level of requests; and (2) suppose we allow each request to shift its start time by a constant duration, call all the requests be met? A Niche genetic algorithm, together …
Discovering Transcriptional Regulatory Rules From Gene Expression And Tf-Dna Binding Data By Decision Tree Learning, Jianhua Ruan, Weixiong Zhang
Discovering Transcriptional Regulatory Rules From Gene Expression And Tf-Dna Binding Data By Decision Tree Learning, Jianhua Ruan, Weixiong Zhang
All Computer Science and Engineering Research
Background: One of the most promising but challenging task in the post-genomic era is to reconstruct the transcriptional regulatory networks. The goal is to reveal, for each gene that responds to a certain biological event, which transcription factors affect its transcription, and how several transcription factors coordinate to accomplish specific regulations. Results: Here we propose a supervised machine learning approach to address these questions. We build decision trees to associate the expression level of a gene with the transcription factor binding data of its promoter. From the decision trees, we extract regulatory rules that specify how the binding of a …
A Framework For Trajectory Based Visual Event Retrieval, Ilker Ersoy, Filiz Bunyak, S. R. Subramanya
A Framework For Trajectory Based Visual Event Retrieval, Ilker Ersoy, Filiz Bunyak, S. R. Subramanya
Electrical and Computer Engineering Faculty Research & Creative Works
This paper presents a framework of a system for the query and retrieval of video data based on video events in huge video repositories. the events are formulated using domain-independent event primitives which are represented by spatio-temporal relationships between objects in the video scenes. Complex events are expressible as combinations of simpler events. This facilitates support of event queries from a variety of points of view. in addition, the framework is expected to provide adaptability of the framework to multiple domains.
Taking Dcop To The Real World: Efficient Complete Solutions For Distributed Event Scheduling, Rajiv Maheswaran, Milind Tambe, Emma Bowring, Jonathan Pearce, Pradeep Varakantham
Taking Dcop To The Real World: Efficient Complete Solutions For Distributed Event Scheduling, Rajiv Maheswaran, Milind Tambe, Emma Bowring, Jonathan Pearce, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Distributed Constraint Optimization (DCOP) is an elegant formalism relevant to many areas in multiagent systems, yet complete algorithms have not been pursued for real world applications due to perceived complexity. To capably capture a rich class of complex problem domains, we introduce the Distributed Multi-Event Scheduling (DiMES) framework and design congruent DCOP formulations with binary constraints which are proven to yield the optimal solution. To approach real-world efficiency requirements, we obtain immense speedups by improving communication structure and precomputing best case bounds. Heuristics for generating better communication structures and calculating bound in a distributed manner are provided and tested on …
Neural Network Stabilizing Control Of Single Machine Power System With Control Limits, Wenxin Liu, Jagannathan Sarangapani, Ganesh K. Venayagamoorthy, Donald C. Wunsch, Mariesa Crow
Neural Network Stabilizing Control Of Single Machine Power System With Control Limits, Wenxin Liu, Jagannathan Sarangapani, Ganesh K. Venayagamoorthy, Donald C. Wunsch, Mariesa Crow
Electrical and Computer Engineering Faculty Research & Creative Works
Power system stabilizers are widely used to generate supplementary control signals for the excitation system in order to damp out the low frequency oscillations. This paper proposes a stable neural network (NN) controller for the stabilization of a single machine infinite bus power system. In the power system control literature, simplified analytical models are used to represent the power system and the controller designs are not based on rigorous stability analysis. This work overcomes the two major problems by using an accurate analytical model for controller development and presents the closed-loop stability analysis. The NN is used to approximate the …
Qos Provisioning For Multi-Class Traffic In Wireless Networks, Mona El-Kadi Rizvi
Qos Provisioning For Multi-Class Traffic In Wireless Networks, Mona El-Kadi Rizvi
Computer Science Theses & Dissertations
Physical constraints, bandwidth constraints and host mobility all contribute to the difficulty of providing Quality of Service (QoS) guarantees in wireless networks. There is a growing demand for wireless networks to support all the services that are available on wired networks. These diverse services, such as email, instant messaging, web browsing, video conferencing, telephony and paging all place different demands on the network, making QoS provisioning for wireless networks that carry multiple classes of traffic a complex problem. We have developed a set of admission control and resource reservation schemes for QoS provisioning in multi-class wireless networks.
We present three …
Fuzzy Modeling Of Electromagnetic Emissions From Portable Electronic Devices Onboard Commercial Aircraft, Madiha Jamil Jafri
Fuzzy Modeling Of Electromagnetic Emissions From Portable Electronic Devices Onboard Commercial Aircraft, Madiha Jamil Jafri
Electrical & Computer Engineering Theses & Dissertations
The use of Portable Electronic Devices (PEDs) is prohibited during take-off and landing of an aircraft because PEDs may emit signals that can interfere with the aircraft's navigation and communication systems. The electromagnetic interference (EMI) on the aircraft's electronics due to PEDs emissions is examined for Boeing 737 and 747 aircraft. This work, funded by the NASA Graduate Researchers Program, uses Interference Path Loss (IPL) data, collected by researchers from NASA Langley Research Center, Eagles Wings Inc. and United Airlines on several out-of-service United B737 and B747 airplanes.
B737 and B747 IPL data has been analyzed using a graphical analysis …
Interactive Land Use Vrml Application Using Servlet Assist, Suresh Chitithoti
Interactive Land Use Vrml Application Using Servlet Assist, Suresh Chitithoti
Electrical & Computer Engineering Theses & Dissertations
The integration of VRML and Servlet technologies has the potential to revolutionize web-based simulation visualization. The Interactive Land Use VRML Application (ILUVA) uses Java Servlets enabling one to perform urban planning by taking a virtual land area and add buildings, roadways, landscaping, and other features. The Virtual Reality Modeling Language (VRML) is a web-based technology for specifying and delivering interactive three-dimensional visualizations over a browser. The Java Servlet technology offers several powerful capabilities such as user authentication, session management, database connectivity for maintaining several possibly simultaneous user sessions, and dynamically generated VRML. Save and restore capabilities for any applications are …
Cs 340: Programming Language Workshop In Java, Ronald F. Taylor
Cs 340: Programming Language Workshop In Java, Ronald F. Taylor
Computer Science & Engineering Syllabi
This course is designed as a self-study in Java. You are expected to work independently to learn the Java language and solve a set of programming problems assigned to you using latest Java SDK available at http://java.sun.com or other software as approved by the instructor. There are no exams. We officially meet only once in a quarter. However, I will be available in the posted office hours for clarifications and general discussion of the programming assignments. Do not expect support in debugging badly documented code.
Cs 214: Object Oriented Programming, Roddy Keish
Cs 214: Object Oriented Programming, Roddy Keish
Computer Science & Engineering Syllabi
No abstract provided.
Notes On Equilibria In Symmetric Games, Shih-Fen Cheng, Daniel M. Reeves, Yevgeniy Vorobeychik, Michael P. Wellman
Notes On Equilibria In Symmetric Games, Shih-Fen Cheng, Daniel M. Reeves, Yevgeniy Vorobeychik, Michael P. Wellman
Research Collection School Of Computing and Information Systems
In a symmetric game, every player is identical with respect to the game rules. We show that a symmetric 2strategy game must have a pure-strategy Nash equilibrium. We also discuss Nash’s original paper and its generalized notion of symmetry in games. As a special case of Nash’s theorem, any finite symmetric game has a symmetric Nash equilibrium. Furthermore, symmetric infinite games with compact, convex strategy spaces and continuous, quasiconcave utility functions have symmetric pure-strategy Nash equilibria. Finally, we discuss how to exploit symmetry for more efficient methods of finding Nash equilibria.
Teabag: A Debugger For Curry, Stephen Lee Johnson
Teabag: A Debugger For Curry, Stephen Lee Johnson
Dissertations and Theses
This thesis describes TeaBag, which is a debugger for functional logic computations. TeaBag is an accessory of a virtual machine currently under development. A distinctive feature of this machine is its operational completeness of computations, which places novel demands on a debugger. This thesis describes the features of TeaBag, in particular the handling of non-determinism, the ability to control nondeterministic steps, to remove context information, to toggle eager evaluation, and to set breakpoints on both functions and terms. This thesis also describes TeaBag's architecture and its interaction with the associated virtual machine. Finally, some debugging sessions of defective programs are …
Review Of The Product Development Process And Information Flow In The Manufacturing Industry: Problems And A Possible Wav Forward, E Opiyo
Tanzania Journal of Engineering and Technology (TJET)
No abstract provided.
Variations On Particle Swarm Optimization And Their Experimental Evaluation On Maximum Satisfiability, Susan A Abdelshahid
Variations On Particle Swarm Optimization And Their Experimental Evaluation On Maximum Satisfiability, Susan A Abdelshahid
Archived Theses and Dissertations
No abstract provided.
A Spatiotemporal Query Service For Mobile Users In Sensor Networks, Chenyang Lu, Guoliang Xing, Octav Chipara, Chien-Liang Fok, Sangeeta Bhattacharya
A Spatiotemporal Query Service For Mobile Users In Sensor Networks, Chenyang Lu, Guoliang Xing, Octav Chipara, Chien-Liang Fok, Sangeeta Bhattacharya
All Computer Science and Engineering Research
This paper presents MobiQuery, a spatiotemporal query service that allows mobile users to periodically gather information from their surrounding areas through a wireless sensor network. A key advantage of MobiQuery lies in its capability to meet stringent spatiotemporal performance constraints crucial to many applications. These constraints include query latency, data freshness and fidelity, and changing query areas due to user mobility. A novel just-in-time prefetching algorithm enables MobiQuery to main-tain robust spatiotemporal guarantees even when nodes op-erate under extremely low duty cycles. Furthermore, it sig-nificantly reduces the storage cost and network contention caused by continuous queries from mobile users. We …