An improved volleyball premier league algorithm based on sine cosine algorithm for global optimization problem

Volleyball premier league (VPL) simulating some phenomena of volleyball game has been presented recently. This powerful algorithm uses such racing and interplays between teams within a season. Furthermore, the algorithm imitates the coaching procedure within a game. Therefore, some volleyball metaphors, including substitution, coaching, and learning, are used to find a better solution prepared by the VPL algorithm. However, the learning phase has the largest effect on the performance of the VPL algorithm, in which this phase can lead to making the VPL stuck in optimal local solution. Therefore, this paper proposed a modified VPL using sine cosine algorithm (SCA). In which the SCA operators have been applied in the learning phase to obtain a more accurate solution. So, we have used SCA operators in VPL to grasp their advantages resulting in a more efficient approach for finding the optimal solution of the optimization problem and avoid the limitations of the traditional VPL algorithm. The propounded VPLSCA algorithm is tested on the 25 functions. The results captured by the VPLSCA have been compared with other metaheuristic algorithms such as cuckoo search, social-spider optimization algorithm, ant lion optimizer, grey wolf optimizer, salp swarm algorithm, whale optimization algorithm, moth flame optimization, artificial bee colony, SCA, and VPL. Furthermore, the three typical optimization problems in the field of designing engineering have been solved using the VPLSCA. According to the obtained results, the proposed algorithm shows very reasonable and promising results compared to others.

     

Photostable liquid‐crystal guest‐host nano‐materials for display applications

Abstract— We theoretically modeled the optical plasmon absorption of anisotropic metallic nanoparticles in a liquid‐crystal host medium. Metallic nanorods and spheroids act as pleochroic dopants with virtually unlimited photostability. Calculations predict that full‐color displays based on nanorod orientation driven by the transition from homogeneous to homeotropic LC alignment are feasible. These displays are expected to have large viewing angles without the need for polarizers or LC anchoring surfaces.     

Microstructure and mechanical properties of modified and non-modified stir-cast Al-Si hypoeutectic alloys

The microstructure and mechanical properties of modified and non-modified stir-cast commercial aluminium alloys A-S7G03 and A-S4G have been investigated. Stir casting of these alloys resulted in spherical and/or rosette shape primary -phase, and the eutectic silicon was broken into miniature needle morphology. This stir-cast structure slightly improved the mechanical properties in comparison to those of conventionally cast alloys, however the fracture of the stir-cast alloys revealed intergranular brittle fracture. The addition of 0.02% strontium, in the form of Al-5 mass% Sr master alloy, during stir casting modified the eutectic silicon into a very fine spheroidal morphology, while the -phase particle showed the same morphology as the stir-cast alloys. This novel structure resulted in significant improvement of mechanical properties. The elongation of the modified stir-cast alloys was five times greater than that of the non-modified one. A transgranular mode of fracture was observed for the modified stircast alloys, moreover smooth ripple and dimple patterns were observed reflecting the high ductility of the modified stir-cast alloys.     

Deep Semantic Structure of Natural Language

This paper presents the result of research of deep structure of natural language. The main result attained is the existence of a deterministic mathematical model that relates phonetics to associated mental images starting from the simplest linguistic units in agreement with the human response to different acoustic stimuli. Moreover, there exists two level hierarchy for natural language understanding. The first level uncovers the conceptual meaning of linguistic units, and hence forming a corresponding mental image. At the second level the operational meaning is found to suit, context, pragmatics, and world knowledge. This agrees with our knowledge about human cognition. The resulting model is parallel, hierarchical but still concise to explain the speed of natural language understanding.     

Modeling and Retrieval of Moving Objects

This paper presents a symbolic formalism for modeling and retrieving video data via the moving objects contained in the video images. The model integrates the representations of individual moving objects in a scene with the time-varying relationships between them by incorporating both the notions of object tracks and temporal sequences of PIRs (projection interval relationships). The model is supported by a set of operations which form the basis of a moving object algebra. This algebra allows one to retrieve scenes and information from scenes by specifying both spatial and temporal properties of the objects involved. It also provides operations to create new scenes from existing ones. A prototype implementation is described which allows queries to be specified either via an animation sketch or using the moving object algebra.     

A bigraphical model for specifying cloud-based elastic systems and their behaviour

