A survey of xml tree patterns

This paper provides a comprehensive survey of research on tree patterns (TPs) and related issues for querying XML data over the past 10 years. Tree patterns are graphical representations of queries over data trees that are matched against an input data tree to answer queries. The paper outlines and compares features of different tree pattern models and reviews two main approaches for optimizing tree pattern matching: pattern tree minimization and holistic matching. It aims to give a global overview of the significant research on using tree patterns to query XML data.

ECWAY TECHNOLOGIES
IEEE PROJECTS & SOFTWARE DEVELOPMENTS
OUR OFFICES @ CHENNAI / TRICHY / KARUR / ERODE / MADURAI / SALEM / COIMBATORE
CELL: +91 98949 17187, +91 875487 2111 / 3111 / 4111 / 5111 / 6111
VISIT: www.ecwayprojects.com MAIL TO: ecwaytechnologies@gmail.com

A SURVEY OF XML TREE PATTERNS

ABSTRACT:

The aim of this paper is thus to provide a global and synthetic overview of more than 10 years of
research about TPs and closely related issues with XML becoming a ubiquitous language for
data interoperability purposes in various domains, efficiently querying XML data is a critical
issue.

This has lead to the design of algebraic frameworks based on tree-shape patterns akin to the treestructured data model of XML. Tree patterns are graphic representations of queries over data
trees. They are actually matched against an input data tree to answer a query. Since the turn of
the 21st century, an astounding research effort has been focusing on tree pattern models and
matching optimization.

This paper is a comprehensive survey of these topics, in which we outline and compare the
various features of tree patterns. We also review and discuss the two main families of approaches
for optimizing tree pattern matching, namely pattern tree minimization and holistic matching.
We finally present actual tree pattern-based developments, to provide a global overview of this
significant research topic.

This paper provides a comprehensive survey of research on tree patterns (TPs) and related issues for querying XML data over the past 10 years. It outlines and compares various features of tree patterns and reviews two main approaches for optimizing tree pattern matching: pattern tree minimization and holistic matching. The paper aims to provide a global overview of the significant research on tree pattern-based developments for efficiently querying XML data.

A survey of xml tree patterns

JPINFOTECH JAYAPRAKASH

Claremont Report on Database Research: Research Directions (Le Gruenwald)

infoblog

Final libre(1)

Samad Keramatfar

This document analyzes the relationships between university, industry, and government (the "Triple Helix") in the Netherlands, Russia, Turkey, and Iran using webometrics methods. It finds that in the first method using search hits, the Netherlands shows the most integration between the three sectors followed by Russia, Turkey, and Iran. However, the second method looking at file types finds the Netherlands has the highest value followed by Turkey, Iran, and Russia. The document aims to measure innovation infrastructure in Iran compared to the other countries.

Experimental Economics and Machine Learning workshop

Dmitrii Ignatov

Semantic integration of authoritative and VGI

Jimena Martínez

This document discusses integrating authoritative and volunteered geographic information using an ontological approach. It presents the problems caused by semantic heterogeneity between different data sources. The proposed approach uses a domain ontology and R2RML mappings to provide a common conceptualization and allow flexible integration of datasets in RDF. Current work is analyzing semantic heterogeneity in OpenStreetMap tags by studying how tags used for real-world features vary over spatial scale and time. Future work includes developing the ontology further and creating a user interface for the R2RML mappings.

A secure payment scheme with low communication and processing overhead for mu...

RACE is a report-based payment scheme proposed for multihop wireless networks to encourage node cooperation. It aims to reduce communication and processing overhead compared to existing receipt-based schemes. Under RACE, nodes submit lightweight payment reports without signatures to an accounting center. The center can clear fair reports with little overhead by checking consistency between reports. For cheating reports, the center requests security tokens from nodes to identify the specific cheaters. RACE can identify cheaters by requesting tokens from few nodes rather than all involved. It also uses evidence aggregation to reduce storage needs. Analysis and simulation show RACE has lower overhead than receipt-based schemes while still securing payments and identifying cheaters accurately.

An investigation on lte mobility management

LTE uses the Mobility Management Entity (MME) to handle mobility management differently than 3G networks. The MME is responsible for mobility management and is connected to evolved Node Bs (cells) that are grouped into Tracking Areas (TAs), which are further grouped into TA Lists (TALs). When a User Equipment (UE) moves out of its current TAL, it reports its new location to the MME. This paper investigates the performance of LTE paging, where the MME pages cells, TAs, or TALs to locate a UE, and provides guidelines for the best paging sequence.

