FreddyHernandez
commited on
Upload 9 files
Browse files- LICENSE +674 -0
- auxiliar.R +86 -0
- daticos.txt +11 -0
- funciones.R +217 -0
- include.html +0 -0
- include.md +28 -0
- server.R +172 -0
- ui.R +117 -0
- unequal_var_data99.txt +251 -0
LICENSE
ADDED
@@ -0,0 +1,674 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
GNU GENERAL PUBLIC LICENSE
|
2 |
+
Version 3, 29 June 2007
|
3 |
+
|
4 |
+
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
|
5 |
+
Everyone is permitted to copy and distribute verbatim copies
|
6 |
+
of this license document, but changing it is not allowed.
|
7 |
+
|
8 |
+
Preamble
|
9 |
+
|
10 |
+
The GNU General Public License is a free, copyleft license for
|
11 |
+
software and other kinds of works.
|
12 |
+
|
13 |
+
The licenses for most software and other practical works are designed
|
14 |
+
to take away your freedom to share and change the works. By contrast,
|
15 |
+
the GNU General Public License is intended to guarantee your freedom to
|
16 |
+
share and change all versions of a program--to make sure it remains free
|
17 |
+
software for all its users. We, the Free Software Foundation, use the
|
18 |
+
GNU General Public License for most of our software; it applies also to
|
19 |
+
any other work released this way by its authors. You can apply it to
|
20 |
+
your programs, too.
|
21 |
+
|
22 |
+
When we speak of free software, we are referring to freedom, not
|
23 |
+
price. Our General Public Licenses are designed to make sure that you
|
24 |
+
have the freedom to distribute copies of free software (and charge for
|
25 |
+
them if you wish), that you receive source code or can get it if you
|
26 |
+
want it, that you can change the software or use pieces of it in new
|
27 |
+
free programs, and that you know you can do these things.
|
28 |
+
|
29 |
+
To protect your rights, we need to prevent others from denying you
|
30 |
+
these rights or asking you to surrender the rights. Therefore, you have
|
31 |
+
certain responsibilities if you distribute copies of the software, or if
|
32 |
+
you modify it: responsibilities to respect the freedom of others.
|
33 |
+
|
34 |
+
For example, if you distribute copies of such a program, whether
|
35 |
+
gratis or for a fee, you must pass on to the recipients the same
|
36 |
+
freedoms that you received. You must make sure that they, too, receive
|
37 |
+
or can get the source code. And you must show them these terms so they
|
38 |
+
know their rights.
|
39 |
+
|
40 |
+
Developers that use the GNU GPL protect your rights with two steps:
|
41 |
+
(1) assert copyright on the software, and (2) offer you this License
|
42 |
+
giving you legal permission to copy, distribute and/or modify it.
|
43 |
+
|
44 |
+
For the developers' and authors' protection, the GPL clearly explains
|
45 |
+
that there is no warranty for this free software. For both users' and
|
46 |
+
authors' sake, the GPL requires that modified versions be marked as
|
47 |
+
changed, so that their problems will not be attributed erroneously to
|
48 |
+
authors of previous versions.
|
49 |
+
|
50 |
+
Some devices are designed to deny users access to install or run
|
51 |
+
modified versions of the software inside them, although the manufacturer
|
52 |
+
can do so. This is fundamentally incompatible with the aim of
|
53 |
+
protecting users' freedom to change the software. The systematic
|
54 |
+
pattern of such abuse occurs in the area of products for individuals to
|
55 |
+
use, which is precisely where it is most unacceptable. Therefore, we
|
56 |
+
have designed this version of the GPL to prohibit the practice for those
|
57 |
+
products. If such problems arise substantially in other domains, we
|
58 |
+
stand ready to extend this provision to those domains in future versions
|
59 |
+
of the GPL, as needed to protect the freedom of users.
|
60 |
+
|
61 |
+
Finally, every program is threatened constantly by software patents.
|
62 |
+
States should not allow patents to restrict development and use of
|
63 |
+
software on general-purpose computers, but in those that do, we wish to
|
64 |
+
avoid the special danger that patents applied to a free program could
|
65 |
+
make it effectively proprietary. To prevent this, the GPL assures that
|
66 |
+
patents cannot be used to render the program non-free.
|
67 |
+
|
68 |
+
The precise terms and conditions for copying, distribution and
|
69 |
+
modification follow.
|
70 |
+
|
71 |
+
TERMS AND CONDITIONS
|
72 |
+
|
73 |
+
0. Definitions.
|
74 |
+
|
75 |
+
"This License" refers to version 3 of the GNU General Public License.
|
76 |
+
|
77 |
+
"Copyright" also means copyright-like laws that apply to other kinds of
|
78 |
+
works, such as semiconductor masks.
|
79 |
+
|
80 |
+
"The Program" refers to any copyrightable work licensed under this
|
81 |
+
License. Each licensee is addressed as "you". "Licensees" and
|
82 |
+
"recipients" may be individuals or organizations.
|
83 |
+
|
84 |
+
To "modify" a work means to copy from or adapt all or part of the work
|
85 |
+
in a fashion requiring copyright permission, other than the making of an
|
86 |
+
exact copy. The resulting work is called a "modified version" of the
|
87 |
+
earlier work or a work "based on" the earlier work.
|
88 |
+
|
89 |
+
A "covered work" means either the unmodified Program or a work based
|
90 |
+
on the Program.
|
91 |
+
|
92 |
+
To "propagate" a work means to do anything with it that, without
|
93 |
+
permission, would make you directly or secondarily liable for
|
94 |
+
infringement under applicable copyright law, except executing it on a
|
95 |
+
computer or modifying a private copy. Propagation includes copying,
|
96 |
+
distribution (with or without modification), making available to the
|
97 |
+
public, and in some countries other activities as well.
|
98 |
+
|
99 |
+
To "convey" a work means any kind of propagation that enables other
|
100 |
+
parties to make or receive copies. Mere interaction with a user through
|
101 |
+
a computer network, with no transfer of a copy, is not conveying.
|
102 |
+
|
103 |
+
An interactive user interface displays "Appropriate Legal Notices"
|
104 |
+
to the extent that it includes a convenient and prominently visible
|
105 |
+
feature that (1) displays an appropriate copyright notice, and (2)
|
106 |
+
tells the user that there is no warranty for the work (except to the
|
107 |
+
extent that warranties are provided), that licensees may convey the
|
108 |
+
work under this License, and how to view a copy of this License. If
|
109 |
+
the interface presents a list of user commands or options, such as a
|
110 |
+
menu, a prominent item in the list meets this criterion.
|
111 |
+
|
112 |
+
1. Source Code.
|
113 |
+
|
114 |
+
The "source code" for a work means the preferred form of the work
|
115 |
+
for making modifications to it. "Object code" means any non-source
|
116 |
+
form of a work.
|
117 |
+
|
118 |
+
A "Standard Interface" means an interface that either is an official
|
119 |
+
standard defined by a recognized standards body, or, in the case of
|
120 |
+
interfaces specified for a particular programming language, one that
|
121 |
+
is widely used among developers working in that language.
|
122 |
+
|
123 |
+
The "System Libraries" of an executable work include anything, other
|
124 |
+
than the work as a whole, that (a) is included in the normal form of
|
125 |
+
packaging a Major Component, but which is not part of that Major
|
126 |
+
Component, and (b) serves only to enable use of the work with that
|
127 |
+
Major Component, or to implement a Standard Interface for which an
|
128 |
+
implementation is available to the public in source code form. A
|
129 |
+
"Major Component", in this context, means a major essential component
|
130 |
+
(kernel, window system, and so on) of the specific operating system
|
131 |
+
(if any) on which the executable work runs, or a compiler used to
|
132 |
+
produce the work, or an object code interpreter used to run it.
|
133 |
+
|
134 |
+
The "Corresponding Source" for a work in object code form means all
|
135 |
+
the source code needed to generate, install, and (for an executable
|
136 |
+
work) run the object code and to modify the work, including scripts to
|
137 |
+
control those activities. However, it does not include the work's
|
138 |
+
System Libraries, or general-purpose tools or generally available free
|
139 |
+
programs which are used unmodified in performing those activities but
|
140 |
+
which are not part of the work. For example, Corresponding Source
|
141 |
+
includes interface definition files associated with source files for
|
142 |
+
the work, and the source code for shared libraries and dynamically
|
143 |
+
linked subprograms that the work is specifically designed to require,
|
144 |
+
such as by intimate data communication or control flow between those
|
145 |
+
subprograms and other parts of the work.
|
146 |
+
|
147 |
+
The Corresponding Source need not include anything that users
|
148 |
+
can regenerate automatically from other parts of the Corresponding
|
149 |
+
Source.
|
150 |
+
|
151 |
+
The Corresponding Source for a work in source code form is that
|
152 |
+
same work.
|
153 |
+
|
154 |
+
2. Basic Permissions.
|
155 |
+
|
156 |
+
All rights granted under this License are granted for the term of
|
157 |
+
copyright on the Program, and are irrevocable provided the stated
|
158 |
+
conditions are met. This License explicitly affirms your unlimited
|
159 |
+
permission to run the unmodified Program. The output from running a
|
160 |
+
covered work is covered by this License only if the output, given its
|
161 |
+
content, constitutes a covered work. This License acknowledges your
|
162 |
+
rights of fair use or other equivalent, as provided by copyright law.
|
163 |
+
|
164 |
+
You may make, run and propagate covered works that you do not
|
165 |
+
convey, without conditions so long as your license otherwise remains
|
166 |
+
in force. You may convey covered works to others for the sole purpose
|
167 |
+
of having them make modifications exclusively for you, or provide you
|
168 |
+
with facilities for running those works, provided that you comply with
|
169 |
+
the terms of this License in conveying all material for which you do
|
170 |
+
not control copyright. Those thus making or running the covered works
|
171 |
+
for you must do so exclusively on your behalf, under your direction
|
172 |
+
and control, on terms that prohibit them from making any copies of
|
173 |
+
your copyrighted material outside their relationship with you.
|
174 |
+
|
175 |
+
Conveying under any other circumstances is permitted solely under
|
176 |
+
the conditions stated below. Sublicensing is not allowed; section 10
|
177 |
+
makes it unnecessary.
|
178 |
+
|
179 |
+
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
180 |
+
|
181 |
+
No covered work shall be deemed part of an effective technological
|
182 |
+
measure under any applicable law fulfilling obligations under article
|
183 |
+
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
184 |
+
similar laws prohibiting or restricting circumvention of such
|
185 |
+
measures.
|
186 |
+
|
187 |
+
When you convey a covered work, you waive any legal power to forbid
|
188 |
+
circumvention of technological measures to the extent such circumvention
|
189 |
+
is effected by exercising rights under this License with respect to
|
190 |
+
the covered work, and you disclaim any intention to limit operation or
|
191 |
+
modification of the work as a means of enforcing, against the work's
|
192 |
+
users, your or third parties' legal rights to forbid circumvention of
|
193 |
+
technological measures.
|
194 |
+
|
195 |
+
4. Conveying Verbatim Copies.
|
196 |
+
|
197 |
+
You may convey verbatim copies of the Program's source code as you
|
198 |
+
receive it, in any medium, provided that you conspicuously and
|
199 |
+
appropriately publish on each copy an appropriate copyright notice;
|
200 |
+
keep intact all notices stating that this License and any
|
201 |
+
non-permissive terms added in accord with section 7 apply to the code;
|
202 |
+
keep intact all notices of the absence of any warranty; and give all
|
203 |
+
recipients a copy of this License along with the Program.
|
204 |
+
|
205 |
+
You may charge any price or no price for each copy that you convey,
|
206 |
+
and you may offer support or warranty protection for a fee.
|
207 |
+
|
208 |
+
5. Conveying Modified Source Versions.
|
209 |
+
|
210 |
+
You may convey a work based on the Program, or the modifications to
|
211 |
+
produce it from the Program, in the form of source code under the
|
212 |
+
terms of section 4, provided that you also meet all of these conditions:
|
213 |
+
|
214 |
+
a) The work must carry prominent notices stating that you modified
|
215 |
+
it, and giving a relevant date.
|
216 |
+
|
217 |
+
b) The work must carry prominent notices stating that it is
|
218 |
+
released under this License and any conditions added under section
|
219 |
+
7. This requirement modifies the requirement in section 4 to
|
220 |
+
"keep intact all notices".
|
221 |
+
|
222 |
+
c) You must license the entire work, as a whole, under this
|
223 |
+
License to anyone who comes into possession of a copy. This
|
224 |
+
License will therefore apply, along with any applicable section 7
|
225 |
+
additional terms, to the whole of the work, and all its parts,
|
226 |
+
regardless of how they are packaged. This License gives no
|
227 |
+
permission to license the work in any other way, but it does not
|
228 |
+
invalidate such permission if you have separately received it.
|
229 |
+
|
230 |
+
d) If the work has interactive user interfaces, each must display
|
231 |
+
Appropriate Legal Notices; however, if the Program has interactive
|
232 |
+
interfaces that do not display Appropriate Legal Notices, your
|
233 |
+
work need not make them do so.
|
234 |
+
|
235 |
+
A compilation of a covered work with other separate and independent
|
236 |
+
works, which are not by their nature extensions of the covered work,
|
237 |
+
and which are not combined with it such as to form a larger program,
|
238 |
+
in or on a volume of a storage or distribution medium, is called an
|
239 |
+
"aggregate" if the compilation and its resulting copyright are not
|
240 |
+
used to limit the access or legal rights of the compilation's users
|
241 |
+
beyond what the individual works permit. Inclusion of a covered work
|
242 |
+
in an aggregate does not cause this License to apply to the other
|
243 |
+
parts of the aggregate.
|
244 |
+
|
245 |
+
6. Conveying Non-Source Forms.
|
246 |
+
|
247 |
+
You may convey a covered work in object code form under the terms
|
248 |
+
of sections 4 and 5, provided that you also convey the
|
249 |
+
machine-readable Corresponding Source under the terms of this License,
|
250 |
+
in one of these ways:
|
251 |
+
|
252 |
+
a) Convey the object code in, or embodied in, a physical product
|
253 |
+
(including a physical distribution medium), accompanied by the
|
254 |
+
Corresponding Source fixed on a durable physical medium
|
255 |
+
customarily used for software interchange.
|
256 |
+
|
257 |
+
b) Convey the object code in, or embodied in, a physical product
|
258 |
+
(including a physical distribution medium), accompanied by a
|
259 |
+
written offer, valid for at least three years and valid for as
|
260 |
+
long as you offer spare parts or customer support for that product
|
261 |
+
model, to give anyone who possesses the object code either (1) a
|
262 |
+
copy of the Corresponding Source for all the software in the
|
263 |
+
product that is covered by this License, on a durable physical
|
264 |
+
medium customarily used for software interchange, for a price no
|
265 |
+
more than your reasonable cost of physically performing this
|
266 |
+
conveying of source, or (2) access to copy the
|
267 |
+
Corresponding Source from a network server at no charge.
|
268 |
+
|
269 |
+
c) Convey individual copies of the object code with a copy of the
|
270 |
+
written offer to provide the Corresponding Source. This
|
271 |
+
alternative is allowed only occasionally and noncommercially, and
|
272 |
+
only if you received the object code with such an offer, in accord
|
273 |
+
with subsection 6b.
|
274 |
+
|
275 |
+
d) Convey the object code by offering access from a designated
|
276 |
+
place (gratis or for a charge), and offer equivalent access to the
|
277 |
+
Corresponding Source in the same way through the same place at no
|
278 |
+
further charge. You need not require recipients to copy the
|
279 |
+
Corresponding Source along with the object code. If the place to
|
280 |
+
copy the object code is a network server, the Corresponding Source
|
281 |
+
may be on a different server (operated by you or a third party)
|
282 |
+
that supports equivalent copying facilities, provided you maintain
|
283 |
+
clear directions next to the object code saying where to find the
|
284 |
+
Corresponding Source. Regardless of what server hosts the
|
285 |
+
Corresponding Source, you remain obligated to ensure that it is
|
286 |
+
available for as long as needed to satisfy these requirements.
|
287 |
+
|
288 |
+
e) Convey the object code using peer-to-peer transmission, provided
|
289 |
+
you inform other peers where the object code and Corresponding
|
290 |
+
Source of the work are being offered to the general public at no
|
291 |
+
charge under subsection 6d.
|
292 |
+
|
293 |
+
A separable portion of the object code, whose source code is excluded
|
294 |
+
from the Corresponding Source as a System Library, need not be
|
295 |
+
included in conveying the object code work.
|
296 |
+
|
297 |
+
A "User Product" is either (1) a "consumer product", which means any
|
298 |
+
tangible personal property which is normally used for personal, family,
|
299 |
+
or household purposes, or (2) anything designed or sold for incorporation
|
300 |
+
into a dwelling. In determining whether a product is a consumer product,
|
301 |
+
doubtful cases shall be resolved in favor of coverage. For a particular
|
302 |
+
product received by a particular user, "normally used" refers to a
|
303 |
+
typical or common use of that class of product, regardless of the status
|
304 |
+
of the particular user or of the way in which the particular user
|
305 |
+
actually uses, or expects or is expected to use, the product. A product
|
306 |
+
is a consumer product regardless of whether the product has substantial
|
307 |
+
commercial, industrial or non-consumer uses, unless such uses represent
|
308 |
+
the only significant mode of use of the product.
|
309 |
+
|
310 |
+
"Installation Information" for a User Product means any methods,
|
311 |
+
procedures, authorization keys, or other information required to install
|
312 |
+
and execute modified versions of a covered work in that User Product from
|
313 |
+
a modified version of its Corresponding Source. The information must
|
314 |
+
suffice to ensure that the continued functioning of the modified object
|
315 |
+
code is in no case prevented or interfered with solely because
|
316 |
+
modification has been made.
|
317 |
+
|
318 |
+
If you convey an object code work under this section in, or with, or
|
319 |
+
specifically for use in, a User Product, and the conveying occurs as
|
320 |
+
part of a transaction in which the right of possession and use of the
|
321 |
+
User Product is transferred to the recipient in perpetuity or for a
|
322 |
+
fixed term (regardless of how the transaction is characterized), the
|
323 |
+
Corresponding Source conveyed under this section must be accompanied
|
324 |
+
by the Installation Information. But this requirement does not apply
|
325 |
+
if neither you nor any third party retains the ability to install
|
326 |
+
modified object code on the User Product (for example, the work has
|
327 |
+
been installed in ROM).
|
328 |
+
|
329 |
+
The requirement to provide Installation Information does not include a
|
330 |
+
requirement to continue to provide support service, warranty, or updates
|
331 |
+
for a work that has been modified or installed by the recipient, or for
|
332 |
+
the User Product in which it has been modified or installed. Access to a
|
333 |
+
network may be denied when the modification itself materially and
|
334 |
+
adversely affects the operation of the network or violates the rules and
|
335 |
+
protocols for communication across the network.
|
336 |
+
|
337 |
+
Corresponding Source conveyed, and Installation Information provided,
|
338 |
+
in accord with this section must be in a format that is publicly
|
339 |
+
documented (and with an implementation available to the public in
|
340 |
+
source code form), and must require no special password or key for
|
341 |
+
unpacking, reading or copying.
|
342 |
+
|
343 |
+
7. Additional Terms.
|
344 |
+
|
345 |
+
"Additional permissions" are terms that supplement the terms of this
|
346 |
+
License by making exceptions from one or more of its conditions.
|
347 |
+
Additional permissions that are applicable to the entire Program shall
|
348 |
+
be treated as though they were included in this License, to the extent
|
349 |
+
that they are valid under applicable law. If additional permissions
|
350 |
+
apply only to part of the Program, that part may be used separately
|
351 |
+
under those permissions, but the entire Program remains governed by
|
352 |
+
this License without regard to the additional permissions.
|
353 |
+
|
354 |
+
When you convey a copy of a covered work, you may at your option
|
355 |
+
remove any additional permissions from that copy, or from any part of
|
356 |
+
it. (Additional permissions may be written to require their own
|
357 |
+
removal in certain cases when you modify the work.) You may place
|
358 |
+
additional permissions on material, added by you to a covered work,
|
359 |
+
for which you have or can give appropriate copyright permission.
|
360 |
+
|
361 |
+
Notwithstanding any other provision of this License, for material you
|
362 |
+
add to a covered work, you may (if authorized by the copyright holders of
|
363 |
+
that material) supplement the terms of this License with terms:
|
364 |
+
|
365 |
+
a) Disclaiming warranty or limiting liability differently from the
|
366 |
+
terms of sections 15 and 16 of this License; or
|
367 |
+
|
368 |
+
b) Requiring preservation of specified reasonable legal notices or
|
369 |
+
author attributions in that material or in the Appropriate Legal
|
370 |
+
Notices displayed by works containing it; or
|
371 |
+
|
372 |
+
c) Prohibiting misrepresentation of the origin of that material, or
|
373 |
+
requiring that modified versions of such material be marked in
|
374 |
+
reasonable ways as different from the original version; or
|
375 |
+
|
376 |
+
d) Limiting the use for publicity purposes of names of licensors or
|
377 |
+
authors of the material; or
|
378 |
+
|
379 |
+
e) Declining to grant rights under trademark law for use of some
|
380 |
+
trade names, trademarks, or service marks; or
|
381 |
+
|
382 |
+
f) Requiring indemnification of licensors and authors of that
|
383 |
+
material by anyone who conveys the material (or modified versions of
|
384 |
+
it) with contractual assumptions of liability to the recipient, for
|
385 |
+
any liability that these contractual assumptions directly impose on
|
386 |
+
those licensors and authors.
|
387 |
+
|
388 |
+
All other non-permissive additional terms are considered "further
|
389 |
+
restrictions" within the meaning of section 10. If the Program as you
|
390 |
+
received it, or any part of it, contains a notice stating that it is
|
391 |
+
governed by this License along with a term that is a further
|
392 |
+
restriction, you may remove that term. If a license document contains
|
393 |
+
a further restriction but permits relicensing or conveying under this
|
394 |
+
License, you may add to a covered work material governed by the terms
|
395 |
+
of that license document, provided that the further restriction does
|
396 |
+
not survive such relicensing or conveying.
|
397 |
+
|
398 |
+
If you add terms to a covered work in accord with this section, you
|
399 |
+
must place, in the relevant source files, a statement of the
|
400 |
+
additional terms that apply to those files, or a notice indicating
|
401 |
+
where to find the applicable terms.
|
402 |
+
|
403 |
+
Additional terms, permissive or non-permissive, may be stated in the
|
404 |
+
form of a separately written license, or stated as exceptions;
|
405 |
+
the above requirements apply either way.
|
406 |
+
|
407 |
+
8. Termination.
|
408 |
+
|
409 |
+
You may not propagate or modify a covered work except as expressly
|
410 |
+
provided under this License. Any attempt otherwise to propagate or
|
411 |
+
modify it is void, and will automatically terminate your rights under
|
412 |
+
this License (including any patent licenses granted under the third
|
413 |
+
paragraph of section 11).
|
414 |
+
|
415 |
+
However, if you cease all violation of this License, then your
|
416 |
+
license from a particular copyright holder is reinstated (a)
|
417 |
+
provisionally, unless and until the copyright holder explicitly and
|
418 |
+
finally terminates your license, and (b) permanently, if the copyright
|
419 |
+
holder fails to notify you of the violation by some reasonable means
|
420 |
+
prior to 60 days after the cessation.
|
421 |
+
|
422 |
+
Moreover, your license from a particular copyright holder is
|
423 |
+
reinstated permanently if the copyright holder notifies you of the
|
424 |
+
violation by some reasonable means, this is the first time you have
|
425 |
+
received notice of violation of this License (for any work) from that
|
426 |
+
copyright holder, and you cure the violation prior to 30 days after
|
427 |
+
your receipt of the notice.
|
428 |
+
|
429 |
+
Termination of your rights under this section does not terminate the
|
430 |
+
licenses of parties who have received copies or rights from you under
|
431 |
+
this License. If your rights have been terminated and not permanently
|
432 |
+
reinstated, you do not qualify to receive new licenses for the same
|
433 |
+
material under section 10.
|
434 |
+
|
435 |
+
9. Acceptance Not Required for Having Copies.
|
436 |
+
|
437 |
+
You are not required to accept this License in order to receive or
|
438 |
+
run a copy of the Program. Ancillary propagation of a covered work
|
439 |
+
occurring solely as a consequence of using peer-to-peer transmission
|
440 |
+
to receive a copy likewise does not require acceptance. However,
|
441 |
+
nothing other than this License grants you permission to propagate or
|
442 |
+
modify any covered work. These actions infringe copyright if you do
|
443 |
+
not accept this License. Therefore, by modifying or propagating a
|
444 |
+
covered work, you indicate your acceptance of this License to do so.
|
445 |
+
|
446 |
+
10. Automatic Licensing of Downstream Recipients.
|
447 |
+
|
448 |
+
Each time you convey a covered work, the recipient automatically
|
449 |
+
receives a license from the original licensors, to run, modify and
|
450 |
+
propagate that work, subject to this License. You are not responsible
|
451 |
+
for enforcing compliance by third parties with this License.
|
452 |
+
|
453 |
+
An "entity transaction" is a transaction transferring control of an
|
454 |
+
organization, or substantially all assets of one, or subdividing an
|
455 |
+
organization, or merging organizations. If propagation of a covered
|
456 |
+
work results from an entity transaction, each party to that
|
457 |
+
transaction who receives a copy of the work also receives whatever
|
458 |
+
licenses to the work the party's predecessor in interest had or could
|
459 |
+
give under the previous paragraph, plus a right to possession of the
|
460 |
+
Corresponding Source of the work from the predecessor in interest, if
|
461 |
+
the predecessor has it or can get it with reasonable efforts.
|
462 |
+
|
463 |
+
You may not impose any further restrictions on the exercise of the
|
464 |
+
rights granted or affirmed under this License. For example, you may
|
465 |
+
not impose a license fee, royalty, or other charge for exercise of
|
466 |
+
rights granted under this License, and you may not initiate litigation
|
467 |
+
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
468 |
+
any patent claim is infringed by making, using, selling, offering for
|
469 |
+
sale, or importing the Program or any portion of it.
|
470 |
+
|
471 |
+
11. Patents.
|
472 |
+
|
473 |
+
A "contributor" is a copyright holder who authorizes use under this
|
474 |
+
License of the Program or a work on which the Program is based. The
|
475 |
+
work thus licensed is called the contributor's "contributor version".
|
476 |
+
|
477 |
+
A contributor's "essential patent claims" are all patent claims
|
478 |
+
owned or controlled by the contributor, whether already acquired or
|
479 |
+
hereafter acquired, that would be infringed by some manner, permitted
|
480 |
+
by this License, of making, using, or selling its contributor version,
|
481 |
+
but do not include claims that would be infringed only as a
|
482 |
+
consequence of further modification of the contributor version. For
|
483 |
+
purposes of this definition, "control" includes the right to grant
|
484 |
+
patent sublicenses in a manner consistent with the requirements of
|
485 |
+
this License.
|
486 |
+
|
487 |
+
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
488 |
+
patent license under the contributor's essential patent claims, to
|
489 |
+
make, use, sell, offer for sale, import and otherwise run, modify and
|
490 |
+
propagate the contents of its contributor version.
|
491 |
+
|
492 |
+
In the following three paragraphs, a "patent license" is any express
|
493 |
+
agreement or commitment, however denominated, not to enforce a patent
|
494 |
+
(such as an express permission to practice a patent or covenant not to
|
495 |
+
sue for patent infringement). To "grant" such a patent license to a
|
496 |
+
party means to make such an agreement or commitment not to enforce a
|
497 |
+
patent against the party.
|
498 |
+
|
499 |
+
If you convey a covered work, knowingly relying on a patent license,
|
500 |
+
and the Corresponding Source of the work is not available for anyone
|
501 |
+
to copy, free of charge and under the terms of this License, through a
|
502 |
+
publicly available network server or other readily accessible means,
|
503 |
+
then you must either (1) cause the Corresponding Source to be so
|
504 |
+
available, or (2) arrange to deprive yourself of the benefit of the
|
505 |
+
patent license for this particular work, or (3) arrange, in a manner
|
506 |
+
consistent with the requirements of this License, to extend the patent
|
507 |
+
license to downstream recipients. "Knowingly relying" means you have
|
508 |
+
actual knowledge that, but for the patent license, your conveying the
|
509 |
+
covered work in a country, or your recipient's use of the covered work
|
510 |
+
in a country, would infringe one or more identifiable patents in that
|
511 |
+
country that you have reason to believe are valid.
|
512 |
+
|
513 |
+
If, pursuant to or in connection with a single transaction or
|
514 |
+
arrangement, you convey, or propagate by procuring conveyance of, a
|
515 |
+
covered work, and grant a patent license to some of the parties
|
516 |
+
receiving the covered work authorizing them to use, propagate, modify
|
517 |
+
or convey a specific copy of the covered work, then the patent license
|
518 |
+
you grant is automatically extended to all recipients of the covered
|
519 |
+
work and works based on it.
|
520 |
+
|
521 |
+
A patent license is "discriminatory" if it does not include within
|
522 |
+
the scope of its coverage, prohibits the exercise of, or is
|
523 |
+
conditioned on the non-exercise of one or more of the rights that are
|
524 |
+
specifically granted under this License. You may not convey a covered
|
525 |
+
work if you are a party to an arrangement with a third party that is
|
526 |
+
in the business of distributing software, under which you make payment
|
527 |
+
to the third party based on the extent of your activity of conveying
|
528 |
+
the work, and under which the third party grants, to any of the
|
529 |
+
parties who would receive the covered work from you, a discriminatory
|
530 |
+
patent license (a) in connection with copies of the covered work
|
531 |
+
conveyed by you (or copies made from those copies), or (b) primarily
|
532 |
+
for and in connection with specific products or compilations that
|
533 |
+
contain the covered work, unless you entered into that arrangement,
|
534 |
+
or that patent license was granted, prior to 28 March 2007.
|
535 |
+
|
536 |
+
Nothing in this License shall be construed as excluding or limiting
|
537 |
+
any implied license or other defenses to infringement that may
|
538 |
+
otherwise be available to you under applicable patent law.
|
539 |
+
|
540 |
+
12. No Surrender of Others' Freedom.
|
541 |
+
|
542 |
+
If conditions are imposed on you (whether by court order, agreement or
|
543 |
+
otherwise) that contradict the conditions of this License, they do not
|
544 |
+
excuse you from the conditions of this License. If you cannot convey a
|
545 |
+
covered work so as to satisfy simultaneously your obligations under this
|
546 |
+
License and any other pertinent obligations, then as a consequence you may
|
547 |
+
not convey it at all. For example, if you agree to terms that obligate you
|
548 |
+
to collect a royalty for further conveying from those to whom you convey
|
549 |
+
the Program, the only way you could satisfy both those terms and this
|
550 |
+
License would be to refrain entirely from conveying the Program.
|
551 |
+
|
552 |
+
13. Use with the GNU Affero General Public License.
|
553 |
+
|
554 |
+
Notwithstanding any other provision of this License, you have
|
555 |
+
permission to link or combine any covered work with a work licensed
|
556 |
+
under version 3 of the GNU Affero General Public License into a single
|
557 |
+
combined work, and to convey the resulting work. The terms of this
|
558 |
+
License will continue to apply to the part which is the covered work,
|
559 |
+
but the special requirements of the GNU Affero General Public License,
|
560 |
+
section 13, concerning interaction through a network will apply to the
|
561 |
+
combination as such.
|
562 |
+
|
563 |
+
14. Revised Versions of this License.
|
564 |
+
|
565 |
+
The Free Software Foundation may publish revised and/or new versions of
|
566 |
+
the GNU General Public License from time to time. Such new versions will
|
567 |
+
be similar in spirit to the present version, but may differ in detail to
|
568 |
+
address new problems or concerns.
|
569 |
+
|
570 |
+
Each version is given a distinguishing version number. If the
|
571 |
+
Program specifies that a certain numbered version of the GNU General
|
572 |
+
Public License "or any later version" applies to it, you have the
|
573 |
+
option of following the terms and conditions either of that numbered
|
574 |
+
version or of any later version published by the Free Software
|
575 |
+
Foundation. If the Program does not specify a version number of the
|
576 |
+
GNU General Public License, you may choose any version ever published
|
577 |
+
by the Free Software Foundation.
|
578 |
+
|
579 |
+
If the Program specifies that a proxy can decide which future
|
580 |
+
versions of the GNU General Public License can be used, that proxy's
|
581 |
+
public statement of acceptance of a version permanently authorizes you
|
582 |
+
to choose that version for the Program.
|
583 |
+
|
584 |
+
Later license versions may give you additional or different
|
585 |
+
permissions. However, no additional obligations are imposed on any
|
586 |
+
author or copyright holder as a result of your choosing to follow a
|
587 |
+
later version.
|
588 |
+
|
589 |
+
15. Disclaimer of Warranty.
|
590 |
+
|
591 |
+
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
592 |
+
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
593 |
+
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
594 |
+
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
595 |
+
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
596 |
+
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
597 |
+
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
598 |
+
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
599 |
+
|
600 |
+
16. Limitation of Liability.
|
601 |
+
|
602 |
+
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
603 |
+
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
604 |
+
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
605 |
+
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
606 |
+
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
607 |
+
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
608 |
+
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
609 |
+
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
610 |
+
SUCH DAMAGES.
|
611 |
+
|
612 |
+
17. Interpretation of Sections 15 and 16.
|
613 |
+
|
614 |
+
If the disclaimer of warranty and limitation of liability provided
|
615 |
+
above cannot be given local legal effect according to their terms,
|
616 |
+
reviewing courts shall apply local law that most closely approximates
|
617 |
+
an absolute waiver of all civil liability in connection with the
|
618 |
+
Program, unless a warranty or assumption of liability accompanies a
|
619 |
+
copy of the Program in return for a fee.
|
620 |
+
|
621 |
+
END OF TERMS AND CONDITIONS
|
622 |
+
|
623 |
+
How to Apply These Terms to Your New Programs
|
624 |
+
|
625 |
+
If you develop a new program, and you want it to be of the greatest
|
626 |
+
possible use to the public, the best way to achieve this is to make it
|
627 |
+
free software which everyone can redistribute and change under these terms.
|
628 |
+
|
629 |
+
To do so, attach the following notices to the program. It is safest
|
630 |
+
to attach them to the start of each source file to most effectively
|
631 |
+
state the exclusion of warranty; and each file should have at least
|
632 |
+
the "copyright" line and a pointer to where the full notice is found.
|
633 |
+
|
634 |
+
{one line to give the program's name and a brief idea of what it does.}
|
635 |
+
Copyright (C) {year} {name of author}
|
636 |
+
|
637 |
+
This program is free software: you can redistribute it and/or modify
|
638 |
+
it under the terms of the GNU General Public License as published by
|
639 |
+
the Free Software Foundation, either version 3 of the License, or
|
640 |
+
(at your option) any later version.
|
641 |
+
|
642 |
+
This program is distributed in the hope that it will be useful,
|
643 |
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
644 |
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
645 |
+
GNU General Public License for more details.
|
646 |
+
|
647 |
+
You should have received a copy of the GNU General Public License
|
648 |
+
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
649 |
+
|
650 |
+
Also add information on how to contact you by electronic and paper mail.
|
651 |
+
|
652 |
+
If the program does terminal interaction, make it output a short
|
653 |
+
notice like this when it starts in an interactive mode:
|
654 |
+
|
655 |
+
{project} Copyright (C) {year} {fullname}
|
656 |
+
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
657 |
+
This is free software, and you are welcome to redistribute it
|
658 |
+
under certain conditions; type `show c' for details.
|
659 |
+
|
660 |
+
The hypothetical commands `show w' and `show c' should show the appropriate
|
661 |
+
parts of the General Public License. Of course, your program's commands
|
662 |
+
might be different; for a GUI interface, you would use an "about box".
|
663 |
+
|
664 |
+
You should also get your employer (if you work as a programmer) or school,
|
665 |
+
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
666 |
+
For more information on this, and how to apply and follow the GNU GPL, see
|
667 |
+
<http://www.gnu.org/licenses/>.
|
668 |
+
|
669 |
+
The GNU General Public License does not permit incorporating your program
|
670 |
+
into proprietary programs. If your program is a subroutine library, you
|
671 |
+
may consider it more useful to permit linking proprietary applications with
|
672 |
+
the library. If this is what you want to do, use the GNU Lesser General
|
673 |
+
Public License instead of this License. But first, please read
|
674 |
+
<http://www.gnu.org/philosophy/why-not-lgpl.html>.
|
auxiliar.R
ADDED
@@ -0,0 +1,86 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
# En este archivo estan los datos que usa la app por defecto
|
2 |
+
|
3 |
+
datos <- structure(list(Weight = c(50.5503, 61.25258, 56.24894, 65.65679,
|
4 |
+
62.83388, 73.24405, 58.51261, 60.9063, 56.73146, 67.22003, 60.3634,
|
5 |
+
75.02256, 62.80754, 60.5175, 78.42197, 73.45075, 64.05179, 65.38776,
|
6 |
+
76.63673, 55.08314, 80.88494, 88.58204, 71.54954, 48.32583, 40.44927,
|
7 |
+
74.15086, 84.90795, 58.40049, 60.76984, 70.56893, 75.76796, 71.19564,
|
8 |
+
51.64917, 62.73287, 56.2491, 73.9991, 79.95774, 55.57182, 76.37397,
|
9 |
+
66.56973, 65.86066, 71.20084, 54.67018, 70.4005, 69.4797, 66.60614,
|
10 |
+
75.68068, 56.37009, 72.16496, 67.85384, 71.6978, 70.04701, 70.3357,
|
11 |
+
54.63944, 53.3318, 42.86249, 40.68829, 55.59472, 53.09797, 75.49655,
|
12 |
+
43.54653, 51.60253, 45.47439, 71.48804, 71.06496, 65.36183, 57.63302,
|
13 |
+
71.52314, 60.2691, 76.1195, 43.15393, 74.32763, 73.74856, 64.92062,
|
14 |
+
76.22805, 64.14468, 46.66684, 57.44771, 49.5207, 49.02281, 75.89785,
|
15 |
+
66.45265, 64.021, 74.89705, 106.29634, 62.43153, 85.64085, 75.20969,
|
16 |
+
78.75479, 71.47283, 72.24819, 72.96063, 81.44395, 59.13345, 56.81112,
|
17 |
+
63.75622, 49.76463, 75.51193, 66.75562, 44.02623, 76.37441, 63.37802,
|
18 |
+
69.7395, 70.36453, 68.46488, 76.44103, 69.25948, 61.82844, 76.20195,
|
19 |
+
71.00959, 64.29619, 77.64101, 73.84479, 61.46269, 67.22959, 78.4518,
|
20 |
+
71.52198, 71.12362, 70.71162, 66.09589, 69.55674, 67.42492, 61.32901,
|
21 |
+
84.71004, 59.35111, 71.81532, 78.88253, 80.55406, 72.09338, 60.84449,
|
22 |
+
69.26214, 70.95307, 73.94863, 70.8474, 70.04736, 77.00465, 64.2028,
|
23 |
+
70.5274, 72.2358, 70.30635, 73.85537, 63.46842, 71.55005, 76.91536,
|
24 |
+
67.95931, 67.46876, 72.85655, 68.19556, 75.64152, 61.33369, 66.13137,
|
25 |
+
75.53459, 74.72881, 77.7697, 72.62453, 61.77881, 72.81865, 83.61184,
|
26 |
+
65.61744, 71.70281, 70.3708, 64.10026, 65.19349, 69.15764, 70.83526,
|
27 |
+
70.02046, 71.0855, 71.94166, 73.76781, 66.20942, 72.23653, 75.84131,
|
28 |
+
67.7486, 69.04712, 62.66672, 68.00322, 71.35661, 67.92959, 63.38161,
|
29 |
+
68.01821, 75.97187, 61.44667, 70.94835, 74.35324, 64.30971, 75.68054,
|
30 |
+
66.42512, 76.27227, 61.55411, 66.45667, 78.82515, 66.11034, 68.67467,
|
31 |
+
75.94628, 74.39378, 72.7763, 67.22345, 72.16216, 77.03907, 63.57204,
|
32 |
+
74.58805, 78.82659, 74.29897, 69.4074, 77.2088, 72.57719, 72.86812,
|
33 |
+
72.11492, 79.84081, 74.09459, 74.45922, 79.49065, 72.83807, 69.96743,
|
34 |
+
63.05169, 68.71237, 72.00973, 71.96866, 73.13164, 68.70975, 74.04752,
|
35 |
+
62.79878, 75.78519, 71.50944, 78.1028, 71.48194, 68.81004, 75.34631,
|
36 |
+
70.80994, 61.97276, 64.22399, 72.6092, 71.30278, 73.54538, 72.33739,
|
37 |
+
63.02031, 72.74572, 70.31417, 65.31908, 66.99437, 63.19804, 66.66398,
|
38 |
+
78.33904, 74.0347, 66.44705, 83.54124, 79.72041, 69.41476, 63.05741,
|
39 |
+
70.75567), Group = c("Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1",
|
40 |
+
"Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1",
|
41 |
+
"Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1",
|
42 |
+
"Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1",
|
43 |
+
"Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1",
|
44 |
+
"Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1",
|
45 |
+
"Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1",
|
46 |
+
"Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1",
|
47 |
+
"Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1",
|
48 |
+
"Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1",
|
49 |
+
"Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1",
|
50 |
+
"Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1",
|
51 |
+
"Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1",
|
52 |
+
"Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1",
|
53 |
+
"Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1",
|
54 |
+
"Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1",
|
55 |
+
"Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1", "Grupo 1",
|
56 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
57 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
58 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
59 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
60 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
61 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
62 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
63 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
64 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
65 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
66 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
67 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
68 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
69 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
70 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
71 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
72 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
73 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
74 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
75 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
76 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
77 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
78 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
79 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2",
|
80 |
+
"Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2", "Grupo 2"
|
81 |
+
)), row.names = c(NA, -250L), spec = structure(list(cols = list(
|
82 |
+
Weight = structure(list(), class = c("collector_double",
|
83 |
+
"collector")), Group = structure(list(), class = c("collector_character",
|
84 |
+
"collector"))), default = structure(list(), class = c("collector_guess",
|
85 |
+
"collector")), delim = "\t"), class = "col_spec"), class = c("spec_tbl_df",
|
86 |
+
"tbl_df", "tbl", "data.frame"))
|
daticos.txt
ADDED
@@ -0,0 +1,11 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
peso barrio
|
2 |
+
63.75622 1
|
3 |
+
49.76463 1
|
4 |
+
75.51193 1
|
5 |
+
66.75562 1
|
6 |
+
44.02623 1
|
7 |
+
76.37441 2
|
8 |
+
63.37802 2
|
9 |
+
69.73950 2
|
10 |
+
70.36453 2
|
11 |
+
68.46488 2
|
funciones.R
ADDED
@@ -0,0 +1,217 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
|
2 |
+
|
3 |
+
|
4 |
+
#Funcion que crea un data frame con todos los elementos de
|
5 |
+
#la prueba de hip锟絫esis de la igualdad de dos varianzas poblacionales
|
6 |
+
ph_igual_varianzas <- function(var_cuant, var_cual, nivel_de_significancia,tipo_de_prueba){
|
7 |
+
grados_de_libertad_num <- tapply(var_cuant, var_cual, length)[1]-1
|
8 |
+
grados_de_libertad_den <- tapply(var_cuant, var_cual, length)[2]-1
|
9 |
+
nivel_de_significancia <- 1 - nivel_de_significancia
|
10 |
+
|
11 |
+
if(tipo_de_prueba == "two.sided"){
|
12 |
+
|
13 |
+
#Lado izquierdo y lado de recho donde inician las zonas de rechazo de la hipotesis nula
|
14 |
+
lado_der <- qf(1-(nivel_de_significancia/2), grados_de_libertad_num, grados_de_libertad_den)
|
15 |
+
lado_izq <- qf(nivel_de_significancia/2, grados_de_libertad_num, grados_de_libertad_den)
|
16 |
+
|
17 |
+
#Varianza muestral grupo 1
|
18 |
+
var1 <- tapply(var_cuant, var_cual, var)[1]
|
19 |
+
|
20 |
+
#Varianza muestral grupo 2
|
21 |
+
var2 <- tapply(var_cuant, var_cual, var)[2]
|
22 |
+
|
23 |
+
#Estadistico de prueba
|
24 |
+
ep <- var1/var2
|
25 |
+
|
26 |
+
#Valor P
|
27 |
+
ValorP <- if(pf(ep,grados_de_libertad_num,grados_de_libertad_den) <= pf(ep,grados_de_libertad_num,grados_de_libertad_den,lower.tail = FALSE)){
|
28 |
+
pf(ep,grados_de_libertad_num,grados_de_libertad_den)*2 #Valor P
|
29 |
+
}else{
|
30 |
+
pf(ep,grados_de_libertad_num,grados_de_libertad_den,lower.tail = FALSE)*2 #Valor P
|
31 |
+
}
|
32 |
+
|
33 |
+
#Data frame que se imprime en el aplicativo
|
34 |
+
bd <- data.frame(Resultados=c("Varianza muestral del numerador",
|
35 |
+
"Varianza muestral del denominador",
|
36 |
+
"Estadistico de prueba (EP)",
|
37 |
+
"Nivel de significancia",
|
38 |
+
"Grados de libertad del numerador",
|
39 |
+
"Grados de libertad del denominador",
|
40 |
+
"Valor P",
|
41 |
+
"Regiones criticas de rechazo de hipotesis nula",
|
42 |
+
"Conclusion con el valor P",
|
43 |
+
"Conclusion con la region de rechazo")
|
44 |
+
,
|
45 |
+
Valores=c(as.character(var1),
|
46 |
+
as.character(var2),
|
47 |
+
as.character(round(ep,8)),
|
48 |
+
as.character(nivel_de_significancia),
|
49 |
+
as.character(grados_de_libertad_num),
|
50 |
+
as.character(grados_de_libertad_den),
|
51 |
+
as.character(ValorP),
|
52 |
+
paste("EP <= ",as.character(round(lado_izq,4)),
|
53 |
+
"o",
|
54 |
+
"EP >= ", as.character(round(lado_der,4)),
|
55 |
+
sep = " "),
|
56 |
+
if(ValorP <= nivel_de_significancia){
|
57 |
+
paste("El estadistico de prueba es igual a", round(ep,8),
|
58 |
+
"con un valor p igual a", ValorP,
|
59 |
+
"Como el valor p es inferior o igual a", nivel_de_significancia,
|
60 |
+
"(nivel de significancia), entonces se rechaza la hipotesis nula en favor de la hipotesis
|
61 |
+
alternativa.")
|
62 |
+
}else{
|
63 |
+
paste("El estadistico de prueba es igual a", round(ep,8),
|
64 |
+
"con un valor p igual a", ValorP,
|
65 |
+
"Como el valor es mayor a",nivel_de_significancia,
|
66 |
+
"(nivel de significancia), entonces se concluye que los datos no son suficientes para
|
67 |
+
rechazar la hipotesis nula.")
|
68 |
+
},
|
69 |
+
if(ep <= lado_izq |
|
70 |
+
ep >= lado_der){
|
71 |
+
paste("El estadistico de prueba es igual a", round(ep,8),
|
72 |
+
". Como el estadistico de prueba se encuentra
|
73 |
+
dentro de la region critica de rechazo entonces se rechaza
|
74 |
+
la hipotesis nula en favor de la hipotesis alternativa.")
|
75 |
+
}else{
|
76 |
+
paste("El estadistico de prueba es igual a", round(ep,8),
|
77 |
+
". Como el estadistico de prueba se encuentra fuera
|
78 |
+
de la region critica de rechazo entonces se concluye que
|
79 |
+
los datos no son suficientes para rechazar la hipotesis nula.")
|
80 |
+
}
|
81 |
+
))
|
82 |
+
bd
|
83 |
+
|
84 |
+
}else{
|
85 |
+
if(tipo_de_prueba == "less"){
|
86 |
+
|
87 |
+
#Lado izquierdo donde inicia la zona de rechazo de la hipotesis nula
|
88 |
+
lado_izq <- qf(nivel_de_significancia, grados_de_libertad_num, grados_de_libertad_den)
|
89 |
+
|
90 |
+
#Varianza muestral grupo 1
|
91 |
+
var1 <- tapply(var_cuant, var_cual, var)[1]
|
92 |
+
|
93 |
+
#Varianza muestral grupo 2
|
94 |
+
var2 <- tapply(var_cuant, var_cual, var)[2]
|
95 |
+
|
96 |
+
#Estadistico de prueba
|
97 |
+
ep <- var1/var2
|
98 |
+
|
99 |
+
#Valor P
|
100 |
+
ValorP <- pf(ep, grados_de_libertad_num, grados_de_libertad_den)
|
101 |
+
|
102 |
+
#Data frame que se imprime en el aplicativo
|
103 |
+
bd <- data.frame(Resultados=c("Varianza muestral del numerador",
|
104 |
+
"Varianza muestral del denominador",
|
105 |
+
"Estadistico de prueba (EP)",
|
106 |
+
"Nivel de significancia",
|
107 |
+
"Grados libertad numerador",
|
108 |
+
"Grados libertad denominador",
|
109 |
+
"Valor P",
|
110 |
+
"Region critica de rechazo de hipotesis nula",
|
111 |
+
"Conclusion con el valor P",
|
112 |
+
"Conclusion con la region de rechazo")
|
113 |
+
,
|
114 |
+
Valores=c(as.character(var1),
|
115 |
+
as.character(var2),
|
116 |
+
as.character(round(ep,8)),
|
117 |
+
as.character(nivel_de_significancia),
|
118 |
+
as.character(grados_de_libertad_num),
|
119 |
+
as.character(grados_de_libertad_den),
|
120 |
+
as.character(ValorP),
|
121 |
+
paste("EP <= ",as.character(round(lado_izq,4))),
|
122 |
+
if(ValorP <= nivel_de_significancia){
|
123 |
+
paste("El estadistico de prueba es igual a", round(ep,8),
|
124 |
+
"con un valor p igual a", ValorP,
|
125 |
+
"Como el valor p es inferior o igual a", nivel_de_significancia,
|
126 |
+
"(nivel de significancia), entonces se rechaza la hipotesis nula en favor de la hipotesis
|
127 |
+
alternativa.")
|
128 |
+
}else{
|
129 |
+
paste("El estadistico de prueba es igual a", round(ep,8),
|
130 |
+
"con un valor p igual a", ValorP,
|
131 |
+
"Como el valor es mayor a", nivel_de_significancia,
|
132 |
+
"(nivel de significancia), entonces se concluye que los datos no son suficientes para
|
133 |
+
rechazar la hipotesis nula.")
|
134 |
+
},
|
135 |
+
if(ep <= lado_izq){
|
136 |
+
paste("El estadistico de prueba es igual a", round(ep,8),
|
137 |
+
". Como el estadistico de prueba se encuentra
|
138 |
+
dentro de la region critica de rechazo entonces se rechaza
|
139 |
+
la hipotesis nula en favor de la hipotesis alternativa.")
|
140 |
+
}else{
|
141 |
+
paste("El estadistico de prueba es igual a", round(ep,8),
|
142 |
+
". Como el estadistico de prueba se encuentra fuera
|
143 |
+
de la region critica de rechazo entonces se concluye que
|
144 |
+
los datos no son suficientes para rechazar la hipotesis nula.")
|
145 |
+
}
|
146 |
+
))
|
147 |
+
bd
|
148 |
+
|
149 |
+
}else{
|
150 |
+
if(tipo_de_prueba == "greater"){
|
151 |
+
|
152 |
+
#Lado derecho donde inician las zonas de rechazo de la hipotesis nula
|
153 |
+
lado_der <- qf(1-nivel_de_significancia, grados_de_libertad_num, grados_de_libertad_den)
|
154 |
+
|
155 |
+
#Varianza muestral del numerador
|
156 |
+
var1 <- tapply(var_cuant, var_cual, var)[1]
|
157 |
+
|
158 |
+
#Varianza muestral del denominador
|
159 |
+
var2 <- tapply(var_cuant, var_cual, var)[2]
|
160 |
+
|
161 |
+
#Estadistico de prueba
|
162 |
+
ep <- var1/var2
|
163 |
+
|
164 |
+
#Valor P
|
165 |
+
ValorP <- pf(ep,grados_de_libertad_num,grados_de_libertad_den,lower.tail = FALSE)
|
166 |
+
|
167 |
+
#Data frame que se imprime en el aplicativo
|
168 |
+
bd <- data.frame(Resultados=c("Varianza muestral del numerador",
|
169 |
+
"Varianza muestral del denominador",
|
170 |
+
"Estadistico de prueba (EP)",
|
171 |
+
"Nivel de significancia",
|
172 |
+
"Grados de libertad del numerador",
|
173 |
+
"Grados de libertad del denominador",
|
174 |
+
"Valor P",
|
175 |
+
"Region critica de rechazo de hipotesis nula",
|
176 |
+
"Conclusion con el valor P",
|
177 |
+
"Conclusion con la region de rechazo")
|
178 |
+
,
|
179 |
+
Valores=c(as.character(var1),
|
180 |
+
as.character(var2),
|
181 |
+
as.character(round(ep,8)),
|
182 |
+
as.character(nivel_de_significancia),
|
183 |
+
as.character(grados_de_libertad_num),
|
184 |
+
as.character(grados_de_libertad_den),
|
185 |
+
as.character(ValorP),
|
186 |
+
paste("EP >= ", as.character(round(lado_der,4)),
|
187 |
+
sep = " "),
|
188 |
+
if(ValorP <= nivel_de_significancia){
|
189 |
+
paste("El estadistico de prueba es igual a", round(ep,8),
|
190 |
+
"con un valor p igual a", ValorP,
|
191 |
+
"Como el valor p es inferior o igual a", nivel_de_significancia,
|
192 |
+
"(nivel de significancia), entonces se rechaza la hipotesis nula en favor de la hipotesis
|
193 |
+
alternativa.")
|
194 |
+
}else{
|
195 |
+
paste("El estadistico de prueba es igual a", round(ep,8),
|
196 |
+
"con un valor p igual a", ValorP,
|
197 |
+
"Como el valor es mayor a",nivel_de_significancia,
|
198 |
+
"(nivel de significancia), entonces se concluye que los datos no son suficientes para
|
199 |
+
rechazar la hipotesis nula.")
|
200 |
+
},
|
201 |
+
if(ep >= lado_der){
|
202 |
+
paste("El estadistico de prueba es igual a", round(ep,8),
|
203 |
+
". Como el estadistico de prueba se encuentra
|
204 |
+
dentro de la region critica de rechazo entonces se rechaza
|
205 |
+
la hipotesis nula en favor de la hipotesis alternativa.")
|
206 |
+
}else{
|
207 |
+
paste("El estadistico de prueba es igual a", round(ep,8),
|
208 |
+
". Como el estadistico de prueba se encuentra fuera
|
209 |
+
de la region critica de rechazo entonces se concluye que
|
210 |
+
los datos no son suficientes para rechazar la hipotesis nula.")
|
211 |
+
}
|
212 |
+
))
|
213 |
+
bd
|
214 |
+
}
|
215 |
+
}
|
216 |
+
}
|
217 |
+
}
|
include.html
ADDED
The diff for this file is too large to render.
See raw diff
|
|
include.md
ADDED
@@ -0,0 +1,28 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
# Prueba de hip贸tesis para el cociente de varianzas
|
2 |
+
|
3 |
+
Suponga que se tienen dos muestras aleatorias que provienen de poblaciones normales as铆:
|
4 |
+
|
5 |
+
- $n_1$ observaciones $X_{11}, X_{12}, \ldots, X_{1,n1}$ de una poblaci贸n I con varianza $\sigma^2_1$,
|
6 |
+
- $n_2$ observaciones $X_{21}, X_{22}, \ldots, X_{2,n2}$ de una poblaci贸n II con varianza $\sigma^2_2$,
|
7 |
+
- ambas muestras son independientes entre s铆.
|
8 |
+
|
9 |
+
En este problema se desea estudiar la hip贸tesis nula $H_0: \sigma_1^2 / \sigma_2^2 = 1$ de igualdad de varianzas y se sospecha que el cociente de varianzas podr铆a estar en alguna de las siguientes situaciones:
|
10 |
+
|
11 |
+
- $H_a: \sigma_1^2 / \sigma_2^2 < 1$
|
12 |
+
- $H_a: \sigma_1^2 / \sigma_2^2 \neq 1$
|
13 |
+
- $H_a: \sigma_1^2 / \sigma_2^2 > 1$
|
14 |
+
|
15 |
+
El estad铆stico para realizar la prueba es:
|
16 |
+
$$
|
17 |
+
F_0=\frac{S_1^2}{S_1^2},
|
18 |
+
$$
|
19 |
+
donde $S_1^2$ y $S_2^2$ son las varianzas de las muestras I y II respectivamente. El estad铆stico $F_0$, bajo la suposici贸n de que $H_0$ es verdadera, tiene distribuci贸n $f$ con $n_1-1$ grados de libertad en el numerador y $n_2-1$ grados de libertad en el denominador.
|
20 |
+
|
21 |
+
Si el valor calculado para el estad铆stico dado en la ecuaci贸n anterior se denota por $f_0$, entonces el valor-$P$ de la prueba se calcula de acuerdo a la hip贸tesis alterna $H_a$ as铆:
|
22 |
+
|
23 |
+
- Si $H_a: \sigma_1^2 / \sigma_2^2 < \sigma^2_0$ entonces valor-$P$=$P(f_{n_1-1,n_2-1} < f_0)$.
|
24 |
+
- Si $H_a: \sigma_1^2 / \sigma_2^2 \neq \sigma^2_0$, valor-$P$=$2 \times \min \left\{ P(f_{n_1-1,n_2-1} < f_0), P(f_{n_1-1,n_2-1} > f_0) \right\}$.
|
25 |
+
- Si $H_a: \sigma_1^2 / \sigma_2^2 > \sigma^2_0$ entonces valor-$P$=$P(f_{n_1-1,n_2-1} > f_0)$.
|
26 |
+
|
27 |
+
|
28 |
+
En esta prueba, al no rechazar la hip贸tesis nula $H_0$, se concluye que $\sigma_1^2 / \sigma_2^2 = 1$ lo que implica en t茅rminos pr谩cticos que $\sigma_1^2 = \sigma_2^2$, es decir que las varianzas poblacionales se pueden considerar iguales.
|
server.R
ADDED
@@ -0,0 +1,172 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
library(shiny)
|
2 |
+
|
3 |
+
source("auxiliar.R")
|
4 |
+
|
5 |
+
shinyServer(function(input,output,session){
|
6 |
+
|
7 |
+
observe({
|
8 |
+
inFile <- input$file1
|
9 |
+
if(is.null(inFile))
|
10 |
+
dt <- datos
|
11 |
+
else dt <- read.csv(inFile$datapath, header=input$header, sep=input$sep)
|
12 |
+
|
13 |
+
updateSelectInput(session, "variable1",
|
14 |
+
choices = names(dt),
|
15 |
+
selected = "Weight")
|
16 |
+
|
17 |
+
updateSelectInput(session, "variable2",
|
18 |
+
choices = names(dt),
|
19 |
+
selected = "Group")
|
20 |
+
|
21 |
+
})
|
22 |
+
|
23 |
+
output$summary <- renderTable({
|
24 |
+
inFile <- input$file1
|
25 |
+
if(is.null(inFile))
|
26 |
+
dt <- datos
|
27 |
+
else dt <- read.csv(inFile$datapath, header=input$header, sep=input$sep)
|
28 |
+
dt <- na.omit(dt) # Para eliminar obs con NA
|
29 |
+
dt
|
30 |
+
})
|
31 |
+
|
32 |
+
output$appPlot <- renderPlot({
|
33 |
+
inFile <- input$file1
|
34 |
+
if(is.null(inFile))
|
35 |
+
dt <- datos
|
36 |
+
else dt <- read.csv(inFile$datapath, header=input$header, sep=input$sep)
|
37 |
+
# Para eliminar obs con NA
|
38 |
+
dt <- na.omit(dt)
|
39 |
+
# Para obtener x y grupo
|
40 |
+
x <- dt[, input$variable1]
|
41 |
+
group <- dt[, input$variable2]
|
42 |
+
group <- as.factor(group)
|
43 |
+
|
44 |
+
if (nlevels(group) != 2) {
|
45 |
+
plot(1, type = "n", xlab = "", ylab = "", axes = FALSE)
|
46 |
+
mensaje <- "La variable cualitativa \n que eligi贸 debe tener s贸lo \n 2 niveles."
|
47 |
+
text(x=1, y=1, mensaje, cex=2, col = "blue", pos=3)
|
48 |
+
}
|
49 |
+
else {
|
50 |
+
par(mfrow=c(1, 2), bg="gray98")
|
51 |
+
|
52 |
+
# Para dibujar las densidades
|
53 |
+
xx <- split(x, group)
|
54 |
+
den <- lapply(xx, density)
|
55 |
+
plot(den[[1]], lwd=4, col="deepskyblue3",
|
56 |
+
main="Densidad", las=1,
|
57 |
+
xlab=as.character(input$variable1),
|
58 |
+
ylab="Densidad",
|
59 |
+
xlim=range(range(den[[1]]$x), range(den[[2]]$x)),
|
60 |
+
ylim=c(0, max(c(den[[1]]$y, den[[2]]$y))))
|
61 |
+
lines(den[[2]], lwd=4, col="firebrick3")
|
62 |
+
|
63 |
+
# Leyenda para distinguir las densidades
|
64 |
+
legend("topright", bty="n",
|
65 |
+
lwd=4,
|
66 |
+
col=c("deepskyblue3", "firebrick3"),
|
67 |
+
legend=unique(group))
|
68 |
+
|
69 |
+
# Para dibujar los qqplot
|
70 |
+
qq1 <- qqnorm(xx[[1]], plot.it=FALSE)
|
71 |
+
qq2 <- qqnorm(xx[[2]], plot.it=FALSE)
|
72 |
+
|
73 |
+
plot(qq1, las=1, main="QQplot",
|
74 |
+
pch=19, col="deepskyblue3",
|
75 |
+
xlim=range(c(qq1$x, qq2$x)),
|
76 |
+
ylim=range(c(qq1$y, qq2$y)),
|
77 |
+
xlab="Cuantiles te贸ricos N(0, 1)",
|
78 |
+
ylab=as.character(input$variable1))
|
79 |
+
points(qq2, pch=19, col="firebrick3")
|
80 |
+
|
81 |
+
# Para construir los qqplot
|
82 |
+
qqline(xx[[1]], col="deepskyblue3")
|
83 |
+
qqline(xx[[2]], col="firebrick3")
|
84 |
+
|
85 |
+
# Para incluir el valor P de Shapiro
|
86 |
+
shapi <- lapply(xx, shapiro.test)
|
87 |
+
leyenda <- c(paste("Valor P=", round(shapi[[1]]$p.value, 2)),
|
88 |
+
paste("Valor P=", round(shapi[[2]]$p.value, 2)))
|
89 |
+
legend("topleft", bty="n",
|
90 |
+
text.col=c("deepskyblue3", "firebrick3"),
|
91 |
+
legend=leyenda)
|
92 |
+
}
|
93 |
+
|
94 |
+
})
|
95 |
+
|
96 |
+
output$statistic <- renderTable({
|
97 |
+
inFile <- input$file1
|
98 |
+
if(is.null(inFile))
|
99 |
+
dt <- datos
|
100 |
+
else dt <- read.csv(inFile$datapath, header=input$header, sep=input$sep)
|
101 |
+
# Para eliminar obs con NA
|
102 |
+
dt <- na.omit(dt)
|
103 |
+
# Para obtener x y grupo
|
104 |
+
x <- dt[, input$variable1]
|
105 |
+
group <- dt[, input$variable2]
|
106 |
+
group <- as.factor(group)
|
107 |
+
|
108 |
+
xx <- split(x, group) # Lista con variable interes
|
109 |
+
resumen <- function(x) c(mean(x), var(x), length(x))
|
110 |
+
res <- sapply(xx, resumen)
|
111 |
+
rownames(res) <- c("Media", "Varianza", "N煤mero de observaciones")
|
112 |
+
t(res)
|
113 |
+
}, rownames = TRUE, align="c", bordered = TRUE)
|
114 |
+
|
115 |
+
output$resul1 <- renderText({
|
116 |
+
inFile <- input$file1
|
117 |
+
if(is.null(inFile))
|
118 |
+
dt <- datos
|
119 |
+
else dt <- read.csv(inFile$datapath, header=input$header, sep=input$sep)
|
120 |
+
# Para eliminar obs con NA
|
121 |
+
dt <- na.omit(dt)
|
122 |
+
# Para obtener x y grupo
|
123 |
+
x <- dt[, input$variable1]
|
124 |
+
group <- dt[, input$variable2]
|
125 |
+
group <- as.factor(group)
|
126 |
+
|
127 |
+
if (nlevels(group) != 2) {
|
128 |
+
paste0("La variable cualitativa \n que eligi贸 debe tener s贸lo \n 2 niveles.")
|
129 |
+
}
|
130 |
+
else {
|
131 |
+
xx <- split(x, group)
|
132 |
+
ph <- var.test(x=xx[[1]], y=xx[[2]],
|
133 |
+
alternative=input$h0,
|
134 |
+
ratio=1,
|
135 |
+
conf.level=input$alfa)
|
136 |
+
paste0('El estad铆stico de prueba es f0=', round(ph$statistic, 4),
|
137 |
+
' con un valor-P de ', round(ph$p.value, 2), '.')
|
138 |
+
}
|
139 |
+
})
|
140 |
+
|
141 |
+
output$resul2 <- renderText({
|
142 |
+
inFile <- input$file1
|
143 |
+
if(is.null(inFile))
|
144 |
+
dt <- datos
|
145 |
+
else dt <- read.csv(inFile$datapath, header=input$header, sep=input$sep)
|
146 |
+
|
147 |
+
dt <- na.omit(dt) # Para eliminar obs con NA
|
148 |
+
|
149 |
+
x <- dt[, input$variable1]
|
150 |
+
group <- dt[, input$variable2]
|
151 |
+
group <- as.factor(group)
|
152 |
+
|
153 |
+
if (nlevels(group) != 2) {
|
154 |
+
paste0("La variable cualitativa \n que eligi贸 debe tener s贸lo \n 2 niveles.")
|
155 |
+
}
|
156 |
+
else {
|
157 |
+
xx <- split(x, group)
|
158 |
+
ph <- var.test(x=xx[[1]], y=xx[[2]],
|
159 |
+
alternative=input$h0,
|
160 |
+
ratio=1,
|
161 |
+
conf.level=input$alfa)
|
162 |
+
intervalo <- paste("(", round(ph$conf.int[1], digits=4),
|
163 |
+
", ",
|
164 |
+
round(ph$conf.int[2], digits=4),
|
165 |
+
").", sep='')
|
166 |
+
paste0('El intervalo de confianza del ', 100*input$alfa,
|
167 |
+
'% para el cociente de varianzas poblacionales es ',
|
168 |
+
intervalo)
|
169 |
+
}
|
170 |
+
})
|
171 |
+
|
172 |
+
})
|
ui.R
ADDED
@@ -0,0 +1,117 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
library(shiny)
|
2 |
+
library(markdown)
|
3 |
+
|
4 |
+
shinyUI(pageWithSidebar(
|
5 |
+
headerPanel(title=HTML("Prueba de hip贸tesis para el cociente de
|
6 |
+
varianzas σ<sup>2</sup><sub>1</sub> /
|
7 |
+
σ<sup>2</sup><sub>2</sub>"),
|
8 |
+
windowTitle="PH coc varianzas"),
|
9 |
+
|
10 |
+
sidebarPanel(
|
11 |
+
h5("Esta aplicaci贸n sirve para realizar prueba de hipotesis
|
12 |
+
para el cociente de varianzas de variables cuantitativas
|
13 |
+
con distribuci贸n normal."),
|
14 |
+
|
15 |
+
h6("La aplicaci贸n usa una base de datos de ejemplo pero el usuario
|
16 |
+
puede cargar su propia base de datos."),
|
17 |
+
|
18 |
+
fileInput(inputId="file1",
|
19 |
+
label="Use el bot贸n siguiente para cargar su base de datos.",
|
20 |
+
accept = c(
|
21 |
+
"text/csv",
|
22 |
+
"text/comma-separated-values",
|
23 |
+
"text/tab-separated-values",
|
24 |
+
"text/plain",
|
25 |
+
".csv",
|
26 |
+
".tsv"
|
27 |
+
)),
|
28 |
+
|
29 |
+
checkboxInput(inputId="header",
|
30 |
+
label="驴Tiene encabezado la base de datos?",
|
31 |
+
value=TRUE),
|
32 |
+
|
33 |
+
selectInput(inputId="sep",
|
34 |
+
label = "驴Cu谩l es la separaci贸n de los datos?",
|
35 |
+
choices = list(Tab="\t", Comma=",",
|
36 |
+
Semicolon=";", "Space"=" "),
|
37 |
+
selected = ";"),
|
38 |
+
|
39 |
+
selectInput(inputId="variable1",
|
40 |
+
label=p("Elija la variable",
|
41 |
+
span("cuantitativa", style = "color:red"),
|
42 |
+
"para realizar la prueba de hip贸tesis."),
|
43 |
+
choices=""),
|
44 |
+
|
45 |
+
selectInput(inputId="variable2",
|
46 |
+
label=p("Elija la variable",
|
47 |
+
span("cualitativa", style = "color:blue"),
|
48 |
+
"de agrupacion, DEBE tener 2 niveles y ser un factor."),
|
49 |
+
choices=""),
|
50 |
+
|
51 |
+
selectInput(inputId="h0",
|
52 |
+
label=HTML("La hip贸tesis nula de la prueba es Ho:
|
53 |
+
σ<sup>2</sup><sub>1</sub> /
|
54 |
+
σ<sup>2</sup><sub>2</sub> = 1,
|
55 |
+
elija el tipo de hipotesis alterna
|
56 |
+
< , ≠ o >"),
|
57 |
+
choices=list("Menor" = "less",
|
58 |
+
"Diferente" = "two.sided",
|
59 |
+
"Mayor" = "greater"),
|
60 |
+
selected = "two.sided"),
|
61 |
+
|
62 |
+
sliderInput(inputId="alfa",
|
63 |
+
label=HTML("Opcional: elija un nivel de confianza para
|
64 |
+
construir el intervalo de confianza para
|
65 |
+
el cociente
|
66 |
+
σ<sup>2</sup><sub>1</sub> /
|
67 |
+
σ<sup>2</sup><sub>2</sub>"),
|
68 |
+
min=0.90, max=0.99,
|
69 |
+
value=0.95, step=0.01),
|
70 |
+
|
71 |
+
img(src="https://raw.githubusercontent.com/fhernanb/fhernanb.github.io/refs/heads/main/my_docs/logo_unal_shiny.png",
|
72 |
+
height = 60, width = 120),
|
73 |
+
img(src="https://raw.githubusercontent.com/fhernanb/fhernanb.github.io/refs/heads/main/my_docs/logo_udea_shiny.png",
|
74 |
+
height = 25, width = 70),
|
75 |
+
img(src="https://raw.githubusercontent.com/fhernanb/fhernanb.github.io/refs/heads/main/my_docs/logo_cua_shiny.png",
|
76 |
+
height = 40, width = 110),
|
77 |
+
br(),
|
78 |
+
br(),
|
79 |
+
tags$a(href="https://srunal.github.io", "https://srunal.github.io")
|
80 |
+
|
81 |
+
),
|
82 |
+
|
83 |
+
mainPanel(
|
84 |
+
tabsetPanel(type = "pills",
|
85 |
+
tabPanel(title="Resultados",
|
86 |
+
h5("A continuaci贸n el histograma, densidad, QQplot
|
87 |
+
y valor-P para la prueba de normalidad
|
88 |
+
Shapiro-Wilk de cada una de las
|
89 |
+
dos muestras."),
|
90 |
+
plotOutput("appPlot",
|
91 |
+
width="500px",
|
92 |
+
height="300px"),
|
93 |
+
|
94 |
+
h4("- Tabla de resumen con estad铆sticos muestrales:"),
|
95 |
+
tableOutput("statistic"),
|
96 |
+
|
97 |
+
h4("- Resultados de la prueba de hip贸tesis:"),
|
98 |
+
textOutput("resul1"),
|
99 |
+
|
100 |
+
h4(HTML("- Intervalo de confianza para
|
101 |
+
el cociente
|
102 |
+
σ<sup>2</sup><sub>1</sub> /
|
103 |
+
σ<sup>2</sup><sub>2</sub>:")),
|
104 |
+
textOutput("resul2")
|
105 |
+
),
|
106 |
+
|
107 |
+
tabPanel("Datos",
|
108 |
+
"A continuaci贸n los datos que est谩 usando
|
109 |
+
la aplicaci贸n.",
|
110 |
+
uiOutput("summary")),
|
111 |
+
|
112 |
+
tabPanel("Teor铆a", includeHTML("include.html"))
|
113 |
+
|
114 |
+
)
|
115 |
+
)
|
116 |
+
|
117 |
+
))
|
unequal_var_data99.txt
ADDED
@@ -0,0 +1,251 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
Weight Group
|
2 |
+
50.55030 Grupo 1
|
3 |
+
61.25258 Grupo 1
|
4 |
+
56.24894 Grupo 1
|
5 |
+
65.65679 Grupo 1
|
6 |
+
62.83388 Grupo 1
|
7 |
+
73.24405 Grupo 1
|
8 |
+
58.51261 Grupo 1
|
9 |
+
60.90630 Grupo 1
|
10 |
+
56.73146 Grupo 1
|
11 |
+
67.22003 Grupo 1
|
12 |
+
60.36340 Grupo 1
|
13 |
+
75.02256 Grupo 1
|
14 |
+
62.80754 Grupo 1
|
15 |
+
60.51750 Grupo 1
|
16 |
+
78.42197 Grupo 1
|
17 |
+
73.45075 Grupo 1
|
18 |
+
64.05179 Grupo 1
|
19 |
+
65.38776 Grupo 1
|
20 |
+
76.63673 Grupo 1
|
21 |
+
55.08314 Grupo 1
|
22 |
+
80.88494 Grupo 1
|
23 |
+
88.58204 Grupo 1
|
24 |
+
71.54954 Grupo 1
|
25 |
+
48.32583 Grupo 1
|
26 |
+
40.44927 Grupo 1
|
27 |
+
74.15086 Grupo 1
|
28 |
+
84.90795 Grupo 1
|
29 |
+
58.40049 Grupo 1
|
30 |
+
60.76984 Grupo 1
|
31 |
+
70.56893 Grupo 1
|
32 |
+
75.76796 Grupo 1
|
33 |
+
71.19564 Grupo 1
|
34 |
+
51.64917 Grupo 1
|
35 |
+
62.73287 Grupo 1
|
36 |
+
56.24910 Grupo 1
|
37 |
+
73.99910 Grupo 1
|
38 |
+
79.95774 Grupo 1
|
39 |
+
55.57182 Grupo 1
|
40 |
+
76.37397 Grupo 1
|
41 |
+
66.56973 Grupo 1
|
42 |
+
65.86066 Grupo 1
|
43 |
+
71.20084 Grupo 1
|
44 |
+
54.67018 Grupo 1
|
45 |
+
70.40050 Grupo 1
|
46 |
+
69.47970 Grupo 1
|
47 |
+
66.60614 Grupo 1
|
48 |
+
75.68068 Grupo 1
|
49 |
+
56.37009 Grupo 1
|
50 |
+
72.16496 Grupo 1
|
51 |
+
67.85384 Grupo 1
|
52 |
+
71.69780 Grupo 1
|
53 |
+
70.04701 Grupo 1
|
54 |
+
70.33570 Grupo 1
|
55 |
+
54.63944 Grupo 1
|
56 |
+
53.33180 Grupo 1
|
57 |
+
42.86249 Grupo 1
|
58 |
+
40.68829 Grupo 1
|
59 |
+
55.59472 Grupo 1
|
60 |
+
53.09797 Grupo 1
|
61 |
+
75.49655 Grupo 1
|
62 |
+
43.54653 Grupo 1
|
63 |
+
51.60253 Grupo 1
|
64 |
+
45.47439 Grupo 1
|
65 |
+
71.48804 Grupo 1
|
66 |
+
71.06496 Grupo 1
|
67 |
+
65.36183 Grupo 1
|
68 |
+
57.63302 Grupo 1
|
69 |
+
71.52314 Grupo 1
|
70 |
+
60.26910 Grupo 1
|
71 |
+
76.11950 Grupo 1
|
72 |
+
43.15393 Grupo 1
|
73 |
+
74.32763 Grupo 1
|
74 |
+
73.74856 Grupo 1
|
75 |
+
64.92062 Grupo 1
|
76 |
+
76.22805 Grupo 1
|
77 |
+
64.14468 Grupo 1
|
78 |
+
46.66684 Grupo 1
|
79 |
+
57.44771 Grupo 1
|
80 |
+
49.52070 Grupo 1
|
81 |
+
49.02281 Grupo 1
|
82 |
+
75.89785 Grupo 1
|
83 |
+
66.45265 Grupo 1
|
84 |
+
64.02100 Grupo 1
|
85 |
+
74.89705 Grupo 1
|
86 |
+
106.29634 Grupo 1
|
87 |
+
62.43153 Grupo 1
|
88 |
+
85.64085 Grupo 1
|
89 |
+
75.20969 Grupo 1
|
90 |
+
78.75479 Grupo 1
|
91 |
+
71.47283 Grupo 1
|
92 |
+
72.24819 Grupo 1
|
93 |
+
72.96063 Grupo 1
|
94 |
+
81.44395 Grupo 1
|
95 |
+
59.13345 Grupo 1
|
96 |
+
56.81112 Grupo 1
|
97 |
+
63.75622 Grupo 1
|
98 |
+
49.76463 Grupo 1
|
99 |
+
75.51193 Grupo 1
|
100 |
+
66.75562 Grupo 1
|
101 |
+
44.02623 Grupo 1
|
102 |
+
76.37441 Grupo 2
|
103 |
+
63.37802 Grupo 2
|
104 |
+
69.73950 Grupo 2
|
105 |
+
70.36453 Grupo 2
|
106 |
+
68.46488 Grupo 2
|
107 |
+
76.44103 Grupo 2
|
108 |
+
69.25948 Grupo 2
|
109 |
+
61.82844 Grupo 2
|
110 |
+
76.20195 Grupo 2
|
111 |
+
71.00959 Grupo 2
|
112 |
+
64.29619 Grupo 2
|
113 |
+
77.64101 Grupo 2
|
114 |
+
73.84479 Grupo 2
|
115 |
+
61.46269 Grupo 2
|
116 |
+
67.22959 Grupo 2
|
117 |
+
78.45180 Grupo 2
|
118 |
+
71.52198 Grupo 2
|
119 |
+
71.12362 Grupo 2
|
120 |
+
70.71162 Grupo 2
|
121 |
+
66.09589 Grupo 2
|
122 |
+
69.55674 Grupo 2
|
123 |
+
67.42492 Grupo 2
|
124 |
+
61.32901 Grupo 2
|
125 |
+
84.71004 Grupo 2
|
126 |
+
59.35111 Grupo 2
|
127 |
+
71.81532 Grupo 2
|
128 |
+
78.88253 Grupo 2
|
129 |
+
80.55406 Grupo 2
|
130 |
+
72.09338 Grupo 2
|
131 |
+
60.84449 Grupo 2
|
132 |
+
69.26214 Grupo 2
|
133 |
+
70.95307 Grupo 2
|
134 |
+
73.94863 Grupo 2
|
135 |
+
70.84740 Grupo 2
|
136 |
+
70.04736 Grupo 2
|
137 |
+
77.00465 Grupo 2
|
138 |
+
64.20280 Grupo 2
|
139 |
+
70.52740 Grupo 2
|
140 |
+
72.23580 Grupo 2
|
141 |
+
70.30635 Grupo 2
|
142 |
+
73.85537 Grupo 2
|
143 |
+
63.46842 Grupo 2
|
144 |
+
71.55005 Grupo 2
|
145 |
+
76.91536 Grupo 2
|
146 |
+
67.95931 Grupo 2
|
147 |
+
67.46876 Grupo 2
|
148 |
+
72.85655 Grupo 2
|
149 |
+
68.19556 Grupo 2
|
150 |
+
75.64152 Grupo 2
|
151 |
+
61.33369 Grupo 2
|
152 |
+
66.13137 Grupo 2
|
153 |
+
75.53459 Grupo 2
|
154 |
+
74.72881 Grupo 2
|
155 |
+
77.76970 Grupo 2
|
156 |
+
72.62453 Grupo 2
|
157 |
+
61.77881 Grupo 2
|
158 |
+
72.81865 Grupo 2
|
159 |
+
83.61184 Grupo 2
|
160 |
+
65.61744 Grupo 2
|
161 |
+
71.70281 Grupo 2
|
162 |
+
70.37080 Grupo 2
|
163 |
+
64.10026 Grupo 2
|
164 |
+
65.19349 Grupo 2
|
165 |
+
69.15764 Grupo 2
|
166 |
+
70.83526 Grupo 2
|
167 |
+
70.02046 Grupo 2
|
168 |
+
71.08550 Grupo 2
|
169 |
+
71.94166 Grupo 2
|
170 |
+
73.76781 Grupo 2
|
171 |
+
66.20942 Grupo 2
|
172 |
+
72.23653 Grupo 2
|
173 |
+
75.84131 Grupo 2
|
174 |
+
67.74860 Grupo 2
|
175 |
+
69.04712 Grupo 2
|
176 |
+
62.66672 Grupo 2
|
177 |
+
68.00322 Grupo 2
|
178 |
+
71.35661 Grupo 2
|
179 |
+
67.92959 Grupo 2
|
180 |
+
63.38161 Grupo 2
|
181 |
+
68.01821 Grupo 2
|
182 |
+
75.97187 Grupo 2
|
183 |
+
61.44667 Grupo 2
|
184 |
+
70.94835 Grupo 2
|
185 |
+
74.35324 Grupo 2
|
186 |
+
64.30971 Grupo 2
|
187 |
+
75.68054 Grupo 2
|
188 |
+
66.42512 Grupo 2
|
189 |
+
76.27227 Grupo 2
|
190 |
+
61.55411 Grupo 2
|
191 |
+
66.45667 Grupo 2
|
192 |
+
78.82515 Grupo 2
|
193 |
+
66.11034 Grupo 2
|
194 |
+
68.67467 Grupo 2
|
195 |
+
75.94628 Grupo 2
|
196 |
+
74.39378 Grupo 2
|
197 |
+
72.77630 Grupo 2
|
198 |
+
67.22345 Grupo 2
|
199 |
+
72.16216 Grupo 2
|
200 |
+
77.03907 Grupo 2
|
201 |
+
63.57204 Grupo 2
|
202 |
+
74.58805 Grupo 2
|
203 |
+
78.82659 Grupo 2
|
204 |
+
74.29897 Grupo 2
|
205 |
+
69.40740 Grupo 2
|
206 |
+
77.20880 Grupo 2
|
207 |
+
72.57719 Grupo 2
|
208 |
+
72.86812 Grupo 2
|
209 |
+
72.11492 Grupo 2
|
210 |
+
79.84081 Grupo 2
|
211 |
+
74.09459 Grupo 2
|
212 |
+
74.45922 Grupo 2
|
213 |
+
79.49065 Grupo 2
|
214 |
+
72.83807 Grupo 2
|
215 |
+
69.96743 Grupo 2
|
216 |
+
63.05169 Grupo 2
|
217 |
+
68.71237 Grupo 2
|
218 |
+
72.00973 Grupo 2
|
219 |
+
71.96866 Grupo 2
|
220 |
+
73.13164 Grupo 2
|
221 |
+
68.70975 Grupo 2
|
222 |
+
74.04752 Grupo 2
|
223 |
+
62.79878 Grupo 2
|
224 |
+
75.78519 Grupo 2
|
225 |
+
71.50944 Grupo 2
|
226 |
+
78.10280 Grupo 2
|
227 |
+
71.48194 Grupo 2
|
228 |
+
68.81004 Grupo 2
|
229 |
+
75.34631 Grupo 2
|
230 |
+
70.80994 Grupo 2
|
231 |
+
61.97276 Grupo 2
|
232 |
+
64.22399 Grupo 2
|
233 |
+
72.60920 Grupo 2
|
234 |
+
71.30278 Grupo 2
|
235 |
+
73.54538 Grupo 2
|
236 |
+
72.33739 Grupo 2
|
237 |
+
63.02031 Grupo 2
|
238 |
+
72.74572 Grupo 2
|
239 |
+
70.31417 Grupo 2
|
240 |
+
65.31908 Grupo 2
|
241 |
+
66.99437 Grupo 2
|
242 |
+
63.19804 Grupo 2
|
243 |
+
66.66398 Grupo 2
|
244 |
+
78.33904 Grupo 2
|
245 |
+
74.03470 Grupo 2
|
246 |
+
66.44705 Grupo 2
|
247 |
+
83.54124 Grupo 2
|
248 |
+
79.72041 Grupo 2
|
249 |
+
69.41476 Grupo 2
|
250 |
+
63.05741 Grupo 2
|
251 |
+
70.75567 Grupo 2
|