The influence of spectral truncation on the shape of short optical pulses

This paper studies the influence of spectral truncation on the shape of short optical pulses. As an application example, the case of third-order (m=3) transform-limited super-Gaussian pulses is considered through both simulations and experiments. This work can be used to optimize pulse shaping procedures in the frequency domain

Applying semantic web services to enterprise web

Enterprise Web provides a convenient, extendable, integrated platform for information sharing and knowledge management. However, it still has many drawbacks due to complexity and increasing information glut, as well as the heterogeneity of the information processed. Research in the field of Semantic Web Services has shown the possibility of adding higher level of semantic functionality onto the top of current Enterprise Web, enhancing usability and usefulness of resource, enabling decision support and automation. This paper aims to explore the use of Semantic Web Services in Enterprise Web and discuss the Semantic Web Services (SWS) approach for designing Enterprise Web applications. A Semantic Web Service oriented model is presented, in which resources and services are described by ontology, and processed through Semantic Web Service, allowing integrated administration, interoperability and automated reasoning

On the Energy and Centrality Dependence of Higher Order Moments of Net-Proton Distributions in Relativistic Heavy Ion Collisions

The higher order moments of the net-baryon distributions in relativistic heavy ion collisions are useful probes for the QCD critical point and fluctuations. Within a simple model we study the colliding energy and centrality dependence of the net-proton distributions in the central rapidity region. The model is based on considering the baryon stopping and pair production effects in the processes. Based on some physical reasoning, the dependence is parameterized. Predictions for the net-proton distributions for Au+Au and Pb+Pb collisions at different centralities at $\sqrt{s_{NN}}$=39 and 2760 GeV, respectively, are presented from the parameterizations for the model parameters. A possible test of our model is proposed from investigating the net proton distributions in the non-central rapidity region for different colliding centralities and energies.Comment: 6 pages in revtex4, 8 eps figures. arXiv admin note: text overlap with arXiv:1107.474

Optical properties of 4 A single-walled carbon nanotubes inside the zeolite channels studied from first principles calculations

The structural, electronic, and optical properties of 4 A single-walled carbon nanotubes (SWNTs) contained inside the zeolite channels have been studied based upon the density-functional theory in the local-density approximation (LDA). Our calculated results indicate that the relaxed geometrical structures for the smallest SWNTs in the zeolite channels are much different from those of the ideal isolated SWNTs, producing a great effect on their physical properties. It is found that all three kinds of 4 A SWNTs can possibly exist inside the Zeolite channels. Especially, as an example, we have also studied the coupling effect between the ALPO_4-5 zeolite and the tube (5,0) inside it, and found that the zeolite has real effects on the electronic structure and optical properties of the inside (5,0) tube.Comment: 9 pages, 6figure

Flower pollination algorithm with pollinator attraction

The Flower Pollination Algorithm (FPA) is a highly efficient optimization algorithm that is inspired by the evolution process of flowering plants. In the present study, a modified version of FPA is proposed accounting for an additional feature of flower pollination in nature that is the so-called pollinator attraction. Pollinator attraction represents the natural tendency of flower species to evolve in order to attract pollinators by using their colour, shape and scent as well as nutritious rewards. To reflect this evolution mechanism, the proposed FPA variant with Pollinator Attraction (FPAPA) provides fitter flowers of the population with higher probabilities of achieving pollen transfer via biotic pollination than other flowers. FPAPA is tested against a set of 28 benchmark mathematical functions, defined in IEEE-CEC’13 for real-parameter single-objective optimization problems, as well as structural optimization problems. Numerical experiments show that the modified FPA represents a statistically significant improvement upon the original FPA and that it can outperform other state-of-the-art optimization algorithms offering better and more robust optimal solutions. Additional research is suggested to combine FPAPA with other modified and hybridized versions of FPA to further increase its performance in challenging optimization problems

Flower pollination algorithm parameters tuning

The flower pollination algorithm (FPA) is a highly efficient metaheuristic optimization algorithm that is inspired by the pollination process of flowering species. FPA is characterised by simplicity in its formulation and high computational performance. Previous studies on FPA assume fixed parameter values based on empirical observations or experimental comparisons of limited scale and scope. In this study, a comprehensive effort is made to identify appropriate values of the FPA parameters that maximize its computational performance. To serve this goal, a simple non-iterative, single-stage sampling tuning method is employed, oriented towards practical applications of FPA. The tuning method is applied to the set of 28 functions specified in IEEE-CEC'13 for real-parameter single-objective optimization problems. It is found that the optimal FPA parameters depend significantly on the objective functions, the problem dimensions and affordable computational cost. Furthermore, it is found that the FPA parameters that minimize mean prediction errors do not always offer the most robust predictions. At the end of this study, recommendations are made for setting the optimal FPA parameters as a function of problem dimensions and affordable computational cost. [Abstract copyright: © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021.