WHITEPAPER


DigiLux  E-trade - virtual exchange  [of assets]


etrade.exe


[in Delphi use BDE]


assets: money / stock / etc.

  add description ONLY as file name


each asset has

  . signature

  . control_number

 

 signature changes, but the control_number doesn't



assets  to be stored in database


LOCK (master)

  1. generate random key


  2. use it as a program in my_seq

  3. find the output in my_seq, call my_out

  5. add my_out to the e_string

  6. form signature:

    1. control_number

    2. my_out

  7. encrypt the signature by my_out



  8. add -right this encrypted signature to the e_string

  9. encrypt the asset by my_out - 'how to encrypt strings' 

  10. add asset info to the database, associating to this asset

; and the asset itself also



the conversion / update of an asset by the holder is tb. called "touch"



UNLOCK (slave)

  1. get asset's my_out from holder (who emissed it)

  2. decrypt the asset

  3. compare my_out's (the one in asset and the one received)

  4. decrypt the signature

  5. compare my_out's (the one in signature and the one received)

  6. accept / decline based on comparison


...


TOUCH

  1. UNLOCK

  2. change my_out by finding a new my_seq program (random)

  3. in the database: label _old_ as used - cannot be used again

  4. LOCK the _new_ e_string



connect to ip thru sockets

  store ip's in a db table


SEND

  - use socket



ON_RECEIVE - thru socket

  use a 'watch' [Delphi component] timer


do MDI, not SDI [in Delphi]


use InstallShield to make a setup package


link to the author's sequence -  COPY  ORIGINAL 

http://oeis.org/A129835

login
This site is supported by donations to The OEIS Foundation. 
Logo 

Year-end appeal! The OEIS, now in its 47th year, is free, but it costs money to maintain it. Please make a donation (tax-deductible in the US) to help keep the website running. Neil Sloane, President, OEIS Foundation.

 Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129835A computation-universal sequence of natural numbers (with zero).0
0, 1, 2, 3, 4, 5, 6, 0, 8, 9, 0, 1, 12, 13, 0, 1, 16, 17, 18, 0, 1, 21, 2, 23, 24, 0, 1, 27, 2, 29, 30, 31, 0, 1, 34, 2, 36, 2, 38, 39, 0, 1, 42, 2, 44, 3, 3, 47, 48, 0, 1 (list;graphrefslistenhistoryinternal format)
OFFSET

0,3

COMMENTS

Let i be the index of an element (number) and f(i) be the number at that index. Applying f(f(...f(i)...)) until a fixed point is reached is computation - universal, i.e., can simulate the execution of any computer (Universal Turing Machine) program given proper choice of the initial i. The resulting fixed point encodes the program output, if any. The halting problem applies, so the procedure may not ever reach a fixed point.

The sequence results from using a modified version of the classical pairing function for nonnegative integers to numerically encode what is known as Combinatory Logic and is computation-universal, i.e. equivalent to the Turing Machine. Computationalist philosophers basically argue that each of us is inside that sequence, which the author personally doesn't believe. At least, lim f(x) on infinity is noncomputable.

REFERENCES

H.P. Barendregt, The Lambda Calculus, its Syntax and Semantics, revised edition, North-Holland, Amsterdam, 1984.

D. J. Cooke and H. E. Bez, Computer Mathematics. Cambridge University Press.

LINKS

John Tromp, Kolmogorov Complexity in Combinatory Logic.

FORMULA

Let d(x) = (1/2)x(x+1). Then the pairing function <x,y> = d(x+y)+x+2 maps pairs <x,y> onto numbers {2, 3, 4, ...}. To unpair a number q into x & y, follow these steps: if q >= 2 do p = q-2; n = FLOOR((sqrt(8p+1)-1)/2); x = p-d(n); y = d(n)+n-p; & now we know the x & the y in the paired representation of q = <x,y>.

This way we can represent any number in the form like, e. g., <<<1,0>,1>,<0,1>> = 323. To get that from 323, unpair 323 repeatedly until you have just 0's & 1's inside pairwise-balanced brackets. Next, define f(q) as follows: f(...<<<1,x>,y>,z>...)=...<<x,z>,<y,z>>..., else f(...<<0,x>,y>...)=...x..., else f(q)=q (fixed point).