The few recent years have witnessed the appearance of a new kind of self-adaptive systems called cloud based-elastic systems. These systems are particularly appealing for their ability to maintain a decent quality of service and reduce a system’s operating cost at the same time. They achieve this by dynamically adjusting resources allocation in terms of elasticity. Meanwhile, complexity of structural and behavioural aspects related to cloud-based elastic systems increase the difficulty of designing and developing such systems. In this paper, we address this challenge by proposing a formal approach based on bigraphical reactive systems for modelling both structural and behavioural aspects of cloud-based elastic systems. In particular, we represent their behaviour in terms of client/application interactions and elasticity methods at different levels using bigraphical reaction rules. The feasibility of the proposed approach is illustrated through a motivating example running on the top of an Amazon Elastic Compute Cloud (EC2) infrastructure.     

Using Semantics for Policy-Based Web Service Composition

Proliferation of Web technologies and the ubiquitous Internet has resulted in a tremendous increase in the need to deliver one-stop Web services, which are often composed of multiple component services that cross organizational boundaries. It is essential that these Web services, referred to in this paper as service flows, be carefully composed in a dynamic and customized manner to suit to the changing needs of the customers. This composition should be conducted in such a manner that (i) the composed service flow adheres to the policies imposed by the organizations offering the component services, (ii) the selected component services are compatible with one another so that the entire composition would result in a successful service flow, and (iii) the selected component services most closely meet the customer requirements. In this paper, we propose a policy-based Web service composition that utilizes the semantics associated with the component services.We consider policies imposed by different entities while composing service flows, which include service policies (imposed by the organizations offering component services), service flow policies (associated with the entire service flow), and user policies (the user requirements expressed as policies). In addition to these policies, one may consider rules at the syntactic and semantic levels that can be used to select relevant component services in order to compose customized service flows, by considering the notions of syntactic, semantic and policy compatibility. We model the different policies and the service topic ontology using OWL, DAML-S, RuleML and RDF standards.Recommended by: Athman Bouguettaya and Boualem BenatallahThe work is supported by and a grant from the Meadowlands Environmental Research Institute, New Jersey Meadowlands Commission.     

QoS aggregation for service orchestrations based on workflow pattern rules and MCDM method: evaluation at design time and runtime

Service consumers satisfaction is considered today as one of the main concern to be ensured by service providers, especially with the spread of concurrency and the increase of functionally equivalent services. This satisfaction is closely related to quality of service (QoS) perceived by service consumers. In this context, we propose an approach to determine the satisfaction degree corresponding to the QoS of service-based applications, with regard to service consumers’ QoS expectations. Our approach is based on a preference model, which is built only on the basis of service consumer’s provided information. This preference model is also based on the 2-additive Choquet operator that takes into account preferential dependencies. In this paper, we target both design time and runtime aggregation of QoS of service-based applications.     

Applying robotic frameworks in a simulated multi-agent contest

In the Multi-Agent Programming Contest 2017 the TUBDAI team of the Technische Universität Berlin is using the complex multi-agent scenario to evaluate the application of two frameworks from the field (multi-)robot systems. In particular the task-level decision-making and planning framework ROS Hybrid Behaviour Planner (RHBP) is used to implement the execution and decision-making for single agents. The RHBP framework builds on top of the framework Robot Operating System (ROS) that is used to implement the communication and scenario specific coordination strategy of the agents. The united team for the official contest is formed by volunteering students from a project course and their supervisors.     

A Conjecture on Wiener Indices in Combinatorial Chemistry

Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by edges between the corresponding vertices. This polygonal shape derived from a chemical compound is often called its molecular graph, and can be a path, a tree, or in general a graph. An indicator defined over this molecular graph, the Wiener index, has been shown to be strongly correlated to various chemical properties of the compound. The Wiener index conjecture for trees states that for any integer n (except for a finite set), one can find a tree with Wiener index n. This conjecture has been open for quite some time, and many authors have presented incremental progress on this problem. In this paper we present further progress towards proving this conjecture—through the design of efficient algorithms, we show that enumerating all possible trees to verify this conjecture (as done by all the previous approaches) is not necessary, but instead searching in a small special family of trees suffices, thus achieving the first polynomial (in n) time algorithm to verify the conjecture up to integer n. More precisely, we (i) present an infinite family of trees and prove various properties of these trees, (ii) show that a large number of integers, up to at least 10⁸ (compared with the previous best 10⁴) are representable as Wiener indices of trees in this succinct family, (iii) provide several efficient algorithms for computing trees with given Wiener indices, and (iv) implement our algorithms and experimentally show that their performance is asymptotically much better than their theoretical worst-case upper bound.