Sharif Digital Repository

In this paper, some codes are designed for a binary chip-asynchronous CDMA system which guarantee errorless communication in the absence of noise. These codes also show good performance for noisy channels. In addition, lower and upper bounds for the sum channel capacity are derived for finite and asymptotic cases with the assumption of both noiseless and noisy channels. The results are derived assuming that user delays are known at the receiver end. The performance of proposed codes in the noisy case is also compared to both Gold sequences and a similar class of binary sequences with constrained amount of correlation  

Isotropic tensor valued functions of tensor arguments play an important role in the formulation of the equations governing the behavior of solid materials in the field of continuum mechanics. When the tensor argument is non-symmetric, the complexity and the difficulty in dealing with the tensor functions are high. In this work, the issue of expressing an isotropic tensor valued tensor function of a non-symmetric tensor argument is attention by utilizing the Dunford-Taylor integral. An important subclass of the isotropic tensor functions is considered with the commutative property  

In this paper, after studying the demands and requirements of a perfect smart grid and specifications of network topology and sensor nodes utilized in a Wireless Sensor Network [WSN], a manipulated version of them is proposed to be combined with smart grid in order to improve the data acquisition step, increase the security and facilitate the process of information and desired commands from users. We will take the advantage of computer simulations to illustrate improved capacity and speed of this method. Finally, we will analyze the advantages of employing this proposed structure in a smart grid  

The effectiveness of the local search algorithms for shop scheduling problems is proved frequently. Local search algorithms like tabu search use neighborhood structures in order to obtain new solutions. This paper presents a new neighborhood for the job shop scheduling problem. In this neighborhood, few enhanced conditions are proposed to prevent cycle generation. These conditions allow that the neighborhood encompasses larger number of solutions without increasing the order of computational efforts  

This paper presents stage shop problem which is a special case of the general shop. The stage shop is a more realistic generalization of the mixed shop problem. In the stage shop problem, each job has several stages of operations. In order to solve the stage shop problem with makespan objective function, a tabu search algorithm is developed. In addition, an existing lower bound of the job shop is adapted to the new problem and the computational results have been compared to it. The proposed TS algorithm has reached the optimal solutions for about half of the problem instances  

Development of cities as well as population growth causes to development of public transportation especially subway lines. The high capacity besides the high speed in transportation makes them the popular transportation system. Fire is the one of the most important issues that may occur in subways. The difference in flame size, emissionheat, smoke and pollutants generation of subway fires attracts an especial attention of fire investigators. The emergency ventilation of subways in the case of fire should have the ability of discharging heat, smoke and pollutants from passenger escape route and preparing a safe place for a specific duration. The optimal performance of emergency ventilation... 

Watermarking (imperceptible insertion of data into the host image or soundtracks) has attracted many research interests in the recent decade. The aim of this correspondence is to introduce a none-blind, content-based method for image watermarking. It employs properties of Human Visual System (HVS) and is capable of embedding a high-energy watermark (consequently robust against lossy compressions and other kinds of attacks) while prevents perceptible degradation in the host image. To modulate the binary coded watermark on a spread-spectrum noise, the introduced algorithm is followed by spread-spectrum watermarking. The algorithm was simulated and experimental results represent magnificent... 

In this paper, we used image inpainting as a means for reconstruction of small damaged portions of a watermarked image so that the hidden watermark is not detectable afterwards. Our new watermarking attack algorithm extends the exemplar-based inpainting method, and then we apply it to intended noisy watermarked images to alter the watermark detection process. Our approach is completely free from any pre-assumption on the watermarking algorithm or any other parameters that is used during the watermark embedding procedure. The average PSNR/SSIM of the watermarked image after applying the proposed attack is more than 35/0.98 and the average NC for extracted watermark is lowers than 0.5, so... 

A passive image steganalysis method is proposed to universally detect spatial-domain steganography schemes. It is shown to have better performance than universal steganalyzers known to be powerful in spatial domain, including the WFLogSv and the WAM methods. This level of accuracy is the result of improving the WFLogSv steganalyzer by considering a more comprehensive relationship between the singular values of each image block and the linear correlation of the rows and the columns. That is, instead of the closeness of the lower singular values to zero, the energy distribution of the singular values is investigated. An innovative measure is proposed for this investigation, which is inspired... 

Calculating leakage inductances between windings of multi-winding Traction transformers is one of the most important schemes in design procedure. In this paper, analytical and finite element methods (FEM) have been introduced for electromagnetic modeling of traction transformers with four pancake split windings. Using these models, the leakage inductances between the split windings are calculated and the models have been validated with the help of experimental data gathered from a typical 4000kVA cast-resin dry-type transformer. Some reformations are employed to improve the FEM results and effects of these reformations on accuracy of the model are studied. Employing the validated models, the... 