This paper provides a comprehensive survey of research on tree patterns (TPs) and related issues for querying XML data over the past 10 years. Tree patterns are graphical representations of queries over data trees that are matched against an input data tree to answer queries. The paper outlines and compares various features of tree patterns and reviews two main approaches for optimizing tree pattern matching: pattern tree minimization and holistic matching. It aims to provide a global overview of the significant research topic of tree pattern-based querying of XML data.

Android ranking on data manifold with sink points

ECWAY Technologies provides IEEE projects and software development services from its offices in multiple cities across India. The document discusses a novel ranking approach called Manifold Ranking with Sink Points (MRSP) that addresses diversity, relevance, and importance in ranking. MRSP uses manifold ranking over the data manifold to find the most relevant objects while turning already ranked objects into "sink points" to prevent redundant objects from receiving high ranks. Experimental results on update summarization and query recommendation tasks showed MRSP performed strongly compared to existing ranking approaches by better addressing the importance of diversity in ranking.

Analysis of distance based location management in wireless communication netw...

This document analyzes distance-based location management schemes (DBLMS) in wireless communication networks. A Markov chain mobility model is developed to describe a mobile terminal's movement in a 2D cellular structure. Classical renewal theory is used to analyze the expected number of paging area boundary crossings and cost of the distance-based location update method for two different call handling models. The analysis makes it possible to find the optimal distance threshold that minimizes the total cost of location management in a DBLMS.

Android anonymization of centralized and distributed social networks by sequ...

This document summarizes an algorithm for anonymizing centralized and distributed social networks through sequential clustering. It presents two variants of an anonymization algorithm that significantly outperform the leading SaNGreeA algorithm. The algorithms are then adapted into secure distributed versions to anonymize networks where data is split between multiple data holders, preserving privacy without revealing links between nodes controlled by other data holders.

Adaptive image search with hash codes

1. The document introduces an approach to enable query-adaptive ranking of images returned from image search based on hash codes. 2. It achieves this by first learning offline bitwise weights of hash codes for predefined semantic concept classes, and formulating the weight learning as a quadratic programming problem. 3. Query-adaptive weights are then computed online by evaluating the proximity between a query and semantic concept classes. This allows ranking images by a finer-grained weighted Hamming distance rather than the original Hamming distance.

Android a generalized flow-based method for analysis of implicit relationshi...

The document proposes a new method for analyzing implicit relationships between objects on Wikipedia pages. The method uses a generalized maximum flow approach that considers distance, connectivity, and cocitation, addressing limitations of prior methods. Experiments show the new method more appropriately measures relationship strength. Additionally, the method can identify elucidatory objects that help explain relationships.

Advanced remote accident information system using gsm

This document describes an advanced remote accident information system using GSM that monitors vehicle conditions during travel and informs family members if an accident occurs. The system uses a piezoelectric sensor to detect vibrations during an accident and sends a signal to a microcontroller. The microcontroller processes location information from a GPS receiver and sends an SMS alert about the accident and location to a predefined mobile number using a GSM modem. This allows the system to immediately alert emergency services to the accident location.

Java a survey of xml tree patterns

A survey of xml tree patterns

