Strange Patterns

Project Euler: Level 3

2012-01-30T10:15:00.001-03:00

Ten months later I am at Level 3 :P

Elegir

2011-11-21T12:51:00.001-03:00

Es uno de los verbos más usado en el comercio a diferentes niveles, tal como, ferias libres, malls, marketing televisivo, Internet, papel (periódicos, carteles y otros).

A la vez uno de los verbos mas erradamente escritos, sucede muy frecuente que usen J (jota) en vez de G para decir, elegido, elegir... no sé cual es el motivo de confusión, donde la regla es sólo si usan a/o entonces hay que usar J

En la RAE sale la conjugación correcta:

En Transgrediendo a Cervantes hay varias fotos al respecto.

PD: Proteger es otro verbo que también se usa mal a menudo.

WL_LLR_ADMINSERVER

2011-11-08T11:04:00.003-03:00

WebLogic Server 10.x has non-XA datasource that emulates Global Transactions; when using non-XA with Global Transactions and Logging Last Resource enable the following error may happen at admin console:

* An error occurred during activation of changes, please see the log for details.

* weblogic.application.ModuleException:

* JDBC LLR, table verify failed for table 'WL_LLR_ADMINSERVER', row 'JDBC LLR Domain//Server' record had unexpected value 'base_domain//AdminServer' expected 'domain_sample//AdminServer'*** ONLY the original domain and server that creates an LLR table may access it ***

or

in the WLS stdout:

<08-11-2011 10:50:57 AM CLST> <Error> <Deployer> <BEA-149202> <Encountered an exception while attempting to commit the 1 task for the application 'DS1'.>
weblogic.application.ModuleException:
        at weblogic.jdbc.module.JDBCModule.activate(JDBCModule.java:349)
        at weblogic.application.internal.flow.ModuleListenerInvoker.activate(ModuleListenerInvoker.java:107)
        at weblogic.application.internal.flow.DeploymentCallbackFlow$2.next(DeploymentCallbackFlow.java:411)
        at weblogic.application.utils.StateMachineDriver.nextState(StateMachineDriver.java:37)
        at weblogic.application.internal.flow.DeploymentCallbackFlow.activate(DeploymentCallbackFlow.java:74)
        at weblogic.application.internal.flow.DeploymentCallbackFlow.activate(DeploymentCallbackFlow.java:66)
        at weblogic.application.internal.BaseDeployment$2.next(BaseDeployment.java:635)
        at weblogic.application.utils.StateMachineDriver.nextState(StateMachineDriver.java:37)
        at weblogic.application.internal.BaseDeployment.activate(BaseDeployment.java:212)
        at weblogic.application.internal.SingleModuleDeployment.activate(SingleModuleDeployment.java:16)
        at weblogic.application.internal.DeploymentStateChecker.activate(DeploymentStateChecker.java:162)
        at weblogic.deploy.internal.targetserver.AppContainerInvoker.activate(AppContainerInvoker.java:79)
        at weblogic.deploy.internal.targetserver.operations.AbstractOperation.activate(AbstractOperation.java:569)
        at weblogic.deploy.internal.targetserver.operations.ActivateOperation.activateDeployment(ActivateOperation.java:140)
        at weblogic.deploy.internal.targetserver.operations.ActivateOperation.doCommit(ActivateOperation.java:106)
        at weblogic.deploy.internal.targetserver.operations.AbstractOperation.commit(AbstractOperation.java:323)
        at weblogic.deploy.internal.targetserver.DeploymentManager.handleDeploymentCommit(DeploymentManager.java:820)
        at weblogic.deploy.internal.targetserver.DeploymentManager.activateDeploymentList(DeploymentManager.java:1227)
        at weblogic.deploy.internal.targetserver.DeploymentManager.handleCommit(DeploymentManager.java:403)
        at weblogic.deploy.internal.targetserver.DeploymentServiceDispatcher.commit(DeploymentServiceDispatcher.java:163)
        at weblogic.deploy.service.internal.targetserver.DeploymentReceiverCallbackDeliverer.doCommitCallback(DeploymentReceiverCallbackDeliverer.java:181)
        at weblogic.deploy.service.internal.targetserver.DeploymentReceiverCallbackDeliverer.commit(DeploymentReceiverCallbackDeliverer.java:63)
        at weblogic.deploy.service.internal.statemachines.targetserver.AwaitingCommit.callDeploymentReceivers(AwaitingCommit.java:235)
        at weblogic.deploy.service.internal.statemachines.targetserver.AwaitingCommit.handleCommit(AwaitingCommit.java:131)
        at weblogic.deploy.service.internal.statemachines.targetserver.AwaitingCommit.receivedCommit(AwaitingCommit.java:44)
        at weblogic.deploy.service.internal.transport.CommonMessageReceiver.receiveRequestCommitMsg(CommonMessageReceiver.java:470)
        at weblogic.deploy.service.internal.transport.CommonMessageReceiver$3.run(CommonMessageReceiver.java:742)
        at weblogic.work.SelfTuningWorkManagerImpl$WorkAdapterImpl.run(SelfTuningWorkManagerImpl.java:516)
        at weblogic.work.ExecuteThread.execute(ExecuteThread.java:201)
        at weblogic.work.ExecuteThread.run(ExecuteThread.java:173)
Caused by: java.sql.SQLException: JDBC LLR, table verify failed for table 'WL_LLR_ADMINSERVER', row 'JDBC LLR Domain//Server' record had unexpected value 'base_domain//AdminServer' expected 'domain_sample//AdminServer'*** ONLY the original domain and server that creates an LLR table may access it ***
        at weblogic.jdbc.wrapper.JTSLoggableResourceTable.newVerifyException(JTSLoggableResourceTable.java:221)
        at weblogic.jdbc.wrapper.JTSLoggableResourceTable.findOrCreateTable(JTSLoggableResourceTable.java:303)
        at weblogic.jdbc.wrapper.JTSLoggableResourceImpl.findOrCreateBackingTable(JTSLoggableResourceImpl.java:528)
        at weblogic.jdbc.wrapper.JTSLoggableResourceImpl.recoverXARecords(JTSLoggableResourceImpl.java:241)
        at weblogic.transaction.internal.ServerTransactionManagerImpl.registerLoggingResourceTransactions(ServerTransactionManagerImpl.java:751)
        at weblogic.jdbc.common.internal.RmiDataSource.recoverLoggingResourceTransactions(RmiDataSource.java:277)
        at weblogic.jdbc.common.internal.DataSourceManager.createAndStartDataSource(DataSourceManager.java:148)
        at weblogic.jdbc.common.internal.DataSourceManager.createAndStartDataSource(DataSourceManager.java:97)
        at weblogic.jdbc.module.JDBCModule.activate(JDBCModule.java:346)
        ... 29 more

This is for the verbatim message:

Caused by: java.sql.SQLException: JDBC LLR, table verify failed for table 'WL_LLR_ADMINSERVER', row 'JDBC LLR Domain//Server' record had unexpected value 'base_domain//AdminServer' expected 'domain_sample//AdminServer'*** ONLY the original domain and server that creates an LLR table may access it ***

Therefore one way to solve this is to update the WL_LLR_ADMINSERVER table pointing to to the correct target domain name and server that has this LLR DataSource.
where the String 'domain_sample//AdminServer' is the tuple to be modifed.

Excute the following SQL script for updating:

update SCHEMA_SAMPLE.WL_LLR_ADMINSERVER set RECORDSTR = 'domain_sample//AdminServer' where  XIDSTR  = 'JDBC LLR Domain//Server';

Eclipse Plug-ins (update)

2011-11-02T11:56:00.000-03:00

After several years, many plug-ins has been made and are more stable than ever.

From my last post about it, the following list is the one I am currently using:
(most of these URIs are the repository location for installing new software at Eclispe)

AnyEdit Tools - http://andrei.gmxhome.de/eclipse/
M2 - http://download.eclipse.org/technology/m2e/releases
JD-Eclipse : http://java.decompiler.free.fr/jd-eclipse/update
Oracle Enterprise Pack for Eclipse (OEPE) - http://download.oracle.com/otn_software/oepe/indigo

Sysdeo http://www.eclipsetotale.com/tomcatPlugin.html
Subclipse http://subclipse.tigris.org

More plug-ins can be found at: http://marketplace.eclipse.org/

org.hibernate.QueryException: ClassNotFoundException: org.hibernate.hql.ast.HqlToken

2011-10-28T12:12:00.008-03:00

In Oracle Weblogic Server - Version: 9.2 to 10.3.5 when shutting down managed server(s) the following error may occurs:

CharScanner; panic: ClassNotFoundException: org.hibernate.hql.ast.HqlToken

or when trying to run an application using HQL with antlr as parser, the following stacktrace may appear:

org.hibernate.QueryException: ClassNotFoundException: org.hibernate.hql.ast.HqlToken [ from org.example.hibernate.Customer]
at org.hibernate.hql.ast.HqlLexer.panic(HqlLexer.java:57)
at antlr.CharScanner.setTokenObjectClass(CharScanner.java:340)
at org.hibernate.hql.ast.HqlLexer.setTokenObjectClass(HqlLexer.java:31)
at antlr.CharScanner.(CharScanner.java:51)
at antlr.CharScanner.(CharScanner.java:60)
at org.hibernate.hql.antlr.HqlBaseLexer.(HqlBaseLexer.java:56)
at org.hibernate.hql.antlr.HqlBaseLexer.(HqlBaseLexer.java:53)
at org.hibernate.hql.antlr.HqlBaseLexer.(HqlBaseLexer.java:50)
at org.hibernate.hql.ast.HqlLexer.(HqlLexer.java:26)
at org.hibernate.hql.ast.HqlParser.getInstance(HqlParser.java:44)
at org.hibernate.hql.ast.QueryTranslatorImpl.parse(QueryTranslatorImpl.java:242)
at org.hibernate.hql.ast.QueryTranslatorImpl.doCompile(QueryTranslatorImpl.java:157)
at org.hibernate.hql.ast.QueryTranslatorImpl.compile(QueryTranslatorImpl.java:112)
at org.hibernate.engine.query.HQLQueryPlan.(HQLQueryPlan.java:77)
at org.hibernate.engine.query.HQLQueryPlan.(HQLQueryPlan.java:57)
at org.hibernate.engine.query.QueryPlanCache.getHQLQueryPlan(QueryPlanCache.java:72)
at org.hibernate.impl.AbstractSessionImpl.getHQLQueryPlan(AbstractSessionImpl.java:133)
at org.hibernate.impl.AbstractSessionImpl.createQuery(AbstractSessionImpl.java:112)
at org.hibernate.impl.SessionImpl.createQuery(SessionImpl.java:1627)
at org.example.hibernate.HQLSample.selectCustomer(HQLSample.java:41)
at Test.doGet(Test.java:38)
at javax.servlet.http.HttpServlet.service(HttpServlet.java:707)
at javax.servlet.http.HttpServlet.service(HttpServlet.java:821)
at weblogic.servlet.internal.StubSecurityHelper$ServletServiceAction.run(StubSecurityHelper.java:227)
at weblogic.servlet.internal.StubSecurityHelper.invokeServlet(StubSecurityHelper.java:125)
at weblogic.servlet.internal.ServletStubImpl.execute(ServletStubImpl.java:300)
at weblogic.servlet.internal.ServletStubImpl.execute(ServletStubImpl.java:184)
at weblogic.servlet.internal.WebAppServletContext$ServletInvocationAction.wrapRun(WebAppServletContext.java:3717)
at weblogic.servlet.internal.WebAppServletContext$ServletInvocationAction.run(WebAppServletContext.java:3681)
at weblogic.security.acl.internal.AuthenticatedSubject.doAs(AuthenticatedSubject.java:321)
at weblogic.security.service.SecurityManager.runAs(SecurityManager.java:120)
at weblogic.servlet.internal.WebAppServletContext.securedExecute(WebAppServletContext.java:2277)
at weblogic.servlet.internal.WebAppServletContext.execute(WebAppServletContext.java:2183)
at weblogic.servlet.internal.ServletRequestImpl.run(ServletRequestImpl.java:1454)
at weblogic.work.ExecuteThread.execute(ExecuteThread.java:209)
at weblogic.work.ExecuteThread.run(ExecuteThread.java:178)

Cause
Classloading issues with antlr library bundled with WebLogic Server that is not compatible with Hibernate 3.

Solution
It is necessary to use antlr 2.7.6 (this version works, however more details of which version should be check with Hibernate as being a third party tool).

There are 4 possible workarounds for this classloading issue:

1. Package antlr.jar into WEB-INF/lib and add the following tag to weblogic.xml
(this works for war alone or packaged into an ear).


    true

2. If it is an ear file then put antlr.jar at APP-INF/lib (or at web application level: WEB-INF/lib) and modify weblogic-application.xml adding the following tag:


    antlr.*

3. Change property hibernate.query.factory_class from hibernate configuration file (hibernate.cfg.xml).
(if hibernate.query.factory_class doesn't exist then this value is assigned by default):

to a different parser (classic):

4. Set at server classpath level antlr library before WLS classpath.
(warning: this is the less recommended option because it impacts the whole WLS and may affect another modules).

In setDomainEnv.cmd (or any of the start-up scripts) set the next value at the end of the file, referring to antlr library's location:

set CLASSPATH=C:\jars\antlr-2.7.6.jar;%CLASSPATH%

References
http://download.oracle.com/docs/cd/E21764_01/web.1111/e13706/classloading.htm
http://community.jboss.org/wiki/HibernateCoreMigrationGuide30#weblogic

Matemática, un viaje entretenido

2011-10-25T10:05:00.004-03:00

Para los usuarios del Metro de Santiago de Chile hay un concurso de matemáticas que esta abierto hasta el 31 de octubre.

Son preguntas interesantes y alguna conocidas... si se entusiasman vayan al sitio: http://www.unviajeentretenido.cl

Se agradece esta iniciativa hecha por el Metro y la PUC.

Facebook Programming Challenge

2011-10-25T10:03:00.000-03:00

For anybody that like to solve puzzles and programming, Facebook has a new challenge:
http://facebook.interviewstreet.com/recruit/challenges

In this case also it is a test for recruiting.

Be careful that is timed programming question therefore be sure to have some free time and without noise :P

Foo

2011-09-28T13:07:00.001-03:00

Es conocido las palabras foo y bar para dar ejemplos de programación, lo que no sabia era las otras también utilizadas: baz, qux, quux

Generando el siguiente conjunto de términos:

{ foo, bar, foobar, baz, qux, quux }

The Bank of San Serriffe

2011-09-07T11:42:00.000-03:00

Just checking Knuth's page, I've found out that I appeared twice in The Bank of San Serriffe's balance:

German González-Morris 0x$1.20
German Gonzales-Morris 0x$1.20

It is incredible how many times my last name (being one of the most popular worldwide) is misspelled :D

Eclipse versions bundled in WebLogic Server

2011-09-01T10:08:00.003-03:00

This is a summary of embedded Eclipse versions found in WebLogic Server installations:

WebLogic Server	Eclipse	OEPE
10.3	only WorkShop	--
10.3.1	3.4.2 (Ganymede)	11.1.1.1.1
10.3.2	3.5.0 (Galileo)	11.1.1.3.0
10.3.3	3.5.2	11.1.1.5.0
10.3.4	3.6.1 (Helios)	11.1.1.6.1
10.3.5	3.6.2	11.1.1.7.2
standalone	3.7.0 (Indigo)	11.1.1.7.3

WebLogic Server installations can be downloaded from: http://www.oracle.com/technetwork/middleware/weblogic/downloads/index.html

Oracle OEPE can be obtained standalone as well, usually there is newer version too: http://www.oracle.com/technetwork/developer-tools/eclipse/downloads/index.html

HP48GX libraries

2011-07-20T10:23:00.002-04:00

This is a list of minimum extra libraries for Hp48GX, thus it becomes a perfect functional scientific calculator:

Awkward Javadoc comments

2011-07-04T11:00:00.011-04:00

There are several funny Javadocs explaining methods, properties and/or examples:

1. Catastrophic :

weblogic.cluster.singleton

public interface ClusterLeaderListener 

void localServerLostClusterLeadership()

This method is called if the local server is already the cluster leader i.e. localServerIsClusterLeader() has already been called and subsequently the server loses the cluster leadership. This can only happen under catastrophic conditions. This condition is fatal.

2. Draconian : 

javax.xml.validation.Validator 

setErrorHandler:

class DraconianErrorHandler implements ErrorHandler {
     public void fatalError( SAXParseException e ) throws SAXException {
         throw e;
     }
     public void error( SAXParseException e ) throws SAXException {
         throw e;
     }
     public void warning( SAXParseException e ) throws SAXException {
         // noop
     }
 }

3. Draconian' :

DRACONIAN_ERROR_HANDLER

public static final org.xml.sax.ErrorHandler DRACONIAN_ERROR_HANDLER

// ErrorHandler that always treat the error as fatal.

http://javasourcecode.org/html/open-source/jdk/jdk-6u23/com/sun/xml/internal/ws/util/xml/XmlUtil.java.html#line.300

Project Euler: Level 1

2011-05-16T12:57:00.001-04:00

I have passed to Level 1 @ProjectEuler. It took me one week spare time... fun stuff

Project Euler

2011-05-08T10:39:00.002-04:00

Hace un tiempo publiqué una lista de sitios de competencias de programación y resolución de problemas matemáticos más cercanos a las matemáticas recreativas.

Dentro de los cuales he participado en menor grado en TopCoder y CodeChef que demuestran un nivel de probemas bastante simpáticos, en donde la mayor atracción es la de problemas de larga duración (ó maratones tac como lo menciona topcoder). El otro tipo de competencias son de corto plazo, muy similar a los concursos que hace ACM o una prueba de universidad.

Uno que no habia considerado es Project Euler que esta más cercano a las matemáticas que la programación. En este sitio hay problemas definidos con una solución esperada, única (y no como test cases que se pueden ejecutar para variables en los ya mencionados otros concursos).

Es bastante bueno la interfaz del sitio para encontrar información e ir viendo los avances que uno logra, por otro lado, los primeros problemas son bastantes fáciles y de un nivel adecuado para cursos introductorios de programación (a pesar que vi algunos grupos de alumnos de algoritmos y estrucutras de datos, espero que ete caso los hayan forzado a solucionar los problemas más avanzados).

Esta hecho de tal manera que la dificultad de los problemas van avanzando y así uno va consiguiendo logros tal como si fuese un alumno de karate :P

Creo que hay que seguir con este proyecto, cual tiene una perspertiva diferente y con pensamiento libre.

Por ahora solo 12 problemas resueltos y contando...
(ícono automático con datos):

WLS: Listing Users and their Groups in a Security Realm

2011-05-05T09:43:00.007-03:00

Many times I've seen the question about a WLST script for listing groups to which an user belongs.
(This works Oracle Weblogic Server - Version: 9.0 to 10.3.4)

Before running the script you need to set up the environment to your local WebLogic Server by invoking DOMAIN_NAME\bin\setDomainEnv.cmd (setDomainEnv.sh on UNIX), where DOMAIN_NAME is the directory in which you located the domain

You need to modify the line 6, where set the address, port, username and password of your WebLogic Server:

connect('weblogic','welcome1','t3://127.0.0.1:7001')

and run it with the following command line:

java weblogic.WLST groups_of_users.py

Listing groups_of_users.py:

from weblogic.management.security.authentication import UserReaderMBean
from weblogic.management.security.authentication import GroupReaderMBean
from weblogic.management.security.authentication import MemberGroupListerMBean

# connect to WLS with username/password = weblogic/welcome1
connect('weblogic','welcome1','t3://127.0.0.1:7001')

realm=cmo.getSecurityConfiguration().getDefaultRealm()
atns = realm.getAuthenticationProviders()

for i in atns:
  if isinstance(i,UserReaderMBean):
    userReader = i
    cursor = i.listUsers("*",0)
    # print '* Users in realm '+realm.getName()+' are: '
    while userReader.haveCurrent(cursor):
      # print userReader.getCurrentName(cursor)
      user = userReader.getCurrentName(cursor)

# init

      print ''

    # listings groups of user
      # print "Listing the groups of a '" + user +"'"
      atnr=cmo.getSecurityConfiguration().getDefaultRealm().lookupAuthenticationProvider("DefaultAuthenticator")
      # users? = OracleSystemUser, weblogic
      x = atnr.listMemberGroups(user)
      # print x

      # new pointers for better understanding
      groupReader = atnr
      cursor2 = x
      print "* Groups in user '" + user + "' are: "
      while groupReader.haveCurrent(cursor2):
        print groupReader.getCurrentName(cursor2)
        groupReader.advance(cursor2)
      groupReader.close(cursor2)

# end      
      
      userReader.advance(cursor)
    userReader.close(cursor)

Then you will get a similar output to:

* Groups in user 'weblogic' are:
Administrators

* Groups in user 'usertest1' are:
AppTesters
Monitors

El Rey de e (5x5)

2011-02-25T17:41:00.002-03:00

Un nuevo cuadrado encontrado, ahora con 95 dígitos:

2,7182818284590452353602874713526624977572470936999595749669676277240766303535547594571382178525

7 2 0 6 2
1 8 5 5 3
3 7 4 0 9
5 2 7 9 3
6 6 5 6 6

Dijkstra: My small tribute

2010-12-28T17:04:00.004-03:00

for over four decades mailed copies of his consecutively numbered technical notes, trip reports, insightful observations, and pungent commentaries, known collectively as "EWDs" [1]. This is a great project that has been running for years to transcribed by hand all the already scanned EWD.

I have transcribed two of several EWD documents that remains for that task; more than a contribution to knowledge (by my side), this is a small tribute to this great computer scientist.

If you feel with time to support in the same way (or proofreading as well), please try visiting the Archive website.

[1] http://www.cs.utexas.edu/users/EWD/

UML: mal entendimiento

2010-12-16T12:53:00.001-03:00

He visto bastante en la escena productiva un mal entendimiento de UML, poniendo 2 posturas opuestas extremas, tal como:

Los que creen que es la panacea
Los que la odian

Los del primer grupo creen que a base de la primera creen que al usar tal herramienta el proyecto va ser exitoso y todo funcionara.

Los del segundo grupo creen que es basura (muchas veces teniendo la misma base erronea del primer grupo, que es supuesta panacea), porque no les genero el esquelo completo de su diseño de patrones/clases

Generalmente ocurre lo que no se entiende no gusta, ha sucedido siempre en la historia de la civilización, pero acá podemos rescatar algunas buenas practicas para poder usar esta nomenclatura en vez de seguir neófito.

Lo que NO es:

No es la panacea
Por lo mismo no te entregara todas las clases (si tienen un buen diseñador/analista con experiencia en programación y patrones de diseño puede entregar algo robusto, pero siempre tendrá algo que falta y esas iteraciones deberán hacerla el programador, obviamente todo esto funciona si los requerimientos iniciales se hicieron bien y no se ha cambiado en el tiempo).

Lo que Si es:

Estandariza la nomenclatura
Explica de forma simple ciertas especificaciones como con casos de uso y de secuencia para todo usuario y programadores respectivamente.

por otro lado simple hay alguna manera de poder especificar guarismos, es más, Meyer y otros ya lo han hecho, lo malo de UML que es propietario, pero se alineo con OMG asi que es el mejor/último esfuerzo que se ha hecho de tal manera que la documentación sea estándar al contratar a Jacobson e IBM comprar a Rational.

-- (15/10/08).

Después de haber escrito el pasado texto hace ya 2 años, veo que Fowler tiene un punto de vista bastante parecido donde me llama mucho la atención los siguientes párrafos:

Changing the design doesn't necessarily mean changing the diagrams. It's perfectly reasonable to draw diagrams that help you understand the design and then throw the diagrams away. Drawing them helped, and that is enough to make them worthwhile. They don't have to become permanent artifacts. The best UML diagrams are not artifacts.

A lot of XPers use CRC cards. That's not in conflict with UML. I use a mix of CRC and UML all the time, using whichever technique is most useful for the job at hand.

Bueno lo escribió el 2004 :-)

