Artificial Intelligence (AI) often outperforms human doctors in terms of decisional speed. For some diseases, the expected benefit of a fast but less accurate decision exceeds the benefit of a slow but more accurate one. In such cases, we argue, it is often justified to rely on a medical AI to maximise decision speed – even if the AI is less accurate than human doctors.

Existing discussions about automated decision-making focus primarily on its inputs and outputs, raising questions about data collection and privacy on one hand and accuracy and fairness on the other. Less attention has been devoted to critically examining the temporality of decision-making processes—the speed at which automated decisions are reached. In this paper, I identify four dimensions of algorithmic speed that merit closer analysis. Duration (how much time it takes to reach a judgment), timing (when automated systems intervene (...) in the activity being evaluated), frequency (how often evaluations are performed), and lived time (the human experience of algorithmic speed) are interrelated, but distinct, features of automated decision-making. Choices about the temporal structure of automated decision-making systems have normative implications, which I describe in terms of "disruption," "displacement," "re-calibration," and "temporal fairness," with values such as accuracy, fairness, accountability, and legitimacy hanging in the balance. As computational tools are increasingly tasked with making judgments about human activities and practices, the designers of decision-making systems will have to reckon, I argue, with when—and how fast—judgments ought to be rendered. Though computers are capable of reaching decisions at incredible speeds, failing to account for the temporality of automated decision-making risks misapprehending the costs and benefits automation promises. (shrink)

IntroductionAccurately predicting the competitive performance of elite athletes is an essential prerequisite for formulating competitive strategies. Women’s all-around speed skating event consists of four individual subevents, and the competition system is complex and challenging to make accurate predictions on their performance.ObjectiveThe present study aims to explore the feasibility and effectiveness of machine learning algorithms for predicting the performance of women’s all-around speed skating event and provide effective training and competition strategies.MethodsThe data, consisting of 16 seasons of world-class women’s (...) all-around speed skating competition results, used in the present study came from the International Skating Union. According to the competition rules, distinct features are filtered using lasso regression, and a 5,000 m race model and a medal model are built using a fivefold cross-validation method.ResultsThe results showed that the support vector machine model was the most stable among the 5,000 m race and the medal models, with the highest AUC. Furthermore, 3,000 m points are the main characteristic factors that decide whether an athlete can qualify for the final. The 11th lap of the 5,000 m, the second lap of the 500 m, and the fourth lap of the 1,500 m are the main characteristic factors that affect the athlete’s ability to win medals.ConclusionCompared with logistic regression, random forest, K-nearest neighbor, naive Bayes, neural network, support vector machine is a more viable algorithm to establish the performance prediction model of women’s all-around speed skating event; excellent performance in the 3,000 m event can facilitate athletes to advance to the final, and athletes with outstanding performance in the 500 m event are more likely competitive for medals. (shrink)

In this article, we present a new approach for frequent pattern mining that runs fast for both sparse and dense databases. Two algorithms, FEM and DFEM, based on our approach are also introduced. FEM applies a fixed threshold as the condition for switching between the two mining strategies; meanwhile, DFEM adopts this threshold dynamically at runtime to best fit the characteristics of the database during the mining process, especially when minimum support threshold is low. Additionally, we present optimization techniques for (...) the proposed algorithms to speed the mining process, reduce the memory usage, and optimize the I/o cost. We also analyze in depth the performance of FEM and DFEM and compare them with several existing algorithms. The experimental results show that FEM and DFEM achieve a significant improvement in execution time and consume less memory than many popular FPM algorithms including the well-known Apriori, FP-growth, and Eclat. (shrink)

This commentary questions the claim that Take-The-Best provides a cognitively more plausible account of cue utilisation in decision making because it is faster and more frugal than alternative algorithms. It is also argued that the experimental evidence for Take-The-Best, or non-integrative algorithms, is weak and appears consistent with people normally adopting an integrative approach to cue utilisation.

In the article the possibility of using a smartphone with an integrated set of necessary technical means for implementing the technology of video recording of vehicle speed is investigated and established. The main algorithmic and software components of a smartphone are proposed, which allow to identify and to accompany a vehicle, as well as to determine its speed. Installation and initial setup of the device is simple. It is only necessary to measure and enter in the device (...) height of its arrangement. In the article the possibility of using a smartphone with an integrated set of necessary technical means for implementing the technology of video recording of vehicle speed is investigated and established. The smartphone has a low cost and power consumption, the ability to operate in the required temperature range, as well as a set of physically built-in necessary technical means: several video cameras, accelerometers, gyroscope, magnetometer, GPS sensor, GSM and Wi-Fi wireless communication. Due to its low power consumption, it can also run on solar panels during the day when no other power source is available. The cost of a smartphone with very good characteristics does not exceed 10,000 UAH. The paper proposes the main components of the algorithmic support of the device. The use of the Lucas-Kanade method for the implementation of tracking and the calculation in the interpixel space of the coordinates of the points of the vehicle's trajectory will improve the accuracy of measurements of the traveled distance and the vehicle's speed on short sections of the trajectory. The proposed algorithm for calculating the vehicle speed requires entering only one parameter - the height of the device. Therefore, installation and initial setup of the device is simple. It is enough to measure and enter this parameter into the device. Large-scale introduction of a device for measuring vehicle speed, built on the basis of a smartphone, is possible due to relatively small investments in the development of its mechanical part, algorithmic and software. (shrink)

In science and technology studies today, there is a troubling tendency to portray actors in the biosciences as “cultural dopes” and technology as having monolithic qualities with predetermined outcomes. To remedy this analytical impasse, this article introduces the concept styles of valuation to analyze how actors struggle with valuing technology in practice. Empirically, this article examines how actors in a bioscientific laboratory struggle with valuing the properties and qualities of algorithms in a high-throughput setting and identifies the copresence of several (...) different styles. The question that the actors struggle with is what different configurations of algorithms, devices, and humans are “good bioscience,” that is, what do the actors perform as a good distribution of agency between algorithms and humans? A key finding is that algorithms, robots, and humans are valued in multiple ways in the same setting. For the actors, it is not apparent which configuration of agency and devices is more authoritative nor is it obvious which skills and functions should be redistributed to the algorithms. Thus, rather than tying algorithms to one set of values, such as “speed,” “precision,” or “automation,” this article demonstrates the broad utility of attending to the multivalence of algorithms and technology in practice. (shrink)