Final Year IEEE Projects, Final Year Projects, Academic Final Year Projects, Academic Final Year IEEE Projects, Academic Final Year IEEE Projects 2013, Academic Final Year IEEE Projects 2014, IEEE JAVA, .NET Projects, 2013 IEEE JAVA, .NET Projects, 2013 IEEE JAVA, .NET Projects in Chennai, 2013 IEEE JAVA, .NET Projects in Trichy, 2013 IEEE JAVA, .NET Projects in Karur, 2013 IEEE JAVA, .NET Projects in Erode, 2013 IEEE JAVA, .NET Projects in Madurai, 2013 IEEE JAVA, .NET Projects in Salem, 2013 IEEE JAVA, .NET Projects in Coimbatore, 2013 IEEE JAVA, .NET Projects in Tirupur, 2013 IEEE JAVA, .NET Projects in Bangalore, 2013 IEEE JAVA, .NET Projects in Hydrabad, 2013 IEEE JAVA, .NET Projects in Kerala, 2013 IEEE JAVA, .NET Projects in Namakkal, IEEE JAVA, .NET Image Processing, IEEE JAVA, .NET Face Recognition, IEEE JAVA, .NET Face Detection, IEEE JAVA, .NET Brain Tumour, IEEE JAVA, .NET Iris Recognition, IEEE JAVA, .NET Image Segmentation, Final Year JAVA, .NET Projects in Pondichery, Final Year JAVA, .NET Projects in Tamilnadu, Final Year JAVA, .NET Projects in Chennai, Final Year JAVA, .NET Projects in Trichy, Final Year JAVA, .NET Projects in Erode, Final Year JAVA, .NET Projects in Karur, Final Year JAVA, .NET Projects in Coimbatore, Final Year JAVA, .NET Projects in Tirunelveli, Final Year JAVA, .NET Projects in Madurai, Final Year JAVA, .NET Projects in Salem, Final Year JAVA, .NET Projects in Tirupur, Final Year JAVA, .NET Projects in Namakkal, Final Year JAVA, .NET Projects in Tanjore, Final Year JAVA, .NET Projects in Coimbatore, Final Year JAVA, .NET Projects in Bangalore, Final Year JAVA, .NET Projects in Hydrabad, Final Year JAVA, .NET Projects in Kerala, Final Year JAVA, .NET IEEE Projects in Pondichery, Final Year JAVA, .NET IEEE Projects in Tamilnadu, Final Year JAVA, .NET IEEE Projects in Chennai, Final Year JAVA, .NET IEEE Projects in Trichy, Final Year JAVA, .NET IEEE Projects in Erode, Final Year JAVA, .NET IEEE Projects in Karur, Final Year JAVA, .NET IEEE Projects in Coimbatore, Final Year JAVA, .NET IEEE Projects in Tirunelveli, Final Year JAVA, .NET IEEE Projects in Madurai, Final Year JAVA, .NET IEEE Projects in Salem, Final Year JAVA, .NET IEEE Projects in Tirupur, Final Year JAVA, .NET IEEE Projects in Namakkal, Final Year JAVA, .NET IEEE Projects in Tanjore, Final Year JAVA, .NET IEEE Projects in Coimbatore, Final Year JAVA, .NET IEEE Projects in Bangalore, Final Year JAVA, .NET IEEE Projects in Hydrabad, Final Year JAVA, .NET IEEE Projects in Kerala, Final Year IEEE MATLAB Projects, Final Year Projects, Academic Final Year Projects, Academic Final Year IEEE MATLAB Projects, Academic Final Year IEEE MATLAB Projects 2013, Academic Final Year IEEE MATLAB Projects 2014, IEEE MATLAB Projects, 2013 IEEE MATLAB Projects, 2013 IEEE MATLAB Projects in Chennai, 2013 IEEE MATLAB Projects in Trichy, 2013 IEEE MATLAB Projects in Karur, 2013 IEEE MATLAB Projects in Erode, 2013 IEEE MATLAB Projects in Madurai, 2013 IEEE MATLAB

A survey of xml tree patterns

Android a survey of xml tree patterns

Java a survey of xml tree patterns

ecwayerode

A survey of xml tree patterns

IEEEFINALYEARPROJECTS

Effective Data Retrieval in XML using TreeMatch Algorithm

This document summarizes research on effective data retrieval from XML documents using the TreeMatch algorithm. It begins with an abstract that introduces the TreeMatch algorithm and its ability to provide fast data retrieval from XML documents by matching tree-shaped patterns. It then reviews related work on XML tree matching algorithms and their issues like suboptimality. The document proposes using the TreeMatch algorithm to overcome issues with wildcards, negation, and siblings when querying XML documents with XPath or XQuery. It provides details on the TreeMatch algorithm and its ability to process different types of XML tree pattern queries efficiently while avoiding intermediate results. In conclusion, it states that the TreeMatch algorithm can efficiently handle three types of XML tree pattern queries and overcome the problem of sub

Xml data clustering an overview

unyil96

The document provides an overview of approaches for clustering XML data based on structure and content. It first outlines applications where XML clustering is useful, including XML query processing and data integration. It then presents a generic framework for XML clustering with three phases: data representation, similarity computation, and clustering/grouping. The document surveys current approaches and aims to classify them and identify common features. It also discusses challenges in XML clustering and future research directions.

A Survey on Heterogeneous Data Exchange using Xml

