Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Optimization

Discipline
Institution
Publication Year
Publication
Publication Type
File Type

Articles 511 - 540 of 662

Full-Text Articles in Physical Sciences and Mathematics

Data Hiding In Digital Images Using A Partial Optimization Technique Based On The Classical Lsb Method, Feyzi̇ Akar, Yildiray Yalman, Hüseyi̇n Selçuk Varol Jan 2013

Data Hiding In Digital Images Using A Partial Optimization Technique Based On The Classical Lsb Method, Feyzi̇ Akar, Yildiray Yalman, Hüseyi̇n Selçuk Varol

Turkish Journal of Electrical Engineering and Computer Sciences

This paper presents a new partial optimization approach for the least significant bit (LSB) data hiding technique that can be used for protecting any secret information or data. A deterioration effect of as little as possible in an image is intended using the LSB data hiding technique and this is well realized utilizing the proposed partial optimization approach achieving the same data embedding bit rates. In the proposed approach, all of the image pixels are classified into 8 regions and then the 8 distinct ordering codings are applied to each region by the developed partial optimization encoder. Thus, the most …


Optimized Operation And Maintenance Costs To Improve System Reliability By Decreasing The Failure Rate Of Distribution Lines, Hamed Hashemi Dezaki, Seyed Hossein Hosseinian, Hossein Askarian Abyaneh, Seyed Mohammad Mousavi Agah Jan 2013

Optimized Operation And Maintenance Costs To Improve System Reliability By Decreasing The Failure Rate Of Distribution Lines, Hamed Hashemi Dezaki, Seyed Hossein Hosseinian, Hossein Askarian Abyaneh, Seyed Mohammad Mousavi Agah

Turkish Journal of Electrical Engineering and Computer Sciences

Improving distribution system reliability has received a great deal of attention in recent years. Because of the limitation in expected budgets, it is desirable to determine the most efficient strategy to improve system reliability. This paper proposes a novel method to determine the optimized operation and maintenance costs in order to decrease the failure of system components. The proposed objective function includes the average system frequency interruption index (ASIFI) value. To achieve the best strategy to decrease failures of system components, it is necessary to find the minimum value of the objective function, considering the constraints of operation and maintenance …


Optimal Placement And Sizing Of Distributed Generations In Distribution Systems For Minimizing Losses And Thd_V Using Evolutionary Programming, Aida Fazliana Abdul Kadir, Azah Mohamed, Hussain Shareef, Mohd Zamri Che Wanik Jan 2013

Optimal Placement And Sizing Of Distributed Generations In Distribution Systems For Minimizing Losses And Thd_V Using Evolutionary Programming, Aida Fazliana Abdul Kadir, Azah Mohamed, Hussain Shareef, Mohd Zamri Che Wanik

Turkish Journal of Electrical Engineering and Computer Sciences

Growing concerns over environmental impacts, improvement of the overall network conditions, and rebate programs offered by governments have led to an increase in the number of distributed generation (DG) units in commercial and domestic electric power production. However, a large number of DG units in a distribution system may sometimes contribute to high levels of harmonic distortion, even though the emission levels of the individual DG units comply with the harmonic standards. It is known that the nonoptimal size and nonoptimal placement of DG units may lead to high power losses, bad voltage profiles, and harmonic propagations. Therefore, this paper …


An Adaptive Total Variation Algorithm For Computing The Balanced Cut Of A Graph, Xavier Bresson, Thomas Laurent, David Uminsky, James H. Von Brecht Jan 2013

An Adaptive Total Variation Algorithm For Computing The Balanced Cut Of A Graph, Xavier Bresson, Thomas Laurent, David Uminsky, James H. Von Brecht

Mathematics, Statistics and Data Science Faculty Works

We propose an adaptive version of the total variation algorithm proposed in [3] for computing the balanced cut of a graph. The algorithm from [3] used a sequence of inner total variation minimizations to guarantee descent of the balanced cut energy as well as convergence of the algorithm. In practice the total variation minimization step is never solved exactly. Instead, an accuracy parameter is specified and the total variation minimization terminates once this level of accuracy is reached. The choice of this parameter can vastly impact both the computational time of the overall algorithm as well as the accuracy of …


