Sharif Digital Repository

It has been passed more than half a century from the application of value methodology (including value analysis, value engineering, value management and value planning) to improve the project value and so far, thousands of value studies (VSs) have been performed all over the world. Because of the nature of this method, in all of data value studies, new approaches and valuable knowledge – which is called “study outcomes (OS)” in this study – are produced by specialists. However, nearly all of the new VSs as well as planning, designing or performing of new project is performed regardless of previous VS repeatable outcomes whereas presence of some previous VS members can be useful to enhance... 

There is much interest in the theoretical study of the structure of hypercubes because their structure has played an important role in the development of parallel processing and is still quite popular and influential.This thesis will begin with an introduction to hypercubes and some of their problems. Then we study the following concepts: Arboricity (The minimum number of edge-disjoint forests into which a graph can be decomposed), Galactic number (similar to arboricity but such that each component of each forest is a star), Silver coloring (Given a set I of maximal independent vertices, a silver coloring with respect to I is such that every v 2 I sees every other colors in its closed... 

This work is concerned with new methods for decomposing large scale systems into disjoint neighborhoods with specific size determined a priori by the communication load of the Jacobi based distributed optimization technique. This iterative optimization technique has the following features: it handles hard control input and state constraints; and for convex optimization problem, in the limit, its solution converges to the optimal solution. The proposed decomposition techniques cluster subsystems based on the strength of control inputs interaction. Three techniques are proposed. The first technique is an extended version of REGA. The second is an extended version of Participation... 

Objective of Secret Sharing is assigning some random variable which will be called shares, generated based on a random variable called secret, to some participant such that only specific subsets of participants could reconstruct the secret by polling their shares together. Constructing shares as small as possible is desired, hence notions like information ratio and average information ratio have been studied and considered to be a measure of efficiency of secret sharing schemes. In this research contribution vectors of access structures with five participants and graph based access structures with six participants have been studied. Small access structures have been considered shortly after... 

Here, we explain an algorithm, recently introduced in the literature, for the personalized nurse scheduling problem. In this algorithm the authors focus on the deterministic counterpart of the specific problem that has been described in the second international nurse rostering competition. One specificity of this version is that most constraints are soft, meaning that they can be violated at the price of a penalty. The problem is modeled as an integer program (IP) and is solved using a branch-and-price procedure. In this model, each column of the IP corresponds to a rotation, i.e., a sequence of consecutive working days for a nurse. In contrast, classical models involve individual nurse... 

In this thesis, in addition to reviewing the previous work done in the study of ideal access structures, we present the author's recent results in this field. As a first result, we introduce a new technique for reducing the size of the secret space in ideal homomorphic secret sharing schemes. The concept of decomposition of secret sharing schemes is formally introduced for the first time. In this regard, we show that ideal homomorphic and abelian secret sharing schemes are decomposable. We also examine the inherent group-characterizability of secret sharing schemes and show that an ideal secret sharing scheme is not necessarily inherently group-characterizable. Some weaker definitions of the...