D K
Shin Laboratory
2011 Press
Conference
Computer
scientists often look for good computing problems and try to discover a
solution to such problems. One may ask, ¡°What is a good computing problem? What
criteria are used?¡± Computer scientists say there is a set of criteria for
selecting a good computing problem. The criteria are (1) a time-consuming
operation and (2) a frequently used operation. Thus, sorting is a very good
problem, because the sorting operation is time consuming as well as frequently
used. Massive cross-referencing or join database operation is another good
problem because it also meets the criteria. Data compression/decompression is
definitely a good problem as well, and Huffman made a great contribution by
finding the best solution for compressing data to its smallest size before data
is stored or sent to another location. Searching is yet another good computing
problem since a binary search in a plain sorted list is inefficient.
Let¡¯s
take, for instance, several million people¡¯s identification numbers (e.g., SSN
in the U.S.). Finding a method to search such data fast is a good problem in
computing that needs solved. Logically, most everyone would think that the
several million ID numbers should be organized first in some way to be searched
through fast. The organized data, in other words, should be sorted. Thus,
sorting must be performed on such a huge amount of data prior to searching
quickly for data retrieval.
Hence,
this time-consuming and frequently used operation of sorting and searching has
attracted computer scientists¡¯ attention, including my own. Many have tried to
provide a computing solution for the problem. If a solution is mathematically
proven to be the best one for this good computing problem in terms of speed,
the best solution will be taught to students as a theory and used in computer
applications.
Let¡¯s
watch my video, ¡°Show how Shin sort works.¡± The video will show what kind of
solution I have provided for sorting, a time-consuming and frequently used
operation.
Criteria used in
selecting a good problem
¡Ü Time-consuming
operation
¡Ü Frequently
used operation
What are good
computing problems?
¡Ü Examples: (1)
Sorting
(2)
Massive Cross-Referencing
(3)
Data compression
(4)
Searching in a unique sorted list
WWW.DKSHIN.COM
displays most of the
work I
accomplished in computer science.
¡Ü Put
all drafts and documents that were made in the process of my research on the Web
site.
¡Ü Let
papers be shown, as they are for genealogy and proofs.
¡Ü Allow
all papers on the Web site to be downloaded to any library in the world for
future research.
¡Ü Plan
to produce DVD for my lecture series of computational theories.
¡Ü Let
video lectures on the Web site be free – but the DVD will cost some for its
distribution.
Produce educational
DVDs.
¡Ü Plan
to put lectures in DVDs to be sold with textbooks or separately.
¡Ü Explain
principles in computer science in the DVDs for students to understand them.
¡Ü Plan
to produce a DVD for sorting and searching. The DVD will not only include Shin
sort, but also other sorting methods.
¡Ü Plan to
produce a DVD for the theory of massive cross-referencing, and join database
operations also will be explained. My video lecture will show how my method
efficiently filters unnecessary data.
¡Ü Plan
to produce a DVD for hashing and hash methods.
¡Ü Plan
to produce a DVD for phenomenon of relatively good solutions. The phenomenon
will be explained using my survey of hash methods.
¡Ü The
DVD productions are all based on response and necessity.
Dr. Dong-Keun
Shin writes textbooks.
¡Ü Want
to include computer scientists who must be acknowledged in my book.
¡Ü Avoid
regionalism in acknowledgments.
¡Ü My
acknowledgments are strictly based on theory and merit.
¡Ü Draw
more figures for the books. Explain ideas with as many figures as possible.
¡Ü Will
include figures, programs and pseudo-codes for my ideas.
¡Ü Compile
and test program before it is illustrated in book.
Current Problems
and Needs
¡Ü Many
academic circles to be dealt with. And they are not easy to lead because of
their acquired prestige.
¡Ü They
are being silent with no dispute and waiting until enough time passes by.
¡Ü Need
a position to have more power and authority.
¡Ü More
influence and more direction should be made throughout the world, but lack of
proper channel.
¡Ü Need
more financial support for lab facilities and expenses.
¡Ü Need
a distributor to promote S3 Database system.
¡Ü Need
USA¡¯s support for writing textbooks and making video lectures.
¡Ü Need
to have national endorsement from every country to lead people in computer
science and their promise to purchase my books and videos for their students¡¯
education.
Questions and
Answers
¡Ü Is
there any objection to my claim of having made the greatest contribution to
computer science?
¡Ü Is
there any problem in my theories?
¡Ü Is
there anyone who opposes my leadership of computer science and related
technologies?
¡Ü For a
valid objection, one must name a computer scientist who has made a greater achievement
than I have.
Conclusion
¡Ü Let¡¯s
wait for one year and hear responses regarding my leadership of computer
science and related technologies.
¡Ü Left
with only two options: to compete with me or to follow me.
¡Ü The
world will see my fight to the finish, and the fight is entirely based on
contribution and merit.
¡Ü The
competition to be the best computer scientist should be fair and worldwide to
make it a good lesson for future researchers and students.
Quote
Jesus called
the Twelve and said, ¡°If anyone wants to be first, he must be the very last,
and the servant of all.¡±
Mark 9:35