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

Computer Sciences Commons™

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

Optimization

Discipline
Institution
Publication Year
Publication
Publication Type
File Type

Articles 91 - 120 of 352

Full-Text Articles in Computer Sciences

Complete Neighbourhood Search Heuristic Algorithm For Portfolio Optimization, Collether John Feb 2022

Complete Neighbourhood Search Heuristic Algorithm For Portfolio Optimization, Collether John

Tanzania Journal of Engineering and Technology (TJET)

In portfolio optimization, the fundamental goal of an investor is to optimally allocate investments between different assets. Mean-variance optimization methods make unrealistic assumptions to solve the problem of optimal allocation. On the other hand, when realistic constraints like holding size and cardinality are introduced it leads to optimal asset allocation which differ from the mean variance optimization. The resulting optimization problem become quite complex as it exhibits multiple local extrema and discontinuities. Heuristic algorithms work well for the complex problem. Therefore, a heuristic algorithm is developed which is based on hill climbing complete (HC-C). It is utilized to solve the …

Go to article

A Surrogate Assisted Quantum-Behaved Algorithm For Well Placement Optimization, Jahedul Islam, Amril Nazir, Moinul Hossain, Hitmi Khalifa Alhitmi, Muhammad Ashad Kabir, Abdul-Halim Jallad Jan 2022

A Surrogate Assisted Quantum-Behaved Algorithm For Well Placement Optimization, Jahedul Islam, Amril Nazir, Moinul Hossain, Hitmi Khalifa Alhitmi, Muhammad Ashad Kabir, Abdul-Halim Jallad

All Works

The oil and gas industry faces difficulties in optimizing well placement problems. These problems are multimodal, non-convex, and discontinuous in nature. Various traditional and non-traditional optimization algorithms have been developed to resolve these difficulties. Nevertheless, these techniques remain trapped in local optima and provide inconsistent performance for different reservoirs. This study thereby presents a Surrogate Assisted Quantum-behaved Algorithm to obtain a better solution for the well placement optimization problem. The proposed approach utilizes different metaheuristic optimization techniques such as the Quantum-inspired Particle Swarm Optimization and the Quantum-behaved Bat Algorithm in different implementation phases. Two complex reservoirs are used to investigate …

Go to article

Multi-Agent Pathfinding In Mixed Discrete-Continuous Time And Space, Thayne T. Walker Jan 2022

Multi-Agent Pathfinding In Mixed Discrete-Continuous Time And Space, Thayne T. Walker

Electronic Theses and Dissertations

In the multi-agent pathfinding (MAPF) problem, agents must move from their current locations to their individual destinations while avoiding collisions. Ideally, agents move to their destinations as quickly and efficiently as possible. MAPF has many real-world applications such as navigation, warehouse automation, package delivery and games. Coordination of agents is necessary in order to avoid conflicts, however, it can be very computationally expensive to find mutually conflict-free paths for multiple agents – especially as the number of agents is increased. Existing state-ofthe- art algorithms have been focused on simplified problems on grids where agents have no shape or volume, and …

Go to article

Stochastic Models Of Jaya And Semi-Steady-State Jaya Algorithms, Uday Chakraborty Jan 2022

Stochastic Models Of Jaya And Semi-Steady-State Jaya Algorithms, Uday Chakraborty

Computer Science Faculty Works

The Jaya algorithm and its variants have enjoyed great success in diverse application areas, but no theoretical analysis of the algorithm, to our knowledge, is available in the literature. In this paper we build stochastic models for analyzing Jaya and semi-steady-state Jaya algorithms. For these algorithms, the computational cost depends on how, at each iteration, the new individual fares against the existing individual. Costs must be incurred for any replacement of individuals and the subsequent update of the population-worst individual’s (and/or the population-best individual’s) index. We use the following two quantities as the main metrics for analysis: the expected number …

Go to article

Finding Optimal Cayley Map Embeddings Using Genetic Algorithms, Jacob Buckelew Jan 2022

