| MATLAB File Help: prtDataSetClass |
prtDataSetClass Data set object for classification DATASET = prtDataSetClass returns a prtDataSetClass object DATASET = prtDataSetClass(PROPERTY1, VALUE1, ...) constructs a prtDataSetClass object DATASET with properties as specified by PROPERTY/VALUE pairs. A prtDataSetClass object inherits all properties from the prtDataSetStandard class. In addition, it has the following properties: nClasses - The number of classes uniqueClasses - An array of the integer class labels isUnary - True if the number of classes = 1 isBinary - True if the number of classes = 2 isMary - True if the number of classes > 2 isZeroOne - True if the unique classes are 0 and 1 nObservationsByClass - The number of observations per class. A prtDataSetClass inherits all methods from the prtDataSetStandard class. In addition, it has the following methods: getObservationsByClass - Return the observations per class getObservationsByClassInd - Return the observations by class and index getTargetsAsBinaryMatrix - Return a binary matrix of targets. explore - Explore the prtDataSetClass object plot - Plot the data set plotFeatureDensity - Plot the probability density estimate of a single feature, labeled by class. plotStar - Create a star plot to visualize higher dimensional data plotAsTimeSeries - Plot the prtDataSetClass object as a time series plotPairs - Plot a grid of plots containing each set of two-features with density estimates on the diagonals plotDensity - Plot the density of each feature independently as a volume
| Superclasses | prtDataSetStandard |
| Sealed | false |
| Construct on load | false |
| prtDataSetClass | Data set object for classification |
| data | The observations |
| description | A string with a verbose description of the data set |
| featureInfo | Additional data (structure) per feature |
| isBinary | True if the number of classes = 2 |
| isLabeled | Whether or not the data has target labels |
| isMary | True if the number of classes > 2 |
| isUnary | True if the number of classes = 1 |
| isZeroOne | True if the uniqueClasses are 0 and 1 |
| nClasses | The number of classes |
| nFeatures | The number of features |
| nObservations | The number of observations |
| nObservationsByClass | The number of observations per class |
| nTargetDimensions | The number of dimensions of the target data |
| name | A string naming the data set |
| observationInfo | Additional data (structure) per observation |
| observationNamesInternal | The observations names |
| targetNamesInternal | The target names. |
| targets | The targets |
| uniqueClasses | The unique class |
| userData | Additional data per data set |
| bootstrap | boostrap a prtDataSetStandard object | |
| bootstrapByClass | Generate bootstrap samples from prtDataSetClass object | |
| catFeatures | Concatenate the features of a prtDataSetStandard object | |
| catObservations | Concatenate the observations of a prtDataSetClass object | |
| catTargets | Concatenate the targets of a prtDataSetStandard | |
| determineNumFeatures | nFeatures Return the number of features from a | |
| determineNumObservations | ||
| explore | Explore the prtDataSetObject | |
| exploreSimple | Explore the prtDataSetObject using basic | |
| getBinaryTargetsAsZeroOne | Return the target vector from a | |
| getClassNames | Returns the class names | |
| getClassNamesByClassInd | Return the class names | |
| getFeatureInfo | Allow for fast retrieval of feature info by specifying | |
| getFeatureNames | Return the prtDataSetStandard feature names | |
| getFeatures | Return the features of a prtDataSetStandard | |
| getKFoldKeys | ||
| getObservationInfo | Allow for fast retrieval of observation info by specifying | |
| getObservationNames | Return DataSet's Observation Names | |
| getObservations | Get the observations of a prtDataSetStandard | |
| getObservationsAndTargets | Get the observations and targets | |
| getObservationsByClass | Return the observations by class | |
| getObservationsByClassInd | Return the observations by class index | |
| getObservationsUnlabeled | Return the observations that | |
| getTargetNames | Return the target names of a dataset | |
| getTargets | Get the targets of a prtDataSetStandard object. | |
| getTargetsAsBinaryMatrix | binaryMatTargets Return the targets as a binary matrix | |
| getTargetsClassInd | getTargetsClassIndex Return the targets by class index | |
| getX | Shortcut for GetObservations | |
| getXY | Shortcut for getObservationsAndTargets | |
| getY | Shortcut for getTargets | |
| Static | loadobj | |
| plot | Plot the prtDataSetClass object | |
| plotAsTimeSeries | Plot the data set as time series data | |
| plotBeeSwarm | Plot the density of each feature independently as a scatter | |
| plotDensity | Plot the density of each feature independently as a volume. | |
| plotFeatureDensity | Plot the densities of a single feature | |
| plotPairs | () - Plot each pair of features in feature space | |
| plotStar | Create a star plot | |
| plotStarIndividual | Create a star plot | |
| removeClasses | remove observations corresponding to | |
| removeClassesByInd | removeClasses remove observations corresponding to | |
| removeFeatures | retainFeatures Retain the features of a prtDataSetStandard object. | |
| removeObservations | Remove observations from a prtDataSetStandard object | |
| removeTargets | Remove targets from a prtDataSetStandard | |
| retainClasses | retain observations corresponding to specified | |
| retainClassesByInd | retain observations corresponding to | |
| retainFeatures | Retain the features of a prtDataSetStandard | |
| retainObservations | Retain observations from a prtDataSetStandard object | |
| retainTargets | Retain targets from a prtDataSetStandard | |
| select | observations to retain by specifying a function | |
| setClassNames | Sets the class names | |
| setClassNamesByClassInd | Sets the class names | |
| setFeatureInfo | Allow setting of feature info by specifying string value | |
| setFeatureNames | Set the prtDataSetStandard feature names | |
| setFeatures | Set the features of a prtDataSetStandard object | |
| setObservationInfo | Allow setting of observation info by specifying string value | |
| setObservationNames | Set the observation names of a data set | |
| setObservations | Set the observations prtDataSetStandard | |
| setObservationsAndTargets | Set the observations and targets | |
| setTargetNames | Set the data set target names | |
| setTargets | Set the Targets prtDataSetStandard object. | |
| setX | Shortcut for setObservations | |
| setXY | Shortcut for setObservationsAndTargets | |
| setY | Shortcut for setTargets | |
| summarize | Summarize the prtDataSetClass object |


Summary
Asset monitor displays information about host groups and hosts. It gives a quick snapshot of what types of hosts are in your host groups and what type of hardware/software those hosts have configured. It also provides a change log which allows you track host changes from a historical perspective. The host information is gathered on each host and pushed to the server. This is done once every day since the data gathered is fairly static in nature.
Host Group Assets
Shows how many hosts and the breakdown of host type for every host group. You can also toggle and get a quick host view which show the hostname, IP address, OS, and CPU model for every host. If more information is needed you can drill into each host.
<Picture>
Host Assets
Displays detailed information about a host. The following things are displayed:
CPU Model - Shows the model number of the cpu(s) for a given host.
CPU Speed - Shows the speed of the cpu(s) in MHZ for a given host.
Number of CPUs - Shows the number of cpu(s) in a given host. Note: with technologies such as hyper threading and multi-core cpu(s), perfstat display's logical not physical cpu's.
Total Memory - Shows the total physical memory installed in a given host.
OS - Shows the os name for a given host. Note: this is a generic os name perfstat uses for host categorization.
OS Version - Shows the os version a given host is running.
Kernel Version - Shows the kernel version a given os is running. Note: Unix only.
Service Pack - Shows the service pack a given host is running. Note: Windows only.
Patches - Shows a list of all the patches installed on a given host. This is very handy for tracking security vulnerablility and other critical os fixes.
<Picture>
Change Log
A log for every host used to document and provide a historical view of all changes. This is a very useful feature in an environemnt where more than one system administrator is responsible for a given host. It can be used to document maintenances, software upgrades/additions, hardware upgrades/additions, and failures. It it similar to a medical record for every host. A system administrator can go back and look at the history of that host which often helps explain things that are occuring in the present.
<Picture>


nips nips2002 nips2002-149 nips2002-149-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Ofer Dekel, Yoram Singer
Abstract: We describe a new algorithmic framework for learning multiclass categorization problems. In this framework a multiclass predictor is composed of a pair of embeddings that map both instances and labels into a common space. In this space each instance is assigned the label it is nearest to. We outline and analyze an algorithm, termed Bunching, for learning the pair of embeddings from labeled data. A key construction in the analysis of the algorithm is the notion of probabilistic output codes, a generalization of error correcting output codes (ECOC). Furthermore, the method of multiclass categorization using ECOC is shown to be an instance of Bunching. We demonstrate the advantage of Bunching over ECOC by comparing their performance on numerous categorization problems.
[1] E.L. Allwein, R.E. Schapire, and Y. Singer. Reducing multiclass to binary: A unifying approach for margin classiﬁers. Journal of Machine Learning Research, 1:113–141, 2000.
[2] Michael Collins, Robert E. Schapire, and Yoram Singer. Logistic regression, adaboost and bregman distances. Machine Learning, 47(2/3):253–285, 2002.
[3] K. Crammer and Y. Singer. On the learnability and design of output codes for multiclass problems. In Proc. of the Thirteenth Annual Conference on Computational Learning Theory, 2000.
[4] I. Csisz´ r and G. Tusn´ dy. Information geometry and alternaning minimization procedures. a a Statistics and Decisions, Supplement Issue, 1:205–237, 1984.
[5] A.P. Dempster, N.M. Laird, and D.B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Ser. B, 39:1–38, 1977.
[6] Thomas G. Dietterich and Ghulum Bakiri. Solving multiclass learning problems via errorcorrecting output codes. Journal of Artiﬁcial Intelligence Research, 2:263–286, January 1995.
[7] Jyrki Kivinen and Manfred K. Warmuth. Additive versus exponentiated gradient updates for linear prediction. Information and Computation, 132(1):1–64, January 1997.
[8] John D. Lafferty. Additive models, boosting and inference for generalized divergences. In Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999.
[9] S. Della Pietra, V. Della Pietra, and J. Lafferty. Duality and auxilary functions for Bregman distances. Technical Report CS-01-10, CMU, 2002.
[10] T. Poggio and F. Girosi. Networks for approximation and learning. Proc. of IEEE, 78(9), 1990.
[11] R.E. Schapire, M. Rochery, M. Rahim, and N. Gupta. Incorporating prior knowledge into boosting. In Machine Learning: Proceedings of the Nineteenth International Conference, 2002.


Cli ¶
Wrapper for basic shell commands and shell output
Responsibility ¶
- Maintainer: davert
- Status: stable
- Contact<EMAIL_ADDRESS>Please review the code of non-stable modules and provide patches if you have issues.
Actions ¶
dontSeeInShellOutput ¶
Checks that output from latest command doesn't contain text
param
$text
runShellCommand ¶
Executes a shell command. Fails If exit code is > 0. You can disable this by setting second parameter to false
<?php
$I->runShellCommand('phpunit');
// do not fail test when command fails
$I->runShellCommand('phpunit', false);
param
$commandparam bool
$failNonZero
seeInShellOutput ¶
Checks that output from last executed command contains text
param
$text
seeResultCodeIs ¶
Checks result code
<?php
$I->seeResultCodeIs(0);
param
$code
seeResultCodeIsNot ¶
Checks result code
<?php
$I->seeResultCodeIsNot(0);
param
$code
seeShellOutputMatches ¶
param
$regex
Module reference is taken from the source code. Help us to improve documentation. Edit module reference


