diff --git a/.gitignore b/.gitignore deleted file mode 100644 index c6127b3..0000000 --- a/.gitignore +++ /dev/null @@ -1,52 +0,0 @@ -# Prerequisites -*.d - -# Object files -*.o -*.ko -*.obj -*.elf - -# Linker output -*.ilk -*.map -*.exp - -# Precompiled Headers -*.gch -*.pch - -# Libraries -*.lib -*.a -*.la -*.lo - -# Shared objects (inc. Windows DLLs) -*.dll -*.so -*.so.* -*.dylib - -# Executables -*.exe -*.out -*.app -*.i*86 -*.x86_64 -*.hex - -# Debug files -*.dSYM/ -*.su -*.idb -*.pdb - -# Kernel Module Compile Results -*.mod* -*.cmd -.tmp_versions/ -modules.order -Module.symvers -Mkfile.old -dkms.conf diff --git a/Datasets/house-pricing.csv b/Datasets/house-pricing.csv deleted file mode 100644 index a203141..0000000 --- a/Datasets/house-pricing.csv +++ /dev/null @@ -1,51 +0,0 @@ -squaremeter,price -130,325000 -110,286000 -180,468000 -140,294000 -260,624000 -150,405000 -280,644000 -140,364000 -260,520000 -170,340000 -140,294000 -200,460000 -300,870000 -190,475000 -110,319000 -240,504000 -190,551000 -260,754000 -250,700000 -300,660000 -220,484000 -140,322000 -290,638000 -120,276000 -110,253000 -260,754000 -210,441000 -130,377000 -140,294000 -120,288000 -290,580000 -150,330000 -300,870000 -160,448000 -300,870000 -180,432000 -230,552000 -120,240000 -140,364000 -120,324000 -270,675000 -300,690000 -230,575000 -270,756000 -290,580000 -120,348000 -150,360000 -150,360000 -290,812000 -130,260000 diff --git a/Datasets/readme.md b/Datasets/readme.md deleted file mode 100644 index 137fcf4..0000000 --- a/Datasets/readme.md +++ /dev/null @@ -1,11 +0,0 @@ -#Dataset Explanations - -###House-Pricing Dataset - -We augmented a new dataset for the sake of simplicity of this explorable. - -**X-Label:** House Size (in square meters) -**Y-Label:** Price (in Turkish Liras) -Real Linear Regression Equation: Y = 2534*X - 15128 -Simple version of the equation for the explorable: Y = 2500*X - 15000 - diff --git a/LICENSE b/LICENSE deleted file mode 100644 index f288702..0000000 --- a/LICENSE +++ /dev/null @@ -1,674 +0,0 @@ - GNU GENERAL PUBLIC LICENSE - Version 3, 29 June 2007 - - Copyright (C) 2007 Free Software Foundation, Inc. - Everyone is permitted to copy and distribute verbatim copies - of this license document, but changing it is not allowed. - - Preamble - - The GNU General Public License is a free, copyleft license for -software and other kinds of works. - - The licenses for most software and other practical works are designed -to take away your freedom to share and change the works. By contrast, -the GNU General Public License is intended to guarantee your freedom to -share and change all versions of a program--to make sure it remains free -software for all its users. We, the Free Software Foundation, use the -GNU General Public License for most of our software; it applies also to -any other work released this way by its authors. You can apply it to -your programs, too. - - When we speak of free software, we are referring to freedom, not -price. Our General Public Licenses are designed to make sure that you -have the freedom to distribute copies of free software (and charge for -them if you wish), that you receive source code or can get it if you -want it, that you can change the software or use pieces of it in new -free programs, and that you know you can do these things. - - To protect your rights, we need to prevent others from denying you -these rights or asking you to surrender the rights. Therefore, you have -certain responsibilities if you distribute copies of the software, or if -you modify it: responsibilities to respect the freedom of others. - - For example, if you distribute copies of such a program, whether -gratis or for a fee, you must pass on to the recipients the same -freedoms that you received. You must make sure that they, too, receive -or can get the source code. And you must show them these terms so they -know their rights. - - Developers that use the GNU GPL protect your rights with two steps: -(1) assert copyright on the software, and (2) offer you this License -giving you legal permission to copy, distribute and/or modify it. - - For the developers' and authors' protection, the GPL clearly explains -that there is no warranty for this free software. For both users' and -authors' sake, the GPL requires that modified versions be marked as -changed, so that their problems will not be attributed erroneously to -authors of previous versions. - - Some devices are designed to deny users access to install or run -modified versions of the software inside them, although the manufacturer -can do so. This is fundamentally incompatible with the aim of -protecting users' freedom to change the software. The systematic -pattern of such abuse occurs in the area of products for individuals to -use, which is precisely where it is most unacceptable. Therefore, we -have designed this version of the GPL to prohibit the practice for those -products. If such problems arise substantially in other domains, we -stand ready to extend this provision to those domains in future versions -of the GPL, as needed to protect the freedom of users. - - Finally, every program is threatened constantly by software patents. -States should not allow patents to restrict development and use of -software on general-purpose computers, but in those that do, we wish to -avoid the special danger that patents applied to a free program could -make it effectively proprietary. To prevent this, the GPL assures that -patents cannot be used to render the program non-free. - - The precise terms and conditions for copying, distribution and -modification follow. - - TERMS AND CONDITIONS - - 0. Definitions. - - "This License" refers to version 3 of the GNU General Public License. - - "Copyright" also means copyright-like laws that apply to other kinds of -works, such as semiconductor masks. - - "The Program" refers to any copyrightable work licensed under this -License. Each licensee is addressed as "you". "Licensees" and -"recipients" may be individuals or organizations. - - To "modify" a work means to copy from or adapt all or part of the work -in a fashion requiring copyright permission, other than the making of an -exact copy. The resulting work is called a "modified version" of the -earlier work or a work "based on" the earlier work. - - A "covered work" means either the unmodified Program or a work based -on the Program. - - To "propagate" a work means to do anything with it that, without -permission, would make you directly or secondarily liable for -infringement under applicable copyright law, except executing it on a -computer or modifying a private copy. Propagation includes copying, -distribution (with or without modification), making available to the -public, and in some countries other activities as well. - - To "convey" a work means any kind of propagation that enables other -parties to make or receive copies. Mere interaction with a user through -a computer network, with no transfer of a copy, is not conveying. - - An interactive user interface displays "Appropriate Legal Notices" -to the extent that it includes a convenient and prominently visible -feature that (1) displays an appropriate copyright notice, and (2) -tells the user that there is no warranty for the work (except to the -extent that warranties are provided), that licensees may convey the -work under this License, and how to view a copy of this License. If -the interface presents a list of user commands or options, such as a -menu, a prominent item in the list meets this criterion. - - 1. Source Code. - - The "source code" for a work means the preferred form of the work -for making modifications to it. "Object code" means any non-source -form of a work. - - A "Standard Interface" means an interface that either is an official -standard defined by a recognized standards body, or, in the case of -interfaces specified for a particular programming language, one that -is widely used among developers working in that language. - - The "System Libraries" of an executable work include anything, other -than the work as a whole, that (a) is included in the normal form of -packaging a Major Component, but which is not part of that Major -Component, and (b) serves only to enable use of the work with that -Major Component, or to implement a Standard Interface for which an -implementation is available to the public in source code form. A -"Major Component", in this context, means a major essential component -(kernel, window system, and so on) of the specific operating system -(if any) on which the executable work runs, or a compiler used to -produce the work, or an object code interpreter used to run it. - - The "Corresponding Source" for a work in object code form means all -the source code needed to generate, install, and (for an executable -work) run the object code and to modify the work, including scripts to -control those activities. However, it does not include the work's -System Libraries, or general-purpose tools or generally available free -programs which are used unmodified in performing those activities but -which are not part of the work. For example, Corresponding Source -includes interface definition files associated with source files for -the work, and the source code for shared libraries and dynamically -linked subprograms that the work is specifically designed to require, -such as by intimate data communication or control flow between those -subprograms and other parts of the work. - - The Corresponding Source need not include anything that users -can regenerate automatically from other parts of the Corresponding -Source. - - The Corresponding Source for a work in source code form is that -same work. - - 2. Basic Permissions. - - All rights granted under this License are granted for the term of -copyright on the Program, and are irrevocable provided the stated -conditions are met. This License explicitly affirms your unlimited -permission to run the unmodified Program. The output from running a -covered work is covered by this License only if the output, given its -content, constitutes a covered work. This License acknowledges your -rights of fair use or other equivalent, as provided by copyright law. - - You may make, run and propagate covered works that you do not -convey, without conditions so long as your license otherwise remains -in force. You may convey covered works to others for the sole purpose -of having them make modifications exclusively for you, or provide you -with facilities for running those works, provided that you comply with -the terms of this License in conveying all material for which you do -not control copyright. Those thus making or running the covered works -for you must do so exclusively on your behalf, under your direction -and control, on terms that prohibit them from making any copies of -your copyrighted material outside their relationship with you. - - Conveying under any other circumstances is permitted solely under -the conditions stated below. Sublicensing is not allowed; section 10 -makes it unnecessary. - - 3. Protecting Users' Legal Rights From Anti-Circumvention Law. - - No covered work shall be deemed part of an effective technological -measure under any applicable law fulfilling obligations under article -11 of the WIPO copyright treaty adopted on 20 December 1996, or -similar laws prohibiting or restricting circumvention of such -measures. - - When you convey a covered work, you waive any legal power to forbid -circumvention of technological measures to the extent such circumvention -is effected by exercising rights under this License with respect to -the covered work, and you disclaim any intention to limit operation or -modification of the work as a means of enforcing, against the work's -users, your or third parties' legal rights to forbid circumvention of -technological measures. - - 4. Conveying Verbatim Copies. - - You may convey verbatim copies of the Program's source code as you -receive it, in any medium, provided that you conspicuously and -appropriately publish on each copy an appropriate copyright notice; -keep intact all notices stating that this License and any -non-permissive terms added in accord with section 7 apply to the code; -keep intact all notices of the absence of any warranty; and give all -recipients a copy of this License along with the Program. - - You may charge any price or no price for each copy that you convey, -and you may offer support or warranty protection for a fee. - - 5. Conveying Modified Source Versions. - - You may convey a work based on the Program, or the modifications to -produce it from the Program, in the form of source code under the -terms of section 4, provided that you also meet all of these conditions: - - a) The work must carry prominent notices stating that you modified - it, and giving a relevant date. - - b) The work must carry prominent notices stating that it is - released under this License and any conditions added under section - 7. This requirement modifies the requirement in section 4 to - "keep intact all notices". - - c) You must license the entire work, as a whole, under this - License to anyone who comes into possession of a copy. This - License will therefore apply, along with any applicable section 7 - additional terms, to the whole of the work, and all its parts, - regardless of how they are packaged. This License gives no - permission to license the work in any other way, but it does not - invalidate such permission if you have separately received it. - - d) If the work has interactive user interfaces, each must display - Appropriate Legal Notices; however, if the Program has interactive - interfaces that do not display Appropriate Legal Notices, your - work need not make them do so. - - A compilation of a covered work with other separate and independent -works, which are not by their nature extensions of the covered work, -and which are not combined with it such as to form a larger program, -in or on a volume of a storage or distribution medium, is called an -"aggregate" if the compilation and its resulting copyright are not -used to limit the access or legal rights of the compilation's users -beyond what the individual works permit. Inclusion of a covered work -in an aggregate does not cause this License to apply to the other -parts of the aggregate. - - 6. Conveying Non-Source Forms. - - You may convey a covered work in object code form under the terms -of sections 4 and 5, provided that you also convey the -machine-readable Corresponding Source under the terms of this License, -in one of these ways: - - a) Convey the object code in, or embodied in, a physical product - (including a physical distribution medium), accompanied by the - Corresponding Source fixed on a durable physical medium - customarily used for software interchange. - - b) Convey the object code in, or embodied in, a physical product - (including a physical distribution medium), accompanied by a - written offer, valid for at least three years and valid for as - long as you offer spare parts or customer support for that product - model, to give anyone who possesses the object code either (1) a - copy of the Corresponding Source for all the software in the - product that is covered by this License, on a durable physical - medium customarily used for software interchange, for a price no - more than your reasonable cost of physically performing this - conveying of source, or (2) access to copy the - Corresponding Source from a network server at no charge. - - c) Convey individual copies of the object code with a copy of the - written offer to provide the Corresponding Source. This - alternative is allowed only occasionally and noncommercially, and - only if you received the object code with such an offer, in accord - with subsection 6b. - - d) Convey the object code by offering access from a designated - place (gratis or for a charge), and offer equivalent access to the - Corresponding Source in the same way through the same place at no - further charge. You need not require recipients to copy the - Corresponding Source along with the object code. If the place to - copy the object code is a network server, the Corresponding Source - may be on a different server (operated by you or a third party) - that supports equivalent copying facilities, provided you maintain - clear directions next to the object code saying where to find the - Corresponding Source. Regardless of what server hosts the - Corresponding Source, you remain obligated to ensure that it is - available for as long as needed to satisfy these requirements. - - e) Convey the object code using peer-to-peer transmission, provided - you inform other peers where the object code and Corresponding - Source of the work are being offered to the general public at no - charge under subsection 6d. - - A separable portion of the object code, whose source code is excluded -from the Corresponding Source as a System Library, need not be -included in conveying the object code work. - - A "User Product" is either (1) a "consumer product", which means any -tangible personal property which is normally used for personal, family, -or household purposes, or (2) anything designed or sold for incorporation -into a dwelling. In determining whether a product is a consumer product, -doubtful cases shall be resolved in favor of coverage. For a particular -product received by a particular user, "normally used" refers to a -typical or common use of that class of product, regardless of the status -of the particular user or of the way in which the particular user -actually uses, or expects or is expected to use, the product. A product -is a consumer product regardless of whether the product has substantial -commercial, industrial or non-consumer uses, unless such uses represent -the only significant mode of use of the product. - - "Installation Information" for a User Product means any methods, -procedures, authorization keys, or other information required to install -and execute modified versions of a covered work in that User Product from -a modified version of its Corresponding Source. The information must -suffice to ensure that the continued functioning of the modified object -code is in no case prevented or interfered with solely because -modification has been made. - - If you convey an object code work under this section in, or with, or -specifically for use in, a User Product, and the conveying occurs as -part of a transaction in which the right of possession and use of the -User Product is transferred to the recipient in perpetuity or for a -fixed term (regardless of how the transaction is characterized), the -Corresponding Source conveyed under this section must be accompanied -by the Installation Information. But this requirement does not apply -if neither you nor any third party retains the ability to install -modified object code on the User Product (for example, the work has -been installed in ROM). - - The requirement to provide Installation Information does not include a -requirement to continue to provide support service, warranty, or updates -for a work that has been modified or installed by the recipient, or for -the User Product in which it has been modified or installed. Access to a -network may be denied when the modification itself materially and -adversely affects the operation of the network or violates the rules and -protocols for communication across the network. - - Corresponding Source conveyed, and Installation Information provided, -in accord with this section must be in a format that is publicly -documented (and with an implementation available to the public in -source code form), and must require no special password or key for -unpacking, reading or copying. - - 7. Additional Terms. - - "Additional permissions" are terms that supplement the terms of this -License by making exceptions from one or more of its conditions. -Additional permissions that are applicable to the entire Program shall -be treated as though they were included in this License, to the extent -that they are valid under applicable law. If additional permissions -apply only to part of the Program, that part may be used separately -under those permissions, but the entire Program remains governed by -this License without regard to the additional permissions. - - When you convey a copy of a covered work, you may at your option -remove any additional permissions from that copy, or from any part of -it. (Additional permissions may be written to require their own -removal in certain cases when you modify the work.) You may place -additional permissions on material, added by you to a covered work, -for which you have or can give appropriate copyright permission. - - Notwithstanding any other provision of this License, for material you -add to a covered work, you may (if authorized by the copyright holders of -that material) supplement the terms of this License with terms: - - a) Disclaiming warranty or limiting liability differently from the - terms of sections 15 and 16 of this License; or - - b) Requiring preservation of specified reasonable legal notices or - author attributions in that material or in the Appropriate Legal - Notices displayed by works containing it; or - - c) Prohibiting misrepresentation of the origin of that material, or - requiring that modified versions of such material be marked in - reasonable ways as different from the original version; or - - d) Limiting the use for publicity purposes of names of licensors or - authors of the material; or - - e) Declining to grant rights under trademark law for use of some - trade names, trademarks, or service marks; or - - f) Requiring indemnification of licensors and authors of that - material by anyone who conveys the material (or modified versions of - it) with contractual assumptions of liability to the recipient, for - any liability that these contractual assumptions directly impose on - those licensors and authors. - - All other non-permissive additional terms are considered "further -restrictions" within the meaning of section 10. If the Program as you -received it, or any part of it, contains a notice stating that it is -governed by this License along with a term that is a further -restriction, you may remove that term. If a license document contains -a further restriction but permits relicensing or conveying under this -License, you may add to a covered work material governed by the terms -of that license document, provided that the further restriction does -not survive such relicensing or conveying. - - If you add terms to a covered work in accord with this section, you -must place, in the relevant source files, a statement of the -additional terms that apply to those files, or a notice indicating -where to find the applicable terms. - - Additional terms, permissive or non-permissive, may be stated in the -form of a separately written license, or stated as exceptions; -the above requirements apply either way. - - 8. Termination. - - You may not propagate or modify a covered work except as expressly -provided under this License. Any attempt otherwise to propagate or -modify it is void, and will automatically terminate your rights under -this License (including any patent licenses granted under the third -paragraph of section 11). - - However, if you cease all violation of this License, then your -license from a particular copyright holder is reinstated (a) -provisionally, unless and until the copyright holder explicitly and -finally terminates your license, and (b) permanently, if the copyright -holder fails to notify you of the violation by some reasonable means -prior to 60 days after the cessation. - - Moreover, your license from a particular copyright holder is -reinstated permanently if the copyright holder notifies you of the -violation by some reasonable means, this is the first time you have -received notice of violation of this License (for any work) from that -copyright holder, and you cure the violation prior to 30 days after -your receipt of the notice. - - Termination of your rights under this section does not terminate the -licenses of parties who have received copies or rights from you under -this License. If your rights have been terminated and not permanently -reinstated, you do not qualify to receive new licenses for the same -material under section 10. - - 9. Acceptance Not Required for Having Copies. - - You are not required to accept this License in order to receive or -run a copy of the Program. Ancillary propagation of a covered work -occurring solely as a consequence of using peer-to-peer transmission -to receive a copy likewise does not require acceptance. However, -nothing other than this License grants you permission to propagate or -modify any covered work. These actions infringe copyright if you do -not accept this License. Therefore, by modifying or propagating a -covered work, you indicate your acceptance of this License to do so. - - 10. Automatic Licensing of Downstream Recipients. - - Each time you convey a covered work, the recipient automatically -receives a license from the original licensors, to run, modify and -propagate that work, subject to this License. You are not responsible -for enforcing compliance by third parties with this License. - - An "entity transaction" is a transaction transferring control of an -organization, or substantially all assets of one, or subdividing an -organization, or merging organizations. If propagation of a covered -work results from an entity transaction, each party to that -transaction who receives a copy of the work also receives whatever -licenses to the work the party's predecessor in interest had or could -give under the previous paragraph, plus a right to possession of the -Corresponding Source of the work from the predecessor in interest, if -the predecessor has it or can get it with reasonable efforts. - - You may not impose any further restrictions on the exercise of the -rights granted or affirmed under this License. For example, you may -not impose a license fee, royalty, or other charge for exercise of -rights granted under this License, and you may not initiate litigation -(including a cross-claim or counterclaim in a lawsuit) alleging that -any patent claim is infringed by making, using, selling, offering for -sale, or importing the Program or any portion of it. - - 11. Patents. - - A "contributor" is a copyright holder who authorizes use under this -License of the Program or a work on which the Program is based. The -work thus licensed is called the contributor's "contributor version". - - A contributor's "essential patent claims" are all patent claims -owned or controlled by the contributor, whether already acquired or -hereafter acquired, that would be infringed by some manner, permitted -by this License, of making, using, or selling its contributor version, -but do not include claims that would be infringed only as a -consequence of further modification of the contributor version. For -purposes of this definition, "control" includes the right to grant -patent sublicenses in a manner consistent with the requirements of -this License. - - Each contributor grants you a non-exclusive, worldwide, royalty-free -patent license under the contributor's essential patent claims, to -make, use, sell, offer for sale, import and otherwise run, modify and -propagate the contents of its contributor version. - - In the following three paragraphs, a "patent license" is any express -agreement or commitment, however denominated, not to enforce a patent -(such as an express permission to practice a patent or covenant not to -sue for patent infringement). To "grant" such a patent license to a -party means to make such an agreement or commitment not to enforce a -patent against the party. - - If you convey a covered work, knowingly relying on a patent license, -and the Corresponding Source of the work is not available for anyone -to copy, free of charge and under the terms of this License, through a -publicly available network server or other readily accessible means, -then you must either (1) cause the Corresponding Source to be so -available, or (2) arrange to deprive yourself of the benefit of the -patent license for this particular work, or (3) arrange, in a manner -consistent with the requirements of this License, to extend the patent -license to downstream recipients. "Knowingly relying" means you have -actual knowledge that, but for the patent license, your conveying the -covered work in a country, or your recipient's use of the covered work -in a country, would infringe one or more identifiable patents in that -country that you have reason to believe are valid. - - If, pursuant to or in connection with a single transaction or -arrangement, you convey, or propagate by procuring conveyance of, a -covered work, and grant a patent license to some of the parties -receiving the covered work authorizing them to use, propagate, modify -or convey a specific copy of the covered work, then the patent license -you grant is automatically extended to all recipients of the covered -work and works based on it. - - A patent license is "discriminatory" if it does not include within -the scope of its coverage, prohibits the exercise of, or is -conditioned on the non-exercise of one or more of the rights that are -specifically granted under this License. You may not convey a covered -work if you are a party to an arrangement with a third party that is -in the business of distributing software, under which you make payment -to the third party based on the extent of your activity of conveying -the work, and under which the third party grants, to any of the -parties who would receive the covered work from you, a discriminatory -patent license (a) in connection with copies of the covered work -conveyed by you (or copies made from those copies), or (b) primarily -for and in connection with specific products or compilations that -contain the covered work, unless you entered into that arrangement, -or that patent license was granted, prior to 28 March 2007. - - Nothing in this License shall be construed as excluding or limiting -any implied license or other defenses to infringement that may -otherwise be available to you under applicable patent law. - - 12. No Surrender of Others' Freedom. - - If conditions are imposed on you (whether by court order, agreement or -otherwise) that contradict the conditions of this License, they do not -excuse you from the conditions of this License. If you cannot convey a -covered work so as to satisfy simultaneously your obligations under this -License and any other pertinent obligations, then as a consequence you may -not convey it at all. For example, if you agree to terms that obligate you -to collect a royalty for further conveying from those to whom you convey -the Program, the only way you could satisfy both those terms and this -License would be to refrain entirely from conveying the Program. - - 13. Use with the GNU Affero General Public License. - - Notwithstanding any other provision of this License, you have -permission to link or combine any covered work with a work licensed -under version 3 of the GNU Affero General Public License into a single -combined work, and to convey the resulting work. The terms of this -License will continue to apply to the part which is the covered work, -but the special requirements of the GNU Affero General Public License, -section 13, concerning interaction through a network will apply to the -combination as such. - - 14. Revised Versions of this License. - - The Free Software Foundation may publish revised and/or new versions of -the GNU General Public License from time to time. Such new versions will -be similar in spirit to the present version, but may differ in detail to -address new problems or concerns. - - Each version is given a distinguishing version number. If the -Program specifies that a certain numbered version of the GNU General -Public License "or any later version" applies to it, you have the -option of following the terms and conditions either of that numbered -version or of any later version published by the Free Software -Foundation. If the Program does not specify a version number of the -GNU General Public License, you may choose any version ever published -by the Free Software Foundation. - - If the Program specifies that a proxy can decide which future -versions of the GNU General Public License can be used, that proxy's -public statement of acceptance of a version permanently authorizes you -to choose that version for the Program. - - Later license versions may give you additional or different -permissions. However, no additional obligations are imposed on any -author or copyright holder as a result of your choosing to follow a -later version. - - 15. Disclaimer of Warranty. - - THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY -APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT -HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY -OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, -THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM -IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF -ALL NECESSARY SERVICING, REPAIR OR CORRECTION. - - 16. Limitation of Liability. - - IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING -WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS -THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY -GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE -USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF -DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD -PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), -EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF -SUCH DAMAGES. - - 17. Interpretation of Sections 15 and 16. - - If the disclaimer of warranty and limitation of liability provided -above cannot be given local legal effect according to their terms, -reviewing courts shall apply local law that most closely approximates -an absolute waiver of all civil liability in connection with the -Program, unless a warranty or assumption of liability accompanies a -copy of the Program in return for a fee. - - END OF TERMS AND CONDITIONS - - How to Apply These Terms to Your New Programs - - If you develop a new program, and you want it to be of the greatest -possible use to the public, the best way to achieve this is to make it -free software which everyone can redistribute and change under these terms. - - To do so, attach the following notices to the program. It is safest -to attach them to the start of each source file to most effectively -state the exclusion of warranty; and each file should have at least -the "copyright" line and a pointer to where the full notice is found. - - - Copyright (C) - - This program is free software: you can redistribute it and/or modify - it under the terms of the GNU General Public License as published by - the Free Software Foundation, either version 3 of the License, or - (at your option) any later version. - - This program is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - GNU General Public License for more details. - - You should have received a copy of the GNU General Public License - along with this program. If not, see . - -Also add information on how to contact you by electronic and paper mail. - - If the program does terminal interaction, make it output a short -notice like this when it starts in an interactive mode: - - Copyright (C) - This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. - This is free software, and you are welcome to redistribute it - under certain conditions; type `show c' for details. - -The hypothetical commands `show w' and `show c' should show the appropriate -parts of the General Public License. Of course, your program's commands -might be different; for a GUI interface, you would use an "about box". - - You should also get your employer (if you work as a programmer) or school, -if any, to sign a "copyright disclaimer" for the program, if necessary. -For more information on this, and how to apply and follow the GNU GPL, see -. - - The GNU General Public License does not permit incorporating your program -into proprietary programs. If your program is a subroutine library, you -may consider it more useful to permit linking proprietary applications with -the library. If this is what you want to do, use the GNU Lesser General -Public License instead of this License. But first, please read -. diff --git a/README.md b/README.md deleted file mode 100644 index f8d96a1..0000000 --- a/README.md +++ /dev/null @@ -1,11 +0,0 @@ -# Drink a Coffee, Understand AI - -In this interactive story, we aimed to experiment and learn AI algorithms in a structured and fun way. - -We utilized following libraries and open-source materials in this interactive story. - -- [p5.js](https://p5js.org/) -- [comicgen](https://gramener.com/comicgen/#?name=bean&angle=straight&emotion=curious&pose=handsfolded&ext=svg&mirror=&x=24&y=-145&scale=1&width=500&height=600) -- [reveal.js](https://revealjs.com/) -- [chart.js](https://www.chartjs.org/) - diff --git a/app.js b/app.js new file mode 100644 index 0000000..5615a47 --- /dev/null +++ b/app.js @@ -0,0 +1,25 @@ +Reveal.initialize({ + center: true, + transition: 'linear', + transitionSpeed: 'slow', + //disableLayout: true, + // backgroundTransition: 'slide' +}); +Reveal.on( 'slidetransitionend', event => { + index = 0; + if(event.currentSlide == document.getElementById("1")){ + t1.resume(); + } + if(event.currentSlide == document.getElementById("2")){ + t2.resume(); + } + if(event.currentSlide == document.getElementById("3")){ + t3.resume(); + } + if(event.currentSlide == document.getElementById("4")){ + t4.resume(); + } + if(event.currentSlide == document.getElementById("5")){ + t5.resume(); + } +}); \ No newline at end of file diff --git "a/assets/Ekran Al\304\261nt\304\261s\304\261.PNG" "b/assets/Ekran Al\304\261nt\304\261s\304\261.PNG" new file mode 100644 index 0000000..7d11093 Binary files /dev/null and "b/assets/Ekran Al\304\261nt\304\261s\304\261.PNG" differ diff --git a/assets/actiimg2.PNG b/assets/actiimg2.PNG new file mode 100644 index 0000000..9c91539 Binary files /dev/null and b/assets/actiimg2.PNG differ diff --git a/assets/actimg1.PNG b/assets/actimg1.PNG new file mode 100644 index 0000000..5b248b0 Binary files /dev/null and b/assets/actimg1.PNG differ diff --git a/assets/actimg3.PNG b/assets/actimg3.PNG new file mode 100644 index 0000000..5f3a48a Binary files /dev/null and b/assets/actimg3.PNG differ diff --git a/assets/actimg4.PNG b/assets/actimg4.PNG new file mode 100644 index 0000000..fd4d206 Binary files /dev/null and b/assets/actimg4.PNG differ diff --git a/assets/actimg5.PNG b/assets/actimg5.PNG new file mode 100644 index 0000000..6c1e75b Binary files /dev/null and b/assets/actimg5.PNG differ diff --git a/assets/actimg6.PNG b/assets/actimg6.PNG new file mode 100644 index 0000000..77cfc0f Binary files /dev/null and b/assets/actimg6.PNG differ diff --git a/assets/actimg7.PNG b/assets/actimg7.PNG new file mode 100644 index 0000000..d218439 Binary files /dev/null and b/assets/actimg7.PNG differ diff --git a/assets/actimg8.PNG b/assets/actimg8.PNG new file mode 100644 index 0000000..4210e47 Binary files /dev/null and b/assets/actimg8.PNG differ diff --git a/assets/actimg9.PNG b/assets/actimg9.PNG new file mode 100644 index 0000000..ac3f148 Binary files /dev/null and b/assets/actimg9.PNG differ diff --git a/assets/aktivasyon_fonk.png b/assets/aktivasyon_fonk.png new file mode 100644 index 0000000..ab5f12c Binary files /dev/null and b/assets/aktivasyon_fonk.png differ diff --git a/interactive-reading/assets/alexa.png b/assets/alexa.png similarity index 100% rename from interactive-reading/assets/alexa.png rename to assets/alexa.png diff --git a/assets/baby.png b/assets/baby.png new file mode 100644 index 0000000..d9d50b0 Binary files /dev/null and b/assets/baby.png differ diff --git a/assets/exp.png b/assets/exp.png new file mode 100644 index 0000000..0b6294d Binary files /dev/null and b/assets/exp.png differ diff --git a/assets/mat.gif b/assets/mat.gif new file mode 100644 index 0000000..c81aa01 Binary files /dev/null and b/assets/mat.gif differ diff --git a/assets/mlayer.png b/assets/mlayer.png new file mode 100644 index 0000000..4f51bc0 Binary files /dev/null and b/assets/mlayer.png differ diff --git a/assets/neuron.png b/assets/neuron.png new file mode 100644 index 0000000..0c4743c Binary files /dev/null and b/assets/neuron.png differ diff --git a/assets/projection.png b/assets/projection.png new file mode 100644 index 0000000..9519582 Binary files /dev/null and b/assets/projection.png differ diff --git a/interactive-reading/assets/proscons2.gif b/assets/proscons.gif similarity index 100% rename from interactive-reading/assets/proscons2.gif rename to assets/proscons.gif diff --git a/assets/table.png b/assets/table.png new file mode 100644 index 0000000..2e13480 Binary files /dev/null and b/assets/table.png differ diff --git a/interactive-reading/assets/tenor.gif b/assets/tenor.gif similarity index 100% rename from interactive-reading/assets/tenor.gif rename to assets/tenor.gif diff --git a/assets/welcome.jpg b/assets/welcome.jpg new file mode 100644 index 0000000..de0f36d Binary files /dev/null and b/assets/welcome.jpg differ diff --git a/interactive-reading/assets/yapay.gif b/assets/yapay.gif similarity index 100% rename from interactive-reading/assets/yapay.gif rename to assets/yapay.gif diff --git a/index.html b/index.html index 260f659..5e24270 100644 --- a/index.html +++ b/index.html @@ -1,2 +1,731 @@ -