Finding Optimal Cayley Map Embeddings Using Genetic Algorithms, Jacob Buckelew

Honors Program Theses

Genetic algorithms are a commonly used metaheuristic search method aimed at solving complex optimization problems in a variety of fields. These types of algorithms lend themselves to problems that can incorporate stochastic elements, which allows for a wider search across a search space. However, the nature of the genetic algorithm can often cause challenges regarding time-consumption. Although the genetic algorithm may be widely applicable to various domains, it is not guaranteed that the algorithm will outperform other traditional search methods in solving problems specific to particular domains. In this paper, we test the feasibility of genetic algorithms in solving a …

Go to article

Residential Demand Side Management Model, Optimization And Future Perspective: A Review, Subhasis Panda, Sarthak Mohanty, Pravat Kumar Rout, Binod Kumar Sahu, Mohit Bajaj, Dr Hossam Zawbaa, Salah Kamel Jan 2022

Residential Demand Side Management Model, Optimization And Future Perspective: A Review, Subhasis Panda, Sarthak Mohanty, Pravat Kumar Rout, Binod Kumar Sahu, Mohit Bajaj, Dr Hossam Zawbaa, Salah Kamel

Articles

The residential load sector plays a vital role in terms of its impact on overall power balance, stability, and efficient power management. However, the load dynamics of the energy demand of residential users are always nonlinear, uncontrollable, and inelastic concerning power grid regulation and management. The integration of distributed generations (DGs) and advancement of information and communication technology (ICT) even though handles the related issues and challenges up to some extent, till the flexibility, energy management and scheduling with better planning are necessary for the residential sector to achieve better grid stability and efficiency. To address these issues, it is …

Go to article

Distributed Wireless Sensor Node Localization Based On Penguin Searchoptimization, Md Al Shayokh, Soo Young Shin Jan 2022

Distributed Wireless Sensor Node Localization Based On Penguin Searchoptimization, Md Al Shayokh, Soo Young Shin

Turkish Journal of Electrical Engineering and Computer Sciences

Wireless sensor networks (WSNs) have become popular for sensing areas-of-interest and performing assigned tasks based on information on the location of sensor devices. Localization in WSNs is aimed at designating distinct geographical information to the inordinate nodes within a search area. Biologically inspired algorithms are being applied extensively in WSN localization to determine inordinate nodes more precisely while consuming minimal computation time. An optimization algorithm belonging to the metaheuristic class and named penguin search optimization (PeSOA) is presented in this paper. It utilizes the hunting approaches in a collaborative manner to determine the inordinate nodes within an area of interest. …

Go to article

Genetic Algorighm Representation Selection Impact On Binary Classification Problems, Stephen V. Maldonado Jan 2022

Genetic Algorighm Representation Selection Impact On Binary Classification Problems, Stephen V. Maldonado

Honors Undergraduate Theses

In this thesis, we explore the impact of problem representation on the ability for the genetic algorithms (GA) to evolve a binary prediction model to predict whether a physical therapist is paid above or below the median amount from Medicare. We explore three different problem representations, the vector GA (VGA), the binary GA (BGA), and the proportional GA (PGA). We find that all three representations can produce models with high accuracy and low loss that are better than Scikit-Learn’s logistic regression model and that all three representations select the same features; however, the PGA representation tends to create lower weights …

Go to article

Parallel Algorithms For Steiner Forest, Laleh Ghalami Jan 2022

Parallel Algorithms For Steiner Forest, Laleh Ghalami

Wayne State University Dissertations

The Steiner Forest Problem is one of the fundamental combinatorial optimization problemsin operations research and computer science. Its applications range from network design to computational biology. Given an undirected graph with non-negative weights for edges and a set of pairs of vertices called terminals, the Steiner Forest Problem is to find the minimum cost subgraph that connects each of the terminal pairs together. The Steiner Forest Problem is APX-hard and NP-hard to approximate within 96/95. Several heuristic and approximation algorithms, with different approximation guarantees, have been proposed for the Steiner Forest Problem. Despite the several research in designing sequential and …

