We develop a general framework for clustering and distribution matching problems with bandit feedback. We consider a K-armed bandit model where some subset of K arms is partitioned into M groups. Within each group, th...
详细信息
Ethereum is one of the most popular blockchain platforms with a high number of adoption in the blockchain world today. Ethereum token (ERC-20) can tokenize any real-world object while it is also possible to exchange t...
详细信息
Melanoma is a malignant form of cancer that affects the skin and has a particularly high mortality rate, so it requires early detection to increase the level of safety for users. Diagnosis and detection of skin cancer...
Melanoma is a malignant form of cancer that affects the skin and has a particularly high mortality rate, so it requires early detection to increase the level of safety for users. Diagnosis and detection of skin cancer are usually done through manual screening and visual inspection. This process requires a long time, has high complexity, is subjective, and is prone to errors. CNN is one of the algorithms with advantages in accurate classification. In this research, early detection and classification of melanoma cancer were carried out based on two classes, namely benign and malignant using the Convolutional Neural Network method. Our proposed method yields an accuracy of 81.11% for the validation data. The accuracy results obtained can be improved by using more datasets and increasing the number of layers used. This study uses the CNN method using MobileNet V2 architecture to detect melanoma skin cancer. The class used is benign and malignant.
ERP stands for enterprise resource planning. It is an information system that is all rolled into one, is very flexible and adaptable, and optimizes business operations while also centralizing all of the company's ...
详细信息
We consider the problem of finding collision-free paths for curvature-constrained systems in the presence of obstacles while minimizing execution time. Specifically, we focus on the setting where a planar system can t...
详细信息
We consider the problem of finding collision-free paths for curvature-constrained systems in the presence of obstacles while minimizing execution time. Specifically, we focus on the setting where a planar system can travel at some range of speeds with unbounded acceleration. This setting can model many systems, such as fixed-wing drones. Unfortunately, planning for such systems might require evaluating many (local) time-optimal transitions connecting two close-by configurations, which is computationally expensive. Existing methods either pre-compute all such transitions in a preprocessing stage or use heuristics to speed up the search, thus foregoing any guarantees on solution quality. Our key insight is that computing all the time-optimal transitions is both (i) computationally expensive and (ii) unnecessary for many problem instances. We show that by finding bounded-suboptimal solutions (solutions whose cost is bounded by $\boldsymbol{1+\varepsilon}$ times the cost of the optimal solution for any user-provided $\boldsymbol{\varepsilon}$ ) and not time-optimal solutions, one can dramatically reduce the number of time-optimal transitions used. We demonstrate using empirical evaluation that our planning framework can reduce the runtime by several orders of magnitude compared to the state-of-the-art while still providing guarantees on the quality of the solution.
Artificial Intelligence Generated Content (AIGC) Services have significant potential in digital content creation. The distinctive abilities of AIGC, such as content generation based on minimal input, hold huge potenti...
详细信息
Dynamic programming is a fundamental algorithm that can be found in our daily lives easily. One of the dynamic programming algorithm implementations consists of solving the 0/1 knapsack problem. A 0/1 knapsack problem...
Dynamic programming is a fundamental algorithm that can be found in our daily lives easily. One of the dynamic programming algorithm implementations consists of solving the 0/1 knapsack problem. A 0/1 knapsack problem can be seen from industrial production cost. It is prevalent that a production cost has to be as efficient as possible, but the expectation is to get the proceeds of the products higher. Thus, the dynamic programming algorithm can be implemented to solve the diverse knapsack problem, one of which is the 0/1 knapsack problem, which would be the main focus of this paper. The implementation was implemented using C language. This paper was created as an early implementation algorithm using a Dynamic program algorithm applied to an Automatic Identification System (AIS) dataset.
Traditional virtual power plants (VPPs) combine power from distributed energy resources (DER) to supply energy to users. However, they fall short of net-zero goals because of neglecting carbon footprints during power ...
详细信息
Traditional virtual power plants (VPPs) combine power from distributed energy resources (DER) to supply energy to users. However, they fall short of net-zero goals because of neglecting carbon footprints during power aggregation. This paper proposes a novel intelligent virtual power plant framework ( $i$ VPPF) to address this gap. $i$ VPPF comprises a central $i$ VPP ( $i$ VPP $_{\mathrm{C}})$ and several regional $i$ VPPs ( $i$ VPP $_{\mathrm{n}})$ , n $=$ E, S, M, and N. These $i$ VPP $_{\mathrm{n}}$ are geographically distributed systems for intelligently managing $i$ VPPs in four regions: east, south, middle, and north, respectively, while the $i$ VPP $_{\mathrm{C}}$ is responsible for dispatching power across $i$ VPP $_{\mathrm{n}}$ . We built $i$ VPP $_{\mathrm{C}}$ and $i$ VPP $_{\mathrm{n}}$ on individual green power clouds, which can provide abundant computing resources and realize intelligence through AI technologies for $i$ VPPF. We also design universal computing devices called cyber-physical agents (CPAs) to collect essential data on manufacturing, carbon footprint, and energy usage for $i$ VPP $_{\mathrm{n}}$ . $i$ VPP $_{\mathrm{n}}$ can intelligently control DERs based on the collected data. Also, $i$ VPPF can empower enterprises to participate in power balancing services offered by Taipower, thereby enhancing the flexibility of the overall power grid. Furthermore, we integrate $i$ VPPF with the I4.2-GiM framework, offering intelligent carbon and energy management capabilities to achieve the net-zero goal. The testing results show that $i$ VPPF can significantly reduce energy usage (up to 25.6%) and carbon emissions (up to 509 kg) through power dispatch. Thus, the proposed $i$ VPPF promises to contribute economic benefits for businesses and the pursuit of net-zero emissions. Note to Practitioners—This paper proposes an intelligent virtual power plant framework $({\it i} \text{VPPF})$ consisting of a central coordinator $({\it i}\text{VPP}_{\text{C}})
Fish image classification presents an intriguing challenge in the field of computer vision. This research aims to develop an accurate classification model to differentiate between four different fish species using a c...
详细信息
ISBN:
(数字)9798331517601
ISBN:
(纸本)9798331517618
Fish image classification presents an intriguing challenge in the field of computer vision. This research aims to develop an accurate classification model to differentiate between four different fish species using a convolutional neural network. The dataset used consists of $\mathbf{3 0 1 0}$ fish images, divided into training, validation, and testing sets. The convolutional neural network model was trained both with and without data augmentation. Evaluation results show that the model trained with data augmentation achieved an accuracy of $95 \%$ with a loss value of 0.0983, slightly better than the model without augmentation which achieved an accuracy of $94.56 \%$ with a loss value of $\mathbf{0. 1 7 9 4}$. This indicates that data augmentation techniques are effective in improving model performance, likely because augmentation helps the model generalize better to variations in fish image data. The results of this research demonstrate the significant potential of convolutional neural network for fish image classification tasks. The developed model can serve as a foundation for the development of computer vision-based applications such as automatic fish species identification in fisheries or educational applications. Further research can be conducted by exploring different convolutional neural network architectures, more advanced data augmentation techniques, and larger datasets to improve model performance.
Indoor positioning systems (IPS) are gaining higher attention recently due to the increased demand for indoor location aware services. Visible light communication (VLC) is a promising technology to use for IPS. In par...
详细信息
ISBN:
(数字)9798350303582
ISBN:
(纸本)9798350303599
Indoor positioning systems (IPS) are gaining higher attention recently due to the increased demand for indoor location aware services. Visible light communication (VLC) is a promising technology to use for IPS. In particular, received signal strength (RSS) based visible light positioning (VLP) systems are gaining high attention due to their low complexity and cost, in addition to higher positioning accuracy compared to their radio frequency (RF) counterparts. One of the main challenges in RSS based VLP systems is encountered when the receiver (the target) is tilted and not placed in parallel with the transmitters (the anchors). RSS based trilateration techniques require a computationally expensive and time-consuming process to solve the nonlinear problem of tilted receivers. Fingerprint based systems generally provide high positioning accuracy with short positioning time, and maybe used to circumvent the need to deal with the high complexity associated with tilted receivers. However, the design of a fingerprinting VLP system for tilted receiver has not been explored yet as far as receivers with a single photodetector (PD) are concerned. In this work, a fingerprint based VLP system for tilted receivers using artificial neural networks (ANN) is proposed, where different types of input features for training the positioning algorithm are studied. We show that using the components of the normal vector to the PD's surface in addition to RSS values provides an excellent positioning accuracy with an average positioning error of 25.41 cm and a remarkably low average positioning time less than
$\mathbf{5} \boldsymbol{\mu} \boldsymbol{s}$
. In addition, important research directions for future work are discussed.
暂无评论