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... 

There has been a multitude of techniques proposed for identifying vulnerabilities in software. Forcing a program into a vulnerable state has become increasingly unscalable, given the size of the programs and the number of possible execution states. At the same time, techniques that are looking for vulnerability signatures are marred with weak and incomplete signatures. This is not to say that such techniques have failed to identify previously unknown vulnerabilities in the code. However, they have inherent weaknesses, which result in identifying vulnerabilities that are limited in type and complexity. We propose a novel technique to extract succinct vulnerability-relevant statements... 

Cognitive functions such as working memory require integrated activity among different brain regions. Notably, entorhinal cortex (EC) activity is associated with the successful working memory task. Olfactory bulb (OB) oscillations are known as rhythms that modulate rhythmic activity in widespread brain regions during cognitive tasks. Since the OB is structurally connected to the EC, we hypothesized that OB could modulate EC activity during working memory performance. Herein, we explored OB–EC functional connectivity during spatial working memory performance by simultaneous recording local field potentials when rats performed a Y-maze task. Our results showed that the coherence of delta,... 

Ignoring actuator dynamics in control of rigid manipulators can in practice result in performance degradation or loss of system stability. However, consideration of actuator dynamics usually requires measurement of robot joint torques. This paper addresses motion tracking control of an n-DOF rigid robot by taking into account its actuator dynamics. Joint torque measurement is avoided by using an adaptive observer. The backstepping technique is adopted to develop a dynamically smooth adaptive nonlinear controller dealing with uncertainties in manipulator and actuator dynamics. Semi-global convergence of motion tracking errors as well as torque estimation error are proven without any... 

The uncertainty principle sets a lower bound on the uncertainties of two incompatible observables measured on a particle. The uncertainty lower bound can be reduced by considering a particle as a quantum memory entangled with the measured particle. In this paper, we consider a tripartite scenario in which a quantum state has been shared among Alice, Bob, and Charlie. The aim of Bob and Charlie is to minimize Charlie's lower bound about Alice's measurement outcomes. To this aim, they concentrate their correlation with Alice in Charlie's side via a cooperative strategy based on local operations and classical communication. We obtain a lower bound for Charlie's uncertainty about Alice's... 

Due to superior accuracy and stability of multiple relaxation time (MRT) collision operator over its single relaxation time (SRT) counterpart, new lifting relations are proposed here to construct single particle distribution functions for MRT-LBM from macroscopic variables. Using these lifting relations, a new hybrid FVM-LB method is presented (called Finite type-LB hybrid method), which is consistent with MRT-LBM. In this new hybrid method, single-particle distribution functions in MRT-LBM sub-domain boundaries are computed, using equilibrium and non-equilibrium moments. These moments are computed in Navier-Stokes/FVM sub-domain boundaries, using macroscopic variables and their derivatives.... 

Vulnerability detection is an important challenge in the security community. Many different techniques have been proposed, ranging from symbolic execution to fuzzing in order to help in identifying vulnerabilities. Even though there has been considerable improvement in these approaches, they perform poorly on a large scale code basis. There has also been an alternate approach, where software metrics are calculated on the overall code structure with the hope of predicting code segments more likely to be vulnerable. The logic has been that more complex code with respect to the software metrics, will be more likely to contain vulnerabilities. In this paper, we conduct an empirical study with a... 

Polymer supported reagents have found many applications in recent years. Scientists in research laboratories of agrochemical and pharmaceutical industries now routinely utilize these compounds to prepare ensembles of small organic molecules for screening. This review is aimed to highlight some of the most important applications of these promising materials in organic synthesis. Furthermore, an extensive listing of polymeric reagents that were recently used in organic synthesis is included. © Springer-Verlag 2007