membrane bending by proteins crowding

membrane bending by protein protein crowding,
https://www.nature.com/articles/ncb2561


disordered regions

Area_protein ~ R^2_G

random polymers: R_G ~ 5nm, Area_Epsin = 80 nm^2

Globular folded

Epsin, endocytic proteins are substantially disordered.

BAR domains,
 N-convex curvatures.
 I-BAR

Can IDP sense membrane curvature?

protein liquids. 3D protein fluid droplets. Eps 15, regulated by Fcho1, phase separation.

sample letters, Harvard Faculty

https://academic-appointments.fas.harvard.edu/aa-sample-visiting-scholar-offer-letter

Jacobina, Hessian, gradient, maximum, minum, saddle point

https://siegel.work/blog/TheJacobian/?foundVia=fb&fbclid=IwAR20K-qSYAtJy6Aj0GAtm1r55X734GLUDH87PVTAX-8F1JQ9rEhue-SMslk

The Jacobian matrix contains information about the local behavior of a function. The Jacobian matrix can be seen as a representation of some local factor of change. It consists of first order partial derivatives. If we take the partial derivatives from the first order partial derivatives, we get the second order partial derivatives, which are used in the Hessian matrix. The Hessian matrix is used for the Second Partial Derivative Test with which we can test, whether a point x is a local maximum, minimum or a so called saddle point .

With the Jacobian matrix we can convert from one coordinate system into another

NHANES National Youth Fitness Survey (NNYFS) 2012

https://wwwn.cdc.gov/nchs/nhanes/search/nnyfs12.aspx

graph isomorphism as encryption tool

As far as I know there is no cryptographic scheme based on Graph isomorphism. The following is the key reasons.

The security of a cryptographic scheme largely depend on one-wayness of the underlying function. For a function to be one-way it's not just need to be hard for few NP instances but must be hard for a random instance. In other words it is very easy to find problems that are hard for very instance but easy for majority of instances . Such problems may not come under P but they arn't one way functions either. One such good example is the encryption scheme based on subset-sum problem, which was eventually broken due to the above specified reason.

weighted adjacency matrix

Q: 0 means no link. but small value means a very close link.

In igraph, direction is from Column to row. The following example show arrow from 2nd and 3rd to 1st.

In Yuan, network exact control paper, the directions are from row to columns. So, is the transpose of the igraph adjacency matrix.

smoking

smoking
CDC

https://chronicdata.cdc.gov/Survey-Data/Behavioral-Risk-Factor-Data-Tobacco-Use-2010-And-P/fpp2-pp25

visualizing your code

visualizing your code
http://www.pythontutor.com/

mask RCNN

From  https://cseweb.ucsd.edu/classes/sp18/cse252C-a/CSE252C_20180509.pdf