Here we're doing pattern matching on the bracketed representations of numbers and changing one number into another in this representation according to the 3 rules above. Leading & trailing "..."'s are to be left the same. x, y, z match any subconstruction in q that then takes another place in the f(q) transformation.

The three rewriting rules are listed in descending priority, correspond to a single f(q) and should be applied to the first occurrence of the pattern in the bracketed construction. We operate on bracketed constructions with 0's & 1's that are in 1-to-1 correspondence with numbers and should be viewed as such.

Basically, f(q) is a relation on the infinite set of natural numbers (with zero) and can be viewed as an infinite directed graph with numbers as nodes connected by the relation j=f(q) that partitions the whole set into tree-like equivalence classes.

EXAMPLE

E.g. 323 corresponds to <<<1,0>,1>,<0,1>>: <<<1,0>,1>,<0,1>> <->

<<4,1>,<0,1>> <-> <21, 3> <-> 323 by the pairing transform. It reduces to

<0,1> by applying f(.): <<<1,0>,1>,<0,1>> -> <<0,<0,1>>,<1,<0,1>>> ->

<0,1>. The two "->"'s correspond to first applying the first rule, then

the second rule and then we get a fixed point <0,1> = 3 (by simply

pairing 0 & 1). At each step, we apply the first rule that applies, out of

the three. Taken together, this example shows that f(f(323)) = f(241) =

3. According to the 3rd rule, f(3)=3, so 3 is a fixed point - the

computation terminates at 3. The intermediate step

<<0,<0,1>>,<1,<0,1>>> = <<0,3>,<1,3>> = <8,13> = 241 by the pairing transform.

PROG

{ Turbo Pascal code for the SK - combinator - based Natural State Machine K == 0 S == 1 } program SKNSM; uses Crt, WinDos; (* Numerical pairing / unpairing routines *)

{2 naturals into 1} procedure Pair(X, Y : Comp; Shift : Byte; var P : Comp); var S : Comp; begin S := X + Y; P := S * (S + 1) / 2 + X + Shift; end;

{1 natural into 2} function UnPair(P : Comp; Shift : Byte; var X, Y : Comp) : Boolean; var N, T : Comp; begin if P >= Shift then begin UnPair := True; P := P - Shift; N := Int(((Sqrt(8 * P + 1)) - 1) / 2); T := N * (N + 1) / 2; X := P - T; Y := T + N - P; end else UnPair := False; end;

(* Combinatory routines *)

{parsing, get left} function CLGetLeftPart(C : string) : string; var I, Sum : Byte; begin if C[2] <> '(' then CLGetLeftPart := C[2] else begin I := 2; Sum := 1; repeat Inc(I); if C[I] = '(' then Inc(Sum) else if C[I] = ')' then Dec(Sum); until Sum = 0; CLGetLeftPart := Copy(C, 2, I - 1); end; end;

{parsing, get right} function CLGetRightPart(C : string) : string; var L, I, Sum : Byte; begin I := Length(C) - 1; if C[I] <> ')' then CLGetRightPart := C[I] else begin Sum := 1; repeat Dec(I); if C[I] = '(' then Dec(Sum) else if C[I] = ')' then Inc(Sum); until Sum = 0; CLGetRightPart := Copy(C, I, Length(C) - I); end; end;

{string to number} procedure CLEncode(C : string; var P : Comp); var X, Y : Comp; begin case C[1] of 'K' : P := 0; 'S' : P := 1; else CLEncode(CLGetLeftPart(C), X); CLEncode(CLGetRightPart(C), Y); Pair(X, Y, 2, P); end; end;

{number to string} procedure CLDecode(P : Comp; var C : string); var X, Y : Comp; begin if P = 0 then C := C + 'K' else if P = 1 then C := C + 'S' else begin UnPair(P, 2, X, Y); C := C + '('; CLDecode(X, C); CLDecode(Y, C); C := C + ')'; end; end;

{combinatory reduction / rewriting routine L - the cutoff number of reduction steps} function CLReduce(L : Comp; var P : Comp) : Boolean; var X, Y, XX, XY, XXX, XXY : Comp; begin if L = 0 then CLReduce := False else begin if UnPair(P, 2, X, Y) then begin if UnPair(X, 2, XX, XY) then begin if XX = 0 then begin P := XY; CLReduce := CLReduce(L - 1, P); end else if UnPair(XX, 2, XXX, XXY) then begin if XXX = 1 then begin Pair(XXY, Y, 2, X); Pair(XY, Y, 2, Y); Pair(X, Y, 2, P); CLReduce := CLReduce(L - 1, P); end else begin CLReduce := CLReduce(L, X); Pair(X, Y, 2, P); CLReduce := CLReduce(L - 1, P); end; end; end; end; end; end;