Go to article

Design, Analysis, And Optimization Of Traffic Engineering For Software Defined Networks, Mohammed Ibrahim Salman Jan 2022

Design, Analysis, And Optimization Of Traffic Engineering For Software Defined Networks, Mohammed Ibrahim Salman

Browse all Theses and Dissertations

Network traffic has been growing exponentially due to the rapid development of applications and communications technologies. Conventional routing protocols, such as Open-Shortest Path First (OSPF), do not provide optimal routing and result in weak network resources. Optimal traffic engineering (TE) is not applicable in practice due to operational constraints such as limited memory on the forwarding devices and routes oscillation. Recently, a new way of centralized management of networks enabled by Software-Defined Networking (SDN) made it easy to apply most traffic engineering ideas in practice. \par Toward creating an applicable traffic engineering system, we created a TE simulator for experimenting …

Go to article

Dynamic Nonlinear Gaussian Model For Inferring A Graph Structure On Time Series, Abhinuv Uppal Jan 2022

Dynamic Nonlinear Gaussian Model For Inferring A Graph Structure On Time Series, Abhinuv Uppal

CMC Senior Theses

In many applications of graph analytics, the optimal graph construction is not always straightforward. I propose a novel algorithm to dynamically infer a graph structure on multiple time series by first imposing a state evolution equation on the graph and deriving the necessary equations to convert it into a maximum likelihood optimization problem. The state evolution equation guarantees that edge weights contain predictive power by construction. After running experiments on simulated data, it appears the required optimization is likely non-convex and does not generally produce results significantly better than randomly tweaking parameters, so it is not feasible to use in …

Go to article

Coupled Dynamics Of Spin Qubits In Optical Dipole Microtraps: Application To The Error Analysis Of A Rydberg-Blockade Gate, L. V. Gerasimov, R. R. Yusupov, A. D. Moiseevsky, I. Vybornyi, K. S. Tikhonov, S. P. Kulik, S. S. Straupe, Charles I. Sukenik, D. V. Kupriyanov Jan 2022

Coupled Dynamics Of Spin Qubits In Optical Dipole Microtraps: Application To The Error Analysis Of A Rydberg-Blockade Gate, L. V. Gerasimov, R. R. Yusupov, A. D. Moiseevsky, I. Vybornyi, K. S. Tikhonov, S. P. Kulik, S. S. Straupe, Charles I. Sukenik, D. V. Kupriyanov

Physics Faculty Publications

Single atoms in dipole microtraps or optical tweezers have recently become a promising platform for quantum computing and simulation. Here we report a detailed theoretical analysis of the physics underlying an implementation of a Rydberg two-qubit gate in such a system—a cornerstone protocol in quantum computing with single atoms. We focus on a blockade-type entangling gate and consider various decoherence processes limiting its performance in a real system. We provide numerical estimates for the limits on fidelity of the maximally entangled states and predict the full process matrix corresponding to the noisy two-qubit gate. We consider different excitation geometries and …

Go to article

Improved Reptile Search Optimization Algorithm Using Chaotic Map And Simulated Annealing For Feature Selection In Medical Filed, Zenab Elgamal, Aznul Qalid Md Sabri, Mohammad Tubishat, Dina Tbaishat, Sharif Naser Makhadmeh, Osama Ahmad Alomari Jan 2022

Improved Reptile Search Optimization Algorithm Using Chaotic Map And Simulated Annealing For Feature Selection In Medical Filed, Zenab Elgamal, Aznul Qalid Md Sabri, Mohammad Tubishat, Dina Tbaishat, Sharif Naser Makhadmeh, Osama Ahmad Alomari

All Works

