Search

This paper uses the unique biometric features of fingerprints to generate random cryptographic keys. The main aspects of the security of the generated key include the privacy of the fingerprint and the randomness and complexity of the key generation algorithm. In the proposed method, first, the unique fingerprint features, which include Minutiae points, are extracted from the fingerprint image. Then, to increase the statistical properties and complexity of the algorithm, the Euclidean distance and the angle of all the points of Minutiae relative to each other are calculated and stored. In the next step, after normalizing to 8-bit numbers, these data are moved by permutation operations and combined. In the following, the proposed method is used to increase the level of security and the ability to be random from the non-linear operations of 8-bit S-boxes S0 and S1 used in the CLEFIA block cipher. Statistical analyzes performed on the generated keys show the acceptable random nature of the keys. Therefore, the proposed structure for generating a random key can be used in encrypting digital signals with large volumes of data such as image and sound. [ABSTRACT FROM AUTHOR]

The ever-increasing of renewable distributed generation sources in distribution networks, as well as increasing network size, have faced agent-based protection schemes with a heavy communicational load. Accordingly, despite the fast and reliable nature of multi-agent systems, they have the possibility of improper performance, especially in centralized protection systems. This paper presents an intelligent self-healing method that has the ability to replace common multi-agent systems during fault conditions. Therefore, protection tasks are performed in a single control level, without dependence on higher communicational levels, to clear the fault. Decentralized operation of this structure is provided by using intelligent electronic devices and distributed communications. In this way, the proposed scheme is described with high-speed peer-to-peer communication capability using the IEC-61850 GOOSE protocol. Then, a penetration-free algorithm, without the help of a central controller, is provided by using GOOSE message capabilities, to prevent any electricity interruption due to insufficient protection settings. Finally, by planning different scenarios and simulating a practical distribution network via ETAP software, the accuracy of the proposed algorithm has been proven. [ABSTRACT FROM AUTHOR]

As social networks grow, they become more and more complex, and analyzing them becomes complicated. One way to reduce this complexity is to divide the network into subnets, which are also called communities. Dividing social networks into desirable communities can help analysts and experts to understand the behavior and function of the networks. Community detection in networks is a challenging topic in network science and various methods have been proposed for that. Modularity maximization is one of the state-of-the-art methods suggested for community detection. Modularity maximization is an NP-hard problem meaning that no polynomial-time algorithm exists that could solve the problem optimally unless P=NP. A group of approaches that could solve such problems is approximate algorithms. Identifying the influential nodes has many important applications in social networks. This technique could also be used in community detection. To maximize modularity, in this paper, we propose approximate algorithms based on identifying the influential nodes and their influence domain. We used the concept of scale-free networks to prove the approximate factor. Experiments on real-world networks show that the proposed algorithm can compete with the state-of-the-art methods of community detection algorithms. [ABSTRACT FROM AUTHOR]

In this paper, a new fractional-order fuzzy controller named proportional fuzzy ا integral fuzzy + deferential fuzzy (FP + Fla + FDp) is proposed. The proposed controller is single gain, integrate, derivative and fractional order in its structure. The controller has a structure with two adjustable fractions and is simply designed. This controller performs the stability process in a short time. The response time can also be changed by adjusting the coefficient of time scale a and p, which makes it more flexible and efficient compared to the classic PID controller. On the other hand, in the design of the proposed controller, the optimal adjustment of the controller gain and fuzzy members has turned into an optimization problem, which is done by a hybrid algorithm based on the vcs and the HBC colony (ABC) based on a function in the time domain. In the proposed hybrid algorithm, attempts have been made to take advantage of local and final search as the strengths of these controllers to dramatically reduce the possibility of locating in local points. Investigations of different load variation scenarios, better performance of the proposed controller facing load disturbances from the root mean square, rise and fall time, will show the number of oscillations, and the fall time of the frequency changes. [ABSTRACT FROM AUTHOR]