{reduce / rewrite ONCE} procedure CLRedStep(N : Comp; var R : Comp); begin CLReduce(1, N); R := N; end;

{reduction function - wrapper} function F(X : Longint) : Longint; var Y : Comp; begin CLRedStep(X, Y); F := Trunc(Y); end; (* Main routine *) const N = 299;

{first 300 pointers - a FSM prefix of NSM} var X, Y : Longint; TF: Text; begin Assign(TF, 'NSM.txt');

{file to write transitions to} Rewrite(TF); for X := 0 to N do begin Y := F(X); Write(TF, X, ' -> ', Y); if X = Y then Write(TF, ' FP');

{fixed point} WriteLn(TF); end; Close(TF); end.

CROSSREFS

Sequence in context: A070553 A195830 A080743 * A004182 A030998 A190596

Adjacent sequences:  A129832 A129833 A129834 * A129836 A129837 A129838

KEYWORD

nonn,more,uned

AUTHOR

Artem S. Shafraniuk (ashafraniuk(AT)gmail.com), May 21 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam 
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics 
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.
Content is available under The OEIS End-User License Agreement .
Last modified December 12 06:41 EST 2011. Contains 200633 sequences.

copyright 2011 by Artem S. Shafraniuk

all rights reserved


Artem Serhiyovich Shafraniuk


  to license, ONLY contact  artem.shafraniuk@gmail.com / ashafraniuk@yahoo.com!






financial online (R)


"our mission is to develop an electronic online /infrastructure/ for a CONCEITUAL ECONOMY"


statement of purpose / whitepaper / project's proposal



we have ideas, and need sponsorship


contact Artem Serhiyovich Shafraniuk at


artem.shafraniuk@gmail.com, ashafraniuk@yahoo.com


Kiev, Ukraine 253-33-90, 253-43-43 after 20:00 Kiev time



invest!


. digital controlled money: a subject has a private key and public key, an electronic banknote has a crypto-id (public key), the e[lectronic] bank holds its secret-id (private key) - the bank that releases these banknotes online; secure transaction of money between ip-computers: subject A sends the banknote, encrypted by the recepient subject B's public key, then subject B decrypts it with her private key, and her software notifies the bank of the transfer, using the banknote's crypto-id


. electronic online exchange of digital money [above], stock, etc. - all you need is an on-server database with a secure web-interface, this may use our digital money


. online banking: electronic online-oriented banks operate on our digital money


. online-driven business: works thru online-based central, and may employ freelancers


. i-point, mobile devices -based incorporation: work together, wherever they are - your employees


. FINUS software - works on real or / and digital money  BOTH -- see LOW BELOW on this webpage


  --> insert, with screenshot; all-code


. online-client-side automation of online financial transactions - client-side robot software that works like a bug and automates one's requests; this can integrate with FINUS -  AUTOTRADING



all projects are interconnected, and are


copyright 2011 by Artem S. Shafraniuk

all rights reserved


WE'RE NEW, and require <SPONSORSHIP> to develop our projects!




-----------------------------------------------------------------------


a new programming language "inCode"


example program: Lx.{x<0\print(x)[;...]}

  where L - lambda expression

    x<0 - condition

this language also has goto(label).

USEFUL NOTE: L-variable can be changed by operators in code during run-time!

copyright 2011 by Artem Serhiyovich Shafraniuk

-----------------------------------------------------------------------


Artem Serhiyovich Shafraniuk


EMONEY

pseudoquantum online transactions for internet money

17.09.2011

[x,y] - a cryptographically connected pair of numbers, generated crysptographically

  conditions

    HARD to find out from what number they were generated

    EASY to find out that they are a such cryptographic pair

t(x,y) in {true, false} - test for that they (x,y) are a cryptographic pair

GENERATION

f(x,y)=g(r)

  r - random number

  x,y - a cryptographic pair of numbers

  g - a cryptographic function

  f - Euclid's pairing function from <x,y> = d(x+y)+x+2

recommended g(.): a chaotic function with a parameter [r]