The increased volume of medical datasets has produced high dimensional features, negatively affecting machine learning (ML) classifiers. In ML, the feature selection process is fundamental for selecting the most relevant features and reducing redundant and irrelevant ones. The optimization algorithms demonstrate its capability to solve feature selection problems. Reptile Search Algorithm (RSA) is a new nature-inspired optimization algorithm that stimulates Crocodiles’ encircling and hunting behavior. The unique search of the RSA algorithm obtains promising results compared to other optimization algorithms. However, when applied to high-dimensional feature selection problems, RSA suffers from population diversity and local optima limitations. An improved metaheuristic …

Go to article

Optimized Cancer Detection On Various Magnified Histopathological Colon Imagesbased On Dwt Features And Fcm Clustering, Tina Babu, Tripty Singh, Deepa Gupta, Shahin Hameed Jan 2022

Optimized Cancer Detection On Various Magnified Histopathological Colon Imagesbased On Dwt Features And Fcm Clustering, Tina Babu, Tripty Singh, Deepa Gupta, Shahin Hameed

Turkish Journal of Electrical Engineering and Computer Sciences

Due to the morphological characteristics and other biological aspects in histopathological images, the computerized diagnosis of colon cancer in histopathology images has gained popularity. The images acquired using the histopathology microscope may differ for greater visibility by magnifications. This causes a change in morphological traits leading to intra and inter-observer variability. An automatic colon cancer diagnosis system for various magnification is therefore crucial. This work proposes a magnification independent segmentation approach based on the connected component area and double density dual tree DWT (discrete wavelet transform) coefficients are derived from the segmented region. The derived features are reduced further shortened …

Go to article

Energy Planning Model Design For Forecasting The Final Energy Consumption Using Artificial Neural Networks, Haidy Eissa Dec 2021

Energy Planning Model Design For Forecasting The Final Energy Consumption Using Artificial Neural Networks, Haidy Eissa

Theses and Dissertations

“Energy Trilemma” has recently received an increasing concern among policy makers. The trilemma conceptual framework is based on three main dimensions: environmental sustainability, energy equity, and energy security. Energy security reflects a nation’s capability to meet current and future energy demand. Rational energy planning is thus a fundamental aspect to articulate energy policies. The energy system is huge and complex, accordingly in order to guarantee the availability of energy supply, it is necessary to implement strategies on the consumption side. Energy modeling is a tool that helps policy makers and researchers understand the fluctuations in the energy system. Over the …

Go to article

Prediction Of Iraqi Stock Exchange Using Optimized Based-Neural Network, Ameer Al-Haq Al-Shamery, Prof. Dr. Eman Salih Al-Shamery Dec 2021

Prediction Of Iraqi Stock Exchange Using Optimized Based-Neural Network, Ameer Al-Haq Al-Shamery, Prof. Dr. Eman Salih Al-Shamery

Karbala International Journal of Modern Science

Stock market prediction is an interesting financial topic that has attracted the attention of researchers for the last years. This paper aims at improving the prediction of the Iraq-Stock-Exchange (ISX) using a developed method of feedforward Neural-Networks based on the Quasi-Newton optimization approach. The proposed method reduces the error factor depending on the Jacobian vector and Lagrange multiplier. This improvement has led to accelerating convergence during the learning process. A sample of companies listed on ISX was selected. This includes twenty-six banks for the years from 2010 to 2020. To evaluate the proposed model, the research findings are compared with …

Go to article

Verification Assisted Gas Reduction For Smart Contracts, Bo Gao, Siyuan Shen, Ling Shi, Jiaying Li, Jun Sun, Lei Bu Dec 2021

Verification Assisted Gas Reduction For Smart Contracts, Bo Gao, Siyuan Shen, Ling Shi, Jiaying Li, Jun Sun, Lei Bu

Research Collection School Of Computing and Information Systems

Smart contracts are computerized transaction protocols built on top of blockchain networks. Users are charged with fees, a.k.a. gas in Ethereum, when they create, deploy or execute smart contracts. Since smart contracts may contain vulnerabilities which may result in huge financial loss, developers and smart contract compilers often insert codes for security checks. The trouble is that those codes consume gas every time they are executed. Many of the inserted codes are however redundant. In this work, we present sOptimize, a tool that optimizes smart contract gas consumption automatically without compromising functionality or security. sOptimize works on smart contract bytecode, …

Go to article

Adadeep: A Usage-Driven, Automated Deep Model Compression Framework For Enabling Ubiquitous Intelligent Mobiles, Sicong Liu, Junzhao Du, Kaiming Nan, Zimu Zhou, Hui Liu, Zhangyang Wang, Yingyan Lin Dec 2021

Adadeep: A Usage-Driven, Automated Deep Model Compression Framework For Enabling Ubiquitous Intelligent Mobiles, Sicong Liu, Junzhao Du, Kaiming Nan, Zimu Zhou, Hui Liu, Zhangyang Wang, Yingyan Lin

Research Collection School Of Computing and Information Systems

Recent breakthroughs in deep neural networks (DNNs) have fueled a tremendously growing demand for bringing DNN-powered intelligence into mobile platforms. While the potential of deploying DNNs on resource-constrained platforms has been demonstrated by DNN compression techniques, the current practice suffers from two limitations: 1) merely stand-alone compression schemes are investigated even though each compression technique only suit for certain types of DNN layers; and 2) mostly compression techniques are optimized for DNNs’ inference accuracy, without explicitly considering other application-driven system performance (e.g., latency and energy cost) and the varying resource availability across platforms (e.g., storage and processing capability). To this …

Go to article

Expediting The Accuracy-Improving Process Of Svms For Class Imbalance Learning, Bin Cao, Yuqi Liu, Chenyu Hou, Jing Fan, Baihua Zheng, Jianwei Jin Nov 2021

Expediting The Accuracy-Improving Process Of Svms For Class Imbalance Learning, Bin Cao, Yuqi Liu, Chenyu Hou, Jing Fan, Baihua Zheng, Jianwei Jin

Research Collection School Of Computing and Information Systems

To improve the classification performance of support vector machines (SVMs) on imbalanced datasets, cost-sensitive learning methods have been proposed, e.g., DEC (Different Error Costs) and FSVM-CIL (Fuzzy SVM for Class Imbalance Learning). They relocate the hyperplane by adjusting the costs associated with misclassifying samples. However, the error costs are determined either empirically or by performing an exhaustive search in the parameter space. Both strategies can not guarantee effectiveness and efficiency simultaneously. In this paper, we propose ATEC, a solution that can efficiently find a preferable hyperplane by automatically tuning the error cost for between-class samples. ATEC distinguishes itself from all …

Go to article

Constructing Frameworks For Task-Optimized Visualizations, Ghulam Jilani Abdul Rahim Quadri Oct 2021

Constructing Frameworks For Task-Optimized Visualizations, Ghulam Jilani Abdul Rahim Quadri

USF Tampa Graduate Theses and Dissertations

Visualization is crucial in today’s data-driven world to augment and enhance human understanding and decision-making. Effective visualizations must support accuracy in visual task performance and expressive data communication. Effective visualization design depends on the visual channels used, chart types, or visual tasks. However, design choices and visual judgment are co-related, and effectiveness is not one-dimensional, leading to a significant need to understand the intersection of these factors to create optimized visualizations. Hence, constructing frameworks that consider both design decisions and the task being performed enables optimizing visualization design to maximize efficacy. This dissertation describes experiments, techniques, and user studies to …

Go to article

Orthogonal Inductive Matrix Completion, Antoine Ledent, Rrodrigo Alves, Marius Kloft Sep 2021

Orthogonal Inductive Matrix Completion, Antoine Ledent, Rrodrigo Alves, Marius Kloft

Research Collection School Of Computing and Information Systems

We propose orthogonal inductive matrix completion (OMIC), an interpretable approach to matrix completion based on a sum of multiple orthonormal side information terms, together with nuclear-norm regularization. The approach allows us to inject prior knowledge about the singular vectors of the ground-truth matrix. We optimize the approach by a provably converging algorithm, which optimizes all components of the model simultaneously. We study the generalization capabilities of our method in both the distribution-free setting and in the case where the sampling distribution admits uniform marginals, yielding learning guarantees that improve with the quality of the injected knowledge in both cases. As …

Go to article

Mathematical Programming Model For The Two-Level Facility Location Problem: The Case Of Tanzanian Emergence Maize Distribution Network For 2004–2010 Maize Data, Said A. Sima Aug 2021

Mathematical Programming Model For The Two-Level Facility Location Problem: The Case Of Tanzanian Emergence Maize Distribution Network For 2004–2010 Maize Data, Said A. Sima

Tanzania Journal of Science

A two-level facility location problem (FLP) has been studied in the transportation network of emergence maize crop in Tanzania. The facility location problem is defined as the optimal location of facilities or resources so as to minimize costs in terms of money, time, distance and risks with the relation to supply and demand points. Distribution network design problems consist of determining the best way to transfer goods from the supply to the demand points by choosing the structure of the network such that the overall cost is minimized. The three layers, namely production centres (PCs), distribution centres (DCs) and customer …

Go to article

Exploiting Block Structures Of Kkt Matrices For Efficient Solution Of Convex Optimization Problems, Zafar Iqbal, Saeid Nooshabadi, Ichitaro Yamazaki, Stanimire Tomov, Jack Dongarra Aug 2021

Exploiting Block Structures Of Kkt Matrices For Efficient Solution Of Convex Optimization Problems, Zafar Iqbal, Saeid Nooshabadi, Ichitaro Yamazaki, Stanimire Tomov, Jack Dongarra

Michigan Tech Publications, Part 1

Convex optimization solvers are widely used in the embedded systems that require sophisticated optimization algorithms including model predictive control (MPC). In this paper, we aim to reduce the online solve time of such convex optimization solvers so as to reduce the total runtime of the algorithm and make it suitable for real-time convex optimization.We exploit the property of the Karush–Kuhn–Tucker (KKT) matrix involved in the solution of the problem that only some parts of the matrix change during the solution iterations of the algorithm. Our results show that the proposed method can effectively reduce the runtime of the solvers.

Go to article

Continuous-Time And Complex Growth Transforms For Analog Computing And Optimization, Oindrila Chatterjee Aug 2021

Continuous-Time And Complex Growth Transforms For Analog Computing And Optimization, Oindrila Chatterjee

McKelvey School of Engineering Graduate Student Theses & Dissertations

Analog computing is a promising and practical candidate for solving complex computational problems involving algebraic and differential equations. At the fundamental level, an analog computing framework can be viewed as a dynamical system that evolves following fundamental physical principles, like energy minimization, to solve a computing task. Additionally, conservation laws, such as conservation of charge, energy, or mass, provide a natural way to couple and constrain spatially separated variables. Taking a cue from these observations, in this dissertation, I have explored a novel dynamical system-based computing framework that exploits naturally occurring analog conservation constraints to solve a variety of optimization …

Go to article

Scheduling Allocation And Inventory Replenishment Problems Under Uncertainty: Applications In Managing Electric Vehicle And Drone Battery Swap Stations, Amin Asadi Jul 2021

Scheduling Allocation And Inventory Replenishment Problems Under Uncertainty: Applications In Managing Electric Vehicle And Drone Battery Swap Stations, Amin Asadi

Graduate Theses and Dissertations

In this dissertation, motivated by electric vehicle (EV) and drone application growth, we propose novel optimization problems and solution techniques for managing the operations at EV and drone battery swap stations. In Chapter 2, we introduce a novel class of stochastic scheduling allocation and inventory replenishment problems (SAIRP), which determines the recharging, discharging, and replacement decisions at a swap station over time to maximize the expected total profit. We use Markov Decision Process (MDP) to model SAIRPs facing uncertain demands, varying costs, and battery degradation. Considering battery degradation is crucial as it relaxes the assumption that charging/discharging batteries do not …

Go to article

Designing Targeted Mobile Advertising Campaigns, Kimia Keshanian Jun 2021

