Error originates: RdWrOT: IFlag = 2 Data mismatch
Search? I only get here. And the results aren’t exactly useful …

你给出的信息太少了,能不能多贴一点出来?

Anyway this almost always seems to be a problem with the collision of the previous and current route. Often I have to increase the number of optimization or SCF cycles because my systems are large and I do optimizations with diffuse functions, which tend to be pretty ill-behaved. Here’s the total head of the log:

******************************************
Gaussian 03: AM64L-G03RevE.01 11-Sep-2007
29-Mar-2009
******************************************
%chk=freq_min60.chk
%nprocshared=8
Will use up to 8 processors via shared memory.
%nproclinda=16
Will use up to 16 processors via Linda.
%mem=100MW
Default route: MaxDisk=200GB
----------------------------------------------------------------------
# freq=restart b3lyp/6-31+g(d) geom=allcheckpoint guess=read int=fmmna
toms=300 scf=tight
----------------------------------------------------------------------
1/10=4,30=1,35=1/3;
99//99;

GradGradGradGradGradGradGradGradGradGradGradGradGradGradGradGradGradGrad
Berny optimization.
Restoring state from the checkpoint file "freq_min60.chk".
Title: min60
Route: # opt b3lyp/6-31+g(d) geom=allcheckpoint guess=read int=fmmnat
oms=300 optcyc=1000 scfcyc=1000
RdWrOT: IFlag = 2 Data mismatch
MaxStp (old) = 504 MaxStp (new) = 2
MaxJob (old) = 1 MaxJob (new) = 1
RdWrOT: Data mismatch on MaxStp/MaxJob
Error termination via Lnk1e in /apps/steele/g03-E.01/l103.exe at Sun Mar 29 01:19:04 2009.
Job cpu time: 0 days 0 hours 0 minutes 13.6 seconds.
File lengths (MBytes): RWF= 49 Int= 0 D2E= 0 Chk= 56 Scr= 1
Command exited with non-zero status 1


I’m posting this more so this error comes up in Google to Vdov so maybe, maybe someone can tell me about it (no one, including people who really know the software well, has been able to provide an acceptable explanation thus far). If the two routes are both optimizations, for instance, you can usually get around this error by eliminating the opt cycle specification in the new restarted route. But if you’re moving the guess and geometry to some new calculation, it’s nearly impossible to get around this. The solution is almost always to create a formatted checkpoint file (formchk) and convert back (unfchk), so the route disappears. You could also obviously do this by specifying the new geometry as a Z-matrix in the initial calculation, but I much prefer to read my initial guess from the checkpoint, so this is not a good option in many cases. Starting the calculation and then restarting from the new binary checkpoint file usually does the trick, as there are appear to be no collisions in the route cycles.

Anyway, cheers. Hopefully someone who knows something about this will let me know.

Let’s say you have a system composed of N different species and you’ve got your xtc trajectory file from the run. Then let’s say you want to know about average cluster sizes of one of the species in the simulation. For some programs in gromacs (not g_clustsize, the one in question here) this is fairly easy because the software lets you specify, either through the program options itself or through an index file, what you’d like to consider. With others though, especially those with options for dealing with molecule statistics explicitly, that don’t allow you to do this for whatever reason. So, a workaround is necessary.

First, edit your input mdp file and topology with extreme prejudice, eliminating or commenting out references to anything you’re not interested in. For instance, in my files, I need to remove all water and ions. I call all these new files “fake” versions of the real files.

$ diff fake_fullmd.mdp fullmd.mdp
15,16c15,16
< xtc_grps = protein ; sol na+ cl-
< energygrps = protein ; sol na+ cl-
---
> xtc_grps = protein sol na+ cl-
> energygrps = protein sol na+ cl-


$ diff fake_topol.top topol.top
163a164,166
> SOL 9529
> NA+ 10
> CL- 10


Make sure you have an index file if you don’t already:

$ make_ndx -f conf.gro


Then dump the first frame of the real simulation. The program (trjconv) will ask you which parts of the frame you’d like to dump.

