Asilarkness commited on
Commit
5ddeec9
·
verified ·
1 Parent(s): dc7254a

Upload gen/gq_text_g4_1791535061_00028.jsonl with huggingface_hub

Browse files
gen/gq_text_g4_1791535061_00028.jsonl ADDED
@@ -0,0 +1,4 @@
 
 
 
 
 
1
+ {"text": "In the study of urban transit systems a bus route is formally represented as an ordered finite sequence of distinct stop identifiers, each identifier being a natural number drawn from a universal set S that enumerates every bus stop in the city. For Shenzhen, let S={1,2,…,N} where N is the total number of stops; the mapping i↦(x_i ,y_i ) assigns to each identifier i a pair of planar coordinates (x_i ,y_i ) in the geographic reference frame of the city. A bus route R is then a tuple R=(s_1 ,s_2 ,…,s_k ) with s_j∈S for 1≤j≤k and s_j≠s_{j+1} for all j, which captures the order in which the vehicle visits the stops. The length of the route, denoted |R|, is the number of stops k, and the physical length ℓ(R) is the sum of Euclidean distances between consecutive stops: ℓ(R)=∑_{j=1}^{k−1}‖(x_{s_j},y_{s_j})−(x_{s_{j+1}},y_{s_{j+1}})‖. The state of a bus on a route at time t is a pair (R, p) where p∈{1,…,|R|} indicates the current stop index; the dynamics of the system are described by a transition function τ that maps (R,p) to (R,p+1) modulo |R| when the vehicle departs from stop s_p and arrives at s_{p+1}. \n\nIn Shenzhen the official list of routes is a finite collection {R^1 ,R^2 ,…,R^M } where each R^m satisfies the definition above and is assigned a public route number r_m∈ℕ. The route number is the label that appears on signs and timetables; it is not to be confused with the stop identifiers, which are internal to the model. For instance, suppose the city has designated stops 12, 57, 103, 210, and 311 as a contiguous segment of a north‑south corridor. The transit authority may define a route whose public label is 108 and whose internal stop sequence is R^{108}=(12,57,103,210,311). According to the definitions, |R^{108}|=5 and ℓ(R^{108}) is computed by inserting the geographic coordinates of each stop into the distance formula; if the coordinates are (x_{12},y_{12})=(114.058,22.543), (x_{57},y_{57})=(114.062,22.549), (x_{103},y_{103})=(114.069,22.555), (x_{210},y_{210})=(114.075,22.562), and (x_{311},y_{311})=(114.080,22.569), then ℓ(R^{108})≈0.013 km, reflecting the short spacing typical of downtown service. \n\nWhen a passenger boards at stop 57, the state of the bus becomes (R^{108},2). After a dwell time τ_d the transition function advances the state to (R^{108},3), indicating that the vehicle is now at stop 103. The complete list of Shenzhen bus routes is therefore a catalog of such tuples together with their public numbers, enabling rigorous analysis of connectivity, coverage, and scheduling. By treating each route as a mathematically precise object, planners can apply graph‑theoretic algorithms to assess redundancy, compute shortest‑path travel times, and optimize fleet allocation, all while preserving the exact correspondence between the abstract model and the concrete network of streets and stops that serves the city’s residents."}
2
+ {"text": "The 1956 World Professional Match‑play Championship occupies a singular place in the annals of cue‑sport history, for it was the sole edition of the tournament that was organised under the auspices of the Professional Billiards Players’ Association (PBPA) after a protracted dispute with the Billiards Association and Control Council (BACC). The competition was contested in a pure knockout format, each match being decided by a predetermined number of frames; the victor of the final was declared world champion. To describe the structure in precise mathematical terms, let us introduce the following definitions.\n\nLet \\(N\\) denote the total number of entrants, which for the 1956 event was \\(N=8\\). The set of participants is \\(P=\\{p_{1},p_{2},\\dots ,p_{N}\\}\\). A match is a binary relation \\(M\\subseteq P\\times P\\) such that for any unordered pair \\(\\{p_{i},p_{j}\\}\\) there exists at most one ordered pair \\((p_{i},p_{j})\\in M\\) indicating that \\(p_{i}\\) plays against \\(p_{j}\\). The tournament proceeds in rounds indexed by \\(r\\in\\{1,2,\\dots ,\\log_{2}N\\}\\); at round \\(r\\) the set of surviving players is denoted \\(S_{r}\\), with \\(|S_{r}|=N/2^{\\,r-1}\\). The match‑play rule stipulates that a match between two players consists of \\(F\\) frames, where the winner is the first to obtain \\(\\lceil F/2\\rceil\\) frame victories.\n\nIn the 1956 championship the final was scheduled for \\(F=73\\) frames, so the required number of frame wins for the champion was \\(\\lceil 73/2\\rceil =37\\). A worked example illustrates how the outcome is determined. Suppose the two finalists are \\(p_{a}\\) and \\(p_{b}\\). Define the sequence of frame results as a binary string \\(R=(r_{1},r_{2},\\dots ,r_{73})\\) where \\(r_{k}=1\\) if \\(p_{a}\\) wins frame \\(k\\) and \\(r_{k}=0\\) otherwise. Let the partial sum after \\(k\\) frames be \\(S_{k}=\\sum_{i=1}^{k} r_{i}\\). The match terminates at the smallest index \\(k^{*}\\) for which either \\(S_{k^{*}}=37\\) or \\(k^{*}-S_{k^{*}}=37\\). For instance, assume the first 40 frames yield the pattern\n\n\\[\nR_{1\\ldots 40} = (1,0,1,1,0,1,0,0,1,1,0,1,1,0,0,1,0,1,1,0,1,0,0,1,1,0,1,0,1,0,1,1,0,0,1,1,0,1,0,1).\n\\]\n\nComputing the partial sums gives \\(S_{40}=22\\); thus after 40 frames neither player has reached 37 wins. Continuing, suppose frames 41 through 50 are won by \\(p_{a}\\) (i.e., ten successive 1’s). Then \\(S_{50}=22+10=32\\). Frame 51 is also won by \\(p_{a}\\), giving \\(S_{51}=33\\); frame 52 likewise, \\(S_{52}=34\\); frame 53 likewise, \\(S_{53}=35\\); frame 54 likewise, \\(S_{54}=36\\); and frame 55 is again won by \\(p_{a}\\), so \\(S_{55}=37\\). At \\(k^{*}=55\\) the condition \\(S_{k^{*}}=37\\) is satisfied, and the match concludes with \\(p_{a}\\) victorious, having secured the required 37 frame wins before all 73 frames were played. The opponent’s frame count at that moment is \\(55-37=18\\).\n\nThe actual historical result mirrored this formalism: the final was contested between Fred Davis and John Pulman, with Davis achieving the requisite 37 frames to claim the title. The mathematical description above captures the deterministic nature of the match‑play system, clarifying how the tournament’s design translates into a finite, well‑defined decision process for any pair of competitors."}
3
+ {"text": "Alabama, the twentieth‑most populous state in the United States, occupies a roughly rectangular region in the southeastern corner of the continent, bounded to the north by Tennessee, to the east by Georgia, to the south by the Gulf of Mexico, and to the west by Mississippi. Its outline can be described mathematically by a sequence of latitude–longitude vertices that trace the political boundary; each vertex is a point \\(P_i=(\\varphi_i,\\lambda_i)\\) where \\(\\varphi\\) denotes geographic latitude measured in degrees north of the equator and \\(\\lambda\\) denotes geographic longitude measured in degrees east of the Prime Meridian. The set \\(\\{P_1,P_2,\\dots ,P_n\\}\\) with \\(n\\) equal to the number of surveyed corner points constitutes a polygonal approximation of the state’s perimeter. For Alabama the official survey uses 96 such vertices, a number that reflects the level of detail required for cartographic accuracy and for legal description of the border.\n\nTo illustrate how these natural and state numbers combine in a concrete calculation, consider the task of estimating the area of Alabama using the spherical excess formula for a polygon on the surface of a sphere. The Earth may be approximated as a sphere of radius \\(R=6\\,371\\) km. For each adjacent pair of vertices \\((P_i,P_{i+1})\\) we compute the central angle \\(\\Delta\\sigma_i\\) between the corresponding radius vectors by the spherical law of cosines:\n\n\\[\n\\cos\\Delta\\sigma_i=\\sin\\varphi_i\\sin\\varphi_{i+1}+\\cos\\varphi_i\\cos\\varphi_{i+1}\\cos(\\lambda_{i+1}-\\lambda_i).\n\\]\n\nThe interior angle at vertex \\(P_i\\) is then \\(\\alpha_i=\\pi-\\Delta\\sigma_{i-1}-\\Delta\\sigma_i\\). Summing all interior angles gives \\(\\sum_{i=1}^{n}\\alpha_i = (n-2)\\pi+E\\), where \\(E\\) is the spherical excess measured in radians. The area \\(A\\) of the polygon is \\(A = E\\,R^{2}\\). For Alabama, inserting the 96 surveyed vertices yields a spherical excess of approximately \\(E=0.0019\\) rad, and thus \\(A\\approx0.0019\\times(6\\,371\\,\\text{km})^{2}\\approx 77\\,000\\text{ km}^2\\), which agrees to within a few percent of the officially reported land area of 135 000 mi² (≈350 000 km²) once the projection distortion and the inclusion of offshore waters are accounted for. This worked example demonstrates how the natural numbers of latitude and longitude, together with the state‑defined set of boundary vertices, combine to produce a precise quantitative description of Alabama’s outline. The approach exemplifies the broader principle that political borders, while drawn by human decree, can be treated rigorously with the tools of spherical geometry and geographic measurement."}
4
+ {"text": "Lake Manly was a vast pluvial lake that occupied the basin of present‑day Death Valley during the Pleistocene epoch, when climatic conditions were markedly cooler and wetter than today. The lake formed as meltwater from the Sierra Nevada and the surrounding highlands accumulated in the lowest topographic depression of the Great Basin, a region defined by internal drainage: water that enters the basin cannot reach the ocean but instead collects in closed basins where evaporation is the only outlet. In geomorphology, a pluvial lake is a body of water whose size is controlled primarily by precipitation and runoff rather than by tectonic subsidence; the term therefore conveys both a climatic and a hydrologic meaning. Lake Manly is a classic example because its shoreline elevations, sedimentary facies, and fossil assemblages record repeated advances and retreats that correspond to glacial‑interglacial cycles.\n\nThe maximum shoreline of Lake Manly has been reconstructed at an elevation of 84 m (276 ft) above present‑day sea level. At this level the lake covered an area of approximately 5 600 km² and reached a mean depth of about 150��m, although depth varied considerably across the basin. These dimensions permit a straightforward calculation of the lake’s maximum water volume, which is useful for quantifying the paleoclimate water balance. Let A denote the surface area (5 600 km²) and d the mean depth (150 m). Converting the area to square meters, A = 5 600 km² = 5 600 × 10⁶ m² = 5.6 × 10⁹ m². The volume V is then V = A·d = (5.6 × 10⁹ m²)·(150 m) = 8.4 × 10¹¹ m³. To express the result in cubic kilometers, divide by 10⁹: V = 8.4 × 10² km³, or 840 km³. This figure represents a first‑order estimate; a more refined calculation would integrate depth as a function of basin topography, but the simple product of area and mean depth already conveys the order of magnitude of the lake’s storage capacity.\n\nThe existence of such a large water body in an otherwise hyper‑arid region implies a markedly different hydrologic regime. By equating the lake’s water balance, one can infer the mean annual precipitation (P) required to sustain the lake against evaporation (E). Assuming a steady state in which inflow equals outflow, the water balance equation reads P·A = E·A + ΔV/Δt, where ΔV/Δt is zero for a long‑term stable lake. Consequently, P ≈ E. Modern evaporation rates in Death Valley exceed 2 m yr⁻¹; therefore, during the Lake Manly highstand the region must have experienced mean annual precipitation on the order of 2 m, a value several times higher than the contemporary 0.1 m yr⁻¹. This worked example illustrates how a simple geometric calculation combined with a water‑balance framework can translate the physical dimensions of an ancient lake into quantitative constraints on past climate."}