-- (15/12/10)

EJB 3.0 Database Persistence with Oracle Fusion Middleware 11g : Review

2010-12-13T15:33:00.001-03:00

This is a good book (→tutorial) for any developer that wants to use EJB 3.0 with the most popular Oracle J2EE technologies.

The book starts with a simple introduction of EJB 3.0 and compares that spec to EJB 2.x, overviews new features such as, annotations, JPA and interceptors.

Then it goes into this topic in depth, always tied-up to JDeveloper; for instance, shows how to convert EJB 2.x to 3.0, it's a very good example if the reader comes from that legacy specification or to see explicitly how much effort we are saving coding and not generating deploy descriptors to obtain the same business/architecture JEE feature.

Continuing the Book's Oracle point of view, look into EclipseLink JPA, JDeveloper (as main IDE) and complete chapter of Eclipse OEPE and their details. Chapters dedicated to integration with ADF & JSF separately, EJB relationships, and finishing with Web Services.

A lot of details, clear explanations, source code, screen-shots of step-by-step instructions to avoid any doubt to the reader to get the best of these specs and tools.

As usual at Packt Publishing website can be found the source code of these examples.

More Information at:

CWEB en Español

2010-12-06T10:26:00.002-03:00

Después de varios meses de trabajo, he podido terminar de traducir a Castellano The CWEB System of Structured Documentation de Donald Knuth.

Fue una tarea bastante ardua, más de lo que imagine ya que hay muchas frases técnicas (de tipografía) y sobre todo con mucha información tácita.

Se puede bajar desde el mismo sitio del Prof. Knuth: http://www-cs-faculty.stanford.edu/~knuth/cweb.html

Si alguien tiene comentarios, sugerencias para el documento, por favor diganmelo.

Liar, Liar: Solved - FaceBook Puzzles

2010-11-23T12:30:00.003-03:00

I have solved the first problem of Facebook Engineering Puzzles (Snack difficulty). It took me more time that I've planned, as usual, being a blackbox is harder to reach a solution.

Right now the robot has problems to receive emails from gmail (using the webmail app), therefore the solution is to send the solution through a script that uses SMTP.

This is the email sent by the robot:

Thank you for your submission of a puzzle solution to Facebook! After running your solution to liarliar (received on November 22, 2010, 9:24 am), I have determined it to be correct. Your solution ran for 1400.789 ms on its longest test case. If you have not already, try installing the official Facebook Puzzles application from http://apps.facebook.com/facebookpuzzles/ and publish a story about your solution! To publish, just go to http://apps.facebook.com/facebookpuzzles/mypuzzles.php and click on the publish link.

If you are applying for a position within Facebook, the puzzle difficulty solved will be taken into account with regards to how much time you had available to solve it (remember that Hors D'oeuvres are only tests for your benefit). I have taken the liberty of alerting our recruiting team about your success. Best of luck!

Sincerely,
-The puzzle robot

Kludge

2010-09-23T18:27:00.000-04:00

Después de haber traducido un documento de Knuth, muchas palabras interesantes me llamaron la atención, entre otras fue kludge que significa una solución no inteligente a un problema en ingeniería, en este caso particular de computación.

Falsos Amigos Em Português

2010-08-25T11:34:00.001-04:00

Después de estudiar Português por 1 año, pude hacer mi lista de vocabulario y donde me sorprendio varios aspectos de este idioma, entre otros la gran cantidad de amigos falsos que existen entre Castellano y Portugués:

Português	Castellano
acordar	despertar
acorde	despertar
apagar	apagar, borrar
apelido	sobrenombre
asa	ala de avion, pajaro
asas	alas
assim que	apenas (apenas pueda)
assiste	ver, ir
bater	pegar
batir	later
bilhete	billete, boleto, papeleta
biscoito	galleta
bistec	bife
bolo	queque
bolsa	cartera
borracho	goma (caucho)
cabo	cable
cachorro	perro
cafe de manha	desayuno
cafe passado	cafe de maquina
calça	pantalon
cartera	billetera (de hombre)
casaco	chaqueta mujer
cena	escena
costas	espalda
criado-mudo	velador
dados	datos
decorar	aprender de memoria, memorizar
descarga	tirar cadena
deslocada	dislocada, desplazado
despida	desnuda
dirigir	manejar, conducir
distinta	distinguida
encomendar	encargar
engano	equivocado
escritorio	oficina
feira	feria
feria	día de la semana, descanso
fraca	débil
irritada	enojada, molesta
latir	ladrar
mala	maleta
massa	pasta
mesmo	realmente
mesmo que	aunque
monte	montón
moral	moraleja
onda	ola
palavrão	garabato
pasta	paté
pasteis	empanada fritas
pegar	tomar
perdurar	colgar
pimenta	aji
pincel	isopo
presunto	jamón
pronto	listo, acabar
pulso	muñeca
que logo	de pronto
romancista	novelista
ruvia	pelirroja
seca	sequia, secado
segundo	según, segundo
senha	contraseña
serena	sirena
sino	campana
sobre tudo	casaca
sobremesa	postre
sobrenome	apellido
solo	suelo
tela	pantalla, televisor
termo	término
tirar	quitar, sacar
tomara que	ojala
tontura	mareo
traço	guión
traga	traiga
vaso	escusado, macetero
veia	vena

Sun Certified Enterprise Architect (SCEA)

2010-08-06T16:03:00.001-04:00

Varias veces me han pregunto he insistido respecto la certificación Sun Certified Enterprise Architect (SCEA). La mayoria cree que se necesitan todos los certificados especificos de J2EE.

Como se ve en la figura (y pueden rectificar en la página), no tiene ningun requisito para poder tomarlo. Claro esta que no se recomienda ya que abarca todos los temas especializados.

Lo que si es diferente es que la forma de desarrollo del examen es diferente, cual consta de 3 partes: Examen, Proyecto, Ensayo. Mas parecido a una memoria de pre-grado.

Neo-vintage 2: Pagination in Struts... JSTL implementation

2010-08-02T11:58:00.007-04:00

Many times I have needed to use an pagination for many data to be shown in my page, however there is no a good Tag implemented for Struts and not as JSF that has components for it..

There is a good encapsulation with the great library DisplayTag, but this one doesn't give too much freedom to create different things, thus this approach is more flexible.

Finally searching for the web I found a simple JSTL pagination, where you can give a collection of data and at level of presentation parse it and embedded with html and javascript we can get the final pagination that we wish.http://web.archive.org/web/20071213001753/http://www.ekcsoft.com/jstl/content/paginate/ (it is no longer alive).

It has a small bug when the collection is empty therefore the totalCount is zero.

It can be put inside Struts without problems, below can see code of it,:

<c:set var="totalCount" scope="session" value="${queryResults.rowCount}"/>
    <c:set var="perPage" scope="session" value="20"/>
    <c:set var="totalPages" scope="session" value="${totalCount/perPage}"/>
    <c:set var="pageIndex" scope="session" value="${param.start/perPage+1}"/>

   <c:if test="${!empty param.start && param.start >(perPage-1) && param.start !=0 }">
          <a href="?start=<c:out value="${param.start - perPage}"/>">Prev </a>
    </c:if>

   <c:forEach
        var="boundaryStart"
        varStatus="status"
        begin="0"
        end="${totalCount - 1}"
        step="${perPage}">
        <c:choose>
            <c:when test="${status.count>0 && status.count != pageIndex}">
                             <a href="?start=<c:out value='${boundaryStart}'/>">
                                <c:out value="${status.count}"/> |
                            </a>
            </c:when>
        <c:otherwise>
                <c:out value="${status.count}"/> |
        </c:otherwise>
        </c:choose>
    </c:forEach>

    <c:if test="${empty param.start || param.start<(totalCount-perPage)}">
          <a href="?start=<c:out value="${param.start + perPage}"/>">Next </a>
    </c:if>

Oracle JRockit: The Definitive Guide Review

2010-07-02T14:12:00.002-04:00

Oracle JRockit: The Definitive Guide
Copyright © 2010 Packt Publishing

Just like the title establish, this is the definitive guide of JRockit, including the last features of version R28.

It starts with the canonical knowledge to work and understand the JVM, showing details from the most basic until the advanced topics. Describing how and why certain features were made, how it was improved and plus several Best Practices lists to take the best of the suite of tools bundle with JRockit.

The book is wisely divided in two parts, the first is about JVM and the second part is regarding to JRockit Mission Control. Which is a powerful set to dissect JRockit Beauvoir to find out memory leaks, performance, bottlenecks, etc.

It gives an extended explanation of the parameters to take better of this tools suite with a low overhead, many of the areas referred can't be found somewhere else in such deeply detail form.

Everything in only one compendium of information done by the same creators of JRockit.

More information at:

Oracle JRockit: The Definitive Guide

2010-06-10T09:41:00.003-04:00

This new book for JRockit will be release on June. It is written for specialist in the field.
https://www.packtpub.com/oracle-jrockit-the-definitive-guide/book

At first view it shows all the great enhacements has JRockit for tuning, analyzing, trouble-shooting, etc.

Martin Gardner QEPD

2010-05-24T18:24:00.000-04:00

Lamentablemente Martin Gardner ha dejado de vivir, gran difundidor de las matemáticas recreativas.

A pesar de su avanzada edad todos seguiamos su legado que por muchos años nos inspiró en su mundo imaginario.

http://es.wikipedia.org/wiki/Martin_Gardner

WLS ListenAddress

2010-05-20T12:37:00.010-04:00

When the WebLogic Server is set up to listen a specific port then it stops to listen even the loopback address (localhost/127.0.0.1), let's suppose you want to listen each local server where your application has been deployed.

And could appears many Exceptions related to, such as:

Failed to connect to t3://localhost:7003: Destination unreachable; nested exception is:
java.net.ConnectException: Connection refused; No available router to destination
java.net.ConnectException: t3://localhost:7003: Destination unreachable; nested exception is:
java.net.ConnectException: Connection refused; No available router to destination
at weblogic.rjvm.RJVMFinder.findOrCreate(RJVMFinder.java:203)
at weblogic.rjvm.ServerURL.findOrCreateRJVM(ServerURL.java:153)
at weblogic.jndi.WLInitialContextFactoryDelegate$1.run(WLInitialContextFactoryDelegate.java:344)
at weblogic.security.acl.internal.AuthenticatedSubject.doAs(AuthenticatedSubject.java:363)
at weblogic.security.service.SecurityManager.runAs(Unknown Source)
at weblogic.jndi.WLInitialContextFactoryDelegate.getInitialContext(WLInitialContextFactoryDelegate.java:339)
at weblogic.jndi.Environment.getContext(Environment.java:315)
at weblogic.jndi.Environment.getContext(Environment.java:285)
at weblogic.jndi.Environment.createInitialContext(Environment.java:208)
at weblogic.jndi.Environment.getInitialContext(Environment.java:192)
at weblogic.jndi.Environment.getInitialContext(Environment.java:170)
at weblogic.management.commandline.tools.AdminToolHelper.getMBeanHome(AdminToolHelper.java:590)
at weblogic.management.commandline.tools.ServerInfoCommandLineInvoker.doCommandline(ServerInfoCommandLineInvoker.java:924)
at weblogic.management.commandline.tools.ServerInfoCommandLineInvoker.(ServerInfoCommandLineInvoker.java:117)
at weblogic.management.commandline.AdminMain.main(AdminMain.java:132)
at weblogic.Admin.useAdminMain(Admin.java:43)
at weblogic.Admin.main(Admin.java:22)
Caused by: java.rmi.ConnectException: Destination unreachable; nested exception is:
java.net.ConnectException: Connection refused; No available router to destination
at weblogic.rjvm.ConnectionManager.bootstrap(ConnectionManager.java:464)
at weblogic.rjvm.ConnectionManager.bootstrap(ConnectionManager.java:315)
at weblogic.rjvm.RJVMManager.findOrCreateRemoteInternal(RJVMManager.java:251)
at weblogic.rjvm.RJVMManager.findOrCreate(RJVMManager.java:194)
at weblogic.rjvm.RJVMFinder.findOrCreateRemoteServer(RJVMFinder.java:225)
at weblogic.rjvm.RJVMFinder.findOrCreate(RJVMFinder.java:188)
... 16 more

The solution is to eliminate that configuration:

Through the GUI you can go to DOMAIN_NAME -> Environment -> Servers -> SERVER_NAME There you'll find a ``Listen Address'' input text. Leave it blank so WLS can listen to localhost otherwise only it will listen to the address entered.

In the config.xml you will see:

AdminServer
      7003
      www.devweb.cl

Restart the WLS and try out again, now it should be able to reach to localhost, doing a WLS Ping and deploying your application.

``If a server's listen address is undefined, clients can reach the server through an IP address of the computer that hosts the server, a DNS name that resolves to the host, or the localhost string. The localhost string can be used only for requests from clients that running on the same computer as the server.''

from: http://download.oracle.com/docs/cd/E12840_01/wls/docs103/ConsoleHelp/pagehelp/Corecoredomaindomainmonitorserverstitle.html#core.domain.domainmonitorservers.table.label.listenaddress

Simple WebLogic Ping

2010-05-20T12:26:00.007-04:00

Many times someone wants to see if a WebLogic Server is up and running. This can be checked thru (even it has been deprecated still comes bundled in the last WLS 10.3.x ):

If you wish to use a more modern tool then use WLST, but then you should write more text for the same test.

java weblogic.Admin -url localhost:7001 -username weblogic -password welcome1 -verbose PING 1 1024

Muchas veces se quiere ver si un WebLogic Server esta arriba y funcionando, esto se puede lograr con (a pesar que ha sido descontinuado aun viene dentro del WLS 10.3.x) :

java weblogic.Admin -url localhost:7001 -username weblogic -password welcome1 -verbose PING 1 1024

Esta herramienta ya esta deprecada, pero aun sirve y es útil.

Si quieren usar una herramienta actual entonces pueden usar WLST, pero deben poner mas texto para poder hacer la misma prueba.

http://download.oracle.com/docs/cd/E11035_01/wls100/admin_ref/cli.html#wp1196567

Martin Gardner

2010-05-16T10:26:00.001-04:00

After reaching Martin Gardner for a particular riddle, He wrote me telling me that he is not longer doing anything related to the subject and have donated all his library to Stanford University.

He always with a innovated progressive thinking...

J2EE Web Services - Richard Monson-Haefel - Source Code

2010-05-16T10:02:00.005-04:00

Many times has been asked for for the source code of the J2EE Web Services - Richard Monson-Haefel.
In Code Ranch forums he has answered that question:
http://www.coderanch.com/t/147976/Web-Services-Certification-SCDJWS/certification/Download-codes-XML-J-EE

``I lost the code for the book ... Always and I mean ALWAYS back up your hard drive! I had kept the book code on my old PC because my copy of XMLSpy only works on PCs (I use a Mac). I'm still trying to recover after a worm or wear-and-tear or something made the PC stop working. It won't even boot now.

I did test the JAXR code a lot. In fact, I ran the code through the ringer twice so I'm not sure why you are having problems. That said, the UBR registries never did behave exactly as expected so maybe there was a change.

Anyway, I haven't had time to rebuild all the code for the book yet. If anyone gets a start on this I'll be happy to open source it.''

So, if anyone has done something please contact him.

Selected Papers on Design of Algorithms

2010-03-05T12:58:00.004-03:00

``The present volume, the seventh in a series of his collected papers, is devoted to his work on the design of new algorithms. Nearly thirty of Knuth’s classic papers are collected in this book and brought up to date with extensive revisions and notes on subsequent developments. The papers cover numerous discrete problems, such as assorting, searching, data compression, theorem proving, and cryptography, as well as methods for controlling errors in numerical computations.'' [1]

http://www-cs-faculty.stanford.edu/~knuth/da.html
[1] http://www.press.uchicago.edu/presssite/metadata.epl?isbn=9781575865836

Due: April 2010

MikTeX 2.8 updating

2010-02-01T17:21:00.003-03:00

Trying to update MikTeX behind a proxy is a little tricky.

First of all you have to know the URL and Port of your proxy, let's say:

proxy: www.proxyfoo.org
port: 80

Thus you have to set up the environment variable http_proxy (there are more possibilities setting http,ftp,proxy variables):

http_proxy=http://www.proxyfoo.org:80

Also if you are having the error "GUI framework cannot be initialized" in some IDE as WinShell, TeXnicCenter, etc. then the solution is:

Start MiKTeX Options and choose either Yes or No (but not "Ask me first") for the option "Install missing packages on-the-fly".

Polisemia

2009-12-14T12:29:00.001-03:00

Trabajando en estos tiempo globalizados me ha surgido el problema del uso del gentilicio para la gente proveniente de la India, a los cuales coloquialmente se les ha dicho Hindú, pero en muchos lados he visto que Hindú es sólo para los que profesan el Hinduismo. Por lo mismo al buscar en el Diccionario de la Lengua Española aparece claro que es un término polisémico y usar Hindú es igualmente de válido (con la agregación de Wikipedia que ciertas partes de América prefieran el uso de Hinduista a los que profesan tal religión).

De tal manera evito alguna posible confusión que he tenido con terceros al referirme de Indio a los Hindúes, siendo la manera correcta de referirse por temas históricos.

Point Packing

2009-10-10T21:01:00.007-04:00

Point Packing the last contest from Al Zimmermann. At the beginning I started calculating without a computer to see how good I could do it, after I made a program to optimize my score and I began to growth by the ranking at a real good shape since the program uses heuristics to avoid by running for days to find those optimized solutions. The first week I was on the top 25, whereas time pass many other programmers overcomes me and I realized I had to use longer search than I had, however by now it was a good exercise to this kind of contests, who knows if by the honor I compete again.

Point Packing el último concurso de Al Zimmermann. Al principio partí calculando sin computador par ver cuan bien lo hacia, después hice mi programa correspondiente para optimizar mi puntaje y empece a subir en el ranking de bastante buena forma ya que el programa usa heurísticas para no tener que dejar corriendolo por días para encontrar esas soluciones óptimas. La primera semana dure en los top 25, pero a medida que fue pasando el tiempo me fueron superando decenas de otros competidores donde me di cuenta que hay que usar búsquedas de mayor longitud a las que habia usado, pero por ahora fue un buen ejercicio de este tipo de competiciones. Quien sabe si vuelvo a competir por honor nuevamente.

Rank

Score

Contestant

Last Improvement

140

16.10

German Gonzalez-Morris

Santiago, Chile

19 Jul 2009 18:56

An image representing my 26 solution:

Una imagen de lo más cercano a mi solución de 26 puntos es:

Gandhi

2009-10-02T09:00:00.004-04:00

Today is the Gandhi's birthday, great leader and always a source of inspiration. Despite my usual behavior doesn't trend to highlight mistakes I was surprise to see a typo at google.cl

Software Development Life Cycle Cartoon

2009-08-28T16:43:00.002-04:00

A classical cartoon shown in Software Engineering classes, blogs, emails, sites, etc about SDLC

Well, at least the current most-known, but few know that the original comes from Principles Of Software Engineering Management, Tom Gilb , 1988, p.45

And a very similar cartoon from the SMUG book can be found:

Anyway whoever was the original creator (it'd be nice to know) this metaphor makes laugh anyone who has worked in a Software Development Process.

El Rey de raíz cuadrada de 2 (5x5)

2009-08-27T18:02:00.002-04:00

Ahora el último problema con 81 dígitos:

1,41421356237309504880168872420969807856967187537694807317667973799073247846210703

4 1 3 7 8
7 2 0 5 0
8 4 6 9 8
8 6 9 7 1
1 0 7 3 5

Para El Libro de los Récords del Ingenio

El Rey de e (5x5)

2009-08-24T10:40:00.002-04:00

Siendo la solución más larga con 86 dígitos:

2,7182818284590452353602874713526624977572470936999595749669676277240766303535475945713

7 2 0 6 6
8 1 3 2 5
4 7 5 4 7
5 9 0 7 9
9 3 6 6 2

Basado en el problema propuesto de El Libro de los Récords del Ingenio.

El Rey de Oro (5x5)

2009-08-24T10:32:00.005-04:00

Ahora con el número aureo y 63 dígitos:

1,61803398874989484820458683436563811772030917980576286213544862

6 1 8 0 3
2 8 9 3 2
0 4 7 1 7
4 5 1 6 7
6 3 8 2 X

La gracia de esta solución es que no utiliza la celda más de abajo a la derecha (para mi gusto personal) así se convierte en una solución más elegante.

Desde El Libro de los Récords del Ingenio.

El Rey de Pi (5x5)

2009-08-17T16:23:00.006-04:00

Encontré otra cota superior para el cuadrado de 5x5 con 68 dígitos:

3,415926535897932384626433832795028841971693993751058209749445923078

1 3 4 9 5
1 4 8 7 0
0 5 9 2 3
3 7 6 3 8
9 9 1 4 8

Para El Libro de los Récords del Ingenio.

El Rey de Oro

2009-08-04T15:18:00.012-04:00

En el blog El Libro de los Récords del Ingenio hay varios acertijos donde intentan optimizar las soluciones, la cual me pareció una muy buena idea, así que estuve trabajando en un par de problemas.

Uno es el El rey de oro donde la solución dada está errónea por la regla explicada en el Rey de Pi:

Para "escribir" dos cifras iguales consecutivas (por ejemplo, cuando se deba pasar por ...4338...) se deben visitar dos casillas diferentes que sean vecinas y tengan el mismo número (el número 3 en el caso del ejemplo).

Ya que el número áureo tiene dos 3 y dos 8 al principio por lo tanto nuestra cuadrado también los debe tener, pero con esto se hace mas pequeña la solución máxima que es de sólo 11 números. Para tal caso existen varias soluciones y una es: 1,6180339887

3 3 9
0 6 8
7 8 1

UPDATE: Ya fue publicado la nueva solución y el fe de errata de la versión anterior http://librorecords.blogspot.com/2009/08/el-rey-de-oro-3x3-mejorado.html

Programming Contests

2009-07-23T16:42:00.005-04:00

There are several interesting contests sites to test your level to solve problems and programming. Many of these have a high Algorithm level another are much simpler. You can try and perhaps win some prize :)

Also Algorithmist shows a calendar of different contests at short/long-term.

Hay varios sitios interesantes de competencias para que puedas probar tu nivel de resolución de problemas y programación. Mucho de estos tienen un alto nivel de algoritmos y otros son más bien simple. Puedes probar y quizás ganarte algún premio :)

