---
start: 2017-03-30 17:45
edition: 41
participate: "https://www.meetup.com/Chennai-Geek-Night/events/238139058/"
talk: "https://docs.google.com/forms/d/1llJxKCuEnPXOPHnXUQHnc8Unlt_Y4kPvWJqndjl_6Gg/viewform"
subnote: "Geek Night is celebrating International Women's Day. We are proud to present an all-women speaker edition. We'd love for you to join us in recognizing all women technologists by doing what we do best. Let's #TalkTechToHer !
This event will be live streamed on YouTube."
agenda:
-
time: "6:00"
title: "Automating Deployment of R models in production environment"
video_link: "https://www.youtube.com/watch?v=7UEifVN1fTU"
subtitle: "Data Science helps companies build models about sales, demand, finance, customer information and what not. R is widely used among data scientists for analysis and model building. But most R users have used it only for research and prototyping, not in actual production analytics code.
- How to deploy R models in a production environment? Pros and cons of these methods.
- Comparing R with other options for data science work. "
speakers:
-
name: "Sophia George"
-
time: "6:45"
title: "Break"
-
time: "7:00"
title: "Building a data lake : An App Dev's perspective"
video_link: "https://www.youtube.com/watch?v=4PIVJW_dHXM"
subtitle: "From tools and technology to people and requirements, what's different in the data engineering space? App development is traditional now. All enterprises want to become data-guided. Data lake is good start yet the know-hows and do-hows are so many. There's much anew to be learnt and also unlearnt. Everyone has their version of a big data stack, keeps continuously re-inventing.
Sharing experiences from building a data lake in the retail domain, I will be talking about
- what is this vast new space of data engineering,
- why it is critical to think in terms of data rather than features and
- how important it is to understand these technologies and create a data lake that is usable and insightful to business
"
speakers:
-
name: "Geetha Balasundaram"
profile: "https://www.linkedin.com/in/geetha-balasundaram-98966919"
-
time: "7:45"
title: "Optimizing your Spark Job"
video_link: "https://www.youtube.com/watch?v=eW82yoGoKFY"
subtitle: "This talk gives a brief overview of the Spark Architecture along with the common issues that are encountered while running spark jobs and how to go about avoiding them. It will also cover the best practices one should adopt to maximize performance and ensure efficient memory utilization. "
speakers:
-
name: "Matild Reema"
-
time: "8:30"
title: "Networking & Dinner"
---


Plugin Information |
|---|
View Notification on the plugin site for more information. |
This plugin from Tikal Knowledge allows sending Job Status notifications in JSON and XML formats.
Job Notifications are defined in job's configuration, in their own separate section "Job Notifications":
Several notification endpoints can be defined. Each endpoint can be configured with:
- "Format" : notification payload format, JSON or XML.
- "Protocol": protocol to use for sending notification messages, HTTP, TCP or UDP.
- "Event": job events that trigger notifications: Job Started, Job Completed, Job Finalized or All Events (the default option). The difference between job being "completed" and "finalized" is as follows: when job is finalized all post-build activities, such as archiving artifacts, were executed as well. This is not the case with job being merely "completed" which usually involves only creation of job's artifacts without post-processing them. If you're unsure of which event to use, you can start with "Job Finalized".
- "URL": URL to send notifications to. It takes the form of "
http://host
" for HTTP protocol, and "host:port
" for TCP and UDP protocols. - "Timeout": Timeout in milliseconds for sending notification request, 30 seconds by default.
Example of notification message (you can use requestb.in and jsonlint.com services to aggregate HTTP requests and validate JSON payload):
{ "name": "asgard", "url": "job/asgard/", "build": { "full_url": "http://localhost:8080/job/asgard/18/", "number": 18, "phase": "COMPLETED", "status": "SUCCESS", "url": "job/asgard/18/", "scm": { "url": "https://github.com/evgeny-goldin/asgard.git", "branch": "origin/master", "commit": "c6d86dc654b12425e706bcf951adfe5a8627a517" }, "artifacts": { "asgard.war": { "archive": "http://localhost:8080/job/asgard/18/artifact/asgard.war" }, "asgard-standalone.jar": { "archive": "http://localhost:8080/job/asgard/18/artifact/asgard-standalone.jar", "s3": "https://s3-eu-west-1.amazonaws.com/evgenyg-bakery/asgard/asgard-standalone.jar" } } } }
The payload submitted includes the following information:
- Job's name and URL.
- Build's number, full URL, phase, and status.
- SCM URL, branch and commit (only for Git repositories).
- Artifacts generated. They need to be archived by "Archive the artifacts" or published to S3 by "Publish artifacts to S3 Bucket" post-build actions. In addition, Jenkins needs to have its URL configured in "Manage Jenkins" => "Configure System" => "Jenkins Location" => "Jenkins URL".
AWS S3 Support
If Jenkins S3 Plugin is installed and artifacts are uploaded to AWS S3 by "Publish artifacts to S3 Bucket" post-build action - the plugin will send their downloadable locations as well.
Note that you need to edit S3 bucket's policy (see example) to make its artifacts directly "downloadable" by anonymous users. Here's one possible policy:
{ "Version": "2008-10-17", "Statement": [ { "Effect": "Allow", "Principal": { "AWS": "*" }, "Action": "s3:GetObject", "Resource": "arn:aws:s3:::notification-plugin/*" } ] }
Attachments:
hudson-notif-plugin.png (image/png)
new-endpoint.png (image/png)
s3-publish.png (image/png)
new-endpoints.png (image/png)
s3-publish.png (image/png)
s3-publish.png (image/png)