$ trjconv -f traj.xtc -o fake_protein.gro -s b4md.tpr -n index.ndx -dump 0
...
Select group for output
Group 0 ( System) has 37968 elements
Group 1 ( Protein) has 1568 elements
Group 2 ( Protein-H) has 784 elements
...
Select a group:


Now generate the new input binary for your “fake” system.

$ grompp -f fake_fullmd.mdp -c fake_protein.gro -p fake_topol.top -o fake_b4md.tpr


Convert your trajectory, again selecting whichever part of the trajectory you’re interested in.

$ trjconv -f traj.xtc -o fake_protein.xtc -s b4md.tpr -n index.ndx
...
Select group for output
Group 0 ( System) has 37968 elements
Group 1 ( Protein) has 1568 elements
Group 2 ( Protein-H) has 784 elements
...
Select a group:


Now you’re ready to run your analysis! It won’t actually use the index file you specify here (since you’re only looking at molecules with the -mol option), though it requires it for some reason that eludes me.

$ g_clustsize -f fake_protein.xtc -s fake_b4md.tpr -mol -n index.ndx


And there you have it. Cluster statistics for an arbitrary subset of your system. Cheers.

NOTE: There actually are slightly more elegant ways of doing this, but this is perfectly sufficient for simple situations, like clustering of some molecule in some other explicit medium.

This has been a pretty fun little experiment for me, and I’ve come up with configurations anywhere from relative modesty to incredible setups which would cost tens if not hunders of thousands of dollars and include substantial modifications to wiring and home configuration (network closet anyone?)

Maybe some of you have some ideas. Cheers.

So, of course, people need to know how to do parallel simulations with this code. In all major package managers 4.0.2 hasn’t made it through any appropriate channels, so people have to build it themselves. Unlike most major scientific packages, building Gromacs is absurdly simple. Things are quite beautiful actually.

Anyway, my point isn’t to extol the virtues of Gromacs but rather to suggest that if something doesn’t work, do the initial work to figure out the problem and exhaust at least the most obvious problems with the software before throwing your hands up in the air. Problem with MPI? Test it first! Anyone working with MPI should at the very least be able to look up how to write a basic MPI application.

An example:

#include "stdio.h"
#include "mpi.h"

int
main(argc, argv)
int   argc;
char  *argv[];
{
  int  rank, size, length;

  char name[MPI_MAX_PROCESSOR_NAME];

  MPI_Init(&argc, &argv);
  MPI_Comm_rank(MPI_COMM_WORLD, &rank);
  MPI_Comm_size(MPI_COMM_WORLD, &size);
  MPI_Get_processor_name(name, &length);

  printf ("process %d of %d on %s\n", rank, size, name);

  MPI_Finalize();

  return 0;
}

If you’re on a modern Debian or Ubuntu build with OpenMPI installed (pretty much the standard MPI implementation you should be using), then build.

$ mpicc.openmpi -o hello hello.c
$ mpirun.openmpi -np 4 hello
process 1 of 4 on enskog
process 2 of 4 on enskog
process 3 of 4 on enskog
process 0 of 4 on enskog

I do love my MPI. And Gromacs does dynamic load balancing now … so freaking fast.

Cheers.

The article capitalizes on the tendency of popular songs to evolve from long and content-rich ballads to highly repetitive texts with little or no meaningful content.

[...]

“…our ancient ancestors invented the concept of refrain” to reduce the space complexity of songs, which becomes crucial when a large number of songs is to be committed to one’s memory.

[...]

Finally, progress during the twentieth century—stimulated by the fact that “the advent of modern drugs has led to demands for still less memory”—leads to the ultimate improvement: Arbitrarily long songs with space complexity O(1), e.g. for a song to be defined by the recurrence relation.

We’ve really taken the concept to heart in modern popular music haven’t we? See here for explanation and here for the original paper.

Cheers.