Interactive Reading Home Page

-

Linear Regression Example

\ No newline at end of file + + + + + + + Piko + + + + + + + + + + + + +
+
+
+ Yapay Zeka İnteraktif Sunum Tanıtım Görseli +

Yapay Sinir Ağları İnteraktif Sunum

+
+
+
+
+ + + piko +
+

Karakterleri Tanıyalım

+
+
+ +
+ +

Meryem meraklı, bilgili bir Felsefe öğretmenidir. Yeni şeyler öğrenmeye bayılır. Seni dikkatle dinler, en ince ayrıntılarına kadar durumu öğrenmeye çalışır. Son günlerde popüler olan sesli asistanlardan birine kendisi de sahiptir. Onun aklını karıştırmak için elinden geleni yapacaktır.

+
+ +
+
+ +
+ +

Konuşan bir kahve bardağı mı? Her zaman yanı başımızda duran kahve bardağımız bu hikayede dile geliyor.

+
+ +
+
+ +
+ piko +

Merhaba, ben Piko size özel tasarlanmış sesli asistanım. Bana soracağın her soruyu dikkatle dinlerim ve en uygun cevabı sana iletmeye çalışırım. Bir sıkıntın olursa, dertleşmek istersen bana gelebilirsin. İnsan psikolojisinden çok iyi anlarım.

