English
Related papers

Related papers: Finding the Year's Share in Day-of-Week Calculatio…

200 papers

In this paper, we propose a new algorithm of calculating the day of the week for any given century, year, month and day in Gregorian calendar. We provide two simple formulas to convert the century and the year into two integers. Then we…

History and Overview · Mathematics 2014-04-10 Xiang-Sheng Wang

We propose a modification of a key component in the Doomsday Algorithm for calculating the day of the week of any calendar date. In particular, we propose to replace the calculation of the required term: \lfloor \frac{x}{12} \rfloor + x…

Data Structures and Algorithms · Computer Science 2011-08-09 Chamberlain Fong , Michael K. Walters

We propose a modification of a key component in the Doomsday Algorithm for calculating the day of the week of any calendar date. In particular, we propose to replace the calculation of the required term: \lfloor \frac{x}{12} \rfloor + x…

Data Structures and Algorithms · Computer Science 2011-01-28 Chamberlain Fong

Conway's Doomsday Algorithm (1973) determines the day of the week for any date in the Gregorian calendar via three additive components: a century anchor, a year offset, and a month-day offset. The century anchor is a fixed four-entry table.…

History and Overview · Mathematics 2026-05-06 Thomas Wollin

In this recreative piece of work, we present Gauss' calendar formula with some examples to demonstrate how it is applied. Then, based on it, we give a formula for determining dates of particular week days of a given month, and some examples…

History and Overview · Mathematics 2024-02-13 Kwara Nantomah

Digital System Research has pioneered the mathematics and design for a new class of computing machine using residue numbers. Unlike prior art, the new breakthrough provides methods and apparatus for general purpose computation using several…

Other Computer Science · Computer Science 2015-12-04 Eric B. Olsen

In bibliometrics studies, a common challenge is how to deal with incorrect or incomplete data. However, given a large volume of data, there often exists certain relationships between the data items that can allow us to recover missing data…

Digital Libraries · Computer Science 2014-07-23 Tom Z. J. Fu , Qiufang Ying , Dah Ming Chiu

We build on the empirical finding that a human being's mental age is normally distributed around the chronological age. This opposes the frequent societal assumption "mental = chronological" which is known to be false in general but…

Applications · Statistics 2021-07-30 Patrick A. Haas

Proportional apportionment is the problem of assigning seats to parties according to their relative share of votes. Divisor methods are the de-facto standard solution, used in many countries. In recent literature, there are two algorithms…

Data Structures and Algorithms · Computer Science 2017-12-06 Raphael Reitzig , Sebastian Wild

Modern BPE tokenizers often split calendar dates into meaningless fragments, e.g., 20250312 $\rightarrow$ 202, 503, 12, inflating token counts and obscuring the inherent structure needed for robust temporal reasoning. In this work, we (1)…

Computation and Language · Computer Science 2025-09-25 Gagan Bhatia , Maxime Peyrard , Wei Zhao

For a given irrational number, we consider the properties of best rational approximations of given parities. There are three different kinds of rational numbers according to the parity of the numerator and denominator, say odd/odd, even/odd…

Number Theory · Mathematics 2024-03-20 Dong Han Kim , Seul Bee Lee , Lingmin Liao

Labor share, the fraction of economic output accrued as wages, is inexplicably declining in industrialized countries. Whilst numerous prior works attempt to explain the decline via economic factors, our novel approach links the decline to…

General Economics · Economics 2024-01-05 B. N. Kausik

Dates and calendar periods (i.e., days, months, years) appear frequently in tasks involving analysis of software, data, and documents. Prior research has shown that computer logic involving dates and calendrical calculations is error-prone…

Logic in Computer Science · Computer Science 2026-05-26 Leyi Cui , Shrey Tiwari , Rohan Padhye

Comparison of three kind of the clustering and find cost function and loss function and calculate them. Error rate of the clustering methods and how to calculate the error percentage always be one on the important factor for evaluating the…

Machine Learning · Computer Science 2014-11-14 Kamran Kowsari

Decision tree is an important method for both induction research and data mining, which is mainly used for model classification and prediction. ID3 algorithm is the most widely used algorithm in the decision tree so far. In this paper, the…

Machine Learning · Computer Science 2016-12-02 Singh Vijendra , Hemjyotsana Parashar , Nisha Vasudeva

This paper presents a novel idea for the general case of the Common Due-Date (CDD) scheduling problem. The problem is about scheduling a certain number of jobs on a single or parallel machines where all the jobs possess different processing…

Data Structures and Algorithms · Computer Science 2014-05-07 Abhishek Awasthi , Jörg Lässig , Oliver Kramer

A deterministic algorithm for factoring $n$ using $n^{1/3+o(1)}$ bit operations is presented. The algorithm tests the divisibility of $n$ by all the integers in a short interval at once, rather than integer by integer as in trial division.…

Number Theory · Mathematics 2016-08-01 Ghaith A. Hiary

Probabilistic graphical models have emerged as a powerful modeling tool for several real-world scenarios where one needs to reason under uncertainty. A graphical model's partition function is a central quantity of interest, and its…

Artificial Intelligence · Computer Science 2021-05-25 Durgesh Agrawal , Yash Pote , Kuldeep S Meel

We apply the splitting method to three well-known counting problems, namely 3-SAT, random graphs with prescribed degrees, and binary contingency tables. We present an enhanced version of the splitting method based on the capture-recapture…

Computation · Statistics 2011-04-01 Paul Dupuis , Bahar Kaynar , Ad Ridder , Reuven Rubinstein , Radislav Vaisman

We obtain two new algorithms for partial fraction decompositions; the first is over algebraically closed fields, and the second is over general fields. These algorithms takes $O(M^2)$ time, where $M$ is the degree of the denominator of the…

Combinatorics · Mathematics 2007-05-23 Guoce Xin
‹ Prev 1 2 3 10 Next ›