This event feed aggregates content from the Research Events feeds from the Helsinki Institute for Information Technology HIIT, Aalto University Department of Computer Science, and the University of Helsinki Department of Computer Science.
-
15.08.2014 12:00–16:30
Doctoral dissertation
TUAS building (Otaniementie 17), lecture hall AS1 , Otaniemi campusMeasurement data sets of molecular biology and other experimental sciences are being collected comprehensively to openly accessible databases. This form of existing knowledge in quite complex, partly relevant and heterogeneous given that laboratories around the globe have different procedures to measure patient data. The research problem addressed in the thesis...
-
15.08.2014 10:15–11:15
HIIT seminar
Exactum B222Title: Constraint-based Causal Discovery: Conflict Resolution with Answer Set Programming
Abstract: Recent approaches to causal discovery based on Boolean satisfiability solvers have opened new opportunities to consider search spaces for causal models with both feedback cycles and unmeasured confounders. However, the available methods have so far not been able to provide a principled account of... -
15.08.2014 10:15–11:15
HIIT seminar
Kumpula, Exactum B222Title: Constraint-based Causal Discovery: Conflict Resolution with Answer Set ProgrammingAbstract: Recent approaches to causal discovery based on Boolean satisfiability solvers have opened new opportunities to consider search spaces for causal models with both feedback cycles and unmeasured confounders. However, the available methods have so far not been able to provide a... -
12.08.2014 14:00–15:00
Guest lecture
B222Abstract:
The optimization of logistics in large building complexes with many resources, such as hospitals, requires realistic facility management and planning. Current planning practices rely foremost on manual observations or coarse unverified assumptions and therefore do not properly scale or provide realistic data to inform facility planning. In this talk I will present analysis methods to extract knowledge from large...
-
Code word design for DNA computing with consideration of hybridization kinetics
Hiroaki Hata, University of Tokyo, Japan
Abstract:Further understanding of DNA hybridization kinetics has new urgency because recent DNA network systems often depends critically on hybridization rates particularly under isothermal conditions. Indeed, sequence-dependent decrease of performance for hybridization-based oligonucleotide networks has been reported, and the mechanism is still not understood....
-
11.08.2014 14:00–15:00
Guest lecture
B222Abstract:
Mobile phones are increasingly equipped with sensors, such as accelerometers, GPS receivers, proximity sensors and cameras, which can be used to sense and interpret people behaviour in real-time. Novel user-centered sensing applications can be built by exploiting the availability of these technologies. Moreover, data extracted from the sensors can also be used to model and predict people behaviour and movement...
-
11.08.2014 13:15–14:00
HIIT seminar
Aalto University, Computer Science Building, lecture hall T2Abstract:
Further understanding of DNA hybridization kinetics has new
urgency because recent DNA network systems often depends critically on
hybridization rates particularly under isothermal conditions. Indeed,
sequence-dependent decrease of performance for hybridization-based
oligonucleotide networks has been reported, and the mechanism is... -
01.08.2014 10:00–11:00
Guest lecture
A114 Exactum video , (OIH B255 f2f)Abstract: Smartphones are a pretty big deal. Many of us now begin our day with our phone’s alarm clock. On the way to work we read email while listening to music. We navigate to novel locations with instructions to turn left in 500 yards. At the end of the day, we relax by queueing up YouTube content on our phone to watch on the big screen television. All of this is done on a small...
-
30.06.2014 12:00–15:00
Defence of thesis
Exactum, Auditorium CK112, Gustaf Hällströmin katu 2b
-
30.06.2014 12:00–18:00
Doctoral dissertation
Exactum, CK112, Kumpula campusMethods for Finding Interesting Nodes in Weighted Graphs
With the increasing amount of graph-structured data available, finding interesting objects, i.e., nodes in graphs, becomes more and more important. In this thesis we focus on finding interesting nodes and sets of nodes in graphs or networks. We propose several definitions of node interestingness as well as different methods to...