Scene I
Padua. A room in BAPTISTA'S house.
BIANCA
[Enter KATHARINA and BIANCA]
Good sister, wrong me not, nor wrong yourself,
To make a bondmaid and a slave of me;
That I disdain: but for these other gawds,
Unbind my hands, I'll pull them off myself,
Yea, all my raiment, to my petticoat;
Or what you will command me will I do,
So well I know my duty to my elders.
KATHARINA
Of all thy suitors, here I charge thee, tell
Whom thou lovest best: see thou dissemble not.
BIANCA
Believe me, sister, of all the men alive
I never yet beheld that special face
Which I could fancy more than any other.
KATHARINA
Minion, thou liest. Is't not Hortensio?
BIANCA
If you affect him, sister, here I swear
I'll plead for you myself, but you shall have
him.
KATHARINA
O then, belike, you fancy riches more:
You will have Gremio to keep you fair.
BIANCA
Is it for him you do envy me so?

KATHARINA
If that be jest, then all the rest was so.
[Strikes her]
[Enter BAPTISTA]
BAPTISTA
Why, how now, dame! whence grows this insolence?
Bianca, stand aside. Poor girl! she weeps.
Go ply thy needle; meddle not with her.
For shame, thou helding of a devilish spirit,
Why dost thou wrong her that did ne'er wrong thee?
When did she cross thee with a bitter word?
KATHARINA
Her silence flouts me, and I'll be revenged.
[Flies after BIANCA]
BAPTISTA
What, in my sight? Bianca, get thee in.
[Exit BIANCA]
KATHARINA
What, will you not suffer me?
Talk not to me: I will go sit and weep
Till I can find occasion of revenge.
[Exit]
BAPTISTA
Was ever gentleman thus grieved as I?
But who comes here?
Enter GREMIO, LUCENTIO in the habit of a mean man;
PETRUCHIO, with HORTENSIO as a musician; and TRANIO,
with BIONDELLO bearing a lute and books
GREMIO
Good morrow, neighbour Baptista.
BAPTISTA
Good morrow, neighbour Gremio.

 Pray, have you not a daughter
Call'd Katharina, fair and virtuous?
BAPTISTA
I have a daughter, sir, called Katharina.

PETRUCHIO
You wrong me, Signior Gremio: give me leave.
I am a gentleman of Verona, sir,
That, hearing of her beauty and her wit,
Her affability and bashful modesty,
Her wondrous qualities and mild behavior,
Am bold to show myself a forward guest
Within your house, to make mine eye the witness
Of that report which I so oft have heard.
And, for an entrance to my entertainment,
I do present you with a man of mine,
[Presenting HORTENSIO]
Cunning in music and the mathematics,
To instruct her fully in those sciences,
Whereof I know she is not ignorant:
Accept of him, or else you do me wrong:
His name is Licio, born in Mantua.
BAPTISTA
You're welcome, sir; and he, for your good sake.
But for my daughter Katharina, this I know,
She is not for your turn, the more my grief.
PETRUCHIO
I see you do not mean to part with her,
Or else you like not of my company.
BAPTISTA
Mistake me not; I speak but as I find.
Whence are you, sir? what may I call your name?
PETRUCHIO
Petruchio is my name; Antonio's son,
A man well known throughout all Italy.
BAPTISTA
I know him well: you are welcome for his sake.

PETRUCHIO
O, pardon me, Signior Gremio; I would fain be doing.
GREMIO
I doubt it not, sir; but you will curse your
wooing. Neighbour, this is a gift very grateful, I am
sure of it. To express the like kindness, myself,
that have been more kindly beholding to you than
any, freely give unto you this young scholar,
[Presenting LUCENTIO]
that hath been long studying at Rheims; as cunning
in Greek, Latin, and other languages, as the other
in music and mathematics: his name is Cambio; pray,
accept his service.
BAPTISTA
A thousand thanks, Signior Gremio.
Welcome, good Cambio.
[To TRANIO]
But, gentle sir, methinks you walk like a stranger:
may I be so bold to know the cause of your coming?
TRANIO
Pardon me, sir, the boldness is mine own,
That, being a stranger in this city here,
Do make myself a suitor to your daughter,
Unto Bianca, fair and virtuous.
Nor is your firm resolve unknown to me,
In the preferment of the eldest sister.

BAPTISTA
Lucentio is your name; of whence, I pray?
TRANIO
Of Pisa, sir; son to Vincentio.

Holla, within!
[Enter a Servant]
Sirrah, lead these gentlemen
To my daughters; and tell them both,
These are their tutors: bid them use them well.
Exit Servant, with LUCENTIO and HORTENSIO,
BIONDELLO following
We will go walk a little in the orchard,
And then to dinner. You are passing welcome,
And so I pray you all to think yourselves.
PETRUCHIO
Signior Baptista, my business asketh haste,
And every day I cannot come to woo.
You knew my father well, and in him me,
Left solely heir to all his lands and goods,
Which I have better'd rather than decreased:
Then tell me, if I get your daughter's love,
What dowry shall I have with her to wife?
BAPTISTA
After my death the one half of my lands,
And in possession twenty thousand crowns.
PETRUCHIO
And, for that dowry, I'll assure her of
Her widowhood, be it that she survive me,
In all my lands and leases whatsoever:
Let specialties be therefore drawn between us,
That covenants may be kept on either hand.
BAPTISTA
Ay, when the special thing is well obtain'd,
That is, her love; for that is all in all.

BAPTISTA
Well mayst thou woo, and happy be thy speed!
But be thou arm'd for some unhappy words.
PETRUCHIO
Ay, to the proof; as mountains are for winds,
That shake not, though they blow perpetually.

HORTENSIO
For fear, I promise you, if I look pale.
BAPTISTA
What, will my daughter prove a good musician?
HORTENSIO
I think she'll sooner prove a soldier
Iron may hold with her, but never lutes.
BAPTISTA
Why, then thou canst not break her to the lute?
HORTENSIO
Why, no; for she hath broke the lute to me.
I did but tell her she mistook her frets,
And bow'd her hand to teach her fingering;
When, with a most impatient devilish spirit,
'Frets, call you these?' quoth she; 'I'll fume
with them:'
And, with that word, she struck me on the head,
And through the instrument my pate made way;
And there I stood amazed for a while,
As on a pillory, looking through the lute;
While she did call me rascal fiddler
And twangling Jack; with twenty such vile terms,
As had she studied to misuse me so.
PETRUCHIO
Now, by the world, it is a lusty wench;
I love her ten times more than e'er I did:
O, how I long to have some chat with her!
BAPTISTA
Well, go with me and be not so discomfited:
Proceed in practise with my younger daughter;
She's apt to learn and thankful for good turns.
Signior Petruchio, will you go with us,
Or shall I send my daughter Kate to you?
PETRUCHIO
I pray you do.
[Exeunt all but PETRUCHIO]
I will attend her here,
And woo her with some spirit when she comes.
Say that she rail; why then I'll tell her plain
She sings as sweetly as a nightingale:
Say that she frown, I'll say she looks as clear
As morning roses newly wash'd with dew:
Say she be mute and will not speak a word;
Then I'll commend her volubility,
And say she uttereth piercing eloquence:
If she do bid me pack, I'll give her thanks,
As though she bid me stay by her a week:
If she deny to wed, I'll crave the day
When I shall ask the banns and when be married.
But here she comes; and now, Petruchio, speak.
[Enter KATHARINA]
Good morrow, Kate; for that's your name, I hear.
KATHARINA
Well have you heard, but something hard of hearing:
They call me Katharina that do talk of me.
PETRUCHIO
You lie, in faith; for you are call'd plain Kate,
And bonny Kate and sometimes Kate the curst;
But Kate, the prettiest Kate in Christendom
Kate of Kate Hall, my super-dainty Kate,
For dainties are all Kates, and therefore, Kate,
Take this of me, Kate of my consolation;
Hearing thy mildness praised in every town,
Thy virtues spoke of, and thy beauty sounded,
Yet not so deeply as to thee belongs,
Myself am moved to woo thee for my wife.
KATHARINA
Moved! in good time: let him that moved you hither
Remove you hence: I knew you at the first
You were a moveable.
PETRUCHIO
Why, what's a moveable?
KATHARINA
A join'd-stool.
PETRUCHIO
Thou hast hit it: come, sit on me.
KATHARINA
Asses are made to bear, and so are you.
PETRUCHIO
Women are made to bear, and so are you.

PETRUCHIO
Alas! good Kate, I will not burden thee;
For, knowing thee to be but young and light--
KATHARINA
Too light for such a swain as you to catch;
And yet as heavy as my weight should be.
PETRUCHIO
Should be! should--buzz!
KATHARINA
Well ta'en, and like a buzzard.
PETRUCHIO
O slow-wing'd turtle! shall a buzzard take thee?
KATHARINA
Ay, for a turtle, as he takes a buzzard.

KATHARINA
If I be waspish, best beware my sting.
PETRUCHIO
My remedy is then, to pluck it out.
KATHARINA
Ay, if the fool could find it where it lies,
PETRUCHIO
Who knows not where a wasp does
wear his sting? In his tail.
KATHARINA
Yours, if you talk of tails: and so farewell.
PETRUCHIO
What, with my tongue in your tail? nay, come again,
Good Kate; I am a gentleman.
KATHARINA
That I'll try.
[She strikes him]
PETRUCHIO
I swear I'll cuff you, if you strike again.

PETRUCHIO
A herald, Kate? O, put me in thy books!
KATHARINA
What is your crest? a coxcomb?
PETRUCHIO
A combless cock, so Kate will be my hen.

PETRUCHIO
Nay, come, Kate, come; you must not look so sour.
KATHARINA
It is my fashion, when I see a crab.
PETRUCHIO
Why, here's no crab; and therefore look not sour.
KATHARINA
There is, there is.
PETRUCHIO
Then show it me.
KATHARINA
Had I a glass, I would.
PETRUCHIO
What, you mean my face?
KATHARINA
Well aim'd of such a young one.
PETRUCHIO
Now, by Saint George, I am too young for you.
KATHARINA
Yet you are wither'd.
PETRUCHIO
'Tis with cares.
PETRUCHIO
Nay, hear you, Kate: in sooth you scape not so.
KATHARINA
I chafe you, if I tarry: let me go.
PETRUCHIO
No, not a whit: I find you passing gentle.
'Twas told me you were rough and coy and sullen,
And now I find report a very liar;
For thou are pleasant, gamesome, passing courteous,
But slow in speech, yet sweet as spring-time flowers:
Thou canst not frown, thou canst not look askance,
Nor bite the lip, as angry wenches will,
Nor hast thou pleasure to be cross in talk,
But thou with mildness entertain'st thy wooers,
With gentle conference, soft and affable.
Why does the world report that Kate doth limp?
O slanderous world! Kate like the hazel-twig
Is straight and slender and as brown in hue
As hazel nuts and sweeter than the kernels.
O, let me see thee walk: thou dost not halt.
KATHARINA
Go, fool, and whom thou keep'st command.
PETRUCHIO
Did ever Dian so become a grove
As Kate this chamber with her princely gait?
O, be thou Dian, and let her be Kate;
And then let Kate be chaste and Dian sportful!
KATHARINA
Where did you study all this goodly speech?
PETRUCHIO
It is extempore, from my mother-wit.
KATHARINA
A witty mother! witless else her son.
KATHARINA
Yes; keep you warm.

Now, Kate, I am a husband for your turn;
For, by this light, whereby I see thy beauty,
Thy beauty, that doth make me like thee well,
Thou must be married to no man but me;
For I am he am born to tame you Kate,
And bring you from a wild Kate to a Kate
Conformable as other household Kates.
Here comes your father: never make denial;
I must and will have Katharina to my wife.
[Re-enter BAPTISTA, GREMIO, and TRANIO]
BAPTISTA
Now, Signior Petruchio, how speed you with my daughter?
PETRUCHIO
How but well, sir? how but well?
It were impossible I should speed amiss.
BAPTISTA
Why, how now, daughter Katharina! in your dumps?
KATHARINA
Call you me daughter? now, I promise you
You have show'd a tender fatherly regard,
To wish me wed to one half lunatic;
A mad-cup ruffian and a swearing Jack,
That thinks with oaths to face the matter out.
PETRUCHIO
Father, 'tis thus: yourself and all the world,
That talk'd of her, have talk'd amiss of her:
If she be curst, it is for policy,
For she's not froward, but modest as the dove;
She is not hot, but temperate as the morn;
For patience she will prove a second Grissel,
And Roman Lucrece for her chastity:
And to conclude, we have 'greed so well together,
That upon Sunday is the wedding-day.
KATHARINA
I'll see thee hang'd on Sunday first.
GREMIO
Hark, Petruchio; she says she'll see thee
hang'd first.
TRANIO
Is this your speeding? nay, then, good night our part!
PETRUCHIO
Be patient, gentlemen; I choose her for myself:
If she and I be pleased, what's that to you?
'Tis bargain'd 'twixt us twain, being alone,
That she shall still be curst in company.

