IEEE TRANSACTIONS ON APPLICATION

Design of Flight Service Vehicle Dispatching Management
System
Abstract: Interphone is used to dispatch vehicle in Flight Service at many
airports in China. Former service manners have the advantages of low speed, poor
real time ability, etc., which make the manager can not acquire every vehicle’s
working state in time. Therefore, a powerful Flight Service Vehicle Dispatching
Management System becomes necessary. Firstly, the Wireless Local Area
Networks (WLAN) around the airport is built as the base environment. Each
ground crew and vehicle are equipped with a PC (Pocket PC), which is assembled
with Wi-Fi and GPS module. Ground crew can directly and quickly send
messages to the vehicle they want to dispatch through WLAN. The Control
Center can easily get working state and position of each vehicle. And Ground
crew can also send exceptional unit photos of airplane to the Control Center. The
program of PPC and server is developed based on C/S structure, and the Control
Center is based on B/S structure. They are designed with components technique
so as to be reused and shorten software development cycle. The system is
developed with Microsoft Visual Studio 2005-C#.net.


Design and Realization of Remote Control in Smart Home
System
Abstract: The technology of remote control is suit to home status monitor, so
remote control is one of core functions in smart home system. After analyzing
typical framework of smart home system, software framework of main controller
in smart home is proposed. Deeply analyzing remote monitoring technology
which is suitable to smart home, thorough comparisons about implementation
schemes of remote control are did, and implementation schemes based on ARM
and WinCE are introduced in details.

Design of mobile electronic commerce system based on
J2ME
Abstract: In this paper, based on the research and analysis of the J2ME
architecture and combing with the J2ME technical characteristics, a type of
J2ME-based mobile e-commerce system design program is presented, and then
the realization of the key technologies in this program is illustrated. The program
has the advantages such as simple realization, strong maneuverability.



E-health Services with Secure Mobile Agent
Abstract: This paper establishes a new security mechanism for online
communications using mobile agents. E-health has been widely used as a
communication system and information changes to deliver health services to the
users through the Internet. However, the Internet imposes threats that will risk the
information in transit. Therefore it is important to ensure that the communication
is safe and the user’s privacy is protected. This paper extends our previous
research results, Multilayer Communication (MLC) approach [1], and introduced
mobile agents to MLC in e-health. The cryptographic protocols such as
encryption/decryption, digital signature, and hash code are used as protection
mechanisms. We focus on how Sender can securely transfer sensitive information
to Recipient while still maintaining control over it. Sender keeps the key for
decryption at his/her side until the agent needs it. A token is carried by the agent,
which is used as a mean to call home platform to obtain the key for decryption
processes. The significant of this new mechanism is that it gives Sender control
over the transmitted data. Recipient can also avoid burden with the encryption
details as long as he/she knows that the message is indeed comes from Recipient.


Enhanced Text Steganography in SMS
Abstract: “we can scarcely imagine a time when there did not exist a necessity,
or at least a desire, of transmitting information from one individual to another in
such a manner as to elude general comprehension.”[1] The transfer or exchange of
information from a source to its intended destination via some media is referred to
as communication.
Thanks to the recent advancements in Telecommunication sector and the
mammoth growth of mobile industry which has made distant communication
within reach of a common human being. Short message service (SMS) – a
communication protocol for mobile phones and a newly evolved SMS-Texting
language have emerged as the most widely used and accepted means of
information exchange between mobile cell phones. SMS propagates over control
channels and can carry up to 160 bytes of information. SMS-Texting is preferred
way of communication when speed and urgency are a must without getting
overheard. The ever increasing and never ending information flow on
communication lines (being a subject of active and / or passive wire tapping)
poses serious threats on the credibility of information as being genuine or not.
Hence, there is a daring need for continuous evolution of new information hiding
techniques and procedures to pace up with the drastic changes in communication
and networking fields. This research paper aims at proposing an enhanced method
for securely exchanging secret/classified information via SMS in context of SMSTesting
Language.


