⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 algorithm.java,v

📁 包含了模式识别中常用的一些分类器设计算法
💻 JAVA,V
📖 第 1 页 / 共 2 页
字号:
d304 5d391 5d406 3d410 1@1.7log@Wrote javadoc comments to standards.@text@d77 1a77 1    Vector description_d = new Vector();
d82 1a82 1    Vector point_means_d = new Vector();
d87 1a87 1    Vector set1_d = new Vector();
d92 1a92 1    Vector set2_d = new Vector();
d97 1a97 1    Vector set3_d = new Vector();
d102 1a102 1    Vector set4_d = new Vector();
d140 2d383 1@1.6log@*** empty log message ***@text@d4 1a4 1//                              Last Edited : Sanjay Patil
d24 3a26 1    //Class Specific Data
d28 5d37 4d45 4d50 4d55 4d60 4d68 4d73 4d78 4d83 4d88 4d93 4d98 4d104 7d115 3a117 1     * @@return  boolean
d133 1d149 1a149 1     * @@return   boolean
d154 3a156 2	//System.out.println(algo_id + " : prevStep()");
	
d164 1d179 1a179 1     * @@return boolean
d198 2a199 2     * @@return  boolean
     * @@see     ProcessBox
d217 1a217 1     * @@return  boolean
d394 1a394 1    * @@return  boolean
@1.5log@seems to have completed the Java Documentation Style commenting.Finer cosmetic changes done.@text@d2 3a4 2// Algorithm.java  6.0 03/15/2005
// Created by Daniel May.  Last Edited : Sanjay Patil
d6 3a8 3// Description : This is the base class for all pattern recognition 
//               algorithms. 
// Remarks     : Code unchanged since created. created 09/02/2003
@1.4log@Changed the comments as per the Java Documentation stylehhttp://java.sun.com/j2se/javadoc/writingdoccomments/index.html@text@d1 8a8 1/**
a9 6 * Algorithm.java  1.0 09/02/03
 * Created by: Daniel May
 * Last Edited by: Daniel May
 * Class: Algorithm 
 * Description: This is the base class for all pattern recognition algorithms.
 */
d17 3a19 1
a21 11    //-----------------------------------------------------------------
    //
    // static data members
    //
    //-----------------------------------------------------------------

    //-----------------------------------------------------------------
    //
    // primitive data members
    //
    //-----------------------------------------------------------------
a30 6    //-----------------------------------------------------------------
    //
    // instance data members
    //
    //-----------------------------------------------------------------
    
d49 2a50 6     * class methods
     *
     */

    /**
     * method: nextStep
a51 1     * @@param   none
a52 4     *
     * description:  
     * determines and executes next step of the algorithm in a new
     * thread of execution.
d66 10a75 10
	// increment step index
	step_index_d++;

	pro_box_d.appendMessage((String)description_d.get(step_index_d));

	Thread step = new Thread(this);
	step.start();

      	return true;
a78 1
d80 2a81 1     * method: nextStep
a82 1     * @@param   none
a83 4     *
     * description:  
     * determines and executes previous step of the algorithm in a new
     * thread of execution.
d108 1a108 1     * method: setOutputPanel
d110 1a110 1     * @@param  none
d112 1a112 4     *
     * description:  
     * initializes the output panel. 
     * 
d114 1a114 1   public boolean setOutputPanel(OutputPanel out_panel_a)
d118 3a120 2	//        System.out.println(algo_id + ": setOutputPanel(OutputPanel out_panel_a)");

d125 1a125 1
d127 6a132 9    * method: setProcessBox
    *
    * @@param   none
    * @@return  boolean
    *
    * description:  
    * initializes the process box. 
    * 
    */    
d135 1a135 1         // Debug
d137 2a138 1	//	 System.out.println(algo_id + ": setProcessBox(ProcessBox pro_box_a)");
a144 1
d146 6a151 9    * method: setDataPoints
    *
    * @@param   none
    * @@return  boolean
    *
    * description:  
    * initializes the data points. 
    * 
    */
d156 1a156 1	//        System.out.println(algo_id + ": setDataPoints(DataPoints data_a)");
d159 1d165 2a166 9    * method: computeMeans
    *
    * @@param   none
    * @@return  none
    *
    * description:  
    * computes the means for each existing data set 
    * 
    */
