Basic built in symbolic synchronized {(clear, not), (increment, event), (m=move, i=invest), (scaling<up, down>, custom<adjust, consumer>) mode

s inspiration across modeling s intelligence
Said Mchaalia (best basic built in draft copy November 11 Th 2013)

!bstract
Hence, this proposal dynamics of symbolic synchronized (clear! not)! (increment! event)! (m"move! i"invest)! (scalin#$up! do%n&! custom$ad'ust! consumer&) mode(s inspiration across modelin#(s intelli#ence is then the main real engine flow to decide any possible probable command kind and control type across system economy, financial effect, transmission's transportation dynamics and robust control mechanism. Thus, for such a job scheduling details, the main real description has to progress inside viewpoints defined below as follows: )* clear " %aveform " f()! example: clear =
−a sin () * cos () * sin [ f ( fre+uency ! time )] * e ( sin ( )−cos ()) pi !

))* not clear "

(−"+

" " ),( ) ! f () f ()
a pi

( sin ()−cos ()) e ! example: not clear = * sin () * cos ( ) sin [ f ( fre+uency !time )]
)))* clear increment (-this) " ad'ust any amount +uantity to be desirable measurable amount +uantity! %hich should be an achievable flo% inside correspondin# customs . ).* not to increment (-this) " not yet to increment " %ait to become a si#nal of chosen sensor . .* event " mappin# pair (inte#er n in )N such that t"n*T! focus on function " %aveform or any other state lo#ics lan#ua#e). .)* move %hen ready " ma/e a scalin#$up! do%n& variation level to speed up or slo% do%n durin# any possible probable current motion. .))* not to move " not yet ready to move " %aitin# for 'ob scheduler to process %ithin mappin# pair ( incomin# electrical amount +uantity! outcomin# electrical amount +uantity) .)))* invest " implement any possible probable si#nal ad'ustment across any system architecture (brid#e is #ap " deep investi#ation of mode(s inspiration to flo% into modelin#(s intelli#ence) . )0* scalin# $up! do%n&(-this) " ad'ust incomin# electrical amount +uantity to decide for any focal focus on of correspondin# outcomin# electrical amount +uantity! %hich should be achievable si#nal ad'ustment for any measurable core(s proceedin# across system architecture 0* custom$ad'ust! consumer&(-this) " is the primordial principle thread tas/ 'ob schedulin# processin# across any proposal approval envisa#e correspondin# control data flo% #raph theory* Hence, this proposal fu##y genetic mimetic approach, which is a symbolic surroundin# (clear! not)! (increment! event)! (m"move! i"invest)! (scalin#$up! do%n&! custom$ad'ust! consumer&) dynamics, has to replace the old theory across fu##y procedures due to its major intentional secrets across signal adjustments and system

architectures. Therefore, the associate f uzzy rules " $%T x & '" ( truth'x)) x *$+ y & minimum'truth'x), truth'y)) x %, y & maximum'truth'x), truth'y)) could be easy simple implemented within the basic built in symbolic surroundin# (clear! not)! (increment! event)! (m"move! i"invest)! (scalin#$up! do%n&! custom$ad'ust! consumer&) dynamics as follows: $%T x & '" - truth'x)) & not clear function form. Hence, to compute within a robust fu##y inside the proposal approval mapping focus on pair ' y & cos () , # & sin ( ) ) envelop, an easy simple signal 'waveform) assignment could then be achievable as follows: x & truth & cos () though, $%T x & '" - truth'x)) & sin ( ) . .urthermore, for a future focal focus on, the main real operating thread task is to search across surrounding intentional mode's inspiration and modeling's intelligence to assign a ratio's function form corresponding to the /not clear & $%T x0 in order to determine the function form corresponding to /clear0 ' clear = f ( ) ). x *$+ y & minimum'truth'x), truth'y)) & x %, y & maximum'truth'x), truth'y)) &
10 ≤ b ! 23 ≤c

min