NOW, this way we can authenticate an online transaction cryptographically to test for authenticity on both sides. just encrypt information by the x,y as keys for sides a,b correspondingly, and then use the numbers and test function t to test for "EPR" correlation without using quantum cryptography

copyright 2011 by Artem S. Shafraniuk. IF YOU WANT TO USE THIS ANYHOW, YOU'VE GOT TO CONTACT THE AUTHOR DIRECTLY OR BY EMAIL. THE AUTHOR FORBIDS ANY OTHER OPTIONS! (.)

--

project xenadu

estate - electronic (virtual) state / country with electronic governance and virtual money (economy)

emoney: virtual money with author's technology

author's wannabe idea: to establish an electronic state / virtual country

  novelty: FULL - was never before!

--> law - this is up to politics

structural engine: interacting queue machines (a queue machine is a finite automaton with a queue, and is known to be computation-universal)

author's technology that gives a road to create a virtual state:

SECURE ONLINE TRANSACTIONS

big random number N

one-side function N-->(x_key, y_key)

so that there is a test function t(x_key,y_key)={true, false}

  =true iff x_key,y_key are a valid pair from such an N number

SCHEME for a secure transaction 

  trusted authority with an online server

  client computer sides A,B want to do a secure transaction which is exchanging messages R_A (A-->B), Q_B (B-->A)

they use (public) open key cryptography to encrypt R_A with x_key, Q_B with y_key.

ALGORITHM:

-trusted authority:

  - generate N

  - get x_key,y_key

  - distribute keys to sides x_key-->A, y_key-->B

- sides encrypt each encrypted_R_A(x_key); encrypted_R_B(y_key)

- exchange messages by sides

- each side uses the test function t on the message to validate it

TRANSACTION COMPLETE SECURELY! q

copyright (2011) by Artem Serhiyovich Shafraniuk, artem.shafraniuk@gmail.com

P<>NP

proof 2: Algorithms in P either halt or not and algorithms in NP also either halt or not. The haltings of algorithms in both classes are bits in Chaitin's real number Omega. This number is authentically random. Suppose P=NP. Then there is an isomorphism in Omega. But if there is an isomorphism in Omega, it cannot be random. But Omega is random. Contradition. Then, P<>NP!

proof 1: The Bounded Halting Problem is in NP. Construct the Polynomial Bounded Halting Problem. (Bounded halting of polynomial-time algorithms.) In the limit of time, Bounded Halting Problem converges to the Halting Problem, but the Polynomial Bounded Problem cannot. Therefore, the two problems do not coincide. This can only be if P<>NP!

Riemann Hypothesis

proof 1: This is an equation with two sides. Do lim(<left-hand-side>)=lim(right-hand-side). Solve.

Financial Economy

There are agents with values and transactions between them. Transactions generally follow the principle of least resistance in terms of revenue. Therefore, financial economy is a dynamical multi-dimensional vector field with moving dots that denote the agents with temporal evolution. This is scalar field with dots in multi-dimensional euclidean space. Next, build a directed topos on this space. This will be a directed graph that evolves in time. Now, 2 things: use the theory of networks and flows and describe the evolution with equations from Concrete Mathematics.

 


(c) Artem Serhiyovich Shafraniuk, 2011


{I take cash only}
 
 
 
// finus is based on digitalised feedback in cybernetical servosystems
unit Unit1;
interface
uses
  Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms,
  Dialogs, StdCtrls, ExtCtrls, TeeProcs, TeEngine, Chart, Spin, Series;
type
  TForm1 = class(TForm)
    Panel1: TPanel;
    Label1: TLabel;
    Edit1: TEdit;
    Label2: TLabel;
    Edit2: TEdit;
    Label3: TLabel;
    Edit3: TEdit;
    Label4: TLabel;
    Edit4: TEdit;
    Panel2: TPanel;
    Label5: TLabel;
    Label6: TLabel;
    Memo1: TMemo;
    GroupBox1: TGroupBox;
    Memo2: TMemo;
    Chart1: TChart;
    SpinEdit1: TSpinEdit;
    Label7: TLabel;
    Series1: TLineSeries;
    Series2: TLineSeries;
    Button1: TButton;
    Label8: TLabel;
    Button2: TButton;
    procedure Button1Click(Sender: TObject);
    procedure Button2Click(Sender: TObject);
  private
    { Private declarations }
  public
    { Public declarations }
  end;