Privacy Violation in Limited Disclosure of Database having
Functional Dependency
Abstract: Upholding the privacy of data has gathered increased interest in the
current industrial scenario. The databases that hold personal information and the
individuals’ choices of privacy are often subjected to attacks from mischievous
sources which try to access undisclosed data. The means used to achieve such
ends may be in the form of complex queries that combine sensitive data with the
non-sensitive ones. Access Control mechanisms are already in place to prevent
such malicious accesses. But the problem is highly compounded when there is a
functional dependency among some of the attributes of the data. In such cases
often the disclosed data of one person allows the user to infer the undisclosed data
of another person. In this paper we propose a model to prevent the breach of
privacy through such inference channels of functional dependency. Then we
describe the architecture of our model and the corresponding implementation.
Finally we carry out a performance analysis to evaluate the cost overheads of time
and space and look out topics for future research.


Managing of Information Security with Outsource Service
Provider
Abstract: The paper describes relevance of outsourcing managed security
services. It has many benefits of using, but also brings key risks for business
mission. If organization is planning to implement out of house information
security, then it must stick to hard and fast rules to reduce these risks and get all
advances. There are listed below steps of interaction such as preparing request for
proposal, composing service level agreement and double-side managing of
security and responsibility.

Research on Electronic Cheque System
Abstract: Most of the organizations especially financial institutions use
colored/texture paper for the signature on any text paper for their documentation,
but they always keep their original signature record on the white paper. When
these signatures are verified electronically, the results are not accurate because of
the difference in color intensity. In this paper, a mechanism is proposed that
automates the signature verification for the above purpose. The objective of
signature verification is to judge whether an input signature of colored paper is a
genuine signature or a forgery. The results are also presented, those are compared
with the collected signature samples, and the original input signatures carried out.
The signature verification of colored paper (SVCP) system can verify the
signatures having different background colors, and also convert white paper
background through variation of color intensity. The paper highlighted the issues
and provides the solutions especially electronic cheque system, having different
color background. Cheques play a vital role in today’s banking but for electronic
banking we need digital currency/digital cheque and in this paper we discuss how
we recognize conventional cheques as a digital currency.


Querying Trajectory Data Warehouses
Abstract: With the fast development in mobile and communication technology,
the need for moving object databases increases. Moving object databases
constitute a major ingredient in many applications that are location sensitive.
Traffic control, fleet management, m-commerce, and E-911 are among those
emerging location based services (LBSs). Along with the vast increase of location
information, and the need to efficiently manage and mine those information,
spatio-temporal data warehouses arise into the picture requiring new algorithms,
new measures, and efficient querying techniques to efficiently utilize the
historical information obtained from moving objects. In this paper we present a
spatio-temporal data warehouse (STDW) that enables querying location
information. Experimental results on our query performance are presented.


An Extension of XQuery for Graph Analysis of Biological
Pathways
Abstract: The vast quantity of scientific data produced in life sciences demands
the use of sophisticated storage and analysis techniques. In particular, for
biological pathways graph analysis plays an important role and data is commonly
available in XML-based formats. Thus, there is a growing need to make analysis
capabilities available through query languages for XML. This paper presents an
approach to extend XQuery for graph analysis with focus on data for biological
pathways. A graph model is introduced within the XQuery environment. New
built-in functions define the available operations on the graph model. XQuery
expressions can be utilized to populate graphs with data and execute graph
algorithms. Graph data and results of algorithms can be accessed in an XML
representation for further processing. In addition, a reference mechanism can be
used to preserve associations from graph data to the original XML data. The
approach has been implemented as an extension to eXist. First evaluations of the
implementation show that the introduced approach is practical and efficient for
reaction networks with several thousand vertices and edges.