For all its size, one of the areas where I have been left completely unsatisfied is in support for threads. Yes, of course POSIX threads are there and I’ve had some success implementing them in some of my older, now completely obsolete C code which I never want to look at again. It’s baffling to me that there is nothing in the STL which develops some nice thread classes. I know there are at least 2 (if not more) very experienced C++ programmers who read vdov.net, and I’m looking for advice. Have you looked at some developed thread classes and if so what have you thought? Recommendations? I would really rather not have to write my own thread classes from scratch (especially since accessing the C pthread library would be a nightmare here), as this is both utterly useless for my research and, well, I’d probably screw it up with near-fledgling knowledge of the language.

Cheers.

Typically, such books are shorter than those I use for reference and much longer than a wikipedia article – they are in between. I’ve taken to calling these books “tweeners” (n., pl., pronounced tee-wieners), as in “they are be-tween-ers”. Another possible term was “t’ain’ts” (n., pl., a contracted contraction of it with ain’t), as in “t’ain’t a wikipedia article and t’ain’t a reference book”. While I prefer the equally appropriate term t’ain’t, the unfortunate (inappropriate) slang meaning justifies avoiding this collision of terminology (no link). There are also less severe collisions with “tweener”:

Let it be understood that I am not referring to a tweener, n., (1) a person capable of playing multiple positions in a sport, (2) a person that falls between two age generations, (3) a bowling form, (4) a hobbit between the ages of 20 and 32 or (5) a man that looks like a woman or vice versa.

Currently, I’m reading A.I. Khinchin’s “Mathematical Foundations of Statistical Mechanics”. It’s definitely a tweener! As far as I know, the readers (and writers) of vdov.net are a diverse group. Do you have a tweener? Are you man, woman, man that looks like a woman, woman that looks like a man or hobbit enough to share it?

If you simply break the box up into 8 pieces, the easiest possible way to do this is just to simply cut through the planes of the box. The faces of the global box do not exist on processor boundaries, as I apply boundary conditions on all these faces. Each cutting plane has 200 x 200 faces, so you don’t need a CS or math degree to know that the number of processor faces in this case would be 120,000. Is this what METIS gives you? No! It gives you 164,033 processor faces. What the hell?

Here’s a little graph of what this looks like (excuse my very quick and dirty xfig’ing). The width of the boundaries is directly related to the number of processor-processor faces between each decomposed domain.

While there is some obvious symmetry here (within a certain level of approximation), this yields far from the cleanest solution. While METIS may be fantastic for complex domains, it doesn’t do well with simple domains with obvious symmetry. Further, each domain should have a maximum of 3 processor-processor boundaries! It’s important to note here that in fact each processor has 3 major processor-processor boundaries (each node has 3 wide connections — this tell us that METIS is in fact roughly trying to get to the optical structure described above). It’s all the little connections that would be removed with some knowledge of the basic full domain structure. I understand and perhaps believe that this could all be due to some convergence criteria in the method which I am unaware of (in my reading of the papers on the subject and the code itself I haven’t found any such parameter), though still, I see no reason why some from-end part of the algorithmic implementation shouldn’t take into consideration the symmetry of the large and subdomain groups.

Cheers.

[UPDATE after the jump]

UPDATE: Here are two images from the processor 1 set. I think everyone should be able to see what I mean now.

hold on;
for k = 1:numfiles
  for l = 1:numexpt
    if (isequal(char(grp(k)),expt(l).name)) pplot(l) = ...
    plot(P(k,compa),P(k,compb),plothash_a{l}, ...
    'MarkerSize',10,'MarkerEdgeColor','k','MarkerFaceColor',plothash_c{l});
    end
  end
end

Indeed, this works very well. So, let’s say instead I want to plot in 3D. So, I use the command ‘plot3′ instead of ‘plot’. Of course, one would expect this to be very simple. The part here that counts looks like:

hold on;
[...]
if (isequal(char(grp(k)),expt(l).name)) pplot(l) = ...
plot3(P(k,compa),P(k,compb),P(k,compc),plothash_a{l}, ...
'MarkerSize',10,'MarkerEdgeColor','k','MarkerFaceColor',plothash_c{l});
[...]