Designing Targeted Mobile Advertising Campaigns, Kimia Keshanian

USF Tampa Graduate Theses and Dissertations

With the proliferation of smart, handheld devices, there has been a multifold increase in the ability of firms to target and engage with customers through mobile advertising. Therefore, not surprisingly, mobile advertising campaigns have become an integral aspect of firms’ brand building activities, such as improving the awareness and overall visibility of firms' brands. In addition, retailers are increasingly using mobile advertising for targeted promotional activities that increase in-store visits and eventual sales conversions. However, in recent years, mobile or in general online advertising campaigns have been facing one major challenge and one major threat that can negatively impact the …

Go to article

Yard Layout Optimization For General Cargo Terminal, Zhixiong Liu, Dong Yu, Chunjun Zhang Jun 2021

Yard Layout Optimization For General Cargo Terminal, Zhixiong Liu, Dong Yu, Chunjun Zhang

Journal of System Simulation

Abstract: Yard layout is an important component of the port yard allocation decision which affects the cargo storage capacity and through capacity for the port yard. As to the general cargo yard, combined with the cargo type and the yard storage strategy, the yard layout optimization model for the general cargo terminal is presented based on the statistical analysis for the production data when the optimization aim is minimizing the total horizontal transport distance of the trailer. The yard layout optimization results are employed by the mathematical tool Gurobi for different storage strategies, and the yard layout optimization results are …

Go to article

Efficient Attribute-Based Encryption With Repeated Attributes Optimization, Fawad Khan, Hui Li, Yinghui Zhang, Haider Abbas, Tahreem Yaqoob Jun 2021

Efficient Attribute-Based Encryption With Repeated Attributes Optimization, Fawad Khan, Hui Li, Yinghui Zhang, Haider Abbas, Tahreem Yaqoob

Research Collection School Of Computing and Information Systems

Internet of Things (IoT) is an integration of various technologies to provide technological enhancements. To enforce access control on low power operated battery constrained devices is a challenging issue in IoT scenarios. Attribute-based encryption (ABE) has emerged as an access control mechanism to allow users to encrypt and decrypt data based on an attributes policy. However, to accommodate the expressiveness of policy for practical application scenarios, attributes may be repeated in a policy. For certain policies, the attributes repetition cannot be avoided even after applying the boolean optimization techniques to attain an equivalent smaller length boolean formula. For such policies, …

Go to article

Can Parallel Gravitational Search Algorithm Effectively Choose Parameters For Photovoltaic Cell Current Voltage Characteristics?, Alan Kirkpatrick May 2021

Can Parallel Gravitational Search Algorithm Effectively Choose Parameters For Photovoltaic Cell Current Voltage Characteristics?, Alan Kirkpatrick

Honors Projects

This study asks the question “Can parallel Gravitational Search Algorithm (GSA) effectively choose parameters for photovoltaic cell current voltage characteristics?” These parameters will be plugged into the Single Diode Model to create the IV curve. It will also investigate Particle Swarm Optimization (PSO) and a population based random search (PBRS) to see if GSA performs the search better and or more quickly than alternative algorithms

Go to article

Machine Learning Models For Deciphering Regulatory Mechanisms And Morphological Variations In Cancer, Saman Farahmand May 2021

Machine Learning Models For Deciphering Regulatory Mechanisms And Morphological Variations In Cancer, Saman Farahmand

Graduate Doctoral Dissertations

The exponential growth of multi-omics biological datasets is resulting in an emerging paradigm shift in fundamental biological research. In recent years, imaging and transcriptomics datasets are increasingly incorporated into biological studies, pushing biology further into the domain of data-intensive-sciences. New approaches and tools from statistics, computer science, and data engineering are profoundly influencing biological research. Harnessing this ever-growing deluge of multi-omics biological data requires the development of novel and creative computational approaches. In parallel, fundamental research in data sciences and Artificial Intelligence (AI) has advanced tremendously, allowing the scientific community to generate a massive amount of knowledge from data. Advances …

Go to article

First Prev Next Last