Found 114 Results
Page 4 of 12
Page 4 of 12
Page 4 of 12
SPRING BASED ON RING MAGNET
Magnetic springs have a lot of advantages in comparison with regular steel ones: they are more durable, they save almost all of their properties and serve well for dozens of years. That means that a replacement of mechanical springs and bearings with magnetic ones will lower the consumption sufficiently, due to the larger lifespan. Consequently, it acts very positively for…
19 de July de 2021
Speculor: A Comprehensive Teleophthalmology Platform for People Centered Eyecare
There are over 240 million cases of preventable blindness globally. Many eye diseases are “silent-killers” of vision and current testing methods are often inaccessible for marginalized patients. Thus, diseases go undetected until it is too late. To combat this issue, I developed Speculor combining low-cost portable retinal imagers and smartphones with artificial intelligence algorithms. Imagers have been tested in a…
Sinking Bubbles – On the Behavior of Air Bubbles in a Vertically Oscillating Column of Liquid
We are used to bubbles rising in liquids, however, when a column of liquid is oscillated vertically, it is not always the case. Experiments have been conducted to determine the critical conditions under which such a behavior occurs. In a second part of this paper, it is shown, that the experimental results are in good agreement with an equation of…
Simulation of light propagation in an optically inhomogeneous medium
Optical inhomogeneity plays an essential role in the observation of various objects. For example, it underlies phenomena such as astronomical refraction and mirages occurrence. It is also used in optical devices: for instance, in the Luneburg lens, which is used in the radar reflector and microwave antenna. The research aim is to construct and examine the trajectory of light in…
20 de July de 2021
Sampling from a discrete probability distribution using a discrete uniform probability distribution
Define the simulation of a fair m-sided die with a fair n-sided die as a process of obtaining a random integer from interval [1,m] using a fair n-sided die. Then one can simulate a 4-sided die with a 6-sided die as follows: Roll the 6-sided die. If the outcome is between 1 and 4 inclusive, select it as the result…
16 de July de 2021
Rip Current Detection – An Orientation-aware Machine Learning Approach
A rip current is a natural phenomenon that causes numerous fatal accidents all over the world. I detect and localize rip currents with a deep neural network called Faster R-CNN. I assembled a custom database of rip currents and used transfer learning, resulting in an accuracy of 85.19% (IoU threshold: 0.5) and an AP of 0.37. In addition, I developed…
Research on Early Risk Prediction and Implementation Paths of Children with Autism Based on Affective Computing
Having participated in Adolescent Robotics Competition in which a dactylophasia robot was designed for the surdomute, which inspired us to do the study with a hope that potential risks of early childhood autism can be predicted and identified so that the autistic children will be identified, treated earlier and they will recover earlier . Beginning with the current risks the…
Remote controlled mars rover and its applications in the teaching of the mechanical, computer, and physics sciences
My aim was to build a remote-controlled mars rover based on Opportunity with similar basic functions. The construction of the whole vehicle is unique, I designed all the components myself, both mechanically and electronically, with a few exceptions eg: engines, camera… I also manufactured the whole structure, for which I chose the 3D printing technology. And I made the circuit…
Proposal for an Algorithm for Finding the Crossing Number of a Graph
The crossing number cr(G) of a graph G is the least number of edge crossings of a plane drawing of G. Determining the exact crossing number of a graph is NP-Complete. In this project, we present a highly extensible algorithm for finding the crossing number of a graph. The algorithm works incrementally, by starting with an empty graph and adding…
19 de July de 2021
Properties of possible counterexamples to the Seymour’s Second Neighborhood Conjecture
Seymour’s Second Neighborhood Conjecture states that every simple digraph without loops or two-cycles contains a vertex whose second neighborhood is at least as large as its first. In this project we show that from existence of a counterexample to Second Neighborhood Conjecture it follows that there exist strongly-connected counterexamples with both low and high density (dense and sparse graph). We…
20 de July de 2021
Page 4 of 12