( clear 0 = f () ! clear 3 = # ()) ( clear 0 = f ( ) ! clear 3 = # ())

ma4
10 ≤ b ! 23 ≤c

where the

min
10 ≤ b ! 23 ≤c

() and

ma4
10 ≤ b ! 23 ≤c

() are mathematically defined to satisfy the main real primordial

principles of intentional mathematical adjustment surrounding signal advances and system architectures. 1xamples: x&

cos () , y & sin ( )

x 1N5 y &

min
10 ≤ b ! 23 ≤c

" ( 4 =cos () ! y =sin ())= = 4 ∩ y

x&

cos () , y & sin ( )

x 67 y &

10 ≤ b ! 23 ≤c

ma4

( 4 =cos () ! y =sin ())="= 4 ∪ y

N6T 'x)

" - truth'x) & 2 &

−" +

" cos ()

N6T 'y)

" - truth'y) & 2 &

−" +

" sin ()

Table 18 main real mathematical intentional processin#

3n fact, table 1 is showing the main real mathematical intentional processing across the defined fu##y genetic mimetic approach.

Hence, the associate job scheduling to that defined fu##y principle, when it is applied to an example of regulation of temperature, is the following focus of float processing based on the main real principles of proposal mapping focus on pair ' y & cos () , # & sin ( ) ) envelop 'see table 2 for more details). Hence, table 2 illustrates a real example of application of involving fu##y genetic mimetic approach across temperature regulation processing. Thus, the proposal mapping focus on pair ' y & cos () , # & sin ( ) ) envelop 'see table 2 for more details), has to play a great rule inside any possible probable job scheduling associate within the evolving fu##y rules as shown within the example of the table 2. job scheduling associate math )9 temperature 34 very cold cold x & cos () )9 temperature 34 very cold )9 temperature 34 very cold T:;N stop fan )9 temperature 34 middle cold

cold ( 4 )=cos ()="
cold ( 4 )=cos ()= "

)9 temperature 34 cold T:;N turn down fan

)9 ' cold ( 4 )=cos ()>

"

) T:;N <turn down fan0

)9 temperature 34 normal T:;N maintain level

)9 ' cold ( 4 )=cos ()=

"

) T:;N /maintain level0 hot x &

)9 temperature 34 very hot T:;N speed up fan )9 temperature 34 very hot T:;N speed up fan )9 temperature 34 very hot T:;N speed up fan )9 temperature 34 very hot T:;N speed up fan job scheduling )9 temperature 34 hot T:;N <li#ht on red=

sin ( )

hot ( 4 )=sin ()=" hot ( 4 )=sin ()=
associate math

"

)9 ' hot ( 4 )= <sin ()<" ) T:;N <li#ht on red=

"

)9 temperature 34 normal T:;N <li#ht on #reen=

)9 ' hot ( 4 )=sin ()=

"

) T:;N <li#ht on #reen=

Table 28 main real mathematical intentional processin# across the e4ample of temperature re#ulation

Therefore, by the assignment of the mathematical intentional surrounding arrays to be envelop inside the proposal mapping focus on pair ' y & cos () , # & sin ( ) ) envelop 'see table 2 for more details), the logics languages, which have been defined within the 5oles's rules inside the processing within 5oolean functions ')9 0 then do instruction statement>, whereby 6 should be 5oolean, could be easy simple involving within any possible probable mathematical intentional symboli#ation of #>$, #>=$, #<$, #<=$ or #=$ as defined within the example of table 2.

Thus,

hot ( 4 )=sin ()=" is /True0, when the mathematical amount 7uantity hot ( 4 )=sin ()=" is valid.
hot ( 4 )=sin ()= "
, the

.urthermore, the same could be done for the mathematical amount 7uantity mathematical amount 7uantity

cold ( 4 )=cos ()=

"

, the mathematical amount 7uantity

" hot ( 4 )= <sin ()<" , and so on.
3n fact, the logics language across the mathematical insight has to involve the dynamics mechanism of surrounding synchroni#ed logical symboli#ation around #>$, #>=$, #<$, #<=$ or #=$ as defined within the example of table 2. 3n fact, to mount any huge hard home hierarchy across sign's advances, the motor kernel should be job scheduling around symbolic synchroni#ed society. Hence, the main real operating symbols inside any synchroni#ed society is the economy effect and the financial aspects 8", , 9:. Hence, what is an economy effect2 Then, how could a simulation procedure identify a financial aspect across symbolic synchroni#ed society to mount any sign's advance within2
%eywords"

symbolic synchroni#ed society, economy effect, financial aspect, sign's advance across any society's type and safe science's kind.

&ntroduction"
3n fact, the main real operating thread task is to assign the major most significant of the works of ;empel and <iv 8=: during the associate dynamics in order to fix fatal focus ons of new fu##y genetic mimetic approach to be involving within any possible probable system economy, financial effects, robust control and transmission's transportation mechanism. Hence, the main real operating algorithm of ;empel and <iv 8=: was defined as follows: typedef map>char, vector>int?? 4torage@ typedef map>char, vector>int?? :: iterator it & 4torage.begin')@ while'Aeof'fptr)) do B fscanf'fptr, /Cc0, pch) @ DD declaration : charE pch & Fc@ char c & 'a'@ if ''Eit).find'pch)) B ''Eit).second).pushGback'indexHH)@ DD declaration : int index & I@ J else B 'Eit).insert'pch)@ ''Eit).second).pushGback'indexHH)@ DD declaration : int index & I@ J J Therefore, during the evolving processing of the symbolic synchronized (clear! not)! (increment! event)! (m"move! i"invest)! (scalin#$up! do%n&! custom$ad'ust! consumer&) mode(s inspiration across modelin#(s intelli#ence , the main real operating instruction levels is to search the dynamics to fill in within the re7uired

