Sharif Digital Repository

With the advent of cloud computing and Internet of Things and delegation of data collection and aggregation to third parties, the results of the computations should be verified. In distributed models, there are multiple sources. Each source creates authenticators for the values and sends them to the aggregator. The aggregator combines the authenticated values and creates a verification object for verifying the computation/aggregation results. In this paper, we propose two constructions for verifying the results of countable and window-based countable functions. These constructions are useful for aggregate functions such as median, max/min, top-k/first-k, and range queries, where the... 

The objective in multi-label learning problems is simultaneous prediction of many labels for each input instance. During the past years, there were many proposed embedding based approaches to solve this problem by considering label dependencies and decreasing learning and prediction cost. However, compressing the data leads to lose part of information included in label space. The idea in this work is to divide the whole label space to some independent small groups which leads to independent learning and prediction for each small group in the main space, rather than transforming to the compressed space. We use subspace clustering approaches to extract these small partitions such that the... 

time-optimal problem for redundantly actuated robots moving on a specified path is a challenging problem. Although the problem is well explored and there are proposed solutions based on phase plane analysis, there are still several unresolved issues regarding calculation of solution curves. In this paper, we explore the characteristics of the maximum velocity curve and propose an efficient algorithm to establish the solution curve. Then we propose a straightforward method to calculate the maximum or minimum possible acceleration on the path based on the pattern of saturated actuators, which substantially reduces the computational cost. Two numerical examples are provided to illustrate the... 

Landmark extraction is used as the first step of many vision tasks such as tracking, image registration, localization, image matching and recognition. Furthermore, landmarks are used to reduce the data flow and consequently the computational costs. In this paper we extracted landmarks from echocardiography sequence, our algorithm is based on corner extraction, and then we evaluate our algorithm with applying some test. For this purpose, we evaluated the detectors according to their repeatability, stability and landmark localization under changes in noise. © 2009 IEEE  

Recommender Systems have become an attractive field within the recent decade because they facilitate users' selection process within limited time. Conventional recommender systems have proposed numerous methods focusing on recommendations to individual users. Recently, due to a significant increase in the number of users, studies in this field have shifted to properly identify groups of people with similar preferences and provide a list of recommendations for each group. Offering a recommendations list to each individual requires significant computational cost and it is therefore often not efficient. So far, most of the studies impose four restrictive assumptions: (1) limited number of... 

Code-based digital signatures suffer from two main drawbacks: Large public key size and slow signature generation. Large public key size is inherent in almost all the code-based cryptosystems and other post-quantum alternatives; however, slow signature generation is due to their specific structure. Most of the current code-based signature schemes are constructed based on Courtois, Finiasz, and Sendrier (CFS) signature. CFS uses a counter to produce decodable syndromes or the complete decoding technique that imposes some extra computational cost to the signing algorithm for many choices of codes. In this study, the authors propose an efficient digital signature, PolarSig, which can reduce... 

Although Face detection is not a recent activity in the field of image processing, it is still an open area for research. The greatest step in this field is the work reported by Viola and the recent analogous one is proposed by Huang et al. Both of them use similar features and also similar training process. The former is just for detecting upright faces, but the latter can detect multi-view faces in still grayscale images using new features called 'sparse feature'. Finding these features is very time consuming and inefficient by proposed methods. Here, we propose a new approach for finding sparse features using a genetic algorithm system. This method requires less computational cost and... 

An unconditionally stable fully explicit finite difference method for solution of conduction dominated phase-change problems is presented. This method is based on an asymmetric stable finite difference scheme for approximation of diffusion terms and application of the temperature recovery method as a phase-change modeling method. The computational cost of the presented method is the same as the explicit method per time-step, while it is free from time-step limitation due to stability criteria. It robustly handles isothermal and nonisothermal phase-change problems and is very efficient when the global temperature field is desirable (not accurate front position). The robustness, stability,... 

Many smart-card-based remote authentication schemes have been proposed recently. In 2004, Yoon et al. presented an improved scheme which is the leading of a research track started from Sun, 2000. In this paper, we illustrate that Yoon et al.'s scheme is vulnerable to the parallel session attack and propose an enhancement of the scheme to resist that attack. In our scheme the parties further establish a forward-secure session key by employing only hash functions to protect the subsequent communications. We also demonstrate that our scheme has better security in comparison to other related works, while it does not incur much computational cost © 2007 Springer  

Large-stencil schemes which their spectral properties are acceptable in the vicinity of ω = π are analyzed for the first time. A machine independent model for evaluating the efficiency of generalized time-marching finite-difference algorithms over periodic domains is developed. This model which is based on operation count reveals that for small values of Total Computational Cost(TCC), the previous low-order small-stencil schemes are more efficient while for moderate TCC, the efficiency of optimized large-stencil schemes abruptly increases. This important result is the motivation for developing optimized large-stencil schemes. The current schemes are successfully implemented in a full... 

