Soft tissue deformation has become bottle-neckt in Visual Surgery technique. Based on the review of the current deformation methods and the analysis of soft tissue biology mechanics characteristic, the simple style ma...
详细信息
Sentiment analysis is one of the most popular natural language processing techniques. It aims to identify the sentiment polarity (positive, negative, neutral or mixed) within a given text. the proper lexicon knowledge...
详细信息
ISBN:
(纸本)9781509059102
Sentiment analysis is one of the most popular natural language processing techniques. It aims to identify the sentiment polarity (positive, negative, neutral or mixed) within a given text. the proper lexicon knowledge is very important for the lexicon-based sentiment analysis methods since they hinge on using the polarity of the lexical item to determine a text's sentiment polarity. However, it is quite common that some lexical items appear positive in the text of one domain but appear negative in another. In this paper, we propose an innovative knowledge building algorithm to extract sentiment lexicon knowledge through computing their polarity value based on their polarity distribution in text dataset, such as in a set of domain specific reviews. the proposed algorithm was tested by a set of domain microblogs. the results demonstrate the effectiveness of the proposed method. the proposed lexicon knowledge extraction method can enhance the performance of knowledge based sentiment analysis.
the proceedings contain 44 papers. the topics discussed include: practical considerations in training extreme learning machines;enhancing the Levenberg-Marquardt method in neural network training using the direct comp...
详细信息
the proceedings contain 44 papers. the topics discussed include: practical considerations in training extreme learning machines;enhancing the Levenberg-Marquardt method in neural network training using the direct computation of the error cost function;analysis of electricity bill data using interactive dimensionality reduction;characterization of DEM particles by means of artificial neural networks and macroscopic experiments;exploiting the use of ensemble classifiers to enhance the precision of user's emotion classification;a 24-h forecast of solar irradiance using echo state neural networks;horizon of neural network prediction of relativistic electrons flux in the outer radiation belt of the earth;seasonality of human behavior in smart buildings;a novel machine learning data preprocessing method for enhancing classification algorithms performance;and comparison of three classifiers for breast cancer outcome prediction.
Large scale terrain visualization with high-resolution has an increasing demand in many research fields. To realize the efficient rendering of terrain, this paper presents an out-of-core terrain visualization method b...
详细信息
the paper summarizes the computation results of the Riemann Zeta Search Project. the aim of the project was to find extremely large values of the Riemann zeta function on the critical line. the computing method is bas...
详细信息
ISBN:
(纸本)9781728106250
the paper summarizes the computation results of the Riemann Zeta Search Project. the aim of the project was to find extremely large values of the Riemann zeta function on the critical line. the computing method is based on the RS-PEAK algorithm which was presented in the 16th SYNASC conference in 2014. the computation environment was served by the SZTAKI Desktop Grid operated by the Laboratory of Parallel and Distributed Systems at the Hungarian Academy of Sciences. Applying the RS-Peak algorithm 5597001 candidates were found where large values of the Riemann-Siegel Zfunction are expected. the largest known values are presented and published on the project website https://***.
Withthe scaling up of high performance computers, resilience has become a big challenge. Among various kinds of software-based fault-tolerant approaches, the algorithm-based fault tolerance (ABFT) has some attractive...
详细信息
ISBN:
(纸本)9781538666142
Withthe scaling up of high performance computers, resilience has become a big challenge. Among various kinds of software-based fault-tolerant approaches, the algorithm-based fault tolerance (ABFT) has some attractive characteristics in the era of exa-scale systems, such as high efficiency and light-weight. In particular, considering that many engineering and scientific applications rely on some fundamental algorithms, it is possible to provide algorithm-based fault-tolerant mechanisms in low level and make it application-independent. Previous fault-tolerant mechanisms for matrix computation use row and column checksums, which cannot be directly used in large-scale parallel systems. this paper proposes an algorithm-based fault tolerant approach for matrix multiplication on large-scale parallel systems. the mechanism uses block-checksum which not only meets the requirement of matrix computations on large-scale parallel systems but also reduces the overhead of fault-tolerance compared to traditional schemes based on row and column checksums. In addition, this paper gives method for choosing the size of blocks to achieve balance between accuracy and efficiency. the complexity analysis and examples demonstrate effectiveness and feasibility of our approach.
computation offloading (often to external computing resources over a network) has become a necessity for modern applications. At the same time, the proliferation of machine learning techniques has empowered malicious ...
详细信息
ISBN:
(纸本)9798350304817
computation offloading (often to external computing resources over a network) has become a necessity for modern applications. At the same time, the proliferation of machine learning techniques has empowered malicious actors to use such techniques in order to breach the privacy of the execution process for offloaded computations. this can enable malicious actors to identify offloaded computations and infer their nature based on computation characteristics that they may have access to even if they do not have direct access to the computation code. In this paper, we first demonstrate that even non-sophisticated machine learning algorithms can accurately identify offloaded computations. We then explore the design space of anonymizing offloaded computations through the realization of a framework, called Camouflage. Camouflage features practical mechanisms to conceal characteristics related to the execution of computations, which can be used by malicious actors to identify computations and orchestrate further attacks based on identified computations. Our evaluation demonstrated that Camouflage can impede the ability of malicious actors to identify executed computations by up to 60%, while incurring modest overheads for the anonymization of computations.
As the global data quantity already follows an exponential trend, machine learning has become present in every application, creating a great demand for general know-how, be it data scientists or computer scientists wi...
详细信息
ISBN:
(数字)9781728190808
ISBN:
(纸本)9781728190808
As the global data quantity already follows an exponential trend, machine learning has become present in every application, creating a great demand for general know-how, be it data scientists or computer scientists with related knowledge. Currently, the demand for work to be done surpasses the offer of such professionals, thus automatic solutions have to be found. the classical machine learning process involves data engineering, model selection, and hyperparameter tuning for the chosen model. Due to the highly repetitive nature of trial and error of these tasks, automation can play a big role in optimizing time spent on them. Automated Machine Learning comes to help the process by adding different optimization techniques that help data scientists be more productive and achieve similar or better results in a shorter time. this paper provides a novel approach to Automated Machine Learning using Evolutionary algorithms and proves Its performance by presenting top results in benchmark tests.
Tracking of multiple ground targets with airborne Ground Moving Target Indicator (GMTI) sensor measurements is a challenging problem where heavy and dense false alarms with high target density are inevitably encounter...
详细信息
ISBN:
(纸本)9786058631113
Tracking of multiple ground targets with airborne Ground Moving Target Indicator (GMTI) sensor measurements is a challenging problem where heavy and dense false alarms with high target density are inevitably encountered in the surveillance scenes. Hence, optimal approaches require heavy computational load where the duration of overall computation rises exponentially withthe number of target tracks and measurements in observation per scan. Consequently, more practical suboptimal approaches, such as Linear Multi-Target (LM) approach, is explored due to linear number of operations in the number of target tracks with a negligible performance loss compared to optimal approaches. Although LM approach performs modestly adequate with significantly less computation duration than optimal approaches, it is highly susceptible to track loss, as in the rest of suboptimal approaches, when the targets are closely spaced and the number of targets and measurements are considerably high. Simulations are carried out in realistic test scenarios to compare single target tracking algorithms including IMM-PDA and IMM-IPDA algorithms;Optimal approaches in multitarget tracking including IMM-JPDA, IMM-IJPDA and IMM-JIPDA algorithms and an example of Linear Multi-target approaches in multitarget tracking including IMM-LMIPDA algorithm. Benchmarkings of these algorithms are done under RMSE performance, track loss and computation time evaluation results.
暂无评论