Table Virtual World

2008-10-25T09:50:00.000-07:00

Table Virtual World <br /></head> <br /><body> <br /><applet code="org.jdesktop.applet.util.JNLPAppletLauncher" <br /> width=512 height=512 <br /> archive="lei-tableworld.jar, <br /> http://download.java.net/media/applet-launcher/applet-launcher.jar, <br /> http://download.java.net/media/java3d/webstart/release/j3d/latest/j3dcore.jar, <br /> http://download.java.net/media/java3d/webstart/release/j3d/latest/j3dutils.jar, <br /> http://download.java.net/media/java3d/webstart/release/vecmath/latest/vecmath.jar, <br /> http://download.java.net/media/jogl/builds/archive/jsr-231-webstart-current/jogl.jar, <br /> http://download.java.net/media/gluegen/webstart/gluegen-rt.jar"> <br /> <param name="codebase_lookup" value="false"> <br /> <param name="subapplet.classname" value="edu.nova.j3d.tableworld.Table"> <br /> <param name="subapplet.displayname" value="Java 3D Project1"> <br /> <param name="jnlpNumExtensions" value="1"> <br /> <param name="jnlpExtension1" value="http://download.java.net/media/java3d/webstart/release/java3d-latest.jnlp"> <br /> <param name="progressbar" value="true"> <br /> <param name="noddraw.check" value="true"> <br /></applet> <br /><p> <br /></br> <br />Java3D Table Virtual World Features <br /><ul> <br /> <li>The table is created with 4 legs. </li> <br /> <li>There are 7 objects (a lamp, a lightened box next to the lamp with a shade plane, an un-lightened lod, an image texture, a cart, a collision sensor and a water pool) that sit on the table top. In addition, there are 3 objects (the clock, the 3D photo and the moving star) in the universe, which is out of the table plane.</li> <br /> <li>The 3D wall image texture on the table is capable of being dragged across the table top by click and holding the left mouse key while dragging. </li> <br /> <li>The red lod will be translated to the predefined upper coordinated location back and forth while the mouse key is clicked. </li> <br /> <li>The 3D wall image texture will rotate in place with angle of 1 as the mouse key is clicked. </li> <br /> <li>The lighting effect is shown during the cycle of the moving of the star. </li> <br /> <li>The red lod will be translated to the predefined upper coordinated location back and forth while the mouse key is clicked. </li> <br /> <li>The 3D wall image texture will rotate in place with angle of 1 as the mouse key is clicked. </li> <br /> <li>The lighting effect is shown during the cycle of the moving of the star. </li> <br /> <li>The objects that exhibit behavior by cutomized Behavior class:a star is animated to move around the table and the water stand creates water pool. A clock is animated with ticking of clock. The cart is animated to move back and forth.</li> <br /> <li>All objects except the box are geometry objects created by LineArray, LineStripArray, TriangleFanArray, TriangleStripArray, QuadArray and IndexedQuadArray to replace the feature of VRML IndexedFaceSet node. </li> <br /> <li>All objects except the box are geometry objects created by LineArray, LineStripArray, TriangleFanArray, TriangleStripArray, QuadArray and IndexedQuadArray to replace the feature of VRML extrusion node. </li> <br /><li>The table can be dragged to any location by pointing to table and holding mouse key, but to go back to the original location by exit browser and restart the applet for convenience</li> <br /></ul> <br /></p> <br /> <br /><p> <br /> <br /></p> <br /> <br /></body> <br /> <br /></html> <br /> <br /><div class="blogger-post-footer"></div> </article> <article> <h1>VPN & Ubuntu</h1> <p>2008-09-16T08:05:00.000-07:00</p> My network pauses was resolved, and it seems to be the NetworkManager<br />not using the madwifi driver.<br /><br />In this case, following in daemon.log are used<br />"blah....NetworkManager: <info> Supplicant state changed 0" // when pausing<br />"blah....NetworkManager: <info> Supplicant state changed 1" // on resume<br /><br />The solution is to use "wicd", which works perfectly with the madwifi/atheros driver.<br />The directions are here<br /><a href="http://wicd.sourceforge.net/download.php">http://wicd.sourceforge.net/download.php</a>.<br /></info></info><div class="blogger-post-footer"></div> </article> <article> <h1>Q-learning vs Model-based or knowledge-based Methods</h1> <p>2008-09-13T10:48:00.000-07:00</p> 1. Learn action-value representation -- Q value instead of learning utility<br />2. Denote Q-values related to utility values<br />3. Q function is a way of utility function, but Q function does not need a model for learning action selection. So it is model free since temporal difference does not need to know transition model but only handle the changes. How to deal with the things are no-change. It is a frame problem.<br />4. Agent function (an evaluation function) is represented by Q function instead of model + utility function<br />5. Traditional AI is to build knowledge-based method (build a representation of some aspect of the environment in which agent is situated).<br />6. environment becomes complex, the advantages of a knowledge-based approach become more apparent. Knowledge-based model representation has met more success than Q-learning methods<div class="blogger-post-footer"></div> </article> <article> <h1>zpool iostat -v ------------------ df-kh</h1> <p>2008-09-11T07:49:00.000-07:00</p> zpool iostat -v is much more intuitive than df -h<div class="blogger-post-footer"></div> </article> <article> <h1>Transform Discontinuous Function into Differentiable Function</h1> <p>2008-09-11T07:22:00.000-07:00</p> A discrete independent variable leads to a discontinuous function. A infinitesimal change in the independent variable causes the dependent variable to switch from one variable to another. This means that the value of the policy may also change discontinuously, which makes gradient-based search difficult.<br /><br />Softmax function : transform from a discontinuous function into differentiable function<div class="blogger-post-footer"></div> </article> <article> <h1>CERN LHC & Storage with Data Management</h1> <p>2008-09-11T07:16:00.000-07:00</p> <pre wrap=""><a class="moz-txt-link-freetext" href="http://gridcafe.web.cern.ch/gridcafe/animations/LHCdata/LHCdata.html">http://gridcafe.web.cern.ch/gridcafe/animations/LHCdata/LHCdata.html</a><br /><br /><br />It is an amazing new age of science. It claimed 20 petabyte by<br />annual basis. Large storage and data management practices.<br /><br /></pre><div class="blogger-post-footer"></div> </article> <article> <h1>DS 6.x instance configuration</h1> <p>2008-09-11T07:14:00.000-07:00</p> <div> To configure 3 instances of DS, created on different host, (different IP and the same port) </div><div> under the same domain. With DSEE 6.x, it is possible to create and configure instances on those machines from the Directory Service Control Center (i.e. DSEE 6 Console).</div><div class="blogger-post-footer"></div> </article> <article> <h1>Mobile Data Management and Mobile Agent</h1> <p>2008-09-11T07:11:00.000-07:00</p> <pre wrap=""> * Data management in wireless networks<br /> * Data management in sensor and mobile ad hoc networks<br /> * Data management in mobile peer-to-peer networks<br /> * Data mining for mobile applications<br /> * Data presentation, scripting and exchange languages<br /> * Data replication, migration and dissemination in mobile environments<br /> * Data stream processing in mobile/sensor networks<br /> * Indexing and query processing for moving objects<br /> * Location and mobility semantics<br /> * Location tracking of vehicles and moving objects<br /> * Metadata management and exchanges<br /> * Mobile access to the Web<br /> * Mobile agents<br /><br /><br />A conference: Mobile Data Mangement (MDM'09): Systems, Services and Middleware </pre><div class="blogger-post-footer"></div> </article> <article> <h1>LB and DS FD overflow</h1> <p>2007-10-24T10:18:00.000-07:00</p> Load Balancer will use tcp_connect to ping downline systems it is protecting, and since this is not a protocol understood by the app, you get that error. It also winds up leaving an orphaned FD <b class="moz-txt-star"><span class="moz-txt-tag">*</span>each<span class="moz-txt-tag">*</span></b> time.<br /><br />If you do find a LB is the source, the solution is to reset the LB to use an acceptable protocol (http for web, ldap for DS, etc.). Most all the LB's have ready-to-use scripted options in their config-options.<br /><br />Although its not a true fix, another option is to reset the idletimeout onthe DS to soemthing like 900/1800s so it can recoup the wasted FD's periodically. This is a fine temporary fix, sometimes cu's leave that situation in that state for years. But the true fix is to re-config the LB to use the proper protocol .<div class="blogger-post-footer"></div> </article> <article> <h1>cron script from open solaris</h1> <p>2007-10-24T06:52:00.000-07:00</p> <pre wrap=""><br /></pre><pre wrap=""><span class="moz-txt-citetags"></span>For every command in the script?<br /><span class="moz-txt-citetags"></span><br /><span class="moz-txt-citetags"></span><a class="moz-txt-link-freetext" href="http://cvs.opensolaris.org/source/xref/jds/spec-files/trunk/cron-script.sh">http://cvs.opensolaris.org/source/xref/jds/spec-files/trunk/cron-script.sh</a><span class="moz-txt-citetags"></span><br /><span class="moz-txt-citetags"></span>See if a single command experiment working first<br /><span class="moz-txt-citetags"> </span><br /><span class="moz-txt-citetags">> </span>Where does the redirection go? Inside the quoted command or for zlogin?<br /><span class="moz-txt-citetags">> </span>zlogin -l gbuild big-zone "the_command <span class="moz-txt-citetags">> </span>zlogin -l gbuild big-zone "the_command" </pre><div class="blogger-post-footer"></div> </article> <article> <h1>DS DB index out of sync-poor performance</h1> <p>2007-10-24T06:46:00.000-07:00</p> <div style="margin: 0px;">DS is observed slower search response time on Solaris 10U3 compared to Windows. The cache size is the same on the two boxes, even though it should be bigger on solaris (windows is 32bit, solaris is 64).<br /></div><div style="margin: 0px; min-height: 14px;"><br /></div><div style="margin: 0px;">This search for example shows different etimes consistently :</div><div style="margin: 0px; min-height: 14px;"><br /></div><div style="margin: 0px;">On Windows the search took 0.079000 seconds :</div><div style="margin: 0px; min-height: 14px;"><br /></div><div style="margin: 0px;">[19/Oct/2007:15:33:41 +0200] conn=2062529 op=1 msgId=2 - SRCH base="ou=qp_na02,ou=apps,ou=internal,o=ericsson" scope=2 filter="(&(objectClass=groupOfUniqueNames)(uniqueMember=UID=XBMVIVI,OU=Partners,OU=External,O=ericsson))" attrs="cn"</div><div style="margin: 0px;">[19/Oct/2007:15:33:42 +0200] conn=2062529 op=1 msgId=2 - RESULT err=0 tag=101 nentries=114 etime=0.079000</div><div style="margin: 0px; min-height: 14px;"><br /></div><div style="margin: 0px;">however this same search took 0.320350 seconds on solaris :</div><div style="margin: 0px; min-height: 14px;"><br /></div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] conn=460 op=1 msgId=2 - SRCH base="ou=qp_na02,ou=apps,ou=internal,o=ericsson" scope=2 filter="(&(objectClass=groupOfUniqueNames)(uniqueMember=UID=XBMVIVI,OU=Partners,OU=External,O=ericsson))" attrs="cn"</div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] conn=460 op=1 msgId=2 - RESULT err=0 tag=101 nentries=114 etime=0.320350</div><div style="margin: 0px; min-height: 14px;"><br /></div><div style="margin: 0px; min-height: 14px;"><br /></div><div style="margin: 0px;">In the solaris errors logs, i see lines like this "candidate <candidate> not found" :</candidate></div><div style="margin: 0px; min-height: 14px;"><br /></div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] - INFORMATION<span class="Apple-converted-space"> </span>- conn=-1 op=-1 msgId=-1 -<span class="Apple-converted-space"> </span>SRCH base="ou=qp_na02,ou=apps,ou=internal,o=ericsson" scope=2 deref=0 sizelimit=0 timelimit=0 attrsonly=0 filter="(&(objectClass=groupOfUniqueNames)(uniqueMember=UID=XBMVIVI,OU=Partners,OU=External,O=ericsson))" attrs="cn"</div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] - INFORMATION<span class="Apple-converted-space"> </span>- conn=-1 op=-1 msgId=-1 -<span class="Apple-converted-space"> </span>mapping tree selected backend : unix</div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] - INFORMATION<span class="Apple-converted-space"> </span>- conn=-1 op=-1 msgId=-1 -<span class="Apple-converted-space"> </span>mapping tree release backend : unix</div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] - INFORMATION<span class="Apple-converted-space"> </span>- conn=-1 op=-1 msgId=-1 -<span class="Apple-converted-space"> </span>mapping tree selected backend : userRoot</div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] - DEBUG<span class="Apple-converted-space"> </span>- conn=-1 op=-1 msgId=-1 - <span class="Apple-converted-space"> </span>be: 'o=ericsson' indextype: "eq" indexmask: 0x2</div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] - DEBUG<span class="Apple-converted-space"> </span>- conn=-1 op=-1 msgId=-1 - <span class="Apple-converted-space"> </span>be: 'o=ericsson' indextype: "eq" indexmask: 0x2</div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] - DEBUG<span class="Apple-converted-space"> </span>- conn=-1 op=-1 msgId=-1 - <span class="Apple-converted-space"> </span>be: 'o=ericsson' indextype: "eq" indexmask: 0x2</div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] - DEBUG<span class="Apple-converted-space"> </span>- conn=-1 op=-1 msgId=-1 - <span class="Apple-converted-space"> </span>be: 'o=ericsson' indextype: "eq" indexmask: 0x2</div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] - DEBUG<span class="Apple-converted-space"> </span>- conn=-1 op=-1 msgId=-1 -<span class="Apple-converted-space"> </span>candidate 306256 not found</div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] - DEBUG<span class="Apple-converted-space"> </span>- conn=-1 op=-1 msgId=-1 -<span class="Apple-converted-space"> </span>candidate 307389 not found</div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] - DEBUG<span class="Apple-converted-space"> </span>- conn=-1 op=-1 msgId=-1 -<span class="Apple-converted-space"> </span>candidate 309528 not found</div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] - DEBUG<span class="Apple-converted-space"> </span>- conn=-1 op=-1 msgId=-1 -<span class="Apple-converted-space"> </span>candidate 309532 not found</div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] - DEBUG<span class="Apple-converted-space"> </span>- conn=-1 op=-1 msgId=-1 -<span class="Apple-converted-space"> </span>candidate 309538 not found</div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] - DEBUG<span class="Apple-converted-space"> </span>- conn=-1 op=-1 msgId=-1 -<span class="Apple-converted-space"> </span>candidate 309542 not found</div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] - DEBUG<span class="Apple-converted-space"> </span>- conn=-1 op=-1 msgId=-1 -<span class="Apple-converted-space"> </span>candidate 309726 not found</div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] - DEBUG<span class="Apple-converted-space"> </span>- conn=-1 op=-1 msgId=-1 -<span class="Apple-converted-space"> </span>candidate 309866 not found</div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] - DEBUG<span class="Apple-converted-space"> </span>- conn=-1 op=-1 msgId=-1 -<span class="Apple-converted-space"> </span>candidate 309877 not found</div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] - DEBUG<span class="Apple-converted-space"> </span>- conn=-1 op=-1 msgId=-1 -<span class="Apple-converted-space"> </span>candidate 309878 not found</div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] - DEBUG<span class="Apple-converted-space"> </span>- conn=-1 op=-1 msgId=-1 -<span class="Apple-converted-space"> </span>candidate 309881 not found</div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] - DEBUG<span class="Apple-converted-space"> </span>- conn=-1 op=-1 msgId=-1 -<span class="Apple-converted-space"> </span>candidate 309898 not found</div><div style="margin: 0px;">[19/Oct/2007:17:02:30 +0200] - INFORMATION<span class="Apple-converted-space"> </span>- conn=-1 op=-1 msgId=-1 -<span class="Apple-converted-space"> </span>mapping tree release backend : userRoot</div><div style="margin: 0px; min-height: 14px;"><br /></div><div style="margin: 0px; min-height: 14px;"><br /></div><div style="margin: 0px;"> it looks like the index is out of sync.</div><div style="margin: 0px; min-height: 14px;"><br /></div><div class="blogger-post-footer"></div> </article> <article> <h1>Zone attaching to shared storage</h1> <p>2007-10-24T06:41:00.000-07:00</p> <pre wrap="">Using "attach -F" (ie capital F) you can attach a shared storage<br />to a different zone even it is not de-attached with it's original<br />zone, if you previously created the zone configuration via "zonecfg -z <zonename><br />..." like on the original host.<br /><br />Of course you must make sure that only one node is really booting the<br />zone at a time.</zonename></pre><div class="blogger-post-footer"></div> </article> <article> <h1>Scheme Setup</h1> <p>2007-10-11T13:01:00.000-07:00</p> (1) install <a href="http://www.scheme.com/petitechezscheme.html">Petite Chez Scheme</a><br />(2) install eopl source code<br />(3) change dir<br /><br />(cd "/home/test/eopl/intercept")<br />(3) init code<br /><br />(load "chez-init.scm")<div class="blogger-post-footer"></div> </article> <article> <h1>DB cache size for large DB on DS</h1> <p>2007-10-08T19:28:00.000-07:00</p> The best results with a maximum of about 50 GB in database cache because of checkpoints. That is a concern here. But response times is over 1 second. It is caused by check pointing, reducing the db cache size may help. A very large db, and not a lot of memory. <br /><br />(1) Set both the entry cache and db cache to 100 mb each offered the best performance - allowing the fs cache to do everything. This was on Solaris 10 with the latest updates for ZFS. <br />(2) modified the file system partitions to force direct io on the ones we didn't want being cached - this way we reserved more of the fs cache for LDAP. <br />(3) Like if your logs are on a separate FS then you can exclude that mount, etc. For the partition/disk that holds the database, set: "noatime" & "logging", and if "/data" is the disk that holds the database, set: tunefs -e 2097152 /data<div class="blogger-post-footer"></div> </article> <article> <h1>Host name vs Security Compliance</h1> <p>2007-10-06T07:30:00.000-07:00</p> (1) update with latest security patches and fixes for OS, Tools, dependencies<br />(2) ensure no hostname is embeded in any UI component<br />(3) no host name in URL or CLI<div class="blogger-post-footer"></div> </article> <article> <h1>News Analysis</h1> <p>2007-10-03T18:45:00.000-07:00</p> <span class="q">I'm doing a Master's Thesis project based on scanning web-based news<br />topics and analyzing their frequency. I have a table containing rows that<br />represent groups of news stories about a particular topic<br /><br /><br /></span><div class="blogger-post-footer"></div> </article> <article> <h1>Adding Missing Values for Random Variables</h1> <p>2007-10-03T18:40:00.000-07:00</p> Missing values for real-valued attributes could be implemented via Laplacian smoothing, by adding one initial default value to every attribute, either the mean of available observations for the attribute, or the mean of observations for some other similar subset of attributes, including possibly the set of all attributes.<br /><span class="ad"><br /></span><div class="blogger-post-footer"></div> </article> <article> <h1>How to define a set of values</h1> <p>2007-09-29T09:59:00.000-07:00</p> BNF is the way to define a set of values. This set of rule calls grammar ---- BNF grammar defines a set of values.<br /><br /><list-of-numbers> <list-of-numbers> ::= ()<br /><list-of-numbers> <list-of-numbers> ::= (<number><number>.<list-of-numbers><list-of-numbers>)<br /></list-of-numbers></list-of-numbers></number></number></list-of-numbers></list-of-numbers></list-of-numbers></list-of-numbers><div class="blogger-post-footer"></div> </article> <article> <h1>ZFS and DS</h1> <p>2007-09-27T19:08:00.000-07:00</p> MODS/WRITES with ZFS compression<br />It would seem that using ZFS with compression could theoretically yield some amazing write performance but I haven't done any testing myself yet. Any figures or observations here?<br /><br />CACHE COMPRESSION?<br />I'm not sure what they meant there because I have seen that ZFS uses ARC for relinquishing memory to cache However, the memory relinquishing algorithm was less than desirable for database apps . But cache compression was to minimize the memory footprint of the DS entries within the FS cache which sounds great, if it were possible, for large databases.<div class="blogger-post-footer"></div> </article> <article> <h1>Lamda Calculus</h1> <p>2007-09-27T15:31:00.000-07:00</p> <b>lambda calculus</b>, also <b>λ-calculus</b>, is a formal system designed to investigate (1)function<span style="text-decoration: underline;"></span> definition, (2)function application (3) recursion.<br /><br />Lambda calculus can be used to define (1) what a <span style="font-weight: bold;">computable function</span> is. The question of whether two lambda calculus expressions are equivalent cannot be solved by a general algorithm. This was the first question, even before the (2) <span style="font-weight: bold;">halting problem</span> for which undecidability could be proved. <p>Lambda calculus can be called the smallest universal programming language. It consists of a single<br /></p><p>(1)transformation rule -----variable substitution</p><p>(2) function definition scheme.<br /></p><p><span style="font-weight: bold;">Lambda calculus is universal in the sense that any computable function can be expressed and evaluated using this formalism</span>. It is thus equivalent to the Turning Machine formalism.<br /></p><p>Lambda calculus emphasizes the use of <span style="font-weight: bold;">transformation rules(variable substitution)</span> and does not care about the actual machine implementing them. It is an approach more related to software than to hardware.</p> <p><br /></p><div class="blogger-post-footer"></div> </article> <article> <h1>Smba wit Solaris Zone</h1> <p>2007-09-27T11:17:00.000-07:00</p> <pre wrap="">touch /etc/krb5.keytab<br /><br />the smb.conf file was not configured to use kerberos keytab but it will try to.</pre><div class="blogger-post-footer"></div> </article> <article> <h1>Storage Data Classification & Storage Policies</h1> <p>2007-09-27T10:24:00.000-07:00</p> Archive solution is designed for tape and disk storage devices. NAS package provides the file level representation of data. Storage Management System requires data classification and policies.<br /><br />Data classification is done based on the file system and a few other attributes. The attributes include file name, type, ownership, size, access rights and age. Classification can done automatically using customer defined categories.<br /><br />The customer defined data classification categories are assigned to storage management policies. Policies control the placement of the files onto the various types of physical storage, replication, deletion, and access.<div class="blogger-post-footer"></div> </article> <article> <h1>DS replication and search</h1> <p>2007-09-27T08:33:00.000-07:00</p> Enabling or disabling the replication should not impact the search<div class="blogger-post-footer"></div> </article> <article> <h1>Oracle Database and Solaris Zone</h1> <p>2007-09-27T08:23:00.000-07:00</p> The Oracle data base product line comes in two significantly different forms:<br /><br />1) Oracle has a single machine version of their data base product. It supports zone deployment today.<br /><br />2) Oracle has version of their data base product that works cooperatively and concurrently on multiple nodes. This product is called Oracle RAC. Oracle RAC does not run in zones now. But it<br />will do so soon<div class="blogger-post-footer"></div> </article> <article> <h1>POSIX Thread, Select & Poll</h1> <p>2007-09-27T08:19:00.000-07:00</p> The model of simply using one thread per connection, while simpler to code and support,<br />is viable for only a few to several hundred (possibly a few thousand) threads.<br /><br />From a performance perspective, select(3C) has stated in the man page (from circa Solaris 2.6 days IIRC) "poll(2) function is preferred over this function." select(3C) in Solaris is very inefficient as it has to translate in user space from the bitfields and calls poll() to do the kernel work anyway. Not to mention that recompiling an application that uses select(3C) as a 64 bit binary can result in a 500% performance drop. This occurs if they do not modify FD_SETSIZE, as this goes from 1024 in 32 bit compiles to 65536 in 64 bit compiles. So avoid select like the plague if performance is at an issue for your application. Select has been implemented as a direct syscall in several other Unix versions so code calling select(3C) will likely underperform on Solaris compared to other OSs.<br /><br />Even poll(2) suffers a lot of unnecessary performance degredation issues so, if dealing with thousands of descriptors, the far more scalable /dev/poll "man -s 7d poll" or Event Completion<br />Framework should be used. Here's an article wrote back in 2002 comparing scalability of<br />poll(2) and /dev/poll :<br /><br /><a class="moz-txt-link-freetext" href="http://developers.sun.com/solaris/articles/polling_efficient.html">http://developers.sun.com/solaris/articles/polling_efficient.html</a><br /><br />And it seems /dev/poll has been considered a bit too complicated for a lot of real world uses, and also suffers some performance issues in cases of quickly changing lists of file descriptors to<br />monitor, so the even newer Event Completion Framework/Ports have been created to deal with both issues :<br /><br /><a class="moz-txt-link-freetext" href="http://developers.sun.com/solaris/articles/event_completion.html">http://developers.sun.com/solaris/articles/event_completion.html</a><br /><a class="moz-txt-link-freetext" href="http://partneradvantage.sun.com/protected/solaris10/adoptionkit/tech/tecf.html">http://partneradvantage.sun.com/protected/solaris10/adoptionkit/tech/tecf.html</a><br /><br />Both /dev/poll and Event Ports have been ported to Linux, so, whether they are POSIX standards, extentions, or just de facto standards since they are the only tools to do the job if the state of many thousands of connections must be polled, they must be considered.<div class="blogger-post-footer"></div> </article> <article> <h1>SAN Disk/ Tap backup with Solaris Container</h1> <p>2007-09-27T08:09:00.000-07:00</p> Several systems are set up as SAN media servers so that backup to tapes occurs from SAN-disk to SAN-tape rather than across a network.<br /><br />The simplest approach is for each non-global zone to send its backup stream to the media server. It avoids potential security issues which must be addressed if you backup the zones' file systems from the GZ.<div class="blogger-post-footer"></div> </article> <article> <h1>DS database mini cache size heristrics</h1> <p>2007-09-27T08:05:00.000-07:00</p> dbase cache at least enough to hold the indexes. It is true that during search DS first read the indexes then the entries, but I would not make any assumption about what it means for the database cache. Usually when coding a cache algorithm. It is true for the entry cache and the changelog cache, but I do not know if it is also true for the DB cache.<br /><br />When there is not enough space to add some data, the data that was not used since the oldest time are removed and the new one replace it. LRU, MRU.<br /><br />So if you have not enough data for both kind of data, you will rather ends up with the most frequently used indexes and entries pages staying in the cache while the others go in and out<br />IMHO, There is probably no "priority" about indexes versus entries ...<br /><br />In modify things are much more complex: dn2entryid index is read first then entry then all the indexes are read.<div class="blogger-post-footer"></div> </article> <article> <h1>System Call vs. POSIX Thread on Select & Poll</h1> <p>2007-09-27T07:50:00.000-07:00</p> Solaris System calls select() (BSD) poll() (AT&T) are <span class="moz-txt-underscore"><span class="moz-txt-tag">_</span>not<span class="moz-txt-tag">_</span></span> POSIX. BSD and AT&T unix used to have their own ways on this. POSIX threads is recommended than relying on select() or poll() if you really want to write POSIX compliant code. With POSIX threads you should be able to evade the need for using these two system calls. Alternatively you could supply an extra .c file which contains the call to the poll() system call; this file must be translated with the _POSIX_C_SOURCE macro undefined. (You will be calling poll() even if you call select(). As Solaris 2.x is derived from AT&T, poll(2) is used to implement select(3C)).<div class="blogger-post-footer"></div> </article> <article> <h1>XWindows on Solaris 10</h1> <p>2007-09-06T12:54:00.000-07:00</p> It requires FQ hostname in case of VPN client access<br /><br />(1) ssh -X <fq> -l <username><br /> on remote host directly execute UI application<br /><br />ssh -X forward x11, there is no need to export DISPLAY any more<br /><br /><br />(2) vnc<br /><br />run vncserver on the remote server as<br /><br />vncserver <fq>:1<br />may propmpt password if you do not have it now<br /><br />on the local client<br /><br />vncviewer <fq>:1<br />type in password<br /></fq></fq></username></fq><div class="blogger-post-footer"></div> </article> <article> <h1>SOA Enable C+</h1> <p>2007-08-30T14:28:00.000-07:00</p> Many WS-enabling tools available on the market for C++, such as gSOAP, OSS, etc. Other options, especially if you use Java CAPS, are: TCP/IP, HTTP with non-SOAP payload, and JMS. SGF is always an option. Wrapping C++ with Java WS is not a very good idea.<br /><br /><br />The combination of gSOAP and JMS for integration with C++ and had a successful production deployment<div class="blogger-post-footer"></div> </article> <article> <h1>Avoid of sysemt call time() on Solaris</h1> <p>2007-08-29T14:11:00.000-07:00</p> <pre wrap="">Some product heavily uses times() syscall to measure cpu time and system time.<br />I'd like to get rid of any system call overhead if possible.<br /><br />http://developers.sun.com/solaris/articles/time_stamp.html<br /></pre><br />This article shows optimization the performance of enterprise systems that employ extensive time-stamping using the <code>time(2)</code><div class="blogger-post-footer"></div> </article> <article> <h1>File Descriptor and Solaris Sockets</h1> <p>2007-08-29T14:07:00.000-07:00</p> rlim_fd_max is the same as rlim_fd_curr then this means that they are only allocating 256 file descriptors. Sett the rlim_fd_max to at least 2048 or higher for highly loaded system<div class="blogger-post-footer"></div> </article> <article> <h1>JMS design and analysis</h1> <p>2007-08-17T15:08:00.000-07:00</p> (1) Design Pattern: Publish Subscription<br /><br />1 Producer -----(1 Message) ---> Topic (Destination) ----> K Consumers<br />K Producers ----(K Messages) ---> Topic (Destination) ---> K Consumers<br /><br />(2) Service Reliability: Message Reliability:<br /><br />With normal topic subscription, only active consumers subscribed<br />to the topic will receive messages.<br /><br />With durable subscriptions, the inactive consumers are ensured<br />to receive the message as subsequently becomes active.<br /><br />Intuitively, the topic does not hold the messages it receives<br />unless it has inactive consumers with durable subscriptions.<br /><br />Hence, durable subscription is the service reliability practice<br /><br />(3) Best Practice-1: Development with Unified Domain Model<br /><br />Even though the domain-specific interfaces (Queue, Topic)<br />are backward supported for legacy purposes, The best development<br />practice is to use the Unified Domain Interface,<br />which transparently support P-P, Pub-Sub Models.<br /><br /><br />(4) Best Practice-2: Use Administered Object Store<br /><br />The connection factory is recommended to create and reconfigured<br />with the administration tools. Admin objects such as ConnectionFactory<br />is then placed in an Administered Object Store. It decouples JMS application<br />code and portable among different JMS providers.<br /><br /><br /><br />(5) Best Practice-3: J2EE Client By Resource Annotation<br /><br />Use @Resource and no exception handing in J2EE 1.5 as best<br />practices.<br /><br />(5) Code Segment: to show message life cycle<br /><br />Use Unified Domain createConnection method is in javax.jms.ConnectionFactory<br /><br />Hashtable env = new Hashtable();<br />env.put(Context.INITIAL_CONTEXT_FACTORY,<br />"com.sun.jndi.fscontext.RefFSContextFactory");<br />env.put(Context.PROVIDER_URL, <a class="moz-txt-link-rfc2396E" href="file:///amberroad:/sun_mq_admin_objects">"file:///amberroad:/sun_mq_admin_objects"</a>);<br />Context ctx = new InitialContext(env);<br />String CF_LOOKUP_NAME = "ARConnectionFactory";<br />ConnectionFactory arFactory = (ConnectionFactory) ctx.lookup<br />(CF_LOOKUP_NAME);<br />String DEST_LOOKUP_NAME = "ARTopic";<br />Destination arTopic = (Destination) ctx.lookup(DEST_LOOKUP_NAME);<br /><br /><br /><br />Connection arConnection = null;<br />Session arsession = null;<br />try {<br />arConnection = myFactory.createConnection("amberroad", "amberroad");<br />arConnection.setExceptionListener(this);<br />arsession = arConnection.createSession(false, Session.AUTO_ACKNOWLEDGE);<br />MessageProducer arProducer = arSession.createProducer(arTopic);<br />String arSelector = "/* Text of selector here */";<br />MessageConsumer<br />arConsumer = arSession.createDurableSubscriber(arTopic, "arConsumer", arSelector, true);<br />TextMessage arMsg = mySession.createTextMessage();<br />arMsg.setText("AmberRoad Test");<br />// at message level specification<br />arMsg.setJMSReplyTo(replyDest);<br />arMsg.setJMSDeliveryMode(DeliveryMode.PERSISTENT);<br />arMsg.setDisableMessageTimestamp(9L);<br />arMsg.setJMSPriority(Message.DEFAULT_PRIORITY);<br />arMsg.setJMSExpiration(1000L);<br />arProducer.send(arTopic, arMsg);<br /><br />// if it is not at message level, at producer level specification<br /><br />arProducer.send(arDest, arMsg, DeliveryMode.PERSISTENT, 9, 1000);<br /><br /><br />// if set up async listener<br /><br />ARMessageListener arListener = new ARMessageListener();<br />arConsumer.setMessageListener(arListener);<br /><br /><br />// blocking receiver<br />arConnection.start();<br />Message inMsg = arConsumer.receiveNoWait(); // distributed apps<br /><br />outMsg.clearBody();// consumer does<br />--------------------<br /><br />arConnection.stop(); // in case to suspend messaging<br /><br />finally{<br /><br />mySession.unsubscribe("arConsumer");<br />arConnection.close();<br /><br />}<br /><br />Note<br /><br /><br />(1) for the publish/subscribe domain to create durable topic subscriptions,<br />a client identifier arrangement is done by configuring the client runtime<br />to provide a unique client identifier automatically for each JMS application.<br /><br />(2) For message consumption, with auto-acknowledge mode, the Message Queue<br />client runtime immediately sends a client acknowledgment for each message<br />it delivers to the message consumer; it then blocks waiting for a return<br />broker acknowledgment confirming that the broker has received the client<br />acknowledgment. It leaves JMS application code free.<br /><br /><br />(3) For message producers, the broker’s acknowledgment behavior<br />depends on the message’s delivery mode defined in Message Header.<br />The broker acknowledges the receipt of persistent messages for persistent messages<br />but not of non persistent ones; It is not configurable by the client.<br /><br /><br /><br /><br />For Receiving Messages Asynchronously<br /><br /><br /><br />public class ARMessageListener implements MessageListener<br />{<br />public void onMessage (Message inMsg) throws JMSException<br />{<br />Destination replyDest = inMsg.getJMSReplyTo();<br />long timeStamp = inMsg.getLongProperty("JMSXRcvTimestamp");<br />Enumeration propNames = inMsg.getPropertyNames();<br />String eachName;<br />Object eachValue;<br /><br />while ( propNames.hasMoreElements() )<br />{<br />eachName = propNames.nextElement();<br />eachValue = inMsg.getObjectProperty(eachName);<br /><br />}<br />String textBody = inMsg.getText();<br /><br />}<br />}<div class="blogger-post-footer"></div> </article> <article> <h1>Weka running for Linux and Unix</h1> <p>2007-08-16T10:53:00.000-07:00</p> (1) Under package weka.gui<br /><br />LookAndFeel.props<br /><br />(2) uncomment the first configuration<br /><br /># Look'n'Feel configuration file<br /># $Revision: 1.1.2.2 $<br /><br /># the theme to use, none specified or empty means the system default one<br />Theme=javax.swing.plaf.metal.MetalLookAndFeel<br />#Theme=com.sun.java.swing.plaf.gtk.GTKLookAndFeel<br />#Theme=com.sun.java.swing.plaf.motif.MotifLookAndFeel<br />#Theme=com.sun.java.swing.plaf.windows.WindowsLookAndFeel<br />#Theme=com.sun.java.swing.plaf.windows.WindowsClassicLookAndFeel<div class="blogger-post-footer"></div> </article> <article> <h1>Classification Time Complexity</h1> <p>2007-08-15T14:34:00.000-07:00</p> NBTree is O(n^3)<br />Decision trees is O(n^2)<br />Naive Bayes is O(n).<div class="blogger-post-footer"></div> </article> <article> <h1>NBTree Algorithmic Time Complexity</h1> <p>2007-08-12T17:13:00.000-07:00</p> NBTree uses cross-validation at each node level to<br />make a decision to split or construct a naive Bayes<br />model.<div class="blogger-post-footer"></div> </article> <article> <h1>Curse of dynamic programming and stochastic control</h1> <p>2007-08-10T15:45:00.001-07:00</p> (1) Curse of parameteric approximation to cost-to-go function<br /> (2) modeling without closed form objective function<br /><br />function approximation, iterative optimization, neural network learning, dynamic programming<div class="blogger-post-footer"></div> </article> <article> <h1>Curse of dynamic programming and stochastic control</h1> <p>2007-08-10T15:45:00.000-07:00</p> (1) Curse of parameteric approximation to cost-to-go function<br /> (2) modeling without closed form objective function<div class="blogger-post-footer"></div> </article> <article> <h1>Attribute Selection With Weka</h1> <p>2007-08-06T17:37:00.000-07:00</p> Uing the tab "Select attributes" in Weka to do some<br />wrapper-based feature subset selection. I encounter several different<br />search methods.<br /><br />Greedy stepwise with parameters<br />"conservativeForwardSelection" = False<br />"searchBackwards" = False<br /><br />It does forward selection starting from an empty set of<br />attributes. It stops adding attributes as soon as there<br />is no single addition that improves apon the current<br />best subset's merit score.<br /><br /><br />Greedy stepwise with parameter<br />"conservativeForwardSelection" = True, and<br />"searchBackwards" = False<br /><br />It does the same and it will continue to add new features as<br />long as it does not decrease the merit of the current best subset.<br /><br /><br />BestFirst with parameter "direction" = Forward<br />BestFirst is a beam search. It allows backtracking to<br />explore other promising search paths.<br /><br />The "More" button in the GenericObjectEditor<br />when selecting/altering parameters for<br />search methods in the Explorer.<div class="blogger-post-footer"></div> </article> <article> <h1>Zone and CPU shares</h1> <p>2007-08-02T13:02:00.000-07:00</p> $ pooladm -e<br />$ pooladm -s<br />$ pooladm -c<br /><br />$ poolcfg -c 'create pset pset1 (uint.min = 2 ; uint.max = 2)'<br />$ poolcfg -c 'create pset pset2 (uint.min = 1 ; uint.max = 1)'<br /><br />$ poolcfg -c 'create pool pool1'<br />$ poolcfg -c 'create pool pool2'<br /><br />$ poolcfg -c 'associate pool pool1 (pset pset1)'<br />$ poolcfg -c 'associate pool pool2 (pset pset2)'<br /><br />$ pooladm -c<br /><br />Assuming, the zones are up & running:<br />$ poolbind -p pool1 -i machine1<br />$ poolbind -p pool2 -i machine2<br />$ poolbind -p pool2 -i machine3<br />$ poolbind -p pool2 -i machine4<br />$ poolbind -p pool2 -i machine5<br /><br />To make the bindings persistent, use<br />$ zonecfg -z <zone> set pool=<pool><div class="blogger-post-footer"></div> </article> <article> <h1>Sun Cluster supports Zone</h1> <p>2007-08-02T12:55:00.000-07:00</p> SC3.2 does support treating a zone as a cluster node. See http://docs.sun.com/app/docs/doc/819-6611/6n8k5u1mc?a=view#gdamq<div class="blogger-post-footer"></div> </article> <article> <h1>Zone memory limits and SWAP issues</h1> <p>2007-08-02T12:52:00.000-07:00</p> There is no memory limit for Zones. A zone's processes are allowed to <br />use as much RAM and swap as they want. Resource controls can do this<br /><br />Fork calls fail when there isn't enough swap space. It returns with error <br />ENOMEM, which is 12. The second failure in your log below returned a status <br />of 12.<div class="blogger-post-footer"></div> </article> <article> <h1>Sample Size and Dimensionality</h1> <p>2007-08-02T12:41:00.000-07:00</p> Sample size and dimensionality are critical to parametric optimization<br />of machine learning and prediction. Small datasets with high<br />dimensionality poses the low ROC problem in research community.<br /><br />A naive Bayes classifier (Maron, 1961) is a simple probabilistic<br />classifier based on applying Bayes’ theorem with strong independence<br />assumptions. Depending on the precise nature of the probability model,<br />naive Bayes classifiers can be trained very<br />efficiently in a supervised learning setting. In many practical<br />applications, parameter estimation for naive Bayes models uses the<br />method of maximum likelihood. Recent researches on Bayesian<br />classification problem has shown that there are some theoretical reasons<br />for the apparently unreasonable efficacy of naive Bayes<br />classifiers(Zhang, 2004). Because independent variables are assumed,<br />only the variances of the variables for each class need to be determined<br />and not the entire covariance matrix. Hence, Naive Bayes classifier<br />requires small training data for classification prediction. <br /><br />Support vector machines (SVMs) is another set of supervised learning<br />methods for classification (Cortes & Vapnik, 1995). It maps input<br />vectors to a higher dimensional space where a maximal separating<br />hyperplane is created. Two parallel hyper-planes<br />are constructed on each side of the hyperplane that separates samples.<br />The separating hyperplane is the hyperplane that maximizes the distance<br />between the two parallel hyper-planes. The larger the margin or distance<br />between these parallel hyper-planes is, The better the generalization<br />error of the classifier will be. It requires large samples.<div class="blogger-post-footer"></div> </article> <article> <h1>TCP monitoring</h1> <p>2007-08-02T12:38:00.000-07:00</p> (1) List all tcp tunnables<br /><br /> ndd /dev/tcp \?<br /><br />(2) get a tcp tunnable values<br /><br />ndd -get /dev/tcp tcp_conn_req_max_q0<br /><br />(3) set a tcp tunnable<br /><br />ndd -set /dev/tcp tcp_conn_req_max_q0<div class="blogger-post-footer"></div> </article> <article> <h1>divide my dataset to subsets to perform some experiments on each</h1> <p>2007-07-31T22:04:00.000-07:00</p> You can add an ID attribute to all your data using the AddID filter in<br />weka.filters.unsupervised.attribute. Following this you can create your<br />splits explicitly using filters in the weka.filters.unsupervised.instance package (e.g. RemovePercentage, RemoveRange and RemoveFolds) or use the cross-validation (or<br />percentage split) evaluation options in the Explorer. In order to make<br />sure that the ID attribute is not used by the learned models you can<br />use the weka.classifiers.meta.FilteredClassifier in conjunction with<br />your chosen classifier and the weka.filters.unsupervised.attribute.Remove filter in order to remove the ID attribute just prior to constructing a classifier (and at<br />testing time too). With the current snapshot of the developer<br />version of Weka, you can also output additional attributes alongside the<br />predictions (in your case, the ID attribute).<div class="blogger-post-footer"></div> </article> <article> <h1>Applying Quantum Principles to GAs for Multiple Objective Scheduling</h1> <p>2007-07-31T13:56:00.000-07:00</p> Multi-objective scheduling problem has been proposed in literature (T'kindt et. al., 1996). However, conventional meta heuristics-based methods, such as GA algorithms, were studied with single objective function to derive combinatorial optimization. <br /><br />Recent advances of GAs and multi-objective researches (Han et. al., 2005) applied principles of Quantum Computers to stochastic optimization problems. In addition, Q bit representation and permutation-based GA was advocated by researchers (Li & Wang, 2007). For multi-objective scheduling Q bit GA needs to obtain good approximation for both co-operative and competitive task environment. Moreover, Q bit-based permutation, crossover operators, selection, encoding, generation processes and fitness values are required to explore and exploit the large or high dimensional state spaces. It is a relaxed minimization problem with the Q-bit.<br /><br />Algorithm evaluation needs to combine a vector of all local objective function values for each job. However, local optimum per job and global optimum for entire task environment indicates further layer of constraint based satisfaction with enumeration of iterative policy and state transitions. Other than the optimization of enumeration, parallelization may need to considered at both system and application level. Furthermore, pipelined processing and data parallelization are critical to reduce both time and space complexities.<br /><br />Han et. al. (2005). A quantum-inspired genetic algorithm for flow shop scheduling. Springer-Velag.<br />T'kindt et. al.(1996). Multicriteria Scheduling: Theory, Models and Algorithms. Springer-Velag, 2002.<div class="blogger-post-footer"></div> </article> <article> <h1>Enable and Disable dhcpagent</h1> <p>2007-07-31T13:29:00.000-07:00</p> To enable and disable DHCP Agent<br /><br />sys-unconfig<div class="blogger-post-footer"></div> </article> <article> <h1>Balance Dataset</h1> <p>2007-07-26T22:31:00.000-07:00</p> A dataset with 2 unbalanced classes. 7,500 rows belong to Class A<br />and 2,500 rows belong to Class B. How do I randomly select rows from<br />Class A and Class B to balance the dataset<br /><br /><br />Using weka.filters.supervised.instance.SpreadSubsample with a<br />value of 1 (uniform) for the distributionSpread parameter.<div class="blogger-post-footer"></div> </article> <article> <h1>Selective Attribute for classification training</h1> <p>2007-07-24T11:13:00.000-07:00</p> The easiest way to do this would be to first make a copy of the<br />Instances object (Instances copyt = new Instances(train)) holding your <br />training data. Then for each instance that has values that you don't<br />want to train on set them to "missing". I.e. assume i is an instance<br />and the value at attribute 3 is to be skipped when training naive <br />Bayes, then i.setMissing(2) would do the trick. Note, that this<br />approach is specific to the way that naive Bayes works.<div class="blogger-post-footer"></div> </article> <article> <h1>BI Feature Selection</h1> <p>2007-07-24T07:43:00.000-07:00</p> A BI Feature selection descritipn:<br /><br /><br />"The random search method (weka.attributeSelection.RandomSearch)<br />in the attribute selection package that can be combined with any<br />feature subset evaluator in order to search for good subsets randomly.<br />If no start set is supplied, Random search starts from a random point<br />and reports the best subset found. If a start set is supplied, Random<br />searches randomly for subsets that are as good or better than the<br />start point with the same or or fewer attributes."<br /><br />But heuristically, with some confidence, the 50000<br />features selected using Chi-squared correlation produce a more<br />accurate SVM model than 50000 features selected uniformly at random.<div class="blogger-post-footer"></div> </article> <article> <h1>CPU performance counter</h1> <p>2007-07-19T20:39:00.000-07:00</p> (1) AMD Performance Counter, http://developer.amd.com/article_print.jsp?id=90 <br />(2) cpustat and cputrack , trapstat<br />(3) lib.cpc<div class="blogger-post-footer"></div> </article> <article> <h1>ID Problem Formulation</h1> <p>2007-07-19T19:06:00.001-07:00</p> (1) Since I formulated the ID as stochastic DP problem. It owns<br />properties<br />of dynamic. <br />(2) To handle large state space and unknown attack type, the DP problem<br />transformed into adaptive tuning problem. Adaptiveness in terms of tunning<br />the networks interactively. <br /><br />The properties of problem formulation has been addressed in the problem<br />formulation section. I have mathematical proof for the above items. It has been<br />further addressed in the methodology section of the formal paper. <br /><br />As for the time constraints, do you mean I need time to implement the<br />entire mathematical framework as a software ? If so, it is true that I need to implement it<br />myself since existing tools such as MatLab only handle traditional weights tuning for fixed<br />neuro networks. In addition, no RL toolbox yet. This research counts on my own implementation for proposed algorithmic operations. As for the dataset preprocessing, it will not be issue for<br />me since I/O formating is ok for me.<br /><br />False alarm ratio is only evaluated from known attacks from research<br />point of review. In real time system operation, it can not be proved by research framework.<br /> This is the motivation 67to come up with "Tuning" framework for online detection in order to<br />reduce the false alarm ratio.Hence, false alarm problem is relaxed as the problem of "Tuning" of DP 5tproblem. This is one 1of the major advantagesyt of this research proposal.<br /><br />Dataset is only critical for traditional neuro learning but not this<br />research. parameter is not restricted for this research either. All these are traditional neuro<br />learning problem. That is 238x3ethe motivation to propose RL based "Tuning" framework. This is one of major advantages of this<br />research proposal. For the specific host and network attack (spoofing<br />and memory overflow)<br />I have mathematical proof for this research. For the implementation, I<br />have to start with arbitrary<br />parameters and architecture. It is important to know that there is no<br />readily training set of state<br />and ROC function in DP context. The possible way is to evaluate the ROC<br />function by simulation<br />state decisions. Afterwards, using RL based interactive algorithm to<br />improve the ROC value. That<br />is the most key point of the research design.<div class="blogger-post-footer"></div> </article> <article> <h1>Versioning Manager Output</h1> <p>2007-07-19T19:00:00.000-07:00</p> Singleton VersioningManager can output any JComponent to the console<div class="blogger-post-footer"></div> </article> <article> <h1>NB Back End Threaded Progresses</h1> <p>2007-07-19T18:54:00.000-07:00</p> (1) Runnable for backend long run processes and Progress Handle management<br />Runnable allRunnable = new Runnable() {<br /> WorkspaceMgr mgr = null;<br /> Workspace ws = PerforceConfig.getDefault().getDefaultWorkspace();<br /> ProgressHandle handle = null;<br /><br /> public void run() {<br /> try {<br /> handle = ProgressHandleFactory.createHandle(NbBundle.getMessage(PerforceAnnotator.class, "CTL_PopupMenuItem_ViewAllChangelist"));<br /> mgr = new WorkspaceMgr(ws);<br /> handle.start();<br /> showAllChangelist(changes);<br /> SwingUtilities.invokeLater(new Runnable() {<br /><br /> public void run() {<br /> ChangelistView comp = ChangelistView.findInstance();<br /> VersioningOutputManager.getInstance().addComponent(NbBundle.getMessage(PerforceAnnotator.class, "CTL_PopupMenuItem_ViewAllChangelist"), comp);<br /> comp.setContext(ctx, changes);<br /> comp.setDisplayName(NbBundle.getMessage(PerforceAnnotator.class, "CTL_PopupMenuItem_ViewAllChangelist"));<br /> //comp.open();<br /> comp.requestActive();<br /> }<br /> });<br /> } catch (WorkspaceException ex) {<br /> Exceptions.printStackTrace(ex);<br /> } finally {<br /> handle.finish();<br /> }<br /> }<br /> };<br /><br />(2) UI current thread context<br /><br /> if (cmd.equals(NbBundle.getMessage(PerforceAnnotator.class, "CTL_PopupMenuItem_ViewAllChangelist"))) {<br /> RequestProcessor.getDefault().post(allRunnable);<br /> }<br /><br />(3) So, current thread, spawn thread for progress bar and backend process, back to UI population<div class="blogger-post-footer"></div> </article> <article> <h1>Performance Analysis and Methodology</h1> <p>2007-07-19T18:19:00.000-07:00</p> Performance analysis and methodologies are very broad topics. It is about optimization. Performance as a set of Bellman equations to solve. Traditional states and performance functions<br />enumerations does not address the performance evaluation issues<br />since a traditional MDP problem results in large state transitions<br />or high dimensional performance feature extractions. For a networking<br />only related problem formulation may involved into 30+ performance<br />parameters and for Solaris kernel, it involves 100+ parameters.<br />Hence, dynamic and adaptive performance analysis and associated<br />resource utilization analysis may reach the optimum<br />performance function evaluation with fast convergence.<br /><br />It is involved with Performance Metrics (Parameters, feature extractions), Performance Functions, Performance Evaluations, Performance Learning, Performance Instrumentation, Performance Management and Adaptive Tuning etc. It really depends on specific issues to formulate the specific problem into adequate function, models to resolve the performance issues.<br /><br />In addition, from CS analysis and design methods such as dynamic programming, divide by conquer, greedy and amortization. They are popular techniques to address performance from subproblem to global problems. However, to achieve end-to-end performance gains such as network tuning, global optimum may be the most concerns instead of local optimum. In addition, queuing theory has been widely adopts for traditional SMP based performance management and capacity planning.<br />Core based parallelism and pipelining introducing many new issues down<br />the road. Is queuing still works well for parallelism paradigm, if not<br />what will be the optimization, if yes, what will be proper queue<br />partitioning etc<br /><br /><br />In general quantitative methods should be the main theme of the analysis<br />and evaluation. It is hard to generalize as a whole but specific to<br />the target problem formulations.<div class="blogger-post-footer"></div> </article> <article> <h1>P4 Annotation For Security Compliance Auditing</h1> <p>2007-07-19T18:13:00.000-07:00</p> P4 annotate is the solution to discover the code change per version and who submit the change<div class="blogger-post-footer"></div> </article> <article> <h1>P4 job</h1> <p>2007-07-13T11:45:00.000-07:00</p> (1) P4 job specification can be customized<br />(2) create p4 job with the above specification<br />(3) lookup jobs assigned to specific developers<br />(4) developer edit src and submit the changelist<br />(5) developer run "fix" to associated submitted "changeNo" with job to ensure job is in closed state<div class="blogger-post-footer"></div> </article> <article> <h1>P4 Labeling</h1> <p>2007-07-13T10:02:00.001-07:00</p> It is not encourage to use label but changelist.<div class="blogger-post-footer"></div> </article> <article> <h1>P4 branch</h1> <p>2007-07-13T09:57:00.000-07:00</p> (1) Branch can be created with "integrate" for the "From Files" to "To Files" following by "submit"<br /> However, Branch is the best practice to create branch. Because, with branches, <br /> integrate -b branchname -r (bi-direction population can happen)<br />(2) any working branch can only populate the change with "integrate" with "submit" again. All conflicts willl be reported during submission phases. <br />(3) resolve action will be taken by user<div class="blogger-post-footer"></div> </article> <article> <h1>HTTP/S for Performance Management Analysis/Report</h1> <p>2007-07-13T09:43:00.000-07:00</p> First, it is a common engineering practice for<br />agent to collect data for analysis and report<br />layers in system management space. It happens<br />to all industrial players.<br />In addition, three tier performance management<br />architecture is also considered as the best<br />practice to scale to large data center performance<br />management. It can be further processing for event<br />collaboration for even larger performance<br />management crossing data centers.<br /><br />Second, HTTPS is a security compliant requirement.<br />It is part of compliance practice.<br /><br />The only limitation is that it is coming from<br />hosts and server domain management. If goes to<br />small devices management such as fans or power controller<br />The only methods now is SNMP or SNMP/S.<div class="blogger-post-footer"></div> </article> <article> <h1>Crypto on T2000</h1> <p>2007-07-13T09:33:00.000-07:00</p> Crytpo framework supports SCA6000 crypto provider for all NG zones, if it's configured.changes to the crypto framework config can only be done from the Global zone. You can list the providers from within the non-global zone but cannot change.<div class="blogger-post-footer"></div> </article> <article> <h1>Solaris Resource Management</h1> <p>2007-07-05T11:18:00.000-07:00</p> From resource control, prcess level<br />control will pass in pid which is run<br />time only. So we create project to<br />assigned user progress to modify the<br />resource control per project based without<br />knowing pid. Of course, I want to try<br />pid too.<br /><br /><br />(1)Create a project<br /># projadd -U progress -p 8888 openedge<br />(2) projmod -c "It is project for resource control on openedge database" openedge<br />(3)List projects created<br /># project -l<br />ksh: project: not found<br /># projects -l<br />system (System built-in project, project id 0)<br /> projid : 0<br /> comment: ""<br /> users : (none)<br /> groups : (none)<br /> attribs:<br />user.root (System built-in project, project id 1)<br /> projid : 1<br /> comment: ""<br /> users : (none)<br /> groups : (none)<br /> attribs:<br />noproject (System built-in project, project id 2)<br /> projid : 2<br /> comment: ""<br /> users : (none)<br /> groups : (none)<br /> attribs:<br />default (System built-in project, project id 3<br /> projid : 3<br /> comment: ""<br /> users : (none)<br /> groups : (none)<br /> attribs:<br />group.staff (System built-in project, project id 10)<br /> projid : 10<br /> comment: ""<br /> users : (none)<br /> groups : (none)<br /> attribs:<br />openedge (Project we created with designated id 8888)<br /> projid : 8888<br /> comment: "It is project for resource control on openedge database"<br /> users : progress<br /> groups : (none)<br /> attribs:<br />(3) check project membership<br /><br /><br />id -p <userID><br /><br /># id -p<br />uid=0(root) gid=0(root) projid=1(user.root)<br /><br />You can see root belongs to built-in project id1 which is user.root<br /><br /># prstat -J<br /> PID USERNAME SIZE RSS STATE PRI NICE TIME CPU PROCESS/NLWP<br /> 707 noaccess 222M 133M sleep 59 0 0:01:47 0.0% java/55<br /> 1025 root 4776K 4232K cpu8 59 0 0:00:00 0.0% prstat/1<br /> 118 root 5216K 4728K sleep 59 0 0:00:02 0.0% nscd/26<br /> 117 root 4640K 4008K sleep 59 0 0:00:00 0.0% picld/4<br /> 125 root 2592K 2080K sleep 59 0 0:00:00 0.0% syseventd/14<br /> 258 daemon 2752K 2432K sleep 59 0 0:00:00 0.0% statd/1<br /> 371 root 4856K 1672K sleep 59 0 0:00:00 0.0% automountd/2<br /> 97 root 2552K 2176K sleep 59 0 0:00:00 0.0% snmpdx/1<br /> 55 root 9160K 7528K sleep 59 0 0:00:01 0.0% snmpd/1<br /> 308 root 2080K 1224K sleep 59 0 0:00:00 0.0% smcboot/1<br /> 259 daemon 2432K 2136K sleep 60 -20 0:00:00 0.0% nfs4cbd/2<br /> 249 root 2728K 1632K sleep 59 0 0:00:00 0.0% cron/1<br /> 9 root 11M 10M sleep 59 0 0:00:19 0.0% svc.configd/17<br /> 7 root 19M 17M sleep 59 0 0:00:08 0.0% svc.startd/12<br /> 136 daemon 4680K 3528K sleep 59 0 0:00:00 0.0% kcfd/5<br />PROJID NPROC SIZE RSS MEMORY TIME CPU PROJECT<br /> 1 5 10M 9488K 0.0% 0:00:00 0.0% user.root<br /> 3 1 1376K 1280K 0.0% 0:00:00 0.0% default<br /> 0 37 390M 257M 0.7% 0:02:21 0.0% system<br /><br /><br />Total: 43 processes, 218 lwps, load averages: 0.01, 0.01, 0.01<br /><br /># id -p root<br />uid=0(root) gid=0(root) projid=1(user.root)<br /># id -p daemon<br />uid=1(daemon) gid=1(other) projid=3(default)<br /># id -p noaccess<br />uid=60002(noaccess) gid=60002(noaccess) projid=3(default)<br /><br /><br />svcadm enable system/pools:default (resource pools framework)<br />svcadm enable system/pools/dynamic:default (dynamic resource pools)<br />svcadm enable svc:/system/pools:default (enable DRP service)<br /><br />Check if pool services and dynamic pool service are enabled<br /><br /># svcs *pool*<br />STATE STIME FMRI<br />online 11:10:01 svc:/system/pools:default<br />online 11:11:05 svc:/system/pools/dynamic:default<div class="blogger-post-footer"></div> </article> <article> <h1>Share Memory setting in Soalris 10 or +</h1> <p>2007-07-05T11:16:00.000-07:00</p> (1) If it is a shared memory issue, it may not be zone specific but S10 specific. Since it<br /> /etc/system is not good practice but following S10 resource control practices<br />(2) Using prctl to project or even process based control. However, you need to create<br /> project and assign user which running the process to the project. I have experienced<br /> some bugs before to do this assignment. However, to login as the user then su to<br /> root to assign the project<br />(3) projmod -s -K "project.max-shm-memory=(privileged, 8GB, deny) xxx<br /><br />You may need to run it in global zone first before moving into local zone.<div class="blogger-post-footer"></div> </article> <article> <h1>Core and LDOM Performance Management</h1> <p>2007-07-05T10:39:00.000-07:00</p> Core and LDOM based system operations introduces parametric <br />modeling and approximation optimization problems from <br />traditional execution time to throughput, IPC, parallelism <br />and pipelining. This is applied to OS modeling and <br />performance management. It impacts the predictive <br />monitoring, analysis and reporting. This has been my <br />engineering interests since I worked in<br />system management and integration spaces.<div class="blogger-post-footer"></div> </article> <article> <p>2007-07-03T08:15:00.000-07:00</p> From CMT perspective, out T1, AMD, Intel x86 platforms does introduce variance from traditional<br />SMP platforms. First, from HW platform point of view, physical processor structures changed to core<br />based, Second from Solaris point of view, kernel CPU structures, CPC counters, CPUTrack, CPUStat<br />Kstat changed (including all core changes), Third, from system management point of SNMP MIBII<br />database structure changed. This will impact current system management parametric model learning and system management view design.<br />From LDOM perspective, more virtualization based predictive modeling and reporting design needs to<br />be enhanced to predict and measure physical resources, kernel CPU structures, CPC counters and MIB<br />structures.<br /><br />In general, to have system management to be earlier CMT and LDOM adaptor, they could need some level of support from Sun. This is just a proactive assessments.<div class="blogger-post-footer"></div> </article> <article> <h1>Load Generation Appliance</h1> <p>2007-06-29T15:57:00.000-07:00</p> Spirent AVALANCHE LOAD TESTING APPLIANCE<br /><br />http://www.spirentfederal.com/<div class="blogger-post-footer"></div> </article> <article> <h1>S12 Compliation flag</h1> <p>2007-06-25T09:42:00.000-07:00</p> S12 update compilation flag: -xarch=v9 is deprecated, use -m64 to create 64-bit programs<div class="blogger-post-footer"></div> </article> <article> <h1>Long Pause GC ?</h1> <p>2007-06-20T13:34:00.000-07:00</p> GC can be well tunned from 1.5.x above.<br /><br />http://www.sun.com/bigadmin/content/submitted/cms_gc_logs.html <br />http://java.sun.com/performance/reference/whitepapers/tuning.html<br />http://twiki.sfbay.sun.com/pub/MDE/ISVESystemsProjects/TS-2885-14.pdf<div class="blogger-post-footer"></div> </article> <article> <h1>Interesting military Security Training, Open Solaris</h1> <p>2007-06-20T13:33:00.001-07:00</p> http://www.gcn.com/print/26_09/43562-1.html<div class="blogger-post-footer"></div> </article> <article> <h1>NB Debug Thread Dead Lock</h1> <p>2007-06-20T13:28:00.000-07:00</p> It seems SMP helps NB debugger for current build<div class="blogger-post-footer"></div> </article> <article> <h1>Workspace Management</h1> <p>2007-06-19T08:30:00.000-07:00</p> Main Menu Action is triggered by "Annotator"<br /><br />(1) CreateWorkspaceAction -- Currently Setup Workspace and save the extra UpdateWorkspace Action<br /> This action is triggered by "Annotator" getAction routine<br />(2) Needs Remove Workspace Action to remove current Preferences cache and Remote depot.<br /> This action is triggered by "Annotator" getAction routine<br />(3)<div class="blogger-post-footer"></div> </article> <article> <h1>NB Short Build</h1> <p>2007-06-18T17:18:00.000-07:00</p> cvs -d :pserver:leiliu@cvsnetbeansorg.sfbay.sun.com:/cvs login<br />cvs -d :pserver:leiliu@cvsnetbeansorg.sfbay.sun.com:/cvs co -P standard_nowww<br /><br />cvs -d :pserver:leiliu@cvs.netbeans.org:/cvs login<br />cvs -d :pserver:leiliu@cvs.netbeans.org:/cvs co -P standard_nowww<br /><br /><br />ant -Dcluster.config=standard<br /><br />or may need to try ant build-nozip first.<br /><br /><br />With CVS functions<br /><br />ant -Dcluster.config=basic<div class="blogger-post-footer"></div> </article> <article> <h1>NB cached .netbeans dir caused problem</h1> <p>2007-06-18T17:16:00.000-07:00</p> (1) It is recommended to clean up the .netbeans dir under $HOME in order to have new build working<br />fully.<br />(2) a short build<br /><br />cvs -d :pserver:leiliu@cvsnetbeansorg.sfbay.sun.com:/cvs login<br />cvs -d :pserver:leiliu@cvsnetbeansorg.sfbay.sun.com:/cvs co -P standard_nowww<br /><br />cvs -d :pserver:leiliu@cvs.netbeans.org:/cvs login<br />cvs -d :pserver:leiliu@cvs.netbeans.org:/cvs co -P standard_nowww<br /><br /><br />ant -Dcluster.config=standard<br /><br />or may need to try ant build-nozip first.<div class="blogger-post-footer"></div> </article> <article> <h1>NB Plugin</h1> <p>2007-06-16T09:13:00.000-07:00</p> 1. rename cvsmodule as perforce<br />2. change all project and service meta data ->>>>> Here is PerforceVCS<br />3. replace.sh cvs -> perforce, CVS -> Perforce<br />4. PerforceRoot change back to CVSRoot first.<br /><br />We can get a build now.<br /><br />Change Menu action name: Each Action has <br /><br />public String getName() {<br /> return NbBundle.getBundle(CreateWorkspaceAction.class).getString("CTL_MenuItem_XX_Label");<br /> }<br /><br />CTL_MenuItem_XX_Label is located in Bundle.properties file of each action package<div class="blogger-post-footer"></div> </article> <article> <h1>Problem of Broadcom Wireless Controller on S11 with Acer Ferrari 3400 laptop</h1> <p>2007-06-15T19:53:00.000-07:00</p> I have ferrari 3400 latop with S11 OS kernel 5.11 snv_64a i86pc i386 i86pc<br /><br />(1) Locate Wireless Controller as Broadcom BCM4306 802.11b/g Wireless LAN Controller<br /><br /><br /># /usr/X11/bin/scanpci -v<br /><br /><br />pci bus 0x0000 cardnum 0x09 function 0x00: vendor 0x14e4 device 0x4320<br /> Broadcom Corporation BCM4306 802.11b/g Wireless LAN Controller<br /> CardVendor 0x185f card 0x1220 (Wistron NeWeb Corp. TravelMate 290E WLAN Mini-PCI Card)<br /> STATUS 0x0000 COMMAND 0x0006<br /> CLASS 0x02 0x80 0x00 REVISION 0x03<br /> BIST 0x00 HEADER 0x00 LATENCY 0x40 CACHE 0x00<br /> BASE0 0xd0014000 addr 0xd0014000 MEM<br /> MAX_LAT 0x00 MIN_GNT 0x00 INT_PIN 0x01 INT_LINE 0x0a<br /> BYTE_0 0x01 BYTE_1 0x00 BYTE_2 0xc2 BYTE_3 0x07<br /><br /><br />(2) modinfo | grep bcm<br /><br />Found the driver is not loaded<br /><br />(3) Manually loaded driver<br /><br /> modload /kernel/drv/amd64/bcmndis<br /><br /><br /># modinfo | grep bcm<br />201 fffffffff7a39000 a3598 222 1 bcmndis (bcmndis(ndis wrapper 1.6))<br /><br /><br />(4) # grep bcm /etc/driver_aliases<br />bcmndis "pci14e4,4320"<br />bcmndis "pci14e4,1a"<br /><br />(5) update_drv -a -i '"pci14e4,1a"' bcmndis<br />("pci14e4,1a") already in use as a driver or alias<br /><br />(6) <br /> dladm show-link<br />bcmndis0 type: legacy mtu: 1500 device: bcmndis0<br />bge0 type: non-vlan mtu: 1500 device: bge0<br /><br /><br />(7) ifconfig bcmndis0 plumb<br /><br />(8) ifconfig -a<br />lo0: flags=2001000849<UP,LOOPBACK,RUNNING,MULTICAST,IPv4,VIRTUAL> mtu 8232 index 1<br /> inet 127.0.0.1 netmask ff000000 <br />bge0: flags=201004843<UP,BROADCAST,RUNNING,MULTICAST,DHCP,IPv4,CoS> mtu 1500 index 2<br /> inet 192.168.1.100 netmask ffffff00 broadcast 192.168.1.255<br /> ether 0:c0:9f:9e:41:5 <br />ip.tun0: flags=10010008d1<UP,POINTOPOINT,RUNNING,NOARP,MULTICAST,IPv4,FIXEDMTU> mtu 1366 index 3<br /> inet tunnel src 192.168.1.100 tunnel dst 192.18.32.151<br /> tunnel security settings esp (aes-cbc/hmac-md5)<br /> tunnel hop limit 60 <br /> inet 129.150.13.3 --> 129.145.40.124 netmask ffffffff <br />bcmndis0: flags=201000842<BROADCAST,RUNNING,MULTICAST,IPv4,CoS> mtu 1500 index 4<br /> inet 0.0.0.0 netmask 0 <br /> ether 0:b:6b:4c:4a:ec <br />(9)<br /> wificonfig -i bcmndis0 scan<br />essid bssid type encryption signallevel<br /><br /><br />It failed to discovered any router or access point.<br /><br /><br /><br />However, if we boot as 32 bit kernel then it works<div class="blogger-post-footer"></div> </article> <article> <h1>Adaptive Buffer Tuning for Data Intensive Algebraic Operations in Purpose of Parallel and Distributed Processing</h1> <p>2007-06-15T15:53:00.001-07:00</p> Both pervasive directional graphs and intensive algebraic operations require buffer management for stochastic data processes with constrained computing resources. Algebraic computation states in final stages tend to be readily identified within finite time horizon by sensing very abrupt transitions in system and network state spaces. But in early stages of constraints, these changes are hard to predict and difficult to distinguish from usual state fluctuations. Dynamic buffer allocation and replacement are the major techniques to construct structures for algebraic operations to ensure finite resource assesses. Hence, dynamic buffering function and control optimization are the major primitives to construct utilities for stochastic system processes to ensure converged resource accesses. To provide adaptation to large dimensional states, this research proposes a formal model-free buffer utility framework rooted from reinforcement learning methods and dynamic programming techniques to provide self organization of buffers to exploit parallel based buffer tuning processes. To time and space complexity reduction within the large state spaces, dynamic hidden neurons with incremental tuning is proposed for non-linear value function approximation to derive optimization procedures for optimal algebraic computational policies. For numeric and information evaluation, convergence analysis and error estimation are presented. Finally, a simulation test-bed and tuning results are deliberated.<div class="blogger-post-footer"></div> </article> <article> <h1>CVS Server Setup on Solaris 10</h1> <p>2007-06-15T14:35:00.000-07:00</p> (1) download cvs binary<br />(2) init cvs repository<br /> a. create repository root directory /usr/local/cvs-repository<br /> b. create a Solaris system user/group as: cvs/cvs<br /> c. grant ownership of /usr/local/cvs-repository to Solaris user/group cvs/cvs<br /> d. cvs -d /usr/local/cvs-repository init<br /> This will create repository CVSROOT under /usr/local/cvs-repository<br />(3) create cvs user/password<br /> a. create a password file as "passwd" under CVSROOT directory <br /> b. user pl file below to create encoded password for cvs user<br /> c. assign password to solaris user "cvs"<br /><br />The CVS password file is CVSROOT/passwd in the repository. It was not<br />created by default when you ran cvs init, because CVS doesn't know for<br />sure that you'll be using pserver. Even if the password file had been<br />created, CVS would have no way of knowing what usernames and passwords<br />to create. So, you'll have to create one yourself; here's a sample<br />CVSRoot/passwd file:<br /><br /> <cvs username>:<encoded password from pl file>:<Solaris system username><br />Here is the perl script to generate encoded password<br /> #!/usr/bin/perl<br /> <br /> srand (time());<br /> my $randletter = "(int (rand (26)) + (int (rand (1) + .5) % 2 ? 65 : 97))";<br /> my $salt = sprintf ("%c%c", eval $randletter, eval $randletter);<br /> my $plaintext = shift;<br /> my $crypttext = crypt ($plaintext, $salt);<br /> <br /> print "${crypttext}\n";<br /> <br /><br />I keep the preceding script in /usr/local/bin/pass.pl:<br /><br /> pass.pl "passwd"<br /><br /> output : Urmh23wFp1aOs<br /> <br />Then use the output passwd adding line in CVSROOT/passwd file <br /><br />cvs:Urmh23wFp1aOs:cvs<br /><br />(Here we create cvs user and solaris user same as "cvs")<br /><br /><br />The format is as simple as it looks. Each line is:<br /><br /> <USERNAME>:<ENCRYPTED_PASSWORD>:<OPTIONAL_SYSTEM_USERNAME><br /><br /> c. in the /etc/inetd.conf add one line as<br /><br />cvspserver stream tcp nowait root /opt/sfw/bin/cvs cvs --allow-root=/usr/local/cvs-repository pserver<br /><br /><br /> d. On Solaris 10 inetd.conf change does not take effect other than SFM service profile.<br /> using "inetconv" command to convert the inetd.conf as /var/svc/manifest/network/rpc/100235_1-rpc_ticotsord.xml<br /> In addition, add online in /etc/services to give permission<br /> cvspserver 2401/tcp<br /> e. this service file will be auto started by SFM daemon<br /> f. verify pserver service is started<br /> # svcs | grep cvs<br /> online 14:18:27 svc:/network/cvspserver/tcp:default<br /> g. use login test<br /><br /> cvs -d :pserver:cvs@<host>:/usr/local/cvs-repository login<div class="blogger-post-footer"></div> </article> <article> <h1>Kernel Module Load and Network setup</h1> <p>2007-06-14T18:44:00.000-07:00</p> 1. all amd64 drivers<br /><br />/kernel/drv/amd64<br /><br />2. acer 3400, bcmndis is the WIFI driver<br /><br />3. modinfo | grep bcmndis<br /><br />to check if the module is loaded<br /><br />4. modload bcmndis<br /><br />5. ifconfig bcmndis0 plumb<br /><br />6. wificonfig -i bcmndis0 scan<br /><br />7. setup connection with wificonfig<br /><br />8. there is link to update broadcom driver<br /><br />http://blogs.sun.com/pradhap/entry/ferrari_4000_flash_install<div class="blogger-post-footer"></div> </article> <article> <h1>Setup Acer Solaris x86 WIFI</h1> <p>2007-06-13T22:35:00.001-07:00</p> Acer Aspire 9300, Solaris X86, Atheros Wifi NIC<br />Submitted by spp on Tue, 2006-10-31 12:22.<br /><br />Got the Atheros 802.11abg NIC working on my new Acer laptop under Solaris X86. I tried to follow the instructions at the atheros driver page, but they are a little out of date. The atheros driver has been integrated into OpenSolaris, so only one or two instructions are correct. However, it did put me on the right track.<br /><br />First we need to make sure the driver is attached and we can start the interface<br /><br /> 1. Find the vendor and device IDs<br /> #/usr/X11/bin/scanpci<br /> pci bus 0x0004 cardnum 0x05 function 0x00: vendor 0x168c device 0x001a<br /> Atheros Communications, Inc. AR5005G 902.11abg NIC<br /> 2. Check in /etc/driver_aliases for Atheros (ath) mappings. Format of file is 'alias "pciXXXX,YYYY"' where XXXX is "vendor 0xXXXX" and YYYY is "device 0xYYYY" minus any beginning zeros.<br /> #grep ath /etc/driver_aliases<br /> ath "pci168c,13"<br /> ath "pci168c,1014"<br /> 3. update the driver to include the new device (note that the single quotes are needed in order to pass through the double quotes<br /> #update_drv -a -i '"pci168c,1a"' ath<br /> 4. now, plumb the interface<br /> #ifconfig ath0 plumb<br /> 5. either now, or before the plumb, you can find out what wifi access points are available<br /> #wificonfig scan<br /> essid bssid type encryption signallevel<br /> you should see a list here<br /><br />At this point, the instructions say that if you aren't running authentication, you can just use "ifconfig ath0 dhcp", but I am using encryption, so I moved on to trying to use wificonfig. Unfortunately, there are some mistakes here (possibly out of date and changed, not strictly incorrect). The biggest issue I found was that the instructions always reference using "-i [interface]", but that option isn't valid for most of the configuration (and the error message doesn't really make it easy to see).<br /><br /> 1. create a profile to store my ESSID and WEP information in (write-only profile, non-readable). Names changed for security... not that wepkey# has to be the actual WEP key, not the passphrase, which makes life significantly more difficult.<br /> #wificonfig createprofile home essid=HOME encryption=WEP wepkey1=10hexkey<br /> 2. activate the profile<br /> #wificonfig connect home<br /> wificonfig: connecting to profile 'home'<br /> 3. Now, like the earlier instructions, you can start dhcp<br /> #ifconfig ath0 dhcp<br /> 4. And, make sure we have connection<br /> #ifconfig ath0<br /> ath0: flags=201004843<UP,BROADCAST,RUNNING,MULTICAST,DHCP,IPv4,CoS> mtu 1500 index 3<br /> inet 192.168.21.100 netmask ffffff00 broadcast 192.168.21.255<br /> ether 0:16:cf:6f:a:92<div class="blogger-post-footer"></div> </article> <article> <h1>LDAPv3 Unauthenticated binding</h1> <p>2007-06-12T12:39:00.000-07:00</p> LDAPv3 specifications have introduced a unituitive feature with regards to authentication : the unauthenticated bind.<br />When an LDAP application provides a DN but no password, the Bind request is succesfull, BUT the user is not authenticated and has the same access rights as an Anonymous user.<br /><br />Note that DS 6.0 now has a configuration parameter to disable unauthenticated Binds, and remove this unconventional authentication "feature" of LDAPv3.<div class="blogger-post-footer"></div> </article> <article> <h1>LDOM Virtual Disk</h1> <p>2007-06-12T12:21:00.001-07:00</p> LDom vdisks are not SCSI disks . Therefore, the missing SCSI target ID<br />and disks have the name cNdNsN.<div class="blogger-post-footer"></div> </article> <article> <h1>Bind raw or block disk to disk service</h1> <p>2007-06-12T11:41:00.001-07:00</p> bind a raw disk (/dev/rdsk/c1t1d0)<br />bind to a block disk (/dev/dsk/c1t1d0) to a disk service.<div class="blogger-post-footer"></div> </article> <article> <h1>Zones and ZFS Pool</h1> <p>2007-06-12T10:32:00.000-07:00</p> Two zones created on a cluster in node 1 in a ZFS pool, since I need to have the zones in an installed state on each node in the cluster. There is a way to bypass having to install the zones on each node in the cluster? It is using shared storage and moving the zfs pools back and forth.<br /><br />Just three simple steps<br /><br />1. zonecfg -z zone1 export>myfile<br />2. failover the storage with the root path to the second node<br />3. get myfily over to the second node<br />4 configure the zone with zonecfg export -f myfile<br />5 attach the zone with -F<div class="blogger-post-footer"></div> </article> <article> <h1>NB Build and run</h1> <p>2007-06-12T07:46:00.000-07:00</p> export ANT_OPTS="-Xmx196m"<br /><br /><br />mkdir netbeans<br />cd netbeans<br />cvs -d :pserver:leiliu@cvs.netbeans.org:/shared/data/ccvs/repository -q co nbbuild<br />ant -f nbbuild/build.xml checkout<br />ant -f nbbuild/build.xml<br /><br />netbeans/nbbuild/netbeans/bin/netbeans to invoke IDE<div class="blogger-post-footer"></div> </article> <article> <h1>FIPS compliance Security Crypto Module</h1> <p>2007-06-12T07:37:00.000-07:00</p> Federal Information Processing Standards (FIPS) are publicly announced standards developed by the United States Federal government for use by all non-military government agencies and by government contractors. Many FIPS standards are modified versions of standards used in the wider community (ANSI, IEEE, ISO, etc.)<br /><br /><br />The National Institute of Standards and Technology (NIST) issued the 140 Publication Series to coordinate the requirements and standards for cryptographic modules which include both hardware and software components for use by departments and agencies of the United States federal government. FIPS 140 does not purport to provide sufficient conditions to guarantee that a module conforming to its requirements is secure, still less that a system built using such modules is secure. The requirements cover not only the cryptographic modules themselves but also their documentation and (at the highest security level) some aspects of the comments contained in the source code.<br /><br />http://en.wikipedia.org/wiki/FIPS_140<br />http://en.wikipedia.org/wiki/Federal_Information_Processing_Standard<br /><br />Sun's Cryptographic Accelerator 6000 provides exactly such a storage mechanism and API/tool set. The Cryptographic Accelerator is available for Solaris (SPARC and x86/x64) and Linux and is FIPS 140-2 Level 3 certified. It's key storage mechanism is also RF shielded and tamper-proof. It's probably one of the fastest cards on the market for accelerating SSL, IPsec/IKE and other general crypto and it's inexpensive (less than $1500 list).<br /><br />http://www.sun.com/products/networking/sslaccel/suncryptoaccel6000/details.xml<div class="blogger-post-footer"></div> </article> <article> <h1>ld: fatal: symbol is multiply-defined:</h1> <p>2007-06-11T13:26:00.000-07:00</p> ld: fatal: symbol `bar' is multiply-defined:<br /> (file foo.o and file bar.o);<br />ld: fatal: File processing errors. No output written to int.o<br /><br />foo.c and bar.c have conflicting definitions for the symbol bar. Because the link-editor cannot determine which should dominate, the link-edit usually terminates with an error message. You can use the link-editor's -z muldefs option to suppress this error condition, and allow the first symbol definition to be taken.<br /><br />resolve with compiling flag with <br /><br />-z muldefs<div class="blogger-post-footer"></div> </article> <article> <h1>LDOM Items</h1> <p>2007-06-11T12:23:00.000-07:00</p> (1) SPARC only for Niagara Platforms Solaris DOM0 and Any OSs DOMU<br />(2) x86, Solaris DOM0, and any OS domU<br />(3) x86, other OS DOM0 is not verified yet.<div class="blogger-post-footer"></div> </article> <article> <h1>fatal: relocation error: R_AMD64_PC32</h1> <p>2007-06-10T19:22:00.000-07:00</p> I am developing a c simulation tool. I am invoking one of dynamic library<br />(my home grown library named as: randlib.so)<br /><br />It has a function as<br /><br />double unifrand(double, double, long*);<br /><br />In my simulation application, I invoke the above function with<br /><br />seed = 1236537;<br />ran_no = unifrnd(0.0,1.0,&seed);<br /><br />I have flag below to build<br /><br />cc -m64 -o dist/Debug/Sun12-Solaris-x86/simperturbation build/Debug/Sun12-Solaris-x86/estimator.o build/Debug/Sun12-Solaris-x86/spoptimze.o -R/SunStudioProjects/randlib/dist/Debug/Sun12-Solaris-x86 -R/usr/sfw/lib/64 -lm /SunStudioProjects/randlib/dist/Debug/Sun12-Solaris-x86/randlib.so<br /><br /><br />However, during runtime, I have error blow:<br /><br />ld.so.1: simperturbation: fatal: relocation error: R_AMD64_PC32: file /SunStudioProjects/randlib/dist/Debug/Sun12-Solaris-x86/randlib.so: symbol unifrnd: value 0x2800112fedf does not fit<br /><br /><br />If I run list dynamic dependencies with the target simulation application binary,<br /><br />ldd simperturbation<br />libm.so.2 => /lib/64/libm.so.2<br />randlib.so => /SunStudioProjects/randlib/dist/Debug/Sun12-Solaris-x86/randlib.so<br />libc.so.1 => /lib/64/libc.so.1<br /><br /><br />As I compiled the DLL with -Kpic flag. It works<br /><br />The URL below helps. <br /><br />http://blogs.sun.com/rie/entry/my_relocations_don_t_fit<div class="blogger-post-footer"></div> </article> <article> <h1>binary & library Info and In question</h1> <p>2007-06-10T01:48:00.000-07:00</p> (1) file <binary><br />(2) ldd <binary><div class="blogger-post-footer"></div> </article> <article> <h1>Stochastic Systems</h1> <p>2007-06-10T01:11:00.000-07:00</p> governing variables -> system behavior<br /><br />random variables -> stochastic system<br /><br />large number: Not large until the change does not impact the system behavior<div class="blogger-post-footer"></div> </article> <article> <h1>Complier flag for simulation Tool</h1> <p>2007-06-10T00:48:00.001-07:00</p> 1. Flag for 64 bit memory model of x86 platform architecture<br />2. Dynamic Library<br />3. Dynamic Link<br />4. Math Library<br />5. Runtime Search Path<br />6. -I include directory<br /><br />cc -m64 -c -g +w -I/SunStudioProjects/randlib -o build/Debug/Sun12-Solaris-x86/spoptimze.o spoptimze.c<br /><br />cc -m64 -o dist/Debug/Sun12-Solaris-x86/simperturbation build/Debug/Sun12-Solaris-x86/estimator.o build/Debug/Sun12-Solaris-x86/spoptimze.o -R/SunStudioProjects/randlib/dist/Debug/Sun12-Solaris-x86 -lm /SunStudioProjects/randlib/dist/Debug/Sun12-Solaris-x86/randlib.so<div class="blogger-post-footer"></div> </article> <article> <h1>Complier flag for simulation Tool</h1> <p>2007-06-10T00:48:00.000-07:00</p> 1. Flag for 64 bit memory model of x86 platform architecture<br />2. Dynamic Library<br />3. Dynamic Link<br /><br />cc -m64 -o dist/Debug/Sun12-Solaris-x86/simperturbation build/Debug/Sun12-Solaris-x86/estimator.o build/Debug/Sun12-Solaris-x86/spoptimze.o -R/SunStudioProjects/randlib/dist/Debug/Sun12-Solaris-x86 -lm /SunStudioProjects/randlib/dist/Debug/Sun12-Solaris-x86/randlib.so<div class="blogger-post-footer"></div> </article> <article> <h1>Social Network</h1> <p>2007-06-09T14:33:00.000-07:00</p> CEpedia and Koda are typical Sun Social network<div class="blogger-post-footer"></div> </article> <article> <h1>NIO or IO</h1> <p>2007-06-09T14:30:00.000-07:00</p> It seems block or non-blocking address the FD limitation previously existing on the server. There is a work around to improve the FD limitation. However, from server socket processing with sequential by nature. I tend to suggest to take blocking IO for normal mid-large workload but small-mid workload take unblocking approach since it functionally replicate Queuing algorithms<div class="blogger-post-footer"></div> </article> <article> <h1>Inetmenu good for Laptop</h1> <p>2007-06-09T14:28:00.000-07:00</p> It is a good tool to assign IP for laptop<br /><br />It requires root to run then get IP from DHCP server or Wireless Access Points.<div class="blogger-post-footer"></div> </article> <article> <h1>S11 NV build Laptop</h1> <p>2007-06-09T14:22:00.000-07:00</p> (1). Solaris Express, Developer version build installation<br />(2). If it is under SWAN, it will bypass a lot of setup to go straight with default<br /> NIS process. <br />(3). It requires sys-unconfig process if you want change other things. Do not enable DHCP here<br /> but use inetmenu<br /><br />However, sys-unconfig will not give you option to change host name<br /><br />So, it is important to get hostname change process.<br /><br />To change the hostname on a Solaris system:<br /><br />1. Change the hostname in /etc/nodename<br />2. Run uname -S new_hostname to change the nodename for your current session.<br />3. Change the hostname in /etc/hostname.network_interface (e.g. /etc/hostname.hme0)<br />4. Run hostname new_hostname to change the hostname for your current session.<br />5. Change the hostname in /etc/hosts<br />6. Change the hostname in /etc/net/*/hosts (/etc/net/ticlts/hosts, /etc/net/ticots/hosts, /etc/net/ticotsord/hosts)<br />for directory in ticlts ticots ticotsord<br />do<br /> cd /etc/net/$directory<br /> sed 's/old_hostname/new_hostname/g' hosts > hosts.new<br /> mv hosts.new hosts<br />done<br />Solaris 7 or later additional instructions:<br />7. Change the hostname in DUMPADM_SAVDIR= line in /etc/dumpadm.conf<br /><br />Solaris 10 additional instructions:<br />8. Change the hostname in /etc/inet/ipnodes<br /><br /><br /><br />However, all x86 updates. should visit community software (csw package download)<br />http://www.blastwave.org/packages.php<br /><br />blastwave.org<br /><br /><br />This includes wget, pkg-get, tetex etc.<div class="blogger-post-footer"></div> </article> <article> <h1>WTS 2007 Paper Publication</h1> <p>2007-06-09T14:12:00.000-07:00</p> Exchange information on advances in mobile communications and wireless networking technology, management, applications, and security in a very pleasant Southern California conference environment with leaders and experts from industry, governmental agencies, and universities around the world at the Wireless Telecommunications Symposium.<br /><br />WTS 2007 will focus on The Future of Wireless Communications. Planned highlights of WTS 2007 include:<br /><br /> * An IEEE Communications Society Co-Sponsored Welcoming Dinner with Internet Pioneer Vinton G. Cerf, Vice President and Chief Internet Evangelist at Google, as guest speaker<br /> * Addresses and presentations by some of the most respected executives and researchers in the wireless communications industry<br /> * Panel discussions including Future Directions in Wireless Communications Research, Wireless Network Security, New Wireless Communications Ventures, Wireless Communications Investments, Mobile Wireless Services and Business, Wireless Communications Business Strategy, Advances in Satellite Communications, and The Future of Deep Space Communications<br /> * A tutorial on Portable Emergency Networks and a Wireless Network Security Workshop<br /> * Presentations of accepted academic and practitioner applied research papers; a poster paper session; a doctoral students session<br /> * A tour of Universal Studios Hollywood followed by a reception at CityWalk<br /><br /><br /> Peer-reviewed proceedings will be published by the IEEE and will be available on its Xplore online publication system. A CD containing the invited speakers' presentations and accepted applied research papers will be distributed to registrants at the conference. Applicable student papers are welcome. Awards will be given for the outstanding undergraduate and graduate papers submitted.<br /><br /><br />http://www.csupomona.edu/~wtsi/doc/WTS_2007-Accepted_Paper_Program.htm<br /><br /><br />My Paper on Lock contention is located by IEEE Explorer<div class="blogger-post-footer"></div> </article> <article> <h1>ICACT2007 Paper publication</h1> <p>2007-06-09T14:04:00.000-07:00</p> http://www.icact.org/program/program.asp#3<br /><br /><br />It is Feb 2007<br /><br /><br /><br />My Paper stated as Index and SOA Performance<br /><br /><br />Please visit IEEE Explorer<div class="blogger-post-footer"></div> </article> <article> <h1>ISCIT2006</h1> <p>2006-12-07T17:57:00.000-08:00</p> <a onblur="try {parent.deselectBloggerImageGracefully();} catch(e) {}" href="http://photos1.blogger.com/x/blogger/2357/1952/1600/485321/IMG_1222.jpg"></a><div class="blogger-post-footer"></div> </article> <article> <h1>Hash Distribution Algorithm</h1> <p>2006-11-10T12:39:00.000-08:00</p> For a hash-based distribution algorithm, the most difficult part is to define what hash function would avoid re-distribution. To reduce entry re-distribution, it is also possible to configure the proxy with the maximum number of distribution "slots" upfront, say 10 slots, then associate multiple slots with each service instance.<br /><br />S1,S2,S3 --> SVC1<br />S4,S5,S6 --> SVC2<br />S7, S8, S7, S10 --> SVC3<br /><br />When the amount of entries stored on SVC1 exceed some limits, a new service instance is set up (say SVC4), one (or more) slots formerly managed by SVC1 are moved to SVC4 (the content of SVC1 is re-distributed to SVC1 and SVC4) and the proxy configuration is changed accordingly, for instance<br /><br />S1,S2 --> SVC1<br />S3 --> SVC4<br />S4,S5,S6 --> SVC2<br />S7, S8, S7, S10 --> SVC3<br /><br />This does not solve the re-distribution problem. However, it is much easier to deal with this issue as the number of entries to be re-distributed is much smaller compared to a configuration where the max number of slots has not been planned upfront.<div class="blogger-post-footer"></div> </article> </main></body></html>

My Online PDA

Table Virtual World