Classic Email, Web mail application refactory for visual effects (software engineering-efficiency-UX)

We will explain this refactory proposal by taking a specific provider example. Let it be Bing.com. From that page you want to access your web mail account.

The current workflow is to click on "Sing in" Button (today over a nice "Red Robin" beautiful picture)-> Next transition is Outlook Auth -> Then you insert your account and pass -> finally you access your mail folders

What we purpose instead it is a modification of that workflow that would start with the same click on "Sing in" -> Next for the auth page, we would keep as background the main Bing picture (in this case the Red Robin) and over the auth-pop up -> (And now here comes the refactory) Once you log in -> There could be an EXTRA TRANSITION for(a)increment UX,b)do processes in background), That transition could be something like ENTERING INTO A 3D TUNNEL (gifs, canvas?), while at the sime time all email application is being loaded for when animation ends.

Candidate Technologies? JS Frameworks?

Critics are welcome!

Comments

Post a Comment

Popular posts from this blog

3D with POV-Ray, isosurfaces example

Image
POV-RAY , has been used to build an isosurface, first intend was to represent a "tainted teardrop over the floor" (a lot of work still to do). file1.pov #version 3.7; global_settings { assumed_gamma 2.2 max_trace_level 7 } #include "colors.inc" #include "textures.inc" #include "shapes.inc" #include "functions.inc" camera { location right x*image_width/image_height angle 25 look_at } light_source { colour White } light_source { colour White } light_source { colour White } background { color SkyBlue } plane { y, -2 pigment { colour rgb scale 8 } finish { ambient 0.2 diffuse 0.8 } } //f= 1 - 4*pow(x,2) - 4*pow(y,2) - 2*z + 2*pow(z,3) - pow(z,4) = 0, //olff=((x*1.618)+x)/(exp(1.618*x))-((y*1.618)+y)/exp(1.618*y) //working f=1 - 4*pow(x,2) - 4*pow(y,2) - 2*z //mine: f = 1 - 4 * 2 * exp(x) - 4*2*exp(y) - 2*z isosurface { function { 1 - 4 * 2 * exp(x) - 4*2*exp...
Read more

Algorithms: Backpack problem, Greedy , Dynamic Programming techniques (C++)

This example shows an OO approach to the backpack (rumsack) problem, it implements different techniques (greedy, dynamic programming), it also generates random items and backpack's capacity. backpack.h #ifndef BACKPACK_H_INCLUDED #define BACKPACK_H_INCLUDED #include #include #include #include using namespace std; //A backpack Item class Item { public: Item(double w, double b):_weight(w),_benefit(b){ if(_weight==0) throw -100; } virtual ~Item() {} void setWeight(double w) { _weight = w; } void setBenefit(double b) { _benefit = b;} double getRatio(){ return _benefit/_weight; } double _weight; double _benefit; double _ratio; }; class Backpack { public: Backpack(double mw) { _maxWeight = mw; _items = new vector ; _totBenefit = 0; _currentWeight = 0; } virtual ~Backpack() {} virtual void computeAddItems(vector &items) { //In this case we use raw algorithm double delt...
Read more