Split (1)

train · 485k rows

Subsets and Splits

No community queries yet

The top public SQL queries from the community will appear here once available.

id stringlengths 40 40	title stringlengths 15 120	text stringlengths 41 3.14k	source stringclasses 2 values
cc5420bc23b94475677b956567431676c6522d85	in december 2011, a rotational lightcurve of kalchas	in december 2011, a rotational lightcurve of kalchas was obtained by robert stephens at gmars (g79) in california. lightcurve analysis gave a well-defined rotation period of 29.2 ± 0.1 hours with a brightness variation of 0.40 magnitude (u=3). in july and august 2015, photometric observations by the kepler space observ...	wikipedia
10a708d045c6b1f49ead937322b42df1d74c5a8a	this minor planet was named from greek mythology	this minor planet was named from greek mythology after calchas, a greek prophet during the trojan war. the official naming citation was published by the minor planet center on 11 march 1990 (m.p.c. 16043).	wikipedia
f82a6d0ab8e70b7debd7682712fd62aa21b5756a	however this family is not included in david	however this family is not included in david nesvorný ' s hcm-analysis from 2014. instead, kalchas is listed as a non-family asteroid of the jovian background population on the asteroids dynamic site (astdys) which based on another analysis by milani and knežević.	wikipedia
2e5e7ead92193bfb05997c8ec920ed29efa9fc54	fernando roig and ricardo gil-hutton identified kalchas as	fernando roig and ricardo gil-hutton identified kalchas as the principal body of a small jovian asteroid family, using the hierarchical clustering method (hcm), which looks for groupings of neighboring asteroids based on the smallest distances between them in the proper orbital element space. according to the astronome...	wikipedia
979c02edf041101b384488dd3caba84a3c413157	while the discovery date aligns with the second	while the discovery date aligns with the second palomar–leiden trojan survey, kalchas did not receive a "t-2" prefixed survey designation, which was assigned for the discoveries made by the fruitful collaboration between the palomar and leiden observatories in the 1960s and 1970s. gehrels used palomar's samuel oschin t...	wikipedia
25867eee5426a8559b7a88eb653bf39df8ec235f	kalchas is a dark jovian asteroid in a	kalchas is a dark jovian asteroid in a 1:1 orbital resonance with jupiter. it is located in the leading greek camp at the gas giant's l lagrangian point, 60 ° ahead of its orbit. it orbits the sun at a distance of 4.9–5.4 au once every 11 years and 9 months (4,286 days; semi-major axis of 5.16 au). its orbit has an ecc...	wikipedia
2889a8b6c4e4b36cd33e3f2fadb4312478a6fbe4	4138 kalchas / ˈ k æ l k	4138 kalchas / ˈ k æ l k ə s / is a large jupiter trojan from the greek camp, approximately 53 kilometers (33 miles) in diameter. it was discovered on 19 september 1973, by dutch astronomers ingrid and cornelis van houten at leiden, on photographic plates taken by tom gehrels at the palomar observatory in california. t...	wikipedia
4abcc2d1c87bd54eff9b8eb2407cecb5125b4dfa	6-chloro-mdma is a derivative of the amphetamine drug	6-chloro-mdma is a derivative of the amphetamine drug mdma, which has been identified both in seized "ecstasy" tablets and in urine samples from drug users. it is thought most likely to be an impurity from synthesis and its pharmacological properties have not been established; however, it has been banned in several cou...	wikipedia
a80ff3a8ccd52ac8a23ac4f324d8b09be9f12de3	6-chloro-mdma (6-cl-mdma, 2-cl-4,5-mdma) is a derivative of the	6-chloro-mdma (6-cl-mdma, 2-cl-4,5-mdma) is a derivative of the amphetamine drug mdma, which has been identified both in seized "ecstasy" tablets and in urine samples from drug users. it is thought most likely to be an impurity from synthesis and its pharmacological properties have not been established; however, it has...	wikipedia
a621886a18093ef3fb37bd4cce9c225370600baa	abdolmajid mahdavi damghani is an iranian agroecologist and	abdolmajid mahdavi damghani is an iranian agroecologist and associate professor at shahid beheshti university. his book sustainable production of agricultural products was praised in the ceremony for the iran book of the year award.	wikipedia
381902aa72ff5eaa4fc2c05a5d9ed5d0231d113b	abdolmajid mahdavi damghani (persian: عبدالمجید مهدوی دامغانی) is	abdolmajid mahdavi damghani (persian: عبدالمجید مهدوی دامغانی) is an iranian agroecologist and associate professor at shahid beheshti university. his book sustainable production of agricultural products was praised in the ceremony for the iran book of the year award.	wikipedia
7fcade35bc79d4db6f119372fdda1983fdec74c2	3d reconstruction from multiple images is the creation	3d reconstruction from multiple images is the creation of three-dimensional models from a set of images. it is the reverse process of obtaining 2d images from 3d scenes. the essence of an image is a projection from a 3d scene onto a 2d plane, during which process the depth is lost. the 3d point corresponding to a speci...	wikipedia
aad1f70843bf11e31776ddf13660bdb537967675	surface rendering visualizes a 3d object as a	surface rendering visualizes a 3d object as a set of surfaces called iso-surfaces. each surface has points with the same intensity (called an iso-value). this technique is usually applied to high contrast data, and helps to illustrate separated structures; for instance, the skull can be created from slices of the head,...	wikipedia
28129461bd2ec9a49156eed1d7b060fd6a91e395	in nscc algorithm, the preliminary step is calculation	in nscc algorithm, the preliminary step is calculation of an initial solution. firstly anatomical regions from the generic object are defined. secondly, manual 2d contours identification on the radiographs is performed. from each radiograph 2d contours are generated using the 3d initial solution object. 3d contours of ...	wikipedia
873d30a2bdaec504325fe91bc8a817be864edc0c	this method is simple and implemented by identifying	this method is simple and implemented by identifying the points manually in multi-view radiographs. the first step is to extract the corresponding points in two x-ray images. the second step is to reconstruct the image in three dimensions using algorithms like discrete linear transform (dlt). the reconstruction is only...	wikipedia
aa05cfa3b8ad39fc4a8cb903641a20ef6a500261	to reconstruct 3-d images from 2-d images taken	to reconstruct 3-d images from 2-d images taken by a camera at multiple angles. medical imaging techniques like ct scanning and mri are expensive, and although ct scans are accurate, they can induce high radiation doses which is a risk for patients with certain diseases. methods based on mri are not accurate. since we ...	wikipedia
0d94acaa199c0c06533718f6c7f6903864360293	all the linear algorithms (dlt and others) we	all the linear algorithms (dlt and others) we have seen so far minimize an algebraic error. actually, there is no justification in minimizing an algebraic error apart from the ease of implementation, as it results in a linear problem. the minimization of a geometric error is often a non-linear problem, that admit only ...	wikipedia
b56438ea61ece72453e764e752f73e8a29f8aa57	in general, if \|\|ax\|\| can be considered as	in general, if \|\|ax\|\| can be considered as a distance between the geometrical entities (points, lines, planes, etc.), then what is being minimized is a geometric error, otherwise (when the error lacks a good geometrical interpretation) it is called an algebraic error.	wikipedia
5fabaff30066a622d36b96a2e512ba53faa8d66e	by mapping the projective reconstruction to one that	by mapping the projective reconstruction to one that satisfies a group of redundant euclidean constraints, we can find a projective transformation h in equation (2).the equations are highly nonlinear and a good initial guess for the structure is required. this can be obtained by assuming a linear projection - parallel ...	wikipedia
58f4a9f64ecf4e04dbdb79c6ef785b0ccd6336f7	we can also use prior constraints on the	we can also use prior constraints on the camera motion. by analyzing different images of the same point can obtain a line in the direction of motion. the intersection of several lines is the point at infinity in the motion direction, and one constraint on the affine structure.	wikipedia
8e3e7ed1ef30e02004284944fdeeda1e5f90c8f5	see affine space for more detailed information about	see affine space for more detailed information about computing the location of the plane at infinity Π ∞ {\displaystyle {\pi }_{\infty }}. the simplest way is to exploit prior knowledge, for example the information that lines in the scene are parallel or that a point is the one thirds between two others.	wikipedia
68800f6b129da38bee67758089467b929830113c	so we can apply a nonsingular 4 ×	so we can apply a nonsingular 4 × 4 transformation h to projections p j {\displaystyle p_{j}} → p j h − 1 {\displaystyle p_{j}h^{-1}} and world points a i {\displaystyle a_{i}} → h a i {\displaystyle ha_{i}}. hence, without further constraints, reconstruction is only an unknown projective deformation of the 3d world.	wikipedia
43200584c83b97d240badca98363a409f4160bbf	simple counting indicates we have 2 n m	simple counting indicates we have 2 n m {\displaystyle 2nm} independent measurements and only 11 m + 3 n {\displaystyle 11m+3n} unknowns, so the problem is supposed to be soluble with enough points and images. the equations in homogeneous coordinates can be represented:	wikipedia
455a67ee5ec897bc299b016693f59b36d8533c12	suppose that a fixed scene is captured by	suppose that a fixed scene is captured by two or more perspective cameras and the correspondences between visible points in different images are already given. however, in practice, the matching is an essential and extremely challenging issue in computer vision. here, we suppose that n {\displaystyle n} 3d points a i {...	wikipedia
60cc3154baba4885505afc77887cdc365afbc10b	usually, the world is perceived as a 3d	usually, the world is perceived as a 3d euclidean space. in some cases, it is not possible to use the full euclidean structure of 3d space. the simplest being projective, then the affine geometry which forms the intermediate layers and finally euclidean geometry. the concept of stratification is closely related to the ...	wikipedia
7c5c4bf21147988719230afb296b0fd981c6afd1	recently, new methods based on the concept of	recently, new methods based on the concept of stratification have been proposed. starting from a projective structure, which can be calculated from correspondences only, upgrade this projective reconstruction to a euclidean reconstruction, by making use of all the available constraints. with this idea the problem can b...	wikipedia
0d8fdcb84e7d6a81faaac2b5c268f64477634e62	this method is based on the use of	this method is based on the use of rigidity constraint. design a cost function, which considers the intrinsic parameters as arguments and the fundamental matrices as parameters. f i j {\displaystyle {f}_{ij}} is defined as the fundamental matrix, a i {\displaystyle {a}_{i}} and a j {\displaystyle {a}_{j}} as intrinsic ...	wikipedia
92baea64e44c58c25669aac2fdc398d7eee03fd4	the matrix k = a a ⊤ {\displaystyle	the matrix k = a a ⊤ {\displaystyle k=aa^{\top }} is unknown in the kruppa equations, named kruppa coefficients matrix. with k and by the method of cholesky factorization one can obtain the intrinsic parameters easily:	wikipedia
a197a374613b086116ded611732f1300948f6e6b	generally, without further restrictions, we will obtain a	generally, without further restrictions, we will obtain a projective reconstruction. if { p i } {\displaystyle \{p^{i}\}} and { w j } {\displaystyle \{w_{j}\}} satisfy (1), { p i t } {\displaystyle \{p^{i}t\}} and { t − 1 w j } {\displaystyle \{t^{-1}w_{j}\}} will satisfy (1) with any 4 × 4 nonsingular matrix t.	wikipedia
6689a011cefd3072a9f9afc3c39a978b0b665838	given a group of 3d points viewed by	given a group of 3d points viewed by n cameras with matrices { p i } i = 1 … n {\displaystyle \{p^{i}\}_{i=1\ldots n}}, define m j i ≃ p i w j {\displaystyle m_{j}^{i}\simeq p^{i}w_{j}} to be the homogeneous coordinates of the projection of the j t h {\displaystyle j^{th}} point onto the i t h {\displaystyle i^{th}} ca...	wikipedia
abd626ef8707e2c61b0896e5dea8d27ef77a68f4	by the stage of material application you have	by the stage of material application you have a complete 3d mesh, which may be the final goal, but usually you will want to apply the color from the original photographs to the mesh. this can range from projecting the images onto the mesh randomly, through approaches of combining the textures for super resolution and f...	wikipedia
118bafa230905d1592def91dc69b9e31430a71dc	once you have the multiple depth maps you	once you have the multiple depth maps you have to combine them to create a final mesh by calculating depth and projecting out of the camera – registration. camera calibration will be used to identify where the many meshes created by depth maps can be combined to develop a larger one, providing more than one view for ob...	wikipedia
415b4fbb2a6a80283440b03cc682cefacc4d9a5c	depth determination serves as the most challenging part	depth determination serves as the most challenging part in the whole process, as it calculates the 3d component missing from any given image – depth. the correspondence problem, finding matches between two images so the position of the matched elements can then be triangulated in 3d space is the key issue here.	wikipedia
1cced0a41aa01c1eb8da1497350d79b529d1295a	in recent decades, there is an important demand	in recent decades, there is an important demand for 3d content for computer graphics, virtual reality and communication, triggering a change in emphasis for the requirements. many existing systems for constructing 3d models are built around specialized hardware (e.g. stereo rigs) resulting in a high cost, which cannot ...	wikipedia
f56b82fe54638c82bfee79b08753df7ce99290a4	the essence of an image is a projection	the essence of an image is a projection from a 3d scene onto a 2d plane, during which process the depth is lost. the 3d point corresponding to a specific image point is constrained to be on the line of sight. from a single image, it is impossible to determine which point on this line corresponds to the image point. if ...	wikipedia
ae7b0bb358c1721f69469487e84d5335ab627c66	in chemistry, abegg's rule states that the difference	in chemistry, abegg's rule states that the difference between the maximum positive and negative valence of an element is frequently eight. the rule used a historic meaning of valence which resembles the modern concept of oxidation state in which an atom is an electron donor or receiver. abegg's rule is sometimes referr...	wikipedia
b2a28499b2a9ecd7ebbca053c95778e463246cde	the concept was formulated in 1904 by german	the concept was formulated in 1904 by german chemist richard abegg. gilbert n. lewis was one of the first to refer to the concept as "abegg's rule" when he used it as a basis of argument in a 1916 article to develop his cubical atom theory, which developed into the octet rule. that article helped inspire linus pauling ...	wikipedia
6ee2033ec3a8c656463df53573513e977f04876e	in general, for a given chemical element (as	in general, for a given chemical element (as sulfur) abegg's rule states that the sum of the absolute value of its negative valence (such as −2 for sulfur in h s and its positive valence of maximum value (as +6 for sulfur in h so) is often equal to 8.	wikipedia
380f92c448088c9002d4b7708cfb7c481f62950f	in chemistry, abegg's rule states that the difference	in chemistry, abegg's rule states that the difference between the maximum positive and negative valence of an element is frequently eight. the rule used a historic meaning of valence which resembles the modern concept of oxidation state in which an atom is an electron donor or receiver. abegg's rule is sometimes referr...	wikipedia
f1b3e349b80732a1ace98b4b3317b2d7bc5469fa	the 2015–16 season was udinese calcio's 36th season	the 2015–16 season was udinese calcio's 36th season in serie a and their 21st consecutive season in the top-flight. having missed out on european football for the second consecutive season, udinese competed only in serie a and in the coppa italia. udinese finished 17th in the league following a poor season, and were el...	wikipedia