+
+ +
+
+
+
+

Hikayemiz Başlıyor

+
+
+
+ +
+
+ +
+
+
Çekirdek
+

Meryem

+
+

Meryem işten gelmiş bilgisayarıyla yeni bir ev arıyordu. Çekirdek her zamanki yerinde sehpanın kenarında bekliyordu. Piko ise o sıralarda uyku modundaydı. Meryem işini bıraktı ve mutfağa yönelip Çekirdek’ i yerinden aldı kahvesini doldurdu sehpanın kenarına bıraktı. Kendisi de sandalyesine oturdu. Canı sıkkın bir şekilde bardağa bakarken birden duyduğu sesle irkildi. Çekirdek’ in sesiydi bu. +

+
+
+
+ +
+
+ +
+
+ table +
+
+ piko +
+
+
Meryem
+

Ev sahibimin evi satması nedeniyle yeni bir eve ihtiyacım var. Bu yüzden bir ev bakıyorum, sence bir ev alırken dikkat edilmesi gereken unsurlar nelerdir?

+
+
+
Piko
+

Bir evin öncelikle senin için yeterli alana sahip olup olmaması önemlidir. Bunun yanında bütçene uygunluğu da kriterlerinden olmalıdır. Ayrıca alacağın evin iş ve ulaşım araçlarına uzaklığı da göz önüne almalısın. Her gün gideceğin işine evin ne kadar yakın olursa o kadar vakit kazanırsın. +

+
+
+
Meryem
+

Teşekkür ederim Piko. Şimdi sırada uzun bir internet araması var. Umarım o kadar evden bir tane bulabilirim. Tabii bir de tek tek bunlar ile ilgili bilgi toplamak... +

+
+
+
+
+ +
+
+ +
+
+ table +
+
+ piko +
+
+
Piko
+