O, you are novices! 'tis a world to see,
How tame, when men and women are alone,
A meacock wretch can make the curstest shrew.
Give me thy hand, Kate: I will unto Venice,
To buy apparel 'gainst the wedding-day.
Provide the feast, father, and bid the guests;
I will be sure my Katharina shall be fine.
BAPTISTA
I know not what to say: but give me your hands;
God send you joy, Petruchio! 'tis a match.
GREMIO
|
| Amen, say we: we will be witnesses.
PETRUCHIO
Father, and wife, and gentlemen, adieu;
I will to Venice; Sunday comes apace:
We will have rings and things and fine array;
And kiss me, Kate, we will be married o'Sunday.
[Exeunt PETRUCHIO and KATHARINA severally]
GREMIO
Was ever match clapp'd up so suddenly?
BAPTISTA
Faith, gentlemen, now I play a merchant's part,
And venture madly on a desperate mart.
TRANIO
'Twas a commodity lay fretting by you:
'Twill bring you gain, or perish on the seas.
BAPTISTA
The gain I seek is, quiet in the match.
GREMIO
No doubt but he hath got a quiet catch.
But now, Baptists, to your younger daughter:
Now is the day we long have looked for:
I am your neighbour, and was suitor first.
TRANIO
And I am one that love Bianca more
Than words can witness, or your thoughts can guess.
GREMIO
Youngling, thou canst not love so dear as I.
TRANIO
Graybeard, thy love doth freeze.
GREMIO
But thine doth fry.
Skipper, stand back: 'tis age that nourisheth.
TRANIO
But youth in ladies' eyes that flourisheth.
BAPTISTA
Content you, gentlemen: I will compound this strife:
'Tis deeds must win the prize; and he of both
That can assure my daughter greatest dower
Shall have my Bianca's love.
Say, Signior Gremio, What can you assure her?
GREMIO
First, as you know, my house within the city
Is richly furnished with plate and gold;
Basins and ewers to lave her dainty hands;
My hangings all of Tyrian tapestry;
In ivory coffers I have stuff'd my crowns;
In cypress chests my arras counterpoints,
Costly apparel, tents, and canopies,
Fine linen, Turkey cushions boss'd with pearl,
Valance of Venice gold in needlework,
Pewter and brass and all things that belong
To house or housekeeping: then, at my farm
I have a hundred milch-kine to the pail,
Sixscore fat oxen standing in my stalls,
And all things answerable to this portion.
Myself am struck in years, I must confess;
And if I die to-morrow, this is hers,
If whilst I live she will be only mine.
TRANIO
That 'only' came well in. Sir, list to me:
I am my father's heir and only son:
If I may have your daughter to my wife,
I'll leave her houses three or four as good,
Within rich Pisa walls, as any one
Old Signior Gremio has in Padua;
Besides two thousand ducats by the year
Of fruitful land, all which shall be her jointure.
What, have I pinch'd you, Signior Gremio?
GREMIO
Two thousand ducats by the year of land!
My land amounts not to so much in all:
That she shall have; besides an argosy
That now is lying in Marseilles' road.
What, have I choked you with an argosy?
TRANIO
Gremio, 'tis known my father hath no less
Than three great argosies; besides two galliases,
And twelve tight galleys: these I will assure her,
And twice as much, whate'er thou offer'st next.
GREMIO
Nay, I have offer'd all, I have no more;
And she can have no more than all I have:
If you like me, she shall have me and mine.
TRANIO
Why, then the maid is mine from all the world,
By your firm promise: Gremio is out-vied.

TRANIO
That's but a cavil: he is old, I young.
GREMIO
And may not young men die, as well as old?
BAPTISTA
Well, gentlemen,
I am thus resolved: on Sunday next you know
My daughter Katharina is to be married:
Now, on the Sunday following, shall Bianca
Be bride to you, if you this assurance;
If not, Signior Gremio:
And so, I take my leave, and thank you both.
GREMIO
Adieu, good neighbour.

An old Italian fox is not so kind, my boy.
[Exit]
TRANIO
A vengeance on your crafty wither'd hide!
Yet I have faced it with a card of ten.
'Tis in my head to do my master good:
I see no reason but supposed Lucentio
Must get a father, call'd 'supposed Vincentio;'
And that's a wonder: fathers commonly
Do get their children; but in this case of wooing,
A child shall get a sire, if I fail not of my cunning.
[Exit]


Data structure
Depot-vehicle combination:
- Route
- Deliver quantities
- Total deliver quantity
- Route cost
- Travel time
Customer:
- Total deliver quantity
- List of routes with:
Classes
Data members:
- List of vehicles
- Leftover inventory
Functions:
Data members:
- Type
- Route
- Leftover capacity
- Leftover travel time
Functions:
Data members:
- Ordered list of customers (index)
- Delivery quantity
- Total delivery quantity
- Service time
- Travel distance
Functions:
Data members:
- Demand
- Total delivery quantity
- Depot
Initialisation
Load data
Load m
, the number of depots. Load K
, the number of vehicles types. Load n
, the number of customers.
Load distance matrix distanceMatrix
into Matrix datatype with dimensions (n + m) x (n + m). Create depot matrix depotMatrix
with dimensions m x (K + 1). Load customer matrix customerMatrix
with dimension n x 2. Load vehicle matrix vehicleMatrix
with dimension K x 4
Create empty solution
For each depot (m depots):
- Select row from
depotMatrix
- Set inventory by calling
Solution::addDepot(I_j)
- For each vehicle type:
- Add
n_jk
vehicles by calling Depot::addVehicle(k)
function
For each customer in customerMatrix
:
- Create customer by calling
Solution::addCustomer(demand, servicetime)
Construct initial solution
- Sort
customerMatrix
on ascending demand.
- Create
depotCustomerAllocation
(is a vector<vector<int>>
). Create depotCustomerDemand
.
- Loop over
customerMatrix
:
- Create
leftoverDemand = customer.getDemand()
.
- While
leftoverDemand > 0
- Find smallest distance to depots, say
smallDepot
.
- Add customer.
- end
- Loop over depot (m depots):
- Sort vehicles based on costs.
- Create
customerList
and customerDropOff
.
- Loop over sorted vehicle list:
- Create
leftoverCapacity = vehicle.getCapacity()
- while (
leftoverCapacity > 0
) do
- Take new customer from
depotCustomerAllocation
(first time random).
- Add customer to
customerList
and customerDropOff
.
- Update
leftoverCapacity
.
- if (
leftoverCapacity >= demand
) then
- Delete from
depotCustomerAllocation
.
- else update
depotCustomerDemand
.
- end
route = cheapestInsertion(customerList)
vehicle.setRoute(route, deliverQuantities)
Customers.addRoute(route, deliverQuantities)
cheapestInsertion(customerList)
- Create
route = {0, 0};
- While customerList is not empty
- For each customer in customerList
- For each insertion option (N - 1):
- Update route by inserting cheapest.
- Remove customer from customerList.
- Ready to rambo.
 Store in toBeRemoved.
- Find q-1 nearest customers. Store in toBeRemoved.
- removeCustomers(solution, toBeRemoved) (see below)
removeCustomers(solution, toBeRemoved)
- For each customer in toBeRemoved:
- For each vehicle of customer:
- Find place customer in route
- Remove customer from route (and dropoff)
- Update load, length, serviceTime, route cost
- Remove depot+vehicle_id from customer
- toBeReinserted = toBeRemoved (for later use)
- Return destroyed solution and toBeReinserted
costRemoval(solution)
- For customers 1,...,n:
- computeRemovalGain(solution, customer) (see below)
- store result in vector gains, along with customer_id (gains = [[1,gain_1],...,[n,gain_n]])
- Find q largest gains, store corresponding customer_ids in toBeRemoved
- removeCustomers(solution, toBeRemoved)
computeRemovalGain(solution, customer)
- For each vehicle of customer, compute vehicleRemovalGain:
- Find place in route
- Distance gain: Use distanceMatrix (multiply by alpha)
- Feasibility gain (only if route is infeasible in the first place):
- Find old and new travel duration (travel time + service time)
- Use arithmetic.
- vehicleRemovalGain = distance gain + feasibility gain
totalRemovalGain = sum(vehicleRemovalGain)
- totalRemovalGain = totalRemovalGain * uniform(a, b) (a = 0.8, b = 1.2)(RNG).
return totalRemovalGain
routeRemoval(solution)
- Pick random non-empty vehicle.
- Find corresponding route
- Store at random min(q, route.length()) customers in toBeRemoved
- removeCustomers(solution, toBeRemoved)
reinsert(solution, toBeReinserted)
- demand = demand(toBeReinserted)
- While toBeReinserted is not empty
- Select random customer from toBeReinserted.
- minInsertion = Infinity
- depot = -1, vehicle = -1, idx = -1 (initilize insertion location)
- For each vehicle
- For each insertion option
- Find insertionCost:
- Additional travel costs
- Infeasibility penalties
- If (insertion costs < minInsertion)
- minInsertion = insertionCost
- update: depot, vehicle, and idx
- Insert customer at depot, vehicle, idx:
- If (insufficient inventory/capacity)
- Allocate as much as possible and split demand
- Update demand
- If (sufficient inventory and capacity)
- Allocate all demand
- remove customer from toBeReinserted
- Return solution Note: we can alternatively check in advance for sufficient inventory/capacity, and discard the insertion option if insufficient. One problem is that all insertion options may be discarded (a simple workaround is to repeat the search, now allowing for splits). I suggest moving this to the tuning phase (if it turns out that too many splits are generated, this is one place where we can look.)
Algorithm Structure
Solutions
solutions: best_feasible
, best_solution
, s
, s_prime
f(solution) = cost(solution) + penalty(solution)
cost(solution) = sum(travelCosts) penalty(solution) = penalty * travelTimeViolation(solution) penalty is a parameter between iota_min
and iota_max = iota_min*delta^100
(or delta^10, whatever) multiplied by factor delta if solution is infeasible
Initialise
penalty = iota_min (global)
s = initialSolution()
best_solution = s
if s
is feasible:
else:
best_feasible
= empty (objective value: inf)
T = r*f(s) (0 < r < 1)
(Temperature for simulated annealing)
iter == 1
repeat:
s_prime
= DestroyAndRepair(s) if f(s_prime
) < (1 + theta)*f(best_solution
):
- for (routine in routineList):
s_prime
= routine(s_prime
) if (improvement):
- return to first routine (that is, reenter for-loop) #this is rather extensive, (an alternative is to move to the next routine if the current routine does not yield further improvements)
best_solution
= min(s_prime
, best_solution
) #compare objectives, use same global penalty parameter
if s_prime
is feasible
best_feasible
= min(s_prime
, best_feasible
) #compare objectives
simulatedAnnealing(s_prime, s
) (simulatedAnnealing: see below) updatePenalty(s
) iter++
until iter == max_iter
or comp_time > max_comp_time
updatePenalty(solution)
if(solution is not feasible)
- penalty = min(iota_max, iota * delta)
else
- penalty = max(iota_min, iota / delta)
simulatedAnnealing(s1, s2)
if f(s1) <= f(s2):
- T = r*f(s1) (0<r<1) return s1
else
- diff = f(s1) - f(s) generate random variate u~U(0,1) if (u < exp(-diff/T))
- return s1 with probability exp(-diff/T) T = max(r*T, T_min) (0 < r <1, T_min is minimum temperature)
1-insertion intra route
minInsertion = 0 For each depot
- For each vehicle
- For each dummy customer in route
- For each insertion option in route
- Compute insertionCosts (distance + feasibility) if (insertionCosts < minInsertion)
- minInsertion = insertionCosts store depot + vehicle + customer + insertion option
Execute best option: (change route + deliveries for (depot,vehicle))
end
2-opt intra route
bestOption = 0 For each depot
- For each vehicle
- For i = 1 to route.size()
- c1 = route[i - 1] c2 = route[i] For j = i + 1 to route.size()
- c3 = route[j] c4 = route[j + 1] saving = distance - distance[c1,c2] - distance[c3,c4] + distance[c1,c3] + distance[c2,c4] if saving < bestOption
- bestOption = saving store i, j
Execute best option: newRoute = oldRoute[0,i - 1] + revert(oldRoute[i,j]) + oldRoute[j+1, route.size()], change deliveries analagously


