This document provides a visual proof technique for topology problems using 2D diagrams to represent 2D surfaces in 3D worlds. It demonstrates how to construct common topological objects like the circular strip, Mobius strip, sphere, torus, and Klein bottle. It also discusses applications in fields like mechanical design, radio waves, and robotics. The author believes this visual proof technique can prove all topology problems and encourages sharing his work to spread his ideas.
My name is Elena Long. I am associated with matlabassignmentexperts.com as an Matlab Assignment help expert for the past 4 years and have been helping students with their assignments. I have a Ph.D. in Mechanical Engineering, from McGill University, Canada.
Using my BSnet deep learnin network, each neuron is designed not to overfit. It achieves this by concatenating the positive and negative inputs so that it becomes more separable in high dimension space. This allows it to be used for general purpose classification problems such as MNIST dataset to recognize handwriting number digits. BSnet is based on the principles of Boolean algebra and monotone circuit. Using the same principles, I also design BSautonet autoencoder, that can be used to denoise image, learn embeddings and unsupervised learning.
This powerpoint gives a technique to approximate (relaxation) discrete Markov Random Field (MRF) using convex programming. This approximated MRF can be used to approximate NP problem. This also proves that NP is not equal P because the MRF convex programming and the approximate MRF convex programming are not the same with removal of some product terms.
kung fu Computer Science, Geometric complexity theory
NP vs P Proof using Deterministic Finite AutomataSing Kuang Tan
Prove that Clique problem is NP and cannot be reduced to P because the Deterministic Finite Automata of the Clique problem has exponential number of states. We can use the same concept to prove that NP is not equal to P using Turing Machine. We figured out a way to unify Mathematics. This proof is for those Theoretical Computing guys who do not know Boolean algebra but know Turing Machine. Kung fu computer science, Geometric complexity theory
Use Inductive or Deductive Logic to solve NP vs P?Sing Kuang Tan
Use Inductive or Deductive Logic to solve NP vs P? I use circuit complexity and deductive logic to solve NP vs P. Kung fu computer science, Geometric complexity theory
Simplify a Clique Problem Boolean algebra by factorization. Show that Clique Problem is Non-Deterministic Polynomial Time (NP) and cannot be simplified to Polynomial Time (P). Kung Fu Computer Science, Geometric complexity theory
Beyond Shannon, Sipser and Razborov; Solve Clique Problem like an Electronic ...Sing Kuang Tan
Convert any Boolean algebra into monotone circuit and use that to prove that NP is not equal to P as monotone circuit cannot solve Clique problem in Polynomial time complexity. NP vs P is a Millennium Prize problem. Kung Fu Computer Science, Geometric complexity theory
A Weird Soviet Method to Partially Solve the Perebor ProblemSing Kuang Tan
Monotone Circuit can implement an algorithm to run Non-Deterministic Polynomial time complexity (NP) problem in Polynomial time complexity (P). I developed a method to implement all algorithms without "Not" operations. Using this information, I manage to prove that NP is not equal to P. Kung Fu Computer Science, Geometric complexity theory
My name is Elena Long. I am associated with matlabassignmentexperts.com as an Matlab Assignment help expert for the past 4 years and have been helping students with their assignments. I have a Ph.D. in Mechanical Engineering, from McGill University, Canada.
Using my BSnet deep learnin network, each neuron is designed not to overfit. It achieves this by concatenating the positive and negative inputs so that it becomes more separable in high dimension space. This allows it to be used for general purpose classification problems such as MNIST dataset to recognize handwriting number digits. BSnet is based on the principles of Boolean algebra and monotone circuit. Using the same principles, I also design BSautonet autoencoder, that can be used to denoise image, learn embeddings and unsupervised learning.
This powerpoint gives a technique to approximate (relaxation) discrete Markov Random Field (MRF) using convex programming. This approximated MRF can be used to approximate NP problem. This also proves that NP is not equal P because the MRF convex programming and the approximate MRF convex programming are not the same with removal of some product terms.
kung fu Computer Science, Geometric complexity theory
NP vs P Proof using Deterministic Finite AutomataSing Kuang Tan
Prove that Clique problem is NP and cannot be reduced to P because the Deterministic Finite Automata of the Clique problem has exponential number of states. We can use the same concept to prove that NP is not equal to P using Turing Machine. We figured out a way to unify Mathematics. This proof is for those Theoretical Computing guys who do not know Boolean algebra but know Turing Machine. Kung fu computer science, Geometric complexity theory
Use Inductive or Deductive Logic to solve NP vs P?Sing Kuang Tan
Use Inductive or Deductive Logic to solve NP vs P? I use circuit complexity and deductive logic to solve NP vs P. Kung fu computer science, Geometric complexity theory
Simplify a Clique Problem Boolean algebra by factorization. Show that Clique Problem is Non-Deterministic Polynomial Time (NP) and cannot be simplified to Polynomial Time (P). Kung Fu Computer Science, Geometric complexity theory
Beyond Shannon, Sipser and Razborov; Solve Clique Problem like an Electronic ...Sing Kuang Tan
Convert any Boolean algebra into monotone circuit and use that to prove that NP is not equal to P as monotone circuit cannot solve Clique problem in Polynomial time complexity. NP vs P is a Millennium Prize problem. Kung Fu Computer Science, Geometric complexity theory
A Weird Soviet Method to Partially Solve the Perebor ProblemSing Kuang Tan
Monotone Circuit can implement an algorithm to run Non-Deterministic Polynomial time complexity (NP) problem in Polynomial time complexity (P). I developed a method to implement all algorithms without "Not" operations. Using this information, I manage to prove that NP is not equal to P. Kung Fu Computer Science, Geometric complexity theory
Brief explanation of NP vs P. Prove Np not equal P using Markov Random Field ...Sing Kuang Tan
In this paper, we proved that Non-deterministic Polynomial time complexity (NP) is not equal to Polynomial time complexity (P). We developed the Boolean algebra that will infer the solution of two variables of a Non-deterministic Polynomial computation time Markov Random Field. We showed that no matter how we simplified the Boolean algebra, it can never run in Polynomial computation time (NP not equal to P). We also developed proof that all Polynomial computation time multi-layer Boolean algebra can be transformed to another Polynomial computation time multi-layer Boolean algebra where there are only 'Not' operations in the first layer. So in the process of simplifying the Boolean algebra, we only need to consider factorization operations that only assumes only 'Not' operations in the first layer. We also developed Polynomial computation time Boolean algebra for Markov Random Field Chain and 2sat problem represented in Markov Random Field form to give examples of Polynomial computation time Markov Random Field. Kung Fu Computer Science, Geometric complexity theory
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Forklift Classes Overview by Intella PartsIntella Parts
Discover the different forklift classes and their specific applications. Learn how to choose the right forklift for your needs to ensure safety, efficiency, and compliance in your operations.
For more technical information, visit our website https://intellaparts.com
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
TECHNICAL TRAINING MANUAL GENERAL FAMILIARIZATION COURSEDuvanRamosGarzon1
AIRCRAFT GENERAL
The Single Aisle is the most advanced family aircraft in service today, with fly-by-wire flight controls.
The A318, A319, A320 and A321 are twin-engine subsonic medium range aircraft.
The family offers a choice of engines
Courier management system project report.pdfKamal Acharya
It is now-a-days very important for the people to send or receive articles like imported furniture, electronic items, gifts, business goods and the like. People depend vastly on different transport systems which mostly use the manual way of receiving and delivering the articles. There is no way to track the articles till they are received and there is no way to let the customer know what happened in transit, once he booked some articles. In such a situation, we need a system which completely computerizes the cargo activities including time to time tracking of the articles sent. This need is fulfilled by Courier Management System software which is online software for the cargo management people that enables them to receive the goods from a source and send them to a required destination and track their status from time to time.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Event Management System Vb Net Project Report.pdfKamal Acharya
In present era, the scopes of information technology growing with a very fast .We do not see any are untouched from this industry. The scope of information technology has become wider includes: Business and industry. Household Business, Communication, Education, Entertainment, Science, Medicine, Engineering, Distance Learning, Weather Forecasting. Carrier Searching and so on.
My project named “Event Management System” is software that store and maintained all events coordinated in college. It also helpful to print related reports. My project will help to record the events coordinated by faculties with their Name, Event subject, date & details in an efficient & effective ways.
In my system we have to make a system by which a user can record all events coordinated by a particular faculty. In our proposed system some more featured are added which differs it from the existing system such as security.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
2. Prelude
• Computer science does not look like real mathematics
• Programming looks stupid (LOL), does not look like mathematics
• Those who do topology win prizes. LOL
• Topology looks like real mathematics
• Today I going to show you what real mathematics that I know
• Using Visual Proofs to prove well known Topology problems
• I believe my visual proof technique can prove all Topology problems
3. 2D Surface Topology in 3D world
• I going to prove Topologies made up of 2D surfaces in 3D world
• All these Topologies can be projected on a 2D diagram and solve using
the 2D diagram
4. What do a butcher and a 3D graphic designer
have in common?
Butcher 3D Graphic Designer
They experimented with Topology!!!
6. Relevant to Computer Science
Images of a car viewing at different angles lie on a manifold
Transform a boy image to a girl
image gradually lies on a
manifold
8. Glue edge a to edge b
Note that the edge directions matter
a
b
a=b
The equation
above
represent
edge a glued
to edge b
a
b
Glued these 2 edges together
9. Glue edge a to edge b
Note that the edge directions matter
a
b
a=b
The equation
above
represent
edge a glued
to edge b
And it becomes a circular strip
10. Mobius Strip
a
b
Glue edge a to edge b
Note that edge b
direction is opposite of
circular strip
a=b
The equation
above
represent
edge a glued
to edge b
a
b
Glued these 2 edges together
11. a
b
Glue edge a to edge b
Note that edge b
direction is opposite of
circular strip
a=b
The equation
above
represent
edge a glued
to edge b
And it becomes a mobius strip
16. Klein Bottle
a
b
Glue edge a to edge b
Glue edge c to edge d
Note that edge b
direction is opposite of
edge a
c d
a=b
c=d
The equation
above
represent
edge a glued
to edge b
And edge c is
glued to
edge d
Glue edge c and d Extend and rotate Extend and rotate
Poke through itself Flip edge b
inside out and
glue to edge a
1 2 3
4 5
5 steps to create a Klein bottle
17. a
b
Glue edge a to edge b
Glue edge c to edge d
Note that edge b
direction is opposite of
edge a
c d
a=b
c=d
The equation
above
represent
edge a glued
to edge b
And edge c is
glued to
edge d
Created Klein bottle
41. a
b
c d
a=b
c=d
Wrap rubber band around a
torus, the rubber band cannot
be minimized into a point
Because the edges c, d are
separated from edges a, b
49. d1
a1 b1 d2 f1
b2
e1
a2 c1 e2 f2
c2
a1=a2
b1=b2
c1=c2
d1=d2
e1=e2
f1=f2
Join the edges using the rules above,
And you will get the double torus
This is the double torus in canonical
form in 2D diagram
50. • What new topological objects can you create with my 2d square
diagram method?
• Leave your comments.
51. What is the object if you connect the edges in
this way?
a1
b2
c d
a2
b1
a1=b1
a2=b2
c=d
52. Links to my papers
● https://vixra.org/author/sing_kuang_tan
● Link to my NP vs P paper
● And Discrete Markov Random Field relaxation paper
53. About Me
● My job uses Machine Learning to solve problems
○ Like my posts or slides in LinkedIn, Twitter or Slideshare
○ Follow me on LinkedIn
■ https://www.linkedin.com/in/sing-kuang-tan-b189279/
○ Follow me on Twitter
■ https://twitter.com/Tan_Sing_Kuang
○ Send me comments through these links
● Look at my Slideshare slides
○ https://www.slideshare.net/SingKuangTan
○ https://slideplayer.com/user/21705658/
■ Implement Data Structure Fast with Python
■ Discrete Markov Random Field Relaxation
■ NP vs P Proof using Discrete Finite Automata
■ Use Inductive or Deductive Logic to solve NP vs P?
■ Kung Fu Computer Science, Clique Problem: Step by Step
■ Beyond Shannon, Sipser and Razborov; Solve Clique Problem like an Electronic Engineer
■ A weird Soviet method to partially solve the Perebor Problems
■ 8 trends in Hang Seng Index
■ 4 types of Mathematical Proofs
■ How I prove NP vs P
○ Follow me on Slideshare
54. Share my links
● I am a Small Person with Big Dreams
○ Please help me to repost my links to other platforms so that I can spread my ideas to the rest of the world
● 我人小,但因梦想而伟大。
○ 请帮我的文件链接传发到其他平台,让我的思想能传遍天下。
● Comments? Send to singkuangtan@gmail.com
● Link to my paper NP vs P paper
○ https://www.slideshare.net/SingKuangTan/brief-np-vspexplain-249524831
○ Prove Np not equal P using Markov Random Field and Boolean Algebra Simplification
○ https://vixra.org/abs/2105.0181
○ Other link
■ https://www.slideshare.net/SingKuangTan