|
عنوان مقاله |
نویسنده (ها) |
مربوط به کنفرانس |
چکیده |
|
|
A Learning Automata Based Data Aggregation Method for Sensor Networks |
M. Esnaashari
M. R. Meybodi
|
دوازدهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
One way to reduce energy consumption in wireless sensor networks is to reduce the number of packets being
transmitted in the network. Data aggregation technique, in which packets with related information ... مشاهده کامل
One way to reduce energy consumption in wireless sensor networks is to reduce the number of packets being
transmitted in the network. Data aggregation technique, in which packets with related information are combined
together in intermediate nodes before further forwarding towards their destination, shown to be a good solution
for this purpose. It is clear that more related information along the paths each packet traverse results in higher
aggregation ratio. If the information each node has, varies from time to time, finding paths along which more
nodes with related information exist becomes a complicated task. In this paper, a learning automata based data
aggregation method in sensor networks will be proposed. Each node of the sensor network is equipped with a
learning automaton which learns the path along which the aggregation ratio is maximum. Simulation results
show that the proposed method performs well in situations where nodes having related information vary during
the network's lifetime. عدم مشاهده کامل
One way to reduce energy consumption in wireless sensor networks is to reduce the number of packets being
transmitted in the network. Data aggregation technique, in which packets with related information ... مشاهده کامل |
خرید مقاله
|
|
Adaptive Forgetting Factor RLS Algorithm Based on Gradient of Inverse Correlation Matrix Applied to Human Motion Analysis |
Hadi Sadoghi Yazdi
Seyed Ebrahim Hosseini
Mohammad Reza Mohammadi
|
دوازدهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
This paper is concerned with studying the forgetting
factor of the recursive least square (RLS). A new dynamic
forgetting factor (DFF) for RLS algorithm is presented. The
proposed DFF-RLS is compared to other ... مشاهده کامل
This paper is concerned with studying the forgetting
factor of the recursive least square (RLS). A new dynamic
forgetting factor (DFF) for RLS algorithm is presented. The
proposed DFF-RLS is compared to other methods. Better
performance at convergence and tracking of noisy chirp sinusoid is
achieved. The control of the forgetting factor at DFF-RLS is based
on the gradient of inverse correlation matrix. Compared with the
gradient of mean square error algorithm, the proposed approach
provides faster tracking and smaller mean square error. In low
signal-to-noise ratios, the performance of the proposed method is
superior to other approaches. عدم مشاهده کامل
This paper is concerned with studying the forgetting
factor of the recursive least square (RLS). A new dynamic
forgetting factor (DFF) for RLS algorithm is presented. The
proposed DFF-RLS is compared to other ... مشاهده کامل |
خرید مقاله
|
|
Code Generation and Scheduling for Parallelization of Multi-Dimensional Perfectly Nested Loops |
Saeed Parsa
Shahriar Lotfi
|
دوازدهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
Tiling transformation is widely used to efficiently execute loops on parallel architectures. Automatic code
generation for tiled loops can be a very complicated compiler work due to non-rectangular tile shapes and
arbitrary ... مشاهده کامل
Tiling transformation is widely used to efficiently execute loops on parallel architectures. Automatic code
generation for tiled loops can be a very complicated compiler work due to non-rectangular tile shapes and
arbitrary iteration space bounds. A wave-front approach can simplify code generation for tiled loops. In this
paper wave-fronts are applied to generate code for multi-dimensional irregular tiled loops. Also, an improved
block scheduling strategy is presented to exploit wave-front parallelism for multi-dimensional tiled spaces.
Experimental results show that the proposed scheduling strategy outperforms likely most currently implemented
strategies. عدم مشاهده کامل
Tiling transformation is widely used to efficiently execute loops on parallel architectures. Automatic code
generation for tiled loops can be a very complicated compiler work due to non-rectangular tile shapes and
arbitrary ... مشاهده کامل |
خرید مقاله
|
|
Traffic Analysis of f-cube Fault-Tolerant Routing Algorithm in Mesh Interconnection Networks |
A. Nayebi
A. Shamaei
S. G. Miremadi
|
دوازدهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
This paper presents a detailed traffic analysis of f-cube routing algorithm. Per-node traffic analysis illustrates
the traffic hotspots caused by fault regions and provides a great assistance in developing fault tolerant ... مشاهده کامل
This paper presents a detailed traffic analysis of f-cube routing algorithm. Per-node traffic analysis illustrates
the traffic hotspots caused by fault regions and provides a great assistance in developing fault tolerant routing
algorithms. Moreover, the effect of a traffic hotspot on the traffic of neighbor nodes and global performance
degradation is investigated, here. Currently, some coarse measures like global network latency are used to
compare routing protocols. These measures do not provide enough insight of traffic distribution in presence of
different fault regions. To analyze the per-node traffic, some per-node traffic measures are introduced here and
one of them is selected for the rest of work. Different fault regions (single node, vertical line, horizontal line, and
rectangular) in different places of a mesh network are simulated and the results are compared and interpreted.
In an effort to gain deep understanding of the issue of traffic analysis of faulty networks, this paper is the first
attempt to investigate per-node traffic around fault regions. عدم مشاهده کامل
This paper presents a detailed traffic analysis of f-cube routing algorithm. Per-node traffic analysis illustrates
the traffic hotspots caused by fault regions and provides a great assistance in developing fault tolerant ... مشاهده کامل |
خرید مقاله
|
|
Evolutionary Design of Gabor Filters with Application to Writer Identification |
Ali Borji
Caro Lucas
|
دوازدهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
Previous studies have shown the advantages of Gabor filters for the purpose of writer identification. Current
study attempts to show that designing a set of such filters is domain specific however ... مشاهده کامل
Previous studies have shown the advantages of Gabor filters for the purpose of writer identification. Current
study attempts to show that designing a set of such filters is domain specific however tuning of their parameters
is not an easy task. Here we use genetic algorithms as a systematic approach to search in the space of filter
parameters to choose a set of best filters for the problem of offline writer identification based on handwriting.
Specifically, each chromosome encodes the parameters of filters and then during an evolutionary process those
filters which show the best classification performance are selected. Identification was performed using two
different classifiers: weighted Euclidean distance (WED) and nearest neighbor classifier (KNN). Our results
show the superiority of proposed method compared with traditional Gabor filters and Gray Scale Co-occurrence
matrices (GSCM). عدم مشاهده کامل
Previous studies have shown the advantages of Gabor filters for the purpose of writer identification. Current
study attempts to show that designing a set of such filters is domain specific however ... مشاهده کامل |
خرید مقاله
|
|
Accuracy-based Classifier Systems Using Evolutionary Neural Networks Representation |
M. Sabeti
P. Zahadat
S. D. Katebi
|
دوازدهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
Accuracy-based classifier systems (XCS) traditionally use a binary string rule representation with wildcards
added to allow for generalization over the population encoding. However, the simple scheme has some of
drawbacks in complex ... مشاهده کامل
Accuracy-based classifier systems (XCS) traditionally use a binary string rule representation with wildcards
added to allow for generalization over the population encoding. However, the simple scheme has some of
drawbacks in complex problems. A neural network-based representation is used to aid their use in complex
problem. Here each rule's condition and action are represented by a small network evolved through the action of
the genetic algorithm. Also in this work a second neural network is used as classifier's prediction, trained by
back propagation. After describing the changes required to the standard XCS functionality, the results are
presented using neural network to represent individual rules. Examples of use are given to illustrate the
effectiveness of the proposed approached. عدم مشاهده کامل
Accuracy-based classifier systems (XCS) traditionally use a binary string rule representation with wildcards
added to allow for generalization over the population encoding. However, the simple scheme has some of
drawbacks in complex ... مشاهده کامل |
خرید مقاله
|
|
A Novel Method to support C-element in Conventional EDA Tools |
M. Mirzaaghatabar
Sh. Hessabi
H. Pedram
|
دوازدهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
Lack of global clock for synchronization in asynchronous circuits decreases the controllability of these circuits and thus
makes asynchronous circuits hard to test. Delay Insensitive (DI) circuits exclusively use C-elements and ... مشاهده کامل
Lack of global clock for synchronization in asynchronous circuits decreases the controllability of these circuits and thus
makes asynchronous circuits hard to test. Delay Insensitive (DI) circuits exclusively use C-elements and inverters,
provided that only single output gates are used. In this paper we present a new method to conceptually change this class
of asynchronous circuits. The main idea is to change C-elements into other elements which can be modeled by
synchronous tools. Then we use HOPE, a synchronous sequential circuits fault simulator, and apply it to DI class of
asynchronous circuits. The stuck-at model is used for fault simulation. Our observations show that we can achieve
considerable fault coverage, mainly 92.5%, in DI circuits by this method. To the best of our knowledge, this is the first
effort in using synchronous tool to achieve fault simulation for asynchronous circuit class. عدم مشاهده کامل
Lack of global clock for synchronization in asynchronous circuits decreases the controllability of these circuits and thus
makes asynchronous circuits hard to test. Delay Insensitive (DI) circuits exclusively use C-elements and ... مشاهده کامل |
خرید مقاله
|
|
Fault Tolerance in a RISC Asynchronous Processor Using Flow Graph Checking |
M. Mirzaaghatabar
S. G. Miremadi
H. Pedram
|
دوازدهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
This paper introduces a fault-tolerant asynchronous RISC microprocessor, called FTARM, which combines
several error detection mechanisms to increase the fault coverage. The FTARM is implemented using the verilog.
To evaluate the FTARM, ... مشاهده کامل
This paper introduces a fault-tolerant asynchronous RISC microprocessor, called FTARM, which combines
several error detection mechanisms to increase the fault coverage. The FTARM is implemented using the verilog.
To evaluate the FTARM, different workloads were run on its implementation using the Verilog HDL. The
evaluation is based on some thing about 2000 different transient and permanent single stuck-at-faults. The
results show that more than 98% faults were detected. The Verilog model of FTARM is synthesized, where about
25% area overhead was observed. عدم مشاهده کامل
This paper introduces a fault-tolerant asynchronous RISC microprocessor, called FTARM, which combines
several error detection mechanisms to increase the fault coverage. The FTARM is implemented using the verilog.
To evaluate the FTARM, ... مشاهده کامل |
خرید مقاله
|
|
Performance Evaluation of Large Scale Networks,Challenges And Guidelines |
Elham Darmanaki Farahani
Mahmoud Fathy
Mehran Tarahomi
|
دوازدهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
This paper is an overview of benchmarks and tools being used for large scale network performance evaluation
analysis, modeling, simulation and Benchmarking. In this paper we first describe some performance evaluation
metrics ... مشاهده کامل
This paper is an overview of benchmarks and tools being used for large scale network performance evaluation
analysis, modeling, simulation and Benchmarking. In this paper we first describe some performance evaluation
metrics and approaches and then we introduce some simulation and analysis tools for this purpose.
But our emphasize on this paper is on benchmarking and in this way, we introduce more than 10 benchmark
in network performance evaluation. We have chosen Web server Stress Benchmark as one of the most powerful
benchmarks .Then, we have done three tests on this benchmark, but in this paper we show only one of these
tests. As we expected this benchmark has very features and provides a number of robust and flexible reports and
logging features to help you gather valuable data about your Web server and website performance. عدم مشاهده کامل
This paper is an overview of benchmarks and tools being used for large scale network performance evaluation
analysis, modeling, simulation and Benchmarking. In this paper we first describe some performance evaluation
metrics ... مشاهده کامل |
خرید مقاله
|
|
Moving Cast Shadow Detection Using Texture Information |
Mani Ranjbar
Shohreh Kasaei
|
دوازدهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
In this paper, we have proposed an efficient moving cast shadow detection using texture features. Texture
features are estimated using fractal dimension and is employed to discriminate between shadow region and
moving ... مشاهده کامل
In this paper, we have proposed an efficient moving cast shadow detection using texture features. Texture
features are estimated using fractal dimension and is employed to discriminate between shadow region and
moving foreground region. Complexity and noise reduction is achieved using wavelet transform which has not
been performed before in the literature. Block-wise calculation has accelerated the method. The proposed
texture modeling method unlike most other approaches is able to cope with very dark shadows as well as light
shadows. عدم مشاهده کامل
In this paper, we have proposed an efficient moving cast shadow detection using texture features. Texture
features are estimated using fractal dimension and is employed to discriminate between shadow region and
moving ... مشاهده کامل |
خرید مقاله
|
.gif){kind=icon}