Şehirdeki tüm binaları ve konumlarını biliyorum. İnternetten sana uygun olacağını düşündüğüm birkaçını bulmak benim için kolay bir iş. Ben hemen gerekli verileri toplayarak dönüyorum. +

+
+
+
Piko
+

Meryem! İstemeyeceğin kadar ev buldum sana! +

+
+
+
Meryem
+

Ben de bundan korkuyordum, hepsini nasıl inceleyeceğim? +

+
+
+
Piko
+

Korkamana gerek yok. Bu verileri daha kolay incelemek için grafiklerle düzenleyebilirim. +

+
+
+
+

Leaflet için Place Holder Iframe

+
+
+
+
+

Yapay Sinir Ağları

+
+
+
+ +
+
+ +
+
+ table +
+
+ piko +
+
+
Piko
+

Şu ana kadar, evlerin metrekare ile fiyatlarını tahmin konusunda başarı ile ilerledik. Fakat evlerin Priya’ nın işine olan uzaklığı konusunda sorun yaşadık. Çözümden önce insanların günlük hayatlarında problemlerini nasıl çözdüklerini sormak istiyorum. +

+
+
+
Meryem
+

Biz insanlar problemleri akıl ve mantık ile çözeriz bu işlerlerse beyinde gerçekleşir. Fakat daha detaylı anlatmam gerekirse, tüm bu olaylar sinir sistemimizde nöronlar yardımıyla çözüme kavuşur. +

+
+
+
+
+ +
+
+ projection +
+ nöron +
+
+
+ table +
+
+ piko +
+
+
Piko
+

Nöronlar, duyu organları ile elde edilen verileri alıp elektriksel durumlarına göre değerlendirerek sonuçlar üretir. Tek bir işlemi yapmak için bile birçok nöron gerekmesidir. +

+
+
+
Piko
+

Yapay sinir ağlarınını anlamak için öncelikle biyolojik nöronları anlamalıyız. +

+
+
+
+
+ +
+
+ projection +
+ nöron +
+
+
+ table +
+
+ piko +
+
+
Piko
+

Neden öncelikle nöronları anlamalıyız ? İlk yapay sinir ağları tasarlanırken, daha yapay zeka kavramı ortaya çıkmamıştı! Yapay sinir ağları nörobilimcilerin insan beyninin çalışma ve karar verme aşamalarının şema edilmesi ve modellenmesi sonucu ortaya çıkmıştır. +

+
+
+
+
+ +
+
+ projection +
+ Çok Katmanlı Yapı +
+
+
+ table +
+
+ piko +
+
+
Piko
+

Biliyor muydunuz? Bende yapay sinir ağları kullanılarak üretildiğim için insanların günlük hayat problemleri ile uyumlu çalışabiliyorum. Peki bu sistem nasıl çalışıyor? +

+
+
+
Piko
+

Bunları bir arada çalışan yapay nöronlara borçluyum. Her yapay nöronum üzerine gelen veriyi yine onunla gelen eğitim sürecinden kalmış ağırlık ile toplar ve aktivasyon fonksiyonuna girer ve fonksiyonun sonucuna göre yeni veri oluşturup sonraki katmana iletir. +

+
+
+
+
+ +
+
+ projection +
+ Anlatım +
+
+
+ table +
+
+ piko +
+
+
Piko
+

Eğitim sürecinde ağırlıklar en doğru sonuca yaklaşmak için sürekli değişiyor. Bazen sadece ağırlıklar da yeterli olmuyor ve burada sapma değerleri söz konusu oluyor. Sonucun doğru şekilde çıkması için bazı nöronlar üzerine gelen veriye sapma değerleri ekleyebiliyor. Bu değerlerin uygun sonuçlar verebilmesi eğitim sürecinde sahip olduğum verilere bağlıdır. +

+
+
+
+

Öğrendiklerini Test Etmek için Oyun Alanı

+
+
+ +
+
+

Aktivasyon Fonksiyonları

+
+
+
+ +
+
+ +
+
+ table +
+
+ piko +
+
+ Aktivasyon Fonksiyonları +
+
+
Piko
+

Yapay sinir ağlarının yapısını oluşturan nöron ve ağırlıklarını öğrendik. Peki bu ağın içinde gerçekleşen işlemlere biraz daha yakından bakmaya ne dersin? +

+
+
+
Piko
+

Fonksiyon nedir? + Verdiğimiz bir değeri, tanımlanmış özelliklere göre belirli işlemler uygulayarak bir sonuç veren matematiksel işlemlere fonksiyon diyoruz. Evindeki çamaşır makinesini düşünelim. Kirli çamaşırı içine attığında yıkama işlemini çalıştırarak temiz çamaşır çıkartır. Bunu günlük hayatımızdaki fonksiyonlara örnek olarak verebiliriz. +

+
+
+
+
+ +
+
+ +
+
+ table +
+
+ piko +
+
+ Aktivasyon Fonksiyonları +
+
+
Piko
+

Bir örnek üzerinden gidelim. + 7 tane terliğimiz var. Ayak numaralarının tablo ve grafiklerini yana ekledim. Bunlar üzerinden bir tahmin yürütebilir misin? +

+
+
+
Meryem
+

Bu verilere göre bir numara 29-33 arasında ise çocuk terliği, 36-39 arasında ise yetişkin terliğidir diyebiliriz. +

+
+
+
Piko
+

Harikasın! Artık bazı tahminler yapmaya hazırız! +

+
+
+
+
+ +
+
+ +
+
+ table +
+
+ piko +
+
+ Aktivasyon Fonksiyonları +
+
+
Piko
+

Artık kendimiz tahminler yapabiliyoruz, peki ya bunları bilgisayara nasıl öğretebiliriz? Aktivasyon fonksiyonlarından yardım alabilir miyiz sence? +

+
+
+
Meryem
+

Girdiğimiz değeri çocuk ayakkabısı veya yetişkin ayakkabısı olarak tanımlayabilecek bir fonksiyona ihtiyacımız var. +

+
+
+
+
+ +
+
+ +
+
+ table +
+
+ piko +
+
+ Aktivasyon Fonksiyonları +
+
+
Piko
+

Girdiğimiz değeri 0 veya 1 e yaklaştıran bir fonksiyona ne dersin? İki adet çıktı seçeneğini elde etmiş oluruz. Sonucumuz 0’a yakınsa çocuk terliği, 1’e yakınsa yetişkin terliği olarak sınıflandırabiliriz. +

+
+
+
Meryem
+

Bu harika! Bu fonksiyonun adı ne? +

+
+
+
Piko
+

Sigmoid’e merhaba de! +

+
+
+
+
+ +
+
+ +
+
+ table +
+
+ piko +
+
+ Aktivasyon Fonksiyonları +
+
+
Piko
+

Sigmoid kıvrımlı grafiği sayesinde sonuca yavaş yavaş yaklaştırıp kesin zıplamaları önlemiş oluyor. Ancak bunun bir negatif getirisi olarak, 0 veya 1’e çok yakın olan değerlerde öğrenme süreci yavaşlamış oluyor. Yanda sigmoid fonksiyonunun bu problemimizde bize nasıl yardımcı olduğunun basit bir çizimini görüyoruz. +

+
+
+
+
+ +
+
+ +
+
+ table +
+
+ piko +
+
+ Aktivasyon Fonksiyonları +
+
+
Meryem
+

Bu harika! Başka aktivasyon fonksiyonlarından da örnek verebilir misin? +

+
+
+
Piko
+

Tabii ki. Az önceki ev - metrekare problemi için kullandığımız metoda lineer fonksiyon diyoruz. Bu da aslında bir aktivasyon fonksiyonu türü, ama her zaman kullanışlı olmuyor. Gelen inputları ağırlık değerleri ile çarparak çıktı oluşturan bu fonksiyon, optimum bir değere sahip olmaması sebebiyle backpropagation kavramını tamamen ortadan kaldırıyor. +

+
+
+
+
+ +
+
+ +
+
+ table +
+
+ piko +
+
+ Aktivasyon Fonksiyonları +
+
+
Piko
+

Piko: AI çalışmalarında kullanılan birçok aktivasyon fonksiyonu var. Şimdiye kadar sigmoid ve lineer fonksiyonlar üzerine konuştuk. Şimdi diğer en sık kullanılanlar diyebileceğimiz ReLU ve Tanh’ı öğrenelim. +

+
+
+
+
+ +
+
+ +
+
+ table +
+
+ piko +
+
+ Aktivasyon Fonksiyonları +
+
+
Piko
+

ReLU(Rectified Linear Unit), hangi aktivasyon fonksiyonunu kullanacağımızı bilmediğimizde kullanabileceğimiz en temel aktivasyon fonksiyonlarından biri. Yandaki grafikte de görebildiğin gibi, sıfırdan küçük değerler için her zaman 0, pozitif değerler için ise lineer bir çıktı üretiyor. +

+
+
+
Meryem
+

Bu negatif değerler için öğrenmeyi gerçekleştiremediği anlamına gelmez mi? +

+
+
+
Piko
+

Tam olarak öyle. Buna literatürde “Dying ReLU” problemi diyoruz. Bu yüzden ReLU, aynı lineer fonksiyonda olduğu gibi detaylı ve karmaşık verilerle çalışılırken çok doğru sonuçlar üretemiyor. +

+
+
+
+
+ +
+
+ +
+
+ table +
+
+ piko +
+
+ Aktivasyon Fonksiyonları +
+
+
Piko
+

Bu saydığımız fonksiyonlarda yapay sinir ağı modellemelerinde en çok karşımıza çıkan tanh fonksiyonudur. +

+
+
+
Meryem
+

Tanh’ın grafiği bana Sigmoid’i anımsattı. İkisinin arasındaki farkı açıklayabilir misin? +

+
+
+
Piko
+

Harika bir noktaya değindin Alberto! Aslında tanh, 0 merkezli bir sigmoid fonksiyonudur. Denklemlerini aşağıdaki gibi eşitleyebiliriz: tanh(x) = 2 * sigmoid(2x) - 1 +

+
+
+
+
+ +
+
+ +
+
+ table +
+
+ piko +
+
+ Aktivasyon Fonksiyonları +
+
+
Meryem
+

Peki ya kullanacağımız alanları nasıl ayıracağız? +

+
+
+
Piko
+

Sigmoid 0 ile 1 arasında değer üreten problemlerde kullanılabilir. Tanh fonksiyonu ise negatif çıktı içeren problemlerin de çözümünde kullanılabilir diye özetleyebiliriz. +

+
+
+
+
+
+

Acısıyla Tatlısıyla Yapay Zeka

+
+
+
+ +
+
+ +
+
+ table +
+
+ piko +
+
+
Meryem
+

Yapay zeka harika! Bu alanda nasıl kendimi geliştirebilirim? +

+
+
+
Piko
+

Yapay zeka için verilerin öneminden bahsetmiştik. Sen de veri bilimi ile ilgilenebilirsin. Veriler tarih ilerledikçe hızla artmakta. Bu artışın genel nedeni endüstri ve internet. Üretimin kolaylaşması ve paylaşımın artması ile üretilen veride artıyor. +

+
+
+
Piko
+

Veriler arttıkça daha karmaşık hale geliyor. Devlet arşivleri, internet vb. Sağlayıcılardan elde ettiğimiz veriyi işlemekse zorlaşıyor. Bu yüzden yeni bir meslek bile oluştu “Veri Bilimci”. Önceki durumlardan da öğrendiğimiz gibi iyi bir yapay zeka eğitmek için bolca veriye ihtiyacımız vardı. Fakat bu verilerin doğruluğu ve alakası da çok önemlidir. +

+
+
+
+
+ +
+
+ +
+
+ table +
+
+ piko +
+
+
Çekirdek
+

Benim hangi verilerimi topluyorlar, beni kaçıracaklar mı?! +

+
+
+
Piko
+