Making Solution Pluralism In Policy Making Accessible: Optimization Of Design And Services For Constituent Well-Being, Margeret A. Hall, Steven O. Kimbrough, Wibke Michalk, Jefff Schneider, Christof Weinhardt Jan 2013

Making Solution Pluralism In Policy Making Accessible: Optimization Of Design And Services For Constituent Well-Being, Margeret A. Hall, Steven O. Kimbrough, Wibke Michalk, Jefff Schneider, Christof Weinhardt

Interdisciplinary Informatics Faculty Proceedings & Presentations

Policy makers are increasingly turning to computational support mechanisms for managing uncertainty, and constituent focused-decisions. Utilization and standardization of human-computer interaction principles to create solution pluralism (the condition of having a consideration set containing a multiplicity of credible solutions) is a fundamental to fulfilling this need. There is a need for standardized applications and user interfaces to deliver a higher quality of service, which assists policy makers in maintaining or increasing constituent well-being.


Value Centric Approaches To The Design, Operations And Maintenance Of Wind Turbines, Madhur Aravind Khadabadi Jan 2013

Value Centric Approaches To The Design, Operations And Maintenance Of Wind Turbines, Madhur Aravind Khadabadi

Open Access Theses

Wind turbine maintenance is emerging as an unexpectedly high component of turbine operating cost, and there is an increasing interest in managing this cost. This thesis presents an alternative view of maintenance as a value-driver, and develops an optimization algorithm to evaluate the value delivered by different maintenance techniques. I view maintenance as an operation that moves the turbine to an improved state in which it can generate more power and, thus, earn more revenue. To implement this approach, I model the stochastic deterioration of the turbine in two dimensions: the deterioration rate, and the extent of deterioration, and then …


Innovative Applications Of Genetic Algorithms To Problems In Accelerator Physics, Alicia Hofler, Balša Terzić, Matthew Kramer, Anton Zvezdin, Vasiliy Morozov, Yves Roblin, Fanglei Lin, Colin Jarvis Jan 2013

Innovative Applications Of Genetic Algorithms To Problems In Accelerator Physics, Alicia Hofler, Balša Terzić, Matthew Kramer, Anton Zvezdin, Vasiliy Morozov, Yves Roblin, Fanglei Lin, Colin Jarvis

Physics Faculty Publications

The genetic algorithm (GA) is a powerful technique that implements the principles nature uses in biological evolution to optimize a multidimensional nonlinear problem. The GA works especially well for problems with a large number of local extrema, where traditional methods (such as conjugate gradient, steepest descent, and others) fail or, at best, underperform. The field of accelerator physics, among others, abounds with problems which lend themselves to optimization via GAs. In this paper, we report on the successful application of GAs in several problems related to the existing Continuous Electron Beam Accelerator Facility nuclear physics machine, the proposed Medium-energy Electron-Ion …


Optimization In Non-Parametric Survival Analysis And Climate Change Modeling, Iuliana Teodorescu Jan 2013

Optimization In Non-Parametric Survival Analysis And Climate Change Modeling, Iuliana Teodorescu

USF Tampa Graduate Theses and Dissertations

Many of the open problems of current interest in probability and statistics involve complicated data

sets that do not satisfy the strong assumptions of being independent and identically distributed. Often,

the samples are known only empirically, and making assumptions about underlying parametric

distributions is not warranted by the insufficient information available. Under such circumstances,

the usual Fisher or parametric Bayes approaches cannot be used to model the data or make predictions.

However, this situation is quite often encountered in some of the main challenges facing statistical,

data-driven studies of climate change, clinical studies, or financial markets, to name a few. …


Control Of Smart Building Using Advanced Scada, Vivin Thomas Samuel Jan 2013

Control Of Smart Building Using Advanced Scada, Vivin Thomas Samuel

USF Tampa Graduate Theses and Dissertations

ABSTRACT

For complete control of the building, a proper SCADA implementation and the optimization strategy has to be build. For better communication and efficiency a proper channel between the Communication protocol and SCADA has to be designed.