In this work, a new model of transformer winding is developed. The components in the model are determined by the geometric and electric data of the winding. Under different degrees of axial displacement and radial deformation in the winding, circuit parameters in the model will be changed and thus the character of the circuit will be influenced. After acquiring the model parameters in the intact and faulted cases, transfer function coefficients derived in model from nodal analysis. Then using introduce the new index based on coefficients we can specify the type and extent of penetration of the fault in the winding. Results presented demonstrate the potential of this method  

Recently, a new class of binary codes for overloaded CDMA systems are proposed that not only has the ability of errorless communication but also suitable for detecting active users. These codes are called COWDA. In [1], a Maximum Likelihood (ML) decoder is proposed for this class of codes. Although the proposed scheme for coding/decoding shows impressive performance, the decoder can be significantly improved. In this paper, by assuming practical conditions for the traffic in the system, we suggest and prove an algorithm that increases the performance of the decoder several orders of magnitude (the Bit-Error-Rate (BER) is divided by a factor of about 400 in some E b/N0's). The algorithm... 

In this paper, we propose a distributed rate and power allocation algorithm for real time traffic by using second order statistics of the channel. Our method minimizes the average delay of transmission over the fading channel. We assume that each sub carrier relies on its own buffer, and a constant arrival rate from higher layer application arrives at input buffers of each sub-carrier. This constant rate is optimally distributed through individual sub-rates transmitted over each sub-channel. Optimum power coefficients are also derived to minimize the average delay of transmission. In addition, collision and buffer overflows are taken into account while achieving acceptable throughputs  

The performance of a three-dimensional optical code-division multiple-access system based on polarization-wavelength-time codes is investigated. The unwanted effects of multiple access interference are first studied and an accurate enough expression is given for the upper bound of the bit error rate. The proposed expression is obtained by decomposing the three-dimensional polarization-wavelength-time codes into horizontally and vertically polarized two-dimensional wavelength-time codes that are assumed to be statistically independent. It is shown by Monte Carlo simulation that the assumption of independence gives accurate enough bit error rate, whenever the number of chips is much larger... 

The everlasting bandwidth limitations in wireless communication networks has directed the researchers' thrust toward analyzing the prospect of overloaded Code Division Multiple Access (CDMA). In this paper, we have proposed a Genetic Algorithm in search of optimum signature matrices for binary-input synchronous CDMA. The main measure of optimality considered in this paper, is the per-user channel capacity of the overall multiple access system. Our resulting matrices differ from the renowned Welch Bound Equality (WBE) codes, regarding the fact that our attention is specifically aimed at binary, rather than Gaussian, input distributions. Since design based on channel capacity is... 

Orthogonal frequency division multiplexing (OFDM) is one of the widely used multiplexing techniques in wireless communications and especially cognitive radio networks. One of the key challenges of this technique is its high peak to average power ratio (PAPR) of the transmitted signal. This paper, introduces a new approach to PAPR reduction of OFDM signals using harmony search algorithm (HSA) based on the partial transmit sequence (PTS) method. The simulation results demonstrate that the proposed algorithm has better PAPR reduction performance as an accurate and low complexity approach for OFDM systems  

We have developed an analytic approach to investigate the effect of group delay ripple on the performance of phase-modulated microwave photonic filter. Two cases with and without ripple are analyzed to clarify the ripple's effects on the performance of microwave-photonic filter. Comparison of our proposed analytical approach with simulated OptiSystem® results shows a good agreement  

Cooperation is an integral part of wireless ad hoc networks. In this paper, we introduce a combination of pricing and reputation-based mechanisms targeted at generating higher incentive for cooperation among nodes. The reputation-based part of the mechanism guarantees proper cooperation among sources. In addition, the pricing-based mechanism is added to ensure cooperation of relay nodes. In contrast with earlier works, a more comprehensive definition of cooperation is presented which guarantees a better reward and punishment system. In our approach, a multi-player game is defined with continuous strategy set and payoffs which lead to a more practical model. Based on the proposed game... 

In this paper we present a method of localizing multiple wideband acoustic sources based on both signal attenuation pattern and delays in the reception of the signal. Moreover, an additional order of flexibility is added to the problem by considering the attenuation model as an unknown function with reasonable prior assumptions about its functional space. Such approach is capable of enhancing the localization performance compared to when only the signal attenuation data or the time delays are used. A cost function is then formed in terms of the sources locations and the attenuation model parameters. Having different types of unknowns in the cost function, convergence concerns, and the... 

In this paper, we consider the problem of Minimum-Cost Multicast (MCM) sub-graph optimization with network coding subject to uncertainty in link costs. A number of uncertainty sets such as ellipsoids and bounded polyhedral are taken into account. A robust optimization model is developed to obtain the optimal sub-graph by replacing an uncertain model of MCM by its Robust Counterpart (RC). Then, the analytic and computational optimization tools to obtain robust solutions of an uncertain MCM problem via solving the corresponding explicitly-stated convex RC program is developed and validated through simulations