Abstract: This paper presents image compression with wavelet based method. The wavelet transformation divides image to low- and high pass filtered parts. The traditional JPEG compression technique requires lower computation power with feasible losses, when only compression is needed. However, there is obvious need for wavelet based methods in certain circumstances. The methods are intended to the applications in which the image analyzing is done parallel with compression. Furthermore, high frequency bands can be used to detect changes or edges. Wavelets enable hierarchical analysis for low pass filtered sub-images. The first analysis can be done for a small image, and only if any interesting is found, the whole image is processed or reconstructed.
Abstract: In this paper we introduce the notion of protein interaction
network. This is a graph whose vertices are the protein-s
amino acids and whose edges are the interactions between them.
Using a graph theory approach, we identify a number of properties of
these networks. We compare them to the general small-world network
model and we analyze their hierarchical structure.
Abstract: Electrocardiogram (ECG) data compression algorithm
is needed that will reduce the amount of data to be transmitted, stored
and analyzed, but without losing the clinical information content. A
wavelet ECG data codec based on the Set Partitioning In Hierarchical
Trees (SPIHT) compression algorithm is proposed in this paper. The
SPIHT algorithm has achieved notable success in still image coding.
We modified the algorithm for the one-dimensional (1-D) case and
applied it to compression of ECG data.
By this compression method, small percent root mean square
difference (PRD) and high compression ratio with low
implementation complexity are achieved. Experiments on selected
records from the MIT-BIH arrhythmia database revealed that the
proposed codec is significantly more efficient in compression and in
computation than previously proposed ECG compression schemes.
Compression ratios of up to 48:1 for ECG signals lead to acceptable
results for visual inspection.
Abstract: Both software applications and their development environment are becoming more and more distributed. This trend impacts not only the way software computes, but also how it looks. This article proposes a Human Computer Interface (HCI) template from three representative applications we have developed. These applications include a Multi-Agent System based software, a 3D Internet computer game with distributed game world logic, and a programming language environment used in constructing distributed neural network and its visualizations. HCI concepts that are common to these applications are described in abstract terms in the template. These include off-line presentation of global entities, entities inside a hierarchical namespace, communication and languages, reconfiguration of entity references in a graph, impersonation and access right, etc. We believe the metaphor that underlies an HCI concept as well as the relationships between a bunch of HCI concepts are crucial to the design of software systems and vice versa.
Abstract: Data objects are usually organized hierarchically, and
the relations between them are analyzed based on a corresponding
concept hierarchy. The relation between data objects, for example how
similar they are, are usually analyzed based on the conceptual distance
in the hierarchy. If a node is an ancestor of another node, it is enough
to analyze how close they are by calculating the distance vertically.
However, if there is not such relation between two nodes, the vertical
distance cannot express their relation explicitly. This paper tries to fill
this gap by improving the analysis method for data objects based on
hierarchy. The contributions of this paper include: (1) proposing an
improved method to evaluate the vertical distance between concepts;
(2) defining the concept horizontal distance and a method to calculate
the horizontal distance; and (3) discussing the methods to confine a
range by the horizontal distance and the vertical distance, and
evaluating the relation between concepts.
Abstract: There are several approaches for handling multiclass classification. Aside from one-against-one (OAO) and one-against-all (OAA), hierarchical classification technique is also commonly used. A binary classification tree is a hierarchical classification structure that breaks down a k-class problem into binary sub-problems, each solved by a binary classifier. In each node, a set of classes is divided into two subsets. A good class partition should be able to group similar classes together. Many algorithms measure similarity in term of distance between class centroids. Classes are grouped together by a clustering algorithm when distances between their centroids are small. In this paper, we present a binary classification tree with tuned observation-based clustering (BCT-TOB) that finds a class partition by performing clustering on observations instead of class centroids. A merging step is introduced to merge any insignificant class split. The experiment shows that performance of BCT-TOB is comparable to other algorithms.
Abstract: Hierarchical high-level PNs (HHPNs) with time
versions are a useful tool to model systems in a variety of application
domains, ranging from logistics to complex workflows. This paper
addresses an application domain which is receiving more and more
attention: procedure that arranges the final inpatient charge in
payment-s office and their management. We shall prove that Petri net
based analysis is able to improve the delays during the procedure, in
order that inpatient charges could be more reliable and on time.
Abstract: The concept of flexible manufacturing is highly
appealing in gaining a competitive edge in the market by quickly
adapting to the changing customer needs. Scheduling jobs on flexible
manufacturing systems (FMSs) is a challenging task of managing the
available flexibility on the shop floor to react to the dynamics of the
environment in real-time. In this paper, an agent-oriented scheduling
framework that can be integrated with a real or a simulated FMS is
proposed. This framework works in stochastic environments with a
dynamic model of job arrival. It supports a hierarchical cooperative
scheduling that builds on the available flexibility of the shop floor.
Testing the framework on a model of a real FMS showed the
capability of the proposed approach to overcome the drawbacks of
the conventional approaches and maintain a near optimal solution
despite the dynamics of the operational environment.
Abstract: In this paper, we present the recently implemented approach allowing dynamics systems to plan its actions, taking into account the environment perception changes, and to control their execution when uncertainty and incomplete knowledge are the major characteristics of the situated environment [1],[2],[3],[4]. The control distributed architecture has three modules and the approach is related to hierarchical planning: the plan produced by the planner is further refined at the control layer that in turn supervises its execution by a functional level. We propose a new intelligent distributed architecture constituted by: Multi-Agent subsystem of the sensor, of the interpretation and representation of environment [9], of the dynamic localization and of the action. We tested this distributed architecture with dynamic system in the known environment. The autonomous for Rotor Mini Rotorcraft task is described by the primitive actions. The distributed controlbased on multi-agent system is in charge of achieving each task in the best possible way taking into account the context and sensory feedback.
Abstract: Feature selection study is gaining importance due to its contribution to save classification cost in terms of time and computation load. In search of essential features, one of the methods to search the features is via the decision tree. Decision tree act as an intermediate feature space inducer in order to choose essential features. In decision tree-based feature selection, some studies used decision tree as a feature ranker with a direct threshold measure, while others remain the decision tree but utilized pruning condition that act as a threshold mechanism to choose features. This paper proposed threshold measure using Manhattan Hierarchical Cluster distance to be utilized in feature ranking in order to choose relevant features as part of the feature selection process. The result is promising, and this method can be improved in the future by including test cases of a higher number of attributes.
Abstract: Most of fuzzy clustering algorithms have some
discrepancies, e.g. they are not able to detect clusters with convex
shapes, the number of the clusters should be a priori known, they
suffer from numerical problems, like sensitiveness to the
initialization, etc. This paper studies the synergistic combination of
the hierarchical and graph theoretic minimal spanning tree based
clustering algorithm with the partitional Gath-Geva fuzzy clustering
algorithm. The aim of this hybridization is to increase the robustness
and consistency of the clustering results and to decrease the number
of the heuristically defined parameters of these algorithms to
decrease the influence of the user on the clustering results. For the
analysis of the resulted fuzzy clusters a new fuzzy similarity measure
based tool has been presented. The calculated similarities of the
clusters can be used for the hierarchical clustering of the resulted
fuzzy clusters, which information is useful for cluster merging and
for the visualization of the clustering results. As the examples used
for the illustration of the operation of the new algorithm will show,
the proposed algorithm can detect clusters from data with arbitrary
shape and does not suffer from the numerical problems of the
classical Gath-Geva fuzzy clustering algorithm.
Abstract: Hierarchical Mobile IPv6 (HMIPv6) was designed to
support IP micro-mobility management in the Next Generation
Networks (NGN) framework. The main design behind this protocol is
the usage of Mobility Anchor Point (MAP) located at any level router
of network to support hierarchical mobility management. However,
the distance MAP selection in HMIPv6 causes MAP overloaded and
increase frequent binding update as the network grows. Therefore, to
address the issue in designing MAP selection scheme, we propose a
dynamic load control mechanism integrates with a speed detection
mechanism (DMS-DLC). From the experimental results we obtain
that the proposed scheme gives better distribution in MAP load and
increase handover speed.
Abstract: Composite of Celatom-ZeoliteY (Cel-ZY) was used to
remove cobalt ion from an aqueous solution using batch mode.
ZeoliteY has successfully superimposed on Celatom FW-14 surface
using hydrothermal treatment .The product was synthesized as a
novel of hierarchical porous material. It was observed from the
results that Cel-ZY has higher ability to remove cobalt ions than the
pure ZeoliteY powder (PZY) synthesized under the same conditions.
Several parameters were studied in this project to investigate the
effect of removal cobalt ion such as pH and initial cobalt
concentration. It was clearly observed that the uptake of cobalt ions
was affected with increase these parameters. The results proved that
the product can be used effectively to remove Co2+ ions from
wastewater as an environmentally friendly alternative.
Abstract: A new generation of manufacturing machines
so-called MIMCA (modular and integrated machine control
architecture) capable of handling much increased complexity in
manufacturing control-systems is presented. Requirement for more
flexible and effective control systems for manufacturing machine
systems is investigated and dimensioned-which highlights a need for
improved means of coordinating and monitoring production
machinery and equipment used to- transport material. The MIMCA
supports simulation based on machine modeling, was conceived by
the authors to address the issues. Essentially MIMCA comprises an
organized unification of selected architectural frameworks and
modeling methods, which include: NISTRCS, UMC and Colored
Timed Petri nets (CTPN). The unification has been achieved; to
support the design and construction of hierarchical and distributed
machine control which realized the concurrent operation of reusable
and distributed machine control components; ability to handle
growing complexity; and support requirements for real- time control
systems. Thus MIMCA enables mapping between 'what a machine
should do' and 'how the machine does it' in a well-defined but
flexible way designed to facilitate reconfiguration of machine
systems.
Abstract: Rooted in the study of social functioning of space in architecture, Space Syntax (SS) and the more recent Network Pattern (NP) researches demonstrate the 'spatial structures' of city, i.e. the hierarchical patterns of streets, junctions and alley ends. Applying SS and NP models, planners can conceptualize the real city-s patterns. Although, both models yield the optimal path of the city their underpinning displays of the city-s spatial configuration differ. The Axial Map analyzes the topological non-distance-based connectivity structure, whereas, the Central-Node Map and the Shortcut-Path Map, in contrast, analyze the metrical distance-based structures. This research contrasts and combines them to understand various forms of city-s structures. It concludes that, while they reveal different spatial structures, Space Syntax and Network Pattern urban models support each the other. Combining together they simulate the global access and the locally compact structures namely the central nodes and the shortcuts for the city.
Abstract: Nowadays, one of the most important problems of the
metropolises and the world large cities is the habitant traffic difficulty
and lack of sufficient parking site for the vehicles. Esfahan city as the
third metropolis of Iran has encountered with the vehicles parkingplace
problems in the most parts of fourteen regions of the city. The
non principled and non systematic dispersal and lack of parking sites
in the city has created an unfavorable status for its traffic and has
caused the air and sound pollutions increase; in addition, it wastes the
most portions of the citizenship and travelers' charge and time in
urban pathways and disturbs their mental and psychical calmness,
thus leads to their intensive dissatisfaction. In this study, by the usage
of AHP model in GIS environment, the effective criteria in selecting
the public parking sites have been combined with each other, and the
results of the created layers overlapping represent the parking
utilitarian vastness and widths. The achieved results of this research
indicate the pretty appropriate public parking sites selection in region
number 3 of Esfahan; but inconsequential dispersal and lack of these
parking sites in this region have caused abundant transportation
problems in Esfahan city.
Abstract: A wireless sensor network with a large number of tiny sensor nodes can be used as an effective tool for gathering data in various situations. One of the major issues in wireless sensor networks is developing an energy-efficient routing protocol which has a significant impact on the overall lifetime of the sensor network. In this paper, we propose a novel hierarchical with static clustering routing protocol called Energy-Efficient Protocol with Static Clustering (EEPSC). EEPSC, partitions the network into static clusters, eliminates the overhead of dynamic clustering and utilizes temporary-cluster-heads to distribute the energy load among high-power sensor nodes; thus extends network lifetime. We have conducted simulation-based evaluations to compare the performance of EEPSC against Low-Energy Adaptive Clustering Hierarchy (LEACH). Our experiment results show that EEPSC outperforms LEACH in terms of network lifetime and power consumption minimization.
Abstract: This study was conducted to explore the effects of two
countries model comparison program in Taiwan and Singapore in
TIMSS database. The researchers used Multi-Group Hierarchical
Linear Modeling techniques to compare the effects of two different
country models and we tested our hypotheses on 4,046 Taiwan
students and 4,599 Singapore students in 2007 at two levels: the class
level and student (individual) level. Design quality is a class level
variable. Student level variables are achievement and self-confidence.
The results challenge the widely held view that retention has a positive
impact on self-confidence. Suggestions for future research are
discussed.
Abstract: This paper proposes a method, combining color and layout features, for identifying documents captured from low-resolution handheld devices. On one hand, the document image color density surface is estimated and represented with an equivalent ellipse and on the other hand, the document shallow layout structure is computed and hierarchically represented. Our identification method first uses the color information in the documents in order to focus the search space on documents having a similar color distribution, and finally selects the document having the most similar layout structure in the remaining of the search space.
Abstract: Recently, it has been suggested that thought control strategies aimed at controlling unwanted thoughts may be used to cope with paranoid thoughts in both clinical and nonclinical samples. The current study aims to examine the type of thought control strategies that were associated with the frequency of paranoid thoughts in nonclinical samples. A total of 159 Japanese undergraduate students completed the two scales–the Paranoia Checklist and the Thought Control Questionnaire. A hierarchical multiple regression analysis demonstrated that worry-based control strategies were associated with paranoid thoughts, whereas distraction- and social-based control strategies were inversely associated with paranoid thoughts. Our findings suggest that in a nonclinical population, worry-based strategies may be especially maladaptive, whereas distraction- and social-based strategies may be adaptive to paranoid thoughts.