mathematical intentional secrets, which have been defined as follows: DD(((((((((((((((((((((((((((((((((((((((((((((((((((( typedef map>char, vector>float?? Kropose@ typedef map>char, vector>float?? :: iterator ig & Kropose.begin')@ typedef map>char, vector>int?? 4torage@ typedef map>char, vector>int?? :: iterator it & 4torage.begin')@ typedef map>char, vector>float?? Krocess@ typedef map>char, vector>float?? :: iterator il & Krocess.begin')@ DD((((((((((((((((((((((((((((((((((((((((((( void function') B flaot 47r4in4 & I.II@ flaot 47r4in; & I.II@ flaot 47rLosM & I.II@ int sum & "@ int index & I@ DD((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( while'Aeof'fptr)) do B fscanf'fptr, /Cc0, pch) @ DD declaration : charE pch & Fc@ char c & 'a'@ if ''Eit).find'pch)) B ''Eit).second).pushGback'indexHH)@ DD declaration : int index & I@ J else B 'Eit).insert'pch)@ ''Eit).second).pushGback'indexHH)@ DD declaration : int index & I@ J J for 'it@ it A& 4torage.end')@ itHH) do B sum H& sum H "@ J DD((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((( it & 4torage.begin')@ for 'it@ it A& 4torage.end')@ itHH) do B 47r4in4 & ''Eit).second).si#e') D sum@ 47rLosM & "( 47r4in4@ if ''Eil).find''Eit).first)) B ''Eil).second).pushGback'47r4in4)@ J else B 'Eil).insert''Eit).first)@ ''Eil).second).pushGback'47r4in4)@ J if ''Eig).find''Eit).first)) B ''Eig).second).pushGback'47rLosM)@ J else B 'Eig).insert''Eit).first)@ ''Eig).second).pushGback'47rLosM)@ J J

J
3n fact, based on the above algorithm implementation, the re7uired mathematical intentional symboli#ations have been determined to finish with following focus ons involving within the proposal approval mapping pair (3" clear! ? " not clear ) below:

i. an associate float valuable function form 3 " clear "

sin () * cos ( ) ( sin ()− cos ( )) ( sin ( )− cos ()) sin () * cos ()

ii. an associate float valuable function form ? " not clear "

1ven though, it is possible to use the simple easy way to introduce the fu##y genetic mimetic approach based on the float encoding through the usage of mapping pair ' cos () , sin ( ) ), whereby the function form is sin ( ) belong to /typedef map>char, vector>float?? :: iterator il & Krocess.begin')@0, whereby the main real operating idea is to assign to each /char0 variable inside the /typedef map>char, vector>int?? :: iterator it & 4torage.begin')@0 a float variable, which could be simple easy used to define the main involving surrounding adjustments across waveform compression techni7ues.
1.2 1 0.8 0.6 0.4 0.2 0
char = {a, b, c, d, ..., A, B, C,...., *, -, /, .......!, &, é, .....} mapping pair (

cos ()

,

sin ( )

)

9i#ure 18 main real operation variation level of associate mappin# pair ( by assi#nments of

cos () ! sin ( ) )! %hich has been defined

sin () to <typedef map$char! vector$float&& 88 iterator il " @rocess*be#in()A= and assi#nment of cos () to typedef map$char! vector$float&& 88 iterator i# " @ropose*be#in()A

3n fact, figure " illustrates main real operation variation level of associate proposal envisage approval mapping pair ' cos () , sin ( ) ), which has been defined by assignments of sin ( ) to /typedef map>char, vector>float?? :: iterator il & Krocess.begin')@0 and assignment of cos () to typedef map>char, vector>float?? :: iterator ig & Kropose.begin')@, whereby the mode's inspiration across this modeling's intelligence is to continue the proposal approval waveform compresssion techni7ues using this mapping pair ' cos () , sin ( ) ), which could be easy simple involved within any possible probable fu##y genetic mimetic dynamics. Hence, fi#ure 1 is showing the variation of

sin ( ) and the variation of cos () for each byte involving

vect@*size ()
inside the proposal envisage file to be compressed. Therefore, the

sin ()=
i

i

"+∑ vect@*size ()
i

, where the

index 3 is associate within the char 3. Thus, the new procedures of the evolving waveform compression

vect@*size ()
dynamics is involving within the mathematical intentional amount 7uantity

sin ( )=
i

i

"+∑ vect@*size ()
i

.

Therefore, the number of times to find the associate /has been stored byte0 is defined through the mathematical

vect@*size ()
i

intentional amount 7uantity

sin ( )=
i

"+∑ vect@*size ()
i

, the main real operating huge hard home hierarchy

of any waveform compression techni7ue is to find the position of corresponding bytes, which have been stored. .urthermore the main real operating huge hard home hierarchy across the associate approach is to designed

vect@*size ()
i

around the similar float values, which could depict any possible variation of

sin ()=
i

"+∑ vect@*size ()
i

for

many different bytes due the same values of corresponding vector.si#e') for any corresponding byte, where vector defines the vector position. Therefore, the surrounding across the associate mathematical intentional amount 7uantity

vect@*size ()
i

sin ()=
i

"+∑ vect@*size ()
i

, which has been defined for any byte, could not resolve the problem of finding

easy simple the position of stored bytes so fast as it should. Though, the number of appearance 'occurrence) of corresponding stored byte, which has to evolve new discret event simulation based on following focus on dynamics event & 'n, vect@*size ()=( sin ( ) )∗( " +∑ vect@*size () ) ) , whereby the n is the index of
i i i

corresponding byte and the associate mathematical intentional amount 7uantity surrounding symbolic signs vect@*size ()=( sin ( ))∗(" +∑ vect@*size () ) is the number of occurrence of the such a byte inside the corresponding media file. Thus, n =inde4 ( byte=char ) to be easy simple stored within the new procedure involving the following focus on dynamics of discrete event simulation. Nhere to find any byte in the envisage file, which should be ready for storing back the information2 This, is the huge hard home hierarchy of interest. Thus, the mode's inspiration adjust modeling's intelligence during the presentation of the famous fatal focus on mapping pair of sin ( ) belong to /typedef map>char, vector>float?? :: iterator il & Krocess.begin')@ , where /char0 is the re7uired key to find the history of float variation based on the synchroni#ation of corresponding chars. Thus, the “first on, first out” structure is then used %ithin the lo#ics lan#ua#e of pipeline structures inside the proposal approval envisa#e processin# of %aveform compression*
i i i

1.2 1 0.8 0.6 0.4 0.2 0

mapping pair (

cos ()

,

sin ( )

)

char = {a, b, c, d, ..., A, B, C,...., *, -, /, .......!, &, é, .....}

9i#ure 28 main real operation variation level of associate mappin# pair ( defined by assi#nments of

cos () or sin ( ) )! %hich has been

sin () to <typedef map$char! vector$float&& 88 iterator il " @rocess*be#in()A= %ithin
involvin# of variation of char positions at yBa4is*

3n fact, fi#ure 2 depicts the variation levels of char postion at y(axis and the corresponding mathematical

vect@*size ()
i

intentional amount 7uantity

sin ( )=
i

"+∑ vect@*size ()
i

variation levels.

Thus, the major most intentional surrounding 7uestion across these waveform procedures, is how to identify the position of <byte " char=, which have been involving within the y(axis such that the number of times of its presence is then defined as follows: often =vect@*size ()=( sin ( ))∗( " +∑ vect@*size () ) .
char
i

i

i

i

3n fact, the mathematical intentional amount 7uantity

"+∑ vect@*size () is the main real key to depict the
i

vect@*size () sin ()=
i i

variation of the surrounding architectural major intentional amount 7uantity

"+∑ vect@*size ( )
i

.

Thus, the to <typedef vector$char& = is the main real operating dynamics to store any possible probable data across any file type. Therefore, for any possible probable file type, <.3;1 & typedef vector$char& =* Hence, <Stora#e & typedef map$char! float & or Stora#e & typedef map$char! int &= to store any possible data as less as it could. 1ven though, the main real operating thread is to resolve the problem of either associate

vect@*size ()
i

'float &

sin ( )=
i

"+∑ vect@*size ()
i

) or associate ' int &

i = often ( char ) ).
i i i

vect@*size ()
0.8 0.7 0.6 0.5 0.4 0.3 0.2 0.1 0 0 10 20 30

sin ( )=
i

i

"+∑ vect@*size ( )
i

"+∑ vect@*size ()
i

40

50

60

70

80

vect@*size ()
9i#ure 3 8 the variation of mathematical amount +uantity

sin ( )=
i

i

"+∑ vect@*size ()
i i

function of the mathematical

intentional amount +uantity

"+∑ vect@*size ()

3n fact, figure 9 illustrates the main real operating dynamics of the variation of mathematical intentional amount

vect@*size ()
i

7uantity

sin ( )=
i

"+∑ vect@*size ()
i i

function of the surrounding mathematical intentional amount 7uantity

"+∑ vect@*size ()