Sharif Digital Repository

Taxonomy learning is one of the major steps in ontology learning process. Manual construction of taxonomies is a time-consuming and cumbersome task. Recently many researchers have focused on automatic taxonomy learning, but still quality of generated taxonomies is not satisfactory. In this paper we have proposed a new compound similarity measure. This measure is based on both knowledge poor and knowledge rich approaches to find word similarity. We also used Machine Learning Technique (Neural Network model) for combination of several similarity methods. We have compared our method with simple syntactic similarity measure. Our measure considerably improves the precision and recall of automatic... 

In this paper, we study the effect of some traffic patterns on energy consumption for IEEE 802.16e nodes while operating in the sleep mode. In the sleep mode, a Mobile Subscribe Station (MSS) sleeps for a sleep interval and wakes up at the end of this interval in order to check buffered packet(s) at Base Station (BS) destined to it. If there is no packet, the MSS increases the sleep window up to the maximum value and sleeps again. For a more general traffic pattern, we evaluate the average power consumption. Based on our analysis, we conclude that traffic pattern plays an important role in power consumption. ©2007 IEEE  

Double talk detector is the essential part of an echo canceller to keep the adaptive filter from divergence in presence of near-end speech. This work is a contribution to propose a new double talk algorithm based on power, this method detects double-talk quickly; also it can distinguish the double-talking when the channel has the varying gain. In this paper, we first present an analytical discussion describing this new method and then we show the simulation result to compare our proposed algorithm in both performance and complexity with Giegel algorithm-the most successful one in line echo cancellers. ©2007 IEEE  

The widespread application of deep sub-micron and multilayer routing techniques makes the interconnection parasitic influence become the main factor to limit the performance of VLSI circuits. Therefore, fast and accurate 3D capacitance extraction is essential for ultra deep sub-micron design (UDSM) of integrated circuits. Parallel processing provides an approach to reducing the simulation turn-around time. In this paper, we present parallel formulations for 3D capacitance extraction based on P-FFT algorithm, on a personal computer (PC) or on a network of PCs. We implement both vector and parallel versions of 3D capacitance extraction algorithm simultaneously and evaluate our implementation... 

Existence of crosscutting concerns in software requirements often intensifies complexity of software development process. Modeling and analyzing of these concerns in the software architecture decrease possibility of finding tangled and complex components in the ultimate design. Aspect oriented ADLs have emerged to overcome this problem; however, imposing radical changes to existing architectural modeling methods is not easily acceptable by architects. In this paper, we present a method to enhance conventional software architecture description languages through utilization of aspect features with special focuses on non-functional requirements (NFRs). © 2007 IEEE  

We consider a multiple access relay channel where two sources S1 and S2 send their data to a common destination node aided by a shared relay node. In this paper we extend previous work on this topic by assuming that the output of both information sources are correlated with memory. Furthermore, we consider frequency-selective fading channels, which introduce inter-symbol interference among the transmitted symbols. In this context, we propose an iterative receiver which comprises Turbo Maximum a Posteriori (MAP) equalization and distributed source-channelnetwork decoding in an iterative fashion. Various relaying strategies such as network coding or time multiplexing are analyzed in detail. In... 

One of the man concerns of peer-to-peer video streaming over the internet is the cumulative impact of the Internet packet loss due to the decoding dependency of the compressed video frames. In this paper we study the efficiency of various packet loss recovery policies that can be used in peer-to-peer streaming. Our analytical and simulation results show how different packet loss recovery policies can be effective for peer-to-peer video streaming. © 2007 IEEE  

This paper presents a lossless data hiding method using coefficients of integer wavelet domain. The modification of selected small coefficients of the high frequency subbands are used to embed data. We use the histogram modification to intelligently select the proper coefficients for data hiding. Data embedding is done by processing these selected coefficients. We show that at low payload data hiding our method has comparable PSNR than the best known reversible data hiding techniques, while at higher payloads it has significant superiority on image quality. ©2007 IEEE  

This paper presents a kinematics and workspace analysis of cable-suspended manipulators with elastic cable. The mechanics of extensible cable with a deflection to its selfweight are studied. The problem of evaluating the workspace is approached by using a modified formulation for a deformable cable. The proposed algorithm for testing whether a given configuration lies within the reachable workspace is applied. Starting with a general statement of the kinetic equations of the elastic cable and incorporate cable flexibility into workspace generation. This algorithm is verified through simulation results of various cable-suspended robots. © 2008 IEEE  

The design of a Gm-C filter for High-Frequency applications is described in this paper. A low-pass, sixth-order elliptic Gm-C filter based on the new biquadratic architecture in 0.18 um CMOS process is designed with the proper dynamic rang. A simple structure of the high Q biquadratic filter is used to enhance the linearity and tunability of the filter. The cut off frequency of this filter is 33 MHz. It has a THD of -45 dB for 0.2 Vpp, 8 MHz signal. The complete filter including on-chip tuning circuit consumes only 0.8mA with 1.8 V single supply voltage. ©2006 IEEE  