Knowing that plot3 is the correct command, this produces a 2D plot only representative of the P(k,compa),P(k,compb) data segment. What the hell? So it turns out that if you hold a new plot with ‘hold on’, Matlab assumes you want a 2D plot. Then upon trying to plot in 3D, Matlab decides it is smarter than you are and that clearly your choice of a 2D plot outweighs your decision to use the ‘plot3′ command, and plots in 2D anyway without throwing an error. Why would ‘plot3′ tell me nothing??? I realize this is a pretty trivial complaint and there are plenty of other great examples of ridiculous crap in Matlab that makes no sense.

Anyway, done complaining. In a ton of data processing Matlab demos, the program asks you to important a series of files into a one data matrix, and does it with some very clumsy code that requires you to manually change the program every time you move to a new data set. Not really my style. Let’s say you have a bunch of data vectors organized in a series of directories (happens all the time), where the directories are representative of some data group that should be accessible as a unit. How about something like this:

repository = pwd;
expt = dir('*.enabled');
numexpt = size(expt,1);
for i = 1:numexpt
  repo{i} = strcat(repository,'/',expt(i).name,'/');
  file(i,:) = dir([repo{i} '*.csv']);
  num(i,:) = numel(file(i,:));
  files(i,:) = strcat(repo{i},{file(i,:).name});
end
expt = transpose(expt);
file = transpose(file);
num = transpose(num);
files = transpose(files);
numfiles = numel(files);
for k = 1:numfiles
  [X,Y(:,k)] = textread(files{k});
end

I use the transposes just because they are nice later in my code, they are certainly not required. I am no Matlab programmer, and I know some of you out there are, so any suggestions as to better file import mechanisms would be greatly appreciated. Short of that though, this is a million times better and far more general than the crap they put you through in the Matlab demos (specifically anything in the bioinformatics sections).

Cheers.

I think I read (though I can’t seem to find the reference anywhere) an interview with Linus Torvalds recently in which he said something like the following (if you know the reference feel free to let me know, I’m pretty sure it was on Kernel Trap this year sometime):

I don’t use Debian or any other ‘low-level’ Linux flavors because I feel like Linux should be easy to use and manageable for day-to-day work, etc.

Those of you that know me well probably know that I have made nothing short of a career in the past 3 years going exactly in the opposite direction here. Recently however, I decided to take the plunge for a number of reasons. They are briefly: 1) I’ve got way too many machines to take care of these days, 2) I love Debian but on laptops I find it a bit annoying to have to configure dynamic things every time I move and 3) Recently I screwed up a bunch of my machines and decided it was time to reinstall them, 4) Being ridiculously OCD I needed to have all my machines running the same software and they all basically need to look the same. Lastly, and definitely most importantly, Ion3 was really having trouble running a lot of the software I needed to run, including Fluent (ANSYS), Gambit, Matlab, etc. So all these things together, along with my acquisition of a brand new laptop, made me decide to take the plunge and reinstall all my machines with … (drum-roll), 64-bit Ubuntu.

Generally I’m pretty happy with my choice. I loved the Ion3 window manager and Debian in general, but Ubuntu is basically Debian with some fancy crap built on top of it. So the backend is basically the same. Plus the update cycle is way better in Ubuntu … well, at least faster. As far as using Gnome, I’m not completely sold yet. I sort of like it … I guess, and I’m getting used to it. But I do miss the simplicity of Ion3. I don’t, however, miss configuring everything manually in Debian for my laptop or the huge number of problems I had with applications really not liking the Ion3 windowing model.

Oddly, Ubuntu Gusty’s (7.10) compositing window manager (Compiz Fusion 0.52) is pretty annoying. There are really no real benefits to it so far as I can tell, other than Aero/Aqua-type effects. And there are plenty of annoyances. As I first got back to reinstalling my systems, basically everything that didn’t work with Ion3 well also didn’t work with Compiz, so I had to disable it out of the box on all of my machines. Annoying.

Alec turned me on to ‘unison’ as a nice little remote folder syncing utility, which is quite wonderful. I use it now to sync my document tree between my 3 work machines (work laptop, work desktop and home desktop). It’s designed for just 2 machines but it works equally well with 3.

