Bulaklak magaganda,
Yamang aking nalaman,
Ako'y Kanya, Siya'y akin.
3. Ang bumagabag noon
Di na makabalisa,
Sapagka't ako ngayon
Nakahimlay sa Kanya.
Mananatili ako
Magpakailanman dito,
Binubulungan ako,
Ako'y Kanya, Siya'y akin.
4. Tanging Kanya kailanman,
Di mapaghihiwalay;
Anong kapahingahan
Si Kristo magbibigay.
Langit, lupa'y mawala,
Liwanag ma'y dumilim,
Ang Diyos aking kasama,
Ako'y Kanya, Siya'y akin.
ASSURANCE AND JOY OF SALVATION — LOVED BY THE LORD
E285
<IP_ADDRESS>.
1. Come and rejoice with me!
For once my heart was poor,
And I have found a treasury
Of love, a boundless store.
2. Come and rejoice with me!
I, once so sick at heart,
Have met with One who knows my case,
And knows the healing art.
3. Come and rejoice with me!
For I was wearied sore,
And I have found a mighty arm
Which holds me evermore.
4. Come and rejoice with me!
My feet so wide did roam,
And One has brought me from afar,
To find in Him my home.
5. Come and rejoice with me!
For I have found a Friend
Who knows my heart's most secret depths,
Yet loves me without end.
6. I knew not of His love;
And He had loved so long,
With love so faithful and so deep,
So tender and so strong.
7. And now I know it all,
Have heard and known His voice,
And hear it still from day to day.
Can I enough rejoice?
ASSURANCE AND JOY OF SALVATION — LOVED BY THE LORD
E286 (T286) (C-231)
<IP_ADDRESS>.D. with chorus.
1. Of Jesus' love that sought me,
When I was lost in sin;
Of wondrous grace that brought me
Back to His fold again;
Of heights and depths of mercy,
Far deeper than the sea,
And higher than the heavens,
My theme shall ever be.

2. He trod in old Judea
Life's pathway long ago;
The people thronged about Him,
His saving grace to know.
He healed the broken-hearted,
And caused the blind to see;
And still His great heart yearneth
In love for even me.

Copyright 1912. Renewed 1940 by Nazarene Publishing House. Used by permission.
KATIYAKAN AT KAGALAKAN NG KALIGTASAN — INIBIG NG PANGINOON
T286 (E286)
1. Nang dahil sa pag-irog sala ko'y tinubos,
Sa biyayang pagsakop ng aking si Hesus;
Sa lawak ng pag-irog buhay inihandog,
Puso ko'y nalamuyot sa Kanya sumunod.
Lalo Siyang tumatamis
Sa tagal ng panahon,
Malalim, mayaman,
Pag-ibig ni Hesus
Lumalawig kailanman.
2. Tinahak Niya ang buhay sa lumang Judea,
Sabik na mga tao pinalibutan Siya;
Lunas ng nagdurusa, liwanag ng mata,
Pag-ibig at ligaya ang idinulot Niya.
Lalo Siyang tumatamis
Sa tagal ng panahon,
Malalim, mayaman,
Pag-ibig ni Hesus
Lumalawig kailanman.
ASSURANCE AND JOY OF SALVATION — LOVED BY THE LORD
E287
<IP_ADDRESS>.
1. Jesus, Jesus, Jesus!
Sweetest Name on earth,
How can I, a sinner,
Come to know its worth?
2. Oh! the sinful sorrow,
Oh! the strangest shame,
That I saw no beauty
In that sacred Name.
3. Never felt the sweetness!
Never knew the grace,
Never saw the love-pain
In that wounded face!
4. Never found the mystery
In that simple word—
Jesus, Jesus, Jesus,
Savior, Lover, Lord.
5. Now 'tis past and over.
Gone my guilt and shame;
Jesus, Jesus did it,
Glory to His Name!
6. Wonderful compassion,
Reaching even me;
Bows my humbled spirit
In captivity.
7. Jesus! Jesus! Jesus!
Loved me in my shame.
Oh! the joy and rapture
Of that sacred Name.
ASSURANCE AND JOY OF SALVATION — LOVED BY THE LORD
E288 (T288)
<IP_ADDRESS>.D.(I)
1. I've found a Friend, oh, such a Friend!
He loved me ere I knew Him;
He drew me with the cords of love,
And thus He bound me to Him.
And round my heart still closely twine
Those ties which naught can sever,
For I am His, and He is mine,
Forever and forever.
2. I've found a Friend, oh, such a Friend!
He bled, He died to save me;
And not alone the gift of life,
But His own self He gave me.

3. I've found a Friend, oh, such a Friend!
So kind, and true, and tender,
So wise a Counsellor and Guide,
So mighty a Defender!
From Him who loves me now so well,
What power my soul can sever?
Shall life or death, or earth or hell?
No, I am His forever.
KATIYAKAN AT KAGALAKAN NG KALIGTASAN — INIBIG NG PANGINOON
T288 (E288)
1. Kaibigang natagpuan,
Si Hesus na nagmahal;
Pag-ibig Niya tinalian
Ako para sa Kanya.
At puso'y nakagapos sa
Di-mapatid na lubid,
Ako'y Kanya, Siya ay akin
Ngayo't magpakailanman.
2. Kaibigang natagpuan,
Buhay Kanyang inalay,
Sarili Niya'y ibinigay
Nagdugo at namatay.
Sarili ko'y di na akin,
Angkin ng Tagabigay;
Puso, lakas, buhay, lahat
Sa Kanya walang hanggan.
3. Kaibigang natagpuan,
Siya'y magiliw at tunay,
Tagapayo, at Patnubay,
Manananggol matibay.
Ano'ng makapaghiwalay?
Sa Kanya at sa akin?
Buhay o kamatayan man?
Wala, ako'y sa Kanya.
ASSURANCE AND JOY OF SALVATION — LOVED BY THE LORD
E289
<IP_ADDRESS>. with chorus.
1. I stand all amazed at the love Jesus offers me,
Confused at the grace that so fully He proffers me;
I tremble to know that for me He was crucified,
That for me, a sinner, He suffered, He bled and died.
O it is wonderful that He should care for me
Enough to die for me!
O it is wonderful, wonderful to me!
2. I marvel that He would descend from His throne divine
To rescue a soul so rebellious and proud as mine;
That He should extend His great love unto such as I,
Sufficient to own, to redeem, and to justify.
O it is wonderful that He should care for me
Enough to die for me!
O it is wonderful, wonderful to me!
3. I think of His side, pierced and bleeding to pay the debt,
Such mercy, such love and devotion can I forget?
No, no! I will praise and adore at the mercy seat,
And testify all my desires He doth fully meet.
O it is wonderful that He should care for me
Enough to die for me!
O it is wonderful, wonderful to me!
Hymns
290 — 299
ASSURANCE AND JOY OF SALVATION — LOVED BY THE LORD
E290
<IP_ADDRESS>. with chorus.
1. I stand amazed in the presence
Of Jesus the Nazarene,
And wonder how He could love me,
A sinner condemned, unclean.
How marvelous! How wonderful!
And my song shall ever be:
How marvelous! How wonderful!
Is my Savior's love for me!
2. For me it was in the garden,
He prayed: "Not my will, but Thine."
He had no tears for His own griefs,
But sweat-drops of blood for mine.
How marvelous! How wonderful!
And my song shall ever be:
How marvelous! How wonderful!
Is my Savior's love for me!
3. In pity angels beheld Him,
And came from the world of light
To strengthen Him in the sorrows
He bore for my soul that night.
How marvelous! How wonderful!
And my song shall ever be:
How marvelous! How wonderful!
Is my Savior's love for me!
4. He took my sins and my sorrows,
He made them His very own;
He bore the burden to Calv'ry
And suffered, and died alone.
How marvelous! How wonderful!
And my song shall ever be:
How marvelous! How wonderful!
Is my Savior's love for me!
5. When with the ransomed in glory
His face I at last shall see,
'Twill be my joy through the ages
To sing of His love for me.
How marvelous! How wonderful!
And my song shall ever be:
How marvelous! How wonderful!
Is my Savior's love for me!
ASSURANCE AND JOY OF SALVATION — LOVED BY THE LORD
E291 (T291) (C-230)
<IP_ADDRESS>. with chorus.
1. I am so glad that our Father in heav'n
Tells of His love in the Book He has giv'n;
Wonderful things in the Bible I see:
This is the dearest, that Jesus loves me.

2. Though I forget Him and wander away,
Still He doth love me wherever I stray;
Back to His dear loving arms would I flee,
When I remember that Jesus loves me.

3. Oh, if there's only one song I can sing,
When in His beauty I see the great King,
This shall my song in eternity be:
"Oh, what a wonder that Jesus loves me."

