Học bổng toàn phần PhD ngành CS.

PhD student for Adaptive Brain Computer Interfacing (BCI) (1,0 fte)
Faculteit der Natuurwetenschappen, Wiskunde en Informatica
Maximum salary: Euro 2558,- gross/month
Vacancynumber: 62.66.08
Closing date: 31-08-2008
Job description
Research on Brain Computer Interfacing aims to use signals from the brain to control computers. Training of persons for the BCI task is complex and requires significant adaptation of the subject to the task. In the context of the Braingain project (www.nici.ru.nl/braingain/), a PhD student position is available for the development of a mutually adaptive BCI system, in which both subject and computer adapt simultaneously. The goal is to speed up the training process, to achieve a stronger BCI signal, and to be able to control more complex tasks. The PhD student will use machine-learning methods developed by Bert Kappenõ?Ts group and will validate the system in collaboration with Peter Desainõ?Ts group.
Requirements
The candidate has a Master''s degree in physics, mathematics or computer science. The candidate should be interested in machine-learning methods and algorithms.
Organization
Bert Kappenõ?Ts research group is part of the department of Biophysics of the Faculty of Science at Radboud University Nijmegen. The department is engaged in both experimental and theoretical research in the area of neuroscience and machine learning.
Website: www.ru.nl/mbphysics
Con***ions of employment
Maximum employment: 1,0
Maximum salary per month, based on fulltime employment: Euro 2558,-
The starting gross salary is õ,ơ2,000 per month and will increase to õ,ơ2,558 in the fourth year based on full-time employment.
Duration of contract: The first contract will be for 1.5 years, with possible extension by 2.5 years
Ad***ional con***ions of employment
The candidate will be appointed as a PhD student for a period of four years. The candidateõ?Ts performance will be evaluated after 18 months. If the evaluation is positive, the contract will be extended by 2.5 years.
Other information
If you apply by email, please send your application in Word, PDF or TXT format.
Ad***ional information
prof.dr. H.J. Kappen
Telephone: +31-24-3614241
E-mail: b.kappen@science.ru.nl
Application: You can apply for the job (mention the vacancynumber 62.66.08) before 31-08-2008 by sending your application to:
RU Nijmegen, FNWI, P&O , mrs. M. Coppus
PO Box 9010, 6500 GL Nijmegen, NL
E-mail: pz@science.ru.nl
Telephone: +31-24-3652250

PhD student in Communication Systems
Reference number 2008/132
Application deadline 2008-08-31
The recently formed FOCUS project (Fiber Optical Communication Systems) at Chalmers University of Technology is pleased to announce several open positions. We perform frontline theoretical and experimental research in fiber optic communications. Our aim is to co-optimize optics, electronics, and algorithms - a very promising path to next generation, lower cost, dynamic, and spectrally efficient high performance optical networks.
The FOCUS environment comprises the Photonics Laboratory at the Department of Microtechnology and Nanoscience and the Communication Systems Group at the Department of Signals and Systems. These two research laboratories employ a total of 40 people, of which around 15 are currently involved within the project. The research strategy is that researchers with different background (photonics or digital communications) work together on the same problems.
This position is affiliated with the Communication Systems Group. A similar position with the Photonics Laboratory is announced separately.
Chalmers University of Technology is located in Gothenburg on the scenic west coast of Sweden. It is among the top research schools in Europe. The research environment is international and candidates of any nationality are welcome to apply.
Job description
The position as PhD student will be devoted to theory and algorithms for optical communication systems at bit rates of 10õ?"100 Gb/s and beyond.
The position is for a period of maximum five years. Up to 20 % of this time will be used for undergraduate teaching and other departmental work, and the remaining part is spent on completing the research and courses required for a Ph.D. degree. A monthly salary is paid. There are no tuition fees. The employment is supposed to begin no later than Jan. 1, 2009, but preferably sooner. Mention in your application when you can begin.
Keywords: advanced modulation formats, channel coding theory, coded modulation, digital communications, fiber optic communication systems, fiber optical communications, mathematical analysis, multilevel modulation, open position, optical fiber, PhD student, photonics, signal processing, synchronization algorithms, telecommunications, timing recovery
Qualifications
To apply, you should have a Master of Science degree in Electrical Engineering, Engineering Physics, or similar, with a focus on digital communications or signal processing, and high grades in the core courses.
Furthermore, you should have an interest in applying your skills to optical communications. Some experience in this field is an advantage but not a requirement. An interest in interdisciplinary communication with researchers from other fields is essential, as are skills in mathematical analysis. You should be fluent in English, have good collaborative skills, and have good abilities to communicate your results in writing and in presentations. Teaching qualifications are also a plus.
Application procedure
The material included in the application shall consist of pdf or zipped documents:
1. An application of a maximum of one A4 page containing your specific qualifications for the position
2. Attested copies of education certificates, including grade reports and other documents
3. Curriculum Vitae
4. Letters of recommendation from academic institutions and/or previous employers (optional)
The application can be submitted electronically, use the button at the end of this page.
If any material is not available electronically or cannot be transferred to pdf format, the material can be sent as a hard copy to Registrar. The applicants name and the reference number (2008/132) must be written on the first page of the application.
Address:
Registrar
Chalmers University of Technology
SE-412 96 Gảteborg
Sweden
Further information
For questions, please contact:
* Assoc. Prof. Erik Agrell, Communication Systems,
agrell at chalmers dot se, phone +4631 772 1762
Links:
* Chalmers: www.chalmers.se
* Communication Systems Group:
http://www.chalmers.se/s2/EN/research/divisions/communication-systems
* Photonics Laboratory:
http://www.chalmers.se/mc2/EN/laboratories/photonics-laboratory
Union representatives
* SACO: Jan Lindâr
* ST: Marie Wenander
* SEKO: Ralf Berndtsson
All reachable via Chalmers exchange: +46 31 772 10 00