This paper concentrate mainly between the communication protocol, and the SCADA implementation, for a better optimization and energy savings is derived to large scale industrial buildings. The communication channel used in order to completely control the building remotely from a distant place. For an efficient result we consider the temperature values and the power ratings of the equipment so that while controlling the …


Integer Solutions To Optimization Problems And Modular Sequences Of Nexus Numbers, Jeremy T. Davis Oct 2012

Integer Solutions To Optimization Problems And Modular Sequences Of Nexus Numbers, Jeremy T. Davis

College of Graduate Studies: Theses & Dissertations

In this thesis, we examine the use of integers through two ideas. As mathematics teachers, we prefer students not use calculators on assessments. In order to require this, students compute the problems by hand. We take a look at the classic Calculus I optimization box problem while restricting values to integers. In addition, sticking with the integer theme, we take a new look at the nexus numbers. Nexus numbers are extensions of the hex and rhombic dodecahedral numbers. We put these numbers into a sequence, and through a few computations of modular arithmetic, we analyze the sequences and their patterns …


An Integrated Screening And Optimization Strategy, Nathaniel Jackson Rohbock Jul 2012

An Integrated Screening And Optimization Strategy, Nathaniel Jackson Rohbock

Theses and Dissertations

Within statistical methods, design of experiments (DOE) is well suited to make good inference from a minimal amount of data. Two types of designs within DOE are screening designs and optimization designs. Traditionally, these approaches have been necessarily separated by a gap between the objectives of each design and the methods available. Despite being so separated, in practice these designs are frequently connected by sequential experimentation. In fact, from the genesis of a project, the experimentor often knows that both designs will be necessary to accomplish his objectives. Due to advances in the understanding of experimental designs with complex aliasing …


Development Of A New Protecting Group For N-Acetylneuraminic Acid In Glycopeptide Synthesis, Luis A. Barrera, Katja Michael Jul 2012

Development Of A New Protecting Group For N-Acetylneuraminic Acid In Glycopeptide Synthesis, Luis A. Barrera, Katja Michael

COURI Symposium Abstracts, Summer 2012

N-acetylneuraminc acid (Neu5Ac) is contained in a tumor-associated antigen called STn, which is expressed in form of glycoproteins on the cell surface of many carcinomas. Synthesized partial sequences (glycopeptides) of these cell surface glycoproteins could potentially be used as anticancer vaccines, or for the production of antibodies which could be useful for immunotherapy. STn-containing glycopeptides are sensitive to acid and base catalyzed decomposition, which makes their chemical synthesis quite challenging. If this research is successful, we may be able to contribute to the advancement of cancer research by making sensitive STn-containing glycopeptides more accessible through chemical synthesis.

My current project …


Generating Minimal T-Wise Test Suites, Luis C. Gutierrez, Carlos Nieto, Francisco Zapata, Martine Ceberio Jul 2012

Generating Minimal T-Wise Test Suites, Luis C. Gutierrez, Carlos Nieto, Francisco Zapata, Martine Ceberio

COURI Symposium Abstracts, Summer 2012

As the use of computing devices increases every day, users rely on the adequate functioning of software. When software is not tested properly, it can yield erroneous information or a complete failure of the system. The NIST estimates that defective software cost the United States economy close to $60 billion a year. Therefore, there is a need to develop software testing techniques that are time and cost effective. Fully testing software under all possible combinations of parameters values cannot be reduced. However, testing can focus on covering all combinations of subsets of parameters and empirical data shows that doing so …


How To Divide Students Into Groups So As To Optimize Learning: Towards A Solution To A Pedagogy-Related Optimization Problem, Olga Kosheleva, Vladik Kreinovich Jul 2012

How To Divide Students Into Groups So As To Optimize Learning: Towards A Solution To A Pedagogy-Related Optimization Problem, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

To enhance learning, it is desirable to also let students learn from each other, e.g., by working in groups. It is known that such groupwork can improve learning, but the effect strongly depends on how we divide students into groups. In this paper, based on a first approximation model of student interaction, we describe how to optimally divide students into groups so as to optimize the resulting learning. We hope that, by taking into account other aspects of student interaction, it will be possible to transform our solution into truly optimal practical recommendations.


