prompt_front: Now, answer the following question based on the text below, only give me the answer and do not output any other words.

Question: When was the paper published?

Read the following text and answer briefly.

Context 1: Paper Info

Title: Interpretable reduced-order modeling with time-scale separation Interpretable reduced-order modeling with time-scale separation
Publish Date: 7 March 2023
Author List: Sebastian Kaltenbach (from CSE-Lab, ETH Zurich, Harvard SEAS), Phaedon-Stelios Koutsourelakis (from CSE-Lab, ETH Zurich, Harvard SEAS), Petros Koumoutsakos (from CSE-Lab, ETH Zurich, Harvard SEAS), Harvard Seas (from CSE-Lab, ETH Zurich, Harvard SEAS)

Figure

FIG  5  Comparison between the phase-space of the reference solution (left) and the phase-space of the predictions
FIG  7  Comparison between predictions and reference solutions for a new initial condition fort = 1 25, 3 75, 7 5, 12 5, 20, 30  (from left to right and top to down) We note that with longer prediction time the uncertainty bounds increases Despite the chaotic nature of the KS equation, the predictive posterior mean is close to the reference solution for t ≤ 12 5

abstract

Partial Differential Equations (PDEs) with high dimensionality are commonly encountered in computational physics and engineering  However, finding solutions for these PDEs can be computationally expensive, making model-order reduction crucial  We propose such a data-driven scheme that automates the identification of the time-scales involved and, can produce stable predictions forward in time as well as under different initial conditions not included in the training data 
To this end, we combine a non-linear autoencoder architecture with a time-continuous model for the latent dynamics in the complex space  It readily allows for the inclusion of sparse and irregularly sampled training data  The learned, latent dynamics are interpretable and reveal the different temporal scales involved 
We show that this data-driven scheme can automatically learn the independent processes that decompose a system of linear ODEs along the eigenvectors of the system's matrix  Apart from this, we demonstrate the applicability of the proposed framework in a hidden Markov Model and the (discretized) Kuramoto-Shivashinsky (KS) equation 
Additionally, we propose a probabilistic version, which captures predictive uncertainties and further improves upon the results of the deterministic framework 

INTRODUCTION

High-fidelity simulations of critical phenomena such as ocean dynamics and epidemics have become essential for decision-making  They are based on physically-motivated PDEs expressing system dynamics that span multiple spatiotemporal scales and which necessitate cumbersome computations   In recent years there is increased attention to the development of data-driven models that can accelerate the solution of these PDEs as well as reveal salient, lower-dimensional features that control the long-term evolution 
In most cases, data-driven reduced-order models are not interpretable  In particular, models based on neural networks despite good predictive capabilities , they offer a black-box description of the system dynamics  A possible remedy is applying a symbolic regression to the learned neural network representation , but this adds additional computational cost due to the two-step procedure 
A number of frameworks such as SINDy allows to learn interpretable dynamics but it relies on the a-priori availability of lower-dimensional descriptors and of time-derivatives which can be very noisy for both simulation and experimental data  Other frameworks are tailored to specific problems such as molecular dynamics  
Here, we present a framework that only needs the value of the observables, and not their derivatives, as training data and is capable of identifying interpretable latent dynamics  The deployment of interpretable latent dynamics ensures that conservation of important properties of that are reflected in the reduced-order model  
The present method is related to approaches based on the Koopman-operator extended Dynamic Mode Decomposition (eDMD) but uses continuous complex-valued latent space dynamics and only requires one scalar variable per latent dimension to describe the latent space dynamics  Therefore we do not have to enforce any parametrizations on the Koopman matrix  
The time-continuous formulation moreover allows to incorporate sparse and irregularly sampled training data and fast generation of predictions after the training phase  By using a complex-valued latent space we can also incorporate harmonic effects and reduce the number of latent variables needed  Linear and non-linear autoencoders are used to map the observed, high-dimensional time-series to the lower-dimensional, latent representation and we identify simultaneously the autoencoder as well as the latent dynamics by optimizing a combined loss function 
Hence the to tasks of dimensionality reduction and discovery of the reduced dynamics are unified while other frameworks treat the two parts separately   Apart from using an architecture based on autoencoders to identify the latent space, projection-based methods could also be employed   We are also proposing a probabilistic version of our algorithm ) that makes use of probabilistic Slow Feature Analysis  
This allows for a latent representation that arart from being time-continuous, can quantify the predictive uncertainty and hierarchically decompose the dynamics into their pertinent scales while promoting the discovery of slow processes that control the system's evolution over long time horizons  The rest of the paper is structured as follows: We introduce the methodological framework as well as algorithmic details in section II 
Particular focus is paid on the interpretability of the inferred lower-dimensional dynamics  In section III we present three numerical illustrations, i e  a system of linear ODEs, a hidden Markov Model and the discretized KS-equation  We then present in section IV the probabilistic extension of the framework and apply it to the KS-equation 
We conclude with a summary and a short discussion about possible next steps  We introduce the autoencoders deployed in this work, followed by the interpretable latent space dynamic and discuss the training process  We consider data from high-dimensional time series x n ∈ R f with n = 1,    , T   We remark that the intervals between the different states do not need to be uniformly spaced 

Autoencoder

A core assumption of the method is that each high-dimensional state x n can be compressed to a lower-dimensional representation z n ∈ C c with c << f   We identify this lower-dimensional representation by an autoencoder consisiting of a parameterized encoder and decoder  The encoder maps the high-dimensional representation to the latent space as:
The latent space is complex-valued  The decoder reconstructs the high-dimensional representation based on the latent variables as: We denote the parameters of the encoder as well as the decoder by θ  As discussed later in Section II C, both set of parameters are optimized simultaneously during training and therefore there is no need for differentiating them 

Interpretable Latent Space Dynamics

We employ a propagator in the latent space to capture the reduced-order dynamics of the system  In contrast to other time-extended variational autoencoder frameworks, our representation uses complex valued latent variables  In addition the latent variables are treated independently  The latter feature enables us to have an interpretable latent dynamics as well as a model that is especially suitable for being trained in the Small Data regime due to the small number of required parameters 
This is in contrast to temporal propagators such as LSTMs   For each dimension i of the latent variable z we are using the following continuous ODE in the complex plane: By solving this ODE, we can define the operator: Interpretable reduced-order modeling with time-scale separation Here, λ is a vector containing all the individual λ's and ∆t n indicates the time-step between the latent states 
The symbol is used to indicate a component-wise multiplication  We remark that the latent variables and the parameter governing the temporal evolution are complex numbers and their role in describing the system dynamics is similar to that of an eigenvalue  The real part is associated with growth and decay whereas the imaginary part is representing the periodic component 
This approach has similarities with the Koopman-operator based methods and the extended dynamic mode decomposition   In contrast to the methods mentioned before we are using a continuous formulation in the latent space that allows us to incorporate scarce and irregularly sampled training data and directly rely on complex numbers in the latent space 

