The aim of this paper is to construct generating functions for certain families of special finite sums by using the Newton-Mercator series, hypergeometric functions, and p$$ p $$-adic integral. By using these generati...
详细信息
The aim of this paper is to construct generating functions for certain families of special finite sums by using the Newton-Mercator series, hypergeometric functions, and p$$ p $$-adic integral. By using these generating functions with their functional and partial derivative equations, many novel computational formulas involving the special finite sums of (inverse) binomial coefficients, the Bernoulli type polynomials and numbers, Euler polynomials and numbers, the Stirling numbers, the (alternating) harmonic numbers, the Leibnitz polynomials, and others are derived. We also develop a computation algorithm for these finite sums and provide some of their special values. By using these finite sums and combinatorial numbers, we find some formulas involving multiple alternating zeta functions, the Bernoulli polynomials of higher order and the Euler polynomials of higher order. We then obtain a decomposition from these formulas, which are related to the multiple Hurwitz zeta functions.
The paper is concerned with computer-based techniques for the choice and development of computational resources and their efficient use to find an approximate solution with a given accuracy in a limited processor time.
The paper is concerned with computer-based techniques for the choice and development of computational resources and their efficient use to find an approximate solution with a given accuracy in a limited processor time.
Prelinguistic infants must find a way to isolate meaningful chunks from the continuous streams of speech that they hear. BootLex, a new model which uses distributional cues to build a lexicon, demonstrates how much ca...
详细信息
Prelinguistic infants must find a way to isolate meaningful chunks from the continuous streams of speech that they hear. BootLex, a new model which uses distributional cues to build a lexicon, demonstrates how much can be accomplished using this single source of information. This conceptually simple probabilistic algorithm achieves significant segmentation results on various kinds of language corpora - English, Japanese, and Spanish: child- and adult-directed speech, and written texts;and several variations in coding structure - and reveals which statistical characteristics of the input have an influence on segmentation performance. BootLex is then compared, quantitatively and qualitatively, with three other groups of computational models of the same infant segmentation process, paying particular attention to functional characteristics of the models and their similarity to human cognition. Commonalities and contrasts among the models are discussed, as well as their implications both for theories of the cognitive problem of segmentation itself, and for the general enterprise of computational cognitive modeling. (C) 2002 Elsevier Science B.V. All rights reserved.
We report a novel computational algorithm "BP-STOCH" to be used for studying single-type ligand binding with biopolymers of finite lengths, such as DNA oligonucleotides or oligopeptides. It is based on an id...
详细信息
We report a novel computational algorithm "BP-STOCH" to be used for studying single-type ligand binding with biopolymers of finite lengths, such as DNA oligonucleotides or oligopeptides. It is based on an idea to represent any type of ligand biopolymer complex in a form of binary number, where "0" and "1" bits stand for vacant and engaged monomers of the biopolymer, respectively. Cycling over all binary numbers from the lowest 0 up to the highest 2(N) - 1 means a sequential generating of all possible configurations of vacant/ engaged monomers, which, after proper filtering, results in a full set of possible types of complexes in solution between the ligand and the N-site lattice. The principal advantage of BP-STOCH algorithm is the possibility to incorporate into this cycle any conditions on computation of the concentrations and observed experimental parameters of the complexes in solution, and programmatic access to each monomer of the biopolymer within each binding site of every binding configuration. The latter is equivalent to unlimited extension of the basic reaction scheme and allows to use BP-STOCH algorithm as an alternative to conventional computational approaches. (C) 2010 Wiley Periodicals, Inc. Biopolymers 95: 208-216, 2011.
The use of various opportunities for computation optimization in computer technologies for applied and computational mathematics problems with prescribed quality characteristics is investigated. More precisely, the ch...
详细信息
The use of various opportunities for computation optimization in computer technologies for applied and computational mathematics problems with prescribed quality characteristics is investigated. More precisely, the choice and determination of computational resources and methods of their efficient use for finding an approximate solution of problems up to prescribed accuracy in a limited amount of processor time are investigated.
Recently, hesitant fuzzy sets (HFSs) have been used extensively in time series forecasting. HFSs have inherent characteristics of addressing problem of non-stochastic hesitancy that is developed as a result of the ava...
详细信息
Recently, hesitant fuzzy sets (HFSs) have been used extensively in time series forecasting. HFSs have inherent characteristics of addressing problem of non-stochastic hesitancy that is developed as a result of the availability of numerous techniques for fuzzification of time series data. In the present study, we have developed an HFS-based computational method for weighted fuzzy time series (WFTS) forecasting. The proposed method addresses the three main issues of appropriate partitioning of the universe of discourse (UOD) into unequal-length intervals, inclusion of hesitancy during fuzzification of time series data, recurrence, and weighting of fuzzy logical relation (FLR) in fuzzy time series forecasting. The proposed method uses a non-parametric clustering approach of adaptive radius clustering for accurate partitioning of UOD and HFS for inclusion of hesitancy in time series during process of fuzzification. The recurrence and weighting of FLRs are handled using Markov weights, which are then subsequently optimized by utilizing the popular swarm intelligence technique of grey wolf optimization. A simple computational method is provided that incorporates the optimized weights, thus simplifying the forecasting process. The proposed WFTS forecasting method is implemented in the Python programming language to forecast benchmark time series data of the University of Alabama and financial time series data of Taiwan stock exchange (TAIEX), market price of State Bank of India (SBI) at Bombay Stock Exchange (BSE), India. The model's performance is measured by means of root-mean-square error (RMSE), and its reduced amount demonstrates the model's outperformance in forecasting of three diversified time series data taken in the study.
A mathematical model of heat transfer between the permafrost foundation of a building with a system of freezing pipes and atmospheric air is constructed and numerically implemented. As a mathematical model of heat tra...
详细信息
A mathematical model of heat transfer between the permafrost foundation of a building with a system of freezing pipes and atmospheric air is constructed and numerically implemented. As a mathematical model of heat transfer in the building foundation, the Stefan problem in the enthalpy statement with smoothed coefficients and a smeared temperature source is used. The heat transfer in the system of pipes is described by a one-dimensional convection-conduction equation. Numerical results obtained on model problems showed that the proposed numerical method significantly reduces the computational complexity of the problem.
Protein structure determination by cryo-electron microscopy (EM) has made significant progress in the past decades. Resolutions of EM maps have been improving as evidenced by recently reported structures that are solv...
详细信息
Protein structure determination by cryo-electron microscopy (EM) has made significant progress in the past decades. Resolutions of EM maps have been improving as evidenced by recently reported structures that are solved at high resolutions close to 3 angstrom. computational methods play a key role in interpreting EM data. Among many computational procedures applied to an EM map to obtain protein structure information, in this article we focus on reviewing computational methods that model protein three-dimensional (3D) structures from a 3D EM density map that is constructed from two-dimensional (2D) maps. The computational methods we discuss range from de novo methods, which identify structural elements in an EM map, to structure fitting methods, where known high resolution structures are fit into a low-resolution EM map. A list of available computational tools is also provided. (C) 2013 Elsevier Inc. All rights reserved.
The values of linear operators of a given class are estimated in the case of measurements including piecewise continuous noise of deterministic structure with unknown parameters. A computational scheme producing unbia...
详细信息
The values of linear operators of a given class are estimated in the case of measurements including piecewise continuous noise of deterministic structure with unknown parameters. A computational scheme producing unbiased linear estimates that are invariant under the noise is developed. An illustrative example is presented.
Exact two-tailed tests and two-sided confidence intervals (CIs) for a binomial proportion or Poisson parameter by Sterne (Biometrika 41:117-129, 1954) or Blaker (Can J Stat 28(4):783-798, 2000) are successful in reduc...
详细信息
Exact two-tailed tests and two-sided confidence intervals (CIs) for a binomial proportion or Poisson parameter by Sterne (Biometrika 41:117-129, 1954) or Blaker (Can J Stat 28(4):783-798, 2000) are successful in reducing conservatism of the Clopper-Pearson method. However, the methods suffer from an inconsistency between the tests and the corresponding CIs: In some cases, a parameter value is rejected by the test, though it lies in the CI. The problem results from non-unimodality of the test p value functions. We propose a slight modification of the tests that avoids the inconsistency, while preserving nestedness and exactness. Fast and accurate algorithms for both the test modification and calculation of confidence bounds are presented together with their theoretical background.
暂无评论