Background & Aims: Cancer is one of the great human challenges in all countries, both advanced and developing. Cancer treatment management can include surgery, chemotherapy, or radiation therapy (1). Radiation therapy is done in two ways: Teletherapy and Brachytherapy. Brachytherapy involves the use of radiation sources to treat cancer by irradiating cancerous tissue from within the patient’s body (2). But the dose and how to use this method has always been questionable for researchers. Therefore, this study creates a new fuzzy approach to high-dose brachytherapy by optimizing the distribution of double roughness based on dosimetric criteria. The use of fuzzy logic itself has increased the accuracy of the mathematical model of the problem. This fuzzy model is a new study and innovation used in this paper. Due to the fuzzy nature of this method and its limitations, it is considered fuzzy. This makes the method more accurate and includes parameters such as the patient’s physical ability and age in the problem, which in itself increases the accuracy of the method for each patient. As a result, the obtained answer is improved and the executive program of brachytherapy method is more accurate. Methods: In the present study, the dose prescribed for an organ was evaluated by dosimetric indices listed in Table 1 (18). For the present study, data from 20 patients in the age range of 50 to 74 and mean age 62 years with a wide range of prostate volume between 23 and 103 cubic centimeters, and for the treatment of prostate cancer by brachytherapy from the Academic Medical Center (AMC, Amsterdam, the Netherlands) had participated. To compare brachytherapy programs with high interstitial dose, the dose rate was calculated with 192Ir beam with a radiation dose of 13 Gy, according to the standard protocol TG-43. To begin with, computed tomography (CT) scans or magnetic resonance imaging (MRI) were taken from the patients pelvis, and entered into the treatment planning software for use in treatment planning sessions. BT treatment planners and specialists then determined the input catheters, target volumes, and OARs obtained from the medical images. Depending on the size and exact location of the target volumes, between 14 and 20 catheters entered the patient’s body, reaching the target volumes. After designing and approving an acceptable treatment plan, the catheters inserted into the patient’s body were connected to a retractor 4 that controls the movement of the radiation source. After the treatment program, the source was returned to the retractor (8, 14). Then, an integer program model with fuzzy constraints was proposed for programming on high-dose brachytherapy. The description of infrastructures, parameters and variables in this model are in Table 2 (15 ). Finally, the dosimeter index is equal to the sum of all the index variables, as it turned out: The proposed model is a correct programming model called IP. In general, three evolutionary algorithms (EP), (GA) and (ES) were used in this research. The algorithms stopped after creating 20 generations of desirable answers and the best answer of each generation was determined on the chart as a point. The resulting set of answers were connected in the form of graphs, which are used to analyze the results. Each point on the graph identifies the best answer from each of the generations generated by the respective algorithms. These three algorithms were performed independently for each patient and the obtained answers were identified as dots on the chart. The graph obtained for each patient indicates the capability of each of these algorithms. Results: According to this study, each of the three algorithms (EP), (GA) and (ES) are each run independently for each of the patients with prostate cancer. At first, the genetic algorithm showed the ability to get closer to the desired answer sooner, but as the optimization process continues, the rate of convergence to the desired answer decreases, so if the time parameter is very important, the genetic algorithm can be useful. Especially for patients whose prostate volume was larger than other patients. In patients 15, 12, 8 and 9, due to their younger age than other patients and better physical condition, as well as prostate volume less than 80 ml, they had much more promising results than other patients. In contrast, for patients 4 and 19 with an age of over 70, the results were not as favorable as for other patients. The * sign in the table indicates that there is no answer through that patient-specific algorithm that covers 95 or even more of the tumor volume. Therefore, according to Table 2, it can be concluded that the best algorithm that can be considered for the case where the shortest time to reach the target coverage above 95% is the genetic algorithm. According to Table 2, it can be concluded that the best algorithm that can be considered for the case where the shortest time to reach the target coverage above 95% is the genetic algorithm. Therefore, according to Table 3, the ES algorithm has better answers than the other two algorithms for the case in which the largest volume of the tumor is covered. According to the results, the ES algorithm has obtained the best results for patients under 60 years of age and normal prostate volume. Conclusion: According to the obtained results, it can be stated that whether the main goal is the maximum coverage or the goal is the shortest possible time to reach the coverage above 95%, the best algorithm that can get a good answer for each patient is the evolutionary strategy algorithm. [ABSTRACT FROM AUTHOR]

One of the most important parts of infrared search and tracking systems is image processing, which detects the targets in infrared images. In this paper, a new infrared small target detection algorithm is proposed. The proposed method uses heuristic optimization algorithms to find small targets in infrared images. In this way, the particle swarm optimization algorithm is used as one of the best heuristic optimization algorithms. The performance of the proposed algorithm is evaluated using real and simulated infrared images. These images include a variety of false response sources like high-intensity edges, cloudy background, complex sea-sky background, and a target close to high-intensity background clutter. The experimental results are compared with the four common methods of infrared small target detection. The experimental results show the effectiveness and performance of the proposed algorithm. Also, the runtime of the proposed method is comparable to other commonly used methods, and this makes it usable in real-time programs. [ABSTRACT FROM AUTHOR]