Training and Predictions

We optimize a loss function that combines both a reconstruction loss as well as a loss associated with the error of our learned propagator in the latent space: (5) We note that we could directly incorporate mini-batch training by only taking the summation over a subset of the N available training data 
For new predictions of unseen states, we use the encoder to generate a latent representations which is then advanced in time by the learned propagator  At a designated time step we are using the decoder to reconstruct the high-dimensional solution  We applied our algorithm to three systems  First, we show that the algorithm is capable of exactly reproducing the solution of a linear ODE and to identify its eigenvalues 
Afterwards we are applying the framework to a high-dimensional process generated by a complex latent dynamics, which is correctly identified  As a final test case, we are applying the algorithm to a Kuramoto Shivashinski (KS) equation  Interpretable reduced-order modeling with time-scale separation

Linear ODE

We are considering a two-dimensional ODE system for x = y 1 y 2 : Based on the obtained training data we run our algorithm using a linear encoder and decoder structure as well as two latent variables z  The loss function was optimized using the Adam algorithm   As we consider a linear ODE we can analytically compute the eigenvalues involved and compare it with the parameters λ identified by our algorithm 
We observe in Figure that the algorithm was able to recover the correct values, i e  the eigenvalues 7 and 3 of the given linear ODE  The system does not have a periodic component and the two imaginary parts correctly go to zero, whereas the real parts converge to the reference value  Moreover we are also able to identify for the linear mapping between our latent variables z and the training data a matrix consisting of a multiple of the eigenvectors (1,1) and (1,-1) and thus the correct solution 
This example was chosen to show that the algorithm is able to quickly identify the exact solution of a linear ODE in terms of its linearly independent components 

Hidden multiscale dynamics

We consider eight-dimensional synthetic time series data produced by an underlying twodimensional complex valued process  In particular, the data points x are generated by first solving for the temporal evolution for the two complex-valued processes p 1 and p 2 and than mapping to the eight-dimensional space by using a randomly sampled linear mapping W  
One of the two processes used to generate the data is chosen to be much slower than the other one and both processes have a periodic component  dp 2 dt = (−0 9 + 1 5i)p 2 (8) As training data we consider 40 time series with 150 data points each, obtained by simulating the described processes for a maximum of t = 15 s and then sampling from the obtained data points 
Hence the training data consists of: • 40 time-series • with each consisting 150 observations of the x at a uniform time-step ∆t = 0 0025 The autoencoder obtained consists of one linear layer for both the decoder as well as the encoder  The model is trained for 5000 iterations using the Adam optimizer and a learning rate of 10 −3  
The results for the convergence of the parameters λ 1 and λ 2 can be found in Figure   We note that the process which is slower decaying and thus more responsible for the long-term evolution of the system has a higher convergence rate than the faster process  With the obtained parameters λ as well as the trained autoencoder, we compute predictions based on the last time step used for training, i e  we apply the encoder to obtain our latent representation and than use the latent dynamics to advance the latent representation in time 
Afterwards, we employ the decoder to reconstruct the full high-dimensional system  The results can be found in Figure and show very good agreement between predictions and reference data  This example shows that our model is successfully able to carry out dimensionality reduction and moreover indicates that the convergence rate between latent processes can be different 
The latter is relevant when training models as for accurate predictions all latent processes and their dynamics should be converged 

Kuramoto-Sivashinsky

Finally, we applied our algorithm to the KS equation and aim to identify a reduced-order model for the solution u(y, t): We employed periodic boundary conditions, µ = 1 and a domain size y ∈ [0, 22]  For this domain-size, the KS-equation exhibits a structurally stable chaotic attractor as discussed in The black lines divides the area for which training data was given from the area without raining data 
;   The equation is discretized in space using a discretization step of 22 64 resulting in a state vector x of dimension 64 and a nonlinear system of coupled ODEs  This is solved using a stiff fourth-order solver  We employed a non-linear encoder and decoder with four fully-connected layers each and ReLU-activation functions as well as Dropout Layers between the fully-connected layers 
We trained the model for 200000 iterations using Adam and a learning rate of 5 • 10 4 and assuming a five-dimensional latent space  We obtained the λ's in Figure   Four latent variables have λ's close to zero and thus a slow temporal dynamic that is responsible for the long-term evolution whereas one latent variable is quickly decaying 
Based on the obtained parameters, we do predictions based on an unseen initial condition not contained in the training data  We are able to reconstruct the correct phase space based on our predictions despite only using a very limited amount of training data  The results for the phase space can be seen in Figure  
Although the small-scale fluctuations in the temporal dynamics are not well captured, the model identifies the correct manifold which has a good accuracy compared to the reference solution  All phase-spaces were obtained by using a finite-difference operator on the data or predictions  These results are in accordance Interpretable reduced-order modeling with time-scale separation with whose LSTM-based temporal dynamic model was also able to find the correct phase space but not to track the actual dynamics for long-term predictions 
Our model is not able to account for noise in the temporal evolution and thus dealing with chaotic, small-scale fluctuations is challenging  We believe that a probabilistic version of our algorithm could be advantageous here  This section contains a fully probabilistic formulation for the deterministic model discussed before 
We replace the Autoencoder with a Variational Autoencoder and the ODE in the latent space with a SDE  The loss function which we optimize is the Evidence-Lower Bound (ELBO) 

Model Structure

We postulate the following relations for our probabilistic model using an Ornstein-Uhlenbeck (OU) for each dimension i of the latent space and a Wiener process W t in the latent space: We again assume that the latent variables z t are complex-valued and a priori independent  Complex variables were chosen as their evolution includes a harmonic components which are observed in many physical systems 
We assume an initial conditions z 0,i ∼ CN (0, σ 2 0,i )  The total parameters associated with the latent space dynamics of our model are thus {σ 2 0,i , σ 2 i , λ i } c i=1 and will be denoted by θ together with all parameters responsible for the decoder mapping G (see next section)  These parameters along with the state variables z t have to be inferred from the data x t  
Based on probabilistic Slow Feature Analysis (SFA) , we set σ 2 i = 2; (λ j ) and σ 2 0,i = 1  As a consequence, a priori, the latent dynamics are stationary  A derivation and reasoning for this choice can be found in Appendix A  Hence the only independent parameters are the λ i , the imaginary part of which can account for periodic effects in the latent dynamics 