|
Polycode
|
A polygonal mesh. More...
Inherits PolyBase.
Public Member Functions | |
| Mesh (int meshType) | |
| Construct with an empty mesh of specified type. More... | |
| Mesh (const String &fileName) | |
| Construct from a mesh loaded from a file. More... | |
| void | addPolygon (Polygon *newPolygon) |
| Adds a polygon to the mesh. More... | |
| void | loadMesh (const String &fileName) |
| Loads a mesh from a file. More... | |
| void | clearMesh () |
| Clears mesh data. | |
| void | saveToFile (const String &fileName) |
| Saves mesh to a file. More... | |
| unsigned int | getPolygonCount () |
| Returns the number of polygons in the mesh. More... | |
| unsigned int | getVertexCount () |
| Returns the total vertex count in the mesh. More... | |
| Polygon * | getPolygon (unsigned int index) |
| Returns a polygon at specified index. More... | |
| void | createPlane (Number w, Number h) |
| Creates a plane mesh of specified size. More... | |
| void | createVPlane (Number w, Number h) |
| Creates a vertical plane mesh of specified size. More... | |
| void | createTorus (Number radius, Number tubeRadius, int rSegments, int tSegments) |
| Creates a torus. More... | |
| void | createBox (Number w, Number d, Number h) |
| Creates a cube mesh of specified size. More... | |
| void | createSphere (Number radius, int numRings, int numSegments) |
| Creates a sphere mesh of specified size. More... | |
| void | createCylinder (Number height, Number radius, int numSegments, bool capped=true) |
| Creates a cylinder mesh. More... | |
| void | createCone (Number height, Number radius, int numSegments) |
| Creates a cone mesh. More... | |
| Vector3 | recenterMesh () |
| Recenters the mesh with all vertices being as equidistant from origin as possible. | |
| void | useVertexNormals (bool val) |
| Toggles the mesh between using vertex or polygon normals. More... | |
| void | setVertexBuffer (VertexBuffer *buffer) |
| Sets the vertex buffer for the mesh. More... | |
| VertexBuffer * | getVertexBuffer () |
| Returns the vertex buffer for the mesh. More... | |
| Number | getRadius () |
| Returns the radius of the mesh (furthest vertex away from origin). More... | |
| void | calculateNormals (bool smooth=true, Number smoothAngle=90.0) |
| Recalculates the mesh normals. More... | |
| void | calculateTangents () |
| Recalculates the tangent space vector for all vertices. | |
| int | getMeshType () |
| Returns the mesh type. | |
| void | setMeshType (int newType) |
| Sets a new mesh type. More... | |
| Vector3 | calculateBBox () |
| Calculates the mesh bounding box. | |
| bool | hasVertexBuffer () |
| Checks if the mesh has a vertex buffer. More... | |
Static Public Member Functions | |
| static Mesh * | MeshFromFileName (String &fileName) |
| Construct from a mesh loaded from a file. More... | |
Public Attributes | |
| bool | arrayDirtyMap [16] |
| Render array dirty map. More... | |
| RenderDataArray * | renderDataArrays [16] |
| Render arrays. More... | |
| bool | useVertexColors |
| If set to true, the renderer will use the vertex colors instead of entity color transform to render this mesh. | |
Static Public Attributes | |
| static const int | QUAD_MESH = 0 |
| Quad based mesh. | |
| static const int | TRI_MESH = 1 |
| Triangle based mesh. | |
| static const int | TRIFAN_MESH = 2 |
| Triangle fan based mesh. | |
| static const int | LINE_MESH = 4 |
| Line based mesh. | |
| static const int | POINT_MESH = 5 |
| Point based mesh. | |
| static const int | LINE_STRIP_MESH = 6 |
| Line strip based mesh. | |
| static const int | LINE_LOOP_MESH = 7 |
| Line loop based mesh. | |
A polygonal mesh.
The mesh is assembled from Polygon instances, which in turn contain Vertex instances. This structure is provided for convenience and when the mesh is rendered, it is cached into vertex arrays with no notions of separate polygons. When data in the mesh changes, arrayDirtyMap must be set to true for the appropriate array types (color, position, normal, etc). Available types are defined in RenderDataArray.
| Polycode::Mesh::Mesh | ( | int | meshType | ) |
Construct with an empty mesh of specified type.
| meshType | Type of mesh. Possible values are: Mesh::QUAD_MESH, Mesh::TRI_MESH, Mesh::TRIFAN_MESH, Mesh::TRISTRIP_MESH, Mesh::LINE_MESH, Mesh::POINT_MESH. |
| Polycode::Mesh::Mesh | ( | const String & | fileName | ) |
Construct from a mesh loaded from a file.
| fileName | Path to mesh file. |
| void Polycode::Mesh::addPolygon | ( | Polygon * | newPolygon | ) |
Adds a polygon to the mesh.
| newPolygon | Polygon to add. |
| void Polycode::Mesh::calculateNormals | ( | bool | smooth = true , |
| Number | smoothAngle = 90.0 |
||
| ) |
Recalculates the mesh normals.
| smooth | If true, will use smooth normals. |
| smoothAngle | If smooth, this parameter sets the angle tolerance for the approximation function. |
| void Polycode::Mesh::createBox | ( | Number | w, |
| Number | d, | ||
| Number | h | ||
| ) |
Creates a cube mesh of specified size.
| w | Width of cube. |
| d | Depth of cube. |
| h | Height of cube. |
| void Polycode::Mesh::createCone | ( | Number | height, |
| Number | radius, | ||
| int | numSegments | ||
| ) |
Creates a cone mesh.
| height | Height of the cone. |
| radius | Radius of the cone. |
| numSegments | Number of segments. |
| void Polycode::Mesh::createCylinder | ( | Number | height, |
| Number | radius, | ||
| int | numSegments, | ||
| bool | capped = true |
||
| ) |
Creates a cylinder mesh.
| height | Height of the cylinder. |
| radius | Radius of the cylinder. |
| numSegments | Number of segments. |
| capped | Create the end caps. |
| void Polycode::Mesh::createPlane | ( | Number | w, |
| Number | h | ||
| ) |
Creates a plane mesh of specified size.
| w | Width of plane. |
| h | Depth of plane. |
| void Polycode::Mesh::createSphere | ( | Number | radius, |
| int | numRings, | ||
| int | numSegments | ||
| ) |
Creates a sphere mesh of specified size.
| radius | Radius of sphere. |
| numRings | Number of rings. |
| numSegments | Number of segments. |
| void Polycode::Mesh::createTorus | ( | Number | radius, |
| Number | tubeRadius, | ||
| int | rSegments, | ||
| int | tSegments | ||
| ) |
Creates a torus.
| radius | Radius of the torus. |
| tubeRadius | Radious of the tube. |
| rSegments | Number of radial segments. |
| tSegments | Number of tube segments. |
| void Polycode::Mesh::createVPlane | ( | Number | w, |
| Number | h | ||
| ) |
Creates a vertical plane mesh of specified size.
| w | Width of plane. |
| h | Depth of plane. |
| Polygon * Polycode::Mesh::getPolygon | ( | unsigned int | index | ) |
| unsigned int Polycode::Mesh::getPolygonCount | ( | ) |
Returns the number of polygons in the mesh.
| Number Polycode::Mesh::getRadius | ( | ) |
Returns the radius of the mesh (furthest vertex away from origin).
| VertexBuffer * Polycode::Mesh::getVertexBuffer | ( | ) |
Returns the vertex buffer for the mesh.
| unsigned int Polycode::Mesh::getVertexCount | ( | ) |
Returns the total vertex count in the mesh.
|
inline |
Checks if the mesh has a vertex buffer.
| True | if the mesh has a vertex buffer, false if not. |
| void Polycode::Mesh::loadMesh | ( | const String & | fileName | ) |
Loads a mesh from a file.
| fileName | Path to mesh file. |
Construct from a mesh loaded from a file.
| fileName | Path to mesh file. |
| void Polycode::Mesh::saveToFile | ( | const String & | fileName | ) |
Saves mesh to a file.
| fileName | Path to file to save to. |
| void Polycode::Mesh::setMeshType | ( | int | newType | ) |
Sets a new mesh type.
| newType | New mesh type. Possible values are: Mesh::QUAD_MESH, Mesh::TRI_MESH, Mesh::TRIFAN_MESH, Mesh::TRISTRIP_MESH, Mesh::LINE_MESH, Mesh::POINT_MESH. |
| void Polycode::Mesh::setVertexBuffer | ( | VertexBuffer * | buffer | ) |
Sets the vertex buffer for the mesh.
| buffer | New vertex buffer for mesh. |
| void Polycode::Mesh::useVertexNormals | ( | bool | val | ) |
Toggles the mesh between using vertex or polygon normals.
| val | If true, the mesh will use vertex normals, otherwise it will use the polygon normals. |
| bool Polycode::Mesh::arrayDirtyMap[16] |
Render array dirty map.
If any of these are flagged as dirty, the renderer will rebuild them from the mesh data. See RenderDataArray for types of render arrays.
| RenderDataArray* Polycode::Mesh::renderDataArrays[16] |


| WinAPI Wrapper |
In order to create a working application, you have to create a single object of the Application<T> class. You can create this object in a local, anonymous namespace, because it is not directly referenced. You cannot create more than one object of this class.
After you create that object, your application can run. The Application<T> class simplifies the process of creating an application, because it does all the complex, default work for you - it creates the main window and processes the message queue. It is a very light class, because it is template and inline. If you use the Application<T> class, there is the WinMain function created for you that handles your application object, so you can take care of other things and not bother about it.
The Application<T> class has four arguments:
| Argument name | Default value | Meaning |
|---|---|---|
| _Window | - | This is a mandatory argument. It is the class of your main window, that must be derived from the Window class (in can be even a distant successor). |
| _Accelerator | AcceleratorTraits< _Window > | This optional class processes accelerator messages. See the Remarks section for details. |
| _InitShutdown | ApplicationInitShutdownTraits | This class has optional initialization and shutdown code. You can enter here your own class, that has Init() and Quit() functions. |
| _CreateWindow | ApplicationWindowTraits< _Window > | This class is responsible for creating your main window. Typically you don't have any interest in replacing the default class with your own. |
Using the Application<T> class is optional and you can easily create regular working application without it and have your own WinMain function.
In order to process accelerators, you have to provide an appropriate class. The class you provide must have one function of the form:
bool ProcessAccel( MessageQueue& queue, _Window* p_window )where the _Window parameter is your main window's class. This function must process accelerators and return false if it doesn't succeed, so that other messages can be further processed.
The following default classes are available for accelerator processing:


---
layout: null
section-type: about
title: About
---
## About
Welcome to my blog and Landing Page.
Here is where you and I will begin to know
each other a little better.
The part where I write a couple sentences about
my interests, projects, experiences and hobbies.
This is the story of a girl who met a dog, fell in love with him and a year
later moved up to the Bay Are to develop a career in tech.


UPCOMING CODING EVENT
HURRYUP!