I also got a nice new laptop recently, a Dell Latitude D430, which is their ultra-portable business machine. I’ve used it extensively already and generally I’m quite happy with it. Ubuntu runs great on it — I haven’t really been able to detect even the slightest hitch yet — it’s got fantastic battery life and the performance sacrifices due to ultra-portability and long battery life really don’t affect me in the slightest. It’s really going to be brilliant to be able to work on a plane or while traveling, not to mention when I just need to get out of lab for any number of reasons (there are lots of them).

I’m not sure I have much else to say. Lots of real work to get done since my OP is over, as my boss wants to publish pretty soon and I really don’t have enough yet done to do that. Hopefully I’ll be writing paper #2 in February. I doubt anyone will really care about this post but it’s here for you if you like; I had to write something, this place is dead. Hey you … write something for vdov.

Cheers.

As evidenced by your almost immediate response to the release of the iPhone on your mobile updates page for real-time info, stats and pitch-by-bitch play, some non-trivial number of your customers must have iPhones by now. Anyone who reads this site with any regularity would know that I waited in line to get an iPhone on the day it was released, and was pleased by your response. Even though most of the places I watch or check baseball have some sort of Wi-Fi, I still prefer the low-bandwidth version a large part of the time. However recently you have decided to put a banner ad across the top of most of these pages. This means that on any of the real-time game stat and pitch-by-bitch windows, the most important stats are now obfuscated as there is no longer enough real estate on the iPhone screen, and no real way to scale the image. This is pretty much me just whining however it has resulted in me not using that page very much anymore. If it is necessary to use ads at all, I am sure there is a more logical way to place that ad so the content doesn’t suffer.

Thank you,
acosta

This morning the people over at TNC emailed me this morning because their site was down. Indeed, wordpress couldn’t talk to MySQL. I logged in to find a load of >70 on the machine. Since the machine was almost completely unresponsive, I just started killing likely culprits, thinking this was a similar issue that had cropped up before in RHEL4+Apache/2.0.52 (don’t get me started … I fully hate Red Hat). Turns out they had a user-level comprimise for some random Red Hat user ‘netdump’. Without getting into the specifics, they had installed a nice little ftp scanner and a 500k dictionary for a pretty random looking brute-force attack.

What is particularly amazing in this case is it is in fact completely random over 0-255.0.0/16 and tries to log in only as “Administrator”, a user typically seen in Windows environments. This application had not more than 1 hour to run, and easily recovered 131 admin passwords over the 210/8 block (Asia). Now, having cleaned this particular crap from their machine, I’m sitting on a log file of 131 admin passwords for all sorts of machines in Asia, including some fairly large corporations, and in a fairly ironic twist, a number of network security firms. Aside from your standard bad admin passwords including ‘123qwe’, ‘123456′, ‘administrator’, ‘pineapple’, ’software’, ‘root’, the dictionary included in this particular scanner sheds some light as to other ways people create “secure” passwords. For instance, ‘!@#$%’ is the logical replacement for ‘12345′, but modern dictionary attacks aren’t fooled.

So anyway, what should I do with all this information. Purge it? I’m not going through the trouble of emailing noc/abuse/postmasters about this.

Cheers.

pts/4 root@enskog:/etc/apt # apt-cache policy iceweasel
iceweasel:
  Installed: 2.0.0.5-0etch1+lenny1
  Candidate: 2.0.0.5-0etch1+lenny1
  Version table:
     2.0.0.6-1 0
        500 http://debian.osuosl.org unstable/main Packages
     2.0.0.6-0etch1 0
        600 http://security.debian.org stable/updates/main Packages
 *** 2.0.0.5-0etch1+lenny1 0
        900 http://security.debian.org testing/updates/main Packages
        100 /var/lib/dpkg/status
     2.0.0.3-1 0
        600 http://debian.osuosl.org stable/main Packages
        900 http://debian.osuosl.org testing/main Packages

I just thought it was a little funny. If you use Debian or Ubuntu and Co., you might get it.


title Debian GNU/Linux, kernel 2.6.21-2-amd64 (bootchart mode)
root (hd1,0)
kernel /boot/vmlinuz-2.6.21-2-amd64 root=/dev/sdb1 ro init=/sbin/bootchartd
initrd /boot/initrd.img-2.6.21-2-amd64
savedefault