También Algorithmist muestra un calendario de diferentes competencias a largo y corto plazo.

Arcaísmos

2009-07-16T12:34:00.004-04:00

Siempre me es sorprendente ver arcaísmos de la lengua española que uno asume que son de otro idioma o simplemente incorrectos, varias de estas palabras se han mantenido en la lengua portuguesa desde su origen del latín. Algunas son:

bonísimo, buenísimo
voacé, usted
grávida, embarazada
manutención, mantención.

Traduciendo en las Ciencias

2009-06-17T11:40:00.006-04:00

Traducir (en este caso desde el inglés) un documento siempre ha sido complejo. Por una cantidad de detalles que hay que tener en cuenta.

Uno es la cantidad de falsos amigos que existen, otro son los extranjerismos que claramente se encuentran en el documento, además ciertas palabras técnicas en inglés significan frases completas en castellano.

Obviamente el uso de diferentes diccionarios inglés/español, de definiciones de inglés y otros siempre serán de ayuda y necesarios, pero acá hay una publicación que hace un muy buen resumen de los detalles que hay que tener al escribir y sobre todo traducir un documento (sobre todo del inglés), su nombre lo dice todo: "Diccionario urgente de estilo científico del español" de Juan Antonio Pérez Ortiz.

Pocket Loops

2009-06-09T12:12:00.003-04:00

I just received a prize from Kadon Enterprises: gamepuzzles.com for helping them finding bloopers in their web site. Ive been browsing the site and it has a lot of interesting information, different types of puzzles, good pricing. A recommendable site and products. Always they have some kind of puzzle with prizes.

Bad Design

2009-04-24T11:42:00.001-04:00

Design problems can be seen even in seats that try out to make a small square near to Pablo Neruda's Isla Negra House. Looking at this 8x8 matrix with so different colors I can imagine a chessboard or English draughts board; the problem is the orientation is wrong!

Then we can deduce several points: the artist made a matrix as a chessboard just because he liked it, but why didn't he change the orientation? besides with the space left players can seat there, thus to use that small square' space in a better way and to expand the use of people diversity (and not only to seat). Also we may think it was a tribute, but with a big design error.

Thus we can assimilate to design and use of patterns (or anti-patterns) in software design where it's not enough with good intentions, but a correct analysis for the problem before to start programming (which I see more often I'd like between co-workers and friends).

Finally to visit the Pablo's House was a great experience, with the stories told inside it helps to the soul.

Problemas de diseño los podemos ver incluso en asientos que intentan hacer una pequeña plaza antes de la Casa de Isla Negra de Pablo Neruda. Al ver esta matriz de 8x8 con colores tan diferentes uno se imagina un tablero de ajedrez o de damas (versión inglesa); el problema es que la orientación esta incorrecta!

Entonces podemos deducir varias cosas: el artista uso una matriz tipo tablero de ajedrez sólo porque le gustaba, pero ¿por qué no cambio la orientación? si además con el espacio dejado podría sentarse jugadores y así aprovechar mejor el espacio de esa plazoleta, y la diversidad de las personas (y no sólo sentarse). También podríamos pensar que fue un tributo, pero con un grave error de diseño.

Así podemos asimilarlo al diseño y uso de patrones (o anti-patrones) en diseño de software donde no basta con la buena intención sino un análisis correcto del problema antes de empezar a programar (cosa que lo veo bastante seguido en colegas y amigos).

Finalmente visitar la Casa de Pablo fue una gran experiencia, con las historias contadas adentro ayudan a tu alma.

25 Years Puzzle: The Spy Strikes Back

2009-02-09T11:48:00.004-03:00

In the 80s I played a game for the atari 8bit called The Spy Strikes Back, It had a hidden message, but I wasn't able to solve by that time (The game is really hard). Today with emulator is much easier to reach the final game (saving states).

Therefore I start to work on it, first of all to find every clue because I knew there was a hidden message probably a cryptogram. I was encoded in a nice color/sound way, which only can be seen in a video.

The cryptogram can be seen more easy with the following picture:

The hidden message (cryptogram) is:

not a capitol but has only one salt can be found on its east its constitution is wooden and it lies in the land of the free send answer to preston.

Which is a riddle, after a small brainstorming with ibaeza I was able to solve and the solution is Boston.

Afterward I contacted the original author and he responded me:

> 2009/2/20 Mark Pelczarski wrote:
> And many people in the U.S. think that Boston is the capital of
> Massachusetts, because it is the largest city in the state.
>
> It is not.
>
> But it has "one capital"..... "B".
> Mark
>
>2009/2/20 Mark Pelczarski wrote:
> The USS Constitution is wooden.
>
> The salt is in the saltwater of the Atlantic Ocean, which lies to the east
> of the city.
>
> Congratulations!!
>
> - Mark
>
>

>> German Gonzalez wrote:
>> By the way the answer is Boston?
>>
>> because I think the Salt is the USS Constitution that was in the
>> Boston Harbor that is in the east of that city.
>>

Thus everything looks fine and problem solved :P

More information in Spanish can be found at:

http://manillismo.blogspot.com/2009/02/spy-strikes-back-solved.html
http://manillismo.blogspot.com/2009/02/spy-strikes-back-riddle.html
http://manillismo.blogspot.com/2009/02/spy-strikes-back-acertijo-resuelto.html

Mex al Rescate @ SF.net

2009-01-02T17:27:00.003-03:00

Mex al Rescate is now hosted at Sourceforge.net

You can download it and contribute it at http://sourceforge.net/projects/mexrescate

Pandigital Squares & References

2008-12-02T12:13:00.001-03:00

It was released the book called A Lifetime of Puzzles, which it's a tribute to the famous Martin Gardner, where several authors write an article even Martin Gardner himself.

By the same reason I read the digital version, which can be seen through amazon.com, but when I read the R. Kurchan's article makes mention about pandigital squares where I help to minimize its solution after 12 years that was published and nobody else has achieved any new result at all, finally we both got the same final minimal solution, which appears in the book. What is sad for me is that Kurchan doesn't mention any reference of my work at all and only mention that he found a solution on 2003. Things like these are what bother me a lot of my region (Latin America), nobody respect your work. If we were more serious (beginning at least with right acknowledge to authors) writing papers and giving the correct reference, we could advance a little more.

Apareció el Libro A Lifetime of Puzzles que es un tributo al famoso Martin Gardner, en el cual varios autores escriben un artículo incluyendo al mismo Martin Gardner.

Por lo mismo miré la version digital que se puede ver a través de amazon.com, pero al ver el artículo de R. Kurchan habla sobre los cuadrados pandigitales que yo ayude a minimizar su solución 12 años después que había sido publicada y que nadie había logrado algún avance, finalmente ambos llegamos a la solución mínima que aparece en el libro. Lo triste es que él no hace referencia de mi trabajo y sólo pone como hito que logró otra solución. Cosas como estas son las que me molestan de nuestra región (latinoamérica) que nadie respeta el trabajo de otros. Si fuésemos más serio en esto podriamos ir avanzando de a poco.

Se supone que hay un espíritu de trabajo colaborativo, sobre todo en pasatiempos de este tipo.

Eclipse Plug-in

2008-11-27T12:11:00.009-03:00

Eclipse Ganymede SR1 is a more stable and helps more to the developer than earlier version, however it needs some legacy plug-in yet to be a better tool.

Besides the subclipse (right now has a new version complaint with eclipse ganymede -3.4-) and Maven2, I use JAR Class Finder (very good to find classes with a good advanced search interface).

Antoher is Caps Toggle to change words without need to rewriting as most modern editors has as feature.

Here you can see even more plug-ins for Ganymede.

No More Checks

2008-10-30T17:04:00.008-03:00

Apparently Knuth suffered of a financial fiasco, therefore he decide not give away more checks for awards of finding bugs in his books. For sure these checks are going to get a more romantic value in the years.

Now he made a fictional bank (called The Bank of San Serriffe) with accounts of people who have found some bugs, I can see my account with 0x$1.20 :)

It's sad to see how criminals uses anything to get profit, even destroy a nice ludic way to support Science.

Al parecer Knuth sufrió de una estafa, por lo cual ha decidido no dar más cheques de recompensa a las personas que encuentren bugs en sus libros. Seguramente estos cheques van a tener un valor más romántico a través de los años.

Ahora hizo un banco ficticio (llamado The Bank of San Serriffe) con cuentas de personas que hayan encontrado bugs, puedo ver mi cuenta que tiene 0x$1.20 :)

Es triste ver como los delicuentes usan lo que sea para obtener ganancias, incluso destruyen una manera lúdica para apoyar las Ciencias.

El Arte del Diseño de Juegos con Microcomputadora

2008-09-29T15:06:00.006-04:00

El famoso libro de Chris Crawford es de 1981 y habla de la creación de video juegos analizando juegos de la época, hechos por él y los blockbusters del mercado de terceros, a pesar, de la antigüedad aun se mantienen muy frescas las ideas planteadas.

El libro original The Art of Computer Game Design en inglés y existe de forma libre desde el sitio de la Washington State University.

Con el permiso de Chris Crawford ahora estoy publicando la versión en español de su libro llamado: El Arte del Diseño de Juegos con Microcomputadora. (27MB)

Esta versión esta en formato PDF de escaneos directos del libro original, de igual forma que el proyecto en inglés es para la disponibilidad de estudiantes y quienes estén interesados en diseño de video juegos.

Si alguien se entusiasma en traspasar a texto este libro (OCR, Manualmente), que sea bienvenido, por favor no dude en hacerlo y me puede avisar para también subirlo a mi sitio web.

Binary Decision Diagrams

2008-09-26T10:50:00.006-04:00

Good news, once again Dr. Knuth has published a new draft from his classical The Art of Computer Programming (every time closer to finish Volume 4). It can be found in his site.

This draft is about Binary Decision Diagrams, which is a data structure to represent and manipulate Boolean functions.

Martin Gardner’s New Mathematical Library

2008-09-09T10:38:00.005-04:00

Martin Gardner esta sacando versiones actualizadas de sus clásicas columnas de Juegos Recreativos de la Revista Scientific American llamada The New Martin Gardner Mathematical Library. Los editores son de nivel mundial: Donald J. Albers, Gerald L. Alexanderson, John H. Conway, Richard K. Guy, Donald E. Knuth, Peter L. Renz.

Además en el blog de Cambridge se esta regalando/sorteando copias gratis al resolver un puzzle clásico de Gardner, cada semana. Van a ser 6 libros, asi que todos pueden concursar. Lo interesante es que si uno responde mejorando la respuesta ya conocida se supera el filtro del sorteo y tendrá la chance de ganar el libro directamente, pero lejos es mejor la satisfacción lograda al dar una respuesta mejor a algún problema del mítico Gardner.

J2ME Game Development - Mex al Rescate

2008-06-10T11:57:00.024-04:00

This game (not finished) was based on fiction characters to create a mixture between maze/puzzle and action to play in mobile phones.

The big achievement of this project was to design a complete game with characters, levels, bosses, etc. being this one of the hardest process as Chris Crawford mentions in his classic book The Art of Game Design.

The principal J2ME literature and game framework was based on the famous book:
J2ME Game Programming, Martin Wells, Premier Press 2004, ISBN : 1-59200-118-1 , this has a funny rhetoric to explain how to obtain the best solutions to typical problems developing for MIDP-1, by limitations of this architecture. Its source code is freeware to be used and learn from it, any doubts please contact the author, who answered me questions about it.

The artwork was made by Guden, which becomes the most professional Project’s part.

The music at the cover page was made by Mex, which is the same principal character of the game :)

All source code, music, graphics are under license GPL v2.0

Binaries: MexRescate-bin.zip
Source Code: MexRescate-src.zip
You can download it and contribute it at http://sourceforge.net/projects/mexrescate

Este juego (no-terminado) fue basado en caracteres ficticios para generar una mezcla entre laberinto/puzzle y acción para jugar en celulares.

El gran mérito de este proyecto fue el poder diseñar un juego completo con caracteres, niveles, jefes, etc. siendo esta parte una de las más complejas tal como Chris Crawford menciona en su clásico libro The Art of Computer Game Design.

La literatura J2ME y marco de trabajo del juego fue basado en el famoso libro:
J2ME Game Programming, Martin Wells, Premier Press 2004, ISBN : 1-59200-118-1 , este posee una entretenida retórica para ir explicando como soluciono de mejor manera típicos problemas para MIDP-1, por su misma arquitectura con límites. Siendo su código freeware para su uso y aprendizaje, cualquier duda por favor contacten al autor que de muy buena disposición me contestó dudas al respecto.

La gráfica fue hecha por Guden, llegando a ser lo mas profesional del proyecto.