‘@AP: Breaking: Two Explosions in the White House and Barack Obama is injured’. So read a tweet sent from a hacked Associated Press Twitter account @AP, which affected financial markets, wiping out $136.5 billion of the Standard & Poor’s 500 Index’s value. While the speed of the Associated Press hack crash event and the proprietary nature of the algorithms involved make it difficult to make causal claims about the relationship between social media and trading algorithms, we argue that it (...) helps us to critically examine the volatile connections between social media, financial markets, and third parties offering human and algorithmic analysis. By analyzing the commentaries of this event, we highlight two particular currents: one formed by computational processes that mine and analyze Twitter data, and the other being financial algorithms that make automated trades and steer the stock market. We build on sociology of finance together with media theory and focus on the work of Christian Marazzi, Gabriel Tarde and Tony Sampson to analyze the relationship between social media and financial markets. We argue that Twitter and social media are becoming more powerful forces, not just because they connect people or generate new modes of participation, but because they are connecting human communicative spaces to automated computational spaces in ways that are affectively contagious and highly volatile. (shrink)

Metaheuristic algorithms are often applied to global function optimization problems. To overcome the poor real-time performance and low precision of the basic salp swarm algorithm, this paper introduces a novel hybrid algorithm inspired by the perturbation weight mechanism. The proposed perturbation weight salp swarm algorithm has the advantages of a broad search scope and a strong balance between exploration and exploitation and retains a relatively low computational complexity when dealing with numerous large-scale problems. A new coefficient factor is introduced to (...) the basic salp swarm algorithm, and new update strategies for the leader position and the followers are introduced in the search phase. The new leader position updating strategy has a specific bounded scope and strong search performance, thus accelerating the iteration process. The new follower updating strategy maintains the diversity of feasible solutions while reducing the computational load. This paper describes the application of the proposed algorithm to low-dimension and variable-dimension functions. This paper also presents iteration curves, box-plot charts, and search-path graphics to verify the accuracy of the proposed algorithm. The experimental results demonstrate that the perturbation weight salp swarm algorithm offers a better search speed and search balance than the basic salp swarm algorithm in different environments. (shrink)

To optimize the weak robustness of traditional face recognition algorithms, the classification accuracy rate is not high, the operation speed is slower, so a face recognition algorithm based on local binary pattern and stacked autoencoder is proposed. The advantage of LBP texture structure feature of the face image as the initial feature of sparse autoencoder learning, use the unified mode LBP operator to extract the histogram of the blocked face image, connect to form the LBP features of the entire (...) image. It is used as input of the stacked AE, feature extraction is done, realize the recognition and classification of face images. Experimental results show that the recognition rate of the algorithm LBP-SAE on the Yale database has achieved 99.05%, and it further shows that the algorithm has a higher recognition rate than the classic face recognition algorithm; it has strong robustness to light changes. Experimental results on the Olivetti Research Laboratory library shows that the developed method is more robust to light changes and has better recognition effects compared to traditional face recognition algorithms and standard stack AEs. (shrink)

Artificial Intelligence and algorithms are increasingly able to replace human workers in cognitively sophisticated tasks, including ones related to justice. Many governments and international organizations are discussing policies related to the application of algorithmic judges in courts. In this paper, we investigate the public perceptions of algorithmic judges. Across two experiments (N = 1,822), and an internal meta-analysis (N = 3,039), our results show that even though court users acknowledge several advantages of algorithms (i.e., cost and speed), (...) they trust human judges more and have greater intentions to go to the court when a human (vs. an algorithmic) judge adjudicates. Additionally, we demonstrate that the extent that individuals trust algorithmic and human judges depends on the nature of the case: trust for algorithmic judges is especially low when legal cases involve emotional complexities (vs. technically complex or uncomplicated cases). (shrink)

The Fast Casual Inference (FCI) algorithm searches for features common to observationally equivalent sets of causal directed acyclic graphs. It is correct in the large sample limit with probability one even if there is a possibility of hidden variables and selection bias. In the worst case, the number of conditional independence tests performed by the algorithm grows exponentially with the number of variables in the data set. This affects both the speed of the algorithm and the accuracy of the (...) algorithm on small samples, because tests of independence conditional on large numbers of variables have very low power. In this paper, I prove that the FCI algorithm can be interrupted at any stage and asked for output. The output from the interrupted algorithm is still correct with probability one in the large sample limit, although possibly less informative (in the sense that it answers “Can’t tell” for a larger number of questions) than if the FCI algorithm had been allowed to continue uninterrupted. (shrink)

Because of the lack of interaction between seeking mode cats and tracking mode cats in cat swarm optimization, its convergence speed and convergence accuracy are affected. An information interaction strategy is designed between seeking mode cats and tracking mode cats to improve the convergence speed of the CSO. To increase the diversity of each cat, a top-N learning strategy is proposed during the tracking process of tracking mode cats to improve the convergence accuracy of the CSO. On ten (...) standard test functions, the average values, standard deviations, and optimal values of the proposed algorithm with different N values are compared with the original CSO algorithm and the adaptive cat swarm algorithm based on dynamic search. Experimental results show that the global search ability and the convergence speed of the proposed algorithm are significantly improved on all test functions. The proposed two strategies will improve the convergence accuracy and convergence speed of CSO greatly. (shrink)

Simulation of complex biological systems with agent-based models is becoming more relevant with the increase in Graphics Processing Unit power. In those simulations, up to millions of virtual cells are individually computed, involving daunting processing times. An important part of computational models is the algorithm that manages how agents perceive their surroundings. This can be particularly problematic in three-dimensional environments where agents have deformable virtual membranes. This article presents a GPU algorithm that gives the possibility for agents to integrate the (...) signals scattered on their virtual membrane. It is detailed to be coded in languages like OpenCL or Cuda. Its performances are tested to show its speed with current GPU devices. Finally, it was implemented inside an existing software to test and illustrate the possibilities it offers. (shrink)