Logistics Orchestration Modeling And Evaluation For Humanitarian Relief, Hoong Chuin Lau, Zhengping Li, Xin Du, Heng Jiang, Robert De Souza Jul 2012

Logistics Orchestration Modeling And Evaluation For Humanitarian Relief, Hoong Chuin Lau, Zhengping Li, Xin Du, Heng Jiang, Robert De Souza

Research Collection School Of Computing and Information Systems

This paper proposes an orchestration model for post-disaster response that is aimed at automating the coordination of scarce resources that minimizes the loss of human lives. In our setting, different teams are treated as agents and their activities are "orchestrated" to optimize rescue performance. Results from simulation are analysed to evaluate the performance of the optimization model.


Probabilistic Qos Analysis In Wireless Sensor Networks, Yunbo Wang May 2012

Probabilistic Qos Analysis In Wireless Sensor Networks, Yunbo Wang

School of Computing: Dissertations, Theses, and Student Research

Emerging applications of wireless sensor networks (WSNs) require real-time quality of service (QoS) guarantees to be provided by the network. Traditional analysis work only focuses on the first-order statistics, such as the mean and the variance of the QoS performance. However, due to unique characteristics of WSNs, a cross-layer probabilistic analysis of QoS performance is essential. In this dissertation, a comprehensive cross-layer probabilistic analysis framework is developed to investigate the probabilistic evaluation and optimization of QoS performance provided by WSNs. In this framework, the distributions of QoS performance metrics are derived, which are natural tools to discover the probabilities to …


Performance Evaluation Of Optimal Rate Allocation Models For Wireless Networks, Ryan Michael Padilla Apr 2012

Performance Evaluation Of Optimal Rate Allocation Models For Wireless Networks, Ryan Michael Padilla

Theses and Dissertations

Convex programming is used in wireless networks to optimize the sending or receiving rates of links or flows in a network. This kind of optimization problem is formulated into a rate allocation problem, where each node in the network will distributively solve the convex problem and all links or flows will converge to their optimal rate. The objective function and constraints of these problems are represented in a simplified model of contention, interference, and sending or receiving rates. The Partial Interference model is an optimal rate allocation model for use in wireless mesh networks that has been shown to be …


Generating Minimal Pair-Wise Covering Test Suites, Luis C. Gutierrez ^, Martine Ceberio * Apr 2012

Generating Minimal Pair-Wise Covering Test Suites, Luis C. Gutierrez ^, Martine Ceberio *

COURI Symposium Abstracts, Spring 2012

Software is ubiquitous and needs to be reliable. Software testing therefore plays an important role in software development. Proper testing a software system informs about its quality and reliability so as to prevent unexpected behavior during system execution. One of the methods to prevent failures consists in testing a system under different input values, but when all possible input values are tested, an impractical number of test cases might result. In software testing, pair-wise testing is a combinatorial technique which uses combination of pair input values to generate test cases. Using pair-wise testing dramatically reduces the number of test cases, …


A Fitness Function Elimination Theory For Blackbox Optimization And Problem Class Learning, Gautham Anil Jan 2012

A Fitness Function Elimination Theory For Blackbox Optimization And Problem Class Learning, Gautham Anil

Electronic Theses and Dissertations

The modern view of optimization is that optimization algorithms are not designed in a vacuum, but can make use of information regarding the broad class of objective functions from which a problem instance is drawn. Using this knowledge, we want to design optimization algorithms that execute quickly (efficiency), solve the objective function with minimal samples (performance), and are applicable over a wide range of problems (abstraction). However, we present a new theory for blackbox optimization from which, we conclude that of these three desired characteristics, only two can be maximized by any algorithm. We put forward an alternate view of …


Optimization Of Pilot Tones Using Differential Evolution Algorithm In Mimo-Ofdm Systems, Muhammet Nuri̇ Seyman, Necmi̇ Taşpinar Jan 2012

Optimization Of Pilot Tones Using Differential Evolution Algorithm In Mimo-Ofdm Systems, Muhammet Nuri̇ Seyman, Necmi̇ Taşpinar