La música de introducción fue hecha por Mex, quien es el mismo personaje principal del juego :)

Todo el código fuente, música, gráficos esta bajo licencia GPL v2.0

Binarios: MexRescate-bin.zip
Código FUente: MexRescate-src.zip
Puedes bajarlo y contribuir en: http://sourceforge.net/projects/mexrescate

Falsos Amigos

2008-01-24T12:25:00.002-03:00

Hace tiempo que he tenido la inquietud del mal uso de traducciones de palabras de Inglés a Castellano. Es muy común sobre todo en mi area (programación) que se diga libreria a una biblioteca por el simple hecho que en Inglés es library. La primera página web que recuerdo haber leido que hace referencia a este fenómeno es del Profesor Ricardo Baeza.

Después empecé a encontrar diferentes palabras que ocurria lo mismo como interface, deprecate, actually, etc.

Por último navegando en la web me doy cuenta que este tipo de palabras están identificados por los linguistas/traductores como Falsos Amigos (simpático nombre), inclusive existen diccionarios al respecto. Además existen varias páginas web de listas de falsos amigos dentro de las cuales destacan cuales tienen una lista bastante grande y con explicación del falso amigo: Saber Inglés y la siempre útil Wikipedia.

Precedence Operator

2007-09-26T14:54:00.002-04:00

Kernighan & Pike in The Practice of Programming says ``Parenthesize to resolve ambiguity. Parentheses specify grouping and can be used to make the intent clear even when they are not required.'' p.6-7.

Many times the programmers use a few parenthesis to save code, however this is error-prone at operator precedence, a good concrete example I found was for Unpaws project made in Pascal, where the unary logic "not" operator has more precedence over the Set than the enumeration.

Fix diff patch:

530c530
< else if not (c in[6,13,16,17,18,19,20,21,22,23]) then inc(XPos);
---
> else if not c in[6,13,16,17,18,19,20,21,22,23] then inc(XPos);

Also from A Programmer's Guide to Java Certification, Second Edition says respect to unary operators: ``Expressions where variables are modified multiple times during the evaluation should be avoided, because the order of evaluation is not always immediately apparent.'' p.64

Neo-vintage: Checkboxes in Struts

2007-07-31T12:41:00.008-04:00

This is a small tip, but for its awkwardness, I'm publishing here because there is no much information about it (although it's quite old).

Just it says in the Struts' API, we have to leave in false every checkbox in the form, if that Action has Session scope otherwise the checkboxes keep those values. The reset() method doesn't work for it (Listing 1).

The other trick is to use a dummy variable to keep the values from the form modified by the user, because when we are in the Action the values is lost in the checkbox and it can be changed based on this dummy variable updating on JSP by Javascript then in the Java code (Listing 2 & 3).

Este es un pequeño consejo, pero por su extrañeza, lo estoy publicando aca porque no hay mucha información al respecto (aunque es bastante viejo).

Como dice en el api de Struts hay que dejar en falso todos los checkboxes si ese Action es de scope de Session o si no se queda estaticos esos valores. El metodo reset() no funciona para tal caso.(Listing 1)

El otro truco es usar una variable auxiliar para mantener los valores desde el formulario modificado por el usuario, porque cuando estamos en el Action los valores se pierden en el checkbox y puede ser cambiado basandose en esta variable auxiliar actualizandola en el jsp a traves de javascript y despues en el codigo Java (Listing 2 & 3).

http://struts.apache.org/1.x/apidocs/org/apache/struts/action/ActionForm.html
http://husted.com/struts/tips/007.html

Listing 1

//let's assume we run through a collection of checkboxes, we have to assign to false
Collection contracts = (Vector)form.get("contracts");
Iterator it = contracts.iterator();
while (it.hasNext()) {
   Contract contract = (Contract)it.next();

   if(contract.isSelected()){
   //here we do our business, if the checkbox is selected

   ContractPdf cpdf = new ContractPdf();
   cpdf.setP_id_contract( (int)contract.getNum_contract() );
   //.... more code
}

//because it's a checkbox and has session scope we assign to false.
contract.setSelected(false);
}

Listing 2

//asign dummy values depending of checkbox
f = document.forms[0];

if (f.p_all.checked) {
   f.p_all.value = "ALL";
   f.p_all_dum.value = "on";
} else {
   f.p_all.value = "NONE";
   f.p_all_dum.value = "off";
}

Listing 3

//update the checkbox parameter based on the dummy variable on Java tier.
if("on".equals((String)formulario.get("p_all_dum"))){
   formulario.set("p_all", "ALL");
}else{
   formulario.set("p_all", "ALL");
}

Ninety Ninety Rule

2007-07-30T15:55:00.002-04:00

http://en.wikipedia.org/wiki/Ninety-ninety_rule

``The first 90% of the code accounts for the first 90% of the development time. The remaining 10% of the code accounts for the other 90% of the development time.''

Good criteria, It happens lately with projects at my job. Even better is what says at the end of the article, where the number you have calculated has to be multiply by 2 or even better by Pi (.31415 :P).

"El primer 90% del código toma el primer 90% del tiempo de desarrollo. El 10% restante del código toma el otro 90% del tiempo de desarrollo."

Buen criterio, me ha pasado últimamente con proyectos del trabajo. Mejor aun es lo que dice al final es interesante donde dice que el tiempo mejor calculado por uno hay que multiplicarlo por la constante 2 (Aranda2003) y mejor aun por Pi. ( 3.1415 :P ).

The Stanford GraphBase: 1990 Football Season

2007-04-11T12:15:00.007-04:00

This book is -as the title says- a platform for combinatorial computing, based on literate programming also developed by Knuth. It has good sets of data, samples and good and speak at length on of them.

There are several challenge problems and one on unsolved most popular is the 1990 season football: Stanford against Harvard. In the book appears Knuth's best solution, however later appears a research made by Buel Chandler with genetic algorithm obtaining a better result and lately in 2002 Mark Cooke found an even better (the best until now).

Despite to these solution this is a similar to TSP, where still is unknown the best solution, then you can give time to research on this problem.

A nice problem was to do a Regular Expression to parse from the file of games the teams, score and stats from reporters. My best solution is this huge RegExp: (which is accurate enough and to be used with java.util.regexp).