It seems that recently thanks to the buzz around Deep Learning, Neural Networks are getting back the attention that they once had. This post contains just a very short introduction to Neural Networks, just enough to understand the F# code which follows. The aim for me is to learn F# and see how easy it can be to write Machine Learning code in F#.
I present here two examples of NN in F#:
Both working examples are available at my GitHub
Artificial neural networks are computational models with particular properties such as the ability to adapt or learn, to generalise or to cluster and organise data. These models are inspired by the way that the human brain works. The building blocks of Neural Networks are inspired by Neurons - the building blocks of our brain. Neural Network can be seen as interconnected graph of nodes, where each node takes a role of a neuron. Each neuron can receive multiple signals, modify it and send it to other neurons to which it is connected. In this graph some vertexes are used to set the input, some of them are used to perform the computation and other onces will hold the output values.
Nodes are connected by edges which have different weights. The weight of the edge specifies how the signals is modified when passing from one node to another.
Perceptron is a basic block of linear neural networks. It is composed of multiple input nodes and a decision node. Perceptron is a single layer network. Input values are linked directly to the output node, connected by edges with certain weights.
The ouput node takes the incomming values, sums them and based on the result returns an output. The output could be binary or continous value. For instance a threashold can be used to say whether the output is 1 or 0.
In practice, very often the Sigmoid or also called logistic function is used to output value within the interval [0,1].
Single layer perceptrons can only learn linerearly separable data.
Imagine we want to separate a set of datapoints into multiple clusters. We visualize the data in 2-dimensional euclidian space. If we can separate the cluster by drawing direct line between the data points, the data is linearly seperable. The same can be applied on multi-dimensional data
In a world of logical functions (we are building XOR classifier), this limitation means that a single layer perceptron is able to learn AND or OR function but it won't be able to learn XOR function.
One can easily imagine a line that separates all OR positive results from the negatives once. On the other hand there is no streight line that separates the positive XOR results ([0,1] and [1,0]) from the negatives ([0,0] and [1,1])
Feed forward network can be thought as composition of perceptrons. Such network has one input layer, multiple hidden layers and one output layer. The feed forward network does not contain cycles, unlike the Hopfield network in the next examples (which is recurrent neural network).
Unlike single layer perceptron, multilayer feed forward network is capable of learning linerably non-separable data such as the results of XOR function.
This is the first example. This network is called clasifier because it learns the XOR function. It can then "classify" the 2 values in the input into single value on the output.
Here is how the network looks like:
The NN diagram was drawn in latex, using the tkz-berge package. Look here if you want to know how.
The network starts with random weights and continously updates the weights so that the result in the output node corresponds to the XOR of input values. In order to update the weights Backpropagation (Backwards propagation of errors) technique is used.
The value of the output is compared to the real value (which is known). The error is determined as the differences between the output and the real value. Then the weights of the edges has to be updated to minimalize the error as shown later.
Each layer can be represented as one dimensional array, the weights are stored using 2-dimensional array ([0,1] is the weight between nodes 0 and 1). Here is the function which calculates the sum of values incomming to a single node and passes the value to the activation function. The activation function here can be any function, as it is passed as parameter but here Sigmoid is used.
let pass (input:float[]) (weights:float[,]) activation = let length = weights |> Array2D.length2 seq { for i in 0 .. length-1 do let sum = (Array.zip weights.[*,i] input) |> Array.sumBy (fun (v,w) -> v * w) yield activation sum } |> Array.ofSeq
By applying the pass multiple times, the whole network can be composed as sequence of pass functions.
The following function is the main loop of the XOR network and we iterate over until we obtain good results and the network is adapted.
let train network rate input target = let n1 = completepass input network let delta = deltaOutput n1.output target let deltaHidden = passDelta n1.hidden delta n1.hiddenToOutput let updatedHiddenToOut = updateWeights n1.hidden delta n1.hiddenToOutput rate let updatedInToHidden = updateWeights n1.input deltaHidden n1.inputToHidden rate
Completepass just calls 2 times the pass function value and gets the input values trough the hidden layer to the output. The output is then compared to desired result and error is estimated. From this error an array of "delta" values per each output node is determined which is then used to update the weights.
In the case of XOR network, there is only one output, so the delta will one dimensional array.
The delta has to be propagated lower so that we can also update the weights between the input and hidden layer.
First the error of each layer has to be calculated. In the example bellow the error of the output layer is the value (t-o) or (Target - Ouput). This value is multiplied by value o*(1-o) which is the derivation of the Sigmoid function. The resulting array contains for each node a delta value, which shall be used to adjust the weights.
let deltaOutput (output:array) (target:array ) = (Array.zip output target) |> Array.map (fun (o,t) -> o * (1.0 - o) * (t - o))
Calculating the delta value for the output layer is not sufficient to correct all the weights in the network, the delta has to be propagated to the lower layers of the network, so that we can update the weights on the input - hidden connections.
let passDelta (outputs:float[]) (delta:float[]) (weights:float[,]) = let length = weights |> Array2D.length1 seq { for i in 0 .. length-1 do let error = (Array.zip weights.[i,*] delta) |> Array.sumBy (fun (v,w) -> v * w) yield outputs.[i] * (1.0 - outputs.[i]) * error } |> Array.ofSeq
The "error" of the hidden layer is just the delta multiplied by the weight associated to the edge that propagates this delta to the lower value.
The last missing piece is the function that woudl update weights between 2 layers.
let updateWeights (layer:float[]) (delta:float[]) (weights:float[,]) learningRate = weights |> Array2D.mapi (fun i j w -> w + learningRate * delta.[j] * layer.[i])
Learning rate is a constant that determines how quickly the edges are updated. If the learning rate is too big, the network might miss the optimal weights. However if it is too small it will take longer time to get to the correct solution.
At the beginning the weight are set to random values between 0 and 1, or slided slightly. From the quick tests that I did it seems that for instance using learning rate of 0.3 it took 20000 iterations to get to a neural network that would XOR the values on it's inputs.
TSP is one of the well known Combinatorial optimization problems and as such, it has been solved in many different ways (Integer Linear Programming, Genetic or Biologically inspired algorithms and other heuristics). Neural Networks are one of the many approaches to provide a solution to this problem.
Even within Neural Networks several different approaches have been developed to solve TSP (eg. elastic nets,self-organizing map). The approach demonstrated here is the oldest one: Hopfield neural network.
Hopfield NN is a recurrent neural network (connections in the network form cycles). The units (nodes) in a Hopfield network can have only 2 values: 0|1 or -1|1 depending on literature, but in either case values that encode a binary state). The network is fully connected (each node is connected with any other node). The connection matrix is symetric, that is the weights on the edges are the same in both directions.
The initial Hopfied network had only binary values (0/1) but to solve TSP and for other problems continous version of the network is used, where every node has value in range [0,1].
The value of each node depends on the input potential of the node (Ui) and in order to keep it between (0,1) the tanh function is used:
The value of the input potential of each node depends on the values of all nodes that are connected to it and the values of the connections weights.
Each state of the HNN can be described by a single value called Energy. While iterating and changing the state, the energy of HNN will either stay the same or will get smaller. The energy of the network will evenutelly convert to a local minimum - the state of the HNN that we target to solve the TSP
The first and original approach to solve TSP was described in 1985 by Tank and Hopfield in their paper "Neural Computation of Decisions in Optimization Problems". Since then many more attempts were made. I have found these few papers or surweys available online quite useful and have used them to deduce my implementation:
If I should pick one, I would say that the first one gave me most information about the problem, event though not enough implementation details. The others once then made it (almost) clear how to implement the solution.
The neural network used to encode the TSP and it's solution is square matrix of nodes having N rows (one for each city) and N columns (one for each position in the tour), where N is the number of cities. When the algorithm finishes and the network converges to it's final state, each node will have value of either 0 or 1. As said the network in fully inter-connected so there is an edges between each node, which is not shown in the image bellow.
If the node in i-th row and j-th column has value 1, the city (i) will be in the tour on position (j).
As described aboved the network evolves and each node changes it's value over time. The secret of the algorithm is thus to provide such update rule that at the end:
To come up with such update rule the Energy function has to be determine which will attain it's minimum for optimal solution of TSP - and so it will be based on the above specified rules. The following definition will satisfy the rules:
A,B,C and D are constants and the 4 sumations here correspond to the 4 above mentioned points.
There are two ways to describe the behaviour and the dynamic of the network:
Alternatively the input potential of a node (i) can be described by:
That is a partial a definition of the defined Energy function with respect to the value of the node (i).
The change of then potential is it's partial derivation with respect to the time. When doing a computer simulation we will described the value of Ui in time T+1, or here T+ delta t. Where delta T is some small time interval.
This equation is at the hearth of this algorithm.
The network can be stored in 2-dimensional matrix. One can choose between storing the input potential of each node or the value of the each node, because the value of the node can be calculated from the potential at any time. I have chosen the second option and I store the input potential two dimensional array u.
The following code is the calculation of the input potential change of single node at coordinates (city,position). This is just retranscription of the equation above.
let singlePass (distances:float[,]) (u:float[,]) pms city position = let n = Array2D.length2 u let values = u |> toValues pms let aSum = sumAllBut position (values |> rowi city) let bSum = sumAllBut city (values |> coli position) let cSum = (values |> Seq.cast|> Seq.sum) - float(n+1) let dSum = dSumCalc distances city position values let dudt = -pms.A*aSum - pms.B*bSum - pms.C*cSum - pms.D*dSum //value of input potential in t+ delta_t let r = u.[city,position] + pms.dTime*(-u.[city,position] + dudt) //Alternatively according to the paper by Jacek Mandziuk one can just use the update value //let r = dudt r
There are few things to note. This code takes the distances matrix, the current state of the network (the value of input potential of each node), parameters of the network (constants A,B,C,D from equations above) and row (city) and the column (position) of the node that we are updating. The toValues method takes the current value of each node potential and returns a matrix of node values. The rowi and coli method return respecively one row or one column from 2 dimensional array. The sumAllBut method adds all elements of one-dimensional array except an element at position which is passed to the method. The dSumCalc method is the only one with a bit more compexity and it calculates the D value of the equation above (the one that assures the minimalization of the TSP circuit)
let rowi row (network:float[,]) = network.[row,*] |> Array.mapi (fun j e -> (e,j)) let coli col (network:float[,]) = network.[*,col] |> Array.mapi (fun j e -> (e,j)) let sumAllBut (i:int) (values:(float*int)[]) = Array.fold (fun acc (e,j) -> if i<>j then acc + e else acc) 0.0 values let dSumCalc distances city position (v:float[,]) = let n = v |> Array2D.length1 (distances |> rowi city) |> Array.sumBy (fun (e,i) -> let index1 = (n+position+1) % n let index2 = (n+position-1) % n e*(v.[i,index1] + v.[i,index2]) ) let toValues (pms:HopfieldTspParams) u = u|> Array2D.map (fun (ui) -> v ui pms) //calculates the value of node from input potential let v (ui:float) (parameters:HopfieldTspParams) = (1.0 + tanh(ui*parameters.alfa))/2.0
The method which updates the input potential of single node can be called in 2 different ways. Either we pick the nodes randomly multiple times or we loop over all the nodes serially. If the update is serial then the only random element of the algorithm is the initialization of the netwok.
let serialIteration u pms distances = u |> Array2D.mapi (fun i j x -> singlePass distances u pms i j) let randomIteration u pms distances = let r = new Random(DateTime.Now.Millisecond) let n = Array2D.length1 u for i in 0 .. 1000*n do let city = r.Next(n) let position = r.Next(n) u.[city, position] <- singlePass distances u pms city position u
The random iteration here is repeated 1000*n times where n is the number of cities, which is probably more than enough since the network seems to converge much sooner. Just for the sake of completeness, here is the method that runs 10 times either serial or random iteration.
let initAndRunUntilStable cities pms distances = let u = initialize cities pms {1 .. 10} |> Seq.fold (fun uNext i -> match pms.Update with | Random -> randomIteration uNext pms distances | Serial -> serialIteration uNext pms distances ) u
And here high level method, that generates a random example of TSP problem, calculates distances between all cities and runs the algorithm until a stable and correct solution is found. That is until the network returns feasable solution.
let sampleRun (pms:HopfieldTspParams ) (n:int) = let cities = generateRandomCities n let distances = calculateDistances cities let networks = Seq.initInfinite (fun i -> initAndRunUntilStable cities pms distances) let paths = networks |> Seq.map (fun v-> currentPath v) let validPath = paths |> Seq.find (fun path -> isFeasable path) cities, validPath
The results are not overwhelming, on the other hand I have only implemented the most simple version of the algorithm. In the original paper the authors stated that the convergence rate to feasable solutions was about 50%. But depending on the parameters one can get better results. See bellow one of the runs of the algorithm on 6 random nodes.
Here is the complete list of parameters for Hopfield network and the values that I ended up using:
I have also used the standard update rule to obtain new value of the input potential which takes into account the current input potential.
let dudt = -pms.A*aSum - pms.B*bSum - pms.C*cSum - pms.D*dSum //value of input potential in t+ delta_t u.[city,position] = u.[city,position] + pms.dTime*(-u.[city,position] + dudt)
According to the paper by Jacek Mandziuk one can just use the updated values as the new input potential, so that the update rule would become only:
let dudt = -pms.A*aSum - pms.B*bSum - pms.C*cSum - pms.D*dSum u.[city,position] = dudt;
This rule didn't work for me. The convergance rate wasn't better neither were the tours lengths. Of course for such version, different values for network parameters have to be used.
Note that GitHub repostity and specifialy the Hopfield module contais more code:


