Thursday, 30 December 2010
Wednesday, 29 December 2010
Monday, 27 December 2010
Funny Site
A site to trace your academic ancestors and descendances:
http://genealogy.math.ndsu.nodak.edu/index.php
http://genealogy.math.ndsu.nodak.edu/index.php
Friday, 24 December 2010
BRIDGE
http://www.bridge-project.eu/index.php/mainpage/en/
Economic impact of RFID report
http://www.bridge-project.eu/data/File/BRIDGE_WP13_Economic_impact_RFID.pdf
European Passive RFID Market Sizing 2007-2022
http://www.bridge-project.eu/data/File/BRIDGE%20WP13%20European%20passive%20RFID%20Market%20Sizing%202007-2022.pdf
Economic impact of RFID report
http://www.bridge-project.eu/data/File/BRIDGE_WP13_Economic_impact_RFID.pdf
European Passive RFID Market Sizing 2007-2022
http://www.bridge-project.eu/data/File/BRIDGE%20WP13%20European%20passive%20RFID%20Market%20Sizing%202007-2022.pdf
How to explore?
What shall I get from the exploration? The answers are clear, since they are the motivation for me to spend time on exploration. But it is still necessary to write them down, because I may feel confuse and lose confidence when under some pressure. Exploration won't lead to instant output, but for the long term, it will have great meaning.
As I recognize knowledge as a connected "body". The first step is getting familiar with the framework of knowledge. For a specific area, identify the curtail points. That is building the map of knowledge.
As I recognize knowledge as a connected "body". The first step is getting familiar with the framework of knowledge. For a specific area, identify the curtail points. That is building the map of knowledge.
The answer is that it really depends on what the PhD research topic in.
Even in a bad economy, there is a need for people with expertise in certain domains:
- Algorithms and information retrieval (used by companies like Google)
- Pattern recognition and machine learning (finance and search)
- Natural language processing
- Robotics (very strong, but tends to fall on the defense side of things)
- Bioinformatics
- Vision (very strong, but again, often on the defense side; some medical)
- Computer graphics
- Computer architecture (suggested by DasBoot, often under EE, useful for Intel, etc.)
- Certain aspects of verification and testing (typically government jobs, NASA, defense)
- Parallel processing and scientific computing (many government research labs)
Unfortunately, many many PhD topics fall outside these areas. In these cases, there is limited benefit to having a PhD unless you happen to score an academic or research job and that is very competitive. In bad economies, universities shut down hiring and research labs and organizations are the first place to be frozen in large corporations.
So unless you are in those fields, I highly recommend against it. Once you go to the academia, you are also losing time that you could spend becoming a more experienced engineer. You are then also not able to get any engineering positions, at least not entry-level one.
Your background sounds like robotics may be your field. If you can get security clearance, that may be a good direction to pursue a PhD in.
If you want specific stories, I am getting a Ph.D. in software engineering from a top-4 school. My research focused on the usability of APIs. I am going to burn the diploma the day I get it as a symbol of how I burned my career. Getting a Ph.D. is a gamble, it may be preferable to play it safe.
Also, it is important to realize that Ph.Ds. are more common than one would expect. This year, for example, Cornell University which is a top-ten school received more than 400 applications for faculty positions. If you imagine that most Ph.Ds. didn't even bother trying to aim that high, it's a scary number. The top schools produce tons of Ph.D.s (hundreds), and they compete against people from lower ranked schools that also do amazing work, etc.
How to choose a research topic
http://www.suite101.com/content/dissertation-and-thesis-topics-a17177
http://www-rocq.inria.fr/~abitebou/PRESENTATION/HowToChooseAThesisTopoc-EDBT02.pdf
The points: : It should be new, beautiful, have a simple statement and be technologically difficult, and you feel fun when working on it.
[What's "beautiful"?]
http://www-rocq.inria.fr/~abitebou/PRESENTATION/HowToChooseAThesisTopoc-EDBT02.pdf
The points: : It should be new, beautiful, have a simple statement and be technologically difficult, and you feel fun when working on it.
[What's "beautiful"?]
Thursday, 23 December 2010
Wednesday, 22 December 2010
E-voting
Electronic Election?
Towards Trustworthy Elections, New Directions in Electronic Voting.
http://www.informatik.uni-trier.de/~ley/db/conf/wote/lncs6000.html#JuelsCJ10
Towards Trustworthy Elections, New Directions in Electronic Voting.
http://www.informatik.uni-trier.de/~ley/db/conf/wote/lncs6000.html#JuelsCJ10
Tuesday, 21 December 2010
Monday, 20 December 2010
STOC
STOC
http://en.wikipedia.org/wiki/Symposium_on_Theory_of_Computing
http://www.cs.caltech.edu/~schulman/
STOC proceedings on ACM Digital Library
http://portal.acm.org/event.cfm?id=RE224&tab=pubs&CFID=3108930&CFTOKEN=81377101
http://portal.acm.org/citation.cfm?id=1806689&picked=prox&CFID=3108930&CFTOKEN=81377101
Topics in STOC:
algorithms and data structures
computational complexity
cryptography,
computational learning theory,
computational game theory,
parallel and distributed algorithms,
quantum computing,
computational geometry,
computational applications of logic,
algorithmic graph theory and combinatorics,
optimization, randomness in computing,
approximation algorithms,
algorithmic coding theory,
algebraic computation,
and theoretical aspects of areas such as
networks,
privacy,
information retrieval,
computational biology,
databases.
Papers that broaden the reach of the theory of computing, or raise important problems that can benefit from theoretical investigation and analysis, are encouraged.
http://en.wikipedia.org/wiki/Symposium_on_Theory_of_Computing
http://www.cs.caltech.edu/~schulman/
STOC proceedings on ACM Digital Library
http://portal.acm.org/event.cfm?id=RE224&tab=pubs&CFID=3108930&CFTOKEN=81377101
http://portal.acm.org/citation.cfm?id=1806689&picked=prox&CFID=3108930&CFTOKEN=81377101
Topics in STOC:
algorithms and data structures
computational complexity
cryptography,
computational learning theory,
computational game theory,
parallel and distributed algorithms,
quantum computing,
computational geometry,
computational applications of logic,
algorithmic graph theory and combinatorics,
optimization, randomness in computing,
approximation algorithms,
algorithmic coding theory,
algebraic computation,
and theoretical aspects of areas such as
networks,
privacy,
information retrieval,
computational biology,
databases.
Papers that broaden the reach of the theory of computing, or raise important problems that can benefit from theoretical investigation and analysis, are encouraged.
Sunday, 12 December 2010
Monday, 6 December 2010
Saturday, 4 December 2010
Wednesday, 24 November 2010
Universities and Research institutions
AAU: Association of American Universities
http://en.wikipedia.org/wiki/Association_of_American_Universities
http://en.wikipedia.org/wiki/Association_of_American_Universities
Thursday, 18 November 2010
Research Funding
http://en.wikipedia.org/wiki/Research_funding
List of funding opportunity database
http://en.wikipedia.org/wiki/List_of_funding_opportunity_databases
---------------------------------------------------------------
Overview of new financial rules and funding opportunities 2007-2013: From European Commission: for researchers page 11
http://ec.europa.eu/budget/library/publications/financial_pub/pack_rules_funds_en.pdf
List of National Contact Points:
www.cordis.europa.eu/fp7/get-support_en.html
• CORDIS website:
The site contains a great deal of information about FP7, including the latest
updates, the calendar of calls for proposals, the texts of the calls, frequently asked questions (FAQ), and more.
www.cordis.europa.eu/fp7/
• The European Commission's Research website:
This site contains simple, downloadable fact sheets explaining FP7, available
in 23 languages.
www.ec.europa.eu/research/fp7/
• Research Enquiry Service:
www.ec.europa.eu/research/enquiries
• European Research Council:
http://erc.europa.eu/
What kind of research will get support from nation? industry?
Funding list? --> future research direction?
NSF? et al.
Useful? crucial?
List of funding opportunity database
http://en.wikipedia.org/wiki/List_of_funding_opportunity_databases
---------------------------------------------------------------
Overview of new financial rules and funding opportunities 2007-2013: From European Commission: for researchers page 11
http://ec.europa.eu/budget/library/publications/financial_pub/pack_rules_funds_en.pdf
List of National Contact Points:
www.cordis.europa.eu/fp7/get-support_en.html
• CORDIS website:
The site contains a great deal of information about FP7, including the latest
updates, the calendar of calls for proposals, the texts of the calls, frequently asked questions (FAQ), and more.
www.cordis.europa.eu/fp7/
• The European Commission's Research website:
This site contains simple, downloadable fact sheets explaining FP7, available
in 23 languages.
www.ec.europa.eu/research/fp7/
• Research Enquiry Service:
www.ec.europa.eu/research/enquiries
• European Research Council:
http://erc.europa.eu/
What kind of research will get support from nation? industry?
Funding list? --> future research direction?
NSF? et al.
Useful? crucial?
Sunday, 7 November 2010
Internet of things? IOT
IOT 2008
http://www.informatik.uni-trier.de/~ley/db/conf/iot/iot2008.html
IOT 2010:
http://www.iot2010.org/
SecIOT 2010: the 1st workshop on the security of IOT
Urban IOT 2010: Urban Internet of things - Towards programmable real-time cities?
LocWeb 2010: Third International Workshop on Location and the web 2010
Trustworthy IoPTS: The 4th International Workshops on Trustworthy of Internet of
people, things & services
MIT autoID lab
http://autoid.mit.edu/cs/
IOT & auto-id? The same thing? or autoID is part of IOT?
http://www.informatik.uni-trier.de/~ley/db/conf/iot/iot2008.html
IOT 2010:
http://www.iot2010.org/
SecIOT 2010: the 1st workshop on the security of IOT
Urban IOT 2010: Urban Internet of things - Towards programmable real-time cities?
LocWeb 2010: Third International Workshop on Location and the web 2010
Trustworthy IoPTS: The 4th International Workshops on Trustworthy of Internet of
people, things & services
MIT autoID lab
http://autoid.mit.edu/cs/
IOT & auto-id? The same thing? or autoID is part of IOT?
Tuesday, 2 November 2010
Monday, 25 October 2010
Standards
http://en.wikipedia.org/wiki/Category:Standards
What kind of application require standard?
How the standard come up?
Who set up the standards?
What kind of application require standard?
How the standard come up?
Who set up the standards?
RFID standards
http://www.epcglobalinc.org/home/
Group: Cambridge AutoID lab
http://www.autoidlabs.org.uk/
Dr. Mark Harrison, Cambridge
http://www.ifm.eng.cam.ac.uk/people/mgh12/
Prof. Duncan Mcfarlane
http://www.ifm.eng.cam.ac.uk/people/dcm/
Group: Cambridge AutoID lab
http://www.autoidlabs.org.uk/
Dr. Mark Harrison, Cambridge
http://www.ifm.eng.cam.ac.uk/people/mgh12/
Prof. Duncan Mcfarlane
http://www.ifm.eng.cam.ac.uk/people/dcm/
Research and science?
Scientists do research. The ones who do research are called scientists.
Researchers work on science(research)?
research is a kind of means that leads to a progress on science?
researcher & scientist
seems scientists are extremely excellent researchers, but not all researcher can be called as scientist.
Researchers work on science(research)?
research is a kind of means that leads to a progress on science?
researcher & scientist
seems scientists are extremely excellent researchers, but not all researcher can be called as scientist.
Saturday, 23 October 2010
Science
Science portal:
http://en.wikipedia.org/wiki/Portal:Science
History of science:
http://en.wikipedia.org/wiki/Portal:History_of_science
Science related lists
http://en.wikipedia.org/wiki/Category:Science-related_lists
Scientific method
http://en.wikipedia.org/wiki/Scientific_method
http://en.wikipedia.org/wiki/Portal:Science
History of science:
http://en.wikipedia.org/wiki/Portal:History_of_science
Science related lists
http://en.wikipedia.org/wiki/Category:Science-related_lists
Scientific method
http://en.wikipedia.org/wiki/Scientific_method
Friday, 22 October 2010
Algorithm--General Information
Algorithm
Categories of Algorithm
http://en.wikipedia.org/wiki/Category:Algorithms
Dictionary of Algorithms and Data Structures
http://en.wikipedia.org/wiki/Dictionary_of_Algorithms_and_Data_Structures
Timeline of algorithms
http://en.wikipedia.org/wiki/Timeline_of_algorithms
List of data structures
http://en.wikipedia.org/wiki/List_of_data_structures
List of complexity classes
http://en.wikipedia.org/wiki/List_of_complexity_classes
Tuesday, 19 October 2010
Monday, 18 October 2010
Saturday, 16 October 2010
Useful academic services
1.Editing and proof reading services:
Email: wewritebetter@gmail.com
Web: sites.google.com/site/amritk/
Thursday, 14 October 2010
Wednesday, 13 October 2010
Philosophy
http://en.wikipedia.org/wiki/Philosophy
Stanford Encyclopedia of Philosophy
http://plato.stanford.edu/
Stanford Encyclopedia of Philosophy
http://plato.stanford.edu/
Principles of Effective Research--Michael Nielsen
http://www.qinfo.org/people/nielsen/blog/archive/000120.html
http://en.wikipedia.org/wiki/Michael_Nielsen
http://michaelnielsen.org/blog/
His new book: The future of science
http://michaelnielsen.org/blog/the-future-of-science-2/
"Developing a taste for what's important:"
"He advised young people in the audience not to work towards a Nobel Prize, but instead to aim their research in directions that they personally find fun and interesting."
"In fact, in any given research field there are usually only a tiny number of papers that are really worth reading. You are almost certainly better off reading deeply in the ten most important papers of a research field than you are skimming the top five hundred."
"Systematically setting aside time to think (and talk with colleagues) about where the important problems are is an excellent way of developing as a problem-creator."
"On this topic, let me point out one myth that exerts a powerful influence (often subconsciously) on people: the idea that difficulty is a good indicator of the importance of a problem. It is true that an elegant solution to a difficult problem (even one not a priori important) often contains important ideas. However, I believe that most people consistently over rate the importance of difficulty. Often far more important is what your work enables, the connections that it makes apparent, the unifying themes uncovered, the new questions asked, and so on."
[difficulty is not an indicator of the importance of a problem?]
http://en.wikipedia.org/wiki/Michael_Nielsen
http://michaelnielsen.org/blog/
His new book: The future of science
http://michaelnielsen.org/blog/the-future-of-science-2/
"Developing a taste for what's important:"
"He advised young people in the audience not to work towards a Nobel Prize, but instead to aim their research in directions that they personally find fun and interesting."
"In fact, in any given research field there are usually only a tiny number of papers that are really worth reading. You are almost certainly better off reading deeply in the ten most important papers of a research field than you are skimming the top five hundred."
"Systematically setting aside time to think (and talk with colleagues) about where the important problems are is an excellent way of developing as a problem-creator."
"On this topic, let me point out one myth that exerts a powerful influence (often subconsciously) on people: the idea that difficulty is a good indicator of the importance of a problem. It is true that an elegant solution to a difficult problem (even one not a priori important) often contains important ideas. However, I believe that most people consistently over rate the importance of difficulty. Often far more important is what your work enables, the connections that it makes apparent, the unifying themes uncovered, the new questions asked, and so on."
[difficulty is not an indicator of the importance of a problem?]
Sunday, 10 October 2010
Herbert Simon (Turing and Nobel prize holder)
http://en.wikipedia.org/wiki/Herbert_Simon
Society for general systems research
http://en.wikipedia.org/wiki/Society_for_General_Systems_Research
Society for general systems research
http://en.wikipedia.org/wiki/Society_for_General_Systems_Research
Friday, 8 October 2010
Thursday, 7 October 2010
Cryptography Links
wikipedia portal:
http://en.wikipedia.org/wiki/Portal:Cryptography
Cryptographers' World
http://www.cryptographersworld.com/
David Wagner's List
http://www.cs.berkeley.edu/~daw/people/crypto.html
Helger Lipmaa's list
http://research.cyber.ee/~lipmaa/crypto/
Highest level conference statistics:
http://www.iacr.org/cryptodb/data/stats.php
Cypto Institutions:
http://research.cyber.ee/~lipmaa/cites/cites.php?sorted=institution&data=crypto
http://en.wikipedia.org/wiki/Portal:Cryptography
Cryptographers' World
http://www.cryptographersworld.com/
David Wagner's List
http://www.cs.berkeley.edu/~daw/people/crypto.html
Helger Lipmaa's list
http://research.cyber.ee/~lipmaa/crypto/
Highest level conference statistics:
http://www.iacr.org/cryptodb/data/stats.php
Cypto Institutions:
http://research.cyber.ee/~lipmaa/cites/cites.php?sorted=institution&data=crypto
Wednesday, 6 October 2010
History and timeline of computing
IEEE Annals of the History of Computing
http://www.computer.org/portal/web/annals/home
History of computer science
http://en.wikipedia.org/wiki/History_of_computer_science
Stephen White's history http://trillian.randomstuff.org.uk/~stephen//history/
Timeline of computing: http://en.wikipedia.org/wiki/Timeline_of_computing
Various timelines in CS:http://en.wikipedia.org/wiki/Category:Computing_timelines
http://www.computer.org/portal/web/annals/home
History of computer science
http://en.wikipedia.org/wiki/History_of_computer_science
Stephen White's history http://trillian.randomstuff.org.uk/~stephen//history/
Timeline of computing: http://en.wikipedia.org/wiki/Timeline_of_computing
Various timelines in CS:http://en.wikipedia.org/wiki/Category:Computing_timelines
Subscribe to:
Posts (Atom)