This document summarizes a research paper on heterogeneous data exchange using XML. It discusses how XML has become a standard for data transmission due to its flexibility, extensibility and ability to represent heterogeneous data. The document then reviews related work on XML data exchange and mapping between relational and XML models. It also describes the process of exporting data from a source database to XML, importing XML data by validating, transforming and storing it in the target database, and transmitting data between different servers.

Heterogeneous fuzzy xml data integration based on structrual and semantic sim...

Amir Shokri

Answering approximate-queries-over-xml-data

Shakas Technologies

Language Models for Information Retrieval

Dustin Smith

The document provides background information on Christopher Manning, Prabhakar Raghavan, and Hinrich Schutze, who are authors of the book "Introduction to Information Retrieval: Language models for information retrieval". It then outlines the presentation which discusses language models for information retrieval, including query likelihood models, estimating query generation probabilities, and experiments comparing language modeling approaches to other IR techniques.

XML Retrieval - A Slot Filling Approach

鍾誠陳鍾誠

A novel approach towards developing a statistical dependent and rank

IAEME Publication

The document proposes a novel approach for keyword search over XML data that consists of three main steps: 1) Indexing the XML data into two indices to facilitate searching. 2) Selecting the exact "T-type" node, which is the desired search node, using statistical formulas. 3) Performing the data search and ranking the results using a designed ranking measure. The approach aims to improve upon existing work by more effectively selecting the T-type node and ranking search results.

call for paper 2012, hard copy of journal, research paper publishing, where t...

IJERD Editor

The document proposes a Schema and Design Free Keyword Search Interface (SDFKI) approach for XML databases that allows users to query the databases using keywords without requiring knowledge of the database schema or design. SDFKI first normalizes the XML database to minimize redundancy and ambiguity. It then infers the user's search intention from the keywords and identifies the most relevant XML node types to search based on guidelines related to keyword coverage and information content/noise. SDFKI ranks results using a novel XRank approach to surface the most relevant answers first for the user. The approach was tested and found to be effective at keyword search over XML databases in a schema-independent manner.

Viewers also liked

Android a survey of xml tree patterns

This paper provides a comprehensive survey of research on tree patterns (TPs) and related issues for querying XML data over the past 10 years. Tree patterns are graphical representations of queries over data trees that are matched against an input data tree to answer queries. The paper outlines and compares various features of tree patterns and reviews two main approaches for optimizing tree pattern matching: pattern tree minimization and holistic matching. It aims to provide a global overview of the significant research topic of tree pattern-based querying of XML data.

Android ranking on data manifold with sink points

Analysis of distance based location management in wireless communication netw...

Android anonymization of centralized and distributed social networks by sequ...

Adaptive image search with hash codes

Android a generalized flow-based method for analysis of implicit relationshi...

Advanced remote accident information system using gsm

Viewers also liked (7)

Android a survey of xml tree patterns

Android ranking on data manifold with sink points

Analysis of distance based location management in wireless communication netw...

Android anonymization of centralized and distributed social networks by sequ...

Adaptive image search with hash codes

Android a generalized flow-based method for analysis of implicit relationshi...

Advanced remote accident information system using gsm

Similar to A survey of xml tree patterns

Java a survey of xml tree patterns

A survey of xml tree patterns

A survey of xml tree patterns

Android a survey of xml tree patterns

Java a survey of xml tree patterns

ecwayerode

A survey of xml tree patterns

IEEEFINALYEARPROJECTS

Effective Data Retrieval in XML using TreeMatch Algorithm

Xml data clustering an overview

unyil96

A Survey on Heterogeneous Data Exchange using Xml

Heterogeneous fuzzy xml data integration based on structrual and semantic sim...

Amir Shokri

Answering approximate-queries-over-xml-data

Shakas Technologies

Language Models for Information Retrieval

Dustin Smith

XML Retrieval - A Slot Filling Approach

鍾誠陳鍾誠

A novel approach towards developing a statistical dependent and rank

IAEME Publication

call for paper 2012, hard copy of journal, research paper publishing, where t...

IJERD Editor

Welcome to International Journal of Engineering Research and Development (IJERD)

IJERD Editor

call for paper 2012, hard copy of journal, research paper publishing, where to publish research paper, journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals, yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal

TRANSFORMATION RULES FOR BUILDING OWL ONTOLOGIES FROM RELATIONAL DATABASES