In this paper, the most common pepper noise in grayscale image noise is investigated in depth in the median filtering algorithm, and the improved median filtering algorithm, adaptive switching median filtering algorithm, and adaptive polar median filtering algorithm are applied to the OTSU algorithm. Two improved OTSU algorithms such as the adaptive switched median filter-based OTSU algorithm and the polar adaptive median filter-based OTSU algorithm are obtained. The experimental results show that the algorithm can better cope with grayscale images contaminated (...) by pretzel noise, and the segmented grayscale images are not only clear but also can better retain the detailed features of grayscale images. A genetic algorithm is a kind of search algorithm with high adaptive, fast operation speed, and good global space finding ability, and it will have a good effect when applied to the threshold finding of the OTSU algorithm. However, the traditional genetic algorithm will fall into the local optimal solution in different degrees when finding the optimal threshold. The advantages of the two interpolation methods proposed in this paper are that one is the edge grayscale image interpolation algorithm using OTSU threshold adaptive segmentation and the other is the edge grayscale image interpolation algorithm using local adaptive threshold segmentation, which can accurately divide the grayscale image region according to the characteristics of different grayscale images and effectively improve the loss of grayscale image edge detail information and jagged blur caused by the classical interpolation algorithm. The visual effect of grayscale images is enhanced by selecting grayscale images from the standard grayscale image test set and interpolating them with bilinear interpolation, bucolic interpolation, NEDI interpolation, and FEOI interpolation for interpolation simulation validation. The subjective evaluation and objective evaluation, as well as the running time, are compared, respectively, showing that the method of this paper can effectively improve the quality of grayscale image interpolation. (shrink)

PROBEX (PROBabilities from EXemplars), a model of probabilistic inference and probability judgment based on generic knowledge is presented. Its properties are that: (a) it provides an exemplar model satisfying bounded rationality; (b) it is a “lazy” algorithm that presumes no pre‐computed abstractions; (c) it implements a hybrid‐representation, similarity‐graded probability. We investigate the ecological rationality of PROBEX and find that it compares favorably with Take‐The‐Best and multiple regression (Gigerenzer, Todd, & the ABC Research Group, 1999). PROBEX is fitted to the point (...) estimates, decisions, and probability assessments by human participants. The best fit is obtained for a version that weights frequency heavily and retrieves only two exemplars. It is proposed that PROBEX implements speed and frugality in a psychologically plausible way. (shrink)

This work proposes a hybrid heuristic algorithm to solve the bus rapid transit intelligent scheduling problem, which is a combination of the genetic algorithm, simulated annealing algorithm, and fitness scaling method. The simulated annealing algorithm can increase the local search ability of the genetic algorithm, so as to accelerate its convergence speed. Fitness scaling can reduce the differences between individuals in the early stage of the algorithm, to prevent the genetic algorithm from falling into a local optimum through increasing (...) the diversity of the population. It can also increase the selection probability of outstanding individuals, and speed up the convergence at the late stage of the algorithm, by increasing the differences between individuals. Using real operational data of BRT Line 1 in a city of Zhejiang province, the new scheduling scheme can be obtained through algorithm simulation. The passengers’ total waiting time in a single way will be reduced by 40 h on average under the same operating cost compared with the original schedule scheme in a day. (shrink)

As the world keeps advancing, the need for automated interconnected devices has started to gain significance; to cater to the condition, a new concept Internet of Things has been introduced that revolves around smart devicesʼ conception. These smart devices using IoT can communicate with each other through a network to attain particular objectives, i.e., automation and intelligent decision making. IoT has enabled the users to divide their household burden with machines as these complex machines look after the environment variables and (...) control their behavior accordingly. As evident, these machines use sensors to collect vital information, which is then the complexity analyzed at a computational node that then smartly controls these devicesʼ operational behaviors. Deep learning-based guessing attack protection algorithms have been enhancing IoT security; however, it still has a critical challenge for the complex industries’ IoT networks. One of the crucial aspects of such systems is the need to have a significant training time for processing a large dataset from the networkʼs previous flow of data. Traditional deep learning approaches include decision trees, logistic regression, and support vector machines. However, it is essential to note that this convenience comes with a price that involves security vulnerabilities as IoT networks are prone to be interfered with by hackers who can access the sensor/communication data and later utilize it for malicious purposes. This paper presents the experimental study of cryptographic algorithms to classify the types of encryption algorithms into the asymmetric and asymmetric encryption algorithm. It presents a deep analysis of AES, DES, 3DES, RSA, and Blowfish based on timing complexity, size, encryption, and decryption performances. It has been assessed in terms of the guessing attack in real-time deep learning complex IoT applications. The assessment has been done using the simulation approach and it has been tested the speed of encryption and decryption of the selected encryption algorithms. For each encryption and decryption, the tests executed the same encryption using the same plaintext for five separate times, and the average time is compared. The key size used for each encryption algorithm is the maximum bytes the cipher can allow. To the comparison, the average time required to compute the algorithm by the three devices is used. For the experimental test, a set of plaintexts is used in the simulation—password-sized text and paragraph-sized text—that achieves target fair results compared to the existing algorithms in real-time deep learning networks for IoT applications. (shrink)

Music classification is conducive to online music retrieval, but the current music classification model finds it difficult to accurately identify various types of music, which makes the classification effect of the current music classification model poor. In order to improve the accuracy of music classification, a music classification model based on multifeature fusion and machine learning algorithm is proposed. First, we obtain the music signal, and then extract various features from the classification of the music signal, and use machine learning (...) algorithms to describe the type of music signal and the relationship between the features. The music classifier and deep belief network machine learning models in shallow logistic regression are established, respectively. Experiments were designed for these two models to verify the applicability of the model for music classification. By comparing the experimental results, it is found that the classification accuracy of the deep confidence network model is higher than that of the logistic regression model, but the number of iterations needed for its accuracy to converge is also higher than that of the logistic regression model. Compared with other current music classification models, this model reduces the time of constructing music classifier, speeds up the speed of music classification, and can identify various types of music with high precision. The accuracy of music classification is obviously improved, which verifies the superiority of this music classification model. (shrink)

