Rubik’s Cube Solver

: Rubik’s cube is considered to be the most interesting and challenging problem in the world. It is a 3D combination puzzle that was originally called the Magic cube. It has only one correct solution out of the 43quintillion other possibilities. Building an application to solve such a puzzle is a very challenging task. In this paper, the design of such a Rubik’s cube solver website using Color Recognition has been discussed. This paper includes the overall process flow for solving the Rubik cube [1]. Our website is designed in such a way that when it will receive a scrambled Rubik’s Cube, it will visually evaluate it, will determine how that Rubik’s cube can be solved through manipulations and will provide a guide of the solution to the specific user. We have used Color recognition for detecting the initial orientation of the cube. And Segmentation is used to obtain the color pattern of the scrambled cube.

Implementation of modified GSO based magic cube keys generation in cryptography

Over the last few decades, tremendous and exponential expansion in digital contents together with their applications has emerged. The Internet represents the essential leading factor for this expansion, which provides low-cost communication tools worldwide. However, the main drawback of the Internet is related to security problems. In order to provide secure communication, enormous efforts have been spent in the cryptographic field. Recently, cryptographic algorithms have become essential for increasing information safety. However, these algorithms require random keys and can be regarded as compromised when the random keys are cracked via the attackers. Therefore, it is substantial that the generation of keys should be random and hard to crack. In this paper, this is guaranteed via one of the most efficient nature-inspired algorithms emerged by inspiring the movements of stars, galaxies, and galaxy superclusters in the cosmos that can be utilized with a mathematical model (magic cube) for generating hardly cracking random number keys. In the proposed cryptographic system, the Modified Galactic Swarm Optimization (GSO) algorithm has been utilized in which every row and column of magic cube faces are randomly rotated until reaching the optimal face, and the optimal random elements are selected as optimal key from the optimal face. The generated optimized magic cube keys are used with several versions of RC6 algorithms to encrypt various secret texts. Furthermore, these generated keys are also used for encrypting images using the logical XOR operation. The obtained results of NIST tests proved that the generated keys are random and uncorrelated. Moreover, the security of the proposed cryptographic system was proved

Magic cube puzzle approach for image encryption

In principle, the image encryption algorithm produces an encrypted image. The encrypted image is composed of arbitrary patterns that do not provide any clues about the plain image and its cipher key. Ideally, the encrypted image is entirely independent of its plain image. Many functions can be used to achieve this goal. Based on the functions used, image encryption techniques are categorized into: (1) Block-based; (2) Chaotic-based; (3) Transformation-based; (4) Conventional-based; and (5) Miscellaneous based. This study proposes a magic cube puzzle approach to encrypt an 8-bit grayscale image. This approach transforms a plain image into a particular size magic cube puzzle, which is consists of a set of blocks. The magic cube puzzle algorithm will diffuse the pixels of the plain image as in a Rubik’s Cube game, by rotating each block in a particular direction called the transposition orientation. The block’s transposition orientation is used as the key seed, while the generation of the cipher key uses a random permutation of the key seed with a certain key length. Several performance metrics have been used to assess the goals, and the results have been compared to several standard encryption methods. This study showed that the proposed method was better than the other methods, except for entropy metrics. For further studies, modification of the method will be carried out in such a way as to be able to increase its entropy value to very close to 8 and its application to true color images. In essence, the magic cube puzzle approach has a large space for pixel diffusion that is possibly supposed to get bigger as a series of data has transformed into several magic cubes. Then, each magic cube has transposed with a different technique. This proposed approach is expected to add to a wealth of knowledge in the field of data encryption.

A Land Space Development Zoning Method Based on Resource–Environmental Carrying Capacity: A Case Study of Henan, China

As a key element in China’s spatial planning, the development zoning of land space has become a focus of China’s current activity. During its rapid social and economic development, China has faced severe and diverse challenges regarding sustainable development, such as farmland occupation, environmental degradation, urban land disorder expansion, etc. Against this backdrop, research on the linkage between resource–environmental carrying capacity (RECC) and the development zoning of land space in the process of sustainable development has received increased attention, and an accurate evaluation of the RECC would provide useful guidance for Chinese policy makers to carry out the development zoning of land space. This paper uses Henan Province as an example to construct a comprehensive evaluation model of “resource carrying capacity (RCC)–eco–environmental carrying capacity (EECC)–socio–economic carrying capacity (SECC)”, which calculates the level of RECC in a provincial area. In addition, this paper designs a correlation model between the RECC and the development zoning of land space, which uses a three-dimensional magic cube evaluation model to analyze the development zoning layout of land space. The results showed that a geographical pattern exists, where in the southwestern areas of Henan Province have a higher RECC than the central and northeastern areas. The results also indicated that the land space patterns of Henan Province can be divided into seven types of areas through a three-dimensional magic cube evaluation model, which can better reflect the spatial differentiation characteristics of the comprehensive index of RECC. The results of this study offer an important reference for policy-makers to make decisions and also provide a scientific and pragmatic basis for the formulation of sustainable development strategies.

Feasibility study of highway project in the environment sensitive area of Western China -- Based on the magic cube model of construction necessity and ecological friendliness

Under the background of the strategy of “strong transportation country”, the feasibility study of highway network construction is a hot topic in academic fields such as highway line selection. It is also an important means to promote development of eco-sensitive regions such as Sanjiangyuan in Qinghai-Tibet plateau. We selected 17 indexes of construction necessity and 9 indexes of ecological friendliness to evaluate the feasibility of highway network construction. The indexes were weighted by the analytic hierarchy process (AHP) and expert scoring method. Furthermore, we used comprehensive factor evaluation model to quantify the construction necessity and ecological friendliness of planning highways in Sanjiangyuan. Finally, we used the magic cube model to calculate the score of construction feasibility. The result shows the number of planning highways with high, relatively-high, medium, relatively-low and low construction feasibility is 16, 11, 11, 11 and 1, respectively. The feasibility of planning highway construction in the eastern and western region of Sanjiangyuan is similar generally, which don’t have big interregional difference. Results of this study can provide technical support and theoretical basis for regional highway network construction and traffic route planning in underdeveloped areas in the West China.

Bi-Directional Loop Antenna Array Using Magic Cube Origami

In this paper, we propose a bi-directional loop antenna array using magic cube origami. The proposed antenna array consists of three one-wavelength loop antenna elements with series feeding. Each loop antenna is realized on a single magic cube, and three cubes are connected in series to form the array. The three cubes can be easily folded and unfolded due to being constructed in the form of a magic cube origami. Antenna volume can be minimized for high mobility by folding the array, which radiates a bi-directional pattern with full volume when unfolded. The proposed antenna was designed at 1.39 GHz. When the single antenna is realized on the single cube, the peak gain is 4.03 dBi. The peak gain increased to 5.2 and 5.53 dBi with two and three antennas, respectively. Half-power beam width (HPBW) with three antenna elements decreased to 40° from 360° compared to the HPBW with the single antenna. The proposed antenna performance was assessed numerically and experimentally.