|
عنوان مقاله |
نویسنده (ها) |
مربوط به کنفرانس |
چکیده |
|
|
Popularity and Focality in Weblogs’ Social Network |
Mohsen Jamali
Hassan Abolhassani
|
دوازدهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
Nowadays users of the Web are encouraged to generate content
on the Web by themselves. Weblogs are the most tools
to do this. In fact Weblogs are one kind of social networks
and ... مشاهده کامل
Nowadays users of the Web are encouraged to generate content
on the Web by themselves. Weblogs are the most tools
to do this. In fact Weblogs are one kind of social networks
and they are one of the most important components in Web
2.0. The increasing growth of blogsphere implies that users
need to know more popular blogs. This paper introduces a
new algorithm for rankingWeblogs according to a link structure
specific to the blogsphere. Our CRE-Rank algorithm
tries to identify popular focal blogs. Popular blogs are those
blogs which are more linked and commented, Focal blogs are
those which users can access popular Weblogs from them. عدم مشاهده کامل
Nowadays users of the Web are encouraged to generate content
on the Web by themselves. Weblogs are the most tools
to do this. In fact Weblogs are one kind of social networks
and ... مشاهده کامل |
خرید مقاله
|
|
First and Second order Field Estimation Using Multi- Grid Algorithm |
H. Shokri-Razaghi
E. Afjei
R. Ghavamizadeh
|
دوازدهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
This paper poses a magnetic field problem in cylindrical coordinate for two regions with different permeabilities
for each one. The linear partial differential equation governing this problem is in the form ... مشاهده کامل
This paper poses a magnetic field problem in cylindrical coordinate for two regions with different permeabilities
for each one. The linear partial differential equation governing this problem is in the form of Helm-Holtz
equation. This problem is then solved using classical Gauss-Seidel Algorithm for the Finite difference (FD)
solution of linear partial differential equation. In order to obtain adequate solution for a reasonable number of
grid points for the regions under consideration a considerable amount of time will take for the program to
converge.
The paper presents a different technique known as Multi-Grid which will speed up the convergence process.
In this method, the solution to the differential equation between two grid points for obtaining the initial
condition is considered to be linear at first and then of the second order in nature. The main contribution is
made by regarding the effect of the initial values of the variable vector in the convergence time of the Gauss-
Seidel algorithm. عدم مشاهده کامل
This paper poses a magnetic field problem in cylindrical coordinate for two regions with different permeabilities
for each one. The linear partial differential equation governing this problem is in the form ... مشاهده کامل |
خرید مقاله
|
|
Estimation of Complexity in Agent Oriented Methodologies via Evaluation of Models and Artifacts |
Reza Basseda
Azin Moallem
Tannaz Alinaghi
Fattaneh Taghiyare
|
دوازدهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
Several methodologies with their own characteristics have been proposed in the area of agent-oriented software
engineering. Consequently, deciding which methodology to select in a specific case is an important issue and ... مشاهده کامل
Several methodologies with their own characteristics have been proposed in the area of agent-oriented software
engineering. Consequently, deciding which methodology to select in a specific case is an important issue and it can
lead to decrease software development cost and effort. Thus, importance of evaluation of methodologies will be
highlighted in choosing the appropriate methodology in the development process of an application. It can also help in
developing new methodologies and improving existing ones. In this paper, we are going to provide an evaluation
framework of agent oriented methodologies. To demonstrate the usage of the suggested framework, it is applied to
evaluate two methodologies (MESSAGE and Prometheus) using a proper example. Results show that, using our
method, methodologies can be truly compared and evaluated. عدم مشاهده کامل
Several methodologies with their own characteristics have been proposed in the area of agent-oriented software
engineering. Consequently, deciding which methodology to select in a specific case is an important issue and ... مشاهده کامل |
خرید مقاله
|
|
Generating F0 Contours for Speech Synthesis in Persian Language Using Classification and Regression Tree |
Majid Namnabat
Abbas Koochari
|
دوازدهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
paper, we have used Tilt intonation theory to represent pitch contour as symbolic elements. Also, classification and
regression trees are considered to estimate Tilt parameters in our text-to-speech system. To train ... مشاهده کامل
paper, we have used Tilt intonation theory to represent pitch contour as symbolic elements. Also, classification and
regression trees are considered to estimate Tilt parameters in our text-to-speech system. To train regression trees, about
70 minutes of speech are used as corpus and more than 100 input features are extracted from this corpus. Further, some
experiments such as incremental adding tilt parameters as input features during training and test models or purposing
stress syllables as accent events are examined to achieve optimal regression trees. Moreover, vector quantization
method and building a codebook of tilt parameters are investigated to predict pitch contours. Finally 61.1% and 25/386
hertz are obtained for correlation coefficient and RMSE values between predicted and real pitch contours of test set
using optimal regression trees. عدم مشاهده کامل
paper, we have used Tilt intonation theory to represent pitch contour as symbolic elements. Also, classification and
regression trees are considered to estimate Tilt parameters in our text-to-speech system. To train ... مشاهده کامل |
خرید مقاله
|
|
A New Asynchronous Pipeline Implementation Method Based on Conventional Function Units |
Atabak Mahram
Mehrdad Najibi
Hossein Pedram
|
دوازدهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
We present a new method to implement QDI asynchronous pipeline stages. Previous implementations of these pipelines
were based on the pre-charge logic implementation which imposes some limitations on the size of ... مشاهده کامل
We present a new method to implement QDI asynchronous pipeline stages. Previous implementations of these pipelines
were based on the pre-charge logic implementation which imposes some limitations on the size of the logic cell due to
the stacking problem. To overcome this limitation, we propose a novel method that uses standard single-rail
computational circuits in a dual rail handshake environment. Our method does not have any stacking problem and is
not limited in size. The results show that a 4-input lookup table implemented by this method outperforms a previous 3-
input lookup table by 16% in speed and 29% in power with a negligible area overhead. عدم مشاهده کامل
We present a new method to implement QDI asynchronous pipeline stages. Previous implementations of these pipelines
were based on the pre-charge logic implementation which imposes some limitations on the size of ... مشاهده کامل |
خرید مقاله
|
|
Static Task Graph Scheduling on Multiprocessors |
Saeed Parsa
Shahriar Lotfi
Naser Lotfi
|
دوازدهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
Effective scheduling is of great importance to parallel programming environments. The aim is to minimize the
completion time of task graphs. The completion time of a task graph is directly affected ... مشاهده کامل
Effective scheduling is of great importance to parallel programming environments. The aim is to minimize the
completion time of task graphs. The completion time of a task graph is directly affected by the length of its
critical path. Hence, the trend of an evolutionary approach for task graph scheduling can be biased towards
reduction of the critical path. Task graph scheduling is a NP-hard problem. Deterministic approaches are not
applicable in this context. Thereof, application of evolutionary processing and especially genetic algorithms are
effective for solving scheduling problems. In this paper, a new genetic scheduling algorithm is presented. The
algorithm, in the first priority, minimizes the critical path length of the parallel program task graph and in the
second priority minimizes the inter-processor communication time. Thereby, it achieves a better scheduling in
comparison with the existing approaches such as BCGA, CGL, MCP. عدم مشاهده کامل
Effective scheduling is of great importance to parallel programming environments. The aim is to minimize the
completion time of task graphs. The completion time of a task graph is directly affected ... مشاهده کامل |
خرید مقاله
|
|
A new method for Behavioral Power Estimation of Asynchronous Circuits |
Mahtab Niknahad
Mehrdad Najibi
Hossein Pedram
|
دوازدهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
A new method for power estimation in behavioral specification
of asynchronous circuits is presented. The estimation is
performed by counting the number of read and write accesses on
ports of the circuit in ... مشاهده کامل
A new method for power estimation in behavioral specification
of asynchronous circuits is presented. The estimation is
performed by counting the number of read and write accesses on
ports of the circuit in behavioral simulation. A linear relationship
between the number of reads/writes and the energy consumption
of the system has been established. The method is applied to the
Reed Solomon error detector as the benchmark. In comparison
with the earlier gate level estimation methods based on transition
counting we have shown that accurate results within %18
imprecision bound can be achieved. عدم مشاهده کامل
A new method for power estimation in behavioral specification
of asynchronous circuits is presented. The estimation is
performed by counting the number of read and write accesses on
ports of the circuit in ... مشاهده کامل |
خرید مقاله
|
|
A New Efficient Genetic Algorithm for Solving 2D Mazes |
H. Hanafi Alamdari
H. Miar Naimi
|
دوازدهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
In this paper a new genetic algorithm is designed to solve a class of maze problems, more efficiently than the state
of the arts. Here the solution is a set of ... مشاهده کامل
In this paper a new genetic algorithm is designed to solve a class of maze problems, more efficiently than the state
of the arts. Here the solution is a set of paths directing every agent from any position in the maze towards a single
goal point. The novel points of the proposed algorithm are the innovative crossover and mutation operators that
improved the results. To evaluate the algorithm and compare it with other algorithms, different experiments were
done. Here each algorithm for any problem was run five times and the average of the results was considered as the
evaluation measure. All experiments showed that the proposed algorithm is the most efficient one. عدم مشاهده کامل
In this paper a new genetic algorithm is designed to solve a class of maze problems, more efficiently than the state
of the arts. Here the solution is a set of ... مشاهده کامل |
خرید مقاله
|
|
Evaluation Textile Fabrics Color by Scanner |
A. Shams-Nateri
S.H. Amirshahi
|
دوازدهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
In this work, Scanner was used for predicting textile fabrics color by relationship between devicedependent
color space and the device independent CIE color spaces. The scanner was characterized by
polynomial regression. The ... مشاهده کامل
In this work, Scanner was used for predicting textile fabrics color by relationship between devicedependent
color space and the device independent CIE color spaces. The scanner was characterized by
polynomial regression. The method adopted in the paper through several test experiments consists of a
non-linear filtering applied to the scanner RGB values and a polynomial regression function directly
applied to the CIELAB space. عدم مشاهده کامل
In this work, Scanner was used for predicting textile fabrics color by relationship between devicedependent
color space and the device independent CIE color spaces. The scanner was characterized by
polynomial regression. The ... مشاهده کامل |
خرید مقاله
|
|
A Scanner Based Neural Network Technique for Color Evaluation of Textile Fabrics |
A. Shams-Nateri
S.H. Amirshahi
|
دوازدهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
In this work, The scanner is calibrated by neural network techniques. for calibration, the RGB values
converts to the device independent CIE color space. The method adopted in the paper through ... مشاهده کامل
In this work, The scanner is calibrated by neural network techniques. for calibration, the RGB values
converts to the device independent CIE color space. The method adopted in the paper through several test
experiments consists of several structure and topology for neural network and non-linear filtering applied to the
scanner RGB values. we devised. The experimental results are very considerable. The accuracy of this works is
as good as other works. عدم مشاهده کامل
In this work, The scanner is calibrated by neural network techniques. for calibration, the RGB values
converts to the device independent CIE color space. The method adopted in the paper through ... مشاهده کامل |
خرید مقاله
|
.gif){kind=icon}