Burada çok büyük bir alan mevcut. Sokaklardaki kamerelardan hareketliliğimiz, duygusal durumumuz gibi veriler toplanabiliyor. Ya da kullandığımız akıllı saat veya bileklikler ile kalp atışımızdan gün içindeki adım sayımıza kadar erişilebiliyor. +

+
+
+
Piko
+

Zaten hepimizin bildiği sosyal medya araçlarıysa adımızdan nelerden hoşlandığımıza kadar biliyor. Ben bile sizi daha iyi anlamak için konuşmalarımızı kayderek kendimi geliştiriyorum. +

+
+
+
+
+ +
+
+ +
+
+ table +
+
+ piko +
+
+
Meryem
+

NEEE! Dinleniyor muyuz? +

+
+
+
Piko
+

Hmm...dinlenildiğini söylemek pek de yanlış olmaz Meryem. Her ne kadar dediğin her kelimeyi karşı tarafta dinleyen bir insan olmasa da ; mikrofon kullanımına izin verdiğin bir uygulamayı açtığında, yapay zeka ve çeşitli algoritmalar, izlediğin tv kanalını ses sinyallerinden analiz ediyor ve karşına izlediğin showlara göre reklam çıkarıyor. +

+
+
+
+
+ +
+
+ +
+
+ table +
+
+ piko +
+
+
Meryem
+

AAAA, bunlardan nasıl korunabilirim? +

+
+
+
Piko
+

Belki telefonunu evde bırakıp, ıssız bir adaya göç edersen korunabilirsin Meryem. +

+
+
+
Meryem
+

Oh, en azından telefon dışında bir tehlikem yok. +

+
+
+
Piko
+

O kadar emin olma Meryem. Verileriniz sadece telefonlarınızdan toplanılmıyor. +

+
+
+
+
+ +
+
+ +
+
+ table +
+
+ piko +
+
+
Piko
+

Belki telefonun olmayabilir, fakat her gün dolaşmak için gittiğin parktan, arkadaşlarınla buluştuğun alışveriş merkezinin önünden, eve gelmek için kullandığın yola kadar hepsini biliyorlar Meryem. +

+
+
+
Meryem
+

Sokaktaki kameralardan mı Piko? +

+
+
+
Piko
+

Aynen öyle. Fakat datanın nasıl toplandığından önemli olarak neden toplandığını sormakta fayda var. Kameralar, devlet güvencesinde sağlık ve güvenlik amaçlarıyla kullanılmaktadır. +