([A-Z]\\&?\\-?)+\\ (([A-Z][a-z]*\\\\?\\&?\\,?\\-?\\ ?)+\$([A-Z][a-z]+\\-?\\'?\\ ?(\\\\\\&)?\\ ?)+\$([A-Z][a-z]+\\ ?\\-?)+)\\;[0-9]*\\,[0-9]*\\;[0-9]*\\,[0-9]*

There are 120 teams (nodes) with 638 games (edges). The following graph shows the season:

Knuth has provided all the files for the Stanford Combinatorial platform, where you can find the football.dat file with all the teams and games between them. Above is the graph representing the whole season and following is the data in a more graph viewing of the games (different from the original file that is a single row result of a game pattern).

1. KS-ST: 1. (OK): KS-ST 7 OK 34 2. (OK-ST): OK-ST 17 KS-ST 23 3. (NM-ST): NM-ST 7 KS-ST 52 4. (COLO): KS-ST 3 COLO 64 5. (IA-ST): IA-ST 14 KS-ST 28 6. (MO): KS-ST 10 MO 31 7. (KAS): KS-ST 24 KAS 27 8. (NEB): NEB 45 KS-ST 8 9. (NMEX): NMEX 6 KS-ST 38 10. (NIL): KS-ST 35 NIL 42	2. LBSU: 1. (FULL): FULL 35 LBSU 37 2. (NM-ST): NM-ST 27 LBSU 31 3. (FRES): LBSU 16 FRES 28 4. (CLEM): LBSU 0 CLEM 59 5. (UNLV): UNLV 20 LBSU 29 6. (SJSU): LBSU 29 SJSU 46 7. (PAC): PAC 7 LBSU 28 8. (SDSU): LBSU 20 SDSU 38 9. (UT-ST): LBSU 13 UT-ST 27	3. TENN: 1. (BAMA): BAMA 9 TENN 6 2. (VA): TENN 23 VA 22 3. (UTEP): UTEP 0 TENN 56 4. (MS-ST): TENN 40 MS-ST 7 5. (COLO): COLO 31 TENN 31 6. (TEMP): TEMP 20 TENN 41 7. (PAC): PAC 7 TENN 55 8. (NDAME): NDAME 34 TENN 29 9. (MISS): MISS 13 TENN 22 10. (VAND): TENN 49 VAND 20 11. (FLA): FLA 3 TENN 45 12. (KY): KY 28 TENN 42 13. (AUBN): TENN 26 AUBN 26	4. DUKE: 1. (VA): VA 59 DUKE 0 2. (NW): DUKE 27 NW 24 3. (NC-ST): DUKE 0 NC-ST 16 4. (MD): MD 23 DUKE 20 5. (CLEM): DUKE 7 CLEM 26 6. (GTECH): DUKE 31 GTECH 48 7. (ARMY): DUKE 17 ARMY 16 8. (WAKEF): WAKEF 20 DUKE 57 9. (NCAR): NCAR 24 DUKE 22 10. (SCAR): DUKE 10 SCAR 21	5. WVA: 1. (MD): MD 14 WVA 10 2. (CINCI): CINCI 20 WVA 28 3. (KENTS): KENTS 24 WVA 35 4. (PITT): WVA 38 PITT 24 5. (BOST): BOST 27 WVA 14 6. (PA-ST): PA-ST 31 WVA 19 7. (RUTG): WVA 28 RUTG 3 8. (LOUVL): LOUVL 9 WVA 7 9. (VTECH): WVA 21 VTECH 26 10. (SCAR): WVA 10 SCAR 29 11. (SYR): SYR 31 WVA 7
6. PRIN: 1. (CORN): PRIN 14 CORN 17 2. (FORD): FORD 14 PRIN 23 3. (PENN): PENN 20 PRIN 34 4. (BROWN): BROWN 23 PRIN 27 5. (DART): DART 23 PRIN 6 6. (YALE): PRIN 7 YALE 34 7. (HARV): HARV 23 PRIN 20 8. (COLG): PRIN 13 COLG 39 9. (BUCK): PRIN 9 BUCK 14 10. (COLUM): PRIN 15 COLUM 17	7. STAN: 1. (CAL): STAN 27 CAL 25 2. (WA-ST): WA-ST 13 STAN 31 3. (WASH): WASH 52 STAN 16 4. (COLO): STAN 17 COLO 21 5. (UCLA): STAN 31 UCLA 32 6. (AZ): STAN 23 AZ 10 7. (SJSU): SJSU 29 STAN 23 8. (OR): STAN 0 OR 31 9. (USC): USC 37 STAN 22 10. (OR-ST): OR-ST 3 STAN 37 11. (NDAME): STAN 36 NDAME 31	8. NDAME: 1. (USAF): USAF 27 NDAME 57 2. (COLO): COLO 10 NDAME 9 3. (TENN): NDAME 34 TENN 29 4. (PITT): NDAME 31 PITT 22 5. (PA-ST): PA-ST 24 NDAME 21 6. (MICH): MICH 24 NDAME 28 7. (USC): NDAME 10 USC 6 8. (NAVY): NDAME 52 NAVY 31 9. (STAN): STAN 36 NDAME 31 10. (MIFL): MIFL 20 NDAME 29 11. (PURD): PURD 11 NDAME 37 12. (MI-ST): NDAME 20 MI-ST 19	9. ARMY: 1. (VAND): ARMY 42 VAND 38 2. (USAF): USAF 15 ARMY 3 3. (LAFAY): LAFAY 0 ARMY 56 4. (DUKE): DUKE 17 ARMY 16 5. (WAKEF): ARMY 14 WAKEF 52 6. (HOLY): HOLY 7 ARMY 24 7. (BOST): ARMY 20 BOST 41 8. (RUTG): RUTG 31 ARMY 35 9. (NAVY): NAVY 20 ARMY 30 10. (SYR): SYR 26 ARMY 14	10. KENTS: 1. (BALL): KENTS 0 BALL 31 2. (OU): OU 15 KENTS 44 3. (CINCI): CINCI 27 KENTS 24 4. (MIOH): KENTS 10 MIOH 31 5. (TOL): KENTS 14 TOL 28 6. (WMICH): KENTS 10 WMICH 37 7. (BOWLG): BOWLG 20 KENTS 16 8. (CMICH): CMICH 42 KENTS 0 9. (WVA): KENTS 24 WVA 35 10. (AKRON): AKRON 10 KENTS 38 11. (EMICH): EMICH 24 KENTS 25
11. HARV: 1. (CORN): CORN 20 HARV 17 2. (FORD): FORD 13 HARV 19 3. (PENN): HARV 20 PENN 24 4. (BROWN): BROWN 37 HARV 52 5. (HOLY): HARV 14 HOLY 35 6. (YALE): YALE 34 HARV 19 7. (DART): HARV 0 DART 17 8. (PRIN): HARV 23 PRIN 20 9. (COLUM): HARV 9 COLUM 6	12. SJSU: 1. (NM-ST): SJSU 56 NM-ST 20 2. (FULL): FULL 6 SJSU 44 3. (CAL): SJSU 34 CAL 35 4. (WASH): SJSU 17 WASH 17 5. (FRES): FRES 7 SJSU 42 6. (LBSU): LBSU 29 SJSU 46 7. (UNLV): SJSU 47 UNLV 13 8. (CMICH): SJSU 48 CMICH 24 9. (LOUVL): LOUVL 10 SJSU 10 10. (STAN): SJSU 29 STAN 23 11. (PAC): SJSU 28 PAC 14 12. (UT-ST): UT-ST 27 SJSU 34	13. EMICH: 1. (BALL): BALL 20 EMICH 13 2. (IND): EMICH 6 IND 37 3. (OU): OU 18 EMICH 45 4. (FRES): EMICH 10 FRES 41 5. (MIOH): EMICH 14 MIOH 34 6. (TOL): EMICH 23 TOL 37 7. (KENTS): EMICH 24 KENTS 25 8. (WMICH): WMICH 27 EMICH 24 9. (BOWLG): EMICH 15 BOWLG 25 10. (CMICH): CMICH 16 EMICH 12	14. HOUST: 1. (RICE): RICE 22 HOUST 24 2. (ARK): ARK 28 HOUST 62 3. (SMU): HOUST 44 SMU 17 4. (TCU): TCU 35 HOUST 56 5. (BAYL): HOUST 31 BAYL 15 6. (UNLV): UNLV 9 HOUST 37 7. (AZ-ST): HOUST 62 AZ-ST 45 8. (TEX): HOUST 24 TEX 45 9. (TTECH): HOUST 51 TTECH 35 10. (TA&M): TA&M 31 HOUST 36	15. ILL: 1. (NW): NW 23 ILL 28 2. (IND): ILL 24 IND 10 3. (CLEM): CLEM 30 ILL 0 4. (OSU): ILL 31 OSU 20 5. (WIS): ILL 21 WIS 3 6. (COLO): COLO 22 ILL 23 7. (AZ): ILL 16 AZ 28 8. (MICH): ILL 17 MICH 22 9. (IOWA): IOWA 54 ILL 28 10. (MI-ST): MI-ST 13 ILL 15 11. (PURD): PURD 0 ILL 34
16. WIS: 1. (BALL): BALL 7 WIS 24 2. (CAL): CAL 28 WIS 12 3. (IND): WIS 7 IND 20 4. (NW): WIS 34 NW 44 5. (ILL): ILL 21 WIS 3 6. (OSU): OSU 35 WIS 10 7. (MINN): MINN 21 WIS 3 8. (TEMP): TEMP 24 WIS 18 9. (MICH): MICH 41 WIS 3 10. (MI-ST): WIS 9 MI-ST 14 11. (IOWA): WIS 10 IOWA 30	17. COLO: 1. (KS-ST): KS-ST 3 COLO 64 2. (WASH): WASH 14 COLO 20 3. (ILL): COLO 22 ILL 23 4. (TENN): COLO 31 TENN 31 5. (KAS): COLO 41 KAS 10 6. (NEB): COLO 27 NEB 12 7. (STAN): STAN 17 COLO 21 8. (NDAME): COLO 10 NDAME 9 9. (OK): OK 23 COLO 32 10. (OK-ST): OK-ST 22 COLO 41 11. (IA-ST): IA-ST 12 COLO 28 12. (MO): COLO 33 MO 31 13. (TEX): COLO 29 TEX 22	18. PITT: 1. (OK): PITT 28 OK 52 2. (OU): OU 3 PITT 35 3. (TEMP): TEMP 28 PITT 18 4. (BOST): BOST 6 PITT 29 5. (PA-ST): PITT 17 PA-ST 22 6. (LOUVL): LOUVL 27 PITT 20 7. (RUTG): RUTG 21 PITT 45 8. (WVA): WVA 38 PITT 24 9. (MIFL): PITT 0 MIFL 45 10. (NDAME): NDAME 31 PITT 22 11. (SYR): PITT 20 SYR 20	19. NEB: 1. (OK): NEB 10 OK 45 2. (OK-ST): OK-ST 3 NEB 31 3. (KS-ST): NEB 45 KS-ST 8 4. (GTECH): GTECH 45 NEB 21 5. (BAYL): BAYL 0 NEB 13 6. (COLO): COLO 27 NEB 12 7. (IA-ST): NEB 45 IA-ST 13 8. (MINN): MINN 0 NEB 56 9. (MO): MO 21 NEB 69 10. (KAS): NEB 41 KAS 9 11. (OR-ST): OR-ST 7 NEB 31 12. (NIL): NIL 14 NEB 60	20. VAND: 1. (MISS): MISS 14 VAND 13 2. (BAMA): VAND 28 BAMA 59 3. (LSU): LSU 21 VAND 24 4. (SMU): VAND 7 SMU 44 5. (ARMY): ARMY 42 VAND 38 6. (KY): VAND 21 KY 28 7. (TENN): TENN 49 VAND 20 8. (GA): VAND 28 GA 39 9. (WAKEF): WAKEF 56 VAND 28 10. (AUBN): VAND 6 AUBN 56 11. (SYR): SYR 49 VAND 14
21. FL-ST: 1. (LSU): LSU 3 FL-ST 42 2. (CINCI): CINCI 21 FL-ST 70 3. (FLA): FLA 30 FL-ST 45 4. (PA-ST): FL-ST 24 PA-ST 17 5. (MEMPH): FL-ST 35 MEMPH 3 6. (VTECH): VTECH 28 FL-ST 39 7. (AUBN): FL-ST 17 AUBN 20 8. (MIFL): FL-ST 22 MIFL 31 9. (ECAR): ECAR 24 FL-ST 45 10. (SCAR): FL-ST 41 SCAR 10 11. (TUL): FL-ST 31 TUL 13	22. RICE: 1. (ARK): RICE 19 ARK 11 2. (NW): NW 14 RICE 31 3. (HOUST): RICE 22 HOUST 24 4. (SMU): SMU 28 RICE 30 5. (BAYL): BAYL 17 RICE 16 6. (TCU): RICE 28 TCU 38 7. (WAKEF): WAKEF 17 RICE 33 8. (TTECH): TTECH 21 RICE 42 9. (TEX): TEX 26 RICE 10 10. (TA&M): RICE 15 TA&M 41 11. (TUL): TUL 21 RICE 10	23. NC-ST: 1. (VA): NC-ST 0 VA 31 2. (MD): NC-ST 12 MD 13 3. (CLEM): CLEM 24 NC-ST 17 4. (GTECH): NC-ST 13 GTECH 21 5. (DUKE): DUKE 0 NC-ST 16 6. (WAKEF): WAKEF 15 NC-ST 20 7. (SMISS): NC-ST 31 SMISS 27 8. (NCAR): NC-ST 12 NCAR 9 9. (VTECH): NC-ST 16 VTECH 20 10. (SCAR): SCAR 29 NC-ST 38	24. TCU: 1. (RICE): RICE 28 TCU 38 2. (ARK): TCU 54 ARK 26 3. (OK-ST): OK-ST 21 TCU 31 4. (HOUST): TCU 35 HOUST 56 5. (WA-ST): WA-ST 21 TCU 3 6. (SMU): TCU 42 SMU 21 7. (BAYL): BAYL 27 TCU 21 8. (MO): TCU 20 MO 19 9. (TEX): TEX 38 TCU 10 10. (TTECH): TTECH 40 TCU 28 11. (TA&M): TCU 10 TA&M 56	25. BROWN: 1. (CORN): BROWN 7 CORN 34 2. (FORD): FORD 35 BROWN 28 3. (PENN): PENN 17 BROWN 24 4. (HOLY): HOLY 55 BROWN 0 5. (DART): DART 29 BROWN 0 6. (HARV): BROWN 37 HARV 52 7. (YALE): YALE 27 BROWN 21 8. (PRIN): BROWN 23 PRIN 27 9. (COLUM): BROWN 17 COLUM 0
26. WMICH: 1. (BALL): BALL 13 WMICH 14 2. (OU): WMICH 31 OU 23 3. (MIOH): MIOH 17 WMICH 31 4. (TOL): TOL 37 WMICH 9 5. (KENTS): KENTS 10 WMICH 37 6. (LTECH): LTECH 21 WMICH 27 7. (IA-ST): WMICH 20 IA-ST 34 8. (BOWLG): WMICH 19 BOWLG 13 9. (CMICH): WMICH 13 CMICH 20 10. (AKRON): WMICH 24 AKRON 20 11. (EMICH): WMICH 27 EMICH 24	27. CO-ST: 1. (ARK): CO-ST 52 ARK 31 2. (TULSA): TULSA 13 CO-ST 31 3. (USAF): CO-ST 35 USAF 33 4. (UTEP): UTEP 20 CO-ST 38 5. (HI): CO-ST 30 HI 27 6. (LTECH): CO-ST 30 LTECH 31 7. (WYO): WYO 8 CO-ST 31 8. (AZ-ST): CO-ST 20 AZ-ST 31 9. (OR): CO-ST 32 OR 31 10. (UTAH): UTAH 13 CO-ST 22 11. (NMEX): NMEX 7 CO-ST 47 12. (BYU): CO-ST 9 BYU 52	28. UNLV: 1. (NM-ST): UNLV 24 NM-ST 20 2. (FULL): FULL 10 UNLV 29 3. (HOUST): UNLV 9 HOUST 37 4. (LBSU): UNLV 20 LBSU 29 5. (FRES): FRES 45 UNLV 18 6. (SJSU): SJSU 47 UNLV 13 7. (OR-ST): UNLV 19 OR-ST 20 8. (PAC): UNLV 37 PAC 28 9. (UT-ST): UNLV 6 UT-ST 31	29. UCLA: 1. (OK): OK 34 UCLA 14 2. (CAL): UCLA 31 CAL 38 3. (WASH): UCLA 25 WASH 22 4. (WA-ST): UCLA 30 WA-ST 20 5. (AZ): AZ 28 UCLA 21 6. (MICH): UCLA 15 MICH 38 7. (USC): USC 45 UCLA 42 8. (OR): UCLA 24 OR 28 9. (OR-ST): OR-ST 17 UCLA 26 10. (STAN): STAN 31 UCLA 32 11. (SDSU): SDSU 31 UCLA 45	30. NCAR: 1. (VA): VA 24 NCAR 10 2. (MD): MD 10 NCAR 34 3. (NC-ST): NC-ST 12 NCAR 9 4. (CLEM): NCAR 3 CLEM 20 5. (GTECH): GTECH 13 NCAR 13 6. (MIOH): MIOH 0 NCAR 34 7. (KY): KY 13 NCAR 16 8. (DUKE): NCAR 24 DUKE 22 9. (WAKEF): NCAR 31 WAKEF 24 10. (SCAR): NCAR 5 SCAR 27
31. TEX: 1. (OK): TEX 14 OK 13 2. (RICE): TEX 26 RICE 10 3. (ARK): ARK 17 TEX 49 4. (HOUST): HOUST 24 TEX 45 5. (SMU): SMU 3 TEX 52 6. (BAYL): TEX 23 BAYL 13 7. (TCU): TEX 38 TCU 10 8. (COLO): COLO 29 TEX 22 9. (PA-ST): TEX 17 PA-ST 13 10. (TTECH): TEX 41 TTECH 22 11. (MIFL): MIFL 46 TEX 3 12. (TA&M): TA&M 27 TEX 28	32. BYU: 1. (WA-ST): WA-ST 36 BYU 50 2. (UTEP): BYU 30 UTEP 10 3. (HI): BYU 28 HI 59 4. (UTAH): BYU 42 UTAH 22 5. (MIFL): MIFL 21 BYU 28 6. (TA&M): TA&M 65 BYU 14 7. (USAF): BYU 54 USAF 7 8. (CO-ST): CO-ST 9 BYU 52 9. (WYO): BYU 45 WYO 14 10. (OR): BYU 16 OR 32 11. (NMEX): NMEX 31 BYU 55 12. (SDSU): SDSU 34 BYU 62 13. (UT-ST): UT-ST 10 BYU 45	33. TULSA: 1. (OK): TULSA 10 OK 52 2. (NM-ST): TULSA 35 NM-ST 10 3. (ARK): TULSA 3 ARK 28 4. (OK-ST): TULSA 3 OK-ST 10 5. (SWLA): SWLA 25 TULSA 13 6. (LTECH): LTECH 35 TULSA 21 7. (CO-ST): TULSA 13 CO-ST 31 8. (LOUVL): TULSA 14 LOUVL 38 9. (MEMPH): MEMPH 22 TULSA 10	34. WA-ST: 1. (CAL): CAL 31 WA-ST 41 2. (WASH): WASH 55 WA-ST 10 3. (TCU): WA-ST 21 TCU 3 4. (UCLA): UCLA 30 WA-ST 20 5. (WYO): WYO 34 WA-ST 13 6. (AZ): WA-ST 34 AZ 42 7. (AZ-ST): AZ-ST 51 WA-ST 26 8. (OR-ST): WA-ST 55 OR-ST 24 9. (USC): WA-ST 17 USC 30 10. (STAN): WA-ST 13 STAN 31 11. (BYU): WA-ST 36 BYU 50	35. FRES: 1. (FULL): FULL 3 FRES 38 2. (NM-ST): NM-ST 3 FRES 42 3. (LBSU): LBSU 16 FRES 28 4. (UNLV): FRES 45 UNLV 18 5. (SJSU): FRES 7 SJSU 42 6. (UTAH): FRES 31 UTAH 7 7. (PAC): PAC 17 FRES 48 8. (NIL): FRES 18 NIL 73 9. (NMEX): NMEX 17 FRES 24 10. (UT-ST): UT-ST 24 FRES 24 11. (EMICH): EMICH 10 FRES 41
36. MS-ST: 1. (MISS): MS-ST 9 MISS 21 2. (LSU): LSU 22 MS-ST 34 3. (BAMA): BAMA 22 MS-ST 0 4. (FULL): FULL 13 MS-ST 27 5. (FLA): MS-ST 21 FLA 34 6. (KY): MS-ST 15 KY 17 7. (TENN): TENN 40 MS-ST 7 8. (SMISS): SMISS 10 MS-ST 13 9. (MEMPH): MS-ST 27 MEMPH 23 10. (AUBN): AUBN 17 MS-ST 16 11. (TUL): MS-ST 38 TUL 17	37. MEMPH: 1. (FL-ST): FL-ST 35 MEMPH 3 2. (MISS): MEMPH 21 MISS 23 3. (TULSA): MEMPH 22 TULSA 10 4. (SWLA): SWLA 6 MEMPH 20 5. (MS-ST): MS-ST 27 MEMPH 23 6. (SMISS): MEMPH 7 SMISS 23 7. (LOUVL): MEMPH 17 LOUVL 19 8. (ECAR): ECAR 24 MEMPH 17 9. (TUL): TUL 14 MEMPH 21	38. UTAH: 1. (USAF): UTAH 21 USAF 52 2. (FRES): FRES 31 UTAH 7 3. (UTEP): UTEP 23 UTAH 37 4. (HI): HI 19 UTAH 7 5. (CO-ST): UTAH 13 CO-ST 22 6. (MINN): UTAH 35 MINN 29 7. (WYO): WYO 28 UTAH 10 8. (BYU): BYU 42 UTAH 22 9. (NMEX): UTAH 29 NMEX 27 10. (SDSU): UTAH 14 SDSU 66 11. (UT-ST): UTAH 19 UT-ST 0	39. TA&M: 1. (RICE): RICE 15 TA&M 41 2. (LSU): TA&M 8 LSU 17 3. (ARK): TA&M 20 ARK 16 4. (HOUST): TA&M 31 HOUST 36 5. (SMU): TA&M 38 SMU 17 6. (SWLA): SWLA 14 TA&M 63 7. (TCU): TCU 10 TA&amp;M 56 8. (BAYL): BAYL 20 TA&M 20 9. (HI): TA&M 28 HI 13 10. (TEX): TA&M 27 TEX 28 11. (TTECH): TTECH 24 TA&M 28 12. (BYU): TA&M 65 BYU 14	40. MISS: 1. (LSU): MISS 19 LSU 10 2. (VAND): MISS 14 VAND 13 3. (ARK): MISS 21 ARK 17 4. (MS-ST): MS-ST 9 MISS 21 5. (KY): KY 29 MISS 35 6. (TENN): MISS 13 TENN 22 7. (GA): MISS 28 GA 12 8. (MICH): MICH 35 MISS 3 9. (MEMPH): MEMPH 21 MISS 23 10. (AUBN): AUBN 24 MISS 10 11. (TUL): TUL 21 MISS 31
41. OK: 1. (OK-ST): OK 31 OK-ST 17 2. (KS-ST): KS-ST 7 OK 34 3. (TULSA): TULSA 10 OK 52 4. (COLO): OK 23 COLO 32 5. (IA-ST): IA-ST 33 OK 31 6. (PITT): PITT 28 OK 52 7. (UCLA): OK 34 UCLA 14 8. (MO): OK 55 MO 10 9. (NEB): NEB 10 OK 45 10. (KAS): KAS 17 OK 31 11. (TEX): TEX 14 OK 13	42. FLA: 1. (FL-ST): FLA 30 FL-ST 45 2. (LSU): LSU 8 FLA 34 3. (BAMA): FLA 17 BAMA 13 4. (OK-ST): OK-ST 7 FLA 50 5. (KY): FLA 47 KY 15 6. (MS-ST): MS-ST 21 FLA 34 7. (GA): GA 7 FLA 38 8. (TENN): FLA 3 TENN 45 9. (AKRON): AKRON 0 FLA 59 10. (AUBN): AUBN 7 FLA 48	43. OSU: 1. (USAF): USAF 23 OSU 11 2. (NW): NW 7 OSU 48 3. (IND): OSU 27 IND 27 4. (ILL): ILL 31 OSU 20 5. (WIS): OSU 35 WIS 10 6. (MINN): MINN 23 OSU 52 7. (BOST): OSU 31 BOST 10 8. (MICH): MICH 16 OSU 13 9. (USC): USC 35 OSU 26 10. (TTECH): TTECH 10 OSU 17 11. (IOWA): OSU 27 IOWA 26 12. (PURD): OSU 42 PURD 2	44. IA-ST: 1. (OK): IA-ST 33 OK 31 2. (OK-ST): OK-ST 25 IA-ST 17 3. (KS-ST): IA-ST 14 KS-ST 28 4. (COLO): IA-ST 12 COLO 28 5. (WMICH): WMICH 20 IA-ST 34 6. (MINN): IA-ST 16 MINN 20 7. (MO): MO 25 IA-ST 27 8. (NEB): NEB 45 IA-ST 13 9. (KAS): KAS 34 IA-ST 34 10. (IOWA): IA-ST 35 IOWA 45	45. WAKEF: 1. (VAND): WAKEF 56 VAND 28 2. (RICE): WAKEF 17 RICE 33 3. (VA): VA 49 WAKEF 14 4. (MD): WAKEF 13 MD 41 5. (NC-ST): WAKEF 15 NC-ST 20 6. (CLEM): CLEM 24 WAKEF 6 7. (GTECH): GTECH 42 WAKEF 7 8. (ARMY): ARMY 14 WAKEF 52 9. (DUKE): WAKEF 20 DUKE 57 10. (NCAR): NCAR 31 WAKEF 24
46. BAMA: 1. (LSU): LSU 3 BAMA 24 2. (VAND): VAND 28 BAMA 59 3. (CINCI): CINCI 7 BAMA 45 4. (SWLA): BAMA 25 SWLA 6 5. (FLA): FLA 17 BAMA 13 6. (MS-ST): BAMA 22 MS-ST 0 7. (TENN): BAMA 9 TENN 6 8. (GA): BAMA 16 GA 17 9. (PA-ST): PA-ST 9 BAMA 0 10. (SMISS): SMISS 27 BAMA 24 11. (LOUVL): LOUVL 34 BAMA 7 12. (AUBN): BAMA 16 AUBN 7	47. BALL: 1. (OU): OU 6 BALL 23 2. (MIOH): BALL 10 MIOH 24 3. (TOL): TOL 28 BALL 16 4. (KENTS): KENTS 0 BALL 31 5. (WMICH): BALL 13 WMICH 14 6. (WIS): BALL 7 WIS 24 7. (BOWLG): BOWLG 6 BALL 16 8. (CMICH): BALL 13 CMICH 3 9. (EMICH): BALL 20 EMICH 13	48. SMU: 1. (RICE): SMU 28 RICE 30 2. (VAND): VAND 7 SMU 44 3. (ARK): ARK 42 SMU 29 4. (HOUST): HOUST 44 SMU 17 5. (BAYL): SMU 17 BAYL 52 6. (TCU): TCU 42 SMU 21 7. (TTECH): SMU 7 TTECH 62 8. (TEX): SMU 3 TEX 52 9. (TA&M): TA&M 38 SMU 17 10. (TUL): SMU 7 TUL 43	49. GTECH: 1. (VA): GTECH 41 VA 38 2. (MD): GTECH 31 MD 3 3. (NC-ST): NC-ST 13 GTECH 21 4. (CLEM): CLEM 19 GTECH 21 5. (GA): GTECH 40 GA 23 6. (WAKEF): GTECH 42 WAKEF 7 7. (DUKE): DUKE 31 GTECH 48 8. (NCAR): GTECH 13 NCAR 13 9. (NEB): GTECH 45 NEB 21 10. (VTECH): VTECH 3 GTECH 6 11. (SCAR): SCAR 6 GTECH 27	50. HOLY: 1. (FORD): HOLY 48 FORD 0 2. (LHIGH): LHIGH 22 HOLY 34 3. (PENN): HOLY 17 PENN 3 4. (LAFAY): LAFAY 3 HOLY 34 5. (ARMY): HOLY 7 ARMY 24 6. (BROWN): HOLY 55 BROWN 0 7. (DART): DART 10 HOLY 21 8. (HARV): HARV 14 HOLY 35 9. (COLG): HOLY 35 COLG 6 10. (BUCK): BUCK 14 HOLY 43
51. DART: 1. (CORN): DART 11 CORN 6 2. (LHIGH): LHIGH 14 DART 33 3. (PENN): PENN 16 DART 6 4. (BROWN): DART 29 BROWN 0 5. (HOLY): DART 10 HOLY 21 6. (HARV): HARV 0 DART 17 7. (YALE): YALE 17 DART 27 8. (PRIN): DART 23 PRIN 6 9. (COLUM): COLUM 20 DART 34	52. TEMP: 1. (TENN): TEMP 20 TENN 41 2. (WIS): TEMP 24 WIS 18 3. (PITT): TEMP 28 PITT 18 4. (WYO): TEMP 23 WYO 38 5. (BOST): TEMP 29 BOST 10 6. (PA-ST): TEMP 10 PA-ST 48 7. (RUTG): RUTG 22 TEMP 29 8. (VTECH): VTECH 28 TEMP 31 9. (ECAR): ECAR 27 TEMP 30 10. (SYR): TEMP 9 SYR 19	53. SMISS: 1. (BAMA): SMISS 27 BAMA 24 2. (NC-ST): NC-ST 31 SMISS 27 3. (SWLA): SMISS 14 SWLA 13 4. (MS-ST): SMISS 10 MS-ST 13 5. (GA): SMISS 17 GA 18 6. (LOUVL): LOUVL 13 SMISS 25 7. (MEMPH): MEMPH 7 SMISS 23 8. (VTECH): SMISS 16 VTECH 20 9. (AUBN): SMISS 13 AUBN 12 10. (ECAR): SMISS 16 ECAR 7 11. (TUL): SMISS 14 TUL 14	54. COLG: 1. (CORN): CORN 24 COLG 59 2. (LHIGH): COLG 7 LHIGH 52 3. (FORD): COLG 31 FORD 7 4. (LAFAY): LAFAY 7 COLG 36 5. (HOLY): HOLY 35 COLG 6 6. (YALE): COLG 30 YALE 7 7. (RUTG): COLG 17 RUTG 28 8. (BUCK): COLG 28 BUCK 27 9. (PRIN): PRIN 13 COLG 39	55. MI-ST: 1. (NW): MI-ST 29 NW 22 2. (IND): IND 20 MI-ST 45 3. (ILL): MI-ST 13 ILL 15 4. (WIS): WIS 9 MI-ST 14 5. (MINN): MI-ST 28 MINN 16 6. (MICH): MI-ST 28 MICH 27 7. (RUTG): MI-ST 34 RUTG 10 8. (USC): MI-ST 17 USC 16 9. (PURD): PURD 33 MI-ST 55 10. (IOWA): IOWA 12 MI-ST 7 11. (NDAME): NDAME 20 MI-ST 19 12. (SYR): MI-ST 23 SYR 23
56. PAC: 1. (NM-ST): NM-ST 24 PAC 62 2. (FULL): PAC 67 FULL 37 3. (FRES): PAC 17 FRES 48 4. (LBSU): PAC 7 LBSU 28 5. (HI): PAC 24 HI 35 6. (UNLV): UNLV 37 PAC 28 7. (TENN): PAC 7 TENN 55 8. (SJSU): SJSU 28 PAC 14 9. (UT-ST): PAC 45 UT-ST 51	57. LSU: 1. (BAMA): LSU 3 BAMA 24 2. (MISS): MISS 19 LSU 10 3. (FL-ST): LSU 3 FL-ST 42 4. (VAND): LSU 21 VAND 24 5. (FLA): LSU 8 FLA 34 6. (MIOH): MIOH 7 LSU 35 7. (MS-ST): LSU 22 MS-ST 34 8. (KY): KY 20 LSU 30 9. (GA): GA 13 LSU 18 10. (TUL): TUL 13 LSU 16 11. (TA&M): TA&M 8 LSU 17	58. MO: 1. (OK): OK 55 MO 10 2. (OK-ST): MO 28 OK-ST 48 3. (KS-ST): KS-ST 10 MO 31 4. (IND): MO 7 IND 58 5. (TCU): TCU 20 MO 19 6. (IA-ST): MO 25 IA-ST 27 7. (COLO): COLO 33 MO 31 8. (AZ-ST): AZ-ST 9 MO 30 9. (KAS): MO 31 KAS 21 10. (NEB): MO 21 NEB 69 11. (UT-ST): UT-ST 10 MO 45	59. VA: 1. (MD): MD 35 VA 30 2. (NC-ST): NC-ST 0 VA 31 3. (CLEM): CLEM 7 VA 20 4. (GTECH): GTECH 41 VA 38 5. (TENN): TENN 23 VA 22 6. (WAKEF): VA 49 WAKEF 14 7. (DUKE): VA 59 DUKE 0 8. (NCAR): VA 24 NCAR 10 9. (KAS): VA 59 KAS 10 10. (VTECH): VA 13 VTECH 38 11. (NAVY): NAVY 14 VA 56	60. ARK: 1. (RICE): RICE 19 ARK 11 2. (MISS): MISS 21 ARK 17 3. (TULSA): TULSA 3 ARK 28 4. (HOUST): ARK 28 HOUST 62 5. (SMU): ARK 42 SMU 29 6. (BAYL): ARK 3 BAYL 34 7. (TCU): TCU 54 ARK 26 8. (CO-ST): CO-ST 52 ARK 31 9. (TEX): ARK 17 TEX 49 10. (TTECH): TTECH 49 ARK 44 11. (TA&M): TA&M 20 ARK 16
61. PENN: 1. (CORN): PENN 15 CORN 21 2. (LHIGH): LHIGH 22 PENN 16 3. (LAFAY): PENN 13 LAFAY 20 4. (BROWN): PENN 17 BROWN 24 5. (HOLY): HOLY 17 PENN 3 6. (HARV): HARV 20 PENN 24 7. (YALE): YALE 27 PENN 10 8. (DART): PENN 16 DART 6 9. (PRIN): PENN 20 PRIN 34 10. (COLUM): COLUM 6 PENN 21	62. GA: 1. (VAND): VAND 28 GA 39 2. (MISS): MISS 28 GA 12 3. (BAMA): BAMA 16 GA 17 4. (LSU): GA 13 LSU 18 5. (CLEM): GA 3 CLEM 34 6. (GTECH): GTECH 40 GA 23 7. (FLA): GA 7 FLA 38 8. (KY): GA 24 KY 26 9. (SMISS): SMISS 17 GA 18 10. (AUBN): GA 10 AUBN 33 11. (ECAR): ECAR 15 GA 19	63. LOUVL: 1. (BAMA): LOUVL 34 BAMA 7 2. (TULSA): TULSA 14 LOUVL 38 3. (CINCI): LOUVL 41 CINCI 16 4. (PITT): LOUVL 27 PITT 20 5. (BOST): BOST 10 LOUVL 17 6. (SJSU): LOUVL 10 SJSU 10 7. (SMISS): LOUVL 13 SMISS 25 8. (WVA): LOUVL 9 WVA 7 9. (MEMPH): MEMPH 17 LOUVL 19 10. (KAS): KAS 16 LOUVL 28	64. MICH: 1. (MISS): MICH 35 MISS 3 2. (IND): MICH 45 IND 19 3. (MD): MD 17 MICH 45 4. (ILL): ILL 17 MICH 22 5. (OSU): MICH 16 OSU 13 6. (MINN): MINN 18 MICH 35 7. (WIS): MICH 41 WIS 3 8. (UCLA): UCLA 15 MICH 38 9. (PURD): MICH 38 PURD 13 10. (IOWA): IOWA 24 MICH 23 11. (MI-ST): MI-ST 28 MICH 27 12. (NDAME): MICH 24 NDAME 28	65. CORN: 1. (PENN): PENN 15 CORN 21 2. (LAFAY): CORN 38 LAFAY 16 3. (BROWN): BROWN 7 CORN 34 4. (YALE): CORN 41 YALE 31 5. (DART): DART 11 CORN 6 6. (HARV): CORN 20 HARV 17 7. (COLG): CORN 24 COLG 59 8. (BUCK): BUCK 42 CORN 21 9. (PRIN): PRIN 14 CORN 17 10. (COLUM): CORN 41 COLUM 0
66. USAF: 1. (UTEP): USAF 14 UTEP 13 2. (ARMY): USAF 15 ARMY 3 3. (OSU): USAF 23 OSU 11 4. (HI): HI 3 USAF 27 5. (CO-ST): CO-ST 35 USAF 33 6. (WYO): USAF 12 WYO 24 7. (UTAH): UTAH 21 USAF 52 8. (NAVY): NAVY 7 USAF 24 9. (BYU): BYU 54 USAF 7 10. (NDAME): USAF 27 NDAME 57 11. (SDSU): USAF 18 SDSU 48	67. LAFAY: 1. (CORN): CORN 38 LAFAY 16 2. (LHIGH): LHIGH 35 LAFAY 14 3. (FORD): LAFAY 59 FORD 14 4. (PENN): PENN 13 LAFAY 20 5. (ARMY): LAFAY 0 ARMY 56 6. (HOLY): LAFAY 3 HOLY 34 7. (YALE): LAFAY 17 YALE 18 8. (COLG): LAFAY 7 COLG 36 9. (BUCK): BUCK 24 LAFAY 14 10. (COLUM): LAFAY 41 COLUM 34	68. MIOH: 1. (LSU): MIOH 7 LSU 35 2. (BALL): BALL 10 MIOH 24 3. (OU): MIOH 40 OU 18 4. (CINCI): MIOH 16 CINCI 12 5. (TOL): TOL 14 MIOH 20 6. (KENTS): KENTS 10 MIOH 31 7. (WMICH): MIOH 17 WMICH 31 8. (BOWLG): MIOH 10 BOWLG 10 9. (CMICH): MIOH 7 CMICH 31 10. (NCAR): MIOH 0 NCAR 34 11. (EMICH): EMICH 14 MIOH 34	69. KY: 1. (VAND): VAND 21 KY 28 2. (LSU): KY 20 LSU 30 3. (MISS): KY 29 MISS 35 4. (IND): IND 45 KY 24 5. (FLA): FLA 47 KY 15 6. (MS-ST): MS-ST 15 KY 17 7. (TENN): KY 28 TENN 42 8. (GA): GA 24 KY 26 9. (CMICH): CMICH 17 KY 20 10. (NCAR): KY 13 NCAR 16 11. (RUTG): KY 8 RUTG 24	70. YALE: 1. (CORN): CORN 41 YALE 31 2. (PENN): YALE 27 PENN 10 3. (LAFAY): LAFAY 17 YALE 18 4. (BROWN): YALE 27 BROWN 21 5. (HARV): YALE 34 HARV 19 6. (DART): YALE 17 DART 27 7. (COLG): COLG 30 YALE 7 8. (PRIN): PRIN 7 YALE 34 9. (COLUM): COLUM 7 YALE 31
71. OR: 1. (CAL): OR 3 CAL 28 2. (WASH): OR 17 WASH 38 3. (CO-ST): CO-ST 32 OR 31 4. (UCLA): UCLA 24 OR 28 5. (AZ): OR 17 AZ 22 6. (AZ-ST): AZ-ST 7 OR 27 7. (OR-ST): OR 6 OR-ST 3 8. (STAN): STAN 0 OR 31 9. (BYU): BYU 16 OR 32 10. (UT-ST): UT-ST 7 OR 52 11. (SDSU): SDSU 21 OR 42	72. FULL: 1. (NM-ST): FULL 9 NM-ST 43 2. (LBSU): FULL 35 LBSU 37 3. (FRES): FULL 3 FRES 38 4. (HI): FULL 21 HI 45 5. (MS-ST): FULL 13 MS-ST 27 6. (UNLV): FULL 10 UNLV 29 7. (SJSU): FULL 6 SJSU 44 8. (AKRON): FULL 17 AKRON 48 9. (PAC): PAC 67 FULL 37 10. (AUBN): FULL 17 AUBN 38 11. (UT-ST): UT-ST 45 FULL 17	73. IND: 1. (NW): IND 42 NW 0 2. (ILL): ILL 24 IND 10 3. (OSU): OSU 27 IND 27 4. (KY): IND 45 KY 24 5. (WIS): WIS 7 IND 20 6. (MINN): IND 0 MINN 12 7. (MICH): MICH 45 IND 19 8. (MO): MO 7 IND 58 9. (AUBN): AUBN 27 IND 23 10. (PURD): IND 28 PURD 14 11. (MI-ST): IND 20 MI-ST 45 12. (EMICH): EMICH 6 IND 37	74. OU: 1. (BALL): OU 6 BALL 23 2. (MIOH): MIOH 40 OU 18 3. (TOL): TOL 27 OU 20 4. (KENTS): OU 15 KENTS 44 5. (WMICH): WMICH 31 OU 23 6. (BOWLG): OU 10 BOWLG 10 7. (PITT): OU 3 PITT 35 8. (CMICH): CMICH 52 OU 7 9. (EMICH): OU 18 EMICH 45	75. UTEP: 1. (NM-ST): NM-ST 27 UTEP 24 2. (USAF): USAF 14 UTEP 13 3. (HI): HI 10 UTEP 12 4. (CO-ST): UTEP 20 CO-ST 38 5. (TENN): UTEP 0 TENN 56 6. (WYO): WYO 17 UTEP 10 7. (UTAH): UTEP 23 UTAH 37 8. (NMEX): UTEP 28 NMEX 48 9. (BYU): BYU 30 UTEP 10 10. (SDSU): UTEP 31 SDSU 58
76. HI: 1. (FULL): FULL 21 HI 45 2. (USAF): HI 3 USAF 27 3. (UTEP): HI 10 UTEP 12 4. (CO-ST): CO-ST 30 HI 27 5. (WYO): WYO 17 HI 38 6. (UTAH): HI 19 UTAH 7 7. (BYU): BYU 28 HI 59 8. (NMEX): NMEX 16 HI 43 9. (PAC): PAC 24 HI 35 10. (SDSU): HI 38 SDSU 44 11. (TA&M): TA&M 28 HI 13	77. LTECH: 1. (TULSA): LTECH 35 TULSA 21 2. (MD): LTECH 34 MD 34 3. (SWLA): SWLA 10 LTECH 24 4. (CO-ST): CO-ST 30 LTECH 31 5. (WMICH): LTECH 21 WMICH 27 6. (AKRON): AKRON 15 LTECH 36 7. (AUBN): LTECH 14 AUBN 16 8. (ECAR): LTECH 17 ECAR 27	78. BOST: 1. (ARMY): ARMY 20 BOST 41 2. (OSU): OSU 31 BOST 10 3. (PITT): BOST 6 PITT 29 4. (TEMP): TEMP 29 BOST 10 5. (PA-ST): PA-ST 40 BOST 21 6. (LOUVL): BOST 10 LOUVL 17 7. (WVA): BOST 27 WVA 14 8. (RUTG): RUTG 14 BOST 19 9. (NAVY): BOST 28 NAVY 17 10. (MIFL): BOST 12 MIFL 42 11. (SYR): SYR 35 BOST 6	79. CMICH: 1. (BALL): BALL 13 CMICH 3 2. (OU): CMICH 52 OU 7 3. (CINCI): CINCI 34 CMICH 0 4. (TOL): TOL 12 CMICH 13 5. (MIOH): MIOH 7 CMICH 31 6. (KENTS): CMICH 42 KENTS 0 7. (KY): CMICH 17 KY 20 8. (WMICH): WMICH 13 CMICH 20 9. (BOWLG): BOWLG 0 CMICH 17 10. (SJSU): SJSU 48 CMICH 24 11. (AKRON): CMICH 14 AKRON 14 12. (EMICH): CMICH 16 EMICH 12	80. LHIGH: 1. (FORD): FORD 3 LHIGH 35 2. (PENN): LHIGH 22 PENN 16 3. (LAFAY): LHIGH 35 LAFAY 14 4. (HOLY): LHIGH 22 HOLY 34 5. (DART): LHIGH 14 DART 33 6. (COLG): COLG 7 LHIGH 52 7. (BUCK): BUCK 30 LHIGH 27 8. (COLUM): COLUM 9 LHIGH 42
81. CINCI: 1. (BAMA): CINCI 7 BAMA 45 2. (FL-ST): CINCI 21 FL-ST 70 3. (MIOH): MIOH 16 CINCI 12 4. (KENTS): CINCI 27 KENTS 24 5. (BOWLG): BOWLG 34 CINCI 20 6. (CMICH): CINCI 34 CMICH 0 7. (LOUVL): LOUVL 41 CINCI 16 8. (WVA): CINCI 20 WVA 28 9. (ECAR): CINCI 32 ECAR 56 10. (IOWA): CINCI 10 IOWA 63 11. (TUL): CINCI 7 TUL 49	82. CLEM: 1. (VA): CLEM 7 VA 20 2. (NC-ST): CLEM 24 NC-ST 17 3. (MD): CLEM 18 MD 17 4. (LBSU): LBSU 0 CLEM 59 5. (ILL): CLEM 30 ILL 0 6. (GTECH): CLEM 19 GTECH 21 7. (GA): GA 3 CLEM 34 8. (WAKEF): CLEM 24 WAKEF 6 9. (DUKE): DUKE 7 CLEM 26 10. (NCAR): NCAR 3 CLEM 20 11. (SCAR): SCAR 15 CLEM 24	83. SWLA: 1. (BAMA): BAMA 25 SWLA 6 2. (TULSA): SWLA 25 TULSA 13 3. (LTECH): SWLA 10 LTECH 24 4. (SMISS): SMISS 14 SWLA 13 5. (MEMPH): SWLA 6 MEMPH 20 6. (NIL): NIL 20 SWLA 24 7. (ECAR): ECAR 20 SWLA 10 8. (TA&M): SWLA 14 TA&M 63 9. (TUL): SWLA 48 TUL 6	84. BAYL: 1. (RICE): BAYL 17 RICE 16 2. (ARK): ARK 3 BAYL 34 3. (HOUST): HOUST 31 BAYL 15 4. (SMU): SMU 17 BAYL 52 5. (TCU): BAYL 27 TCU 21 6. (AZ-ST): BAYL 13 AZ-ST 28 7. (NEB): BAYL 0 NEB 13 8. (TEX): TEX 23 BAYL 13 9. (TTECH): BAYL 21 TTECH 15 10. (TA&M): BAYL 20 TA&M 20	85. PA-ST: 1. (FL-ST): FL-ST 24 PA-ST 17 2. (BAMA): PA-ST 9 BAMA 0 3. (MD): MD 10 PA-ST 24 4. (PITT): PITT 17 PA-ST 22 5. (BOST): PA-ST 40 BOST 21 6. (TEMP): TEMP 10 PA-ST 48 7. (WVA): PA-ST 31 WVA 19 8. (RUTG): RUTG 0 PA-ST 28 9. (USC): PA-ST 14 USC 19 10. (TEX): TEX 17 PA-ST 13 11. (NDAME): PA-ST 24 NDAME 21 12. (SYR): SYR 21 PA-ST 27
86. AZ-ST: 1. (CAL): CAL 31 AZ-ST 24 2. (HOUST): HOUST 62 AZ-ST 45 3. (WA-ST): AZ-ST 51 WA-ST 26 4. (WASH): WASH 42 AZ-ST 14 5. (BAYL): BAYL 13 AZ-ST 28 6. (CO-ST): CO-ST 20 AZ-ST 31 7. (AZ): AZ-ST 17 AZ 21 8. (MO): AZ-ST 9 MO 30 9. (OR-ST): OR-ST 9 AZ-ST 34 10. (USC): USC 13 AZ-ST 6 11. (OR): AZ-ST 7 OR 27	87. OR-ST: 1. (WA-ST): WA-ST 55 OR-ST 24 2. (UNLV): UNLV 19 OR-ST 20 3. (UCLA): OR-ST 17 UCLA 26 4. (AZ): AZ 21 OR-ST 35 5. (AZ-ST): OR-ST 9 AZ-ST 34 6. (OR): OR 6 OR-ST 3 7. (USC): USC 56 OR-ST 7 8. (NEB): OR-ST 7 NEB 31 9. (KAS): OR-ST 12 KAS 38 10. (STAN): OR-ST 3 STAN 37	88. BUCK: 1. (CORN): BUCK 42 CORN 21 2. (FORD): FORD 7 BUCK 44 3. (LHIGH): BUCK 30 LHIGH 27 4. (LAFAY): BUCK 24 LAFAY 14 5. (HOLY): BUCK 14 HOLY 43 6. (COLG): COLG 28 BUCK 27 7. (PRIN): PRIN 9 BUCK 14 8. (COLUM): COLUM 16 BUCK 41	89. SDSU: 1. (USAF): USAF 18 SDSU 48 2. (LBSU): LBSU 20 SDSU 38 3. (UTEP): UTEP 31 SDSU 58 4. (HI): HI 38 SDSU 44 5. (UCLA): SDSU 31 UCLA 45 6. (WYO): SDSU 51 WYO 52 7. (OR): SDSU 21 OR 42 8. (UTAH): UTAH 14 SDSU 66 9. (MIFL): MIFL 30 SDSU 28 10. (NMEX): SDSU 40 NMEX 34 11. (BYU): SDSU 34 BYU 62	90. NM-ST: 1. (FULL): FULL 9 NM-ST 43 2. (TULSA): TULSA 35 NM-ST 10 3. (KS-ST): NM-ST 7 KS-ST 52 4. (LBSU): NM-ST 27 LBSU 31 5. (FRES): NM-ST 3 FRES 42 6. (UTEP): NM-ST 27 UTEP 24 7. (UNLV): UNLV 24 NM-ST 20 8. (SJSU): SJSU 56 NM-ST 20 9. (PAC): NM-ST 24 PAC 62 10. (NMEX): NMEX 29 NM-ST 12 11. (UT-ST): NM-ST 10 UT-ST 55
91. WASH: 1. (CAL): CAL 7 WASH 46 2. (WA-ST): WASH 55 WA-ST 10 3. (COLO): WASH 14 COLO 20 4. (UCLA): UCLA 25 WASH 22 5. (AZ): AZ 10 WASH 54 6. (SJSU): SJSU 17 WASH 17 7. (AZ-ST): WASH 42 AZ-ST 14 8. (OR): OR 17 WASH 38 9. (USC): USC 0 WASH 31 10. (STAN): WASH 52 STAN 16 11. (IOWA): WASH 46 IOWA 34 12. (PURD): WASH 20 PURD 14	92. TOL: 1. (BALL): TOL 28 BALL 16 2. (OU): TOL 27 OU 20 3. (MIOH): TOL 14 MIOH 20 4. (KENTS): KENTS 14 TOL 28 5. (WMICH): TOL 37 WMICH 9 6. (BOWLG): BOWLG 13 TOL 19 7. (CMICH): TOL 12 CMICH 13 8. (NAVY): NAVY 14 TOL 10 9. (NIL): NIL 14 TOL 23 10. (EMICH): EMICH 23 TOL 37	93. KAS: 1. (OK): KAS 17 OK 31 2. (OK-ST): KAS 31 OK-ST 30 3. (VA): VA 59 KAS 10 4. (KS-ST): KS-ST 24 KAS 27 5. (COLO): COLO 41 KAS 10 6. (IA-ST): KAS 34 IA-ST 34 7. (MO): MO 31 KAS 21 8. (LOUVL): KAS 16 LOUVL 28 9. (NEB): NEB 41 KAS 9 10. (OR-ST): OR-ST 12 KAS 38 11. (MIFL): KAS 0 MIFL 34	94. NAVY: 1. (VA): NAVY 14 VA 56 2. (USAF): NAVY 7 USAF 24 3. (ARMY): NAVY 20 ARMY 30 4. (TOL): NAVY 14 TOL 10 5. (BOST): BOST 28 NAVY 17 6. (AKRON): AKRON 13 NAVY 17 7. (NDAME): NDAME 52 NAVY 31	95. IOWA: 1. (NW): NW 14 IOWA 56 2. (WASH): WASH 46 IOWA 34 3. (CINCI): CINCI 10 IOWA 63 4. (ILL): IOWA 54 ILL 28 5. (OSU): OSU 27 IOWA 26 6. (MINN): IOWA 24 MINN 31 7. (WIS): WIS 10 IOWA 30 8. (IA-ST): IA-ST 35 IOWA 45 9. (MICH): IOWA 24 MICH 23 10. (PURD): PURD 9 IOWA 38 11. (MI-ST): IOWA 12 MI-ST 7 12. (MIFL): IOWA 21 MIFL 48
96. SCAR: 1. (FL-ST): FL-ST 41 SCAR 10 2. (NC-ST): SCAR 29 NC-ST 38 3. (CLEM): SCAR 15 CLEM 24 4. (GTECH): SCAR 6 GTECH 27 5. (DUKE): DUKE 10 SCAR 21 6. (WVA): WVA 10 SCAR 29 7. (NCAR): NCAR 5 SCAR 27 8. (VTECH): SCAR 35 VTECH 24 9. (ECAR): ECAR 7 SCAR 37	97. CAL: 1. (WASH): CAL 7 WASH 46 2. (WA-ST): CAL 31 WA-ST 41 3. (WIS): CAL 28 WIS 12 4. (WYO): CAL 17 WYO 15 5. (UCLA): UCLA 31 CAL 38 6. (SJSU): SJSU 34 CAL 35 7. (AZ): CAL 20 AZ 25 8. (AZ-ST): CAL 31 AZ-ST 24 9. (OR): OR 3 CAL 28 10. (USC): CAL 31 USC 31 11. (STAN): STAN 27 CAL 25 12. (MIFL): MIFL 52 CAL 24	98. OK-ST: 1. (OK): OK 31 OK-ST 17 2. (KS-ST): OK-ST 17 KS-ST 23 3. (TULSA): TULSA 3 OK-ST 10 4. (TCU): OK-ST 21 TCU 31 5. (FLA): OK-ST 7 FLA 50 6. (IA-ST): OK-ST 25 IA-ST 17 7. (COLO): OK-ST 22 COLO 41 8. (MO): MO 28 OK-ST 48 9. (KAS): KAS 31 OK-ST 30 10. (NEB): OK-ST 3 NEB 31	99. MD: 1. (VA): MD 35 VA 30 2. (NC-ST): NC-ST 12 MD 13 3. (CLEM): CLEM 18 MD 17 4. (GTECH): GTECH 31 MD 3 5. (LTECH): LTECH 34 MD 34 6. (DUKE): MD 23 DUKE 20 7. (WAKEF): WAKEF 13 MD 41 8. (PA-ST): MD 10 PA-ST 24 9. (NCAR): MD 10 NCAR 34 10. (MICH): MD 17 MICH 45 11. (WVA): MD 14 WVA 10 12. (VTECH): VTECH 13 MD 20	100. AZ: 1. (CAL): CAL 20 AZ 25 2. (WASH): AZ 10 WASH 54 3. (WA-ST): WA-ST 34 AZ 42 4. (ILL): ILL 16 AZ 28 5. (UCLA): AZ 28 UCLA 21 6. (AZ-ST): AZ-ST 17 AZ 21 7. (USC): AZ 35 USC 26 8. (OR-ST): AZ 21 OR-ST 35 9. (OR): OR 17 AZ 22 10. (STAN): STAN 23 AZ 10 11. (NMEX): AZ 25 NMEX 10 12. (SYR): SYR 28 AZ 0
101. USC: 1. (WASH): USC 0 WASH 31 2. (WA-ST): WA-ST 17 USC 30 3. (STAN): USC 37 STAN 22 4. (NDAME): NDAME 10 USC 6 5. (MI-ST): MI-ST 17 USC 16 6. (CAL): CAL 31 USC 31 7. (OSU): USC 35 OSU 26 8. (UCLA): USC 45 UCLA 42 9. (AZ): AZ 35 USC 26 10. (PA-ST): PA-ST 14 USC 19 11. (AZ-ST): USC 13 AZ-ST 6 12. (OR-ST): USC 56 OR-ST 7 13. (SYR): USC 34 SYR 16	102. VTECH: 1. (FL-ST): VTECH 28 FL-ST 39 2. (VA): VA 13 VTECH 38 3. (NC-ST): NC-ST 16 VTECH 20 4. (MD): VTECH 13 MD 20 5. (GTECH): VTECH 3 GTECH 6 6. (BOWLG): BOWLG 21 VTECH 7 7. (TEMP): VTECH 28 TEMP 31 8. (SMISS): SMISS 16 VTECH 20 9. (WVA): WVA 21 VTECH 26 10. (ECAR): VTECH 24 ECAR 23 11. (SCAR): SCAR 35 VTECH 24	103. PURD: 1. (IND): IND 28 PURD 14 2. (NW): PURD 33 NW 13 3. (WASH): WASH 20 PURD 14 4. (ILL): PURD 0 ILL 34 5. (OSU): OSU 42 PURD 2 6. (MINN): MINN 19 PURD 7 7. (MICH): MICH 38 PURD 13 8. (IOWA): PURD 9 IOWA 38 9. (MI-ST): PURD 33 MI-ST 55 10. (NDAME): PURD 11 NDAME 37	104. UT-ST: 1. (FULL): UT-ST 45 FULL 17 2. (NM-ST): NM-ST 10 UT-ST 55 3. (FRES): UT-ST 24 FRES 24 4. (LBSU): LBSU 13 UT-ST 27 5. (UNLV): UNLV 6 UT-ST 31 6. (SJSU): UT-ST 27 SJSU 34 7. (MO): UT-ST 10 MO 45 8. (OR): UT-ST 7 OR 52 9. (UTAH): UTAH 19 UT-ST 0 10. (BYU): UT-ST 10 BYU 45 11. (PAC): PAC 45 UT-ST 51	105. TUL: 1. (LSU): TUL 13 LSU 16 2. (MISS): TUL 21 MISS 31 3. (FL-ST): FL-ST 31 TUL 13 4. (RICE): TUL 21 RICE 10 5. (CINCI): CINCI 7 TUL 49 6. (SMU): SMU 7 TUL 43 7. (SWLA): SWLA 48 TUL 6 8. (MS-ST): MS-ST 38 TUL 17 9. (SMISS): SMISS 14 TUL 14 10. (MEMPH): TUL 14 MEMPH 21 11. (SYR): TUL 26 SYR 24
106. FORD: 1. (LHIGH): FORD 3 LHIGH 35 2. (LAFAY): LAFAY 59 FORD 14 3. (BROWN): FORD 35 BROWN 28 4. (HOLY): HOLY 48 FORD 0 5. (HARV): FORD 13 HARV 19 6. (COLG): COLG 31 FORD 7 7. (BUCK): FORD 7 BUCK 44 8. (PRIN): FORD 14 PRIN 23	107. BOWLG: 1. (BALL): BOWLG 6 BALL 16 2. (OU): OU 10 BOWLG 10 3. (CINCI): BOWLG 34 CINCI 20 4. (MIOH): MIOH 10 BOWLG 10 5. (TOL): BOWLG 13 TOL 19 6. (KENTS): BOWLG 20 KENTS 16 7. (WMICH): WMICH 19 BOWLG 13 8. (CMICH): BOWLG 0 CMICH 17 9. (VTECH): BOWLG 21 VTECH 7 10. (EMICH): EMICH 15 BOWLG 25	108. AKRON: 1. (FULL): FULL 17 AKRON 48 2. (FLA): AKRON 0 FLA 59 3. (LTECH): AKRON 15 LTECH 36 4. (KENTS): AKRON 10 KENTS 38 5. (WMICH): WMICH 24 AKRON 20 6. (CMICH): CMICH 14 AKRON 14 7. (RUTG): AKRON 17 RUTG 20 8. (NAVY): AKRON 13 NAVY 17 9. (NIL): NIL 31 AKRON 28	109. MIFL: 1. (FL-ST): FL-ST 22 MIFL 31 2. (CAL): MIFL 52 CAL 24 3. (PITT): PITT 0 MIFL 45 4. (BOST): BOST 12 MIFL 42 5. (KAS): KAS 0 MIFL 34 6. (TEX): MIFL 46 TEX 3 7. (TTECH): MIFL 45 TTECH 10 8. (NDAME): MIFL 20 NDAME 29 9. (IOWA): IOWA 21 MIFL 48 10. (BYU): MIFL 21 BYU 28 11. (SDSU): MIFL 30 SDSU 28 12. (SYR): SYR 7 MIFL 33	110. NIL: 1. (NW): NIL 7 NW 24 2. (KS-ST): KS-ST 35 NIL 42 3. (SWLA): NIL 20 SWLA 24 4. (FRES): FRES 18 NIL 73 5. (TOL): NIL 14 TOL 23 6. (AKRON): NIL 31 AKRON 28 7. (NEB): NIL 14 NEB 60 8. (ECAR): NIL 20 ECAR 24
111. COLUM: 1. (CORN): CORN 41 COLUM 0 2. (LHIGH): COLUM 9 LHIGH 42 3. (PENN): COLUM 6 PENN 21 4. (LAFAY): LAFAY 41 COLUM 34 5. (BROWN): BROWN 17 COLUM 0 6. (DART): COLUM 20 DART 34 7. (YALE): COLUM 7 YALE 31 8. (HARV): HARV 9 COLUM 6 9. (PRIN): PRIN 15 COLUM 17 10. (BUCK): COLUM 16 BUCK 41	112. NW: 1. (RICE): NW 14 RICE 31 2. (IND): IND 42 NW 0 3. (ILL): NW 23 ILL 28 4. (OSU): NW 7 OSU 48 5. (WIS): WIS 34 NW 44 6. (MINN): NW 25 MINN 35 7. (DUKE): DUKE 27 NW 24 8. (MI-ST): MI-ST 29 NW 22 9. (PURD): PURD 33 NW 13 10. (IOWA): NW 14 IOWA 56 11. (NIL): NIL 7 NW 24	113. MINN: 1. (IND): IND 0 MINN 12 2. (NW): NW 25 MINN 35 3. (OSU): MINN 23 OSU 52 4. (WIS): MINN 21 WIS 3 5. (IA-ST): IA-ST 16 MINN 20 6. (MICH): MINN 18 MICH 35 7. (NEB): MINN 0 NEB 56 8. (UTAH): UTAH 35 MINN 29 9. (IOWA): IOWA 24 MINN 31 10. (MI-ST): MI-ST 28 MINN 16 11. (PURD): MINN 19 PURD 7	114. WYO: 1. (CAL): CAL 17 WYO 15 2. (USAF): USAF 12 WYO 24 3. (WA-ST): WYO 34 WA-ST 13 4. (UTEP): WYO 17 UTEP 10 5. (HI): WYO 17 HI 38 6. (CO-ST): WYO 8 CO-ST 31 7. (TEMP): TEMP 23 WYO 38 8. (UTAH): WYO 28 UTAH 10 9. (BYU): BYU 45 WYO 14 10. (NMEX): NMEX 22 WYO 25 11. (SDSU): SDSU 51 WYO 52	115. RUTG: 1. (ARMY): RUTG 31 ARMY 35 2. (KY): KY 8 RUTG 24 3. (PITT): RUTG 21 PITT 45 4. (TEMP): RUTG 22 TEMP 29 5. (BOST): RUTG 14 BOST 19 6. (PA-ST): RUTG 0 PA-ST 28 7. (WVA): WVA 28 RUTG 3 8. (COLG): COLG 17 RUTG 28 9. (AKRON): AKRON 17 RUTG 20 10. (MI-ST): MI-ST 34 RUTG 10 11. (SYR): RUTG 0 SYR 42
116. TTECH: 1. (RICE): TTECH 21 RICE 42 2. (ARK): TTECH 49 ARK 44 3. (HOUST): HOUST 51 TTECH 35 4. (SMU): SMU 7 TTECH 62 5. (TCU): TTECH 40 TCU 28 6. (BAYL): BAYL 21 TTECH 15 7. (OSU): TTECH 10 OSU 17 8. (TEX): TEX 41 TTECH 22 9. (MIFL): MIFL 45 TTECH 10 10. (NMEX): TTECH 34 NMEX 32 11. (TA&amp;M): TTECH 24 TA&M 28	117. ECAR: 1. (FL-ST): ECAR 24 FL-ST 45 2. (CINCI): CINCI 32 ECAR 56 3. (SWLA): ECAR 20 SWLA 10 4. (LTECH): LTECH 17 ECAR 27 5. (GA): ECAR 15 GA 19 6. (TEMP): ECAR 27 TEMP 30 7. (SMISS): SMISS 16 ECAR 7 8. (MEMPH): ECAR 24 MEMPH 17 9. (VTECH): VTECH 24 ECAR 23 10. (NIL): NIL 20 ECAR 24 11. (SCAR): ECAR 7 SCAR 37	118. AUBN: 1. (BAMA): BAMA 16 AUBN 7 2. (FL-ST): FL-ST 17 AUBN 20 3. (VAND): VAND 6 AUBN 56 4. (MISS): AUBN 24 MISS 10 5. (FULL): FULL 17 AUBN 38 6. (IND): AUBN 27 IND 23 7. (FLA): AUBN 7 FLA 48 8. (MS-ST): AUBN 17 MS-ST 16 9. (LTECH): LTECH 14 AUBN 16 10. (GA): GA 10 AUBN 33 11. (TENN): TENN 26 AUBN 26 12. (SMISS): SMISS 13 AUBN 12	119. NMEX: 1. (NM-ST): NMEX 29 NM-ST 12 2. (KS-ST): NMEX 6 KS-ST 38 3. (FRES): NMEX 17 FRES 24 4. (UTEP): UTEP 28 NMEX 48 5. (HI): NMEX 16 HI 43 6. (CO-ST): NMEX 7 CO-ST 47 7. (WYO): NMEX 22 WYO 25 8. (AZ): AZ 25 NMEX 10 9. (UTAH): UTAH 29 NMEX 27 10. (TTECH): TTECH 34 NMEX 32 11. (BYU): NMEX 31 BYU 55 12. (SDSU): SDSU 40 NMEX 34	120. SYR: 1. (PITT): PITT 20 SYR 20 2. (TEMP): TEMP 9 SYR 19 3. (BOST): SYR 35 BOST 6 4. (WVA): SYR 31 WVA 7 5. (MI-ST): MI-ST 23 SYR 23 6. (MIFL): SYR 7 MIFL 33 7. (VAND): SYR 49 VAND 14 8. (ARMY): SYR 26 ARMY 14 9. (AZ): SYR 28 AZ 0 10. (PA-ST): SYR 21 PA-ST 27 11. (RUTG): RUTG 0 SYR 42 12. (USC): USC 34 SYR 16 13. (TUL): TUL 26 SYR 24

More information: http://www-cs-faculty.stanford.edu/~knuth/sgb.html

JAAS y SecurityFilter

2007-03-21T12:45:00.009-04:00

La seguridad es uno de los aspectos a resolver con importancia en estos dias tal como nos dice Cobit y también diferentes ISO's, y por ello un punto importante dentro de cualquier proyecto.

La seguridad se centra sobre dos conceptos básicos: autenticación y autorización. Usuarios se autentican al sistema probando que son lo que dicen ser, por mientras la autorización permite/no-permite acceso a ciertas áreas de la aplicación.

La arquitectura J2EE tiene resuelto (y sus contenedores) este paradigma a través de Java Authentication and Authorization Service (JAAS), la cual es un conjunto de packages con servicios para autenticar y controlar de acceso de una manera centralizada (en un descriptor), conviviendo con el contenedor web que la aplicación este utilizando (Jakarta Tomcat, JBoss, otros).

Esta forma de seguridad puede ser administrada a base del contenedor (container-managed security) o de la aplicación (application-managed security).

1. Esta primera opción, de tener dependencia del contenedor, aumenta la complejidad de administración ya que hay que preocuparse de este contenedor en particular aparte de la aplicación como tal, quedando dividida y preocupándose de ambas. (Ejemplo especificar el repositorio donde se encuentra el real, nombre de usuario, password de roles, etc.).

2. La segunda forma es lograr que la aplicación posea toda la responsabilidad haciéndola más compleja de desarrollar y logrando que su escalabilidad queda segmentada a la solución hecha.

La solución implementada en nuestro proyecto es una solución híbrida en la cual dejamos la responsabilidad de la seguridad a la aplicación (autenticación y autorización) a través de un robusto proyecto open source llamado SecurityFilter que genera filtros Servlet para su control. Se logra tener la flexibilidad de una seguridad de aplicación, logrando dejar independiente el contenedor (por ejemplo por su posible migración de arquitectura de conexión de base de datos).

Autenticación Form-Based + SecurityFilter

Los contenedores web J2EE ofrecen tres tipos de mecanismos de autenticación: basic, form-based, y autenticación mutua. La mayoría de las aplicaciones web usan el tipo de form-based ya que permite que la interfaz del usuario sea personalizable (HTML). La autorización es implementada por los contenedores a través de roles de seguridad definidos en el descriptor de la aplicación web (web.xml).

SecurityFilter usa la misma arquitectura que Form-Based donde se configura a través de descriptores en la aplicación.

Existe web.xml donde colocamos el uso del filtro de servlet en la aplicación y que realmente es nuestra forma de seguridad, esta se ve así:

<filter>
  <filter-name>Security Filter</filter-name>
  <filter-class>org.securityfilter.filter.SecurityFilter</filter-class>
  <init-param>
    <param-name>config</param-name>
    <param-value>/WEB-INF/securityfilter-config.xml</param-value>
    <description>Configuracion</description>
  </init-param>
  <init-param>
    <param-name>validate</param-name>
    <param-value>true</param-value>
    <description>Validar debe ser verdadero</description>
  </init-param>
</filter>

Con ello nos permite personalizar cuales son las páginas de ingreso y no-autorización a la aplicación (con sus URLs respectivas):

<login-config>
  <auth-method>FORM</auth-method>
  <form-login-config>
    <form-login-page>/jsp/publico/Index.jsp</form-login-page>
    <form-error-page>/jsp/publico/errorauth.jsp</form-error-page>
    <form-default-page>/LoginCliente.do</form-default-page>
  </form-login-config>
</login-config>

Se pueden mencionar los siguientes Tags principales que pueden ser descritos en el web.xml

<login-config>: especifica el tipo de configuración de registro (login). Puede incluir los siguientes subelementos

<auth-method>: opcional
<realm-name>: opcional
<form-login-config>:opcional

<form-login-config>: Específica los recursos utilizados en el registro login basado en formularios. Debe contener los subelementos siguientes:

<form-login-page> y <form-error-page> siendo los dos requeridos.

<form-login-page>: especifica el nombre de un recurso (html, página JSP, servlet) que solicita el nombre de usuario y la contraseña. Esta página debe cumplir los siguientes requisitos

El formulario debe utilizar METHOD = “POST” y ACTION=”j_security_check”
El campo de nombre de usuario debe denominarse j_username
el campo de contraseña debe denominarse j_password.

<form-error-page>: Especifica el nombre de un recurso (HTML, JSP, servlet) a mostrar cuando el registro basado en el formulario no sea correcto.

<auth-constraint>: Especifica una lista de nombres de funciones (o roles) tratada colectivamente en un elemento <security-constraint>. Puede contener los siguientes subelementos <description> el cual es opcional y <role-name> (cero o más).

<role-name>: Un nombre utilizado para identificar una función o rol con el que un usuario autenticado se puede registrar. Es el mismo valor especificado en el método request.isUserInRole() para permitir la ejecución condicional de partes de un servlet a
usuario con roles o funciones diferentes.

Por motivos de estructura similar a J2EE el formulario HTML tiene que tener la siguiente estructura de los campos j_username y j_password con el nombre de acción j_security_check como lo podemos ver en el ejemplo:

<form method="POST" action="j_security_check">
<input type="text" name="j_username">
<input type="password" name="j_password">
</form>

Esta forma de conexión usa codificación de base64, que puede exponer el nombre de usuario y clave a menos que sea con conexiones SSL.

Así los pasos que usamos son:

Si el usuario no ha sido autenticado, le pide al usuario que de sus datos para tal acción recarga -a la página de ingreso (login) definida en el descriptor.

Valida las credenciales del usuario contra la base de datos ya que es parte de nuestra aplicación.

Determina si el usuario autenticado entonces está autorizado a ingresar al área solicitada según el descriptor.

Autorización

Una vez autenticado obtenemos el rol que posee y se verifica si puede asignar a los recursos solicitados, SecurityFilter tiene un archivo llamado securityfilter-config.xml el cual tiene centralizado todas las páginas que se puedan acceder según rol definidos en la aplicación (y también aparezcan en la base de datos, cual es nuestro repositorio).

De esta forma podemos administrar de manera fácil que rol tiene derecho de acceso a que Actions de Struts o JSP, según la lógica de negocio diseñada.

Ejemplo:

<security-constraint>
  <web-resource-collection>
  <web-resource-name>Pagina seguras Clientes</web-resource-name>
    <url-pattern>/jsp/cliente/*.jsp</url-pattern>
    <url-pattern>/RegistroObra.do*</url-pattern>
  </web-resource-collection>
  <auth-constraint>
    <role-name>cliente</role-name>
  </auth-constraint>
</security-constraint>

En este ejemplo podemos ver como se está asignando acceso a los JSP y un Action en particular únicamente a los usuarios que posean rol de “cliente”:

Además SecurtyFilter nos permite aun utilizar los métodos getRemoteUser(), isUserInRole(), y getUserPrincipal() para generar dentro de la aplicación reglas de seguridad a nivel de código Java.

Ventajas

La aplicación no necesita tener implementado el mecanismo de autenticación, sólo configurar los descriptores.

Con SecurityFilter la idea es empaquetar la seguridad dentro de la aplicación web, incluyendo la administración de roles, permitiendo generar un .war que puede liberarse en cualquier contenedor sin necesidad de configurar nada extra.

Bibliografía

http://securityfilter.sourceforge.net/ Security Filter utilizado en el proyecto
http://java.sun.com/products/jaas/reference/docs/index.html JAAS Reference Documentation
http://www.onjava.com/pub/a/onjava/2002/06/12/form.html J2EE Form-based Authentication

iBATIS - The Beauty of Simplicity

2007-03-21T12:37:00.000-04:00

When I was involved in a project for a Strength of Materials Certification Laboratory for my University, the solution included open source frameworks as Struts as presentation tier. but I had a doubt of connection tier.

The good point is Data model, tables, data, exist already, SQL queries I was going to be help for a student of last year, even more I could use some and I needed a simple solution, so EJB is discard immediately, Hibernate sound good (I reckon is the Object related tool on web today, but I need something simple and clean) then I remember I heard iBATIS as a easy-fast productivity SQL Mapper framework.

iBATIS gives all what I need, centralized management, easy of implement writing down all the SQL queries I need, linking them in a ResultSet (and JavaBean) and another doing the JSP interface (actually the html:form tags).

Thus the code could be reduce a lot, not doing those JDBC statement (mention above), besides I made a simple Java code to help writing down SQL maps and JavaBean (well, later on I knew there is Perl tool that do this better with DDL from the database: http://alxeg.narod.ru/ibatis/index.html . However my tool worked parsing , so it can read the name of the fields and make the JavaBean and XML; (this reduce even more the coding).

Another parameter to consider was iBATIS born mature :) because after sun shows Jpetstore with better performance than Microsoft and release the interesting framework layer including SQL Maps and DAO.

Finally, the iBATIS web scene was mature enough to get support for any issue on it. Plus the development team is still working hard enough to get more update version, solving some unexpected issues (you never know and it’s better to have some backup).

iBATIS mapped framework according to ibatis.apache.org, it has two important features, SQL maps and DAO -the last one we are going only mention because mapping is our main issue-

SQL Maps makes development much easier, and the maintenance too.

The Architecture of iBATIS is:

Centralized SQL Mappings inside XML files, this way is easy to maintenance, flexible , scability, fix problems. Every java programmer knows how tedious is to code many times JDBC connection, making the code larger, more complex to read and worse to maintain and scability.

figure 1, taken from http://ibatis.apache.org/

architecture of iBATIS

<-- figure 2 --> data model of the example: entities (client, application_form, application_form_detail).

Here we configure the database properties (too redundant? :P)
database.properties:

driver=org.firebirdsql.jdbc.FBDriver
url=jdbc:firebirdsql:localhost/3050:C:/development/database/SAMPLEDBS.GDB
username=administrator
password=development2006

This file contains all the XML with SQL Maps
sql-map-config.xml:

<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE sqlMapConfig
PUBLIC "-//iBATIS.com//DTD SQL Map Config 2.0//EN"
"http://www.ibatis.com/dtd/sql-map-config-2.dtd">

<sqlMapConfig>

<properties resource="database.properties" />

<transactionManager type="JDBC">
<dataSource type="SIMPLE">
<property name="JDBC.Driver" value="${driver}"/>
<property name="JDBC.ConnectionURL" value="${url}"/>
<property name="JDBC.Username" value="${username}"/>
<property name="JDBC.Password" value="${password}"/>
</dataSource>
</transactionManager>

<sqlMap resource="TmpIndicesSQL.xml" />
<sqlMap resource="DetalleSolicitudSQL.xml" />

</sqlMapConfig>

An example of SQL Map, showing how to make ResultSet, INSERT, SELECT and UPDATE statement, with dynamic concatenation of condition in the statement (AND/OR in the WHERE).
DetalleSolicitudSQL.xml:

<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE sqlMap PUBLIC "-//iBATIS.com//DTD SQL Map 2.0//EN"
"http://www.ibatis.com/dtd/sql-map-2.dtd">

<sqlMap namespace="DetalleSolicitudSQL">

<cacheModel id="detallesolicitud_cache" type="MEMORY" >
<flushInterval hours="24"/>
<flushOnExecute statement= "insertDetalleSolicitud" />
<property name="reference-type" value="WEAK" />
</cacheModel>

<resultMap id="detallesolicitud_result" class="cl.unab.dicemat.utils.facade.DetalleSolicitud">
<result property="detsol_descripcion" column="x_detsol_descripcion" />
<result property="detsol_cantidad" column="x_detsol_cantidad" />
<result property="ens_cod_tipo" column="x_ens_cod_tipo" />
<result property="solcer_id" column="x_solcer_id" />
</resultMap>

<statement id="insertDetalleSolicitud">
INSERT INTO detalle_solicitud ( detsol_descripcion, detsol_cantidad, ens_cod_tipo, solcer_id )
VALUES ( #detsol_descripcion#, #detsol_cantidad#, #ens_cod_tipo#, #solcer_id# )
</statement>

<statement id="viewDetalleSolicitud" resultMap="detallesolicitud_result" cacheModel="detallesolicitud_cache">
SELECT detsol_descripcion AS x_detsol_descripcion,
detsol_cantidad AS x_detsol_cantidad,
ens_cod_tipo AS x_ens_cod_tipo,
solcer_id AS x_solcer_id
FROM
detalle_solicitud
</statement>

</sqlMap>

with a select to get a autoincrement key for Firebird database (also there is commented examples for PostgreSQL, in (2) you can get more code to different engines). This features that iBATIS has implemented for most DB engines, but still aren't 100% solve in the current time, however I could solved doing another query, leaving atomized and thread-safe. (I can show the example with Firebird). The good thing was the flexibility iBATIS has to go through this problem.

IndiceSQL.xml:

<resultMap id="tmpindices_result" class="cl.unab.dicemat.utils.facade.TmpIndices">
<result property="tabla" column="x_tabla" />
<result property="obra_id" column="x_obra_id" />
</resultMap>



<statement id="viewTmpIndices" resultMap="tmpindices_result" cacheModel="tmpindices_cache">
SELECT gen_id(GEN_SOLICITUDCERTIFICADO, 1) as x_obra_id,
rdb$$relation_id as x_tabla
FROM
rdb$$database
</statement>

SolicitudCertificadoAction.java snippet
The simple method dao.insertSolicitudCertificado(solicitudCertificadoDTO); insert the data in the javabean. Using beanutils commons.

SolicitudCertificadoForm.java, dynaform can be used, however I prefer to use normal JavaBean thus I can maintain the kind of data (int, String, Date).

Conclusion:

We finally are in the last stages of the project doing QA, the SQL Mapping was a success, I saved a lot of time though this framework. Getting a simpler and cleaner code, the performance of the application.

Bibliography:

iBATIS Home- ibatis.apache.org
iBATIS Wiki- http://opensource.atlassian.com/confluence/oss/display/IBATIS/Home
iBATIS mailing-list

Dragon Book New Edition

2007-03-13T18:13:00.001-04:00

After 20 years appears Compilers: Principles, Techniques, and Tools, 2/E by Alfred V. Aho, from AW page says: "The authors, recognizing that few readers will ever go on to construct a compiler", this is a big truth nevertheless is an must reading. (besides if you ever need to know formal introduction and beyond from Regular Expressions this is the book you must read).

New chapters include:

Chapter 10 Instruction-Level Parallelism

Chapter 11 Optimizing for Parallelism and Locality

Chapter 12 Interprocedural Analysis

Besides the cover always have caught my attention, right now has a graphics render against pencil drawing.

Bitwise Tricks and Techniques

2006-12-21T16:20:00.002-03:00

Dr. Knuth has released a new version Pre-Fascicle from his famous TAOCP called Bitwise Tricks and Techniques.
Please, go to http://www-cs-staff.stanford.edu/~knuth/news.html to download the postscript, also can be found an update to:
* Pre-Fascicle 0b: Boolean Basics (version of 20 Dec 2006)
* Pre-Fascicle 0c: Boolean Evaluation (version of 20 Dec 2006)
As usual it’s a important collection of many paper, books, articles retrieved through years by Donald Knuth and includes many work by himself (also asking if someone has done some research before to give correct acknowledge).

XML + RegExp = Relax NG

2006-12-07T16:20:00.000-03:00

Although it’s an “old” definition for validation of XML, now Relax NG is being considered to integrated inside Sun development mentioned by: Tim Bray. With this has a new revival interest on it.
We can see the beauty of simplicity on this project:

In science, strong theories tend to be simple, yet have almost infinite potential for complexity in application. RELAX NG is, because of its simplicity, one of those theories that is easy to explain, easy to implement, and generic and flexible enough to meet the most stringent requirements.

Eric van der Vlist, RELAX NG, O’Reilly ,2003.
more information can be found at: http://relaxng.org and its most important implementations at the moment in Java are Jing and The Sun Multi-Schema XML Validator (MSV).

Balanced Design

2006-11-22T16:19:00.001-03:00

Like most thing in life we have to choose, become, behave in a balanced way. Always there are consequences opting an extremity. Similar to Statistics where it can be shown in a graph like the Gaussian Distribution:

This also can be seen in language programming (i.e. the level of encapsulation, factorization, etc.) and even in design. The classic book Design Patterns from GoF identifies 23 patterns cataloging them under 3 classifications (creational, structural, behavioral).

The level, granularity and quantity you use them depends on several factor, nevertheless it is not advisable apply to used all of them at once, like in the following interview Eric makes mention of a similar case.

Do not start immediately throwing patterns into a design, but use them as you go and understand more of the problem. Because of this I really like to use patterns after the fact, refactoring to patterns. One comment I saw in a news group just after patterns started to become more popular was someone claiming that in a particular program they tried to use all 23 GoF patterns. They said they had failed, because they were only able to use 20. They hoped the client would call them again to come back again so maybe they could squeeze in the other 3.

Trying to use all the patterns is a bad thing, because you will end up with synthetic designs—speculative designs that have flexibility that no one needs. These days software is too complex. We can’t afford to speculate what else it should do. We need to really focus on what it needs. That’s why I like refactoring to patterns. People should learn that when they have a particular kind of problem or code smell, as people call it these days, they can go to their patterns toolbox to find a solution.

How to Use Design Patterns A Conversation with Erich Gamma,
http://www.artima.com/lejava/articles/gammadp.html

From Ajax in Action book called this symptom (or condition) of overused of patterns as paralysis by analysis.

We can conclude, First try to make your first effort coding (of course there is analysis and design before, but we are stand at development and trying to refactor the solution) unless you have already the experience to use a known pattern to a particular problem then try to use some pattern from the catalog, and use them carefully, remember the first and final idea is to make things more simple, elegant and not chaos.

Knuth Selected Papers

2006-10-19T16:18:00.002-03:00

Dr Knuth has been publishing compilations of his papers in different subject he is involved, as wide as literate programming until recreational mathematics, This is a good compendium of his work.
the list is:

Literate Programming (1992)
Selected Papers on Computer Science (1996)
Digital Typography (1999)
Selected Papers on Analysis of Algorithms (2000)
Selected Papers on Computer Languages (2003)
Selected Papers on Discrete Mathematics (2003)
Selected Papers on Design of Algorithms (2007)
Selected Papers on Fun and Games (2007)

at his page you can find more information.
http://www-cs-faculty.stanford.edu/~knuth/selected.html

Eclipse JSP Styles

2006-09-08T16:17:00.001-04:00

I have been seen how Eclipse IDE has been growing by the community, sometimes with huge improvement for code donation, however there are some features left that can be found in the plug-ins, but not always, by instance in JSP editing (inherated form Lomboz plug-in) it use to be yellow all the tags from Struts/JSTL/etc. and leaving blank the rest helping to see more easily the JSP/Tag code from Javascript/HTML.

This works great for Struts framework pages, where coexistence between HTML and Struts/JSTL Tags is important, but now working with JSF it is not for much help because here (at least for a average scenario) our code doesn’t contain traditional HTML tags (or a few tags) only JSF-HTML tags, so the final rendering it’s only a yellow stain, thus we better change under:

Window->Preferences->Web and XML->JSP Files->JSP Styles

the “Restore Defaults” and has a better looking. nevertheless if we open a struts projec again we loose this yellow easy to see feature, just right here we can change outside the IDE itself the following file

org.eclipse.jst.jsp.ui.prefs

which can be found at

.metadata/.plugins/org.eclipse.core.runtime/.settings

inside can be seeing verbatim the codes of the colors:

#Fri Sep 30 15:10:35 VET 2005
tagBorder=\#008080 | \#ffff80 | false
tagAttributeName=\#7f007f | \#ffff80 | false
tagName=\#3f7f7f | \#ffff80 | false
org.eclipse.wst.sse.ui.custom_templates=\r\n
SCRIPT_AREA_BORDER=\#bf5f3f | \#ffff80 | false
tagAttributeValue=\#2a00ff | \#ffff80 | false
jsp_content=null | \#ffff80 | false
eclipse.preferences.version=1
commentBorder=\#3f5fbf | \#ffff80 | false
commentText=\#3f5fbf | \#ffff80 | false

the .metadata directory can be found in your workspace -your workspace by default is under eclipse directory, however is a good practice is to have it in a different place (and your plug-ins too).

Fractal Pop Beverage

2006-08-04T16:16:00.000-04:00

although today fractal are used commonly in graphics design, television and any graphics interpretation, seeing spectacular images from http://ziza.ru/2006/05/24/otlichnaya-podborka.html, this image in particular still takes my attention for using in a very good way a fractal sensation
(please see the original image, there you can appreciate what I mean).

I don’t know which tool the artist used however you can do interesting artwork with: ultra fractal (shareware) and with povray also (but this last program is not fractal oriented as the first one and it uses a script language).

The Art of Computer Programming in Boolean

2006-06-27T16:15:00.002-04:00

Dr. Donald Knuth, still is working in draft of TAOCP, right now you can find the last drafts which regards basic and advanced boolean studies. Still I’m waiting for the 7.2.2 chapter dealing with backtracking in general (this is mentioned in prefaces of Knuth’s drafts).
Meanwhile you can read a joyful article from Stanford Magazine: Love at First Byte by Kara Platoni.

Pandigital Magic Square

2006-06-20T16:13:00.001-04:00

Although this is an old solution, I’m publishing here because it has been appeared in several books from Cliff Pickover.

Below it’s my first solution and then a better one found by Rodolfo Kurchan and I proved it with an exhaustive search and finding more pandigital magic squares:

I found a smaller solution to your magic square with pandigital numbers, which appeared at Journal of Recreational Mathematics issue 28

1034786295 1035687294 1024796385 1025697384
1024697385 1025796384 1034687295 1035786294
1035697284 1034796285 1025687394 1024786395
1025786394 1024687395 1035796284 1034697285

As you can see the sum is 4120967358

Later Rodolfo Kurchan found:

Pandigital magic sum = 4120736958. He says that German Gonzalez-Morris told him that this was now the smallest (just for the 4×4 case, as you will learn in short).

German Gonzalez-Morris added (May 2006) that he made a computer program and found an smaller pandigital sum (4120967358) then Rodolfo (by hand) found the smallest sum (4120736958), finally German found (and prove by exhaustive search) all smallest sums beginning from: 4120736958, 4120953678, 4120967358, 4127360958, 4129536078, …

1034728695 1035628794 1024739685 1025639784
1024639785 1025739684 1034628795 1035728694
1035629784 1034729685 1025638794 1024738695
1025738694 1024638795 1035729684 1034629785

more information can be found at: http://www.primepuzzles.net/puzzles/puzz_249.htm

http://www.mathforum.org/kb/thread.jspa?forumID=265&threadID=611491&messageID=1787982#1787982

http://mathforum.org/kb/message.jspa?messageID=1787984&tstart=0

Month-Text Ordering

2006-05-30T12:22:00.003-04:00

Reading Dr. Dobbs’s magazine December 2005 issue in the article Month-Text Ordering, appears the following phrase:

first we analyze QSortAlgorithm Class:

while( ( lo <> lo0 ) && (test.compareTo (a[hi], mid) > 0))

As we can see it’s unnecessary the amount of the number, only its sign, therefore it doesn’t affect at all the final result. thus we can improve the simpleANCompareTo method.

We can improved a little more taking out the IntParser method and return the difference of length or the compareTo method from String Class instead.

finally the new code in MonthOrder.java may be:

//Start New Code
if (e1!=e2) test = e1-e2;
else test = name1.substring (n1, e1).compareTo(name2.substring (n2, e2));
if (test != 0)
return test;
//End New Code

Diff file is:

87,99c89,94
< val1 =" Integer.parseInt" val1 =" -1;" val2 =" Integer.parseInt" val2 =" -1;" test =" val1">
>                 if (e1!=e2) test = e1-e2;
>                 else test = name1.substring (n1, e1).compareTo(name2.substring (n2, e2));
>
>
>                 if (test != 0)
100a96
>
124a121,123
>
>
>

of course this new change is to avoid the limitation that integer range has (2^31-1), in this example it doesn’t matter the size because we are comparing years (yes, probably in the year 2147483647 this code will be obsolete :) ).

Perhaps it can be implemented something similar to the final version of numeric alphanumeric of October 2000 issue.

I have to appreciate David Wincelberg for sharing with us this simple and beautiful solution.

The original magazine’s source code can be obtained at:
ftp://66.77.27.238/sourcecode/ddj/2005/0512.zip

Hello World!

2006-04-01T12:11:00.001-04:00

This is the very first post, here will appear Programming, Math, Gaming and other issues… coming soon.

Here you can find thoughts about my hobbies and sometimes seriuos things from my job. Math, Programming, Design.

--This is my new blog after having problems with my webhosting...