Clustering composite SaaS components in Cloud computing using a Grouping Genetic Algorithm

Recently, Software as a Service (SaaS) in Cloud computing, has become more and more significant among software users and providers. To offer a SaaS with flexible functions at a low cost, SaaS providers have focused on the decomposition of the SaaS functionalities, or known as composite SaaS. This approach has introduced new challenges in SaaS resource management in data centres. One of the challenges is managing the resources allocated to the composite SaaS. Due to the dynamic environment of a Cloud data centre, resources that have been initially allocated to SaaS components may be overloaded or wasted. As such, reconfiguration for the components’ placement is triggered to maintain the performance of the composite SaaS. However, existing approaches often ignore the communication or dependencies between SaaS components in their implementation. In a composite SaaS, it is important to include these elements, as they will directly affect the performance of the SaaS. This paper will propose a Grouping Genetic Algorithm (GGA) for multiple composite SaaS application component clustering in Cloud computing that will address this gap. To the best of our knowledge, this is the first attempt to handle multiple composite SaaS reconfiguration placement in a dynamic Cloud environment. The experimental results demonstrate the feasibility and the scalability of the GGA

Resource allocation and scheduling of multiple composite web services in cloud computing using cooperative coevolution genetic algorithm

In cloud computing, resource allocation and scheduling of multiple composite web services is an important and challenging problem. This is especially so in a hybrid cloud where there may be some low-cost resources available from private clouds and some high-cost resources from public clouds. Meeting this challenge involves two classical computational problems: one is assigning resources to each of the tasks in the composite web services; the other is scheduling the allocated resources when each resource may be used by multiple tasks at different points of time. In addition, Quality-of-Service (QoS) issues, such as execution time and running costs, must be considered in the resource allocation and scheduling problem. Here we present a Cooperative Coevolutionary Genetic Algorithm (CCGA) to solve the deadline-constrained resource allocation and scheduling problem for multiple composite web services. Experimental results show that our CCGA is both efficient and scalable

Intelligent approaches to VLSI routing

Very Large Scale Integrated-circuit (VLSI) routing involves many large-size and complex problems and most of them have been shown to be NP-hard or NP-complete. As a result, conventional approaches, which have been successfully used to handle relatively small-size routing problems, are not suitable to be used in tackling large-size routing problems because they lead to \u27combinatorial explosion\u27 in search space. Hence, there is a need for exploring more efficient routing approaches to be incorporated into today\u27s VLSI routing system. This thesis strives to use intelligent approaches, including symbolic intelligence and computational intelligence, to solve three VLSI routing problems: Three-Dimensional (3-D) Shortest Path Connection, Switchbox Routing and Constrained Via Minimization. The 3-D shortest path connection is a fundamental problem in VLSI routing. It aims to connect two terminals of a net that are distributed in a 3-D routing space subject to technological constraints and performance requirements. Aiming at increasing computation speed and decreasing storage space requirements, we present a new A* algorithm for the 3-D shortest path connection problem in this thesis. This new A*algorithm uses an economical representation and adopts a novel back- trace technique. It is shown that this algorithm can guarantee to find a path if one exists and the path found is the shortest one. In addition, its computation speed is fast, especially when routed nets are spare. The computational complexities of this A* algorithm at the best case and the worst case are O(Ɩ) and 0(Ɩ3), respectively, where Ɩ is the shortest path length between the two terminals. Most importantly, this A\u27 algorithm is superior to other shortest path connection algorithms as it is economical in terms of storage space requirement, i.e., 1 bit/grid. The switchbox routing problem aims to connect terminals at regular intervals on the four sides of a rectangle routing region. From a computational point of view, the problem is NP-hard. Furthermore, it is extremely complicated and as the consequence no existing algorithm can guarantee to find a solution even if one exists no matter how high the complexity of the algorithm is. Previous approaches to the switch box routing problem can be divided into algorithmic approaches and knowledge-based approaches. The algorithmic approaches are efficient in computational time, but they are unsucessful at achieving high routing completion rate, especially for some dense and complicated switchbox routing problems. On the other hand, the knowledge-based approaches can achieve high routing completion rate, but they are not efficient in computation speed. In this thesis we present a hybrid approach to the switchbox routing problem. This hybrid approach is based on a new knowledge-based routing technique, namely synchronized routing, and combines some efficient algorithmic routing techniques. Experimental results show it can achieve the high routing completion rate of the knowledge-based approaches and the high efficiency of the algorithmic approaches. The constrained via minimization is an important optimization problem in VLSI routing. Its objective is to minimize the number of vias introduced in VLSI routing. From computational perspective, the constrained via minimization is NP-complete. Although for a special case where the number of wire segments splits at a via candidate is not more than three, elegant theoretical results have been obtained. For a general case in which there exist more than three wire segment splits at a via candidate few approaches have been proposed, and those approaches are only suitable for tackling some particular routing styles and are difficult or impossible to adjust to meet practical requirements. In this thesis we propose a new graph-theoretic model, namely switching graph model, for the constrained via minimization problem. The switching graph model can represent both grid-based and grid less routing problems, and allows arbitrary wire segments split at a via candidate. Then on the basis of the model, we present the first genetic algorithm for the constrained via minimization problem. This genetic algorithm can tackle various kinds of routing styles and be configured to meet practical constraints. Experimental results show that the genetic algorithm can find the optimal solutions for most cases in reasonable time