Turkish Journal of Electrical Engineering and Computer Sciences

In this paper, we propose a differential evolution (DE) algorithm for optimizing the placement and power of the pilot tones that are utilized by a least square (LS) algorithm for channel estimation in multiple-input and multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) systems. Computer simulations demonstrated that the performance of the LS algorithm was increased by optimizing the pilot tones with the DE algorithm instead of locating them orthogonally. We used the upper bound of the mean square error (MSE) as a fitness function of the DE algorithm for optimization tasks. With the use of an upper bound, it is not necessary …


Proof-Of-Concept For A Green Energy Linear Program For Optimizing Deployments, James M. Taylor, Betty Love Jan 2012

Proof-Of-Concept For A Green Energy Linear Program For Optimizing Deployments, James M. Taylor, Betty Love

Mathematics Faculty Proceedings & Presentations

The US military has spent billions of dollars and sacrificed many lives in the effort to bring electrical power services and the fuel that drives the generators to forward-deployed bases in Afghanistan and Iraq over the past 10 years. In an effort to reduce some of these tremendous costs, the US military has considered using alternative energy sources to generate electricity and reduce costs and exposure of fuel truck convoys. While some research [10] has used detailed software packages to model the electrical demand and renewable energy production tradeoffs in this environment, the impact of operational constraints is not readily …


Networking And Security Solutions For Vanet Initial Deployment Stage, Baber Aslam Jan 2012

Networking And Security Solutions For Vanet Initial Deployment Stage, Baber Aslam

Electronic Theses and Dissertations

Vehicular ad hoc network (VANET) is a special case of mobile networks, where vehicles equipped with computing/communicating devices (called "smart vehicles") are the mobile wireless nodes. However, the movement pattern of these mobile wireless nodes is no more random, as in case of mobile networks, rather it is restricted to roads and streets. Vehicular networks have hybrid architecture; it is a combination of both infrastructure and infrastructure-less architectures. The direct vehicle to vehicle (V2V) communication is infrastructure-less or ad hoc in nature. Here the vehicles traveling within communication range of each other form an ad hoc network. On the other …


Advances In Quantum Optical Metrology And The Establishment Of An Invisible Quantum Tripwire, Steven Blane Mccracken Jan 2012

Advances In Quantum Optical Metrology And The Establishment Of An Invisible Quantum Tripwire, Steven Blane Mccracken

LSU Doctoral Dissertations

This thesis presents a summary of the foundation and background of the field of quantum optics, and an analysis of some recent discoveries in various fields of which I have aided in furthering investigative research and advancement through publications. Such topics include numerical optimization of generalized quantum states used in phase sensitive quantum metrology, an analysis of object detection through the use of quantum interferometry in the presence of lossy conditions, and the use of the latter technique to propose an invisible quantum tripwire. First is a collaborative effort to numerically optimize quantum optical states for quantum metrological applications. We …


Coevolutionary Algorithms For The Optimization Of Strategies For Red Teaming Applications, Tirtha Ranjeet Jan 2012

Coevolutionary Algorithms For The Optimization Of Strategies For Red Teaming Applications, Tirtha Ranjeet

Theses: Doctorates and Masters

Red teaming (RT) is a process that assists an organization in finding vulnerabilities in a system whereby the organization itself takes on the role of an “attacker” to test the system. It is used in various domains including military operations. Traditionally, it is a manual process with some obvious weaknesses: it is expensive, time-consuming, and limited from the perspective of humans “thinking inside the box”. Automated RT is an approach that has the potential to overcome these weaknesses. In this approach both the red team (enemy forces) and blue team (friendly forces) are modelled as intelligent agents in a multi-agent …


A Multimodal Freight Collaborative Hub Location And Network Design Problem, Jiri Tylich Jan 2012

A Multimodal Freight Collaborative Hub Location And Network Design Problem, Jiri Tylich

Open Access Theses & Dissertations

The study presents an analytical framework to explore the rail-road collaborative paradigm.

New collaborative technologies have been developed in recent years and they offer a potential solutions and opportunities for collaboration among all modes of transportation. The most progressive technologies that could fulfill the gap in rail-road collaborative paradigm are identified and presented in this research.

