The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Spanning subgraph is necessary for the communication in networks. For example, the malfunctioning of one or more nodes in a network in general affects both the global and the local properties of the remaining nodes, because it makes some edges unusable and destroys the connectivity of the system. In this study, we focus on the characters of a network to be fractional-r-factors, fractional (r, k)-extendable...
In this paper, a new iterative algorithm for determination of direction cosine matrix (DCM) is presented, it can be expressed as two forms, matrix exponential and six scalar differential equations respectively, corresponding to each form, related algorithms used for the orthonormalization are derived, although the simulations and algorithm analysis are omitted here, the Van test results verified its...
A capacitated multi-facility Weber problem (CMFWP) is widely used in both theoretic and practical environments. The most studies in this field tackled the problem either by deterministic or probabilistic orientation. Nevertheless, in the real world, some parameters (e.g., demand) are usually imprecise (fuzzy) in nature. Thus, in this paper, we address the CMFWP with fuzzy demands. To solve this problem,...
The multitone signals make traditional analysis difficult even impossible if the circuits are highly nonlinear. Using multiple time variables allow an efficient representation of these signals. In this formulation the components with different rates of variation are decoupled, each disparate signal being represented by its own artificial time scale. The differential algebraic equations describing...
The difficulties encountered in sequential decision-making problems under uncertainty are often linked to the large size of the state space. Exploiting the structure of the problem, for example by employing a factored representation, is usually an efficient approach but, in the case of partially observable Markov decision processes, the fact that some state variables may be visible has not been sufficiently...
When a local optimal solution is reached with classical Particle Swarm Optimization (PSO), all particles in the swarm gather around it, and escaping from this local optima becomes difficult. To avoid premature convergence of PSO, we present in this paper a novel variant of PSO algorithm, called MPSOM, that uses Metropolis equation to update local best solutions (lbest) of each particle and uses mutation...
After exploring multi-round difference feature of Serpent encryption algorithm and using the method of constructing S-boxes algebraic equations, we put forward Rectangle algebraic attack of 10-round Serpent-256. This method analyzed that 10-round Serpent-256 needed 2 × 2144 × 210 = 2155 pairs of selective plaintexts, 2155 times of 10-round encryption and 2155 times of 10-round decipher, as well as...
This paper proposes a new double iterative procedure for sum-rate maximization in a Multiuser MIMO system (MU-MIMO). The proposed algorithm is based on joint precoder and decoder optimization involving two different decoding schemes. For that we considered a precoding algorithm namely the iterative SJNR (Signal to Jamming and Noise Ratio) precoder combined with two iterative receivers. The first receiver...
Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fully preemptive scheduling when reduced blocking times need to coexist with an acceptable context switch overhead. To achieve this goal, preemptions are allowed only at selected points of the code of each task, decreasing the preemption overhead and simplifying the estimation of worst-case execution parameters...
The traditional authentication for grid is based on PKI framework, using standard X.509 certificates. But with the growing scale of the grid, certificate management would become an encumbrance. However, certificateless-based signature scheme can overcome these problems for its certificate-free feature, and make authentication more efficient. In this paper, a certificateless-signature-based authenticated...
To enhance the security and reliability of the widely-used stream ciphers, a 2-D and a 3-D mesh-knight Algorithm Based Fault Tolerant (ABFT) schemes for stream ciphers are developed which can be universally applied to RC4 and other stream ciphers. Based on the ready-made arithmetic unit in stream ciphers, the proposed 2-D ABFT scheme is able to detect and correct any simple error, and the 3-D mesh-knight...
In a wireless sensor network (WSN), the sensors closest to the sink tend to deplete their energies faster than the other sensors, which is known as an energy hole around the sink. To avoid this, a new scheme for placing nodes, via adjusting surface densities and initial energies in each ring in a ring model, is proposed in this paper. A new definition of network efficiency, including the consideration...
Among the approaches used to analyze biomedical signals, e.g. electroencephalogram, there are methods based on fractal dimension (FD) calculation. One of the main drawbacks of these methods is the requirement for long duration of the analyzed signal. To analyze events of brief duration in real-time mode and to apply the results obtained directly in the time domain, thus providing an easier interpretation...
A general new methodology using evolutionary algorithm viz., Elitist Non-dominated Sorting Genetic Algorithm (NSGA-II) and Multi Objective Particle Swarm Optimization (MOPSO) for obtaining optimal tolerance allocation and alternative process selection for mechanical assembly is presented. The problem has a multi-criterion character in which 3 objective functions, 6 constraints and 11 variables are...
Optimization problems are ubiquitous and consequential. In fact every sphere of human activity that can be quantified can be formulated as an optimization problem. The focus of this work is on Global Optimization which is not only desirable but also necessary in many cases. In the past few decades several Global optimization algorithms have been suggested in literature out of which stochastic, population...
In this paper, a method based on multi-objective evolutionary algorithms, is described to establish a correspondence between the ancient Indus script, with its descendant, a script called Brahmi that can be easily read. Our approach, which establishes a map between one or more symbols of the Indus script with each Brahmi character, is a standard problem in combinatorial optimization. As the Indus...
In this paper, we applied the artificial bee colony algorithm (ABC) to the object recognition in the images. ABC is a new metaheuristics approach inspired by the collective and individual foraging behavior of honey bee swarm. The objective is to find a pattern or reference image (template) of an object somewhere in a target landscape scene, considering that it may be translated, scaled, rotated and/or...
How to automatically parallel large amount of sequential legacy code has become one of the key issues, especially for domain specific scientific applications. It is more urgent as multi-core processors are increasingly popular. Taking the extremely compute and I/O intensive prestack migration application of the geophysics exploration as an example, this paper discusses its algorithms and implementations,...
There is a recent surge of interest in developing algorithms for finding sparse solutions of underdetermined systems of linear equations y = ??x. In many applications, extremely large problem sizes are envisioned, with at least tens of thousands of equations and hundreds of thousands of unknowns. For such problem sizes, low computational complexity is paramount. The best studied l1 minimization algorithm...
Inverse analysis of rock displacement is a kind of new way of studying the parameter of physical power of rock, a lot of researchers have carried on research in this respect, and some researchers among them ask solving this question with the genetic algorithm. This paper apply master-slaver model parallel genetic algorithm (MSM-PGA ) to solve inverse analysis of rock displacement, in the course of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.