Sharif Digital Repository

Graceful labeling is one of the best known labeling methods of graphs. Despite the large number of papers published on the subject of graph labeling, there are few particular techniques to be used by researchers to gracefully label graphs. In this paper, first a new approach based on the mathematical programming technique is presented to model the graceful labeling problem. Then a “branching method” is developed to solve the problem for special classes of graphs. Computational results show the efficiency of the proposed algorithm for different classes of graphs. One of the interesting results of our model is in the class of trees. The largest tree known to be graceful has at most 27 vertices... 

Graceful labeling is one of the best known labeling methods of graphs. Despite the large number of papers published on the subject of graph labeling, there are few particular techniques to be used by researchers to gracefully label graphs. In this paper, first a new approach based on the mathematical programming technique is presented to model the graceful labeling problem. Then a “branching method” is developed to solve the problem for special classes of graphs. Computational results show the efficiency of the proposed algorithm for different classes of graphs. One of the interesting results of our model is in the class of trees. The largest tree known to be graceful has at most 27 vertices... 

In this letter, a compact, wideband, and fully planar microstrip crossover structure is proposed. This design is based on a compact microstrip to coplanar waveguide transition, which has a measured bandwidth extending from dc to 40 GHz. At 20 GHz, the measured insertion loss, return loss, and isolation are better than 0.35, 21, and 19 dB, respectively. This circuit is ultracompact with the core size of 3 mm ×3 mm, which is 0.2λ×0.2 λ at 20 GHz. © 2012 IEEE  

The design procedure and measured results of a novel 4 × 4 Butler matrix are presented in this paper. This asymmetrical structure provides fairly flexible phase outputs; therefore, the array radiation pattern can be rotated around the array normal axis. The structure of this modified Butler matrix is discussed in detail, and the explicit design formulas are derived to achieve the arbitrary main beams direction. Using the proposed design procedure, the Butler matrix can provide even broadside and endfire beams. In addition, this structure is employed to design two Butler matrices, which generate similar patterns as a conventional 8 × 8 Butler matrix, using only single layer circuits with... 

Dielectrophoresis is a robust approach for manipulating bioparticles in microfluidic devices. In recent years, many groups have developed dielectrophoresis-based microfluidic systems for separation and concentration of various types of bioparticles, where the gradient of the electric field causes dielectrophoresis force acting on the suspended particles. Enhancing the gradient of the electric field with three-dimensional (3D) electrodes can significantly improve the efficiency of the system. Implementing planar electrodes in a 3D arrangement is a simple option to form a 3D-electrode configuration. This paper reports the development of a novel dielectrophoretic microfluidic system for... 

We study the problem of fair division of a heterogeneous resource among strategic players. Given a divisible heterogeneous cake, we wish to divide the cake among n players to meet these conditions: (I) every player (weakly) prefers his allocated cake to any other player’s share (such notion is known as envy-freeness), (II) the allocation is dominant strategy-proof (truthful) (III) the number of cuts made on the cake is small. We provide methods for dividing the cake under different assumptions on the valuation functions of the players. First, we suppose that the valuation function of every player is a single interval with a special property, namely ordering property. For this case, we... 

We study the problem of fair division of a heterogeneous resource among strategic players. Given a divisible heterogeneous cake, we wish to divide the cake among n players to meet these conditions: (I) every player (weakly) prefers his allocated cake to any other player’s share (such notion is known as envy-freeness), (II) the allocation is dominant strategy-proof (truthful) (III) the number of cuts made on the cake is small. We provide methods for dividing the cake under different assumptions on the valuation functions of the players. First, we suppose that the valuation function of every player is a single interval with a special property, namely ordering property. For this case, we... 

This paper presents a novel approach to isolated word speech recognition using fuzzy modeling which is specifically designed to ignore noise. The task is based on conversion of speech spectrogram into a linguistic fuzzy description and comparison of this representation with fuzzy linguistic descriptions of words. The method is tested on single speaker and multiple speaker tests and the results are compared with a widely used speech recognition approach, showing much higher noise resistance. Copyright - World Automation Congress (WAC) 2006  

A novel very light weight approach to isolated word speech recognition is introduced. The approach uses a new simplistic feature set and a neural network recognition system. The algorithm's main processing requirements are FFT computation and a simple neural network comparison, making the method a suitable solution for low price embedded devices. The proposed method is tested on single speaker and multiple speaker test sets and the results are compared with a widely used speech recognition approach, presenting very fast recognition and quite good recognition rate. © 2006 IEEE  

We study the problem of fair division of a heterogeneous resource among strategic players. Given a divisible heterogeneous cake, we wish to divide the cake among n players in a way that meets the following criteria: (I) every player (weakly) prefers his allocated cake to any other player's share (such notion is known as envy-freeness), (II) the mechanism is strategy-proof (truthful), and (III) the number of cuts made on the cake is minimal. We provide methods, namely expansion process and expansion process with unlocking, for dividing the cake under different assumptions on the valuation functions of the players. Copyright © 2017, Association for the Advancement of Artificial Intelligence...