Progress in the medical diagnostic is relentlessly pushing the measurement technology as well with its intertwined mathematical models and solutions. Mathematics has applications to many problems that are vital to human health but not for all. In this article we describe how the mathematics of acoustocerebrography has become one of the most important applications of mathematics to the problems of brain monitoring as well we will show some algebraic problems which still have to be solved. Acoustocerebrography is a set of (...) techniques of visualizing the state of brain tissue and its changes with use of ultrasounds, which mainly rely on a relation between the tissue density and speed of propagation for ultrasound waves in this medium. Propagation speed or, equivalently, times of arriving for an ultrasound pulse, can be inferred from phase relations for various frequencies. Since, due to Kramers-Kronig relations, the propagation speeds depend significantly on the frequency of investigated waves, we consider multispectral wave packages of the form W = ∑Hh=1 Ah · sin, n = 0,..., N – 1 with appropriately chosen frequencies fh, h = 1,...,H, amplifications Ah, h = 1,...,H, start phases ψh, h = 1,..., H and sampling frequency F. In this paper we show some problems of algebraic and, to some extend, algorithmic nature which raise up in this topic. Like, for instance, the influence of relations between the signal length and frequency values on the error on estimated phases or on neutralizing alien frequencies. Another problem is finding appropriate initial phases for avoiding improper distributions of peaks in the resulting signal or finding a stable algorithm of phase unwinding which is resistant to sudden random disruptions. (shrink)

Road link speed is one of the important indicators for traffic states. In order to incorporate the spatiotemporal dynamics and correlation characteristics of road links into speed prediction, this paper proposes a method based on LDA and GCN. First, we construct a trajectory dataset from map-matched GPS location data of taxis. Then, we use the LDA algorithm to extract the semantic function vectors of urban zones and quantify the spatial dynamic characteristics of road links based on taxi trajectories. (...) Finally, we add semantic function vectors to the dataset and train a graph convolutional network to learn the spatial and temporal dependencies of road links. The learned model is used to predict the future speed of road links. The proposed method is compared with six baseline models on the same dataset generated by GPS equipped on taxis in Shenzhen, China, and the results show that our method has better prediction performance when semantic zoning information is added. Both composite and single-valued semantic zoning information can improve the performance of graph convolutional networks by 6.46% and 8.35%, respectively, while the baseline machine learning models work only for single-valued semantic zoning information on the experimental dataset. (shrink)

This paper applies a proposed modified stochastic fractal search algorithm (MSFS) for dealing with all constraints of optimal reactive power dispatch (ORPD) and finding optimal solutions for three different cases including power loss optimization, voltage deviation optimization, and L-index optimization. The proposed MSFS method is newly constructed in the paper by modifying three new solution update mechanisms on standard stochastic fractal search algorithm (SSFS). The first modification is to keep only one formula and abandon one formula in the diffusion process (...) while the second modification and the third modification are used in the first update and the second update. In two updates of SSFS, solutions with low quality are updated with high probability while other solutions with high quality do not get chances to be updated. This manner results in the fact that some promising solutions around the high quality solutions can be missed. In order to tackle this restriction, the second modification of MSFS is to newly update the worst solutions in the first update and the best solutions in the second update. In the third modification, all existing formulas of SSFS in the two updates are abandoned and the same new proposed technique is used for updating such solutions in two updates. Compared to SSFS, the three modifications can bring advantages to MSFS such as using smaller number of produced solutions per iteration, spending shorter execution time, finding better optimal solutions, and owning more stable search ability. Furthermore, the proposed method also sees its effectiveness and robustness over SSFS by testing on IEEE 30-bus system and IEEE 118-bus system with three different single objectives for each system. The proposed method can find less minimum, average, and maximum for all the cases in addition to faster search speed. Besides, the proposed method is also compared to other methods such as PSO-based method group, GA-based method group, DE-based method group, and other recent methods. Result comparisons also indicate that the proposed method can be more efficient than almost all these methods with respect to less minimum and smaller values of control parameters. As a result, evaluation of the performance of the proposed method is that it should be used for seeking solutions of ORPD problem. (shrink)

The computer distance teaching system teaches through the network, and there is no entrance threshold. Any student who is willing to study can log in to the network computer distance teaching system for study at any free time. Neural network has a strong self-learning ability and is an important part of artificial intelligence research. Based on this study, a neural network-embedded architecture based on shared memory and bus structure is proposed. By looking for an alternative method of exp function to (...) improve the speed of radial basis function algorithm, and then by analyzing the judgment conditions in the main loop during the algorithm process, these judgment conditions are modified conditionally to reduce the calculation scale, which can double the speed of the algorithm. Finally, this article verifies the function, performance, and interface of the computer distance education system. (shrink)

Parallel attribute reduction is one of the most important topics in current research on rough set theory. Although some parallel algorithms were well documented, most of them are still faced with some challenges for effectively dealing with the complex heterogeneous data including categorical and numerical attributes. Aiming at this problem, a novel attribute reduction algorithm based on neighborhood multigranulation rough sets was developed to process the massive heterogeneous data in the parallel way. The MapReduce-based parallelization method for attribute reduction was (...) proposed in the framework of neighborhood multigranulation rough sets. To improve the reduction efficiency, the hashing Map/Reduce functions were designed to speed up the positive region calculation. Thereafter, a quick parallel attribute reduction algorithm using MapReduce was developed. The effectiveness and superiority of this parallel algorithm were demonstrated by theoretical analysis and comparison experiments. (shrink)

In recent years, with the rapid development of computer storage capabilities and network transmission capabilities, users can easily share their own video and image information on social networking sites, and the amount of multimedia data on the network is rapidly increasing. With the continuous increase of the amount of data in the network, the establishment of effective automated data management methods and search methods has become an increasingly urgent need. This paper proposes a retrieval method of human motion data based (...) on motion capture in index space. By extracting key frames from the original motion to perform horizontal dimensionality reduction and defining features based on Laban motion analysis, the motion segment is subjected to vertical feature dimensionality reduction. After extracting features from the input motion segment, motion matching is performed on the index space. This paper designs the optimization method of the phased dynamic time deformation algorithm in time efficiency and analyzes the optimization method of the phased dynamic time deformation algorithm in time complexity. Considering the time efficiency redundancy, this paper optimizes the time complexity of the phased dynamic time deformation method. This improves the time efficiency of the staged dynamic time warping algorithm, making it suitable for larger-scale human motion data problems. Experiments show that the method in this paper has the advantage of speed, is more in line with the semantics of human motion, and can meet the retrieval requirements of human motion databases. (shrink)