var
  Form1: TForm1;
implementation
uses
  Unit2;
{$R *.dfm}
function Next(Input: String): Boolean;
var
  I, C, N : Word;
begin
  C := 0;
  N := 0;
  for I := 1 to Length(Input) do
  begin
    Inc(N);
    if Input[I] = '1' then Inc(C);
  end;
  if C / N < 0.5 then Next := True else Next := False;
end;
procedure PredictN(Input: String; N : Word; var Prediction : String);
var
  I : Word;
  T : String;
begin
  for I := 1 to N do
  begin
    if Next(Input) then T := '1' else T := '0';
    Input := Input + T;
    Prediction := Prediction + T;
  end;
end;
procedure BuildPref(var Pref: String);
var
  x1, x2, y1, y2 : Real;
  k, I : Word;
  b : Boolean;
begin
  x1:= StrToFloat(Form1.Edit1.Text);
  x2:= StrToFloat(Form1.Edit3.Text);
  y1:= StrToFloat(Form1.Edit2.Text);
  y2:= StrToFloat(Form1.Edit4.Text);
  if y1 < y2 then
  begin
    k := Round((y2/(y2+y1))*20);
    b := True;
  end else
  begin
    k := Round((y1/(y1+y2))*20);
    b := False;
  end;
  Pref := '';
  for I := 1 to 20 do
  begin
    if b then
    begin
      if I <= k then Pref:=Pref+'0' else Pref:=Pref+'1';
    end else
    begin
      if I >= k then Pref:=Pref+'0' else Pref:=Pref+'1';
    end;
  end;
end;

procedure FillTicks(P, R:String);
var
  I : Word;
  K : LongInt;
  U : Integer;
begin
  U := 0;
  with Form1 do
  begin
    Chart1.Series[1].Clear;
    for I := 1 to SpinEdit1.Value + 20 do
    begin
       if P[I] = '0' then Dec(U) else Inc(U);
       Chart1.Series[1].AddXY(I, U, '', clTeeColor);
    end;
  end;
  with Form1 do
  begin
    Chart1.Series[0].Clear;
    for I := 1 to Length(R) do
    begin
       if R[I] = '0' then Dec(U) else Inc(U);
       Chart1.Series[0].AddXY(I, U, '', clTeeColor);
    end;
  end;

end;
 
procedure TForm1.Button1Click(Sender: TObject);
var
  P, R : String;
begin
  BuildPref(P);
  PredictN(P,SpinEdit1.Value,R);
  FillTicks(P+R, P);
end;
procedure TForm1.Button2Click(Sender: TObject);
begin
  AboutBox.Show;
end;
end.
// copyright 2010 by Artem S. Shafraniuk (Serhiyovich)
// license cost $20000 per an individual person
// email me to get a license
//
//  Copyright 2010 by Artem
// Serhiyovich Shafraniuk,
// to license, email!
 