For most of you the only real difference is the addition of ‘init=/sbin/bootchard’ to the kernel line. I added a new selection to my grub menu for this but I suppose you could run it at every boot … though I can’t imagine this being that fun more than once or twice. Here’s the image of what I ended up with on my machine at work (8 processor Xeon, 16 gigs of RAM and 15K disks).

Cheers.

Commercials don’t do this thing justice. It is just simply fun to use. I haven’t really found a single glitch so far. The notes and calculator applications are a little ugly and look rushed, but I imagine in time these will be fixed or people will get used to them. Their functionality isn’t bad … just a little ugly. I could also use some more information about the phone. I, like many people, filter connections to my wireless access points and I needed to know it’s MAC address. That information wasn’t available, so I had to put it on another hub and arp the thing, which was a little annoying.

It does, however, work flawlessly as advertised. Interestingly though, I started doing some traffic dumps from the WiFi interface of the phone, and found that all of those network applications actually get all their data from Apple, not Yahoo (weather) or Google (maps). In fact all application data comes from wu.apple.com. Based on it’s IP it appears to actually be an Apple machine. So … am I to understand that all Google’s map data is specifically reorganized for Apple and sent to them? Can the application actually interpret the raw data from Google’s machines, or are there a fair number of processing steps between Google’s data and the device data? A simple scan of the device from another machine on my local network indicates that it’s pretty locked down. Nothing is open. On another note: EDGE is surprisingly zippy on this device … it certainly was NOT on my last EDGE device. I don’t know if this is from the rumored EDGE network upgrades or the iPhone itself. Regardless, I’m pretty happy with this thing.

Cheers.

nspluginwrapper -i /usr/lib/mozilla/plugins/libflashplayer.so

which will create the file npwrapper.libflashplayer.so in that plugins directory. That’s it. You’re done. Flash 9 works. Brilliant. Now I can waste away time watching YouTube at work, which is really all I was looking for anyway.

The most important feature for me is the grouping management. It has a nice way of grouping articles. For instance, given this and other entries (which I imported automatically by just searching for the title in Jabref),

@ARTICLE{Wu2004,
  author = {Biao Wu and Philip I. Cohen and L. C. Feldman and Zhenyu Zhang},
  title = {Controlling film growth with selective excitation: Chemical vapor
        deposition growth of silicon},
  journal = {Appl. Phys. Lett.},
  year = {2004},
  volume = {84},
  pages = {2175-2177},
  number = {12},
  abstract = {We propose a method of controlling the growth mode in an epitaxial
        system. It takes advantage of differences in the vibrational frequencies
        of adatom–substrate bonds at terraces and steps. With a properly
        tuned infrared laser, one can selectively excite only the adatom–substrate
        bonds at steps and enhance the mobility of these adatoms, consequently
        promoting step-flow growth and reducing film roughness. The feasibility
        of this method is shown theoretically with respect to the prototype
        system of chemical vapor deposition growth of silicon.},
  doi = {10.1063/1.1687452},
  url = {http://dx.doi.org/10.1063/1.1687452}
}

The following is added to the end of the file to organize it into the group “Seminar”.

@comment{jabref-meta: groupstree:
0 AllEntriesGroup:;
1 ExplicitGroup:Second Year Report\;0\;Babinsky2002\;Bird1994\;Cole200
0\;Courant1967\;Faeth1995\;Hinds1999\;Hirt1971\;Kauppila2006\;Kebarle2
000\;March1995\;Nguyen2007\;Oran1998\;Seinfeld1997\;Venter2006\;Verste
eg1995\;Weller1998\;;
1 ExplicitGroup:Seminar\;0\;Chuang1981\;Hussla1985\;Jakob1991\;Liu2006
\;Redlich2006\;Wu2004\;Zhu1994\;Zimmerman1995\;;

...

Articles can be in many groups and Jabref includes nice relational database-like tools to deal with searching, etc. So now I can keep one file with a complete database of my reference library, well organized, in my subversion repository, distributed to all my machines. Cheers.