KATIYAKAN AT KAGALAKAN NG KALIGTASAN — INIBIG NG PANGINOON
T291 (E291)
1. Ako'y nagagalak sa 'ting Ama,
Pag-ibig Niya nilahad sa Biblia;
Pambihirang bagay ang natalos:
Kay giliw, mahal ako ni Hesus.
Ako'y nagagalak nang lubos,
Ako ay mahal ni Hesus;
Ako'y nagagalak nang lubos,
'Ko'y mahal ni Hesus.
2. Siya'y malimot ko man at gumala,
Mahal pa rin Niya kahit nawala;
Babalik sa Kanyang mga bisig,
'Pag maalala Kanyang pag-ibig.
Ako'y nagagalak nang lubos,
Ako ay mahal ni Hesus;
Ako'y nagagalak nang lubos,
'Ko'y mahal ni Hesus.
3. May isa lamang akong maawit,
Sa aking Haring kaibig-ibig;
Ang awit kong di na matatapos,
"Kay hiwaga, 'ko'y mahal ni Hesus."
Ako'y nagagalak nang lubos,
Ako ay mahal ni Hesus;
Ako'y nagagalak nang lubos,
'Ko'y mahal ni Hesus.
ASSURANCE AND JOY OF SALVATION — FORGIVEN BY GOD
E292
<IP_ADDRESS>.D.(A)
1. A debtor to mercy alone,
Of covenant mercy I sing,
Nor fear, with God's righteousness on,
My person and off'rings to bring.
The terrors of law and of God
With me can have nothing to do;
My Savior's obedience and blood
Hide all my transgressions from view.
2. The work which His goodness began,
The arm of His strength will complete;
His promise is Yea and Amen,
And never was forfeited yet.
Things future, nor things that are now,
Not all things below or above,
Can make Him His purpose forego,
Or sever my soul from His love.
3. My name from the palms of His hands
Eternity will not erase;
Imprest on His heart, it remains
In marks of indelible grace.
Yes! I to the end shall endure,
As sure as the earnest is giv'n;
More happy, but not more secure,
When all earthly ties have been riv'n.
ASSURANCE AND JOY OF SALVATION — CLEANSED BY THE BLOOD
E293
<IP_ADDRESS>.
1. Cleansed in our Savior's precious blood,
Filled with the fulness of our God,
Walking by faith the path He trod,
Hallelujah! Hallelujah!
2. Leaning our heads on Jesus' breast,
Knowing the joy of that sweet rest,
Finding in Him the chief, the best,
Hallelujah! Hallelujah!
3. Kept by His pow'r from day to day,
Held by His hand, we cannot stray,
Glory to glory all the way,
Hallelujah! Hallelujah!
4. Living in us His own pure life,
Giving us rest from inward strife,
From strength to strength, from death to life,
Hallelujah! Hallelujah!
5. O what a Savior we have found;
Well may we make the world resound
With one continual joyous sound,
Hallelujah! Hallelujah!
ASSURANCE AND JOY OF SALVATION — CLEANSED BY THE BLOOD
E294
<IP_ADDRESS>. with chorus.
1. Gone from my heart the world and all its charms;
Now through the blood I'm saved from all alarms;
Down at the cross my heart is bending low;
The precious blood of Jesus cleanses white as snow.
I love Him, I love Him,
Because He first loved me,
And purchased my salvation on Calv'ry's tree.
2. Once I was lost, and fallen deep in sin;
Once was a slave to passions fierce within;
Once was afraid to meet an angry God,
But now I'm cleansed from every stain thro' Jesus' blood.
I love Him, I love Him,
Because He first loved me,
And purchased my salvation on Calv'ry's tree.
3. Once I was bound, but now I am set free;
Once I was blind, but now the light I see;
Once I was dead, but now in Christ I live,
To tell the world around the peace that He doth give.
I love Him, I love Him,
Because He first loved me,
And purchased my salvation on Calv'ry's tree.
ASSURANCE AND JOY OF SALVATION — JUSTIFIED IN CHRIST
E295 (T295) (C-237)
<IP_ADDRESS>.
1.
2. Lord, I believe Thy precious blood,
Which, at the mercy seat of God,
Forever doth for sinners plead,
For me, e'en for my soul, was shed.
3. Lord, I believe were sinners more
Than sands upon the ocean shore,
Thou hast for all a ransom paid,
For all a full redemption made.
4. Bold can I stand in every way,
For who aught to my charge shall lay?
Fully, by Thee, absolved I am
From sin and fear, from guilt and shame.
5. This spotless robe the same appears,
When ruined nature sinks in years;
No age can change its glorious hue,
Its glory is forever new.
6. Thou God of power, Thou God of love,
Let all Thy saints Thy mercy prove;
Our beauty this, our glorious dress,
Jesus the Lord, our Righteousness.
KATIYAKAN AT KAGALAKAN NG KALIGTASAN — INARING-MATUWID KAY KRISTO
T295 (E295)
1. Kristo ng Diyos, kat'wiran ko,
Kagandahan at gayak ko;
Sa nag-aalab na mundo,
Makapagtataas-noo.
2. Nananalig sa Iyong dugo,
Na nasa biyayang trono;
Samo ng mga salarin,
Binubo para sa akin.
3. Mas marami mang salarin,
Kaysa bilang ng buhangin;
Nagbayad Ka ng halaga,
Katubusa'y Iyong ginawa.
4. Matapang akong titindig,
Sino ang sa 'ki'y sisingil?
Ako'y lubos kinalagan,
Sa sala at kahihiyan.
5. Balabal na walang dungis,
Kailanman ay ibibihis;
L'walhating di na kukupas,
Sariwa't di-magwawakas.
6. Diyos ng kalakasa't sinta,
Awa Mo'y makita nawa;
Gayak nami't kagandahan,
Hesus, ang aming Kat'wiran.
ASSURANCE AND JOY OF SALVATION — JUSTIFIED IN CHRIST
E296 (T296) (C-234)
<IP_ADDRESS>.8.8. with repeat.
1. And can it be that I should gain
An int'rest in the Savior's blood?
Died He for me, who caused His pain?
For me, who Him to death pursued?
Amazing love! how can it be
That Thou, my God, shouldst die for me?
Amazing love! how can it be
That Thou, my God, shouldst die for me?
2. 'Tis mystery all! The Immortal dies!
Who can explore His strange design?
In vain the firstborn seraph tries
To sound the depths of love Divine!
'Tis mercy all! let earth adore,
Let angel minds inquire no more.
'Tis mercy all! let earth adore,
Let angel minds inquire no more.
3. He left His Father's throne above,
So free, so infinite His grace;
Emptied Himself of all but love,
And bled for Adam's helpless race:
'Tis mercy all, immense and free;
For, O my God, it found out me.
'Tis mercy all, immense and free;
For, O my God, it found out me.
4. Long my imprisoned spirit lay
Fast bound in sin and nature's night;
Thine eye diffused a quickening ray,
I woke, the dungeon flamed with light;
My chains fell off, my heart was free,
I rose, went forth, and followed Thee.
My chains fell off, my heart was free,
I rose, went forth, and followed Thee.
5. No condemnation now I dread;
Jesus, and all in Him, is mine!
Alive in Him, my living Head,
And clothed in righteousness Divine,
Bold I approach the eternal throne,
And claim the crown, through Christ my own.
Bold I approach the eternal throne,
And claim the crown, through Christ my own.
KATIYAKAN AT KAGALAKAN NG KALIGTASAN — INARING-MATUWID KAY KRISTO
T296 (E296)
1. Manliligtas ang nagdugo,
Bakit ako nakinabang?
Namatay Siya sa halip ko,
Ginanap ang kaligtasan.
Pag-ibig, mahiwaga rin,
Diyos namatay para sa 'kin.
2. Namatay Siya, kay hiwaga—
Diyos na walang kamatayan!
Pag-ibig, di-matingkala
Taas, haba, lalim, luwang!
Pati anghel namamangha,
Diyos sambahin sa habag Niya.
3. Nilisan trono ng Ama,
Mahabagin, Siya'y bumaba
Upang iligtas sa sala
Ang lahing walang pag-asa.
Di-masukat, libreng awa,
Handog sa tulad kong aba.
4. Bihag ang espiritu ko,
Ginapos ng sala't dilim;
Tinanglawan ng mata Mo,
Piitan ko'y nagniningning,
Nangalas ang tanikala,
Sundan Kita, malaya na.
5. Hatol ay di-katakutan,
Hesus at lahat ay akin!
Kay Kristong Ulo manahan,
Dibinong kat'wiran kamtin;
Sa luklukan ng biyaya,
Si Kristo'y aking korona.
ASSURANCE AND JOY OF SALVATION — JUSTIFIED IN CHRIST
E297 (T297) (C-236)
<IP_ADDRESS>.
1. "No condemnation!" precious word!
Consider it, my soul!
Thy sins were all on Jesus laid,
His stripes have made thee whole.
2. In God's own presence now for us
The Savior doth appear;
The saints, as jewels on His heart,
Jesus doth ever bear.
3. "No condemnation!" O my soul,
'Tis God that speaks the word;
Perfect in comeliness art thou
In Christ, the risen Lord.
4. Teach me, O God, to fix mine eyes
On Christ, the spotless Lamb,
So shall I love Thy precious will,
And glorify His name.
KATIYAKAN AT KAGALAKAN NG KALIGTASAN — INARING-MATUWID KAY KRISTO
T297 (E297)
1. Walang hatol, kay hiwaga!
Puso ko'y natuwa!
Sala ko'y dala ni Hesus,
Namatay, tumubos.
2. Ang dugo Niya sa harapan
Ng Diyos, namagitan;
Mga banal mahalaga,
Inalagaan Niya.
3. Walang hatol, kalul'wa ko,
Salita ng Diyos 'to,
Kay Kristong muling nabuhay,
Ika'y matagumpay.
4. Diyos sa akin ituturo,
Tumingin kay Kristo;
Pag-ibig Mo'y aking kamtin,
Ngalan l'walhatiin.
ASSURANCE AND JOY OF SALVATION — JUSTIFIED IN CHRIST
E298 (T298) (C-238)
<IP_ADDRESS>. with chorus.
1. My hope is built on nothing less
Than Jesus Christ, my righteousness;
I dare not trust the sweetest frame,
But wholly lean on Jesus' name.
On Christ, the solid Rock, I stand;
All other ground is sinking sand,
All other ground is sinking sand.
2. When darkness veils His lovely face,
I rest on His unchanging grace;
In every high and stormy gale,
My anchor holds within the veil.
On Christ, the solid Rock, I stand;
All other ground is sinking sand,
All other ground is sinking sand.
3. His oath, His covenant, His blood,
Support me in the whelming flood;
When all around my soul gives way,
He then is all my hope and stay.
On Christ, the solid Rock, I stand;
All other ground is sinking sand,
All other ground is sinking sand.
4. When He shall come with trumpet sound,
Oh, may I then in Him be found;
In Him, my righteousness, alone,
Faultless to stand before the throne.
On Christ, the solid Rock, I stand;
All other ground is sinking sand,
All other ground is sinking sand.
KATIYAKAN AT KAGALAKAN NG KALIGTASAN — INARING-MATUWID KAY KRISTO
T298 (E298)
1. Pag-asa ko'y itinatag
Kay Kristo — aking kat'wiran;
Sa iba ay di-panatag,
Kristo lang maaasahan.
Si Kristo'y saligang-Bato,
Ibang lupa ay balaho,
Ibang lupa ay balaho.
2. Matakpan man Kanyang mukha,
Biyaya Niya'y di nag-iba;
Bumagyo man o bumaha,
Matatag pa rin ang angkla.
Si Kristo'y saligang-Bato,
Ibang lupa ay balaho,
Ibang lupa ay balaho.
3. Dugo't tipan Niya ay tiyak,
Ako'y nasa Kanyang kamay;
Ang paligid ma'y mawasak,
Siya'y nanatiling matibay.
Si Kristo'y saligang-Bato,
Ibang lupa ay balaho,
Ibang lupa ay balaho.
4. Pagdating Niyang may trumpeta,
Ako'y mapasa-loob Niya;
Katuwiran ko'y tanging Siya,
Sa lukluka'y walang sala.
Si Kristo'y saligang-Bato,
Ibang lupa ay balaho,
Ibang lupa ay balaho.
ASSURANCE AND JOY OF SALVATION — RECONCILED TO GOD
E299 (T299) (C-240)
<IP_ADDRESS>.
1.
A sinner reconciled through blood;
This, this indeed is peace.
2. By nature and by practice far,
How very far from God;
Yet now by grace brought nigh to Him,
Through faith in Jesus' blood.
3. So nigh, so very nigh to God,
I cannot nearer be;
For in the person of His Son
I am as near as He.
4. So dear, so very dear to God,
More dear I cannot be;
The love wherewith He loves the Son,
Such is His love to me.
5. Why should I ever anxious be,
Since such a God is mine?
He watches o'er me night and day,
And tells me "Mine is thine."
KATIYAKAN AT KAGALAKAN NG KALIGTASAN — IPINAGKASUNDO SA DIYOS
T299 (E299)
1. Walang takot dulog sa Diyos,
O anong kataga!
Sa dugo'y kasundong lubos;
O kay payapa nga.
2. Gawi't likas kay layo nga,
O kay layo sa Diyos;
Dahil sa pananalig nga
Napalapit sa Diyos.
3. Kay lapit, kay lapit sa Diyos,
Walang kay lapit pa;
Kasing lapit ako sa Diyos,
Tulad ng Anak Niya!
4. Sa Diyos 'ko'y mahal na mahal,
Di na mahigitan;
Sa Anak Niyang pagmamahal,
Sa akin din laan.
5. Bakit pa mababahala,
Kung gayon ang Diyos ko?
Gabi't araw Siyang bahala,
Sabi'y "Ako'y sa iyo."


