Hardy Inequality in Variable Exponent Lebesgue Spaces

Mathematics Subject Classification: 26D10, 46E30, 47B38

On a Class of Fractional Type Integral Equations in Variable Exponent Spaces

2000 Mathematics Subject Classification: 45A05, 45B05, 45E05,45P05, 46E30

Method for Analytical Representation of the Maximum Inaccuracies of Indirectly Measurable Variable

Let us have an indirectly measurable variable which is a function of directly measurable variables. In this survey we present the introduced by us method for analytical representation of its maximum absolute and relative inaccuracy as functions, respectively, of the maximum absolute and of the relative inaccuracies of the directly measurable variables. Our new approach consists of assuming for fixed variables the statistical mean values of the absolute values of the coefficients of influence, respectively, of the absolute and relative inaccuracies of the directly measurable variables in order to determine the analytical form of the maximum absolute and relative inaccuracies of an indirectly measurable variable. Moreover, we give a method for determining the numerical values of the maximum absolute and relative inaccuracies. We define a sample plane of the ideal perfectly accurate experiment and using it we give a universal numerical characteristic – a dimensionless scale for determining the quality (accuracy) of the experiment.

Solving the Task Assignment Problem with a Variable Neighborhood Search

In this paper a variable neighborhood search (VNS) approach for the task assignment problem (TAP) is considered. An appropriate neighborhood scheme along with a shaking operator and local search procedure are constructed specifically for this problem. The computational results are presented for the instances from the literature, and compared to optimal solutions obtained by the CPLEX solver and heuristic solutions generated by the genetic algorithm. It can be seen that the proposed VNS approach reaches all optimal solutions in a quite short amount of computational time.

Hamilton’s Principle with Variable Order Fractional Derivatives

MSC 2010: 26A33, 70H25, 46F12, 34K37 Dedicated to 80-th birthday of Prof. Rudolf Gorenflo

Analysis of extended range variable gain hybrid Raman-EDFAs in systems using Nyquist-WDM 100/200G PM-QPSK/16QAM

We use the GN-model to assess Nyquist-WDM 100/200Gbit/s PM-QPSK/16QAM signal reach on low loss, large core area fibre using extended range, variable gain hybrid Raman-EDFAs. 5000/1500km transmission is possible over a wide range of amplifier spans. © OSA 2014.

Variable Neighborhood Search for the File Transfer Scheduling Problem

ACM Computing Classification System (1998): I.2.8, G.1.6.

A Variable Neighborhood Search Approach for Solving the Maximum Set Splitting Problem

This paper presents a Variable neighbourhood search (VNS) approach for solving the Maximum Set Splitting Problem (MSSP). The algorithm forms a system of neighborhoods based on changing the component for an increasing number of elements. An efficient local search procedure swaps the components of pairs of elements and yields a relatively short running time. Numerical experiments are performed on the instances known in the literature: minimum hitting set and Steiner triple systems. Computational results show that the proposed VNS achieves all optimal or best known solutions in short times. The experiments indicate that the VNS compares favorably with other methods previously used for solving the MSSP. ACM Computing Classification System (1998): I.2.8.

Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem

In this paper a Variable Neighborhood Search (VNS) algorithm for solving the Capacitated Single Allocation Hub Location Problem (CSAHLP) is presented. CSAHLP consists of two subproblems; the first is choosing a set of hubs from all nodes in a network, while the other comprises finding the optimal allocation of non-hubs to hubs when a set of hubs is already known. The VNS algorithm was used for the first subproblem, while the CPLEX solver was used for the second. Computational results demonstrate that the proposed algorithm has reached optimal solutions on all 20 test instances for which optimal solutions are known, and this in short computational time.

Raman laser based on a fiber with variable mode structure

A Raman converter based on an active fiber with variable mode structure is experimentally and theoretically studied. It is demonstrated that a conventional telecommunication fiber with variable mode structure can be used to construct Raman converters © Pleiades Publishing, Ltd., 2011.

Self-adapting parallel metric-space search engine for variable query loads

