Karawo is a traditional embroidered cloth for the people of the Gorontalo region. Currently karawo has been widely used by the surrounding community and the outside community in the form of souvenirs or other things. ...
详细信息
Karawo is a traditional embroidered cloth for the people of the Gorontalo region. Currently karawo has been widely used by the surrounding community and the outside community in the form of souvenirs or other things. On the one hand, the Gorontalo Region is an area that has many cultures and customs. We need to protect and preserve this culture so that this culture does not quickly become extinct. The lack of karawo motif designs that have a Gorontalo regional cultural philosophy causes karawo craftsmen to lack ideas to design karawo motifs in various design variations. This can be overcome by creating a system that can make several variations of the karawo motif design with the help of computer algorithms. The development of this karawo motif design uses several object or image transformation functions, namely rotation, translation, mirror, flip and zoom functions. To enrich the object so that it looks varied, arithmetic operations and boolean operations are also used to value the color component of each point in the image. The usability measurement results show that the eligibility value of usefulness is 85.71%, ease of use is 100%, ease of learning is 85.71% and satisfaction is 92.86%. The average of all dimensions is 91.07% or it is included in the very satisfied category.
Background Artificial intelligence (AI) is increasingly being used in medical practice. Especially in the image-based diagnosis of skin cancer, AI shows great potential. However, there is a significant discrepancy bet...
详细信息
Background Artificial intelligence (AI) is increasingly being used in medical practice. Especially in the image-based diagnosis of skin cancer, AI shows great potential. However, there is a significant discrepancy between expectations and true relevance of AI in current dermatological practice. Objectives This article summarizes promising study results of skin cancer diagnosis by computer-based diagnostic systems and discusses their significance for daily practice. We hereby focus on the analysis of dermoscopic images of pigmented and unpigmented skin lesions. Materials and methods A selective literature search for recent relevant trials was conducted. The included studies used machine learning, and in particular "convolutional neural networks", which have been shown to be particularly effective for the classification of image data. Results and conclusions In numerous studies, computer algorithms were able to detect pigmented and nonpigmented neoplasms of the skin with high precision, comparable to that of dermatologists. The combination of the physician's assessment and AI showed the best results. computer-based diagnostic systems are widely accepted among patients and physicians. However, they are still not applicable in daily practice, since computer-based diagnostic systems have only been tested in an experimental environment. In addition, many digital diagnostic criteria that help AI to classify skin lesions remain unclear. This lack of transparency still needs to be addressed. Moreover, clinical studies on the use of AI-based assistance systems are needed in order to prove its applicability in daily dermatologic practice.
This article investigates the coupled vibration problem of suspension bridge structures under earthquake action, and conducts static and dynamic analysis using computer algorithms. In terms of static analysis, complex...
详细信息
This article investigates the coupled vibration problem of suspension bridge structures under earthquake action, and conducts static and dynamic analysis using computer algorithms. In terms of static analysis, complex structures are divided into many small elements, and the stress and deformation of each element are calculated through finite element analysis, thereby obtaining the static characteristics of the entire structure. In terms of dynamic analysis, the seismic response analysis method based on time history considers seismic action as a time-varying external excitation, and calculates and simulates the dynamic response of the suspension bridge structure. In order to achieve efficient and accurate calculations, this article also adopts optimization algorithms and numerical calculation methods. Through a comprehensive study of statics and dynamics analysis, the key characteristics and regularities of coupled vibration of suspension bridge structures under earthquake action have been obtained. These research results not only provide important theoretical guidance and technical support for related engineering practices, but also provide useful references and inspirations for dynamic analysis and optimization design of similar structures. Meanwhile, using computer algorithms and simulation software for static and dynamic analysis can significantly reduce analysis costs and time, improve analysis accuracy and efficiency, and have broad application prospects.
This paper examines strategic adaptation in participants' behavior conditional on the type of their opponent. Participants played a constant-sum game for 100 rounds against each of three pattern-detecting computer...
详细信息
This paper examines strategic adaptation in participants' behavior conditional on the type of their opponent. Participants played a constant-sum game for 100 rounds against each of three pattern-detecting computer algorithms designed to exploit regularities in human behavior such as imperfections in randomizing and the use of simple heuristics. Significant evidence is presented that human participants not only change their marginal probabilities of choosing actions, but also their conditional probabilities dependent on the recent history of play. A cognitive model incorporating pattern recognition is proposed that capture the shifts in strategic behavior of the participants better than the standard non-pattern detecting model employed in the literature, the Experience Weighted Attraction model (and by extension its nested models, reinforcement learning and fictitious play belief learning).
The focus of this dissertation is design and analysis of scheduling algorithms for distributed computer systems, i. e., data centers. Today's data centers can contain thousands of servers and typically use a multi...
详细信息
The focus of this dissertation is design and analysis of scheduling algorithms for distributed computer systems, i. e., data centers. Today's data centers can contain thousands of servers and typically use a multi-tier switch network to provide connectivity among the servers. Data centers are the host for execution of various data-parallel applications. As an abstraction, a job in a data center can be thought of as a group of interdependent tasks, each with various requirements which need to be scheduled for execution on the servers and the data flows between the tasks that need to be scheduled in the switch network. In this thesis, we study both flow and task scheduling problems under the features of modern parallel computing frameworks. For the flow scheduling problem, we study three models. The first model considers a general network topology where flows among the various source-destination pairs of servers are generated dynamically over time. The goal is to assign the end-to-end data flows among the available paths in order to efficiently balance the load in the network. We propose a myopic algorithm that is computationally efficient and prove that it asymptotically minimizes the total network cost using a convex optimization model, fluid limit and Lyapunov analysis. We further propose randomized versions of our myopic algorithm. The second model consider the case that there is dependence among flows. Specifically, a coflow is defined as a collection of parallel flows whose completion time is determined by the completion time of the last flow in the collection. Our main result is a 5-approximation deterministic algorithm that schedule coflows in polynomial time so as to minimize the total weighted completion times. The key ingredient of our approach is an improved linear program formulation for sorting the coflows followed by a simple list scheduling policy. Lastly, we study scheduling coflows of multi-stage jobs to minimize the jobs' total weighted completion t
学位级别:M.S.C.S., Master of Science in Computer Science/ Master of Science in Clinical Science
Over the years, machine learning techniques have been used in a wide variety of security sensitive applications due to the high reliability and accuracy of its results. But recent findings in the domain of adversarial...
详细信息
Over the years, machine learning techniques have been used in a wide variety of security sensitive applications due to the high reliability and accuracy of its results. But recent findings in the domain of adversarial machine learning have shown that such deep learning models could be potentially vulnerable to attacks. A backdoor attack is one such attack where malicious data containing a predefined perturbation is added to the training data so that when the model is trained on it, a backdoor is created. This backdoor is generally hidden and can only be activated when the attacker adds the perturbation to the test data. In the domain of natural language processing, such poisoned data is generally created by adding a sequence of trigger words and changing the label of the data to the target class. But these attacks can be easily detected by visual inspection since the context of the poisoned text does not resemble its label. That is why to hide the poisoned data better, we have come up with a novel approach to generate poisoned data that modifies the text in such a way that the label fits the context of the poisoned text. Our attack algorithm called SentMod can achieve an attack success ratio of 97% by poisoning only 2% of the training data. We run extensive experiments on multiple deep learning models using different datasets to verify the effectiveness of our attack method.
Data structures and algorithms is a fundamental course in computer Science, which enables learners across any discipline to develop the much-needed foundation of efficient programming, leading to better problem solvin...
详细信息
ISBN:
(数字)9781394192014
ISBN:
(纸本)9781786308924
Data structures and algorithms is a fundamental course in computer Science, which enables learners across any discipline to develop the much-needed foundation of efficient programming, leading to better problem solving in their respective disciplines. A Textbook of Data Structures and algorithms is a textbook that can be used as course
The method of studying the synchronization of relaxation self-oscillations, based on a modified axiomatic method and using the properties of uniform almost-periodic functions is used. A computational algorithm is used...
详细信息
ISBN:
(纸本)9783030391621;9783030391614
The method of studying the synchronization of relaxation self-oscillations, based on a modified axiomatic method and using the properties of uniform almost-periodic functions is used. A computational algorithm is used to study the synchronization of relaxation self-oscillations, using axiomatic algebraic models and properties of the theory of uniform almost periodic functions. It is shown that synchronization is a flexible and efficient process for shaping the attention of other cognitive processes to certain external informational influences. The five synchronization modes of neural ensembles of 100 peripheral neurons were investigated: asynchronous mode, full synchronization, partial synchronization, "incorrect" synchronization mode, transient phase-dynamic process. The complex synchronization regimes of relaxation self-oscillations are considered: "incorrect" synchronization, the presence of specific and "phase-dynamic" transient processes caused by the properties of uniform almost-periodic functions. Discussed the adequacy of the used mathematical computer model for the formation of attention.
Many hormones in the body oscillate with different frequencies and amplitudes, creating a dynamic environment that is essential to maintain health. In humans, disruptions to these rhythms are strongly associated with ...
详细信息
Unsupervised representation learning algorithms have been playing important roles in machine learning and related fields. However, due to optimization intractability or lack of consideration in given data correlation ...
详细信息
Unsupervised representation learning algorithms have been playing important roles in machine learning and related fields. However, due to optimization intractability or lack of consideration in given data correlation structures, some unsupervised representation learning algorithms still cannot well discover the inherent features from the data, under certain circumstances. This thesis extends these algorithms, and improves over the above issues by taking data correlations into consideration. We study three different aspects of improvements on unsupervised representation learning algorithms by utilizing correlation information, via the following three tasks respectively: 1. Using estimated correlations between data points to provide smart optimization initializations, for multi-way matching (Chapter 2). In this work, we define a correlation score between pairs of data points as metrics for correlations, and initialize all the permutation matrices along a maximum spanning tree of the undirected graph with these metrics as the weights. 2. Faster optimization by utilizing the correlations in the observations, for variational inference (Chapter 3). We construct a positive definite matrix from the negative Hessian of the log-likelihood part of the objective that can capture the influence of the observation correlations on the parameter vector. We then use the inverse of this matrix to rescale the gradient. 3. Utilizing additional side-information on data correlation structures to explicitly learn correlations between data points, for extensions of Variational Auto-Encoders (VAEs) (Chapters 4 and 5). Consider the case where we know a correlation graph G of the data points. Instead of placing an i.i.d. prior as in the most common setting, we adopt correlated priors and/or correlated variational distributions on the latent variables through utilizing the graph G. Empirical results on these tasks show the success of the proposed methods in improving the performances of unsuper
暂无评论