In many real-life situations, we are interested in the value of a physical quantity y that is difficult or impossible to measure directly. To estimate y, we find some easier-to-measure quantities x1, … , xn which are related to y by a known relation y = f. Measurements are never 100% accurate; hence, the measured values equation image are different from xi, and the resulting estimate equation image is different from the desired value y = f. How different can it (...) be? Traditional engineering approach to error estimation in data processing assumes that we know the probabilities of different measurement errors equation image. In many practical situations, we only know the upper bound Δi for this error; hence, after the measurement, the only information that we have about xi is that it belongs to the interval equation image. In this case, it is important to find the range y of all possible values of y = f when xi ∈ xi. We start the paper with a brief overview of the computational complexity of the corresponding interval computation problems: Most of the related problems turn out to be, in general, at least NP-hard. In this paper, we show how the use of quantum computing can speed up some computations related to interval and probabilistic uncertainty. We end the paper with speculations on whether “hypothetic” physical devices can compute NP-hard problems faster than in exponential time. Most of the paper's results were first presented at NAFIPS'2003 [30]. (shrink)

In this paper, a concise robust control law based on Backstepping for marine engine speed regulation is presented with the uniform asymptotic stability of the closed-loop system proved by Lyapunov synthesis, and the control parameters have obvious physical meaning. Furthermore, parameter determination method is given by virtue of closed-loop gain shaping algorithm. To overcome the perturbation due to load or interference change, variable universe fuzzy inference is introduced to optimize the control system on-line. Compared with the existing research literature, (...) the design method and performance of the controller are more in line with the ocean engineering practice. The results of the simulations of the proposed controller are presented and compared. (shrink)

Ultra-short-term wind speed prediction can assist the operation and scheduling of wind turbines in the short term and further reduce the adverse effects of wind power integration. However, as wind is irregular, nonlinear, and nonstationary, to accurately predict wind speed is a difficult task. To this end, researchers have made many attempts; however, they often use only point forecasting or interval forecasting, resulting in imperfect prediction results. Therefore, in this paper, we developed a prediction system integrating an advanced (...) data preprocessing strategy, a novel optimization model, and multiple prediction algorithms. This combined forecasting system can overcome the inherent disadvantages of the traditional forecasting methods and further improve the prediction performance. To test the effectiveness of the forecasting system, the 10-min and one-hour wind speed sequences from the Sotavento wind farm in Spain were applied for conducting comparison experiments. The results of both the interval forecasting and point forecasting indicated that, in terms of the forecasting capability and stability, the proposed system was better than the compared models. Therefore, because of the minimum prediction error and excellent generalization ability, we consider this forecasting system to be an effective tool to assist smart grid programming. (shrink)

The N-Queens problem plays an important role in academic research and practical application. Heuristic algorithm is often used to solve variant 2 of the N-Queens problem. In the process of solving, evaluation of the candidate solution, namely, fitness function, often occupies the vast majority of running time and becomes the key to improve speed. In this paper, three parallel schemes based on CPU and four parallel schemes based on GPU are proposed, and a serial scheme is implemented at the (...) baseline. The experimental results show that, for a large-scale N-Queens problem, the coarse-grained GPU scheme achieved a maximum 307-fold speedup over a single-threaded CPU counterpart in evaluating a candidate solution. When the coarse-grained GPU scheme is applied to simulated annealing in solving N-Queens problem variant 2 with a problem size no more than 3000, the speedup is up to 9.3. (shrink)

Neural network models have recently made significant achievements in solving vehicle scheduling problems. Adaptive ant colony algorithm provides a new idea for neural networks to solve complex system problems of multiconstrained network intensive vehicle routing models. The pheromone in the path is changed by adjusting the volatile factors in the operation process adaptively. It effectively overcomes the tendency of the traditional ant colony algorithm to fall easily into the local optimal solution and slow convergence speed to search for the (...) global optimal solution. The multiconstrained network intensive vehicle routing algorithm based on adaptive ant colony algorithm in this paper refers to the interaction between groups. Adaptive transfer and pheromone update strategies are introduced based on the traditional ant colony algorithm to optimize the selection, update, and coordination mechanisms of the algorithm further. Thus, the search task of the objective function for a feasible solution is completed by the search ants. Through the division and collaboration of different kinds of ants, pheromone adaptive strategy is combined with polymorphic ant colony algorithm. It can effectively overcome some disadvantages, such as premature stagnation, and has a theoretical significance to the study of large-scale multiconstrained vehicle routing problems in complex traffic network systems. (shrink)

In this article we expand upon the conceptual framework of Félix Guattari’s 1989 essay, The Three Ecologies. Here Guattari examines changes in subjectivity that have come about due to scientific and technological advances which, as he sees it, brought about an “ecological disequilibrium” ([1989]2000, 27) and deteriorated individual and collective modes of being. In response to this Guattari proposes a kind of holistic therapy or ‘ecosophy’ between three ecological registers: “the environment, social relations and human subjectivity” (ibid., 28). Guattari cautions (...) that we not only take note of these macro determinations, but also heed the libidinal impulses of desire – what captures it, what directs it, and what shuts it down. Since the publication of The Three Ecologies, the rise of digital technologies has dramatically influenced the ways in which people think, live and communicate. Technological infrastructures, for instance, are used to spread disinformation at a vast speed and scale, and because social networks are often homophile many people infrequently encounter critical disagreement and debate. The increase in media and digital communications usage has also led to new forms of social inclusion and exclusion, the most exacerbated form of which is probably the phenomenon known as hikikomori – acute, prolonged social withdrawal. Taking hikikomori as our focus, we describe what we see as a general set of symptoms of society and trace its myriad intersections with an ever-increasing algorithmic ubiquity, which we posit as the new form of hyper-modulation following from Foucault’s disciplinary societies and Deleuze’s control societies. (shrink)