Semantic Log Based Replication Model for Optimizing
Heterogeneous DBMS Interaction
Abstract: The growth of database application usage requires DataBase
Management Systems (DBMS) that are accessible, reliable, and dependable. One
approach to handle these requirements is replication mechanism. Replication
mechanism can be divided into various categories. Some related works consider
two categories for replication mechanisms: heterogeneous and homogenous
however majority of them classify them in three groups: physical, trigger-based
and log based schema. Log-based replication mechanisms are the most widely
used category among DBMS vendors. Adapting such approach for heterogeneous
systems is a complex task, because of lack of log understanding in the other end.
Semantic technologies provide a suitable framework to address heterogeneity
problems in largescale and dynamic resources. In this paper we introduce a new
approach to tackle replication problem in a heterogeneous environment by
utilizing ontologies.

Web Based Medical Expert System with a Self Training
Heuristic Rule Induction Algorithm
Abstract: This paper presents a web based medical expert system that performs
self training using a heuristic rule induction algorithm. The data inserted by
medical personnel while using the expert system is subsequently used for
additional learning. The system is trained using a hybrid heuristic algorithm for
induction of classification rules that we previously developed. The SA Tabu
Miner algorithm (Simulated Annealing and Tabu Search based Data Miner) is
inspired by both research on heuristic optimization algorithms and rule induction
data mining concepts and principles. In this paper we compare the performance of
SA Tabu Miner with other rule induction algorithms for classification on public
domain data sets.

Transaction Processing in Mobile Computing using
Semantic Properties
Abstract: Transaction processing is of growing importance for mobile
computing. Booking tickets, flight reservation, banking, ePayment, and booking
holiday arrangements are just a few examples for mobile transactions. Due to
temporarily disconnected situations the synchronisation and consistent transaction
processing are key issues. Serializability is a too strong criterion for correctness
when the semantics of a transaction is known. We introduce a transaction model
that allows higher concurrency for a certain class of transactions defined by its
semantic. The transaction results are”escrow serializable” and the synchronisation
mechanism are non-blocking. Experimental implementation showed higher
concurrency, transaction throughput, and less resources used than common
locking or optimistic protocols.


Adaptive Multi-Join Query Processing in PDBMS
Abstract: Traditionally, distributed databases assume that the (small) set of
nodes participating in a query is known apriori, the data is well placed, and the
statistics are readily available. However, these assumptions are no longer valid in
a Peerbased DataBase Management System (PDBMS). As such, it is a challenge
to process and optimize queries in a PDBMS. In this paper, we present our
distributed solution to this problem for multi-way join queries. Our approach first
processes a multi-way join query based on an initial query evaluation plan
(generated using statistical data that may be obsolete or inaccurate); as the query
is being processed, statistics obtained on-the-fly are used to (continuously) refine
the current plan dynamically into a more effective one. We have conducted an
extensive performance study which shows that our adaptive query processing
strategy can reduce the network traffic significantly.

AJAX Crawl: Making AJAX Applications Searchable
Abstract: Current search engines such as Google and Yahoo! are prevalent for
searching the Web. Search on dynamic clientside Web pages is, however, either
inexistent or far from perfect, and not addressed by existing work, for example on
Deep Web. This is a real impediment since AJAX and Rich Internet Applications
are already very common in the Web. AJAX applications are composed of states
which can be seen by the user, but not by the search engine, and changed by the
user using client-side events. Current search engines either ignore AJAX
applications or produce false negatives. The reason is that crawling clientside
code is a difficult problem that cannot be solved naively by invoking user events.
The challenges are: lack of caching, duplicate states detection, very granular
events, reducing the number of AJAX calls and infinite event invocation. This
paper sets the stage for this new search challenge and proposes a solution: it
shows how an AJAX Web application can be crawled in the granularity of the
application states. A model of AJAX Web sites is presented. An AJAX Crawler
and optimizations for caching and duplicate elimination are defined, and finally,
the gain in search result quality and corresponding performance price are
evaluated on YouTube, a real AJAX application.