csandit

Relational Databases (RDB) are used as the backend database by most of information systems. RDB encapsulate conceptual model and metadata needed in the ontology construction. Schema mapping is a technique that is used by all existing approaches for ontology building from RDB. However, most of those methods use poor transformation rules that prevent advanced database mining for building rich ontologies. In this paper, we propose transformation rules for building owl ontologies from RDBs. It allows transforming all possible cases in RDBs into ontological constructs. The proposed rules are enriched by analyzing stored data to detect disjointness and totalness constraints in hierarchies, and calculating the participation level of tables in n-ary relations. In addition, our technique is generic; hence it can be applied to any RDB. The proposed rules were evaluated using a normalized and open RDB. The obtained ontology is richer in terms of non- taxonomic relationships.

Intake 37 ef1

Mahmoud Ouf

The Entity Framework is an object-relational mapper that bridges the gap between object-oriented programming and relational databases. It generates business objects and entities from database tables and allows CRUD operations and managing relationships. Benefits include writing data access logic in higher-level languages and replacing the underlying data store without much overhead. The Entity Framework architecture includes an Entity Data Model that maps objects to the database using three layers - conceptual, storage, and mapping. The EDM can now be created using database first, model first, or code only approaches.

Closing the Gap: Data Models for Documentary Linguistics

Baden Hughes

This document discusses challenges in managing linguistic data electronically and proposes formal data encoding models. It notes the increasing amounts of linguistic data from fieldwork and issues with disparate encoding formats. Recently developed models address lexicons, interlinear texts, paradigms, syntactic trees, and annotation standards. These new models enable new types of data exploration and manipulation while reducing barriers to use. They may affect linguistic analysis by making some types easier and discovering new possibilities and challenges.

Similar to A survey of xml tree patterns (19)

Java a survey of xml tree patterns

A survey of xml tree patterns

Android a survey of xml tree patterns

Java a survey of xml tree patterns

A survey of xml tree patterns

Effective Data Retrieval in XML using TreeMatch Algorithm

Xml data clustering an overview

A Survey on Heterogeneous Data Exchange using Xml

Heterogeneous fuzzy xml data integration based on structrual and semantic sim...

Answering approximate-queries-over-xml-data

Language Models for Information Retrieval

XML Retrieval - A Slot Filling Approach

A novel approach towards developing a statistical dependent and rank

call for paper 2012, hard copy of journal, research paper publishing, where t...

Welcome to International Journal of Engineering Research and Development (IJERD)

TRANSFORMATION RULES FOR BUILDING OWL ONTOLOGIES FROM RELATIONAL DATABASES

Intake 37 ef1

Closing the Gap: Data Models for Documentary Linguistics

More from Ecway2004

Covering points of interest with mobile sensors

Ecway Technologies provides IEEE projects and software developments from its offices located in multiple cities across Tamil Nadu, India. The company's website and contact information is provided. The document discusses an algorithm for optimizing the autonomous deployment of mobile sensors to cover predefined Points of Interest while maintaining connectivity between the sensors and a base station. Each sensor moves toward a Point of Interest but also maintains connectivity with a subset of neighboring sensors that are part of a Relative Neighborhood Graph, which is reduced to provide global connectivity locally. The deployment scheme aims to minimize connectivity sensors and maximize monitoring sensors. Analytical results, simulations, and a practical implementation demonstrate the efficiency of the algorithm.

Coloring based inter-wban scheduling for mobile wireless body area networks

This document describes a study on inter-WBAN scheduling for mobile wireless body area networks. The study proposes a random incomplete coloring algorithm with low time complexity and high spatial reuse to overcome interference between wireless body area networks. Simulation results show that the proposed coloring algorithm effectively overcomes inter-WBAN interference and supports higher system throughput in various mobile WBAN scenarios compared to conventional coloring methods.

Code modulation based encryption & decryption technique for secure communicat...

This document describes a code modulation based encryption and decryption technique for secure wireless communication. The system has a transmitter section and receiver section, each designed around a microcontroller. At the transmitter, data typed into a PC is encrypted using the microcontroller and transmitted via RF. At the receiver, the encrypted data is received, decoded by the microcontroller, and displayed on the PC. To view the actual data, a password must be entered which decrypts the cipher text into plaintext. The block diagram shows the transmitter components include an encoder, microcontroller, MAX232, and RF transmitter. The receiver components include a decoder, microcontroller, MAX232, and RF receiver.

