>> Home for www.NOVOHEURODYNE.C0M

SPECIFICATION FOR CYBERHEURODYNE - (VIRTUAL/REPLICANT CEO++) 201801010A

By

NICK ATCHISON

ŠNick Atchison 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018. Work in progress

E-MAIL: postmaster@holomirage.com.

E-mail me if you need help understanding this.

Also See: dlxplx.com, & experplx.com/index.html

BACKGROUND:

Just as a symphony is composed of many musians each playing one instrument and the conductor is by holographic extension playing all instruments at once. The sheet music being a highly compressed representation of the sound. The ZORCH operating on compressed multi-dimensional data respond holographically to the data. Wilder Turkey invented the "Jackknife" stastical method (Quenouille-Tukey jackknife.). N.J. Atchison invented the "2D-Jackknife"a.k.a. "VoDo" (3 Patents issued.). Here N.J.A presents N-Dimensional/Holographic Turing Machine processing compressed data that is able to replicate the behavior of a CEO controling and modifying a high-tech start-up.

Intent: To provide the CEO with an exact, automated checklist/runcard - hidden PFMEA friend.

(0.0.0) BECAUSE OF ITS COMPLEXITY THE REPLICANT CEO++ IS DESCRIBED IN 3 SEPARATE WEB PAGES

#1 WEB PAGE - SPECIFICATION WEB PAGE (This Web Page) AN ISO9XXX STRUCTURE DESCRIPTION - holoplx.com

A specification style (line numbered) statement of the system organisation, algorithm pseudo code and complete action listing for each of the 81 sections..

#2 WEB PAGE - ALGORITHMS/METHODS WEB PAGE - TECHNICAL FUNCTION DESCRIPTION - dlxplx.com

Articles, patents, algorithm code with functioning radio button selection algorithm examples./p>

#3 WEB PAGE - N-DIMENSIONAL TURING MACHINE WEB PAGE - USER PERFORMANCE TUTORIAL - experplx.com/index.html

Example Data Sheets for technologies, and functioning radio button selectable N-Dimensional Turing Machine examples.

A grid is formed comprised ofof each of 81 sections stage/step performance lists and corresponding 81 algorithms is composed and instantiated as a N-Dimensional Turing Machine.

*******

********

********

(0.0) TABLE OF CONTENTS WEB PAGE #1 PRIME STRUCTURAL SPECIFICATION

PART 1.0 DOCUMENTATION STRUCTURAL SPECIFICATIONS - Part 1.0 of the WEB PAGE #1.

SECTION 1.1.0 - Structural Organization of the System

1.1.1. A general description of what is the REPLICANT CEO++/COMPANY fractal constructor.

1.1.2. A general description of the methods used by REPLICANT CEO++/COMPANY fractal constructor<.

1.1.3. A general description of what can be done by the REPLICANT CEO++/COMPANY fractal constructor .

SECTION 1.2.0 - Structural Organization of the Algorithms used by REPLICANT CEO++'s constructor

1.2.1. A general description of what are the REPLICANT CEO++'s 81 algorithm tool set groups.

1.2.2. A general description of what each of the REPLICANT CEO++'s algorithms in each tool sets does.

1.2.2.1. Limited to IYM++ Data Analysis tool set in this DEMO WEB PAGE.

1.2.3. A general description of REPLICANT CEO++'s each 81 groups of algorithms combined action.

1.2.3.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

SECTION 1.3.0 - Structure of the N-Dimensional Turing Machine

1.3.1. A general description of the REPLICANT CEO++ N-Dimensional Turing Machine + fractal constructor.

1.3.2. A general description of how the REPLICANT CEO++ N-Dimensional Turing Machine works.

1.3.3. A general description of what the REPLICANT CEO++ N-Dimensional Turing Machine's does.

1.3.3.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

*******

********

********

PART 2.0 ALGORITHMS/METHODS PSEUDO CODE DESCRIPTIONS - Part 2.0 ofthe WEB PAGE you are working with now.

SECTION 2.1.0 - Algorithms of System Constructor

2.1.1. A pseuedo code task description of what the REPLICANT CEO++ 81 algorithms tool sets do.

2.1.1.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

2.1.2. A pseuedo code task description of each of the REPLICANT CEO++ algorithms in the 81 algorithm tool sets.

2.1.2.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

2.1.3. A pseuedo code task description of REPLICANT CEO++ swarm/flock of algorithms resultant combined action.

2.1.3.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

SECTION 2.2.0 - Algorithms of 1 to 81 Task Groups

2.2.1. The specification for the demo of the REPLICANT CEO++ 81 algorithms tool sets.

2.2.2. The specification for the demo of the REPLICANT CEO++ algorithms in the 81 algorithm tool sets.

2.2.3. The specification for the demo of the REPLICANT CEO++ swarm/flock of algorithms resultant combined action.

SECTION 2.3.0 - Algorithms of N-Dimensional Turing Machine

2.3.1. The specification for the demo of the REPLICANT CEO++ N-Dimensional Turing Machine data base.

2.3.2. The specification for the demo of the REPLICANT CEO++ N-Dimensional Turing Machine.

2.3.2.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

2.3.3. The specification for the demo of the REPLICANT CEO++ N-Dimensional Turing Machine's results.

2.3.3.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

*******

********

********

PART 3.0 N-DIMENSIONAL TURING MACHINE (REPLICANT CEO++ ) Part 3.0 of the WEB PAGE you are working with now.

The Portal (Data Base) Structure (The structure of the DB is the plan)

SECTION 3.1.0 - Structure of the System

3.1.1. A general description of what the REPLICANT CEO++ tool is.

3.1.2. A general description of the methods used by REPLICANT CEO++.

3.1.3. A general description of REPLICANT CEO++ can do.

SECTION 3.2.0 - Structure of the Algorithms

3.2.1. A general description of what the REPLICANT CEO++ 81 algorithms tool sets.

3.2.1.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

3.2.2. A general description of what the REPLICANT CEO++ each of the algorithms in the 81 algorithm tool sets does.

3.2.2.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

3.2.3. A general description of REPLICANT CEO++ swarm/flock of algorithms resultant combined action.

3.2.3.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

SECTION 3.3.0 - Specification/Tutorial for use of of the N-Dimensional Turing Machine< based Replicant CEO++.

3.3.1. A general description of what the REPLICANT CEO++ N-Dimensional Turing Machine is.

3.3.2. A general description of what the REPLICANT CEO++ N-Dimensional Turing Machine does - how to run it.

3.3.3. A general description of REPLICANT CEO++ N-Dimensional Turing Machine's results - how to use it.

3.3.3.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

HOLO1 MEET THE BOSS

HOLO2 MEET THE TOP VP

HOLO3 MEET THE TOP DIRECTOR

N-DIMENSIONAL TURING MACHINE HEART BEAT SIMULATION

PREVIEW OF SECTION 1.1.0.0

SECTION 1.1.0 - Structural Organization of the System

1.1.0.1 Just as in "real life" the CEO is the CORE of the company.

1.1.0.2 Just as in "real life" the Captain is the CORE of the ship.

1.1.0.3 No Captain = no ship & only 1 Captain at a time.

1.1.0.4 Most ships sail for years. 3 out of 4 Start-ups sink in 3.

1.1.0.4.1 Start-ups fail due to low resolution planning.

1.1.0.4.1.1 A 100 step Gant chart of a 1000 step build - REZ 100/1000 = NJA of.1

1.1.0.5 The % chance of a project success (ATC) is 100 * NJA.

1.1.0.5.1 In the example, REZ 100/1000 = NJA .1 = ATC 10%.

1.1.0.6 REPLECANT CEO++ gives the CEO a project plan with REZ 1000/1000 NJA = 1 ATC = 100%

1.1.1. A general description of what is the REPLICANT CEO++/COMPANY fractal constructor.

1.1.2. A general description of the methods used by REPLICANT CEO++/COMPANY fractal constructor<.

1.1.3. A general description of what can be done by the REPLICANT CEO++/COMPANY fractal constructor .

SECTION 1.2.0 - Structural Organization of the Algorithms used by REPLICANT CEO++'s constructor

1.2.1. A general description of what are the REPLICANT CEO++'s 81 algorithm tool set groups.

1.2.2. A general description of what each of the REPLICANT CEO++'s algorithms in each tool sets does.

1.2.2.1. Limited to IYM++ Data Analysis tool set in this DEMO WEB PAGE.

1.2.3. A general description of REPLICANT CEO++'s each 81 groups of algorithms combined action.

1.2.3.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

SECTION 1.3.0 - Structure of the N-Dimensional Turing Machine