In 2003, Wu and Chieu proposed a user friendly remote authentication scheme using smart cards. Later, Yang and Wang pointed out that Wu and Chieu's scheme is vulnerable to the password guessing and forgery attacks. Recently, Lee et al. proposed an improved authentication scheme and claimed that their scheme is secure against forgery attack. However, in this paper, we illustrate that Lee et al.'s scheme is still vulnerable to the forgery attack. We also propose an enhancement of the scheme to resist such that attack. © 2010  

UF6 gas flow in the total regions of a rotor with the radius of 0.1 m and the length of 1 m in axisymmetric and steady states was simulated using a new hybrid CFD-DSMC method in the OpenFOAM framework. Implicit coupled density-based scheme was performed for CFD method, and Variable Hard Sphere (VHS) and diffuse model were employed in DSMC method. Also, as an initial estimation, the local Knudsen number was applied to determine the interface location between the continuum-rarefied regions (r = 0.0855 m). Then it was modified (r = 0.084 m) to reduce the computational cost. The comparison results of pure CFD and CFD-DSMC methods illustrated that there were large differences between the flow... 

Peridynamics is a nonlocal theory of solid mechanics which is suitable for modeling discontinuities and fractures without requiring external theories. In the original peridynamic equation of motion, the internal forces are integrated over the entire domain of the body. Although this equation complies perfectly with physical principles, its heavy calculations make it practically impossible to use. To avoid this difficulty, we can benefit from a special case of the peridynamic equation of motion in which the integration domain of the internal forces is limited to the family of particles. A limitation of this special equation, which is the most common equation in the peridynamic literature, is... 

One of the main issues in colour image processing is changing objects' colour due to colour of illumination source. Colour constancy methods tend to modify overall image colour as if it was captured under natural light illumination. Without colour constancy, the colour would be an unreliable cue to object identity. Till now, many methods in colour constancy domain are presented. They are in two categories; statistical methods and learning-based methods. This paper presents a new statistical weighted algorithm for illuminant estimation. Weights are adjusted to highlight two key factors in the image for illuminant estimation, that is contrast and brightness. The focus was on the convex part of... 

One of the main issues in colour image processing is changing objects' colour due to colour of illumination source. Colour constancy methods tend to modify overall image colour as if it was captured under natural light illumination. Without colour constancy, the colour would be an unreliable cue to object identity. Till now, many methods in colour constancy domain are presented. They are in two categories; statistical methods and learning-based methods. This paper presents a new statistical weighted algorithm for illuminant estimation. Weights are adjusted to highlight two key factors in the image for illuminant estimation, that is contrast and brightness. The focus was on the convex part of... 

The ubiquity of broadband digital communications and mass storage in modern society has stimulated the widespread acceptance of digital media. However, easy access to royalty-free digital media has also resulted in a reduced perception in society of the intellectual value of digital media and has promoted unauthorised duplication practices. To detect and discourage the unauthorised duplication of media, researchers have investigated watermarking methods to embed ownership data into media. However, some authorities have expressed doubt over the efficacy of watermarking methods to protect digital media. The paper introduces a novel method to discourage unauthorised duplication of digital... 

Recently, an approximate boundary condition [Opt. Lett. 38, 3009 (2013)] was proposed for fast analysis of onedimensional periodic arrays of graphene ribbons by using the Fourier modal method (FMM). Correct factorization rules are applicable to this approximate boundary condition where graphene is modeled as surface conductivity. We extend this approach to obtain the optical properties of two-dimensional periodic arrays of graphene. In this work, optical absorption of graphene squares in a checkerboard pattern and graphene nanodisks in a hexagonal lattice are calculated by the proposed formalism. The achieved results are compared with the conventional FMM, in which graphene is modeled as a... 

Different nonlinearities in micro-electro-mechanical resonators lead to various nonlinear behaviors such as chaotic motion which can affect the resonator performance. As a result, it is important to properly identify and analyze the chaotic regions in resonators. In this paper, a novel method is proposed for prediction of the chaos in the micro- and nano-electro-mechanical resonators. Based on the proposed method, first an accurate analytical solution for the dynamics behavior of the nano-resonators is derived using the multiple scales method up to the second order. The results obtained by this analytical solution are validated by comparing them with the numerical ones. Using the analytical... 

In the present work, the multiscale finite volume (MsFV) method is implemented on a new coarse grids arrangement. Like grids used in the MsFV methods, the new grid arrangement consists of both coarse and dual coarse grids but here each coarse block in the MsFV method is a dual coarse block and vice versa. Due to using the altered coarse grids, implementation, computational cost, and the reconstruction step differ from the original version of MsFV method. Two reconstruction procedures are proposed and their performances are compared with each other. For a wide range of 2-D and 3-D problem sizes and coarsening ratios, the computational costs of the MsFV methods are investigated. Furthermore, a... 

This paper presents a new and simple algorithm for partitioning the input domain for implementation of Active Learning Method (ALM) algorithm. ALM is a pattern-based algorithm for soft computing which uses the Ink Drop Spread (IDS) algorithm as its main engine for feature extraction. In this paper a simple algorithm is introduced with a few computation cost. In order to evaluate the performance of the proposed algorithm, it is applied to two applications, system modeling and pattern recognition. Simulation results show the effectiveness of our algorithm in specifying the appropriate points for dividing the inputs domains