Flatland
by Edwin A. Abbott
Part 1, Section 10: Of the Suppression of the Chromatic Sedition
Additional Information
- Year Published: 1885
- Language: English
- Country of Origin: England
- Source: Abbott, E. A. (1885). Flatland.Boston, MA: Roberts Brothers.
-
Readability:
- Flesch–Kincaid Level: 12.0
- Word Count: 1,480
- Genre: Fantasy
- Keywords: geometry
- ✎ Cite This
Downloads
The agitation for the Universal Colour Bill continued for three years; and up to the last moment of that period it seemed as though Anarchy were destined to triumph.
A whole army of Polygons, who turned out to fight as private soldiers, was utterly annihilated by a superior force of Isosceles Triangles — the Squares and Pentagons meanwhile remaining neutral. Worse than all, some of the ablest Circles fell a prey to conjugal fury. Infuriated by political animosity, the wives in many a noble household wearied their lords with prayers to give up their opposition to the Colour Billl; and some, finding their entreaties fruitless, fell on and slaughtered their innocent children and husband, perishing themselves in the act of carnage. It is recorded that during that triennial agitation no less than twenty-three Circles perished in domestic discord.
Great indeed was the peril. It seemed as though the Priests had no choice between submission and extermination; when suddenly the course of events was completely changed by one of those picturesque incidents which Statesmen ought never to neglect, often to anticipate, and sometimes perhaps to originate, because of the absurdly disproportionate power with which they appearl to the sympathies of the populace.
It happened that an Isosceles of a low type, with a brain little if at all above four degrees — accidentally dabbling in the colours of some Tradesman whose shop he had plundered — painted himself, or caused himself to be painted (for the story varies) with the twelve colours of a Dodecagon. Going into the Market Place he accosted in a feigned voice a maiden, the orphan daughter of a noble Polygon, whose affection in former days he had sought in vain; and by a series of deceptions — aided, on the one side, by a string of lucky accidents too long to relate, and, on the other, by an almost inconceivable fatuity and neglect of ordinary precautions on the part of the relations of the bride — he succeeded in consummating the marriage. The unhappy girl committed suicide on discovering the fraud to which she had been subjected.
When the news of this catastrophe spread from State to State the minds of the Women were violently agitated. Sympathy with the miserable victim and anticipations of similar deceptions for themselves, their sisters, and their daughters, made them now regard the Colour Bill in an entirely new aspect. Not a few openly avowed themselves converted to antagonism; the rest needed only a slight stimulus to make a similar avowal. Seizing this favourable opportunity, the Circles hastily convened an extraordinary Assembly of the States; and besides the usual guard of Convicts, they secured the attendance of a large number of reactionary Women.
Amidst an unprecedented concourse, the Chief Circle of those days — by name Pantocyclus — arose to find himself hissed and hooted by a hundred and twenty thousand Isosceles. But he secured silence by declaring that henceforth the Circles would enter on a policy of Concession; yielding to the wishes of the majority, they would accept the Colour Bill. The uproar being at once converted to applause, he invited Chromatistes, the leader of the Sedition, into the centre of the hall, to receive in the name of his followers the submission of the Hierarchy. Then followed a speech, a masterpiece of rhetoric, which occupied nearly a day in the delivery, and to which no summary can do justice.
With a grave appearance of impartiality he declared that as they were now finally committing themselves to Reform or Innovation, it was desirable that they should take one last view of the perimeter of the whole subject, its defects as well as its advantages. Gradually introduction the mention of the dangers to the Tradesmen, the Professional Classes and the Gentlemen, he silenced the rising murmurs of the Isosceles by reminding them that, in spite of all these defects, he was willing to accept the Bill if it was approved by the majority. But it was manifest that all, except the Isosceles, were moved by his words and were either neutral or averse to the Bill.
Turning now to the Workmen he asserted that their interests must not be neglected, and that, if they intended to accept the Colour Bill, they ought at least to do so with full view of the consequences. Many of them, he said, were on the point of being admitted to the class of the Regular Triangles; others anticipated for their children a distinction they could not hope for themselves. That honourable ambition would not have to be sacrificed. With the universal adoption of Colour, all distinctions would cease; Regularity would be confused with Irregularity; development would give place to retrogression; the Workman would in a few generations be degraded to the level of the Militar, or even the Convict Class; political power would be in the hands of the greatest number, that is to say the Criminal Classes, who were already more numerous than the Workmen, and would soon out-number all the other Classes put together when the usual Compensative Laws of Nature were violated.
A subdued murmur of assent ran through the ranks of the Artisans, and Chromatistes, in alarm, attempted to step forward and address them. But he found himself encompassed with guards and forced to remain silent while the Chief Circle in a few impassioned words made a final appeal to the Women, exclaiming that, if the Colour Bill passed, no marriage would henceforth be safe, no woman's honour secure; fraud, deception, hypocrisy would pervade every household; domestic bliss would share the fate of the Constitution and pass to speedy perdition. "Sooner than this," he cried, "Come death."
At these words, which were the preconcerted signal for action, the Isosceles Convicts fell on and transfixed the wretched Chromatistes; the Regular Classes, opening their ranks, made way for a band of Women who, under direction of the Circles, moved back foremost, inivisibly and unerringly upon the unconscious soldiers; the Artisans, imitating the example of their betters, also opened their ranks. Meantime bands of Convicts occupied every entrance with an impenetrable phalanx.
The battle, or rather carnage, was of short duration. Under the skillful generalship of the Circles almost every Woman's charge was fatal and very many extracted their sting uninjured, ready for a second slaughter. But no second blow was needed; the rabble of the Isosceles did the rest of the business for themselves. Surprised, leader-less, attacked in front by invisible foes, and finding egress cut off by the Convicts behind them, they at once — after their manner — lost all presence of mind, and raised the cry of "treachery." This sealed their fate. Every Isosceles now saw and felt a foe in every other. In half an hour not one of that vast multitude was living; and the fragments of seven score thousand of the Criminal Class slain by one another's angles attested the triumph of Order.
The Circles delayed not to push their victory to the uttermost. The Working Men they spared but decimated. The Militia of the Equilaterals was at once called out, and every Triangle suspected of Irregularity on reasonable grounds, was destroyed by Court Martial, without the formality of exact measurement by the Social Board. The homes of the Military and Artisan classes were inspected in a course of visitation extending through upwards of a year; and during that period every town, village, and hamlet was systematically purged of that excess of the lower orders which had been brought about by the neglect to pay the tribute of Criminals to the Schools and University, and by the violation of other natural Laws of the Constitution of Flatland. Thus the balance of classes was again restored.
Needless to say that henceforth the use of Colour was abolished, and its possession prohibited. Even the utterance of any word denoting Colour, except by the Circles or by qualified scientific teachers, was punished by a severe penalty. Only at our University in some of the very highest and most esoteric classes — which I myself have never been privileged to attend — it is understood that the sparing use of Colour is still sanctioned for the purpose of illustrating some of the deeper problems of mathematics. But of this I can only speak from hearsay.
Elsewhere in Flatland, Colour is no non-existent. The art of making it is known to only one living person, the Chief Circle for the time being; and by him it is handed down on his death-bed to none but his Successor. One manufactory alone produces it; and, lest the secret should be betrayed, the Workmen are annually consumed, and fresh ones introduced. So great is the terror with which even now our Aristocracy looks back to the far-distant days of the agitation for the Universal Colour Bill.


Post by: Rob Spoor, Sheriff
on Aug 30, 2012 07:28:57
The method is setWarehouseID(int) but superCSV is trying to call setWarehouse ID(String) - with space and using int instead of String.
Post by: Nimu Chox, Greenhorn
on Aug 30, 2012 07:36:37
Thanks for your reply.
Why is SuperCSV bahaving that way?: I want is to see it setWarehouseID(int) . Please bear with me, I using this API today for the first time. I have tried to read it using New ParseInt();
Also I am wondering how can I read the files with headers consisting spaces i.e. "#Datawarehouse ID", "PCI bus" using the CSV reader; I dont want to change the header names in my CSV files.
Please advice
Post by: Rob Spoor, Sheriff
on Aug 30, 2012 09:19:03
The second argument to the read method indicates the property names. This is the setter method without the set part, like WarehouseID. You pass the contents of the CSV file's first row, which includes Warehouse ID. You need to supply the actual property names instead, like WarehouseID, NumOfPciBus, etc.
The third argument indicates the CellProcessor instances to use for converting the Strings to something else. In your original code you had all null values, which meant no conversion. The ParseInt you mentioned will convert the Strings to ints instead.
Post by: Nimu Chox, Greenhorn
on Aug 30, 2012 09:30:53
I changes the headers to match the variable names... but now I get this exception:
[Rob]split long line of code[/]
Post by: Rob Spoor, Sheriff
on Aug 30, 2012 10:55:38
You provide 8 CellProcessors. Does your CSV file also have 8 columns?
Post by: Nimu Chox, Greenhorn
on Aug 30, 2012 11:02:41
Yes, My Csv file has 8comlumn
Post by: Rob Spoor, Sheriff
on Aug 30, 2012 13:02:52
I see the problem. The CsvPreference you use does not use commas as column separators but semicolons. As a result, SuperCSV sees your 8 columns as only 1. Try one of the other CsvPreference constants, or create one yourself.
Post by: Nimu Chox, Greenhorn
on Aug 31, 2012 02:44:52
I changed my own : CsvPreference pref = new CsvPreference('"', ',', "\n");
and also I tried this one: CVS prefence to EXCEL_PREFERENCE,
but I still get this exception:
All times above are in ranch (not your local) time.
The current ranch time is Dec 13, 2013 16:49:05.


Iam HRmanager
<EMAIL_ADDRESS>+8210 0000 0000
CHF 4’700.00-5’500.00 Gross/ per month, on 13 months basis
3,700-4,200 EURO/ Net per month / 13 salaries + Company Benefits
Cnr Flemington Road, And Harker Street, Melbourne VIC 3052, AUS


[gecode-users] still looking for an example of path constraints
Christian Schulte
cschulte at kth.se
Thu Nov 3 23:03:53 CET 2011
Let me be plain here: there is no point in looking into this until you
understand the difference between a path and a cycle.
Sorry but I just do not have enough time for the obvious
Christian
--
Christian Schulte, KTH, web.it.kth.se/~cschulte/
From: serge lemouton [mailto:serge.lemouton at ircam.fr]
Sent: Thursday, November 03, 2011 10:24 PM
To: users at gecode.org
Cc: Christian Schulte
Subject: Re: [gecode-users] still looking for an example of path constraints
Hello,
I have slightly modified the tsp example to test the path constraint by
adding a "model" option to the script.
No solution is found with the -model path option : why ?
Here is the modified code:
Thanks for any hint,
Yours,
Serge
On 25 oct. 2011, at 23:58, serge lemouton wrote:
> Hello,
>
> I know that, and that is exactly what I was looking for !
> But if it exists an hamiltonian circuit with n edges, it should exist at
least n path with n-1 edges, right ?
> and I don't know how to search those with the Gecode "path" constraint ...
> Could you provide an example, please ?
>
> Thanks in advance,
>
> Serge
>
>
>
> On 25 oct. 2011, at 14:07, Christian Schulte wrote:
>
>> Hi,
>>
>> Please check the meaning of path again in the documentation: it enforces
a
>> path and not a circuit!
>>
>> Christian
>>
>> --
>> Christian Schulte, www.ict.kth.se/~cschulte/
>>
>>
>> -----Original Message-----
>> From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On
Behalf
>> Of serge lemouton
>> Sent: Saturday, October 22, 2011 5:59 PM
>> To: users at gecode.org
>> Subject: [gecode-users] looking for an example of path constraints
>>
>> Hi all,
>>
>> I am trying to use the new path constraints with the cost matrix, but
>> without any success, yet.
>>
>> In the TSP example script, why simply replacing the
>>
>> circuit(*this, c, succ, costs, total, opt.icl());
>> by
>> path(*this, c, succ, start, end,costs, total, opt.icl());
>>
>> does'nt find any solution ?
>>
>> Thanks for any hint,
>>
>> Serge Lemouton
>> _______________________________________________
>> Gecode users mailing list
>> users at gecode.org
>> https://www.gecode.org/mailman/listinfo/gecode-users
>>
>>
>
>
> _______________________________________________
> Gecode users mailing list
> users at gecode.org
> https://www.gecode.org/mailman/listinfo/gecode-users
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.gecode.org/pipermail/users/attachments/20111103/c3f20afc/attachment-0001.htm>
More information about the users
mailing list