In this study, two methods for solving economic dispatch problems, namely Hopfield neural network and λ iteration method are compared. Three sample of power system with 3, 6 and 20 units have been considered. The time required for CPU, for solving economic dispatch of these two systems has been calculated. It has been shown that for on-line economic dispatch, Hopfield neural network is more efficient and the time required for convergence is considerably smaller compared to classical methods. © 2006 IEEE  

Recently, the trade-off between power consumption and fault tolerance in embedded processors has been highlighted. This paper proposes an approach to reduce dynamic power of conventional high-level fault-tolerant techniques used in the register file of processors, without affecting the effectiveness of the fault-tolerant techniques. The power reduction is based on the reduction of dynamic power of the unaccessed parts of the register file. This approach is applied to three transient fault-tolerant techniques: Single Error Correction (SEC) hamming code, duplication with parity, and Triple Modular Redundancy (TMR). As a case study, this approach is implemented on the register file of an... 

This paper presents a novel and fast homography-based tracking method to segment and track the instructor placed in front of a class board using two synchronized views. In the proposed method we estimate the instructor as a planar object and track its planar parameters. At first, the homography of board and fundamental geometry of two views are extracted using six point correspondences. The homography transformation matrix of object is calculated by obtaining three point correspondences in parallax region introduced with homography of the board. The parameters to be tracked by Kalman filter are obtained frame by frame by object's homography decomposition. Our proposed method is robust... 

A routing algorithm defines a route which packet traverses to get to destination. In this research we study some kind of routing algorithms that are used in internal connections networks of multi-processor and multi-computers systems. Then we discuss about some routing algorithms which have been implemented network on chip architecture. First, we present a group of routing algorithms based on various criterions, and review so-called category. Afterwards, we study adaptive and deterministic routing algorithms and express circular model applying in internal connections networks and its governing rules in order to prevent dead lock. Then we survey adaptive algorithms such as Deflection routing,... 

Traditionally, to handle security for stand-alone computers and small networks, user authentication and access control mechanisms would be almost enough. However, considering distributed networks such as the Internet and pervasive environments, these kinds of approaches are confronted with flexibility challenges and scalability problems. This is mainly because open environments lack a central control, and users in them are not predetermined. In such ubiquitous computing environments, issues concerning security and trust become crucial. Adding trust to the existing security infrastructures would enhance the security of these environments. Although many trust models are proposed to deal with... 

High availability of software systems is an essential requirement for pervasive computing environments. In such systems self-adaptation, using dynamic reconfiguration is also a key feature. However, dynamic reconfiguration potentially decreases the system availability by making parts of the system temporary frozen, especially during incomplete or faulty execution of the reconfiguration process. In this paper, we propose Assured Dynamic Reconfiguration Framework (ADRF), consisting of run-time analysis phases, assuring the desired correctness and completeness of dynamic reconfiguration process. We also specify factors that affect availability of reconfigurable software in pervasive computing... 

This paper proposes a decentralized algorithm to organize an ad-hoc sensor network into clusters. Each sensor operates independently, monitoring communication among others. Those sensors which have many neighbors that are not already part of a cluster are likely candidates to creating a new cluster by declaring themselves to be a new cluster-head. The Clustering Algorithm via Deadline Timer (CADT) provides a protocol whereby this can be achieved and the process continues until all sensors are part of a cluster. Because of the difficulty of analyses simplified models are used to study and abstract its performance. A simple formula to estimate the number of clusters which will be formed in an... 

An stochastic version of the classical shortest path problem whereby for each node of a graph, a probability distribution over the set of successor nodes must be chosen so as to reach a certain destination node with minimum expected cost. In this paper, we propose a new algorithm based on Particle Swarm Optimization (PSO) for solving Stochastic Shortest Path Problem (SSPP). The comparison of our algorithm with other algorithms indicates that its performance is suitable even by the less number of iterations. © 2008 Springer-Verlag Berlin Heidelberg  

Applications in pervasive computing environment exploit information about the context of use, such as the location, tasks and preferences of the user, in order to adapt their behavior in response to changing operating environments and user requirements. Utilizing context with aid of ontology in data and model, decision support systems can provide better and more desirable support to their users. The effects and advantages of exploiting ontology in user modeling and DSS is discussed. We propose a framework of a Ontology-based Decision Support System (O2DSS), including ontology in model base, database and their advantages. © 2008 IEEE  

In this paper, dynamic programming alignment is replaced by a particle swarm optimization (PSO) procedure in time warping problem. The basic PSO is a very slow process to be applied to speech recognition application. In order to achieve a higher performance, by inspiring of PSO optimization methodology, we introduced a PSO Inspired Time warping Algorithm (PTW) that significantly increase the computational performance of time warping in alignments of long length massive data sets. As a main enhancement, a pruning strategy with an add-in controlling threshold is defined in PTW that causes a considerable reduction in recognition time, while maintaining the system accuracy comparing to DTW. ©...