An Efficient Public Key Management System: An Application In Vehicular Ad Hoc Networks

The major purpose of Vehicular Ad Hoc Networks (VANETs) is to provide safety-related message access for motorists to react or make a life-critical decision for road safety enhancement. Accessing safety-related information through the use of VANET communications, therefore, must be protected, as motorists may make critical decisions in response to emergency situations in VANETs. If introducing security services into VANETs causes considerable transmission latency or processing delays, this would defeat the purpose of using VANETs to improve road safety. Current research in secure messaging for VANETs appears to focus on employing certificate-based Public Key Cryptosystem (PKC) to support security. The security overhead of such a scheme, however, creates a transmission delay and introduces a time-consuming verification process to VANET communications. This paper proposes an efficient public key management system for VANETs: the Public Key Registry (PKR) system. Not only does this paper demonstrate that the proposed PKR system can maintain security, but it also asserts that it can improve overall performance and scalability at a lower cost, compared to the certificate-based PKC scheme. It is believed that the proposed PKR system will create a new dimension to the key management and verification services for VANETs

A heuristic algorithm for multi-site computation offloading in mobile cloud computing

Due to limitation of mobile device in terms of battery life and processing power, Mobile Cloud Computing (MCC) has become an attractive choice to leverage this shortcoming as the mobile computation could be offloaded to the cloud, which is so-called \emph{mobile computation offloading}. Existing research on mobile computation offloading considers offloading a mobile computation to a single cloud. However, in the real world a computation service could be provided by multiple clouds and each computation service. Thus, a new and interesting research problem in mobile computation offloading is how to select a computation service for each of the computation tasks of a mobile computation such that the computation time of the mobile computation, the energy consumption of the mobile device and the cost of using the computation services are minimized. This is so called multi-site computation offloading in mobile cloud computing. In this paper we formulate the multi-site computation offloading problem, propose a heuristic algorithm for the multi-site computation offloading problem and evaluate the heuristic algorithm

A novel molecular signature for predicting prognosis and immunotherapy response in osteosarcoma based on tumor-infiltrating cell marker genes

BackgroundTumor infiltrating lymphocytes (TILs), the main component in the tumor microenvironment, play a critical role in the antitumor immune response. Few studies have developed a prognostic model based on TILs in osteosarcoma.MethodsScRNA-seq data was obtained from our previous research and bulk RNA transcriptome data was from TARGET database. WGCNA was used to obtain the immune-related gene modules. Subsequently, we applied LASSO regression analysis and SVM algorithm to construct a prognostic model based on TILs marker genes. What’s more, the prognostic model was verified by external datasets and experiment in vitro. ResultsEleven cell clusters and 2044 TILs marker genes were identified. WGCNA results showed that 545 TILs marker genes were the most strongly related with immune. Subsequently, a risk model including 5 genes was developed. We found that the survival rate was higher in the low-risk group and the risk model could be used as an independent prognostic factor. Meanwhile, high-risk patients had a lower abundance of immune cell infiltration and many immune checkpoint genes were highly expressed in the low-risk group. The prognostic model was also demonstrated to be a good predictive capacity in external datasets. The result of RT-qPCR indicated that these 5 genes have differential expression which accorded with the predicting outcomes.ConclusionsThis study developed a new molecular signature based on TILs marker genes, which is very effective in predicting OS prognosis and immunotherapy response

