Sharif Digital Repository

The effects of six synthetic imidazolium-based ionic liquids (ILs) on the CuII-catalyzed chemiluminescence of lucigenin (Luc-CL) in the pH range 6.0-11 were investigated. Preliminary experiments found that the CL emission was strongly enhanced or inhibited in the presence of the ILs. The degree of enhancement or inhibition of the CL intensity in the presence of each IL was related to the molecular structure of the IL, the medium used, and the pH. The maximum enhancement of the CL intensity was observed at pH 9.0 (amplification factor=443). This decrease in the pH at which maximum CL enhancement occurred and the substantial signal amplification of the Luc-CL may be related to a strong... 

The dynamic characteristics of functionally graded (FG) metal foam cylindrical micro-scale shells in contact with a moving load will be analyzed thorough this paper accounting for strain-gradient size-dependency. In the material structure of a metal foam, pores can diffuse uniformly or non-uniformly. Based upon Laplace transform, the dynamical governing equations of the first-order micro-shell model can be established in a new domain. In order to go back into the time domain, an inverse Laplace transform will be required. Thus, on can express the time response or dynamic deflection of the micro-shell under moving load. In the presented results, it is easy to see the prominence of... 

Grammar induction is a basic step in natural language processing. Based on the volume of information that is used by different methods, we can distinguish three types of grammar induction method: supervised, unsupervised, and semi-supervised. Supervised and semisupervised methods require large tree banks, which may not currently exist for many languages. Accordingly, many researchers have focused on unsupervised methods. Unsupervised Data Oriented Parsing (UDOP) is currently the state of the art in unsupervised grammar induction. In this paper, we show that the performance of UDOP in free word order languages such as Persian is inferior to that of fixed order languages such as English. We... 

Dielectrophoresis (DEP) is an electrokinetic phenomenon which is used for manipulating micro- and nanoparticles in micron-sized devices with high sensitivity. In recent years, electrode-based DEP by patterning narrow oblique electrodes in microchannels has been used for particle manipulation. In this theoretic study, a microchannel with triangular electrodes is presented and a detailed comparison with oblique electrodes is made. For each shape, the behavior of particles is compared for three different configurations of applied voltages. Electric field, resultant DEP force, and particle trajectories for configurations are computed by means of Rayan native code. The separation efficiency of... 

The problem of treating open boundaries is still a challenging one. Applying fully developed condition is constrained to long enough domains. Without having enough physical evidence about what happens on boundaries, the domain extent could not be shortened and computational costs could not be reduced. From the advent of free (open) boundary conditions, they were confined to mixed finite element procedures. Recent works have extended their application to coupled finite volume solvers based on the shape function data reconstruction. A wider class of flow solvers available, however, rely on the segregated procedure where the velocity components and pressure are solved in succession. Moreover,... 

In this work, basic design features of Rayan are documented. One of the new design features presented in this work is the way Rayan handles polyhedral grids. Grid definition is combined with the definition of the structure of the sparse coefficient matrix, thereby releasing a considerable part of the memory used by the grid to store otherwise required faces belonging to the cell part of the connectivity description. The key idea is to use a uniform way for creating the structure of the coefficient matrix from the grid connectivity description and to access that data when computing the elements of the coefficient matrix. This saving requires many modifications to the computational algorithm... 

Enforced hill climbing (EHC), a heuristicaa search method, has been frequently used in a number of AI planning systems. This paper presents a new form of EHC, guided enforced hill climbing (GEHC), to enhance EHC efficiency. Main feature in GEHC is an adaptive ordering function. GEHC has shown a significant improvement in EHC efficiency, especially when applied to larger problems  

Existing efficient directed particle locating (host determination) algorithms rely on the face belonging to cell relationship (F2C) to find the next cell on the search path and the cell in which the target is located. Recently, finite volume methods have been devised which do not need F2C. Therefore, existing search algorithms are not directly applicable (unless F2C is included). F2C is a major memory burden in grid description. If the memory benefit from these finite volume methods are desirable new search algorithms should be devised. In this work two new algorithms (line of sight and closest cell) are proposed which do not need F2C. They are based on the structure of the sparse... 

In this work we assume that there is an agent in an unknown environment (domain). This agent has some predefined actions and it can perceive its current state in the environment completely. The mission of this agent is to fulfill the tasks (goals) that are often assigned to it as fast as it can. Acting has lots of cost, and usually planning and simulating the environment can reduce this cost. In this paper we address a new approach for incremental induction of probabilistic planning operators, from this environment while the agent tries to reach to its current goals. It should be noted that there have been some works related to incremental induction of deterministic planning operators and... 

In this paper, we describe LHTNDT, an algorithm that learns the preconditions of HTN methods by examining plan traces produced by another planner. LHTNDT extracts conditions for applying methods by using decision tree based algorithm. It considers the state of relevant domain objects in both current and goal states. Redundant training samples are removed using graph isomorphism. Our experiments, LHTNDT converged. It can learn most of preconditions correctly and quickly. 80% of our test problems were solved by preconditions extracted by 3/4 of plan traces needed for full convergence  

Grammar induction is one of the most important research areas of the natural language processing. The lack of a large Treebank, which is required in supervised grammar induction, in some natural languages such as Persian encouraged us to focus on unsupervised methods. We have found the Inside-Outside algorithm, introduced by Lari and Young, as a suitable platform to work on, and augmented IO with a history notion. The result is an improved unsupervised grammar induction method called History-based IO (HIO). Applying HIO to two very divergent natural languages (i.e., English and Persian) indicates that inducing more conditioned grammars improves the quality of the resultant grammar. Besides,... 

Grammar induction, also known as grammar inference, is one of the most important research areas in the domain of natural language processing. Availability of large corpora has encouraged many researchers to use statistical methods for grammar induction. This problem can be divided into three different categories of supervised, semi-supervised, and unsupervised, based on type of the required data set for the training phase. Most current inductive methods are supervised, which need a bracketed data set for their training phase; but the lack of this kind of data set in many languages, encouraged us to focus on unsupervised approaches. Here, we introduce a novel approach, which we call... 

One of the most important problems of traditional A.I. planning methods such as non-linear planning is the control of the planning process itself. A non-linear planner confronts many choice points in different steps of the planning process (i.e., selection of the next goal to work on, selection of an action to achieve the goal, and selection of the right order to resolve a conflict), and ideally, it should choose the best option in each case. The partial ordered planner (POP) introduced by Weld in 1994, assumes a magical function called "Choose" to select the best option in each planning step. There have been some previous efforts for the realization of this function; however, most of these... 

Increasing the domain of locality by using Tree Adjoining Grammars (TAG) caused some applications, such as machine translation, to employ it for the disambiguation process. Successful experiments of employing TAG in French-English and Korean-English machine translation encouraged us to use it for another language pairs with very divergent properties, Persian and English. Using Synchronous TAG (S-TAG) for this pair of languages can benefit from syntactic and semantic features for transferring the source into the target language. Here, we report our experiments in translating English into Persian. Also, we present a model for lexical selection disambiguation based on the decision trees notion....