Glidein Factory monitoring
Monitoring is an essential part of any service. One has to monitor to both: maintain the health of the system and to tune the system for anticipated growth. The various ways you can monitor a Glidein Factory are described below.
Log files
Both the Factory Daemon, the Entry Daemons, HTCondor-G and the Glideins write extensive log files. The logs are kept for a week and then deleted.
Glidein Factory entry Web monitoring
You can either monitor the Factory as a whole, or just a single entry point.
The Factory monitoring is located at a URL like the one below (starting with the hostname and ending with the instance name):
http://gfactory1.my.org/glidefactory/monitor/glidein_v1_0/
Moreover, each entry point, has its own history on the Web.
Assuming you have a SanDiego entry, it can be monitored at
http://gfactory1.my.org/glidefactory/monitor/glidein_v1_0/entry_SanDiego/
Historical Web monitoring
The Entry Point Daemons will also create RRD databases and associated graphs for a period of up to one year. This way, one can easily monitor the evolution of the system.
Glidein Factory monitoring via WMS tools
You can get the equivalent of the Web page snaphot by using
cd glideinWMS/tools/
python wmsXMLView.py
Glidein Factory entry log files
By default the glidein Factory writes two log files per entry point factory_info.YYYYMMDD.log
and factory_err.YYYYMMDD.log.
Assuming you have a SanDiego entry, the log files are in the directory
/home/gfactory/glidein_submit/glidein_v1_0/entry_SanDiego/log
All errors are reported in the factory_err.YYYYMMDD.log. file, while factory_info.YYYYMMDD.log contains entries about what the Factory is doing.
Glidein output
Each glidein creates 2 files on exit; job.ID.out and job.ID.err.
Assuming you have a SanDiego entries, the log files are in
/home/gfactory/glidein_submit/glidein_v1_0/entry_SanDiego/log
Problems are usually reasonably easy to spot.
Glidein Factory ClassAds in the WMS Pool
The glidein Factory also advertises summary information in the WMS Pool collector.
Use condor_status:
condor_status -any
and look for glidefactory and glidefactoryclient ads.
Looking at ClassAds
As explained in the Data exchange overview, the Entry Point Daemons expose a lot of monitoring information in the ClassAds sent to the WMS collector. While this may not be the most user friendly interface, most of the monitoring information you'll ever need is present there.
On top of the HTCondor provided tools (e.g. condor_status), the Factory provides two tools to look at the ClassAds; the first one returns a human readable, but limited text, while the other provides a complete XML-formated output
glideinWMS/tools/wmsTxtView.py [Entries|Sites|Gatekeepers]
glideinWMS/tools/wmsXMLView.py
analyze_entries
This tool, found in factory/tools/analyze_entries can list many statistics useful for Factory administrators. It can list the total time used by glideins, the number of glideins submitted, the number of jobs run, as well as the efficiency of glideins.
This utility can sort by Frontend, entry or by attributes such as the most time used.
The command line arguments are shown below:
| --source ABSPATH | Required. Unless you are running this in the factory directory, you must specify the absolute path to the Factory directory |
| -x | Interval to look at (in hours). Valid options are 2, 24, or 168. |
| -p | Look at all the above intervals. |
| -f FRONTEND | Filter by Frontend. You can omit "frontend_" at the beginning of the name. |
| -m | Emphasize Frontend data, no entries shown. By default, slots are shown. You can use -ms to show seconds or -mh to show hours. |
| -msort ATTRIBUTE | Frontend mode, sort by attribute (strt, fval, 0job, val, idle, wst, badp, waste, time, total) |
| -h | Show usage message |
Below is an example of usage:
./analyze_entries --source /opt/wmsfactory/glidein_w msfactory_instance -x 168 Glidein log analysis for All Entries - 01-11-2011_13:42:28 ---------------------------------------- Past 168.0 hours: Total Glideins: 78 Total Jobs: 57 (Average jobs/glidein: 0.73) Total time: 66.6K ( 18.5 hours - 0.1 slots) Total time used: 29.5K ( 8.2 hours - 0.0 slots - 44%) Total time validating: 4.4K ( 1.2 hours - 0.0 slots - 6%) Total time idle: 32.4K ( 9.0 hours - 0.1 slots - 48%) Total time wasted: 37.1K ( 10.3 hours - 0.1 slots - 55%) Time used/time wasted: 0.8 Time efficiency: 0.44 --------------------------------------- --------------------------------------- Per Entry (all frontends) stats for the past 168 hours. strt fval 0job | val idle wst badp | waste time total ss_ITB_GRATIA_TEST_1 2% 4% 37% | 6% 48% 55% 92% | 10 18 | 78 --------------------------------------- --------------------------------------- Per Entry (per Frontend) stats for the past 168 hours. ---------------------------------------- frontend_vofrontend_service_frontend: Glideins: 78 - 100.0% of total Jobs: 57 (Average jobs/glidein: 0.73) time: 66.6K ( 18.5 hours - 0.1 slots) time used: 29.5K ( 8.2 hours - 0.0 slots - 44%) time validating: 4.4K ( 1.2 hours - 0.0 slots - 6%) time idle: 32.4K ( 9.0 hours - 0.1 slots - 48%) time wasted: 37.1K ( 10.3 hours - 0.1 slots - 55%) Time used/time wasted: 0.8 Time efficiency: 0.44 strt fval 0job | val idle wst badp | waste time total ss_ITB_GRATIA_TEST_1 2% 4% 37% | 6% 48% 55% 92% | 10 18 | 78 ----------------------------------- LEGEND: K - kilseconds (*1,000 seconds) M - megaseconds (*1,000,000 seconds) strt - % of jobs where condor failed to start fval - % of glideins that failed to validate (hit 1000s limit) 0job - % 0 jobs/glidein ---------- val - % of time used for validation idle - % of time spend idle wst - % of time wasted (Lasted - JobsLasted) badp - % of badput (Lasted - JobsGoodput) ---------- waste - wallclock time wasted (hours) (Lasted - JobsLasted) time - total wallclock time (hours) (Lasted) total - total number of glideins -------------------------------------
analyze_queues
This tool, found in factory/tools/analyze_queues can list many statistics useful for Factory administrators. It will show the number of slots in running, held, and idle status. It can display this information per entry or per Frontend.
| --source ABSPATH | Required. Unless you are running this in the Factory directory, you must specify the absolute path to the Factory directory |
| -x | Interval to look at (in hours). Valid options are 2, 24, or 168. |
| -p | Look at all the above intervals. |
| -f FRONTEND | Filter by Frontend. You can omit "frontend_" at the beginning of the name. |
| -z | Zero suppression (don't show entries with 0s across all attributes) |
| -m | Emphasize frontend data, no entries shown. By default, slots are shown. You can use -ms to show seconds or -mh to show hours. |
| -msort ATTRIBUTE | Frontend mode, sort by attribute (strt, fval, 0job, val, idle, wst, badp, waste, time, total) |
| -h | Show usage message |
Example usage:
./analyze_queues --source /opt/wmsfactory/glidein_wmsfactory_instance -x 168 Status Attributes analysis for All Entries - 01-11-2011_15:10:22 ---------------------------------------- Past 168.0 hours: Status Running: 71.0K ( 19.7 hours - 0.1 slots - 62%) Status Held: 0.0 ( 0.0 hours - 0.0 slots - 0%) Status Idle: 19.4K ( 5.4 hours - 0.0 slots - 17%) Status Unknown: 0.0 ( 0.0 hours - 0.0 slots - 0%) Status Pending: 19.4K ( 5.4 hours - 0.0 slots - 17%) Status Wait: 0.0 ( 0.0 hours - 0.0 slots - 0%) Status Stage In: 0.0 ( 0.0 hours - 0.0 slots - 0%) Status Stage Out: 3.9K ( 1.1 hours - 0.0 slots - 3%) RunDiff (Running-ClientRegistered): 23.1K ( 6.4 hours - 0.0 slots - 32%) IdleDiff (Idle - RequestedIdle): -6.1K ( -1.7 hours - -0.0 slots) --------------------------------------- --------------------------------------- Per Entry (all frontends) stats for the past 168 hours. Run Held Idle Unknwn | Pending Wait StgIn StgOut | RunDiff IdleDiff %RD ss_ITB_GRATIA_TEST_1 71.0K 0.0 19.4K 0.0 | 19.4K 0.0 0.0 3.9K | 23.1K -6.1K 32% --------------------------------------- --------------------------------------- Per Entry (per frontend) stats for the past 168 hours. frontend_vofrontend_service_frontend Run Held Idle Unknwn | Pending Wait StgIn StgOut | RunDiff IdleDiff %RD ss_ITB_GRATIA_TEST_1 71.0K 0.0 19.4K 0.0 | 19.4K 0.0 0.0 3.9K | 23.1K -6.1K 32% ----------------------------------- LEGEND: K = x 1,000 M = x 100,000 Run : Status Running Held : Status Held Idle : Status Idle Unknwn : Status Unknown (StatusIdleOther) Pending : Status Pending Wait : Status Wait StgIn : Status Stage In StgOut : Status Stage Out RunDiff : StatusRunning - ClientRegistered (ClientGlideTotal) IdleDiff : StatusIdle - ReqIdle (Requested Idle) %RD - Percent RunDiff over Running (RunDiff/StatusRunning) -------------------------------------
analyze_frontends
This tool, found in factory/tools/analyze_frontends can list many statistics useful for Factory administrators. This tool will show thee number of registered, claimed, and unmatched slots. It can list these per frontend or per entry.
The command-line arguments are listed below:| --source ABSPATH | Required. Unless you are running this in the Factory directory, you must specify the absolute path to the Factory directory |
| -x | Interval to look at (in hours). Valid options are 2, 24, or 168. |
| -p | Look at all the above intervals. |
| -f FRONTEND | Filter by Frontend. You can omit "frontend_" at the beginning of the name. |
| -z | Zero suppression (don't show entries with 0s across all attributes) |
| -m | Emphasize frontend data, no entries shown. By default, slots are shown. You can use -ms to show seconds or -mh to show hours. |
| -msort ATTRIBUTE | Frontend mode, sort by attribute (strt, fval, 0job, val, idle, wst, badp, waste, time, total) |
| -h | Show usage message |
Example usage:
./analyze_frontends --source /opt/wmsfactory/glidein_wmsfactory_instance -x 168 Status Attributes (Clients) analysis for All Entries - 01-11-2011_15:28:06 ---------------------------------------- Past 168.0 hours: Registered: 47.8K ( 13.3 hours - 0.1 slots) Claimed: 31.8K ( 8.8 hours - 0.1 slots - 66%) Unmatched : 14.6K ( 4.1 hours - 0.0 slots - 30%) Requested Idle: 25.5K ( 7.1 hours - 0.0 slots) Jobs Running: 31.7K ( 8.8 hours - 0.1 slots) Jobs Run Here: 0.0 ( 0.0 hours - 0.0 slots) Jobs Idle: 40.0K ( 11.1 hours - 0.1 slots) RunDiff (Running-ClientRegistered): 23.1K ( 6.4 hours - 0.0 slots - 32%) --------------------------------------- --------------------------------------- Per Entry (all frontends) stats for the past 168 hours. Regd Claimd Unmtchd | ReqIdle | JobRun JobHere JobIdle | RunDiff %UM %RD ss_ITB_GRATIA_TEST_1 47.8K 31.8K 14.6K | 25.5K | 31.7K 0.0 40.0K | 23.1K 30% 32% --------------------------------------- --------------------------------------- Per Entry (per frontend) stats for the past 168 hours. frontend_vofrontend_service_frontend Regd Claimd Unmtchd | ReqIdle | JobRun JobHere JobIdle | RunDiff %UM %RD ss_ITB_GRATIA_TEST_1 47.8K 31.8K 14.6K | 25.5K | 31.7K 0.0 40.0K | 23.1K 30% 32% ----------------------------------- LEGEND: K = x 1,000 M = x 100,000 Regd - Registered (ClientGlideTotal) Claimd - Claimed (ClientGlideRunning) Unmtchd - Unmatched (ClientGlideIdle) ReqIdle - Requested Idle JobRun - Client Jobs Running JobHere - Client Jobs Run Here JobIdle - Client Jobs Idle RunDiff - StatusRunning - ClientRegistered (ClientGlideTotal) %UM - Percent Unmatched (Unmatched/Registered) %RD - Percent RunDiff over Running (RunDiff/StatusRunning) -------------------------------------


Search
Preparing search index...
The search index is not available
telegram
Options
All
Public
Public/Protected
All
Inherited
Menu
telegram
tl/api
Api
channels
Namespace channels
Index
Classes
Channel
Participants
Channel
Participants
Not
Modified
Channel
Participant
Admin
Log
Results
Read
History
Delete
Messages
Delete
User
History
Report
Spam
Get
Messages
Get
Participants
Get
Participant
Get
Channels
Get
Full
Channel
Create
Channel
Edit
Admin
Edit
Title
Edit
Photo
Check
Username
Update
Username
Join
Channel
Leave
Channel
Invite
ToChannel
Delete
Channel
Export
Message
Link
Toggle
Signatures
Get
Admined
Public
Channels
Edit
Banned
Get
Admin
Log
Set
Stickers
Read
Message
Contents
Delete
History
Toggle
Pre
History
Hidden
Get
Left
Channels
Get
Groups
For
Discussion
Set
Discussion
Group
Edit
Creator
Edit
Location
Toggle
Slow
Mode
Get
Inactive
Channels
Convert
ToGigagroup
Type aliases
Type
Channel
Participants
Type
Channel
Participant
Type
Admin
Log
Results
Type aliases
Type
Channel
Participants
Type
Channel
Participants
:
ChannelParticipants
|
ChannelParticipantsNotModified
Type
Channel
Participant
Type
Channel
Participant
:
ChannelParticipant
Type
Admin
Log
Results
Type
Admin
Log
Results
:
AdminLogResults
Modules
tl/api
Api
account
auth
bots
channels
contacts
folders
help
langpack
messages
payments
phone
photos
stats
stickers
storage
updates
upload
users
Channel
Participants
Channel
Participants
Not
Modified
Channel
Participant
Admin
Log
Results
Type
Channel
Participants
Type
Channel
Participant
Type
Admin
Log
Results
Read
History
Delete
Messages
Delete
User
History
Report
Spam
Get
Messages
Get
Participants
Get
Participant
Get
Channels
Get
Full
Channel
Create
Channel
Edit
Admin
Edit
Title
Edit
Photo
Check
Username
Update
Username
Join
Channel
Leave
Channel
Invite
ToChannel
Delete
Channel
Export
Message
Link
Toggle
Signatures
Get
Admined
Public
Channels
Edit
Banned
Get
Admin
Log
Set
Stickers
Read
Message
Contents
Delete
History
Toggle
Pre
History
Hidden
Get
Left
Channels
Get
Groups
For
Discussion
Set
Discussion
Group
Edit
Creator
Edit
Location
Toggle
Slow
Mode
Get
Inactive
Channels
Convert
ToGigagroup
Generated using
TypeDoc


Build your slides with hovercraft
QRAZ is hovercraft as a service. Create your slides using Restructured Text, push it to Github and let QRAZ build and host your slides for you.
{% extends "qraz/base.html" %} {% block content %}
QRAZ is hovercraft as a service. Create your slides using Restructured Text, push it to Github and let QRAZ build and host your slides for you.


Toggle navigation
www.sellmebazar.com
My Account
Submit a Free Add
Submit a free classified add
Ad Title:
Category1:
slect me
Category2:
slect me
Category3:
slect me
Prize:
Ad Description:
Photos:
Name:
Mobile:
City:
Remember me
Submit


Lindsay Lohan ex Harry Morton found dead aged 38
by Buzz ContributorLindsay Lohan 's ex Harry Morton has been found dead at his home, passing away at the age of 38.
TMZ reports that the Pink Taco founder has died after being found unresponsive at his home by a relative on Saturday.
Harry was pronounced dead at his Beverly Hills home, according to the publication.
It's said that foul play is not suspected and an autopsy will be carried out to determine the cause of his death.
Harry famously dated Mean Girls actress Lindsay in 2006, but the relationship fizzled out.
The businessman was also romantically linked to Demi Moore, Britney Spears and Paris Hilton at various stages.
Reports also linked him to Jennifer Aniston and Hayden Panettiere, according to TMZ.
Harry also bought The Viper Room in 2008, where actor River Phoenix died of an overdose in 1993, but is said to have sold it.
He was the son of Hard Rock Cafe co-founder Peter Morton and his grandfather Arnie was also in the restaurant business and co-founded Morton's Steakhouse back in 1978.
Harry founded Pink Taco when he was just 18 years old.
Harry also owned Elvis Presley's former Beverly Hills estate, but it is not believed that Harry died at that residence.
Following his death Lindsay's mom Dina is said to have posted an image of her daughter with Harry to Instagram, writing: "RIP Harry God has an angel, we love you!
"Prayers to the family."
Lindsay is yet to respond to the news of her ex-boyfriend's passing.


General
(1) What is the goal?(2) Which “sentences” should be labeled?
(3) When to mark as “False Positive”?
(4) When to mark as "Needs verification”?
Tag Specific
(5) Thinking about the "solution"? Is it about the solution described in the artifact? or is it about the solution we propose?(6) GitHub issue:
'Add example to serializer component docs'.To me it looks simple: issue: missing example, solution: add example. but since we have predefined tags, it falls under completeness(?), so I should use that?
Other
(7) What's the difference btw *User guide* and *Developer Guide*?(1) What is the goal?
The goal of the paper is categorizing documentation issues in order to define a research agenda for the SE community. The classification is done at sentence level, so for a single artefact we can have multiple dimensions classified with multiple tags
(2) Which “sentences” should be labeled?
The sentences of interest are those related to the five dimension we classify: issue, solution, actor, type, tool.
(3) When to mark as “False Positive”?
if an artifact (1) is empty , or (2) is not related to a documentation issue, we classify it as false positive, otherwise we proceed in the classification.
(4) When to mark as "Needs verification”?
to mark something that is worth discussing between us once the first set of documents has been tagged. so it is not like "I will visit this tag later" and it’s to mark it in the database as in need for further check/discussion
(5) Thinking about the "solution"? Is it about the solution described in the artifact? or is it about the solution we propose?
We do not propose or guess. We are labelling what is in the artefact.
(6) GitHub issue: 'Add example to serializer component docs'
. To me it looks simple: issue: missing example, solution: add example. but since we have predefined tags, it falls under completeness(?), so I should use that?
We can follow the following practice to keep hierarchies: "Completeness: Missing working examples".
(7) What's the difference btw *User guide* and *Developer Guide*?
If the tool is an API, the users and developers are the same. if the tool is a system, users and developers are different. User manual can be also technical (like the guide for installing haddop)


This example demonstrates how the init and foreachInit bindings can build up a plain JS (non-observable) model. This is useful for pages where the content is generally static, but you want to attach some behavior to existing state.
View model:


A suite of practical psychometric analysis and research tools of item response theory, including the 3-parameter-logistic model and the generalized partial credit model as well as functions to perform: (1) parameter estimation, (2) automated test assembly, (3) simulation of computerized adaptive testing (CAT), and (4) assembly and simulation of multistage testing. More documentation at <https://github.com/xluo11/xxIRT>.
| Version: | 2.1.1 |
| Depends: | R (≥ 3.1.0) |
| Imports: | ggplot2, glpkAPI, lpSolveAPI, reshape2, stats, utils |
| Suggests: | testthat |
| Published: | 2018-10-02 |
| Author: | Xiao Luo [aut, cre] |
| Maintainer: | Xiao Luo <xluo1986 at gmail.com> |
| BugReports: | https://github.com/xluo11/xxIRT/issues |
| License: | GPL (≥ 3) |
| URL: | https://github.com/xluo11/xxIRT |
| NeedsCompilation: | no |
| In views: | Psychometrics |
| CRAN checks: | xxIRT results |
| Reference manual: | xxIRT.pdf |
| Package source: | xxIRT_2.1.1.tar.gz |
| Windows binaries: | r-devel: xxIRT_2.1.1.zip, r-release: xxIRT_2.1.1.zip, r-oldrel: xxIRT_2.1.1.zip |
| OS X binaries: | r-release: xxIRT_2.1.1.tgz, r-oldrel: xxIRT_2.1.1.tgz |
| Old sources: | xxIRT archive |
Please use the canonical form https://CRAN.R-project.org/package=xxIRT to link to this page.


Cancel Find
Cancel Save
Confirme Delete Intent
Cancel Yes
Name :{{i.name}}
Cancel ADD
Confirme Deleting Example ?


You can now use the Prominence service. Your access token is:
Copy
Note: new access tokens expire in 3 weeks.
Please go to the documentation for information on how to install the Prominence command line interface and how to submit jobs.


Kartikey Kumar
Secretary
Kunal Kandu
Captain
Hitesh Yadav
Project Manager
Yashwant Rawat
Chairperson
Aditya Som
Head
Mohammed Fahim
Member
Vidya Sagar Vepa
Ujjwal Rustagi
Ashutosh Gupta
Mitul Jinger
Ritesh Ranjan
Ankit Singh Rawat
Manan Vora
Durgansh Mishra
Shardul Shinde
Rushabh Parikh
Khushi Meena
Sanchit Sharma
Upendra Kumar
M Sarim Ameed Khan
Tanmay Sandbhor
Priyanshu Bhanu
Sitanshu Chaudhari
Shubham Panchal
Nitish Tripura
Vishal Yadav
Rahul Dewangan
Pratyanshu Raj Singh
Shyam Sundar Chauhan
V Venu Madhav


What is the minimum number of nodes in a full binary tree with height 3?
First, draw a vertical chain of 4 nodes. This is a tree with height 3.
Next, add nodes to make the tree be full.


{# approve/approve.html #} {% extends "approve/base.html" %} {% block point %}
Currently the conference database is blocking processing this video.
If you feel this is in error, please contact the event organizers, likely they need your permission to release.
Once data is syncroized, come back to this page
to review
and there should be an "Approve" button.


{React,
This is a simple package to notify N1 users if an email is a potential phishing scam.
You can access N1 dependencies by requiring ‘nylas-exports’
{React,
The ComponentRegistry manages all React components in N1.
ComponentRegistry,
A Store
is a Flux component which contains all business logic and data
models to be consumed by React components to render markup.
MessageStore} = require 'nylas-exports'
Notice that this file is main.cjsx
rather than main.coffee
. We use the
.cjsx
filetype because we use the CJSX DSL to describe markup for React to
render. Without the CJSX, we could just name this file main.coffee
instead.
class PhishingIndicator extends React.Component
Adding a @displayName to a React component helps for debugging.
@displayName: 'PhishingIndicator'
@propTypes is an object which validates the datatypes of properties that this React component can receive.
@propTypes:
thread: React.PropTypes.object.isRequired
A React component’s render
method returns a virtual DOM element described
in CJSX. render
is deterministic: with the same input, it will always
render the same output. Here, the input is provided by @isPhishingAttempt.
@state
and @props
are popular inputs as well.
render: =>
Our inputs for the virtual DOM to render come from @isPhishingAttempt.
[from, reply_to] = @isPhishingAttempt()
We add some more application logic to decide how to render.
if from isnt null and reply_to isnt null
React.createElement("div", {"className": "phishingIndicator"},
React.createElement("b", null, "This message looks suspicious!"),
React.createElement("p", null, "It originates from ", (from), " but replies will go to ", (reply_to), ".")
)
If you don’t want a React component to render anything at all, then your
render
method should return null
or undefined
.
else
null
isPhishingAttempt: =>
In this package, the MessageStore is the source of our data which will be
the input for the render
function. @isPhishingAttempt is performing some
domain-specific application logic to prepare the data for render
.
message = MessageStore.items()[0]
This package’s strategy to ascertain whether or not the email is a
phishing attempt boils down to checking the replyTo
attributes on
Message
models from MessageStore
.
if message.replyTo? and message.replyTo.length != 0
The from
and replyTo
attributes on Message
models both refer to
arrays of Contact
models, which in turn have email
attributes.
from = message.from[0].email
reply_to = message.replyTo[0].email
This is our core logic for our whole package! If the from
and
replyTo
emails are different, then we want to show a phishing warning.
if reply_to isnt from
return [from, reply_to]
return [null, null];
module.exports =
Activate is called when the package is loaded. If your package previously
saved state using serialize
it is provided.
activate: (@state) ->
This is a good time to tell the ComponentRegistry
to insert our
React component into the 'MessageListHeaders'
part of the application.
ComponentRegistry.register PhishingIndicator,
role: 'MessageListHeaders'
Serialize is called when your package is about to be unmounted. You can return a state object that will be passed back to your package when it is re-activated.
serialize: ->
This optional method is called when the window is shutting down, or when your package is being updated or disabled. If your package is watching any files, holding external resources, providing commands or subscribing to events, release them here.
deactivate: ->
ComponentRegistry.unregister(PhishingIndicator)


Sign Up
×
Email address
Password
×
Teach Me:
Submit
Recipes
Take Out
Learn
Login
Email address
Password
Sign in
Sign out
New User? Sign Up!
What's in Your Fridge?
Feed Me
Cutting Board
Open Freezer
Let's See Them Recipes
Freezer
Store
Voila!


The Agents
reviewd
-- reviews request database and submits missing pieces
catalogd
-- catalogs all files from ongoing productions
Modified: Thu Dec 15 15:44:20 EST 2016
Christoph Paus


PicoContainer can add behaviors to components automatically during instantiation.
Behaviors are deleivered by passing a BehaviorFactory reference into the PicoContainer instance on construction. For the most part BehaviorFactories are completely stateless, and the Behavior instances they make are not.
See below for details on Caching and Singletons, Implementation Hiding and Hot Swapping, as well as Other behaviors
DefaultPicoContainer can take a behavior factory instance in its constructor:
pico = new DefaultPicoContainer(new BehaviorClass()); pico.addComponent(Foo.class); // other components added Foo foo = pico.getcomponent(Foo.class) // Foo instance will be affected by an additonal behavior.
Or it can take behaviours that wrap each other:
pico = new DefaultPicoContainer(new BehaviorClass().wrap(new AnotherBehaviorClass())); pico.addComponent(Foo.class); // other components added Foo foo = pico.getcomponent(Foo.class) // Foo instance will be affected by two additonal behaviors.
Behaviors can be signalled by properties per component:
pico = new DefaultPicoContainer(); pico.as(SOME_BEHAVIOR).addComponent(Foo.class); // the behavior has a property marking it, and the default component facory understands that property // other components added Foo foo = pico.getcomponent(Foo.class) // Foo instance will be affected by an additonal behavior.
You can build a container with the applicable property:
pico = new PicoBuilder().withXXXBehavior().build(); pico.addComponent(Foo.class); // other components added Foo foo = pico.getcomponent(Foo.class) // Foo instance will be affected by an additonal behavior.
Behaviors can be chained together by PicoBuilder:
import static org.picocontainer.behaviors.Behaviors.xxxxxxx; import static org.picocontainer.behaviors.Behaviors.yyyyyyy; ... pico = new PicoBuilder().withBehaviors(xxxxxxx(), yyyyyyy()).build(); pico.addComponent(Foo.class); // other components added Foo foo = pico.getcomponent(Foo.class) // Foo instance will be affected by two additonal behaviors.
When components are created by two threads concurrently, with the intention of the instance being cached, it is possible in a small percentage of cases for the first instance into the cache to be replaced with a second instance. To prevent this, you may want to try one of two behaviors to make the operation thread safe.
Synchronizing wraps object creation in Java's classic synchronize feature:
pico = new DefaultPicoContainer(new Synchronizing().wrap(new Caching())); pico.addComponent(Apple.class); Apple a1 = pico.getComponent(Apple.class); Apple a2 = pico.getComponent(Apple.class); // both the same instance
pico = new DefaultPicoContainer(); pico.as(SYNCHRONIZE, CACHE).addComponent(Apple.class); Apple a1 = pico.getComponent(Apple.class); Apple a2 = pico.getComponent(Apple.class); // both the same instance
pico = new PicoBuilder().withSynchronizing().withCaching().build(); pico.addComponent(Apple.class); Apple a1 = pico.getComponent(Apple.class); Apple a2 = pico.getComponent(Apple.class); // both the same instance
import static org.picocontainer.behaviors.Behaviors.synchronizing; import static org.picocontainer.behaviors.Behaviors.caching; ... pico = new PicoBuilder().withBehaviors(synchronizing(), caching()).build(); pico.addComponent(Apple.class); Apple a1 = pico.getComponent(Apple.class); Apple a2 = pico.getComponent(Apple.class); // both the same instance
Locking wraps object creation in JDK 1.5's ReentrantLock facility. It is suggested that this is a more efficient alternative to the Synchronizing behaviour above:
pico = new DefaultPicoContainer(new Locking().wrap(new Caching())); pico.addComponent(Apple.class); Apple a1 = pico.getComponent(Apple.class); Apple a2 = pico.getComponent(Apple.class); // both the same instance
pico = new DefaultPicoContainer(); pico.as(LOCK, CACHE).addComponent(Apple.class); Apple a1 = pico.getComponent(Apple.class); Apple a2 = pico.getComponent(Apple.class); // both the same instance
pico = new PicoBuilder().withLocking().withCaching().build(); pico.addComponent(Apple.class); Apple a1 = pico.getComponent(Apple.class); Apple a2 = pico.getComponent(Apple.class); // both the same instance
import static org.picocontainer.behaviors.Behaviors.locking; import static org.picocontainer.behaviors.Behaviors.caching; ... pico = new PicoBuilder().withBehaviors(synchronizing(), caching()).build(); pico.addComponent(Apple.class); Apple a1 = pico.getComponent(Apple.class); Apple a2 = pico.getComponent(Apple.class); // both the same instance
This is where there are a number of setters for a component that will be could be set after instantiation. A way of handing in some configuration if you like.
class Foo { String message; public void setMessage(String message) { this.message = message; } public String toString() { return message; } } ... pico = new DefaultPicoContainer(new PropertyApplying()); pico.addComponent(Foo.class); PropertyApplicator pa = (PropertyApplicator) pico.getComponentAdapter(Foo.class); pa.setProperty("message", "hello"); System.out.println(pico.getComponent(Foo.class)); // prints hello
pico = new DefaultPicoContainer(); pico.as(APPLY_PROPERTIES).addComponent(Foo.class); PropertyApplicator pa = (PropertyApplicator) pico.getComponentAdapter(Foo.class); pa.setProperty("message", "hello"); System.out.println(pico.getComponent(Foo.class)); // prints hello
pico = new PicoBuilder().withProperties().build(); pico.addComponent(Foo.class); PropertyApplicator pa = (PropertyApplicator) pico.getComponentAdapter(Foo.class); pa.setProperty("message", "hello"); System.out.println(pico.getComponent(Foo.class)); // prints hello
import static org.picocontainer.behaviors.Behaviors.propertyApplying; ... pico = new PicoBuilder().withBehaviors(propertyApplying()).build(); pico.addComponent(Foo.class); PropertyApplicator pa = (PropertyApplicator) pico.getComponentAdapter(Foo.class); pa.setProperty("message", "hello"); System.out.println(pico.getComponent(Foo.class)); // prints hello
import static org.picocontainer.behaviors.Behaviors.caching; import static org.picocontainer.behaviors.Behaviors.propertyApplying; ... pico = new PicoBuilder().withBehaviors(caching(), propertyApplying()).build(); pico.addComponent(Foo.class); Cached cached = (Cached) pico.getComponentAdapter(Foo.class); PropertyApplicator pa = (PropertyApplicator) getDelegate(PropertyApplicator.class); pa.setProperty("message", "hello"); System.out.println(pico.getComponent(Foo.class)); // prints hello
This is where a component is going to be instantiated regardless of whether:
It is most likely that you're doing this because the component in question is self contained and doing something once only. Alternatively, you're cutting a legacy codebase over from nest-of-singletons to dependency injection in stages.
class Foo { public Foo() { System.out.println("Foo was instantiated"); } } ... pico = new DefaultPicoContainer(new Automatic()); pico.addComponent(Foo.class); pico.addComponent("bar", String.class); pico.getComponent("bar"); // Foo instantiated too.
pico = new DefaultPicoContainer(); pico.as(AUTOMATIC).addComponent(Foo.class); pico.addComponent("bar", String.class); pico.getComponent("bar"); // Foo instantiated too.
pico = new PicoBuilder().withAutomatic().build(); pico.addComponent(Foo.class); pico.addComponent("bar", String.class); pico.getComponent("bar"); // Foo instantiated too.
import static org.picocontainer.behaviors.Behaviors.automatic; ... pico = new PicoBuilder().withBehaviors(automatic()).build(); pico.addComponent(Foo.class); pico.addComponent("bar", String.class); pico.getComponent("bar"); // Foo instantiated too.


Package quickparse.grammar
Class Grammar
java.lang.Object
quickparse.grammar.Grammar
- All Implemented Interfaces:
java.lang.Iterable<Rule>
public class Grammar extends java.lang.Object implements java.lang.Iterable<Rule>
Represents a BNF (Backus-Naur Form) grammar as a set of syntactical rules.
To create a new instance of this class, the method
create()
must be used.
A grammar is an iterable object whose elements are the grammar rules.-
Nested Class Summary
Nested Classes Modifier and Type Class Description static class
Grammar.Builder
Allows the construction of agrammar
, rule by rule -
Method Summary
Modifier and Type Method Description static Grammar.Builder
create()
Creates a newGrammar.Builder
that allows the construction of a grammar, rule by rule.ConstructSymbol
getAxiom()
Gets the axiom of the grammar (i.e., the first symbol from which a parser should start to interpret the grammar)ConstructSymbol
getConstructSymbol(java.lang.String name)
Gets theConstructSymbol
associated to the given construct name, if any.java.util.Collection<ConstructSymbol>
getConstructSymbols()
Gets all the construct symbols that are specified in this grammar.java.util.Set<java.util.regex.Pattern>
getIgnoredPatterns()
Returns the list of patterns to ignore.java.util.Map<ConstructSymbol,java.util.List<Rule>>
getRules()
Returns the rules contained in this grammar.java.util.List<Rule>
getRules(java.lang.String symbol)
Gets all rules used to produce the specified construct (i.e., rules whose head is the specified symbol)java.util.List<Rule>
getRules(ConstructSymbol symbol)
Gets all rules used to produce the specified construct (i.e., rules whose head is the specified symbol)TokenSymbol
getTokenSymbol(java.lang.String name)
Gets theTokenSymbol
associated to the given token name, if any.java.util.Collection<TokenSymbol>
getTokenSymbols()
Gets all the token symbols that are specified in this grammar.java.util.Iterator<Rule>
iterator()
java.lang.String
toString()
-
Method Details
-
getIgnoredPatterns
public java.util.Set<java.util.regex.Pattern> getIgnoredPatterns()Returns the list of patterns to ignore. The ignored patterns usually are spaces and comment patterns (e.g. '//...\n' or '#...\n')- Returns:
- a list of
patterns
-
getRules
Returns the rules contained in this grammar.- Returns:
- A map that associates a
ConstructSymbol
to the rules contained in this grammar that produce it.
-
getRules
Gets all rules used to produce the specified construct (i.e., rules whose head is the specified symbol)- Parameters:
symbol
- the head of the rules- Returns:
- the list of rules that produce the specified construct
- See Also:
getRules(ConstructSymbol)
-
getRules
Gets all rules used to produce the specified construct (i.e., rules whose head is the specified symbol)- Parameters:
symbol
- the head of the rules- Returns:
- the list of rules that produce the specified construct
- See Also:
getRules(String)
-
getTokenSymbols
Gets all the token symbols that are specified in this grammar.- Returns:
- an unmodifiable collection of
TokenSymbol
-
getConstructSymbols
Gets all the construct symbols that are specified in this grammar.- Returns:
- an unmodifiable collection of
ConstructSymbol
-
getTokenSymbol
Gets theTokenSymbol
associated to the given token name, if any.- Parameters:
name
- the name of the token- Returns:
- a
TokenSymbol
object
-
getConstructSymbol
Gets theConstructSymbol
associated to the given construct name, if any.- Parameters:
name
- the name of the construct- Returns:
- a
ConstructSymbol
object
-
getAxiom
Gets the axiom of the grammar (i.e., the first symbol from which a parser should start to interpret the grammar)- Returns:
- a
ConstructSymbol
object representing the axiom
-
toString
public java.lang.String toString()- Overrides:
toString
in classjava.lang.Object
-
create
Creates a newGrammar.Builder
that allows the construction of a grammar, rule by rule.- Returns:
- a
Grammar.Builder
instance
-
iterator
- Specified by:
iterator
in interfacejava.lang.Iterable<Rule>
-


Heterogeneous
Login
Signup
{% include "flash.html" %}
Signup
{{ params['form'].hidden_tag() }}
Account
Username *
{{ params['form'].username(class_="form-control required", placeholder='Username') }}
Email *
{{ params['form'].email(class_="form-control required", placeholder='Email') }}
Password *
{{ params['form'].password(class_="form-control example1 required", id="password1",placeholder='This field is required') }}
Confirm Password *
Accept
Previous
Next
Page:
/
I agree with the Terms and Conditions.
Finish
Welcome! You can start exploring.


Thai bank targets $1 billion spinoff among its fintech units
Siam Commercial Bank Pcl plans to spin off some of its fintech divisions as it tries to monetize its push into technology investment at a time of sluggish earnings from traditional lending.
The nation’s third-biggest lender by assets expects one of the fintech units has the potential to become a ‘unicorn,’ or a private company with a valuation of $1 billion or more, according to Siam Commercial Co-President Orapong Thien-Ngern. "We will spin off some of them to allow them more freedom and independence, including raising their own funds from other investors,” Orapong said in an interview on Wednesday.
He didn’t specify which divisions might be spun off, but the bank’s main technology units include Digital Ventures Co., which invests in startups, and National ITMX Co., a payments services provider, according to its 2018 annual report.
"Thai banking like most other countries is a sunsetting industry, as existing lenders and new players are competing for limited pools of customers,” said Orapong, 57. "Venture capital and technology investments will be the key survival strategies for SCB in attracting new customers and boosting earnings.”
Siam Commercial and other local banks have been investing in technology to fend off competition from fintech startups, at a time when margins from regular lending operations are under pressure. The bank’s return on equity has fallen from 20% in 2014 to about 11% in the quarter ended Sept. 30, according to data compiled by Bloomberg.
Chief Executive Officer Arthid Nanthawithaya said in August he wants to transform Siam Commercial into a technology company, and the firm has recently completed a four-year capital spending program worth $1.3 billion focused on artificial intelligence, digital platforms and other technology.
The Thai lender will require additional "major investments” in areas such as artificial intelligence, to improve its data and transaction processing, according to Orapong. The amount of those investments is still under consideration and will need to be approved by the bank’s board, he said.
Orapong is also chief executive officer of Digital Ventures, which has a $100 million budget for investing in technology and innovation businesses, according to its website. The unit has invested in startups such as Pagaya, an AI-based asset management company, and Ripple.
"SCB has a very positive development as the country’s leading player for digital technology, despite its late start,” said Sukrit Friestad, an analyst at CGS-CIMB Securities (Thailand) Co. in Bangkok. "Still, it will need further large technology investments to stay competitive. This would continue to put pressure on its earnings.”
Read also
Read More
Fitch affirms Doha Bank at ‘A’; Outlook Stable
Fitch Ratings has affirmed Doha Bank (DB) Long-Term Issuer Default Rating (IDR) at ‘A’ with a Stable Outlook.
Read More
Qatar banks can largely fend off tougher 2020
As the outlook for Qatar’s real estate, construction and hospitality sectors is delicately poised, Qatar banks should contend with challenging credit conditions in 2020. The banks’ asset quality is expected to deteriorate slightly for the coming year, but strong and timely support from the government is a mitigating factor, S&P Global Ratings noted yesterday.
Read More
Queues build at Lebanese banks reopening after one-week closure
Queues built as Lebanese banks reopened on Tuesday after a one-week closure, with police deployed at branches and banks imposing tight restrictions on hard currency withdrawals and transfers abroad.
Read More
Lagarde takes the lead as central banks come to fore
Read More
Lebanese banks closed due to strike: Union head
Banks in the Lebanese capital Beirut and other areas will be closed on Tuesday due to a strike, the head of the banking union told Reuters.
Read More
Lebanon c.bank says bank deposits are safe, banks to review curbs
Lebanon's central bank governor, seeking to shore up creaking confidence in the banking system amid the worst economic crisis in decades, said on Monday bank deposits are secure and it had the ability to preserve the stability of the Lebanese pound peg.


#include <loganon/ip_anon.h>
#include <loganon/random.h>
#include <uthash/uthash.h>
Functions | |
| int | loganon_ip_anon (int argc, char *argv[]) |
| struct node * | new_ip_list () |
| unsigned long int | search_and_insert (unsigned long int value, struct node *head, struct node *current, struct node *last) |
| unsigned long int | new_unique_ip (struct node *head) |
| int | search (struct node *head, unsigned long int value) |
| void | put_on_top (struct node *head, struct node *current, struct node *last) |
| struct addr * | loganon_ipv4_black_marker (struct addr ip, int fields) |
| struct addr * | loganon_ipv4_field_rotation (struct addr ip, int fields) |
| Gets and ip in struct addr (libdnet) format and rotate fields "int fields" times. | |
| char * | truncation (char *ip, int newLen) |
| Truncate the given char ip. | |
| char * | black_marker (char *ip, int octet_number) |
| Black marker, anonymize the entire field or just part of it. | |
| unsigned int * | loganon_black_marker (unsigned int ip, int octet_number) |
| Anonymize the entire field or just part of it. | |
| int | get_random_field () |
| char * | random_permutation () |
| struct ip_node * | loganon_hash_table () |
| Creates new hash table. This is the handler for all ip_anon anonymization functions. | |
| void | loganon_destruct_hash (struct ip_node *hash_table) |
| Free all memory ocupied by hash table. | |
| int | add_to_hash (unsigned long int key, unsigned long int newValue) |
| struct ip_node * | loganon_new_hash_node (struct ip_node *hash_table, unsigned long int key, unsigned long int newValue, struct ip_node *zero_node) |
| Return a new hash node or the node foundend in hash table. | |
| unsigned long int | loganon_ipv4_hash_anon (struct ip_node *hash_table, unsigned long int ind) |
| Return a new random ip, or an already used ip on anonymization proccess. |
| int add_to_hash | ( | unsigned long int | key, | |
| unsigned long int | newValue | |||
| ) |
| char* black_marker | ( | char * | ip, | |
| int | octet_number | |||
| ) |
Black marker, anonymize the entire field or just part of it.
| Ip | in string format | |
| number | of octets |
| int get_random_field | ( | ) |
| unsigned int* loganon_black_marker | ( | unsigned int | ip, | |
| int | octet_number | |||
| ) |
Anonymize the entire field or just part of it.
| unsigned | int ip - Ip for black mark | |
| octet_number | - Number of octets to mark |
| void loganon_destruct_hash | ( | struct ip_node * | hash_table | ) |
Free all memory ocupied by hash table.
| The | hash_table head node |
| struct ip_node* loganon_hash_table | ( | ) | [read] |
Creates new hash table. This is the handler for all ip_anon anonymization functions.
| int loganon_ip_anon | ( | int | argc, | |
| char * | argv[] | |||
| ) |
| struct addr* loganon_ipv4_black_marker | ( | struct addr | ip, | |
| int | fields | |||
| ) | [read] |
struct addr ip black marker, rotate fields "int fields" times
| struct | addr ip (libdnet) | |
| int | fields |
| struct addr* loganon_ipv4_field_rotation | ( | struct addr | ip, | |
| int | fields | |||
| ) | [read] |
Gets and ip in struct addr (libdnet) format and rotate fields "int fields" times.
| struct | addr ip | |
| int | fields |
| unsigned long int loganon_ipv4_hash_anon | ( | struct ip_node * | hash_table, | |
| unsigned long int | ind | |||
| ) |
Return a new random ip, or an already used ip on anonymization proccess.
| A | utHash table, network format ip |
| struct ip_node* loganon_new_hash_node | ( | struct ip_node * | hash_table, | |
| unsigned long int | key, | |||
| unsigned long int | newValue, | |||
| struct ip_node * | zero_node | |||
| ) | [read] |
Return a new hash node or the node foundend in hash table.
| struct node* new_ip_list | ( | ) | [read] |
| unsigned long int new_unique_ip | ( | struct node * | head | ) |
| void put_on_top | ( | struct node * | head, | |
| struct node * | current, | |||
| struct node * | last | |||
| ) |
| char* random_permutation | ( | ) |
| int search | ( | struct node * | head, | |
| unsigned long int | value | |||
| ) |
| unsigned long int search_and_insert | ( | unsigned long int | value, | |
| struct node * | head, | |||
| struct node * | current, | |||
| struct node * | last | |||
| ) |
| char* truncation | ( | char * | ip, | |
| int | newLen | |||
| ) |
Truncate the given char ip.
| ip | in string format | |
| the | new len of string |


other
Source⧉Crypto
other
39 messages
⧉infominer
17-Aug-18 10:56 PM
There has been a ton of hype about quantum computing, lately. It promises ultra-fast computation and the ability to solve complex problems that even a supercomputer is no match for. What exactly is a quantum computing? How does a quantum computer work? How close are...
⧉infominer
26-Aug-18 12:08 AM
With all the noise about 3D printed guns, let’s talk about what they are and are not. 1/
Twitter
⧉infominer
26-Aug-18 12:51 AM
Making a quick clone of myself with AR spatial mapping https://t.co/dOdL7JpCn6
Retweets
2268
Likes
7821
Twitter
⧉infominer
30-Aug-18 07:37 PM
Follow me on my STEAM adventures!
The Long Read: In 1972, a British scientist sounded the alarm that sugar – and not fat – was the greatest danger to our health. But his findings were ridiculed and his reputation ruined. How did the world’s top nutrition scientists get it so wrong for so long?
⧉infominer
04-Sep-18 11:52 AM
@DICKIMINAJ @jacobmaxwells On the Netflix show “Explained”, there is a short episode called “!” and it explains why people misuse it so much :’)
Retweets
134
Likes
3132
Twitter
venalbe
06-Sep-18 04:12 PM
Kialo is the platform for rational debate. Empowering reason through friendly and open discussions.
⧉infominer
07-Sep-18 01:59 AM
Lists of references at the bottom of long texts interrupt a smooth reading experience for readers. By forcing them to… by tibra
⧉infominer
11-Sep-18 01:40 PM
Learn for free about math, art, computer programming, economics, physics, chemistry, biology, medicine, finance, history, and more. Khan Academy is a nonprofit with the mission of providing a free, world-class education for anyone, anywhere.
⧉infominer
23-Sep-18 12:50 AM
1947: An error in the Mark II computer at Harvard University was due to a moth trapped in a relay. The moth was attached to the log book with notation "first actual case of bug being found." Yes, that's the actual moth taped to the log. Best. Bug. Report. Evah!
Retweets
765
Likes
1487
Twitter
⧉infominer
23-Sep-18 05:40 AM
KETO DISCUSSION
Ketogenesis doesn't require low-carb consumption. Just infrequent feeding, and not too infrequent at that. Just skip breakfast.
(Discussion around Antifragility and Convexity in Medicine)
https://t.co/EzrlOG4M1J
cc:@drjasonfung @MichaelSagnerMD @GuruAna...
Retweets
233
Likes
945
Twitter
⧉infominer
23-Sep-18 05:54 AM
I seldom apologize in emails.
Alternatives:
- Thanks for flagging!
- Good catch - I will make the updates/changes.
- Many thanks for noticing the error, [name], we will [verb]
- Thank you for bringing this to our attention. We will [verb]
Stop over-apologizing at work.
Retweets
74586
Likes
377527
Twitter
⧉infominer
23-Sep-18 06:04 AM
The Lindy Effect states that the future life expectancy is proportional to their current age.
⧉infominer
28-Sep-18 07:46 PM
With a generation of old coders leaving, companies are scrambling to find those who know the decades-old program.
⧉infominer
03-Oct-18 01:59 AM
by ScottOnstott at http://www.secretsinplainsight.com See Scott's Youtube page at: http://www.youtube.com/user/Secretsinplainsight
1
⧉infominer
05-Oct-18 05:33 AM
The controversy between pro-vaccine and anti-vaccine groups misses the point. Let's look at the actual stats on vaccination.
⧉infominer
08-Oct-18 01:07 AM
Can empirical data about human behavior make the “soft” sciences more like the “hard” ones? New interdisciplinary fields are voting yes.
⧉infominer
12-Oct-18 03:32 PM
List of awesome university courses for learning Computer Science! - prakhar1989/awesome-courses
⧉infominer
23-Oct-18 04:25 PM
HTTrack is a free (GPL, libre/free software) and easy-to-use offline browser utility. It allows you to download a World Wide Web site from the Internet to a local directory, building recursively all directories, getting HTML, images, and other files from the server to your co...
1
⧉infominer
03-Nov-18 11:32 AM
How muggles and sociopaths invade and undermine creative subcultures; and how to stop them.
⧉infominer
04-Nov-18 03:19 AM
1/ IMO everyone likes to throw around the term “first-principles thinking” but few actually practice it. It requires lots of hard work & dedication. https://t.co/kYFbwsxmju
Twitter
⧉infominer
04-Nov-18 03:54 AM
1/ Urbit is attempting a full-fledged operating system and peer-to-peer networking protocol to upgrade both modern computing and the web.
https://t.co/qyaijkDWBM
Twitter
⧉infominer
04-Nov-18 09:48 AM
You can’t prove truth, but using deductive and inductive reasoning, you can get close. Learn the difference between the two types of reasoning and how to use them when evaluating facts and arguments.
⧉infominer
04-Nov-18 01:33 PM
The fascinating origin and evolution of the startup studio model.
⧉infominer
04-Nov-18 01:48 PM
Q# lets you experiment with quantum computing today! @johnazariah talks on DotNetRocks at https://t.co/HUR9pMs6dJ about the potential of quantum computing and what you can explore today with the Quantum Development Kit!
Twitter
⧉infominer
05-Nov-18 04:37 AM
in science, there isn't really a "final take" on most issues. but, with regard to IQ versus SES in predicting educational and occupational outcomes, most large reviews of the evidence find IQ is the bigger predictor (see https://t.co/76bnnh21tj) https://t.co/PS4BvlzbBa
Likes
235
Twitter
⧉infominer
05-Nov-18 07:01 AM
⧉infominer
25-Nov-18 08:08 PM
Part of my work includes teaching social skills. Here are just 3 worksheets that I use to help others think about, learn, & understand the differences. Do 'em just for the fun of it. After all, it's Funday. Learning is fun, & school is cool!
#PoF #FriendshipFriday #F...
Twitter
⧉infominer
25-Nov-18 09:21 PM
Barbara Lipska spent 30 years studying mental disorders. It still didn't prepare her for her own madness.
⧉infominer
22-Dec-18 10:03 PM
In this episode of the Waking Up podcast, Sam Harris speaks with Johann Hari about his books Chasing the Scream and Lost Connections.
⧉infominer
13-Feb-19 08:53 PM
⧉infominer
30-Apr-19 11:30 PM
yarapavan
Hacker News
•
30-Apr-19 03:09 PM
⧉infominer
01-May-19 02:39 AM
Hacker News
•
30-Apr-19 02:04 AM
ON GITHUB
Share on
Twitter Facebook LinkedIn RedditSUPPORT THE CAUSE
Feel free to contact me, especially if you're interested in bitcoin related content or research!
| Bitcoin | DOGE |
|---|---|
| 1A1DZfw4VgpHCgnMjnmfDnMjddKf8xdYbd | DQKkzfJjqnXUD8Z7C3e84vKzvghPe9dXSa |


{% load static %}
An open platform for presentations and content collaboration. Sign up to get early access.
Poorly designed presentations are a thing of the past. Create beautiful and high-quality content that is aligned.
Poorly designed presentations are a thing of the past. Create beautiful and high-quality content that is aligned.
Poorly designed presentations are a thing of the past. Create beautiful and high-quality content that is aligned.
Poorly designed presentations are a thing of the past. Create beautiful and high-quality content that is aligned.
Stop wasting time and money designing and managing a web applications that doesn’t get results. Happiness guaranteed!
I am a proficient technologist with 21+ years of expertise in IT industry across architecting, developing web applications.


Edit Reservation
Name:
Email:
Phone:
Address:
Date:
Time:
Date:
Party Size:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
Cancel
Update


Pizza Hub
Get your pizza in an instant!
Continue
Karibuni
Pizza
Hub!
The best pizza you'll ever taste
Order your pizza and we will deliver it to your location.
Menu
regular 600ksh
medium 1000ksh
large 1200ksh
Place your order!

Enter your location
Enter your number
Enter
Here is your order summary
Okay


DataPark Lite
Get a personalized report from a raw accelerometer data file with a selection of relevant measures of activity.
With this tool you will be able to get a personalized report based
on the metrics we are using (or adapted with your own).


Main
The Triplesec Diary
Change Passphrase
Passphrase:
New Passphrase:
Confirm New Passphrase:
Change
Delete Diary
Delete Diary
Import Diary
Export Diary
Help


What-da-ya-have
Group project in which we utilized jQuery/Ajax and used 3 API's to create an application that would give restaurants in close proximity to Marta Stations as well as the train schedule and local weather.
What-da-ya-have
Group project in which we utilized jQuery/Ajax and used 3 API's to create an application that would give restaurants in close proximity to Marta Stations as well as the train schedule and local weather.
ReadMe Generator
This was an introduction to Node.js and server side programming. Used the inquirer package to get info from user, capture the response, and use the fs read/write file function to generate a README.md document.
Content Management System
Used Node.js modules mysql, inquirer, and figlet to build an employee management system with full CRUD.
Employee Template Engine
Node CLI that takes in information about employees and generates an HTML webpage that displays summaries for each person. Utilized internal Node.js packages fs, path, and jest for testing.
Eat-Da-Burger!
This assignment involved using express to create routes and utilizing the Handlebars HTML template engine. This site was deployed to Heroku.


{{loadingText}}
Pinboard - please login
API Token:
You can find API token on your
Pinboard Password page
.
Pinboard - (
{{userInfo.name}}
)
R
{{renderSavedTime(pageInfo.time)}}
[
log out
]
URL
Title
Notes
Text in <blockquote> will be displayed as cited text in Pinboard.
Tags
Suggest
{{suggest}}
Add all
private
read later
delete
cancel
/
destroy
{{item.text}}


Principles, style guides, templates and patterns
Design principles
10 principles for designing user centred public services
Style guides
Grids, typography, colours, forms, icons, tables, lists and more
Page templates
Headers, footers and templates for common page formats


A plugin class for implementing constraints. More...
#include <PxConstraint.h>
Public Member Functions | |
| virtual void | release ()=0 |
| Releases a PxConstraint instance. More... | |
| virtual PxScene * | getScene () const =0 |
| Retrieves the scene which this constraint belongs to. More... | |
| virtual void | getActors (PxRigidActor *&actor0, PxRigidActor *&actor1) const =0 |
| Retrieves the actors for this constraint. More... | |
| virtual void | setActors (PxRigidActor *actor0, PxRigidActor *actor1)=0 |
| Sets the actors for this constraint. More... | |
| virtual void | markDirty ()=0 |
| Notify the scene that the constraint shader data has been updated by the application. More... | |
| virtual void | setFlags (PxConstraintFlags flags)=0 |
| Set the flags for this constraint. More... | |
| virtual PxConstraintFlags | getFlags () const =0 |
| Retrieve the flags for this constraint. More... | |
| virtual void | setFlag (PxConstraintFlag::Enum flag, bool value)=0 |
| Set a flag for this constraint. More... | |
| virtual void | getForce (PxVec3 &linear, PxVec3 &angular) const =0 |
| Retrieve the constraint force most recently applied to maintain this constraint. More... | |
| virtual bool | isValid () const =0 |
| whether the constraint is valid. More... | |
| virtual void | setBreakForce (PxReal linear, PxReal angular)=0 |
| Set the break force and torque thresholds for this constraint. More... | |
| virtual void | getBreakForce (PxReal &linear, PxReal &angular) const =0 |
| Retrieve the constraint break force and torque thresholds. More... | |
| virtual void | setMinResponseThreshold (PxReal threshold)=0 |
| Set the minimum response threshold for a constraint row. More... | |
| virtual PxReal | getMinResponseThreshold () const =0 |
| Retrieve the constraint break force and torque thresholds. More... | |
| virtual void * | getExternalReference (PxU32 &typeID)=0 |
| Fetch external owner of the constraint. More... | |
| virtual void | setConstraintFunctions (PxConstraintConnector &connector, const PxConstraintShaderTable &shaders)=0 |
| Set the constraint functions for this constraint. More... | |
| virtual const char * | getConcreteTypeName () const |
| Returns string name of dynamic type. More... | |
| Public Member Functions inherited from PxBase | |
| template<class T > | |
| T * | is () |
| template<class T > | |
| const T * | is () const |
| PX_FORCE_INLINE PxType | getConcreteType () const |
| Returns concrete type of object. More... | |
| PX_FORCE_INLINE void | setBaseFlag (PxBaseFlag::Enum flag, bool value) |
| Set PxBaseFlag. More... | |
| PX_FORCE_INLINE void | setBaseFlags (PxBaseFlags inFlags) |
| Set PxBaseFlags. More... | |
| PX_FORCE_INLINE PxBaseFlags | getBaseFlags () const |
| Returns PxBaseFlags. More... | |
| virtual bool | isReleasable () const |
| Whether the object is subordinate. More... | |
Protected Member Functions | |
| PX_INLINE | PxConstraint (PxType concreteType, PxBaseFlags baseFlags) |
| PX_INLINE | PxConstraint (PxBaseFlags baseFlags) |
| virtual | ~PxConstraint () |
| virtual bool | isKindOf (const char *name) const |
| Returns whether a given type name matches with the type of this instance. More... | |
| Protected Member Functions inherited from PxBase | |
| PX_INLINE | PxBase (PxType concreteType, PxBaseFlags baseFlags) |
| Constructor setting concrete type and base flags. More... | |
| PX_INLINE | PxBase (PxBaseFlags baseFlags) |
| Deserialization constructor setting base flags. More... | |
| virtual | ~PxBase () |
| Destructor. More... | |
| template<class T > | |
| bool | typeMatch () const |
Additional Inherited Members | |
| Protected Attributes inherited from PxBase | |
| PxType | mConcreteType |
| PxBaseFlags | mBaseFlags |
A plugin class for implementing constraints.
|
inlineprotected |
|
inlineprotected |
|
inlineprotectedvirtual |
|
pure virtual |
Retrieves the actors for this constraint.
| [out] | actor0 | a reference to the pointer for the first actor |
| [out] | actor1 | a reference to the pointer for the second actor |
|
pure virtual |
Retrieve the constraint break force and torque thresholds.
| [out] | linear | the linear break threshold |
| [out] | angular | the angular break threshold |
|
inlinevirtual |
Returns string name of dynamic type.
Implements PxBase.
|
pure virtual |
Fetch external owner of the constraint.
Provides a reference to the external owner of a constraint and a unique owner type ID.
| [out] | typeID | Unique type identifier of the external object. |
|
pure virtual |
Retrieve the constraint force most recently applied to maintain this constraint.
| [out] | linear | the constraint force |
| [out] | angular | the constraint torque |
|
pure virtual |
Retrieve the constraint break force and torque thresholds.
|
pure virtual |
Retrieves the scene which this constraint belongs to.
|
inlineprotectedvirtual |
Returns whether a given type name matches with the type of this instance.
Reimplemented from PxBase.
References PxBase::isKindOf().
|
pure virtual |
whether the constraint is valid.
A constraint is valid if it has at least one dynamic rigid body or articulation link. A constraint that is not valid may not be inserted into a scene, and therefore a static actor to which an invalid constraint is attached may not be inserted into a scene.
Invalid constraints arise only when an actor to which the constraint is attached has been deleted.
|
pure virtual |
Notify the scene that the constraint shader data has been updated by the application.
|
pure virtual |
Releases a PxConstraint instance.
Implements PxBase.
|
pure virtual |
Sets the actors for this constraint.
| [in] | actor0 | a reference to the pointer for the first actor |
| [in] | actor1 | a reference to the pointer for the second actor |
|
pure virtual |
Set the break force and torque thresholds for this constraint.
If either the force or torque measured at the constraint exceed these thresholds the constraint will break.
| [in] | linear | the linear break threshold |
| [in] | angular | the angular break threshold |
|
pure virtual |
Set the constraint functions for this constraint.
| [in] | connector | the constraint connector object by which the SDK communicates with the constraint. |
| [in] | shaders | the shader table for the constraint |
|
pure virtual |
Set a flag for this constraint.
| [in] | flag | the constraint flag |
| [in] | value | the new value of the flag |
|
pure virtual |
Set the flags for this constraint.
| [in] | flags | the new constraint flags |
default: PxConstraintFlag::eDRIVE_LIMITS_ARE_FORCES
|
pure virtual |
Set the minimum response threshold for a constraint row.
When using mass modification for a joint or infinite inertia for a jointed body, very stiff solver constraints can be generated which can destabilize simulation. Setting this value to a small positive value (e.g. 1e-8) will cause constraint rows to be ignored if very large changes in impulses will generate only small changes in velocity. When setting this value, also set PxConstraintFlag::eDISABLE_PREPROCESSING. The solver accuracy for this joint may be reduced.
| [in] | threshold | the minimum response threshold |


Sammy's Favorite Things
Some of Sammy's favorite things included:
- Parks
- Going for walks
- Meeting people
- Playing (especially chewing appart his toys)
- Napping
- Food (any kind)
About
Sammy (Sampson) was my first dog. I purchased him from a breeder in Washougal, Washington. He was about 8 weeks old when I brought him home. He was very tiny at that age, but definitely a very spunky puppy.
Sammy displayed a lot of the traditional Cavalier personality traits. He was very affectionate and loved meeting new people, but also very very attached to me. He wanted to be with me 24/7 and had separation anxiety. This made it hard for him to sleep anywhere other than on my bed at night.
As Sammy got older, he loved going on walks, going to parks, and joining me on hikes or camping. One of his favorite places was a farm that also served as a park. This was a fun place for dogs to explore since they could meet the farm animals. Interestingly, Sammy actually didn't like other dogs and much preferred people. Luckily, people really loved him since he was so sweet.
Unfortunately, Sammy had health problems commonly associated with the breed and did not live as long as I would have liked. He passed away shortly after his 8th birthday. He most likely suffered from heart issues that were undiagnosed.
I would recommend a Cavalier King Charles Spaniel to someone looking for a new dog. They are definitely the sweetest breed I have come across. However, it's important to be aware of their health issues and separation anxiety.


:: com :: sun :: star :: mozilla ::
|
| struct MenuMultipleChange |
|
- Description
- Explains properties of a menu item
|
| Elements' Summary |
| ID |
unique ID of this menu item
|
| GroupID |
unique ID of the group this menu item belongs to
|
| PreItemID |
unique ID of the item directly above this menu item, used for fuzzy placement
|
| ItemText |
text of the menu item
|
| IsVisible |
true if visible
|
| IsActive |
true if active, so clickable
|
| IsCheckable |
true if checkable, so there can be a checkmark
|
| IsChecked |
true if there is a checkmark
|
| Image |
sequence of bytes representing a possible image
|
| Elements' Details |
ID
short ID;
- Description
- unique ID of this menu item
|
|
GroupID
short GroupID;
- Description
- unique ID of the group this menu item belongs to
|
|
PreItemID
short PreItemID;
- Description
- unique ID of the item directly above this menu item, used for fuzzy placement
|
|
ItemText
string ItemText;
- Description
- text of the menu item
|
|
IsVisible
boolean IsVisible;
- Description
- true if visible
|
|
IsActive
boolean IsActive;
- Description
- true if active, so clickable
|
|
IsCheckable
boolean IsCheckable;
- Description
- true if checkable, so there can be a checkmark
|
|
IsChecked
boolean IsChecked;
- Description
- true if there is a checkmark
|
|
Image
sequence< byte > Image;
- Description
- sequence of bytes representing a possible image
|
|
Top of Page
Copyright © 2013, The Apache Software Foundation, Licensed under the Apache License, Version 2.0. Apache, the Apache feather logo, Apache OpenOffice and OpenOffice.org are trademarks of The Apache Software Foundation. Other names may be trademarks of their respective owners.


3 days ago
Jack added a note
I am a dog and I do not know how to make a post
{% extends "webfolder/_base.html" %} {% block title %} Friends' Shares {{ block.super }} {% endblock %} {% block content %}


Components In Quarantine Report
Repository
Format
PackageUrl
Quarantine Time
Policy Name
Threat Level


SARS respiratory patients virus infection dental new acute control disease {border-style However, clinical health severe Hong care px;} #ffffff;} contact coronavirus case syndrome spread transmission SARS-CoV Control patient SARS, cases criteria human infectious test used Accessed Available Centers Disease Med at: hand laboratory outbreak SARS. days disease. illness onset viral (for July community disease, example, include number period phase suspected workers Kong, animal coronaviruses data diagnosis does possible px; serum {font-family Engl Health Kong Samaranayake World airborne cause close current diagnostic font-size masks protection recent research routine (SARS) Dent Hand Organization Prevention agents associated cell common confirmed documented double; early epidemiologic face including incubation infected infectivity major medical patients, review samples use CDC Close Dental Elsevier Furthermore, Guangdong Infection Lancet Peiris Severe antibodies available barrier border-color border-width considered dam dentistry detect febrile following genetic hygiene low measures normal nosocomial percent person probable protective provide questions rate relatively reported result solid; symptoms treat treatment vaccine vaccines viruses worldwide {font-style {font-weight American COVID- CRITERIA China Dentists MMWR Oral RNA Rep acquired appear appears based bold bronchitis caused cells centre contaminated courier; culture direct domestic droplet drugs em; etiology exposure findings flora form global good group having high infection. infections isolation killed know large majority mouthrinse novel precautions preprocedural procedures procedures. prodrome province pt;} rapid rapidly related required resource rubber secondary shown skin southern strain surgical surveillance symptoms. thought ultrasonic vast


The Indiana House of Representatives is the lower house of the Indiana General Assembly, the state legislature of the United States state of Indiana. The House is composed of 100 members representing an equal number of constituent districts. House members serve two-year terms without term limits
Loading


The !PrintTool Application
What this Application does.
Because some inks are heavier than others and some paper is more absorbant we need a form of balancing. These adjustments take the form of a correction to the values of ink placement and is done through a palette. This application allows you to edit such a palette adjusting it to suit your paper and ink types.
Because of the numbering of palettes for different types of printers, no attempt is made by the application to create new palettes. As such it requires you to manage your use of palettes. As a general rule one PDF ( Printer Definition File ) will use only one palette. However this is not always the case and for some printers with dramatically different methods of printing this will change for these differing methods. In theory each of the options that can be selected, through the printer control dialogue, may utilise a different palette. These are the different selections for types of paper or print quality. More often however these selections will use the same palette within a PDF.
Palettes are not used in text printing only graphics.


Lagos reviews policy to surmount traffic gridlocks
by The Eagle OnlineThe Lagos State government says it has directed relevant agencies to review traffic control and regulation policies, toward identifying long-lasting solution to perennial traffic gridlocks in the state.
The state Commissioner for Information and Strategy, Gbenga Omotoso, said in a statement on Wednesday that government would surmount the challenges with technology and enforcement of traffic rules.
Omotoso said that government was aware of the discomfort commuters and motorists had been experiencing since the beginning of the massive road repairs under ‘Operation 116’ across the state.
The commissioner, who said that there was no deliberate action to cause Lagosians any pain, added that the present situation was temporary.
According to him, the contractors are speeding up their jobs and they are being encouraged to work at night, where possible.
He advised motorists to use alternative routes so as to ease the time and stress of staying in traffic.
“The administration sympathises with residents on the inconvenience being suffered daily.
“In fulfilment of its commitment to making the roads motorable immediately the rains subside, resources and equipment have been deployed to fix degenerated roads. The discomfort will be short-lived.
“The daily influx of people from other parts of the country into Lagos has contributed to the big human and vehicular pressure on the roads.
“Government will surely surmount the challenges with technology and enforcement of traffic rules.
“Government appreciates the perseverance of Lagosians and pledges its commitment to pooling all its resources together to achieve a permanent solution to the problem posed by the rehabilitation of bad roads.
“The administration will ensure that majority of the roads become smooth and motorable before the Yuletide,” he said.
Previous Post
P&ID: FG adopts strategies to get Contract Quashed – Malami
Next Post
NPFL: Rivers United gun down Flying Antelopes


For Chinese people, the rabbit is a tame creature representing hope for a long time. It is tender and lovely. The moon goddess Chang'e in Chinese legend had a rabbit as her pet, which stimulated the thought that only this creature was amiable enough to match her noble beauty. People with Rabbit as Chinese zodiac sign are not aggressive but approachable. They have a decent, noble and elegant manner.


Buiding things is fun
Hello from Green Fox
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Praesent mattis nunc at augue commodo, quis tincidunt
nulla ornare. Vestibulum sed eros justo.
Let's see a list
- This is
- a very nice
- list
- on the first level
-
but it
-
can go
-
deeper
-
and notice I have roman numbering
- back to normal


Treebank Statistics: UD_Beja-NSC: POS Tags: DET
There are 1 DET
lemmas (6%), 19 DET
types (6%) and 123 DET
tokens (14%).
Out of 16 observed tags, the rank of DET
is: 6 in number of lemmas, 4 in number of types and 4 in number of tokens.
The 10 most frequent DET
lemmas: _
The 10 most frequent DET
types: =b, =t, i=, oː=, uː=, toː=, w=, ti=, uːn, t=
The 10 most frequent ambiguous lemmas: _ (VERB 171, PUNCT 169, NOUN 132, DET 123, PRON 79, SCONJ 51, AUX 28, ADP 25, CCONJ 25, PART 19, ADV 16, ADJ 7, INTJ 6, X 3, PROPN 2, NUM 1)
The 10 most frequent ambiguous types: =t (DET 19, CCONJ 12, SCONJ 2), ti= (DET 5, SCONJ 1), oːn (DET 3, PRON 1), eːn (DET 2, VERB 2), beːn (ADV 2, DET 1, PRON 1)
- =t
- ti=
- oːn
- eːn
- beːn
Morphology
The form / lemma ratio of DET
is 19.000000 (the average of all parts of speech is 19.625000).
The 1st highest number of forms (19) was observed with the lemma “_”: =b, =t, aː=, aːn, beːn, eː=, eːn, i=, j=, kass, oː=, oːn, t=, ti=, toː=, toːt, uː=, uːn, w=.
DET
occurs with 6 features: Gender (122; 99% instances), Definite (108; 88% instances), Case (70; 57% instances), Number (54; 44% instances), Deixis (14; 11% instances), PronType (14; 11% instances)
DET
occurs with 11 feature-value pairs: Case=Acc
, Case=Nom
, Definite=Def
, Definite=Ind
, Deixis=Prox
, Deixis=Remt
, Gender=Fem
, Gender=Masc
, Number=Plur
, Number=Sing
, PronType=Dem
DET
occurs with 18 feature combinations.
The most frequent feature combination is Case=Acc|Definite=Ind|Gender=Masc
(23 tokens).
Examples: =b
Relations
DET
nodes are attached to their parents using 3 different relations: det (117; 95% instances), fixed (5; 4% instances), reparandum (1; 1% instances)
Parents of DET
nodes belong to 8 different parts of speech: NOUN (87; 71% instances), VERB (18; 15% instances), PRON (6; 5% instances), SCONJ (5; 4% instances), ADJ (4; 3% instances), ADV (1; 1% instances), PROPN (1; 1% instances), X (1; 1% instances)
123 (100%) DET
nodes are leaves.
The highest child degree of a DET
node is 0.