انجمن کامپیوتر ایران

This paper presents an asynchronous and a synchronous NoC router architecture. The asynchronous scheme is implemented by the help of CSP-Verilog language and the synchronous one is designed employing VHDL language. Their designs are similar except the extra links which are in charge of handshaking processes in asynchronous architecture. According to the experimental results the transition counts of buffer, and switch components in synchronous router are almost 82% and 60% of asynchronous one, respectively. On the other hand, the transition counting of routing unit in asynchronous NoC router is nearly 73% of synchronous one. Power consumption of them are evaluated according to the obtained transition counting. Based on the comparison the power consumption of buffer and switch components are almost same due to their similar structure. However, the power consumption of routing unit component in asynchronous design is lower than synchronous one.

In this paper, we propose a method for selecting the symmetry axis of eyes region from two or more candidates. We propose a region-based deformable template matching from two new defined operations: intensity-based 2-clustering and edge shadowing. The results display the effectiveness of our method for extraction of eye, eyebrow and nose templates. The parameters of these templates can be used as feature vectors in low bit rate transmission. Evaluation of the proposed method on an Iranian database shows the accuracy of 99% for feature region extraction and 86% in average for feature template extraction.

In this paper, we address the Heart Sound signal modeling problem. The approach taken is based on sparse and redundant representations on an overcomplete dictionary. We apply matching pursuit (MP) and orthogonal matching pursuit (OMP) on two sets of normal and pathological phonocardiograms (PCGs). The dictionary includes classical Gabor wavelets or time-frequency atoms which are the product of a sinusoid and a Gaussian window function. The normalized root-mean-square error (NRMSE) was computed between the original and the reconstructed signals. The results show that the OMP method is very suitable to the transient and complex properties of the PCG’s, as it yielded excellent NRMSE’s around 1.61% for normal sounds and 5.19% for pathological murmurs.

Keystroke dynamics-based authentication, KDA, verifies users via their typing patterns. To authenticate users based on their typing samples, it is required to find out the resemblance of a typing sample and the training samples of a user regardless of the text typed. In this paper, a measure is proposed to find the distance between a typing sample and a set of samples of a user. For each digraph, histogram-based density estimation is used to find the pdf of its duration time. This measure is combined with another measure which is based on the two samples distances. Experimental results show considerable decrease in FAR while FRR remains constant.

Concept graph is a graph that represents the relationships between language concepts. In this structure the relationship between any two words is demonstrated by a weighted edge such that the value of this weight is interpreted as the degree of the relevance of two words. Having this graph, we can obtain most relevant words to a special term. In this paper, we propose a method for improving the classification of documents from unknown sources by means of concept graph. In our method, initially some features are selected from a training set by a well-known feature selection algorithm. Then, by extracting most relevant words for each class from the concept graph, a more effective feature set is produced. Our experimental results identify an improvement of 1% and 8% in precision and recall measures, respectively.

اين مقاله مسئله جداسازي كور سيستمهاي طيف گسترده پرش فركانسي (FHSS) را با استفاده از يك المان آرايهاي بدون دانستن الگوي پرش و يا جهت سيگنال ورودي (DOA) براي كاربردهاي زمانحقيقي مورد بررسي قرار ميدهد. در اين مقاله الگوريتم مورد استفاده، الگوريتم تخمين و قطري سازي توام ماتريس كاميولنت (JADE) ميباشد. مزيت اين الگوريتم، سرعت بالاي آن ميباشد كه باعث شده است براي كاربردهاي زمان-حقيقي مناسب باشد. اما مشكل الگوريتم JADE رعايت نكردن ترتيب منابع يا جايگشت آنها به هنگام جداسازي است. براي حل مشكل جايگشت در اين مقاله، از ماتريس همبستگي استفاده ميكنيم.