Progressive Rock Top Albums / all subgenres - all record types - 1974 - all countries
Based on members ratings & PA algorithm
Here is some details about how we calculate the average rating of an album and the rank of an album.
-
Average rating: The classic calculation of the average but more weight is affected to the rating of progarchives.com collaborators and to rating with reviews.
- Rating only: Weight = 1
- Review by members : Weight = 10
- Review by PA Collaborators : Weight = 20
- Rank of an album: We use a calculation that compare an album average rating and number of ratings over all others albums in the query using this theory (http://en.wikipedia.org/wiki/Weighted_average) to create a variable every query "QWR" (AKA: Query Weighted Rating) use for ordering.
- By default, only albums with the average ratings above the average ratings of the requested query are displayed in theses lists, you can control this value in the parameters
| Rank | Cover | Ratings | Title Artist |
Genre (Record Type) |
BUY |
| 1 |
4.53 | 2798 ratings
QWR = 4.4938
|
Red King Crimson |
Eclectic Prog Studio, 1974 |
Shop | |
| 2 |
4.39 | 2203 ratings
QWR = 4.3550
|
Mirage Camel |
Symphonic Prog Studio, 1974 |
Shop | |
| 3 |
4.35 | 2572 ratings
QWR = 4.3222
|
Relayer Yes |
Symphonic Prog Studio, 1974 |
Shop | |
| 4 |
4.29 | 2498 ratings
QWR = 4.2580
|
The Lamb Lies Down On Broadway Genesis |
Symphonic Prog Studio, 1974 |
Shop | |
| 5 |
4.32 | 1320 ratings
QWR = 4.2577
|
Crime Of The Century Supertramp |
Crossover Prog Studio, 1974 |
Shop | |
| 6 |
4.29 | 1284 ratings
QWR = 4.2311
|
The Power And The Glory Gentle Giant |
Eclectic Prog Studio, 1974 |
Shop | |
| 7 |
4.33 | 696 ratings
QWR = 4.2215
|
The Silent Corner And The Empty Stage Peter Hammill |
Eclectic Prog Studio, 1974 |
Shop | |
| 8 |
4.30 | 689 ratings
QWR = 4.1935
|
Rock Bottom Robert Wyatt |
Canterbury Scene Studio, 1974 |
Shop | |
| 9 |
4.25 | 849 ratings
QWR = 4.1651
|
Hamburger Concerto Focus |
Symphonic Prog Studio, 1974 |
Shop | |
| 10 |
4.24 | 819 ratings
QWR = 4.1596
|
Radio Gnome Invisible Vol. 3 - You Gong |
Canterbury Scene Studio, 1974 |
Shop | |
| 11 |
4.24 | 693 ratings
QWR = 4.1434
|
L'Isola Di Niente Premiata Forneria Marconi (PFM) |
Rock Progressivo Italiano Studio, 1974 |
Shop | |
| 12 |
4.14 | 652 ratings
QWR = 4.0569
|
Phaedra Tangerine Dream |
Progressive Electronic Studio, 1974 |
Shop | |
| 13 |
4.13 | 516 ratings
QWR = 4.0283
|
Red Queen To Gryphon Three Gryphon |
Prog Folk Studio, 1974 |
Shop | |
| 14 |
4.19 | 282 ratings
QWR = 4.0066
|
Christian Vander: Tristan Et Iseult [Aka: Ẁurdah Ďtah] Magma |
Zeuhl Studio, 1974 |
Shop | |
| 15 |
4.08 | 531 ratings
QWR = 3.9857
|
Turn Of The Cards Renaissance |
Symphonic Prog Studio, 1974 |
Shop | |
| 16 |
4.13 | 315 ratings
QWR = 3.9775
|
In Camera Peter Hammill |
Eclectic Prog Studio, 1974 |
Shop | |
| 17 |
4.10 | 388 ratings
QWR = 3.9772
|
Köhntarkösz Magma |
Zeuhl Studio, 1974 |
Shop | |
| 18 |
4.15 | 265 ratings
QWR = 3.9653
|
Hero And Heroine Strawbs |
Prog Folk Studio, 1974 |
Shop | |
| 19 |
4.24 | 161 ratings
QWR = 3.9502
|
Tilt - Immagini Per Un Orecchio Arti e Mestieri |
Jazz Rock/Fusion Studio, 1974 |
Shop | |
| 20 |
4.30 | 128 ratings
QWR = 3.9433
|
A Benefit Of Radim Hladík [Aka: Modrý Efekt & Radim Hladík] Blue Effect (Modrý Efekt; M. Efekt) |
Jazz Rock/Fusion Studio, 1974 |
Shop | |
| 21 |
4.01 | 561 ratings
QWR = 3.9349
|
Apostrophe (') Frank Zappa |
RIO/Avant-Prog Studio, 1974 |
Shop | |
| 22 |
4.15 | 188 ratings
QWR = 3.9213
|
Where Have I Known You Before Return To Forever |
Jazz Rock/Fusion Studio, 1974 |
Shop | |
| 23 |
4.08 | 263 ratings
QWR = 3.9191
|
Il Tempo Della Gioia Quella Vecchia Locanda |
Rock Progressivo Italiano Studio, 1974 |
Shop | |
| 24 |
4.12 | 209 ratings
QWR = 3.9131
|
Todd Rundgren's Utopia Utopia |
Eclectic Prog Studio, 1974 |
Shop | |
| 25 |
4.09 | 235 ratings
QWR = 3.9126
|
Biglietto Per L'Inferno Biglietto Per L'Inferno |
Rock Progressivo Italiano Studio, 1974 |
Shop | |
| 26 |
4.00 | 500 ratings
QWR = 3.9109
|
Kansas Kansas |
Symphonic Prog Studio, 1974 |
Shop | |
| 27 |
4.22 | 133 ratings
QWR = 3.9084
|
Harakka Bialoipokku (aka B The Magpie) Pekka Pohjola |
Jazz Rock/Fusion Studio, 1974 |
Shop | |
| 28 |
3.91 | 1510 ratings
QWR = 3.8853
|
Starless And Bible Black King Crimson |
Eclectic Prog Studio, 1974 |
Shop | |
| 29 |
4.11 | 173 ratings
QWR = 3.8819
|
Refugee Refugee |
Symphonic Prog Studio, 1974 |
Shop | |
| 30 |
4.22 | 113 ratings
QWR = 3.8798
|
Aerolit CzesŁaw Niemen |
Eclectic Prog Studio, 1974 |
Shop | |
| 31 |
4.00 | 305 ratings
QWR = 3.8777
|
The World Became The World Premiata Forneria Marconi (PFM) |
Rock Progressivo Italiano Studio, 1974 |
Shop | |
| 32 |
3.96 | 385 ratings
QWR = 3.8659
|
Hall Of The Mountain Grill Hawkwind |
Psychedelic/Space Rock Studio, 1974 |
Shop | |
| 33 |
3.94 | 475 ratings
QWR = 3.8585
|
Hergest Ridge Mike Oldfield |
Crossover Prog Studio, 1974 |
Shop | |
| 34 |
4.13 | 125 ratings
QWR = 3.8449
|
Ciclos Los Canarios |
Symphonic Prog Studio, 1974 |
Shop | |
| 35 |
3.93 | 325 ratings
QWR = 3.8270
|
Illusions On A Double Dimple Triumvirat |
Symphonic Prog Studio, 1974 |
Shop | |
| 36 |
4.01 | 166 ratings
QWR = 3.8123
|
Intorno Alla Mia Cattiva Educazione Alusa Fallax |
Rock Progressivo Italiano Studio, 1974 |
Shop | |
| 37 |
4.07 | 121 ratings
QWR = 3.8083
|
Klossa Knapitatet Samla Mammas Manna |
RIO/Avant-Prog Studio, 1974 |
Shop | |
| 38 |
3.93 | 253 ratings
QWR = 3.8079
|
Au-Delŕ Du Délire Ange |
Symphonic Prog Studio, 1974 |
Shop | |
| 39 |
3.94 | 208 ratings
QWR = 3.7926
|
Contrappunti Le Orme |
Rock Progressivo Italiano Studio, 1974 |
Shop | |
| 40 |
3.95 | 166 ratings
QWR = 3.7761
|
Caution Radiation Area Area |
Rock Progressivo Italiano Studio, 1974 |
Shop | |
| 41 |
4.02 | 109 ratings
QWR = 3.7666
|
Kayak II Kayak |
Crossover Prog Studio, 1974 |
Shop | |
| 42 |
3.90 | 193 ratings
QWR = 3.7639
|
Faust IV Faust |
Krautrock Studio, 1974 |
Shop | |
| 43 |
4.00 | 112 ratings
QWR = 3.7621
|
Banquet Lucifer's Friend |
Heavy Prog Studio, 1974 |
Shop | |
| 44 |
3.86 | 286 ratings
QWR = 3.7614
|
Eldorado Electric Light Orchestra |
Crossover Prog Studio, 1974 |
Shop | |
| 45 |
3.95 | 110 ratings
QWR = 3.7305
|
The Cosmic Jokers The Cosmic Jokers |
Krautrock Studio, 1974 |
Shop | |
| 46 |
3.91 | 126 ratings
QWR = 3.7270
|
Io Sono Murple Murple |
Rock Progressivo Italiano Studio, 1974 |
Shop | |
| 47 |
3.85 | 190 ratings
QWR = 3.7262
|
Everyone Is Everybody Else Barclay James Harvest |
Crossover Prog Studio, 1974 |
Shop | |
| 48 |
3.79 | 172 ratings
QWR = 3.6808
|
Civil Surface Egg |
Canterbury Scene Studio, 1974 |
Shop | |
| 49 |
3.83 | 126 ratings
QWR = 3.6789
|
Being Wigwam |
Jazz Rock/Fusion Studio, 1974 |
Shop | |
| 50 |
3.73 | 343 ratings
QWR = 3.6745
|
Floating Eloy |
Psychedelic/Space Rock Studio, 1974 |
Shop | |
| 51 |
3.78 | 137 ratings
QWR = 3.6622
|
Mysterious Traveller Weather Report |
Jazz Rock/Fusion Studio, 1974 |
Shop | |
| 52 |
3.69 | 179 ratings
QWR = 3.6214
|
Midnight Mushrumps Gryphon |
Prog Folk Studio, 1974 |
Shop | |
| 53 |
3.69 | 154 ratings
QWR = 3.6151
|
Borboletta Santana |
Jazz Rock/Fusion Studio, 1974 |
Shop | |
| 54 |
3.66 | 185 ratings
QWR = 3.6049
|
Soon Over Babaluma Can |
Krautrock Studio, 1974 |
Shop | |
| 55 |
3.68 | 128 ratings
QWR = 3.6016
|
Pretzel Logic Steely Dan |
Jazz Rock/Fusion Studio, 1974 |
Shop | |
| 56 |
3.66 | 134 ratings
QWR = 3.5895
|
Ballermann Grobschnitt |
Symphonic Prog Studio, 1974 |
Shop | |
| 57 |
3.64 | 159 ratings
QWR = 3.5824
|
Country Life Roxy Music |
Crossover Prog Studio, 1974 |
Shop | |
| 58 |
3.62 | 182 ratings
QWR = 3.5768
|
Harmonium Harmonium |
Symphonic Prog Studio, 1974 |
Shop | |
| 59 |
3.61 | 221 ratings
QWR = 3.5738
|
Apocalypse Mahavishnu Orchestra |
Jazz Rock/Fusion Studio, 1974 |
Shop | |
| 60 |
3.60 | 145 ratings
QWR = 3.5604
|
Taking Tiger Mountain (By Strategy) Brian Eno |
Progressive Electronic Studio, 1974 |
Shop | |
| 61 |
3.52 | 135 ratings
QWR = 3.5096
|
The Good Earth Manfred Mann's Earth Band |
Eclectic Prog Studio, 1974 |
Shop | |
| 62 |
3.50 | 266 ratings
QWR = 3.5024
|
Autobahn Kraftwerk |
Progressive Electronic Studio, 1974 |
Shop |


--- layout: page ---
Drop us a message below with your details, and we'll get back to you as fast as we can!


Be warned, starting a new game erases your current progress...
Do you have what it takes?
>>>>> Start my adventure! <<<<<


CGuides
The Home of All of the Best Columbia Study Guides
Study Guide Upload
Study Guide Name:
Professor:
Semester:
Department/Class:
Description:
Select file to upload:


Tech Tuesdays is a platform for sharing and gathering tech knowledge via short tech talks proposed and selected by members themselves.


Shana and Andrea are getting married
June 27th 2015
Irvington · New York
We reserved 25 rooms in each of these hotels.
Click on the letters for details:
There is parking available on site
Coming in the next weeks!
Welcome & Drinks
Ceremony
Cocktails/ Hors D'oeuvres
Dinner and Dancing
Shoes Off!


21.1 Implement a passive learning agent in a simple environment, such as the $4\times 3$ world. For the case of an initially unknown environment model, compare the learning performance of the direct utility estimation, TD, and ADP algorithms. Do the comparison for the optimal policy and for several random policies. For which do the utility estimates converge faster? What happens when the size of the environment is increased? (Try environments with and without obstacles.)
21.2 Chapter complex-decisions-chapter defined a proper policy for an MDP as one that is guaranteed to reach a terminal state. Show that it is possible for a passive ADP agent to learn a transition model for which its policy $\pi$ is improper even if $\pi$ is proper for the true MDP; with such models, the POLICY-EVALUATION step may fail if $\gamma{{\,{=}\,}}1$. Show that this problem cannot arise if POLICY-EVALUATION is applied to the learned model only at the end of a trial.
21.3 [prioritized-sweeping-exercise]Starting with the passive ADP agent, modify it to use an approximate ADP algorithm as discussed in the text. Do this in two steps:
Implement a priority queue for adjustments to the utility estimates. Whenever a state is adjusted, all of its predecessors also become candidates for adjustment and should be added to the queue. The queue is initialized with the state from which the most recent transition took place. Allow only a fixed number of adjustments.
Experiment with various heuristics for ordering the priority queue, examining their effect on learning rates and computation time.
21.4 The direct utility estimation method in Section passive-rl-section uses distinguished terminal states to indicate the end of a trial. How could it be modified for environments with discounted rewards and no terminal states?
21.5 Write out the parameter update equations for TD learning with $$\hat{U}(x,y) = \theta_0 + \theta_1 x + \theta_2 y + \theta_3\,\sqrt{(x-x_g)^2 + (y-y_g)^2}\ .$$
21.6 Adapt the vacuum world (Chapter agents-chapter) for reinforcement learning by including rewards for squares being clean. Make the world observable by providing suitable percepts. Now experiment with different reinforcement learning agents. Is function approximation necessary for success? What sort of approximator works for this application?
21.7 [approx-LMS-exercise]Implement an exploring reinforcement learning agent that uses direct utility estimation. Make two versions—one with a tabular representation and one using the function approximator in Equation (4x3-linear-approx-equation). Compare their performance in three environments:
The $4\times 3$ world described in the chapter.
A ${10}\times {10}$ world with no obstacles and a +1 reward at (10,10).
A ${10}\times {10}$ world with no obstacles and a +1 reward at (5,5).
21.8 Devise suitable features for reinforcement learning in stochastic grid worlds (generalizations of the $4\times 3$ world) that contain multiple obstacles and multiple terminal states with rewards of $+1$ or $-1$.
21.9 Extend the standard game-playing environment (Chapter game-playing-chapter) to incorporate a reward signal. Put two reinforcement learning agents into the environment (they may, of course, share the agent program) and have them play against each other. Apply the generalized TD update rule (Equation (generalized-td-equation)) to update the evaluation function. You might wish to start with a simple linear weighted evaluation function and a simple game, such as tic-tac-toe.
21.10 [10x10-exercise] Compute the true utility function and the best linear approximation in $x$ and $y$ (as in Equation (4x3-linear-approx-equation)) for the following environments:
A ${10}\times {10}$ world with a single $+1$ terminal state at (10,10).
As in (a), but add a $-1$ terminal state at (10,1).
As in (b), but add obstacles in 10 randomly selected squares.
As in (b), but place a wall stretching from (5,2) to (5,9).
As in (a), but with the terminal state at (5,5).
The actions are deterministic moves in the four directions. In each case, compare the results using three-dimensional plots. For each environment, propose additional features (besides $x$ and $y$) that would improve the approximation and show the results.
21.11 Implement the REINFORCE and PEGASUS algorithms and apply them to the $4\times 3$ world, using a policy family of your own choosing. Comment on the results.
21.12 Investigate the application of reinforcement learning ideas to the modeling of human and animal behavior.
21.13 Is reinforcement learning an appropriate abstract model for evolution? What connection exists, if any, between hardwired reward signals and evolutionary fitness?


import json from django.shortcuts import render from django.http import HttpResponse
from core.db.manager import DataHubManager from account.auth import * from util.run_draw_request import RunDrawRequest
from models.draw_request import DrawRequest from models.draw_response import DrawResponse
- def error_response():
- return HttpResponse(json.dumps({“success”: False}), content_type=”application/json”)
- def json_response(json_dict):
- json_dict[“success”] = True return HttpResponse(json.dumps(json_dict), content_type=”application/json”)
@login_required def table(request, repo, table):
username = get_login(request) manager = DataHubManager(username) repos = get_repos(manager) if repos is not None and repo in repos:
tables = get_tables(manager, repo) if tables is not None and table in tables:
draw_request = DrawRequest(request) print draw_request draw_response = RunDrawRequest(repo, table, draw_request, DrawResponse(draw_request.draw), manager).run() return HttpResponse(draw_response.to_json(), content_type=”application/json”)return error_response()
- def get_repos(manager):
result_set = manager.list_repos() if ‘tuples’ in result_set:
repos = [t[0] for t in result_set[‘tuples’]] return reposreturn None
- def get_tables(manager, repo_name):
result_set = manager.list_tables(repo_name) if ‘tuples’ in result_set:
tables = [t[0] for t in result_set[‘tuples’]] return tablesreturn None
@login_required def schema(request, repo, table):
username = get_login(request) manager = DataHubManager(username) repos = get_repos(manager) if repos is not None and repo in repos:
tables = get_tables(manager, repo) if tables is not None and table in tables:
schema = manager.get_schema(repo + ”.” + table) if schema is not None and ‘tuples’ in schema:
return json_response({“schema”: schema[“tuples”]})return error_response()
@login_required def aggregate(request, repo, table, agg_type, col_name):
username = get_login(request) manager = DataHubManager(username) repos = get_repos(manager) # Ensure that the repo exists. if repos is not None and repo in repos:
tables = get_tables(manager, repo) # Ensure that the table exists. if tables is not None and table in tables:
schema = manager.get_schema(repo + ”.” + table) # Ensure that the schema for the repo.table exists. if schema is not None and ‘tuples’ in schema:
- for c_name, c_type in schema[“tuples”]:
- if c_name == col_name and can_apply(agg_type, col_name):
result = manager.execute_sql(“SELECT %s(%s) FROM %s.%s” % (agg_type.lower(), col_name.lower(), repo, table)) if “tuples” in result and len(result[“tuples”]) > 0 and len(result[“tuples”][0]) > 0:
return json_response({“value”: result[“tuples”][0]})return error_response()
- def can_apply(agg, col_type):
- number_types = [“bigint”, “int8”, “bigserial”, “serial8”, “double precision”, “float8”,
- “integer”, “int”, “int4”, “real”, “float4”, “smallint”, “int2”, “serial”, “serial4”]
agg = agg.lower() if agg == “sum” or agg == “avg”:
return agg in number_typesreturn agg in [“min”, “max”, “count”]


Loading cases, this wont take long!
Please create another case to move this query to first.
Select a case:


Viewing Cozmos pages
Use any Web Browser on any Operating system.
Editing Pages on a Cozmos server
You are most likely going to be editing pages from Firefox. If
that is the case ensure you have the [Firefox extension] that will
allow you to do this.
A small amount of highly technical people may be hardcore SeaMonkey users. They may be happy with [hacking seamonkey].
If you really must use Internet Explorer, you may be interested in [editing with microsoft word].
Editing Pages in a Cozmos system using other browsers
Opera (Mac), Safari (Mac), Konqueror (Linux), Galeon (Linux), Camino
(Mac) and others
changes will need to be changed to have a helper application for
editing. All they need to support is Ctrl-E (or Apple-E) and a
preference setting for the name of the executable to launch for editing.
As of early 2007, none of these browsers are
compatible.


IMC UAM Radius and IPv6
13 May 2014 · Filed in IMCYesterday while installing IMC for an POC (proof of concept) I stumbled on a problem with configuring radius on the UAM module. I had everything lined up and configured, but nothing was working! My access device which was a MSM controller was sending radius requests towards the IMC radius server on 1812, but was not receiving any response. I fired Wireshark op un the IMC server (a windows 2012 R2) and could see the radius request landing on the NIC. I double checked everything and the configuration was sound. I then proceeded to check if the IMC server was listening on TCP port 1812 and 1813 (std. radius ports) with the command “netstat -an”. Netstat reported that IMC was indeed not listening on any radius ports, not even the Cisco proprietary ports (1645,1646). Next step was the IMC UAM log which recides in this path “C:\Program Files\iMC\uam\log". And the following error filled the log:
[ERROR (1)] ; [38072] ; UAM ; $SYS$ ; (NULL) ; (NULL) ; (NULL) ; Fail to bind Socket with Port for Receive Thread[isIPv6=0].
[WARNING (2)] ; [44440] ; UAM ; $SYS$ ; (NULL) ; (NULL) ; (NULL) ; Receive Thread Quit Abnormally.
[ERROR (1)] ; [38072] ; UAM ; $SYS$ ; (NULL) ; (NULL) ; (NULL) ; ip:168299340, port:1812
[WARNING (2)] ; [38072] ; UAM ; $SYS$ ; (NULL) ; (NULL) ; (NULL) ; Receive Thread Quit Abnormally[isIPv6=0].
[WARNING (2)] ; [38072] ; UAM ; $SYS$ ; (NULL) ; (NULL) ; (NULL) ; Receive Thread Quit Abnormally.
[WARNING (2)] ; [45480] ; UAM ; $SYS$ ; (NULL) ; (NULL) ; (NULL) ; The receive threads are running abnormally.
The error is hinting that UAM cannot listen on the server´s network adapter because IPv6 is enabled. So i proceeded with disabling IPv6 on the network adapter: “http://networkinglife.dk/wp-content/uploads/2014/05/net_adapter_disable_ipv6.png”> I then rebooted the IMC server through the Intelligent Deployment Monitoring Agent and Voila! UAM was now listening on ports TCP 1812 and 1813. Summary Short story… if UAM radius is not listening on any ports and spewing errors… disable IPv6. I have contacted HP with this bug and have not received any reply yet.
Tags: HP networking · IMC · IPv6 · radius · uam Previous Post: IMC operator LDAP / SSL authentication Next Post: Cisco Prime Infrastructure 2.1


Inspector Gadget
Directed by David Kellogg
Story by Danny Olsen and Kerry Ehrin
Written by Kerry Ehrin, Zak Penn, and Audrey Wells
Starring Matthew Broderick, Rupert Everett, Andy Dick, Joely Fisher, and Dabney Coleman
As Reviewed by James Brundage (MovieKritic2000)
Its a sad state of affairs when Republicans and Democrats can get along better than rival movie studios. Nine times out of ten, republicans and democrats can't sit in the same room without yelling, yet, with at least some bipartisan cooperation, they can churn out a good law every once in a while.
Movie studios, on the other hand, refuse to collaborate even when it would be in there best interests. Case in point: Inspector Gadget and Wild Wild West.
Inspector Gadget is the latest in a string of cartoon adaptations that generally annoy me. This one, however, would have been a lot better under the command of Barry Sonnefield. Sonnfield decided to do Wild Wild West, a movie with no plot, no fine performances, and a focus on action. Novice director David Kellogg got to do inspector Gadget, a film that has plot, has performances, and has a focus on comedy. It just lacks that particular thing called timing.
Where as Wild Wild West never made me laugh, Inspector Gadget irked out a few (by definition, I laughed exactly three times during the movie). However, Inspector Gadget's wet behind the ears director David Kellogg just couldn't handle a movie of Inspector Gadget's plot... and that's not a lot to ask.

Inspector Gadget tells the story of John Brown (Matthew Broderick), who gets a serious injury while trying to stop Claw (Rupert Everett, the fun part of the movie) from getting away with robbery and murder. He becomes the experimental prototype of a new form of cybernetic police officer known as Inspector Gadget, and gets to fulfill his dream of becoming a supercop. Of course he has a love interest, Brenda (Joely Fisher). Of course he has a car that talks back to him (can we say LOVE BUG?).
Basically, Claw creates a duplicate evil Gadget (also played by Broderick, who has versatility even in as flat a role as Inspector Gadget offers him) who tries to destroy Riverdale and, from then in, the movie is completely cliche and predictable.
Of the several annoyances I have over this film, three rank high on my list. The first is that all of the great actors are given terrible roles. Rupert Everett, Andy Dick, Mathew Broderick.  Two, the cartoon wasn't that good to begin with (I spent a good portion of my youth watching its ilk), and the movie was worse than the cartoon, and three, it decided that it was going to rename the city Riverdale.
The movie is obviously filmed in Pittsburgh, a city that truly shines out in the film, yet the writers decided to set the movie in Riverdale. Hello? What does that do if everyone notices the city as Pittsburgh? Of course, I'm only saying this because I live near the burgh and for some reason the steel city grows on you (kinda like New Jersey), but I still think it's a crock. A lot more people would have been happy if they moved it to Pittsburgh, but NO!
It doesn't matter, anyway. Even if they moved the location to Pittsburgh, the movie would have still sucked.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Weather app
Home
About
Contact
Should you buy EUR?
The current value GBP to EUR is
(please wait...)
BUY !!!


Contraband cigarettes found stashed in cars with forged diplomatic registration plates
by BNNState Revenue Service (VID) Tax and Customs Police found a large number of contraband cigarettes in vehicles bearing forged diplomatic registration plates, VID reports.
SRS Customs Office in cooperation with State Border Guard performed an inspection of two vehicles driven by two Mongolian citizens. As it turned out, the diplomatic registration plates of said vehicles were forged. During the inspection the drivers handed fake car registration passports issued in Kazakhstan. While performing the inspection, customs officers suspected possible smuggling attempt. This is why vehicles were moved for an in-depth customs inspection. Cars were scanned and checked using a K-9 unit.
The in-depth inspection revealed a stash of 5 132 800 contraband cigarettes bearing excise stamps of the Republic of Belarus.
Two criminal processes in accordance with Part 1 of Section 275 and Part 1 of Section 190 of the Criminal Law were launched. Two Mongolian citizens born in 1979 and 1984 are held suspect.


- refresh() - Method in class cs3500.music.view.AudioView
-
- refresh() - Method in class cs3500.music.view.AudioVisualView
-
- refresh() - Method in class cs3500.music.view.GuiViewFrame
-
- refresh() - Method in interface cs3500.music.view.IView
-
Signal to the view to redraw itself.
- refresh() - Method in class cs3500.music.view.TextView
-
- remapInstrument(Instrument, Instrument) - Method in class cs3500.music.view.MockSynthesizer
-
- removeNote(Octave, NoteType, int, int) - Method in interface cs3500.music.model.MusicOperations
-
Removes the note from beats start
to end
at the pitch
specified by octave o
and note type nt
.
- removeNote(Octave, NoteType, int, int) - Method in class cs3500.music.model.MusicSheet
-
- removeNote(Note) - Method in class cs3500.music.model.PitchSequence
-
Removes the specified note from this PitchSequence
.
- repeatAt(int) - Method in interface cs3500.music.model.MusicOperations
-
Gets the repeat instruction that contains the given beat.
- repeatAt(int) - Method in class cs3500.music.model.MusicSheet
-
- RepeatInstr - Class in cs3500.music.model
-
Represents a set of instructions to repeat a certain part of a music model.
- RepeatInstr(int, int) - Constructor for class cs3500.music.model.RepeatInstr
-
- RepeatInstrTests - Class in cs3500.music.tests
-
Tests of the repeat instructions class.
- RepeatInstrTests() - Constructor for class cs3500.music.tests.RepeatInstrTests
-
- repeatTest() - Method in class cs3500.music.tests.AudioViewTests
-
- resetRepeats() - Method in interface cs3500.music.model.MusicOperations
-
Resets all repeat instructions to uncompleted.
- resetRepeats() - Method in class cs3500.music.model.MusicSheet
-
- resizePanel(int, int) - Method in class cs3500.music.view.PianoPanel
-
Updates the panel with it's new size changing the sizes of the elements in the panel.
- RowHeaderPanel - Class in cs3500.music.view
-
Panel to display row header information for a JScrollPane.
- RowHeaderPanel(List<PitchSequence>) - Constructor for class cs3500.music.view.RowHeaderPanel
-


Apache HTTP Server Version 1.3
Why We Took PEM Out of Apache
On May 17th, 1995, we were asked by a representative of NCSA to remove
any copies of NCSA httpd prior to 1.4.1 from our web site. They
were mandated by the NSA to inform us that redistribution of pre-1.4.1
code violated the same laws that make distributing Phill Zimmerman's
PGP package to other countries illegal. There was no
encryption in NCSA's httpd, only hooks to publicly available libraries
of PEM code. By the NSA's rules, even hooks to this type of
application is illegal.
Because Apache is based on NCSA code, and we had basically not touched
that part of the software, we were informed that Apache was also
illegal to distribute to foreign countries, and advised (not mandated)
by NCSA to remove it. So, we removed both the copies of the NCSA
httpd we had, and all versions of Apache previous to 0.6.5.
The Apache members are strong advocates of the right to digital
privacy, so the decision to submit to the NSA and remove the code was
not an easy one. Here are some elements in our rationale:
- The PEM code in httpd was not widely used. No major site relied
upon its use, so its loss is not a blow to encryption and security on
the world wide web. There are other efforts designed to give much
more flexible security - SSL and SHTTP - so this wasn't a function
whose absence would really be missed on a functional level.
- We didn't feel like being just a couple more martyrs in a fight
being fought very well by many other people. Rather than have the
machine that supports the project confiscated or relocated to South
Africa, etc., we think there are more efficient methods to address the
issue.
It kind of sickens us that we had to do it, but so be it.
Patches that re-implement the PEM code may be available at a foreign
site soon. If it does show up, we'll point to it - that can't be illegal!
Finally, here is a compendium of pointers to sites related to
encryption and export law. We can't promise this list will be up to
date, so send us mail when you see a problem or want a link added.
Thanks.
Brian,
<EMAIL_ADDRESS>Apache HTTP Server Version 1.3


| None. |
|
This command makes your program halt until a mouse button is pressed on the mouse. Used alone, it simply halts and waits for a button press. It can also be used to assign the pressed button's code value to a variable. See example.
In MOST CASES, you are not going to want to use this command because chances are likely you are going to want things on the screen still happening while awaiting the button press. In that situation, you'll use a WHILE ... WEND awaiting a MouseHit value - refreshing your screen each loop. |
|
; WaitMouse() sample
Print "Press a mouse button to continue." button=WaitMouse() Print "The mouse button code of the button you pressed was: " + button Print "Now press a button to quit." WaitMouse() End |


What's 'scope', and how does it work in JavaScript.
JavaScript Scope deals specifically with variables. Objects and peramiters are also variables.
Scope describes the amount of access you have to the variables.
Scope can be globally and locally defined.
Global scope is very simple – variables that are set outside of functions are globally known.
Local scope - is created by a function.
For example:
function myName(name){
var last = 'Smith';
console.log(myName + last);
};
// John Smith
The variable last
is only defined within the myName
function meaning this variable becomes locally scoped. If var last
was called outside of the function there would be an error message saying var last
is not defined.
Here is an example of variables that are defined within nested functions:
function showMe(name){
var message = 'Help!';
if(name =='John'){
lookLeft('Steve');
}
function lookLeft(player){
console.log(name + 'is running from' + player);
console.log(player + 'says' + message)
}
}
// John is running from Steve
// Steve says Help!
There are three variables defined above, name
, message
, player
. The variable player
nested inside the lookLeft
function is locally scoped and can only be called from within that specific function. Variables name
and message
are locally scoped but can be called in both the showMe
and lookLeft
functions.


Syntax:
handler-bind ({binding}*) form* => result*
binding::= (type handler)
Arguments and Values:
type---a type specifier.
handler---a form; evaluated to produce a handler-function.
handler-function---a designator for a function of one argument.
forms---an implicit progn.
results---the values returned by the forms.
Description:
Executes forms in a dynamic environment where the indicated handler bindings are in effect.
Each handler should evaluate to a handler-function, which is used to handle conditions of the given type during execution of the forms. This function should take a single argument, the condition being signaled.
If more than one handler binding is supplied, the handler bindings are searched sequentially from top to bottom in search of a match (by visual analogy with typecase). If an appropriate type is found, the associated handler is run in a dynamic environment where none of these handler bindings are visible (to avoid recursive errors). If the handler declines, the search continues for another handler.
If no appropriate handler is found, other handlers are sought from dynamically enclosing contours. If no handler is found outside, then signal returns or error enters the debugger.
Examples:
In the following code, if an unbound variable error is signaled in the body (and not handled by an intervening handler), the first function is called.
(handler-bind ((unbound-variable #'(lambda ...)) (error #'(lambda ...))) ...)
If any other kind of error is signaled, the second function is called. In either case, neither handler is active while executing the code in the associated function.
(defun trap-error-handler (condition) (format *error-output* "~&~A~&" condition) (throw 'trap-errors nil)) (defmacro trap-errors (&rest forms) `(catch 'trap-errors (handler-bind ((error #'trap-error-handler)) ,@forms))) (list (trap-errors (signal "Foo.") 1) (trap-errors (error "Bar.") 2) (+ 1 2)) >> Bar. => (1 NIL 3)
Note that ``Foo.'' is not printed because the condition made by signal is a simple condition, which is not of type error, so it doesn't trigger the handler for error set up by trap-errors.
Side Effects: None.
Affected By: None.
Exceptional Situations: None.
See Also:
Notes: None.


Please give us a moment to validate your invitation.
Your current email is: {{ $ctrl.user.email }}
Invitation email is: {{ $ctrl.invitation.email }}
Would you like to update your current email with the one from the invitation?


Select this option if you also want to capture local variables (primitives and String values) together with the
call stack. This may sufficiently slow down the debugging process.
Note that this option is unavailable if the Instrumenting agent is enabled.


SIR FRANCIS DRAKE AND HIS DEMON.
SIR FRANCIS DRAKE--who appears to have been especially befriended by his demon--is said to drive at night a black hearse drawn by headless horses, and urged on by running devils and yelping, headless dogs, through Jump, on the road from Tavistock to Plymouth.
Sir Francis, according to tradition, was enabled to destroy the Spanish armada by the aid of the devil. The old admiral went to Devil's Point, a well-known promontory jutting into Plymouth Sound. He there cut pieces of wood into the water, and by the power of magic and the assistance of his demon these became at once well-armed gunboats.
The Queen, Elizabeth, gave Sir Francis Drake Buckland Abbey; and on every band we hear of Drake and his familiars.
An extensive building attached to the abbey--which was no doubt used as barns and stables after the place had been deprived of its religious character--was said to have been built by the devil in three nights. After the first night, the butler, astonished at the work done, resolved to watch and see how it was performed. Consequently, on the second night, he mounted into a large tree, and hid himself between the forks of its five branches. At midnight the devil came, driving several teams of oxen; and as some of them were lazy, he plucked this tree from the ground and used it as a goad. The poor butler lost his senses, and never recovered them.
Drake constructed the Channel, carrying the waters from Dart-moor to Plymouth. Tradition says he went with his demon to Dartmoor, walked into Plymouth, and the waters followed him [a]. Even now,--as old Betty Donithorne, formerly the housekeeper at Buckland Abbey, told me,--if the warrior hears the drum which hangs in the hall of the abbey, and which accompanied him round the world, he rises and has a revel.
Some few years since a small box was found in a closet which had been long closed, containing, it is supposed, family papers. This was to be sent to the residence of the inheritor of this property. The carriage was at the abbey door, and a man easily lifted the box into it. The owner having taken his seat, the coachman attempted to start his horses, but in vain. They would not--they could not move. More horses were brought, and then the heavy farm-horses, and eventually all the oxen. They were powerless to start the carriage. At length a mysterious voice was heard, declaring that the box could never be moved from Buckland Abbey. It was taken from the carriage easily by one man, and a pair of horses galloped off with the carriage.
[a] "Here Sir Francis Drake first extended the point of that liquid line wherewith (as an emulator of the sunnes glorie) he encompassed the world."--The Survey of Cornwall, Carew.


The chamberlain, while in charge of the king's affairs, had ancillary duties of preparing an anticoagulant for the king's medicinal needs. [G|D]
The coulee, located deep in the heart of enemy territory, was heavily guarded by artillery and any attempt to pass incited a fierce backlash. [G|D]
The artist, working in her atelier down a narrow alley, skillfully used the circumflex to bring her painting to life. [G|D]
In the effort to abolish any form of discrimination, it is essential that we treat all individuals alike regardless of their unique physical characteristics, such as cellulite. [G|D]


Loading . . . please wait
VRML 2.0 Viewer
Microsoft virtual machine
Japanese Text Display Support
Korean Text Display Support
Pan-European Text Display Support
Chinese (Traditional) Text Display Support
Chinese (Simplified) Text Display Support
Thai Text Display Support
Hebrew Text Display Support
Vietnamese Text Display Support
Arabic Text Display Support
Language Auto-Selection
Windows Media Player
Wallet
Support for Viewing AOL Graphics
Offline Browsing Pack
Internet Connection Wizard
Uniscribe
DirectAnimation
Macromedia Shockwave
Macromedia Flash Player
Internet Explorer Help
Web Folders
Dynamic HTML Data Binding
Visual Basic Scripting Support
Vector Graphic Rendering (VML)
Windows Address Book


{{ site.name }}
{{ site.tel }}
Enthusiast about how technology can be applied to improve daily life and for public welfare. And Trying to be good open source contributor.
Github
/
Linkedin
{{ site.email }}
Specialized on Development fields
Mobile Software Development Kit Development.
iOS and Android App Development.
Interested Development Areas
iOS Development (Swift , Object C)
Android Development JAVA , Kotlin)
Deep Learning with python
{{ content }}


 <!– this is a comment –>  <title>HTML Example</title>   The indentation tries to be somewhat “do what I mean”… but might not match your style.
The XML mode supports two configuration parameters:
htmlMode (boolean)
This switches the mode to parse HTML instead of XML. This means attributes do not have to be quoted, and some elements (such as br
) do not require a closing tag.
alignCDATA (boolean)
Setting this to true will force the opening tag of CDATA blocks to not be indented.
MIME types defined: application/xml
, text/html
.


dependsOnMethods
attribute in the @Test
annotation.
A method name is considered illegal if it can't be resolved into a valid, accessible @Test
annotated method in the current class
or any of its parent classes.
Example:
public class SampleTest {
@Test(dependsOnMethods = "testSpellignError")
public void testSample() {}
@Test
public void testSpellingError(){}
}


|
GNSDK C API Reference
<IP_ADDRESS>2
|
Enumerations | |
| enum | gnsdk_moodgrid_presentation_type_t { gnsdk_moodgrid_presentation_type_5x5 = 0x0505, gnsdk_moodgrid_presentation_type_10x10 = 0x0A0A } |
| enum | gnsdk_moodgrid_status_t { gnsdk_moodgrid_status_unknown = 0, gnsdk_moodgrid_status_transaction_connecting = 10, gnsdk_moodgrid_status_transaction_start = 20, gnsdk_moodgrid_status_request = 30, gnsdk_moodgrid_status_receiving = 40, gnsdk_moodgrid_status_connection_lost = 50, gnsdk_moodgrid_status_transaction_complete = 100 } |
Functions | |
| GNSDK_DECLARE_HANDLE (gnsdk_moodgrid_provider_handle_t) | |
| GNSDK_DECLARE_HANDLE (gnsdk_moodgrid_presentation_handle_t) | |
| GNSDK_DECLARE_HANDLE (gnsdk_moodgrid_result_handle_t) | |
| gnsdk_moodgrid_presentation_type_5x5 |
5 by 5 Mood Grid presentation type. |
| gnsdk_moodgrid_presentation_type_10x10 |
10 by 10 Mood Grid presentation type. |
Definition at line 99 of file gnsdk_moodgrid.h.
Definition at line 40 of file gnsdk_moodgrid.h.
| GNSDK_DECLARE_HANDLE | ( | gnsdk_moodgrid_provider_handle_t | ) |
Handle to Mood Grid Provider.
| GNSDK_DECLARE_HANDLE | ( | gnsdk_moodgrid_presentation_handle_t | ) |
Handle to Mood Grid Presentation. Created by gnsdk_moodgrid_presentation_create API, the application must create this handle to request any Mood Grid recommendations.
| GNSDK_DECLARE_HANDLE | ( | gnsdk_moodgrid_result_handle_t | ) |
Handle to Mood Grid Results. Created by gnsdk_moodgrid_presentation_find_recommendations API, the application calls this API to get results for any Presentation coordinate.
How can we improve this topic?
Copyright © 2000-present. Gracenote, Inc. All rights reserved. Generated on Tue Jan 8 2013 07:40:57.


| Class | Description |
|---|---|
| For<I> |
A
Loop version of the typical 'for' statement. |
| Foreach<I> |
Loop for each item of a list.
|
| Forever |
Looping until get broken manually.
|
| Instructor |
Used to be the communication method between 2 (or more) threads (loops).
|
| Lock<T> |
A java lock locker thread.
|
| Loop<I,P> |
Controllable loop.
|
| Once |
A loop to do code just one time.
|
| While |
A
Loop version of the typical 'while' statement. |


Hi, I'm Chelsea. I am a motivated Web Designer and Developer seeking a position in Houston, TX that will utilize as well as expand my current skills in visual design and front-end development. I have an affinity for learning and a menagerie of skills spanning various fields which helps me bring a unique perspective to any position. I discovered coding through curiosity and building websites for fun for employers. Welcome to my portfolio!


Home
Maryland :: Locate The Law
Constitution
Maryland Constitution
(Maryland State Archives)
Colonial Charters, Grants and Related Documents: Maryland
(Yale Avalon Project)
includes the Charter of 1632, the Constitution of 1776, and the Amendments to the Maryland Constitution of 1776
Executive
Maryland Administrative Code
(Maryland Division of State Documents)
Maryland Register
(Maryland Division of State Daces)
Maryland Executive Orders Information
Maryland Attorney General Opinions
1993-
Maryland Governor
Maryland Office of the Attorney General
Maryland State Board of Elections
Maryland Secretary of State
Maryland.gov: Government in Maryland
Judicial
Maryland Judiciary Case Search
(Maryland Judiciary)
Maryland Judiciary Case Search: Frequently Asked Questions
(Maryland Judiciary)
Maryland Court of Appeals Opinions
(Maryland Judiciary)
1995-
Maryland Court of Appeals Opinions
(FindLaw)
1995-
Maryland Court of Special Appeals Opinions
(Maryland Judiciary)
1995-
U.S. Court of Appeals, 4th Circuit
(U.S. Courts)
U.S. Court of Appeals, 4th Circuit
(FindLaw)
January 1995-
U.S. District Court, District of Maryland
September 1998-
Maryland Judiciary
and
Frequently Asked Questions
Maryland Judiciary Reports/Publications
Maryland Rules Governing Access to Court Records
(PDF)
Maryland Court Rules
(Michie from LexisNexis)
Legislative
Maryland Statutes
(Maryland General Assembly)
Maryland Code
(Michie)
Maryland Bills
-includes bill status and indexes
Maryland General Assembly
- composed of the Senate and House of Representatives


{% extends "play/layout.html" %} {% block content %}
TITLE {{form.title}}
JUST A LITTLE DESCRIPTION!
{{form.description}}
LOCATION {{form.location}}
PRICE IN POINTS {{form.price}} | # OF RELEASED COUPONS {{form.coupons_released}}


It all started in mid November 2004. Being in study period with nothing to do, I decided to leave with my friend Neil to drink some beers at his house. Neil offered me some marijuana but I declined seeing as that I was being drug tested. When we arrived at his house, Neil smoked a few bowls of his weed and I drank about five beers. We returned to school after the festivities were over and commenced to go to last period. I remained drunk until I got on the bus to go home. My friend John asked me if I wanted to chill at his house after school. I got off the bus at his house.
While at his house, I learned he had an assortment of various drugs available. I snorted 60mg of Adderall to try and sober me up so that I could call and tell my parents my plans for the evening. After I called them, John told me that his brother was growing an 'Angels Trumpet' plant in the basement. Supposedly, it would make you trip for three days. We went down to the basement. I ate three leaves, John ate about two.
We put on a movie waiting for the trip to start. About one hour into the movie, I started to feel very tired, almost as if I were to fall asleep. We stood up and stopped the movie and attempted to get something to eat. I noticed that my motor skills were severely affected as I would reach out to touch the door and it would take me several attempts before actually reaching the knob. I went to the bathroom to piss. I looked in the mirror and saw that my pupils were very dilated. I went out to tell John the exciting news about my pupils and he looked at me and started laughing.
 I tried to race the car but I kept crashing into walls and other cars. At one point his sister came into the room. Seeing as I had never met her before, I introduced myself to her in the best of my ability. Soon after this, I blacked out.
My friend Chris, who does not use drugs, had just gotten out of work and came over to John's house to hang out. All memories from here on are told to me by Chris because I do not remember. John's mother came home and asked me if I wanted something to eat. I quickly said no in a panicked way. I kept calling his mother Mrs. Anderson even though John's last name is not Anderson.
I told John and Chris that I was going to look for my locker in the woods. They advised me against it seeing as we were not at school. At this point, I remember my hallucination. I was at my school, everyone had pale white clothes on, and pale grey skin. The school was black and white. My friend Drew, who used to be the drummer in my band, was the prevalent person that I remember from this hallucination. Chris told me that as we were standing around his car, I was attempting to change the oil in my father's car which was not there. We all got in his car, which was really there, and decided to go to the mall.
On the way to the mall, while I was caressing the leather seats, we were stopped by the police. Apparently, one of John's neighbors had called the cops after observing me wandering in their back yard in a delusional fashion. The cops brought me down to the station. I somewhat remember being in the back of the police car and trying to stick my finger through the metal grating. The police called my parents and they came down to the station. While they were there, I almost wandered into the road and got hit by a car. My parents brought me home.
I don't remember the ride home. I do remember when I got home, my father punched me in the face and was trying to get out of me what drugs I had taken.  My father asked why I hadn't gone to the bathroom and I got confrontational with him saying that I did.
My mother was on the phone frantically trying to get from Chris what drugs I had taken. I remember looking over at the cabinet and seeing stacks and stacks of cereal boxes.  Eventually I muttered 'angel's trumpet'. My father, having read a book on brugmansia and other hallucinogenic plants in college, decided that I needed to be brought to the hospital.
I don't remember much of the ride to the hospital. I was trying to communicate with my parents, having forgotten once again that I had taken any drugs. I remember that after everything I had said, my mother would say things like 'What the fuck?'.
When I arrived at the hospital, I was hallucinating wildly. John's parents are doctors. While I was laying on the hospital bed, I thought I was in John's parents' bedroom taking a nap. The doctors were asking me if I had taken any drugs that day, I said no. My parents told me I was reciting things to them such as how to solve related rate problems in calculus and the chemical structure for glucose. I remember I was hallucinating that my calculus notes were written on the hospital curtain because of the strange patterns that were there. I also told my father that my blood was neon red because of the heart monitor on my finger.
The doctors finally injected me with glucose and a chemical to counteract the brugmansia. I stopped hallucinating and woke up in the bed thinking I was getting my wisdom teeth taken out. I spent all night in the hospital with my mother saying foolish things such as, 'I need to go to the bathroom in the woods.'
The hallucinations continued throughout the morning on the way home from the hospital. The road signs' letters kept rearranging and changing. Eventually that night, the hallucinations finally diminished almost completely.
 I know I'll never do it again.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


Angela Bassett says she’s already close to ‘fighting weight’ for a Black Panther sequel
by Hilary Brueck- Angela Bassett says often as an actor “you don’t get that much lead time” to prepare for a role.
- “So that you don’t have to get ready, it’s smarter to stay ready, or stay close to ready,” she said.
- She prefers running on a treadmill to being outside, and says she almost never braves the gym alone.
- Visit INSIDER’s homepage for more stories.
The “Black Panther” sequel is not slated to come out until May 2022, but Angela Bassett – aka Queen Mother of Wakanda – is not wasting any time when it comes to getting into shape.
“I have to stay ready, because I don’t know the day or the hour they’re going to call and say, ‘We’ve written the script, and we’re ready to start,” she told Insider.
Bassett, now an ambassador for the Know Diabetes by Heart initiative from the American Heart Association and American Diabetes Association, lost her mother to congestive heart failure five years ago. Now, she’s encouraging everyone to make short bouts of activity part of their own daily routines.
She has mentioned before that she might like the Queen Mother to be ready to fight in “Black Panther 2.”
“I would kid when we were working, saying, ‘When we come back for [“Black Panther 2″], [Queen Mother] is going to really get into the game,'” Bassett told ABC News last year. “She’s going to throw down.”
In order to stay camera-ready for any eventual action scenes, Bassett says she likes to do cardio workouts, and she prefers the treadmill to the great outdoors.
“I’m not a run outside type of person, because I just get too distracted,” she said. “I like to see how far I’m going and how long, I love the numbers, I love the numbers!”
She also does not tend to brave the gym alone.
“I have to be held accountable, so I will pay a trainer,” Bassett said. “If you can’t pay a trainer, then you got a friend, I’ll take a friend with me, and as it’s been said, we go further together.”
Studies suggest that this kind of partnering technique really works. Your healthy (or unhealthy) behaviors can have a “ripple effect” on the people you live, work, and play around.
Plus, moving more often is great for your heart, and in partnership with a good diet, can help prevent or improve a diabetes diagnosis.
- Read more:
- Black Panther star Angela Bassett’s diet includes sweet potato brownies and bison
- Chocolate chip cookies are about to be baked in outer space, the first test of an oven in microgravity
- Marcia Cross’ anal cancer may have been linked to HPV. She wants people to know they could have the virus too.


For well over 20 years, a close family member suffered excruciating and delibilating pain. Inspite of the pain, he pushed his way to work. Only after extracting fluid from his knee, he was diagnosed and treated for gout. Even with this treatment, he experienced severe and excruciating pain. It got to a point where he was hospitalized several times for the pain. In the meantime, he was given entirely too many steroidal treatments. Although he did not have much back pain, he had pain in the ankles and big toes. At times he said it felt like he was walking on glass. He also had pain in his shoulder and knee joints. His Achilles tendons constantly bothered him. Only after a life threatening bout with intestinal issues was he diagnosed with Ankylosing-Spondylitis.
The Content is not intended to be a substitute for professional medical advice, diagnosis, or treatment. Always seek the advice of your physician or other qualified health provider with any questions you may have regarding a medical condition. Never disregard professional medical advice or delay in seeking it because of something you have read on this site.


RATIONAL DATA FOR ISOMORPHISM OF LIE ALGEBRAS
& ow e
& Bruce No Allison
1970
A Dissertation Presented to the Faculty of the Graduate School of Yale University in Candidacy for the Degree of Doctor of
Philosophy,
Reproduced with permission of the copyright owner. Further reproduction prohibited without permission.


Return Value
An observable sequence that contains the elements of a sequence produced by multicasting the source sequence.
func share(replay: Int = 0, scope: SubjectLifetimeScope = .whileConnected) -> Observable<Self.Element>
An observable sequence that contains the elements of a sequence produced by multicasting the source sequence.
replay
Maximum element count of the replay buffer.
scope
Lifetime scope of sharing subject. For more information see SubjectLifetimeScope
enum.
This operator is equivalent to:
.whileConnected
// Each connection will have it's own subject instance to store replay events.
// Connections will be isolated from each another.
source.multicast(makeSubject: { Replay.create(bufferSize: replay) }).refCount()
.forever
// One subject will store replay events for all connections to source.
// Connections won't be isolated from each another.
source.multicast(Replay.create(bufferSize: replay)).refCount()
It uses optimized versions of the operators for most common operations.


Reports methods which must either recurse infinitely or throw an exception. Methods reported by this inspection can not return normally.
Though such can be written intentionally, in many cases it may be an overseen mistake.
Example:
int baz() {
return baz();
}


We`ve subscribed to FlashJS`s onEnterFrame without particular stage. This helps to share RequestAnimationFrame between FlashJS and other libraries (tween engines and so on).