1.3.1. A general description of the REPLICANT CEO++ N-Dimensional Turing Machine + fractal constructor.

1.3.2. A general description of how the REPLICANT CEO++ N-Dimensional Turing Machine works.

1.3.3. A general description of what the REPLICANT CEO++ N-Dimensional Turing Machine's does.

1.3.3.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

*******************************************************

*******************************************************

*******************************************************

(1.0.0.0) TITLE/SPECIFICATION OF STRUCTURE/STATEMENT OF WORK:

27XYZ First Sketch - circa 1980

DEFINITION OF TERMS

(0.0.0) The "Structural" 1/3 part of the documentation describing the "Structure", "Function", & "Performance of a "NOVOHEURODYNE"

(0.0.1) Definition: "OrthoHeurodyne" = a conscious entity that waits then reacts.

(0.0.2) Definition: "MetaHeurodyne" = a conscious entity that looks for trouble & reacts.

(0.0.3) Definition: "ParaHeurodyne" = a conscious entity that evaluates & modifies its behavior.

(0.0.4) Definition: "NovoHeurodyne" = a multi-core simultaneous Ortho/Meta/Para Heurodyne.

(0.0.5) Definition: "CyberHeurodyne" = a possibly non-conscious NovoHeurodyne that perfectly simulates a conscious NovoHeurodyne.

(0.0.5.1) Definition: "CyberHeurodyne" = a possibly non-concious NovoHeurodyne that is also known as a "Cyber Zombie".

(0.0.6) Definition: "CyberHeurodyne(X)" = a CyberHeurodyne that is limited to be a specific "Type" of human. e.g. VIRTUAL CEO++.

1.0.1 ABSTRACT OF CYBERHEURODYNE - VIRTUAL CEO++

Abstract

WARNING -WARNING - WARNING - WARNING :

This document DESCRIBES a "CYBER ZOMBIE" - acts like a human but is non-self modifying. Remember, "All complex programs are always capable mindlessly of doing much more than they were intended to do." In the maximum "SELF MODIFYING form (NOT USED HERE) the program is not predictable. The basic "pseudo conscious" implementation of the program is described/specified BUT NOT USED here. The "pseudo conscious" program runs on a neural CPLD utilizing MRAM technology and configured to be a POLY FORTH engine processing information directly as cosine transforms. WARNING! In this "pseudo conscious" configuration the program can and does dynamically reconfigure itself just the way "real world" data driven companies do - by using the descent Taguchi and evaluation testing. This "pseudo conscious" extension of the experiment is what Musk and Gates warned of and should only be implemented in experimental areas that are off line, radio secure, screen rooms with 24 hr. monitoring. The Atchison rule: "Ultra self modifying pseudo conscious capable artificial intelligence programs should only be run for specific periods of time them shut down and evaluated - never left free running." Remember, "All complex programs are always capable of doing much more than they were intended to do.", SO -ERGO- you never know what a complex program will do. REf: Godell's proof - "More things are true than can be proven to be true." !!!

1.0.2 Background: In tribal organizations most males know the same techniques any other male does. Like wise most females in tribal organizations know the same techniques any other female knows. (Think of the tribe/village as a baby factory.) In static tribal situations people can almost endlessly do the same enactment over and over - like wildebeests in their cycle of endless migrations. The shaman/priest/astrologer were the exception to this rule. As buildings became more complex another specialized group emerged - the professional builder/engineer. The first industrial revolution was enabled by the use of wind and water powered mechanisms to supplement human work triggered by a radical decline in population in Europe and the emergence of engineering innovations. Previously untapped energy sources enhanced production efficiency and higher production yield which in turn allowed for greater cultural complexity. It was a snowball of learning causing more learning. The second industrial revolution was triggered by the emergence of increased organization, mechanization of production enabled by enhanced tool making capability and the use of fossil fuels. Increased mechanization put a premium on simplification of individual tasks and well documented procedures related to complex manufacturing equipment and processes which led to graphical representation and statistical analysis and the rise of the engineering class. The third industrial revolution was enabled by the development of cheap information processing equipment which allowed for computer simulation and expert systems to relieve engineering complexity via automated documentation, concurrent graphic/statistical analysis and multi-agent virtual world wide automation. The fourth industrial revolution now in progress will completely automate management, planning and analysis because computers are more capable than humans at these defined, repetitive tasks. This will place a premium on the application of super-computers and self evaluating multi-agent cybernetic systems to automate complex operations such as New Product Introduction. The pseudo self aware Turing machine storyboad presented here is able to adjust specifications based on complex pattern analysis which is beyond human capability - imagine doing a full body multi slice CAT scan data conversion to full color 3D animations by hand or to replicate the action of a large multilayer DSP Chip auto router by hand. I have written expert A.I. E-test back extrapolates that pinpoint process variations that cause E-test variations leading to micro-chip device failure The program was totally accurate and well beyond the capability of any but experienced Sr. Staff Device Engineers.

1.0.3 Basis The ~1000 semiconductor Fabless design companies have essentially the same deep tectonic structure, function and performance. The main differences between the different companies can be boiled down to basic differences in their product data sheets. While starting up an offshore semiconductor FAB I reduced all Wafer FAB machine operations to a one page checklist which the operators were trained to implement. In 2 Years of operation there were zero errors.

1.0.4 Intent: Make a virtual high technology start up simulator which uses the Product Data Sheet as the seed document. Once a boiler plate product data sheet is personalized, computer algorithms systematically convert the data sheet into a "Turing machine/story board" like intelligent hyper storyboard which exactly describes the documentation and actions needed to convert the data sheet into physical parts for sale. The hyper storyboard planning simulator is an automated progress monitoring tool capable of self evaluation and performance diagnostics. It generates all reports, formulates yield prediction and provides expert change advice free from human intervention at the management level. The seed turns into a TURING MACHINE STRUCTURE with SELF ACTIVATING FUNCTIONS capable of the PERFORMANCE described by the base datasheet. The STRUCTURE is like an opera house with all of the performers, costumes and instruments. The FUNCTION is like the sheet music. The PERFORMANCE is like an individual execution of a performance - including evaluation.

1.0.5 THEORY: A DNA like Spreadsheet "Seed" convolves into a modular company structure - a vertical step by step listing of stages with a lateral cellular sequence of main and support actions to be performed at each step. Inherent capabilities of each module's associated cells are configured with algorithms that provide the sequential implementation of the functional capability of each cell of each stage of the Turing -storyboard structure. The sequential instantiation of actions of the cells creates an instantiation of prime data sheet "seed" that initiates the conversion of an idea into a physical product. The Tectonic prime model contained in the seed spreadsheet provides a Template which produces a Structure that is an Interconnected Documentation System, a Functional that Programs and Hyper Story Board Matrix/datasheet. The seed to configures and operates a startup management system from a library of operational modules and algorithms. Here the start up of the design company is considered to be part of the flow because in start-ups the two functions overlap. FRACTAL TAXONOMIC METHODS

(1.1.0) SPECIFICATION FOR COMPANY STRUCTURE

SECTION 1.1.0 - REORGANIZING TO FIT THIS SCHEMA Structural Organization of the System > 1.1.1. A general description of what is the REPLICANT CEO++/COMPANY fractal constructor.

1.1.2. A general description of the methods used by REPLICANT CEO++/COMPANY fractal constructor<.

1.1.3. A general description of what can be done by the REPLICANT CEO++/COMPANY fractal constructor .

INTRO - Fractal/Modular Organizational Structure provides a congruent, hierarchical company organization based on repeating cycles within cycles of structure-function-content - occurring over defined. sequential stages of time. (Structures organize to perform new, functional capabilities which then emerge as new content/"performances occurring over sequential stages.")

1.1.1 The Core/Base company is comprised of 6 levels of control. #1 level is CEO (1-1). #2 level is VP's (2-1) (2-2) & (2-3). The third level is the Director level (3-1) to (3-9). The #4 level is the Manager level (4-1) to (4-27). The #5 level is the Section Level (5-1) to (5-81). At the Section Level an X,Y, Z grid (Array) is created with thx X-Axis being the step by step plan for the task, the Y-Axis being the tasks/algorithms to be performed at each step and the Z-Axis being the record of the performance of each activity. The #6 level is the level of the N-dimensional Turing Machine where multiple pseudo/quasi-conscious ALU's called "ZORCH" activate the dynamic. (A "ZORCH" is a free running program in UNIX systems that act like white blood cells in the human body.)

It is important to realize that the "Plan", "Build/Test" & "Report" lists make up the 3 axises of a 3 dimensional spread sheet that is like a complex story board describing the activity of one task group of the 81 required to model/run the virtual company. Realize that just the specifications for new product introduction is an uncontrollable stack of paper approximately 18' high. All this and much more is condensed into into a format that is easy to comprehend and control. :

