Preprint
|
|
Mathematics & Computer Science, Probability and Statistics; Risk, Security, Linear programming, Nasarawa Eggon and CSRA
Online: 13 December 2018 (09:45:41 CET)
|
|
Share this article with
×
This research work focused on the risks we are faced with on our day to day activities, either directly or indirectly, which can gradually accumulates and results to communal crisis, religious crisis, socio-economic agitations and tribal crises. Nasarawa Eggon Local Government Area of Nasarawa State was used as case study and a well structure close–ended questionnaire was used for data collection as it relates to Controlled Self Risk Assessment (CSRA) and linear programming technique was used to analyze. The results proved that many of this processes were neglected in these communities, making them to be prone to incessant communal crisis. The study recommend that Government should strongly, as a matter of urgency address the unemployment rate, distribution of political position, schools, primary health care and equip security personnel with the modern technology facilities, which happen to record the highest risk level.
Preprint
|
|
Mathematics & Computer Science, Probability and Statistics; Determinants, Unemployment Rate, OLS, FMOLS, ECM
Online: 12 December 2018 (11:44:03 CET)
|
|
Share this article with
×
This study employed the Fully Modified Ordinary Least Squares (FMOLS) and the Error Correction Model (ECM) to investigate the long-run and short-run determinants of unemployment rate in Nigeria. To achieve this annual data on unemployment rate, inflation rate, interest rate, exchange rate and population growth from 1981 to 2016 was collected from Central Bank Statistical Bulletins and the World Bank website. The ADF test revealed that the macroeconomic variables are stationary at first difference while the Cointegration test revealed that the variables are cointegrated. Using unemployment rate as dependent variable, the FMOLS model revealed that exchange rate and population growth are positively significantly related to unemployment rate, interest rate and inflation rate were negatively related to unemployment rate but only interest rate was significant. The short run relationship revealed that the coefficient of the ecm(-1) is negative and statistically significant at 5% level indicating that the system corrects its previous period disequilibrium at the speed of 48.93% yearly. This study concludes that high exchange rate and population growth can lead to increase in unemployment rate in Nigeria while the government should develop the industrial sector and non-oil sector in order to generate employment and boost export in Nigeria.
Preprint
|
|
Mathematics & Computer Science, Applied Mathematics; DGJ method, third order fractional differential equation, nonlinear differential equation, convergence of the method.
Online: 11 December 2018 (14:01:03 CET)
|
|
Share this article with
×
DGJ (Daftardar-Gejii-Jafaris) method is used to obtain numerical solution of the third order fractional differential equation. Providing the DGJ method converges, the approximate solution is a good and effective numerical result which is close to the exact solution or the exact solution. For this,the examples of the explaning the method are presented. The proposed method is implemented for the approximation solution of the third order nonlinear fractional partial differential equations. The method was shown to be unsuitable and inconsistent for an example of a nonlinear fractional partial differential equation depend on initial-boundary value conditions. The fact that these numerical results are not consistent can be explained by the fact that the method is not convergent.
Preprint
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; EigenAnt; parameter impact analysis; intensification and diversification balance; routing networks
Online: 11 December 2018 (10:18:40 CET)
|
|
Share this article with
×
The EigenAnt algorithm has been proposed to find the shortest path between two nodes with a proof of convergence. Two novel features are noticeable in EigenAnt compared to the conventional ant colony optimization algorithms. Pheromone evaporation in the EigenAnt algorithm is done locally for the selected path and it does not use heuristic information in its selection phase. On the other hand, a simple version of ant colony optimization that also does not use heuristic information has been used for analyzing convergence, considering parameter impact analysis, in the problem of finding the shortest path for 1-node binary chain problems. In this paper, we propose to improve the EigenAnt algorithm by adding additional parameters in such a way as to be able to take advantage of the analysis developed for the simple ant colony optimization algorithm. We demonstrate through our analysis that since the Improved EigenAnt algorithm has one parameter more than ant colony optimization algorithms, tuning of convergence speed is decoupled from tuning of convergence features in the algorithm. Thus, IEigenAnt, which can be interpreted as having two uncorrelated intensification and diversification components, makes it possible to achieve a balance between intensification and diversification. In order to illustrate the advantages of this decoupling, we present experimental results for the routing network problem.
Preprint
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; directional encoding mask; selective attention network; supervised learning; horizontal and vertical text recognition
Online: 11 December 2018 (07:24:04 CET)
|
|
Share this article with
×
Recent state-of-the-art scene text recognition methods have primarily focused on horizontal text in images. However, in several Asian countries, including China, large amounts of text in signs, books, and TV commercials are vertically directed. Because the horizontal and vertical texts exhibit different characteristics, developing an algorithm that can simultaneously recognize both types of text in real environments is necessary. To address this problem, we adopted the direction encoding mask (DEM) and selective attention network (SAN) methods based on supervised learning. DEM contains directional information to compensate in cases that lack text direction; therefore, our network is trained using this information to handle the vertical text. The SAN method is designed to work individually for both types of text. To train the network to recognize both types of text and to evaluate the effectiveness of the designed model, we prepared a new synthetic vertical text dataset and collected an actual vertical text dataset (VTD142) from the Web. Using these datasets, we proved that our proposed model can accurately recognize both vertical and horizontal text and can achieve state-of-the-art results in experiments using benchmark datasets, including the street view test (SVT), IIIT-5k, and ICDAR. Although our model is relatively simple as compared to its predecessors, it maintains the accuracy and is trained in an end-to-end manner.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; Multi-model information fusion, Video skimming, Audio and text classification, keyframe extraction
Online: 6 December 2018 (14:19:57 CET)
|
|
Share this article with
×
In this paper, we propose a novel approach of video skimming by exploiting the fusion of video temporal information and keyword information representation extracted from multi-model video information including audio, text and visual indices. In addition, we introduce the brand-safe filtering and sentiment analysis in order to only reserve the user-friendly content in the video skim. In the experiment by using the videos from YouTube-8M dataset, we have proved that the semantic conservation in the video skim from the proposed approach highly outperforms the approaches by only partial information of the video in conserving the semantic content of the video.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; cylindrical; geometric algebra; boundary layer; compressible flow; Hunter-Saxton
Online: 6 December 2018 (08:57:24 CET)
|
|
Share this article with
×
A method of solution to solve the compressible 3D Navier-Stokes Equations in cylindrical co-ordinates coupled to the continuity equation in cylindrical coordinates is presented in terms of an additive solution of the three principle directions in the radial, azimuthal and z directions of flow. A dimensionless parameter is introduced whereby in the large limit case a method of solution is sought for in the boundary layer of the tube. It is concluded that the total divergence of the flow can be expressed as the integral with respect to time of the line integral of the dot product of inertial and azimuthal velocity. The line integral is evaluated on a contour that is annular and traces the boundary layer as time increases in the flow. Finally it's explicit dependence on the gradient of a density function and Laplacian of pressure is shown with complete dependence on the vorticity and it's rate of change for a flow associated with the Navier Stokes equations.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; VANET; software-defined networking; mobile edge computing
Online: 5 December 2018 (12:26:50 CET)
|
|
Share this article with
×
VANET networks are a class of peer-to-peer wireless networks that are used to organize communication between cars (V2V), cars and infrastructure (V2I) and between cars and other types of nodes (V2X). These networks are based on the DSRC, 802.11 standards and are mainly intended for organizing the exchange of various types of messages, mainly emergency ones, to prevent road accidents or alert when road accident occur, or control the priority of the driveway. Initially it was assumed that cars would only interact with each other, but later, with the advent of the concept of Internet of things (IoT). Researchers began to analyze connectivity with other devices, which in general will allow to combine various road users and other devices that can used in the creation of intelligent transport infrastructure in a single smart city management system. Infrastructure is necessary for the provision of services, monitoring and management of the VANET network. As infrastructure objects it is proposed to use stationary objects of Roadside unit (RSU). The aim of this paper is to analyze the use of mobile edge computing to decrease the load to the base station and latency between RSU clouds and provide a real experiment using software defined networking and mobile edge computing for RSU.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; adaptive filtering; set-membership filtering; quaternion; SM-QNLMS; wind profile prediction; quaternionic adaptive beamforming
Online: 5 December 2018 (04:21:21 CET)
|
|
Share this article with
×
In this paper, we propose the set-membership quaternion normalized least-mean-square (SM-QNLMS) algorithm. For this purpose, first, we review the quaternion least-mean-square (QLMS) algorithm, then go into the quaternion normalized least-mean-square (QNLMS) algorithm. By having the QNLMS algorithm, we propose the SM-QNLMS algorithm in order to reduce the update rate of the QNLMS algorithm and avoid updating the system parameters when there is not enough innovation in upcoming data. Moreover, the SM-QNLMS algorithm, thanks to the time-varying step-size, has higher convergence rate as compared to the QNLMS algorithm. Finally, the proposed algorithm is utilized in wind profile prediction and quaternionic adaptive beamforming. The simulation results demonstrate that the SM-QNLMS algorithm outperforms the QNLMS algorithm and it has higher convergence speed and lower update rate.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; Low accuracy CDRs; Group movement pattern; Data mining; Travel behaviors
Online: 4 December 2018 (10:02:30 CET)
|
|
Share this article with
×
Identifying group movement patterns of crowds and understanding group behaviors is valuable for urban planners, especially when the groups are special such as tourist groups. In this paper, we present a framework to discover tourist groups and investigate the tourist behaviors using mobile phone call detail records (CDRs). Unlike GPS data, CDRs are relatively poor in spatial resolution with low sampling rates, which makes it a big challenge to identify group members from thousands of tourists. Moreover, since touristic trips are not on a regular basis, no historical data of the specific group can be used to reduce the uncertainty of trajectories. To address such challenges, we propose a method called group movement pattern mining based on similarity (GMPMS) to discover tourist groups. To avoid large amounts of trajectory similarity measurements, snapshots of the trajectories are firstly generated to extract candidate groups containing co-occurring tourists. Then, considering that different groups may follow the same itineraries, additional traveling behavioral features are defined to identify the group members. Finally, with Hainan province as an example, we provide a number of interesting insights of travel behaviors of group tours as well as individual tours, which will be helpful for tourism planning and management.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; semilinear systems; parabolic systems; enlarged observability; regional reconstruction; subdifferential method; HUM approach
Online: 4 December 2018 (03:29:41 CET)
|
|
Share this article with
×
The paper is devoted to the investigation of regional observability with constraints on the state of semilinear parabolic systems. The purpose is to reconstruct the initial state between two prescribed functions only on an internal subregion $\omega$ of the system evolution domain $\Omega$. The proofs use two approaches, the subdifferential and HUM approach. Finally, a numerical example is provided to verify the effectiveness of our theory results.
Preprint
|
|
|
Mathematics & Computer Science, Probability and Statistics; volatility; returns; stocks; total petroleum; akaike information criterion (AIC), GARCH; value-at-risk (VaR), backtesting
Online: 4 December 2018 (03:16:48 CET)
|
|
Share this article with
×
Total Nigeria Plc is a Marketing and Services subsidiary of Total; a multinational energy company operating in more than 130 countries and committed to providing sustainable products and services for its customers. For over 50 years, Total Nigeria Plc has remained the leader in the downstream sector of the Nigerian oil and gas industry. This study investigated the volatility of the stock price of Total Petroleum Nigeria plc using nine (9) GARCH models namely sGARCH, gjrGARCH, eGARCH, iGARCH, aPARCH, TGARCH, NGARCH, NAGARCH and AVGARCH. We also investigated the Value-at-Risk (VaR) and Backtesting of the Models. The aim actually of this study is to boost the confidence of the shareholders and investors of the Total Nigeria plc. To achieve this, daily stock price for Total petroleum Nigeria plc from secondary was collected from January 2nd 2001 to May 8th 2017. . The study used both normal and student t innovations, using Akaike Information Criterion (AIC) to select the best model, for normal innovations for log returns and cleansed log returns of Total plc, the eGARCH and sGARCH models performed best respectively, while NGARCH model performed best for student t innovation for both log returns and cleansed returns of Total plc. The persistence of the models are stable except in few cases where iGARCH, eGARCH where not stable. Also for student t innovation, the sGARCH and gjrGARCH fails to converge. The mean-reverting number of day for the returns of Total Nigeria plc differs from model to model. Evidence from the VaR Analysis revealed from the selected models revealed that the Risk of VaR losses is high at 99% confidence level, slightly high at 95% confidence level and better at 90% confidence level. Although The Duration-Based Tests of independence conducted revealed that the models are correctly specified since in all cases the null hypotheses were accepted. This means that the probability of an exception on any day did not depends on the outcome of the previous day. Finally, both the unconditional (Kupiec) and conditional (Christoffersen) coverage tests for the correct number of exceedances for both Total stock returns and cleansed returns. The tests revealed rejection of the models at 1% level of significance. This confirms that unconditional (Kupiec) and conditional (Christoffersen) coverage tests for the correct number of exceedances are reliable compared to the Duration-Based Tests of independence. Therefore we recommend that shareholders and investors in Total Nigeria plc are to remain and continue to investment in Total Nigeria plc because if there is any form of losses, the price of the stock has the potentials to improve in the future. Again, though the risk is high at 99% confidence level, this in line with the financial theory that states that an asset with high expected risk would pay higher return on the average.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; syntropy; entropy; chaos; order; amount of information; finite set; integrative code
Online: 3 December 2018 (15:45:56 CET)
|
|
Share this article with
×
A new approach is presented to defining the amount of information, in which information is understood as the data about a finite set as a whole, whereas the average length of an integrative code of elements serves as a measure of information. We obtain a formula for the syntropy of reflection, that is, the information that two intersecting finite sets reflect about each other. The specificities of reflection of discrete systems through the combination of their parts are considered, and it is shown that the additive syntropy and entropy of reflection are measures of structural order and chaos. Three information laws have been established: the law of conservation of the sum of chaos and order; information law of reflection; the law of conservation and transformation of information. An assessment of the structural organization and the level of development of discrete systems is presented. It is shown that various measures of information are structural characteristics of integrative codes of elements of discrete systems. The conclusion is made that, from the informational-genetic positions, the synergetic theory of information is primary in relation to the Hartley-Shannon information theory. In the appendix we consider the asymmetry of the mutual reflection of finite sets and the proportionality of arbitrary quantities.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; Image retrieval, color features, shape features, low-level features combination
Online: 3 December 2018 (13:33:45 CET)
|
|
Share this article with
×
Due to an increase in the number of image achieves, Content-Based Image Retrieval (CBIR) has gained attention for research community of computer vision. The image visual contents are represented in a feature space in the form of numerical values that is considered as a feature vector of image. Images belonging to different classes may contain the common visuals and shapes that can result in the closeness of computed feature space of two different images belonging to separate classes. Due to this reason, feature extraction and image representation is selected with appropriate features as it directly affects the performance of image retrieval system. The commonly used visual features are image spatial layout, color, texture and shape. Image feature space is combined to achieve the discriminating ability that is not possible to achieve when the features are used separately. Due to this reason, in this paper, we aim to explore the low-level feature combination that are based on color and shape features. We selected color moments and color histogram to represent color while shape is represented by using invariant moments. We selected this combination, as these features are reported intuitive, compact and robust for image representation. We evaluated the performance of our proposed research by using the Corel, Coil and Ground Truth (GT) image datasets. We evaluated the proposed low-level feature fusion by calculating the precision, recall and time required for feature extraction. The precision, recall and feature extraction values obtained from the proposed low-level feature fusion outperforms the existing research of CBIR.
Preprint
|
|
|
Mathematics & Computer Science, Logic; Brocard's problem; Brocard-Ramanujan equation; composite Fermat numbers; halting of a Turing machine; prime numbers of the form $n^2+1$; prime numbers of the form $n!+1$; Richert's lemma; twin prime conjecture
Online: 29 November 2018 (05:28:14 CET)
|
|
Share this article with
×
We define computable functions $g,h:$ $\mathbb N$ $\setminus \{0\} \to$ $\mathbb N$ $\setminus \{0\}$. For an integer $n \geqslant 3$, let $\Psi_n$ denote the following statement: if a system ${\mathcal S} \subseteq \Bigl\{x_i!=x_k: (i,k \in \{1,\ldots,n\}) \wedge (i \neq k)\Bigr\} \cup \Bigl\{x_i \cdot x_j=x_k: i,j,k \in \{1,\ldots,n\}\Bigr\}$ has only finitely many solutions in positive integers $x_1,\ldots,x_n$, then each such solution $(x_1,\ldots,x_n)$ satisfies $x_1,\ldots,x_n \leqslant g(n)$. For a positive integer $n$, let $\Gamma_n$ denote the following statement: if a system $S \subseteq \Bigl\{x_i \cdot x_j=x_k:~i,j,k \in \{1,\ldots,n\}\Bigr\} \cup \Bigl\{2^{\textstyle 2^{\textstyle x_i}}=x_k:~i,k \in \{1,\ldots,n\}\Bigr\}$ has only finitely many solutions in positive integers $x_1,\ldots,x_n$, then each such solution $(x_1,\ldots,x_n)$ satisfies $x_1,\ldots,x_n \leqslant h(n)$. We prove: (1) if the equation $x!+1=y^2$ has only finitely many solutions in positive integers, then the statement $\Psi_6$ guarantees that each such solution $(x,y)$ belongs to the set $\{(4,5),(5,11),(7,71)\}$, (2) the statement $\Psi_9$ proves the following implication: if there exists a positive integer $x$ such that $x^2+1$ is prime and $x^2+1>g(7)$, then there are infinitely many primes of the form $n^2+1$, (3) the statement $\Psi_9$ proves the following implication: if there exists an integer $x \geqslant g(6)$ such that $x!+1$ is prime, then there are infinitely many primes of the form $n!+1$, (4) the statement $\Psi_{16}$ proves the following implication: if there exists a twin prime greater than $g(14)$, then there are infinitely many twin primes, {\bf (5)}~the statement $\Gamma_{13}$ proves the following implication: if $n \in$ $\mathbb N$ $\setminus \{0\}$ and $2^{\textstyle 2^{\textstyle n}}+1$ is composite and greater than $h(12)$, then $2^{\textstyle 2^{\textstyle n}}+1$ is composite for infinitely many positive integers $n$.
Preprint
|
|
|
Mathematics & Computer Science, Computational Mathematics; remote sensing; image classification; fully connected conditional random fields (FC-CRF); convolutional neural networks (CNN)
Online: 28 November 2018 (07:11:42 CET)
|
|
Share this article with
×
The interpretation of land use and land cover (LULC) is an important issue in the fields of high-resolution remote sensing (RS) image processing and land resource management. Fully training a new or existing convolutional neural network (CNN) architecture for LULC classification requires a large amount of remote sensing images. Thus, fine-tuning a pre-trained CNN for LULC detection is required. To improve the classification accuracy for high resolution remote sensing images, it is necessary to use another feature descriptor and to adopt a classifier for post-processing. A fully connected conditional random fields (FC-CRF), to use the fine-tuned CNN layers, spectral features, and fully connected pairwise potentials, is proposed for image classification of high-resolution remote sensing images. First, an existing CNN model is adopted, and the parameters of CNN are fine-tuned by training datasets. Then, the probabilities of image pixels belong to each class type are calculated. Second, we consider the spectral features and digital surface model (DSM) and combined with a support vector machine (SVM) classifier, the probabilities belong to each LULC class type are determined. Combined with the probabilities achieved by the fine-tuned CNN, new feature descriptors are built. Finally, FC-CRF are introduced to produce the classification results, whereas the unary potentials are achieved by the new feature descriptors and SVM classifier, and the pairwise potentials are achieved by the three-band RS imagery and DSM. Experimental results show that the proposed classification scheme achieves good performance when the total accuracy is about 85%.
Preprint
|
|
|
Mathematics & Computer Science, Computational Mathematics; Hidden Markov Models; Mathematical Linguistics; Voynich Manuscript
Online: 26 November 2018 (14:02:40 CET)
|
|
|
Share this article with
×
Hidden markov models are a very useful tool in the modelling of time series and any sequence of data. In particular, they have been successfully applied to the field of mathematical linguistics. In this paper, we apply a hidden markov model to analyze the underlying structure of an ancient and complex manuscript, known as Voynich's manuscript, that remains still undeciphered. By assuming a certain number of internal states representations for the symbols of the manuscript we train the network by means of the $\alpha$ and $\beta$-pass algorithms to optimize the model. By this procedure, we are able to obtain the so-called transition and observation matrices in order to compare with known languages concerning the frequency of consonant and vowel sounds. From this analysis, we conclude that transitions occur between the two states with similar frequencies to other languages. Moreover, the identification of the vowel and consonant sounds matches some previous tentative bottom-up approaches to decode the manuscript.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; Station logo;Convolutional Neural Network; Detection
Online: 26 November 2018 (10:57:17 CET)
|
|
Share this article with
×
The Station logo is a way for a TV station to claim copyright, which can realize the analysis and understanding of the video by the identification of the station logo, so as to ensure that the broadcasted TV signal will not be illegally interfered. In this paper, we design a station logo detection method based on Convolutional Neural Network by the characteristics of the station, such as small scale-to-height ratio change and relatively fixed position. Firstly, in order to realize the preprocessing and feature extraction of the station data, the video samples are collected, filtered, framed, labeled and processed. Then, the training sample data and the test sample data are divided proportionally to train the station detection model. Finally, the sample is tested to evaluate the effect of the training model in practice. The simulation experiments prove its validity.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; Two-dimensional clustering, Soft clustering, Fuzzy c-means(FCM), Possibilistic c-means (PCM), cluster tendency, VAT algorithm, cluster validation, PC, DI, DBI, noise point
Online: 26 November 2018 (10:19:05 CET)
|
|
Share this article with
×
In this paper, several two-dimensional clustering scenarios are given. In those scenarios, soft partitioning clustering algorithms (Fuzzy C-means (FCM) and Possibilistic c-means (PCM)) are applied. Afterward, VAT is used to investigate the clustering tendency visually, and then in order of checking cluster validation, three types of indices (e.g., PC, DI, and DBI) were used. After observing the clustering algorithms, it was evident that each of them has its limitations; however, PCM is more robust to noise than FCM as in case of FCM a noise point has to be considered as a member of any of the cluster.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; quantum computation, IC-POVMs, knot theory, three-manifolds, branch coverings, Dehn surgeries.
Online: 26 November 2018 (10:11:29 CET)
|
|
|
Share this article with
×
A single qubit may be represented on the Bloch sphere or similarly on the 3-sphere S3. Our goal is to dress this correspondence by converting the language of universal quantum computing (UQC) to that of 3-manifolds. A magic state and the Pauli group acting on it define a model of UQC as a positive operator-valued measure (POVM) that one recognizes to be a 3-manifold M3. More precisely, the d-dimensional POVMs defined from subgroups of finite index of the modular group PSL(2, Z) correspond to d-fold M3- coverings over the trefoil knot. In this paper, one also investigates quantum information on a few ‘universal’ knots and links such as the figure-of-eight knot, the Whitehead link and Borromean rings, making use of the catalog of platonic manifolds available on the software SnapPy. Further connections between POVMs based UQC and M3’s obtained from Dehn fillings are explored.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; Deep learning, Cognitive, LSTM, Neural network, Ngrams
Online: 26 November 2018 (10:06:05 CET)
|
|
Share this article with
×
Cognitive neuroscience is the study of how the human brain functions on tasks like decision making, language, perception and reasoning. Deep learning is a class of machine learning algorithms that use neural networks. They are designed to model the responses of neurons in the human brain. Learning can be supervised or unsupervised. Ngram token models are used extensively in language prediction. Ngrams are probabilistic models that are used in predicting the next word or token. They are a statistical model of word sequences or tokens and are called Language Models or Lms. Ngrams are essential in creating language prediction models. We are exploring a broader sandbox ecosystems enabling for AI. Specifically, around Deep learning applications on unstructured content form on the web.
Preprint
|
|
|
Mathematics & Computer Science, Computational Mathematics; geometric distribution; collatz conjecture; inflation propensity; systemic risk; cryptocurrency; blockchain; proof-of-work
Online: 26 November 2018 (07:25:04 CET)
|
|
Share this article with
×
Cryptocurrencies like Bitcoin rely on a proof-of-work system to validate transactions and prevent attacks or double-spending. A new proof-of-work is introduced which seems to be the first number theoretic proof-of-work unrelated to primes: it is based on a new metric associated to the Collatz algorithm whose natural generalization is algorithmically undecidable: the inflation propensity is defined as the cardinality of new maxima in a developing Collatz orbit. It is numerically verified that the distribution of inflation propensity slowly converges to a geometric distribution of parameter $0.714 \approx \frac{(\pi - 1)}{3}$ as the sample size increases. This pseudo-randomness opens the door to a new class of proofs-of-work based on congruential graphs.
Preprint
|
|
|
Mathematics & Computer Science, Probability and Statistics; Color image, grayscale image, motion blurring, random noise, inverse filtering, Wiener filtering, restoration of an image
Online: 23 November 2018 (14:22:33 CET)
|
|
Share this article with
×
In this paper, at first, a color image of a car is taken. Then the image is transformed into a grayscale image. After that, the motion blurring effect is applied to that image according to the image degradation model described in equation 3. The blurring effect can be controlled by a and b components of the model. Then random noise is added in the image via Matlab programming. Many methods can restore the noisy and motion blurred image; particularly in this paper Inverse filtering as well as Wiener filtering are implemented for the restoration purpose. Consequently, both motion blurred and noisy motion blurred images are restored via Inverse filtering as well as Wiener filtering techniques and the comparison is made among them.
Preprint
|
|
|
Mathematics & Computer Science, Probability and Statistics; Digital image processing, color image, grayscale image, histogram equalization, histogram specification, image enhancement, RGB channel
Online: 23 November 2018 (14:17:13 CET)
|
|
Share this article with
×
This paper has two major parts. In the first part histogram equalization for the image enhancement was implemented without using the built-in function in MATLAB. Here, at first, a color image of a rat was chosen and the image was transformed into a grayscale image. After this conversion, histogram equalization was implemented on the grayscale image. Later on, in the same image for each RGB channel, histogram equalization was implemented to observe the effect of histogram equalization on each channel. In the end, the histogram equalization was implemented to this specific color image of a rat. In the second part, for the grayscale image in part 1, the desired histogram of another colored image of a rat was introduced and histogram specification was implemented on the original colored image.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Lie superalgebra; supertrace; commutative superalgebra; 3-Lie superalgebra
Online: 23 November 2018 (10:57:17 CET)
|
|
Share this article with
×
We show that given a Lie superalgebra and an element of its dual space one can construct the 3-Lie superalgebra. We apply this approach to Lie superalgebra of (m,n)-block matrices taking supertrace of a matrix as the element of dual space. Then we also apply this approach to commutative superalgebra and the Lie superalgebra of its derivations to construct 3-Lie superalgebra. The graded Lie brackets are constructed by means of a derivation and involution of commutative superalgebra, and we use them to construct 3-Lie superalgebras.
Preprint
|
|
|
Mathematics & Computer Science, Probability and Statistics; Additive Outliers, Models, Simulation, Time Series length, R Software
Online: 22 November 2018 (14:56:57 CET)
|
|
Share this article with
×
It is a common practice to detect outliers in a financial time series in order to avoid the adverse effect of additive outliers. This paper investigated the performance of GARCH family models (sGARCH; gjrGARCH; iGARCH; TGARCH and NGARCH) in the presence of different sizes of outliers (small, medium and large) for different time series lengths (250, 500, 750, 1000, 1250 and 1500) using root mean square error (RMSE) and mean absolute error (MAE) to adjudge the models. In a simulation iteration of 1000 times in R environment using rugarch package, results revealed that for small size of outliers, irrespective of the length of time series, iGARCH dominated, for medium size of outliers, it was sGARCH and gjrGARCH that dominated irrespective of time series length, while for large size of outliers, irrespective of time series length, gjrGARCH dominated. The study further leveled that in the presence of additive outliers on time series analysis, both RMSE and MAE increased as the time series length increased.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; sums of finite products; Chebyshev polynomials of the first kind; Lucas polynomials; Chebyshev polynomials of all kinds
Online: 22 November 2018 (06:43:38 CET)
|
|
Share this article with
×
In this paper, we study sums of finite products of Chebyshev polynomials of the first kind and Lucas polynomials and represent each of them in terms of Chebyshev polynomials of all kinds. Here the coefficients involve terminating hypergeometric functions 2F1 and these representations are obtained by explicit computations.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; Industry 4.0; XaaS; SemSOA; business process optimization; scalable cloud service deployment; process service plan just-in-time adaptation; BPMN partial fault tolerance
Online: 22 November 2018 (05:29:31 CET)
|
|
Share this article with
×
A new requirement for the manufacturing companies in Industry 4.0 is to be flexible with respect to changes in demands, requiring them to react rapidly and efficiently on the production capacities. Together with the trend to use Service-Oriented Architectures (SOA), this requirement induces a need for agile collaboration among supply chain partners, but also between different divisions or branches of the same company. In order to address this collaboration challenge, we~propose a novel pragmatic approach for the process analysis, implementation and execution. This~is achieved through sets of semantic annotations of business process models encoded into BPMN 2.0 extensions. Building blocks for such manufacturing processes are the individual available services, which are also semantically annotated according to the Everything-as-a-Service (XaaS) principles and stored into a common marketplace. The optimization of such manufacturing processes combines pattern-based semantic composition of services with their non-functional aspects. This is achieved by means of Quality-of-Service (QoS)-based Constraint Optimization Problem (COP) solving, resulting in an automatic implementation of service-based manufacturing processes. The produced solution is mapped back to the BPMN 2.0 standard formalism by means of the introduced extension elements, fully detailing the enactable optimal process service plan produced. This approach allows enacting a process instance, using just-in-time service leasing, allocation of resources and dynamic replanning in the case of failures. This proposition provides the best compromise between external visibility, control and flexibility. In this way, it provides an optimal approach for business process models' implementation, with a full service-oriented taste, by implementing user-defined QoS metrics, just-in-time execution and basic dynamic repairing capabilities. This paper presents the described approach and the technical architecture and depicts one initial industrial application in the manufacturing domain of aluminum forging for bicycle hull body forming, where the advantages stemming from the main capabilities of this approach are sketched.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; ergodic theorems; C*-dynamical systems
Online: 22 November 2018 (04:17:04 CET)
|
|
Share this article with
×
Consider a uniquely ergodic $C^*$-dynamical system ba\-sed on a unital $*$-endomorphism $\Phi$ of a $C^*$-algebra. We prove the uniform convergence of Cesaro averages $\frac1{n}\sum_{k=0}^{n-1}\lambda^{-n}\Phi(a)$ for all values $\lambda$ in the unit circle which are not eigenvalues corresponding to "measurable non continuous" eigenfunctions. This result generalises the analogous one in commutative ergodic theory presented in [19], which turns out to be a combination of the Wiener-Wintner Theorem (cf. [22]) and the uniformly convergent ergodic theorem of Krylov and Bogolioubov (cf. [15]).
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; Image segmentation, Otsu’s thresholding, Two level thresholding, Three level thresholding, Error minimization, Bayes decision, Probability density function (PDF).
Online: 21 November 2018 (15:51:51 CET)
|
|
Share this article with
×
Thresholding is considered as a statistical-decision making theory which can lessen the average error incurred in allocating pixels to two or more groups. The traditional Bayes decision rule can be applied with the prior knowledge of the Probability Density Function (PDF) of each class. It is surmised that a threshold resulting in the best class separation is the optimal one. In this paper, Otsu’s thresholding for image segmentation has been implemented. The well-known Otsu’s method is to learn a threshold that can maximize the between-class variance or equivalently make light of the within-class variance of the entire image. At first, a color image of a tree is taken. After that, the image is transformed into a grayscale image. Then in the first part, two-level thresholding is conducted, and later on, three-level thresholding is also applied. Again, two-level thresholding, as well as three level thresholding, are also applied to some other images. Finally, the comparison is made between two level thresholding and three level thresholding
Preprint
|
|
|
Mathematics & Computer Science, Analysis; Fourier transform; Fourier series; DTFT; DFT; generalized functions; tempered distributions; Schwartz functions; Poisson Summation Formula; discretization; periodization
Online: 21 November 2018 (11:09:28 CET)
|
|
Share this article with
×
In previous studies we used Laurent Schwartz’ theory of distributions to rigorously introduce discretizations and periodizations on tempered distributions. These results are now used in this study to derive a validity statement for four interlinking formulas. They are variants of Poisson’s Summation Formula and connect four commonly defined Fourier transforms to one another, the integral Fourier transform, the Discrete-Time Fourier Transform (DTFT), the Discrete Fourier Transform (DFT) and the Integral Fourier transform for periodic functions—used to analyze Fourier series. We prove that under certain conditions, these four Fourier transforms become particular cases of the Fourier transform in the tempered distributions sense. We first derive four interlinking formulas from four definitions of the Fourier transform pure symbolically. Then, using our previous results, we specify three conditions for the validity of these formulas in the tempered distributions sense.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; audio recognition; context-aware; deep learning
Online: 20 November 2018 (16:32:16 CET)
|
|
Share this article with
×
This paper proposes a method for recognizing audio events in urban environments that combines handcrafted audio features with a deep learning architectural scheme (Convolutional Neural Networks, CNNs), which has been trained to distinguish between different audio context classes. The core idea is to use the CNNs as a method to extract context-aware deep audio features that can offer supplementary feature representations to any soundscape analysis classification task. Towards this end, the CNN is trained on a database of audio samples which are annotated in terms of their respective "scene" (e.g. train, street, park), and then it is combined with handcrafted audio features in an early fusion approach, in order to recognize the audio event of an unknown audio recording. Detailed experimentation proves that the proposed context-aware deep learning scheme, when combined with the typical handcrafted features, leads to a significant performance boosting in terms of classification accuracy. The main contribution of this work is the demonstration that transferring audio contextual knowledge using CNNs as feature extractors can significantly improve the performance of the audio classifier, without need for CNN training (a rather demanding process that requires huge datasets and complex data augmentation procedures).
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; Convolutional Neural Network (CNN), Deep learning, Architecture, Applications
Online: 20 November 2018 (15:25:37 CET)
|
|
Share this article with
×
With the increase of the Artificial Neural Network (ANN), machine learning has taken a forceful twist in recent times. One of the most spectacular kinds of ANN design is the Convolutional Neural Network (CNN). The Convolutional Neural Network (CNN) is a technology that mixes artificial neural networks and up to date deep learning strategies. In deep learning, Convolutional Neural Network is at the center of spectacular advances. This artificial neural network has been applied to several image recognition tasks for decades and attracted the eye of the researchers of the many countries in recent years as the CNN has shown promising performances in several computer vision and machine learning tasks. This paper describes the underlying architecture and various applications of Convolutional Neural Network.
Preprint
|
|
|
Mathematics & Computer Science, Geometry & Topology; ruled surface; null scroll; Minkowski space; pointwise 1-type Gauss map; generalized $1$-type Gauss map;conical surface of $G$-type
Online: 20 November 2018 (11:37:03 CET)
|
|
Share this article with
×
By generalizing the notion of pointwise 1-type Gauss map, the generalized 1-type Gauss map has been recently introduced. Without any assumption, we classified all possible ruled surfaces with generalized 1-type Gauss map in a 3-dimensional Minkowski space. In particular, null scrolls do not have the proper generalized 1-type Gauss map. In fact, it is harmonic.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; Painlevé analysis; Lie symmetry analysis; SIR aodel
Online: 20 November 2018 (09:47:30 CET)
|
|
Share this article with
×
In this paper, Lie symmetry and Painlevé Techniques are applied to the SIRD (Susceptible, Infected, Recovered and Dead) model. A demonstration of the integrability of the model is provided to present an exact solution. The study revealed that nonlinear system passes Painlevé test and does not possesses complex chaotic behaviour. However, the system fails to pass the Painlevé test while constraints reach values equivalent to the corresponding complex chaotic behaviour. The two-dimensional Lie symmetry algebra and the commutator table of the infinitesimal generators are obtained. Lie symmetry analysis serves to linearize the nonlinear system and find the corresponding invariant solution.
Preprint
|
|
|
Mathematics & Computer Science, Probability and Statistics; forecasting; time series; vector autoregression (VAR), bayesian VAR; collinearity and autocorrelation
Online: 20 November 2018 (09:03:49 CET)
|
|
Share this article with
×
The goal of VAR or BVAR is the characterization of the dynamics and endogenous relationships among time series. Also the VAR models are known for their applications to forecasting and policy analysis. This paper compare the performance of VAR and Sims-Zha Bayesian VAR models when the multiple time series are jointly influenced by different levels of collinearity and autocorrelation in the short term (T=16, 32, 64 and 128). Five levels (-0.9,-0.5, 0,+0.5,+0.9) of collinearity and autocorrelation were considered and the results from the simulation study revealed that VAR(2) model dominated for no and moderate levels of autocorrelation (-0.5, 0, +0.5) irrespective of the collinearity level except in few cases when T=16. While the BVAR models dominated for high autocorrelation levels (-0.9 and +0.9) irrespective of the collinearity level except in few cases when T=128. The performance of the models varies at different levels of the collinearity and autocorrelated error, and also varies with the short term periods. Furthermore, the values of the RMSE and MAE criteria decrease as a result of increase in the time series length. In conclusion, the performance of the forecasting models depend on the time series data structure and the time series length. It is therefore recommended that the data structure and series length should be considered in using an appropriate model for forecasting.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; Software-Defined Networking (SDN), Traffic Engineering
Online: 20 November 2018 (08:24:28 CET)
|
|
|
Share this article with
×
The digital society is an outcome of the Internet which has nearly made everything connected and accessible no matter where or when. Nevertheless, despite the fact that conventional IP networks are complicated and very hard to manage, they are still widely adopted. The already established policies make the network configuration/reconfiguration a complex process that reacts to errors, load, and modifications. The prevailing networks are vertically integrated which makes things more and more complicated: Data planes and control are strapped together. Software-defined networking is a model that is meant to solve this issue by splitting the vertical integration and detaching the network’s control logic from the implicit routers and switches; this could be achieved by reinforcing centralization of network control and making the network programmable. In this work, we worked to implement MPLS networks with SDN, to enhance the traffic engineering over the network, and to minimize the network delay and latency, with minimum cost using three of the different SDN networks. The experiment results showed the advantage of the proposed approach for reducing the network delay, comparing with previous studies. Where the average of network delay in our approach reaches to 3.01 milliseconds.
Preprint
|
|
|
Mathematics & Computer Science, Computational Mathematics; Lyapunov equation; HSS iterative method; PHSS iterative method
Online: 20 November 2018 (06:51:55 CET)
|
|
Share this article with
×
Based on previous research results, we propose a new preprocessing HSS iteration method (PHSS) for the generalized Lyapunov equation. At the same time, the corresponding inexact PHSS algorithm (IPHSS) is given from the angle of application. All the new methods presented in this paper have given the corresponding convergence proof. The numerical experiments are carried out to compare the new method with the existing methods, and the improvement effect is obvious. The feasibility and effectiveness of the proposed method are proved from two aspects of theory and calculation.
Preprint
|
|
|
Mathematics & Computer Science, Geometry & Topology; Kahler manifolds, Einstein metrics, Ricci curvature, fibration, almost-homogeneous, cohomogeneity one, semisimple Lie group, Sasakian Einstein, Calabi-Yau metrics
Online: 19 November 2018 (12:04:09 CET)
|
|
Share this article with
×
This is the fourth part of [6] on the existence of K¨ahler Einstein metrics of the general type I almost homogeneous manifolds of cohomogeneity one. We actually carry out all the results in [8] to the type I cases. In part II [14], we obtained a lot of new K¨ahler-Einstein manifolds as well as Fano manifolds without K¨ahler-Einstein metrics. In particular, by applying Theorem 15 therein, we have complete results in the Theorems 3 and 4 in that paper. However, we only have some partial results in Theorem 5 there. In this note, we shall give a report of recent progress on the Fano manifolds Nn,m when n > 15 and N′n,m when n > 4. We actually give two nice pictures for these two classes of manifolds. See our Theorems 1 and 2 in the last section. Moreover, we post two conjectures. Once we could solve these two conjectures, the question for these two classes of manifolds would be completely solved. With applying our results to the canonical circle bundles we also obtain Sasakian manifolds with or without Sasakian-Einstein metrics. That also give some open Calabi-Yau manifolds.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; Software quality; cross-project defect prediction; multi-source; dissimilarity space; arc-cosine kernel function
Online: 19 November 2018 (11:48:50 CET)
|
|
Share this article with
×
Software defect prediction is an important means to guarantee software quality. Because there are no sufficient historical data within a project to train the classifier, cross-project defect prediction (CPDP) has been recognized as a fundamental approach. However, traditional defect prediction methods using feature attributes to represent samples, which can not avoid negative transferring, may result in poor performance model in CPDP. This paper proposes a multi-source cross-project defect prediction method based on dissimilarity space ( DM-CPDP). This method first uses the density-based clustering method to construct the prototype set with the cluster center of samples in the target set. Then, the arc-cosine kernel is used to form the dissimilarity space, and in this space the training set is obtained with the earth mover’s distance (EMD) method. For the unlabeled samples converted from the target set, the KNN algorithm is used to label those samples. Finally, we use TrAdaBoost method to establish the prediction model. The experimental results show that our approach has better performance than other traditional CPDP methods.
Preprint
|
|
|
Mathematics & Computer Science, Other; education for sustainable development; confusion; intelligent tutoring system (ITS); ASSISTments; machine learning; computer-based homework; algebra mathematics technology education; sustainable development
Online: 19 November 2018 (11:46:56 CET)
|
|
Share this article with
×
Incorporating substantial sustainable development issues into teaching and learning is the ultimate task of Education for Sustainable Development (ESD). The purpose of our study is to identify the confused students who have failed to master the skill(s) given by the tutors as a homework using Intelligent Tutoring System (ITS). We have focused ASSISTments, an ITS in this study and scrutinized the skill-builder data using machine learning techniques and methods. We used seven candidate models that include: Naïve Bayes (NB), Generalized Linear Model (GLM), Logistic Regression (LR), Deep Learning (DL), Decision Tree (DT), Random Forest (RF), and Gradient Boosted Trees (XGBoost). We trained, validated and tested learning algorithms, performed stratified cross-validation and measured the performance of the models through various performance metrics i.e., ROC (Receiver Operating Characteristic), Accuracy, Precision, Recall, F-Measure, Sensitivity & Specificity. We found GLM, DT & RF are high accuracies achieving classifiers. However, other perceptions such as detection of unexplored features that might be related to the forecasting of outputs can also boost the accuracy of the prediction model. Through machine learning methods, we identified the group of students which were confused attempting the homework exercise and can help students foster their knowledge, and talent to play a vital role in environmental development.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; Perturbed Gerdjikov–Ivanov equation; travelling wave solution; extended auxiliary equation method; complex wave solution
Online: 19 November 2018 (10:28:56 CET)
|
|
Share this article with
×
We apply utilized the extended form of the auxiliary equation method to obtain extensively reliable exact travelling wave solutions of perturbed Gerdjikov–Ivanov equation (GIE) that is widely used as a model in the field theory of quanta and non-linear optics. The method is based on a simple first order second degree ODE. The new form of the approach gives more solutions to the governing equation efficiently.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; Coupled Higgs equations, new extended rational methods, traveling wave solution, complex solution, multi wave solution
Online: 19 November 2018 (10:11:01 CET)
|
|
Share this article with
×
By using the new recently proposed extended rational methods, we set some solitary and multi wave solutions of the coupled Higgs system in the present study. Some new families of hyperbolic and trigonometric solutions of the coupled Higgs equations are successfully obtained. Some solutions are real as some are complex valued functions. Particular forms of some solutions derived by choice of some parameters are demonstrated in three dimensional spaces. The complex valued solutions are also depicted by plotting both real and complex component.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; sentiment analysis; opinion mining; linguistic features; classification; very negative opinions
Online: 19 November 2018 (09:35:13 CET)
|
|
Share this article with
×
In this paper, we examine the performance of several classifiers in the process of searching for very negative opinions. More precisely, we do an empirical study that analyzes the influence of three types of linguistic features (n-grams, word embeddings, and polarity lexicons) and their combinations when they are used to feed different supervised machine learning classifiers: Support Vector Machine (SVM), Naive Bayes (NB), and Decision Tree (DT).
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; participatory sensing; smart city; Internet of Things; distributed event-based systems
Online: 16 November 2018 (11:23:30 CET)
|
|
Share this article with
×
Since smart cities aim at becoming self-monitoring and self-response systems, their deployment relies on close resource monitoring through large-scale urban sensing. The subsequent gathering of massive amounts of data makes essential the development of event filtering mechanisms that enable the selection of what is relevant and trustworthy. Due to the rise of mobile event producers, location information has become a valuable filtering criterion as it not only offers extra information on the event described but also enhances trust on the producer. Implementing mechanisms that validate the quality of location information becomes then imperative. The lack of such strategies in cloud architectures compels the adoption of new communication schemes for IoT-based urban services. To serve the demand for location verification in urban event-based systems (DEBS), we have designed three different fog architectures that combine proximity and cloud communication. Moreover, we have successfully assessed their performance using network simulations with realistic urban traces.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; Super-Resolution; Deep-learning; Generative Adversarial Networks; CMOS sensors
Online: 16 November 2018 (10:44:26 CET)
|
|
Share this article with
×
Complementary Metal-Oxide-Semiconductor (CMOS) is a typical image sensor that has a wide range of applications. However, considering the limitations of the weather condition and hardware cost, it is hard to capture high-resolution images by CMOS sensor. Recently, Super-Resolution (SR) techniques for image restoration has been gaining attentions due to its excellent performance. Under the powerful learning ability, Generative Adversarial Networks (GANs) have been proved to achieve great success. In this paper, we propose the Advanced Generative Adversarial Networks (AGAN) to efficiently correct these issues; 1) we design a Laplacian pyramid framework as pre-trained module, which is beneficial to provide multi-scale features for our input. 2) at each feature block, a convolutional skip-connections network, which may contain some latent information, is significant for generative model to reconstruct a plausible-looking image; 3) considering that edge details usually play an important role in image generation, a novel perceptual loss function is defined to train and seek optimal parameters. It is effective to achieve excellent and compelling quality captured by CMOS sensor. Quantitative and qualitative evaluations have been demonstrated that our algorithm not only fully takes advantage of Convolutional Neural Networks (CNNs) to improve the image quality, but also performs better than previous GAN algorithms for super-resolution task.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; evidence-based dentistry; public health dentistry; google trends; real-time analytics; predictive analytics
Online: 16 November 2018 (10:34:04 CET)
|
|
Share this article with
×
BACKGROUND Epidemiological sciences have been evolving at an exponential rate paralleled only by the comparable growth within the discipline of data science. Digital epidemiological studies are playing a vital role in medical science analytics for the past few decades. To date, there are no published attempts at deploying the use of real-time analytics in connection with the disciplines of Dentistry or Medicine. AIMS AND OBJECTIVES We deployed a real-time statistical analysis in connection with topics in Dental Anatomy and Dental Pathology represented by the maxillary sinus, posterior maxillary teeth, related oral pathology. The purpose is to infer the digital epidemiology based on a continuous stream of raw data retrieved from Google Trends database. MATERIALS AND METHODS Statistical analysis was carried out via Microsoft Excel 2016 and SPSS version 24. Google Trends database was used to retrieve data for digital epidemiology. Real-time analytics and the statistical inference were based on encoding a programming script using Python high-level programming language. A systematic review of the literature was carried out via PubMed-NCBI, the Cochrane Library, and Elsevier databases. RESULTS The comprehensive review of databases of the literature, based on specific keywords search, yielded 491813 published studies. These were distributed as 488884 (PubMed-NCBI), 1611 (the Cochrane Library), and 1318 (Elsevier). However, there was no single study attempting real-time analytics. Nevertheless, we succeeded in achieving an automated real-time stream of data accompanied by a statistical inference based on data extrapolated from Google Trends. CONCLUSION Real-time analytics are of considerable impact when implemented in biological and life sciences as they will tremendously reduce the required resources for research. Predictive analytics, based on artificial neural networks and machine learning algorithms, can be the next step to be deployed in continuation of the real-time systems to prognosticate changes in the temporal trends and the digital epidemiology of phenomena of interest.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; augmented reality; Microsoft HoloLens; AR application; user experience; user satisfaction
Online: 16 November 2018 (07:55:42 CET)
|
|
Share this article with
×
With the recent developments in augmented reality (AR) technologies comes an increased interest in the use of smart glasses for hands-on training. Whether this interest is turned into market success or not depends at the least on whether the interaction with smart AR glasses satisfies users, an aspect of AR use that so far has received little attention. With this contribution, we seek to change this. The objective of the article, therefore, is to investigate user satisfaction in AR applied to three cases of practical use. User satisfaction of AR can be broken down into satisfaction with the interaction and satisfaction with the delivery device. A total of 142 participants from three different industrial sectors contributed to this study, namely, aeronautics, medicine, and astronautics. In our analysis, we investigated the influence of different factors, such as age, gender, level of education, level of Internet knowledge, and the roles of the participants in the different sectors. Even though users were not familiar with the smart glasses, results show that general computer knowledge has a positive effect on user satisfaction. Further analysis using two-factor interactions shows that there is no significant interaction between the different factors and user satisfaction. The results of the study affirm that the questionnaires developed for user satisfaction of smart glasses and the AR application performed well, but leave room for improvement.
Preprint
|
|
|
Mathematics & Computer Science, Probability and Statistics; financial time series; autocorrelation; models; GARCH; RMSE; MAE
Online: 16 November 2018 (07:11:22 CET)
|
|
Share this article with
×
This study compared the performance of five Family Generalized Auto-Regressive Conditional Heteroscedastic (fGARCH) models (sGARCH, gjrGARCH, iGARCH, TGARCH and NGARCH) in the presence of high positive autocorrelation. To achieve this, financial time series was simulated with autocorrelated coefficients as ρ = (0.8, 0.85, 0.9, 0.95, 0.99), at different time series lengths (as 250, 500, 750, 1000, 1250, 1500) and each trial was repeated 1000 times carried out in R environment using rugarch package. And the performance of the preferred model was judged using Root Mean Squared Error (RMSE) and Mean Absolute Error (MAE). Results from the simulation revealed that these GARCH models performances varies with the different autocorrelation values and at different time series lengths. But in the overall, NGARCH model dominates with 62.5% and 59.3% using RMSE and MAE respectively. We therefore recommended that investors, financial analysts and researchers interested in stock prices and asset return should adapt NGARCH model when there is high positive autocorrelation in the financial time series data.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; bone repair; macrophages; immune system; cytokines; mesenchymal stem cells
Online: 16 November 2018 (06:42:10 CET)
|
|
Share this article with
×
A new mathematical model is presented to study the effects of macrophages on the bone fracture healing process. The model consists of a system of nonlinear ordinary differential equations that represents the interactions among classically and alternatively activated macrophages, mesenchymal stem cells, osteoblasts, and pro- and anti-inflammatory cytokines. A qualitative analysis of the model is performed to determine the equilibria and their corresponding stability properties. Numerical simulations are also presented to support the theoretical results and to monitor the evolution of a broken bone for different types of fractures under various medical interventions. The model can be used to guide clinical experiments and to explore possible medical treatments that accelerate the bone fracture healing process either by surgical interventions or drug administrations.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; slipway; adaptive control system; the method of least squares; procedure periodic; parameter estimation; large-sized object; a recurrent algorithm; the identification procedure
Online: 15 November 2018 (15:47:00 CET)
|
|
Share this article with
×
The article analyzes the problems connected with ensuring the coordinated operation of slipway drives that arise during the launch of a ship. The dynamic model of load of the electric drive of the ship's cart is obtained taking into account the peculiarities of the construction of the ship-lifting complex, which allows to analyze the influence of external factors and random influences during the entire process of launching the ship. A linearized mathematical model of the dynamics of a complex vessel movement in the process of descent in the space of states is developed, which allows to identify the mode of operation of the multi-drive system, taking into account its structure. The analysis of efficiency of application of recurrent methods of identification (stochastic approximation and least squares) of the parameters of the linearized model in the space of states is carried out. A decision support system has been developed in the automated system of operational control by the module for estimating the situation and the control synthesis to ensure a coherent motion of a complex ship-carts object in a two-phase environment.
Preprint
|
|
|
Mathematics & Computer Science, Other; Hadamard product; Nonnegative matrices; Spectral radius; Fan product; M-matrix; Inverse $M$-matrix; Minimum eigenvalue
Online: 15 November 2018 (15:34:44 CET)
|
|
Share this article with
×
In this paper, some mixed type bounds on the spectral radius $\rho(A\circ B)$ for the Hadamard product of two nonnegative matrices ($A$ and $B$) and the minimum eigenvalue $\tau(C\star D)$ of the Fan product of two $M$-matrices ($C$ and $D$) are researched. These bounds complement some corresponding results on the simple type bounds. In addition, a new lower bound on the minimum eigenvalue of the Fan product of several $M$-matrices is also presented: $$ \tau(A_{1}\star A_{2}\cdots\star A_{m})\geq \min_{1\leq i\leq n}\{\prod^{m}_{k=1}A_{k}(i,i)-\prod^{m}_{k=1}[A_{k}(i,i)^{P_{k}}-\tau(A_{k}^{(P_{k})})]^\frac{1}{P_{k}}\}, $$ where $A_{1},\ldots, A_{k}$ are $n\times n$ $M$-matrices and $P_{1},\ldots, P_{k}>0$ satisfy $\sum^{m}_{k=1}\frac{1}{P_{k}}\geq 1$. Some special cases of the above result and numerical examples show that this new bound improves some existing results.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; TCFA; VH-IVUS image; plaque border detection; active counter method; support vector machines.
Online: 15 November 2018 (15:03:55 CET)
|
|
Share this article with
×
Virtual Histology- Intravascular Ultrasound (VH-IVUS) image is an available method for visualizing plaque component to detect thin cap fibroatheroma. Nevertheless, this imaging modality has considerable limitations to extract the plaque component features and identifying the TCFA plaque. The aim of this paper is to improve the identification of TCFA using fusion of IVUS and VH-IVUS images. In order to generate the automatic technique for reducing the human interaction, a new method namely Active Contour based Plaque Border Detection (ACPB) is proposed. In order to perform the pixel wise classification, hybrid of K-means algorithm with Particle Swarm Optimization and Plaque based Minimum Euclidean Distance (KMPSO-PMED) method is presented to classify the plaque region as well. Moreover, to obtain more significant information of imaging modalities, fusion of two different images consisting of VH-IVUS and IVUS is performed. Therefore, geometric features are extracted from the plaque region and combine with IVUS features. Furthermore, different group of plaque features are divided by means of the histopathological studies. SVM classifiers is applied to detect the TCFA and non-TCFA plaques. The proposed method is applied on 566 in-vivo IVUS and their matching VH-IVUS images obtained from 9 patients. The best result of SVM illustrates the accuracy rates of 99.41% for classification of TCFA plaque. The results prove that the highest accuracy is achieved by integrated features of IVUS and VH-IVUS images.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; Algorithmic Information Theory; Incompressibility; Typicality; Randomness Test; Pseudo-random Generators; k-mer Multiplicity; k-Entropy; Informational indexes
Online: 15 November 2018 (10:37:31 CET)
|
|
Share this article with
×
In this paper, by extending some results of informational genomics, we present a new randomness test based on the empirical entropy of strings and some properties of repeatability and unrepeatability of substrings of certain lengths. We give the theoretical motivations of our method and some experimental results of its application to a wide class of strings: decimal representations of real numbers, roulette outcomes, logistic maps, linear congruential generators, quantum measurements, natural language texts, and genomes. It will be evident that the evaluation of randomness resulting from our tests does not distinguish among the different sources of randomness (natural, or pseudo-casual).
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; Web API; SPARQL; micro-service; Data Integration; Linked Data; REST; Biodiversity
Online: 14 November 2018 (10:59:31 CET)
|
|
Share this article with
×
In recent years, Web APIs have become a de facto standard for exchanging machine-readable data on the Web. Despite this success though, they often fail in making resource descriptions interoperable due to the fact that they rely on proprietary vocabularies that lack formal semantics. The Linked Data principles similarly seek the massive publication of data on the Web, yet with the specific goal of ensuring semantic interoperability. Given their complementary goals, it is commonly admitted that cross-fertilization could stem from the automatic combination of Linked Data and Web APIs. Towards this goal, in this paper we leverage the micro-service architectural principles to define a SPARQL Micro-Service architecture, aimed at querying Web APIs using SPARQL. A SPARQL micro-service is a lightweight SPARQL endpoint that provides access to a small, resource-centric, virtual graph. In this context, we argue that full SPARQL Query expressiveness can be supported efficiently without jeopardizing servers availability. Furthermore, we demonstrate how this architecture can be used to dynamically assign dereferenceable URIs to Web API resources that do not have URIs beforehand, thus literally ``bringing'' Web APIs into the Web of Data. We believe that the emergence of an ecosystem of SPARQL micro-services published by independent providers would enable Linked Data-based applications to easily glean pieces of data from a wealth of distributed, scalable and reliable services. We describe a working prototype implementation and we finally illustrate the use of SPARQL micro-services in the context of two real-life use cases related to the biodiversity domain, developed in collaboration with the French National Museum of Natural History.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; e-learning; automatic test generation; medical ontology; data mining for medical texts
Online: 14 November 2018 (09:45:38 CET)
|
|
Share this article with
×
The Medi-test system we developed was motivated by the large number of resources available for the medical domain, as well as the number of tests needed in this field (during and after the medical school) for evaluation, promotion, certification, etc. Generating questions to support learning and user interactivity has been an interesting and dynamic topic in NLP since the availability of e-book curricula and e-learning platforms. Current e-learning platforms offer increased support for student evaluation, with an emphasis in exploiting automation in both test generation and evaluation. In this context, our system is able to evaluate a student’s academic performance for the medical domain. Using as input medical reference texts and supported by a specially designed medical ontology, Medi-test generates different types of questionnaires for Romanian language. The evaluation includes 4 types of questions (multiple-choice, fill in the blanks, true/false and match), can have customizable length and difficulty and can be automatically graded. A recent extension of our system also allows for the generation of tests which include images. We evaluated our system with a local testing team, but also with a set of medicine students, and user satisfaction questionnaires showed that the system can be used to enhance learning.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; Fixed point theorem, modular uniform convexity, modular vector spaces, Nakano spaces, uniform convexity, variable exponent spaces.
Online: 14 November 2018 (08:15:05 CET)
|
|
Share this article with
×
We analyze the modular geometry of the variable exponent Lebesgue space Lp(.). We show that Lp(.) possesses a modular uniform convexity property. Part of the novelty is that the property holds even in the case supp(x) = ∞ . We present specific applications to fixed point theory.
xÆΩ
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; cyber-physical systems; WBAN security; biometric authentication; medical systems
Online: 14 November 2018 (08:03:19 CET)
|
|
Share this article with
×
A Wireless Body Area Network (WBAN) is a network of wirelessly connected sensing and actuating devices. WBANs used for recording biometric information and administering medication are classified as part of a Cyber Physical System (CPS). Preserving user security and privacy is a fundamental concern of WBANs, which introduces the notion of using biometric readings as a mechanism for authentication. Extensive research has been conducted regarding the various methodologies (e.g. ECG, EEG, gait, head/arm motion, skin impedance). This paper seeks to analyze and evaluate the most prominent biometric authentication techniques based on accuracy, cost, and feasibility of implementation. We suggest several authentication schemes which incorporate multiple biometric properties.
Preprint
|
|
|
Mathematics & Computer Science, Logic; Substructural fuzzy logics; Residuated lattices; Semilinear substructural logics; Standard completeness; Fuzzy logic
Online: 13 November 2018 (14:51:05 CET)
|
|
Share this article with
×
Two representable substructural logics ${\rm {\bf UL}}_\omega $ and ${\rm {\bf IUL}}_\omega $ are logics for finite UL and IUL-algebras, respectively. In this paper, the standard completeness of ${\rm {\bf UL}}_\omega $ and ${\rm {\bf IUL}}_\omega $ is proved by the method developed by Jenei, Montagna, Esteva, Gispert, Godo and Wang. This shows that ${\rm {\bf UL}}_\omega $ and ${\rm {\bf IUL}}_\omega $ are substructural fuzzy logics.
Preprint
|
|
|
Mathematics & Computer Science, Other; Internet of Things (IoT); wireless sensor network (WSN); data integrity; watermark; data injection attack
Online: 13 November 2018 (13:14:25 CET)
|
|
Share this article with
×
Using Internet of Things (IoT) applications has been a growing trend in the last few years. They have been deployed in several areas of life including secure and sensitive sectors like military and health. In these sectors, sensory data is the main factor in any decision-making process. This introduces the need to ensure the integrity of data. Secure techniques are needed to detect any data injection attempt before catastrophic effects happen. Sensors have limited computational and power resources. This limitation creates a challenge to design a security mechanism that is both secure and energy-efficient. This work presents a Randomized Watermarking Filtering Scheme (RWFS) for IoT applications that provides en-route filtering to get rid of any injected data at an early stage of the communication. Filtering injected data is based on a watermark that is generated from the original data and embedded directly in random places throughout the packet's payload. The scheme uses homomorphic encryption techniques to conceal the report's measurement from any adversary. The advantage of homomorphic encryption is that it allows the data to be aggregated and, thus, decreases the packet's size. The results of our proposed scheme proved that it improves the security and energy consumption of the system as it mitigates some of the limitations in the existing works.
Preprint
|
|
|
Mathematics & Computer Science, Numerical Analysis & Optimization; hydropower scheduling; stochastic programming; integer programming
Online: 13 November 2018 (07:59:25 CET)
|
|
Share this article with
×
We propose a model for medium-term hydropower scheduling (MTHS) with variable head and uncertainty in inflow, reserve capacity, and energy price. With an increase of intermittent energy sources in the generation mix, it is expected that a flexible hydropower producer can obtain added profits by participating in other markets than just the energy market. To capture this added potential the hydropower system should be modeled with a higher level of details. In this context, we apply an algorithm based on stochastic dual dynamic programming (SDDP) to solve the nonconvex MTHS problem, and show that the use of Strengthened Benders (SB) cuts to represent the expected future profit (EFP) function provide accurate scheduling results for slightly nonconvex problems. A method to visualize the EFP function in a dynamic programming setting is provided, serving as a useful tool for a priori inspection of the EFP shape and its nonconvexity.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; α-MAP; α-MPP; α-MNP; polygon optimization; nonlinear programming; computational geometry
Online: 13 November 2018 (05:28:11 CET)
|
|
Share this article with
×
In this paper, we generalize the problems of finding simple polygons with the minimum area, maximum perimeter and maximum number of vertices so that they contain a given set of points and their angles are bounded by $\alpha+\pi$ where $\alpha$ ($0\leq\alpha\leq \pi$) is a parameter. We also consider the maximum angle of each possible simple polygon crossing a given set of points, and derive an upper bound for the minimum of these angles. The correspondence between the problems of finding simple polygons with the minimum area and maximum number of vertices is investigated from a theoretical perspective. We formulate the three generalized problems as nonlinear programming models, and then present a Genetic Algorithm to solve them. Finally, the computed solutions are evaluated on several datasets and the results are compared with those from the optimal approach.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; complex systems; self-diagnosis; intermittent fault; diagnosis procedure
Online: 13 November 2018 (05:27:55 CET)
|
|
Share this article with
×
System level diagnosis is an abstraction of high level and, thus, its practical implementation to particular cases of complex systems is the task which requires additional investigations, both theoretical and modeling. Mostly, diagnosis at system level intends to identify only permanently faulty units. In the paper, we consider the case when both permanently and intermittently faulty units can occur in the system. Identification of intermittently faulty units has some specifics which we have considered in this paper. We also suggest the method which allows distinguishing among different types of intermittent faults. Diagnosis procedure was suggested for each type of intermittent faults.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; vehicular networks; performance management; design of vehicular networks; mobile networks; vehicle-to-infrastructure; roadside units; infrastructure for vehicular networks
Online: 13 November 2018 (04:55:58 CET)
|
|
Share this article with
×
Over the past few decades, the growth of the urban population has been remarkable. Nowadays, 50% of the population lives in urban areas, and forecasts point that by 2050 this number will reach 70%. Today, 64% of all travel made is within urban environments and the total amount of urban kilometers traveled is expected to triple by 2050. Thus, seeking novel solutions for urban mobility becomes paramount for 21st century society. In this work, we discuss the performance of vehicular networks. We consider the metric Delta Network. The Delta Network characterizes the connectivity of the vehicular network through the percentage of travel time in which vehicles are connected to roadside units. This article reviews the concept of Delta Network and extends its study through the presentation of a general heuristic based on the definition of scores to identify the areas of the road network that should receive coverage. After defining the general heuristic, we show how small changes in the score computation can generate very distinct (and interesting) patterns of coverage, each one suited to a given scenario. In order to exemplify such behavior, we propose three deployment strategies based on simply changing the computation of scores. The results show that the strategies derived from the general heuristic are very interesting, all of them deploying roadside units in a circle pattern around the traffic epicenter.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; cloud systems; AI; cognitive; programming languages; algorithms
Online: 12 November 2018 (08:49:16 CET)
|
|
Share this article with
×
The web ecosystem is rapidly evolving with changing business and functional models. Cloud platforms are available in a SaaS, PaaS and IaaS model designed around commoditized Linux based servers. 10 billion users will be online and accessing the web and its various content. The industry has seen a convergence around IP based technology. Additionally, Linux based designs allow for a system wide profiling of application characteristics. The customer is an OEM who provides Linux based servers for telecom solutions. The end customer will develop business applications on the server. Customers are interested in a latency profiling mechanism which helps them to understand how the application behaves at run time. The latency profiler is supposed to find the code path which makes an application block on I/O, and other synchronization primitives. This will allow the customer to understand the performance bottleneck and tune the system and application parameters.
Preprint
|
|
|
Mathematics & Computer Science, Other; eye tracking; calibration; eye movement; optimization
Online: 12 November 2018 (05:02:54 CET)
|
|
Share this article with
×
Proper calibration of eye movement signal registered by an eye tracker seems to be one of the main challenges in popularizing eye trackers as yet another user input device. Classic calibration methods taking time and imposing unnatural behavior of users have to be replaced by intelligent methods that are able to calibrate the signal without conscious cooperation with users. Such an implicit calibration requires some knowledge about the stimulus a person is looking at and takes into account this information to predict probable gaze targets. The paper describes one of the possible methods to perform implicit calibration: it starts with finding probable fixation targets (PFTs), then uses these targets to build a mapping - probable gaze path. Various possible algorithms that may be used for finding PFTs and mapping are presented in the paper and errors are calculated utilizing two datasets registered with two different types of eye trackers. The results show that although for now the implicit calibration provides results worse than the classic one, it may be comparable with it and sufficient for some applications.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; probability density function; cumulative distribution function; deep learning
Online: 12 November 2018 (04:00:20 CET)
|
|
Share this article with
×
To generate a probability density function (PDF) for fitting probability distributions of real data, this study proposes a deep learning method which consists of two stages: (1) a training stage for estimating the cumulative distribution function (CDF) and (2) a performing stage for predicting the corresponding PDF. The CDFs of common probability distributions can be adopted as activation functions in the hidden layers of the proposed deep learning model for learning actual cumulative probabilities, and the differential equation of trained deep learning model can be used to estimate the PDF. To evaluate the proposed method, numerical experiments with single and mixed distributions are performed. The experimental results show that the values of both CDF and PDF can be precisely estimated by the proposed method.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; vehicular ad hoc networks; conditional privacy; revocation
Online: 12 November 2018 (03:48:47 CET)
|
|
Share this article with
×
It is a challenging issue to provide a secure and conditional anonymous authentication scheme in vehicle ad hoc networks(VANETs) with low storage space and computational cost. In 2008, Lu et al. [8] proposed an conditional privacy preservation scheme called ECPP protocol. The ECPP protocol provides conditional privacy preservation to vehicles in VANETs, that is, on one hand vehicles can achieve anonymous authentication in the network, on the other hand allow to be traced and revoked if necessary. However, ECPP scheme suffers from large storage and high computational cost. In our scheme, an improved protocol based on the concept of ECPP protocol has been proposed, which uses minimal interaction steps, little storage space and less computation overhead to achieve more efficiency conditional privacy preservation(MECPP) scheme in VANETs.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; object recognition; image data synthesizing; Human-computer interaction; data synthesizing for immersive HCI; generative adversarial nets; BAGAN
Online: 9 November 2018 (16:00:39 CET)
|
|
Share this article with
×
Augment reality (AR) is crucial for immersive human-computer interaction (HCI) and vision of artificial intelligence (AI). Labeled data drove object recognition in AR. However, manual annotating data is expensive and labor-intensive, and furthermore, scanty labeled data limits the application of AR. Aiming at solving the problem of insufficient training data in AR object recognition, an automated vision data synthesis method called BAGAN is proposed in this paper based on the 3D modeling and GAN algorithm. Our approach has been validated to have better performance than other methods through image recognition task on natural image database ObjectNet3D. This study can shorten the algorithm development time of AR and expand the application scope of AR, which is of great significance to immersive interactive systems.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Complexity; Chebyshev Polynomials; Gear graph; Pyramid graphs.
Online: 9 November 2018 (15:17:44 CET)
|
|
Share this article with
×
In mathematics, one always aims to obtain new frameworks from specific ones. This also stratified to the regality of graphs, where one can produce numerous new graphs from a specific set of graphs. In this work we define some classes of pyramid graphs created by a gear graph and we derive straightforward formulas of the complexity of these graphs, using linear algebra matrix analysis techniques and employing knowledges of Chebyshev polynomials.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; wireless sensor networks; user authentication; biometric; smart card
Online: 9 November 2018 (04:15:26 CET)
|
|
Share this article with
×
Wireless sensor networks are widely used in many applications such as environmental monitoring, health care, smart grid and surveillance. Many security protocols have been proposed and intensively studied due to the inherent nature of wireless networks. In particular, Wu et al. proposed a promising authentication scheme which is sufficiently robust against various attacks. However, according to our analysis, Wu et al.'s scheme has two serious security weaknesses against malicious outsiders. First, their scheme can lead to user impersonation attacks. Second, user anonymity is not preserved in their scheme. In this paper, we present these vulnerabilities of Wu et al.'s scheme in detail. We also propose a new scheme by fixing such vulnerabilities and improving the performance of the protocol.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; information; entropy; interaction-information; multi-information; Möbius inversion; lattices; multivariable dependence; symmetric group; MaxEnt; networks
Online: 9 November 2018 (03:53:27 CET)
|
|
Share this article with
×
Information-related measures are useful tools for multi-variable data analysis, as measures of dependence among variables, and as descriptions of order and disorder in biological and physical systems. Measures, like marginal entropies, mutual / interaction / multi -information, have long been used in a number of fields including descriptions of systems complexity and biological data analysis. The mathematical relationships among these measures are therefore of significant inherent interest. Relations between common information measures include the duality relations based on Möbius inversion on lattices. These are the direct consequence of the symmetries of the lattices of the sets of variables (subsets ordered by inclusion). While these relationships are of significant interest there has been, to our knowledge, no systematic examination of the full range of relationships of this diverse range of functions into a unifying formalism as we do here. In this paper we define operators on functions on these lattices based on the Möbius inversions that map functions into one another (Möbius operators). We show that these operators form a simple group isomorphic to the symmetric group S3. Relations among the set of functions on the lattice are transparently expressed in terms of the operator algebra, and, applied to the information measures, can be used to derive a wide range of relationships among diverse information measures. The Möbius operator algebra is naturally generalized which yields extensive new relationships. This formalism now provides a fundamental unification of information-related measures, and the isomorphism of all distributive lattices with the subset lattice implies an even broader application of these results.
Preprint
|
|
|
Mathematics & Computer Science, Logic; intuitionistic logic; quantum computing; Kripke-style semantics
Online: 9 November 2018 (03:03:59 CET)
|
|
Share this article with
×
We know that quantum logics are the most prominent logical systems associated to the lattices of closed Hilbert subspaces. But what does it happen if, following a quantum computing perspective, we want to associate a logic to the process of quantum registers measurements? This paper gives an answer to this question, and, quite surprising, shows that such a logic is nothing else that the standard propositional intuitionistic logic.
Preprint
|
|
|
Mathematics & Computer Science, Other; Biomedical libraries; author’s confidence; writing styles; text analysis
Online: 8 November 2018 (11:01:24 CET)
|
|
Share this article with
×
In an era when medical literature is increasing daily, researchers in biomedical and clinical areas have joined efforts with language engineers to analyze large amount of biomedical and molecular biology literature (such as PubMed), patient data or health records. With such a huge amount of reports, evaluating their impact has long seized to be a trivial task. In this context, this paper intends to introduce a non-scientific factor that represents an important element in the effort of gaining acceptance of claims. Thus, we postulate that the confidence the author is expressing in his work plays an important role in shaping the first impression that influences the reader’s perception of the paper. The results discussed in this paper are based on a series of experiments ran over data from the Open Archives Initiative (OAI) corpus that provides interoperability standards in order to facilitate the effectiveness dissemination of the content. This method can be useful to the direct beneficiaries (authors, who are engaged in medical or academic research), but, also, researchers in the fields of BioNLP and NLP, etc.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; artificial general intelligence, AI policy, self-regulatory organization
Online: 8 November 2018 (10:52:39 CET)
|
|
Share this article with
×
The first group to build artificial general intelligence or AGI stands to gain a significant strategic and market advantage over competitors, so companies, universities, militaries, and other actors have strong incentives to race to build AGI first. An AGI race would be dangerous, though, because it would prioritize capabilities over safety and increase the risk of existential catastrophe. A self-regulatory organization (SRO) for AGI may be able to change incentives to favor safety over capabilities and encourage cooperation rather than racing.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; complex adaptive systems; systems dynamics; dynamical systems; signal processing; reservoir computing; machine learning; Boolean networks; biological modeling
Online: 8 November 2018 (10:40:23 CET)
|
|
|
Share this article with
×
Reservoir computers (RCs) are a biology inspired computational framework for signal processing typically implemented using recurrent neural networks. Recent work has shown that Boolean networks (BN) can also be used as reservoirs. We analyze the performance of BN RCs, measuring their flexibility and identifying factors that determine effective approximation of Boolean functions that are applied in a sliding-window fashion over a binary signal, either non-recursively or recursively. We train and test BN RCs of different sizes, signal connectivity, and in-degree to approximate 3-bit, 5-bit and 3-bit recursive binary functions. We analyze how BN RC parameters and function average sensitivity, a measure of function smoothness, affect approximation accuracy as well as the spread of accuracies for a single reservoir. We found that approximation accuracy and reservoir flexibility are highly dependent on RC parameters. Overall, our results indicate that not all reservoirs are equally flexible and RC instantiation and training can be more efficient if this is taken into account. The optimum range of RC parameters opens up an angle of exploration for understanding how biological systems might be tuned to balance system restraints with processing capacity.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; Particle Flow, Sub-Surface Water, Reservoirs Pollution
Online: 8 November 2018 (10:24:30 CET)
|
|
Share this article with
×
Pollution of sub-surface water reservoirs mainly rivers and streams through contaminated water point sources (CWPS) was studied. The objective was to formulate a discrete time delay mathematical model which describes the dynamics of reservoir pollution using mixing-problem processes that involve single species contaminants such as nitrates, phosphorous and detergents. The concentration of pollutants was expressed as a function of the inflow and outflow rates using the principle for the conservation of mass. Systems of ODEs generated from principles of mixing problems were refined into a system of DDEs so that the concentration of pollutant leaving the reservoir at time would be determined at some earlier instant, for the delay. The formulated model is a mathematical discrete time delay model which would be used to describe the dynamics of sub-surface water reservoir pollution. The results from the validation of the model were analyzed to determine how time delays in the mixing processes affect the rate of particle movement in water reservoirs.
Preprint
|
|
|
Mathematics & Computer Science, Probability and Statistics; KullbackLeibler;OverlapCoefficients;NormalDensity.
Online: 8 November 2018 (10:07:22 CET)
|
|
Share this article with
×
Overlap coefficient (OVL) represents the proportion of overlap between two probability distributions, as a measure of the similarity between them. In this paper, we define a new overlap coefficient Λ based on KullbackLeibler divergence and compare its performance to three known overlap coefficients, namely Matusia’s Measure ρ, Morisita’s Measure λ, Weitzman’s Measure δ. We study their properties, relations between them, and give approximate expressions for the biases and the variances.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; supermedia; haptics; HEVC; tactile feedback; transport protocols; teleoperation; interactive applications; real-time protocol; internet status
Online: 8 November 2018 (09:54:55 CET)
|
|
Share this article with
×
Supermedia streams transfer video, audio, haptic and other sensory data. Real -time transfering of supermedia streams over the Internet is quite challenging. This paper outlines the proposed protocols for transferring supermedia streams over the Internet. Moreover, it describes the Quality of Service (QoS) requirements for supermedia applications that a network has to fulfill. Extensive simulations and experiments for the performance evaluation of transport protocols for real time transferring HEVC streams with supermedia data are carried out. Complements, differences and relevancies between simulation and real world experiments are discussed. The metrics that are measured for the performance evaluation are delay, jitter, throughput, efficiency, packet loss and one proposed by the authors, packet arrival deviation. The simulation tests reveal which protocols could be used for the transfer of real-time supermedia data with a HEVC video stream.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; Clustering; Recommender-Systems; Word-Embedding
Online: 7 November 2018 (14:47:58 CET)
|
|
Share this article with
×
In this paper, we provide a study on the effects of applying classical clustering algorithms, such as k-Means to free text recommender systems. A typical recommender system may face problems when the number of items from a database goes from a few items to hundreds of items. Currently, one of the most prominent techniques to scale the database is applying clustering, however clustering may have a negative impact on the accuracy of the system when applied without taking into consideration the underlying items. In this work, we build a conceptual text recommender system and use k-Means to partition its search space into different groups. We study how the variation of the number of clusters affects its performance in the light of two performance measurements: recommendation time and precision. We also analyze if this clustering is affected by the representation of text we use. All the techniques used in this study uses word-embeddings to represent the document. One of the main findings of this work is that using clustering we can improve the recommendation time in up to almost 30 times without affecting much off its initial accuracy. Another interesting finding is that the increment of the number of clusters is not directly translated into linear performance.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; Unmanned Aerial Vehicle (UAV), Haar-like features, real time, Geographic Information Systems (GIS), human detection, geolocation error, OpenCV
Online: 7 November 2018 (09:41:39 CET)
|
|
|
Share this article with
×
Human detection from Unmanned Aerial Vehicles (UAV) is gaining popularity in the field of disaster management, crowd counting, people monitoring. Real time human detection from UAV is a challenging task, because of many constraints involved. This study proposes a system for real time detection of humans on videos captured from UAVs addressing three of these constraints namely, flying height, computation time and scale of viewing. The proposed method integrated an android application with a binary classifier based on Haar-features to automatically detect human / non-human class from UAV images. The video frames were parsed and detected humans from image frames were geo-localized and visualized on Google Earth. The performance was evaluated for geo-localization accuracy, computation time and detection accuracy, considering human coverage – pixel size relationship for various heights and scale factor. Based on flying height - human size relationship and tradeoff between detection accuracy vs computation time, the study came up with optimal parameters for OpenCV’s cv2.cascadeClassifier. detectMultiScale function. This paper establishes a strong ground for further research relating to real time human detection from UAV.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; time-dependent order of differentiation; fractional calculus;fractional derivative;differential equations;complex systems;Volterra integral equation;VODE;DODE;dynamical evolution
Online: 7 November 2018 (09:15:19 CET)
|
|
Share this article with
×
A new type of ordinary differential equation is introduced and discussed, namely, the time-dependent order ordinary differential equations. These equations can be solved via fractional calculus and are mapped into Volterra integral equations of second kind with singular integrable kernel. The solutions of the time-dependent order differential equations smoothly deforms solutions of the classical integer order ordinary differential equations into one-another, and can generate or remove singularities. An interesting symmetry of the solution in relation to the Riemann zeta function and Harmonic numbers was also proved.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; IoT search; access control; attribute-based access control; survey
Online: 6 November 2018 (04:18:40 CET)
|
|
Share this article with
×
With the development of IoT technology, various information resources, such as social resources and physical resources, are deeply integrated for different comprehensive applications. Social networking, car networking, medical services, video surveillance and other forms of IoT information Service model gradually change people's daily life. Facing the vast amounts of IoT information data, IoT search technology is used to quickly find accurate information to meet real-time search needs of users. However, IoT search requires to use a large number of user privacy Information, such as personal health information, location information, social relations information, to provide personalized services. User privacy information will meet security problems if an effective access control mechanism is missing during the IoT search process. Access control mechanism can effectively monitor the access activities of resources, and ensure authorized users to access information resources under legitimate conditions. This survey examines the growing literature on access control for IoT search. Problems and challenges of access control mechanism are analyzed to facilitate the adoption of access control solutions in real-life settings. This paper aims to provides theoretical, methodological and technical guidance for IoT search access control mechanism in large-scale dynamic heterogeneous environment. Based on the literature study, we also analyzed future development direction of access control in the age of IoT.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Smarandache algebra; point algebra; $p$-derived algebra.
Online: 5 November 2018 (12:53:07 CET)
|
|
Share this article with
×
If an algebra of type $A$ contains a subalgebra
which is also an algebra of type $B$, then it is a Smarandache $B$-type $A$-algebra provided the subalgebra of type $B$ contains at least two elements. This generalizes the notion of Smarandache
group, where the group of order $\geq 2$ is a subsemigroup of a semigroup.
In this paper we investigate a number of such pairings
and we deduce a number of conclusions as a consequence.
Preprint
|
|
|
Mathematics & Computer Science, Other; helminthiasis dynamics in Ghana, preventive chemotherapy, school-aged children, high-risk adults, neglected tropical diseases, age-structure, infection risk, cost analysis
Online: 5 November 2018 (11:43:33 CET)
|
|
Share this article with
×
Soil-transmitted helminthiasis (STH), a neglected tropical disease (NTD) remains a major health problem all over the world including Ghana, which has STH prevalence of 25.4%. To control the disease, the government of Ghana currently concentrates on implementing mass drug administration (MDA) efforts focusing only among school-aged children. However, various studies have suggested that focusing on only a specific group for MDA may not be cost-effective. Moreover, some adults such as teachers and school-workers spend large fraction of their time with children, who shed more parasite in environment due to unhygienic behavior, and thus have a higher risk of getting infected as compared to other adults. In this study we use a mathematical model to evaluate age-structured and risk-based policies for implementing MDA while capturing transmission dynamics of STH in Ghana. A cost model was developed that included various costs related to MDA to study cost-effectiveness of current policies of MDA in Ghana against novel policies to control STH in Ghana. We carry out analysis for five different scenarios— I: no MDA (baseline), II: current MDA policy (focusing children) in Ghana, III: MDA for different age groups (adults and children groups) for unlimited budget, IV: MDA for different age groups with limitations of number of individuals treated, and, V: MDA for different groups based on their risk of getting infected (adults school workers (high-risk group), adults non-school workers and children groups). Our results suggest that it might be more cost-effective to allocate treatment through MDA to at least some proportion of adults along with children. In case of unlimited budget, the best strategy in Scenario IV would be to treat approximately 22% of adults and approximately 45% of children. The most cost-effective among the 5 scenarios is suggested through scenario V, where high-risk adults group and children are provided MDA at higher level than low-risk adults. In conclusion, age-structured and risk-based allocation of treatment and resources is crucial to reducing STH load in developing countries.
Preprint
|
|
|
Mathematics & Computer Science, Probability and Statistics; Health Informatics; Clinical Decision Making; Seasonal Variations; Admission Diagnosis; Health Outcomes; Visualization
Online: 5 November 2018 (10:57:48 CET)
|
|
Share this article with
×
Admission and discharge diagnoses of in-hospital patients are often in discord. Incorrect admission diagnoses are related to increased cost of care and patient safety. Additionally, due to the seasonality of many conditions, this discord may vary across the year. In this paper, we used medical claims data to develop a methodological framework that examines these differences, for Medicare beneficiaries. We provide examples for pneumonia, a condition with seasonal implications, and aneurysm, where early detection can be life-saving. Following a Bayesian approach, our work quantifies and visualizes with time series plots the degree that any clinical condition is correctly diagnosed upon admission. We examined differences in weekly intervals, during a calendar year. The mean length of stay and hospital charges were furthermore compared between matching and non-matching {admission, discharge Dx} pairs, and 95% confidence intervals of the difference of means were estimated. We applied Statistical Process Control methods and then visualized differences, for the hospital charges and the length of stay, per week, with time series plots. Our methodology and the visualizations underline the importance of a rigorous and non-delayed diagnostic process upon admission since there are significant implications in terms of hospital outcomes and cost of care.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; machine learning; stacking; forecasting; regression; sales; time series
Online: 5 November 2018 (09:54:54 CET)
|
|
Share this article with
×
In this paper, we study the usage of machine learning models for sales time series forecasting. The effect of machine learning generalization has been considered. A stacking approach for building regression ensemble of single models has been studied. The results show that using stacking technics, we can improve the performance of predictive models for sales time series forecasting.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; TV channel rating; expert recommendation systems; fuzzy resources control; fuzzy classification knowledge bases; solving fuzzy relational equations
Online: 5 November 2018 (09:16:56 CET)
|
|
Share this article with
×
The purpose of the study is to control the ratio of programs of different genres when forming the broadcast grid in order to increase and maintain the rating of the channel. In the multichannel environment, television rating control consists of selecting such content, ratings of which are completely restored after advertising. A hybrid approach combining the benefits of semantic training and fuzzy relational equations in simplification of the expert recommendation systems construction is proposed. The problem of retaining the television rating can be attributed to the problems of fuzzy resources control. The increase or decrease trends of the demand and supply are described by primary fuzzy relations. The rule-based solutions of fuzzy relational equations connect significance measures of the primary fuzzy terms. Rules refinement by solving fuzzy relational equations allows avoiding labor-intensive procedures for the generation and selection of expert rules. The solution set generation corresponds to the granulation of the television time, where each solution represents the time slot and the granulated rating of the content. In automated media planning, generation of the weekly TV program in the form of the granular solutions provides the decrease of the time needed for the programming of the channel broadcast grid.
Preprint
|
|
|
Mathematics & Computer Science, Probability and Statistics; coherence, monetary utility, insurance benefit, benefit sharing
Online: 2 November 2018 (15:13:14 CET)
|
|
Share this article with
×
We use the theory of coherent measures to look at the problem of surplus sharing in an insurance business. The surplus share of an insured is calculated by the surplus premium in the contract. The theory of coherent risk measures and the resulting capital allocation gives a way to divide the surplus between the insured and the capital providers, i.e. the shareholders.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; Fourier transform; rigid body motions; partial differential equations; Lévy processes; lie groups; homogeneous spaces; stochastic differential equations
Online: 2 November 2018 (06:42:58 CET)
|
|
Share this article with
×
Fokker-Planck PDEs (incl. diffusions) for stable Lévy processes (incl. Wiener processes) on the joint space of positions and orientations play a major role in mechanics, robotics, image analysis, directional statistics and probability theory. Exact analytic designs and solutions are known in the 2D case, where they have been obtained using Fourier transform on $SE(2)$. Here we extend these approaches to 3D using Fourier transform on the Lie group $SE(3)$ of rigid body motions. More precisely, we define the homogeneous space of 3D positions and orientations $\mathbb{R}^{3}\rtimes S^{2}:=SE(3)/(\{\mathbf{0}\} \times SO(2))$ as the quotient in $SE(3)$. In our construction, two group elements are equivalent if they are equal up to a rotation around the reference axis. On this quotient we design a specific Fourier transform. We apply this Fourier transform to derive new exact solutions to Fokker-Planck PDEs of $\alpha$-stable Lévy processes on $\mathbb{R}^{3}\rtimes S^{2}$. This reduces classical analysis computations and provides an explicit algebraic spectral decomposition of the solutions. We compare the exact probability kernel for $\alpha = 1$ (the diffusion kernel) to the kernel for $\alpha=\frac12$ (the Poisson kernel). We set up SDEs for the Lévy processes on the quotient and derive corresponding Monte-Carlo methods. We verify that the exact probability kernels arise as the limit of the Monte-Carlo approximations.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Changhee polynomials, Changhee polynomials of type two, p-adic interal
on Zp
Online: 1 November 2018 (18:13:42 CET)
|
|
Share this article with
×
In this paper we consider Changhee polynomials of type two, which
are motivated from the recent work of Kim and Kim.
We investigate some symmetry identities for the Changhee polynomials of type
two which are derived from the properties of symmtery for the fermionic p-adic
integral on Zp.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; Dermoscopic Image, Skin Lesion, Melanoma, Simulation, Generative Adversarial Networks, Deep Learning
Online: 1 November 2018 (17:54:12 CET)
|
|
Share this article with
×
Automated skin lesion analysis is one of the trending fields that has gained attention among the dermatologists and healthcare practitioners. Skin lesion restoration is an essential preprocessing step for lesion enhancements for accurate automated analysis and diagnosis. Digital hair removal is a non-invasive method for image enhancement by solving the hair-occlusion artefact in previously captured images. Several hair removal methods were proposed for skin delineation and removal. However, manual annotation is one of the main challenges that hinder the validation of these proposed methods on a large number of images or using benchmarking datasets for comparison purposes. In the presented work, we propose a realistic hair simulator based on context-aware image synthesis using image-to-image translation techniques via conditional adversarial generative networks for generation of different hair occlusions in skin images, along with the ground-truth mask for hair location. Besides, we explored using three loss functions including L1-norm, L2-norm and structural similarity index (SSIM) to maximise the synthesis quality. For quantitatively evaluate the realism of image synthesis, the t-SNE feature mapping and Bland-Altman test are employed as objective metrics. Experimental results show the superior performance of our proposed method compared to previous methods for hair synthesis with plausible colours and preserving the integrity of the lesion texture.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; digital interventions; shop floor; evaluation framework; heuristics; smart factory
Online: 1 November 2018 (17:51:49 CET)
|
|
Share this article with
×
The introduction of innovative digital tools for supporting manufacturing processes has far-reaching effects on an organizational and an individual level due to the development of Industry 4.0. The FACTS4WORKERS project funded by H2020, i.e. Worker-Centric Workplaces in Smart Factories, aims to develop user-centered assistance systems in order to demonstrate their impact and applicability at the shop floor. To do so it is important to understand how to develop such tools and how to assess if advantages can be derived from the created ICT system. This study introduces the technology of a workplace solution that is linked to a specific industrial challenge. Subsequently, a 2-stepped approach to evaluate the presented system is discussed. Heuristics, which are an output of project “Heuristics for Industry 4.0”, are used to test if the developed solution covers critical aspects of socio-technical system design. Insights into the design, development and holistic evaluation of digital tools at the shop floor should be shown.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Lucas sequences, public key cryptosystems, Multi-receiver encryption scheme, Chinese Remainder Theorem, Anonymity.
Online: 31 October 2018 (11:03:09 CET)
|
|
Share this article with
×
Multi-receiver encryption enables a sender to encrypt a message and transmit the ciphertext to a set of authorized users, while no one out this group of authorized users can decrypt the message. Multi-receiver encryption is of great importance in many sectors such as broadcast
communication, cloud computing, wireless communications, networking applications, e-voting, lottery, and medical applications. This paper proposes an efficient multi-receiver public key
encryption scheme based on Lucas sequences. The results of the computational analysis show that, projected scheme is better against renown attacks and prevailing anonymous multireceiver algorithms
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; q-differential graded algebra; (σ,τ)-differential graded algebra; generalized Clifford algebra; pre-cosimplicial complex
Online: 31 October 2018 (10:03:24 CET)
|
|
Share this article with
×
We propose a notion of $(q,\sigma,\tau)$-differential graded algebra, which generalizes the notions of $(\sigma,\tau)$-differential graded algebra and $q$-differential graded algebra. We construct two examples of $(q,\sigma,\tau)$-differential graded algebra, where the first one is constructed by means of generalized Clifford algebra with two generators (reduced quantum plane), where we use a $(\sigma,\tau)$-twisted graded $q$-commutator. In order to construct the second example, we introduce a notion of $(\sigma,\tau)$-pre-cosimplicial algebra.
Preprint
|
|
|
Mathematics & Computer Science, Geometry & Topology; eneralized topological space, generalized local connectedness, generalized pathwise connectedness, generalized local pathwise connectedness, generalized simple connectedness, generalized components
Online: 31 October 2018 (09:00:17 CET)
|
|
Share this article with
×
Several specific types of ordinary and generalized connectedness in a generalized topological space have been defined and investigated for various purposes from time to time in the literature of topological spaces. Our recent research in the field of a new type of generalized connectedness in a generalized topological space is reported herein as a starting point for more generalized types.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; Artificial Intelligence (AI); artificial general intelligence (AGI); artificial social intelligence (ASI); singularity; complexity; emergence phenomena; evolution; social sciences
Online: 31 October 2018 (07:45:49 CET)
|
|
Share this article with
×
In this paper we present an argument in favor of the possibility of an artificial intelligence above human intelligence. AI technology has shown a stepwise increase in its capacity and complexity. The last step took place several years ago, due to increased progress in deep neural network technology. Each such step goes hand in hand with our understanding of ourselves, understanding human cognition. Indeed, AI was always about the question of understanding human nature. AI percolates into our lives, step by step, changing our environment. We believe the next few steps in AI technology, and in our understanding of human behavior, will bring about a much more powerful machines, flexible enough to resemble human behavior. In this context, there are two research fields: Artificial Social Intelligence (ASI) and General Artificial Intelligence (AGI). On the ground of ASI and AGI we present an evolutionary argument which uses research in artificial life simulations, showing an increase in complexity due to an emergent property coming out of lower complexity constituents. The whole process is driven by an evolutionary force. What could such an evolutionary force be? We suggest a social communicative driving force. We end the discussion demonstrating a way to overcome our fears of singularity, harnessing value alignment.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; Riemann Function; Riemann’s Method; hypergeometric function of several variables; point symmetry; generalized symmetry
Online: 30 October 2018 (09:02:41 CET)
|
|
Share this article with
×
Riemann’s method is one of the definitive ways of solving Cauchy’s problem for a second order linear hyperbolic partial differential equation in two variables. The first review of Riemann’s method was published by E. T. Copson in 1958. This study extends that work. Firstly, three solution methods were overlooked in Copson’s original paper. Secondly, several new approaches for finding Riemann functions have been developed since 1958. Those techniques are included here and placed in the context of Copson’s original study. There are also numerous equivalences between Riemann functions that have not previously been identified in the literature. Those links are clarified here by showing that many known Riemann functions are often equivalent due to the governing equation admitting a symmetry algebra isomorphic to $SL(2,R)$. Alternatively, the equation admits a Lie-Bäcklund symmetry algebra. Combining the results from several methods, a new class of Riemann functions is then derived which admits no symmetries whatsoever.
Preprint
|
|
|
Mathematics & Computer Science, Other; Indoor Location, Mobile App, Building Information Models, BLE, Beacon, Path Finding, A*.
Online: 29 October 2018 (12:38:10 CET)
|
|
Share this article with
×
This research work uses a simplified approach to combine location information from beacons propagation signal interaction with a mobile device with local building information to give real-time location and guidance to a user inside a building. This is an interactive process with visualisation information that can help user’s orientation inside unknown buildings and the data stored from different users can provide useful information about users movements inside a public building. Beacons installed on the building at specific pre-defined position emit signals that give a geographic position with an associated imprecision, related with Bluetooth’s range. This uncertainty is handled by building layout and users’ movement in a developed system that maps users’ position, gives guidance and store user movements. This system is based on an App (Find Me!) for Android OS (Operating System) which captures the Bluetooth Low Energy (BLE) signal coming from the beacon(s) and shows, through a map, the location of the user ‘s smartphone and guide him to the desired destination. Also, the beacons can deliver relevant context information. The application was tested by a panel of new and habitual campus users against traditional wayfinding alternatives yielding navigation times about 30% smaller, respectively.
Preprint
|
|
|
Mathematics & Computer Science, Other; low back pain; virtual reality; virtual rehabilitation; serious game; gamification
Online: 29 October 2018 (11:38:57 CET)
|
|
Share this article with
×
Low Back Pain (LBP) is one of the most common problems among adults. The usual physiotherapy treatment is to perform physical exercises. However, some LBP patients have false beliefs regarding their pain and they tend to avoid physical movements which might increase their pain and disability. Virtual Reality (VR) has shown to be an effective intervention in improving motor functions and reducing pain perception. Existing VR interventions for LBP rehabilitation were based on a non-immersive VR, whereas to effectively reduce the pain intensity, we need an immersive VR. In this paper, we introduce the development and evaluation of a serious game called RabbitRun with an immersive experience to engage the patients in a virtual environment and distract them from the pain while performing LBP exercises. The initial usability evaluation results suggest that RabbitRun game is enjoyable and acceptable. The game is easy to play and learn and most of the participants are willing to play the game at home. This solution will enhance the rehabilitation outcome since the patients who are suffering from LBP can use the system at their home and train more for long period of time using a smartphone and low-cost virtual reality device such as Google Cardboard.