Computer Numerical Control machines are the main machine tool used in machining process. The optimization of numerical control machining processes can significantly improve the energy performance of machining to achie...
详细信息
ISBN:
(纸本)9781509012244
Computer Numerical Control machines are the main machine tool used in machining process. The optimization of numerical control machining processes can significantly improve the energy performance of machining to achieve sustainability. In this paper, an energy consumption model has been built to take the energy consumption into account as the optimization aim and a Gcode based approach has been developed to achieve the optimization of tool path connection. In the approach, exhaustive algorithm and simulated annealing algorithm are used to achieve the optimization where energy consumed in the numerical control machining process is used as the performance criteria. A case study from practical manufacturing is given. The experiment results prove that our approach is valid to achieve energy efficient machining process.
In this paper, an exhaustive algorithm for extracting structured motifs has been presented. Structured motif is defined as an ordered set of highly-conserved over-presented patterns which occur near each other in a se...
详细信息
In this paper, an exhaustive algorithm for extracting structured motifs has been presented. Structured motif is defined as an ordered set of highly-conserved over-presented patterns which occur near each other in a set of DNA sequences. The presented algorithm is based on an innovative data structure called l-mer trie. As opposed to other existing motif finders, this algorithm offers more flexibility in terms of the possibility of determining a range for length of the single patterns, their substitution rates and the spacing between them. The possibility of defining a minimum bound for substitution rates saves considerable time and space in the case of searching for weak motifs occurring with many mutations. Efficiency of the algorithm has been verified on some artificial sequences as well as real DNA sequences of some plant viruses. The results have been compared with those achieved by RISO, another tree-based algorithm, which is claimed to have notable time and space gains over the best known exact algorithms.
A numerical method for determining the five-parameter model of photovoltaic cells is presented in the paper. Explicit equations are applied to analyze the relations between parameters and determine their values by opt...
详细信息
ISBN:
(纸本)9783037857410
A numerical method for determining the five-parameter model of photovoltaic cells is presented in the paper. Explicit equations are applied to analyze the relations between parameters and determine their values by optimization algorithm. Unlike previous works, the application of explicit equations and the simple algorithm make the proposed method very simple. The proposed method is validated by Shell *** is found that the proposed method gives superior results not only on standard but also on operating conditions of photovoltaic cells. Considering its simplicity and accuracy the method can be applied in practice widely.
Cooperative spectrum sensing (CSS) is a promising technology in cognitive radio (CR) networks. Among the many existing CSS methods, the cooperation in a single channel is studied extensively. However, CR networks usua...
详细信息
ISBN:
(纸本)9781424492688
Cooperative spectrum sensing (CSS) is a promising technology in cognitive radio (CR) networks. Among the many existing CSS methods, the cooperation in a single channel is studied extensively. However, CR networks usually deal with multiple channels, therefore multi-channel CSS needs be studied. In this paper, we investigate the problems that how to optimally assign secondary users (SU) to cooperatively sense multiple channels and how to optimally set the sensing time and sensing thresholds. An optimization problem of multi-channel CSS is formulated to maximize the average throughput of CR networks subject to the constraints of probability of detection for each channel. An exhaustive algorithm and a greedy algorithm are proposed to obtain the optimal solutions of the optimization problem. Finally, both analytical and numerical results are presented to demonstrate the effectiveness of our proposed algorithms. It is also shown that the greedy algorithm with a low complexity achieves the same performance as the exhaustive algorithm.
We describe an exhaustive and greedy algorithm for improving the accuracy of multiple sequence alignment. A simple progressive alignment approach is employed to provide initial alignments. The initial alignment is the...
详细信息
暂无评论