iVA-File: Efficiently Indexing Sparse Wide Tables in
Community Systems
Abstract: In community web management systems (CWMS), storage structures
inspired by universal tables are being used increasingly to manage sparse datasets.
Such a sparse wide table (SWT) typically embodies thousands of attributes, with
many of them being undefined in each tuple, and low-dimensional structured
similarity search on a combination of numerical and text attributes is a common
operation. However, many properties of such wide tables and their associated
Web 2.0 services render most multi-dimensional indexing structures irrelevant.
Recent studies in this area have mainly focused on improving the storage
efficiency and efficient deployment of inverted indices; so far no new index has
been proposed for indexing SWTs. The inverted index is fast for scanning but not
efficient in reducing random accesses to the data file as it captures little
information about the content of attribute values. In this paper, we propose the
iVA-file that works on the basis of approximate contents and keeps scanning
efficiency within a bounded range. We introduce the nG-signature to
approximately represent data strings and improve the existing approximate
vectors for numerical values. We also propose an efficient query processing
strategy for the iVA-file, which is different from strategies, used for existing
scanbased indices. To enable the use of different metrics of distance between a
query and a tuple that may vary from application to application, the iVA-file has
been designed to be metric-oblivious and to provide efficient filter-and-refine
search based on any rational metric. Extensive experiments on real datasets show
that the iVA-file outperforms existing proposals in query efficiency significantly,
at the same time, keeps a good update speed.

On Protecting Private Information in Social Networks: A
Proposal
Abstract: As online social networks get more popular, it becomes increasingly
critical to preserve user privacy in such networks. In this paper, we propose our
preliminary results on defining and tackling information aggregation attacks over
online social networks. We first introduce three major threats towards private
information in online social networks. We conceptually model private information
into multilevel and discretionary models. Then, we articulate information
aggregation attacks under discretionary model. Finally, we present our
preliminary design of “privacy monitor,” a framework that allows users to define
their own privacy scheme, and track their actual privacy disclosure to check for
any unwanted leakage.


Sketch-based Summarization of Ordered XML Streams
Abstract—In this paper, we tackle the problem of approximately answering a
continuous aggregate query over an XML stream using limited memory. This
problem is key in the development of tools for the on-line monitoring and analysis
of streaming XML data, such as complex event streams, RSS feeds, or workflow
traces. We introduce a novel technique that supports XML queries with any
combination of the common XPath axes, namely, ancestor, descendant, parent,
child, following, preceding, following-sibling, and preceding-sibling. At the heart
of our approach lies an efficient transform that reduces a continuous XML query
to an equi-join query over relational streams. We detail the transform and discuss
its integration with randomized sketches as a basic mechanism to estimate the
result of the XML query. We further enhance this mechanism with structural
sieving, a technique that takes advantage of the XML data and query
characteristics in order to improve the accuracy of the sketch-based
approximation. We present an extensive experimental study on real-life and
synthetic data sets that validates the effectiveness of our approach and
demonstrates its advantages over existing techniques.

An Automatic Privacy Policy Agreement Checker for EServices
Abstract: An effective way of managing privacy for an e-service user is to make
use of user and service provider privacy policies. The user privacy policy
expresses the user’s privacy preferences for personal information that is to be
shared with the e-service provider. The provider privacy policy expresses the
privacy requirements of the provider’s service, in terms of what personal
information the service requires and how the information will be used. The eservice
may proceed only if the user privacy policy "agrees" with the provider
privacy policy. However, checking for policy agreement needs to be relatively
fast in an e-services environment. How can this checking be automated? This
paper defines user and provider privacy policies based on legal considerations. It
then proposes a privacy policy agreement checker that can automatically
determine if the user privacy policy agrees with the corresponding provider
privacy policy. An example application of the checker is included.


An authentication watermark algorithm for JPEG images
Abstract: In this paper, an authentication watermark algorithm for JPEG images
is proposed, which is basing on the current watermark algorithm proposing and
realizing a counterfeiting attack for the current watermarking algorithm security.
In order to reduce the miss alarm caused by the mode of embedding watermark, in
this algorithm the watermark embedded coefficients are as a factor of the
watermark generation, and embedding watermark information by adopting the
lowest bit substitute, so as to resist the counterfeiting attack effectively and
improve the security of the current algorithm. The theoretical analysis and the
realization show that the watermark algorithm presented by this paper has a lower
miss alarm probability compared with the current algorithm, and further more the
algorithm security.


