Non-linear programming has been extensively used in wireless telecommunication systems design. PAPR reduction is implemented in the handheld devices and low complexity is a major objective. High PAPR is one of the major disadvantages of OFDM system which is resulted from large envelope fluctuation of the signal. Our proposed technique to reduce the PAPR is based on constellation shaping that st...

This paper proposes a k-group alignment algorithm for multiple alignment as a practical method. In iterative improvement methods for multiple alignment, the so-called group-togroup two-dimensional dynamic programming has been used, and in this respect our proposal is to extend the ordinary two-group dynamic programming to a k-group alignment programming. This extension is conceptually straightf...

Undergraduate freshman programming classes are conventionally organized such that individual students complete a set of concept-specific and unrelated programming assignments. This structure does not prepare students for future collaborative efforts or for the future use of software engineering practices. The addition of pair programming into a freshman programming class at the University of Ca...

Some anecdotal evidence demonstrates success of the extreme programming practice in a portion of the software industry. It has also been argued that pair programming, as a part of the extreme programming process, yields higher quality software products in less time. On the other hand, these principles are sometimes questioned with respect to resource allocation and management issues. Although p...

Hybrid parallel programming with MPI for internode communication in conjunction with a shared-memory programming model to manage intranode parallelism has become a dominant approach to scalable parallel programming. While this model provides a great deal of flexibility and performance potential, it saddles programmers with the complexity of utilizing two parallel programming systems in the same...

In this article we look at a new algorithm for solving convex mixed integer nonlinear programming problems. The algorithm uses an integrated approach, where a branch and bound strategy is mixed with solving nonlinear programming problems at each node of the tree. The nonlinear programming problems, at each node, are not solved to optimality, rather one iteration step is taken at each node and t...

Protein 3D structure alignment process has become the key focus of interest in structural bioinformatics. Yet, obtaining perfect alignment in a short execution time was not successful to this point. To overcome this problem, researchers tend to use parallel programming techniques to enhance the performance of the alignment process. In this article, we compare between two parallel programming pa...