object Form1: TForm1
  Left = 245
  Top = 254
  Width = 870
  Height = 640
  Caption = '_finus'
  Color = clBtnFace
  Font.Charset = DEFAULT_CHARSET
  Font.Color = clWindowText
  Font.Height = -11
  Font.Name = 'MS Sans Serif'
  Font.Style = []
  OldCreateOrder = False
  Position = poDefaultPosOnly
  PixelsPerInch = 96
  TextHeight = 13
  object Panel1: TPanel
    Left = 0
    Top = 572
    Width = 862
    Height = 41
    Align = alBottom
    TabOrder = 0
    object Label1: TLabel
      Left = 8
      Top = 16
      Width = 65
      Height = 13
      Caption = 'NATURAL x1'
    end
    object Label2: TLabel
      Left = 208
      Top = 16
      Width = 42
      Height = 13
      Caption = 'REAL y1'
    end
    object Label3: TLabel
      Left = 408
      Top = 16
      Width = 65
      Height = 13
      Caption = 'NATURAL x2'
    end
    object Label4: TLabel
      Left = 608
      Top = 16
      Width = 42
      Height = 13
      Caption = 'REAL y2'
    end
    object Edit1: TEdit
      Left = 80
      Top = 8
      Width = 121
      Height = 21
      TabOrder = 0
      Text = '1'
    end
    object Edit2: TEdit
      Left = 256
      Top = 8
      Width = 121
      Height = 21
      TabOrder = 1
      Text = '8,2'
    end
    object Edit3: TEdit
      Left = 480
      Top = 8
      Width = 121
      Height = 21
      TabOrder = 2
      Text = '2'
    end
    object Edit4: TEdit
      Left = 656
      Top = 8
      Width = 121
      Height = 21
      TabOrder = 3
      Text = '9,8'
    end
    object Button1: TButton
      Left = 784
      Top = 8
      Width = 67
      Height = 25
      Caption = 'Run'
      TabOrder = 4
      OnClick = Button1Click
    end
  end
  object Panel2: TPanel
    Left = 704
    Top = 0
    Width = 158
    Height = 572
    Align = alRight
    TabOrder = 1
    object Label5: TLabel
      Left = 16
      Top = 8
      Width = 92
      Height = 208
      Caption =
        '_finus is a financial predictor in public shareware. NO PROFIT U' +
        'SE! (prohibited). For LICENSE $20000, buy with source code and use ' +
        'it as you like, 1 person. to print, use Print Screen key on keyb' +
        'oard and paste as a picture, then print. Extrapolates from two '
      WordWrap = True
    end
    object Label6: TLabel
      Left = 16
      Top = 224
      Width = 59
      Height = 117
      Caption =
        'price tick points. x1,x2-days: x2,y2-prices. What plays a role i' +
        's the period between points'
      WordWrap = True
    end
    object Label7: TLabel
      Left = 96
      Top = 304
      Width = 46
      Height = 13
      Caption = 'pr. TICKS'
    end
    object Label8: TLabel
      Left = 88
      Top = 216
      Width = 65
      Height = 81
      Caption = 'Note: REAL NUMBERS HAVE , not . inside'
      WordWrap = True
    end
    object Memo1: TMemo
      Left = 0
      Top = 464
      Width = 153
      Height = 105
      Lines.Strings = (
        'Copyright 2010 by Artem '
        'Serhiyovich Shafraniuk,'
       
        'artem.shafraniuk@gmail.com'
        'ashafraniuk@yahoo.com'
       
        'to license, email!')
      TabOrder = 0
    end
    object GroupBox1: TGroupBox
      Left = 8
      Top = 352
      Width = 145
      Height = 105
      Caption = 'IDEA'
      TabOrder = 1
      object Memo2: TMemo
        Left = 8
        Top = 32
        Width = 129
        Height = 65
        Lines.Strings = (
          '1. feedback servosystem'
          '2. discrete wavelet'
          '3. binary stability'
          '4. digital extrapolation')
        TabOrder = 0
      end
      object Button2: TButton
        Left = 56
        Top = 8
        Width = 75
        Height = 17
        Caption = '<?source>'
        TabOrder = 1
        OnClick = Button2Click
      end
    end
    object SpinEdit1: TSpinEdit
      Left = 96
      Top = 320
      Width = 57
      Height = 22
      MaxValue = 0
      MinValue = 0
      TabOrder = 2
      Value = 80
    end
  end
  object Chart1: TChart
    Left = 0
    Top = 0
    Width = 704
    Height = 572
    BackWall.Brush.Color = clWhite
    BackWall.Brush.Style = bsClear
    Title.Text.Strings = (
      'price WALK')
    Align = alClient
    TabOrder = 2
    object Series1: TLineSeries
      Marks.ArrowLength = 8
      Marks.Visible = False
      SeriesColor = clBlue
      Pointer.InflateMargins = True
      Pointer.Style = psRectangle
      Pointer.Visible = True
      XValues.DateTime = False
      XValues.Name = 'X'
      XValues.Multiplier = 1
      XValues.Order = loAscending
      YValues.DateTime = False
      YValues.Name = 'Y'
      YValues.Multiplier = 1
      YValues.Order = loNone
    end
    object Series2: TLineSeries
      Marks.ArrowLength = 8
      Marks.Visible = False
      SeriesColor = clRed
      Pointer.InflateMargins = True
      Pointer.Style = psRectangle
      Pointer.Visible = True
      XValues.DateTime = False
      XValues.Name = 'X'
      XValues.Multiplier = 1
      XValues.Order = loAscending
      YValues.DateTime = False
      YValues.Name = 'Y'
      YValues.Multiplier = 1
      YValues.Order = loNone
    end
  end
end

Sign in  |  Recent Site Activity  |  Terms  |  Report Abuse  |  Print page  |  Powered by Google Sites