1.1.1.1 An evenly branching explicit organizational structure is the simplest, low entropy method to (1) model, (2) control, and (3) monitor the organization of fabless semiconductor companies. This structure is based on a general, generative structure that is inherent to all fabless startups. The organization of the departmental sequence is ordered by the sequence in which the activities of the department are required by a new product introduction. This evenly branching structure is reflected in a congruent company data base, specification numbering system, product numbers, manufacturing numbering system and sale order tracking number system.

1.1.1.2 This systems analysis start with the CEO then breaks all work into 3 basic activities (directorates 1,2 7 3) with 3 basic responsibilities each ( departments 1 to 9). The 9 departments branch into 27 sections and 81 tasks. [By expanding the system in an evenly branching structure based on "3" the structure becomes a self propagating mnemonic device that allows easy memorization of the whole structure - like rhyming or the Periodic Table Of Elements.]

(2-1) Innovation — (3-1)Organizing, (3-2)Funding & (3-3)Predicting

(2-2) Development — (3-4)Developing, (3-5)Designing & (3-6)Instantiating

(2-3) Implementation — (3-7)Building, (3-8)Reliability & (3-9)Selling

** :

(3-7)Building has 3 sections (4-19) Mask Fab, (4-20) Wafer Fab & (4-21)Assembly

** :

(4-19) Mask Fab has 3 Tasks (5-55) Plan, (5-56) Build, & (5-57) Test.

(4-20) Wafer Fab has 3 Tasks Plan (5-58), Build (5-59), & (5-60)Test.

(4-21) Package Fab has 3 Tasks Plan (5-61 ), Build (5-62 ), & Test (5-63 ).

In this partial specification we will be looking at task 63 (5-63). The Integrated Yield Management Tool Set. :

1.1.1.3 Each of the 3 sections has three sections each (Planning, Executing & Testing). This means there are 27 sections. Each of the sections has three basic responsibilities (Planning, Executing & Testing) that may require an extensive number of tasks.

*******************************************************

NEEDS RE-NUMBERING

II. (1.1.1.4) General Specification for CyberHeuroDyne Constructor

(1.1.2.1.0) A simple description of the conversion/expansion of a product data sheet into a company/product plan.

(1.1.2.1.1) The Prime-1 Constructor Algorithm is contained in the Data Sheet/Template as a "USE..." multiple choice command which selects an expansion method from a group of possible expansion methods. The Prime-2 Constructor Algorithm is contained in the Data Sheet/Template as a "Algorithm Library..." multiple choice command. The Prime-3 Constructor Algorithm is contained in the Data Sheet as a "USE N-Dimensional Turing Machine-X ..." multiple choice command

(1.1.2.2.2) Standard Corporate Algorithms

(1.1.2.2.3) II-B Standard Finance Algorithms

(1.1.2.2.4) II-C Standard Design Algorithms

(1.1.2.2.5) II-D Standard Analytical Algorithms ( DEMO OF IYM ANALYTICAL TOOLS NOW ON LINE)

Dynamically Increasing Complexity

Click on the following URL to see a preliminary paper:

Fractal Specification Systems

Click on the following URL to see a preliminary paper on fractal specification structure and taxonomy:

The specification system describes a set of modular, evenly branching functions as the simplest, low entropy method to model, control, and monitor the function and specification of fabless semiconductor companies. Since most of the general functions of a startup are the same for all startups, it is possible to specify the general functions that are inherent to all fabless startups. A spreadsheet column listing the one company prime spec, each of the 3 group specifications, each of the 9 departmental master specifications, each of the 27 section master specifications with three each stage one specifications with 3 each stage two sub specifications and 3 three each sub-sub specifications would have 1092 rows. This spread sheet with 1092 entries would provide the master company runcard. On either side of this column would be the pre and post activities required by the operation. If the number of the Pre and Post operations average to ~10 then there are ~10,920 atomic level operations to a new product introduction spreadsheet runcard.

In fact, the 1092 steps for New Product Introduction or Semiconductor Startup are generic and the same for all companies.

It is not until the row related to each of the 1092 stages are filled in that the specifications system becomes personalized.

The personalization of the specification system is accomplished by merging the product “super” data sheet with the specification system.

Marketing proposes a product data sheet which is expanded by technology, design and product engineering. This is done by modifying a generic “super product data sheet”. The generic super data sheet has an entry for each of the 1092 functions that specify all particular restrictions and requirements related to a given product. Note that the all testing and qualification and reliability plan requirements are listed in the super data sheet. Note that the specification system is created by a generative fractal program. This insures the specification base hyper-deck is consistent, congruent and error free.

The specification system is based on an Excel spreadsheet format, it easily becomes the basis of a cybernetic runcard that specifies and tracks the performance of activities. Specifications point at (refer to) the specifications above it is the specification hierarchy.

The basic structure of any specification is as follows:

Title:

Number/ Data Base Location — Spec# 000-000-REV

Purpose: Group Requirements Statement — Spec# X00-000-REV

Scope: Department Requirements Statement — Spec# XY0-000-REV

Responsibility: Section Verification Requirements Statement — Spec# XYZ-000-REV

Method: Primary Function Specification - Spec# XYZ-A00-REV

Procedure: Secondary Function Specification - Spec# XYZ-AB0-REV

Results/Metrics: Tertiary Function specification - Spec# XYZ-000-REV

The Marketing Part Number = MK#

The Ordering Part Number = MK# + OPTIONS # ( There is a set list of options which correlates with a given qualified manufacturing flow number.)

` The Manufacturing Part Number = MK# + OPTIONS# + Index#1 (There is an index of each MK# + OPTIONS# that contains a list of all 1092 specification rev numbers in sequence. Any change in the REV number of any specification causes an update in the Index#1.

Lot Number is a 3 character base 99 Index2# that points to a list of all Vendor lot numbers Associated with the lot build, this list includes the Manufacturing Part#. This number points to all test and qualification test data. When the data is available this number is extended by 3 additional characters and contains 1 extra character for wafer and 2 extra characters for die number.

The marking number contains The Ordering Part Number and the extended Lot Number. There may also be additional numbers added to the package such as the assembly date code. The key number is the Extended Lot Number. It contains a method to reach back through all specifications and BOMs and runcards used during the construction of the part. This is extremely important to automatic performance analysis methods.

This next URL presents a simple table discussed above.

SPECIFICATION SYSTEM EXAMPLE

1.1.1.3.1 The 9 departments have 27 Sections This partial specification focuses on mainly on Department #8-EVALUATING. D8-Evaluating has 3 sections: Wafer Package and Part.D8A(S24-#72) WAFER TESTING. , D8B(S25- #73) PRODUCT TESTING & D8C(S26 - #74) RELIABILITY TESTING. This document focuses on section D8A(S25 - #73) - Wafer testing section. the IYM module ??????? Each section has three primary activities/methods and an unlimited number of algorithms. This means that section D8A(S24) WAFER TESTING has 3 activities - S24A( Activity#72 SYM - Statistical Yield Management), S24B( Activity#73 IYM - Integrated Yield Management) & S24C( Activity#74 DYM - Derivationalal Yield Management). This DEMO DOCUMENT focuses on S24B( Activity#73 IYM - Integratd Yield Management) as an example of how the system works.

Click on the following URL s to see a preliminary papers that lead up to the current topic:

This background paper proposes a hypothetical modular 10 department company structure with 10 operations that are repeated at 10 stages.

A 10X10X10 Organization Structure/Taxonomy

This background paper lists 1000 step sequence that occurs in most new product introductions that the above model organization would actually have to perform.

1000 Step Manufacturing Sequence

This paper presents an Excel spread sheet showing a model of 1 company which is comprised of 3 Groups with 3 Departments each with 3 Sections each = 27 Sections. This fractal-modular model company organization begins to merge the department classification with the activity classification system so that the overall system is a holographic organizational system.

Each NPI Operation Sequence is a linear serries of ~1000 steps that can be derived from the Master Product Data Sheet.

Sketch of 3 step Operation Sequence With Multiple Sub-Sequences

Each step is described by a specification that is computer generated.

Sketch of an Operation Node Structure

Each specification consists of a 3x3x3 array of elements.

3x3x3 27 Element Node

Each element is a form that can be logically derived from the product data sheet and general operation specifications.

3x3x3 27 Element Branch Diagram

Other representation of the Nodes

Types of Nodes

Automated Schematic Showing of an N-dimensional Holo-Triad Moving Data From Level to Level

PREVIEW OF SECTION 1.2.0.0

SECTION 1.2.0 - REORGANIZING TO FIT THIS SCHEMA Structural Organization of the Algorithms used by REPLICANT CEO++'s constructor

1.2.1. A general description of what are the REPLICANT CEO++'s 81 algorithm tool set groups.

1.2.2. A general description of what each of the REPLICANT CEO++'s algorithms in each tool sets does.

1.2.2.1. Limited to IYM++ Data Analysis tool set in this DEMO WEB PAGE.

1.2.3. A general description of REPLICANT CEO++'s each 81 groups of algorithms combined action.

1.2.3.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

3X3X3NOVOPLX 3X3X3NOVOPLX N-DIMENSIONAL TURING MACHINE

(1.2.0) SPECIFICATION (Naming & General description) FOR THE ANALYSIS METHOD/ALGORITHMS USED BY CYBERHEURODYNE - VIRTUAL CEO++

TYPES OF -YM. (XYM)

(1.2.!) SYM - S- Statisticai Yield Management (aka SPC) is the base data analysis technology.

(1.2.!) SYM - S-Lot Yield Management .

(1.2.!) SYM - S-Parametric Yield Management .

(1.2.!) SYM - S-P/F Limit Yield Management .

(1.2.!) SYM - S-Die Yield Management .

(1.2.!) SYM - S-Wafer Yield Management .

(1.2.!) SYM - S-Lot Yield Management .

(1.2.!) SYM - S-Design Yield Management .

(1.2.!) SYM - S-Equipment Yield Management .

(1.2.!) IYM - I-Statisticai Yield Management (aka SPC) is the base data analysis technology.

(1.2.!) IYM - I-Lot Yield Management .

(1.2.!) IYM - I-Parametric Yield Management .

(1.2.!) IYM - I-P/F Limit Yield Management .

(1.2.!) IYM - I-Die Yield Management .

(1.2.!) IYM - I-Wafer Yield Management .

(1.2.!) IYM - I-Lot Yield Management .

(1.2.!) IYM - I-Design Yield Management .

(1.2.!) IYM - I-Equipment Yield Management .

(1.2.!) DYM - D-Statisticai Yield Management (aka SPC) is the base data analysis technology.

(1.2.!) DYM - D-Lot Yield Management .

(1.2.!) DYM - D-Parametric Yield Management .

(1.2.!) DYM - D-P/F Limit Yield Management .

(1.2.!) DYM - D-Die Yield Management .

(1.2.!) DYM - D-Wafer Yield Management .

(1.2.!) DYM - D-Lot Yield Management .

(1.2.!) DYM - D-Design Yield Management .

(1.2.!) DYM - D-Equipment Yield Management .

(1.2.!) ZYM - A-Statisticai Yield Management (aka AYM) data analysis BASED ON WAFER ZONES .

(1.2.!) TYM - T-Statisticai Yield Management (aka SPC) data analysis based on TIME/PLACE.

(1.2.!) UYM - D-Statisticai Yield Management (aka SPC) analysis based on USER analysis.

(1.2.1) The original IYM Triangle — Figure 1 - was developed by Nick Atchison and Ron Ross as a teaching tool to present a schematic representation of the data analysis techniques that were in use at the time, ~1996. The diagram was used to organize a hierarchy of analytical procedures capable of predicting the FAB yield and performing root cause analysis of process and design problems.

(1.2.1.1) The 6 Triangle Stack (STS)

To correct limitations of the IYM Triangle, a schematic diagram of yield analysis consisting of a stack of identical, repeating analysis diagrams was developed. Before the stack of diagrams could be made, a simple yet general analysis method that could be used at all levels had to be developed. The elements of the analysis had to be hierarchically arranged so that analysis would move sequentially from the top general level to bottom root-cause level.

(1.2.2) The N-Dimentional, Holographic Analysis of Yield Variation and Cause

To correct limitations of the ???STS??? Triangle, a schematic diagram of yield analysis consisting of a stack of identical, repeating analysis diagrams that corresponds to the “atomic” production flow chart was developed. Before the stack of diagrams could be made, a revised simple yet general analysis method that could be used at all levels had to be developed. The elements of the analysis had to be hierarchically arranged so that analysis would — at each step of the flow chart — be able to move sequentially from the top general level to bottom root-cause level.

(1.2.3) Non-Systematic Data Analysis Tools:

( ???BACKGROUND FOR NON-SYSTEM to be reached via URL )

Non Systematic data analysis tools Such as SPC charts are in common use. Alarms occur after the fact of a single measurement value excursion or tendency is detected. Standard procedures will not be discussed here. In Appendix I there is a list of articles and example programs related to non-systematic yield analysis

(1.2.4) Systematic Yield Management Tools:

( ???BACKGROUND FOR SYSTEM SYSTEMATIC to be reached via URL )

In the semiconductor industry today it is common to use off the shelf commercial data analysis and new product introduction packages which can cost over a million dollars a year to support. The articles presented in this web page provide access to some of the enabling statistical techniques on which the commercial tools are based. The tools can be programmed and maintained by the individual engineer. Many of the tools can be used with EXCEL. Before going into the actual data analysis methods, it is first important to understand the fundamental structure of Systematic Yield Management as a comprehensive analytical system. Next is a discussion of spatial, Temporal and Relational Yield Tools

(1.2.5) Spatial Yield Tools:

There are actually a wide range of spatial yield tools such as die map, stepper field map, wafer map, boat map, etc.The next picture shows a wafer zone analysis plot. I developed this method after reviewing 4,000 wafer maps from one product line. The original analysis method used EXCEL spread sheets. In later renditions I converted the analysis to RS1, C and C++. The yield of each machine in FAB and Test were monitored by zone. This was done because the different machines in FAB tend to have lower yields in specific regions of the wafer. Taking a simple average of the data values by wafer will decrease the accuracy of the analysis. Most FAB data analysis tools now do this kind of analysis automatically.


(1.2.6) WAFER ZONE MAP

This is a wafer map that compares two values to each other in wafer space.

(1.2.6) This could be a comparison of one wafer sort value to another or an E-test value vs. a Wafer Sort value. When this type of plot is used with more complex where an e-test value is plotted against a wafer sort value and against a post burn-in leakage test the basis for whole system holistic data analysis is developed.

(1.2.7) Temporal Yield Tools:

Yield as a function of time. ( Quad Plot To Be Added. ) Although the Quad Plot contains four different plots of which only one plots results with a time X axis, they all actually occurrences that are time Dependant.

(1.2.8) Relational Yield Tools:

Note that each element of the production flow char is reviewed and classified as to the type (occurrence pattern) of faults they can cause. In this case the relationship between the values observed in terms of there distribution — their relation to one another. Different equipment units or processes can create different types of distributions.

(1.2.9) The review of the type of occurrence pattern observed begins to focus on possible causes.

(1.2.10) Chart #1 Diagrammatic Analysis of distribution Types


(1.2.11) Chart #2 Weighted Fish Diagram Classifying Problem Affect by Distribution Effect


(1.2.12) Chart #3 Table of Diagrammatic Analysis Results

1) Initial Bond Strength

Process Settings Governed by specification — would cause problems to the whole lot

Polyimide trapping Not seen as a problem at ASE incoming inspect

Pad Metal Damage Under process control — all die processed pass incoming inspect

Contamination Under process control — all die processed pass incoming inspect

2) Reduction of Bond Strength

Glue On BP Before Bonding Under process control — all die processed pass incoming inspect

High Dt during Assembly DOE testing shows that this is not a problem

Glue Polymer on BP Under process control — all die processed pass incoming inspect

Purple Plague DOE testing shows that this is not a problem

3) Increased Snap Forces

Over Temp @ B.I. Under process control — all die processed pass outgoing inspect

Package Warping Checked a failing package — was not warped

MSL 3/5 Con B/C Checked several failing lots

Assembly Damage Causes gross leakage

4) Freak Catastrophes

Probe Pad Cratering Fail rate is independent of the number of probes

Glue Touches Ball Bond Proven to be capable of being a cause that is occurring at this time

Glue Touches Bond Wire Proven to be capable of being a cause that is occurring at this time

Glue/Die Edge Over Flow Proven to be capable of being a cause that is occurring at this time

(1.2.13) Systematic Yield Methodology: (SYM)

(1.2.13.1) The basic analytical procedure that underlies all SYM??? methods is an everything to everything comparison program using that originally used the RS1 language which was known as “V0D0”. In the early RS1 format, analysis took 6 days to run and brought the Engineering Alpha VAX work schedule to a standstill. I rewrote the program in C using 3 level pointer math and the run time dropped to 6 seconds. Once this tool was up and running, many complex SYM tools were developed including Product Wafer Sort Yield Sensitivity to E-test Parameter Value Analysis. This tool became known as Product Sensitivity Analysis — PSA. TI licensed PSA to DataPower which was bought out by PDF Solutions. The first complex WEB based version of V0D0 used a web page as the GUI which called CGI tools to activate Unix shell programs which in turn called the C code. The graphic output of this system was accomplished when the C code finished the data table and returned control the the Unix shell program which then called a PERL program using a GD graphics module to generate and return the graphs to the users web page.

The image below is a screen shot of a graphic output developed using “G” a public domain 3D Stereo graphic language I developed with H. Wolderidge, which uses a PC compatible version of Cal Tech Intermediate Format (CIF )language. G will be presented later in the appendix.


(1.2.13) PSA - Stochastic Graphical Analysis Using “G”

(1.2.14) Articles related to Systematic Semiconductor Data Mining Methods:

(1.2.15) Zone Analysis

Required Yield Analysis Results

(1.2,16) Test Based Product Sensitivity Analysis and its Physical Verification

(1.2.17) A New Method for Comprehensive Analysis of Wafer Sort BIN Variance -YBIN

(1.2.18) Yield Modeling Calculations

(1.2.19) The Utility of the new a Critical Area Analysis of Wafer Probe Yield Analysis and DPPM Reduction

(1.2.20) Patents related to Systematic Semiconductor Data Mining Algorithms:

(1.2.21) Patented Systematic Data Mining Algorithms

Patented by Nick Atchison and Nick Atchison & Ron Ross or Nick Atchison. You can use the CROSS-REFERENCES TO RELATED APPLICATONS and Referenced By sections of the patents to locate other related patents by other individuals.

(1.2.22) Holographic Yield Management Tools:

( ???BACKGROUND HOLOGRAPHIC ...to be reached via URL )

HYM is the next step up from Systematic Yield Analysis (SYM). This set of tools moves beyond the Systematic Yield Methodology (SYM) in that it does not simply compare two or three variables at once. HYM looks at new product development as an integrated whole. The IYM Triangle is the first attempt to diagram the analytical process as a whole. It presents a hierarchical schematic of FAB/E-Test/W-Sort data and related analysis methods.

(1.2.23) A clear understanding of the IYM Triangle is necessary because the choice of the analytical sequence used to find the root cause of a given problem is not simple and varies according to type of problem. Very often, the power of the tools can and do overwhelm the non-expert user. On the other hand, an expert yield analyst can do the required extractions and analyzes using a simple SQL data base or — in the case of a start-up - file based system. In fact, all of 42 basic analytical methods now in commercial and home grown data analysis packages that were developed by expert data analysts working for major semiconductor companies. The commercial data analysis package vendors have pulled the diverse methods used by the experts together into more accessible and usable tools.

(1.2.24) In-Line Statistical Process Control gathers the data used at the bottom of the IYM Triangle. At each tier of the IYM Triangle more data are added. This means that data from each operation can be analyzed laterally (within tier) and vertically (tier to tier) during root cause analysis. Non-Systematic Statistical Process Control looks at data at each operation. Systematic Yield Analysis looks for correlations between within tier and tier to tier data. Holographic Yield Analysis uses Hypergraphic methods to look at all cross correlations as holistic phenomena. The IYM Triangle provides a schematic for top down diagnoses of the root cause of a yield problem.

(1.2.25) The IYM Triangle

(1.2.25.1) The original IYM Triangle — Figure 1 - was developed by Nick Atchison and Ron Ross as a teaching tool to present a schematic representation of the data analysis techniques that were in use at the time, ~1996. The diagram was used to organize a hierarchy of analytical procedures capable of predicting the FAB yield and performing root cause analysis of process and design problems. Note that the IYM Triangle is a essentially a binomial hierarchy

Explanation of the IYM Triangle

(1.2.26) The 6 Triangle Stack

(1.2,26.1) To correct limitations of the IYM, a schematic diagram of yield analysis consisting of a stack of identical, repeating analysis diagrams was developed. Before the stack of diagrams could be made, a simple yet general analysis method that could be used at all levels had to be developed. The elements of the analysis had to be hierarchically arranged so that analysis would move sequentially from the top general level to bottom root-cause level. Figure 2 shows the Six Stack Analytic Triangle that was developed to eliminate the limitations of the IYM method.

(1.2.27) A new systematic root cause analysis method has been developed at that has proved to be instrumental in finding the root cause of low yield at package test, assembly, wafer sort, E-test and all FAB process stages. In this paper, simple six level diagram is presented and compared to the older single triangle IYM Triangle diagram to explain the enhancements related to the new stacked triangle method. The sequence of operations described in the hierarchical structure of the 6 level schematic diagram describes a sequential analytical method that limits the number of analysis that need to be done. By working through the levels correctly, only the critical analyses are done.






(1.2.27.1) Advanced DERIVATIONAL ALGORITHMS / Holographic Yield Prism (HYP) Tool:

( ???BACKGROUND FOR ADVANCED {{{DERIVATIONAL)))HOLOGRAPHIC to be reached via URL )

To correct limitations of the of previous schematic diagrams of yield analysis, a new schematic consisting of a stack of identical, repeating analysis diagrams was developed. Before the stack of diagrams could be made, a simple yet general analysis method that could be used at all levels had to be developed. The elements of the analysis had to be hierarchically arranged so that analysis would move sequentially from the top general level to bottom root-cause level. This diagram is called the Holographic Yield Prism (HYP). The HYP is needed to represent the more complex temporal spatial and conditional relationships of the entire manufacturing flow. HYP is also known as “Derivational Yield Analysis”

(1.2.28) Note that the HYP is a trinomial hierarchy. The HYP tool set includes extensive use of “Hyper Graphics”. Hyper Graphics are graphs with many axes that show the relationship between Spatial, Temporal and Relational data in one graph. A unique set of analytical tools is used to prepare the graphs that perform calculations using “Compressed Data”.

(1.?.?) HolographicYieldSum

(1.?.?) HolographicYieldCat

(1.?.?) HolographicYieldRot

(1.?.?) HolographicYieldEmr

(1.?.?) Standard Turin Storyboard Algorithms

(1.2.29) — Automated Multiagent AI

(1.2.29.1) Planning

(1.2.29.2) Monitoring

(1.2.29.3) Analysis Methods

CHECK POINT xxx

PREVIEW OF SECTION 1.3.0.0

SECTION 1.3.0 - REORGANIZING TO FIT THIS SCHEMA Structure of the N-Dimensional Turing Machine

1.3.1. A general description of the REPLICANT CEO++ N-Dimensional Turing Machine + fractal constructor.

1.3.2. A general description of how the REPLICANT CEO++ N-Dimensional Turing Machine works.

1.3.3. A general description of what the REPLICANT CEO++ N-Dimensional Turing Machine's does.

1.3.3.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

HOLOPLX The nearly invisible 2D glass teapot in 3D is a representation of a HOLOPLEX. A N-Dimensional Turing Maching traveling along the 3D surface of the 3D teapot reading 3D instructions is a metaphor for a N-Dimensional Turing Machine. My thesis "The Cybernetics of Mind" aka "The Cultural Relativity of Reality" hypothesized a bio-holograpic mind based on the immune system's stereo-specific chemical memory and proposed a model/emulation of this using an electrical holographic memory. At Cypress Semiconductor as Manager of the CPLD (Complex Programmable Logic Device) Department I was asked to design a MR ( Magneto Restive) CPLD. I did this and applied for patents. Upgrading to wafer scale "Sea Of Gates" and "Radio ID Tag" technology allowed the formulation of devices that could communicate directly using Cosine Transform (.jtag) data.

(1.3.0) Automated Multi-agent NPI Planning, Performance Monitoring and Data Analysis System Specification, and explanatory Articles USED BY CYBERHEURODYNE - VIRTUAL CEO++

(1.3.0) Automated Multiagent NPI Planning, Performance Monitoring and Data Analysis System Specification, and explanatory Articles

(1.3.0.1) SPECIFICATION FOR N-DIMENSIONAL TURING MACHINE STORYBOARD - PROCEDURE/PERFORMANCE/RESULTS:

(1.3.1)Definitive specification of actions the user to perform is to perform and expected performance of the system

(1.3.2) SPECIFICATION METHODS/ALGORITHMS:

(1.3.2.1) A first "constructor" algorithm specified by the data sheet converts data sheet parameters to ISO9### specifications (this document in a individuated form) that delineates an exact step by step implementation plan with each step on the X-axis and all required support actions delineated in cells on the Y-axis. A second "constructor" algorithm extracts from an algorithm library the "worker" algorithms needed by the support cells to perform the action of each cell. A third "constructor" algorithm called by the data sheet then merges the "worker" algorithms related to each cell of the spread sheet into a Turing machine/storyboard capable of initiating a real-world, physical start-up. This is a fully automatic company design, personnel selection, progress monitoring, marketing planning, design monitoring, vendor selection, yield analysis, sales planning, inventory control and P&L reporting tool.

(1.3.2.2) The CYBERHEURODINE PRIME CONSTRUCTOR ALGORITHMS SPECIFICATIONS automatically expands a new product data sheet into 81 separate task modules each with a specific task list. Each task list contains a step-by-step description that specify an action stage. The level of exactitued is similar to Mil. Std. Class "S" specifications used by NASA. Each item on the task list becomes a row on a spread sheet. All requirements for the step are described in the cells of each spreadsheet row. Each type of action is assigned to a specific column of the spreadsheet. This means that the spreadsheet is a grid of production steps/stages on the X-axis and actions to be performed on the Y-axis. The description in each cell is a command line/instruction that can be used equally well by either an engineer or a computer system to perform the required tasks. In the case where a machine is to perform the task, the cell contains an algorithm. Multiple Turing machine like entities/programs called "ZORCH" perform the tasks. One of the 81 modules is an SPC Module another is the Integrated Yield Management Module and yet another is the Derivational Yield Analysis Module. Spc was developed in to 70's & 80's and is widly used with public domain programs available on line. IYM (Integrated Yield Management was developed in the 80,s and 90,s mostly at Texas Instruments with Texas Instruments and Cypress Semiconductor holding major patents. Derivational Yield Management is a calculus based tool set developed in the 2010's with most of the algorithms held as trade secrets.

(1.3.2.2) Specifies Generic Company System:

(1.3.2.2) Specifies a company structure with 27 distinct Sections organized as 3 Groups which have 3 Departments each which in turn have 3 Sections each.

(1.3.2.4) Specifies functional capability of each group, department and section.

(1.3.2.5) Specifies Start-up Sequence of groups, departments and sections.

(1.3.2.6) Specifies Required Analytical Procedures

(1.3.2.7) Specifies company generator.

(1.3.2.8) Specifies analytical algorithms.

(1.3.2.9) Specifies Cyber NPI Multi-Agent system operation.

(1.3.2.10) Specifies Cyber NPI System:

(1.3.2.11) Multi-Agent NPI Specification – Lists the abstracts of the 28 patents related to the Cyber NPI System. 8

(1.3.2.12) Data Requirements.

(1.3.2.13) Results Expected. explains a company organization starting with 3 Groups which have 3 Departments each which in turn have 3 Sections each. The company has a total to 27 sections.

HOLOM1 MEET THE ALGORITHMS

PREVIEW OF SECTION 2.0.0.0

PART 2.0 ALGORITHMS/METHODS PSEUDO CODE DESCRIPTIONS - Part 2.0 ofthe WEB PAGE you are working with now.

SECTION 2.1.0 - Algorithms of System Constructor

2.1.1. A pseuedo code task description of what the REPLICANT CEO++ 81 algorithms tool sets do.

2.1.1.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

2.1.2. A pseuedo code task description of each of the REPLICANT CEO++ algorithms in the 81 algorithm tool sets.

2.1.2.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

2.1.3. A pseuedo code task description of REPLICANT CEO++ swarm/flock of algorithms resultant combined action.

2.1.3.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

SECTION 2.2.0 - Algorithms of 1 to 81 Task Groups

2.2.1. The specification for the demo of the REPLICANT CEO++ 81 algorithms tool sets.

2.2.2. The specification for the demo of the REPLICANT CEO++ algorithms in the 81 algorithm tool sets.

2.2.3. The specification for the demo of the REPLICANT CEO++ swarm/flock of algorithms resultant combined action.

C

SECTION 2.3.1. The specification for the demo of the REPLICANT CEO++ N-Dimensional Turing Machine data base.

2.3.2. The specification for the demo of the REPLICANT CEO++ N-Dimensional Turing Machine.

2.3.2.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

2.3.3. The specification for the demo of the REPLICANT CEO++ N-Dimensional Turing Machine's results.

2.3.3.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

II. (2.0.0) General Specification for CyberHeuroDyne Methods (Algorithms)

SECTION 2.1.0 - Algorithms of System Constructor

2.1.1. A pseuedo code task description of what the REPLICANT CEO++ 81 algorithms tool sets do.

2.1.1.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

2.1.2. A pseuedo code task description of each of the REPLICANT CEO++ algorithms in the 81 algorithm tool sets.

2.1.2.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

2.1.3. A pseuedo code task description of REPLICANT CEO++ swarm/flock of algorithms resultant combined action.

2.1.3.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

(2.0.0.0) SPECIFICATION FOR METHOD OF MODULAR, FRACTAL ORGANIZATIONS)

(2.1.0) A simple listing of the algorithms used to convert data sheet into a company/product plan.

(2.1.1) The Prime-1 Constructor Algorithm is contained in the Data Sheet/Template as a "USE..." multiple choice command which selects an expansion method from a group of possible expansion methods. The Prime-2 Constructor Algorithm is contained in the Data Sheet/Template as a "Algorithm Library..." multiple choice command. The Prime-3 Constructor Algorithm is contained in the Data Sheet as a "USE N-Dimensional Turing Machine-X ..." multiple choice command

PREVIEW OF SECTION 2.2.0.0

SECTION 2.2.0 - Algorithms of all replicant Groups

2.2.1. The specification for the demo of the REPLICANT CEO++ 81 algorithms tool sets.

2.2.2. The specification for the demo of the REPLICANT CEO++ algorithms in the 81 algorithm tool sets.

2.2.3. The specification for the demo of the REPLICANT CEO++ swarm/flock of algorithms resultant combined action.

(2.2.1.0)1 Standard CEO Algorithms Standard Corporate Algorithms

(2.2.2.0)3 Standard V.P. Algorithms

(2.2.2.1) Innovation —

(2.2.2.2) Development —

(2.2.2.3) Implementation —

** :

(2.2.3.0)9 Standard Manager Algorithms

(3-1)Organizing, (3-2)Funding (3-3)Predicting

(3-4)Developing, (3-5)Designing (3-6)Instantiating

(3-7)Building, (3-8)Reliability (3-9)Selling

** :

(2.2.4.0)27 Standard Section Head Algorithms

(2.2.5.0)81 Standard Engineer Algorithms

(2.2.6.0) Standard ZORCH Algorithms

(2.2.2.1) II-B Standard Finance Algorithms

(2.2.4) II-C Standard Design Algorithms

(2.2.5) II-D Standard Analytical Algorithms ( DEMO OF IYM ANALYTICAL TOOLS NOW ON LINE)

(2.2.6) II-D1 Standard Yield Algorithms

(2.2.7) II-A(1) Company & NPI Simulation

(2.2.8) II-A(2) Circuit Simulation

(2.2.9) II-A(3) Manufacturing Simulation

(2.2.9.1) II-B. Advanced Systematic Analytical methods

(2.2.9.2) II-B(1) Spatial Analytical Methods

(2.2.9.3) II-B(2) Temporal Analytical Methods

(2.2.9.4) II-B(3) Conditional Analytical Methods

(2.2.9.5) II-C. Comparative N-dimensional Analytical methods

(2.2.9.6) II-C(1)   The Integrated Yield Management Triangle(IYM)

PREVIEW OF SECTION 2.3.0.0

(2.3.0) GENERAL SPECIFICATION THE METHOD( DESCRIPTION OF ALGORITHMS TO BE USED) OF MODULAR, FRACTAL ORGANIZATIONS BASED ON N-DIMENSIONAL TURING MACHINES

2.3.1. The specification for the demo of the REPLICANT CEO++ N-Dimensional Turing Machine data base.

2.3.2. The specification for the demo of the REPLICANT CEO++ N-Dimensional Turing Machine.

2.3.2.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

2.3.3. The specification for the demo of the REPLICANT CEO++ N-Dimensional Turing Machine's results.

2.3.3.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

(2.3.0.1) This segment of this METHOD/ALGORITHMS SPECIFICATION specification delineates a modular, evenly branching explicit N-DIMENSIONAL TURING MACHINE STORYBOARD as the simplest, low entropy method to initiate and monitor the performance of fabless semiconductor companies. This performance, monitoring and analysis is based on a general performance, monitoring and analysis that is inherent to all fabless startups. The monitoring and analysis methods presented are at the forefront of modern AI capability.

(2.3.0.2) Note that the product data sheet which is expanded by technology, design and operations becomes the “engineering data sheet” that is used to personalize the general specification system. The super data sheet has an entry for each of the 1092 functions that specify any particular restrictions and requirements related to a given operation. It is important to note that the modular specification of the testing is important to the modular data analysis.

(2.3.0.3) The stability of the product is reported as the deviation from the ideal performance stated in the “super product data sheet”. The average wafer FAB has over 2000 SPC data sheets derived from measurements taken on wafers that are updated hourly. The 50% of the 1000 units of equipment used to fabricate the wafer may be generating several gigabytes of information a day via their electronic chart recorders. At e-test 200 to 500 tests are performed on up to 10 sites per wafer on as many as 24 production wafers per lot. At wafer sort all die on all wafers may be tested as many as 5 times. At package test each package may be tested up to 5 times. Quality assurance and Reliability add additional complexity to the testing process and enormous amounts of data. All of the tests mentioned so far need to be cross correlated in a meaningful way. This work must be done with automated data analysis systems that can provide early warnings of subtle, aberrant changes that are indicative of pending disaster. When defects do occur, their root cause must be located and corrected quickly.

(2.3.0.3) The key to the advanced AI capability is derived from a built in “Holographic” production numbering system. In the past I have gone to great lengths to convert widely disparate numbering systems into one “tag” system that allowed me to program data analysis routines using “C” pointer math. This essentially like machine language — the fastest way to do things on a computer. The manufacturing numbering system and customer ordering numbering system is based on and congruent to the modular organizational format discussed so far. The long manufacturing number is has two main parts. The first part is a specification index number of a list of the specifications and date code of each specification that was active during the fabrication of the part. The second portion of the manufacturing part number is a serial number of an index of all of the vendor part numbers applied to the manufacturing lot. For parts that have wafers and die identification, the index number is distinct for each die.

(2.3.0.4) All vendors now publish their foundry data on EXCEL data sheets that are available on the Web. Simple AWK or Perl program ingest the vendor supplied into tables that are digested by more complex data analysis programs.

(2.3.1) - Automated Virtual CEO++ Specification Generation METHOD/ALGORITHMS

(2.3.1.1) - Needs renumbering - explains needed algorithms

This paper proposes a set of modular, evenly branching functions as the simplest, low entropy method to model, control, and monitor the function and specification of fabless semiconductor companies. Since most of the general functions of a startup are the same for all startups, it is possible to specify the general functions that are inherent to all fabless startups.

Note that the product data sheet which is expanded by technology, design and product engineering becomes the “super data sheet” that is used to personalize the general specification system. The super data sheet has an entry for each of the 1092 functions that specify any particular restrictions and requirements related to a given operation. This is less complicated than it seems because the only elements required to be specified for a new product are the deviations from the standard “master super product data sheet”. This list of deviations from the standard master engineering product data sheet is called the “Instantiation Data Sheet”. A computer program first substitutes the modified sections of the Instantiation data sheet into the “super data sheet”. The program then combines the information in the modified “super data sheet” with the general specification format to yield the personalized specification system.

It is important to note that the modular specification of the testing is important to the modular data analysis.

The master document is the quality plan. It contains the list of all authorized objects, activities and reports. The Quality Plan describes the structure of the specification system, contains the basic specification format and the basic super data sheet format. The quality plan resembles this paper.

The specification system is designed to take advantage of the “Hyper-Deck” technology in which all documents can be “Hyper-Linked” to each other. The specification system is planned with this capability in mind. Because all specs contain (point at) all other specifications, the system is holographic.

The specifications are the result of a generative process in which the basic specification form is “filled out” with information from the data sheet. Because the specification are generated by the combination of a specification model and a fill out table which is in turn modified by a differences table, the specification system is considered to be a very regular and consistent and error free. Because every statement in the super data sheet is tested, the testing said to be is “congruent” to the data sheet and the test generation, optimization and reduction can be automated. Because the test generation is automated, the characterization and analysis can be automated.

The extreme congruence and modularity of product specification design, simulation, fabrication, test and analysis, all data can be directly compared. This is called an anything to anything comparator. With some effort it is possible to make an everything to everything comparator. It is functionally like a database without keys where all data is held in a giant n-dimensional flat file. Such a totally interrelated relational data base is called a holoplex.

Each specification is written like an experiment. Each of the specifications has a Title, Number Method, a Procedure, and a Results section. The method section consists of A Flow Chart of MS Project Diagram containing 3 actions. The procedure section consists of an EXCEL data sheet with the 3 actions listed in column Z and pre-actions and post-actions listed in sequence on either side of the z column. The results section consists of the reporting forms and analysis requirements. The three actions consist of verifying the preparations, performing the operation and verifying the results.

Click on the following URL to see a spreadsheet of the expansion of the number of specs related to the developmental stage of the company:

HOLOM2 MEET THE ZORCH - Note the ZORCH are each a flock of cores. Just as a symphony is composed of many musians playing one instrument each, the conductor is by holographic extension playing all instruments at once. The sheet music is a highly compressed representation of the sound. The ZORCH operating on compressed multi-dimensional data respond holographically to the data. Wilder Turkey invented the "Jackknife" stastical method (Quenouille-Tukey jackknife.). N.J. Atchison invented the "2D-Jackknife"a.k.a. "VoDo" 3 Patents issued.). Here N.J.A presents N-Dimensional/Holographic VoDo processing compressed data via an N-Dimensional Turing Machine.

*************************************************************************************************************

*******************************************************

PREVIEW OF SECTION 3.0.0.0

*******************************************************

PART 3.0 N-DIMENSIONAL TURING MACHINE (REPLICANT CEO++ ) Part 3.0 of the WEB PAGE you are working with now.

The Portal (Data Base) Structure (The structure of the DB is the plan)

SECTION 3.1.0 - Structure of the System

3.1.1. A general description of what the REPLICANT CEO++ tool is.

3.1.2. A general description of the methods used by REPLICANT CEO++.

3.1.3. A general description of REPLICANT CEO++ can do.

SECTION 3.2.0 - Structure of the Algorithms

3.2.1. A general description of what the REPLICANT CEO++ 81 algorithms tool sets.

3.2.1.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

3.2.2. A general description of what the REPLICANT CEO++ each of the algorithms in the 81 algorithm tool sets does.

3.2.2.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

3.2.3. A general description of REPLICANT CEO++ swarm/flock of algorithms resultant combined action.

3.2.3.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

SECTION 3.3.0 - Specification/Tutorial for use of of the N-Dimensional Turing Machine< based Replicant CEO++.

3.3.1. A general description of what the REPLICANT CEO++ N-Dimensional Turing Machine is.

3.3.2. A general description of what the REPLICANT CEO++ N-Dimensional Turing Machine does - how to run it.

3.3.3. A general description of REPLICANT CEO++ N-Dimensional Turing Machine's results - how to use it.

3.3.3.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

(3.0.0) SPECIFICATION OF N-DIMENSIONAL TURING VIRTUAL CEO++:

(3.0.0.0) In full automatic mode the N-DIMENSIONAL TURING VIRTUAL CEO++ runs by itself. This section explains what is going on behind the curtain and what to expect.

PREVIEW OF SECTION 3.1.0.0 style="font-size: 28pt">(3.1.0) PROCEDURE/PERFORMANCE/USER INSTRUCTIONS OF VIRTUAL CEO++:

SECTION 3.1.0 - Structure of the System

3.1.1. A general description of what the REPLICANT CEO++ tool is.

3.1.2. A general description of the methods used by REPLICANT CEO++.

3.1.3. A general description of REPLICANT CEO++ can do.

(3.1.0.1) SPECIFICATION OF THE ACTUAL PROCEDURE TO COMBINE PREVIOUSLY SPECIFIED ALGORITHMS INTO THE PREVIOUSLY SPECIFIED N-DIMENSIONAL TURING MACHINE THAT IMPLEMENTS CYBERHEURODYNE - VIRTUAL CEO++

(3.0.0.3) - DOCUMENTATION FOR: Multi-Agent Turing Machine Storyboard Specification and User Instructions:

The PROCEDURE section specification describes the actual operation of the fully functional ROBO CEO The basic Idea is that there is a source of data, a spreadcheet-Turing machine where each cell performs complex operations The Poly-Turing Spreadsheet is assembled - based on the runcard form a cash/store of functional rows. New copies(runs) of existing products can be instantiated by copying the prime format of that product. The functional capability of the "Procedure/PolyTuring/Spreadsheet" is accomplished by system calls to highly defined "Methods". The classical "Method" as in Title, Method, Procedure(including analysis, results and rports) is actually maintained here. All methods are algorithms. There may be ~1,000 Methods called 30 at a time by each row of the "Procedure/PolyTuring/Spreadsheet" which is normally ~1,000 rows long.

(3.1.1) Specification for System needed for Automated Company Generator, Analytical Methods and Multi-Agent AI tool:

(3.1.2) The original IYM Triangle — Figure 1 - was developed by Nick Atchison and Ron Ross as a teaching tool to present a schematic representation of the data analysis techniques that were in use at the time, ~1996. The diagram was used to organize a hierarchy of analytical procedures capable of predicting the FAB yield and performing root cause analysis of process and design problems.

(3.2.3) The 6 Triangle Stack (STS) To correct limitations of the IYM Triangle, a schematic diagram of yield analysis consisting of a stack of identical, repeating analysis diagrams was developed. Before the stack of diagrams could be made, a simple yet general analysis method that could be used at all levels had to be developed. The elements of the analysis had to be hierarchically arranged so that analysis would move sequentially from the top general level to bottom root-cause level.

(3.1.4) The N-Dimensional, Holographic Analysis of Yield Variation and Cause To correct limitations of the STS Triangle, a schematic diagram of yield analysis consisting of a stack of identical, repeating analysis diagrams that corresponds to the “atomic” production flow chart was developed. Before the stack of diagrams could be made, a revised simple yet general analysis method that could be used at all levels had to be developed. The elements of the analysis had to be hierarchically arranged so that analysis would — at each step of the flow chart — be able to move sequentially from the top general level to bottom root-cause level.

(3.1.5) Algorithms needed for Automated Multi-Agent NPI systems:

PREVIEW OF SECTION 3.2.0.0

SECTION 3.2.0 - Structure of the Algorithms

3.2.1. A general description of what the REPLICANT CEO++ 81 algorithms tool sets.

3.2.1.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

3.2.2. A general description of what the REPLICANT CEO++ each of the algorithms in the 81 algorithm tool sets does.

3.2.2.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

3.2.3. A general description of REPLICANT CEO++ swarm/flock of algorithms resultant combined action.

3.2.3.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

(3.2.0) Spine – A self generating sequence of commands that extends its self based the product data sheet and skyhook routines that perform the miracle of creation.

(3.2.1) Unconscious Mind – An innate complex of functions that emerges from the ferment of the individual algorithms.

(3.1.2) Demo of Algorithms needed for Automated Company Generator, Analytical Methods and Multi-Agent AI tool: Algorithims)

(3.2.2) Data Sheet to Company:

(3.2.3) Data Sheet to Run Card Demo

(3.2.4) Run Card to Simulators Demo

(3.2.5) Simulator to Analysis Demo

(3.2.6) Standard Analytical Methods

(3.2.7) Company Analysis Algorithm Demo

(3.2.8) Production Analysis Algorithm Demo

(3.2.9) Yield Analysis Algorithms Demo

(3.2.10) Advanced Systematic Analytical methods:

(3.2.11) Spatial Analytical Methods.

(3.2.13) Temporal Analytical Methods.

(3.2.13) Conditional Analytical Methods.

(3.2.14) Comparative N-dimensional Analytical methods The Integrated Yield Management Triangle (IYM):

PREVIEW OF SECTION 3.3.0.0

SECTION 3.3.0 - Specification/Tutorial for use of of the N-Dimensional Turing Machine< based Replicant CEO++.

3.3.1. A general description of what the REPLICANT CEO++ N-Dimensional Turing Machine is.

3.3.2. A general description of what the REPLICANT CEO++ N-Dimensional Turing Machine does - how to run it.

3.3.3. A general description of REPLICANT CEO++ N-Dimensional Turing Machine's results - how to use it.

3.3.3.1. Limited to IYM++ Data Analysis in this DEMO WEB PAGE.

(3.3.0) Conscious Mind – An innate complex of self functions that emerges from the ferment of cash memory. It provides the real time interface including speech recognition driven holographic avatars.

(3.3.1) Cyber NPI System Operation:

(3.3.1) Generic Company Generation

(3.3.1) Load the company generator with the product data sheet.

(3.3.1) Populate the functional capability of each group, department and section.

(3.3.1) Initiate start-up sequence of groups, departments and sections.

(3.3.1) Analytical Procedures Operation

(3.3.1) Initiate company report system.

(3.3.1) Initiate analytical algorithms.

(3.3.1) Initiate the Cyber NPI System operation.

(3.3.1) Cyber NPI System Operation

(3.3.1) Real time, On Line Multi-Agent NPI Operations sequence.

(3.3.1) Real time, On Line Data Uploading sequence.

(3.3.1) Real time, On Line Cyber Adviser Interaction. explains a systematic functional capability based on each of the 27 sections having 27 distinct functions.

(3.3.2.2) THE STRUCTURE OF THE "Procedure/PolyTuring/Spreadsheet" :

(3.3.2.1) Sub-Title1 - Background: The ... .

(3.3.2.1) Sub-Title2 - Basis: The... .

(3.3.2.1) Sub-Title3 - Intent: Provide a ... .

(3.3.2.1) Show Demo Spreadsheet by calling from DEMO (Needed in STRUCTURE & Function}

(3.3.2.2) THE FUNCTION OF THE "Procedure/PolyTuring/Spreadsheet":

(3.3.2.2) Sub-Title1 - Background: The ... .

(3.3.2.2) Sub-Title2 - Basis: The... .

(3.3.2.2) Sub-Title3 - Intent: Provide a ... .

(3.3.2.2) Explain Demo Spreadsheet by calling from DEMO (Needed in STRUCTURE & Function}

(3.3.2.2) THE PERFORMANCE OF THE"Procedure/PolyTuring/Spreadsheet":

(3.3.2.2) Sub-Title1 - Background: The ... .

(3.3.2.2) Sub-Title2 - Basis: The... .

(3.3.2.2) Sub-Title3 - Intent: Provide a ... .

(3.3.2.2) do Demo Spreadsheet by calling from DEMO (Needed in STRUCTURE & Function}

(3.3.2.2) THE STRUCTURE OF THE DATA BASE OF THE "Procedure/PolyTuring/Spreadsheet":

(3.3.2.2) Sub-Title1 - Background: The ... .

(3.3.2.2) Sub-Title2 - Basis: The... .

(3.3.2.2)Sub-Title3 - Intent: Provide a ... .

(3.3.2.2) Discuss the organization Demo data structure by calling from DEMO (Needed in STRUCTURE & Function}

(3.3.2.2) Sub-Title1 - Background: The ... .

(3.3.2.2) Sub-Title2 - Basis: The... .

(3.3.2.2) Sub-Title3 - Intent: Provide a ... .

(3.3.2.2) Show example of Demo data base by calling from DEMO (Needed in STRUCTURE & Function)

(3.3.2.2) THE PERFORMANCE OF THE DATA BASE OF THE "Procedure/PolyTuring/Spreadsheet":

(3.3.2.2) Sub-Title1 - Background: The ... .

(3.3.2.2) Sub-Title2 - Basis: The... .

(3.3.2.2) Sub-Title3 - Intent: Provide a ... .

(3.3.2.2) Do Demo data base by calling from DEMO (Needed in STRUCTURE & Function)

(3.3.2.2) THE STRUCTURE OF THE REPORT BASE OF THE "Procedure/PolyTuring/Spreadsheet":

(3.3.2.2) Sub-Title1 - Background: The ... .

(3.3.2.2) Sub-Title2 - Basis: The... .

(3.3.2.2) Sub-Title3 - Intent: Provide a ... .

(3.3.2.2) Discuss Demo Report System (vertical ...) by calling from DEMO (Needed in STRUCTURE & Function)

(3.3.2.2) THE FUNCTION OF THE REPORT BASE OF THE "Procedure/PolyTuring/Spreadsheet":

(3.3.2.2) Sub-Title1 - Background: The ... .

(3.3.2.2) Sub-Title2 - Basis: The... .

(3.3.2.2) Sub-Title3 - Intent: Provide a ... .

Discuss Demo Report System (vertical ...) by calling from DEMO (Needed in STRUCTURE & Function)

(3.3.2.2) THE PERFORMANCE OF THE REPORT BASE OF THE "Procedure/PolyTuring/Spreadsheet":

(3.3.2.2) Sub-Title1 - Background: The ... .

(3.3.2.2) Sub-Title2 - Basis: The... .

(3.3.2.2) Sub-Title3 - Intent: Provide a ... .

Do Demo Report System (vertical ...) by calling from DEMO (Needed in STRUCTURE & Function}

XXX:

YYY:

ZZZ: