Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Class imbalance (1)
- Cloud Computing (1)
- Content analysis (1)
- Credit risk (1)
- Cyber Physical System (1)
-
- Cybersecurity (1)
- Digital Twin (1)
- Distributed Control (1)
- Energy Management (1)
- Engineering community (1)
- Literature reviews (1)
- Low-default portfolio (1)
- Management method (1)
- Microgrid (1)
- Networked Inverters (1)
- Neutrosophic logic; indeterminacy; indeterminate model; indeterminate element; indeterminate mass; indeterminate fusion rules; DSmT; DST; TBM (1)
- One-class classification (1)
- Power System Resiliency (1)
- Project failures (1)
- Risk management (1)
- Scholarly journals (1)
- Smart Grid (1)
- Software design (1)
- Software development projects (1)
Articles 1 - 6 of 6
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Digital Twin-Based Cooperative Control Techniques For Secure And Intelligent Operation Of Distributed Microgrids, Ahmed Aly Saad Ahmed
Digital Twin-Based Cooperative Control Techniques For Secure And Intelligent Operation Of Distributed Microgrids, Ahmed Aly Saad Ahmed
FIU Electronic Theses and Dissertations
Networked microgrids play a key role in constructing future active distribution networks for providing the power system with resiliency and reliability against catastrophic physical and cyber incidents. Motivated by the increasing penetration of renewable resources and energy storage systems in the distribution grids, utility companies are encouraged to unleash the capabilities of the distributed microgrid to work as virtual power plants that can support the power systems. The microgrids nature is transforming the grid and their control systems from centralized architecture into distributed architectures. The distributed networked microgrids introduced many benefits to the future smart grids, it created many challenges …
Neutrosophic Masses & Indeterminate Models Applications To Information Fusion, Florentin Smarandache
Neutrosophic Masses & Indeterminate Models Applications To Information Fusion, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper we introduce the indeterminate models in information fusion, which are due either to the existence of some indeterminate elements in the fusion space or to some indeterminate masses. The best approach for dealing with such models is the neutrosophic logic.
Learning Without Default: A Study Of One-Class Classification And The Low-Default Portfolio Problem, Kenneth Kennedy, Brian Mac Namee, Sarah Jane Delany
Learning Without Default: A Study Of One-Class Classification And The Low-Default Portfolio Problem, Kenneth Kennedy, Brian Mac Namee, Sarah Jane Delany
Conference papers
This paper asks at what level of class imbalance one-class classifiers outperform two-class classifiers in credit scoring problems in which class imbalance, referred to as the low-default portfolio problem, is a serious issue. The question is answered by comparing the performance of a variety of one-class and two-class classifiers on a selection of credit scoring datasets as the class imbalance is manipulated. We also include random oversampling as this is one of the most common approaches to addressing class imbalance. This study analyses the suitability and performance of recognised two-class classifiers and one-class classifiers. Based on our study we conclude …
Gathering Cows Using Virtual Fencing Methodologies, Dean M. Anderson, Marek Doniec, Carrick Detweiler, Iuliu Vesilescu, Daniela Rus, Barbara Nolen, Roy Libeau
Gathering Cows Using Virtual Fencing Methodologies, Dean M. Anderson, Marek Doniec, Carrick Detweiler, Iuliu Vesilescu, Daniela Rus, Barbara Nolen, Roy Libeau
CSE Conference and Workshop Papers
Free-ranging livestock are classically controlled by herders. Holding, moving, or gathering free-ranging cattle requires flexible husbandry practices for efficient and effective lowstress animal management. Behavioral theory and practical experience indicates cattle can be taught to respond to auditory cues. Preliminary research has demonstrated that cows can be gathered autonomously using recorded audio cues associated with manual gathering. However, efficient gathering requires movement in the proper direction. Therefore, we believe using audio cues administered from directional virtual fencing (DVF™) equipment can facilitate proper animal orientation and facilitate the gathering of animals with minimal human intervention. Results from applying directional audio cues …
Software Development Project Risk Management: A Literature Review, Kevin Macg. Adams, C. Ariel Pinto
Software Development Project Risk Management: A Literature Review, Kevin Macg. Adams, C. Ariel Pinto
Engineering Management & Systems Engineering Faculty Publications
The rapid and unprecedented growth in software has brought with it some of the most spectacular and costly project failures in modern history. How risk management is presented in the scholarly journals may give insight into the risk management methods and techniques in use on software development projects. This paper provides a glimpse into the risk management methods, methodologies and techniques available to those who are responsible for software development projects by conducting a non-experimental content analysis. The findings reveal that risk management has not received sufficient attention and does not appear to be widely accepted within the software engineering …
Packet Routing In Networks With Long Wires, Ronald I. Greenberg, H.-C. Oh
Packet Routing In Networks With Long Wires, Ronald I. Greenberg, H.-C. Oh
Computer Science: Faculty Publications and Other Works
In this paper, we examine the packet routing problem for networks with wires of differing length. We consider this problem in a network independent context, in which routing time is expressed in terms of “congestion” and “dilation” measures for a set of packet paths. We give, for any constant ε > 0, a randomized on-line algorithm for routing any set of N packets in O((Clg^ε(Nd)+Dlg(Nd))/lglg(Nd)) time, where C is the maximum congestion and D is the length of the longest path, both taking wire delays into account, and d is the longest path in terms of number of wires. We also …