Companies compete greatly with each other today, so they need to focus on innovation to develop their products and make them competitive. Lean product development is the ideal way to develop product, foster innovation, maximize value, and reduce time. Set-Based Concurrent Engineering (SBCE) is an approved lean product improvement mechanism that builds on the creation of a number of alternative designs at the subsystem level. These designs are simultaneously improved and tested, and the weaker choices are removed gradually until the optimum solution is reached finally. SBCE implementations have been extensively performed in the automotive industry and there are a few case studies in the aerospace industry. This research describe the use o

This paper aimed to test random walking through the ISX60 market index for the ability to judge market efficiency at a weak level. The study used Serial Correlation Test, the Runs Test, the Variance Ratio Test, as well as the Rescaled Range Test.The population of the study represents of Iraq Stock Exchange. The study concluded accepting the hypothesis of the study that the returns of the ISX60 market index in the Iraqi market for securities does not follow the random walking in general and as a result the Iraq market for securities is inefficient within the weak level of efficiency and the study recommended need a supervisors work in the Iraqi market for securities to activate all means a which will work to communication with information

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith

As many expensive and invasive procedures are used for the diagnosis or follow-up of clinical conditions, the measurement of cell-free DNA is a promising, noninvasive method, which considers using blood, follicular fluid, or seminal fluid. This method is used to determine chromosomal abnormalities, genetic disorders, and indicators of some diseases such as polycystic ovary syndrome, pre-eclampsia, and some malignancies. Cell-free DNA, which are DNA fragments outside the nucleus, originates from an apoptotic process. However, to be used as a marker for the previously mentioned diseases is still under investigation. We discuss some aspects of using cell-free DNA measurements as an indicator or marker for pathological conditions.

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed

<p>Energy and memory limitations are considerable constraints of sensor nodes in wireless sensor networks (WSNs). The limited energy supplied to network nodes causes WSNs to face crucial functional limitations. Therefore, the problem of limited energy resource on sensor nodes can only be addressed by using them efficiently. In this research work, an energy-balancing routing scheme for in-network data aggregation is presented. This scheme is referred to as Energy-aware and load-Balancing Routing scheme for Data Aggregation (hereinafter referred to as EBR-DA). The EBRDA aims to provide an energy efficient multiple-hop routing to the destination on the basis of the quality of the links between the source and destination. In