COMT, 5-HTR2A, and SLC6A4 mRNA Expressions in First-Episode Antipsychotic-Naïve Schizophrenia and Association With Treatment Outcomes

Background: Dopaminergic and serotonergic systems play crucial roles in the pathophysiology of schizophrenia and modulate response to antipsychotic treatment. However, previous studies of dopaminergic and serotonergic genes expression are sparse, and their results have been inconsistent. In this longitudinal study, we aim to investigate the expressions of Catechol-O-methyltransferase (COMT), serotonin 2A receptor (5-HTR2A), and serotonin transporter gene (SLC6A4) mRNA in first-episode antipsychotic-naïve schizophrenia and to test if these mRNA expressions are associated with cognitive deficits and treatment outcomes or not.Method: We measured COMT, 5-HTR2A, and SLC6A4 mRNA expressions in 45 drug-naive first-episode schizophrenia patients and 38 health controls at baseline, and repeated mRNA measurements in all patients at the 8-week follow up. Furthermore, we also assessed antipsychotic response and cognitive improvement after 8 weeks of risperidone monotherapy.Results: Patients were divided into responders (N = 20) and non-responders groups (N = 25) according to the Remission criteria of the Schizophrenia Working Group. Both patient groups have significantly higher COMT mRNA expression and lower SLC6A4 mRNA expression when compared with healthy controls. Interestingly, responder patients have significantly higher levels of COMT and 5-HTR2A mRNA expressions than non-responder patients at baseline. However, antipsychotic treatment has no significant effect on the expressions of COMT, 5-HTR2A, and SLC6A4 mRNA over 8-week follow up.Conclusion: Our findings suggest that dysregulated COMT and SLC6A4 mRNA expressions may implicate in the pathophysiology of schizophrenia, and that COMT and 5-HTR2A mRNA may be potential biomarkers to predict antipsychotic response

Evolutionary placement of continuously operating reference stations of network Real-Time Kinematic

Network RTK (Real-Time Kinematic) is a technology that is based on GPS (Global Positioning System) or more generally on GNSS (Global Navigation Satellite System) observations to achieve centimeter-level accuracy positioning in real time. It is enabled by a network of Continuously Operating Reference Stations (CORS). CORS placement is an important problem in the design of network RTK as it directly affects not only the installation and running costs of the network RTK, but also the Quality of Service (QoS) provided by the network RTK. In our preliminary research on the CORS placement, we proposed a polynomial heuristic algorithm for a so-called location-based CORS placement problem. From a computational point of view, the location-based CORS placement is a largescale combinatorial optimization problem. Thus, although the heuristic algorithm is efficient in computation time it may not be able to find an optimal or near optimal solution. Aiming at improving the quality of solutions, this paper proposes a repairing genetic algorithm (RGA) for the location-based CORS placement problem. The RGA has been implemented and compared to the heuristic algorithm by experiments. Experimental results have shown that the RGA produces better quality of solutions than the heuristic algorithm

Dynamic optimization of migration topology in internet-based distributed genetic algorithms

Distributed Genetic Algorithms (DGAs) designed for the Internet have to take its high communication cost into consideration. For island model GAs, the migration topology has a major impact on DGA performance. This paper describes and evaluates an adaptive migration topology optimizer that keeps the communication load low while maintaining high solution quality. Experiments on benchmark problems show that the optimized topology outperforms static or random topologies of the same degree of connectivity. The applicability of the method on real-world problems is demonstrated on a hard optimization problem in VLSI design