Harmony Search Algorithm (HSA) is an evolutionary algorithm which mimics the process of music improvisation to obtain a nice harmony. The algorithm has been successfully applied to solve optimization problems in different domains. A significant shortcoming of the algorithm is inadequate exploitation when trying to solve complex problems. The algorithm relies on three operators for performing improvisation: memory consideration, pitch adjustment, and random consideration. In order to improve algorithm efficiency, we use roulette wheel and tournament selection in memory consideration, replace (...) the pitch adjustment and random consideration with a modified polynomial mutation, and enhance the obtained new harmony with a modified β-hill climbing algorithm. Such modification can help to maintain the diversity and enhance the convergence speed of the modified HS algorithm. β-hill climbing is a recently introduced local search algorithm that is able to effectively solve different optimization problems. β-hill climbing is utilized in the modified HS algorithm as a local search technique to improve the generated solution by HS. Two algorithms are proposed: the first one is called PHSβ–HC and the second one is called Imp. PHSβ–HC. The two algorithms are evaluated using 13 global optimization classical benchmark function with various ranges and complexities. The proposed algorithms are compared against five other HSA using the same test functions. Using Friedman test, the two proposed algorithms ranked 2nd (Imp. PHSβ–HC) and 3rd (PHSβ–HC). Furthermore, the two proposed algorithms are compared against four versions of particle swarm optimization (PSO). The results show that the proposed PHSβ–HC algorithm generates the best results for three test functions. In addition, the proposed Imp. PHSβ–HC algorithm is able to overcome the other algorithms for two test functions. Finally, the two proposed algorithms are compared with four variations of differential evolution (DE). The proposed PHSβ–HC algorithm produces the best results for three test functions, and the proposed Imp. PHSβ–HC algorithm outperforms the other algorithms for two test functions. In a nutshell, the two modified HSA are considered as an efficient extension to HSA which can be used to solve several optimization applications in the future. (shrink)

The swarm intelligence algorithm simulates the behavior of animal populations in nature and is a new type of intelligent solution that is different from traditional artificial intelligence. Feature selection is a very common data dimensionality reduction method, which requires us to select the feature subset with the best evaluation criteria from the original feature set. Feature selection, as an effective data processing method, has become a hot research topic in the fields of machine learning, pattern recognition, and data mining and (...) has received extensive attention and attention. In order to verify the improvement effect of the feature selection algorithm based on the swarm intelligence algorithm on the data, this paper conducts experiments on six classes in the city’s first middle school with similar conditions. First, count the current situation of the students in the class, then divide them into classes, use different algorithms to teach them, and count the changes of the students after a period of teaching. The experiment found that the performance of students under the feature selection algorithm is about 30% higher than other teaching methods, and the awareness of cooperation between students reaches 0.8. It solves the contradiction between popularization and improvement and solves the problems of polarization and transformation of underachievers. The individuality of the algorithm has been fully utilized and developed. The test results show that the improved algorithm has faster convergence speed and higher solution accuracy, and the feature selection algorithm based on swarm intelligence algorithm can effectively improve the efficiency of the algorithm. (shrink)

This book explores the ethical problems of algorithmic bias and its potential impact on populations that experience health disparities by examining the historical underpinnings of explicit and implicit bias, the influence of the social determinants of health, and the inclusion of racial and ethnic minorities in data. Over the last twenty-five years, the diagnosis and treatment of disease have advanced at breakneck speeds. Currently, we have technologies that have revolutionized the practice of medicine, such as telemedicine, precision medicine, big (...) data, and AI. These technologies, especially AI, promise to improve the quality of patient care, lower health care costs, improve patient treatment outcomes, and decrease patient mortality. AI may also be a tool that reduces health disparities; however, algorithmic bias may impede its success. This book explores the risks of using AI in the context of health disparities. It is of interest to health services researchers, ethicists, policy analysts, social scientists, health disparities researchers, and AI policy makers. (shrink)

The diversities in the natural, social, and human environment of various regions often lead to the differences in their regional economic development level and industrial structure and layout; moderate regional differences can mobilize economic vitality and improve development efficiency, but excessive differences may lead to social instability or even turbulence. Intelligent algorithms or their improved and hybrid algorithms can recently achieve more suitable solutions to practical problems of nonlinear, discrete, nondifferentiable, and multiple constraints. Therefore, this paper's main point is on (...) the analysis of regional economic development differences based on intelligent hybrid algorithms. On the basis of summarizing and analyzing previous research works, this paper expounded the research status and significance of regional economic development differences analysis, elaborated the development background, current status, and future challenges of intelligent hybrid algorithms, introduced the methods and principles of principal component distance weighting algorithm and sequential quadratic programming algorithm, constructed a basic model for regional economic development differences based on intelligent hybrid algorithm, conducted the construction of analysis index system and the hybrid of intelligence algorithm, analyzed the regional economic development differences based on intelligent hybrid algorithm, performed the principal component analysis and time-space change analysis of regional economic development, and finally carried out a simulation experiment and its result analysis. The study results show that the intelligent hybrid algorithm can simulate the intelligent behavior of certain groups in nature when analyzing the differences in regional economic development, so that it has essentially parallelism, high accuracy, and convergence speed. The study results of this paper provide a reference for further researches on the regional economic development differences analysis based on intelligent hybrid algorithm. (shrink)

Aiming at the problem that it is difficult to balance the speed and accuracy of human behaviour recognition, this paper proposes a method of motion recognition based on random projection. Firstly, the optical flow picture and Red, Green, Blue picture obtained by the Lucas-Kanade algorithm are used. Secondly, the data of optical flow pictures and RGB pictures are compressed based on a random projection matrix of compressed sensing, which effectively reduces power consumption. At the same time, based on random (...) projection compression data, it can effectively find the optimal linear representation to reconstruct training samples and test samples. Thirdly, a multichannel 3D convolutional neural network is proposed, and the multiple information extracted by the network is fused to form an output recognizer. Experimental results show that the algorithm in this paper significantly improves the recognition rate of multicategory actions and effectively reduces the computational complexity and running time of the recognition algorithm. (shrink)

In this paper, we propose an adaptive Gaussian incremental expectation stadium parameter estimation algorithm for sports video analysis and prediction through the study and analysis of sports videos. The features with more discriminative power are selected from the set of positive and negative templates using a feature selection mechanism, and a sparse discriminative model is constructed by combining a confidence value metric strategy. The sparse generative model is constructed by combining L1 regularization and subspace representation, which retains sufficient representational power (...) while dealing with outliers. To overcome the shortcomings of the traditional multiplicative fusion mechanism, this paper proposes an adaptive selection mechanism based on Euclidean distance, which aims to detect deteriorating models in time during the dynamic tracking process and adopt corresponding strategies to construct more reasonable likelihood functions. Based on the Bayesian citation framework, the adaptive selection mechanism is used to combine the sparse discriminative model and the sparse generative model. Also, different online updating strategies are adopted for the template set and Principal Component Analysis subspace to alleviate the drift problem while ensuring that the algorithm can adapt to the changes of target appearance in the dynamic tracking environment. Through quantitative and qualitative evaluation of the experimental results, it is verified that the algorithm proposed in this paper has stronger robustness compared with other classical algorithms. Our proposed visual object tracking algorithm not only outperforms existing visual object tracking algorithms in terms of accuracy, success rate, accuracy, and robustness but also achieve the performance required for real-time tracking in terms of execution speed on the central processing unit. This paper provides an in-depth analysis and discussion of the adaptive Gaussian incremental expectation stadium parameter estimation algorithm for sports video analysis. Using a variety of county-level algorithms for analysis and multiple solutions to improve the accuracy of the results, we obtain a more efficient and accurate algorithm. (shrink)

This paper combines domestic and international research results to analyze and study the difference between the attribute features of English phrase speech and noise to enhance the short-time energy, which is used to improve the threshold judgment sensitivity; noise addition to the discrepancy data set is used to enhance the recognition robustness. The backpropagation algorithm is improved to constrain the range of weight variation, avoid oscillation phenomenon, and shorten the training time. In the real English phrase sound recognition system, there (...) are problems such as massive training data and low training efficiency caused by the super large-scale model parameters of the convolutional neural network. To address these problems, the NWBP algorithm is based on the oscillation phenomenon that tends to occur when searching for the minimum error value in the late training period of the network parameters, using the K-MEANS algorithm to obtain the seed nodes that approach the minimal error value, and using the boundary value rule to reduce the range of weight change to reduce the oscillation phenomenon so that the network error converges as soon as possible and improve the training efficiency. Through simulation experiments, the NWBP algorithm improves the degree of fitting and convergence speed in the training of complex convolutional neural networks compared with other algorithms, reduces the redundant computation, and shortens the training time to a certain extent, and the algorithm has the advantage of accelerating the convergence of the network compared with simple networks. The word tree constraint and its efficient storage structure are introduced, which improves the storage efficiency of the word tree constraint and the retrieval efficiency in the English phrase recognition search. (shrink)

At present, the motion control algorithms of lower limb exoskeleton robots have errors in tracking the desired trajectory of human hip and knee joints, which leads to poor follow-up performance of the human-machine system. Therefore, an iterative learning control algorithm is proposed to track the desired trajectory of human hip and knee joints. In this paper, the experimental platform of lower limb exoskeleton rehabilitation robot is built, and the control system software and hardware design and robot prototype function test are (...) carried out. On this basis, a series of experiments are carried out to verify the rationality of the robot structure and the feasibility of the control method. Firstly, the dynamic model of the lower limb exoskeleton robot is established based on the structure analysis of the human lower limb; secondly, the servo control model of the lower limb exoskeleton robot is established based on the iterative learning control algorithm; finally, the exponential gain closed-loop system is designed by using MATLAB software. The relationship between convergence speed and spectral radius is analyzed, and the expected trajectory of hip joint and knee joint is obtained. The simulation results show that the algorithm can effectively improve the gait tracking accuracy of the lower limb exoskeleton robot and improve the follow-up performance of the human-machine system. (shrink)

In order to improve the integrity of the social network behavior feature extraction results for sports college students, this study proposes to be based on the clustering algorithm. This study analyzes the social network information dissemination mechanism in the field of college students’ sports, obtains the real-time social behavior data in the network environment combined with the analysis results, and processes the obtained social network behavior data from two aspects of data cleaning and de-duplication. Using clustering algorithm to determine the (...) type of social network user behavior, setting the characteristics of social network behavior attributes, and finally through quantitative and standardized processing, get the results of college students’ sports field social network behavior characteristics extraction. The experimental results showed that the completeness of the method feature extraction results improved to 9.93%, and the average extraction time cost was 0.344 s, with high result integrity and obvious advantages in the extraction speed. (shrink)

This paper presents an in-depth analysis of tennis match scene classification using an adaptive Gaussian mixture model parameter estimation simulation algorithm. We divided the main components of semantic analysis into type of motion, distance of motion, speed of motion, and landing area of the tennis ball. Firstly, for the problem that both people and tennis balls in the video frames of tennis matches from the surveillance viewpoint are very small, we propose an adaptive Gaussian mixture model parameter estimation algorithm, (...) which has good accuracy and speed on small targets. Secondly, in this paper, we design a sports player tracking algorithm based on role division and continuously lock the target player to be tracked and output the player region. At the same time, based on the displacement information of the key points of the player’s body and the system running time, the distance and speed of the player’s movement are obtained. Then, for the problem that tennis balls are small and difficult to capture in high-speed motion, this paper designs a prior knowledge-based algorithm for predicting tennis ball motion and landing area to derive the landing area of tennis balls. Finally, this paper implements a prototype system for semantic analysis of real-time video of tennis matches and tests and analyzes the performance indexes of the system, and the results show that the system has good performance in real-time, accuracy, and stability. (shrink)

The early warning of financial risk is to identify and analyze existing financial risk factors, determine the possibility and severity of occurring risks, and provide scientific basis for risk prevention and management. The fragility of financial system and the destructiveness of financial crisis make it extremely important to build a good financial risk early-warning mechanism. The main idea of the K-means clustering algorithm is to gradually optimize clustering results and constantly redistribute target dataset to each clustering center to obtain optimal (...) solution; its biggest advantage lies in its simplicity, speed, and objectivity, being widely used in many research fields such as data processing, image recognition, market analysis, and risk evaluation. On the basis of summarizing and analyzing previous research works, this paper expounded the current research status and significance of financial risk early-warning, elaborated the development background, current status and future challenges of the K-means clustering algorithm, introduced the related works of similarity measure and item clustering, proposed a financial risk indicator system based on the K-means clustering algorithm, performed indicator selection and data processing, constructed a financial risk early-warning model based on the K-means clustering algorithm, conducted the classification of financial risk types and optimization of financial risk control, and finally carried out an empirical experiments and its result analysis. The study results show that the K-means clustering method can effectively avoid the subjective negative impact caused by artificial division thresholds, continuously optimize the prediction process of financial risk and redistribute target dataset to each cluster center for obtaining optimized solution, so the algorithm can more accurately and objectively distinguish the state interval of different financial risks, determine risk occurrence possibility and its severity, and provide a scientific basis for risk prevention and management. The study results of this paper provide a reference for further researches on financial risk early-warning based on K-means clustering algorithm. (shrink)

This study investigates how speed of motion is processed in language. In three eye-tracking experiments, participants were presented with visual scenes and spoken sentences describing fast or slow events (e.g., The lion ambled/dashed to the balloon). Results showed that looking time to relevant objects in the visual scene was affected by the speed of verb of the sentence, speaking rate, and configuration of a supporting visual scene. The results provide novel evidence for the mental simulation of speed (...) in language and show that internal dynamic simulations can be played out via eye movements toward a static visual scene. (shrink)

Evapotranspiration represents the water requirement of plants during their growing season, and its accurate measurement at the farm is essential for agricultural water planners and managers. Field measurements of evapotranspiration have always been associated with many difficulties that have led researchers to seek a way to remotely measure this component in horticultural and agricultural areas. This study aims to investigate an indirect approach for daily rice crop evapotranspiration measurement by machine learning techniques and the least available climatic variables. For this (...) purpose, daily meteorological variables were obtained from three ground meteorological stations in rice cultivation regions of northern Iran during 2003–2016. The ETc rates were calculated by seven meteorological variables, the FAO-56 Penman-Monteith equation, and the regional calibrated rice crop coefficient and considered as the reference data. The MLs, including Multilayer Perceptron, Radial Basis Function, Generalized Regression Neural Network, and Group Method of Data Handling, were utilized for ETc modeling. Different input combinations were applied, based on the use of minimum effective variables as input. Results showed that the models showed the most accurate performances in the input combination of four climatic variables: sunshine duration, maximum temperature, relative humidity, and wind speed. Investigating the accuracy of models in rice growth phases showed that the least estimation error belonged to the initial growing stage, which increased during the mid-season and late-season growing stages. A comparison of the models showed that the GMDH model performed better against the other competitors. For this model, both the Nash-Sutcliffe coefficient and R2 were greater than 0.98, and the Root Mean Square Error ranged between 0.214 and 0.234 mm per day in all stations. The current approach showed promising results in rice evapotranspiration modeling by only four common meteorological variables and can be reliably applied for indirect measurement of this variable over the rice farms. The studied approach will have research value for rice and other crops in similar/different climatic conditions. (shrink)

At present, there is a wide variety of tourism resources on the Internet. Tourism management departments must monitor these resources. At the same time, tourists must also retrieve personalized information that they are interested in. This requires a lot of time and energy. This essay studies and implements the tourism network resource monitoring system. The main work completed in the thesis proposes and constructs a topic collection algorithm and establishes a starting point, topic keywords, and a prediction mechanism. The algorithm (...) includes three stages: the first climbing stage, the learning stage, and the continuous climbing stage. Open category directory search is used for similarity judgment and result evaluation. The experimental results show that with the continuous execution of the crawling process, the collection speed of related pages is getting faster and faster. We propose an algorithm for the extraction of wood based on the density of Internet tourism resources. The algorithm calculates the ratio of Internet tourism resource labels by row and uses a threshold extraction algorithm to distinguish area from private non-Internet tourism resource area. Experimental results show that the algorithm can successfully extract the main content of the article from a wide variety of web pages. This thesis takes the monitoring of tourism network resources as the research object and establishes a tourism network resource monitoring system, which can provide users with customizable, all-round, and real-time tourism network resource collection, extraction, and retrieval services so as to monitor tourism resources. The research results of this article can promote the construction of tourism informatization and can help users grasp the latest tourism information, thereby bringing great convenience to tourism. The system only downloads travel-related information through the use of topic collection technology, reducing the interference of irrelevant redundant web pages. (shrink)

The accurate positioning of target is an important link in robot technology. Based on machine learning algorithm, this study firstly analyzed the location positioning principle of binocular vision of robot, then extracted features of the target using speeded-up robust features (SURF) method, positioned the location using Back Propagation Neural Networks (BPNN) method, and tested the method through experiments. The experimental results showed that the feature extraction of SURF method was fast, about 0.2 s, and was less affected by noise. It (...) was found from the positioning results that the output position of the BPNN method was basically consistent with the actual position, and errors in X, Y and Z directions were very small, which could meet the positioning needs of the robot. The experimental results verify the effectiveness of machine learning method and provide some theoretical support for its further promotion and application in practice. (shrink)

For the application of the standard genetic algorithm in illustration art design, there are still problems such as low search efficiency and high complexity. This paper proposes an illustration art design model based on operator and clustering optimization genetic algorithm. First, during the operation of the genetic algorithm, the values of the crossover probability and the mutation probability are dynamically adjusted according to the characteristics of the population to improve the search efficiency of the algorithm, then the k-medoids algorithm is (...) introduced to optimize the clustering of the genetic algorithm, and a cost function is used to carry out and evaluate the quality of clustering to optimize the complexity of the original algorithm. In addition, a multiobjective optimization genetic algorithm with complex constraints based on group classification is proposed. This algorithm focuses on the problem of group diversity and uses k-means cluster analysis operation to solve the problem of group diversity. The algorithm divides the entire group into four subgroups and assigns appropriate fitness values to reflect the optimal preservation strategy. A large number of computer simulation calculations show that the algorithm can obtain a widely distributed and uniform Pareto optimal solution, the evolution speed is fast, usually only a few iterations can achieve a good optimization effect, and finally the improved genetic algorithm is used to design the random illustration art. The example simulation shows that the improved algorithm proposed in this paper can achieve higher artistic and innovative illustration art design. (shrink)