A new start, although comes a little bit late. But so much better than never.
Today I talked with professor and was told I *can* decide to work on the topic he assigned or the one I have been wanting to do for so long.
But the bad news is, seems it's difficult for a foreigner with little knowledge of Japanese to find a research position in Japan...wow....
Wednesday, February 28, 2007
Saturday, February 17, 2007
Friday, February 16, 2007
latex中插入并列子图
使用graphicx宏包和subfigure宏包。下面是一个例子。
\begin{figure}[htb]
\centering
\mbox{
\subfigure[信元丢失率与加速因子之间的关系]{\includegraphics[scale=1.0]{temp1.e
ps}}\quad
\subfigure[信元丢失率与缓冲大小之间的关系]{\includegraphics[scale=1.0]{temp2.e
ps}}
}
\caption{影响信元丢失率的因素}
\label{Fig:CellDropRates}
\end{figure}
\begin{figure}[htb]
\centering
\mbox{
\subfigure[信元丢失率与加速因子之间的关系]{\includegraphics[scale=1.0]{temp1.e
ps}}\quad
\subfigure[信元丢失率与缓冲大小之间的关系]{\includegraphics[scale=1.0]{temp2.e
ps}}
}
\caption{影响信元丢失率的因素}
\label{Fig:CellDropRates}
\end{figure}
Thursday, February 15, 2007
harmonic series and Riemann Zeta Function
>>Harmonic series: sigma (1/n) n = 0 .. infinit
>>Riemann Zeta Function
the most common form of Riemann Zeta Function:
>>
>>Riemann Zeta Function
the most common form of Riemann Zeta Function:
>>
Monday, January 29, 2007
inf (glb) and sup
from mathforum
inf means "infimum," or "greatest lower bound." This is
slightly different from minimum in that the greatest lower bound is
defined as:
x is the infimum of the set S [in symbols, x = inf (S)] iff:
a) x is less than or equal to all elements of S
b) there is no other number larger than x which is less than or equal
to all elements of S.
Basically, (a) means that x is a lower bound of S, and (b) means that
x is greater than all other lower bounds of S.
This differs from min (S) in that min (S) has to be a member of S.
Suppose that S = {2, 1.1, 1.01, 1.001, 1.0001, 1.00001, ...}. This
set has no smallest member, no minimum. However, it's trivial to show
that 1 is its infimum; clearly all elements are greater than or equal
to 1, and if we thought that something greater than 1 was a lower
bound, it'd be easy to show some member of S which is less than it.
So that's the difference between inf and min. It's worth noting that
every set has an inf (assuming minus infinity is okay), and that the
two concepts are the same for finite sets.
glb is another way of writing inf (sort for "greatest lower bound")
------------------------
sup and lub, which are short for "supremum" and "least upper bound."
inf means "infimum," or "greatest lower bound." This is
slightly different from minimum in that the greatest lower bound is
defined as:
x is the infimum of the set S [in symbols, x = inf (S)] iff:
a) x is less than or equal to all elements of S
b) there is no other number larger than x which is less than or equal
to all elements of S.
Basically, (a) means that x is a lower bound of S, and (b) means that
x is greater than all other lower bounds of S.
This differs from min (S) in that min (S) has to be a member of S.
Suppose that S = {2, 1.1, 1.01, 1.001, 1.0001, 1.00001, ...}. This
set has no smallest member, no minimum. However, it's trivial to show
that 1 is its infimum; clearly all elements are greater than or equal
to 1, and if we thought that something greater than 1 was a lower
bound, it'd be easy to show some member of S which is less than it.
So that's the difference between inf and min. It's worth noting that
every set has an inf (assuming minus infinity is okay), and that the
two concepts are the same for finite sets.
glb is another way of writing inf (sort for "greatest lower bound")
------------------------
sup and lub, which are short for "supremum" and "least upper bound."
Saturday, January 20, 2007
Latent Semantic Index (LSI)
1) here is a great explaination to a layman.
or latent semantic analysis
"The term ’semantics’ is applied to the science and study of meaning in language, and the meaning of characters, character strings and words. Not just the language and words themselves, but the true meaning being conveyed in the context in which they are being used.
In 2002 a company called Applied Semantics, an innovator in the use of semantics in text processing, launched a program known as AdSense, which was a form of contextual advertising whereby adverts were placed on website pages which contained text that was relevant to the subject of the adverts.
The matching up of text and adverts was carried out by software in the form of mathematical formulae known as algorithms. It was claimed that these formulae used semantics to analyze the meaning of the text within the web page. In fact, what it initially seemed to do was to match keywords within the page with keywords used in the adverts, though some further interpretation of meaning was evident in the way that some relevant adverts were correctly placed without containing the same keyword character string as used on the web page.
"
2)from Patterns in Unstructured Data -Discovery, Aggregation, and Visualization
or latent semantic analysis
"The term ’semantics’ is applied to the science and study of meaning in language, and the meaning of characters, character strings and words. Not just the language and words themselves, but the true meaning being conveyed in the context in which they are being used.
In 2002 a company called Applied Semantics, an innovator in the use of semantics in text processing, launched a program known as AdSense, which was a form of contextual advertising whereby adverts were placed on website pages which contained text that was relevant to the subject of the adverts.
The matching up of text and adverts was carried out by software in the form of mathematical formulae known as algorithms. It was claimed that these formulae used semantics to analyze the meaning of the text within the web page. In fact, what it initially seemed to do was to match keywords within the page with keywords used in the adverts, though some further interpretation of meaning was evident in the way that some relevant adverts were correctly placed without containing the same keyword character string as used on the web page.
"
2)from Patterns in Unstructured Data -Discovery, Aggregation, and Visualization
Wednesday, December 27, 2006
model-theoretic semantics
>>"The basic of model-theoretic semantics can be roughly described as the following.
For a formal language L, a model M consists of descriptions about
objects and their factual relations in a domain. The descriptions are written in
another language Lm, which is a meta-language, and can either be a natural
language, like English, or another formal language. An interpretation I maps
the words in L onto the objects and relations in M. According to this theory,
the meaning of a word in L is defined as its image in M under I, and whether
a statement in L is true is determined by whether it is mapped by I onto a
fact in M."
from "Experience-Grounded Semantics:A theory for intelligent systems"
P4
>>According to model-theoretic semantics, for any formal language L, the necessary
and sufficient condition for its terms to have meaning and for its statements to have truth value is the existence of a model. In different models, the meaning of terms and truth value of statements may change; however, these changes are not caused by using the language. A reasoning system R that processes sentences in L does not depend on the semantics of L when the system runs. That means, on the one hand, that R needs no access to the meanings of terms and truth values of statements — it can distinguish terms only by their forms, and derive statements from other statements only according to its (syntactically defined) inference rules, but it puts little constraint on how the language can be interpreted. On the other hand, what knowledge R has and what operations R performs have no influence on the meaning and truth
value of the terms and sentences involved. Such a treatment is desired in pure mathematics.
For a formal language L, a model M consists of descriptions about
objects and their factual relations in a domain. The descriptions are written in
another language Lm, which is a meta-language, and can either be a natural
language, like English, or another formal language. An interpretation I maps
the words in L onto the objects and relations in M. According to this theory,
the meaning of a word in L is defined as its image in M under I, and whether
a statement in L is true is determined by whether it is mapped by I onto a
fact in M."
from "Experience-Grounded Semantics:A theory for intelligent systems"
P4
>>According to model-theoretic semantics, for any formal language L, the necessary
and sufficient condition for its terms to have meaning and for its statements to have truth value is the existence of a model. In different models, the meaning of terms and truth value of statements may change; however, these changes are not caused by using the language. A reasoning system R that processes sentences in L does not depend on the semantics of L when the system runs. That means, on the one hand, that R needs no access to the meanings of terms and truth values of statements — it can distinguish terms only by their forms, and derive statements from other statements only according to its (syntactically defined) inference rules, but it puts little constraint on how the language can be interpreted. On the other hand, what knowledge R has and what operations R performs have no influence on the meaning and truth
value of the terms and sentences involved. Such a treatment is desired in pure mathematics.
Tuesday, December 26, 2006
syntax && semantic relation.
the work of NLP V.S. semantic theory.
from
http://www.cogsci.uni-osnabrueck.de/~gkatz/Semantics/SlidesPDF/Lecture%20Two.pdf
-------------------------
Syntax is an independent filed of study concerned with determining what the grammatical structures are
semantic theory interprets those structures.
-------------------------
from
http://www.cogsci.uni-osnabrueck.de/~gkatz/Semantics/SlidesPDF/Lecture%20Two.pdf
-------------------------
Syntax is an independent filed of study concerned with determining what the grammatical structures are
semantic theory interprets those structures.
-------------------------
What is semantic? - beginning
"semantic web, semantic web, semantic web..."
"Stop, may I ask a question? what do you mean by 'semantic'?"
I hope one day I can answer this question clearly.
So from now on I will write down related pieces I met, the points I understood. And discussions are warmly welcomed. If you are interested in.
I will create a new label with its name "WhatIsSemantic", so everyone (of course, mainly me, I guess) can check all the posts easily. Thus, the titles of the future posts will not necessarily be "What is semantic(#)".
"Stop, may I ask a question? what do you mean by 'semantic'?"
I hope one day I can answer this question clearly.
So from now on I will write down related pieces I met, the points I understood. And discussions are warmly welcomed. If you are interested in.
I will create a new label with its name "WhatIsSemantic", so everyone (of course, mainly me, I guess) can check all the posts easily. Thus, the titles of the future posts will not necessarily be "What is semantic(#)".
Sunday, December 24, 2006
Tuesday, December 19, 2006
C++ memo
>>default constructor & copy constructor & copy assign constructor
>>int* p1, p2 = {int *p;int p2}
int *p1, *p2 = {int *p1; int *p2}
>>pointer & reference
http://zhidao.baidu.com/question/4616759.html
http://blog.sina.com.cn/u/4b03937a0100062c
[comment] basically, reference is an alais.
>>const int* p v.s int * const p
http://slam-dunk-for-life.spaces.live.com/blog/
以*为界。*是右结合的。
const int *p 指向常量的指针变量
int * const p 指向变量的指针常量
const int* const p 指向常量的指针常量
>>kevin's
http://kevin22hao.spaces.live.com/blog/
>>http://www.cplusplus.com/doc/tutorial/
>>http://www.cplusplus.com/doc/tutorial/
>>int* p1, p2 = {int *p;int p2}
int *p1, *p2 = {int *p1; int *p2}
>>pointer & reference
http://zhidao.baidu.com/question/4616759.html
http://blog.sina.com.cn/u/4b03937a0100062c
[comment] basically, reference is an alais.
>>const int* p v.s int * const p
http://slam-dunk-for-life.spaces.live.com/blog/
以*为界。*是右结合的。
const int *p 指向常量的指针变量
int * const p 指向变量的指针常量
const int* const p 指向常量的指针常量
>>kevin's
http://kevin22hao.spaces.live.com/blog/
>>http://www.cplusplus.com/doc/tutorial/
>>http://www.cplusplus.com/doc/tutorial/
Wednesday, November 22, 2006
The 1st post: Why this blog
To record my work.
It might be boring to my friends, so midi separates the working notes from the blog about my daily life, where also some posts about work can be found, if interested.
It might be boring to my friends, so midi separates the working notes from the blog about my daily life, where also some posts about work can be found, if interested.
Subscribe to:
Posts (Atom)