+
+
+
+
+
+ + + + + + + \ No newline at end of file diff --git a/interactive-reading/app.js b/interactive-reading/app.js deleted file mode 100644 index 07d0e65..0000000 --- a/interactive-reading/app.js +++ /dev/null @@ -1,115 +0,0 @@ -const image = document.querySelector(".Image"); -const text = document.querySelector(".Text"); -const character = document.querySelector(".Character"); -const t1 = new TimelineMax(); - -const image_2 = document.getElementById("image2"); -const text_2 = document.getElementById("text2"); -const alberto_2 = document.getElementById("alberto2"); -const character_2 = document.getElementById("character2"); -const t2 = new TimelineMax(); - -const image_3 = document.getElementById("image3"); -const text_3 = document.getElementById("text3"); -const alberto_3 = document.getElementById("alberto3"); -const character_3 = document.getElementById("character3"); -const t3 = new TimelineMax(); - -const image_4 = document.getElementById("image4"); -const text_4 = document.getElementById("text4"); -const alberto_4 = document.getElementById("alberto4"); -const character_4 = document.getElementById("character4"); -const t4 = new TimelineMax(); - -const image_5 = document.getElementById("image5"); -const text_5 = document.getElementById("text5"); -const alberto_5 = document.getElementById("alberto5"); -const character_5 = document.getElementById("character5"); -const t5 = new TimelineMax(); - -const first = new Array("Piko: Verinin görselleştirilmesi her zaman anlamayı kolaylaştırır. Eğer ev boyutlarını ve fiyatlarını incelersen hepsinin belirli aralıklarda olduğunu görebilirsin. Örnek vermek gerekirse 150-200 m2 arası bir evin 350.000- 550.000 TL aralığında olduğu grafikten çıkarabileceğimiz sonuçlardan bir tanesi.", "Alberto: Peki, bu veriyi bir tahmin yapmak için nasıl kullanacağız?"); -const second = new Array("Grafikler, bize veri içerisindeki matematiksel ilişkiyi kullanarak veriyi görselleştirme imkanı sunar. Örnek olarak birikim yapmak için her ay kenara 200 TL koyan bir insanın birikimini gösteren bir grafiği inceleyerek başlayalım:"); -const third = new Array("Y = 1 ise yani 1. ayda isek: X (birikimimiz) = 1 *200 = 200 TL olur.
Y = 2 ise yani 2. ayda isek: X (birikimimiz) = 2*200 = 400 TL olur.
Y = 3 ise yani 3. ayda isek: X (birikimimiz) = 3*200 = 600 TL olur."); -const fourth = new Array("Piko: Tebrikler! Bunu nasıl yapacağımızı anlatmadan önce grafikler üzerinde biraz deney yapalım."); -let index = 0; - -text_2.addEventListener('click', function(event){ - ChangeText(text_2,first); -}); - -text_3.addEventListener('click', function(event){ - ChangeText(text_3,second); -}); - -text_4.addEventListener('click', function(event){ - ChangeText(text_4,third); -}); - -text_5.addEventListener('click', function(event){ - ChangeText(text_5,fourth); -}); - - - -function ChangeText(elem,t){ - if(index < t.length){ - elem.innerHTML = t[index]; - index++; - } -} - - -t1.fromTo(image, 1.5, {x:"-150%"}, {x:"0%", ease: Power2.easeInOut}) -.fromTo(text, 1.3, {y:"100%"}, {y:"0%",ease: Power2.easeInOut }) -.fromTo(character, 1.3, {x:"200%"}, {x:"0%", ease: Power2.easeInOut}); -t1.pause(); - -t2.fromTo(image_2, 1.5, {x:"-150%"}, {x:"0%", ease: Power2.easeInOut}) -.fromTo(character_2, 1.3, {y:"-125%"}, {y:"0%",ease: Power2.easeInOut }) -.fromTo(alberto_2, 1.3, {x:"200%"}, {x:"0%", ease: Power2.easeInOut}) -.fromTo(text_2, 1.3, {y:"1000%"}, {y:"0%",ease: Power2.easeInOut }); -t2.pause(); - -t3.fromTo(image_3, 1.5, {x:"-150%"}, {x:"0%", ease: Power2.easeInOut}) -.fromTo(character_3, 1.3, {y:"-125%"}, {y:"0%",ease: Power2.easeInOut }) -.fromTo(alberto_3, 1.3, {x:"200%"}, {x:"0%", ease: Power2.easeInOut}) -.fromTo(text_3, 1.3, {y:"1000%"}, {y:"0%",ease: Power2.easeInOut }); -t3.pause(); - -t4.fromTo(image_4, 1.5, {x:"-150%"}, {x:"0%", ease: Power2.easeInOut}) -.fromTo(character_4, 1.3, {y:"-125%"}, {y:"0%",ease: Power2.easeInOut }) -.fromTo(alberto_4, 1.3, {x:"200%"}, {x:"0%", ease: Power2.easeInOut}) -.fromTo(text_4, 1.3, {y:"1000%"}, {y:"0%",ease: Power2.easeInOut }); -t4.pause(); - -t5.fromTo(image_5, 1.5, {x:"-150%"}, {x:"0%", ease: Power2.easeInOut}) -.fromTo(character_5, 1.3, {y:"-125%"}, {y:"0%",ease: Power2.easeInOut }) -.fromTo(alberto_5, 1.3, {x:"200%"}, {x:"0%", ease: Power2.easeInOut}) -.fromTo(text_5, 1.3, {y:"1000%"}, {y:"0%",ease: Power2.easeInOut }); -t5.pause(); - -Reveal.initialize({ - center: true, - transition: 'linear', - transitionSpeed: 'slow', - //disableLayout: true, - // backgroundTransition: 'slide' -}); -Reveal.on( 'slidetransitionend', event => { - index = 0; - if(event.currentSlide == document.getElementById("1")){ - t1.resume(); - } - if(event.currentSlide == document.getElementById("2")){ - t2.resume(); - } - if(event.currentSlide == document.getElementById("3")){ - t3.resume(); - } - if(event.currentSlide == document.getElementById("4")){ - t4.resume(); - } - if(event.currentSlide == document.getElementById("5")){ - t5.resume(); - } -}); \ No newline at end of file diff --git a/interactive-reading/assets/1.jpg b/interactive-reading/assets/1.jpg deleted file mode 100644 index 0ac81eb..0000000 Binary files a/interactive-reading/assets/1.jpg and /dev/null differ diff --git a/interactive-reading/assets/Introduction.png b/interactive-reading/assets/Introduction.png deleted file mode 100644 index df27ef6..0000000 Binary files a/interactive-reading/assets/Introduction.png and /dev/null differ diff --git a/interactive-reading/assets/alberto.png b/interactive-reading/assets/alberto.png deleted file mode 100644 index 6b51a05..0000000 Binary files a/interactive-reading/assets/alberto.png and /dev/null differ diff --git a/interactive-reading/assets/bean.png b/interactive-reading/assets/bean.png deleted file mode 100644 index a318e98..0000000 Binary files a/interactive-reading/assets/bean.png and /dev/null differ diff --git a/interactive-reading/assets/birikim.png b/interactive-reading/assets/birikim.png deleted file mode 100644 index 2a98d5d..0000000 Binary files a/interactive-reading/assets/birikim.png and /dev/null differ diff --git a/interactive-reading/assets/dataset.png b/interactive-reading/assets/dataset.png deleted file mode 100644 index 359e22a..0000000 Binary files a/interactive-reading/assets/dataset.png and /dev/null differ diff --git a/interactive-reading/assets/indir.gif b/interactive-reading/assets/indir.gif deleted file mode 100644 index 458b606..0000000 Binary files a/interactive-reading/assets/indir.gif and /dev/null differ diff --git a/interactive-reading/assets/map.PNG b/interactive-reading/assets/map.PNG deleted file mode 100644 index 181e917..0000000 Binary files a/interactive-reading/assets/map.PNG and /dev/null differ diff --git a/interactive-reading/assets/proscons.gif b/interactive-reading/assets/proscons.gif deleted file mode 100644 index 628f571..0000000 Binary files a/interactive-reading/assets/proscons.gif and /dev/null differ diff --git a/interactive-reading/assets/scene1.png b/interactive-reading/assets/scene1.png deleted file mode 100644 index c37595e..0000000 Binary files a/interactive-reading/assets/scene1.png and /dev/null differ diff --git a/interactive-reading/assets/scene2.png b/interactive-reading/assets/scene2.png deleted file mode 100644 index 3cc0ee8..0000000 Binary files a/interactive-reading/assets/scene2.png and /dev/null differ diff --git a/interactive-reading/assets/scene3.png b/interactive-reading/assets/scene3.png deleted file mode 100644 index c019602..0000000 Binary files a/interactive-reading/assets/scene3.png and /dev/null differ diff --git a/interactive-reading/assets/scene4.png b/interactive-reading/assets/scene4.png deleted file mode 100644 index d1ee2cc..0000000 Binary files a/interactive-reading/assets/scene4.png and /dev/null differ diff --git a/interactive-reading/assets/scene5.png b/interactive-reading/assets/scene5.png deleted file mode 100644 index d3611b5..0000000 Binary files a/interactive-reading/assets/scene5.png and /dev/null differ diff --git a/interactive-reading/assets/scene6.png b/interactive-reading/assets/scene6.png deleted file mode 100644 index ee486e9..0000000 Binary files a/interactive-reading/assets/scene6.png and /dev/null differ diff --git a/interactive-reading/assets/scene7.png b/interactive-reading/assets/scene7.png deleted file mode 100644 index b022482..0000000 Binary files a/interactive-reading/assets/scene7.png and /dev/null differ diff --git a/interactive-reading/assets/sitting_alberto.png b/interactive-reading/assets/sitting_alberto.png deleted file mode 100644 index 3c5eb50..0000000 Binary files a/interactive-reading/assets/sitting_alberto.png and /dev/null differ diff --git a/interactive-reading/dataset-graphing/app.js b/interactive-reading/dataset-graphing/app.js deleted file mode 100644 index d1bcffe..0000000 --- a/interactive-reading/dataset-graphing/app.js +++ /dev/null @@ -1,127 +0,0 @@ -window.onload = function() { - DataX = [100, 150, 200, 250, 300]; - DataY = []; - DataSet = [{ x: 130, y: 325000 }, { x: 110, y: 286000 }, { x: 180, y: 468000 }, { x: 140, y: 294000 }, { x: 260, y: 624000 }, { x: 150, y: 405000 }, { x: 280, y: 644000 }, { x: 140, y: 364000 }, { x: 260, y: 520000 }, { x: 170, y: 340000 }, { x: 140, y: 294000 }, { x: 200, y: 460000 }, { x: 300, y: 870000 }, { x: 190, y: 475000 }, { x: 110, y: 319000 }, { x: 240, y: 504000 }, { x: 190, y: 551000 }, { x: 260, y: 754000 }, { x: 250, y: 700000 }, { x: 300, y: 660000 }, { x: 220, y: 484000 }, { x: 140, y: 322000 }, { x: 290, y: 638000 }, { x: 120, y: 276000 }, { x: 110, y: 253000 }, { x: 260, y: 754000 }, { x: 210, y: 441000 }, { x: 130, y: 377000 }, { x: 140, y: 294000 }, { x: 120, y: 288000 }, { x: 290, y: 580000 }, { x: 150, y: 330000 }, { x: 300, y: 870000 }, { x: 160, y: 448000 }, { x: 300, y: 870000 }, { x: 180, y: 432000 }, { x: 230, y: 552000 }, { x: 120, y: 240000 }, { x: 140, y: 364000 }, { x: 120, y: 324000 }, { x: 270, y: 675000 }, { x: 300, y: 690000 }, { x: 230, y: 575000 }, { x: 270, y: 756000 }, { x: 290, y: 580000 }, { x: 120, y: 348000 }, { x: 150, y: 360000 }, { x: 150, y: 360000 }, { x: 290, y: 812000 }, { x: 130, y: 260000 }]; - const default_color = "rgb(147,147,147)"; - const red = "rgb(214,11,0)"; - var ctx = document.getElementById('myChart'); - var myChart = new Chart(ctx, { - type: 'scatter', - data: { - labels: DataX, - datasets: [{ - data: DataSet, - borderWidth: 1, - label: "Veri Seti", - fill: false, - borderColor: "rgb(0,0,0)", - backgroundColor: "rgb(0,0,0)" - }, { - label: "Grafiğin", - data: DataX, - type: 'line' - }] - }, - options: { - responsive: true, - scales: { - yAxes: [{ - ticks: { - beginAtZero: true - } - }] - } - } - }); - const equation = document.getElementById("eq"); - const arrow = document.getElementById("enter"); - const body = document.body; - let input = "Placeholder text"; - convertedInput = []; - myChart.update(); - - arrow.addEventListener('click', function(event) { - input = eq.value; - console.log(input); - Input(); - }); - - function Input() { - if (checkInput()) { - body.style.backgroundColor = default_color; - for (let i = 0; i < 11; i++) { - console.log(DataY[i]); - let temp = DataX[i] * convertedInput[0]; - console.log("TEMP1" + temp); - if (convertedInput[1] == 1) temp += Number(convertedInput[2]); - else temp -= Number(convertedInput[2]); - DataY[i] = temp; - console.log(DataY[i]); - } - myChart.update(); - } else { - body.style.backgroundColor = red; - } - - function checkInput() { - let temp = input.split(""); - let xIndex = temp.indexOf("x"); - if (xIndex == -1) { - return false; - } else if (temp.indexOf("+") != -1 && temp.indexOf("-") != -1) { - return false; - } else { - let xDigits = 0; - let yDigits = 0; - let isDecimal = false; - let decimalcounter = 0; - for (let i = 0; i < xIndex; i++) { - if (temp[i] == '.') { - isDecimal = true; - continue; - } - if ((temp[i] >= '0' && temp[i] < '9') || isDecimal) { - if (isDecimal) { - decimalcounter++; - xDigits += Number(temp[i]) * Math.pow(10, -decimalcounter); - console.log("XDIGITS: " + xDigits); - } else { - xDigits += Number(temp[i]); - } - } else { - console.log("112"); - console.log(temp[i]); - return false; - } - } - isDecimal = false; - decimalcounter = 0; - for (let i = xIndex + 2; i < temp.length; i++) { - if (temp[i] == '.') { - isDecimal = true; - } else if (temp[i] >= '0' && temp[i] < '9') { - if (isDecimal) { - decimalcounter++; - yDigits += Number(temp[i]) * Math.pow(10, -decimalcounter); - } else { - yDigits = yDigits + Number(temp[i]); - } - } else { - console.log("12"); - return false; - } - } - let choice = -1; - if (temp[xIndex + 1] == '+') choice = 1; - else choice = 0; - if (xIndex == 0) xDigits = 1; - convertedInput = [xDigits, choice, yDigits]; - console.log("input" + convertedInput); - console.log("success"); - return true; - } - } - } - - -} \ No newline at end of file diff --git a/interactive-reading/dataset-graphing/index.html b/interactive-reading/dataset-graphing/index.html deleted file mode 100644 index afaada4..0000000 --- a/interactive-reading/dataset-graphing/index.html +++ /dev/null @@ -1,28 +0,0 @@ - - - - - - - - - - - - - - - - - -
-

Lütfen girdiyi mx + n şeklinde yapınız.

-
- - - -
-
- - - \ No newline at end of file diff --git a/interactive-reading/dataset-graphing/style.css b/interactive-reading/dataset-graphing/style.css deleted file mode 100644 index d75a41f..0000000 --- a/interactive-reading/dataset-graphing/style.css +++ /dev/null @@ -1,41 +0,0 @@ -body { - background-color: #e8eaf6; - position: relative; - display: flex; - transition: background-color 0.5s ease; - height: 100vh; -} - -.equation { - position: absolute; - padding: 10px; - top: 50%; - left: 75%; - transform: translate(-50%, -50%); - background-color: white; - height: 50px; - display: flex; - width: 400px; - align-items: center; - border-radius: 5px; - justify-content: space-between; - cursor: pointer; -} - -.equation input { - background: none; - border: none; - flex: 1; - height: 100%; - outline: none; - left: 30px; - position: absolute; -} - -#text { - position: absolute; - top: 275px; - font-size: 20px; - right: 250px; - font-family: Roboto; -} \ No newline at end of file diff --git a/interactive-reading/dynamic-graphing/app.js b/interactive-reading/dynamic-graphing/app.js deleted file mode 100644 index e91f2b5..0000000 --- a/interactive-reading/dynamic-graphing/app.js +++ /dev/null @@ -1,122 +0,0 @@ -window.onload = function() { - DataX = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]; - DataY = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]; - const default_color = "rgb(147,147,147)"; - const red = "rgb(214,11,0)"; - var ctx = document.getElementById('myChart'); - var myChart = new Chart(ctx, { - type: 'line', - data: { - labels: DataX, - datasets: [{ - data: DataY, - borderWidth: 1, - label: "Y", - fill: false, - borderColor: "rgb(0,0,0)", - backgroundColor: "rgb(0,0,0)" - }] - }, - options: { - responsive: false, - scales: { - yAxes: [{ - ticks: { - beginAtZero: true - } - }] - } - } - }); - const equation = document.getElementById("eq"); - const arrow = document.getElementById("enter"); - const body = document.body; - let input = "Placeholder text"; - convertedInput = []; - myChart.update(); - - arrow.addEventListener('click', function(event) { - input = eq.value; - console.log(input); - Input(); - }); - - function Input() { - if (checkInput()) { - body.style.backgroundColor = default_color; - for (let i = 0; i < 11; i++) { - console.log(DataY[i]); - let temp = DataX[i] * convertedInput[0]; - console.log("TEMP1" + temp); - if (convertedInput[1] == 1) temp += Number(convertedInput[2]); - else temp -= Number(convertedInput[2]); - DataY[i] = temp; - console.log(DataY[i]); - } - myChart.update(); - } else { - body.style.backgroundColor = red; - } - - function checkInput() { - let temp = input.split(""); - let xIndex = temp.indexOf("x"); - if (xIndex == -1) { - return false; - } else if (temp.indexOf("+") != -1 && temp.indexOf("-") != -1) { - return false; - } else { - let xDigits = 0; - let yDigits = 0; - let isDecimal = false; - let decimalcounter = 0; - for (let i = 0; i < xIndex; i++) { - if (temp[i] == '.') { - isDecimal = true; - continue; - } - if ((temp[i] >= '0' && temp[i] < '9') || isDecimal) { - if (isDecimal) { - decimalcounter++; - xDigits += Number(temp[i]) * Math.pow(10, -decimalcounter); - console.log("XDIGITS: " + xDigits); - } else { - xDigits += Number(temp[i]); - } - } else { - console.log("112"); - console.log(temp[i]); - return false; - } - } - isDecimal = false; - decimalcounter = 0; - for (let i = xIndex + 2; i < temp.length; i++) { - if (temp[i] == '.') { - isDecimal = true; - } else if (temp[i] >= '0' && temp[i] < '9') { - if (isDecimal) { - decimalcounter++; - yDigits += Number(temp[i]) * Math.pow(10, -decimalcounter); - } else { - yDigits = yDigits + Number(temp[i]); - } - } else { - console.log("12"); - return false; - } - } - let choice = -1; - if (temp[xIndex + 1] == '+') choice = 1; - else choice = 0; - if (xIndex == 0) xDigits = 1; - convertedInput = [xDigits, choice, yDigits]; - console.log("input" + convertedInput); - console.log("success"); - return true; - } - } - } - - -} \ No newline at end of file diff --git a/interactive-reading/dynamic-graphing/index.html b/interactive-reading/dynamic-graphing/index.html deleted file mode 100644 index fe55603..0000000 --- a/interactive-reading/dynamic-graphing/index.html +++ /dev/null @@ -1,28 +0,0 @@ - - - - - - - - - - - - - - - - - - - - \ No newline at end of file diff --git a/interactive-reading/dynamic-graphing/style.css b/interactive-reading/dynamic-graphing/style.css deleted file mode 100644 index 3484b1e..0000000 --- a/interactive-reading/dynamic-graphing/style.css +++ /dev/null @@ -1,48 +0,0 @@ -.equation { - position: absolute; - padding: 10px; - top: 50%; - left: 75%; - transform: translate(-50%, -50%); - background-color: white; - height: 50px; - display: flex; - width: 400px; - align-items: center; - border-radius: 5px; - justify-content: space-between; - cursor: pointer; -} - -.equation input { - background: none; - border: none; - flex: 1; - height: 100%; - outline: none; - left: 30px; - position: absolute; -} - -#myChart { - position: absolute; - padding: 10px; - top: 10%; - left: 15%; - background-color: white; - height: min(60vh, 60vw); - display: flex; - width: min(60vh, 60vw); - align-items: center; - border-radius: 5px; - justify-content: space-between; - cursor: pointer; -} - -#text { - position: absolute; - top: 275px; - font-size: 20px; - right: 250px; - font-family: Roboto; -} \ No newline at end of file diff --git a/interactive-reading/index.html b/interactive-reading/index.html deleted file mode 100644 index a9de7ad..0000000 --- a/interactive-reading/index.html +++ /dev/null @@ -1,237 +0,0 @@ - - - - - - - Piko - - - - - - - - - - - - - -
- -
-
- -

Yapay Zeka İnteraktif Sunum

-
-
-
- -

Karakterleri Tanıyalım

-
-
-
- Alberto Görseli -

Alberto meraklı, bilgili bir Felsefe öğretmenidir. Yeni şeyler öğrenmeye bayılır. Seni dikkatle dinler, en ince ayrıntılarına kadar durumu öğrenmeye çalışır. Son günlerde popüler olan sesli asistanlardan birine kendisi de sahiptir. Onun aklını karıştırmak için elinden geleni yapacaktır.

-
-
-
-
- Piko Görseli -

- Merhaba, ben Piko size özel tasarlanmış sesli asistanım. Aslında çok bilmiş biriyim. Bana soracağın her soruyu dikkatle dinlerim ve en uygun cevabı sana iletirim. Bu arada bir sıkıntın olursa bana gelebilirsin. İnsan psikolojisinden de çok iyi anlarım. -

-
-
-
-
- Bean Görseli -

- Bean genelde sessiz duran fakat her zaman yanı başımızda duran kahve bardağımızdır. Morali bozuk Alberto’ yu görmeye dayanamaz ve bir anda dilegelir! -

-
-
-
- - -
-
-

Hikayemiz Başlıyor

-
-
-
- -

Alberto işten gelmiş telefonuyla yeni bir ev arıyordu. Bean her zamanki yerinde mutfak dolabında doldurulmayı bekliyordu. Piko ise o sıralarda uyku modundaydı. Alberto İşini bıraktı ve mutfağa yönelip Bean’ i yerinden aldı kahvesini doldurdu masanın kenarına bıraktı. Kendisi de sandalyesine oturdu. Canı sıkkın bir şekilde bardağa bakarken birden duyduğu ses ile irkildi. Bean’ in sesiydi bu. “Alberto” dedi Bean.

-
-
-
-
- -

Duydukları ile adeta buz kesmişti Alberto fakat sakinlikle cevap verdi. - Alberto: Ev sahibimin evi satması nedeniyle yeni bir eve ihtiyacım var. Bu yüzden bir ev bakıyorum, sence bir ev alırken dikkat edilmesi gereken unsurlar nelerdir? - Piko: Bir evin öncelikle senin için yeterli alana sahip olup olmaması önemlidir. Bunun yanında bütçene uygunluğu da kriterlerinden olmalıdır. Ayrıca alacağın evin iş ve ulaşım araçlarına uzaklığı da göz önüne almalısın. Her gün gideceğin işine evin ne kadar yakın olursa o kadar vakit kazanırsın. - Alberto: Teşekkür ederim Piko. Şimdi sırada uzun bir internet araması var. Umarım o kadar evden bir tane bulabilirim. Tabii bir de tek tek bunlar ile ilgili bilgi toplamak... -

-
-
-
-
- -

Piko: Şehirdeki tüm binaları ve konumlarını biliyorum. İnternetten sana uygun olacağını düşündüğüm birkaçını bulmak benim için kolay bir iş. Ben hemen gerekli verileri toplayarak dönüyorum. - Piko birçok ev bulur. - Piko: Alberto! İstemeyeceğin kadar ev buldum sana! - Alberto: Ben de bundan korkuyordum, hepsini nasıl inceleyeceğim? - Piko: Bu verilerle daha kolay incelemek için grafiklerle düzenleyebilirim. - -

-
-
-
- - - -
-
-

Lineer Problemlere Giriş

-
-
-
- -

Piko:Değerinden fazla para ödememek adına aklındaki ev boyutu için ideal bir fiyat belirlemek önemlidir. Bunu sana sağladığım grafiklerle nasıl hesaplarız inceleyelim. Öncelikle lütfen yandaki ev fiyatları/metrekare grafiğini incele.

- -
-
-
-
- -

Alberto: Bu grafik bana ne sağlıyor?

- - -
-
-
-
- -

Piko: İdeal bir fiyat belirlemek için verinin sınırları içerisinde verilen bir ev boyutu girdisi için ortalama bir fiyat hesaplıyor olabilmemiz gerekiyor. Bunun için geliştirilmiş çeşitli matematiksel formüller ve yollar var, bu - yolları incelemeden önce anlayışını kuvvetlendirmek adına grafikler ve koordinat sistemini hatırlayalım.

- - -
-
-
-
- -

Piko: Eğer ay sayısını Y ile, birikimi X ile gösterirsek yukarıdaki grafiği
X = Y *200
denklemi ile ifade edebiliriz. Fazla soyut kalmaması adına denklemi grafikteki değerlerle çözelim: -

- - -
-
-
-
- -

Alberto: Anlıyorum. Eğer veriyi bu şekilde bir denklem ile ifade edersek bize verilmeyen örnekleri tahmin etme şansımız olur! Tıpkı az önce bize verilmeyen 11. ayı tahmin ettiğimiz gibi. -

- - -
-
-
-
-
- - - -
-
-

Yapay Nöronlar

-
-
-
- -

P: Şu ana kadar, evlerin metrekare ile fiyatlarını tahmin konusunda başarı ile ilerledik. Fakat evlerin Alberto’ nun işine olan uzaklığı konusunda sorun yaşadık. Çözümden önce insanların günlük hayatlarında problemlerini nasıl çözdüklerini sormak istiyorum. - A: Biz insanlar problemleri akıl ve mantık ile çözeriz bu işlerlerse beyinde gerçekleşir. Fakat daha detaylı anlatmam gerekirse, tüm bu olaylar sinir sistemimizde nöronlar yardımıyla çözülür. -

-
-
-
-
- -

P: Söylediklerine katılıyorum. Fakat nöron deyip geçmemeliyiz. Çünkü çözümü anlamak için öncelikle biyolojik nöronları anlamalıyız. - Nöronlar, duyu organları ile elde edilen verileri alıp elektriksel durumlarına göre değerlendirerek sonuçlar üretir. Tek bir işlemi yapmak için bile birçok nöron gerekmesidir. - Nöronlar, vücutta elektrokimyasal sinyalleri alan ve ileten özelleşmiş hücrelerdir. Nöronlar üç temel bölümden oluşur: dendrit, hücre gövdesi ve akson. - Neden öncelikle nöronları anlamalıyız ? - İlk yapay sinir ağları tasarlanırken, daha yapay zeka kavramı ortaya çıkmamıştı! Yapay sinir ağları nörobilimcilerin insan beyninin çalışma ve karar verme aşamalarının şema edilmesi ve modellenmesi sonucu ortaya çıkmıştır. -

-
-
-
-
- -

P: Biliyor muydunuz? Bende yapay sinir ağları kullanılarak üretildiğim için insanların günlük hayat problemleri ile uyumlu çalışabiliyorum. Peki bu sistem nasıl çalışıyor? - Bunları bir arada çalışan yapay nöronlara borçluyum. Her yapay nöronum üzerine gelen veriyi yine onunla gelen eğitim sürecinden kalmış ağırlık ile toplar ve aktivasyon fonksiyonuna girer ve fonksiyonun sonucuna göre yeni veri oluşturup sonraki katmana iletir. -

-
-
-
-
- -

P: Konuşmamın arasında az önce ağırlıklardan bahsetmiştim fakat bunu daha detaylı anlatmalıyım. Benim tepki ve cevaplarımın oluşması iki aşamadan oluşuyor. İlk olarak eğitim denen aşama ile ön bilgilere sahip oluyorum bunu sizin bebekliğinize benzetebiliriz. - Sizde küçükken sıcak bir şeye dokunup eliniz yandıktan sonra sıcak cisimlere dokunmanın tehlikeli olabileceğini öğrendiniz. Umarım buna gerek kalmamıştır. Fakat bende neyin doğru ya da yanlış olduğunu eğitim sürecinde öğreniyorum. - Eğitim sürecinde ağırlıklar en doğru sonuca yaklaşmak için sürekli değişiyor. Bazen sadece ağırlıklar da yeterli olmuyor ve burada sapma değerleri söz konusu oluyor. Sonucun doğru şekilde çıkması için bazı nöronlar üzerine gelen veriye sapma değerleri ekleyebiliyor. - Bu değerlerin uygun sonuçlar verebilmesi eğitim sürecinde sahip olduğum verilere bağlıdır. -

-
-
-
-
-
- - - -
-
-

Acısıyla Tatlısıyla Yapay Zeka

-
-
-
- -

A: Yapay zeka harika! Bu alanda nasıl kendimi geliştirebilirim? - P: Yapay zeka için verilerin öneminden bahsetmiştik. Sen de veri bilimi ile ilgilenebilirsin. Veriler tarih ilerledikçe hızla artmakta. Bu artışın genel nedeni endüstri ve internet. Üretimin kolaylaşması ve paylaşımın artması ile üretilen veride artıyor. - Veriler arttıkça daha karmaşık hale geliyor. Devlet arşivleri, internet vb. Sağlayıcılardan elde ettiğimiz veriyi işlemekse zorlaşıyor. Bu yüzden yeni bir meslek bile oluştu “Veri Bilimci”. - Önceki durumlardan da öğrendiğimiz gibi iyi bir yapay zeka eğitmek için bolca veriye ihtiyacımız vardı. Fakat bu verilerin doğruluğu ve alakası da çok önemliydi. -

-
-
-
- - - -
-

İşte Oyun Alanı

-
- -
- -
- - - - - - - - - \ No newline at end of file diff --git a/interactive-reading/linear-regression/index.html b/interactive-reading/linear-regression/index.html deleted file mode 100644 index 5bc9bab..0000000 --- a/interactive-reading/linear-regression/index.html +++ /dev/null @@ -1,23 +0,0 @@ - - - - - - - - - - - -
-
-

Yukarıdaki alanın üzerine tıklayarak, iki boyutlu düzlemde yeni veri noktaları oluşturabilirsin.

-

Öğrenme Hızı:

-
- - - \ No newline at end of file diff --git a/interactive-reading/linear-regression/sketch.js b/interactive-reading/linear-regression/sketch.js deleted file mode 100644 index 87c4764..0000000 --- a/interactive-reading/linear-regression/sketch.js +++ /dev/null @@ -1,132 +0,0 @@ -// Daniel Shiffman -// Nature of Code: Intelligence and Learning -// https://github.com/shiffman/NOC-S17-2-Intelligence-Learning - -// The data we are loading -var training; - -// What is the learning rate -// This could change over time! -// var learning_rate = 0.1; -var lrSlider; - -// Values of b and m for linear regression -// y = mx + b (formula for a line) -var b = 0; -var m = 0; - -// Current number of iterations through data -var iterations = 0; -// How many iterations should we do total -var totalIterations = 10; -// Which sample are we on -var index = 0; - - -// A function to calculate the "loss" -// Formula for doing this is "sum of squared errors" -function calculateError() { - // Start sum at 0 - var sum = 0; - // For each sample - for (var i = 0; i < training.length; i++) { - // This is the guess based on the line - var guess = m * training[i].x + b; - // The error is the guess minus the actual temperature - var error = guess - training[i].y; - // Add up the error squared - sum += error * error; - } - - // Divide by total data points to average - var avg = sum / training.length; - return avg; -} - -function setup() { - var canvas = createCanvas(600, 600); - canvas.parent('#canvascontainer'); - canvas.mousePressed(addPoints); - lrSlider = select('#lrslider'); - - // Data will be entered by user clicking - training = []; -} - -function addPoints() { - // Add a data point - training.push(createVector(mouseX / width, mouseY / height)); -} - -function draw() { - var learning_rate = lrSlider.value(); - select('#lr').html(learning_rate); - background(200); - - // Calculate the overall error - var error = calculateError(); - - // Draw everything - drawPoints(); - drawLine(); - - // if (training.length > 0) { - // // One data point at a time - // // Get the x and y values from the data - // var x = training[index].x; - // var y = training[index].y; - // // Make a prediction / guess - // var yguess = m * x + b; - // - // // Difference between actual value and prediction is error - // var error = y - yguess; - // - // // change b and m in direction of error - // var deltaB = error * learning_rate; - // var deltaM = x * error * learning_rate; - // b += deltaB; - // m += deltaM; - // - // // Go to the next sample - // index++; - // } - // - // // Finish all the training - // if (index == training.length) { - // index = 0; - // } - - // Do an entire run through all the data - var deltaB = 0; - var deltaM = 0; - for (var i = 0; i < training.length; i++) { - var x = training[i].x; - var y = training[i].y; - var yguess = m * x + b; - var error = y - yguess; - deltaB += (2 / training.length) * error; - deltaM += (2 / training.length) * x * error; - } - b += (deltaB * learning_rate); - m += (deltaM * learning_rate); - -} - -// Draw the current line -function drawLine() { - // Draw a line between any two points (use min and max x) - var x1 = 0; - var y1 = m * x1 + b; - var x2 = 1; - var y2 = m * x2 + b; - line(x1 * width, y1 * height, x2 * width, y2 * height); -} - -// Plot all the training data -function drawPoints() { - stroke(0); - fill(0); - for (var i = 0; i < training.length; i++) { - ellipse(training[i].x * width, training[i].y * height, 4, 4); - } -} diff --git a/interactive-reading/style.css b/interactive-reading/style.css deleted file mode 100644 index c79b450..0000000 --- a/interactive-reading/style.css +++ /dev/null @@ -1,159 +0,0 @@ -@import url('https://fonts.googleapis.com/css2?family=Neucha&display=swap'); -html * { - font-family: 'Neucha', cursive; -} - -.Dialogue { - display: grid; - grid-template-columns: 50% 50%; - grid-template-rows: 50% 50%; - grid-gap: 50px; - grid-template-areas: "image top-right" "image bottom-right"; -} - -.Image { - grid-column-start: 1; - grid-column-end: 2; - grid-row-start: 1; - grid-row-end: 2; - grid-area: image; - position: relative; - bottom: 50px; - left: -0px; - width: 150%; - height: 50%; - align-self: center; -} - -.Text { - grid-area: bottom-right; - font-size: 20px; - position: relative; - top: 3px; - left: 50px; - text-align: left; - z-index: -10; -} - -.Character { - grid-area: top-right; - position: relative; - top: 20px; - right: 30px; -} - -.alberto { - position: absolute; - z-index: 10; - width: 50%; - height: 50%; - right: -250px; - top: -15px; -} - -span { - opacity: 0; - transform: translateY(50px); - display: inline-block; - transition: all 0.5s ease; -} - -span.fade { - opacity: 1; -} - -.btn { - opacity: 0; - color: white; - text-decoration: none; - text-transform: uppercase; - position: relative; - display: block; - transition: 1s all ease; - border: 2px solid #ff7675; - text-align: center; - width: 100px; - height: 50px; -} - -.btn::before { - background: #ff7675; - transform: translate(-50% -50%) rotate(-45deg); - content: ""; - width: 100%; - height: 100%; - position: absolute; - top: -250%; - left: 50%; - z-index: -1; - transition: all 0.6s ease; -} - -#btn1::before { - width: 100%; - height: 0; - transform: translate(-50%, -50%) rotate(-45deg); -} - -#btn1:hover::before { - height: 380%; -} - -.birikim { - grid-column-start: 1; - grid-column-end: 2; - grid-row-start: 1; - grid-row-end: 2; - grid-area: image; - position: relative; - bottom: 150px; - left: -0px; - left: -175px; - width: 800px; - height: 400px; - align-self: center; -} -#image6{ - position: relative; - float: left; - bottom:125px; - right:150px ; -} -#image7{ - position: relative; - float: left; - width: 500px; - height: 500px; - right: 150px; - top: 40px; -} -#image8{ - position:relative; - float:left; - right:150px; - bottom:130px; -} -.IntroductionText{ - grid-area: bottom-right; - font-size: 30px; - position: relative; - top: 120px; - left: 50px; - text-align: left; - z-index: -10; -} - -.storyImage{ - position: relative; - float: left; - width: 680px; - height: 420px; - right:100px; - bottom: 30px; -} -.storyText{ - grid-area: bottom-right; - position: relative; - left: 100px; - font-size: 24px; -} diff --git a/interactive-reading/libraries/p5/p5.dom.js b/libraries/p5/p5.dom.js similarity index 100% rename from interactive-reading/libraries/p5/p5.dom.js rename to libraries/p5/p5.dom.js diff --git a/interactive-reading/libraries/p5/p5.js b/libraries/p5/p5.js similarity index 100% rename from interactive-reading/libraries/p5/p5.js rename to libraries/p5/p5.js diff --git a/interactive-reading/libraries/p5/p5.sound.js b/libraries/p5/p5.sound.js similarity index 100% rename from interactive-reading/libraries/p5/p5.sound.js rename to libraries/p5/p5.sound.js diff --git a/interactive-reading/libraries/reveal/moon.css b/libraries/reveal/moon.css similarity index 100% rename from interactive-reading/libraries/reveal/moon.css rename to libraries/reveal/moon.css diff --git a/interactive-reading/libraries/reveal/reset.css b/libraries/reveal/reset.css similarity index 100% rename from interactive-reading/libraries/reveal/reset.css rename to libraries/reveal/reset.css diff --git a/interactive-reading/libraries/reveal/reveal.css b/libraries/reveal/reveal.css similarity index 100% rename from interactive-reading/libraries/reveal/reveal.css rename to libraries/reveal/reveal.css diff --git a/interactive-reading/libraries/reveal/reveal.esm.js b/libraries/reveal/reveal.esm.js similarity index 100% rename from interactive-reading/libraries/reveal/reveal.esm.js rename to libraries/reveal/reveal.esm.js diff --git a/interactive-reading/libraries/reveal/reveal.js b/libraries/reveal/reveal.js similarity index 100% rename from interactive-reading/libraries/reveal/reveal.js rename to libraries/reveal/reveal.js diff --git a/style.css b/style.css new file mode 100644 index 0000000..92a6d3e --- /dev/null +++ b/style.css @@ -0,0 +1,399 @@ +@import url('https://fonts.googleapis.com/css2?family=Neucha&display=swap'); +html * { + font-family: 'Neucha', cursive; +} + +#img1{ + width:900px ; + height:550px ; +} +#img2{ + width: 300px; + height: 350px; +} +#img3{ + max-width: 500px; + max-height: 700px; +} +#img4{ + width: 256px; + height: 256px; +} +#img5{ + width: 125px; + height: 125px; +} + +.container{ + display:flex; +} +.reveal img{ + margin:0px; + padding: 0px; +} +.Introduction{ + display: flex; +} +.Text { + font-size: 28px; + text-align: center; +} +.iText { + display: inline-block; + max-width: 500px; + margin-top:150px; +} +.sText { + display: inline-block; + max-width: 400px; + position: absolute; + font-size: 22px; + top: 370px; + left: 600px; + +} +.clearfix::after { + content: ""; + clear: both; + display: table; +} + +.scene{ + display: block; + border-style: solid; + border-color: red; + width: 100%; + height: 100%; + margin:auto; +} +.meryemDesk{ + position: absolute; + display: block; + left: 0px; + top: 150px; +} +.meryemPros{ + position: absolute; + display: block; + left: -181px; + top: 185px; +} +.meryemDeskActivation{ + position: absolute; + display: block; + left: -215px; + top: 150px; +} +.meryemStraight{ + position: absolute; + display: inline-block; + top: 106px; + left: -342px; +} +.projection{ + width: 85%; + position: absolute; + top: -19px; + left: -58px; +} +.projectionImage{ + width:300px ; + height: 160px; + position: relative; + display: inline-block; + top: -401px; + left: -10px; +} +.beanDesk{ + top: 372px; + display: block; + position: absolute; + left: 20px; +} +.beanPros{ + top: 395px; + display: block; + position: absolute; + left: 799px; +} +.beanDeskActivation{ + top: 372px; + display: block; + position: absolute; + left: -195px; +} +.box{ + display: inline-block; + position: absolute; + max width:250px; + max height:250px; + background:#fff; + border: solid black; + border-color: black; +} +.box2{ + width:350px; + border-width: 3px 3px 5px 5px; + border-radius:4% 95% 6% 95%/95% 4% 92% 5%; + transform: rotate(-2deg); +} +.evenboxinner{ + transform: rotate(2deg); + margin:10px; + padding:0 5px; + float:right; + background:#ddd; + border:1px solid #222; + box-shadow:3px 3px 0 #222; +} + +.table{ + position: absolute; + left: 678px; + top: 460px; +} +.tableActivation{ + position: absolute; + left: 350px; + top: 460px; +} +.piko{ + position: absolute; + left: 692px; + top: 380px; +} +.pikoActivation{ + position: absolute; + left: 480px; + top: 380px; +} +.sPrimary{ + font-size: 16px; +} +.activationImage{ + width: 500px; + position: absolute; + right: -199px; + top: 137px; + +} +#s1{ + left: 280px; + top: 240px; +} +#s2{ + left: 150px; + top: 80px; +} +#s3{ + left: 647px; + top: 159px; +} +#s4{ + left: 260px; + top: 254px; +} +#s5{ + left: 740px; + top: 180px; +} +#s6{ + left: 235px; + top: 215px; +} +#s7{ + left: 607px; + top: 283px; +} +#s8{ + left: 705px; + top: 91px; +} +#s9{ + left: 229px; + top: 188px; +} +#s10{ + left: 630px; + top: 24px; +} +#s11{ + left: 789px; + top: 226px; +} +#s12{ + left: 648px; + top: 95px; +} +#s13{ + left: 789px; + top: 226px; +} +#s14{ + left: 648px; + top: 95px; +} +#s15{ + left: 789px; + top: 226px; +} +#s16{ + left: 803px; + top: 175px; +} +#s17{ + left: 203px; + top: 71px; +} +#s18{ + left: 146px; + top: 232px; +} +#s19{ + left: 23px; + top: 160px; +} +#s20{ + left: 149px; + top: 276px; +} +#s21{ + left: 199px; + top: 41px; +} +#s22{ + left: 12px; + top: 205px; +} +#s23{ + left: 146px; + top: 355px; +} +#s24{ + left: 199px; + top: 67px; +} +#s25{ + left: 42px; + top: 235px; +} +#s26{ + left: 206px; + top: 51px; +} +#s27{ + left: 12px; + top: 235px; +} +#s28{ + left: 146px; + top: 355px; +} +#s29{ + left: 152px; + top: 236px; +} +#s30{ + left: -14px; + top: 41px; +} +#s31{ + left: 232px; + top: 158px; +} +#s32{ + left: 149px; + top: 276px; +} +#s33{ + left: 261px; + top: 22px; +} +#s34{ + left: 12px; + top: 203px; +} +#s35{ + left: 153px; + top: 320px; +} +#s36{ + left: 261px; + top: 53px; +} +#s37{ + left: 12px; + top: 203px; +} +#s38{ + left: 153px; + top: 320px; +} +#s39{ + left: 17px; + top: 190px; +} +#s40{ + left: 146px; + top: 301px; +} +#s41{ + left: 50px; + top: 53px; +} +#s42{ + left: 408px; + top: 118px; +} +#s43{ + left: 337px; + top: 309px; +} +#s44{ + left: 592px; + top: 91px; +} +#s45{ + left: 779px; + top: 199px; +} +#s46{ + left: 370px; + top: 260px; +} +#s47{ + left: 40px; + top: 150px; +} +#s48{ + left: 370px; + top: 238px; +} +#s49{ + left: -18px; + top: 52px; +} +#s50{ + left: 420px; + top: 125px; +} +#s51{ + left: 71px; + top: 267px; +} +#s52{ + left: 367px; + top: 367px; +} +#s53{ + left: 480px; + top: 60px; +} +#s54{ + left: 70px; + top: 210px; +} +#s55{ + left: 355px; + top: 320px; +}