Clustering sentence level text using a novel fuzzy relational clustering algo...

Ecway Technologies is a software development company with offices in multiple cities in Tamil Nadu, India. They can be contacted via phone or email. The paper presents a novel fuzzy clustering algorithm that operates on relational input data in the form of a pairwise similarity matrix between objects. The algorithm uses a graph representation and models centrality as likelihood in an Expectation-Maximization framework. Results show the algorithm can identify overlapping clusters of semantically related sentences, demonstrating potential use in text mining tasks. It was also applied successfully to benchmark datasets in other domains.

Clustering large probabilistic graphs

This document summarizes a study on clustering probabilistic graphs. It proposes extending the edit-distance-based definition of graph clustering to probabilistic graphs. Practical approximation algorithms are developed based on establishing a connection between the objective function and correlation clustering. The parameter-free objective function means the number of clusters is part of the output. Methods are developed for testing statistical significance of clusters and handling noisy clusterings. Experiments on real protein-protein interaction and large-scale social networks demonstrate the techniques can discover correct numbers of clusters and identify known relationships.

Cloudsim t-drive enhancing driving directions with taxi drivers’ intelligence

This paper presents a smart driving direction system that leverages taxi drivers' intelligence and experience. GPS-equipped taxis act as mobile sensors to model the dynamic traffic patterns of a city. A time-dependent landmark graph models traffic patterns and experienced drivers' route choices to provide users with the practically fastest route to a destination at a given departure time. A clustering approach estimates travel times between landmarks in different time slots. A two-stage routing algorithm then computes a customized, practically fastest route for the user based on this graph and real-world trajectory data from over 33,000 taxis over three months. Evaluation found that 60-70% of routes suggested were faster than alternatives, with 20% sharing results, and on average routes

Cloudsim ranking on data manifold with sink points

ECWAY Technologies provides IEEE projects and software development services from its offices in multiple cities across India. The document discusses a novel ranking approach called Manifold Ranking with Sink Points (MRSP) that addresses diversity, relevance, and importance in ranking. MRSP uses manifold ranking over a data manifold to find the most relevant objects while turning already ranked objects into "sink points" to prevent redundant objects from receiving a high rank. Experimental results on update summarization and query recommendation tasks show MRSP performs strongly compared to existing ranking approaches by better addressing the importance of diversity in ranking.

Cloudsim quality-differentiated video multicast in multirate wireless networks

This document describes a quality-differentiated video multicast scheme for multirate wireless networks called QDM. QDM aims to provide heterogeneous clients with differentiated video qualities matching their channel conditions. It first proposes a rate scheduling model to select the optimal transmission bitrate for each video frame to maximize total visual quality subject to minimum quality guarantees. It then presents QDM, a practical protocol that constructs a cluster-based structure to characterize heterogeneity and adapts transmission rates based on video quality perceived by cluster heads. Simulation results show QDM can efficiently adapt to network dynamics and variable bitrates, producing a 2-5 dB gain in average video quality over leader-based approaches.

Cloudsim power allocation for statistical qo s provisioning in opportunistic...

The document proposes a power allocation scheme for statistical quality-of-service provisioning in multi-relay cognitive networks. The scheme first chooses between direct transmission or relay transmission based on channel state information. It then performs efficient power allocation according to the transmission mode and given constraints like quality-of-service requirements, average transmit power limits, and peak interference limits. Simulations show the proposed scheme outperforms max-min criterion and equal power allocation policies by achieving higher throughput while involving at most two relays for transmission.

Cloudsim distributed web systems performance forecasting using turning bands...

The document discusses using the Turning Bands method to forecast the performance of distributed web systems. Real-life data was obtained from an experiment monitoring a group of web servers worldwide using an agent system called MWING located in different parts of Poland. The results showed good quality in predicting web performance when European web servers were monitored from an agent in Gliwice, Poland using the Turning Bands method.

Cloudsim distributed processing of probabilistic top-k queries in wireless s...

This document summarizes a paper on distributed processing of probabilistic top-k queries in wireless sensor networks. It introduces the concepts of sufficient and necessary sets, which can facilitate localized data pruning in clusters. It then describes three algorithms - sufficient set-based, necessary set-based, and boundary-based - for intercluster query processing with bounded communication rounds. Finally, it presents an adaptive algorithm that dynamically switches between the three algorithms to minimize transmission cost, and experimental results showing the algorithms significantly reduce data transmission with small constant communication rounds, with the adaptive algorithm performing near-optimally under various conditions.