This research focuses on automatically adapting a search engine size in response to fluctuations in query workload. Deploying a search engine in an Infrastructure as a Service (IaaS) cloud facilitates allocating or deallocating computer resources to or from the engine. Our solution is to contribute an adaptive search engine that will repeatedly re-evaluate its load and, when appropriate, switch over to a dierent number of active processors. We focus on three aspects and break them out into three sub-problems as follows: Continually determining the Number of Processors (CNP), New Grouping Problem (NGP) and Regrouping Order Problem (ROP). CNP means that (in the light of the changes in the query workload in the search engine) there is a problem of determining the ideal number of processors p active at any given time to use in the search engine and we call this problem CNP. NGP happens when changes in the number of processors are determined and it must also be determined which groups of search data will be distributed across the processors. ROP is how to redistribute this data onto processors while keeping the engine responsive and while also minimising the switchover time and the incurred network load. We propose solutions for these sub-problems. For NGP we propose an algorithm for incrementally adjusting the index to t the varying number of virtual machines. For ROP we present an ecient method for redistributing data among processors while keeping the search engine responsive. Regarding the solution for CNP, we propose an algorithm determining the new size of the search engine by re-evaluating its load. We tested the solution performance using a custom-build prototype search engine deployed in the Amazon EC2 cloud. Our experiments show that when we compare our NGP solution with computing the index from scratch, the incremental algorithm speeds up the index computation 2{10 times while maintaining a similar search performance. The chosen redistribution method is 25% to 50% faster than other methods and reduces the network load around by 30%. For CNP we present a deterministic algorithm that shows a good ability to determine a new size of search engine. When combined, these algorithms give an adapting algorithm that is able to adjust the search engine size with a variable workload.

Semi-supervised Gaussian process latent variable model with pairwise constraints

In machine learning, Gaussian process latent variable model (GP-LVM) has been extensively applied in the field of unsupervised dimensionality reduction. When some supervised information, e.g., pairwise constraints or labels of the data, is available, the traditional GP-LVM cannot directly utilize such supervised information to improve the performance of dimensionality reduction. In this case, it is necessary to modify the traditional GP-LVM to make it capable of handing the supervised or semi-supervised learning tasks. For this purpose, we propose a new semi-supervised GP-LVM framework under the pairwise constraints. Through transferring the pairwise constraints in the observed space to the latent space, the constrained priori information on the latent variables can be obtained. Under this constrained priori, the latent variables are optimized by the maximum a posteriori (MAP) algorithm. The effectiveness of the proposed algorithm is demonstrated with experiments on a variety of data sets. © 2010 Elsevier B.V.

Quantifying the effects of temperature and concentration on variable-density flow in numerical modeling of groundwater systems: Implications for predictive uncertainty and data collection

Groundwater systems of different densities are often mathematically modeled to understand and predict environmental behavior such as seawater intrusion or submarine groundwater discharge. Additional data collection may be justified if it will cost-effectively aid in reducing the uncertainty of a model's prediction. The collection of salinity, as well as, temperature data could aid in reducing predictive uncertainty in a variable-density model. However, before numerical models can be created, rigorous testing of the modeling code needs to be completed. This research documents the benchmark testing of a new modeling code, SEAWAT Version 4. The benchmark problems include various combinations of density-dependent flow resulting from variations in concentration and temperature. The verified code, SEAWAT, was then applied to two different hydrological analyses to explore the capacity of a variable-density model to guide data collection. ^ The first analysis tested a linear method to guide data collection by quantifying the contribution of different data types and locations toward reducing predictive uncertainty in a nonlinear variable-density flow and transport model. The relative contributions of temperature and concentration measurements, at different locations within a simulated carbonate platform, for predicting movement of the saltwater interface were assessed. Results from the method showed that concentration data had greater worth than temperature data in reducing predictive uncertainty in this case. Results also indicated that a linear method could be used to quantify data worth in a nonlinear model. ^ The second hydrological analysis utilized a model to identify the transient response of the salinity, temperature, age, and amount of submarine groundwater discharge to changes in tidal ocean stage, seasonal temperature variations, and different types of geology. The model was compared to multiple kinds of data to (1) calibrate and verify the model, and (2) explore the potential for the model to be used to guide the collection of data using techniques such as electromagnetic resistivity, thermal imagery, and seepage meters. Results indicated that the model can be used to give insight to submarine groundwater discharge and be used to guide data collection. ^

Variable responses within epiphytic and benthic microalgal communities to nutrient enrichment

We examined the spatial extent of nitrogen (N) and phosphorus (P) limitation of each of the major benthic primary producer groups in Florida Bay (seagrass, epiphytes, macroalgae, and benthic microalgae) and characterized the shifts in primary producer community composition following nutrient enrichment. We established 24 permanent 0.25-m2 study plots at each of six sites across Florida Bay and added N and P to the sediments in a factorial design for 18 mo. Tissue nutrient content of the turtlegrass Thalassia testudinum revealed a spatial pattern in P limitation, from severe limitation in the eastern bay (N:P > 96:1), moderate limitation in two intermediate sites (approximately 63:1), and balanced with N availability in the western bay (approximately 31:1). P addition increased T. testudinum cover by 50-75% and short-shoot productivity by up to 100%, but only at the severely P-limited sites. At sites with an ambient N:P ratio suggesting moderate P limitation, few seagrass responses to nutrients occurred. Where ambient T. testudinum tissue N:P ratios indicated N and P availability was balanced, seagrass was not affected by nutrient addition but was strongly influenced by disturbance (currents, erosion). Macroalgal and epiphytic and benthic microalgal biomass were variable between sites and treatments. In general, there was no algal overgrowth of the seagrass in enriched conditions, possibly due to the strength of seasonal influences on algal biomass or regulation by grazers. N addition had little effect on any benthic primary producers throughout the bay. The Florida Bay benthic primary producer community was P limited, but P-induced alterations of community structure were not uniform among primary producers or across Florida Bay and did not always agree with expected patterns of nutrient limitation based on stoichiometric predictions from field assays of T. testudinum tissue N:P ratios.

Organizational Behavior: Forgotten Variable in Safe Food

The war on foodborne illness in hotels and restaurants is based on microbiology and critical control points. The author argues that cooks, managers, instructors, researchers, and regulators need to start looking beyond this narrow base to include more organizational behavior processes in their arsenal.