d171 1a171 1	//	System.out.println(algo_id + ": computeMeans()");
d183 1a183 1	// caculate point means
d223 3d296 3a298 10    * method: disableControl
    *
    * @@param   none
    * @@return  none
    *
    * description:  
    * Disables the next and previous keys before beggining to execute
    * a step.
    *
    */
d306 3a308 10    * method: enableControl
    *
    * @@param   none
    * @@return  none
    *
    * description:  
    * Enables the next and previous keys after the execution of
    * a step.
    *
    */
d317 3a319 10    * method: run
    *
    * @@param   none
    * @@return  none
    *
    * description:  
    * implementation of run from the Runnable interface.  This method
    * should be overidden by inheriting classes
    *
    */
a321 1
d323 2a324 1    * method: initialize
a325 1    * @@param   none
a326 5    *
    * description:  
    * initializes algorithm.  this method should be overidden by inheriting
    * classes
    *
a329 6





@1.3log@The message "Algorithm Complete" removed and thus it will be addedto each individual Algorithm seperately.Instead of "Step Sequence Complete" Now each algorithm will messageout "Algorithm Complete".@text@d1 1a1 11//----------------------------------------------------------------------
// Algorithm.java  1.0 09/02/03
//
// Created by: Daniel May
// 
// Last Edited by: Daniel May
//
// Class: Algorithm
// 
// Description: This is the base class for all pattern recognition algorithms.
//---------------------------------------------------------------------
d3 6d31 1a31 1    // Class Specific Data
d62 15a76 18    //---------------------------------------------------------------
    //
    // class methods
    //
    //---------------------------------------------------------------


    //---------------------------------------------------------------
    // method: nextStep
    //
    // arguments: none
    // return   : boolean
    //
    // description:  
    // determines and executes next step of the algorithm in a new
    // thread of execution.
    //
    //---------------------------------------------------------------
d103 10a112 11    //---------------------------------------------------------------
    // method: nextStep
    //
    // arguments: none
    // return   : boolean
    //
    // description:  
    // determines and executes previous step of the algorithm in a new
    // thread of execution.
    //
    //---------------------------------------------------------------    
d135 11a145 11    //---------------------------------------------------------------
    // method: setOutputPanel
    //
    // arguments: none
    // return   : boolean
    //
    // description:  
    // initializes the output panel. 
    // 
    //---------------------------------------------------------------
    public boolean setOutputPanel(OutputPanel out_panel_a)
d156 10a165 10    //---------------------------------------------------------------
    // method: setProcessBox
    //
    // arguments: none
    // return   : boolean
    //
    // description:  
    // initializes the process box. 
    // 
    //---------------------------------------------------------------    
d178 10a187 10    //---------------------------------------------------------------
    // method: setDataPoints
    //
    // arguments: none
    // return   : boolean
    //
    // description:  
    // initializes the data points. 
    // 
    //---------------------------------------------------------------
d199 10a208 10    //---------------------------------------------------------------
    // method: computeMeans
    //
    // arguments: none
    // return   : none
    //
    // description:  
    // computes the means for each existing data set 
    // 
    //---------------------------------------------------------------
d334 11a344 11    //---------------------------------------------------------------
    // method: disableControl
    //
    // arguments: none
    // return   : none
    //
    // description:  
    // Disables the next and previous keys before beggining to execute
    // a step.
    //
    //---------------------------------------------------------------
d351 11a361 11    //---------------------------------------------------------------
    // method: enableControl
    //
    // arguments: none
    // return   : none
    //
    // description:  
    // Enables the next and previous keys after the execution of
    // a step.
    //
    //---------------------------------------------------------------
d369 11a379 11    //---------------------------------------------------------------
    // method: run
    //
    // arguments: none
    // return   : none
    //
    // description:  
    // implementation of run from the Runnable interface.  This method
    // should be overidden by inheriting classes
    //
    //---------------------------------------------------------------
d383 11a393 11    //---------------------------------------------------------------
    // method: initialize
    //
    // arguments: none
    // return   : boolean
    //
    // description:  
    // initializes algorithm.  this method should be overidden by inheriting
    // classes
    //
    //---------------------------------------------------------------    
d396 5@1.2log@Line 90 changed. It was initially No next step. Which was confusing.@text@a91 1	    pro_box_d.appendMessages("Algorithm Complete " + "\n");
@1.1log@Initial revision@text@a85 4	// Debug
	//
	//	System.out.println(algo_id + " : nextStep()");

d92 1a92 1	    pro_box_d.appendMessage("No next step");
@

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -