Preprint
|
|
|
Mathematics & Computer Science, Analysis; generalized functions; tempered distributions; regular functions; local functions; regularization-localization duality; regularity; Heisenberg’s uncertainty principle
Online: 24 May 2017 (08:34:46 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, 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; Smart Anti-theft system; intruder detection; unsupervised activity monitoring; smart home; Partially/Fully Covered Faces
Online: 5 May 2017 (18:54:50 CEST)
|
|
Share this article with
×
The proposed research methodology aims to design an abstract and ideal way to provide a house owner/member with the spontaneous acknowledge of the on-going theft (about the unauthorized access happening in his/her premises). For this purpose, a rigorous analysis of existing systems has been done to identify research gaps. The problems with the existing systems are, it can identify intruder only after the theft or it cannot distinguish human and non-human objects. The WSNs with the use of Internet of Things (IoT), Cognitive Internet of Things, Internet of Medical Things and Cloud Computing are uplifting the smart home concepts, solutions, and its applications. The primary objective of the present research work is to design and develop IoT and cloud computing based smart home solutions. The cloud implementation using free cloud space, which is based on collaboration between public and private clouds, is presented in this research paper. In addition to this, this research work also proposes a novel smart home anti-theft system which can detect an intruder even if he/she has partially/fully hided the face using some clothes, leather, fiber or plastic materials. The proposed system can also detect the intruder in the dark using a CCTV camera without night vision facility. The fundamental idea is to design a cost-effective and efficient system for an individual which can detect any kind of theft in real time and provide spontaneous notification of the theft to the house owner in no time. The system also promises to implement the home security with large video data handling in real time.
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, Artificial Intelligence & Robotics; Dynamic vehicle routing problem, Harmony Search Algorithm, Variable Neighbourhood Search
Online: 17 April 2017 (05:41:00 CEST)
|
|
Share this article with
×
The Vehicle Routing Problem (VRP) is a classical combinatorial optimization problem. It is usually modelled in a static fashion; however, in practice, new requests by customers arrive after the initial workday plan is in progress. In this case, routes must be re-planned dynamically. This paper investigates the Dynamic Vehicle Routing Problem with Time Windows (DVRPTW) in which customers’ requests can be either known at the beginning of working day or occur dynamically over time. We propose a hybrid heuristic algorithm that combines the Harmony Search (HS) algorithm and the Variable Neighborhood Descent (VND) algorithm. It uses the HS to provide global exploration capabilities and uses the VND for its local search capability. In order to prevent premature convergence of the solution, we evaluate the population diversity by using entropy. Computational results on the Lackner benchmark problems show that the proposed algorithm is competitive with the best existing algorithms from the literature.
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; identity; inverse matrix; explicit formula; generating function; Chebyshev polynomials of the second kind; Catalan number; triangular matrix; classical hypergeometric function; integral representation
Online: 28 March 2017 (03:23:49 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, 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.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; explicit formula; recursive formula; generalized Motzkin number; Motzkin number; restricted hexagonal number; Catalan number; generating function
Online: 27 March 2017 (11:02:41 CEST)
|
|
Share this article with
×
In the paper, the authors find two explicit formulas and recover a recursive formula for the generalized Motzkin numbers. Consequently, the authors deduce two explicit formulas and a recursive formula for the Motzkin numbers, the Catalan numbers, and the restricted hexagonal numbers respectively.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; nonlinear ordinary differential equation; Stirling number of the first kind; simplifying; technique; combinatorial analysis
Online: 24 March 2017 (18:30:21 CET)
|
|
Share this article with
×
In the paper, by virtue of techniques in combinatorial analysis, the authors simplify two families of nonlinear ordinary differential equations in terms of the Stirling numbers of the first kind.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; High-dimensional data analysis, Multiple hypothesis testing, False discovery rate, Optimum significance threshold, Maximum for reasonable number of rejected hypotheses, Big data analysis
Online: 24 March 2017 (18:29:35 CET)
|
|
Share this article with
×
This paper identifies a criterion for choosing the largest set of rejected hypotheses in high-dimensional data analysis where Multiple Hypothesis testing is used in exploratory research to identify significant associations among many variables. The method neither requires predetermined thresholds for level of significance, nor uses presumed thresholds for false discovery rate. The upper limit for number of rejected hypotheses is determined by finding maximum difference between expected true hypotheses and false hypotheses among all possible sets of rejected hypotheses. Methods of choosing a reasonable number of rejected hypotheses and application to non-parametric analysis of ordinal survey data are presented.
Preprint
|
|
|
Mathematics & Computer Science, General Mathematics; Riemann Hypothesis; Dirichlet eta function; Zeta function; prime numbers; number theory; critical-line; critical-strip; symmetry breaking
Online: 22 March 2017 (04:48:57 CET)
|
|
Share this article with
×
Euler’s product formula over the primes and Euler’s zeta function equate to enshrine the Fundamental Theorem of Arithmetic that every integer > 1 is the product of a unique set of primes. The product formula has no zero, and with a domain ≤1 Euler’s zeta diverges. Dirichlet’s eta function η(s), negates alternate terms of zeta, permitting convergence when s∈C and Re(s) < 1, and its non-trivial zeros {ρ}, have a deep relationship with the distribution of the primes. The Riemann Hypothesis is that all the non-trivial zeros have Re(ρ) = 1/2. This work examines the symmetries in a partial Euler’s zeta series with a complex domain equating it to the difference between two finite vector series whose matched terms have mirror-image arguments, but whose magnitudes differ when Re(s) ≠ 1/2. Analytical continuation generates a modified eta series ηl(s), in which every lth term is multiplied by (1-l). If the integer l is appropriately determined by the Im(s), similar paired finite vector series have a difference that closely follows ηl (s) and their terminal vectors intersect in a unique way permitting zeros only when Re(s) = 1/2. Furthermore, those vectors tracking the derivatives of the series, have a special relationship permitting zeros of the differential only when Re(s) > 1/2.
Preprint
|
|
|
Mathematics & Computer Science, Other; identity over time; Bayesian networks; multi-information; entity; persistence; integration; emergence; naturalising agency
Online: 21 March 2017 (16:23:00 CET)
|
|
Share this article with
×
We present a first formal analysis of specific and complete local integration. Complete local integration was previously proposed as a criterion for detecting entities or wholes in distributed dynamical systems. Such entities in turn were conceived to form the basis of a theory of emergence of agents within dynamical systems. Here, we give a more thorough account of the underlying formal measures. The main contribution is the disintegration theorem which reveals a special role of completely locally integrated patterns (what we call ι-entities) within the trajectories they occur in. Apart from proving this theorem we introduce the disintegration hierarchy and its refinement-free version as a way to structure the patterns in a trajectory. Furthermore we construct the least upper bound and provide a candidate for the greatest lower bound of specific local integration. Finally, we calculate the i-entities in small example systems as a first sanity check and find that ι-entities largely fulfil simple expectations.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; object detection; background subtraction; video surveillance; Kinect sensor fusion
Online: 20 March 2017 (10:21:40 CET)
|
|
|
Share this article with
×
Depth-sensing technology has led to broad applications of inexpensive depth cameras that can capture human motion and scenes in 3D space. Background subtraction algorithms can be improved by fusing color and depth cues, thereby allowing many issues encountered in classical color segmentation to be solved. In this paper, we propose a new fusion method that combines depth and color information for foreground segmentation based on an advanced color-based algorithm. First, a background model and a depth model are developed. Then, based on these models, we propose a new updating strategy that can eliminate ghosting and black shadows almost completely. Extensive experiments have been performed to compare the proposed algorithm with other, conventional RGB-D algorithms. The experimental results suggest that our method extracts foregrounds with higher effectiveness and efficiency.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; deep convolutional neural networks; identification; semi-verification; multi-scale features; face verification
Online: 20 March 2017 (09:06:18 CET)
|
|
Share this article with
×
Face verification for unrestricted faces in the wild is a challenging task. This paper proposes a method based on two deep convolutional neural networks(CNN) for face verification. In this work, we explore to use identification signal to supervise one CNN and the combination of semi-verification and identification to train the other one. In order to estimate semi-verification loss at a low computation cost, a circle, which is composed of all faces, is used for selecting face pairs from pairwise samples. In the process of face normalization, we propose to use different landmarks of faces to solve the problems caused by poses. And the final face representation is formed by the concatenating feature of each deep CNN after PCA reduction. What's more, each feature is a combination of multi-scale representations through making use of auxiliary classifiers. For the final verification, we only adopt the face representation of one region and one resolution of a face jointing Joint Bayesian classifier. Experiments show that our method can extract effective face representation with a small training dataset and our algorithm achieves 99.71% verification accuracy on LFW dataset.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; Unsteady 3-D axisymmetric nanofluid; Entropy generation; Spectral quasi-linearization method.
Online: 17 March 2017 (15:10:32 CET)
|
|
Share this article with
×
We investigate entropy generation in unsteady three-dimensional axisymmetric MHD nanofluid flow over a non-linearly stretching sheet. The flow is subject to thermal radiation and a chemical reaction. The conservation equations were solved using the spectral quasi-linearization method. The novelty of the work is in the study of entropy generation in three-dimensional axisymmetric MHD nanofluid and the choice of the spectral quasilinearization method as the solution method. The effects of Brownian motion and thermophoresis are also taken into account when the nanofluid particle volume fraction on the boundary in passively controlled. The results show that as the Hartman number increases, both the Nusselt number and the Sherwood number decrease whereas the skin friction increases. It is further shown that an increase in the thermal radiation parameter corresponds to a decrease in the Nusselt number. Moreover, entropy generation increases with the physical parameters.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; Refinement; operators; theories; self-recovering; NoC; Event-B; VHDL
Online: 16 March 2017 (11:41:58 CET)
|
|
|
Share this article with
×
The need for high performance, available and reliable embedded systems has made computing systems increasingly complex. Formal methods have the ability to produce critical systems for large industrial projects, and this by creating an original mathematical model that can be formally refined in levels until the final refinement which contains enough of details for an implementation. This work is a first step of VHDL code generation process, it represents how to elaborate formally an embedded system using Abstract data type in a form of theories (NoC, WNoC, colored graph, VHDL) and how to ensure in systematic way all the details and complexity of this system using operators of refinement (Create, Rename, Restrict, Enrich)that are recently proposed for the Event-B method. All the theories are deployed, discharged and used in Event-B models to represent and enhance the performance of this self-organization reliability solution for the wireless sensors network of NoC-based system. This paper summerize the fruit of using new proposed approach for the Event-B formal method that persist the NoC-based ditributed system instead of consuming more than 70% of realization time with any analytic method.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; Lévy–Khintchine representation; integral representation; Bernstein function; Stieltjes function; Toader–Qi mean; weighted geometric mean; Bessel function of the first kind; probabilistic interpretation; probabilistic interpretation; application in engineering; inequality
Online: 16 March 2017 (11:31:31 CET)
|
|
Share this article with
×
In the paper, by virtue of a Lévy–Khintchine representation and an alternative integral representation for the weighted geometric mean, the authors establish a Lévy–Khintchine representation and an alternative integral representation for the Toader–Qi mean. Moreover, the authors also collect an probabilistic interpretation and applications in engineering of the Toader–Qi mean.
Preprint
|
|
|
Mathematics & Computer Science, Algebra & Number Theory; homomorphism; Grassmannian; generalized geometry; cathelineau's complex
Online: 15 March 2017 (08:04:30 CET)
|
|
Share this article with
×
In this article, a generalization of the geometry of Grassmannian chain complex of free abelian groups generated by the projective configuration of points and Cathelineau's infinitesimal complex of polylogarithmic groups is proposed. Firstly, homomorphisms for weight n =2 up to weight n=6 will be introduced to connect sub-complexes of Grassmannian and Cathelineau. Lately, generalization of these morphisms will be shown for weight n=N. The associated diagrams will also be proven to be commutative and bi-complex.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; blow-up; semilinear pseudo-parabolic equations; critical initial energy; conical degeneration
Online: 13 March 2017 (09:56:13 CET)
|
|
Share this article with
×
In this paper, we study the semilinear pseudo-parabolic equations $\displaystyle u_{t} - \triangle_{\mathbb{B}}u - \triangle_{\mathbb{B}}u_{t} = \left|u\right|^{p-1}u$ on a manifold with conical singularity, where $\triangle _{\mathbb{B}}$ is Fuchsian type Laplace operator investigated with totally characteristic degeneracy on the boundary $x_{1} = 0$. Firstly, we discuss the invariant sets and the vacuum isolating behavior of solutions with the help of a family of potential wells. Then, we derive a threshold result of existence and nonexistence of global weak solution: for the low initial energy $J(u_{0})<d$, the solution is global in time with $I(u_{0}) >0$ or $\displaystyle\Vert \nabla_{\mathbb{B}}u_{0}\Vert_{L_{2}^{\frac{n}{2}}(\mathbb{B})} = 0$ and blows up in finite time with $I(u_{0}) < 0$; for the critical initial energy $J(u_{0}) = d$, the solution is global in time with $I(u_{0}) \geq0$ and blows up in finite time with $I(u_{0}) < 0$. The decay estimate of the energy functional for the global solution and the estimates of the lifespan of local solution are also given.
Preprint
|
|
|
Mathematics & Computer Science, Other; Smartphone sensing; mobile-social integration; automatic recognition; social data; long-term health monitoring
Online: 10 March 2017 (17:32:31 CET)
|
|
Share this article with
×
Over the past decades, overweight and obesity has become a global epidemic and the leading threat for death. To prevent the serious risk, an overweight or obese individual must apply a long-term weight-management strategy to control food intake and physical activities, which is however, not easy. Recently, with the advances of information technology, more and more people can use wearable devices and smartphones to obtain physical activity information, while they can also access various health-related information from Internet online social networks (OSNs). Nevertheless, there is a lack of an integrated approach that can combine these two methods in an efficient way. In this paper, we address this issue and propose a novel mobile-social framework for health recognition and recommendation, namely, H-Rec2. The main ideas of H-Rec2 include (1) to recognize the individual's health status using smartphone as a general platform, and (2) to recommend physical activity and food intake based on personal health information, life science principles, and health-related information obtained from OSNs. To demonstrate the potentials of the H-Rec2 framework, we develop a prototype that consists of four important components: (1) an activity recognition module that senses physical activity using accelerometer, (2) a health status modeling module that applies a novel algorithm to generate personalized health status index, (3) a restaurant information collection module that collects relevant information from OSN, and (4) a restaurant recommendation module that provides personalized and context-aware recommendation. To evaluate the prototype, we conduct both objective and subjective experiments, which confirm the performance and effectiveness of the proposed system.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; closed form; Stirling polynomial; Stirling number; Bernoulli number; Faá di Bruno's formula; Bell polynomial
Online: 10 March 2017 (10:28:19 CET)
|
|
Share this article with
×
In the paper, by virtue of the Faá di Bruno formula and two identities for the Bell polynomial of the second kind, the authors find a closed form for the Stirling polynomials in terms of the Stirling numbers of the first and second kinds.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; series identity; Catalan number; Catalan function; Riemanian zeta function; alternative Hurwitz zeta function; digamma function
Online: 6 March 2017 (07:01:20 CET)
|
|
Share this article with
×
In the paper, the authors discover several series identities involving the Catalan numbers, the Catalan function, the Riemanian zeta function, and the alternative Hurwitz zeta function.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; GPS trajectory; GPS sensor; trajectory similarity measure; spatial-temporal data
Online: 6 March 2017 (06:51:37 CET)
|
|
Share this article with
×
With the rapid spread of built-in GPS handheld smart devices, the trajectory data from GPS sensors has grown explosively. Trajectory data has spatio-temporal characteristics and rich information. Using trajectory data processing techniques can mine the patterns of human activities and the moving patterns of vehicles in the intelligent transportation systems. A trajectory similarity measure is one of the most important issues in trajectory data mining (clustering, classification, frequent pattern mining, etc.). Unfortunately, the main similarity measure algorithms with the trajectory data have been found to be inaccurate, highly sensitive of sampling methods, and have low robustness for the noise data. To solve the above problems, three distances and their corresponding computation methods are proposed in this paper. The point-segment distance can decrease the sensitivity of the point sampling methods. The prediction distance optimizes the temporal distance with the features of trajectory data. The segment-segment distance introduces the trajectory shape factor into the similarity measurement to improve the accuracy. The three kinds of distance are integrated with the traditional dynamic time warping algorithm (DTW) algorithm to propose a new segment–based dynamic time warping algorithm (SDTW). The experimental results show that the SDTW algorithm can exhibit about 57%, 86%, and 31% better accuracy than the longest common subsequence algorithm (LCSS), and edit distance on real sequence algorithm (EDR) , and DTW, respectively, and that the sensitivity to the noise data is lower than that those algorithms.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; Solvency II; Standard Formula; Risk Measure; Diversification; Aggregation; Monotony; Homogeneity; Subadditivity; Euler's Principle; Capital Allocation
Online: 1 March 2017 (08:53:59 CET)
|
|
Share this article with
×
The core of risk aggregation in the Solvency II Standard Formula is the so-called square root formula. We argue that it should be seen as a means for the aggregation of different risks to an overall risk rather than being associated with variance-covariance based risk analysis. Considering the Solvency II Standard Formula from the viewpoint of linear geometry, we immediately find that it defines a norm and therefore provides a homogeneous and sub-additive tool for risk aggregation. Hence Euler's Principle for the reallocation of risk capital applies and yields explicit formulas for capital allocation in the framework given by the Solvency II Standard Formula. This gives rise to the definition of diversification functions, which we define as monotone, subadditive, and homogeneous functions on a convex cone. Diversification functions constitute a class of models for the study of the aggregation of risk, and diversification. The aggregation of risk measures using a diversification function preserves the respective properties of these risk measures. Examples of diversification functions are given by seminorms, which are monotone on the convex cone of non-negative vectors. Each Lp norm has this property, and any scalar product given by a non-negative positive semidefinite matrix does as well. In particular, the Standard Formula is a diversification function and hence a risk measure that preserves homogeneity, subadditivity, and convexity.
Preprint
|
|
|
Mathematics & Computer Science, Other; robust diffusion estimation; self-adjusting step-size; non-Gaussian noise; wireless sensor networks
Online: 28 February 2017 (12:38:25 CET)
|
|
Share this article with
×
In wireless sensor networks (WSNs), each sensor node can estimate the global parameter from the local data in distributed manner. This paper proposed a robust diffusion estimation algorithm based on minimum error entropy criterion with self-adjusting step-size, which are referred to as diffusion MEE-SAS (DMEE-SAS) algorithm. The DMEE-SAS algorithm has fast speed of convergence and is robust against non-Gaussian noise in the measurements. The detailed performance analysis of the DMEE-SAS algorithm is performed. By combining the DMEE-SAS with diffusion minimum error entropy (DMEE) algorithms, an Improving DMEE-SAS algorithm is proposed, in non-stationary environment where tracking is very important. The Improving DMEE-SAS algorithm can avoid insensitivity of the DMEE-SAS algorithm due to the small effective step-size near the optimal estimator, and obtain a fast convergence speed. Numerical simulations are given to verify the effectiveness and advantages of these proposed algorithms.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; self-organization; downward causation; autocatalytic set; goal-oriented behaviour; autopoiesis; biological computing
Online: 28 February 2017 (12:08:07 CET)
|
|
Share this article with
×
Using insights from cybernetics and an information-based understanding of biological systems, a precise, scientifically inspired, definition of free-will is offered and the essential requirements for an agent to possess it in principle are set out. These are: a) there must be a self to self-determine; b) there must be a non-zero probability of more than one option being enacted; c) there must be an internal means of choosing among options (which is not merely random, since randomness is not a choice). For (a) to be fulfilled, the agent of self-determination must be organisationally closed (a `Kantian whole'). For (c) to be fulfilled: d) options must be generated from an internal model of the self which can calculate future states contingent on possible responses; e) choosing among these options requires their evaluation using an internally generated goal defined on an objective function representing the overall `master function' of the agent and f) for `deep free-will', at least two nested levels of choice and goal (d-e) must be enacted by the agent. The agent must also be able to enact its choice in physical reality. The only systems known to meet all these criteria are living organisms, not just humans, but a wide range of organisms. The main impediment to free-will in present-day artificial robots, is their lack of being a Kantian whole. Consciousness does not seem to be a requirement and the minimum complexity for a free-will system may be quite low and include relatively simple life-forms that are at least able to learn.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; suspension bridges; fourth order wave equation; nonlinear damping; source term; existence; blow up
Online: 24 February 2017 (09:06:57 CET)
|
|
Share this article with
×
In this paper, we consider a fourth-order suspension bridge equation with nonlinear damping term |ut|m-2ut and source term |u|p-2u. We give necessary and sufficient condition for global existence and energy decay results without considering the relation between m and p. Moreover, when p>m, we give sufficient condition for finite time blow-up of solutions. The lower bound of the blow-up time Tmax is also established. It worth to mention that our obtained results extend the recent results of Wang (J. Math. Anal. Appl., 2014) to the nonlinear damping case.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; general stability;laminated beam;infinite memory;multiplier technique;energy method
Online: 22 February 2017 (16:56:19 CET)
|
|
Share this article with
×
In this work, we consider a one-dimensional laminated beam in the case of non-equal wave speeds with only one infinite memory on the effective rotation angle. In this case, we establish the general decay result for the energy of solution without any kind of internal or boundary control. The main result is obtained by applying the method used in Guesmia et al. (Electron. J. Differential Equations 193: 1-45, 2012) and the second-order energy.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; secured hashes; symmetric key encryption; energy optimization
Online: 21 February 2017 (10:28:30 CET)
|
|
Share this article with
×
In this work we study the energy consumption by various modern secured hash functions (MD2, MD5, SHA-1, and SHA-2) and modern symmetric key encryption protocols (Blowfish, DES, 3DES, and AES) from the algorithmic perspective. We identify various parameters that moderate energy consumption of these hashes and protocols. Our work is directed towards redesigning or modifying these algorithms to make them consume lesser energy. As a first step, we try to determine the applicability of the asymptotic energy complexity model by Roy et. al. on these hashes and protocols. Specifically, we try to observe whether parallelizing the access of blocks of data in these algorithms reduces their energy consumption based on the energy model. Our results confirm the applicability of the energy model on these hashes and protocols. Our work is motivated by the relevance and importance of cryptographic hashes and symmetric key protocols for modern ICT (Information and Communication Technology), and ICT enabled industry to keep them protected from dynamically changing threat scenarios. Hence the design of more energy efficient hashes and protocols will definitely contribute in reducing the ICT energy consumption that is continuously increasing.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; Zernike moment, Multi-class support vector machine, Query Engine, SPARQL
Online: 20 February 2017 (18:07:11 CET)
|
|
Share this article with
×
In this paper, a new approach to retrieve semantic images based on shape and geometric features of image in conjunction with multi-class support vector machine is proposed. Zernike moment as shape feature is to verify the invariance of objects for silhouette image. In addition, a set of geometrical features is to explore the objects shape using two features of rectangularity and circularity. Then the extracted features are normalized and employed for multi-class support vector machine either for learning or retrieving processes. The retrieving process relies on three main tasks which namely Query Engine, Matching Module and Ontology Manger, respectively. Query Engine is to build the input text or image query using SPARQL language. The matching module extracts the shape and geometric features of image’s objects and employ them to Ontology Manger which in turn inserts them in ontology knowledge base. Benchmark mammals have been conducted to empirically conclude the outcome of proposed approach. Our experiment on text and image retrieval yields efficient results to problematic phenomena than previously reported.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; thermoelastic Timoshenko beam; global existence; exponential stability; second sound
Online: 20 February 2017 (06:36:23 CET)
|
|
Share this article with
×
In this paper, we study the global existence and exponential decay for a dynamic contact problem between a Timoshenko beam with second sound and two rigid obstacles, of which the heat flux is given by Cattaneo's law instead of the usual Fourier's law. The main difficulties arise from the irregular boundary terms, from the low regularity of the weak solution and from the weaker dissipative effects of heat conduction induced by Cattaneo's law. By considering related penalized problems, proving some a priori estimates and passing to the limit, we prove the global existence of the solutions. By considering the approximate framework, constructing some new functionals and applying the perturbed energy method, we obtain the exponential decay result for the approximate solution, and then prove the exponential decay rate to the original problem by utilizing the weak lower semicontinuity arguments.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; network; systems; cloud computing; data centre; performance; software-defined; virtual machine; scheduling; admission control; application-aware;
Online: 20 February 2017 (04:56:24 CET)
|
|
Share this article with
×
Cloud computing refers to applications delivered as services over the Internet. Cloud systems employ policies that are inherently dynamic in nature and that depend on temporal conditions defined in terms of external events, such as the measurement of bandwidth, use of hosts, intrusion detection or specific time events. In this paper, we investigate an optimized resource management scheme named v-Mapper. The basic premise of v-Mapper is to exploit application-awareness concepts using software-defined networking (SDN) features. This paper makes three key contributions to the field: (1) We propose a virtual machine (VM) placement scheme that can effectively mitigate the VM placement issues for data-intensive applications; (2) We propose a validation scheme that will ensure that a service is entertained only if there are sufficient resources available for its execution and (3) We present a scheduling policy that aims to eliminate network load constraints. An evaluation was carried out with various benchmarks and demonstrated that v-Mapper shows improved performance over other state-of-the-art approaches in terms of average task completion time, service delay time and bandwidth utilization. Given the growing importance of supporting large-scale data processing and analysis in datacentres, the v-Mapper system has the potential to make a positive impact in improving datacentre performance in the future.
Preprint
|
|
|
Mathematics & Computer Science, Computational Mathematics; ordinal patterns; Permutation entropy; Approximate entropy;Sample entropy; Conditional entropy of ordinal patterns;Kolmogorov-Sinai entropy; classification
Online: 17 February 2017 (16:41:32 CET)
|
|
Share this article with
×
During the last years some new variants of Permutation entropy have been introduced and applied to EEG analysis, among them a conditional variant and variants using some additional metric information or being based on entropies different from the Shannon entropy. In some situations it is not completely clear what kind of information the new measures and their algorithmic implementations provide. We discuss the new developments and illustrate them for EEG data.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; laminated beam; Fourier's law; exponential stability; lack of exponential stability; polynomial stability
Online: 16 February 2017 (08:52:57 CET)
|
|
Share this article with
×
In this paper, we study the well-posedness and the asymptotic behavior of a one-dimensional laminated beam system, where the heat conduction is given by Fourier's law effective in the rotation angle displacements. We show that the system is well-posed by using the Hille-Yosida theorem and prove that the system is exponentially stable if and only if the wave speeds are equal. Furthermore, we show that the system is polynomially stable provided that the wave speeds are not equal.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; protein–protein interaction networks; protein function module; simplified swarm optimization
Online: 15 February 2017 (10:17:35 CET)
|
|
Share this article with
×
Proteomics research has become one of the most important topics in the fields of life science and natural science. At present, research on protein–protein interaction networks (PPINs) mainly focuses on detecting protein complexes or function modules. However, existing approaches are either ineffective or incomplete. In this paper, we investigate function module detection mechanisms in PPIN, including open databases, existing detection algorithms and recent solutions. After that, we describe the proposed solution based on simplified swarm optimization (SSO) algorithm and gene ontology knowledge. The proposed solution implements SSO algorithm for clustering proteins with similar function, and imports biological gene ontology knowledge for further identifying function complexes and improving detection accuracy. Furthermore, we use four different categories of species dataset for experiment: Fruitfly, Mouse, Scere, and Human. The testing and analysis result show that the proposed solution is feasible, efficient and could achieve a higher accuracy of prediction than existing approaches.
Preprint
|
|
|
Mathematics & Computer Science, Numerical Analysis & Optimization; Non-linear equations, Monotone equations , Spectral Gradient method , Projection method.
Online: 13 February 2017 (15:03:16 CET)
|
|
Share this article with
×
In this work, we proposed a combination of a positive spectral gradient-like method and projection method for solving nonlinear monotone equations. The spectral gradient-like coefficient is obtained using a convex combination of two different positive spectral coefficients. Under the monotonicity and Lipschitz continuity assumptions the method is shown to be globally convergent. We show the efficiency of the method numerically by comparing it with the existing methods.
Preprint
|
|
|
Mathematics & Computer Science, Logic; neutrosophy; neutrosophic logic; neutrosophic alethic modalities; neutrosophic possibility; neutrosophic necessity; neutrosophic impossibility; neutrosophic temporal modalities; neutrosophic epistemic modalities; neutrosophic doxastic modalities; neutrosophic deontic modalities
Online: 5 February 2017 (09:41:31 CET)
|
|
Share this article with
×
I introduce now for the first time the neutrosophic modal logic. The Neutrosophic Modal Logic includes the neutrosophic operators that express the modalities. It is an extension of neutrosophic predicate logic, and of neutrosophic propositional logic. In order for the paper to be self-contained, I also recall the etymology and definition of neutrosophy and of neutrosophic logic. Several examples are presented as well.
Preprint
|
|
|
Mathematics & Computer Science, Other; sustainability; ecotourism; System Dynamic; tourism; biodiversity; communities
Online: 3 February 2017 (03:53:56 CET)
|
|
Share this article with
×
The sustainability of ecotourism is the backbone of tourism development of a country. Ecotourism can contribute to both conservation and development in which involves dynamic relationship between tourism, biodiversity and communities, facilitate by great management. The purpose of this study is to analyze the dimensions of the socio-economic and environmental impacts of ecotourism in communities surrounding the Tasik Kenyir in Terengganu, Malaysia. This study provides a framework for the development and evaluation of ecotourism. The framework will determine if the relationships between indicators are positively correlated which will result in positive contribution to the other by using System Dynamic. Socio-cultural and economic data will be collected through interviews and group discussions in selected communities in Tasik Kenyir. Data on wildlife will be extracted from secondary data from Kenyir Research Institute, Universiti Malaysia Terengganu. The data analysis will explore the socio-cultural and economic differences between and within different communities due to ecotourism development, the contribution of ecotourism to conservation activities, local support for conservation and ecotourism as well as the influence of tourist activities on the distribution of wildlife species in Tasik Kenyir. This study aims to contribute toward understanding the natural resource community-ecotourism inter-relationship and help to bridge the knowledge gap that hinders biodiversity conservation initiatives. The findings will be used as a base for further development of ecotourism and will recommend alternative management options where necessary for the study area.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; stochastic differential equation; numerical simulation; real option; renewable energy; Egypt
Online: 30 January 2017 (12:04:34 CET)
|
|
Share this article with
×
Recently, there has been a growing interest in the production of electricity from renewable energy sources (RES). The RES investment is characterized by uncertainty, which is long-term, costly, depend on feed-in-tariff and support schemes. In this paper, we address the real option valuation (ROV) of a solar power plant investment. The real option framework is investigated. This framework considers the renewable certificate price, furthermore the cost of delay between establishing and operating the solar power plant. The optimal time of launching the project and assess the value of deferred option are discussed. The new three stage numerical methods are constructed, the Lobatto3C-Milstein (L3CM) methods. The numerical methods are integrated with concept of Black-Scholes option pricing theory, and applied in option valuation for solar energy investment with uncertainty. The numerical results of L3CM, finite difference and Monte Carlo methods are compared to show the efficiency of our methods. Our data set refers to the Arab Republic of Egypt.
Preprint
|
|
|
Mathematics & Computer Science, Computational Mathematics; Regular polyhedra, reflection group, fundamental region, invariant mapping
Online: 26 January 2017 (10:35:59 CET)
|
|
|
Share this article with
×
A fast algorithm is established to transform points of the unit sphere into fundamental region symmetrically. With the resulting algorithm, a flexible form of invariant mappings is achieved to generate aesthetic patterns with symmetries of the regular polyhedra. This method avoids the order restriction of symmetry groups, which can be similarly extended to treat regular polytopes in n-dimensional space for n>=4.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; expression recognition; expression triplet; feature optimization; AU weighting; active AU detection.
Online: 26 January 2017 (08:52:52 CET)
|
|
Share this article with
×
Facial expression has lots of applications in human-computer interaction. Although feature extraction and selection have been well studied, the specificity of each expression variation is not fully explored in state-of-the-art works. In this work, the problem of multiclass expression recognition is converted into triplet-wise expression recognition. For each expression triplet, a new feature optimization model based on Action Unit (AU) weighting and patch weight optimization is proposed to represent the specificity of the expression triplet. Sparse representation based approach is then proposed to detect the active AUs of testing sample for better generalization. The algorithm achieved competitive accuracies of 89.67% and 94.09% for Jaffe and CK+ databases, respectively. Better cross-database performance has also been observed.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; systems of nonlinear equations; nonlinear preconditioners; multi-step iterative methods; Frozen Jacobian
Online: 25 January 2017 (04:13:19 CET)
|
|
Share this article with
×
The study of different forms of preconditioners for solving a system of nonlinear equations, by using Newton’s method, is presented. The preconditioners provide numerical stability and rapid convergence with reasonable computation cost, whenever chosen accurately. Different families of iterative methods can be constructed by using a different kind of preconditioners. The multi-step iterative method consists of a base method and multi-step part. The convergence order of base method is quadratic and each multi-step add an additive factor of one in the previously achieved convergence order. Hence the convergence of order of an m-step iterative method is m + 1. Numerical simulations confirm the claimed convergence order by calculating the computational order of convergence. Finally, the numerical results clearly show the benefit of preconditioning for solving system of nonlinear equations.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; facial expression recognition; fusion features; salient facial areas; hand-crafted features; feature correction
Online: 24 January 2017 (03:28:51 CET)
|
|
Share this article with
×
In pattern recognition domain, deep architectures are widely used nowadays and they have achieved fine grades. However, these deep architectures need special demands, especially big datasets and GPU. Aiming to gain better grades without deep networks, we propose a simplified algorithm framework using fusion features extracted from the salient areas of faces. Furthermore, the proposed algorithm has achieved a better result than some deep architectures. For extracting more effective features, this paper firstly defines the salient areas on the faces. This paper normalizes the salient areas of the same location in the faces to the same size, therefore it can gain more similar features from different subjects. LBP and HOG features are extracted from the salient areas, fusion features’ dimensions are reduced by Principal Component Analysis( PCA) and we apply softmax to classify the six basic expressions at once. This paper proposes a salient areas definitude method which uses peak expressions frames to compare with their neutral faces. This paper also proposes and applies the idea of normalizing the salient areas to align the specific areas which express the different expressions. This makes the salient areas found from different subjects have the same size. Besides, gamma correction method is firstly applied on LBP features in our algorithm framework which improves our recognition rates significantly. By applying this algorithm framework, our research has gained state-of-the-art performances on CK+ database and JAFFE database.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; ev-degree Zagreb index; octane isomers; QSPR; QSAR; ve-degree Randić index; ve-degree Zagreb indices
Online: 23 January 2017 (16:14:37 CET)
|
|
Share this article with
×
Topological indices have important role in theoretical chemistry for QSPR researches. Among the all topological indices the Randić and the Zagreb indices have been used more considerably than any other topological indices in chemical and mathematical literature. Most of the topological indices as in the Randić and the Zagreb indices are based on the degrees of the vertices of a connected graph. Recently novel two degree concepts have been defined in graph theory; ev-degrees and ve-degrees. In this study we define ev-degree Zagreb index, ve-degree Zagreb indices and ve-degree Randić index by using these new graph invariants as parallel to their corresponding classical degree versions. We compare these new group ev-degree and ve-degree indices with the other well-known and most used topological indices in literature such as; Wiener, Zagreb and Randić indices by modelling some physicochemical properties of octane isomers. We show that the ev-degree Zagreb index, the ve-degree Zagreb and the ve-degree Randić indices give better correlation than Wiener, Zagreb and Randić indices to predict the some specific physicochemical properties of octanes. We investigate the relations between the second Zagreb index and ev-degree and ve-degree Zagreb indices and some mathematical properties of ev-degree and ve-degree Zagreb indices.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; Carnot cycle; causality; distinguishability; entropy; intelligent processes; questions
Online: 22 January 2017 (05:23:08 CET)
|
|
Share this article with
×
This paper proposes that intelligent processes can be completely explained by thermodynamic principles. They can equally be described by information-theoretic principles that, from the standpoint of the required optimizations, are functionally equivalent. The underlying theory arises from two axioms regarding distinguishability and causality. Their consequence is a theory of computation that applies to the only two kinds of physical processes possible—those that reconstruct the past and those that control the future. Dissipative physical processes fall into the first class, whereas intelligent ones comprise the second. The first kind of process is exothermic and the latter is endothermic. Similarly, the first process dumps entropy and energy to its environment, whereas the second reduces entropy while requiring energy to operate. It is shown that high intelligence efficiency and high energy efficiency are synonymous. The theory suggests the usefulness of developing a new computing paradigm called Thermodynamic Computing to engineer intelligent processes. The described engineering formalism for the design of thermodynamic computers is a hybrid combination of information theory and thermodynamics. Elements of the engineering formalism are introduced in the reverse-engineer of a cortical neuron. The cortical neuron provides perhaps the simplest and most insightful example of a thermodynamic computer possible. It can be seen as a basic building block for constructing more intelligent thermodynamic circuits.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; transportation data; data interlinking; automatic schema matching
Online: 20 January 2017 (03:38:06 CET)
|
|
Share this article with
×
Multimodality requires integration of heterogeneous transportation data to construct a broad view of the transportation network. Many new transportation services are emerging with being isolated from previously existing networks. This lead them to publish their data sources to the web -- according to Linked Data Principles -- in order to gain visibility. Our interest is to use these data to construct an extended transportation network that links these new services to existing ones. The main problems we tackle in this article fall in the categories of automatic schema matching and data interlinking. We propose an approach that uses web services as mediators to help in automatically detect geospatial properties and map them between two different schemas. On the other hand, we propose a new interlinking approach that enables user to define rich semantic links between datasets in a flexible and customizable way.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; well-posedness; asymptotic stability; infinite memory; Cattaneo's law; time-varying delay
Online: 19 January 2017 (10:53:04 CET)
|
|
Share this article with
×
In this paper, we study a one-dimensional Bresse-Cattaneo system with infinite memories and time-dependent delay term (the coefficient of which is not necessarily positive) in the internal feedbacks. First, it is proved that the system is well-posed by means of the Hille-Yosida theorem under suitable assumptions on the relaxation functions. Then, without any restriction on the speeds of wave propagations, we establish the exponential or general decay result by introducing suitable energy and Lyapunov functionals.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; air- or iron-cored coil; Cartesian coordinates; Fourier analysis; two-dimensional; saturation effect; subdomain technique
Online: 16 January 2017 (04:38:11 CET)
|
|
Share this article with
×
The most significant assumptions in the subdomain technique (i.e., based on the formal resolution of Maxwell's equations applied in subdomain) is defined by: “The iron parts (i.e., the teeth and the back-iron) are considered to be infinitely permeable so that the saturation effect is neglected”. In this paper, the author presents a new scientific contribution on improving of this method in two-dimensional (2-D) and in Cartesian coordinates by focusing on the consideration of iron. The subdomains connection is carried out in the two directions (i.e., x- and y-edges). For example, the improvement was performed by solving magnetostatic Maxwell's equations for an air- or iron-cored coil supplied by a direct current. To evaluate the efficacy of the proposed technique, the magnetic flux density distributions have been compared with those obtained by the 2-D finite-element analysis (FEA). The semi-analytical results are in quite satisfying agreement with those obtained by the 2-D FEA, considering both amplitude and waveform.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; (p,k)-Gamma function; convex functions; Bohr-Mollerup theorem; (p,k)-Riemann zeta function; inequality
Online: 11 January 2017 (07:35:30 CET)
|
|
Share this article with
×
In this paper, some convexity properties and some inequalities for the (p,k)-analogue of the Gamma function, Гp,k(x) are given. In particular, a (p,k)-analogue of the celebrated Bohr-Mollerup theorem is given. Furthermore, a (p,k)-analogue of the Riemann zeta function, ζp,k(x) is introduced and some associated inequalities are derived. The established results provide the (p,k)-generalizations of some known results concerning the classical Gamma function.
Preprint
|
|
|
Mathematics & Computer Science, Computational Mathematics; wire coating; elastico-viscous fluid; MHD flow; heat transfer; ADM and OHAM
Online: 10 January 2017 (10:33:57 CET)
|
|
Share this article with
×
The most important plastic resins used for wire coating are Polyvinyl Chloride (PVC), Nylon, Polysulfone and Low-high density polyethylene (LDPE / HDPE). In this article,the coating process is performed using elastic-viscous fluid as a coating material for wire coating in a pressure type coating die. The elastic-viscous fluid is electrically conducted in the presence of an applied magnetic field. The governing non-linear equations are modeled and then solved analytically by utilizing an Adomian decomposition method (ADM). The convergence of the series solution is established. The results are also verified by Optimal Homotopy Asymptotic Method (OHAM). The effect of different emerging parameters such as non-Newtonian parameters α and β, magnetic parameter M and the Brinkman number Br on solutions (velocity and temperature profiles) are discussed through several graphs. Additionally, the current result also compares with the published work already available in the literature.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; ev-degree;ve-degree; ev-degree topological indices; ve-degree topological indices
Online: 10 January 2017 (10:10:13 CET)
|
|
Share this article with
×
Recently two new degree concepts have been defined in graph theory: ev-degree and ve-degree. Also the ev-degree and ve-degree Zagreb and Randić indices have been defined very recently as parallel of the classical definitions of Zagreb and Randić indices. It was shown that ev-degree and ve-degree topological indices can be used as possible tools in QSPR researches . In this paper we define the ve-degree and ev-degree Narumi–Katayama indices, investigate the predicting power of these novel indices and extremal graphs with respect to these novel topological indices. Also we give some basic mathematical properties of ev-degree and ve-degree Narumi-Katayama and Zagreb indices.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; the modified simple equation method; Cahn–Allen equation; soliton solution; kink type solutions
Online: 4 January 2017 (10:22:40 CET)
|
|
Share this article with
×
By using Modified simple equation method, we study the Cahn Allen equation which arises in many scientific applications such as mathematical biology, quantum mechanics and plasma physics. As a result, the existence of solitary wave solutions of the Cahn Allen equation is obtained. Exact explicit solutions interms of hyperbolic solutions of the associated Cahn Allen equation are characterized with some free parameters. Finally, the variety of structure and graphical representation make the dynamics of the equations visible and provides the mathematical foundation in mathematical biology, quantum mechanics and plasma physics.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; time fractional KdV equation; time fractional Burgers equation; Kudryashov method; wave solution
Online: 23 December 2016 (10:55:45 CET)
|
|
Share this article with
×
The exact solutions in the wave form are derived for the time fractional KdV and the time fractional Burgers' equations in conformable fractional derivative sense. The fractional variable change using the fundamental properties of the conformable derivative reduces both equations to some nonlinear ODEs. The predicted solution is assumed to be a finite series form of a function satisfying a particular first-order ODE whose solution contains an exponential function in the denominator. The solutions are represented in the explicit forms and illustrated by some choices of the parameters for various fractional orders of the equations.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; convex functions; Hermite-Hadamard inequality; quantum estimate
Online: 19 December 2016 (11:25:19 CET)
|
|
Share this article with
×
In this study, based on a new quantum integral identity, the authors establish some quantum estimates of Hermite-Hadamard type inequalities for convex functions. These results generalize and improve some known results given in literatures.
Preprint
|
|
|
Mathematics & Computer Science, Numerical Analysis & Optimization; multiple criteria analysis; algorithms performance; Pareto optimality; quality indicator
Online: 16 December 2016 (08:31:29 CET)
|
|
Share this article with
×
In multi-objective optimization problems, the optimization target is to obtain a set of non-dominated solutions. Comparing solution sets is crucial in evaluating the performances of different optimization algorithms. The use of performance indicators is common in comparing those sets and, subsequently, optimization algorithms. A good solution set must be close to the Pareto-optimal front, well-distributed, maximally extended and fully filled. Therefore, an effective performance indicator must encompass these features as a whole and must be Pareto dominance compliant. Unfortunately, some of the known indicators often fail to properly reflect the quality of a solution set or cost a lot to compute. This paper demonstrates that the Degree of Approximation (DOA) quality indicator, is a weakly Pareto compliant unary indicator that gives a good estimation of the match between the approximated front and the Pareto-optimal front. Moreover, DOA computation is easy and fast.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; modified Kudryashov method; conformable time fractional RLW-Burgers Equation; conformable time fractional potential KdV Equation; conformable time fractional CRWP equation; conformable derivative
Online: 16 December 2016 (08:01:56 CET)
|
|
Share this article with
×
The exact solutions of some conformable time fractional PDEs are presented explicitly. The modified Kudryashov method is applied to construct the solutions to the conformable time fractional Regularized Long Wave-Burgers (RLW-Burgers, potential Korteweg-de Vries (KdV) and clannish random walker's parabolic (CRWP) equations. Initially, the predicted solution in the finite series of a rational form of an exponential function is substituted to the ODE generated from the conformable time fractional PDE by using wave transformation. The coefficients used in the finite series are determined by solving the algebraic system derived from the coefficients of the powers of the predicted solution.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; missing value imputation; machine learning; decision tree imputation; k-nearest neighbors imputation; self-organizing map imputation
Online: 15 December 2016 (08:27:13 CET)
|
|
|
Share this article with
×
Many clinical research datasets have a large percentage of missing values that directly impacts their usefulness in yielding high accuracy classifiers when used for training in supervised machine learning. While missing value imputation methods have been shown to work well with smaller percentages of missing values, their ability to impute sparse clinical research data can be problem specific. We previously attempted to learn quantitative guidelines for ordering cardiac magnetic resonance imaging during the evaluation for pediatric cardiomyopathy, but missing data significantly reduced our usable sample size. In this work, we sought to determine if increasing the usable sample size through imputation would allow us to learn better guidelines. We first review several machine learning methods for estimating missing data. Then, we apply four popular methods (mean imputation, decision tree, k-nearest neighbors, and self-organizing maps) to a clinical research dataset of pediatric patients undergoing evaluation for cardiomyopathy. Using Bayesian Rule Learning (BRL) to learn ruleset models, we compared the performance of imputation-augmented models versus unaugmented models. We found that all four imputation-augmented models performed similarly to unaugmented models. While imputation did not improve performance, it did provide evidence for the robustness of our learned models.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; rule based models; gene expression data; bayesian networks; parsimony
Online: 15 December 2016 (08:21:24 CET)
|
|
|
Share this article with
×
The comprehensibility of good predictive models learned from high-dimensional gene expression data is attractive because it can lead to biomarker discovery. Several good classifiers provide comparable predictive performance but differ in their abilities to summarize the observed data. We extend a Bayesian Rule Learning (BRL-GSS) algorithm, previously shown to be a significantly better predictor than other classical approaches in this domain. It searches a space of Bayesian networks using a decision tree representation of its parameters with global constraints, and infers a set of IF-THEN rules. The number of parameters and therefore the number of rules are combinatorial to the number of predictor variables in the model. We relax these global constraints to a more generalizable local structure (BRL-LSS). BRL-LSS entails more parsimonious set of rules because it does not have to generate all combinatorial rules. The search space of local structures is much richer than the space of global structures. We design the BRL-LSS with the same worst-case time-complexity as BRL-GSS while exploring a richer and more complex model space. We measure predictive performance using Area Under the ROC curve (AUC) and Accuracy. We measure model parsimony performance by noting the average number of rules and variables needed to describe the observed data. We evaluate the predictive and parsimony performance of BRL-GSS, BRL-LSS and the state-of-the-art C4.5 decision tree algorithm, across 10-fold cross-validation using ten microarray gene-expression diagnostic datasets. In these experiments, we observe that BRL-LSS is similar to BRL-GSS in terms of predictive performance, while generating a much more parsimonious set of rules to explain the same observed data. BRL-LSS also needs fewer variables than C4.5 to explain the data with similar predictive performance. We also conduct a feasibility study to demonstrate the general applicability of our BRL methods on the newer RNA sequencing gene-expression data.
Preprint
|
|
|
Mathematics & Computer Science, Other; neonatal MRI; brain structure segmentation; volume extraction
Online: 10 December 2016 (08:44:55 CET)
|
|
Share this article with
×
1) Introduction: Brain parcellation is an important processing step in the analysis of structural brain MRI. Existing software implementations are optimized for fully developed adult brains, and provide inadequate results when applied to neonatal brain imaging. 2) Methods: We developed a semi-automated pipeline, NeBSS, for extracting 50 discrete brain structures from neonatal brain MRI, using an atlas registration method that leverages the existing ALBERT neonatal atlas 3) Results: We demonstrate a simple linear workflow for neonatal brain parcellation. NeBSS is robust to variation in imaging acquisition protocol and magnet field strength. 4) Conclusion: NeBSS is a robust pipeline capable of parcellating neonatal brain MRIs using a simple processing workflow. NeBSS fills a need in clinical translational research in neonatal imaging, where existing automated or semi-automated implementations are too rigid to be successfully applied to multi-center neuroprotection studies and clinically heterogeneous cohorts. The software is open source and freely available.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; computational model; lymph node; multiscale structure; vascular network; fibroblastic reticular cells; conduit network; lymph flow; destruction of conduits
Online: 9 December 2016 (10:19:20 CET)
|
|
Share this article with
×
In this study we discuss critical issues in modelling the structure and function of lymph nodes (LNs), with emphasis on how LN physiology is related to its multi-scale structural organization. In addition to macroscopic domains such as B-cell follicles and the T cell zone, there are vascular networks which play a key role in the delivery of information to the inner parts of the LN, i.e., the conduit and blood microvascular networks. We propose object-oriented computational algorithms to model the 3D geometry of the fibroblastic reticular cell (FRC) network and the microvasculature. Assuming that a conduit cylinder is densely packed with collagen fibers, the computational flow study predicted that the diffusion should be a dominating process in mass transport than convective flow. The geometry models are used to analyze the lymph flow properties through the conduit network in unperturbed- and damaged states of the LN. The analysis predicts that elimination of up to 60–90 % of edges is required to stop the lymph flux. This result suggests a high degree of functional robustness of the network.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; visualization; terrain rendering; geo-spatial data; uncertainty; prioritization
Online: 9 December 2016 (10:11:12 CET)
|
|
Share this article with
×
Visualizing geo-spatial data embedded into a three-dimensional terrain is challenging. The problem becomes even more complex when uncertainty information needs to be presented as well. This paper addresses the question of how to visually communicate all three aspects: the 3D terrain, the geo-spatial data, and the data-associated uncertainty. We argue that visualizing all aspects with a high degree of detail will likely exceed the visual budget. Therefore, we propose a visualization strategy based on prioritizing a selected aspect and presenting the remaining two with less detail. We discuss various design options that allow us to obtain differently prioritized visual representations. Our approach has been implemented as a tool for rapid visualization prototyping in the context of avionics applications. Practical solutions are described for a use case related to the visualization of 3D terrain and uncertain weather data.
Preprint
|
|
|
Mathematics & Computer Science, Numerical Analysis & Optimization; FM-BEM; variable restart parameter; GMRES(m); error vector projection; convergence
Online: 2 December 2016 (09:01:51 CET)
|
|
Share this article with
×
To solve large scale linear equations involved in the Fast Multipole Boundary Element Method (FM-BEM) efficiently, an iterative method named the generalized minimal residual method (GMRES)(m)algorithm with Variable Restart Parameter (VRP-GMRES(m) algorithm) is proposed. By properly changing a variable restart parameter for the GMRES(m) algorithm, the iteration stagnation problem resulting from improper selection of the parameter is resolved efficiently. Based on the framework of the VRP-GMRES(m) algorithm and the relevant properties of generalized inverse matrix, the projection of the error vector rm+1 on rm is deduced. The result proves that the proposed algorithm is not only rapidly convergent but also highly accurate. Numerical experiments further show that the new algorithm can significantly improve the computational efficiency and accuracy. Its superiorities will be much more remarkable when it is used to solve larger scale problems. Therefore, it has extensive prospects in the FM-BEM field and other scientific and engineering computing.
Preprint
|
|
|
Mathematics & Computer Science, Numerical Analysis & Optimization; Klein-Gordon equation; trigonometric cubic B-spline; collocation; soliton; wave motion; conservation laws
Online: 2 December 2016 (08:45:07 CET)
|
|
Share this article with
×
In the present study, we derive a new B-spline technique namely trigonometric B-spline collocation algorithm to solve some initial boundary value problems for the nonlinear Klein-Gordon equation. In order to carry out the time integration with Crank-Nicolson implicit method, the order of the equation is reduced to give a coupled system of nonlinear partial differential equations. The collocation approximation based on trigonometric cubic B-splines for spatial discretization is followed by the linearization of the nonlinear term. The efficiency and accuracy of the present method are validated by measuring the error between the numerical and analytical solutions when exist. The conservation laws representing momentum and energy are also computed for all problems.
Preprint
|
|
|
Mathematics & Computer Science, Computational Mathematics; passenger flow distribution model; simulation design; performance evaluation; passenger flow volume; service level; urban rail transit hub platform
Online: 2 December 2016 (07:52:00 CET)
|
|
Share this article with
×
Urban rail transit hub platform is the most important area for passenger flow distribution. In order to calculate passenger flow volume in platform and evaluate platform service level during rush hours, this paper presents a method for modeling and simulation of passenger flow distribution in platform. Passenger flow distribution model (PFDM) is proposed based on the basic analysis and the superposition principle of passenger flow. Simulation design for PFDM is proposed by Anylogic, which contains simulation process and simulation model. Experiment results show that PFDM and simulation design are effective and accordant with the reality scenario, and the simulation precision is comparatively ideal. This research could provide a beneficial reference for train scheduling and operation management under the viewpoint of traffic safety and service level.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; gamma function; polygamma function; (p,k)-analogue; inequality
Online: 1 December 2016 (10:10:13 CET)
|
|
Share this article with
×
In this paper, we establish some inequalities bounding the ratio Гp,k(x)/Гp,k(y), where Гp,k(.) is the (p,k)-analogue of the Gamma function. Consequently, some previous results are recovered from the obtained results.
Preprint
|
|
|
Mathematics & Computer Science, Applied Mathematics; change point; estimation; consistency; panel data; short panels; boundary issue; structural change; bootstrap; non-life insurance; change in claim amounts
Online: 1 December 2016 (10:02:03 CET)
|
|
|
Share this article with
×
Panel data of our interest consist of a moderate number of panels, while the panels contain a small number of observations. An estimator of common breaks in panel means without a boundary issue for this kind of scenario is proposed. In particular, the novel estimator is able to detect a common break point even when the change happens immediately after the first time point or just before the last observation period. Another advantage of the elaborated change point estimator is that it results in the last observation in situations with no structural breaks. The consistency of the change point estimator in panel data is established. The results are illustrated through a simulation study. As a by-product of the developed estimation technique, a theoretical utilization for correlation structure estimation, hypothesis testing, and bootstrapping in panel data is demonstrated. A practical application to non-life insurance is presented as well.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; explicit form; inhomogeneous linear ordinary differential equation; derivative; Lerch transcendent; absolute monotonicity; complete monotonicity; Bernstein function; inequality; diagonal recurrence relation; Stirling numbers of the first kind; logarithmic function
Online: 29 November 2016 (08:00:53 CET)
|
|
Share this article with
×
In the paper, the authors present an explicit form for a family of inhomogeneous linear ordinary differential equations, find a more significant expression for all derivatives of a function related to the solution to the family of inhomogeneous linear ordinary differential equations in terms of the Lerch transcendent, establish an explicit formula for computing all derivatives of the solution to the family of inhomogeneous linear ordinary differential equations, acquire the absolute monotonicity, complete monotonicity, the Bernstein function property of several functions related to the solution to the family of inhomogeneous linear ordinary differential equations, discover a diagonal recurrence relation of the Stirling numbers of the first kind, and derive an inequality for bounding the logarithmic function.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; Bell polynomial; explicit formula; derivative; Stirling number; generating function; identity; Faà di Bruno formula; differential equation
Online: 29 November 2016 (07:04:11 CET)
|
|
Share this article with
×
In the paper, the authors discuss the Bell polynomials and a sequence of polynomials applied to the theory of hyperbolic differential equations. Concretely speaking, the authors find four explicit formulas for these polynomials and for derivatives of generating functions of these polynomials, establish four identities between these two kinds of polynomials, and significantly simplify some known results.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; Hermite polynomial; square; generating function; higher order derivative; differential equation; derivative polynomial; explicit formula; recurrence relation
Online: 29 November 2016 (06:50:11 CET)
|
|
Share this article with
×
In the paper, the authors consider the generating functions of the Hermite polynomials and their squares, present explicit formulas for higher order derivatives of the generating functions of the Hermite polynomials and their squares, which can be viewed as ordinary differential equations or derivative polynomials, find differential equations that the generating functions of the Hermite polynomials and their squares satisfy, and derive explicit formulas and recurrence relations for the Hermite polynomials and their squares.
Preprint
|
|
|
Mathematics & Computer Science, General & Theoretical Computer Science; LZ compression; decoding; pram; mapreduce
Online: 28 November 2016 (02:00:11 CET)
|
|
Share this article with
×
Broadcasting a message from one to many processors in a network corresponds to concurrent reading on a random access shared memory parallel machine. Computing the trees of a forest, the level of each node in its tree and the path between two nodes are problems that can easily be solved with concurrent reading in a time logarithmic in the maximum height of a tree. Solving such problems with exclusive reading requires a time logarithmic in the number of nodes, implying message passing between disjoint pairs of processors on a distributed system. Allowing concurrent reading in parallel algorithm design for distributed computing might be advantageous in practice if these problems are faced on shallow trees with some specific constraints. We show an application to LZC-compressed file decoding, whose parallelization employs these computations on such trees for realistic data. On the other hand, zipped files do not have such advantage since they are compressed by the Lempel-Ziv sliding window technique.
Preprint
|
|
|
Mathematics & Computer Science, Artificial Intelligence & Robotics; DEVS; neural net computation; XOR function; artificial neural nets; deterministic systems; probabilistic systems
Online: 27 November 2016 (05:11:45 CET)
|
|
Share this article with
×
In the context of modeling and simulation of neural nets, we formulate definitions for behavioral realization of memoryless functions. The definitions of realization are substantively different for deterministic and stochastic systems constructed of neuron-inspired components. In contrast to Artificial Neural Nets (ANN), and their myriad-layered deep forms, our definitions of realization fundamentally include temporal and probabilistic characteristics of their inputs, state, and outputs. The realizations that we construct, in particular for the XOR logic gate, provide insight into the temporal and probabilistic characteristics that real neural systems might display. We conclude with implications made when contrasting our time-based neural computation systems to ANN for what real brain computations might involve.
Preprint
|
|
|
Mathematics & Computer Science, Analysis; Gamma function; conformable Gamma function; inequality
Online: 23 November 2016 (09:59:05 CET)
|
|
Share this article with
×
In a recent paper, Sarikaya et al. introduced a new analogue of the classical Gamma function which they called, the conformable Gamma function. Motivated by their results, this paper seeks to establish some inequalities for the conformable Gamma and Polygamma functions. Among other analytical tools, the procedure relies on the generalized forms of some classical inequalities.
Preprint
|
|
|
Mathematics & Computer Science, Information Technology & Data Management; diversity; algorithms; legal information retrieval
Online: 23 November 2016 (09:50:24 CET)
|
|
Share this article with
×
"Public legal information from all countries and international institutions is part of the common heritage of humanity. Maximizing access to this information promotes justice and the rule of law". In accordance with the aforementioned declaration on Free Access to Law by Legal information institutes of the world, a plethora of legal information is available through the Internet, while the provision of legal information has never before been easier. Given that law is accessed by a much wider group of people, the majority of whom are not legally trained or qualified, diversification techniques, should be employed in the context of legal information retrieval, as to increase user satisfaction. We address diversification of results in legal search by adopting several state of the art methods from the web search, network analysis and text summarization domains. We provide an exhaustive evaluation of the methods, using a standard data set from the Common Law domain that we subjectively annotated with relevance judgments for this purpose. Our results i) reveal that users receive broader insights across the results they get from a legal information retrieval system, ii) demonstrate that web search diversification techniques outperform other approaches (e.g., summarization-based, graph-based methods) in the context of legal diversification and iii) offer balance boundaries between reinforcing relevant documents or sampling the information space around the legal query.
Preprint
|
|
|
Mathematics & Computer Science, Other; semantic spatial trajectory; role based access control; Bell-Lapadula model; multi-policy; Web Ontology Language
Online: 17 November 2016 (11:04:10 CET)
|
|
Share this article with
×
With the proliferation of locating devices, more and more raw spatial trajectories are formed, and many works enrich these raw trajectories with semantics, and mine patterns from both raw and semantic trajectories, but access control of spatial trajectories is not considered yet. We present a multi-policy secure model for semantic spatial trajectories. In our model, Mandatory Access Control, Role Based Access Control and Discretionary Access control are all enforced, separately and combined, and we represent the model semi-formally in Ontology Web Language.