Deploying Security Policy in Intra and Inter Workflow
Management Systems
Abstract: Workflow Management Systems (WFMS) are concerned with the
control and coordination of operational business processes, called workflows.
When workflow technology is deployed in domains where processes have simple
coordinative requirements, the flow of control and data may be easily mapped
onto process effectiveness. With the diversity of resources, subjects and activities
in the system, ensuring a secure execution environment of the workflow becomes
a critical issue. In this paper, we are interested in deploying a WFMS security
policy. We investigate this issue either within intra or inter organizational
workflows. The later case is more complex and requires more sophisticated
control since it includes communications between different organizations.


Enterprise-oriented Digital Rights Management
Mechanism: Edrm
Abstract: It is impractical to use traditional access control mechanisms to design
a digital content access control mechanism for an organization since even a rolebased
access control mechanism only guarantees that it can be flexibly applied to
the determined access policy for various roles in an organization. It cannot allow
users to flexibly define various access rights for different digital contents for
diverse applications. To make sure these requirements can be satisfied and also
combine the hierarchy structure of organization to the access control and thus
protect digital content from being illegally duplicated, printed, deleted, noted,
modified and stored, in this paper, we apply a digital certificate to record each
user’s role(s) and the corresponding access rights inherited from the access
policies defined by the administration department in the organization.


The Anatomy of Electronic Evidence – Quantitative Analysis
of Police E-Crime Data
Abstract: By understanding the past and present, the future can be predicted.
This work seeks to understand how an Australian policing agency is currently
receiving and analyzing sources of electronic evidence in the investigation of
criminal activity. It shows how many devices are received, what kinds of device
make up each analysis job and for investigation into which crimes. From this,
trends and workloads may be understood and future investments in equipment and
research direction can be decided. The outcomes of this work may also allow for
strategies to maximize training to non-technical staff and highlight investigative
areas that may benefit from more use of electronic evidence. Finally, charting the
trends in how commonly different electronic devices are analyzed may allow for
better handling of crime scenes and expand what is collected for different crime
types. This work seeks to understand which types of crime are making most use of
electronic evidence sources, to prepare for future changes in the discipline.

Network Monitoring and Management Approach for
Expressive-based SLA of Grid Computing Applications
Abstract: In this paper, we present a performance analysis of a dynamic
bandwidth monitoring method with flow control functionality, for intensive datapassing
grid applications over wide area networks. The proposed method called
flatness based trajectory tracking, adapts the grid users output rates to match
expressive data-transfer SLA used to describe theirs guarantees parameters. The
control considers time delay transfer by using delay predictor and provides valueadded
services for grid applications over Internet. This reactive monitoring uses
purely control theoretic approaches which stabilize the network and avoid
undesirable oscillations for the transmission of such critical flows. Moreover,
discrete-time simulation under GridSim simulator illustrates its feasibility and
efficiency to provide guarantees for critical grid traffics with timely execution
requirements.


Accuracy: The Fundamental Requirement for Voting
Systems
Abstract: There have been several attempts to develop a comprehensive account
of the requirements for voting systems, particularly for public elections.
Typically, these approaches identify a number of “high level” principals which are
then refined either into more detailed statements or more formal constructs.
Unfortunately, these approaches do not acknowledge the complexity and diversity
of the contexts in which voting takes place.
This paper takes a different approach by arguing that the only requirement for a
voting system is that it is accurate. More detailed requirements can then be
derived from this high level requirement for the particular context in which the
system is implemented and deployed.
A general, formal high level model for voting systems and their context is
proposed. Several related definitions of accuracy for voting systems are then
developed, illustrating how the term “accuracy” is in interpreted in different
contexts. Finally, a context based requirement for voting system privacy is
investigated as an example of deriving a subsidiary requirement from the high
level requirement for accuracy.


