Preprint
|
|
|
Mathematics & Computer Science, General Mathematics; neutrosophic cubic set; single valued neutrosophic set; interval neutrosophic set; multi attribute group decision making; TODIM method; NC-TODIM
Online: 23 October 2017 (04:53:57 CEST)
|
|
Share this article with
×
Neutrosophic cubic set is the hybridization of the concept of neutrosophic set and interval neutrosophic set. Neutrosophic cubic set has the capacity to express the hybrid information of both the interval neutrosophic set and the single valued neutrosophic set simultaneously. As newly defined, little research on the operations and applications of neutrosophic cubic sets appear in the current literature. In the present paper we propose the score, accuracy functions for neutrosophic cubic sets and prove their basic properties. We firstly develop TODIM method to solve multi attribute group decision making in neutrosophic cubic set environment, which we call NC-TODIM. Also, we solve a MAGDM problem using the proposed NC-TODIM method to show the applicability and effectiveness of the developed method. We also conduct sensitivity analysis to show the impact of ranking order of the alternatives for different values of attenuation factor of losses for multi-attribute group decision making problem.
Preprint
|
|
|
Mathematics & Computer Science, Probability and Statistics; competing risks; masked causes of failure; Markov Chain Monte Carlo; Bayesian analysis; partly interval censored
Online: 21 October 2017 (02:16:43 CEST)
|
|
Share this article with
×
Bayesian analysis for masked data under competing risk frameworks is studied for the purpose of assessing the impact of covariates on the hazard functions when the failure time is exactly observed for some subjects but only known to lie in an interval of time for the remaining subjects. Such data, known as partly interval-censored data, usually result from periodic inspection. Dirichlet and Gamma processes are assumed as priors for masking probabilities and baseline hazards. The Markov Chain Monte Carlo (MCMC) technique is employed for the implementation of the Bayesian approach. The effectiveness of the proposed model is tested through numerical studies, including simulated and real data sets.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; fuzzy number; normal fuzzy number; addition and subtraction; approximation.
Online: 17 October 2017 (14:24:15 CEST)
|
|
Share this article with
×
In fuzzy group decision making problems and fuzzy shortest path problems, the addition and subtraction are the basic problems. For the mixed normal fuzzy numbers and trapezoidal fuzzy numbers, the addition and subtraction operations are approximated by the normal fuzzy numbers in this paper. The behaviors of approximated normal fuzzy numbers are the same as those of the normal distributions from the viewpoint of probability. An application of the addition and subtraction operations of mixed fuzzy numbers to the fuzzy sample mean is also proposed.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; big data; machine learning; regularization; data quality; robust learning framework
Online: 17 October 2017 (03:47:41 CEST)
|
|
Share this article with
×
The concept of ‘big data’ has been widely discussed, and its value has been illuminated throughout a variety of domains. To quickly mine potential values and alleviate the ever-increasing volume of information, machine learning is playing an increasingly important role and faces more challenges than ever. Because few studies exist regarding how to modify machine learning techniques to accommodate big data environments, we provide a comprehensive overview of the history of the evolution of big data, the foundations of machine learning, and the bottlenecks and trends of machine learning in the big data era. More specifically, based on learning principals, we discuss regularization to enhance generalization. The challenges of quality in big data are reduced to the curse of dimensionality, class imbalances, concept drift and label noise, and the underlying reasons and mainstream methodologies to address these challenges are introduced. Learning model development has been driven by domain specifics, dataset complexities, and the presence or absence of human involvement. In this paper, we propose a robust learning paradigm by aggregating the aforementioned factors. Over the next few decades, we believe that these perspectives will lead to novel ideas and encourage more studies aimed at incorporating knowledge and establishing data-driven learning systems that involve both data quality considerations and human interactions.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; evolutionary dynamics; quantitative trait; Manhattan norm; Euclidean norm; Chebyshev norm; parasitism; exploitation; egalitarianism
Online: 16 October 2017 (07:35:46 CEST)
|
|
Share this article with
×
Various distance metrics and their induced norms are employed in the quantitative modeling of evolutionary dynamics. Minimization of these distance metrics when applied to evolutionary optimization are hypothesized to result in different outcomes. Here, we apply the different distance metrics to the evolutionary trait dynamics brought about by the interaction between two competing species infected by parasites (exploiters). We present deterministic cases showing the distinctive selection outcomes under the Manhattan, Euclidean and Chebyshev norms. Specifically, we show how they differ in the time of convergence to the desired optima (e.g., no disease), and in the egalitarian sharing of carrying capacity between the competing species. However, when randomness is introduced to the population dynamics of parasites and to the trait dynamics of the competing species, the distinctive characteristics of the outcomes under the three norms become indistinguishable. Our results provide theoretical cases when evolutionary dynamics using different distance metrics exhibit similar outcomes.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; reduced sigma set Square-Root Unscented Kalman Filter; pseudo-satellite; UAV; GPS/INS tightly-coupled system
Online: 16 October 2017 (06:35:24 CEST)
|
|
Share this article with
×
In this paper, firstly, some questionable formulas and conceptual oversights of previous reduced sigma set unscented transformation (UT) methods are revised through theoretical analysis. Then the revised UT methods based Kalman filters are used in a GPS/INS tightly-coupled system. The Kalman filter flows are the kind of square-root, since the square-root unscented Kalman filters (SRUKFs) can guarantee the stability of the system. By using the reduced sigma set SRUKFs (which contain simplex sigma set square-root unscented Kalman filter (S-SRUKF), spherical simplex sigma set square-root unscented Kalman filter (SS-SRUKF) and minimum sigma set square-root unscented Kalman filter (M-SRUKF)), the computation cost is greatly saved compared with the standard SRUKF, while the accuracy of the GPS/INS tightly-coupled system still maintained. The structure of the GPS/INS tightly-coupled system is in the form of error state, and the time updates of the state and the state covariance of SRUKFs are directly estimated without using UT, thus the computational time is also greatly saved. The pseudo-satellite is introduced to aid the system when the observation information is deficient, for example, when the GPS signal is deficient in the maneuver environment. By using the pseudo-satellite, the optimal performance of the system is guaranteed. Experiment of unmanned aerial vehicle (UAV) showed that the pseudo-satellite aided mechanism worked well.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; HEVC; Interpolation filter; Sinc; DCT (discrete cosine transform); DST (discrete sine transform)
Online: 14 October 2017 (13:53:17 CEST)
|
|
Share this article with
×
High Efficiency Video Coding (HEVC) uses an 8-point filter and a 7-point filter, which are based on the discrete cosine transform (DCT), for the 1/2-pixel and 1/4-pixel interpolations, respectively. In this paper, discrete sine transform (DST)-based interpolation filters (IF) are proposed. The first proposed DST-based IFs (DST-IFs) use 8-point and 7-point filters for the 1/2-pixel and 1/4-pixel interpolations, respectively. The final proposed DST-IFs use 12-point and 11-point filters for the 1/2-pixel and 1/4-pixel interpolations, respectively. These DST-IF methods are proposed to improve the motion-compensated prediction in HEVC. The 8-point and 7-point DST-IF methods showed average BD-rate reductions of 0.7% and 0.3% in the random access (RA) and low delay B (LDB) configurations, respectively. The 12-point and 11-point DST-IF methods showed average BD-rate reductions of 1.4% and 1.2% in the RA and LDB configurations for the Luma component, respectively.
Preprint
|
|
|
Mathematics & Computer Science, Other; graph alignment; brain network; human connectome
Online: 12 October 2017 (04:07:33 CEST)
|
|
Share this article with
×
A growing area in neurosciences is focused on the modeling and analysis the complex system of connections in neural systems, i.e. the connectome. Here we focus on the representation of connectomes by using graph theory formalisms. The human brain connectomes are usually derived from neuroimages; the analyzed brains are co-registered in the image domain and brought to a common anatomical space. An atlas is then applied in order to define anatomically meaningful regions that will serve as the nodes of the network - this process is referred to as parcellation. Recently, it has been proposed to perform atlas-free random brain parcellation into nodes and align brains in the network space instead of the anatomical image space to define network nodes of individual brain networks. In the network domain, the question of comparison of the structure of networks arises. Such question is tackled by modeling the comparison of brain network as a network alignment (NA) problem. In this paper, we first defined the NA problem formally, then we applied three existing state of the art of multiple alignment algorithms (MNA) on diffusion MRI-derived brain networks and we compared the performances. The results confirm that MNA algorithms may be applied in cases of atlas-free parcellation for a fully network-driven comparison of connectomes.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; available bandwidth estimation techniques; active bandwidth estimation techniques; passive bandwidth estimation techniques; model based bandwidth estimation techniques
Online: 10 October 2017 (10:37:41 CEST)
|
|
Share this article with
×
Wireless communication has proliferated due to the colossal augmentation of smart phones, mobile phones, tablets and laptops etc. Multimedia applications such as live videos, audios, still images, animated graphics and live communications all requires accompaniments of quality of service (QoS) as well as reliable end-to-end transfer of data. Information about the availability of resources in channel is must in order to improve the QoS. QoS can be determined in terms of capacity of channel, available bandwidth (ABW), and bulk transfer capacity (BTC). Bandwidth availability is a key check for improving the QoS in a network. The performance of a multimedia application is directly affected by the bandwidth availability. One of the most important QoS characteristic is ABW at a wireless route and it can be demarcated as least unused capacity of links instituting a network route. Since now there have been many bandwidth estimation techniques are available in the literature to increase the network performance. Bandwidth estimation techniques have been arranged into three leading classifications: i) Active probing bandwidth estimation techniques, ii) Passive bandwidth estimation technique and iii) Model based bandwidth estimation techniques. Each of these techniques are briefly discussed in this paper.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; ARIMA; forecasting; fuzzy partition; fuzzy transform; time series
Online: 9 October 2017 (16:58:43 CEST)
|
|
Share this article with
×
We define a new seasonal forecasting method based on fuzzy transforms. We use the best interpolating polynomial for extracting the trend of the time series and generate the inverse fuzzy transform on each seasonal subset of the universe of discourse for predicting the value of a an assigned output. Like first example, we use the daily weather dataset of the municipality of Naples (Italy) starting from data collected from 2003 till to 2015 making predictions on the following outputs: mean temperature, max temperature and min temperature, all considered daily. Like second example, we use the daily mean temperature measured at the weather station “Chiavari Caperana” in the Liguria Italian Region. We compare the results with our method, the average seasonal variation, ARIMA and the usual fuzzy transforms concluding that the best results are obtained under our approach in both examples.
Preprint
|
|
|
Mathematics & Computer Science, Other; Biological Network; Graphs; Statistical Analysis
Online: 3 October 2017 (16:52:13 CEST)
|
|
Share this article with
×
Graphs are largely used in computer science to model relations, or associations, among entities the compose complex systems. More recently, they found a broad field of application in bioinformatics and medical informatics supporting modelling, analysis of many systems. The applications span from representing interactions among molecules within cells, to model the functions of the brains. In order to support research, algorithms from graph theory that are able to extract knowledge from network should be coupled to efficient visualisation techniques. Although the importance of such topic, we retain that many challenges should be faced in the futures, such as automated pathway and network layout to better match biologists’ needs, the developing of a standard able to give more and better choices to represent nodes, edges finally, the developing of automated mechanism able to improve the network navigation methods that help users manage large and complex networks with the goal to improve the usability.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; citizen science; volunteered geographical information; metadata; data quality; quality assurance; scientific workflow; provenance; metaquality; open data
Online: 3 October 2017 (13:52:29 CEST)
|
|
|
Share this article with
×
Environmental policy involving citizen science (CS) is of growing interest. In support of this open data stream, validation or quality assessment of the CS data and their appropriate usage for evidence-based policy making, needs a flexible and easily adaptable data curation process ensuring transparency. Addressing these needs, this paper describes an approach for automatic quality assurance as proposed by the Citizen OBservatory WEB (COBWEB) FP7 project. This approach is based upon a workflow composition that combines different quality controls, each belonging to seven categories or ‘pillars’. Each pillar focuses on a specific dimension in the types of reasoning algorithms for CS data qualification. These pillars attribute values to a range of quality elements belonging to three complementary quality models. Additional data from various sources, such as Earth Observation (EO) data, are often included as part of the inputs of quality controls within the pillars. However, qualified CS data can also contribute to the validation of EO data. Therefore, the question of validation can be considered as ‘two sides of the same coin’. Based on an invasive species CS study, concerning Fallopia japonica (Japanese knotweed), the paper discusses the flexibility and usefulness of qualifying CS data, either when using an EO data for the validation within the quality assurance process, or validating an EO data product that describes the risk of occurrence of the plant. Both validation paths are found to be improved by quality assurance of the CS data. Addressing the reliability of CS open data, issues and limitations of the role of quality assurance for validation, due to the quality of secondary data used within the automatic workflow, are described, e.g. error propagation, paving the route to improvements in the approach.
Preprint
|
|
|
Mathematics & Computer Science, Computational Mathematics; SPH; particle-based computational acoustics (PCA); meshfree method; GPU
Online: 29 September 2017 (10:07:57 CEST)
|
|
Share this article with
×
Smoothed particle hydrodynamics (SPH) is regarded as a pure Lagrangian approach, which can solve fluid dynamics problems without the creation of mesh. In this paper, a paralleled SPH solver is developed to solve particle-based computational acoustics (PCA). The aim of this paper is to study the feasibility of using SPH to solve acoustic problems and to improve the efficiency of solving processes by paralleling some procedures on GPU during calculating. A stand SPH code running serially in a CPU is proposed to solve wave equation. This is a wave propagating in a two-dimensional domain. After finishing the computation, the results are compared with the theoretical solutions and they agree well. So its feasibility is verified. There are two main methods for searching neighbor particles: all-pair search method and linked-list search method. Both methods are used in different codes to simulate an identical problem and their runtimes are compared to investigate their searching efficiencies. The runtime results show that linked-list search method has a higher efficiency, which can save a lot of searching time when simulating problems with huge amounts of particles. Furthermore, the percentages of different procedures’ runtimes in a simulation are also discussed to find the most consuming one. Then, some codes are modified to run in different GPUs and their runtimes are compared with those of serial ones on a CPU. Runtime results show that the paralleled algorithm can be more than 80 times faster than the serial one. The result shows that GPU paralleled SPH computing can achieve desirable accuracy and speed in solving acoustic problems.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; MQTT; command and control; c2
Online: 27 September 2017 (04:45:28 CEST)
|
|
Share this article with
×
This paper builds on previous work introducing the Secure Remote Update Protocol (SRUP)—a secure communications protocol for Command & Control applications in the Internet of Things, built on top of MQTT. This paper builds on the original protocol, and introduces a number of additional message types: adding additional capabilities to the protocol. We also discuss the difficulty of proving that a physical device has an identity corresponding with a logical device on the network, and propose a mechanism to overcome this within the protocol.
Preprint
|
|
|
Mathematics & Computer Science, Logic; Davis-Putnan Robinson-Matiyasevich theorem; Diophantine equation which has at most finitely many solutions in non-negative integers; Diophantine equation which has at most finitely many solutions in positive integers; Diophantine equation which has at most finitely many integer solutions; Hilbert’s Tenth Problem; Matiyasevich’s theorem; recursively enumerable set; Smoryński’s theorem
Online: 27 September 2017 (04:05:45 CEST)
|
|
Share this article with
×
We prove: (1) the set of all Diophantine equations which have at most finitely many solutions in non-negative integers is not recursively enumerable, (2) the set of all Diophantine equations which have at most finitely many solutions in positive integers is not recursively enumerable, (3) the set of all Diophantine equations which have at most finitely many integer solutions is not recursively enumerable, (4) analogous theorems hold for Diophantine equations D(x1, …, xp) = 0, where p ∈ N\{0} and for every i ∈ {1, …, p} the polynomial D(x1, …, xp) involves a monomial M with a non-zero coefficient such that xi divides M, (5) the set of all Diophantine equations which have at most k variables (where k ≥ 9) and at most finitely many solutions in non-negative integers is not recursively enumerable.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; Wikipedia; information quality; WikiRank; DBpedia
Online: 26 September 2017 (15:34:18 CEST)
|
|
Share this article with
×
Despite the fact that Wikipedia is often criticized for its poor quality, it continues to be one of the most popular knowledge base in the world. Articles in this free encyclopedia on various topics can be created and edited in about 300 different language versions independently. Our research showed that in language sensitive topics quality of information can be relatively better in the relevant language versions. However, in most cases it is difficult for the Wikipedia readers to determine the language affiliation of the described subject. Additionally, each language edition of Wikipedia can have own rules in manual assessing of the content quality. This makes automatic quality comparison of articles between various languages a challenging task. The paper presents results of relative quality and popularity assessment of over 28 million articles in 44 selected language versions. In addition, a comparative analysis of the quality and popularity of articles in some topics was conducted. The proposed method allows to find articles with information of better quality that can be used to automatically enrich other language editions of Wikipedia.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; vibrations
Online: 25 September 2017 (16:23:04 CEST)
|
|
Share this article with
×
This paper attempts to address the phenomenon of normal vibrations, (referred to as dynamic vibrations) occurring on a surface which is already in vibrational motion due to other kinematic phenomena. Such a surface will have a metric tensor, normal, and ambient velocity which diverges from the surface’s original various dynamic tensorial descriptors. This paper formulates the wave equation defined in a coordinate space, and extends the equation to observe vibrations on a surface with the use of the Laplace-Beltrami operator in a tensorial fashion drawing on conventions from the newly established Calculus of Moving Surfaces (CMS). The Paper then identifies the way which these normal vibrations will manifest within ambient space. Finally, a counter-intuitive relation between the magnitude of such dynamic vibrations and dynamic surface’s time-dependent mean curvature presents itself, for which dynamic vibrations superimposed on original dynamic motion will eliminate the other, and the surface remains static under an arbitrary initial motion. From this condition, resubstitution within the wave equation yields a novel coupled PDE system which within contains the time-evolution of the surface’s mean curvature and its dynamic vibrations. This analysis can have application for algorithms designed for mechanical stabilization during seismic activity, as well as analyzing stabilization algorithms for other various applications and can also have application with respect to biotechnological innovations for analyzing properties defined on the surface of cell-Like biological entities such as metabolism, lipid content, and actin dynamics.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; significance level; sample size; bayes ratio; likelihood function; optimal decision; significance test
Online: 25 September 2017 (08:33:18 CEST)
|
|
Share this article with
×
The main objective of this paper is to find a close link between the adaptive level of significance, presented here, and the sample size. We, statisticians, know of the inconsistency, or paradox, in the current classical tests of significance that are based on p-value statistics that is compared to the canonical significance levels (10%, 5% and 1%): "Raise the sample to reject the null hypothesis" is the recommendation of some ill-advised scientists! This paper will show that it is possible to eliminate this problem of significance tests. The Bayesian Lindley's paradox – "increase the sample to accept the hypothesis" – also disappears. Obviously, we present here only the beginning of a possible prominent research. The intention is to extend its use to more complex applications such as survival analysis, reliability tests and other areas. The main tools used here are the Bayes Factor and the extended Neyman-Pearson Lemma.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; laminated beam; exponential stability; Cattaneo’s law; semigroup theory
Online: 25 September 2017 (07:10:35 CEST)
|
|
Share this article with
×
In previous work (Z. Angew. Math. Phys. 68(2), 2017), Apalara considered a one dimensional thermoelastic laminated beam under Cattaneo’s law of heat conduction and proved the exponential and polynomial decay results depend on the stability number χT . In this paper, we continue to study the same system and show that the solution of the concerned system lacks of exponential decay result in the case χT ≠ 0 which solves the open problem proposed by Apalara (Z. Angew. Math. Phys. 68(2), 2017).
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; WSN; IoT; seawater temperature prediction; marine aquaculture support
Online: 23 September 2017 (11:31:13 CEST)
|
|
Share this article with
×
Aquaculture is growing ever more important due to the decrease in natural marine resources and increase inworldwide demand. To avoid losses due to aging and abnormalweather, it is important to predict seawater temperature in order to maintain a more stable supply, particularly for high value added products, such as pearls and scallops. The increase in species extinction is a prominent societal issue. Furthermore, in order to maintain a stable quality of farmed fishery, water temperature should be measured daily and farming methods altered according to seasonal stresses. In this paper, we propose an algorithm to estimate seawater temperature in marine aquaculture by combining seawater temperature data and actual weather data.
Preprint
|
|
|
Mathematics & Computer Science, Computational Mathematics; multivariate logarithmic polynomial; generating function; completely monotonic function; Bernstein function; integral representation; Lévy-Khintchine representation; real part; imaginary part; uniform convergence; recurrence relation; mathematical induction
Online: 23 September 2017 (10:55:57 CEST)
|
|
Share this article with
×
In the paper, by induction and recursively, the author proves that the generating function of multivariate logarithmic polynomials and its reciprocal are a Bernstein function and a completely monotonic function respectively, establishes a Lévy-Khintchine representation for the generating function of multivariate logarithmic polynomials, deduces an integral representation for multivariate logarithmic polynomials, presents an integral representation for the reciprocal of the generating function of multivariate logarithmic polynomials, computes real and imaginary parts for the generating function of multivariate logarithmic polynomials, derives two integral formulas, and denies the uniform convergence of a known integral representation for Bernstein functions.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; peak demand minimization; job scheduling; approximation algorithms; smart grid
Online: 22 September 2017 (10:08:35 CEST)
|
|
Share this article with
×
This paper examines an important problem in smart grid energy scheduling; peaks in power demand are proportionally more expensive to generate and provision for. The issue is exacerbated in local microgrids that do not benefit from the aggregate smoothing experienced by large grids. Demand-side scheduling can reduce these peaks by taking advantage of the fact that there is often flexibility in job start times. We focus attention on the case where the jobs are non-preemptible, meaning once started, they run to completion. The associated optimization problem is called the Peak Demand Minimization problem and has been previously shown to be NP-hard. Our results include an optimal fixed-parameter tractable algorithm, a polynomial-time approximation algorithm, as well as an effective heuristic that can also be used in an online setting of the problem. Simulation results show these methods can reduce peak demand by up to 50% versus on-demand scheduling for household power jobs.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; dual-frequency RFID; indoor localization; non line of sight; received signal strength; inertial measurement unit
Online: 15 September 2017 (14:18:59 CEST)
|
|
Share this article with
×
The mitigation of NLOS (non-line-of-sight) propagation conditions is one of main challenges in wireless signals based indoor localization. When RFID localization technology is applied in applications, RSS fluctuates frequently due to the shade and multipath effect of RF signal, which could result in localization inaccuracy. In particularly, when tags carriers are walking in LOS (line-of-sight) and NLOS hybrid environment, great attenuation of RSS will happen, which would result in great location deviation. The paper proposes an IMU-assisted (Inertial Measurement Unit) RFID based indoor localization in LOS/NLOS hybrid environment. The proposed method includes three improvements over previous RSS based positioning methods: IMU aided RSS filtering, IMU aided LOS/NLOS distinguishing and IMU aided LOS/NLOS environment switching. Also, CRLB (Cramér-Rao Low Bound) is calculated to prove theoretically that indoor positioning accuracy for proposed method in LOS/NLOS mixed environment is higher than position precision of only use RSS information. Simulation and experiments are conducted to show that proposed method can reduce the mean positioning error to around 3 meters without site survey.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; cognitive computing; cognition; AI; cognitive symbiosis; language; HCI
Online: 15 September 2017 (10:31:26 CEST)
|
|
Share this article with
×
Cognitive Computing has become a catchphrase in the technology world, with the promiseof new smart services offered by industry giants like IBM and Google. Recent technological advances in Artificial Intelligence (AI) have thrown into the public sphere some old questions about the relationship between machine computation and human intelligence. While much of the industry and media hype suggests that many traditional challenges have been overcome, we show examples from language processing which demonstrate that present day Cognitive Computing still struggles with fundamental, long-standing problems with AI. An alternative conceptualization of artificial intelligence is presented, following Licklider’s lead in adopting man-computer symbiosis as a metaphor for designing software systems that enhance human cognitive performance. A survey of existing proposals based on this view suggests that a distinction can be made between weak and strong versions of symbiosis. We propose a Strong Cognitive Symbiosis which dictates an interdependence rather than simply cooperation between human and machine functioning, and show two systems under development where the symbiotic relationship benefits both actors in achieving the task outcome.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; reconfiguration problems; algorithms; complexity
Online: 14 September 2017 (09:43:15 CEST)
|
|
Share this article with
×
Reconfiguration is concerned with relationships among solutions to a problem instance, where the reconfiguration of one solution to another is a sequence of steps such that each step produces an intermediate feasible solution. The solution space can be represented as a reconfiguration graph, where two vertices representing solutions are adjacent if one can be formed from the other in a single step. Work in the area encompasses both structural questions (Is the reconfiguration graph connected?) and algorithmic ones (How can one find the shortest sequence of steps between two solutions?) This survey discusses techniques, results, and future directions in the area.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; fuzzy number; ranking; preference relation
Online: 11 September 2017 (16:44:07 CEST)
|
|
Share this article with
×
In fuzzy decision problems, the ordering of fuzzy numbers is the basic problem. Among which, the fuzzy preference relation is the reasonable one to represent preference relation by a fuzzy membership function. This paper studies the Nakamura’s and Kołodziejczyk’s preference relations. Eight cases of representing different level of overlapping between two triangular fuzzy numbers are considered. We analyze the ranking behaviors of all possible combinations of decomposition and intersection of two fuzzy numbers for the Nakamura’s and Kołodziejczyk’s preference relations of these test cases. The results indicate that the decomposition and intersection can affect the fuzzy preference relations, thereby the final total order relation of fuzzy numbers.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; multi-order logarithmic number; multi-order logarithmic polynomial; explicit formula; identity; recurrence relation; inversion theorem; Bell polynomial of the second kind; Stirling number; determinantal inequality; product inequality; completely monotonic function; logarithmic convexity; Faa di Bruno formula
Online: 11 September 2017 (04:22:18 CEST)
|
|
Share this article with
×
In the paper, the author introduces the notions "multi-order logarithmic numbers" and "multi-order logarithmic polynomials", establishes an explicit formula, an identity, and two recurrence relations by virtue of the Faa di Bruno formula and two identities of the Bell polynomials of the second kind in terms of the Stirling numbers of the fi rst and second kinds, and constructs some determinantal inequalities, product inequalities, logarithmic convexity for multi-order logarithmic numbers and polynomials by virtue of some properties of completely monotonic functions.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; inequality; ratio; Bernoulli number; Riemann zeta function; Dirichlet eta function; accuracy
Online: 28 August 2017 (09:30:34 CEST)
|
|
Share this article with
×
In the paper, by virtue of some properties for the Riemann zeta function, the author finds a double inequality for the ratio of two consecutive Bernoulli numbers with even indexes and analyzes the approximating accuracy of the double inequality.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Bell number; Bell polynomial; generalization; explicit formula; inversion formula; inversion theorem; Stirling number; Bell polynomial of the second kind; determinantal inequality; product inequality; completely monotonic function; logarithmic convexity
Online: 26 August 2017 (09:12:05 CEST)
|
|
Share this article with
×
In the paper, the authors present unified generalizations for the Bell numbers and polynomials, establish explicit formulas and inversion formulas for these generalizations in terms of the Stirling numbers of the first and second kinds with the help of the Faà di Bruno formula, properties of the Bell polynomials of the second kind, and the inversion theorem connected with the Stirling numbers of the first and second kinds, construct determinantal and product inequalities for these generalizations with aid of properties of the completely monotonic functions, and derive the logarithmic convexity for the sequence of these generalizations.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; Bell polynomial; Bell number; Bell polynomial of the second kind; higher order derivative; generating function; Faa di Bruno formula; inversion theorem; Stirling number of the first kind; Stirling number of the second kind; explicit formula; inversion formula; logarithmically absolute monotonicity; logarithmically complete monotonicity; determinantal inequality; product inequality
Online: 25 August 2017 (08:41:30 CEST)
|
|
Share this article with
×
In the paper, the author (1) presents an explicit formula and its inversion formula for higher order derivatives of generating functions of the Bell polynomials, with the help of the Faà di Bruno formula, properties of the Bell polynomials of the second kind, and the inversion theorem for the Stirling numbers of the first and second kinds; (2) recovers an explicit formula and its inversion formula for the Bell polynomials in terms of the Stirling numbers of the first and second kinds, with the aid of the above explicit formula and its inversion formula for higher order derivatives of generating functions of the Bell polynomials; (3) constructs some determinantal and product inequalities and deduces the logarithmic convexity of the Bell polynomials, with the assistance of the complete monotonicity of generating functions of the Bell polynomials. These inequalities are main results of the paper.
Preprint
|
|
|
Mathematics & Computer Science, Other; seasonality; forecasting; pull and push models; denoising
Online: 25 August 2017 (08:21:40 CEST)
|
|
Share this article with
×
In this paper we develop a forecasting algorithm for recurrent patterns in consumer demand. We study this problem in two different settings: pull and push models. We discuss several features of the algorithm concerning sampling, periodic approximation, denoising and forecasting.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; non-equlibrium; stochastic systems; langevin equation; fokker-planck equation; time-dependent PDFs; gamma distribution
Online: 21 August 2017 (12:11:18 CEST)
|
|
Share this article with
×
Many systems in nature and laboratories are far from equilibrium and exhibit significant fluc- tuations, invalidating the key assumptions of small fluctuations and short memory time in or near equilibrium. A full knowledge of Probability Distribution Functions (PDFs), especially time- dependent PDFs, becomes essential in understanding far-from-equilibrium processes. We consider a stochastic logistic model with multiplicative noise, which has gamma distributions as stationary PDFs. We numerically solve the transient relaxation problem, and show that as the strength of the stochastic noise increases the time-dependent PDFs increasingly deviate from gamma distributions. For sufficiently strong noise a transition occurs whereby the PDF never reaches a stationary state, but instead forms a peak that becomes ever more narrowly concentrated at the origin. The addition of an arbitrarily small amount of additive noise regularizes these solutions, and re-establishes the existence of stationary solutions. In addition to diagnostic quantities such as mean value, standard deviation, skewness and kurtosis, the transitions between different solutions are analyzed in terms of entropy and information length, the total number of statistically distinguishable states that a system passes through in time.
Preprint
|
|
|
Mathematics & Computer Science, Other; carbon nano-fibers; 3-D braided composite material; damage detection; SVD
Online: 21 August 2017 (10:27:05 CEST)
|
|
Share this article with
×
Aiming at the damage detection and continuous monitoring of high efficiency composite structure, the method of carbon nano sensor embeded in the 3-D braided composite material specimen was put forward and the method of damage location for 3-D braided composite material was described. In this paper, the mechanical and electrical characteristics of carbon nano-fiber were analyzed. Considering the massive data of the health monitoring of composite processing, to ensure that the system has good real-time performance, quaternary matrix Singular Value Decomposition algorithm is proposed to simplify data and improve the efficiency of the algorithm. The existence of injury is determined and the damage location is calculated by comparing with key features of healthy specimen. Experimental results prove the method is feasible and effective.
Preprint
|
|
|
Mathematics & Computer Science, Other; energy system analysis; model challenges; open science; open source; energy modelling framework; oemof
Online: 21 August 2017 (03:02:34 CEST)
|
|
Share this article with
×
The research field of energy system analysis is dealing with increasingly complex energy systems and their respective challenges. Moreover, the requirement for open science has become a focal point of public interest. Both drivers have triggered the development of a broad range of (open) energy models and frameworks in recent years. However, there are hardly any approaches on how to evaluate these tools in terms of their capabilities to tackle energy system modelling challenges. This paper describes a first step towards a flexible evaluation of software to model energy systems. We propose a qualitative approach as an useful supplementary to existing model fact sheets and transparency checklists. We demonstrate the applicability by evaluating the newly developed “Open Energy Modelling Framework” with respect to existing challenges in energy system modelling. The case study results highlight that challenges related to complexity and scientific standards can be tackled to a large extent while the challenges of model utilization and interdisciplinary modelling are only tackled partially. However, the challenge of uncertainty remains for the most part unaddressed at present. Advantages of the evaluation approach lie in its simplicity, flexibility and transferability to other tools. Disadvantages mostly stem from its qualitative nature. Our analysis reveals that some challenges in the field of energy system modelling cannot be addressed by a software as they are on meta level like model result communication and interdisciplinary modelling.
Preprint
|
|
|
Mathematics & Computer Science, Computational Mathematics; expression; analytic property; Fuss–Catalan number; Catalan–Qi function; Catalan number; monotonicity; logarithmic convexity; complete monotonicity; minimality; inequality
Online: 15 August 2017 (08:36:23 CEST)
|
|
Share this article with
×
In the paper, the authors express the Fuss–Catalan numbers as several forms in terms of the Catalan–Qi function, find some analytic properties, including the monotonicity, logarithmic convexity, complete monotonicity, and minimality, of the Fuss–Catalan numbers, and derive a double inequality for bounding the Fuss–Catalan numbers.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; EMR; data preprocessing; text mining; information extraction; medical decision support system
Online: 15 August 2017 (05:46:43 CEST)
|
|
Share this article with
×
At present, medical institutes generally use EMR to record patient's condition, including diagnostic information, procedures performed and treatment results. EMR has been recognized as a valuable resource for large scale analysis. However, EMR has the characteristics of diversity, incompleteness, redundancy and privacy, which make it difficult to carry out data mining and analysis directly. Therefore, it is necessary to preprocess the source data in order to improve data quality and improve the data mining results. Different types of data require different processing technologies. Most structured data commonly needs classic preprocessing technologies, including data cleansing, data integration, data transformation and data reduction. For semi-structured or unstructured data, such as medical text, containing more health information, it requires more complex and challenging processing methods. The task of information extraction for medical texts mainly includes NER (Named Entity Recognition) and RE (Relation Extraction). In this paper, we introduce the process of EMR processing, including data collection, data preprocessing, data mining, evaluation and knowledge application, analyze the current status of the key technologies, such as data preprocessing and data mining, and provide an overview of the application domains and prospects of EMR mining technologies. Finally, we summarize the existing problems in the research of EMR mining, and review the development trends.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; air- or iron-cored coil; polar coordinates; fourier analysis; two-dimensional; subdomain technique
Online: 14 August 2017 (06:07:40 CEST)
|
|
Share this article with
×
This paper presents a new scientific contribution on the two-dimensional (2-D) subdomain technique in polar coordinates taking into account the finite relative permeability of the ferromagnetic material. The constant relative permeability corresponds to linear part of the nonlinear B(H) curve. As in conventional technique, the method of separation of variables and the Fourier’s series are used for the resolution of magnetostatic Maxwell’s equations in each region. Although, the general solutions of magnetic field in the subdomains and boundary conditions (BCs) between regions are different in the conventional and proposed method. In this later, the magnetic field solution in each subdomain is a superposition of two magnetic quantities in the two directions (i.e., r- and Q-axis) and the BCs between two regions are also in both directions. For example, the scientific contribution has been applied to an air- or iron-cored coil supplied by a constant current. The distribution of local quantities (i.e., the magnetic vector potential and flux density) has been validated by a corresponding 2-D finite-element analysis (FEA). The obtained semi-analytical results are in very good agreement with those of numerical method.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; identity; Bell polynomial; unnamed polynomial; explicit formula; inversion theorem; Stirling number; binomial coefficient
Online: 11 August 2017 (13:51:05 CEST)
|
|
Share this article with
×
In the paper, using two inversion theorems for the Stirling numbers and binomial coecients, employing properties of the Bell polynomials of the second kind, and utilizing a higher order derivative formula for the ratio of two di erentiable functions, the authors present two explicit formulas, a determinantal expression, and a recursive relation for a sequence of unnamed polynomials, derive two identities connecting the sequence of unnamed polynomials with the Bell polynomials, and recover a known identity connecting the sequence of unnamed polynomials with the Bell polynomials.
Preprint
|
|
|
Mathematics & Computer Science, Other; fuzzy set; ordered category; category of fuzzysets
Online: 9 August 2017 (06:39:47 CEST)
|
|
Share this article with
×
In modern mathematics, many concepts and ideas are described in terms of category theory. From this viewpoint, it is desirable to analyze what can be determined if, instead of the basic category of sets, we consider a similar category of fuzzy sets. In this paper, we describe a natural fuzzy analog of the category of sets and functions, and we show that, in this category, fuzzy relations (a natural fuzzy analogue of functions) can be determined in category terms -- of course, modulo 1-1 mapping of the corresponding universe of discourse and 1-1 re-scaling of fuzzy degrees.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; simplification; coefficient; ordinary differential equation; higher order Bernoulli number of the second kind; Stirling number of the first kind; Stirling number of the second kind; inversion formula; Bell polynomial of the second kind; Faà di Bruno formula.
Online: 8 August 2017 (07:59:57 CEST)
|
|
Share this article with
×
In the paper, by virtue of the Faà di Bruno formula, some properties of the Bell polynomials of the second kind, and an inversion formula for the Stirling numbers of the first and second kinds, the authors establish meaningfully and significantly two identities which simplify coefficients in a family of ordinary differential equations associated with higher order Bernoulli numbers of the second kind.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; identity; inverse matrix; explicit formula; generating function; Chebyshev polynomials of the second kind; Catalan number; triangular matrix; classical hypergeometric function; integral representation
Online: 7 August 2017 (15:49:11 CEST)
|
|
Share this article with
×
In the paper, the authors establish two identities to express the generating function of the Chebyshev polynomials of the second kind and its higher order derivatives in terms of the generating function and its derivatives each other, deduce an explicit formula and an identities for the Chebyshev polynomials of the second kind, derive the inverse of an integer, unit, and lower triangular matrix, present several identities of the Catalan numbers, and give some remarks on the closely related results including connections of the Catalan numbers respectively with the Chebyshev polynomials, the central Delannoy numbers, and the Fibonacci polynomials.
Preprint
|
|
|
Mathematics & Computer Science, Other; real‐time reconstruction; SLAM; kinect sensors; depth cameras; open source
Online: 7 August 2017 (11:03:23 CEST)
|
|
Share this article with
×
Given a stream of depth images with a known cuboid reference object present in the scene, we propose a novel approach for accurate camera tracking and volumetric surface reconstruction in real-time. Our contribution in this paper is threefold: (a) utilizing a priori knowledge of the cuboid reference object, we keep drift-free camera tracking without explicit global optimization; (b) we improve the fineness of the volumetric surface representation by proposing a prediction-corrected data fusion strategy rather than simple moving average, which enables accurate reconstruction of high-frequency details such as sharp edges of objects and geometries of high curvature; (c) we introduce a benchmark dataset CU3D containing both synthetic and real-world scanning sequences with ground-truth camera trajectories and surface models for quantitative evaluation of 3D reconstruction algorithms. We test our algorithm on our dataset and demonstrate its accuracy compared with other state-of-the-art algorithms. We release both our dataset and code as opensource1 for other researchers to reproduce and verify our results.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; simplification; coefficient; ordinary differential equation; higher order Frobenius–Euler number; Fa`a di Bruno formula; Bell polynomial of the second kind; inversion formula
Online: 4 August 2017 (15:47:44 CEST)
|
|
Share this article with
×
In the paper, by virtue of the Fa`a di Bruno formula, some properties of the Bell polynomials of the second kind, and the inversion formulas of binomial numbers and the Stirling numbers of the first and second kinds, the authors simplify meaningfully and significantly coefficients in two families of ordinary differential equations associated with higher order Frobenius–Euler numbers.
Preprint
|
|
|
Mathematics & Computer Science, Computational Mathematics; identity; generating function; Eulerian polynomial; higher order Eulerian polynomial; Stirling number; open problem
Online: 2 August 2017 (17:03:00 CEST)
|
|
Share this article with
×
In the paper, the authors establish two identities, which can be regarded as nonlinear differential equations, for the generating function of Eulerian polynomials, find two identities for the Stirling numbers of the second kind, and present two identities for Eulerian polynomials and higher order Eulerian polynomials, pose two open problems about summability of two finite sums involving the Stirling numbers of the second kind. Some of these conclusions meaningfully and significantly simplify several known results.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; stylometry; author identification; author verification; authorprofiling; stylistic inconsistency; text analysis; supervised learning; unsupervised learning; classification; forensics
Online: 2 August 2017 (12:38:17 CEST)
|
|
Share this article with
×
Electronic text stylometry is a collection of forensics methods that analyze the writing styles of input electronic texts in order to extract information about authors of the input electronic texts. Such extracted information could be the identity of the authors, or aspects of the authors, such as their gender, age group, ethnicity, etc. This survey paper presents the following contributions: 1) A description of all stylometry problems in probability terms, under a unified notation. To the best of our knowledge, this is the most comprehensive definition to date. 2) A survey of key methods, with a particular attention to data representation (or feature extraction) methods. 3) An evaluation of 23,760 feature extraction methods, which is the most comprehensive evaluation of feature extraction methods in the literature of stylometry to date. The importance of this evaluation is two fold. First, identifying the relative effectiveness of the features (since, currently, many are not evaluated jointly; e.g. syntactic n-grams are not evaluated against k-skip n-grams, and so forth). Second, thanks to our generalizations, we could evaluate novel grams, such as what we name compound grams. 4) The release of our associated Python feature extraction library, namely Fextractor. Essentially, the library generalizes all existing n-gram based feature extraction methods under the "at least l-frequent, dir-directed, k-skipped n-grams'', and allows grams to be diversely defined, including definitions that are based on high-level grammatical aspects, such as POS tags, as well as lower-level ones, such as distribution of function words, word shapes, etc. This makes the library, by far, the most extensive in this domain to date. 5) The construction, evaluation, and release of the first dataset for Emirati social media text. This evaluation represents the first evaluation of author identification against Emirati social media texts. Interestingly, we find that, when using our models and feature extraction library (Fextractor), authors could be identified significantly more accurately than what is reported with similarly sized datasets. The dataset also contains sub-datasets that represent other languages (Dutch, English, Greek and Spanish), and our findings are consistent across them.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; portfolio optimization; Kelly criterion; differential evolution; mean-variance
Online: 31 July 2017 (11:22:09 CEST)
|
|
Share this article with
×
Kelly's Criterion is well known among gamblers and investors as a method for maximizing the returns one would expect to observe over long periods of betting or investing. These ideas are conspicuously absent from portfolio optimization problems in the financial and automation literature. This paper will show how Kelly's Criterion can be incorporated into standard portfolio optimization models. The model developed here combines risk and return into a single objective function by incorporating a risk parameter. This model is then solved for a portfolio of 10 stocks from a major stock exchange using a differential evolution algorithm. Monte Carlo calculations are used to verify the accuracy of the results obtained from differential evolution. The results show that evolutionary algorithms can be successfully applied to solve a portfolio optimization problem where returns are calculated by applying Kelly's Criterion to each of the assets in the portfolio.
Preprint
|
|
|
Mathematics & Computer Science, Numerical Analysis & Optimization; physical layer security; semi-infinite programming; amplify-and-forward two-way relay; imperfect CSI; robust optimization
Online: 31 July 2017 (08:59:04 CEST)
|
|
Share this article with
×
This paper considers a two-way relay network, where two source nodes exchange messages through several relays in the presence of an eavesdropper, and the channel state information (CSI) of the eavesdropper is imperfectly known. The amplify-and-forward relay protocol is used and the relay beamforming weights are designed. The model is built up to minimize the total relay transmit power while guaranteeing the quality of service at users and preventing the eavesdropper from decoding the signals. Due to the imperfect CSI, a semi-infinite programming problem is obtained. An algorithm is proposed to solve the problem, and the iterative points are updated through the linesearch technique, where the feasibility are preserved during iterations. The optimality property is analyzed. The obtained subproblems are quadratic constrained quadratic programming problems, either with less than $4$ constraints or with only one variable, which are solved optimally. Simulation results demonstrate the importance of the proposed model, and imply that the proposed algorithm is efficient and converges very fast, where more than 85% of the problems are solved optimally.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; dynamic algorithms; distributed shortest paths; communication networks; routing protocols; power-law networks
Online: 28 July 2017 (06:06:35 CEST)
|
|
Share this article with
×
Efficiently solving the problem of computing, in a distributed fashion, the shortest paths of a graph whose topology dynamically changes over time is a core functionality of many today’s digital infrastructures, probably the most prominent example being communication networks. Many solutions have been proposed over the years for this problem that can be broadly classified into two categories, namely Distance-Vector and Link-State algorithms. Distance-Vector algorithms are widely adopted solutions when scalability and reliability are key issues or when nodes have either limited hardware resources, as they result in being very competitive approaches in terms of both the memory and the computational point of view. In this paper, we first survey some of the most established solutions of the Distance-Vector category. Then, we discuss some recent algorithmic developments in this area. Finally, we propose a new experimental study, conducted on a prominent category of network instances, namely generalized linear preference (GLP) power-law networks, to rank the performance of such solutions.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; S degree; S indices; topological indices; QSAR; QSPR
Online: 25 July 2017 (04:31:48 CEST)
|
|
Share this article with
×
Topological indices have been used to modeling biological and chemical properties of molecules in quantitive structure property relationship studies and quantitive structure activity studies. All the degree based topological indices have been defined via classical degree concept. In this paper we define a novel degree concept for a vertex of a simple connected graph: S degree. And also we define S indices of a simple connected graph by using the S degree concept. We compute the S indices for well-known simple connected graphs such as paths, stars, complete graphs and cycles.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; Gauss-exponential distribution; Gauss-Laplace distribution; stochastic vector representation; geometric measure representation; (p,q)-generalized polar coordinates; (p,q)-arc length; dynamic intersection proportion function; (p,q)-generalized Box-Muller simulation method; (p,q)-spherical uniform distribution; dynamic geometric disintegration
Online: 19 July 2017 (04:35:06 CEST)
|
|
Share this article with
×
For evaluating probabilities of arbitrary random events with respect to a given multivariate probability distribution, specific techniques are of great interest. An important two-dimensional high risk limit law is the Gauss-exponential distribution whose probabilities can be dealt with based upon the Gauss-Laplace law. The latter will be considered here as an element of the newly introduced family of (p,q)-spherical distributions. Based upon a suitably defined non-Euclidean arc-length measure on (p,q)-circles we prove geometric and stochastic representations of these distributions and correspondingly distributed random vectors, respectively. These representations allow dealing with the new probability measures similarly like with elliptically contoured distributions and more general homogeneous star-shaped ones. This is demonstrated at hand of a generalization of the Box-Muller simulation method. En passant, we prove an extension of the sector and circle number functions.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; smartphone accelerometers; dataset; human activity recognition; fall detection
Online: 18 July 2017 (13:16:10 CEST)
|
|
Share this article with
×
Smartphones, smartwatches, fitness trackers, and ad-hoc wearable devices are being increasingly used to monitor human activities. Data acquired by the hosted sensors are usually processed by machine-learning-based algorithms to classify human activities. The success of those algorithms mostly depends on the availability of training (labeled) data that, if made publicly available, would allow researchers to make objective comparisons between techniques. Nowadays, publicly available data sets are few, often contain samples from subjects with too similar characteristics, and very often lack of specific information so that is not possible to select subsets of samples according to specific criteria. In this article, we present a new smartphone accelerometer dataset designed for activity recognition. The dataset includes 11,771 activities performed by 30 subjects of ages ranging from 18 to 60 years. Activities are divided in 17 fine grained classes grouped in two coarse grained classes: 9 types of activities of daily living (ADL) and 8 types of falls. The dataset has been stored to include all the information useful to select samples according to different criteria, such as the type of ADL performed, the age, the gender, and so on. Finally, the dataset has been benchmarked with two different classifiers and with different configurations. The best results are achieved with k-NN classifying ADLs only, considering personalization, and with both windows of 51 and 151 samples.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; generalized functions; tempered distributions; regular functions; local functions; regularization-localization duality; regularity; Heisenberg’s uncertainty principle
Online: 17 July 2017 (06:25:18 CEST)
|
|
Share this article with
×
In this paper, we relate Poisson’s summation formula to Heisenberg’s uncertainty principle. They both express Fourier dualities within the space of tempered distributions and these dualities are furthermore the inverses of one another. While Poisson’s summation formula expresses a duality between discretization and periodization, Heisenberg’s uncertainty principle expresses a duality between regularization and localization. We define regularization and localization on generalized functions and show that the Fourier transform of regular functions are local functions and, vice versa, the Fourier transform of local functions are regular functions.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; prime graph; simple group; orthogonal groups; quasirecognition
Online: 10 July 2017 (09:01:04 CEST)
|
|
Share this article with
×
Let G be a finite group. The prime graph Γ(G) of G is defined as follows: The set of vertices of Γ(G) is the set of prime divisors of |G| and two distinct vertices p and p' are connected in Γ(G), whenever G has an element of order pp'. A non-abelian simple group P is called recognizable by prime graph if for any finite group G with Γ(G)=Γ(P), G has a composition factor isomorphic to P. In [4] proved finite simple groups 2Dn(q), where n ≠ 4k are quasirecognizable by prime graph. Now in this paper we discuss the quasirecognizability by prime graph of the simple groups 2D2k(q), where k ≥ 9 and q is a prime power less than 105.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; human activity analysis; human intention understanding; affective computing; data visualisation; depth data; head pose estimation; emotion recognition
Online: 10 July 2017 (08:26:31 CEST)
|
|
Share this article with
×
Affective computing in general and human activity and intention analysis in particular, is a rapidly growing field of research. Head pose and emotion changes, present serious challenges when applied to player’s training and ludology experience in serious games or analysis of customer satisfaction regarding broadcast and web services or monitoring a driver’s attention. Given the increasing prominence and utility of depth sensors, it is now feasible to perform large-scale collection of three-dimensional (3D) data for subsequent analysis. Discriminative random regression forests was selected in order to rapidly and accurately estimate head pose changes in unconstrained environment. In order to complete the secondary process of recognising four universal dominant facial expressions (happiness, anger, sadness and surprise), emotion recognition via facial expressions (ERFE) was adopted. After that, a lightweight data exchange format (JavaScript Object Notation-JSON) is employed, in order to manipulate the data extracted from the two aforementioned settings. Motivated by the need of generating comprehensible visual representations from different sets of data, in this paper we introduce a system capable of monitoring human activity through head pose and emotion changes, utilising an affordable 3D sensing technology (Microsoft Kinect sensor).
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; Internet of Things; data mining algorithms; GPU cluster; performance; energy consumption; reliability
Online: 6 July 2017 (12:40:22 CEST)
|
|
Share this article with
×
This paper aims to develop a low-cost, high-performance and high-reliability computing system to process large-scale data using common data mining algorithms in the Internet of Things computing. Considering the characteristics of IoT data processing, similar to mainstream high performance computing, we use a GPU cluster to achieve better IoT services. Firstly, we present an energy consumption calculation method (ECCM) based on WSN. Then, using the CUDA Programming model, we propose a Two-level Parallel Optimization Model (TLPOM) which exploits reasonable resource planning and common compiler optimization techniques to obtain the best blocks and threads configuration considering the resource constraints of each node. The key to this part is dynamic coupling Thread-Level Parallelism (TLP) and Instruction-Level Parallelism (ILP) to improve the performance of the algorithms without additional energy consumption. Finally, combining the ECCM and the TLPOM, we use the Reliable GPU Cluster Architecture (RGCA) to obtain a high-reliability computing system considering the nodes’ diversity, algorithm characteristics, etc. The results show that the performance of the algorithms significantly increased by 34.1%, 33.96% and 24.07% for Fermi, Kepler and Maxwell on average with TLPOM and the RGCA ensures that our IoT computing system provides low-cost and high-reliability services.
Preprint
|
|
|
Mathematics & Computer Science, Numerical Analysis & Optimization; Fuzzy forecasting, fuzzy-fluctuation trend, particle swarm optimization, fuzzy time series, fuzzy logical relationship
Online: 4 July 2017 (16:35:22 CEST)
|
|
Share this article with
×
Most of existing fuzzy forecasting models partition historical training time series into fuzzy time series and build fuzzy-trend logical relationship groups to generate forecasting rules. The determination process of intervals is complex and uncertainty. In this paper, we present a novel fuzzy forecasting model based on high-order fuzzy-fluctuation trends and the fuzzy-fluctuation logical relationships of the training time series. Firstly, we compare each data with the data of its previous day in historical training time series to generate a new fluctuation trend time series(FTTS). Then, fuzzify the FTTS into fuzzy-fluctuation time series(FFTS) according to the up, equal or down range and orientation of the fluctuations. Since the relationship between historical FFTS and the fluctuation trend of future is nonlinear, Particle Swarm Optimization (PSO) algorithm is employed to estimate the required parameters. Finally, use the acquired parameters to forecast the future fluctuations. In order to compare the performance of the proposed model with that of the other models, we apply the proposed method to forecast the Taiwan Stock Exchange Capitalization Weighted Stock Index (TAIEX) time series datasets. The experimental results and the comparison results show that the proposed method can be successfully applied in stock market forecasting or such kinds of time series. We also apply the proposed method to forecast Shanghai Stock Exchange Composite Index (SHSECI) to verify its effectiveness and universality.
Preprint
|
|
|
Mathematics & Computer Science, Other; big data； body area network；body sensor network；edge computing；Fog Computing； Medical Cyberphysical Systems； medical internet-of-things；telecare； tele-treatment；wearable devices
Online: 26 June 2017 (06:24:07 CEST)
|
|
Share this article with
×
In the era when the market segment of Internet of Things (IoT) tops the chart in various business reports, it is apparently envisioned that the field of medicine expects to gain a large benefit from the explosion of wearables and internet-connected sensors that surround us to acquire and communicate unprecedented data on symptoms, medication, food intake, and daily-life activities impacting one’s health and wellness. However, IoT-driven healthcare would have to overcome many barriers, such as: 1) There is an increasing demand for data storage on cloud servers where the analysis of the medical big data becomes increasingly complex; 2) The data, when communicated, are vulnerable to security and privacy issues; 3) The communication of the continuously collected data is not only costly but also energy hungry; 4) Operating and maintaining the sensors directly from the cloud servers are non-trial tasks.This book chapter defined Fog Computing in the context of medical IoT. Conceptually, Fog Computing is a serviceoriented intermediate layer in IoT, providing the interfaces between the sensors and cloud servers for facilitating connectivity, data transfer, and queryable local database. The centerpiece of Fog computing is a low-power, intelligent, wireless, embedded computing node that carries out signal conditioning and data analytics on raw data collected from wearables or other medical sensors and offers efficient means to serve telehealth interventions. We implemented and tested an fog computing system using the Intel Edison and Raspberry Pi that allows acquisition, computing, storage and communication of the various medical data such as pathological speech data of individuals with speech disorders, Phonocardiogram (PCG) signal for heart rate estimation, and Electrocardiogram (ECG)-based Q, R, S detection. The book chapter ends with experiments and results showing how fog computing could lessen the obstacles of existing cloud-driven medical IoT solutions and enhance the overall performance of the system in terms of computing intelligence, transmission, storage, configurable, and security. The case studies on various types of physiological data shows that the proposed Fog architecture could be used for signal enhancement, processing and analysis of various types of bio-signals.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; big data,；Hadoop； visualization； model
Online: 26 June 2017 (06:07:51 CEST)
|
|
Share this article with
×
In era of ever-expanding data and knowledge, we lack a centralized system that maps all the faculties to their research works. This problem has not been addressed in the past and it becomes challenging for students to connect with the right faculty of their domain. Since we have so many colleges and faculties this lies in the category of big data problem. In this paper, we present a model which works on the distributed computing environment to tackle big data. The proposed model uses apache spark as an execution engine and hive as database. The results are visualized with the help of Tableau that is connected to Apache Hive to achieve distributed computing.
Preprint
|
|
|
Mathematics & Computer Science, Numerical Analysis & Optimization; fractional neutral integro-differential equations; initial value problem; Caputo fractional derivative; Krasnoselskii's fixed point theorem
Online: 20 June 2017 (03:42:54 CEST)
|
|
Share this article with
×
In this paper, by means of the Banach fixed point theorem and the Krasnoselskii's fixed point theorem, we investigate the existence of solutions for some fractional neutral functional integro-differential equations involving infinite delay. This paper deals with the fractional equations in the sense of Caputo fractional derivative and in the Banach spaces. Our results generalize the previous works on this issue. Also, an analytical example is presented to illustrate our results.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; generalized triangular intuitionistic fuzzy geometric aggregation operator; triangular intuitionistic fuzzy number; intuitionistic fuzzy set; multi-criteria decision-making; attitudinal character; flexibility
Online: 14 June 2017 (05:55:52 CEST)
|
|
Share this article with
×
Intuitionistic fuzzy set, which can be represented using the triangular intuitionistic fuzzy number (TIFN), is a more generalized platform for expressing imprecise, incomplete and inconsistent information when solving multi-criteria decision-making problems, as well as for reflecting the evaluation information exactly in different dimensions. In this paper, the TIFN has been applied for solving some multi-criteria decision-making problems by developing a new triangular intuitionistic fuzzy geometric aggregation operator, that is the generalized triangular intuitionistic fuzzy ordered weighted geometric averaging (GTIFOWGA) operator, and defining some triangular intuitionistic fuzzy geometric aggregation operators including the triangular intuitionistic fuzzy weighted geometric averaging (TIFWGA) operator, the ordered weighted geometric averaging (TIFOWGA) operator and the hybrid geometric averaging (TIFHWGA) operator. Based on these operators, a new approach for solving multicriteria decision-making problems when the weight information is fixed has been proposed. Finally, the proposed method has been compared with some similar existing computational approaches by virtue of a numerical example to verify its feasibility and rationality.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; two-factor authentication; online training; biological and behavioral features; mimic control method with sound intensity
Online: 6 June 2017 (09:04:47 CEST)
|
|
Share this article with
×
This study examines the evolution of the two-factor authentication method and its adaptability to the online education system. Two-factor authentication is a security measure used especially in areas where information such as banking is valuable. Parallel to technological developments, it has developed as much as daily. It aims to take security one step forward because it is composed of two phases. Today, banking, IOT devices, public transport tickets and many other areas are used. Two-factor authentication methods against security attacks in the field of information are also being updated. In recent years, new technologies such as biometric (iris pattern, retinal pattern, etc.) or behavioral biometry (location tracking, walking information, touch speed etc.) were studied. Instead of physically studying somewhere like going to a course in modern society, online trainings become more advantageous. Most of these online trainings are given certificates such as participation certificate, success certificate, etc. The main problem here is whether the person who is being certified is true. In the study conducted in line with these details, there is a proposal for the application of the Mimic Control Method with Sound Intensity (MCMSI) method for on-line training by examining the two-factor authentication techniques up to the day.
Preprint
|
|
|
Mathematics & Computer Science, Other; pumped storage hydro unit; guide vane closing schemes; multi-objective optimization; enhanced multi-objective bacterial-foraging chemotaxis gravitational search algorithm (EMOBCGSA); hydraulic and mechanical constraints
Online: 2 June 2017 (07:56:05 CEST)
|
|
Share this article with
×
The optimization of guide vane closing schemes (OGVCS) of pumped storage hydro unit (PSHU) is the research field of cooperative control and optimal operation of pumped storage, wind power and solar power generation. This paper presents a OGVCS model of PSHU considering the rise rate of the unit rotational speed and the specific node pressure of each hydraulic unit, as well as various complicated hydraulic and mechanical constraints. OGVCS model is formulated as a multi-objective optimization problem to optimize conflictive objectives, i.e., unit rotational speed and water hammer pressure criteria. In order to realize the efficient solution of the OGVCS model, an enhanced multi-objective bacterial-foraging chemotaxis gravitational search algorithm (EMOBCGSA) is proposed to solve this problem, which adopts population reconstruction, adaptive selection chemotaxis operator of local searching strategy and Elite archive set to efficiently solve the multi-objective problem. Especially, novel constraints-handling strategy with eliminating and local search based on violation ranking is used to balance various hydraulic and mechanical constraints. Finally, simulation cases of complex extreme operating conditions (i.e., load rejection and pump outage) of ‘single tube-double units’ type PSHU system are conducted to verify the feasibility and effectiveness of the proposed EMOBCGSA in solving OGVCS problem. The simulation results indicate that the proposed EMOBCGSA can provide lower rise rate of the unit rotational speed and smaller water hammer pressure than other method established recently while considering various complex constraints in OGVCS problem.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; line extraction; morphological image processing; player tracking; sport videos
Online: 2 June 2017 (06:04:57 CEST)
|
|
Share this article with
×
Sports video analysis is an interesting and emerging field in the domain of computer vision. It has become a very popular subject among scholars all over the world in the last decade due to the need of automated classification of events such as offsides, in/out situations, goals and so on. The most important problem in sports video analysis is detection and tracking of ball and players. Extraction of court lines is also another important problem since it is necessary in the classification of aforementioned events. In this study, considering some of the previous work on the subject, we develop a method for tracking the ball and players in tennis videos where the camera position and orientation is supposed fixed.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; probability; inference; information theory; Bayesian; generalized mean
Online: 1 June 2017 (05:49:21 CEST)
|
|
Share this article with
×
An approach to the assessment of probabilistic inference is described which quantifies the performance on the probability scale. From both information and Bayesian theory, the central tendency of an inference is proven to be the geometric mean of the probabilities reported for the actual outcome and is referred to as the “Accuracy.” Upper and lower error bars on the accuracy are provided by the arithmetic mean and the -2/3 mean. The arithmetic is called the “Decisiveness” due to its similarity with the cost of a decision and the -2/3 mean is called the “Robustness”, due to its sensitivity to outlier errors. Visualization of inference performance is facilitated by plotting the reported model probabilities versus the histogram calculated source probabilities. The visualization of the calibration between model and source is summarized on both axes by the arithmetic, geometric, and -2/3 means. From information theory, the performance of the inference is related to the cross-entropy between the model and source distribution. Just as cross-entropy is the sum of the entropy and the divergence; the accuracy of a model can be decomposed into a component due to the source uncertainty and the divergence between the source and model. Translated to the probability domain these quantities are plotted as the average model probability versus the average source probability. The divergence probability is the average model probability divided by the average source probability. When an inference is over/under-confident, the arithmetic mean of the model increases/decreases, while the -2/3 mean decreases/increases, respectively.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; vehicle to vehicle communications; vehicle to infrastructure communications; network security; mobile ad-hoc networks
Online: 1 June 2017 (04:51:57 CEST)
|
|
Share this article with
×
Vehicle to vehicle (V2V) and Vehicle to infrastructure (V2I) or briefly V2X communications are the one of hot topics in automotive industry. Therefore, this situation is providing many advantages of connected vehicles and infrastructures which bring to human life. For instance, vehicles and road infrastructures which shares information with each other, provides a neat flow regulation, more ordered traffic flow and therefore jammed traffic dependent accident’s percentage will be decreased. On the other hand, security is the most important issue for these systems because the operation of V2X networks is completely dependent on uninterrupted and accurate information sharing. In the light of these information, in this paper we review security issues and current solution architectures. We also propose some open problems in this lively field.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; extended Mittag–Leffler function; Wright-type hypergeometric functions; extended Wright-type hypergeometric functions
Online: 31 May 2017 (15:58:34 CEST)
|
|
Share this article with
×
The main aim of this paper is to establish two generalized integral formulas involving the extended Mittag–Leffler function based on the well known Lavoie and Trottier integral formula and the obtain results are express in term of extended Wright-type function. Also, we establish certain special cases of our main result.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; digital forensic tool, mobile application forensics, geolocation, Upsight, Pokémon GO, Pokémon GO Plus
Online: 29 May 2017 (11:21:56 CEST)
|
|
Share this article with
×
As the geolocation capabilities of smartphones continue to improve, developers have continued to create more innovative applications that rely on this location information for their primary function. This can be seen with Niantic's release of Pokémon GO, which is a massively multiplayer online role playing and augmented reality game. This game became immensely popular within just a few days of its release. However, it also had the propensity to be a distraction to drivers resulting in numerous accidents, and was used to as a tool by armed robbers to lure unsuspecting users into secluded areas. This facilitates a need for forensic investigators to be able to analyze the data within the application in order to determine if it may have been involved in these incidents. Because this application is new, limited research has been conducted regarding the artifacts that can be recovered from the application. In this paper, we aim to fill the gaps within the current research by assessing what forensically relevant information may be recovered from the application, and understanding the circumstances behind the creation of this information. Our research focuses primarily on the artifacts generated by the Upsight analytics platform, those contained within the bundles directory, and the Pokémon Go Plus accessory. Moreover, we present our new application specific analysis tool that is capable of extracting forensic artifacts from a backup of the Android application, and presenting them to an investigator in an easily readable format. This analysis tool exceeds the capabilities of UFED Physical Analyzer in processing Pokémon GO application data.
Preprint
|
|
|
Mathematics & Computer Science, Other; mathematics; videogame; education; self-competency; randomized controlled trial
Online: 29 May 2017 (10:32:30 CEST)
|
|
Share this article with
×
Development of early math skills is linked to future success in mathematics and other academics. Educational videogames have been shown to promote academic achievement; however, few rigorous studies have evaluated the use of educational videogames in supporting math development, especially in early primary education. In the current study, an open-label randomized controlled trial was conducted involving 134 first grade students to determine, using standardized assessments, the impact of the educational mathematics tablet-based videogame, Knowledge Battle, on math scores and self-competency. Overall, Knowledge Battle did improve math skills in participants who played the game. Among those with lower pre-game math skills, the Knowledge Battle group’s mean math score increased more than the control group’s mean math score (9.7 vs. 6.0; p=0.02). There was no association between perceived sense of self-competency and total math score (p=0.8141). However, players who had a higher sense of self-competency were more likely to enjoy playing the game. In conclusion, our findings suggest that Knowledge Battle was an acceptable and enjoyable educational mathematical videogame for first grade students, and may be most impactful for those with low math skills.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; Boiling Water Reactors; density wave oscillations; stability monitor; Shannon Entropy; noise-assisted Empirical Mode Decomposition variants; mode-mixing; Hilbert-Huang transform; instantaneous frequency
Online: 29 May 2017 (10:28:28 CEST)
|
|
Share this article with
×
There are currently around 78 Nuclear Power Plants (NPP) in the world based on Boiling Water Reactors (BWR). The current parameter to assess BWR instability issues is the linear Decay Ratio (DR). However, it is well known that BWRs are complex non-linear dynamical systems that may even exhibit chaotic dynamics that normally preclude the use of the DR when the BWR is working at a specific operating point during instability. In this work a novel methodology based on an adaptive Shannon Entropy estimator and on Noise Assisted Empirical Mode Decomposition variants is presented. This methodology was developed for real-time implementation of a stability monitor. This methodology was applied to a set of signals stemming from several NPPs reactors (Ringhals-Sweden, Forsmark-Sweden and Laguna Verde-Mexico) under commercial operating conditions, that experienced instabilities events, each one of a different nature
Preprint
|
|
|
Mathematics & Computer Science, General Mathematics; long-range dependence; Hurst effect; fractionallydifferenced models; Mandelbrot
Online: 26 May 2017 (18:36:50 CEST)
|
|
Share this article with
×
Long memory plays an important role in many fields by determining the behaviour and predictability of systems; for instance, climate, hydrology, finance, networks and DNA sequencing. In particular, it is important to test if a process is exhibiting long memory since that impacts the accuracy and confidence with which one may predict future events on the basis of a small amount of historical data. A major force in the development and study of long memory was the late Benoit B. Mandelbrot. Here we discuss the original motivation of the development of long memory and Mandelbrot's influence on this fascinating field. We will also elucidate the sometimes contrasting approaches to long memory in different scientific communities
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; wireless sensor network; object tracking; dual sink; data collection
Online: 26 May 2017 (04:58:00 CEST)
|
|
Share this article with
×
Continuous object tracking in WSNs, such as monitoring of mud-rock flows, forest fires etc., is a challenging task due to characteristic nature of continuous objects. They can appear randomly in the network field, move continuously, and can change in size and shape. Monitoring such objects in real-time generally require tremendous amount of messaging between sensor nodes to synergistically estimate object’s movement and track its location. In this paper, we propose a novel twofold-sink mechanism, comprising of a mobile and a static sink node. Both sink nodes gather information about boundary sensor nodes, which is then used to uniformly distribute energy consumption across all network nodes, thus helping in saving residual energy of network nodes. Numerous object tracking schemes, using mobile sink, have been proposed in the literature. However, existing schemes employing mobile sink cannot be applied to track continuous objects, because of momentous variation of network topology. Therefore, we present in this paper a mechanism, transformed from K-means algorithm, to find the best sensing location of the mobile sink node. It helps to reduce transmission load on the intermediate network nodes situated between static sink node and the ordinary network sensing nodes. The simulation results show that the proposed scheme can distinctly improve life time of the network, compared to one-sink protocol employed in continuous object tracking.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; accuracy; depth data; RMS error; 3D vision sensors; stereo disparity
Online: 23 May 2017 (09:20:27 CEST)
|
|
Share this article with
×
We propose an approach for estimating the error in depth data provided by generic 3D sensors, which are modern devices capable of generating an image (RGB data) and a depth map (distance) or other similar 2.5D structure (e.g. stereo disparity) of the scene. Our approach starts capturing images of a checkerboard pattern devised for the method. Then proceed with the construction of a dense depth map using functions that generally comes with the device SDK (based on disparity or depth). The 2D processing of RGB data is performed next to find the checkerboard corners. Clouds of corner points are finally created (in 3D), over which an RMS error estimation is computed. We come up with a multi-platform system and its verification and evaluation has been done, using the development kit of the board nVIDIA Jetson TK1 with the MS Kinects v1/v2 and the Stereolabs ZED camera. So the main contribution is the error determination procedure that does not need any data set or benchmark, thus relying only on data acquired on-the-fly. With a simple checkerboard, our approach is able to determine the error for any device. Envisioned application is on 3D reconstruction for robotic vision, with a series of 3D vision sensors embarked in robots (UAV of type quadcopter and terrestrial robots) for high-precision map construction, which can be used for sensing and monitoring.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; evolutionary stable strategies (ESS); Markov decision evolutionary games (MDEG); Hawk-Dove game; evolutionary dynamics; evolutionary game theory
Online: 18 May 2017 (03:34:39 CEST)
|
|
Share this article with
×
A new evolutionary game is introduced which incorporates states and actions into the strategies of the organisms of the evolving populations. The game centrally features actions that result in demographic flow between states that may not conserve organism numbers. It is by this feature that the game encapsulate a range of other evolutionary games, and can encode almost very complex interactions between organisms, species and populations. The game's formalism is expounded and the nature of the game's equilibrium is discussed. This discussion leads to an algorithm for numerically determining the stable equilibrium points which is exemplified in the context of a modified Hawk-Dove game. The game's flexibility for modeling population dynamics is evaluated and compared with other evolutionary games.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; linear programming; optimization; quantum algorithms; complexity
Online: 17 May 2017 (06:22:36 CEST)
|
|
Share this article with
×
Quantum computers are machines that are designed to use quantum mechanics in order to improve upon classical computers by running quantum algorithms. One of the main applications of quantum computing is solving optimization problems. For addressing optimization problems, we can use linear programming. Linear programming is a method to obtain the best possible outcome in a special case of mathematical programming. Application areas of this problem consist of resource allocation, production scheduling, parameter estimation, etc. In our study, we look at quantum speedup ratios of HHL Algorithm for different scenarios of linear programming. In a first scenario we look quantum speedup ratio (S(N)) as a function of phase transition and the ratio (κ) between the greatest and smallest eigenvalues of the matrix in linear equation system. As a second scenario, we investigate the changes in S(N) as a function of κ and s, which is the coefficient for defining the matrix as s-sparse.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; Mobile device threats; mobile device malware; reverse proxy server; cyber security; android security; ios security; abuse of local area network; DNS spoofing; DNS hijacking
Online: 16 May 2017 (13:23:18 CEST)
|
|
Share this article with
×
Mobile devices have become tools we spend our free time where we carry them with us every moment, they allow us to interact with the environment, we immortalize the moment when necessary. These devices which we spend most of our daily life become very common in recent years and even there are unique business areas emerged. It was announced that the number of people using smartphones is over than 2.5 billion in the first quarter of 2016. As people become more addicted to mobile technology, they become the target of malevolent people. A huge increase in the number of mobile malware is observed as the number of the users increase. Billions of users at risk day by day due to the development of the methods. We have addressed the recent methods used and the types of malware that target mobile devices in our study. We have mentioned the proxy server and reverse proxy server operation logic. We discuss the method of turning mobile devices into reverse proxy servers, risks involved and protection methods.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; linear programming; optimization; quantum algorithms; complexity
Online: 16 May 2017 (12:31:40 CEST)
|
|
Share this article with
×
Quantum computers are machines that are designed to use quantum mechanics in order to improve upon classical computers by running quantum algorithms. One of the main applications of quantum computing is solving optimization problems. For addressing optimization problems we can use linear programming. Linear programming is a method to obtain the best possible outcome in a special case of mathematical programming. Application areas of this problem consist of resource allocation, production scheduling, parameter estimation, etc. In our study, we looked at the duality of resource allocation problems. First, we chose a real world optimization problem and looked at its solution with linear programming. Then, we restudied this problem with a quantum algorithm in order to understand whether if there is a speedup of the solution. The improvement in computation is analysed and some interesting results are reported.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; quantum discord; entanglement; negativity; violation of Bell inequalities; decoherence
Online: 11 May 2017 (16:05:33 CEST)
|
|
Share this article with
×
Quantum Correlations are studied extensively in quantum information domain. Entanglement Measures and Quantum Discord are good examples of these actively studied correlations. Detection of violation in Bell inequalities is also a widely active area in quantum information theory world. In this work, we revisit the problem of analyzing the behavior of quantum correlations and violation of Bell inequalities in noisy channels. We extend the problem defined in a recent study by observing the changes in negativity measure, quantum discord and a modified version of Horodecki measure for violation of Bell inequalities under amplitude damping, phase damping and depolarizing channels. We report different interesting results for each of these correlations and measures. All these correlations and measures decrease under decoherence channels, but some changes are very dramatical comparing to others. We investigate also separability conditions of example studied states.
Preprint
|
|
|
Mathematics & Computer Science, Other; user authentication; multi server; internet of things; formal verification; security
Online: 9 May 2017 (04:38:37 CEST)
|
|
Share this article with
×
In recent years, the internet of things has been widely utilized in various fields, such as in smart factories or connected cars. As its domain of application has expanded, it has begun to be employed using multi-server architectures for a more efficient use of resources. However, because users wishing to receive IoT services connect to multi-servers over wireless networks, this can expose systems to various attacks and result in serious security risks. To protect systems (and users) from potential security vulnerabilities, a secure authentication technology is necessary. In this paper, we propose a smart card-based authentication protocol, which performs the authentication for each entity by allowing users to go through the authentication process using a smart card transmitted from an authentication server, and to login to a server connected to the IoT. Furthermore, the security of our proposed authentication protocol is verified by simulating a formal verification scenario using AVISPA, a security protocol-verification tool.
Preprint
|
|
|
Mathematics & Computer Science, Other; Android permissions; Android IoT platform; Android update; Android application
Online: 9 May 2017 (04:30:47 CEST)
|
|
Share this article with
×
The Android-based IoT platform just like the existing Android provides an environment that makes it easy to utilize Google's infrastructure services including development tools and APIs through which it helps to control the sensors of IoT devices. Applications running on the Android-based IoT platform are often UI free and are used without the user’s consent to registered permissions. It is difficult to respond to the misuse of permissions as well as to check them when they are registered indiscriminately while updating applications. This paper analyzes the versions of before and after an application the update running on the Android-based IoT platform and the collected permission lists. It aims to identify the same permissions before and after the update, and deleted and newly added permissions after the update were identified, and thereby respond to security threats that can arise from the permissions that is not needed for IoT devices to perform certain functions.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; Bayesian reliability analysis; Bayesian hierarchical model; MCMC method; scale mixtures of log-normal failure time model; stochastic constraint; two-stage MaxEnt prior.
Online: 4 May 2017 (16:26:10 CEST)
|
|
Share this article with
×
This paper develops Bayesian inference in reliability of a class of scale mixtures of log-normal failure time (SMLNFT) models with stochastic (or uncertain) constraint in their reliability measures. The class is comprehensive and includes existing failure time (FT) models (such as log-normal, log-Cauchy, and log-logistic FT models) as well as new models that are robust in terms of heavy-tailed FT observations. Since classical frequency approaches to reliability analysis based on the SMLNFT model with stochastic constraint are intractable, the Bayesian method is pursued utilizing a Markov chain Monte Carlo (MCMC)
sampling based approach. This paper introduces a two-stage maximum entropy (MaxEnt) prior, which elicits a priori uncertain constraint and develops Bayesian hierarchical SMLNFT model by using the prior. The paper also proposes an MCMC method for Bayesian inference in the SMLNFT model reliability and calls attention to properties of the MaxEnt prior that are useful for method development. Finally, two data sets are used to illustrate how the proposed methodology works.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; Lévy--Khintchine representation; integral representation; bivariate mean; bivariate complex geometric mean; reciprocal; Heronian mean; application
Online: 4 May 2017 (08:44:25 CEST)
|
|
Share this article with
×
In the paper, the authors survey integral representations (including the Lévy--Khintchine representations) and applications of some bivariate means (including the logarithmic mean, the identric mean, Stolarsky's mean, the harmonic mean, the (weighted) geometric means and their reciprocals, and the Toader--Qi mean) and the multivariate (weighted) geometric means and their reciprocals, derive integral representations of bivariate complex geometric mean and its reciprocal, and apply these newly-derived integral representations to establish integral representations of Heronian mean of power 2 and its reciprocal.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; image segmentation; wireless sensor node deployment; plant growth simulation algorithm; disaster management
Online: 4 May 2017 (06:02:31 CEST)
|
|
Share this article with
×
The use of unmanned aerial vehicle (UAV) during emergency response of a disaster has been widespread in recent years and the terrain images captured by the cameras on board these vehicles are significant sources of information for such disaster monitoring operations. Thus, analyzing such images are important for assessing the terrain of interest during such emergency response operations. Further, these UAVs are mainly used in disaster monitoring systems for the automated deployment of sensor nodes in real time. Therefore, deploying and localizing the wireless sensor nodes optimally, only in the regions of interest that are identified by segmenting the images captured by UAVs, hold paramount significance thereby effecting their performance. In this paper, the highly effective nature-inspired Plant Growth Simulation Algorithm (PGSA) has been applied for the segmentation of such terrestrial images and also for the localization of the deployed sensor nodes. The problem is formulated as a multi-dimensional optimization problem and PGSA has been used to solve it. Furthermore, the proposed method has been compared to other existing evolutionary methods and simulation results show that PGSA gives better performance with respect to both speed and accuracy unlike other techniques in literature.
Preprint
|
|
|
Mathematics & Computer Science, Other; neutrosophic sets; neutrosophic logic; bézier curve
Online: 27 April 2017 (02:54:02 CEST)
|
|
Share this article with
×
In this paper, a geometric model is introduced for Neutrosophic data problem for the first time. This model is based on neutrosophic sets and neutrosophic relations. Neutrosophic control points are defined according to these points, resulting in neutrosophic Bézier curves.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; Hierarchical search; Image retrieval; Multi-feature fusion
Online: 26 April 2017 (18:51:42 CEST)
|
|
Share this article with
×
Aiming at the problems that are poor generalization performance, low retrieval accuracy and large time consumption of existing content-based image retrieval system, the hierarchical image retrieval method based on multi feature fusion is proposed in this paper. The retrieval accuracy rates on Corel5K, UKbeach and Holidays are 68.23(Top 1), 3.73(N-S) and 88.20(mAp), respectively. The experimental results show that the method proposed in this paper can effectively improve the deficiency of single feature retrieval and save time significantly in the premise of a small amount of loss of accuracy.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; AI Agents; emotive layer; judgement; behaviour; probability; decision-making; gameplay; backpropagation.
Online: 21 April 2017 (12:07:53 CEST)
|
|
Share this article with
×
AI is often looked at as a logical rational way to develop a games agent that methodically looks at options and delivers rational solutions. This paper is based on developing an AI agent that plays a game with a similar emotive content like a human. The purpose of the study was to see if the incorporation of this emotive content would influence the outcomes within the game Love Letter. In order to do this an AI agent with an emotive layer was developed to paly the game over a million times. A lower win/loss ratio demonstrates that to some extent this methodology was vindicated and a 100 per cent win for the AI agent did not happen. Machine learning techniques were modelled purposely so as to match extreme models of behavioural change. The results demonstrated a win/loss ration of 0.67 for the AI agent and in many ways reflectd the frustration that a normal player would exhibit during game play. As was hypothesised the final agent investment value was, on average, lower after matchplay than its initial value.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; quantum information; entanglement; entaglement measures; entanglement monotones
Online: 21 April 2017 (08:47:32 CEST)
|
|
Share this article with
×
Quantum information theory and quantum computing are theoritical basis of quantum computers. Thanks to entanglement, quantum mechanical systems are provisioned to realize many information processing problems faster than classical counterparts. For example, Shor’s factorization algorithm, Grover’s search algorithm, quantum Fourrier transformation, etc. Entanglement, is the theoretical basis providing the expected speedups. It can be view in bipartite or multipartite forms. In order to quantify entanglement, some measures are defined. On the other hand, a general and accepted criterion, which can measure the amount of entanglement of multilateral systems, has not yet been found. In this work, we make a short review of recent research on the topic entanglement monotones and measures with an analitical approach.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; quantum metrology; quantum fisher ınformation; decoherence; optimization
Online: 21 April 2017 (06:17:36 CEST)
|
|
Share this article with
×
Entanglement is at the heart of quantum technologies such as quantum information and quantum metrology. Providing larger quantum Fisher information (QFI), entangled systems can be better resources than separable systems in quantum metrology. QFI topic is a very active research area and it has many possible usage areas in quantum information domain. In this study, we review quantum Fisher information research with both from theoritical and application perspective.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; HTN planning; real-time strategy game; plan repair
Online: 19 April 2017 (04:41:22 CEST)
|
|
Share this article with
×
Real-time strategy (RTS) game has proposed many challenges for AI research for its large state spaces, enormous branch factors, limited decision time and dynamic adversarial environment. To tackle above problems, the method called Adversarial Hierarchical Task Network planning (AHTN) has been proposed and achieves favorable performance. However, the HTN description it used cannot express complex relationships among tasks and impacts of environment on tasks. Moreover, the AHTN cannot handle task failures during plan execution. In this paper, we propose a modified AHTN planning algorithm named AHTNR. The algorithm introduces three elements essential task, phase and exit condition to extend the HTN description. To deal with possible task failures, the AHTNR first uses the extended HTN description to identify failed tasks. And then a novel task repair strategy is proposed based on historical information to maintain the validity of previous plan. Finally, empirical results are presented for the μRTS game, comparing AHTNR to the state-of-the-art search algorithms for RTS games.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; Body sensor network; Smart home, knowledge discovery in BSN data; frequent patterns; periodic patterns and productive pattern.
Online: 18 April 2017 (18:15:50 CEST)
|
|
Share this article with
×
The understanding of various health-oriented vital sign data generated from body sensor networks (BSN) and discovery of the association between the generated parameters is an important task that may assist and promote important decision making in healthcare. For example, in a smart home scenario where the occupants’ health status is continuously monitored remotely, it is essential to provide required assistance when an unusual or critical situation is detected in their vital sign data. In this paper, we present an efficient approach to mine the incomplete (partial) periodic patterns obtained from BSN data. In addition, we employ a correlation test on the generated patterns and introduce the productive-associated partial periodic frequent patterns as the set of correlated partial periodical frequent items. The combination of these measures has the advantage of empowering healthcare providers and patients for quality of diagnosis, and also for better treatment and smart care, especially for the elderly people at smart home. We developed an efficient algorithm named PPFP-Growth (Productive Periodic Frequent Pattern growth) to discover all productive associated partial periodic patterns using these measures. PPFP-Growth is efficient, and the productiveness measure removes uncorrelated periodic items. An experimental evaluation on synthetic and real datasets shows the efficiency of the proposed PPFP-Growth algorithm, and can filter a huge number of partial periodic patterns to reveal only the correlated ones.
Preprint
|
|
|
Mathematics & Computer Science, Other; symmetric nonnegative matrix factorization; similarity network fusion; human microbiome; multi-view clustering
Online: 18 April 2017 (03:31:04 CEST)
|
|
Share this article with
×
Integration of multi-view datasets which are comprised of heterogeneous sources or different representations is challenging to understand the subtle and complex relationship in data. Such data integration methods attempt to combine efficiently the complementary information of multiple data types to construct a comprehensive view of underlying data. Nonnegative matrix factorization (NMF), an approach that can be used for signal compression and noise reduction, has aroused widespread attention in the last two decades. The Kullback–Leibler divergence (or relative entropy) information distance can be used to measure the loss function of NMF. In this article, we propose a fast and robust framework (RSNMF) based on symmetric nonnegative matrix factorization (SNMF) and similarity network fusion (SNF) for clustering human microbiome data including functional, metabolic and phylogenetic profiles. Many existing methods typically utilize all the information provided by each view to create a consensus representation, which often suffers a lot from noise in data and cannot provide a precise representation of the latent data structures. In contrast, RSNMF combines the strength of SNMF and the advantage of SNF to form a robust clustering indicator matrix thus can reduce the noise influence. We conduct experiments on one synthetic and two real dataset (microbiome data, text data) and the results show that the proposed RSNMF has better performance over the baseline and the state-of-art methods, which demonstrates the potential application of RSNMF for microbiome data analysis.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; clustering algorithm; k-prototypes algorithm, partial distance computation
Online: 17 April 2017 (11:08:26 CEST)
|
|
Share this article with
×
The k-means is one of the most popular and widely used clustering algorithm, however, it is limited to only numeric data. The k-prototypes algorithm is one of the famous algorithms for dealing with both numeric and categorical data. However, there have been no studies to accelerate k-prototypes algorithm. In this paper, we propose a new fast k-prototypes algorithm that gives the same answer as original k-prototypes. The proposed algorithm avoids distance computations using partial distance computation. Our k-prototypes algorithm finds minimum distance without distance computations of all attributes between an object and a cluster center, which allows it to reduce time complexity. A partial distance computation uses a fact that a value of the maximum difference between two categorical attributes is 1 during distance computations. If data objects have m categorical attributes, maximum difference of categorical attributes between an object and a cluster center is m. Our algorithm first computes distance with only numeric attributes. If a difference of the minimum distance and the second smallest with numeric attributes is higher than m, we can find minimum distance between an object and a cluster center without distance computations of categorical attributes. The experimental shows proposed k-prototypes algorithm improves computational performance than original k-prototypes algorithm in our dataset.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; inter-subjective objectivity; complexity measure; computational complexity; criticality; citizen science; open complex system;
Online: 14 April 2017 (10:51:07 CEST)
|
|
Share this article with
×
Recently emerging data-driven citizen sciences need to harness increasing amount of massive data with varying quality. This paper develops essential theoretical frameworks and example models and examine its computational complexity for interactive data-driven citizen science within the context of guided self-organization. We first define a conceptual model that incorporates quality of observation in terms of accuracy and reproducibility, ranging between subjectivity, inter-subjectivity, and objectivity. Next, we examine the database's algebraic and topological structure in relation to informational complexity measures, and evaluate its computational complexities with respect to exhaustive optimization. Conjectures of criticality are obtained on self-organizing processes of observation and dynamical model development. Example analysis is demonstrated with the use of biodiversity assessment database, the process that inevitably involves human subjectivity for the management in open complex systems.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; privacy; anonymity risk; dynamic user profile, online footprints
Online: 13 April 2017 (04:46:21 CEST)
|
|
Share this article with
×
Websites and applications use personalisation services to profile their users, collect their patterns and activities and eventually use this data to provide tailored suggestions. User preferences and social interactions are therefore aggregated and analysed. Every time a user publishes a new post or creates a link with another entity, either another user, or some on-line resource, new information is added to the user profile. Exposing private data does not only reveal information about single users' preferences, increasing their privacy risk, but can expose more about their network that single actors intended. This mechanism is self-evident on \emph{social networks} where users receive suggestions based on their friends' activity. We propose an information theoretic approach to measure the differential update of the anonymity risk for time-varying user profiles. This expresses how privacy is affected when new content is posted and how much third party services get to know about the users when a new activity is shared. We use real Facebook data to show how our model can be applied on a real world scenario.
Preprint
|
|
|
Mathematics & Computer Science, Numerical Analysis & Optimization; observed information; fisher information; averaged information splitting; approximate information
Online: 7 April 2017 (12:21:27 CEST)
|
|
Share this article with
×
Linear mixed models are frequently used for analysing heterogeneous data in a broad range of applications. The restricted maximum likelihood method is often preferred to estimate co-variance parameters in such models due to its unbiased estimation of the underlying variance parameters. The restricted log-likelihood function involves log determinants of a complicated co-variance matrix. An efficient statistical estimate of the underlying model parameters and quantifying the accuracy of the estimation requires the first derivatives and the second derivatives of the restricted log-likelihood function, i.e., the observed information. Standard approaches to compute the observed information and its expectation, the Fisher information, is computationally prohibitive for linear mixed models with thousands random and fixed effects. Customized algorithms are of highly demand to keep mixed models analysis scalable for increasing high-throughput heterogeneous data sets. In this paper, we explore how to leverage an averaged information splitting technique and dedicate matrix transform to significantly reduce computations and to accelerate computing. Together with a fill-in reducing multi-frontal sparse direct solver, the averaged information splitting approach improves the performance of the computation process.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; Catalan number; integral representation; equivalent relation; application; sum of power series; Catalan--Qi function; Catalan--Qi number; beta function
Online: 7 April 2017 (04:27:13 CEST)
|
|
Share this article with
×
In the paper, the authors survey integral representations of the Catalan numbers and the Catalan–Qi function, discuss equivalent relations between these integral representations, supply alternative and new proofs of several integral representations, collect applications of some integral representations, and present sums of several power series whose coefficients involve the Catalan numbers.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; Automatic localization; human visual mechanism; superpixel contrast feature; ultrasound breast tumor.
Online: 5 April 2017 (15:50:40 CEST)
|
|
Share this article with
×
Human visual system (HVM) can quickly localize the most salient object in scenes, which has been widely applied on natural image segmentation [15]-[19]. In ultrasound (US) breast images, compared with background areas, tumor is more salient because of its higher contrast. In this paper, we develop a novel automatic localization method based on HVM for automatic segmentation of ultrasound (US) breast tumors.
First, the input image is smoothed by convolution with a linearly separable Gaussian filter and then subsampled into a 9-layer Gaussian pyramid. Then intensity, blackness ratio, and superpixel contrast features are combined to compute saliency map, in which Winner Take All algorithm is used to localize the most salient region, presenting with a circle on the localized target. Finally the circle is taken as the initial contour of CV level set to finish the extraction of breast tumor.
The localization method has been tested on 400 US beast images, among which 378 images have higher saliency than background areas and succeed in localization, with high accuracy 92.00%. The HVM localization method can be used to localize the tumors, combined with this method, CV level set can achieve the fully automatic segmentation of US breast tumors.
By combing intensity, blackness ratio and superpixel contrast features, the proposed localization method can successfully avoid the interference caused by background areas with low echo and high intensity. Moreover, multi-object localization of US breast images can be considered in future employment.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; simple form; explicit form; differential equation; Lerch transcendent; logarithmic function
Online: 4 April 2017 (16:53:18 CEST)
|
|
Share this article with
×
In the note, the authors find several simple and explicit forms for a family of inhomogeneous linear ordinary differential equations studied in "D. Lim, Differential equations for Daehee polynomials and their applications, J. Nonlinear Sci. Appl. 10 (2017), no. 4, 1303-1315; Available online at http://dx.doi.org/10.22436/jnsa.010.04.02".
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; entanglement; relative entropy of entanglement; negativity; bell inequalities violation; quantum fisher information; optimization
Online: 31 March 2017 (08:14:32 CEST)
|
|
Share this article with
×
The violation of Bell's theorem is a very simple way to see that there is no underlying classical interpretation of quantum mechanics. The measurements made on the photons shows that light signal (information) could travel between them, hence completely eliminating any chance that the result was due to anything other than entanglement. Entanglement has been studied extensively for understanding the mysteries of non-classical correlations between quantum systems. It was found that violation of Bell's inequalities could be trivially calculated and for sets of nonmaximally entangled states of two qubits, comparing these entanglement measures may lead to different entanglement orderings of the states. On the other hand, although it is not an entanglement measure and not monotonic under local operations, due to its ability of detecting multipartite entanglement, quantum Fisher information (QFI) has recently received an intense attraction generally with entanglement in the focus. In this work, we visit violation of Bell's inequalities problem with a different approach. Generating a thousand random quantum states and performing an optimization based on local general rotations of each qubit, we calculate the maximal QFI for each state. We analyze the maximized QFI in comparison with violation in Bell's inequalities and we make similar comparison of this violation with commonly studied entanglement measures, negativity and relative entropy of entanglement. We show that there are interesting orderings for system states.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; entanglement; qubit; qutrit; concurrence; negativity; relative entropy of entanglement
Online: 30 March 2017 (11:47:17 CEST)
|
|
Share this article with
×
Quantum Computers are provisioned as very high performance computers using quantum mechanical aspects for information processing. Quantum Information Theory and Quantum Computing topics are popular topics in academia aiming the construction of theoretical background of Quantum Computers. The information processing units for Quantum Computers are defined as qubits but for some problems three level (trinary) systems may be applied as well. We call these three level systems as qutrits. The scope of this work is the analysis of well-defined entanglement measures Negativity and Relative Entropy of Entanglement (REE) for two qutrit (3- level/trinary) quantum systems. In this manner, for randomly generated 1000 two qutrit and 1000 two qubit states the mentioned measures are calculated and these values are compared. These comparisons are analyzed and for quantum state ordering problem, some interesting results are reported.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; closed expression; Fibonacci number; Fibonacci polynomial; tridiagonal determinant; Hessenberg determinant
Online: 28 March 2017 (03:11:06 CEST)
|
|
Share this article with
×
In the paper, the authors nd a new closed expression for the Fibonacci polynomials and, consequently, for the Fibonacci numbers, in terms of a tridiagonal determinant.