Class to enable lazy construction of a packaged_task from a completion token.
template< typename Function, typename Allocator = std::allocator<void>> class packaged_token
|
Name |
Description |
|---|---|
|
The allocator type. The allocator is used when constructing the std::promise object for a given asynchronous operation. |
|
Name |
Description |
|---|---|
|
Obtain allocator. |
|
|
Construct using specified allocator. |
The packaged_token
class is used to adapt a function object as a packaged task. When this adapter
is passed as a completion token to an asynchronous operation, the result
of the function object is retuned via a std::future.
Use the package
function rather than using this class directly.
Header: asio/package.hpp
Convenience header: None


Be bold in stating your key points. Put them in a list:
Improve your image by including an image.
Add a link to your favorite Web site. Break up your page with a horizontal rule or two.
Finally, link to another page in your own Web site.
© Wiley Publishing, 2011


Try out our Premium Member services: Virtual Legal Assistant, Query Alert Service and an ad-free experience. Free for one month and pay only if you like it.
IN THE HIGH COURT OF JHARKHAND AT RANCHI Cr. M.P. No. 17 of 2017 --- 1. Hemant Goyal. 2. Punit Gupta. .....Petitioners Versus 1. The State of Jharkhand. 2. Mr. Suresh Paswan. ... Opposite Parties --- CORAM : HON'BLE MR. JUSTICE RONGON MUKHOPADHYAY --- For the Petitioners : Mr. Nitin Kumar Pasari, Advocate For the State : A.P.P. --- 02/9.1.2017
It has been submitted by the learned counsel for the petitioner that the fact of the case does not constitute an offence under sections 277, 278 & 34 of the Indian Penal Code. It has further been submitted that no FIR could be instituted under section 37 of the Air (Prevention & Control of Pollution) Act, 1981 in view of clear bar under section 43 of the said Act, wherein cognizance can be taken only on a complaint made by the officer authorised. It has also been submitted that no FIR could be instituted as in terms of section 2(d) of the Code of Criminal Procedure a complaint does not include an FIR. Learned counsel submits that the petitioners are the Directors and Managers of M/s Narsingh Ispat Pvt Ltd., which has also been granted the consent to operate. Learned counsel thus submits that in absence of any allegation having been made out against the petitioner, entire criminal proceedings against the petitioner deserves to be quashed and set aside.
Learned counsel for the petitioner is directed to serve two copies of the petition on Mrs. Richa Sanchita, learned counsel appearing for Air Pollution Control Board, who subsequent to the same, shall file a counter affidavit within a period of four weeks.
List this case after four weeks under the heading "For Admission".
Until further orders, there shall be no coercive steps against the petitioner in connection with Chandil-Chowka P.S. Case No. 72 of 2016, G.R. No. 1288 of 2016, pending in the court of learned Sub Divisional Judicial Magistrate, Saraikella.
Let the order be sent through Fax at the cost of the petitioner.
(Rongon Mukhopadhyay, J) Rakesh/


Full stack web developer with graphic design background educated at University of
Southern Maine. Recently earned a certificate in full stack development from
University
of New Hampshire in JavaScript, Jquery, CSS, and responsive web design.
Coming from the nonprofit sector with a focus upon peer support and social justice, I am
passionate about
accessibility and approach programming challenges from fresh perspectives to create
collaborative and meaningful web applications.
When I am not at work or volunteering, you will find me at home or in the woods with my great
dane, Bonito, and my incredible partner, CJ.


About me can be found maybe if you click on a raind33r
Lets talk about this blog
Why OSWE - AWAE? Because it is not easy to find a hard challenge nowadays, something that will push you above your limits, and on top of that developed by the famous Offsec training team. In my opinion there is no better resource for advanced web attacks and source code analysis. That certainly doesn't mean you won't suffer through trying harder. More information can be found: here.
This contains my path to AWAE (which is in progress still) from the point where I got OSCP. It has some custom beginner excercises I have done along with my notes, and extra mile excercises without any solution in offsec style. The main idea is to cover a lot of web stuff from many perspectives, which turned out to be really helpfull in my previous experience with offsec training - learn everything it might come in handy is my translation of the TRY HARDER moto and mantra. Despite the fact you will have to TRY HARDER, this is intended for everyone who is beggining with more serious web security, whether it's about some source code analysis, bug bounty public disclosures, ctfs. It is only the starting point and trial for something more serious that might have also AD, exploit dev and mobile security (as some would say, in the next two, maximally two and a half years).
Pre-requisites: try harder mantra, some basic owasp 10 knowledge and basic web. Take your time at each step to understand everything, you are, and you will be expected to do tons of independent research.


I am a bandGeek/redditLover/movieCollector/sarcasticPerson/sassyLatina/hardWorker/tacoLover currently enrolled at Nashville Software School. I decided to take the plunge and have not looked back since. I wanted to find something with a reasonable schedule that i could see myself doing for years. Basically, I found myself ready for a career instead of a job I knew I wouldn't want to do 5 years from now. I enjoy the problem solving and creativity it involves, not to mention the constant learning! I'm glad I have chosen a feild that doesnt leave much time for boredom.
Worked with a diverse client base, ensuring they were treated with respect. Had to be professional and dressed for the job. Had to apply A lot of customer service and pleasant-ness. job required and good deal of creativity, professionalism, and a very "here to please" attitude.
Apart from being a web developer, I play the Euphonium with the Williamson County Community Band. I've been with them for two years now and absolutely love it. I've made great friendships and get to play with 50+ AWESOME musicians!
I also enjoy a good bit of nerding out with things like playing DND, having board game nights etc.. Also LOVE collecting old VHS tapes! And yes, i do actually have two functioning VCR's!


<% cache "recent_articles"do%>

RecentArticles
 #more code
<% end %>
cache will change in every url
Expiring fragment cache
in the articles controller#show
in the controller
expire_fragment(“recent_articles”)
move into a sweeper like in episode 89
auto-expiring fragment cache
Wrap the div you want to cache with cache tags
12345678910111213
<% cache @articledo%>#behind the scenes this is going to call .cache_key on the model #see below for cache_key explanation#powerful way to auto-expire by loading an object

<%= @article.name %>
<EMAIL_ADDRESS>
<%= link_to "Edit", edit_article_path %> | <%=link_to"Browse Articles",articles_path%>

<% end %>
Cache_key
Wrap the div you want to cache with cache tags
12345
a=Article.firsta.cache_key#=> articles/1-2012083083433 #-> name of the model, id of the model, and updated timestampa.touch#now it will have different cache key#because it is looking for a cache with a different name
Don’t need to litter expire_cache all over the model
The Touch Option expires the cache if it’s changed
This means it will update the article when a commment is changed.
Caching a fragment when you aren’t passing in an object
This is cached as recent_articles
123456789101112131415
<% cache "recent_articles"do%>

RecentArticles

 <% @recent_articles.each do |article| %> <% cache ["recent", article] do %>#can cache here as well!#namespaced with "recent", but passing in the article object#creates a unique key based on the elements passed into the array
<%= link_to article.name, article %>
<% end %> <% end %>