Economic-based Resource Management for Dynamic
Computational Grids: Extension to Substitutable CPU
Resources
Abstract: In economic resource management systems, the objective is to bring
about an efficient allocation of resource while allowing market participants,
resource consumers and owners, to act on their individual valuations of jobs and
resources.
In this paper we investigate the pricing of resources in dynamic grids. Particularly,
we investigate grid resource management based on a computational commodity
market of CPU resources, where resources are determined by supply-and-demand
equilibrium. In particular introduce several categories of CPU’s characterized by
execution speed. These differ in cost and performance but may be used
interchangeably in executing jobs and thus represent so-called substitutable
resources. We investigate, using simulation, whether the algorithms for computing
the supply-and-demand equilibrium, function in this context.

Developing scheduling policies in gLite middleware
Abstract: We describe our experiences from implementing and integrating a
new job scheduling algorithm in the gLite Grid middleware and present
experimental results that compare it to the existing gLite scheduling algorithms. It
is the first time that gLite scheduling algorithms are put under test and compared
with a new algorithm under the same conditions. We describe the problems that
were encountered and solved, going from theory and simulations to practice and
the actual implementation of our scheduling algorithm. In this work we also
describe the steps one needs to follow in order to develop and test a new
scheduling algorithm in gLite. We present the methodology followed and the
testbed that was set up for the comparisons. Our research sheds light on some of
the problems of the existing gLite scheduling algorithms and makes clear the need
for the development of new.

Economic-based Resource Management for Dynamic
Computational Grids: Extension to Substitutable CPU
Resources
Abstract: In economic resource management systems, the objective is to bring
about an efficient allocation of resource while allowing market participants,
resource consumers and owners, to act on their individual valuations of jobs and
resources.
In this paper we investigate the pricing of resources in dynamic grids. Particularly,
we investigate grid resource management based on a computational commodity
market of CPU resources, where resources are determined by supply-and-demand
equilibrium. In particular introduce several categories of CPU’s characterized by
execution speed. These differ in cost and performance but may be used
interchangeably in executing jobs and thus represent so-called substitutable
resources. We investigate, using simulation, whether the algorithms for computing
the supply-and-demand equilibrium, function in this context.


Developing scheduling policies in gLite middleware
Abstract: We describe our experiences from implementing and integrating a
new job scheduling algorithm in the gLite Grid middleware and present
experimental results that compare it to the existing gLite scheduling algorithms. It
is the first time that gLite scheduling algorithms are put under test and compared
with a new algorithm under the same conditions. We describe the problems that
were encountered and solved, going from theory and simulations to practice and
the actual implementation of our scheduling algorithm. In this work we also
describe the steps one needs to follow in order to develop and test a new
scheduling algorithm in gLite. We present the methodology followed and the
testbed that was set up for the comparisons. Our research sheds light on some of
the problems of the existing gLite scheduling algorithms and makes clear the need
for the development of new.


BloomCast: Efficient Full-Text Retrieval over Unstructured
P2Ps with Guaranteed Recall
Abstract: Efficient and effective full-text retrieval in unstructured peer-to-peer
networks remains a challenge in the research community. First, it is difficult, if
not impossible, for unstructured P2P search protocols to effectively locate items
with guaranteed recall rate. Second, existing schemes to improve search
successful rate often rely on replicating a large number of item replicas across the
wide area network, incurring a large amount of communication and storage cost.
In this paper we propose BloomCast, an efficient and effective full-text retrieval
scheme, in unstructured P2P networks. BloomCast is effective because it
guarantees perfect recall rate with high probability. It is efficient because the
overall communication cost of full-text search is reduced below a formal bound.
Furthermore, by casting Bloom Filters instead of the raw documents across the
network, BloomCast significantly reduces the communication cost and storage
cost for replication. We demonstrate the power of BloomCast design through both
mathematical proof and comprehensive simulations. Results show that BloomCast
outperforms existing schemes in terms of both recall rate and communication cost.


Web-based Visualization of Atmospheric Nucleation
Processes Using Java3D
Abstract: With the development of science, research on data analysis is
becoming increasingly important. However, sometimes it is difficult to draw a
conclusion from a complex data set. Data Visualization has been widely used for
people to understand more about their datasets by representing the data in a way
that visually highlights the relationships. As the size of data grows exponentially,
keeping multiple local copies of the data becomes unrealistic for a collaborative
research project. In this paper, we design and develop a cybertool, CT-IANP,
which supports collaborative research in the area of atmospheric nucleation. The
paper shows how Java 3D, web-based tools, and other techniques are used to
achieve the goal.

Range Query Using Learning-Aware RPS in DHT-Based
Peer-to-Peer Networks
Abstract: Range query in Peer-to-Peer networks based on Distributed Hash
Table (DHT) is still an open problem. The traditional way uses order-preserving
hashing functions to create value indexes that are placed and stored on the
corresponding peers to support range query. The way, however, suffers from high
index maintenance costs. To avoid the issue, a scalable blind search method over
DHTs - recursive partition search (RPS) can be used. But, RPS still easily incurs
high network overhead as network size grows. Thus, in this paper, a learningaware
RPS (LARPS) is proposed to overcome the disadvantages of two
approaches above mentioned. Extensive experiments show LARPS is a scalable
and robust approach for range query, especially in the following cases: a) query
range is wide, b) the requested resources follow Zipf distribution, and c) the
number of required resources is small.

A Skyline Approach to the Matchmaking Web Service
Abstract: Item matchmaking that finds items for users is an essential service
framework in the web service infrastructure. The current way of carrying out the
matchmaking procedure is the selection of items based on a user’s specifications.
We rethink the item matchmaking framework in such a way that a matchmaker
can find items that can satisfy a specific computing demand from a user and
recommend a collection of better items candidates among the identified items.
This endows a user with the right of choice on deciding best-possible items.
We approach the problem in the view of skyline query processing that has become
one of the major topics in the database community, and present the efficient
skyline algorithm that gathers interesting item candidates efficiently. To this end,
we adopt (i) lattice-based indexing using a lattice composition technique, and (ii)
an optimized dominance-check algorithm. Our extensive experimental results
show that our algorithm outperforms the current state-of-the-art algorithm.


Application-specific Dynamic Policy Rules (ASDPR) for
J2ME
Abstract: In recent years, many innovations were introduced to make mobile
devices more flexible, effective, functional, and smaller which led to their
ubiquity and dependence of users on their availability. Java-based mobile devices
have become mainstream appliances, hence Java security has become the center
of attention of a lot of researches aimed to investigate and enhance the Java
security model. In this paper, we propose a new framework for enhancing runtime
security for applications on mobile devices by providing dynamic policies
for independently controlling each application based on the historical usage of this
application. A user can control the behavior of each application and the policy
rules can grow dynamically during execution. Java 2 Micro Edition (J2ME) is
used as a case study and vehicle to demonstrate the effectiveness of our
framework. Preliminary performance evaluation experiments show acceptable
memory allocation and application execution time overhead.

Friendly Home Automation System Using Cell Phone and
J2ME with Feedback Instant Voice Messages
Abstract: This paper introduces a friendly system to control the home appliances
remotely by the use of mobile cell phones; this system is well known as "Home
Automation System" (HAS). The designed system covers the most important
required factors in home automation system such as flexibility, security, easy to
use, the ability to feedback information to the client immediately, … etc.
The presented system uses the J2ME language to program the client mobile which
sends information to the service mobile and this controls the operation of the
appliances via a PIC microcontroller which connected to it and programmed in
such a way that introduces the main characteristics of the system. Optocoupler
and static power switch (TRAIC) are used as the interface devices between the
PIC and the home appliances.
The proposed HAS in this paper is implemented practically, tested and gave the
correct and expected results.