Variational Autoencoder

We employ a variational autoencoder to account for a probabilistic mappings from the lower-dimensional representation z n to the high-dimensional system x n   In particular we are employing a probabilistic decoder The encoder is used to infer the state variables z based on the given data and thus defined in the inference and learning section 

Inference and Learning

Given the probabilistic relations , our goal is to infer the latent variables z 0:T as well as all model parameters θ  We follow a hybrid Bayesian approach in which the posterior of the state variables is approximated using amortized Variational Inference and Maximum-A-Posteriori (MAP) point-estimates for θ are computed 
The application of Bayes' rule for each data sequence x 0:T leads to the following posterior: where p(θ) denotes the prior on the model parameters  In the context of variational inference, we use the following factorization of the approximate posterior i e  we infer only the mean µ and variance σ for each state variable based on the given data points 
This conditional density used for inference is the encoder-counterpart to the probabilistic decoder defined in the section before  It can be readily shown that the optimal parameter values are found by maximizing the Evidence Lower Bound (ELBO) F(q φ (z 0:T ), θ) which is derived in Appendix B  We compute Monte Carlo estimates of the gradient of the ELBO with respect to φ and θ with the help of the reparametrization trick and carry out stochastic optimization with the ADAM algorithm  

Results for the probabilistic extension

We applied our probabilistic version to the KS-equation  We used the same settings as for the deterministic approach but considered up to 10 complex latent variables  The obtained λ's are in Figure   The probabilistic model allows us to quantify the uncertainty in predictions  In Figure predictions for various time-steps and the respective uncertainty bounds are shown for an unseen initial condition 
Due to the chaotic nature of the KS-equation and the small amount of training data, the underlying linear dynamic of our model is only able to capture the full dynamics for a limited time horizon  Fortunately, due to the probabilistic approach the model is capable of capturing chaotic fluctuations with increasingly wide uncertainty bounds 
We also computed the phase space representation for the KS-equation based on the predictions obtained by our model and compare it with the reference solution  The probabilistic model identifies the correct manifold with a better accuracy than the deterministic model  As some of the small-scale fluctuations are accounted as noise, the resulting manifold is more concentrated at the origin and the obtained values are slightly smaller than the reference manifold although their shape is very similar 
Context 2: Paper Info

Title: Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring
Publish Date: 25 Mar 2023
Author List: Loïc Crombez (from LIMOS, Université Clermont Auvergne), Guilherme Da Fonseca (from LIS, Aix-Marseille Université), Florian Fontan (from Independent Researcher), Yan Gerard (from LIMOS, Université Clermont Auvergne), Aldo Gonzalez-Lorenzo (from LIS, Aix-Marseille Université), Pascal Lafourcade (from LIMOS, Université Clermont Auvergne), Luc Libralesso (from LIMOS, Université Clermont Auvergne), Benjamin Momège (from Independent Researcher), Jack Spalding-Jamieson (from David R  Cheriton School of Computer Science, University of Waterloo), Brandon Zhang (from Independent Researcher), Da Zheng (from Department of Computer Science, University of Illinois at Urbana-Champaign)

Figure