Open PhD Positions Sponsored by Microsoft Research
Verification of state based access control
* Institution: University of Birmingham
* Supervisor: Mark Ryan
* To apply, please visit: http://www.cs.bham.ac.uk/~mdr/research/projects/08-AccessControl-MSR/
* Abstract: We aim to provide a method which allows fine-grained decentralised access control systems to be verified against abstract high-level properties of a kind that can be set and understood by managers. This kind of verification will give assurance of the correctness of the low-level ACS. We will build a modelling language that supports decentralised systems, delegation, roles, and state based permissions; and a method for verifying systems described in that language against abstract policies. If time permits, we will also explore whether fine-grained access control systems can be synthesised from the high-level properties.
Verifying properties of the ML family of programming languages
* Institution: University of Oxford, UK
* Supervisor: Luke Ong
* To apply, please visit: http://users.comlab.ox.ac.uk/luke.ong/OngMSR.html
* Abstract: We aim to develop verification techniques for higher-order (call-by-value) procedural languages with reference type, as exemplified by Ocaml, F# and other members of the ML family of programming languages. Specifically we set ourselves the following tasks:
1. Derive an algorithm for deciding observational equivalence (of an appropriate fragment of Reduced ML) by reduction to the equivalence of visibly pushdown automata, and to build a prototype implementation of it.
2. Develop a notion of reachability test for higher-order procedural languages, and identify language fragments for which it is decidable and determine its complexity.
3. Construct algorithms that symbolically compute over-approximations of an appropriate collecting semantics for higher-order procedural languages, with a view to the data and control flow analysis of these programs.
Learning and inference in highly structured continuous-time stochastic systems
* Institution: University of Edinburgh, UK
* Supervisor: Amos Storkey
* To apply, please visit: http://homepages.inf.ed.ac.uk/amos/msphd2008.html
* Abstract: Many real world systems are well described by continuous-time stochastic differential equations. For known distributions, there exist techniques for integrating the equations forward through time and hence evaluating (a probability distribution over) future predictions. A more challenging problem, but one of huge practical importance, is to reverse this process and to infer the nature of the unknown probability distributions given a set of observed time sequences. More generally still, the structure of the equations (for example, the presence or absence of particular interactions) is also unknown, and again we would like to infer such structure from observations. Typical analysis techniques used for inference and learning in many applications of this form are either discrete time methods or use deterministic ordinary differential systems, despite significant deficits of both these approaches. The primary aim of this project is to develop new practical, generally applicable techniques for continuous-time stochastic inference for both discrete- and continuous-state systems; these methods will then be demonstrated in particular important application areas, and will be provided as C++ libraries that will be promoted for wider dissemination of the methods. The result will be to develop improved methods for inference and learning in continuous time stochastic systems, and to allow continuous time stochastic methods to be used in many real problems with greater ease.
Verifying implementations of security protocols in C
* Institution: The Open University, UK
* Supervisor: Jan Jẳrjens
* To apply, please visit: http://mcs.open.ac.uk/jj2924/csec/index.html
* Abstract: One of the successes of formal methods in computer security is the development of tools to analyze abstract specifications of cryptographic protocols against high-level security requirements (such as confidentiality, privacy, and authenticity properties). Despite recent advances in analyzing the implementation code of security protocols, there are no tools shown to analyze pre-existing protocol implementations in C against high-level security requirements, though tools to check lower level properties, such as memory safety, do exist. Inventing tools to verify high-level properties of the code - as opposed to abstract specifications - of security protocols is important: in part, because implementation code is often the first and only place where the full details of a protocol are formalized, and in part because even if there is a detailed formal specification, the implementation may introduce ad***ional vulnerabilities. The goal is to start with pre-existing implementations of cryptographic protocols and to verify them against security properties using formally sound yet practically usable analysis techniques and tools. An important objective is to ensure that these analysis methods are practical by keeping the overhead of their use as small as possible. First, they take as input artifacts which are already available in current industrial software development (the program source code). Secondly, the tools should be reasonably easy to use and have a strong emphasis on automation. Manual effort (such as inserting annotations into the code) should be minimised. The goal of the security analysis is to find code vulnerabilities that give rise to attacks within the Needham-Schroeder threat model (such as man-in-the-middle, replay, or impersonation attacks). The project does not primarily aim to detect buffer overrun vulnerabilities, as there many existing techniques (including the CCured tool) for detecting or mitigating such problems. Our main aims are: - to develop a formal security verification methodology to verify implementations of cryptographic protocols in C against security properties such as confidentiality and authenticity and - to apply the methodology to the implementation of a widely used security protocol (such as the Internet security protocol standards SSL/TLS, SSH or Kerberos).
Unified relevance models for information retrieval
* Institution: University College London, UK
* Supervisor: Jun Wang
* To apply, please visit: http://www.ucl.ac.uk/hr/vacancies/adverts/EEA13.html
* Note: nationality restrictions apply*
* Abstract: In information retrieval, relevance is a very important concept and has been heavily studied. There are two different views on how to assign a probability of relevance of a document to a user need, namely document-oriented and query-oriented views. The classic probability retrieval model of information retrieval takes the query-oriented view while the language modelling approach to information retrieval builds upon the document-oriented view. However, neither view represents the problem of information retrieval completely. This proposed PhD research programme aims at breaking the partial views existing in current retrieval models, and formally develop a new retrieval paradigm that explores more of the dependency in the data and unifies evidence from different information sources to improve retrieval performance. To achieve our goal, we will 1) explore the dependency between users who have similar information needs, 2) combine evidence from different information sources, and 3) apply Bayesian probabilistic approaches to model the unified relevance.
Understanding resource-constrained information retrieval
* Institution: University College London, UK
* Supervisor: Ingemar Cox
* To apply, please visit: http://www.ucl.ac.uk/hr/vacancies/adverts/EEA13.html
* Note: nationality restrictions apply*
* Abstract: Search engines need to index a huge amount of data (billions of web pages) and must deal with very high query loads (100õ?Ts of thousands of requests per hour). This places serious strains on the underlying computer systems. This proposal seeks to develop a theoretical framework in which to understand the tradeoffs between performance and cost, where performance is measured with respect to the quality of the retrieved results and cost is a function of hardware costs and economic costs associated with degraded performance. The theoretical developments will be supported by empirical studies to both verify the theoretical models and to guide the developments of improved models.
* Some Scholarships are offered as Dorothy Hodgkin Postgraduate Awards and only students from the following countries are eligible: Afghanistan, Albania, Algeria, Angola, Anguilla, Antigua and Barbuda, Armenia, Argentina, Azerbaijan, Bahrain, Bangladesh, Barbados, Belize, Benin, Bhutan, Bolivia, Bosnia and Herzegovina, Botswana, Brazil, Burkina Faso, Burundi, Cambodia, Cameroon, Cape Verde, Central African Republic, Chad, Chile, China, Colombia, Comoros, Congo, Cook Islands, Costa Rica, Côte d''Ivoire, Croatia, Cuba, Democratic Republic of Congo, Djibouti, Dominica, Dominican Republic, Ecuador, Egypt, El Salvador, Equatorial Guinea, Eritrea, Ethiopia, Fiji, Gabon, Gambia, Georgia, Ghana, Grenada, Guatemala, Guinea, Guinea-Bissau, Guyana, Haiti, Honduras, Hong Kong, India, Indonesia, Iran, Iraq, Jamaica, Jordan, Kazakhstan, Kenya, Kiribati, Korea, Laos, Lebanon, Lesotho, Liberia, FYR Macedonia, Madagascar, Malawi, Malaysia, Maldives, Mali, Marshall Islands, Mauritania, Mauritius, Mayotte, Mexico, Micronesia, Moldova, Mongolia, Montenegro, Montserrat, Morocco, Mozambique, Myanmar, Namibia, Nauru, Nepal, Nicaragua, Niger, Nigeria, Niue, Oman, Pakistan, Palau Islands, Palestinian Administered Areas, Panama, Papua New Guinea, Paraguay, Peru, Philippines, Russia, Rwanda, Samoa, Sao Tome and Principe, Saudi Arabia, Senegal, Serbia, Seychelles, Sierra Leone, Solomon Islands, Somalia, South Africa, Sri Lanka, St Helena, St Kitts and Nevis, St Lucia, St Vincent & Grenadines, Sudan, Suriname, Swaziland, Syria, Tajikistan, Tanzania, Thailand, Timor-Leste, Togo, Tokelau, Trinidad and Tobago, Tonga, Tunisia, Turkey, Turkmenistan, Tuvalu, Turks and Caicos Islands, Uganda, Uruguay, Uzbekistan, Vanuatu, Venezuela, Vietnam, Wallis and Futuna, Yemen, Zambia, Zimbabwe.

