Sharif Digital Repository

We show that multiple Abelian sectors with Stückelberg mass-mixing simply break supersymmetry via Fayet-Iliopoulos D-terms and straightforwardly mediate it to the other sectors. This mechanism naturally realizes a split supersymmetry spectrum for soft parameters. Scalar squared-masses (holomorphic and non-holomorphic) are induced through sizable portals and are not suppressed. Gaugino masses, a-terms and a μ-like term are generated by higher-dimensional operators and are suppressed. The hypercharge is mixed with extra U(1)'s, it's D-term in non-vanishing and supersymmetry is broken in the visible sector too. Scalar tachyonic directions are removed by unsuppressed interactions and hypercharge... 

In this paper we study and present an in-depth analysis on the operability and the viability of a typical wireless optical CDMA (OCDMA) local area network. Three receiver structures for OCDMA systems, using optical orthogonal codes (OOC) with minimum auto and cross-correlations as signature sequence, namely, correlation, correlation with hard-limiter, and chip-level detection are studied and proposed for such a network. For the synchronization circuit design the performance of two algorithms for OOC based OCDMA networks, namely, simple serial-search and multiple-shift in the context of wireless OCDMA LAN are studied. Furthermore, we study a synchronization method based on matched filtering... 

In this paper we introduce and propose novel signaling methods and receiver structures based on advanced binary optical logic gates for fiber-optic code division multiple access (FO-CDMA) systems using all-optical signal processing. In the proposed system the users of the network are categorized into multiple classes. Users of each class transmit at the same power level but different from the levels of the other classes' users. Using a combination of optical OR, AND and XNOR logic gates for the receiver structure we show that such a network not only takes the full advantages of all-optical signal processing but also demonstrates a considerable throughput efficiency when compared to ordinary... 

In this paper we present and investigate a digital design and implementational details of a wireless optical CDMA (OCDMA) system based on generalized optical orthogonal codes (OOCs). A detailed digital implementation analysis and transmitter/receiver architectures in the context of the above design are fully studied. We analyze various subsystems for a wireless OCDMA system including detector and receiver structure, acquisition, and tracking blocks as well as evaluating their performance in a typical wireless OCDMA communication system. By analyzing two main parts of the system, namely, chip-level detector and OCDMA receiver blocks we evaluate the performance of the overall system.... 

In this study, a new method for the simulation of the time-dependent behavior of actin cytoskeleton during cell shape change is proposed. For this purpose, a three-dimensional model of endothelial cell consisting of cell membrane, nucleus membrane, and main components of cytoskeleton, namely actin filaments, microtubules, and intermediate filaments is utilized. Actin binding proteins, which play a key role in regulating actin cytoskeleton behavior, are also simulated by using a novel technique. The actin cytoskeleton in this model is more dynamic and adoptable during cell deformation in comparison to previous models. The proposed model is subjected to compressive force between parallel micro... 

Applications in pervasive computing environment exploit information about the context of use, such as the location, tasks and preferences of the user, in order to adapt their behavior in response to changing operating environments and user requirements. Utilizing context with aid of ontology in data and model, decision support systems can provide better and more desirable support to their users. The effects and advantages of exploiting ontology in user modeling and DSS is discussed. We propose a framework of a Ontology-based Decision Support System (O2DSS), including ontology in model base, database and their advantages. © 2008 IEEE  

Perovskite solar cells (PSCs) have shown rapid progress in a decade of extensive research and development, aiming now towards commercialization. However, the development of more facile, reliable, and reproducible manufacturing techniques will be essential for industrial production. Many lamination methods have been initially designed for organic photovoltaics (OPVs), which are conceptually similar to PSCs. Lamination could provide a low-cost and adaptable technique for the roll-to-roll production of solar cells. This review presents an overview of lamination methods for the fabrication of PSCs and OPVs. The lamination of different electrodes consisting of various materials such as metal back... 

In this paper we present and investigate a digital design and implementational details of a wireless optical CDMA (OCDMA) system based on generalized optical orthogonal codes (OOCs). A detailed digital implementation analysis and transmitter/receiver architectures in the context of the above design are fully studied. We analyze various subsystems for a wireless OCDMA system including detector and receiver structure, acquisition, and tracking blocks as well as evaluating their performance in a typical wireless OCDMA communication system. By analyzing two main parts of the system, namely, chip-level detector and OCDMA receiver blocks we evaluate the performance of the overall system.... 

In this paper we study and present an in-depth analysis on the operability and the viability of a typical wireless optical CDMA (OCDMA) local area network. Three receiver structures for OCDMA systems, using optical orthogonal codes (OOC) with minimum auto and cross-correlations as signature sequence, namely, correlation, correlation with hard-limiter, and chip-level detection are studied and proposed for such a network. For the synchronization circuit design the performance of two algorithms for OOC based OCDMA networks, namely, simple serial-search and multiple-shift in the context of wireless OCDMA LAN are studied. Furthermore, we study a synchronization method based on matched filtering... 

In this work, phase evolution, solid solution formation and diffusion behavior of three binary systems, including TaC-HfC, TaC-ZrC and HfC-ZrC, were investigated. In this regard, pure carbide powders of TaC, HfC, and ZrC were selected as starting raw materials. The prepared samples were heat treated at 2000 C for 1 hour in Ar atmosphere. For each system, three compositions were chosen for phase evolution investigation by X-ray diffractometer. Moreover, three couple samples were prepared for diffusion behavior survey through SEM/EDX analyses. It was found that ZrC diffuses faster in TaC structure rather than HfC and a single phase solid solution phase with hosting TaC is formed in TaC-HfC and... 

We consider an index coding problem in which several transmitters deliver distinct files to a number of users with minimum delay. Each user has access to a subset of other files from the library, which can be used as side information. The information sent by the transmitters experience a linear transformation before being received at the users. By benefiting from the concept of Zero-Forcing in MIMO systems, we generalize the notion of MinRank characterization and the clique cover algorithm to accommodate this generalized setting. We show that increasing the number of transmitters can substantially reduce the delivery delay. IEEE  

We consider an index coding problem in which several transmitters deliver distinct files to a number of users with minimum delay. Each user has access to a subset of other files from the library, which can be used as side information. The information sent by the transmitters experience a linear transformation before being received at the users. By benefiting from the concept of Zero-Forcing in MIMO systems, we generalize the notion of MinRank characterization and the clique cover algorithm to accommodate this generalized setting. We show that increasing the number of transmitters can substantially reduce the delivery delay. © 1997-2012 IEEE  

Similarity measure is an important key in image registration. Most traditional intensity-based similarity measures (e.g. sum-of-squared-differences, correlation coefficient, mutual information and correlation ratio) assume a stationary image and pixel-by-pixel independence. These similarity measures ignore the correlation among pixel intensities; hence, a perfect image registration cannot be achieved especially in the presence of spatially varying intensity distortions and outlier objects that appear in one image but not in the other. It is supposed here that non-stationary intensity distortion (such as bias field) has a sparse representation in the transformation domain. Based on this... 

The registration of images is a fundamental task in numerous applications in medical image processing. Similarity measure is an important key in intensity based image registration. Here, we propose correntropy measure as similarity measure in mono modal setting. Correntropy is a important measure between two random variables based on information theoretic learning and kernel methods. This measure is useful in non-Gaussian signal processing. In this paper, this measure is used in image registration. Here, we analytically illustrate that this measure is robust in presence of spiky noise (impulsive noise). The experimental results show that the proposed similarity has better performance than... 

Similarity measure is an important key in image registration. Most traditional intensity-based similarity measures (e.g., SSD, CC, MI, and CR) assume stationary image and pixel by pixel independence. Hence, perfect image registration cannot be achieved especially in presence of spatially-varying intensity distortions and outlier objects that appear in one image but not in the other. Here, we suppose that non stationary intensity distortion (such as Bias field or Outlier) has sparse representation in transformation domain. Based on this as-sumption, the zero norm (ℓ0)of the residual image between two registered images in transform domain is introduced as a new similarity measure in presence... 

Similarity measure is an important block in image registration. Most traditional intensity-based similarity measures (e.g., sum-of-squared-difference, correlation coefficient, and mutual information) assume a stationary image and pixel-by-pixel independence. These similarity measures ignore the correlation between pixel intensities; hence, perfect image registration cannot be achieved, especially in the presence of spatially varying intensity distortions. Here, we assume that spatially varying intensity distortion (such as bias field) is a low-rank matrix. Based on this assumption, we formulate the image registration problem as a nonlinear and low-rank matrix decomposition (NLLRMD).... 

Similarity measure is an important part of image registration. The main challenge of similarity measure is lack of robustness to different distortions. A well-known distortion is spatially-varying intensity distortion. Its main characteristic is correlation among pixels. Most traditional intensity based similarity measures (e.g., SSD, MI) assume stationary image and pixel to pixel independence. Hence, these similarity measures are not robust against spatially-varying intensity distortion. Here, we suppose that non-stationary intensity distortion has a sparse representation in transform domain, i.e. its distribution has high peak at origin and a long tail. We use two viewpoints of Maximum... 

In this paper, we propose the Object Pursuing based Efficient Routing Algorithm (OPERA) suitable for vehicular ad hoc networks (VANETs), esp. in sparse situations. The proposed algorithm is applicable for both moving and fixed destinations. It is based on considering static nodes at each intersection. In this algorithm, we optimize the decision making at intersections, with respect to the connectivity and feasibilty of the roads. To this end, we consider the average delay of each road as the connectivity metric, and the vehicle availability in the transmission range of the intersection as the feasibility metric. By exploiting the related metrics, we select the next road to forward the packet... 

Similarity measure is a main core of image registration algorithms. Spatially varying intensity distortion is an important challenge, which affects the performance of similarity measures. Correlation among the pixels is the main characteristic of this distortion. Similarity measures such as sum-of-squared-differences (SSD) and mutual information ignore this correlation; hence, perfect registration cannot be achieved in the presence of this distortion. In this paper, we model this correlation with the aid of the low rank matrix theory. Based on this model, we compensate this distortion analytically and introduce rank-regularized SSD (RRSSD). This new similarity measure is a modified SSD based... 

We present a constant-time randomized distributed algorithms in the congested clique model that computes an O(α)-vertex-coloring, with high probability. Here, α denotes the arboricity of the graph, which is, roughly speaking, the edge-density of the densest subgraph. Congested clique is a well-studied model of synchronous message passing for distributed computing with all-to-all communication: per round each node can send one O(log n)-bit message algorithm to each other node. Our O(1)-round algorithm settles the randomized round complexity of the O(α)-coloring problem. We also explain that a similar method can provide a constant-time randomized algorithm for decomposing the graph into O(α)...