Figure 1: A partition of the input graph of the CG:SHOP2022 instance vispecn2518 into 57 plane graphs It is the smallest instance of the challenge with 2518 segments On top left, you see all 57 colors together On top right, you see a clique of size 57, hence the solution is optimal Each of the 57 colors is then presented in small figures 
Figure 2: Number of colors over time for the instance vispecn13806 using different values p The algorithm uses σ = 0 15, easy vertices, q max = 59022, but does not use the BDFS nor any clique 
Figure 3: Number of colors over time with different values of q max obtained on the instance vispecn13806 Parameters are σ = 0 15, p = 1 2, no clique knowledge, and no BDFS 
Figure 4: Number of colors over time with and without clique knowledge and BDFS obtained on the instance vispecn13806 Parameters are σ = 0 15, p = 1 2, and q max = 1500000 
Figure 5: Number of colors over time for the instance vispecn13806 for different values of σ In both figures the algorithm uses p = 1 2, easy vertices, q max = 59022, but does not use the BDFS nor any clique For σ ≥ 0 25, no solution better than 248 colors is found 
Figure 6: Number of colors over time (in hours) for the instance vispecn13806 
Several CG:SHOP 2022 results We compare the size of the largest known clique to the smallest coloring found by each team on a selection of 14 CG:SHOP 2022 instances 
[20][21][22][23][24][25] with state-of-the-art graph coloring algorithms The conflict optimizer underperforms except on the geometric graphs r* and dsjr* CE39-0007), SEVERITAS (ANR-20-CE39-0005) and by the French government IDEX-ISITE initiative 16-IDEX-0001 (CAP[20][21][22][23][24][25] The work of Luc Libralesso is supported by the French ANR PRC grant DECRYPT (ANR-18-CE39-0007) 

abstract

CG:SHOP is an annual geometric optimization challenge and the 2022 edition proposed the problem of coloring a certain geometric graph defined by line segments  Surprisingly, the top three teams used the same technique, called conflict optimization  This technique has been introduced in the 2021 edition of the challenge, to solve a coordinated motion planning problem 
In this paper, we present the technique in the more general framework of binary constraint satisfaction problems (binary CSP)  Then, the top three teams describe their different implementations of the same underlying strategy  We evaluate the performance of those implementations to vertex color not only geometric graphs, but also other types of graphs 

Introduction

The CG:SHOP challenge (Computational Geometry: Solving Hard Optimization Problems) is an annual geometric optimization competition, whose first edition took place in 2019  The 2022 edition proposed a problem called minimum partition into plane subgraphs  The input is a graph G embedded in the plane with edges drawn as straight line segments, and the goal is to partition the set of edges into a small number of plane graphs (Fig  )  
This goal can be formulated as a vertex coloring problem on a graph G defined as follows  The vertices of G are the segments defining the edges of G, and the edges of G correspond to pairs of crossing segments (segments that intersect only at a common endpoint are not considered crossing)  The three top-ranking teams (Lasa, Gitastrophe, and Shadoks) on the CG:SHOP 2022 challenge all used a common approach called conflict optimization while the fourth team used a SAT-Boosted Tabu Search  
Conflict optimization is a technique used by Shadoks to obtain the first place in the CG:SHOP 2021 challenge for low-makespan coordinated motion planning , and the main ideas of the technique lent themselves well to the 2022 challenge  Next, we describe the conflict optimizer as a metaheuristic to solve constraint satisfaction problems (CSP)  
We start by describing a CSP  A CSP is a triple of • variables X = (x 1 ,       , x n ), Each of the 57 colors is then presented in small figures  • domains D = (D 1 ,       , D n ), and • constraints R  Each variable x i must be assigned a value in the corresponding domain D i such that all constraints are satisfied 
In general, the constraints may forbid arbitrary subsets of values  We restrict our attention to a particular type of constraints (binary CSP ), which only involve pairs of assignments  A partial evaluation is an assignment of a subset of the variables, called evaluated, with the remaining variables called non-evaluated 
All constraints involving a non-evaluated variable are satisfied by default  We only consider assignments and partial assignments that satisfy all constraints  The conflict optimizer iteratively modifies a partial evaluation with the goal of emptying the set S of non-evaluated variables, at which point it stops 
At each step, a variable x i is removed from S  If there exists a value x ∈ D i that satisfies all constraints, then we assign the value x to the variable x i   Otherwise, we proceed as follows  For each possible value x ∈ D i , we consider the set K(i, x) of variables (other than x i ) that are part of constraints violated by the assignment x i = x 
We assign to x i the value x that minimizes where w(j) is a weight function to be described later  The variables x j ∈ K(i, x) become non-evaluated and added to S  The weight function should be such that w(j) increases each time x j is added to S, in order to avoid loops that keep moving the same variables back and forth from S  Let q(j) be the number of times x j became non-evaluated 
A possible weight function is w(j) = q(j)  More generally, we can have w(j) = q(j) p for some exponent p (typically between 1 and 2)  Of course, several details of the conflict optimizer are left open  For example, which element to choose from S, whether some random noise should be added to w, and the decision to restart the procedure from scratch after a certain time 
The CSP as is, does not apply to optimization problems  However, we can, impose a maximum value k of the objective function in order to obtain a CSP  The conflict optimizer was introduced in a low makespan coordinated motion planning setting  In that setting, the variables are the robots, the domains are their paths (of length at most k) and the constraints forbid collisions between two paths 
In the graph coloring setting, the domains are the k colors of the vertices and the constraints forbid adjacent vertices from having the same color  The conflict optimizer can be adapted to non-binary CSP, but in that case multiple variables may be unassigned for a single violated constraint  The strategy has some resemblance to the similarly named min-conflicts algorithm , but notable differences are that a partial evaluation is kept instead of an invalid evaluation and the weight function that changes over time 
While the conflict optimization strategy is simple, there are different ways to apply it to the graph coloring problem  The goal of the paper is to present how the top three teams applied it or complemented it with additional strategies  We compare the relative benefits of each variant on the instances given in the CG:SHOP 2022 challenge 
We also compare them to baselines on some instances issued from graph coloring benchmarks  The paper is organized as follows  Section 2 presents the details of the conflict optimization strategy applied to graph coloring  In the three sections that follow, the three teams Lasa, Gitastrophe, and Shadoks present the different parameters and modified strategies that they used to make the algorithm more efficient for the CG:SHOP 2022 challenge 
The last section is devoted to the experimental results 

Literature Review

The study of graph coloring goes back to the 4-color problem (1852) and it has been intensively studied since the 1970s (see for surveys)  Many heuristics have been proposed , as well as exact algorithms   We briefly present two classes of algorithms: greedy algorithms and exact algorithms  Greedy algorithms 
These algorithms are used to find good quality initial solutions in a short amount of time  The classic greedy heuristic considers the vertices in arbitrary order and colors each vertex with the smallest non-conflicting color  The two most famous modern greedy heuristics are DSATUR and Recursive Largest First (RLF )  
At each step (until all vertices are colored), DSATUR selects the vertex v that has the largest number of different colors in its neighbourhood  Ties are broken by selecting a vertex with maximum degree  The vertex v is colored with the smallest non-conflicting color  RLF searches for a large independent set I, assigns the vertices I the same color, removes I from G , and repeats until all vertices are colored 
Exact algorithms  Some exact methods use a branch-and-bound strategy, for example extending the DSATUR heuristic by allowing it to backtrack   Another type of exact method (branch-and-cut-and-price) decomposes the vertex coloring problem into an iterative resolution of two sub-problems   The "master problem" maintains a small set of valid colors using a set-covering formulation 
The "pricing problem" finds a new valid coloring that is promising by solving a maximum weight independent set problem  Exact algorithms are usually able to find the optimal coloring for graphs with a few hundred vertices  However, even the smallest CG:SHOP 2022 competition instances involve at least a few thousands vertices 

Conflict Optimization for Graph Coloring

Henceforth, we will only refer to the intersection conflict graph G induced by the instance  Vertices will refer to the vertices V (G ), and edges will refer to the edges E(G )  Our goal is to partition the vertices using a minimum set of k color classes C = {C 1 ,       , C k }, where no two vertices in the same color class C i are incident to a common edge 

Conflict Optimization

TABUCOL inspired neighbourhood One classical approach for the vertex coloring involves allowing solutions with conflicting vertices (two adjacent vertices with the same color)  It was introduced in 1987 and called TABUCOL  It starts with an initial solution, removes a color (usually the one with the least number of vertices), and assigns uncolored vertices with a new color among the remaining ones 
This is likely to lead to some conflicts (i e  two adjacent vertices sharing a same color)  The local search scheme selects a conflicting vertex, and tries to swap its color, choosing the new coloring that minimises the number of conflicts  If it reaches a state with no conflict, it provides a solution with one color less than the initial solution 
The process is repeated until the stopping criterion is met
Context 3: McPherson County (standard abbreviation: MP) is a county located in the U S  state of Kansas   As of the 2020 census, the county population was 30,223  The largest city and county seat is McPherson  The county is named for Civil War General James B  McPherson 

History

Early history

For many millennia, the Great Plains of North America was inhabited by nomadic Native Americans  From the 16th century to 18th century, the Kingdom of France claimed ownership of large parts of North America  In 1762, after the French and Indian War, France secretly ceded New France to Spain, per the Treaty of Fontainebleau  In 1802, Spain returned most of the land to France, but keeping title to about 7,500 square miles 

In 1803, most of the land for modern day Kansas was acquired by the United States from France as part of the 828,000 square mile Louisiana Purchase for 2 83 cents per acre  In 1848, after the Mexican–American War, the Treaty of Guadalupe Hidalgo with Spain brought into the United States all or part of land for ten future states, including southwest Kansas  In 1854, the Kansas Territory was organized, then in 1861 Kansas became the 34th U S  state 

19th century

From the 1820s to 1870s, the Santa Fe Trail passed through, what is now McPherson County  The trail entered the county, east of Canton, then south of Galva, then north of Inman, and west towards Lyons  In 1855, Charles O  Fuller established a ranch adjacent to the Running Turkey Creek Crossing about two miles south and one mile east of Galva  Fuller's Ranch provided accommodations for travelers on the Santa Fe Trail and was probably the first white settlement in McPherson County 

Peketon County was established in 1860, by the passage of a bill by S  N  Wood:  An act to establish Peketon County  Section 1  - That all that territory west of the sixth principal meridian and south of Township 16, in Kansas Territory, be and the same is hereby erected into a county, to be known by the name of Peketon County  On February 17, 1865, Peketon County was abolished, and McPherson County was made a part of Marion County, which extended from the west line of Chase County to the present western boundary of Kansas 

In 1868, Solomon Stephens and L  N  Holmberg were appointed Justices of the Peace—the first officers in what is now McPherson County  The next year (1869) occurred the first election for the township, now the county of McPherson  McPherson was regularly organized as a county in the spring of 1870, a mass meeting being held at Sweadal  Sweadal, the county seat thus selected, was located about one mile and a half southwest of the present site of Lindsborg  In September, however, the County Commissioners resolved to meet at the latter place, McPherson which had already been located some two years 

In April, 1873, a petition was filed for the county seat re-location  It was signed by 483 voters, and a special election was accordingly ordered for June 10  Upon that day, McPherson received 605 votes, New Gottland 325, King City 3 and Lindsborg 1; McPherson's majority over all, 276  In May the McPherson Town Company had offered, as an inducement for the location of the county seat at this point, the free use of rooms for ten years, and the donation of two squares of land on the town site  The offer was accepted the next month, the County Commissioners selecting blocks 56 and 65  Thus the county seat was established at McPherson and has remained since 

As early as 1875, city leaders of Marion held a meeting to consider a branch railroad from Florence  In 1878, Atchison, Topeka and Santa Fe Railway and parties from Marion County and McPherson County chartered the Marion and McPherson Railway Company   In 1879, a branch line was built from Florence to McPherson, in 1880 it was extended to Lyons, in 1881 it was extended to Ellinwood  The line was leased and operated by the Atchison, Topeka and Santa Fe Railway  The line from Florence to Marion, was abandoned in 1968  In 1992, the line from Marion to McPherson was sold to Central Kansas Railway  In 1993, after heavy flood damage, the line from Marion to McPherson was abandoned  The original branch line connected Florence, Marion, Canada, Hillsboro, Lehigh, Canton, Galva, McPherson, Conway, Windom, Little River, Mitchell, Lyons, Chase, then connected with the original AT&SF main line at Ellinwood 

In 1887, the Chicago, Kansas and Nebraska Railway extended its main line from Herington to Pratt   This main line connected Herington, Ramona, Tampa, Durham, Waldeck, Canton, Galva, McPherson, Groveland, Inman, Medora, Hutchinson, Whiteside, Partridge, Arlington,  Langdon, Turon, Preston, Natrona, Pratt   In 1888, this main line was extended to Liberal   Later, this line was extended to Tucumcari, New Mexico and Santa Rosa, New Mexico, where it made a connection with the Southern Pacific from El Paso, Texas   The Chicago, Kansas and Nebraska Railway was absorbed by the Chicago, Rock Island and Pacific Railway  This line is also called the "Golden State Route" 

20th century
The National Old Trails Road, also known as the Ocean-to-Ocean Highway, was established in 1912, and was routed through Windom, Conway, McPherson 

Geography

According to the U S  Census Bureau, the county has a total area of , of which  is land and  (0 3%) is water 

Adjacent counties
 Saline County (north)
 Dickinson County (northeast)
 Marion County (east)
 Harvey County (southeast)
 Reno County (southwest)
 Rice County (west)
 Ellsworth County (northwest)

Major highways
  Interstate 135
  U S  Route 56
  U S  Route 81
  K-4
  K-61
  K-153

Demographics

The McPherson Micropolitan Statistical Area includes all of McPherson County 

2000 census
As of the census of 2000, there were 29,554 people, 11,205 households, and 7,966 families residing in the county   The population density was 33 people per square mile (13/km2)   There were 11,830 housing units at an average density of 13 per square mile (5/km2)   The racial makeup of the county was 96 53% White, 0 81% Black or African American, 0 34% Native American, 0 32% Asian, 0 06% Pacific Islander, 0 79% from other races, and 1 16% from two or more races   1 94% of the population were Hispanic or Latino of any race  37 1% were of German, 12 9% Swedish, 12 1% American, 6 7% English and 6 3% Irish ancestry according to Census 2000 

There were 11,205 households, out of which 33 00% had children under the age of 18 living with them, 62 50% were married couples living together, 6 00% had a female householder with no husband present, and 28 90% were non-families  25 50% of all households were made up of individuals, and 11 80% had someone living alone who was 65 years of age or older   The average household size was 2 49 and the average family size was 2 99 

In the county, the population was spread out, with 25 40% under the age of 18, 10 30% from 18 to 24, 25 20% from 25 to 44, 21 80% from 45 to 64, and 17 30% who were 65 years of age or older   The median age was 38 years  For every 100 females there were 95 90 males   For every 100 females age 18 and over, there were 92 90 males 

The median income for a household in the county was $41,138, and the median income for a family was $48,243  Males had a median income of $33,530 versus $21,175 for females  The per capita income for the county was $18,921   About 4 20% of families and 6 60% of the population were below the poverty line, including 5 20% of those under age 18 and 8 10% of those age 65 or over 

Government

Presidential elections
McPherson county is often carried by Republican candidates  The last time a Democratic candidate has carried this county was in 1964 by Lyndon B  Johnson 

Laws
Following amendment to the Kansas Constitution in 1986, the county remained a prohibition, or "dry", county until 1996, when voters approved the sale of alcoholic liquor by the individual drink with a 30 percent food sales requirement 

Education

Colleges
 McPherson College in McPherson
 Bethany College in Lindsborg
 Central Christian College in McPherson

Unified school districts
 Smoky Valley USD 400
 McPherson USD 418
 Canton-Galva USD 419
 Moundridge USD 423
 Inman USD 448

School district office in neighboring county
 Goessel USD 411
 Little River-Windom USD 444

Museums
 Birger Sandzén Memorial Gallery in Lindsborg
 McCormick-Deering Days Museum in Inman
 McPherson Museum in McPherson
 Lindsborg Old Mill & Swedish Heritage Museum in Lindsborg
 Kansas Motorcycle Museum in Marquette

Communities

Cities

 Canton
 Galva
 Inman
 Lindsborg
 Marquette
 McPherson (county seat) 
 Moundridge
 Windom

Unincorporated communities
† means a Census-Designated Place (CDP) by the United States Census Bureau 
 Conway
 Elyria†
 Groveland
 Johnstown
 New Gottland
 Roxbury†

Ghost towns
 Alta Mills
 Battle Hill
 Christian
 Doles Park
 Elivon
 King City
 Sweadal

Townships
McPherson County is divided into twenty-five townships   The cities of Lindsborg and McPherson are considered governmentally independent and are excluded from the census figures for the townships   In the following table, the population center is the largest city (or cities) included in that township's population total, if it is of a significant size 

See also
 List of people from McPherson County, Kansas
 National Register of Historic Places listings in McPherson County, Kansas
 McPherson Valley Wetlands
 Maxwell Wildlife Refuge

References

Notes

Further reading

 Wheeler, Wayne Leland  "An Analysis of Social Change in a Swedish-Immigrant Community: The Case of Lindsborg, Kansas " (PhD dissertation, University of Missouri-Columbia; ProQuest Dissertations Publishing, 1959  5905657) 

County
 Through the Years: A Pictorial History of McPherson County; McPherson Sentinel' Heritage House Publishing Co; 1992 
 McPherson County First Courthouse Built About 1869 or 1870; Lindsborg News-Record; March 30, 1959 
 Pioneer Life and Lore of McPherson County, Kansas; Edna Nyquist; Democratic-Opinion Press; 1932 
 A History of the Church of the Brethren in Kansas (includes McPherson College history); Elmer LeRoy Craik; McPherson Daily; Republican Press; 397 pages; 1922 
 Portrait and Biographical Record of Dickinson, Saline, McPherson, and Marion Counties, Kansas; Chapman Bros; 614 pages; 1893 
 Standard Atlas of McPherson County, Kansas; Geo  A  Ogle & Co; 82 pages; 1921 
 Plat Book of McPherson County, Kansas; North West Publishing Co; 50 pages; 1903 
 Edwards' Atlas of McPherson County, Kansas; John P  Edwards; 51 pages; 1884 

Trails
 The Story of the Marking of the Santa Fe Trail by the Daughters of the American Revolution in Kansas and the State of Kansas; Almira Cordry; Crane Co; 164 pages; 1915  (Download 4MB PDF eBook)
 The National Old Trails Road To Southern California, Part 1 (LA to KC); Automobile Club Of Southern California; 64 pages; 1916  (Download 6 8MB PDF eBook)

Mennonite Settlements
 Impact of Mennonite settlement on the cultural landscape of Kansas; Brenda Martin; Kansas State University; 1985/1988  
 Mennonite settlement : the relationship between the physical and cultural environment; Susan Movle; University of Utah; 1975/1886 
 Status of Mennonite women in Kansas in their church and home relationships; Eva Harshbarger; Bluffton College; 1925/1945 

External links

County
 
 McPherson County - Directory of Public Officials
Historical
 , from Hatteberg's People'' on KAKE TV news
Maps
 McPherson County Maps: Current, Historic, KDOT
 Kansas Highway Maps: Current, Historic, KDOT
 Kansas Railroad Maps: Current, 1996, 1915, KDOT and Kansas Historical Society

 
Kansas counties
1867 establishments in Kansas
Populated places established in 1867



ground_truth: The paper was published on 7 March 2023.

prompt_front: Now, answer the following question based on the text below, only give me the answer and do not output any other words.

Question: What are the three teams that used conflict optimization in the challenge?

Read the following text and answer briefly.

Context 2:  While the original TABUCOL algorithm includes a "tabu-list" mechanism to avoid cycling, it is not always sufficient, and requires some hyper-parameter tuning in order to obtain a good performance on a large variety of instances  To overcome this issue, we use a neighbourhood, but replace the "tabu-list" by the conflict optimizer scheme presented above 
PARTIALCOL inspired neighbourhood PARTIALCOL another local search algorithm solving the vertex coloring problem was introduced in 2008  This algorithm proposes a new local search scheme that allows partial coloring (thus allowing uncolored vertices)  The goal is to minimize the number of uncolored vertices 
Similarly to TABUCOL, PARTIALCOL starts with an initial solution, removes one color (unassigning its vertices), and performs local search iterations until no vertex is left uncolored  When coloring a vertex, the adjacent conflicting vertices are uncolored  Then, the algorithm repeats the process until all vertices are colored, or the stopping criterion is met 
This neighbourhood was also introduced alongside a tabu-search procedure  The tabu-search scheme is also replaced by a conflict-optimization scheme  Note that this neighbourhood was predominantly used by the other teams 

Finding Initial Solutions

Lasa team used two approaches to find initial solutions: 1  DSATUR is the classical graph coloring algorithm presented in Section 1  2  Orientation greedy is almost the only algorithm where the geometry of the segments is used  If segments are almost parallel, it is likely that they do not intersect (thus forming an independent set) 
This greedy algorithm first sorts the segments by orientation, ranging from − π 2 to π 2   For each segment in this order, the algorithm tries to color it using the first available color  If no color has been found, a new color is created for coloring the considered segment  This algorithm is efficient, produces interesting initial solutions and takes into account the specificities of the competition 

Solution Initialization

The gitastrophe team uses the traditional greedy algorithm of Welsh and Powell to obtain initial solutions: order the vertices in decreasing order of degree, and assign each vertex the minimum-label color not used by its neighbors  During the challenge Gitastrophe attempted to use different orderings for the greedy algorithm, such as sorting by the slope of the line segment associated with each vertex (as the orientation greedy initialization presented in Section 3), and also tried numerous other strategies 
Ultimately, after running the solution optimizer for approximately the same amount of time, all initializations resulted in an equal number of colors 

Modifications to the Conflict Optimizer

Taking inspiration from memetic algorithms, which alternate between an intensification and a diversification stage, the algorithm continually switched between a phase using the above conflict score, and one minimizing only the number of conflicts  Thus during the conflict-minimization phase, the random variables f (C j ) and w(u) are both fixed equal to 1 leading to a conflict score
Each phase lasted for 10 5 iterations  Adding the conflict-minimization phase gave minor improvements to some of the challenge instances 

Shadoks

In this section, we describe the choices used by the Shadoks team for the options described in Section 2 1  The Shadoks generally chose to eliminate the color with the smallest number of elements  However, if the multistart option is toggled on, then a random color is used each time  The conflict set S is stored in a queue 
The Shadoks tried other strategies, but found that the queue gives the best results  The weight function used is w(u) = 1 + q(u) p , mostly with p = 1 2  The effect of the parameter p is shown in Fig    Notice that in all figures, the number of colors shown is the average of ten executions of the code using different random seeds 
The algorithm uses σ = 0 15, easy vertices, q max = 59022, but does not use the BDFS nor any clique  If q(u) is larger than a threshold q max , the Shadoks set w(u) = ∞ so that the vertex u never reenters S  If at some point an uncolored vertex v is adjacent to some vertex u of infinite weight in every color class, then the conflict optimizer is restarted 
When restarting, the initial coloring is shuffled by moving some vertices from their initial color class to a new one  Looking at Fig  , the value of q max does not seem to have much influence as long as it is not too small  Throughout the challenge the Shadoks almost exclusively used q max = 2000 • (75000/m) 2 , where m is the number of vertices 
This value roughly ensures a restart every few hours  q max =0 5k q max =5k q max =50k q max =100k q max =250k The Shadoks use the function f as a Gaussian random variable of mean 1 and variance σ  A good default value is σ = 0 15  The effect of the variance is shown in Fig    Notice that setting σ = 0 gives much worse results 
Option (e) The goal of BDFS is to further optimize very good solutions that the conflict optimizer is not able to improve otherwise  Fig  shows the influence of BDFS  While on this figure, the advantages of BDFS cannot be noticed, its use near the end of the challenge improved about 30 solutions  The bounded depth-first search (BDFS) algorithm tries to improve the dequeuing process 
The goal is to prevent a vertex in conflict with some adjacent colored vertices from entering in the conflict set  At the first level, the algorithm searches for a recoloring of some adjacent vertices which allows us to directly recolor the conflict vertex  If no solution is found, the algorithm  In both figures the algorithm uses p = 1 2, easy vertices, q max = 59022, but does not use the BDFS nor any clique 
For σ ≥ 0 25, no solution better than 248 colors is found  could recolor some vertices at larger distances from the conflict vertex  To do so, a local search is performed by trying to recolor vertices at a bounded distance from the conflict vertex in the current partial solution  The BDFS algorithm has two parameters: adjacency bound a max and depth d 
In order to recolor a vertex v, BDFS gets the set C of color classes with at most a max neighbors of v  If a class in C has no neighbor of v, v is assigned to C  Otherwise, for each class C ∈ C, BDFS tries to recolor the vertices in C which are adjacent to v by recursively calling itself with depth d − 1 
At depth d = 0 the algorithm stops trying to color the vertices  During the challenge the Shadoks used BDFS with parameters a max = 3 and d = 3  The depth was increased to 5 (resp  7) when the number of vertices in the queue was 2 (resp  1)  Degeneracy order Given a target number of colors k, we call easy vertices a set of vertices Y such that, if the remainder of the vertices of G are colored using k colors, then we are guaranteed to be able to color all vertices of G with k colors 
This is obtained using the degeneracy order Y   To obtain Y we iteratively remove from the graph a vertex v that has at most k − 1 neighbors, appending v to the end of Y   We repeat until no other vertex can be added to Y   Notice that, once we color the remainder of the graph with at least k colors, we can use a greedy coloring for Y in order from last to first without increasing the number of colors used 
Removing the easy vertices reduces the total number of vertices, making the conflict optimizer more effective  The Shadoks always toggle this option on (the challenge instances contain from 0 to 23% easy vertices) 

Results

We provide the results of the experiments performed with the code from the three teams on two classes of instances  First, we present the results on some selected CG:SHOP 2022 instances  These instances are intersection graphs of line segments  Second, we execute the code on graphs that are not intersection graphs, namely the classic DIMACS graphs , comparing the results of our conflict optimizer implementations to previous solutions 
The source code for the three teams is available at: • Lasa: https://github com/librallu/dogs-color • Gitastrophe: https://github com/jacketsj/cgshop2022-gitastrophe • Shadoks: https://github com/gfonsecabr/shadoks-CGSHOP2022

CG:SHOP 2022 Instances

We selected 14 instances (out of 225) covering the different types of instances given in the CG:SHOP 2022 challenge  The results are presented in Table   For comparison, we executed the HEAD code on some instances using the default parameters  The table shows the smallest number of colors for which HEAD found a solution 
We ran HEAD for 1 hour of repetitions for each target number of colors on a single CPU core (the HEAD solver takes the target number of colors as a parameter and we increased this parameter one by one)  At the end of the challenge, 8 colorings computed by Lasa, 11 colorings computed by Gitastrophe, and 23 colorings computed by Shadoks over 225 instances have been proved optimal (their number of colors is equal to the size of a clique) 
In order to compare the efficiency of the algorithms, we executed the different implementations on the CG:SHOP instance vispecn13806  The edge density of this graph is 19%, the largest clique that we found has 177 vertices and the best coloring found during the challenge uses 218 colors  Notice that vispecn13806 is the same instance used in other Shadoks experiments in Section 5  Notice also that HEAD algorithm provides 283 colors after one hour compared to less than 240 colors for the conflict optimizers 
We ran the three implementations on three different servers and compared the results shown in Figure   For each implementation, the x coordinate is the running time in hours, while the y coordinate is the smallest number of colors found at that time 

Results on DIMACS Graphs

We tested the implementation of each team on the DIMACS instances to gauge the performance of the conflict optimizer on other classes of graphs  We compared our results to the best known bounds and to the state of the art coloring algorithms HEAD and QACOL   The time limit for Lasa's algorithms is 1 hour 
CWLS is Lasa's conflict optimizer with the neighbourhood presented in TABUCOL , while PWLS is the optimizer with the neighbourhood presented in PARTIALCOL   Gitastrophe algorithm ran 10 minutes after which the number of colors no longer decreases  Shadoks algorithm ran for 1 hour without the BDFS option (results with BDFS are worse) 
Results are presented in Table   We only kept the difficult DIMACS instances  For the other instances, all the results match the best known bounds  The DIMACS instances had comparatively few edges (on the order of thousands or millions); the largest intersection graphs considered in the CG:SHOP challenge had over 1 5 billion edges 
We notice that the conflict optimizer works extremely poorly on random graphs, but it is fast and appears to perform well on geometric graphs (r250 5, r1000 1c, r1000 5, dsjr500 1c and dsjr500 5), matching the best-known results   Interestingly, these geometric graphs are not intersection graphs as in the CG:SHOP challenge, but are generated based on a distance threshold 
On the DIMACS graphs, Lasa implementation shows better performance than the other implementations 



ground_truth: Lasa, Gitastrophe, and Shadoks.

prompt_front: Now, answer the following question based on the text below, only give me the answer and do not output any other words.

Question: When was McPherson County established as a county?

Read the following text and answer briefly.

Context 4:  However, the first limit does not exist when $x=0$  Indeed
\begin{equation*}
\lim_{h\rightarrow0}{\frac{\sqrt[3]{0+h}-\sqrt[3]{0}}{h}} = \lim_{h\rightarrow0}{\frac{1}{\sqrt[3]{h^2}}} = + \infty
\end{equation*}

This implies that the Product and Sum Laws for limits cannot be applied and therefore this step is not justifiable in the case of $x=0$  When the derivation is performed, we automatically assume the conditions, under which the Product Law for limits can be applied, i e  that both limits that are multiplied exist  It is not hard to see that in our case these conditions are actually equivalent to $x\neq0$  This is precisely why, when we wrote out the expression for the derivative (\ref{DerivativeExpression}), it already contained the assumption that it is only true for the values of $x$ that are different from zero 

Note, that in the case of $x=0$ the application of the Product and Sum Laws for limits is not necessary, since the term $\left(\sqrt[3]{x+h}-\sqrt[3]{x}\right)\sin{\left(x^2\right)}$ vanishes 

The correct expression for the derivative of the function $f\left(x\right)$ should be the following:
\begin{equation*}
f'\left(x\right)  = 
\begin{cases} 
\frac{6x^2\cos{\left(x^2\right)}+\sin{\left(x^2\right)}}{3\sqrt[3]{x^2}}, & \mbox{if } x \neq 0 \\ 
0, & \mbox{if } x = 0 
\end{cases}
\end{equation*}

The expression for the derivative of the function provides the correct value of the derivative only for those values of the independent variable, for which the expression is defined; it does not tell anything about the existence or the value of the derivative, where the expression for the derivative is undefined  Indeed, let us consider the function
\begin{equation*}
g\left(x\right) = {\sqrt[3]{x}}\cos{\left(x^2\right)}
\end{equation*}
and its derivative $g'\left(x\right)$ 
\begin{equation*}
g'\left(x\right) = \frac{\cos{\left(x^2\right)}-6x^2\sin{\left(x^2\right)}}{3\sqrt[3]{x^2}}
\end{equation*}

Similar to the previous example, the expression for the derivative is undefined at $x=0$  Nonetheless, it can be shown that $g\left(x\right)$ is not differentiable at $x=0$ (see Figure \ref{fig:GFunction})  Therefore, we provided two visually similar functions: both have the expressions for their derivatives undefined in zero, however, one of these functions possesses a derivative, but the other one does not 

\section{Methodological Remarks}

Unfortunately, there exist many functions similar to the ones discussed above and they can arise in a variety of typical Calculus problems: finding the points where the tangent line is horizontal, finding an equation of the tangent and normal lines to the curve at the given point, the use of differentials and graph sketching  Relying only on the expression of the derivative for determining its value at the undefined points may lead to missing a solution (as in the example discussed above) or to some completely false interpretations (as in the case of curve sketching) 

As it was discussed above, the expression for the derivative does not provide any information on the existence or the value of the derivative, where the expression itself is undefined  Here we present a methodology for the analysis of this type of functions 

Let $f\left(x\right)$ be the function of interest and $f'\left(x\right)$ be the expression of its derivative undefined at some point $x_{0}$  In order to find out if $f\left(x\right)$ is differentiable at $x_{0}$, we suggest to follow a list of steps:

\begin{enumerate}
  \item Check if the function $f\left(x\right)$ itself is defined at the point $x_{0}$  If $f\left(x\right)$ is undefined at $x_{0}$, then it is not differentiable at $x_{0}$  If $f\left(x\right)$ is defined at $x_{0}$, then proceed to next step  
  \item Identify the basic functions that are used in the formula of the function $f\left(x\right)$, that are themselves defined at the point $x_{0}$, but their derivative is not (such as, for example, the root functions) 
	\item Find the derivative of the function $f\left(x\right)$ at the point $x_{0}$ using definition 
\end{enumerate}

The importance of the first step comes from the fact that most students tend to pay little attention to the functions domain analysis when asked to investigate its derivative  Formally, the second step can be skipped, however it will give the students the insight into which part of the function presents a problem and teach them to identify similar cases in the future  the difficulty of accomplishing the third step depends on the form of the function and sometimes can be tedious  Nevertheless, it allows the students to apply the previously obtained skills and encourages the review of the material 

\begin{figure}[H]
\begin{center}
	\includegraphics[width=6 0in]{cos pdf}
	\vspace{ 1in}
	\caption{Graph of the function $g\left(x\right)=\sqrt[3]{x}\cos{\left(x^2\right)}$}
	\label{fig:GFunction}
\end{center}
\end{figure}

\section{Conclusion}

We discussed the misconception, that the expression of the derivative of the function contains the information as to whether the function is differentiable or not at the points, where the expression is undefined  We considered a typical Calculus problem of looking for the horizontal tangent line of a function as an example  We showed how the search for the values that make the expression of the derivative equal zero leads to missing a solution: even though the expression of the derivative is undefined, the function still possesses the derivative at the point  We provided an example of the function that similarly has the expression for the derivative undefined, however the function is not differentiable at the point  We also presented the methodological treatment of such functions by applying the definition of the derivative, which can be used in the classroom 





ground_truth: McPherson County was established as a county in 1867.