The research deals with current state and possible development of collaboration of rail and highway modes of transportation, referred to as rail-road collaboration. Multimodal transportation is the shipment of goods in a single transportation unit. The longest part of the route takes place by …


Convergence Of A Steepest Descent Algorithm For Ratio Cut Clustering, Xavier Bresson, Thomas Laurent, David Uminsky, James H. Von Brecht Jan 2012

Convergence Of A Steepest Descent Algorithm For Ratio Cut Clustering, Xavier Bresson, Thomas Laurent, David Uminsky, James H. Von Brecht

Mathematics, Statistics and Data Science Faculty Works

Unsupervised clustering of scattered, noisy and high-dimensional data points is an important and difficult problem. Tight continuous relaxations of balanced cut problems have recently been shown to provide excellent clustering results. In this paper, we present an explicit-implicit gradient flow scheme for the relaxed ratio cut problem, and prove that the algorithm converges to a critical point of the energy. We also show the efficiency of the proposed algorithm on the two moons dataset.


Cross-Layer Throughput Optimization With Power Control In Sensor Networks, Maggie Xiaoyan Cheng, Xuan Gong, Lin Cai, Xiaohua Jia Sep 2011

Cross-Layer Throughput Optimization With Power Control In Sensor Networks, Maggie Xiaoyan Cheng, Xuan Gong, Lin Cai, Xiaohua Jia

Computer Science Faculty Research & Creative Works

In wireless sensor networks, transmission power has a significant impact on network throughput as wireless interference increases with transmission power, and interference negatively impacts the network throughput. in this paper, we try to improve the network throughput through cross-layer optimization. We first present two algorithms to compute the transmission power of each node with the objectives of minimizing the total transmission power and minimizing the total interference, respectively, from which we can obtain a network topology that ensures a connected path from each source to the sink; then, we compute the maximum achievable throughput from the obtained topology by using …


Modeling Wireless Networks For Rate Control, David C. Ripplinger Jul 2011

Modeling Wireless Networks For Rate Control, David C. Ripplinger

Theses and Dissertations

Congestion control algorithms for wireless networks are often designed based on a model of the wireless network and its corresponding network utility maximization (NUM) problem. The NUM problem is important to researchers and industry because the wireless medium is a scarce resource, and currently operating protocols such as 802.11 often result in extremely unfair allocation of data rates. The NUM approach offers a systematic framework to build rate control protocols that guarantee fair, optimal rates. However, classical models used with the NUM approach do not incorporate partial carrier sensing and interference, which can lead to significantly suboptimal performance when actually …


A Study On Facility Planning Using Discrete Event Simulation: Case Study Of A Grain Delivery Terminal, Sarah M. Asio Jul 2011

A Study On Facility Planning Using Discrete Event Simulation: Case Study Of A Grain Delivery Terminal, Sarah M. Asio

Department of Industrial and Management Systems Engineering: Dissertations, Theses, and Student Research

The application of traditional approaches to the design of efficient facilities can be tedious and time consuming when uncertainty and a number of constraints exist. Queuing models and mathematical programming techniques are not able to capture the complex interaction between resources, the environment and space constraints for dynamic stochastic processes. In the following study discrete event simulation is applied to the facility planning process for a grain delivery terminal. The discrete event simulation approach has been applied to studies such as capacity planning and facility layout for a gasoline station and evaluating the resource requirements for a manufacturing facility. To …


Automated, Parallel Optimization Algorithms For Stochastic Functions, Dheeraj Chahal May 2011

Automated, Parallel Optimization Algorithms For Stochastic Functions, Dheeraj Chahal

All Dissertations

The optimization algorithms for stochastic functions are desired specifically for real-world and simulation applications where results are obtained from sampling, and contain experimental error or random noise. We have developed a series of stochastic optimization algorithms based on the well-known classical down hill simplex algorithm. Our parallel implementation of these optimization algorithms, using a framework called MW, is based on a master-worker architecture where each worker runs a massively parallel program. This parallel implementation allows the sampling to proceed independently on many processors as demonstrated by scaling up to more than 100 vertices and 300 cores.
This framework is highly …