به نام خدا
Title: Slender-Set Differential Cryptanalysis
Authors: Julia Borghoff, Lars R Knudsen, Gregor Leander, and Sren S Thomsen
Abstract: This paper considers PRESENT-like ciphers with key-dependent S-boxes. We focus on the setting where the same selection of S-boxes is used in every round. One particular variant with 16 rounds, proposed in 2009, is broken in practice in a chosen plaintext/chosen cipher text scenario. Extrapolating these results suggests that up to 28 rounds of such ciphers can be broken. Furthermore, we outline how our attack strategy can be applied to an extreme case where the S-boxes are chosen uniformly at random for each round, and where the bit permutation is key-dependent as well.
Publish Year: 2013
Published in: Journal of Cryptography - Journal of Springer
Number of Pages: 28
موضوع: رمزنگاری (Cryptography)
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: Visualizing Uncertainty in Multi-resolution Volumetric Data Using Marching Cubes
Authors: J Ma,D Murphy,M Hayes,G Provan
Abstract: Data sets acquired from complex scientific simulation, high precision engineering experiment and high-speed computer network have been exponentially increased, and visualization and analysis of such large-scale of data sets have been identified as a significant challenge to the visualization com-munity. Over the past years many scientists have made at-tempt to address this problem by proposing various data reduction techniques. Consequently the size of data can be reduced and issues associated to the visualization can be improved (e.g. real-time interaction and visual overload).However, during the process of data reduction, the information of original data sets was approximated and potential errors were introduced. It leads to a new problem with regard to the integrity of the data and might mislead users for incorrect decision making. Therefore in this paper we aim to solve the problem by introducing three novel uncertainty visualization methods, which depict both the multi-resolution(MR) approximations of the original data set and the errors associated with each of its low resolution representations. As a result we faithfully represent the MR data sets and allow users to make suitable decisions from the visual output. We applied our techniques on a data set from medical domain to demonstrate their effectiveness and usability.
Publish Year: 2012
Published in: AVI - ACM
Number of Pages: 8
موضوع: مصورسازی داده ها (Data Visualization)
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: Thermal phenomena associated with water transport across a fuel cell membrane: Soret and Dufour effects
Authors: K Glavatskiy a,n , JG Pharoah b , S Kjelstrup
Abstract: We present calculations of the coupling effects that take place when heat and water are transported across a membrane relevant to fuel cells, using the theory of non-equilibrium thermodynamics. Numerical results are given for the Nafeon membrane bounded by surfaces of molecular thickness in contact with water vapor of varying relative humidity. Analytical expressions for thermal effects of water transport are given. We show how reversible heat transport (Dufour effects) can be understood in terms of coupling coefficients (heats of transfers). The sign of the enthalpy of adsorption of water in the membrane determines the sign of the coupling coefficient, the Dufour and Soret effect as well as thermal osmosis effects meaning that the effect can be large at interfaces. Weshow how data presented in the literature can be understood in terms of the presented theory. Using common estimates for transport properties in the membrane and its surface, we ?nd that the more detailed equations predict a 10 30% variation in the heat and mass fluxes as the membrane thickness drops below 1 mm. Analysis of experiments on thermal osmosis suggests that more accurate measurements on the water content as a function of activity are required.
Publish Year: 2013
Published in: Journal of Membrane Science - Science Direct
Number of Pages: 9
موضوع: ترمودینامیک
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: An artificial bee colony algorithm for the maximally diverse grouping problem
Authors: Francisco J Rodriguez , M Lozano a , C GarcaMartnez b , Jonathan D GonzlezBarrera
Abstract: In this paper, an artificial bee colony algorithm is proposed to solve the maximally diverse grouping problem. This complex optimization problem consists of forming maximally diverse groups with restricted sizes from a given set of elements. The artificial bee colony algorithm is a new swarm intelligence technique based on the intelligent foraging behavior of honeybees. The behavior of this algorithm is determined by two search strategies: an initialization scheme employed to construct initial solutions and a method for generating neighboring solutions. More specifically, the proposed approach employs a greedy constructive method to accomplish the initialization task and also employs different neighborhood operators inspired by the iterated greedy algorithm. In addition, it incorporates an improvement procedure to enhance the intensification capability. Through an analysis of the experimental results, the highly effective performance of the proposed algorithm is shown in comparison to the current state-of-the-art algorithms which address the problem.
Publish Year: 2013
Published in: Information Sciences - Science Direct
Number of Pages: 14
موضوع: الگوریتم زنبور عسل (Bee Colony Algorithm)
لینک مقاله در سایت Science Direct
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: A Survey of Ant Colony Optimization-Based Approaches to Routing in Computer Networks
Authors: Peter Janacik Dalimir Orfanus Adrian Wilke
Abstract: Nature has provided an elegant solution for the routing problem millions of years ago, when ant colonies started to use swarm intelligence to discover food and route it reliably to their formicaries. The approach utilized by ants has several advantages that are also useful in computer networks: complete distribution, load balancing finding shortest paths with a high probability. Several routing protocols designed for the area of computer networks have made use of this approach, called ant colony optimization. This paper provides first a broad overview of ant colony optimization-based routing protocols, while focusing on four selected approaches in later sections, describing their operation and discussing their properties in detail.
Publish Year: 2013
Published in: ISMS - IEEE
Number of Pages: 6
موضوع: الگوریتم کلونی مورچه‌ها (Ant Colony Algorithm) – مسیریابی هوشمند در شبکه‌های کامپیوتری (Routing in Computer Networks)
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