KBAFetchedResultsObserverDelegate
@protocol KBAFetchedResultsObserverDelegate <NSObject>
@optional
/**
Called before the fetched results observer updates its content. Corresponds to the `controllerWillChangeContent:` NSFetchedResultsControllerDelegate method.
@param observer The sender of the message
*/
- (void)fetchedResultsObserverWillChange:(KBAFetchedResultsObserver *)observer;
/**
Called after the fetched results observer updates its content. Corresponds to the `controllerDidChangeContent:` NSFetchedResultsControllerDelegate method.
@param observer The sender of the message
*/
- (void)fetchedResultsObserverDidChange:(KBAFetchedResultsObserver *)observer;
/**
Called after the fetched results observer updates its content, provides a an array of objects conforming to KBAFetchedResultsObserverChange protocol that describe each individual change.
This method is preferred over fetchedResultsObserverDidChange: and will be called instead of fetchedResultsObserverDidChange: if the delegate implements both.
@param observer The sender of the message
@param changes The array of change objects
*/
- (void)fetchedResultsObserver:(KBAFetchedResultsObserver *)observer didObserveChanges:(NSArray<id<KBAFetchedResultsObserverChange>> *)changes;
@end
Undocumented
-
Called before the fetched results observer updates its content. Corresponds to the
controllerWillChangeContent:
NSFetchedResultsControllerDelegate method.Declaration
Objective-C
- (void)fetchedResultsObserverWillChange: (nonnull KBAFetchedResultsObserver *)observer;
Parameters
observer
The sender of the message
-
Called after the fetched results observer updates its content. Corresponds to the
controllerDidChangeContent:
NSFetchedResultsControllerDelegate method.Declaration
Objective-C
- (void)fetchedResultsObserverDidChange: (nonnull KBAFetchedResultsObserver *)observer;
Parameters
observer
The sender of the message
-
Called after the fetched results observer updates its content, provides a an array of objects conforming to KBAFetchedResultsObserverChange protocol that describe each individual change.
This method is preferred over fetchedResultsObserverDidChange: and will be called instead of fetchedResultsObserverDidChange: if the delegate implements both.
Declaration
Objective-C
- (void)fetchedResultsObserver:(nonnull KBAFetchedResultsObserver *)observer didObserveChanges: (nonnull NSArray<id<KBAFetchedResultsObserverChange>> *) changes;
Parameters
observer
The sender of the message
changes
The array of change objects


Click each name to load the data into a Worksheet. Clicking the name a second time clears the workbook and re-loads the data.


Please provide your Google Accounts username/password to get a ClientLogin token for Google Talk. You must use an App-specific password here.
Yes, we know we're asking for your Google Accounts credentials in a webapp.
No we're not happy with this.
Yes, we (think we) need to do it this way.
libjingle needs a ClientLogin token and due to single-origin issues, we have to proxy the request through the webapp. If anyone has a better idea, please please please let us know.


In the framework of Symbolic Data Analysis, a relatively new approach to the statistical analysis of multi-valued data, we consider histogram-valued data, i.e., data described by univariate histograms. The methods and the basic statistics for histogram-valued data are mainly based on the L2 Wasserstein metric between distributions, i.e., the Euclidean metric between quantile functions. The package contains unsupervised classification techniques, least square regression and tools for histogram-valued data and for histogram time series. An introducing paper is Irpino A. Verde R. (2015) <doi:10.1007/s11634-014-0176-4>.
| Version: | 1.0.1 |
| Depends: | R (≥ 3.1), methods |
| Imports: | graphics, class, FactoMineR, ggplot2, ggridges, grid, histogram, grDevices, stats, utils, Rcpp |
| LinkingTo: | Rcpp, RcppArmadillo |
| Published: | 2018-03-20 |
| Author: | Antonio Irpino [aut, cre] |
| Maintainer: | Antonio Irpino <antonio.irpino at unicampania.it> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| NeedsCompilation: | yes |
| Materials: | README |
| CRAN checks: | HistDAWass results |
| Reference manual: | HistDAWass.pdf |
| Package source: | HistDAWass_1.0.1.tar.gz |
| Windows binaries: | r-devel: HistDAWass_1.0.1.zip, r-release: HistDAWass_1.0.1.zip, r-oldrel: HistDAWass_1.0.1.zip |
| OS X binaries: | r-release: HistDAWass_1.0.1.tgz, r-oldrel: HistDAWass_1.0.1.tgz |
| Old sources: | HistDAWass archive |
Please use the canonical form https://CRAN.R-project.org/package=HistDAWass to link to this page.


BEETLEJUICE A film review by Craig Good Copyright 1988 Craig Good
Did you know that people who commit suicide become civil servants in the afterlife? Do you know how to pronounce "Betelgeuse"? You would if You had seen BEETLEJUICE, the latest from Tim Burton. If you saw PEE WEE'S BIG ADVENTURE just try to picture a feature full of Large Marge characters and you'll be close. But this is in many ways more like Burton's wonderful short "Vincent" than PEE WEE was.
In fact, this is more like Tim Burton than his last feature. PEE WEE'S BIG ADVENTURE was Tim Burton at the service of Paul Reubens, while BEETLEJUICE is Tim Burton at the service of Tim Burton. For that reason I can recommend this movie to people who liked PEE WEE, and also to those who hated it. It's the same in the right ways and different in the right ways. Confused? I'll make it simple: BEETLEJUICE is a much better film.
John Lasseter, one of Burton's classmates at Cal Arts, once said that being a film director could be a waste of Tim's talents as a designer. I'm happy to say that his inventive, playful, slightly dark sense of design is a major asset of the movie. Another asset is the premise: A newlydead couple haunting their New England home want to frighten off the neurotic New Yorkers who move in down stairs. The trouble is they aren't very good at it. How they get help is the crux of the movie, and I won't spoil any of it for you.
BEETLEJUICE is funny, well-crafted and features a wonderful cast. Even without Michael Keaton's manic-oppressive performance you'd have your money's worth, so when he does appear it's a real bonus. All but the most nightmare-prone tots should get a kick out of the movie. If they weren't scared by Large Marge they'll be fine. A big part of the fun is that Burton delivers plenty of adult humor while still delivering enough good physical comedy to keep the kiddies in giggles. Now we just need to get the Academy to create a special award for Best Use of a Harry Belafonte Album in a Motion Picture Soundtrack...
--Craig ...{ucbvax,pyramid,sun}!pixar!good
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


TIMES(2) Linux Programmer's Manual TIMES(2) NAME times - get process times SYNOPSIS #include <sys/times.h> clock_t times(struct tms *buf); DESCRIPTION times() stores the current process times in the struct tms that buf points to. The struct tms is as defined in <sys/times.h>: struct tms { clock_t tms_utime; /* user time */ clock_t tms_stime; /* system time */ clock_t tms_cutime; /* user time of children */ clock_t tms_cstime; /* system time of children */ }; The tms_utime field contains the CPU time spent executing instructions of the calling process. The tms_stime field contains the CPU time spent in the system while executing tasks on behalf of the calling process. The tms_cutime field contains the sum of the tms_utime and tms_cutime values for all waited-for terminated children. The tms_cstime field contains the sum of the tms_stime and tms_cstime values for all waited-for termi‐ nated children. Times for terminated children (and their descendants) are added in at the moment wait(2) or waitpid(2) returns their process ID. In particular, times of grandchildren that the children did not wait for are never seen. All times reported are in clock ticks. RETURN VALUE times() returns the number of clock ticks that have elapsed since an arbitrary point in the past. The return value may overflow the possible range of type clock_t. On error, (clock_t) -1 is returned, and errno is set appropriately. ERRORS EFAULT tms points outside the process's address space. CONFORMING TO SVr4, 4.3BSD, POSIX.1-2001. NOTES The number of clock ticks per second can be obtained using: sysconf(_SC_CLK_TCK); In POSIX.1-1996 the symbol CLK_TCK (defined in <time.h>) is mentioned as obsolescent. It is obsolete now. In Linux kernel versions before 2.6.9, if the disposition of SIGCHLD is set to SIG_IGN then the times of terminated children are automatically included in the tms_cstime and tms_cutime fields, although POSIX.1-2001 says that this should only happen if the calling process wait(2)s on its children. This nonconformance is rectified in Linux 2.6.9 and later. On Linux, the buf argument can be specified as NULL, with the result that times() just returns a function result. However, POSIX does not specify this behavior, and most other UNIX implementations require a non-NULL value for buf. Note that clock(3) also returns a value of type clock_t, but this value is measured in units of CLOCKS_PER_SEC, not the clock ticks used by times(). On Linux, the "arbitrary point in the past" from which the return value of times() is measured has varied across kernel versions. On Linux 2.4 and earlier this point is the moment the system was booted. Since Linux 2.6, this point is (2^32/HZ) - 300 (i.e., about 429 million) seconds before system boot time. This variability across kernel versions (and across UNIX implementations), combined with the fact that the returned value may overflow the range of clock_t, means that a portable applica‐ tion would be wise to avoid using this value. To measure changes in elapsed time, use clock_gettime(2) instead. Historical SVr1-3 returns long and the struct members are of type time_t although they store clock ticks, not seconds since the Epoch. V7 used long for the struct members, because it had no type time_t yet. BUGS A limitation of the Linux system call conventions on some architectures (notably i386) means that on Linux 2.6 there is a small time window (41 seconds) soon after boot when times() can return -1, falsely indicating that an error occurred. The same problem can occur when the return value wraps passed the maximum value that can be stored in clock_t. SEE ALSO time(1), getrusage(2), wait(2), clock(3), sysconf(3), time(7) COLOPHON This page is part of release 3.44 of the Linux man-pages project. A description of the project, and information about reporting bugs, can be found at http://www.kernel.org/doc/man-pages/. Linux 2012-10-22 TIMES(2)


Daily Crypto
Lookup daily values of various crypto currencies.
Symbol: (See the
README
for a list of supported symbols.)
Date: (yyyy-mm-dd)
Bitcoin
$0.00
Photo by Jana Sabeth Schultz on Unsplash


