Andrey Vorchik studies happiness, delivers popular science lectures, and believes that science should address social issues as well. In an interview for the Young Scientists of HSE University project, he spoke about how emotions influence decision-making, the Bermuda Triangle formed by the bathroom, refrigerator, and bed, and the ideal formula for education.
Physicist Nina Dzhanayeva, recipient of a Vladimir Potanin Foundation scholarship, focuses her research on nanophotonics. In this interview for the HSE Young Scientists project, she discusses nanowells, scientific intuition, and how physics can help in making frangipane cream puffs.
A team of Russian researchers, including scientists from HSE University–St Petersburg, has developed the first open multimodal dataset containing recordings of brain activity, heart function, and video observations to help researchers understand what happens in the human brain during deep concentration. In the future, the dataset could accelerate the development of neural interfaces, rehabilitation technologies, and AI systems. The article has been published in Scientific Data.
Kvaratskhelia A., Lazarev A. A., , in: European Chapter on Combinatorial Optimization (ECCO 2009).: Jerusalem: [б.и.], 2009. P. 13–14.
We consider the minimizing total weighted completion time in preemptive equal job length scheduling problem on a single machine with release dates. We propose a polynomial time algorithm that solves the problem. Before this paper, the problem is known to be open. ...
Lazarev A. A., , in: European Chapter on Combinatorial Optimization (ECCO 2009).: Jerusalem: [б.и.], 2009. P. 23–23.
We consider the scheduling problems α|β|Fmax: A set of n jobs J1,…,Jn with release dates r1,…,rn, processing times p1,…,pn and due dates d1,…,dn has to be scheduled on a single or many machines. The job preemption is not allowed. The goal is to find aschedule that minimizes the regular function F(C1,…,Cn), that Cj is the ...
Lazarev A. A., , in: European Chapter on Combinatorial Optimization (ECCO 2009).: Jerusalem: [б.и.], 2009. P. 13–13.
In this paper, for $NP$-hardness single and multi-machine scheduling problems with the criterion of minimization maximum lateness the metrics $\rho$ has been used. We consider some approaches finding of the approximate solution for the problems. The idea of approaches consists in construction to a initial instance $A$ such instance $B$ (with the same number of ...