Civil 2013 titles

Chopper based dc motor speed control

This document discusses using a chopper circuit to control the speed of a DC motor. A chopper circuit allows controlling the voltage to the motor by rapidly switching the voltage on and off, which enables remote speed control. This method improves motor efficiency by reducing current, lowers temperatures, shrinks motor size, and increases lifetime compared to previous variable resistor and transformer-based speed control methods. The project will use buttons to vary the firing angle of a MOSFET in the chopper circuit to control motor speed, with lower firing angles providing higher speeds.

Channel assignment for throughput optimization in multichannel multiradio wir...

ECWAY Technologies provides IEEE projects and software developments with offices in multiple cities in Tamil Nadu, India. They can be contacted via phone or email. The document discusses a channel assignment algorithm for throughput optimization in multi-radio wireless mesh networks using network coding. It formulates the joint problem of random network coding, channel assignment, and broadcast link scheduling while taking into account opportunistic overhearing, interference constraints, coding constraints, number of channels, radios per node, and fairness between unicast connections. An auction-based suboptimal solution is developed for overall network throughput optimization. Performance evaluation shows the algorithm can effectively use multiple radios and channels while addressing fairness issues from the auction, with promising gains over traditional routing

Channel allocation and routing in hybrid multichannel multiradio wireless mes...

The document proposes a hybrid channel allocation and routing approach for multichannel multiradio wireless mesh networks. It presents an Adaptive Dynamic Channel Allocation (ADCA) protocol that considers both throughput and delay for channel assignment. It also proposes an Interference and Congestion Aware Routing (ICAR) protocol for hybrid networks with static and dynamic links that balances channel usage. Simulation results show ADCA reduces packet delay without degrading throughput, and the hybrid approach adapts better to changing traffic than static-only networks with lower overhead and delay than existing hybrid methods.

Casual stereoscopic photo authoring

Ecway Technologies provides software development and IEEE projects services from offices located in multiple cities across India. They can be contacted via phone or email on their website at www.ecwayprojects.com. The paper presents a method for easy stereoscopic photo authoring using a regular monocular camera. It takes two input images or video frames and transforms them into a stereoscopic image pair for pleasant 3D viewing. This is done through a perceptual-plausible image rectification algorithm that warps the input pairs to meet stereoscopic geometric constraints while avoiding visual distortion. The warping uses spatially-varying mesh-based warps that encode various constraints to best meet the stereoscopic geometry and minimize distortion. Experiments show the

Casual stereoscopic photo authoring

Ecway Technologies provides IEEE projects, software developments, and casual stereoscopic photo authoring. It has offices in multiple cities across India. Ecway's casual stereoscopic photo authoring method takes two images or video frames from a regular monocular camera as input and transforms them into a stereoscopic image pair for 3D viewing. The method uses a perceptual-plausible image rectification algorithm that warps the input pairs to meet stereoscopic geometric constraints while avoiding visual distortion. It formulates the warping problem as a quadratic energy minimization solved using a sparse linear solver. The method also allows local and global disparity adjustments for adapting stereoscopic images to different viewing conditions. Experiments show Ecway's spatially-varying war

Capacity of hybrid wireless mesh networks with random a ps

This paper proposes a hybrid wireless mesh network (WMN) architecture that allows the backbone to utilize random connections to access points (APs) in a wireless local area network (WLAN). Theoretical analysis shows that the capacity of a three-tier hybrid WMN is affected by the number of mesh router cells connected to APs, the ratio of access link bandwidth to backbone link bandwidth, and traffic balance among routers with AP access. Simulation results demonstrate that configuring APs and balancing traffic can significantly improve network capacity in the proposed hybrid architecture by taking advantage of wired connections through APs.

Bomb detection robot with wireless camera

This prototype robot is designed to help bomb squads by remotely detecting bombs and obstacles. It uses sensors to detect metals and obstacles as it moves through an area, sending that information back to operators via a wireless camera and computer. The robot is navigated and directed remotely using the camera while its metal detection, obstacle detection, and location data are sent to a base station for operators to monitor on LED displays and sounds.

Bed side patients monitoring system with emergency alert