<% end %>
When the “recent_articles” cache is generated, it will generate a cache for each object in the list in addition to the full “recent_articles” cache.
normal behavior will just read the recent articles cache
but editing behavior of the objects will expire the cache.
How frag caches are stored
Rails comes with a built in centralized caching mechnism called rails.cache
can read and write from
`Rails.cache.read(‘views/recent_articles’)
default is memory store, but want to use redis or memcahce
defshow@product=Product.find(params[:id])fresh_when[@product,current_user]#passing in multiple end
Last_modified
Customize how an etag is generated
12345
defshow@product=Product.find(params[:id])fresh_when<EMAIL_ADDRESS>includes a timestamp in the header of last modifiedend
1234567891011121314151617
classProductsController<ApplicationController#from<EMAIL_ADDRESS>runs the db query before it is neccessary#this waits until we are sure it is<EMAIL_ADDRESS>waits until we are sure the all command is neededfresh_whenlast_modified:@products.maximum(:updated_at)#only fetching one values to determine if the cache is up to dateend#which means that it doesn't have to render the whole view template#and doesn't have to end up fetching all the products from the DBend
Should benchmark to see if you get a big performance boost
Cache-Control
Set options on how caching should behave
validation
max-age
private
cache only stored for one user usually in the web browser and not a shared store like a proxy
Max-age
12345678
defshow@product=Product.find(params[:id])expires_in5.minutes#this sets the max-age fresh_when@product,public:true#this public: true makes it available to multiple users#through a proxyend
#sessions controllerclient=Octokit::Client.new(:oauth_token=>auth.credentials.token)user.load_cache_info(client,user)#user model#this is the cache writter. Fetch is like a find_or_createdefload_cache_info(client,user)Rails.cache.fetch(user.nickname.to_sym,expires_in:24.hours)do{:repos=>client.repositories(user.nickname).collect{|repo|repo.name},:following=>client.following(user.nickname).collect{|user|user.login},:starred=>client.starred(user.nickname).collect{|repo|"#{repo.owner.login}/#{repo.name}"}}endend#this reads the cache which looks like a big hashdefuser_cacheRails.cache.read(self.nickname.to_sym)enddefcached_starreduser_cache[:starred]enddefcached_followinguser_cache[:following]enddefcached_reposuser_cache[:repos]end


/* * Load an Imlib2::Image from a file (no caching, deferred loading, * exceptions, or errors). * * Imlib2::Image::load_immediately_without_cache() provides access to the * low-level imlib_load_image_immediately_without_cache() function. You * probably want to use Imlib2::Image::load() instead of this function. * * Examples: * image = Imlib2::Image.load_immediately_without_cache 'sample_file.png' * */ static VALUE image_load_immediately_without_cache(VALUE klass, VALUE filename) {


RTOS SysTick and Delay
SysTick is mainly used for delay function in non-RTOS firmware, and is used as the interrupt for RTOS scheduler. If STM32 HAL utilizes another timer as its time base, RTOS has its own right to initialize and handler SysTick. The Delay function also works differently when RTOS is being used.
Last update: 2021-07-08 22:14:48
Table of Content
1. SysTick⚓
When generating a new project from STM32CubeMX, there will be a popup saying that:
What does this mean?
SysTick
SysTick is apart of the ARM Core, that counts down from the reload value to zero, and fire an interrupt to make a periodical event. SysTick is mainly used for delay function in non-RTOS firmware, and is used as the interrupt for RTOS scheduler.
In case STM32 HAL code also uses SysTick as its time base, RTOS will be generated to use HAL’s Handler.
If STM32 HAL utilizes another timer as its time base, RTOS has its own right to initialize and handler SysTick.
It is recommended to use SysTick for RTOS only, and set a basic timer as the time base for HAL.
2. Delay⚓
-
The function
osDelay()
is part of CMSIS Library and usesvTaskDelay()
internally to introduce delay with the difference that input argument ofosDelay
is delay time in milliseconds while the input argument of_vTaskDelay()
is number of Ticks to be delayed. Using thisosDelay()
function, OS will be notified about the delay and OS will change the status of task to blocked for that particular time period. -
The function
HAL_Delay()
is part of the hardware abstraction layer. It basically uses polling to introduce delay. Using thisHAL_Delay()
function, OS won’t be notified about the delay, and the code is in polling mode.
To introduce Delay using FreeRTOS functions, can use vTaskDelay()
or vTaskDelayUntil()
after the scheduler has started.
Always use osDelay()
when using RTOS.


1
Reproducible, Reusable, and Robust Reinforcement Learning
2
On the State of the Art of Evaluation in Neural Language Models
1
Random Search for Hyper-Parameter Optimization
2
Algorithms for Hyper-Parameter Optimization
Used in Google Vizier
Prune if the trial’s best intermediate result is worse than median of intermediate results of previous trials at the same step.
Note: Automatic hyperparameter tuning is included in the RL Zoo
import optuna
def sample_ppo_params(trial: optuna.Trial) -> Dict[str, Any]:
"""Sampler for PPO hyperparameters."""
# Sample from a list of choices (discrete)
activation_fn = trial.suggest_categorical("activation_fn", ["tanh", "relu"])
# Sample an integer in [low, high]
n_steps = trial.suggest_int("n_steps", 64, 2048)
# Sample a float in [low, high)
# (using log uniform distribution)
learning_rate = trial.suggest_float("lr", 1e-5, 1, log=True)
return {
"activation_fn": activation_fn,
"n_steps": n_steps,
"learning_rate": learning_rate,
}
from stable_baselines3.common.callbacks import BaseCallback
class TrialEvalCallback(BaseCallback):
"""Callback used for evaluating and reporting a trial."""
def _on_step(self) -> bool:
if self.eval_freq > 0 and self.n_calls % self.eval_freq == 0:
# Evaluate the current policy
mean_reward, _ = evaluate_policy(self.model, self.eval_env)
self.eval_idx += 1
# Send report to Optuna
self.trial.report(mean_reward, self.eval_idx)
# Prune trial if needed
if self.trial.should_prune():
self.is_pruned = True
return False
return True
def objective(trial: optuna.Trial) -> float:
...
# Sample hyperparameters
DEFAULT_HYPERPARAMS.update(sample_ppo_params(trial))
# Create the RL model
model = PPO(**kwargs)
# Create the callback that will periodically evaluate
# and report the performance
eval_callback = TrialEvalCallback(
eval_env,
trial,
N_EVAL_EPISODES,
EVAL_FREQ,
deterministic=True,
)
model.learn(N_TIMESTEPS, callback=eval_callback)
if eval_callback.is_pruned:
raise optuna.exceptions.TrialPruned()
return eval_callback.last_mean_reward
from optuna.pruners import MedianPruner
from optuna.samplers import TPESampler, RandomSampler
# Select the sampler, can be random, TPESampler, CMAES, ...
sampler = TPESampler(n_startup_trials=5)
# Do not prune before 1/3 of the max budget is used
pruner = MedianPruner(n_startup_trials=5, n_warmup_steps=N_EVALUATIONS // 3)
# Create the study and start the hyperparameter optimization
study = optuna.create_study(sampler=sampler, pruner=pruner, direction="maximize")
# This script can be launch in parallel when using a database
study.optimize(objective, n_trials=N_TRIALS, timeout=TIMEOUT)
# Best result
best_trial = study.best_trial
# Pandas dataframe with all the results
study.trials_dataframe().to_csv("study_results_ppo.csv")
# Plot utils
plot_optimization_history(study)
Practical session with Colab notebook


Psalm 54
For the chief musician; on stringed instruments. A maschil of David; when the Ziphites came and said to Saul, "Does David not hide himself with us?"
1 Save me, God, by your name,
and judge me in your might.
2 Hear my prayer, God;
give ear to the words of my mouth.
3 For strangers have risen up against me,
and pitiless men have sought after my life;
they have not set God before them.


Welcome to Timeless Games.
My name is Aeryn Burgess and Ive been a lover of GameCube Games ever since the age of five. Now that I have gotten older and no longer having a GameCube in my home. Its finally time I gave them to people who really need that last piece to there collection.
Most of the titles I have are Mario themed, but I do have a few hidden gems I'm sure you will enjoy
Happy Gaming Everyone.
If there are any errors on this site, I will do my best to find the problem asap. Here is a video of my debugging process


Hotel
Rooms
Room #
Capacity
Rate / Night
2B
4
$59.99
Book
2A
4
$59.99
Book
3A
2
$45.00
Book
3B
2
$45.00
Book
3C
3
$52.64
Book
4A
4
$59.99
Book
4B
4
$59.99
Book
Booking
×
Check-in Date
Nights
Confirm


Magic Dashboard
This page enables admins and teachers to manage codes, cohorts and more. Please see the User Control documentation for more information.
To create and manage grammar/vocab lists, click here.
Currently registered codes
Showing codes belonging to cohort {{cohort}}
. For security reasons, this list excludes users with role admin
.
Showing all codes in database, independent of cohort.
| Cohort | Code | Deploy | Card? | Role | Delete |
|---|---|---|---|---|---|
{{item.cohort}} |
{{item.code}} | {{item.deploy}} | {{item.card ? "Yes" : "No"}} | {{item.role}} |
Delete |
Add new code
Will be created with role student
.
Add new cohort
Auto-generate PDF
This will generate a sheet of 16 cut-out code cards, on one A4 sheet of paper. All codes will be added to your current cohort {{cohort}}
automatically.
Each card will feature the page URL, the cohort and the code. The date and deploy will be written at the bottom of the page.


Action Mailer — Easy email delivery and testing
Action Mailer is a framework for designing email-service layers. These layers are used to consolidate code for sending out forgotten passwords, welcome wishes on signup, invoices for billing, and any other use case that requires a written notification to either a person or another system.
Action Mailer is in essence a wrapper around Action Controller and the Mail gem. It provides a way to make emails using templates in the same way that Action Controller renders views using templates.
Additionally, an Action Mailer class can be used to process incoming email, such as allowing a weblog to accept new posts from an email (which could even have been sent from a phone).
Sending emails
The framework works by initializing any instance variables you want to be available in the email template, followed by a call to mail to deliver the email.
This can be as simple as:
class Notifier < ActionMailer::Base delivers_from<EMAIL_ADDRESS>def welcome(recipient) @recipient = recipient mail(:to => recipient, :subject => "[Signed up] Welcome #{recipient}") end end
The body of the email is created by using an Action View template (regular ERb) that has the instance variables that are declared in the mailer action.
So the corresponding body template for the method above could look like this:
Hello there, Mr. <%= @recipient %> Thank you for signing up!
And if the recipient was given as<EMAIL_ADDRESS>the email generated would look like this:
Date: Mon, 25 Jan 2010 22:48:09 +1100 From<EMAIL_ADDRESS>To<EMAIL_ADDRESS>Message-ID<EMAIL_ADDRESS>Subject: [Signed up] Welcome<EMAIL_ADDRESS>Mime-Version: 1.0 Content-Type: text/plain; charset="US-ASCII"; Content-Transfer-Encoding: 7bit Hello there, Mr<EMAIL_ADDRESS>In previous version of rails you would call create_method_name and deliver_method_name. Rails 3.0 has a much simpler interface, you simply call the method and optionally call deliver on the return value.
Calling the method returns a Mail Message object:
message = Notifier.welcome #=> Returns a Mail::Message object message.deliver #=> delivers the email
Or you can just chain the methods together like:
Notifier.welcome.deliver # Creates the email and sends it immediately
Receiving emails
To receive emails, you need to implement a public instance method called receive that takes a tmail object as its single parameter. The Action Mailer framework has a corresponding class method, which is also called receive, that accepts a raw, unprocessed email as a string, which it then turns into the tmail object and calls the receive instance method.
Example:
class Mailman < ActionMailer::Base def receive(email) page = Page.find_by_address(email.to.first) page.emails.create( :subject => email.subject, :body => email.body ) if email.has_attachments? for attachment in email.attachments page.attachments.create({ :file => attachment, :description => email.subject }) end end end end
This Mailman can be the target for Postfix or other MTAs. In Rails, you would use the runner in the trivial case like this:
./script/runner 'Mailman.receive(STDIN.read)'
However, invoking Rails in the runner for each mail to be received is very resource intensive. A single instance of Rails should be run within a daemon if it is going to be utilized to process more than just a limited number of email.
Configuration
The Base class has the full list of configuration options. Here’s an example:
ActionMailer::Base.smtp_settings = { :address => 'smtp.yourserver.com', # default: localhost :port => '25', # default: 25 :user_name => 'user', :password => 'pass', :authentication => :plain # :plain, :login or :cram_md5 }
Dependencies
Action Mailer requires that the Action Pack is either available to be required immediately or is accessible as a GEM.
Additionally, Action Mailer requires the Mail gem, github.com/mikel/mail
Bundled software
- Text::Format 0.63 by Austin Ziegler released under OpenSource Read more on www.halostatue.ca/ruby/Text__Format.html
Download
The latest version of Action Mailer can be found at
Documentation can be found at
Installation
You can install Action Mailer with the following command.
% [sudo] ruby install.rb
from its distribution directory.
License
Action Mailer is released under the MIT license.
Support
The Action Mailer homepage is www.rubyonrails.org. You can find the Action Mailer RubyForge page at rubyforge.org/projects/actionmailer. And as Jim from Rake says:
Feel free to submit commits or feature requests. If you send a patch, remember to update the corresponding unit tests. If fact, I prefer new feature to be submitted in the form of new unit tests.


--- ---
|
TGUI
v0.7-dev
|
Implicit converter for settable properties. More...
#include <ObjectConverter.hpp>
Public Member Functions | |
| ObjectConverter () | |
| Default constructor, to create an empty object. | |
| ObjectConverter (const std::shared_ptr< sf::Font > &font) | |
| Store a font object for later retrieval. More... | |
| ObjectConverter (const sf::Color &color) | |
| Store a color object for later retrieval. More... | |
| ObjectConverter (const sf::String &string) | |
| Store a string for later retrieval. More... | |
| ObjectConverter (float number) | |
| Store a number for later retrieval. More... | |
| ObjectConverter (const Borders &borders) | |
| Store a borders object for later retrieval. More... | |
| ObjectConverter (const Texture &texture) | |
| Store a texture object for later retrieval. More... | |
| const std::shared_ptr< sf::Font > & | getFont () const |
| Retrieve the saved font. More... | |
| const sf::Color & | getColor () const |
| Retrieve the saved color. More... | |
| const Borders & | getBorders () const |
| Retrieve the saved borders. More... | |
| const sf::String & | getString () const |
| Retrieve the saved string. More... | |
| float | getNumber () const |
| Retrieve the saved number. More... | |
| const Texture & | getTexture () const |
| Retrieve the saved texture. More... | |
| Type | getType () const |
| Retrieve the type of the object that has been stored. More... | |
Implicit converter for settable properties.
| tgui::ObjectConverter::ObjectConverter | ( | const std::shared_ptr< sf::Font > & | font | ) |
Store a font object for later retrieval.
| font | Font to store |
| tgui::ObjectConverter::ObjectConverter | ( | const sf::Color & | color | ) |
Store a color object for later retrieval.
| color | Color to store |
| tgui::ObjectConverter::ObjectConverter | ( | const sf::String & | string | ) |
Store a string for later retrieval.
| string | String to store |
| tgui::ObjectConverter::ObjectConverter | ( | float | number | ) |
Store a number for later retrieval.
| number | Number to store |
| tgui::ObjectConverter::ObjectConverter | ( | const Borders & | borders | ) |
Store a borders object for later retrieval.
| borders | Borders to store |
| tgui::ObjectConverter::ObjectConverter | ( | const Texture & | texture | ) |
Store a texture object for later retrieval.
| texture | Texture to store |
| const Borders& tgui::ObjectConverter::getBorders | ( | ) | const |
Retrieve the saved borders.
This function will assert when something other than a borders was saved
| const sf::Color& tgui::ObjectConverter::getColor | ( | ) | const |
Retrieve the saved color.
This function will assert when something other than a color was saved
| const std::shared_ptr<sf::Font>& tgui::ObjectConverter::getFont | ( | ) | const |
Retrieve the saved font.
This function will assert when something other than a font was saved
| float tgui::ObjectConverter::getNumber | ( | ) | const |
Retrieve the saved number.
This function will assert when something other than a number was saved
| const sf::String& tgui::ObjectConverter::getString | ( | ) | const |
Retrieve the saved string.
This function will assert when something other than a string was saved
| const Texture& tgui::ObjectConverter::getTexture | ( | ) | const |
Retrieve the saved texture.
This function will assert when something other than a texture was saved
| Type tgui::ObjectConverter::getType | ( | ) | const |
Retrieve the type of the object that has been stored.


Writing Go Applications with Reusable Logic
Oct 18, 2016Series: Writing Go Applications
Writing libraries in Go is a relatively well-covered topic, I think… but I see a lot fewer posts about writing commands. When it comes down to it, all Go code ends up in a command. So let’s talk about it! This will be the first in a series, since I ended up having a lot more to say than I realized.
Today I’m going to focus on basic project layout, with the aims of optimizing for reusability and testability.
There are three unique bits about commands that influence how I structure my code when writing a command rather than a library:
Package main
This is the only package a go program must have. However, aside from telling the go tool to produce a binary, there’s one other unique thing about package main - no one can import code from it. That means that any code you put in package main can not be used directly by another project, and that makes the OSS gods sad. Since one of the main reasons I write open source code is so that other developers may use it, this goes directly against my desires.
There have been many times when I’ve thought “I’d love to use the logic behind X Go binary as a part of my code”. If that logic is in package main, you can’t.
os.Exit
If you care about producing a binary that does what users expect, then you should care about what exit code your binary exits with. The only way to do that is to call os.Exit (or call something that calls os.Exit, like log.Fatal).
However, you can’t test a function that calls os.Exit. Why? Because calling os.Exit during a test exits the test executable. This is quite hard to figure out if you end up doing it by accident (which I know from personal experience). When running tests, no tests actually fail, the tests just exit sooner than they should, and you’re left scratching your head.
The easiest thing to do is don’t call os.Exit. Most of your code shouldn’t be calling os.Exit anyway… someone’s going to get real mad if they import your library and it randomly causes their application to terminate under some conditions.
So, only call os.Exit in exactly one place, as near to the “exterior” of your application as you can get, with minimal entry points. Speaking of which…
func main()
It’s is the one function all go commands must have. You’d think that everyone’s func main would be different, after all, everyone’s application is different, right? Well, it turns out, if you really want to make your code testable and reusable, there’s really only approximately one right answer to “what’s in your main function?”
In fact, I’ll go one step further, I think there’s only approximately one right answer to “what’s in your package main?” and that’s this:
// command main documentation here.
package main
import (
"os"
"github.com/you/proj/cli"
)
func main{
os.Exit(cli.Run())
}
That’s it. This is approximately the most minimal code you can have in a useful package main, thereby wasting no effort on code that others can’t reuse. We isolated os.Exit to a single line function that is the very exterior of our project, and effectively needs no testing.
Project Layout
Let’s get a look at the total package layout:
/home/you/src/github.com/you/proj $ tree
.
├── cli
│ ├── parse.go
│ ├── parse_test.go
│ └── run.go
├── LICENSE
├── main.go
├── README.md
└── run
├── command.go
└── command_test.go
We know what’s in main.go… and in fact, main.go is the only go file in the main package. LICENSE and README.md should be self-explanatory. (Always use a license! Otherwise many people won’t be able to use your code.)
Now we come to the two subdirectories, run and cli.
CLI
The cli package contains the command line parsing logic. This is where you define the UI for your binary. It contains flag parsing, arg parsing, help text, etc.
It also contains the code that returns the exit code to func main (which gets sent to os.Exit). Thus, you can test exit codes returned from those functions, instead of trying to test exit codes your binary as a whole produces.
Run
The run package contains the meat of the logic of your binary. You should write this package as if it were a standalone library. It should be far removed from any thoughts of CLI, flags, etc. It should take in structured data and return errors. Pretend it might get called by some other library, or a web service, or someone else’s binary. Make as few assumptions as possible about how it’ll be used, just as you would a generic library.
Now, obviously, larger projects will require more than one directory. In fact, you may want to split out your logic into a separate repo. This kind of depends on how likely you think it’ll be that people want to reuse your logic. If you think it’s highly likely, I recommend making the logic a separate directory. In my mind, a separate directory for the logic shows a stronger committment to quaity and stability than some random directory nestled deep in a repo somewhere.
Putting it together
The cli package forms a command line frontend for the logic in the run package. If someone else comes along, sees your binary, and wants to use the logic behind it for a web API, they can just import the run package and use that logic directly. Likewise, if they don’t like your CLI options, they can easily write their own CLI parser and use it as a frontend to the run package.
This is what I mean about reusable code. I never want someone to have to hack apart my code to get more use out of it. And the best way to do that is to separate the UI from the logic. This is the key part. Don’t let your UI (CLI) concepts leak into your logic. This is the best way to keep your logic generic, and your UI manageable.
Larger Projects
This layout is good for small to medium projects. There’s a single binary that is in the root of the repo, so it’s easier to go-get than if it’s under multiple subdirectories. Larger projects pretty much throw everything out the window. They may have multiple binaries, in which case they can’t all be in the root of the repo. However, such projects usually also have custom build steps and require more than just go-get (which I’ll talk about later).
More to come soon.
This is a post in the Writing Go Applications series.
Other posts in this series:
- Oct 18, 2016 - Writing Go Applications with Reusable Logic


About Me
I'm a PhD student at
Carleton University
and a security researcher in the
Carleton Internet Security Lab (CISL) research group.
I am currently being co-advised by
Dr. Anil Somayaji and
Dr. David Barrera.
You can find
my CV here.
My research interests include:
- Adaptive security
- Operating system security
- Extensible/adaptive operating systems
- Cloud native security and k8s
- eBPF
If you are interested in any of these areas or just want to chat,
feel free to reach out to me using the information at the bottom of
this page.
Teaching
Teaching Assistant
COMP4000/5102 Distributed Operating Systems (Fall 2021)
- Course description (page 6)
- Assisted the instructor with the design, development, and distrubtion of course material
- Created a custom VM image based on Alpine Linux for k8s deployments on OpenStack
- Designed experiential activities centered around a k8s deployment on OpenStack
- Taught a guest lecture on Borg, Omega, and Kubernetes
- Graded assignments and exams
Teaching Assistant
COMP3000 Operating Systems (Fall 2018 - Winter 2021)
- Course description (page 3)
- Assisted the instructor with the design, development, and distrubtion of course material
- Held weekly tutorial sessions and office hours for students
- Graded assignments and exams
- Created a Discord bot to help manage the online course during the COVID-19 pandemic
- Nominee for the "Outstanding Teaching Assistant Award" in the
2018-2019,
2019-2020, and
2020-2021 academic years
Education
Doctor of Philosophy in Computer Science (Fall 2021 - Present)
Overview
- Carleton University (School of Computer Science)
- CGPA: Coming Soon
- Thesis: Coming Soon
Course Work
Master of Computer Science (Fall 2020 - Summer 2021)
Bachelor of Computer Science, Honours (Fall 2015 - Winter 2020)
Overview
- Carleton University (School of Computer Science)
- Major CGPA: 11.0/12.0 (A)
- Graduated with high distinction
Publications
Refereed Conference Papers
Refereed Journal Papers
Miscellaneous
Software
I digitally sign my email communications using a PGP private key.
You can find my public key
here (Expires 04/02/2030).
Fingerprint:
D4DE DBD7 3399 D4D1 C752 FD85 8BF3 3FAD CF6B 5F10
You can find me using the information below.


"Got up and was able to use the best scenario for my photography techniques They have got some insane stuff for all the technical needs and more ofcourse!!! One of the best studio in town."
"The MD of the company Mr. Aravind & the CRM of the firm Mr. Parthiban are generous and they are keen in providing helping hands whenever needed. Thank You !"
"One of the most well equipped professional studio i visited in recent time.."
"Great and large ambiance."


Our services
We are currently focused on providing the best of solutions to property owners who wants to engage in short term rentals
Marketing and advertising of property
Listing on multiple platforms, taking professional photos and deploying marketing strategies to enable property rank high.
Maintenance and cleaning
Provide professional hotel standard cleaning services. We also monitor, report and maintain property appliances
Handle all guest communicatioin
We handel all guest communications from the moment a reservation to their post-stay reveiw.


Do the Untwist
问题描述 :
The twisting method uses four arrays: plaintext and ciphertext are arrays of characters, and plaincode and ciphercode are arrays of integers. All arrays are of length n, where n is the length of the message to be encrypted. Arrays are origin zero, so the elements are numbered from 0 to n – 1. For this problem all messages will contain only lowercase letters, the period, and the underscore (representing a space).
The message to be encrypted is stored in plaintext. Given a key k, the encryption method works as follows. First convert the letters in plaintext to integer codes in plaincode according to the following rule: ‘_’ = 0, ‘a’ = 1, ‘b’ = 2, …, ‘z’ = 26, and ‘.’ = 27. Next, convert each code in plaincode to an encrypted code in ciphercode according to the following formula: for all i from 0 to n – 1,
ciphercode[i] = (plaincode[ki mod n] – i) mod 28.
(Here x mod y is the positive remainder when x is divided by y. For example, 3 mod 7 = 3, 22 mod 8 = 6, and -1 mod 28 = 27. You can use the C ‘%’ operator or Pascal ‘mod’ operator to compute this as long as you add y if the result is negative.) Finally, convert the codes in ciphercode back to letters in ciphertext according to the rule listed above. The final twisted message is in ciphertext. Twisting the message cat using the key 5 yields the following:
Array 0 1 2
plaintext 'c' 'a' 't'
plaincode 3 1 20
ciphercode 3 19 27
ciphertext 'c' 's' '.'
Your task is to write a program that can untwist messages, i.e., convert the ciphertext back to the original plaintext given the key k. For example, given the key 5 and ciphertext ‘cs.’, your program must output the plaintext ‘cat’.
输入:
输出:
Note: you can assume that untwisting a message always yields a unique result. (For those of you with some knowledge of basic number theory or abstract algebra, this will be the case provided that the greatest common divisor of the key k and length n is 1, which it will be for all test cases.)
样例输入:
5 cs. 101 thqqxw.lui.qswer 3 b_ylxmhzjsys.virpbkr 0
样例输出:
cat this_is_a_secret beware._dogs_barking
解题代码:
/* @author: */ import java.util.*; /** * * @author Leo */ public class Main { /** * @param args the command line arguments */ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int key=1; String ciphertext; while(true){ key=sc.nextInt(); if(key==0) break; ciphertext=sc.next(); int [] plaincode=new int [ciphertext.length()]; int [] ciphercode=new int [ciphertext.length()]; for(int i=0;i< ciphertext.length();i++){ if(ciphertext.charAt(i)=='.') ciphercode[i]=27; else if (ciphertext.charAt(i)=='_') ciphercode[i]=0; else ciphercode[i]=ciphertext.charAt(i)-'a'+1; } for(int i=0;i< ciphertext.length();i++){ plaincode[(key*i)%ciphertext.length()]=(ciphercode[i]+i)%28; } for(int i=0;i< ciphertext.length();i++){ if(plaincode[i]==0) System.out.print('_'); else if(plaincode[i]==27) System.out.print('.'); else System.out.print((char)(plaincode[i]-1+'a')); } System.out.println(); } // TODO code application logic here } }
请问printAllCombination的时间复杂度怎么分析呢？
2的64次方是多少？ 这到底是在考什么啊
在第 18行的，while(scanf("%d %dn", &n, &c), n)，这句有错吧
值得分享！
头文件的颜色是有意设成这种灰暗色的吗？感觉看不清
不太明白DFS的方法
额，不对应吧
不好意思，写错了．应该是 path[0]=0, visited[V] = true;
方法二可行，已测试
http://blog.csdn.net/alpc_paul/article/details/33769407
想问下computeLSPArray那里，if(len!=0) len=lps[len-1]是什么意思
思考人生吗
int L[m+1][n+1];这样定义出错，这个在gcc上可以编译通过 在VS上不行 应该改为new 或者vector
哎，path[0]应该是从零开始吧，为什么是赋值1呢？


Amanitas - A. muscaria v. muscaria
My wife and I enjoy recreationally tripping, and shrooms sounded like an interesting thing to do. We ordered 60g of grade A+ Amanitas Muscarias v. Muscarias from a reliable catalog on the internet. They arrived at my house packed in zip-lock bags 7 days later.
In preparation, we ground up 30g of dried mushrooms using our coffee grinder. This turned out to be a bad idea, given that the resulting mushroom powder was not water soluble as we had expected, making the mushrooms harder to consume (more on that later). I 'eyeballed' the 30g in 8 equal parts. Everyone but the pope had urged us not to do more than 5g initially, because one can't predict the potency of the shroom harvest, nature has a way of tricking us, blah, blah, blah... So we decided to do an initial 4g each, and maybe give it another 4g booster one hour later if things weren't picking-up.
Trying to dissolve the 4g of mushroom powder in a glass of water was a bad idea. Not only did the powder not dissolve in the water, it stuck to the side of the glass making it very hard to get to (I managed to get everything by sticking my finger in the glass and licking it). My wife tried to dissolve her 4g with Coca-Cola (she hates the taste of any sort of mushrooms), which ended up being even messier than my water. Now we understand why the correct way to do it is making tea.
T+ 0:00: We both drink down our shares at approximately 11:00am. Tastes funky, but not unbareable.
T+ 0:20: We were sweating a bit at the palms, salivating a lot, and a general feeling of physical discomfort set in. We couldn't seem to find any position to sit still in.
T+ 0:30: The both of us were feeling a very mild buzz, probably the equivalent to half a bottle of wine.
T+ 0:40: My wife was in the bathroom puking her guts out. Immediately after she puked she start feeling fine again. I was doing okay, no nausea whatsoever.
T+ 1:00: I decide that I need a boost. I down another dose. My wife decides to trip sit me, and call it a day...
T+ 1:30: I'm definitely in a euphoric state. I pace up and down the living room as I've noticed that if I sit still for too long, I get extremely nauseated. Walking around is very nice and everything seems soft. Heavy synesthesia! I can smell the sounds coming from the TV. I can taste the smell of the incense burning (Jasmine, I believe).
T+ 1:50: Euphoria peaking. I can't stand the nausea and have to puke. This is not the easy puking while drunk, or too high on MDA. Puking hurts and is extremely hard to do. But, after spending two minutes retching, I'm completely fine again.
 I puke a little after taking the 1st sip. I give up on that idea and decide to sit down and watch TV.
Time loss sets in, we take a short nap (maybe 1 hour long), when we wake up, I'm completely tripping on a 'perpetual state of deja vu'. It seems that even my thoughts have already been thought. Extreme clarity and focus. I perceive infinity and impossibility as being the opposite of finite and possible. My wife notices that I'm staring mindlessly at the wall and asks, 'Are you awake?'
'I'm afraid to talk' I whisper.
'Why?'
'Because the impossible of the impossible is possible!' I'm starting to get excited again.
'No, the impossible of the impossible is even more impossible', she says, at this point completely sober and very aware that I, on the other hand, have gone completely bonkers.
'Wait, I'm going to explain it to you in 4 minutes. 4 minutes!!' I start laughing uncontrollably 'Look! Its possible! We're reaching the border. Itís coming! Look! Look! THERE!!! Did you see it? Did you? Itís gone, its possible!'
In my mind, this all made perfect sense at the time, though right now I have a hard time explaining what I was thinking or trying to point out to her. Something along the lines of ďthe infinite is the opposite of finite, which is like the flip-side of time. Everything is predictable if time is finite...' Nah! Who cares? I was REALLY tripping on the deja vu sensation.
T+ 4:30: I'm slowly starting to come down. We go grocery shopping and I walk behind the grocery cart like a happy zombie walking on cotton-paved alleys. I'm sorta grumpy. So is my wife. I canít decide on my mood. Itís confusingÖ
T+ 6:00: My sense of smell is still very acute. Everything else seems normal. No traces of confusion. Iím not grumpy or happy. Just back to my old normal self.
Closing Thoughts:
It was an interesting 1st timer, but if I do amanita mushrooms again it is going to be MORE than the initial 7.5g. That was a bad idea. I should have done 10g at least to get started. The problem is that once I puke, there is no chance of getting a second dose. Either I get the dosage right the first time, or I'm screwed.
My wife says she'll never do shrooms again. At 3.75g the buzz was as mild as half a bottle of wine, but she wouldn't have puked from wine.
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.


All ABOUT SPENSER SPUCK
Biography
I
Education
CodeFellows- March 2021- October 2021
Job Experiance
Harbor Greens September 2020- March 2021
Goals


acct - switch process accounting on or off
#include <unistd.h>
int acct(const char *filename);
Feature Test Macro Requirements for glibc (see feature_test_macros(7)):
acct():
Since glibc 2.21:
_DEFAULT_SOURCE
In glibc 2.19 and 2.20:
_DEFAULT_SOURCE || (_XOPEN_SOURCE && _XOPEN_SOURCE < 500)
Up to and including glibc 2.19:
_BSD_SOURCE || (_XOPEN_SOURCE && _XOPEN_SOURCE < 500)
The acct() system call enables or disables process accounting. If called
with the name of an existing file as its argument, accounting is turned on,
and records for each terminating process are appended to filename as it
terminates. An argument of NULL causes accounting to be turned off.
On success, zero is returned. On error, -1 is returned, and errno is set
appropriately.
- EACCES
- Write permission is denied for the specified file, or search permission is
denied for one of the directories in the path prefix of filename
(see also path_resolution(7)), or filename is not a regular
file.
- EFAULT
- filename points outside your accessible address space.
- EIO
- Error writing to the file filename.
- EISDIR
- filename is a directory.
- ELOOP
- Too many symbolic links were encountered in resolving
filename.
- ENAMETOOLONG
- filename was too long.
- ENFILE
- The system-wide limit on the total number of open files has been
reached.
- ENOENT
- The specified file does not exist.
- ENOMEM
- Out of memory.
- ENOSYS
- BSD process accounting has not been enabled when the operating system
kernel was compiled. The kernel configuration parameter controlling this
feature is CONFIG_BSD_PROCESS_ACCT.
- ENOTDIR
- A component used as a directory in filename is not in fact a
directory.
- EPERM
- The calling process has insufficient privilege to enable process
accounting. On Linux, the CAP_SYS_PACCT capability is
required.
- EROFS
- filename refers to a file on a read-only filesystem.
- EUSERS
- There are no more free file structures or we ran out of memory.
SVr4, 4.3BSD (but not POSIX).
No accounting is produced for programs running when a system crash occurs. In
particular, nonterminating processes are never accounted for.
The structure of the records written to the accounting file is
described in acct(5).
This page is part of release 5.05 of the Linux man-pages project. A
description of the project, information about reporting bugs, and the latest
version of this page, can be found at https://www.kernel.org/doc/man-pages/.


ppmhist(1) ppmhist(1) NAME ppmhist - print a histogram of a portable pixmap SYNOPSIS ppmhist [-hexcolor] [-noheader] [-map] [-nomap] [-sort={frequency,rgb}] [ppmfile] DESCRIPTION Reads a PPM image as input. Generates a histogram of the colors in the image, i.e. a list of all the colors and how many pixels of each color are in the image. OPTIONS -sort={frequency,rgb} The -sort option determines the order in which the colors are listed in the output. frequency means to list them in order of how pixels in the input image have the color, with the most repre‐ sented colors first. rgb means to sort them first by the inten‐ sity of the red component of the color, the of the green, then of the blue, with the least intense first. The default is frequency. -hexcolor Print the color components in hexadecimal. Default is decimal. -noheader Do not print the column headings. -map Generates a PPM file of the colormap for the image, with the color histogram as comments. -nomap Generates the histogram for human reading. This is the default. SEE ALSO ppm(5), pgmhist(1), ppmtomap(1), pnmhistmap(1), ppmchange(1) AUTHOR Copyright (C) 1989 by Jef Poskanzer. 17 September 2000 ppmhist(1)


[1] “/Users/paulo.barenco/Box/repos/sauron/docs/documentation_files”
Here we give a deep understanting of the functions and parameters being used in the workflow.
You can safely ignore these lines in case you are using the pipeline on a single computer.
The first lines provides a convenient way to run the workflow using the SLURM queueing system on a High Performance Computing environment.
#! /bin/bash -l
#SBATCH -A projID
#SBATCH -p core
#SBATCH -n 8
#SBATCH -J Proj
#SBATCH -t 10:00:00
#SBATCH --mail-user<EMAIL_ADDRESS>#SBATCH --mail-type=END
You can safely ignore these lines.
The following lines allows the pipeline to find the main project folder (i.e. where the run_workflow.sh is located).
The first will dictate where your data and scripts are. Because of this feature, one can simply define the path to your project as $main
. The second will load the script to initiallize the Sauron.v1 conda environment with all necessary packages for the analysis. If you don’t already have the environment, it will create it for you.
main="$( cd "$( dirname "${BASH_SOURCE[0]}" )" >/dev/null 2>&1 && pwd )"
source $main/initialize.sh 2>&1 | tee $main/log/'initialize_log.txt'
In these lines you can define global parameters to be user across your analysis. They should either come from the metadata file for each dataset you will provide (see below), or from the pipeline itself (see below).
These names are essentially column names in your metadata inside the Seurat Object.
By default in the Quality Control step (see below), several metrics are autmatically put into the seurat object, and those can be used for plotting here. Some of them are: nCounts_RNA
, nFeature_RNA
, percent_rps
, percent_rpl
, percent_ribo
, S.Score
, G2M.Score
.
var_to_plot='VARIABLE_COLUMNS_FROM_METADATA_TABLE,percent_mito,percent_ribo'
var_to_regress='nFeature_RNA,percent_mito,S.Score,G2M.Score'
Rscript $script_path/00_load_data.R \
--input_path $main/'data' \
--dataset_metadata_path $main/'data/metadata.csv' \
--assay 'RNA' \
--output_path $main/'analysis/1_qc' \
2>&1 | tee $main/log/'00_load_data_log.txt'
input_path
The PATH to the FOLDER containing your datasets (as folders). Each folder inside this PATH is a dataset.
dataset_metadata_path
The PATH to the metadata FILE for each library (The first column should be named SampleID)
assay
The ASSAY slot in the Seurat object to load the data. Default is “RNA”. You can add any name that describes the type of data in that assay: “CITE”, “ATAC”, “PROTEIN”, etc.
output_path
The PATH to the FOLDER to output your Seurat object.
To load datasets, first place them in the data
folder: create a folder for each individual dataset, and within each folder, place your dataset (see figure below). This allows a well organized rawdata folder for the analysis.
Besides the rawdata, you can add a metadata .csv
file, which can contain information about each specific dataset. Each line is a dataset. Each column is a metadata variable. All those values will be parsed to the Seurat object on the loading.
The loading function will also automatically take care of finding the union of all genes across datasets and adding zeros where the genes are not expressed.
 They will be treated as factors variables (not continuous).
species_use
Species from the sample for cell cycle scoring.
remove_non_coding
Removes all non-coding and pseudogenes from the data. Default is ‘True’.
plot_gene_family
Gene families to calculate and add to the metadata, comma separated. You can place them as patterns of genes or gene families. Some examples are: “RPS” (ribosomal), “RPL” (ribosomal), “MT-” (mitocondria). Upper and Lower case are ignored. Default is “Rps,Rpl,mt-,Hb”.
remove_gene_family
Gene families to remove from the count matrix after QC, comma separated. They should start with the pattern.Upper and Lower case are ignored. Default is “mt-”.
min_gene_count
Minimun number of cells needed to consider a gene as expressed. Default is 5.
min_gene_per_cell
Minimun number of genes in a cell needed to consider a cell as good quality. Default is 200.
assay
The ASSAY slot in the Seurat object to load the data. Default is “RNA”. You can add any name that describes the type of data in that assay: “CITE”, “ATAC”, “PROTEIN”, etc.
output_path
The PATH to the FOLDER to output your Seurat object.
Rscript $script_path/02_integrate.R \
--Seurat_object_path $main/'analysis/1_qc/filt_seurat_object.rds' \
--columns_metadata $var_to_plot \
--regress $var_to_regress \
--var_genes 'seurat' \
--integration_method 'mnn,sample_id' \
--cluster_use 'NONE' \
--assay 'RNA' \
--output_path $main/'analysis/2_clustering' \
2>&1 | tee $main/log/'02_integrate_log.txt'
Seurat_object_path
The PATH to the Seurat Object containing your datasets and metadata.
columns_metadata
The COLUMN NAMES of the metadata matrix to load into the objects. They will be treated as factors variables (not continuous).
regress
Variables of the metadata to be regressed out using GLM.
var_genes
Whether use ‘Seurat’ or the ‘Scran’ method for variable genes identification. An additional value can be placed after a comma to define the level of dispersion wanted for variable gene selection. ‘Seurat,2’ will use the threshold 2 for gene dispersions. Defult is ‘Seurat,1.5’. For Scran, the user should inpup the level of biological variance ‘Scran,0.2’. An additional blocking parameter (a column from the metadata) can ba supplied to ‘Scran’ method block variation comming from uninteresting factors, which can be parsed as ‘Scran,0.2,Batch’.
integration_method
Integration method to be used. ‘CCA’, MNN’, ‘Scale’ and ‘Combat’ are available at the moment. The batches (column names in the metadata matrix) to be removed should be provided as arguments comma separated. E.g.: ‘Combat,sampling_day’. For MNN, an additional integer parameter is supplied as the k-nearest neighbour.
cluster_use
The cluster to be used for analysis parsed as “METADATA_COLUMN_NAME,factor1,factor2”. This is usefull if you want to subset your data and perform this step in only part of the dataset (a cell cluster, or a particular metadata parameter). Example: “SNN.0.4,1,2,3,4”, will get clusters 1-4 from the the metadata column “SNN.0.4”.
assay
The ASSAY slot in the Seurat object to load the data. Default is “RNA”. You can add any name that describes the type of data in that assay: “CITE”, “ATAC”, “PROTEIN”, etc.
output_path
The PATH to the FOLDER to output your Seurat object.


PROVE(1) Perl Programmers Reference Guide PROVE(1) NAME prove - Run tests through a TAP harness. USAGE prove [options] [files or directories] OPTIONS Boolean options: -v, --verbose Print all test lines. -l, --lib Add 'lib' to the path for your tests (-Ilib). -b, --blib Add 'blib/lib' and 'blib/arch' to the path for your tests -s, --shuffle Run the tests in random order. -c, --color Colored test output (default). --nocolor Do not color test output. --count Show the X/Y test count when not verbose (default) --nocount Disable the X/Y test count. -D --dry Dry run. Show test that would have run. --ext Set the extension for tests (default '.t') -f, --failures Show failed tests. -o, --comments Show comments. --ignore-exit Ignore exit status from test scripts. -m, --merge Merge test scripts' STDERR with their STDOUT. -r, --recurse Recursively descend into directories. --reverse Run the tests in reverse order. -q, --quiet Suppress some test output while running tests. -Q, --QUIET Only print summary results. -p, --parse Show full list of TAP parse errors, if any. --directives Only show results with TODO or SKIP directives. --timer Print elapsed time after each test. --trap Trap Ctrl-C and print summary on interrupt. --normalize Normalize TAP output in verbose output -T Enable tainting checks. -t Enable tainting warnings. -W Enable fatal warnings. -w Enable warnings. -h, --help Display this help -?, Display this help -H, --man Longer manpage for prove --norc Don't process default .proverc Options that take arguments: -I Library paths to include. -P Load plugin (searches App::Prove::Plugin::*.) -M Load a module. -e, --exec Interpreter to run the tests ('' for compiled tests.) --harness Define test harness to use. See TAP::Harness. --formatter Result formatter to use. See FORMATTERS. --source Load and/or configure a SourceHandler. See SOURCE HANDLERS. -a, --archive out.tgz Store the resulting TAP in an archive file. -j, --jobs N Run N test jobs in parallel (try 9.) --state=opts Control prove's persistent state. --rc=rcfile Process options from rcfile NOTES .proverc If ~/.proverc or ./.proverc exist they will be read and any options they contain processed before the command line options. Options in .proverc are specified in the same way as command line options: # .proverc --state=hot,fast,save -j9 Additional option files may be specified with the "--rc" option. Default option file processing is disabled by the "--norc" option. Under Windows and VMS the option file is named _proverc rather than .proverc and is sought only in the current directory. Reading from "STDIN" If you have a list of tests (or URLs, or anything else you want to test) in a file, you can add them to your tests by using a '-': prove - < my_list_of_things_to_test.txt See the "README" in the "examples" directory of this distribution. Default Test Directory If no files or directories are supplied, "prove" looks for all files matching the pattern "t/*.t". Colored Test Output Colored test output is the default, but if output is not to a terminal, color is disabled. You can override this by adding the "--color" switch. Color support requires Term::ANSIColor on Unix-like platforms and Win32::Console windows. If the necessary module is not installed colored output will not be available. Exit Code If the tests fail "prove" will exit with non-zero status. Arguments to Tests It is possible to supply arguments to tests. To do so separate them from prove's own arguments with the arisdottle, '::'. For example prove -v t/mytest.t :: --url http://example.com would run t/mytest.t with the options '--url http://example.com'. When running multiple tests they will each receive the same arguments. "--exec" Normally you can just pass a list of Perl tests and the harness will know how to execute them. However, if your tests are not written in Perl or if you want all tests invoked exactly the same way, use the "-e", or "--exec" switch: prove --exec '/usr/bin/ruby -w' t/ prove --exec '/usr/bin/perl -Tw -mstrict -Ilib' t/ prove --exec '/path/to/my/customer/exec' "--merge" If you need to make sure your diagnostics are displayed in the correct order relative to test results you can use the "--merge" option to merge the test scripts' STDERR into their STDOUT. This guarantees that STDOUT (where the test results appear) and STDOUT (where the diagnostics appear) will stay in sync. The harness will display any diagnostics your tests emit on STDERR. Caveat: this is a bit of a kludge. In particular note that if anything that appears on STDERR looks like a test result the test harness will get confused. Use this option only if you understand the consequences and can live with the risk. "--trap" The "--trap" option will attempt to trap SIGINT (Ctrl-C) during a test run and display the test summary even if the run is interrupted "--state" You can ask "prove" to remember the state of previous test runs and select and/or order the tests to be run based on that saved state. The "--state" switch requires an argument which must be a comma separated list of one or more of the following options. "last" Run the same tests as the last time the state was saved. This makes it possible, for example, to recreate the ordering of a shuffled test. # Run all tests in random order $ prove -b --state=save --shuffle # Run them again in the same order $ prove -b --state=last "failed" Run only the tests that failed on the last run. # Run all tests $ prove -b --state=save # Run failures $ prove -b --state=failed If you also specify the "save" option newly passing tests will be excluded from subsequent runs. # Repeat until no more failures $ prove -b --state=failed,save "passed" Run only the passed tests from last time. Useful to make sure that no new problems have been introduced. "all" Run all tests in normal order. Multple options may be specified, so to run all tests with the failures from last time first: $ prove -b --state=failed,all,save "hot" Run the tests that most recently failed first. The last failure time of each test is stored. The "hot" option causes tests to be run in most-recent- failure order. $ prove -b --state=hot,save Tests that have never failed will not be selected. To run all tests with the most recently failed first use $ prove -b --state=hot,all,save This combination of options may also be specified thus $ prove -b --state=adrian "todo" Run any tests with todos. "slow" Run the tests in slowest to fastest order. This is useful in conjunction with the "-j" parallel testing switch to ensure that your slowest tests start running first. $ prove -b --state=slow -j9 "fast" Run test tests in fastest to slowest order. "new" Run the tests in newest to oldest order based on the modification times of the test scripts. "old" Run the tests in oldest to newest order. "fresh" Run those test scripts that have been modified since the last test run. "save" Save the state on exit. The state is stored in a file called .prove (_prove on Windows and VMS) in the current directory. The "--state" switch may be used more than once. $ prove -b --state=hot --state=all,save @INC prove introduces a separation between "options passed to the perl which runs prove" and "options passed to the perl which runs tests"; this distinction is by design. Thus the perl which is running a test starts with the default @INC. Additional library directories can be added via the "PERL5LIB" environment variable, via -Ifoo in "PERL5OPT" or via the "-Ilib" option to prove. Taint Mode Normally when a Perl program is run in taint mode the contents of the "PERL5LIB" environment variable do not appear in @INC. Because "PERL5LIB" is often used during testing to add build directories to @INC prove passes the names of any directories found in "PERL5LIB" as -I switches. The net effect of this is that "PERL5LIB" is honoured even when prove is run in taint mode. FORMATTERS You can load a custom TAP::Parser::Formatter: prove --formatter MyFormatter SOURCE HANDLERS You can load custom TAP::Parser::SourceHandlers, to change the way the parser interprets particular sources of TAP. prove --source MyHandler --source YetAnother t If you want to provide config to the source you can use: prove --source MyCustom \ --source Perl --perl-option 'foo=bar baz' --perl-option avg=0.278 \ --source File --file-option extensions=.txt --file-option extensions=.tmp t --source pgTAP --pgtap-option pset=format=html --pgtap-option pset=border=2 Each "--$source-option" option must specify a key/value pair separated by an "=". If an option can take multiple values, just specify it multiple times, as with the "extensions=" examples above. If the option should be a hash reference, specify the value as a second pair separated by a "=", as in the "pset=" examples above (escape "=" with a backslash). All "--sources" are combined into a hash, and passed to "new" in TAP::Harness's "sources" parameter. See TAP::Parser::IteratorFactory for more details on how configuration is passed to SourceHandlers. PLUGINS Plugins can be loaded using the "-Pplugin" syntax, eg: prove -PMyPlugin This will search for a module named "App::Prove::Plugin::MyPlugin", or failing that, "MyPlugin". If the plugin can't be found, "prove" will complain & exit. You can pass arguments to your plugin by appending "=arg1,arg2,etc" to the plugin name: prove -PMyPlugin=fou,du,fafa Please check individual plugin documentation for more details. Available Plugins For an up-to-date list of plugins available, please check CPAN: <http://search.cpan.org/search?query=App%3A%3AProve+Plugin> Writing Plugins Please see "PLUGINS" in App::Prove. perl v5.14.2 2014-09-30 PROVE(1)


This is a paragraph.
This is another paragraph.
This is a line break
"br" tag element has no end tag.


| callbacks {xgboost} | R Documentation |
These are used to perform various service tasks either during boosting iterations or at the end. This approach helps to modularize many of such tasks without bloating the main training methods, and it offers .
By default, a callback function is run after each boosting iteration.
An R-attribute is_pre_iteration
could be set for a callback to define a pre-iteration function.
When a callback function has finalize
parameter, its finalizer part will also be run after
the boosting is completed.
WARNING: side-effects!!! Be aware that these callback functions access and modify things in the environment from which they are called from, which is a fairly uncommon thing to do in R.
To write a custom callback closure, make sure you first understand the main concepts about R environments.
Check either R documentation on environment
or the
Environments chapter from the "Advanced R"
book by Hadley Wickham. Further, the best option is to read the code of some of the existing callbacks -
choose ones that do something similar to what you want to achieve. Also, you would need to get familiar
with the objects available inside of the xgb.train
and xgb.cv
internal environments.
cb.print.evaluation
,
cb.evaluation.log
,
cb.reset.parameters
,
cb.early.stop
,
cb.save.model
,
cb.cv.predict
,
xgb.train
,
xgb.cv


Quote: Posted 03/09/05 23:23:55 (GMT) -- tsjaab
Hey guys,
A question:
Does Blindfight work with ranged attacks?
Edited By syrath1001 on 03/26/05 16:34
Ahhh that is good news indeed. I just know that it used to not work but I guess it will work with the next update. That's perfect since one of my characters has blindfight and uses a bow.


| GEOS SDK TechDocs
|
| Memory Management
| 2 The Structure of Memory
Some systems make each application maintain and manage its own memory. In a multitasking system, this is not only difficult and time-consuming but also potentially dangerous, as applications can easily start trashing memory used by other processes. GEOS protects and relieves applications by providing comprehensive memory management.
The GEOS memory management system is designed to meet rigorous demands. Some of the requirements are
-
Independence of memory location
Ideally, an application should not have to keep track of the address of each of its data items; rather, the memory management system should allow the application to reference its memory virtually.
-
Hardware independence
Applications are much easier to write and maintain if they can ignore hardware specifics. An application should be able to specify its memory requirements in generic terms ("I need a package this big which behaves in this way") and let the memory manager worry about where it comes from.
-
Efficient use of memory
A good operating system should be able to rearrange memory in order to gather as much space as possible. It should also be able to discard certain data or copy it to mass-storage devices (like a hard disk) if more memory is needed.
-
Management of Shared Data
Applications should be able to share common data or code. In a multitasking system, proper synchronization of shared resources is essential to maintain data integrity.
The GEOS memory manager meets all of these needs. Applications often take advantage of the memory manager without trying; for example, the memory manager swaps methods into memory when messages need to be handled. Applications can also request memory at run-time, either by requesting raw memory from the memory manager, or by creating Virtual Memory files through the VM library (see the VM chapter).
| GEOS SDK TechDocs
|
| Memory Management
| 2 The Structure of Memory


The flat water sail down the NW coast of Mauritius to Port Louis is a welcome relief after the endless swells of the Indian Ocean.
Entrance into Port Louis is straight forward and well marked.There are 2 harbours here; the southern one is the main port and it is where yachts enter. (photo provided by SY Flow Nov. 2013).
Position 020° 08' 49"S, 57° 28'54" E (harbour entrance)
This is the main harbour and the only official port of entry and exit for Mauritius. One must clear in here before visiting any other anchorage.
On arrival at the outer markers, call "Port Louis Port Control" on channel 16. They will probably ask you to switch to channel 14. If you do not request permission to enter the port, you may be intercepted by the coast guard in one of their orange speedboats.
The port is open during daylight hours; arrivals after 18:00 may not be acknowledged by radio. It is acceptable to anchor clear of the entrance until morning.
On obtaining permission to enter, proceed to the Customs and Immigration dock (020° 09.6' S, 057° 30.0' E). This is poorly marked and is located in an old grey building, next to an old windmill (also grey) on the port side right at the end of the main channel. There is only a small dock in front of the building with a sign saying Customs, but it is possible to tie up alongside the concrete quay wall immediately to the south.
Take care to avoid the rocky shallow area to the starboard of the direct line to the Customs Station. It is now marked with a small yellow buoy.
The skipper will need to visit the Customs House and tell the officer at the Coast Guard/NCG Harbour Security desk that you just arrived and want to clear-in. Ask him to call the Immigration, Customs, and Health departments. Return to the yacht and wait for the officials to visit. Nobodyelse should leave the yacht until the Quarantine Officer has been completed his inspection.
Customs, Immigration and Coast Guard formalities are all completed in the same building or they may visit the boat. Formalities can take over an hour as various officials will need to be called. Be prepared to fill in the 13 forms required by Customs. Be sure to keep the Certificate of Clearance and Yacht Declaration forms safe as they are likely to be checked by the Coast Guard while you are in Mauritius waters.
Occasionally they will board the yacht for inspection.
Guns and spearguns must be declared and surrendered to Customs until departure.
Be sure to get a copy of your clearance papers because it may be required by coast guard boarding parties if you visit other ports in Mauritius.
Once formalities are completed you are free to move over to La Marina inside the Caudan waterfront development.
Clearing out
This is best done early in the morning. Be sure to report accurately where you are moored as the Coast Guard patrol daily and note all foreign vessels in each sector.
Yachts must officially clear out even if leaving for Rodrigues or Saint Brandon as well as for a foreign port.
First visit Coast Guard Harbour Security and inform them you are leaving. They can notify Immigration and Customs, or you can make the necessary appointments yourself (for before 10am). Once all the paperwork has been done, make a second visit to Coast Guard Harbour Security for them to update their ledger.
Last updated August 2016.
Yachts may proceed to the marina after clearing and tie at any available spot. Tying on the outside wall is permitted however this is rather exposed and uncomfortable from passing wake. The marina quay is concrete, with a nasty overhang, so an abundance of fenders are needed and a fender board. Rafting is permitted.
If planning on leaving your boat here for any length of time, it is advisable to take great care with how your fenders are situated to prevent damage from the tidal movement and harsh concrete docks. Fenders are often stolen here, so be sure to secure each fender with a lock (bicycle lock). It may also be preferable to have a boat you know raft alongside for the duration of your absence. Locals can be employed as guardinage (see General Services).
 Easterly winds usually keep this out of the marina however expect your waterline and lines to suffer.
If westerly swells are present the quay becomes untenable and yachts should move elsewhere, commonly into the Caudan Basin. This is used as a cyclone shelter and visiting yachts may go into the basin and tie for free wherever there is room. Proceed with caution as there are shallow areas and numerous unmarked wrecks there.
It is advisable to lock your boat at all times here.
There is a fuel dock in the commercial port and a dry dock that undertakes some repair work, however marine supplies are extremely limited.
Last updated September 2015.


SETTINGS
OPENi
My profile
Let apps access my profile such as name, picture and other account information.
My online wallet accounts
Let apps use my online wallet accounts
My device unique identifiers
Let apps use my device unique identifiers (MAC, IP, UDID, UUID, Advertising ID).
My contact information
Let apps access my contacts information.
My media
Let apps use my media.
Webcam & Microphone
Let apps use my Webcam and Microphone.
Social Activity
Let apps access information about my social activity.
Product & Services
Let apps use my services and product information.
Health Factors & Condition
Let apps access my health profile information
My locations


India pacers wreck Bangladesh on pink-ball debut
KOLKATA, India, India's three-pronged pace attack wreaked havoc with the pink ball to reduce Bangladesh to 73 for six in the first session on day one of the second and final test on Friday.
The heavily-lacquered ball dominated the bat after Bangladesh captain Mominul Haque elected to bat in the first day-night test for both the teams at Kolkata's Eden Gardens.
Mominul was soon left to rue the decision as the tourists, beaten inside three days in the series opener in Indore, looked clueless against India's quality attack.
To make it worse for them, Liton Das, who made 24, retired hurt after being hit in the helmet by a short Mohammed Shami delivery.
Nayeem Hasan and Abu Jayed, both yet to open their account, will return after the break to try and help the tourists past the 100-mark.
Ishant Sharma dismissed Imrul Kayes for four to earn the breakthrough and Umesh Yadav struck twice immediately after a change of ends to rattle the tourists.
Rohit Sharma took a diving, one-handed catch to send back Mominul, while Mohammad Mithun inside-edged an Umesh delivery onto the stumps.
Mushfiqur Rahim became the third top-order batsman to fall for a duck, bowled out by Shami.
Opener Shadman Islam hit five boundaries in his 29 before becoming Umesh's third victim. Wriddhiman Saha took a stunning low catch to send back Mahmudullah for six.
India need only a draw to record their 12th successive home series victory.
Read also
Read More
India's Kohli hopes day-night Test is 'one-off'
"This can be a one-off thing. It should not in my opinion become a regular scenario, the entertainment of Test cricket lies in the fact that the batsman is trying to survive a session and the bowler trying to set a batsman out," Kohli said at Eden Gardens.
Read More
Australia storm back as Pakistan wickets clatter
At tea, Pakistan were 125 for five, with Asad Shafiq not out on 18 and wicketkeeper Mohammad Rizwan alongside him on 19.


kotcity4
/
kotcity.pathfinding
/
north
north
val
north
:
BlockCoordinate
Direction of travel of node in found paths.


I am Rafael, has currently 10+ years experienced in programming and designing software products. I'm specialized in mobile applications iOS and Android