Displaying 5 results from an estimated 5 matches for "jianping".
2007 Jun 11
2
how to ignore error messages?
...t will take a lot of time.
I added some logic assessments prior to running nonlinear fit. It helped
but some exceptions still existed. I am wondering if there is any way in R
by which I can continue to run the entire code to the end by ignoring the
error message?
Greatly appreciate your help,
Jianping
##################################
Jianping Jin Ph.D.
Bioinformatics scientist
Center for Bioinformatics
Room 3133 Bioinformatics building
CB# 7104
University of Chapel Hill
Chapel Hill, NC 27599
Phone: (919)843-6105
FAX: (919)843-3103
E-Mail: jjin at email.unc.edu
2002 Feb 26
1
Samba client
Hi,
I have an samba sevrver as PDC of an NT domain. I want to join another
machine(samba) to the domain as a member of NT domain. How can I do it.
Thanks
--------------------------------
Jianping Zhu
Department of Computer Science
Univerity of Georgia
Athens, GA 30602
Tel 706 5423900
--------------------------------
2012 Oct 04
1
some improvements about the latent semantic search
Hi,all,
Recently I invented a new ranking algorithm inspired by the theory of
spread activation and probabilistic model, which can find the latent
semantic relationship between docs and terms and is almost linear time, and
I took one afternoon to code and implement this algorithm. And the testing
result shows that the speed of this algorithm is much faster than the
famous Latent Semantic Analysis
2016 Dec 02
2
How to add a new diagnostic error message in Clang 2.6?
Hi, everyone.
I want to add a new diagnostic error message for Chinese in Clang 2.6
showed as follows.
def err_expected_semi_declaration_chinese : Error<
"您在该行声明之后是否少了个';'或者是中文输入法?">;
So i append a new one in the end of file DiagnosticParseKinds.td, and
then recompile it.
However, there is a error occurs:
llvm2.6/llvm/tools/clang/lib/Parse/ParseDecl.cpp:370: error:
2012 Oct 04
0
Xapian-devel Digest, Vol 90, Issue 1
Hi, all guys:
I invented a new ranking algorithm inspired by the theory of spread
activation and probabilistic model, which can find the latent semantic
relationship between docs and terms, and I took one afternoon to implement
this idea, which is almost linear time, and the testing result shows that
the speed of this algorithm is much faster than the famous Latent Semantic
Analysis