May 11, 2013 Agent Based Simulation, Tech No comments ABS
I’d spent two weeks on Netlogo Manual and a tutorial on youtube before I wrote this program. Netlogo is a good agent based simulation platform while its math calculation ability is poor which can be compensated by R-extension.
This program is to simulate the video recommendation on Video sites su[……]
April 29, 2013 Octave No comments Octave
I attend Andrew Ng’s Machine Learning courses on Coursera recently. And he recommend us to use GNU Octave to do some calculation.
Actually, GNU Octave is very powerful as it is said on the title: Matlab’s
April 4, 2013 Programming No comments Vim
Vim is a powerful text editor and it is the most popular one for Linux users.
For details of it you can go to https://en.wikipedia.org/wiki/Vim_%28text_editor%29
And Vim is usually installed as defaut for Ubuntu users. You only need to type “vim” in the terminal and you can get access to it.[……]
April 3, 2013 Agent Based Simulation, Pro_R No comments ABS
Netlogo is a powerful platform for simulation while its mathimatical calculation is relatively poor comparing to some specific softwares. So it is a good idea to embedd R in Netlogo so that the problem can be solved. This article will show you hao to do the “A” in the upside picture which comes[……]
1. Update:
To obtain the latest R packages, add an entry like
deb http:///bin/linux/ubuntu raring/
or
deb http:///bin/linux/ubuntu quantal/
or
deb http:///bin/linux/ubuntu precise/
or
deb http:///bin/linux/ubuntu lucid/
in your /etc/apt/sources.list file, rep[……]
March 29, 2013 Tech No comments lecture
Andrew Ng came to Beijing to give two lectures this Tuesday, one in Baidu and another in Tsinghua U.. And I was very lucky to go to his lecture in Tsinghua to be acknowledged with his ideas in Machine Learning.
I’ve been focusing on Big Data and Data Mining for several months. From where I stan[……]
March 22, 2013 Agent Based Simulation No comments ABS
ABS is short for Agent Based Simulation, or Agent Based Modeling. I was acknowledged to this from my tutor, Pro.Guo. She is doing some research in data mining and some of her projects are on the recommendation algorithm applied to video websites such as Youtube. And the problem is that the tradition[……]
February 24, 2013 Embedded System 5 comments ARM7
February 24, 2013 Dynamic Programming No comments DP
The Ghost Blows Light
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1017 Accepted Submission(s): 303
Problem Description
My name is Hu Bayi, robing an ancient tomb in Tibet. The tomb consists of N rooms (numbered from 1 to N) wh[……]
February 24, 2013 Dynamic Programming No comments DP
Hometask
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Sergey attends lessons of the N-ish language. Each lesson he receives a hometask. This time the task is to translate some sentence to the N-ish language. Sentences of the[……]
February 24, 2013 Dynamic Programming No comments DP
Magic Number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 866 Accepted Submission(s): 353
Problem Description
There are many magic numbers whose lengths are less than 10. Given some queries, each contains a single number, if the[……]
February 24, 2013 Dynamic Programming No comments DP
Most PowerfulTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu
SubmitStatus
Description
Recently, researchers on Mars have discovered N powerful atoms. All of them are different. These atoms have some properties. When two of these atoms collide, one of them disappears a[……]
February 24, 2013 Dynamic Programming No comments DP
Max Sum of Max-K-sub-sequenceTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
hdu3415
Description
Given a circle sequence A[1],A[2],A[3]……A[n]. Circle sequence means the left neighbour of A[1] is A[n] , and the right neighbour of A[n] is A[1].
Now your job is to c[……]
February 24, 2013 Dynamic Programming No comments DP
B – Travelling
Time Limit:3000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
SubmitStatus
Description
After coding so many days,Mr Acmer wants to have a good rest.So travelling is the best choice!He has decided to visit n cities(he insists on seeing all the cities!And he does not[……]
February 24, 2013 Dynamic Programming No comments DP
note: This article comes from the Internet. Please contact me via lethic@163.com if there is any infringement.
lethic@163.com.
E – Sliding Window
Time Limit:12000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
SubmitStatus
Description
An array of size n 106 is given to you. T[……]
February 24, 2013 Dynamic Programming No comments DP
Bone CollectorTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
SubmitStatusPracticeHDU 2602
Description
Many years ago , in Teddys hometown there was a man who was called Bone Collector. This man like to collect varies of bones , such as dogs , cows , also he went to t[……]
February 24, 2013 Dynamic Programming No comments DP
ChoresTime Limit:3000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64u
SubmitStatusPracticePOJ 1949
Description
Farmer John’s family pitches in with the chores during milking, doing all the chores as quickly as possible. At FJ’s house, some chores cannot be started until others have b[……]
February 24, 2013 Dynamic Programming No comments DP
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
SubmitStatusPracticePOJ 1088
Description
Michael Michael
1 2 3 4 5
16 17 18 19 6
15 24 25 20 7
14 23 22 21 8
13 12 11 10 9
24-17-16-125-24-23-…-3-2-1
Input
RC(1
February 24, 2013 Dynamic Programming No comments DP
How to TypeTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
SubmitStatusPracticeHDU 2577
Description
Pirates have finished developing the typing software. He called Cathy to test his typing software. She is good at thinking. After testing for several days, she finds th[……]
February 24, 2013 Dynamic Programming No comments DP
TravelTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
SubmitStatusPracticePOJ 3230
Description
One traveler travels among cities. He has to pay for this while he can get some incomes.
Now there are n cities, and the traveler has m days for traveling. Everyday he[……]