vignettes/wflow-09-workshop.Rmd
wflow-09-workshop.Rmd
The workflowr R package makes it easier for you to organize, reproduce, and share your data analyses. This short tutorial will introduce you to the workflowr framework. You will create a workflowr project that implements a small data analysis in R, and by the end you will have a working website that you can use to share your work. If you are completing this tutorial as part of a live workshop, please follow the setup instructions in the next section prior to arriving.
Workflowr combines literate programming with R Markdown and version control with Git to generate a website containing time-stamped, versioned, and documented results. By the end of this tutorial, you will have a website hosted on GitHub Pages that contains the results of a reproducible statistical analysis.
To minimize the possibility of any potential issues with your computational setup, you are encouraged to update your version of RStudio (Help
-> Check for Updates
) and update your R packages:
If you do encounter any issues during the tutorial, consult the Troubleshooting section for solutions to the most common problems.
To help you stay organized, workflowr creates a project directory with the necessary configuration files as well as subdirectories for saving data and other project files. This tutorial uses the RStudio project template for workflowr, but note that the same can be achieved via the function wflow_start()
.
To start your workflowr project, follow these steps:
Open RStudio.
In the R console, run wflow_git_config()
to register your name and email with Git. This only has to be done once per computer. If you’ve used Git on this machine before, you can skip this step. For a better GitHub experience, use the same email you used to register your GitHub account.
In the menu bar, choose File
-> New Project
.
Choose New Directory
and then scroll down the list of project types to select workflowr project
. If you don’t see the workflowr project template, go to Troubleshooting.
Type myproject
as the directory name, choose where to save it on your computer, and choose Create Project
.
RStudio executed wflow_start()
to create the workflowr project myproject
and opened the project in RStudio. Note the workflowr directory structure in the Files pane.
myproject/
|-- .gitignore
|-- .Rprofile
|-- _workflowr.yml
|-- analysis/
| |-- about.Rmd
| |-- index.Rmd
| |-- license.Rmd
| |-- _site.yml
|-- code/
| |-- README.md
|-- data/
| |-- README.md
|-- docs/
|-- myproject.Rproj
|-- output/
| |-- README.md
|-- README.md
The most important directory for you to pay attention to now is the analysis/
directory. This is where you should store all your analyses as R Markdown (Rmd) files. Other directories created for your convenience include data/
for storing data, and code/
for storing long-running or supplemental code you don’t want to include in an Rmd file. Note that the docs/
directory is where the website HTML files will be created and stored by workflowr, and should not be edited by the user.
In the R console, run getwd()
to return the current working directory. Note that it is set to the location of the workflowr project on your computer. Every time you open this RStudio project (e.g. by clicking on myproject.Rproj
), it will change the working directory (as well as the Files pane) to this directory. This allows you to use relative paths to files when performing your analysis, which will make it easier for you and others to run the code on other machines. In other words, instead of writing an absolute path like:
Instead you can write a relative path that will work for any user on any operating system:
Open the file analysis/index.Rmd
for editing. It should already be open in the RStudio Editor pane from when you created the project. If not, use the Files pane to navigate to the directory analysis/
and click on index.Rmd
to open it for editing. This index file is special because it is used to create the home page for your project. Write a short introductory message, e.g. “Welcome to my first workflowr website”, and then save the file.
In the R console, run wflow_build()
. This will build all the R Markdown files in analysis/
1, save them in docs/
, and then open docs/index.html
in the RStudio Viewer pane. Ignore the warnings in the workflowr report for now; we will return to these later.
To begin your analysis, you will use a built-in data set from R.2 The data set ToothGrowth
contains the length of the teeth for 60 guinea pigs given 3 different doses of vitamin C either via orange juice (OC
) or directly with ascorbic acid (VC
). To explore the data set, run the following in the R console.
## len supp dose
## Min. : 4.20 OJ:30 Min. :0.500
## 1st Qu.:13.07 VC:30 1st Qu.:0.500
## Median :19.25 Median :1.000
## Mean :18.81 Mean :1.167
## 3rd Qu.:25.27 3rd Qu.:2.000
## Max. :33.90 Max. :2.000
## 'data.frame': 60 obs. of 3 variables:
## $ len : num 4.2 11.5 7.3 5.8 6.4 10 11.2 11.2 5.2 7 ...
## $ supp: Factor w/ 2 levels "OJ","VC": 2 2 2 2 2 2 2 2 2 2 ...
## $ dose: num 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 ...
To mimic a real project that will have external data files, save the ToothGrowth
data set to the data/
subdirectory using write.csv()
.
To demonstrate the reproducibility features of workflowr, you will perform a small analysis.
In the R console, open a new R Markdown file with wflow_open()
. It will open automatically for editing in RStudio.
Rmd files allow you to mix text, code, and results in the same output document (which can be HTML, PDF, Word, and more). In order to accomplish this, it uses a specific layout and syntax. At the top of the document between the dashes ---
is the YAML3 header that contains metadata about the document such as the title. Code chunks4 are specified using the syntax below:
```{r optional-chunk-name}
<code goes here>
```
And the code chunks are executed in order from top to bottom. Any text outside of a code chunk is interpreted as prose that should not be executed as R code.
The workflowr framework accepts any valid Rmd file that can be converted to HTML. In the YAML header, note that workflowr provides its own custom output format, workflowr::wflow_html
. This function extends the default output format html_document
from the rmarkdown package, and thus accepts all the same arguments. The only other minor difference is that wflow_open()
adds the editor option chunk_output_type: console
, which causes the code to be executed in the R console instead of within the document. If you’d prefer the results of the code chunks be embedded inside the document while you perform the analysis, you can delete those lines (note that this has no effect on the final results, only on the display within RStudio).
Copy the code chunk below and paste it at the bottom of the file teeth.Rmd
. The code imports the data set from the file you previously created5. Execute the code in the R console by clicking on the Run button or using the shortcut Ctrl
/CMD
+Enter
.
```{r import-teeth}
teeth <- read.csv("data/teeth.csv", row.names = 1)
head(teeth)
```
Note: if you copy and paste this chunk, make sure to remove any spaces before each of the backticks (```
) so that they will be correctly recognized as indicating the beginning and end of a code chunk.
Next create some boxplots to explore the data. Copy the code chunk below and paste it at the bottom of the file teeth.Rmd
. Execute the code to see create the plots.
```{r boxplots}
boxplot(len ~ dose, data = teeth)
boxplot(len ~ supp, data = teeth)
boxplot(len ~ dose + supp, data = teeth)
```
To compare the tooth length of the guinea pigs given orange juice versus those given vitamin C, you could perform a permutation-based statistical test. This involves comparing the observed difference in teeth length due to the supplement method to the observed differences calculated from random permutations of the data. The basic idea is that if the observed difference is an outlier compared to the differences generated after permuting the supplement method column, it is more likely to be a true signal not due to chance alone. Copy the code chunk below, paste it at the bottom of of the file teeth.Rmd
, and execute it. It demonstrates the idea of a permutation6:
```{r permute}
# Observed difference in teeth length due to supplement method
mean(teeth$len[teeth$supp == "OJ"]) - mean(teeth$len[teeth$supp == "VC"])
# Permute the observations
supp_perm <- sample(teeth$supp)
# Calculate mean difference in permuted data
mean(teeth$len[supp_perm == "OJ"]) - mean(teeth$len[supp_perm == "VC"])
```
In the R console, run wflow_build()
. Note the value of the observed difference in the permuted data.
In RStudio, click on the Knit button. Has the value of the observed difference in the permuted data changed? It should be identical. This is because workflowr always sets the same seed prior to running the analysis.7 To better understand this behavior as well as the other reproducibility safeguards and checks that workflowr performs for each analysis, click on the workflowr button at the top and select the “Checks” tab.
Navigate back to the file analysis/index.Rmd
. If you closed it, you can open it from the Files pane or run the following in the R console:
Copy the line below and paste it at the bottom of the file analysis/index.Rmd
. This creates a hyperlink to the tooth analysis. The text between the square brackets is displayed on the webpage, and the text in parentheses is the relative path to the teeth webpage. Note that you don’t need to include the subdirectory docs/
because index.html
and teeth.html
are both already in docs/
. Also note that you need to use the file extension .html
since that is the file that needs to be opened by the web browser.
* [Teeth growth](teeth.html)
Run wflow_build()
and then confirm that clicking on the link “Teeth growth” takes you to your teeth analysis page.
In the R console, run wflow_status()
. This will show you the status of each of the Rmd files in your workflowr project. The status is determined by the Git status of the Rmd file and its corresponding HTML file. The file teeth.Rmd
is classified as “Scratch” because it has not yet been committed (i.e. saved in a snapshot). In contrast, the file index.Rmd
has status “Unpublished” because the Rmd file has been committed (an initial commit was made when the project was first started) but not its corresponding HTML file.
In the R console, run the command below to “publish” your results 8. The function wflow_publish()
performs three steps: 1) commits the files, 2) rebuilds the Rmd files, and 3) commits the HTML and figure files. This guarantees that the results in each HTML file is always generated from an exact, known version of the Rmd file (you can see this version embedded in the workflowr report). The second argument is the message that is associated with the Git commit. This way you can better understand the motivation for each change that you made when you review the development history of your project (e.g. with git log
).
Open the workflowr report of teeth.html
by clicking on the button at the top of the page. Navigate to the tab “Past versions”. Note that the record of all past versions will be saved here. Once the project has been added to GitHub (you will do this in the next section), the “Past versions” tab will include hyperlinks for convenient viewing of the past versions of the Rmd and HTML files.
You have successfully created and shared a reproducible research website. Using the same workflowr commands, you can do the same for one of your own research projects and share it with collaborators and colleagues.
To learn more about workflowr, you can read the following vignettes:
If you just installed workflowr, close and re-open RStudio. Also, make sure you scroll down to the bottom of the list.
wflow_use_github()
.If wflow_use_github()
failed unexpectedly when creating the GitHub repository, or if you declined by entering n
, you can manually created the repository on GitHub. After logging in to GitHub, click on the “+” in the top right of the page. Choose “New repository”. For the repository name, type myproject
. Do not change any of the other settings. Click on the green button “Create repository”. Once that is completed, you can return to the next step in the tutorial.
wflow_git_push()
.Unfortunately this function has a high failure rate because it relies on the correct configuration of various system software dependencies. If this fails, you can push to Git using another technique, but this will require that you have previously installed Git on your computer. For example, you can use the RStudio Git pane (click on the green arrow that says “Push”). Alternatively, you can directly use Git by running git push
in the terminal.
The default behavior when wflow_build()
is run without any arguments is to build any R Markdown file that has been edited since its corresponding HTML file was last built.↩
While not the most realistic, this avoids any issues with downloading data from the internet and saving it correctly.↩
You can insert a code chunk via the menu bar, Code
-> Insert Chunk
, or using the keyboard shortcut (Ctrl
+Alt
+I
on Windows and Linux, Command
+Option
+I
on macOS).↩
Note that the default working directory for a workflowr project is the root of the project. Hence the relative path is data/teeth.csv
. The working directory can be changed via the workflowr option knit_root_dir
in _workflowr.yml
. See ?wflow_html
for more details.↩
You won’t implement the full permutation method in this tutorial.↩
Note that everyone in the workshop will have the same result because by default workflowr uses a seed that is the date the project was created as YYYYMMDD. You can change this by editing the file _workflowr.yml
.↩
The command uses the wildcard character *
to match all the Rmd files in analysis/
. If this fails on your computer, try running the more verbose command: wflow_publish(c("analysis/index.Rmd", "analysis/teeth.Rmd", "data/teeth.csv"), message = "Analyze teeth growth")
↩
If your GitHub repository wasn’t automatically opened by wflow_git_push()
, you can manually enter the URL into the browser: https://github.com/username/myproject
.↩


Gentle Intro: Index
1
Introduction
2
Values, Types, and Other Goodies
2.1
Polymorphic Types
2.2
User-Defined Types
2.2.1
Recursive Types
2.3
Type Synonyms
2.4
Built-in Types Are Not Special
2.4.1
List Comprehensions and Arithmetic Sequences
2.4.2
Strings
3
Functions
3.1
Lambda Abstractions
3.2
Infix Operators
3.2.1
Sections
3.2.2
Fixity Declarations
3.3
Functions are Non-strict
3.4
"Infinite" Data Structures
3.5
The Error Function
4
Case Expressions and Pattern Matching
4.1
Pattern-Matching Semantics
4.2
An Example
4.3
Case Expressions
4.4
Lazy Patterns
4.5
Lexical Scoping and Nested Forms
4.6
Layout
5
Type Classes and Overloading
6
Types, Again
6.1
The Newtype Declaration
6.2
Field Labels
6.3
Strict Data Constructors
7
Input/Output
7.1
Basic I/O Operations
7.2
Programming With Actions
7.3
Exception Handling
7.4
Files, Channels, and Handles
7.5
Haskell and Imperative Programming
8
Standard Haskell Classes
8.1
Equality and Ordered Classes
8.2
The Enumeration Class
8.3
The Read and Show Classes
8.4
Derived Instances
9
About Monads
9.1
Monadic Classes
9.2
Built-in Monads
9.3
Using Monads
10
Numbers
10.1
Numeric Class Structure
10.2
Constructed Numbers
10.3
Numeric Coercions and Overloaded Literals
10.4
Default Numeric Types
11
Modules
11.1
Qualified Names
11.2
Abstract Data Types
11.3
More Features
12
Typing Pitfalls
12.1
Let-Bound Polymorphism
12.2
Numeric Overloading
12.3
The Monomorphism Restriction
13
Arrays
13.1
Index types
13.2
Array Creation
13.3
Accumulation
13.4
Incremental updates
13.5
An example: Matrix Multiplication
14
The Next Stage
15
Acknowledgements


Email is required. Invalid email address.
Password is required.
Confirm Password is required.
Name is required.
Company name is required.


On the Waterfront
This album includes historic photos from some famous shipyard. All the photos were gleened from Flickr and are provided here without attribution, which is a horrible, horrible thing.
This album includes historic photos from some famous shipyard. All the photos were gleened from Flickr and are provided here without attribution, which is a horrible, horrible thing.


{% extends 'layout.html' %} {% block body %} {% include 'includes/_messages.html' %}
Your current balance is {{ balance }} Laifu_coin
{% from "includes/_formhelpers.html" import render_field %}
{{render_field(form.username, class_="form-control")}}
{{render_field(form.amount, class_="form-control")}}
{% endblock %}


Turkish, Russian Troops Begin Joint Patrols in Northern Syria
Earlier in the day, some 300 Russian soldiers and 20 armoured vehicles were delivered to northern Syria where Russia and Turkey have been patrolling border areas.
Turkish and Russian troops have begun joint patrols in northern Syria, Turkey's Ministry of National Defence said.
On 1 November, about 300 Russian soldiers and 20 armoured vehicles arrived in northern Syria where the Russian police together with Turkey were carrying out joint patrols of the area.
Last month, Russian President Vladimir Putin and Turkish President Recep Tayyip Erdogan agreed that the Russian military police and Syrian border guards would facilitate the withdrawal of Kurdish militants from the 18-mile safe zone on the Turkish-Syrian border within 150 hours. It was also agreed that Moscow and Ankara would start joint patrols in the area.
Earlier this week, the US also conducted a patrol on the Turkish-Syrian border for the first time since President Donald Trump announced his decision to withdraw troops from Syria. The patrol, reportedly conducted by five armoured vehicles with US flags, took place near the town of Qahtaniyah.
On 9 October, Turkey launched a military operation in northern Syria to oust Kurdish militia and Daesh* terrorists from the border area and set up a safe zone to accommodate Syrian refugees there.
*Daesh (also known as ISIS/ISIL/IS) is a terrorist group banned in Russia


Date Field:
NOTE: Set the gAgendaMask options to -1 to enable all agenda effects.
Copyright© 2003-2007 Idemfactor Solutions, Inc. All rights reserved.


Premium
This is really a good deal!
$79
Some great feature
Another super feature
And more...
Sign up
Plus
This is really a good deal!
$89
Some great feature
Another super feature
And more...
Sign up
Basic
Basic membership
$69
Choose the one on the left
We need moneyy
And more...
Sign up


David Russell
Democrat
Retired(mostly). Full Circle Consulting, Inc./part time small business and nonprofit consultant; DCRJR Productions, Inc./photographer and arts production; Argus Home HealthCare/PCP
N.Y. Univ./2+yearsno degree; World Trade Inst./Series 7,8,12,14 = trader, broker, broker dealer; CO Municipal League/Century Level; Big Horn Center for Public Policy/Fellow; SBA/SBDC Director, Counselor and Certified Trainer; Nat. Credit Union Certified Compliance Officer; Credit Union Nat. Assn./Compliance Officer; Pueblo Community College/Certified Inst. Civics and Leadership
81001
Have been active in politics since 16 years old; worked collecting petitions for Senators Hatfield and McGovern to end the war in Vietnam. Successfully ran for Councilperson in Canon City 1998. Each election I speak at various venues to explain the ballot issues in a non partisan manner. I assist in training and formatting platforms for school board candidates several times. I made a contribution to H. Clinton's presidential run.
Appointed to: Pueblo Counties 2020/2030 Commission, Pueblo Human Relations Commission, Sangre de Cristo Arts Center, Leadership Pueblo 2016 - President. Member: Professionals in Excellence, Pueblo Art Guild, Start-Up Pueblo. Volunteer: Pueblo Junior Achievement, Pueblo and State DECA,
Represented citizens as a councilperson especially ethnic and arts communities. As a consultant worked to on economic development for the Gov's Ofc of Econ. Dev. and travelled to several areas in Colorado.
Every citizen deserves a voice and vote in our country. I have lived in areas designed to be for one party or another where dissenting voices were ignored. I'd like to that practice eliminated.
I have been in positions of leadership since being elected President of my 1st grade class. I know when we can drill down past positions and positioning, and get to wants, needs and values, we have more in agreement than disagreement. As a leader of various groups I have been successful in leading folks to deeper discussions.
I started programming at 16 and then spent 20+ years on Wall St. analyzing businesses for investment. Following that operated as a consultant for 30 years assisting small business owners overcome obstacles to success. I am good at and enjoy finding good solutions.
Male


{% extends "mainPage/base.html" %} {% block content %} {% if user.is_authenticated %}
Choose the game you want to play
Gomoku
Bridge
To see games log in or sign up
Log In Sign Up


Ethical Hacking
‘Times are a changing’ – nowadays more than ever this is true. Companies and individuals rely more and more on the Internet and let’s be honest: the Internet is not a safe place, not by a slim chance.  What I am going on about are hackers.
Don’t take it personally, no hacker has a grudge especially against you or your company, but unless you take preemptive measures to be on the front line, then you are at risk. There is a chance that you are at risk right now. This is the sort of thing where you cannot possibly think “this only happens to other people” – well, think again, it happened to electrical power plants in the US.
Are you convinced that you need to do something about it yet? I hope you are.
So what’s the whole idea you ask? Well, the idea is being ahead of the hackers, it is thinking like an hacker so that you can be preemptive and patch the holes in your organization. Do you know how store-owners set up motion sensors near windows that can easily be broken? The idea here is just the same.
This concept is called ethical hacking. You are taught on the ways, tricks and subterfuges of hackers so that you can have a different insight on your company. Believe it or not, but the biggest flaw in computer systems is actually us, the users. We are easily duped and deceived by people pretending to be who they aren’t, and this has reached astronomical levels. The most blatant case nowadays is when you get an e-mail that pretends to be a legitimate e-mail from your bank, from a work-mate or simply people who would be innocently sending you pictures.
Well my fellow Internauts, no enough care is much care these days. The EC-Council provides you with the security training that you need not only to help yourself and your company, but also to help other companies. This of course is an investment that can get a return flowing in so in the end, it is all benefits! This isn’t all; if you are trained in IT Security, your job opportunities simply tenfold. Is that not what everyone wants at a time of recession and crisis?
The iClass by the EC-Council has the following categories:
-Security Fundamentals
-Ethical Hacking
-Penetration Testing
-Computer Forensics
-Disaster Recovery
-Secure Programming
So whether you are a newbie (hey, there’s no shame about that!) and you need the fundamentals, or whether you fancy a job at a crime lab doing scientific forensics for a living, the iClass covers it all. You just take your pick!
If you are interested, and here’s hoping that you won’t miss this great opportunity, then here are some links that will help you on the EC-Council site.
Program Site:
Different Certifications:
http://iclass.eccouncil.org/index.php?option=com_content&view=article&id=68&Itemid=91
The CEH (Certified Ethical Hacker) :
http://www.eccouncil.org/ceh.htm
Certification Center:
CompTIA:
Comments


Routers and App Events
This example demonstrates how Giraffe.Router ties into the appEvents
described in the App Events example.
var App, ChildView;
The App
Giraffe.App is a Giraffe.View that encapsulates an app and its routes. In this example, clicking some links will change the window location hash. The Giraffe.Router responds to this hash change and triggers an event on the app which shows a child view with a specific name.
App = Giraffe.App.extend({
template: '#app-template',
The Giraffe.App#routes
property maps URL routes to appEvents
, and as a result of
defining routes
on the app, it will automatically create an instance of
Giraffe.Router at app.router
. Giraffe.Router is dependent on
Giraffe.App because it uses appEvents
to communicate with your objects.
routes: {
'childView/:name': 'route:childView'
// 'someHashLocation/:andItsParams': 'some:appEvent'
},
routes
hash, but
you can create any number of routers. They do require that a Giraffe.App
exists on the page, and instead of defining routes
on an Giraffe.Router,
you define triggers
, which avoids conflict with Backbone.Router#routes
.
When a route is triggered, its corresponding appEvent
is called. Any
Giraffe object, including the app, can listen for appEvents
. In this
example the app listens to itself for the app event 'route:childView'
, which
is defined in the routes
above, and the 'all'
event, so we can log
everything that happens to appEvents
.
appEvents: {
'route:childView': 'showChildView',
'all': function() { console.log('app event', arguments); }
// 'some:otherRoute': 'someMethodName'
// 'some:otherAppEvent': 'someOtherMethodName'
},
route:
prefix is just a naming convention and is not required.
The handler for 'route:childView'
creates a child view named with the route
parameter, and inserts it into the DOM using the attachTo
method 'html'
,
which replaces anything inside '#child-view-container'
.
showChildView: function(name) {
var childView = new ChildView({name: name});
this.attach(childView, {el: '#child-view-container', method: 'html'});
}
});
Here's the app's template. It has three links to the three child views and a container for the active child view.

The Child View
In this example, we're going to create a child view that simply displays its name and a color.
ChildView = Giraffe.View.extend({
className: 'child-view',
template: '#child-template',
initialize: function(options) {
var color;
if (options.name === '1')
color = '#e99';
else if (options.name === '2')
color = '#9e9';
else
color = '#99e';
this.$el.css('background-color', color);
}
});

Loading the App
It's time to create and attach the app.
var app = new App();
app.attachTo('body');
routes
hash could have been passed as an option to the Giraffe.App
constructor.
Almost finished! Let's start Backbone.history to get things rolling.
 The function Giraffe.Router#cause
takes
an appEvent
and optional parameters, navigates to the corresponding route
defined in the router, and then triggers the appEvent
with the parameters.
Here we show child view 1 as the default view by causing its appEvent
.
app.router.cause('route:childView', 1);
Giraffe.Router also provides two utility functions to help you manage
routes, isCaused
and getRoute
. We could have used getRoute
to build our
anchor links in the app template above, but didn't for the sake of familiarity.
No longer must you build route links manually!
console.log(app.router.isCaused('route:childView', 1)); // => true
console.log(app.router.isCaused('route:childView', 2)); // => false
console.log(app.router.isCaused('route:childView')); // => false
console.log(app.router.getRoute('route:childView', 1)); // => '#childView/1'
Try It
var App, ChildView;
App = Giraffe.App.extend({
template: '#app-template',
routes: {
'childView/:name': 'route:childView'
// 'someHashLocation/:andItsParams': 'some:appEvent'
},
appEvents: {
'route:childView': 'showChildView',
'all': function() {
console.log('app event', arguments);
}
// 'some:otherRoute': 'someMethodName'
// 'some:otherAppEvent': 'someOtherMethodName'
},
showChildView: function(name) {
var childView = new ChildView({
name: name
});
this.attach(childView, {
el: '#child-view-container',
method: 'html'
});
}
});
ChildView = Giraffe.View.extend({
className: 'child-view',
template: '#child-template',
initialize: function(options) {
var color;
if (options.name === '1')
color = '#e99';
else if (options.name === '2')
color = '#9e9';
else
color = '#99e';
this.$el.css('background-color', color);
}
});
var app = new App();
app.attachTo('body');
Backbone.history.start();
app.router.cause('route:childView', 1);
console.log(app.router.isCaused('route:childView', 1)); // => true
console.log(app.router.isCaused('route:childView', 2)); // => false
console.log(app.router.isCaused('route:childView')); // => false
console.log(app.router.getRoute('route:childView', 1)); // => '#childView/1'
<!DOCTYPE html>

<link rel='stylesheet' type='text/css' href='../css/reset.css' />
<link rel='stylesheet' type='text/css' href='routersandappevents0-style.css' />

h2 {
font-size: 24px;
}
.child-view {
position: relative;
padding: 20px;
margin: 20px;
border: 1px dashed #999;
}


4
Here is a review of how recursion works
with Triangle()
.
int Triangle( int N ) { if ( N == 1 ) return 1; else return N + Triangle( N-1 ); }
Click on the diagram shows the steps of the computation. Each activation of the method is represented by a circle. Each activation has its own parameter and returns a value to its caller.
An activation may need to wait for a returned value before it can continue with a computation. In the diagram this is represented by a circle on the chain that has not returned a value. The circle is labeled with the statement that is waiting for a result.
The bottom circle represents the base case which immediately returns a value to its caller.
When the base case is reached, values start returning to callers, and activations start completing their work.
When an activation is finished with its work, its circle is removed from the chain.
The final picture (which shows nothing) represents
the case where the first activation of Triangle()
has completed the computation and returned a value to its
caller.


Fixed-Height Carousel for Twitter Bootstrap
Twitter Bootstrap is awesome. The amount of grunt work that Bootstrap makes easy is amazing. One of Bootstrap’s great features is animated carousels; they are a nice way to display a lot of information without taking up a lot of vertical height. With Bootstrap, we just wrap our content in a couple of divs, and before we know it we have a nice scolling carousel.
One thing that I don’t like about Bootstrap’s carousel implementation is that it dynamically resizes the carousel’s height based on the size of the content currently being displaying. If all your content is exactly the same height this isn’t such a big deal, but if it’s not you end up with page elements below the carousel jumping around as the carousel resizes. This seems like terrible UX to me.
Thankfully this is not all that difficult to fix. In just a few lines of JavaScript/jQuery, we can scan through the carousel slides and determine the height of the tallest slide, and use its height for all of them. The code is pretty straightforward:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 |
|
Call that in a document.ready block:
[Edit: Calling this on window.onload will wait until all the assets have been loaded so a maximum height can be calculated correctly.]
1 2 3 |
|
and your page elements will stop jumping around.
H/T to Eddie Staples’s post for providing the basic JavaScript.


CSCW 2020 Companion Page
Full-Text [PDF] | Supplementary Material [PDF] | Project Page [Code and Data]


Several folks who are experts in the program verification literature have asked me some variant of the following question:
How are *Liquid/Refinement* types different from *Floyd-Hoare logics*?
This question always reminds me of Yannis Smaragdakis’ clever limerick:
No idea is too obvious or dreary,
If appropriately expressed in type theory,
It's a research advance,
That no one understands,
But they are all too impressed to be leery.
That is, the above question can be rephrased as: why bother with the hassle of encoding properties in types when good old-fashioned assertions, pre- and post-conditions would do? Is it just a marketing gimmick to make readers too impressed to be leery?
The Problem: Quantifiers
The main algorithmic problem with classical Floyd-Hoare logic is that to do useful things, you need to use universally quantified logical formulas inside invariants, pre- and post-conditions.
Verification then proceeds by asking SMT solvers to check verification conditions (VCs) over these quantified formulas. While SMT solvers are marvelous technological artifacts, and I bow to no one in my admiration of them, in reality, they work best on formulas from a narrowly defined set of decidable theories.
In particular, they are notoriously (and justifiably!) fickle when quizzed on VCs with quantifiers. Briefly, this is because even if the solver “knows” the universally quantified fact:
forall x. P(x)
the solver doesn’t know which particular terms e1
, e2
or e3
to instantiate the fact at. That is, the solver doesn’t know which P(e1)
or P(e2)
or P(e3)
it should work with to prove some given goal. At best, it can make some educated guesses, or use hints from the user, but these heuristics can turn out to be quite brittle as the underlying logics are undecidable in general. To make verification predictable, we really want to ensure that the VCs remain decidable, and to do so, we must steer clear of the precipice of quantification.
The Solution: Types
The great thing about types, as any devotee will tell you, is that the compose. Regrettably, that statement is only comprehensible to believers. I prefer to think of it differently: types decompose. To be precise:
Types _decompose_ quantified assertions into quantifier-free refinements.
Let me make my point with some examples that show what verification looks like when using Refinement Types (as implemented in LiquidHaskell) vs Floyd-Hoare style contracts (as implemented in Dafny).
The goal of this exercise is to illustrate how types help with verification, not to compare the tools LH and Dafny. In particular, Dafny could profit from refinement types, and LH could benefit from the many clever ideas embodied within Dafny.
Example 1: Properties of Data
Consider the following standard definition of a List
datatype in Dafny (left) and LH (right).
(You can see the full definitions for Dafny and LiquidHaskell.)
a. Accessing a list
The two descriptions are more or less the same except for some minor issues of concrete syntax. However, next consider the respective implementations of a function to access the ith
element of a List
. We also pass in a def
ault value that is returned when the index i
is invalid.
It is (usually) silly to access lists in this fashion. I use this example merely to illustrate the common case of defining a container structure (here, List
) and then accessing its contents (here, ith
). As such, we’d like to *specify** that the value returned by the ith
element is indeed in the container or is the def
ault.
Floyd-Hoare Logic
With classical Floyd-Hoare logic, as shown in the Dafny listing on the left, we must spell out the specification quite explicitly. The programmer must write an elements
function that describes the set of values in the container, and then the post-condition of ith
states that the res
is either in that set or the default.
While this specification seems simple enough, we are already on dicey terrain: how are we to encode the semantics of the user-defined function elements
to the SMT solver? In the classical Floyd-Hoare approach, we must use a quantified invariant of the form:
elements(Nil) = empty
&& forall h t :: elements(Cons(h, t)) = {h} + elements(t)
Thanks to the ingenuity of Greg Nelson who invented the notion of triggers and of Rustan Leino and many others, who devised ingenious heuristics for using them, Dafny handles the quantifier calmly to verify the above specification for ith
. However, we are not always so fortunate: it frightfully easy to run into quantifier-related problems with user-defined functions, as we will see in due course.
Liquid/Refinement Types
In contrast, the liquid/refinement version is quite spare: there is no extra specification beyond the code! Surely there must be some mistake? Look again: the type signature says everything we need!
“If you ith
with a list of a
values and a default a
value Then you will get back an a
value”.
That is type parametricity lets us eschew the overhead of using an explicit elements
function.
b. Building a list
Next, lets extend our example to illustrate the common situation where we want some invariant to be true for all the values in a container. To this end, let us write a function mkList
that builds a container with values k+1
,…,k+n
and then test that when k
is non-negative, any arbitrarily chosen value from the container is indeed strictly positive.
The code in Dafny and LH is more or less the same, except for one crucial difference.
Floyd-Hoare Logic
Recall that the specification for ith(pos, i, 1)
states that the returned value is some element of the container (or 1
). Thus, to verify the assert
in testPosN
using classical Floyd-Hoare logic, we need a way to specify that every element in pos
is indeed strictly positive. With classical program logics, the only way to do so is to use a universally quantified post-condition, highlighted in blue:
“for all v
if v
is in the elements-of the res
ult then v
is greater than k
”
Liquid/Refinement Types
Did I mention I don’t like quantifiers?
Regardless, surely we can agree that the version on the right is simpler as it omits the above complication entirely. Types make it unnecessary to mention elements
or forall
. Instead, LH infers
That is, that the output type of mkList
is a list of values v
that are all greater than k
. The scary forall has been replaced by the friendly type constructor List
. In other words, types allow us to decompose the monolithic universally quantified invariant into:
- a quantifier-free refinement
k < v
, and - a type constructor that implicitly “quantifies”
over all the elements inside the container.
Lesson: Decomposition Eliminates Quantifiers and Enables Inference
Am I cheating? After all, what prevents Dafny from inferring the same post-condition as LH? Once again, those cursed quantifiers.
There have been many decades worth of papers on the topic of inferring quantified invariants, but save some nicely circumscribed use-cases these methods turn out to be rather difficult to get working efficiently and predictably enough to be practical. In contrast, once the quantifiers are decomposed away, even an extremely basic approach called Monomial Predicate Abstraction, or more snappily, Houdini, suffices to infer the above liquid type.
Example 2: Properties of Structures
Recall that when discussing the user-defined elements
function above, I had issued some dark warnings about quantifier-related problems that arise from user-defined functions. Allow me to explain with another simple example, that continues with the List
datatype defined above.
(You can see the full definitions for Dafny and LiquidHaskell.)
Specifying a size
Function
Lets write the usual recursive function that computes the size
of a list. The definitions are mostly identical, except for the green measure
highlight that we will discuss below.
Floyd-Hoare Logic
SMT solvers are restricted to a set of ground theories and hence, do not “natively” understand user-defined functions. Thus, the verifer must teach them how to reason about formulas (VCs) containing uses of user-defined functions like size
. In the classical Floyd-Hoare approach, this is done by converting the definition of size
into a universally quantified axiom like:
size Nil == 0 && forall h, t :: size (Cons h t) = 1 + size t
A quantifier! By the pricking of my thumbs, something wicked this way comes…
Liquid/Refinement Types
With a more type-centric view, we can think of the recursive function size
as a way to decorate or refine the types of the data constructors. So, when you write the definition in the green box above, specifically when you add the measure
annotation, the function is converted to strengthened versions for the types of the constructors Nil
and Cons
, so its as if we had defined the list type as two constructor functions
data List a where
Cons :: h:a -> t:List a -> {v:List a | size v == 1 + size t}
Nil :: {v:List a | size v == 0}
That is, the bodies of the measures get translated to refinements on the output types of the corresponding constructors. After this, the SMT solver “knows nothing” about the semantics of size
, except that it is a function. In logic-speak, size
is uninterpreted in the refinement, and there are no quantified axioms. That is, we choose to keep SMT solver blissfully ignorant about the semantics of size
. How could this possibly be a good thing?
Verifying the size
of a List
Next, lets see what happens when we write a simple test that builds a small list with two elements and assert
s that the lists size
is indeed 2
:
Floyd-Hoare Logic
To get Dafny to verifier to sign off on the assert (size(pos) == 2)
we have to add a mysterious extra assertion that checks the size of the intermediate value Cons (1, Nil)
. (Without it, verification fails.)
Huh? Pesky quantifiers.
The SMT solver doesn’t know where to instantiate the size
axom. In this carefully chosen, but nevertheless simple situation, Dafny’s instantiation heuristics come up short. I had to help them along by guessing this intermediate assertion, which effectively “adds” the fact that the size of the intermediate list is 1, thereby letting the SMT solver prove the second assertion.
Liquid/Refinement Types
In contrast, with types, the solver is able to verify the code without batting an eyelid. But how could it possibly do so even though we kept it ignorant of the semantics of size
?
Because types decompose reasoning. In particular, here, the measure and constructor trick lets us factor reasoning about size
into the type system.
In particular, LH internally views the code for test
in A-Normal Form which is a fancy way of saying, by introducing temporary variables for all sub-expressions:
test x1 =
let t0 = Nil
t1 = Cons x1 t0
pos = Cons 0 t1
in
assert (size pos == 2)
And now, just by the rules of type checking, and applying the types of the constructors, it deduces that:
t0 :: {size t0 == 0}
t1 :: {size t1 == 1 + size t0}
t2 :: {size t2 == 1 + size t1}
which lets the SMT solver prove that size t2 == 2
without even requiring any axiomatic description of size
. It turns out that this simple measure
method goes a very long way in specifying and verifying a large class of properties.
Lesson: Decomposition Eliminates Axioms Enables Type-Directed Instantiation
I’d like to emphasize again that this trick was enabled simply by taking a type-centric view: encode the function semantics in data constructors, and let the type checking do the instantiation. It could easily by incorporated inside and work together with axioms in Floyd-Hoare based systems like Dafny. Of course, the trick is limited to a restricted class of functions, but one can generalize the method quite a bit using the idea of logical evaluation.
Summary
To sum up, we saw two examples where taking a type-centric view made verification more ergonomic, essentially by factoring reasoning about quantifiers into the type system.
In the first case, when reasoning about data in containers, the polymorphic type constructor
List
provided an natural way to reason about the fact that all elements in a container satisfied some property.In the second case, when reasoning about the structure of the container via a recursive function, the types of the data constructors allowed us to factor the instantiation of properties of
size
at places where the list was constructed (and dually, not shown, destructed) without burdening the SMT solver with any axioms and the pressure of figuring out where to instantiate them.
As you might imagine, the benefits are even more pronounced when working with higher-order functions, e.g. iterating over containers…
Acknowledgments
Huge thanks to Rustan Leino Nadia Polikarpova Daniel Ricketts Hillel Wayne Zizz Vonnegut for patiently answering my many questions about Dafny!


Toggle navigation
4I Labs
Home
About
Members
Projects
Sponsors
Search
Members
Faculty & Students working on projects
Admin Team
Arnab Sarkar
Chairman, Technical Board
Harshal B. Nemade
Faculty Advisor, 4I Labs
Pankaj Upadhyay
Faculty Advisor, 4I Labs
Sudipto Ghosh
Project Engineer, 4I Labs
Vamsi Krishna Reddy
General Secretary, Technical Board
Team Arle
Team : Control
Afzal Ahmad
Project Head, Arle Control
Sharu Goel
Project Member, Arle Control
Varshil Gandhi
Project Member, Arle Control
Tejasvee
Project Member, Arle Control
Team : Design
Abhay Pratap Singh
Project Member, Arle Design
Mrinal Mahato
Project Member, Arle Design
Team : Integration
Apoorva Kumar
Project Member, Arle Integration
Prathik Naik
Project Member, Arle Integration
Team : ROS
Yash Kothari
Project Member, Arle ROS
Shreeyanshi Baradiya
Project Member, Arle ROS
Aniket Agrawal
Project Member, Arle ROS
Vatsal Goel
Project Member, Arle ROS
Tanvi Ohri
Project Member, Arle ROS
Team : Arm Design
Yogesh Yadav
Project Member, Arle Arm Design
Team Hexacopter
Pravardhan Reddy
Project Member, Hexacopter
Rajan SUkanth
Project Member, Hexacopter
Ankit Kumar Saini
Project Member, Hexacopter
Manik Mittal
Project Member, Hexacopter
Rahul Jacker
Project Member, Hexacopter
Team Raman
Parismita Das
Project Head, Raman
Guining Pertin
Project Member, Raman
Jitendra Roy
Project Head, Arle
Himanshu Kaushik
Project Member, Raman
Rohit Kumar
Project Member, Raman
Akshay Kumar
Project Member, Raman
Mahesh
Project Member, Raman
Umang Kakkar
Project Member, Raman
Vineet Singla
Project Member, Raman
Akash
Project Member, Raman
Siddhanth
Project Member, Raman
Vaibhav
Project Member, Raman
Sparsh Dutta
Project Member, Raman
Team Antahsagari
Sri Harsha Vadathya
Project Member, Antahsagari


Page Popularity Report
The Page Popularity report displays a summary list of the most visited pages.
Report Fields:
- Page Name: The page being visited
- Requests: The number of times the page has been visited
- Last Request: The last time the page was visited
The Page Popularity Report


#include <USB/USBAPI.h>
#include <stdint.h>
Go to the source code of this file.
◆ DEBUG_PRINT
| #define DEBUG_PRINT |
( |
|
... | ) |
{} |
Define actual debug output functions when necessary.
◆ DEBUG_PRINT_V
| #define DEBUG_PRINT_V |
( |
|
... | ) |
{} |
Define actual debug output functions when necessary.
◆ DEBUG_PRINTBUFFER
| #define DEBUG_PRINTBUFFER |
( |
|
buffer, |
|
|
|
len |
|
) |
| {} |
◆ DEBUG_PRINTBUFFER_V
| #define DEBUG_PRINTBUFFER_V |
( |
|
buffer, |
|
|
|
len |
|
) |
| {} |
◆ DEBUG_PRINTER
Uncomment/comment to turn on/off debug output messages.
Uncomment/comment to turn on/off verbose debug output messages. Uncomment/comment to turn on/off error output messages. Set where debug messages will be printed.
◆ DEBUG_PRINTLN
| #define DEBUG_PRINTLN |
( |
|
... | ) |
{} |
◆ DEBUG_PRINTLN_V
| #define DEBUG_PRINTLN_V |
( |
|
... | ) |
{} |
◆ ERROR_PRINT
| #define ERROR_PRINT |
( |
|
... | ) |
{} |
◆ ERROR_PRINTBUFFER
| #define ERROR_PRINTBUFFER |
( |
|
buffer, |
|
|
|
len |
|
) |
| {} |
◆ ERROR_PRINTBYTE
| #define ERROR_PRINTBYTE |
( |
|
buffer, |
|
|
|
len |
|
) |
| {} |
◆ ERROR_PRINTLN
| #define ERROR_PRINTLN |
( |
|
... | ) |
{} |
◆ dumpBuffer()
| void dumpBuffer |
( |
const uint8_t * |
buffer, |
|
|
uint16_t |
len |
|
) |
| |
Dump binary data in hexadecimal format to the Serial device.
This format is handy when you intend to copy and paste the data into a variable definition.
- Parameters
-
| buffer | the data to print |
| len | the length of the data buffer |
◆ printBuffer()
| void printBuffer |
( |
const uint8_t * |
buffer, |
|
|
uint16_t |
len |
|
) |
| |
Print "pretty" binary data in hexadecimal format to the Serial device.
- Parameters
-
| buffer | the data to print |
| len | the length of the data buffer |
◆ printByte()
| void printByte |
( |
const uint8_t * |
buffer | ) |
|
Print a a byte of data in hexadecimal format.
- Parameters
-
◆ Serial


Node
using UnityEngine;
using System.Collections;
public class Node
{
public bool walkable;
public Vector3 worldPosition;
public int gridX;
public int gridY;
public Node parent;
public int gCost;
public int hCost;
public float pheromone;
public float initialPhermone;
public float antValue;
public float attractiveness;
public int[] gridPosition;
public Node(bool pWalkable, Vector3 pWorldPos, int pGridX, int pGridY)
{
walkable = pWalkable;
worldPosition = pWorldPos;
gridX = pGridX;
gridY = pGridY;
gridPosition = new int[2];
gridPosition[0] = pGridX;
gridPosition[1] = pGridY;
attractiveness = 0;
pheromone = 0.25f;
initialPhermone = 0.20f;
}
public int fCost
{
get { return gCost + hCost; }
}
}


// SPDX-License-Identifier: MIT
pragma solidity 0.8.7;
interface ICoord {
function getSubSystem(address _system, bytes32 _subIdentifier)
external
view
returns (address);
function isVotable(uint256 _propID) external view returns (bool);
function addSubSystem(bytes32 _subIdentifier, address _subImplementation)
external;
function voting(uint256 _propID) external;
/**
* @param _exeID ID of the executable to check.
* @notice This function will check that the specified proposal has reached
* quorum, and that it has passed. If the proposal has not reached
* quorum or has not passed this will return false.
* @dev The reason we use Exe IDs here and not Prop IDs is that
* executables may be valid for execution outside of a proposal
* (e.g an approved recurring payment). If the exe is tied to a
* proposal the coordinator will be able to look up and verify it's
* executable status.
*/
function isExecutable(bytes32 _exeID) external view returns (bool);
function setExecute(bytes32 _exeID) external;
} |


Welcome.This website is dedicated to all the random sheep in the world, from black sheeps to strange sheeps, all are welcome here.


We need to upload our project to github.com so that we will be able to build an apk file using build.phonegap.com. So, go to github.com and sign up for a free account.
In order to upload files to github.com we also need to download and install git-scm. So, go to git-scm and download and install git. git is a CLI (command line interface) tool used to communicate with github for purposes of uploading or downloading files.
Next, create a new repository in github and call it Test. Let your project be Public so that you can use github for free. The Private setting is for paid accounts. Then click on the green button: "Create Repository"
Copy the line indicated by the red arrow below.
Then open a cmd terminal and navigate to your project folder C:\PhoneGapProjects\Test. Then issue the following commands:
git init
git add .
git commit -m "first commit"
git remote add origin https://github.com/../Test.git
git push -u origin master
Note that the line "git remote add origin..." will be different for you. Just use the line you copied from github above. Also note that there is a space between "git add" and the dot.
Next refresh your github page and click on the green button: "Clone or Download". Then click on the copy to clipboard icon as shown in red below:
This concludes this lesson. We will be using the clipboard link to build an apk file using build.phonegap.com in the next lesson.


BROADWAY-THE MUSIC OF OUR LIFETIME
September 24-27, 1987 at the Arabian Theatre
Director - Brenda Carey
Musical Director - Sue Bush
Choreographers - Cherie Boone & John Parker
THE CAST
Steve Bateman, Dean Bellais, Cherie Boone, Edward Boone,
Anita Boyd, Sue Bush, Brenda Carey, Katie Day, Taunya Deason,
Nancy Godsey, Suzanne Heflin, Wess Hughes, Peter Infanger,
Brad Johnson, Faith Jones, Teresa Hynum, Linda Lawrence,
Missy McCraw, Marie Melichar, Larry Miller, Bill Mullins,
Scott Openshaw, Stuart Williams


Oh no! Something's gone wrong!
We were unable to find the page you requested.
We looked really hard, too!


I’m from Spokane, Washington, born and raised, and am a Senior Graphic Design student at Eastern Washington University.
I’ve always felt that there was something particularly special about Graphic Design and I am so excited to continue my career in such a creative field where problem-solving meets practicality.
Adobe Creative Suite
Social Media Management
Branding and Marketing
WordPress Experience
Package Design
Microsoft Office
Communication
Soaring Eagle Student Award
2020 | EWU
Featured & Published Author in
Virtual Reality & Technology
2020 | Medium | The Startup
Student Employee of the Year
2019 | EWU
Valedictorian
2019 | Mead High School


Results
Best Accuracy Found
Rows
Selected Features
Null Values
Total Emails Sent
Bounce Rate
Total Opened
Total Ignored
MinMax Scaled
{{para}}
| ID | Name | Price |
|---|---|---|
| 4555 | Samsung Galaxy Mega | $921 |
| 4556 | Huawei Ascend P6 | $240 |
| 8778 | HTC One M8 | $400 |
| 5667 | Samsung Galaxy Alpha | $870 |
| 7886 | LG G3 | $790 |


...is currently a fourth year student at UC Berkeley studying Computer Science. This past summer, she worked as a Software Engineer Intern at Microsoft where she built a REST API for Azure Files. She is eager, driven, and a fast learner.
Outside of tech, she can be found getting lost in the practice of latte art, losing sleep while curating Spotify playlists, and crafting the perfect meal -- she especially enjoys Bon Appetit's recipes. When she finds the time, she binges her fair share of Netflix, catches up on sports (Go Dubs!), and practices yoga.
Her resume can be found here.


Save as PDF Updated
Thank you for using the Save as PDF extension.
Would you like to customize your PDFs? Pdfcrowd now gives away one
Premium License for free
every month.
Interested?
Learn more...


If I run a server with the port 80, and I try to use xmlHTTPrequest i get this error: Error: listen EADDRINUSE
Why is it problem for nodejs, if I want to do a request, while I run a server on the port 80? For the webbrowsers it is not a problem: I can surf on the internet, while the server is running.
The server is:
net.createServer(function (socket) {
socket.name = socket.remoteAddress + ":" + socket.remotePort;
console.log('connection request from: ' + socket.remoteAddress);
socket.destroy();
}).listen(options.port);
And the request:
var xhr = new XMLHttpRequest();
xhr.onreadystatechange = function() {
sys.puts("State: " + this.readyState);
if (this.readyState == 4) {
sys.puts("Complete.\nBody length: " + this.responseText.length);
sys.puts("Body:\n" + this.responseText);
}
};
xhr.open("GET", "http://mywebsite.com");
xhr.send();
Solve
EADDRINUSE
means that the port number which listen()
tries to bind the server to is already in use.
So, in your case, there must be running a server on port 80 already.
If you have another webserver running on this port you have to put node.js behind that server and proxy it through it.
You should check for the listening event like this, to see if the server is really listening:
var http=require('http');
var server=http.createServer(function(req,res){
res.end('test');
});
server.on('listening',function(){
console.log('ok, server is running');
});
server.listen(80);


Select any of the categories below and hit "Replace" to generate a random movie, meal, or drink selection.
Keep hitting "Replace" until you find a suggestion you like, then move on to another item.
After putting together a suitable trio, hit "Save Current Picks" to add them permanently to your Date Night Queue!
or
Date Night Queue
Click any of your previously saved sets below to repopulate the detail view above!


List of Indian-born CEOs
Name
Native city
Company
Appointed as CEO in
Sundar Pichai
Madras
Google
2015
Satya Nadella
Hyderabad
Microsoft
2014
Ajay Banga
Pune
Mastercard
2010
Rajeev Suri
New Delhi
Nokia
2014
Shantanu Narayen
Hyderabad
Adobe
2007


Settings
Logout
Account
Authorization
Account
New Email Address
New Password
Current Password
*
Update Email
Update Password
Delete Account
Authorization
Link to Facebook
Facebook
Unlink Facebook
Facebook
Link to Twitter
Twitter
Unlink Twitter
Twitter


Pizza con Excellence
Excellent Pizza comes with a price.
Toppings
Size
Teeny-Tiny
Medi-yum
Pretty Big
Mondo
Mega Mondo
Order Pizza!
Your total is: $


This page describes how to build the source code into the demo executables.
Running the resulting programs is really intended to be done from the Demonstration
directory using scripts to setup the environment and launch the demo.
Building ColorBars, ImageMove or DMATest
The demo applications are built in the ColorBars, ImageMove or DMATest directories.
The build environment is the GNU C++ compiler. The GNU compiler and tools should be installed
and available on any Linux distribution.
Command line Makefiles are used to run the compiler and linker.
Before building, the enviroment variable LSC_PCIEAPI_DIR needs to be set to point
to the PCIeAPI_Lib directory. This variable is used by the Makefile to find the PCIeAPI
header files and link in the shared library (DLL). The demos use the PCIeAPI library to open the
driver and create all the device objects accessed in the demo. The easiest way to set up
this variable is to run the setup script in the PCIeAPI_Lib directory, or run
make devel from the top level Source directory to permanently install the needed paths
and variables into your .bashrc file.
Building
Ensure LSC_PCIEAPI_DIR is defined - check with set. If not, see above.
Ensure gcc and g++ are in the PATH. Try gcc -v
From any of the demo directories, run:
- make clean to clear any old versions
- make debug to build with debugging symbols and event logging
- make to build a release version (optimized, no debugging)
Installing
The driver and the PCIeAPI_Lib need to be installed before the demo can be run.
There is no special installation needed for the demo programs. They can be
run from their directories, or moved into the Demonstration sub-directory.
Running
The eval board to open is specified by environment variables. These variables are
set via scripts in the Demonstration/DMA/ directory. See runCB.sh
and runIM.sh for examples. The boards to connect to can be seen from the
entries under /dev/lscdma/.
Once the environment varaibles are set (by using the script file to start the demo,
or manually entering values for LSC_PCIE_BOARD, LSC_PCIE_IP_ID and LSC_PCIE_INSTANCE)
the demos can be run.
The demos use the OpenGL graphics library that is should be provided with the standard
Xwindows install.
If it is not on your system, then check OpenGL.org for an install package.
You can verify OpenGL is operational with the following tests:
- glxinfo - displays information about libraries and settings
- glxgears - runs a graphics test program drawing spinning gears
Debugging
Diagnostic Output
The demo can be built with the debug option to enable verbose output and symbol generation
for debugging. This will enable
logging of events. The events can be seen by dumping the contents of the system message log.
To do this, su to root and enter tail -f /var/log/messages.
Monitoring the diagnostic output is the easiest way of tracking the code flow and displaying
parameter value using printf like statements. This isn't sophisticated, but it is quick and
easy to get working and see results.
All the DMA demo applications can use printf (or cout) for debugging.
Debugger
Build the demo with symbols (make debug) and also rebuild the PCIeAPI_Lib with symbols.
Then use your favorite C/C++ debugger to load and run the program to debug.


Toronto's Homeless
95%occupancy
Discover the reality of Toronto's homeless ...
95%occupancy
Discover the reality of Toronto's homeless ...
Despite investing an avg of $30MM year over year, the occupancy has only but risen to 95%.
Map: 2017 homeless shelter deaths (vs 15 outside)
Responses from a targeted survey carried out by the City in 2015, were disproportionately centered on affordable housing.
This suggest two things, shelter should be at the forefront of our concern and more qualatative research is needed to hear their voices.
Chapter 01: Daily Shelter Capacity - Toronto
Chapter 02: 2016 Statistics on Deaths of Shelter Residents
Chapter 03: Poverty Reduction Strategy Consultation


| 014:021 Khan | : |
And they all shall appear before Allah (on the Day of Resurrection) then the weak will say to those who were arrogant (chiefs): "Verily, we were following you; can you avail us anything from Allah's Torment?" They will say: "Had Allah guided us, we would have guided you. It makes no difference to us (now) whether we rage, or bear (these torments) with patience, there is no place of refuge for us." |
| 014:021 Maulana | : |
And they will all come forth to Allah, then the weak will say to those who were proud: We were your followers can you then avert from us aught of the chastisement of Allah? They will say: If Allah had guided us, we would have guided you. It is the same to us whether we cry or bear patiently; there is no escape for us. |
| 014:021 Pickthal | : |
They all come forth unto their Lord. Then those who were despised say unto those who were scornful: We were unto you a following, can ye then avert from us aught of Allah's doom? They say: Had Allah guided us, we should have guided you. Whether we rage or patiently endure is (now) all one for us; we have no place of refuge. |
| 014:021 Rashad | : |
When they all stand before GOD, the followers will say to the leaders, "We used to follow you. Can you spare us even a little bit of GOD's retribution?" They will say, "Had GOD guided us, we would have guided you. Now it is too late, whether we grieve or resort to patience, there is no exit for us." |
| 014:021 Sarwar | : |
(On the Day of Judgment) everyone will appear before God and those who have been suppressed will say to their oppressors, "We were your followers, can you do anything to rescue us from the torment of God?" They will reply, "Had God guided us, we would also have guided you. It makes no difference whether we cry for help or exercise patience; there is no escape for us." |
| 014:021 Shakir | : |
And they shall all come forth before Allah, then the weak shall say to those who were proud: Surely we were your followers, can you therefore avert from us any part of the chastisement of Allah? They would say: If Allah had guided us, we too would have guided you; it is the same to us whether we are impatient (now) or patient, there is no place for us to fly to. |
| 014:021 Sherali | : |
They shall all appear before ALLAH; then shall those who were considered weak say to those who were arrogant, 'Surely, we were your followers can you not them avail us aught against ALLAH's punishment?' They will say, 'If ALLAH had guided us, we should have, surely, guided you. It is the same for us whether we show impatience or are patient, there is no way of escape for us.' |
| 014:021 Yusufali | : |
They will all be marshalled before Allah together: then will the weak say to those who were arrogant, "For us, we but followed you; can ye then avail us to all against the wrath of Allah?" They will reply, "If we had received the Guidance of Allah, we should have given it to you: to us it makes no difference (now) whether we rage, or bear (these torments) with patience: for ourselves there is no way of escape." |
Concepts/Themes Covered: أركان الإسلام > التوحيد > الكافرون > تخلي المتبوعين عن الأتباع Pillars of Islam> Islamic> The Disbelievers> The Masters' Abandonment of the Followers الإيمان > اليوم الآخر > الحشر Faith> The Hereafter> The Day of Resurrection
This tool uses eight English parallel translations for the Holy Quran imported from Mr. Clay Smith. You can also visit Qurany Concepts for browsing the Quran themes or topics. If you want to search the Holy Quran for keywords, please visit Qurany Keywords.