Nay` thi` hoc bong
http://www.irtg.uni-kl.de/index.php?option=com_content&task=view&id=303&Itemid=160
Vua thi mon nay` xong

Secure Software and Languages
Promotor: Frank Piessens
Description:
[Two PhD positions posted by Frank Piessens on behalf of Dave Clarke
who starts as a newly appointed professor in October 2008]
Applications are invited for two PhD positions within the DistriNet
Research Group at the Katholieke Universiteit Leuven, Belgium.
The research will be conducted under the supervision of David Clarke.
* Research topics:
These positions are devoted to research on secure software and languages,
including, but not limited to:
* modelling highly adaptable trustworthy systems
* types and models for software families
* logic and type systems for security; ownership types; pluggable types
* programming languages for secure software
* Profile & skills
- Clear interest in and knowledge of the subject, based on education, work
or research experience
- Masters in Computer Science or Informatics
- Team player; capability to work in an international research team
- Proficiency in English and excellent communication skills, both oral
and written
- Prior knowledge in the areas of type systems, security, programming
languages and/or formal methods is an advantage.
* About DistriNet
The "Distributed systems and computer Networks" (DistriNet) research
group was founded in 1984 as part of the Department of Computer Science
at the K.U.Leuven. DistriNet''s research focus and scope is twofold:
distributed software and secure software.
The group works on a wide range of topics including computer networks,
middleware, internet architectures, network and software security,
embedded systems and multi-agent systems. DistriNet''s research is generally
application driven and often conducted in collaboration with industry
partners.
Currently DistriNet counts 60 members (8 professors, 12 post-docs and
45 junior researchers) and participates in about 30 national and
international research projects. The annual budget amounts to approximately
5MEuro. More information on projects and publications can be found on the
DistriNet web pages:
http://distrinet.cs.kuleuven.be/
Key words: secure software engineering, formal methods, type systems, software families, programming languages, verification, compo
Start date: 2008-10-01
Application date: 2008-10-08
Publication date: 2008-07-08
Financing: available
Link:
Research group: Department of Computer Science
Remarks:
* Further Information and Application Procedure
Requests for further information and other informal enquiries can be sent
to:
Dr. David Clarke
David.Clarke at cs.kuleuven.be
Those interested in the position are asked to send e-mail to the address
given above. Full Details of the application process are available upon
request, but an application will include:
1. A cover letter stating the applicant''s interest in the project.
2. A full curriculum vitae, including an abstract of the applicant''s
master''s thesis and the name of their supervisor.
3. Letters of recommendation or references from at least two
scientific staff members. (Letters of recommendation should either
be included along with the application, or should arrive
separately promptly.)
4. A completed application for postgraduate study at the K.U.Leuven.
Applications and instructions are available at
http://www.kuleuven.be/phd/
Applications will be considered until the position is filled, but those
received on or before 15 August 2008 will have priority.
The PhD positions are for 4 years.
The start date is negotiable, 1 October 2008 at the earliest.
Apply to here to apply.

Relational Learning for Text and Image
Promotor: Luc De Raedt
Description: Both text and images contain a lot of information that can be used to help interpret, complete and even reason about the image and the text. Whereas this is straightforward for humans, text and image-processing still are very challenging for machines. One of the reasons for this is that humans employ knowledge that is not (yet) available to machines. However, within artificial intelligence a lot of progress has been made on using and learning knowledge. Often relational representations are employed for this purpose. They do not only allow one to characterize properties of objects, but also to capture their relationships. This in turn provides essential information for interpreting text and images.
As one example, consider the following text:
"The blue Mercedes did not stop in front of the traffic light at Saint-Johnâ?Ts street. It was followed by a red Opel car. The Mercedes accelerated, took a right turn with screeching tires freaking out the people who were about to cross the street."
This text contains quite some relational information (there are two cars, the first one is a blue Mercedes, the second one a red Opel. The first is in front of the second one, both are on Saint-Johnâ?Ts street, etc.) From the text, one can ad***ionally infer that the red car will also accelerate and turn right; from an image, one might be able to infer how close the car is to pedestrians, etc.
In this project, we shall investigate how relational representations and relational learning techniques can be employed to interpret text and image. To this aim, we shall investigate
1. how relational representations can be generated from text,
2. how relational representations can be generated from images,
3. how relational representations for text and images can be integrated,
4. how relational learning techniques can be used to improve the performance of text- and image processing systems.
Traffic analysis has been chosen as the application domain for evaluating the techniques and methods to be developed in this project. The reason is that this is interesting from both a scientific and an economic point of view, and that there exists quite some data about this domain that could be used in the project.
Key words: machine learning, vision, image processing, text analysis, artificial intelligence, computer science
Start date: 2008-11-01
Application date: 2008-09-30
Publication date: 2008-07-15
Financing: dbof-scholarship
Link: http://www.cs.kuleuven.be/ http://www.esat.kuleuven.be/
Research group: Department of Computer Science
Remarks: There are 2 doctoral thesis topics and scholarships: one that will focus on text, and another one that will focus on image analysis.
There are three groups involved:
DTAI (Dept. of Computer Science): Prof. Luc De Raedt -- relational learning
HM-DB (Dept. of Computer Science): Prof. Marie-Francine Moens -- text processing
VISICS (Dept. ESAT): Profs. Tinne Tuytelaars and Luc Van Gool -- image analysis
Apply to here to apply to this project

Cryptanalysis of hash functions
Promotor: Vincent Rijmen
Description: NIST (US National Institute for Standards and Technology) is organizing the Advanced Hash Function competition from 2008 to 2012. http://csrc.nist.gov/groups/ST/hash/index.html. Cryptanalysts from all over the world will study the submissions to this competition in order to evaluate their security and performance in software and hardware. You will contribute to this effort together with your experienced colleagues in the COSIC team.
Your background: master degree in electrical or computer engineering, mathematics or computer science. We expect that you are highly motivated to develop and try new cryptanalytic techniques. This requires good analytical skills and strong programming skills. Experience with cryptanalysis is a plus.
Key words: cryptanalysis, hash functions
Start date: 2008-10-01
Application date: 2008-09-15
Publication date: 2008-07-15
Financing: available
Link: http://www.esat.kuleuven.be/cosic
Research group: Department of Electrical Engineering (ESAT)
Remarks: All research is performed in the COSIC group. COSIC currently has more than 30 PhD students representing more than 20 nationalities. The working language is English.
Apply to here to apply to this project

Composing applications in the Web 2.0 era (Scientific Researcher)
Promotor: Wouter Joosen
Description:
Research topic
There is an array of information and services available at your fingertips on the Internet. Such richness, together with the ease of access, has impacted the way modern applications are created. From the ?odevelop your own software or buy it? paradigm, we are drifting towards a ?osearch a feed on the web and integratê? approach. Mashups, for instance, represent a lightweight technology supporting the above mentioned approach. In this context, lightweight means that no rigid infrastructure in required:
* Interfaces: several types of protocols can be used to access data on the web. If necessary, content is scraped directly from a raw web resource with no need of formal interfaces at all.
* Location services: UDDI and CORBA registry servers are no longer needed. Data and service components can be ?ogoogled? for.
Further, extended programming skills are not required either:
* Composition: components are glued together by means of ad-hoc e***or.
* Orchestration: the limited complexity of applications does not require complex scripts.
Albeit all this sounds very promising, a number of challenges are still to be faced. The absence of crisp interfaces makes the applications very volatile and not resilient to change, e.g., with respect to the data feeds they rely on. Moreover, basic components provide little information about their expected behavior. Further, composition logic is inadequate for complex workflows. In summary, there is the risk for the new paradigm to trade the achievements of decades of research in the area of software architectures and composition techniques for the sake of flexibility and ease of use. This may be acceptable for small situational applications but it is certainly not for enterprise systems (Gartner Group forecasted Web 2.0 to be the dominant composition technique for enterprise applications by 2010).
The DistriNet research group is engaging in this research area in order to overcome the above-mentioned limitations. The objective is to come to a solution that makes the composition of Web 2.0 application more disciplined without sacrificing their original lightweight nature too much. In practice, we plan to tackle the problem from two complementary angles. First, we want to improve the state-of-the-art from the developer perspective (frontend). In particular, we are investigating how to:
* Provide more systematic and less ad-hoc composition techniques that take non-functional requirements (e.g., security) into consideration.
* Provide more complex composition logic without resorting to heavyweight orchestration technology
* Enrich components with lightweight behavioral descriptions (e.g., from interface contracts to interface tagging).
Second, we want to enhance the state-of-the-art from the infrastructure perspective (backend). In particular, we are investigating how to:
* Provide the metadata underpinning the functional and non-functional contracts or alternative interaction methods
* Bridge the gap between user-centric descriptions and enforceable policy
* Provide for enforcement and assurance support throughout the infrastructure
* Assess the execution platforms and expand as needed
Profile & skills
* Clear interest in or knowledge of the subject, based on education, work or research experience
* Master in Computer Science (or related) with a background in distributed systems or security
* Team player and aptitude to work in an international research team
* Proficiency in English and excellent communication skills
* Candidates are expected to contribute to all engineering phases ranging from analysis to prototype implementation
Key words: distributed software, software composition, Web 2.0, security
Start date: 2008-10-01
Application date: 2008-10-15
Publication date: 2008-07-24
Financing: available
Link: http://distrinet.cs.kuleuven.be
Research group: Department of Computer Science
Remarks:
About DistriNet
The ?oDistributed systems and computer Networks? (DistriNet) research group was founded in 1984 as part of the Department of Computer Science at the K.U.Leuven. DistriNet?Ts research focus and scope is twofold: distributed software and secure software.
The group works on a wide range of topics including computer networks, middleware, internet architectures, network and software security, embedded systems and multi-agent systems. DistriNet?Ts research is always application driven and often conducted in collaboration with industry partners.
Currently DistriNet counts 60 members (8 professors, 12 post-docs and 45 junior researchers) and participates in about 30 national and international research projects. The annual budget amounts approximately 5MEuro. More information on projects and publications can be found on the DistriNet web pages: http://distrinet.cs.kuleuven.be/
Living and working in Leuven
Leuven is a lively international place - the department has numerous foreign researchers and is a language-friendly place. Further info are available at http://www.kuleuven.be/english/living.html
How to apply
To apply, please send the following information by email to Wouter Joosen (http://www.cs.kuleuven.be/cgi-bin/e-post.pl?epost=Wouter.Joosen):
* Motivation letter
* Curriculum vitae, also including: degrees, study curriculum with rankings, relevant research experience and publications
* Contact info of 2 reference persons and the nature of your relationship with them
For informal inquiries, please contact Riccardo Scandariato (http://www.cs.kuleuven.be/cgi-bin/e-post.pl?epost=Riccardo.Scandariato), Christophe Huygens (http://www.cs.kuleuven.be/cgi-bin/e-post.pl?epost=Christophe.Huygens), or Wouter Joosen (http://www.cs.kuleuven.be/cgi-bin/e-post.pl?epost=Wouter.Joosen)
The startdate is negotiable between October 1st, 2008 and January 1st, 2009
Apply to here to apply to this project

The development and implementation of quasi-Monte Carlo techniques for large scale and real-time applications
Promotor: Ronald Cools
Description: Intelligent robots are equipped with sensors which monitor the environment, and process these measurements using stochastic methods in which Bayesian statistics play an important role. The application of the Bayesian formula consists of integrating multi-variate probability density functions. Recently spectacular improvements where obtained with so-called quasi-Monte Carlo methods to approximate high-dimensional integrals. The aim of this project is to investigate and apply these techniques for applications in robotics.
Key words: quasi-Monte Carlo simulation, multivariate numerical integration
Start date: 2008-10-01
Application date: 2008-09-15
Publication date: 2008-01-31
Financing: available
Link: http://www.cs.kuleuven.be/~nines
Research group: Department of Computer Science
Remarks: The position is also available for earlier and for later starting dates.
Apply to here to apply to this project