text:
(function() {
    'use strict';

    var RecordGoose = require('../shared/models/Record');

    /**
     * Return a full game record if gameId is provided
     * Return list of recent records if no gameId is provided
     * @param req
     * @param res
     */
    module.exports = function(req, res) {

        RecordGoose.findById(req.params.gameId, {_id:1, time:1, turns:1, users:1, cards:1}, res.apiOut);

    };

}());

redpajama_set_name: RedPajamaGithub


Bestowed with "DNA Sir J.J. Architecture Award'18" by Sir J.J. College of Architecture.
Awarded ''Lifetime Achievement Award 2017'' by WB honours.
Recipient of the "India's Top Architects Award – 2008", by Construction World Magazine.
Recipient of the "India's Top Architects Award – 2007", by Construction World Magazine.
Raitech a Hi-tech I. T. Park Project of about 5.1 million sq. ft. coming up at Sonipat, Haryana was won by the firm, amongst National & International competitions.
Won Design competition for Bank of Baroda Commercial / Data Center project, at BKC, Mumbai.
Won Design competition for Air Force Museum by Airport Authority of India (AAI), New Delhi in June 2007, placed second.
Society Interior's award for "Interior Architecture - 2006"
International Award of Architectural Practice – 2004 from Actualidad, Spain, received at Athens.
First Prize and Project Award - 400 Bed G.T. Hospital Complex, Mumbai.
Won Design competition for Padmashri Dr. Vithalrao Vikhe Patil Technical Complex Project at Ahmednagar. The project comprised of Engineering College, Polytechnic, Provision for I.T.I., English Medium School and Administrative Blocks comprising of Administrative Offices, Hostels, Library, Auditorium, Residential Complex, Student's centre, Sports complex etc for 4,500 students.
First Prize and Project Award - Planetarium Complex for Municipal Corporation of Bangalore.
Commendation Prize for Design of T.V. Centre at Calcutta.
First Prize and Project Award - Commercial Complex for Municipal Corporation of Bangalore.
"Bharat Gaurav, 1996" Award for Economic Growth & National Integration, from Industrial Economic Forum, New Delhi.
"Architect of the Year, 1996" Award from Accommodation Times, Mumbai.


text:
Office-account
This Unusual Bird Superpower Goes Back to the Dinosaur Extinction
'For All Mankind' patches depict space history changes in Apple TV+ series' season 2
Coasts drown as coral reefs collapse under warming and acidification — ScienceDaily
Rocket Report: Billionaire backs Scottish spaceport, Relativity bags a bundle
New study shows how 'our' RNA stably binds to artificial nucleic acids — ScienceDaily
Scammers stole millions last Christmas. These six tips could keep you safe online this time around
China turns on nuclear-powered 'artificial sun'
FINEOS Corporation Lands Outstanding Achievement in International Growth Award at the Technology Ireland Industry Awards 2020
Got $10,000? These 3 Growth Stocks Could Turbocharge Your Financial Future
Blackcurrants are favorable for glucose metabolism — ScienceDaily
Global Hospital Information System Markets to 2025: Widespread Adoption of Cloud-Based Systems is Providing a Market Boost – Press Release
[email protected]_84 December 4, 2020
Dublin, Dec. 04, 2020 (GLOBE NEWSWIRE) — The "Hospital Information System Market: Global Industry Trends, Share, Size, Growth, Opportunity and Forecast 2020-2025" report has been added to ResearchAndMarkets.com's offering.
The global hospital information system market grew at a CAGR of around 12% during 2014-2019. Looking forward, the global hospital information system market to continue its strong growth during the next five years.
The hospital information system (HIS) refers to a digitally integrated information management system that is designed to manage healthcare data. It aids in minimizing the chances of errors by using tools, such as electronic medical records (EMR), computerized physicians order entry, laboratory information systems, pharmacy information systems and radiology information systems.
This replaces the paperwork, such as patient's health history, prescriptions, doctor's notes and dictations, with electronically preserved data. HIS also offers enhanced operational efficiencies and data management capabilities through data analytics, collaborative care, cost management and patient
adoptionBoostcloudbasedGlobalhospitalInformationMarketMarketsPressProvidingReleaseSystemSystemswidespread
Norepinephrine release to cells is diminished, causing cascade of effects — ScienceDaily
In a new paper, researchers from The University of Texas Health Science Center at San Antonio (UT Health San Antonio) report brain chemistry that may contribute to why drinkers have difficulty paying attention while under the influence.
The work is funded by generous support from the Robert J. Kleberg, Jr. and Helen C. Kleberg Foundation and by grants from the National Institute on Alcohol Abuse and Alcoholism and the National Institute of Mental Health. Findings were published Dec. 2 in Nature Communications.
"When we want to focus on something, or when we stand up from a chair and become active, a brain stem nucleus releases a chemical called norepinephrine. Acute exposure to alcohol inhibits this signal in the brain," said senior author Martin Paukert, MD, assistant professor of cellular and integrative physiology at UT Health San Antonio. When attention is needed for a task, norepinephrine is secreted by a brain
cascadeCausingcellsdiminishedeffectsNorepinephrineReleaseScienceDaily
Astronomers to release most accurate data ever for nearly two billion stars — ScienceDaily
On 3 December an international team of astronomers will announce the most detailed ever catalogue of the stars in a huge swathe of our Milky Way galaxy. The measurements of stellar positions, movement, brightness and colours are in the third early data release from the European Space Agency's Gaia space observatory and will be publicly available. Initial findings include the first optical measurement of the acceleration of the Solar system. The data set, and early scientific discoveries, will be presented at a special briefing hosted by the Royal Astronomical Society.
Launched in 2013, Gaia operates in an orbit around the so-called Lagrange 2 (L2) point, located 1.5 million kilometres behind the Earth in the direction away from the Sun. At L2 the gravitational forces between the Earth and Sun are balanced, so the spacecraft stays in a stable position, allowing long-term essentially unobstructed views of the sky.
The primary objective
accurateAstronomersBillionDataReleaseScienceDailyStars
Samsung produces a new interactive Hologram display, WIMI MR Head Mounted Display accelerates the deployment of 5G communication services – Press Release
HONG KONG, Dec. 03, 2020 (GLOBE NEWSWIRE) — Tailor Insight, the fintech market research organization, recently released a research report "Samsung produces a new interactive Hologram display, WIMI MR Head Mounted Display accelerates the deployment of 5G communication services". Samsung has made a breakthrough in Hologram Display. Samsung's scientists have invented an interactive, thin-panel Hologram display that can increase the viewing angle of 3D video by 30 times. Scientists have proposed an ultra-thin interactive Hologram display screen that can provide high-resolution, highly realistic 3D videos from multiple angles. It can be integrated into mobile devices in the future to support office or home applications.
The reason why this display screen is treated as revolutionary is that the existing Hologram display screen can only produce high-definition 3D images when it was viewed from the front. However, Samsung's latest Hologram display screen can see high-definition 3D images from 30 viewing angles, which
AcceleratescommunicationDeploymentdisplayHologramInteractivemountedPressproducesReleaseSamsungServicesWIMI
FingerMotion and China Mobile Financial Technology Co., Ltd. Sign Strategic Cooperation Agreement for Loyalty Program Business – Press Release
NEW YORK, NY / ACCESSWIRE / December 2, 2020 / FingerMotion, Inc. (OTCQB:FNGR), a mobile data and services company, is pleased to announce that its contractually controlled subsidiary, Shanghai JiuGe Information Technology Co., Ltd., and China Mobile Financial Technology Co., Ltd., a subsidiary of China Mobile, have signed a strategic cooperation agreement to explore and create a new forward-leaning business model that combines the traditional loyalty point redemption business with an e-commerce platform designed to create a higher evolution of brand loyalty.
From the beginning of 2020, Shanghai JiuGe Information Technology Co., Ltd. has actively sought cooperation with China Mobile Financial Technology Co., Ltd., given China Mobile's years of experience in the financial services industry. Currently, of China Mobile's estimated 900 million subscribers, only an estimated 600 million currently participate and accumulate points within the loyalty reward program, often referred to as "Points Mall", meaning there is still plenty of
agreementBusinessChinacooperationFinancialFingerMotionLoyaltyMobilePressProgramReleasesignstrategictechnology
ShootProof Names John Parks as Chief Information Officer – Press Release
ATLANTA–(Business Wire)–ShootProof, a leading global provider of online gallery software and related services for professional and semi-professional photographers, today announced the appointment of John Parks as its Chief Information Officer. With three decades of information technology experience, Parks brings deep expertise in IT strategy, product development, infrastructure services, technology assessment, and program implementation.
ShootProof announces hiring of John Parks, Chief Information Officer. (Photo: Business Wire)
"I'm thrilled to join a team that has such a laser focus on empowering photographers to build successful, sustainable businesses," said Parks. "I look forward to guiding the product and engineering teams at this key moment when ShootProof is investing in innovation that leverages consumer engagement with professional photographers."
In addition to his core skills in Product Development, Parks also has a strong background in security and compliance and understands how to implement pragmatic
ChiefInformationJohnNamesOfficerparksPressReleaseShootProof
UVD Robots Receives Prestigious Emerging Technology Award from American Society for Mechanical Engineers – Press Release
ODENSE, Denmark–(Business Wire)–Today, UVD Robots, an autonomous disinfecting robot equipped with UV-C light, announced it has been selected to receive the prestigious Emerging Technology Award from the American Society for Mechanical Engineers (ASME) in the field of robotics. While traditionally the award honors ascending technologies that are poised to transform their fields and the innovators behind them, according to ASME, the 2020 awards recognize innovations that are not only changing industries but also supporting society during COVID-19. Winners were celebrated in an ASME video announcement.
Founded originally in 2014 to solve the problem of hospital-acquired infections (HAI), UVD Robots' mobile, fully autonomous robot has played an important role in the fight against COVID-19. (Photo: Business Wire)
According to Carlos M. González, Special Projects Manager, Media & Content with ASME, "COVID-19 has shown us how important clean and sterile
AmericanAwardEmergingengineersmechanicalPressPrestigiousReceivesReleaserobotssocietytechnologyUVD
Blackstone Announces Agreement to Acquire DCI, a Pioneer in Technology-driven, Quantitative Credit Investing – Press Release
[email protected]_84 November 30, 2020
NEW YORK–(Business Wire)–Blackstone (NYSE:BX) today announced that it has agreed to acquire DCI, a pioneer in quantitative credit investing with approximately $7.5 billion in AUM across the global investment grade, high yield and emerging corporate credit markets. The firm, based in San Francisco, applies a proprietary, fundamental-based, technology-driven model to deliver differentiated returns to clients. DCI is led by a team of seasoned professionals who are recognized experts in quantitative and systematic fixed income research.
DCI will become part of Blackstone Credit, a global leader in private lending, syndicated leveraged loans and collateralized loan obligations. The transaction will broaden Blackstone Credit's capabilities in high yield and investment grade, enable the integration of DCI's models and technology across the combined Blackstone Credit and DCI platforms and increase access to investors via a UCITs platform. DCI's investment process will benefit from Blackstone's resources, scale and deep relationships across global financial markets.
AcquireagreementannouncesBlackstoneCreditDCIInvestingpioneerPressquantitativeReleaseTechnologyDriven
Juniper Research: Mobile Money Users in Emerging Markets to Exceed 1.2 Billion Globally by 2025, as P2P and Merchant Payments Surge – Press Release
BASINGSTOKE, England–(Business Wire)–A new study from Juniper Research has found that the total number of mobile money users in emerging markets will exceed 1.2 billion in 2025, up from 980 million in 2020; equating to just under 30% of all mobile phone users across emerging markets.
The report predicts that domestic P2P and payments to merchants will be increasingly popular in mobile money schemes and will drive growth. The research recommends that mobile money providers agree partnerships with banks and other financial institutions, so as to increase the sophistication of the products they offer, in order to take advantage of increasing financial and technological literacy.
For more insights, download the free whitepaper: Mobile Money – Unlocking Emerging Market Opportunities.
Payments-as-a-Platform – Driving Future Opportunities
The new research, Mobile Money in Emerging Markets: SWOT Analysis, Vendor Strategies & Market Forecasts 2020-2025, identified that the payments-as-a-platform model, where mobile money payments act
BillionEmergingExceedgloballyJuniperMarketsMerchantMobileMoneyP2PPaymentsPressReleaseResearchSurgeUsers
United States Department of Defense Information Technology Report 2020-2025: Industry Convergence Propels the Industry – Press Release
Dublin, Nov. 30, 2020 (GLOBE NEWSWIRE) — The "Industry Convergence Propels US Department of Defense Information Technology, 2020-2025" report has been added to ResearchAndMarkets.com's offering.
This research service focuses on the US Department of Defense (DoD) information technology (IT) budget requests and representative contracts. Analyses of research, development, test, and evaluation (RDT&E); procurement; operations and maintenance (O&M); and a variety of other services are also presented in this study. Contract activity for the 2019 calendar year is also included.
The DoD IT 2021 budget request consists of the Army, Navy/Marine Corps, Air Force, and joint service spending plans (all of which are included). The base year for financial spending is 2019, and the market forecast is from 2020 to 2025.
IT spending for the fiscal year 2021 DoD budget request is the foundation of this research. The 2021 DoD request may encounter opposition from both sides of the political aisle.
ConvergenceDefenseDepartmentIndustryInformationPressPropelsReleaseReportStatestechnologyUnited
Amazon Analysis announces Apple Big Black Business camera China COVID19 Data Deals digital Election Emerging Facebook Forecast Friday Future Gaming Global Google Growth Industry iPhone Key Latest Launch Market million news Report Research science ScienceDaily size Smartphone Space Study tech Technologies technology Top trends Trump

redpajama_set_name: RedPajamaCommonCrawl


text:
Home / Features / Videos / Algae Bio-materials
Algae Bio-materials
Maartje Dros and Eric Klarenbeek harvest algae in Camargue, in the South of France. Researching new values for local wetlands as incubators for locally grown bio-materials, their algae lab project explores the potential of growing micro- and macroalgae locally. These algae are then mixed with biopolymers that can replace non-biodegradable, fossil oil-based plastics and simultaneously absorb carbon dioxide emissions. Currently, the bio-laboratory is working on a series of objects related to the region's culture and history.
Copyright ©2010-2019 AlgaeIndustryMagazine.com. All rights reserved. Permission required to reprint this article in its entirety. Must include copyright statement and live hyperlinks. Contact editorial@algaeindustrymagazine.com. A.I.M. accepts unsolicited manuscripts for consideration, and takes no responsibility for the validity of claims made in submitted editorial.
Cécile Barbière writes for Euractive.fr (translated by Rob Kirby) that, in large greenhouses formerly home to the tomatoes and cucumbers of the market gardening Groupe Ol...
Alexander Richter writes in thinkgeoenergy.com that Israel-based Algaennovation last week signed a 15-year contract with Icelandic energy utility and operator ON Power fo...
Milenio.com reports that BiomiTech, a Mexican company, won a prestigious innovation award for its air purification system at the Contamination Expo Series 2018 held in Bi...
Researchers at Los Alamos National Laboratory and partner institutions have provided the first published report of algae using raw plants as a carbon energy source. The r...
Israeli-based Algatechnologies, Ltd. (Algatech), is teaming up with the Italian R&D company, Sphera Encapsulation S.r.l (Sphera), to develop innovative functional ingredi...
French researchers have been exploring the potential of algae for boosting the immune systems of animals and reducing the use of antibiotics in livestock farming. Past st...
E.A. Crunden writes in thinkprogress.org that Florida's first gubernatorial debate was dominated by environmental and climate issues, with an emphasis on the state's alga...
Hayley Dunning writes from the Imperial College of London that a new discovery has changed our understanding of the basic mechanism of photosynthesis and should rewrite t...
Filed under Videos · Tagged with Algae Bio-materials


text:
// .NAME vtkIncrementalOctreePointLocator - Incremental octree in support
//  of both point location and point insertion.
//
// .SECTION Description
//  As opposed to the uniform bin-based search structure (adopted in class
//  vtkPointLocator) with a fixed spatial resolution, an octree mechanism
//  employs a hierarchy of tree-like sub-division of the 3D data domain. Thus
//  it enables data-aware multi-resolution and accordingly accelerated point
//  location as well as insertion, particularly when handling a radically
//  imbalanced layout of points as not uncommon in datasets defined on
//  adaptive meshes. Compared to a static point locator supporting pure
//  location functionalities through some search structure established from
//  a fixed set of points, an incremental point locator allows for, in addition,
//  point insertion capabilities, with the search structure maintaining a
//  dynamically increasing number of points.
//  Class vtkIncrementalOctreePointLocator is an octree-based accelerated
//  implementation of the functionalities of the uniform bin-based incremental
//  point locator vtkPointLocator. For point location, an octree is built by
//  accessing a vtkDataSet, specifically a vtkPointSet. For point insertion,
//  an empty octree is inited and then incrementally populated as points are
//  inserted. Three increasingly complex point insertion modes, i.e., direct
//  check-free insertion, zero tolerance insertion, and non-zero tolerance
//  insertion, are supported. In fact, the octree used in the point location
//  mode is actually constructed via direct check-free point insertion. This
//  class also provides a polygonal representation of the octree boundary.
//
// .SECTION See Also
//  vtkAbstractPointLocator, vtkIncrementalPointLocator, vtkPointLocator,
//  vtkMergePoints

#ifndef vtkIncrementalOctreePointLocator_h
#define vtkIncrementalOctreePointLocator_h

#include "vtkCommonDataModelModule.h" // For export macro
#include "vtkIncrementalPointLocator.h"

class vtkPoints;
class vtkIdList;
class vtkPolyData;
class vtkCellArray;
class vtkIncrementalOctreeNode;

class VTKCOMMONDATAMODEL_EXPORT vtkIncrementalOctreePointLocator : public vtkIncrementalPointLocator
{
public:

  vtkTypeMacro( vtkIncrementalOctreePointLocator, vtkIncrementalPointLocator );
  void PrintSelf( ostream & os, vtkIndent indent );

  static vtkIncrementalOctreePointLocator * New();

  // Description:
  // Set/Get the maximum number of points that a leaf node may maintain.
  // Note that the actual number of points maintained by a leaf node might
  // exceed this threshold if there is a large number (equal to or greater
  // than the threshold) of exactly duplicate points (with zero distance)
  // to be inserted (e.g., to construct an octree for subsequent point
  // location) in extreme cases. Respecting this threshold in such scenarios
  // would cause endless node sub-division. Thus this threshold is broken, but
  // only in case of such situations.
  vtkSetClampMacro( MaxPointsPerLeaf, int, 16, 256 );
  vtkGetMacro( MaxPointsPerLeaf, int );

  // Description:
  // Set/Get whether the search octree is built as a cubic shape or not.
  vtkSetMacro( BuildCubicOctree, int );
  vtkGetMacro( BuildCubicOctree, int );
  vtkBooleanMacro( BuildCubicOctree, int );

  // Description:
  // Get access to the vtkPoints object in which point coordinates are stored
  // for either point location or point insertion.
  vtkGetObjectMacro( LocatorPoints, vtkPoints );

  // Description:
  // Delete the octree search structure.
  virtual void Initialize() { this->FreeSearchStructure(); }

  // Description:
  // Delete the octree search structure.
  virtual void FreeSearchStructure();

  // Description:
  // Get the spatial bounding box of the octree.
  virtual void GetBounds( double * bounds );

  // Description:
  // Get the spatial bounding box of the octree.
  virtual double * GetBounds()
    { this->GetBounds( this->Bounds );  return this->Bounds; }

  // Description:
  // Get the number of points maintained by the octree.
  int GetNumberOfPoints();

  // Description:
  // Given a point x assumed to be covered by the octree, return the index of
  // the closest in-octree point regardless of the associated minimum squared
  // distance relative to the squared insertion-tolerance distance. This method
  // is used when performing incremental point insertion. Note -1 indicates that
  // no point is found. InitPointInsertion() should have been called in advance.
  virtual vtkIdType FindClosestInsertedPoint( const double x[3] );

  // Description:
  // Create a polygonal representation of the octree boundary (from the root
  // node to a specified level).
  virtual void GenerateRepresentation( int nodeLevel, vtkPolyData * polysData );

  // -------------------------------------------------------------------------
  // ---------------------------- Point  Location ----------------------------
  // -------------------------------------------------------------------------

  // Description:
  // Load points from a dataset to construct an octree for point location.
  // This function resorts to InitPointInsertion() to fulfill some of the work.
  virtual void BuildLocator();

  // Description:
  // Given a point x, return the id of the closest point. BuildLocator() should
  // have been called prior to this function. This method is thread safe if
  // BuildLocator() is directly or indirectly called from a single thread first.
  virtual vtkIdType FindClosestPoint( const double x[3] );

  // Description:
  // Given a point (x, y, z), return the id of the closest point. Note that
  // BuildLocator() should have been called prior to this function. This method
  // is thread safe if BuildLocator() is directly or indirectly called from a
  // single thread first.
  virtual vtkIdType FindClosestPoint( double x, double y, double z );

  // Description:
  // Given a point x, return the id of the closest point and the associated
  // minimum squared distance (via miniDist2). Note BuildLocator() should have
  // been called prior to this function. This method is thread safe if
  // BuildLocator() is directly or indirectly called from a single thread first.
  virtual vtkIdType FindClosestPoint( const double x[3], double * miniDist2 );

  // Description:
  // Given a point (x, y, z), return the id of the closest point and the
  // associated minimum squared distance (via miniDist2). BuildLocator() should
  // have been called prior to this function. This method is thread safe if
  // BuildLocator() is directly or indirectly called from a single thread first.
  virtual vtkIdType FindClosestPoint( double x, double y, double z, double * miniDist2 );

  // Description:
  // Given a point x and a radius, return the id of the closest point within
  // the radius and the associated minimum squared distance (via dist2, this
  // returned distance is valid only if the point id is not -1). Note that
  // BuildLocator() should have been called prior to this function. This method
  // is thread safe if BuildLocator() is directly or indirectly called from a
  // single thread first.
  virtual vtkIdType FindClosestPointWithinRadius
    ( double radius, const double x[3], double & dist2 );

  // Description:
  // Given a point x and a squared radius radius2, return the id of the closest
  // point within the radius and the associated minimum squared distance (via
  // dist2, note this returned distance is valid only if the point id is not
  // -1). BuildLocator() should have been called prior to this function.This
  // method is thread safe if BuildLocator() is directly or indirectly called
  // from a single thread first.
  vtkIdType FindClosestPointWithinSquaredRadius
    ( double radius2, const double x[3], double & dist2 );

  // Description:
  // Find all points within a radius R relative to a given point x. The returned
  // point ids (stored in result) are not sorted in any way. BuildLocator() should
  // have been called prior to this function. This method is thread safe if
  // BuildLocator() is directly or indirectly called from a single thread first.
  virtual void FindPointsWithinRadius
    ( double R, const double x[3], vtkIdList * result );

  // Description:
  // Find all points within a squared radius R2 relative to a given point x. The
  // returned point ids (stored in result) are not sorted in any way. BuildLocator()
  // should have been called prior to this function. This method is thread safe if
  // BuildLocator() is directly or indirectly called from a single thread first.
  void FindPointsWithinSquaredRadius
    ( double R2, const double x[3], vtkIdList * result );

  // Description:
  // Find the closest N points to a given point. The returned point ids (via
  // result) are sorted from closest to farthest. BuildLocator() should have
  // been called prior to this function. This method is thread safe if
  // BuildLocator() is directly or indirectly called from a single thread first.
  virtual void FindClosestNPoints
    ( int N, const double x[3], vtkIdList * result );

  // -------------------------------------------------------------------------
  // ---------------------------- Point Insertion ----------------------------
  // -------------------------------------------------------------------------

  // Description:
  // Initialize the point insertion process. points is an object, storing 3D
  // point coordinates, to which incremental point insertion put coordinates.
  // It is created and provided by an external VTK class. Argument bounds
  // represents the spatial bounding box, into which the points fall. In fact,
  // an adjusted version of the bounding box is used to build the octree to
  // make sure no any point (to be inserted) falls outside the octree. This
  // function is not thread safe.
  virtual int InitPointInsertion( vtkPoints * points, const double bounds[6] );

  // Description:
  // Initialize the point insertion process. points is an object, storing 3D
  // point coordinates, to which incremental point insertion put coordinates.
  // It is created and provided by an external VTK class. Argument bounds
  // represents the spatial bounding box, into which the points fall. In fact,
  // an adjusted version of the bounding box is used to build the octree to
  // make sure no any point (to be inserted) falls outside the octree. Argument
  // estSize specifies the initial estimated size of the vtkPoints object. This
  // function is not thread safe.
  virtual int InitPointInsertion( vtkPoints * points, const double bounds[6],
                                  vtkIdType estSize );

  // Description:
  // Determine whether or not a given point has been inserted into the octree.
  // Return the id of the already inserted point if true, otherwise return -1.
  // InitPointInsertion() should have been called in advance.
  virtual vtkIdType IsInsertedPoint( const double x[3] );

  // Description:
  // Determine whether or not a given point has been inserted into the octree.
  // Return the id of the already inserted point if true, otherwise return -1.
  // InitPointInsertion() should have been called in advance.
  virtual vtkIdType IsInsertedPoint( double x, double  y, double z );

  // Description:
  // Insert a point to the octree unless there has been a duplciate point.
  // Whether the point is actually inserted (return 1) or not (return 0 upon a
  // rejection by an existing duplicate), the index of the point (either new
  // or the duplicate) is returned via pntId. Note that InitPointInsertion()
  // should have been called prior to this function. vtkPoints::InsertNextPoint()
  // is invoked. This method is not thread safe.
  virtual int InsertUniquePoint( const double point[3], vtkIdType & pntId );

  // Description:
  // Insert a given point into the octree with a specified point index ptId.
  // InitPointInsertion() should have been called prior to this function. In
  // addition, IsInsertedPoint() should have been called in advance to ensure
  // that the given point has not been inserted unless point duplication is
  // allowed (Note that in this case, this function involves a repeated leaf
  // container location). vtkPoints::InsertPoint() is invoked.
  virtual void InsertPoint( vtkIdType ptId, const double x[3] );

  // Description:
  // Insert a given point into the octree and return the point index. Note that
  // InitPointInsertion() should have been called prior to this function. In
  // addition, IsInsertedPoint() should have been called in advance to ensure
  // that the given point has not been inserted unless point duplication is
  // allowed (in this case, this function invovles a repeated leaf container
  // location). vtkPoints::InsertNextPoint() is invoked.
  virtual vtkIdType InsertNextPoint( const double x[3] );

  // Description:
  // "Insert" a point to the octree without any checking. Argument insert means
  // whether vtkPoints::InsertNextPoint() upon 1 is called or the point itself
  // is not inserted to the vtkPoints at all but instead only the point index is
  // inserted to a vtkIdList upon 0. For case 0, the point index needs to be
  // specified via pntId. For case 1, the actual point index is returned via
  // pntId. InitPointInsertion() should have been called.
  void InsertPointWithoutChecking
    ( const double point[3], vtkIdType  & pntId, int insert );

//BTX
protected:

  vtkIncrementalOctreePointLocator();
  virtual ~vtkIncrementalOctreePointLocator();

private:

  int         BuildCubicOctree;
  int         MaxPointsPerLeaf;
  double      InsertTolerance2;
  double      OctreeMaxDimSize;
  double      FudgeFactor;
  vtkPoints * LocatorPoints;
  vtkIncrementalOctreeNode * OctreeRootNode;

  // Description:
  // Delete all descendants of a node.
  static void DeleteAllDescendants( vtkIncrementalOctreeNode * node );

  // Description:
  // Add the polygonal representation of a given node to the allocated vtkPoints
  // and vtkCellArray objects.
  static void AddPolys( vtkIncrementalOctreeNode * node,
                        vtkPoints * points, vtkCellArray * polygs );

  // Description:
  // Given a point and a reference node, find the leaf containing the point.
  // Note the point is assumed to be inside or under the reference node.
  vtkIncrementalOctreeNode * GetLeafContainer( vtkIncrementalOctreeNode * node,
    const double pnt[3] );

  // Description:
  // Given a point (under check, either inside or outside the octree) and a leaf
  // node (not necessarily the container of this point), find the closest point
  // (possibly a duplicate of the point under check) within the node and return
  // the point index as well as the associated minimum squared distance (via dist2).
  // InitPointInsertion() or BuildLocator() should have been called.
  vtkIdType FindClosestPointInLeafNode( vtkIncrementalOctreeNode * leafNode,
                                        const double point[3], double * dist2 );

  // Description:
  // This function may not be directly called. Please use the follwing two ones:
  // FindClosestPointInSphereWithTolerance() for point insertion and
  // FindClosestPointInSphereWithoutTolerance() for point location. Arguments
  // refDist2 and the initialization of minDist2 determine which version is used.
  // Given a point (under check) and an already-checked node (possibly NULL),
  // find the closest point across a set of neighboring nodes within a specified
  // squared radius to the given point --- to perform an extended within-radius
  // inter-node search. The leaf (mask) node itself is excluded from the search
  // scope. Returned are the point index and the associated minimum squared
  // distance. InitPointInsertion() or BuildLocator() should have been called.
  vtkIdType FindClosestPointInSphere
    ( const double point[3], double radius2, vtkIncrementalOctreeNode * maskNode,
      double * minDist2, const double * refDist2 );

  // -------------------------------------------------------------------------
  // ---------------------------- Point  Location ----------------------------
  // -------------------------------------------------------------------------

  // Description:
  // This function is intended for point location, excluding point insertion.
  // Given a point (under check, covered or uncovered by the octree) and an
  // already-checked leaf node (maskNode, possibly NULL), find the closest point
  // across a set of neighboring nodes within a specified squared radius to the
  // given point --- to perform an extended within-radius inter-node search. The
  // leaf (mask) node itself is excluded from the search scope. Returned are the
  // point index and the associated minimum squared distance (via minDist2). Note
  // that BuildLocator() should have been called.
  vtkIdType FindClosestPointInSphereWithoutTolerance( const double point[3],
    double radius2, vtkIncrementalOctreeNode * maskNode, double * minDist2 );

  // Description:
  // Find all points, inside a given node, within a squared radius relative to
  // a given point. Returned are the associated un-sorted point indices (idList).
  // Note that BuildLocator() should have been called prior to this function.
  void FindPointsWithinSquaredRadius( vtkIncrementalOctreeNode * node,
    double radius2, const double point[3], vtkIdList * idList );

  // -------------------------------------------------------------------------
  // ---------------------------- Point Insertion ----------------------------
  // -------------------------------------------------------------------------

  // Description:
  // This function is intended for point insertion, excluding point location.
  // Given a point (under check for insertion, must be covered by the octree)
  // and an already-checked node (maskNode, the container leaf node, possibly
  // NULL if no any node has been checked), find the closest point across a set
  // of neighbor nodes within a specified squared radius radius2 to the given
  // point --- to perform an extended within-radius inter-node search. The leaf
  // (mask) node itself is excluded from the search scope. Returned are the point
  // index and the associated minimum squared distance (via minDist2). Note that
  // InitPointInsertion() should have been called.
  vtkIdType FindClosestPointInSphereWithTolerance( const double point[3],
    double radius2, vtkIncrementalOctreeNode * maskNode, double * minDist2 );

  // Description:
  // Determine whether or not a given point has been inserted into the octree.
  // Return the id of the already inserted point if true, otherwise return -1.
  // Argument leafContainer is useful for access only if -1 is returned. This
  // returned parameter indicates the leaf node that contains the given point.
  // This function resorts to IsInsertedPointForZeroTolerance() for zero
  // tolerance insertion or IsInsertedPointForNonZeroTolerance() for non-zero
  // tolerance insertion. InitPointInsertion() should have been called.
  vtkIdType IsInsertedPoint( const double x[3],
                             vtkIncrementalOctreeNode ** leafContainer );

  // Description:
  // Determine whether or not a given point has been inserted into the octree.
  // Return the id of the already inserted point if true, otherwise return -1.
  // Argument leafContainer is useful for access only if -1 is returned. This
  // returned parameter indicates the leaf node that contains the given point.
  // This variant is invoked by IsInsertedPoint(x, vtkIncrementalOctreeNode **)
  // for zero tolerance insertion. InitPointInsertion() should have been called.
  vtkIdType IsInsertedPointForZeroTolerance
    ( const double x[3], vtkIncrementalOctreeNode ** leafContainer );

  // Description:
  // Determine whether or not a given point has been inserted into the octree.
  // Return the id of the already inserted point if true, otherwise return -1.
  // Argument leafContainer is useful for access only if -1 is returned. This
  // returned parameter indicates the leaf node that contains the given point.
  // This variant is invoked by IsInsertedPoint(x, vtkIncrementalOctreeNode **)
  // for non-zero tolerance insertion. InitPointInsertion() should have been
  // called in advance.
  vtkIdType IsInsertedPointForNonZeroTolerance
    ( const double x[3], vtkIncrementalOctreeNode ** leafContainer );

  // Description:
  // Given a point (under check for zero tolerance insertion) and a leaf node,
  // find its duplicate, if any, in the node and return the point index (-1 if
  // no duplicate is found). Note that the leaf node, already with at least one
  // point, is the container of the point under check. InitPointInsertion()
  // should have been called.
  vtkIdType FindDuplicatePointInLeafNode( vtkIncrementalOctreeNode * leafNode,
                                          const double point[3] );

  // Description:
  // Given a point (under check for zero tolerance insertion) and a leaf node,
  // find its duplicate, if any, in the node and return the point index (-1 if
  // no duplicate is found). Note that the leaf node, already with at least one
  // point, is the container of the point under check. This function is invoked
  // for type VTK_FLOAT. InitPointInsertion() should have been called.
  vtkIdType FindDuplicateFloatTypePointInVisitedLeafNode
    ( vtkIncrementalOctreeNode * leafNode, const double point[3] );

  // Description:
  // Given a point (under check for zero tolerance insertion) and a leaf node,
  // find its duplicate, if any, in the node and return the point index (-1 if
  // no duplicate is found). Note that the leaf node, already with at least one
  // point, is the container of the point under check. This function is invoked
  // for type VTK_DOUBLE. InitPointInsertion() should have been called.
  vtkIdType FindDuplicateDoubleTypePointInVisitedLeafNode
    ( vtkIncrementalOctreeNode * leafNode, const double point[3] );

  vtkIncrementalOctreePointLocator
    ( const vtkIncrementalOctreePointLocator & ); // Not implemented
  void operator = ( const vtkIncrementalOctreePointLocator & );// Not implemented
//ETX
};
#endif


text:
«Преступный синдикат» (, другое название «Гангстеры») — американский биографический криминальный драматический кинофильм 1991 года.

Сюжет
Художественное повествование в киноленте охватывает временной период первой трети XX века и рассматривает судьбу банды нью-йоркских гангстеров под предводительством  на этапе формирования, становления и расцвета. В 1920-е годы на американской преступной сцене правили бал две могущественных итальянских группировки  и  враждовавших между собой. В ходе этой уличной войны, вошедшей в историю под именем кастелламарской, Лучиано и его друзья, чтобы выжить, должны были выбрать одну из сторон. Но по совету нью-йоркского бизнесмена  они занимают отстранённую позицию и затевают игру, цель которой — смерть обоих глав преступных организаций…

Создатели фильма

В ролях

Съёмочная группа
 Режиссёр: Майкл Карбельникофф
 Сценарий: Майкл Махерн, Николас Казан
 Продюсер: Стивен Дж. Рот
 Исполнительный продюсер: С. О. Эриксон
 Оператор: Лайош Кольтаи
 Художник-постановщик: Ричард Силберт
 Композитор: Майкл Смолл
 Монтаж: Джо Д'Аугустине, Скотт Смит
 Костюмы: Эллен Мирожник

Награды и номинации

Примечания

Ссылки

 Рецензия и критика фильма Роджера Эберта

Фильмы-драмы США
Гангстерские фильмы
Фильмы о мафии
Фильмы США 1991 года

redpajama_set_name: RedPajamaWikipedia


text:
Q: is it possible, to get a renderd HTML page as graphic My customer has a nice (meal-) menu for his restaurant in internet; he also manages his dayly and weekly specials with a small application via internet, entering only name of food (description) and price.
Now he wants to print his pages to a (paper) menu card. but how he (I) tried, the printout is always poor, because the html page was not designed for printing. Graphics (eg. backgrounds) are not printed, shifted, on one extra page and so on.
So my idea was to get the page as graphic and print it - after small corrections - via a graphics programm.
Is that possible, or are there ways to control printout better, than the stadard printig engines of browsers?
He wants a WYSIWYG and not "what you get is what the browser thinks you want to see"
other ideas are welcome

A: Have you tried wkhtmltoimage ? http://wkhtmltopdf.org/

redpajama_set_name: RedPajamaStackExchange


is coming to tomorrow's car.
This has been our mission ever since we first invented Phantom. And today we've done it again. Devialet brings its technologies to SYMBIOZ, Groupe Renault's latest demo car, through three major breakthroughs.
Every risk we've taken and every record we've broken with Phantom expresses our absolute ambition: to deliver the emotion of sound to the widest audience possible. By defying the limits of sound reproduction and size efficiency, we were able to bring you concert-level emotion, live in your living room.
As we enter the era of autonomous vehicles, entertainment will take a front seat. And your car will become the new living room: a theatre for beautifully immersive audiovisual experiences. That's why we've joined forces with Groupe Renault, one of the world's leading car manufacturers, to imagine the audio experience in the car of tomorrow with the revolutionary technologies of Phantom.
When Renault told us about their vision for the future of automotive, we were proud and excited to rise to a new challenge: to take the Devialet experience into the car of tomorrow and magnify the automotive journey through sound.
Designed and built for SYMBIOZ, an electric, autonomous and connected demo car illustrating Groupe Renault's vision for the future of mobility, this pioneering system allows us to achieve our dream of furthering audio innovation. By bringing our expertise and technologies to new territories.
A radical new challenge. Three major breakthroughs.
Car-making is characterized by tight size, volume and weight constraints. This required rethinking the sound architecture from A-Z. Three major breakthroughs enabled us to reduce overall audio system size and speaker number while delivering the Devialet implosive sound experience.
First we miniaturized Phantom. To reduce necessary air volume to 6x less than traditional systems.
In-door speakers and the subwoofer are replaced by miniaturized Phantom. Thanks to our unique size reduction technology, this new architecture reduces the necessary acoustic load of each module: to only 1L. That's six times less than traditional systems.
Then we invented the Diffusors. To deliver ultra-immersive sound with fewer speakers.
Placed in empty spaces or embedded in AC and de-icing pipes, the 'Diffusors' transform the car's passive parts into a network of virtual speakers. Connected to the modules, they produce an outstandingly wide soundstage. As the audio industry races to add more and more speakers to vehicles, we've chosen the opposite route, achieving unthinkably immersive sound with greater acoustic efficiency.
Lastly we used our spatial rendering technology. To bring concert-level emotion on the road.
Built into the central unit, our spatial rendering technology channels each sound to the correct speaker, according to its type or frequency. Direct sounds such as voices are sent to each module's front full-range speakers, while background or ambient sounds are directed to the Diffusors for unrivalled spatialization. So you can experience concert-level emotion, on the road.
Combined with Devialet's patented signal processing technology, this revolutionary architecture redefines the automotive journey.
Devialet's audio system for Groupe Renault SYMBIOZ demo car is currently being presented to the press as part of the Demo vehicle test drives.


text:
Carl Hilty, né le  à Grabs et mort le  à Clarens, est un philosophe, écrivain, historien et une personnalité politique suisse

Biographie
Après avoir suivi ses études à Coire, Göttingen et Heidelberg où il obtient un doctorat de droit en 1854, il devient avocat avant de se consacrer à l'histoire de Suisse et à la philosophie. Nommé comme professeur de droit constitutionnel à l'Université de Berne en 1874, il édite, dès 1886 le . En 1890, il est élu au Conseil national où il siège jusqu'à sa mort.

Publications
Parmi ses nombreuses publications, on trouve  en 1868 et Les Constitutions fédérales de la Confédération suisse, originellement paru en 1891, puis réédité en 1991 et Le bonheur paru en 1891 et réédité en 1897 et 1901.

Références et sources

Liens externes

Écrivain suisse d'expression allemande
Historien suisse
Philosophe suisse
Conseiller national suisse
Personnalité grisonne
Naissance en février 1833
Naissance à Grabs
Décès en octobre 1909
Décès dans le canton de Vaud
Décès à 76 ans


Located in Aldergrove, a thriving community with a distinctly unique heritage downtown core.Brand new 4 bedroom unit. This townhome is Located close to Aldergrove downtown,in a Roundhouse complex, a thriving community with a unique heritage downtown core. It fully embraces the urban lifestyle while complimenting the authentic rural setting. This unit has nine foot classic ceilings on the main floor and easy-care light coloured laminate hardwood flooring throughout the open living plan. There's also a dining room, powder on the main, plus a fill-size pantry. It has 3 bedrooms upstairs and 1 Bedroom with a full washroom below. Also comes with a Double Car Garage.Call to book a showing today.


III. It aids in alleviating headache, insomnia, and hypertension. It also reduces anger.
By the practice of this mudra, all Vayu, that is,air-related affections, like Arthritis, Gout, Sciatica, Knee pain, and Gas are relieved. It especially benefits in neck pain and spinal pain.
The tip of the middle finger is put at the base of the thumb and the thumb comes over the finger with a slight pressure of the thumb being exerted on the finger. The other 3 fingers are kept straight.
III. In insomnia, doing this hand posture, along with Gyan Mudra, helps in bringing on sleep.
¿Por qué decidí dar a luz sin anestesia?
It was the sensation of noticing my breath during the delivery of my daughter that I became aware of how my body will be changed forever. As she was lifted from my belly and they were cleaning her up, I noticed my breathing becoming more challenging.


DHub app facilitates the end user to select from wide collection of displayed discounts or offers or promotions that are available within his/her city. At same time benefits the retailer being introduced to new customer base. Users could walk-in to the outlet to feel the product before making the purchase at a discount which would be competitive with E-commerce pricing User is informed on Dhub about the possible listed discounts available for his/her product in the city.
Business Retailers doing business in major cities of Andhra Pradesh can have a major boost in their regular sales by using DHub app. Retailers can advertise on DHub app for a better market reach at a slim budget. Promotions of retailers on DHub app shall not only showcase the discounts but provide the location awareness along with contact details for the benefit of end user.
DHub(Discount Hub) is a platform to showcase the discounts, offers or promotions of any business in a city. User can select a wide collection of displayed discounts or offers or promotions that are available within their city, they can go for a physical purchase at a discounted price. So user can purchase and receive the product at a discounted price within the city on same day. DHub app is initiated with a strategy to reach user with multiple discounts and offers in major cities of Andhra Pradesh such as Guntur, Vijayawada, Visakhapatnam, Kakinada, Tirupati, Kadapa, Kurnool, Rajahmundry, Nellore, Anantapur & Ongole.
DHub app is a newly developed mobile application from Vivo Professional Services Pvt Ltd (VIVO). VIVO is a software development firm with an expertise team spearheading the development of Mobile applications in Android & IOS platforms and also in Web development services. DHub with a reasonable term "Discount Hub" as an app is meant to showcase the discounts, offers or promotions of any business in a city to the knowledge of the end user. DHub app with an operational plan to offer services in major cities of Andhra Pradesh such as Guntur, Vijayawada, Visakhapatnam, Kakinada, Tirupati, Kadapa, Kurnool, Rajahmundry, Nellore, Anantapur & Ongole. Operations of DHub app in these targeted cities can bring major market change to end users that search for discounted products on online portals or mobile apps.
User Accounts: In order to use most aspects of the Services, you must register for and maintain an active personal user Services account ("Account"). You must be at least 18 years of age, or the age of legal majority in your jurisdiction (if different than 18), to obtain an Account. Account registration requires you to submit to discount hub or D-Hub certain personal information, such as your name, address, mobile phone number, as well as at least one valid payment method (either a credit card or accepted payment partner) at the time of making payment. You agree to maintain accurate, complete, and up-to- date information in your Account. Your failure to maintain accurate, complete, and up-to- date Account information, including having an invalid or expired payment method on file, may result in your inability to access and use the Services or DHub's termination of these Terms with you. You are responsible for all activity that occurs under your Account, and you agree to maintain the security and secrecy of your Account username and password at all times. Unless otherwise permitted by D-Hub in writing, you may only possess one Account.
Territory: The Website or mobile application and the Services and any purchase are directed solely at those who access the Website from the Republic of India. Discount hub or D-Hub makes no representation that Service (or any goods or services) are available or otherwise suitable for use outside the Republic of India. If you choose to access the Website or mobile application (or use the Service or make a purchase) from locations outside the Republic of India, you do so on your own initiative and are responsible for the consequences thereof.
Website and/or Mobile Application: Discount hub provides an interactive online service owned and operated by Vivo Professional Services Pvt Ltd through the Website on the World Wide Web of the Internet (the "Web" or "Internet") and its mobile application, consisting of information services, content and transaction capabilities provided by Vivo Professional Services Pvt Ltd, its holding company and its associates, if any, with whom it has business relationships ("Business Associates") including but not limited to third parties that provide services in relation to creation, production or distribution of content for the Website or mobile application ("Third Party Content Providers"), third parties that provide advertising services to D-Hub ("Third Party Advertisers") and third parties that perform function on behalf of D-Hub like sending out and distributing our administrative and promotional emails and text messages ("Third Party Service Providers").
Right to Transfer: The right to use this Website or mobile application is personal to the User and is not transferable to any other person or entity. The User shall be responsible for protecting the confidentiality of User's password(s), if any. User understands and acknowledges that, although the Internet is often a secure environment, sometimes there are interruptions in service or events that are beyond the control of D-Hub, and D-Hub shall not be responsible for any data lost while transmitting information on the Internet.
Not on Uninterrupted Basis: While it is D-Hub's objective to make the Website or mobile application accessible at all times, the Website or mobile application may be unavailable from time to time for any reason including, without limitation, routine maintenance. You understand and acknowledge that due to circumstances both within and outside of the control of D-Hub, access to the Website or mobile application may be interrupted, suspended or terminated from time to time. D-Hub reserves the right, in its sole discretion, to terminate the access to any or all discounthub website(s) and the related services or any portion thereof at any time, without notice. discounthub shall also have the right at any time to change or discontinue any aspect or feature of the Website or mobile application, including, but not limited to, content, graphics, Offers, settings, hours of availability and equipment needed for access or use.
Further, D-Hub may discontinue disseminating any portion of information or category of information, may change or eliminate any transmission method and may change transmission speeds or other signal characteristics.
to upload, send or receive any material, which is not civil or tasteful.
copy or use any User Content for any commercial purposes.
Discount hub reserves the right to prevent you from using the Website (or mobile application) and the Service (or any part of thereof) and to prevent you from making any purchase, if your conduct is found to be in question or contravention of such Terms as mentioned above or in this Agreement.
DHub takes no responsibility for the services and/or products for which DHub Vouchers may be redeemed.
Further, D-Hub makes no warranty to the Users for the quality, safety, usability, or another aspect of the product or service for which the DHub Voucher may be redeemed.
Some services for which D-Hub Voucher(s) can be redeemed are activities that involve potential bodily harm (such as different forms of adventure sports and activities.), and for those activities DHub takes no responsibility for the service or activity being offered, and the User takes responsibility for his or her own actions in utilizing the services for which the DHub Voucher can be redeemed.
Discount hub may, in DHub's sole discretion, create promotional codes that may be redeemed for Account credit, or other features or benefits related to the Services and/or a Third Party Provider's services, subject to any additional terms that D-Hub establishes on a per promotional code basis ("Promo Codes"). You agree that Promo Codes: (i) must be used for the intended audience and purpose, and in a lawful manner; (ii) may not be duplicated, sold or transferred in any manner, or made available to the general public (whether posted to a public form or otherwise), unless expressly permitted by D-Hub; (iii) may be disabled by D-Hub at any time for any reason without liability to D-Hub; (iv) may only be used pursuant to the specific terms that D-Hub establishes for such Promo Code; (v) are not valid for cash; vi) may expire prior to your use; and vii) unless otherwise specified cannot be used more than once. D-Hub reserves the right to withhold or deduct credits or other features or benefits obtained through the use of Promo Codes by you or any other user in the event that D-Hub determines or believes that the use or redemption of the Promo Code was in error, fraudulent, illegal, or in violation of the applicable Promo Code terms or these Terms.
Discount hub grants you a limited, personal, nontransferable, nonexclusive, revocable license to access and use the Site pursuant to this Agreement and to any additional terms and policies set forth by discount hub. All Intellectual Property Rights (including all copyright, patents, trade marks, service marks, trade names, designs (including the look and feel and other visual or non-literal elements)) whether registered or unregistered) in the Website or mobile application and Service, (subject to the Title Ownership Rights as mentioned below) information content on the Website or mobile application or accessed as part of the Service, any database operated by us and all the Website design, text and graphics, software, photos, video, music, sound, and their selection and arrangement, and all software compilations, underlying source code and software (including applets and scripts) shall remain our property (or that of our licensors). You shall not, and shall not attempt to, obtain any title to any such intellectual property. All rights are reserved.
None of the material listed in the clause above may be reproduced or redistributed or copied, distributed, republished, downloaded, displayed, posted or transmitted in any form or by any means, sold, rented or sub-licensed, used to create derivative works, or in any way exploited without our prior express written permission. You may, however, retrieve and display the content of the Website on a computer screen, store such content in electronic form on disk (but not on any server or other storage device connected to a network) or print / save one copy of such content for your own personal, non-commercial use, provided you keep intact all and any copyright and proprietary notices. You may not otherwise reproduce, modify, copy or distribute or use for commercial purposes any of the materials or content on the Website or mobile application without our permission.
"D-Hub", the discounthub Logos and variations thereof found on the website or mobile application are trademarks owned by Vivo Professional Services Pvt Ltd and all use of these marks inures to the benefit of D-Hub. All rights (including goodwill and, where relevant, trade marks) in D-Hub's name are owned by us (or our licensors). Other product and company names mentioned on the Website or mobile application is the trade marks or registered trade marks of their respective owners.
The title, Ownership Rights and Intellectual Property Rights in and to the content accessed using the Service is the property of the applicable content owner or Merchant and may be protected by applicable copyright or other law.
The Agreement gives you no rights to such content.
Subject to the Clause below, any material you transmit or post or submit to the Website or mobile application (or otherwise to us) shall be considered (and we may treat it as) non-confidential and non-proprietary, subject to our obligations under data protection legislation or such legislation which provides for protection of electronic data under Indian Laws. If for some reason, any part of that statement does not work as a matter of law, then for anything which you supply to us from whatever source (i.e. via email, the Website or otherwise) you grant us a royalty-free, perpetual, irrevocable, non-exclusive right to use, copy, modify, adapt, translate, publish and distribute world-wide any such material.
All comments, suggestions, ideas, notes, drawings, concepts or other information: (i) disclosed or offered to us by you; or (ii) in response to solicitations by us regarding the Service or the Website or mobile application; (in each foregoing case, these are called Ideas) shall be deemed to be and shall remain our property and you hereby assign by way of present and future assignment all intellectual property rights in Ideas, to us. You understand and acknowledge that we have both internal resources and other external resources which may have developed or may in the future develop ideas identical to or similar to Ideas and that we are only willing to consider Ideas on these terms.
In any event, any Ideas are not submitted in confidence and we assume no obligation, express or implied by considering it. Without limitation, we shall exclusively own all now known or hereafter existing rights to the Ideas of every kind and nature throughout the world and shall be entitled to unrestricted use of the Ideas for any purpose whatsoever, commercial or otherwise without compensation to the provider of the Ideas.
The User expressly agrees that use of the Website or mobile application is at the User's sole risk. Neither D-Hub, its holding or subsidiaries, Business Associates nor any of their respective employees, agents, and third party content providers warrant that use of the Website or mobile application will be uninterrupted or error-free; nor do they make any warranty as to (i) the results that may be obtained from use of this Website or mobile application, or (ii) the accuracy, reliability or content of any information, service or merchandise provided through the Website or mobile application.
The Website or mobile application are made accessible on an "as is" basis without warranties of any kind, either express or implied, including, but not limited to, warranties of title or implied warranties of merchantability or fitness for a particular purpose, other than those warranties which are implied by and incapable of exclusion, restriction or modification under the laws applicable to this agreement.
We do not give any warranty that the Services or the Website or mobile application are free from viruses or anything else which may have a harmful effect on any technology.
We reserve the right to change, modify substitute, suspend or remove without notice any information or Voucher or service from the Website or mobile application forming part of the Service from time to time. Your access to the Website or mobile application and/or the Services may also be occasionally restricted to allow for repairs, maintenance or the introduction of new facilities or services. We will attempt to restore such access as soon as we reasonably can. We assume no responsibility for functionality which is dependent on your browser or other third party software to operate. For the avoidance of doubt, we may also withdraw any information or Voucher from the Website or Services at any time.
We reserve the right to block access to and/or to edit or remove any material which in our reasonable opinion may give rise to a breach of this Agreement.
This disclaimer of liability applies to any damages or injury caused by any failure of performance, error, omission, interruption, deletion, defect, delay in operation or transmission, computer virus, communication line failure, theft or destruction or unauthorized access to, alteration of, or use of record, whether for breach of contract, tortuous behavior, negligence, or under any other cause of action. The User specifically acknowledges that D-Hub is not liable for the defamatory, offensive or illegal conduct of other users or third-parties and that the risk of injury from the foregoing rests entirely with the User.
In no event shall D-Hub, or any Business Associates, Third Party Content Providers, Third Party Advertisers or Third Party Service Providers, producing or distributing the Website or the contents hereof, mobile application and any software, be liable for any damages, including, without limitation, direct, indirect, incidental, special, consequential or punitive damages arising out of the use of or inability to use the Website or mobile application. The User hereby acknowledges that the provisions of this Clause shall apply to all content on the Website and mobile application.
In addition to the terms set forth above, neither D-Hub, nor its subsidiaries and Business Associates, Third Party Service Providers or Third Party Content Providers shall be liable regardless of the cause or duration, for any errors, inaccuracies, omissions, or other defects in, or untimeliness or unauthenticity of, the information contained within the Website, or for any delay or interruption in the transmission thereof to the user, or for any claims or losses arising therefrom or occasioned thereby. None of the foregoing parties shall be liable for any third-party claims or losses of any nature, including without limitation lost profits, punitive or consequential damages.
We will not be liable for indirect, special, or consequential damages (or any loss of revenue, profits, or data) arising in connection with this Agreement, even if we have been advised of the possibility of such damages. Further, our aggregate liability arising with respect to this Agreement will not exceed the total Offer price paid or payable to you under this Agreement.
D-Hub shall be under no liability whatsoever in respect of any loss or damage arising directly or indirectly out of the decline of authorization for any Transaction, on Account of the Cardholder having exceeded the preset limit mutually agreed by us with our acquiring bank from time to time.
D-Hub shall have the right, but not the obligation, to monitor the content of the Website or mobile application at all times, including any chat rooms and forums that may hereinafter be included as part of the Website or mobile application, to determine compliance with this Agreement and any operating rules established by D-Hub, as well as to satisfy any applicable law, regulation or authorized government request. Without limiting the foregoing, D-Hub shall have the right to remove any material that D-Hub, in its sole discretion, finds to be in violation of the provisions hereof or otherwise objectionable.
By posting communications on or through this Website or mobile application, the User shall be deemed to have granted to D-Hub, a royalty-free, perpetual, irrevocable & non-exclusive license to use, reproduce, modify, publish, edit, translate, distribute, perform, and display the communication alone or as part of other works in any form, media, or technology whether now known or hereafter developed, and to sublicense such rights through multiple tiers of sub-licensees.
D-Hub may terminate this Agreement at any time. Without limiting the foregoing, discounthub shall have the right to immediately terminate any passwords or accounts of a User in the event of any conduct by the User which DHub, in its sole discretion, considers being unacceptable, or in the event of any breach by User of this Agreement.
One User can have only one Account with a unique e-mail ID and unique phone number. If D-Hub has any suspicion or knowledge that any of its Users have created multiple Accounts with different e-mail addresses or phone numbers (including but not limited to account creation by using false names or providing misleading data for creating those Accounts or using disposable email addresses or disposable phone numbers) to generate additional cash back credits or misuse or take undue advantage of the promotional benefits being provided on the DHub Platform, then D-Hub may while reserving its rights to initiate civil and/or criminal proceedings against such User may also at its sole discretion terminate, suspend, block, restrict, cancel the Account of such User and/or disqualify that User and any related Users from availing the services ordered or undue benefits availed through these accounts.
All provisions wherein the context requires including clauses on Intellectual Property Rights. Disclaimer of Warranty, Limitation of Liability, License Grant, Indemnification and Termination above will survive termination of this Agreement.
D-Hub, similar to an Internet Service Provider, is a distributor (and not a publisher) of content supplied by third parties and Users. Accordingly, discount hub has does not have editorial control over such content. Any opinions, advice, statements, services, offers, or other information or content expressed or made available by third parties, including Third Party Content Providers, or any other Users are those of the respective author(s) or distributors and not of D-Hub.
Neither D-Hub nor any third-party provider of information guarantees the accuracy, completeness, or usefulness of any content, nor its merchantability or fitness for any particular purpose (refer to the Clause for 'Disclaimer of Warranty, Limitation of Liability' above for the complete provisions governing limitation of liabilities and disclaimers of warranty).
In many instances, the content available through this Website or mobile application represents the opinions and judgments of the respective information provider, User, or other users not under contract with DHub. DHub neither endorses nor is responsible for the accuracy or reliability of any opinion, advice or statement made on the Website by anyone other than authorized DHub employee/spokespersons while acting in official capacities.
Under no circumstances will D-Hub be liable for any loss or damage caused by User's reliance on information obtained through the Website. It is the responsibility of User to evaluate the accuracy, completeness or usefulness of any information, opinion, advice etc. or other content available through the Website.
The Website contains links to third-party websites maintained by other content providers. These links are provided solely as a convenience to you and not as an endorsement by D-Hub of the contents on such third-party websites and D-Hub hereby expressly disclaims any representations regarding the content or accuracy of materials on such third-party websites. If the User decides to access linked third-party websites, the User does so at his/her own risk.
Unless you have executed a written agreement with D-Hub expressly permitting you to do so, you may not provide a hyperlink to the Website from any other website. D-Hub reserves the right to revoke its consent to any link at any time in its sole discretion.
Discount hub may place advertisements in different locations on the Website and at different points during use of the Service. These locations and points may change from time to time - but we will always clearly mark which goods and services are advertisements (i.e. from persons other than us), so that it is clear to you which goods and services are provided on an objective basis and which are not (i.e. the advertisements).
You are free to select or click on advertised goods and services or not as you see fit.
Any advertisements may be delivered on our behalf by a Third Party Advertiser.
No waiver by either party of any breach or default hereunder is a waiver of any preceding or subsequent breach or default.
All provisions of this Agreement apply equally to and are for the benefit of D-Hub, it subsidiaries, any holding companies of D-Hub, its (for their) affiliated and it (or their) Third Party Content Providers and licensors and each shall have the right to assert and enforce such provisions directly or on its own behalf (save that this Agreement may be varied or rescinded without the consent of those parties).
Vivo Professional Services Private Limited headquarters are in Guntur, India. Legal issues arising out of, but not exclusive to the use of, this Website or mobile application (unless otherwise specifically stated) are governed by and in accordance with the laws of India (exclusive of its rules regarding conflicts of laws) and the parties shall submit to the exclusive jurisdiction of the Courts in Guntur, India.
We want to list the products and services of genuine sellers on our website or mobile application in order to ensure that infringing products are removed from the site, as they affect your and genuine Seller's valuable trust.
We do not and cannot verify if the Sellers have the right or ability to sell or distribute their listed products or services. However, we are committed to removing any infringing or unlicensed product or service once an authorized representative of the rights owner properly reports them to us. We sincerely want to ensure that item listings do not infringe upon the copyright, trademark or other intellectual property rights of third parties. We have the ability to identify and request removal of allegedly infringing products and materials. Any person or company who holds intellectual property rights (such as a copyright, trademark or patent) which may be infringed upon bye-products listed on D-Hub is encouraged to report the same to the Grievance Officer.
We are hiring Business Development Executives.
Promotion of mobile Application - DHUB (Discount Hub) By Vivo professional services private limited.
Walk into merchant/retailer/shopkeepers to explain the benefits and demonstrate the App.
Register them as shopkeepers, demonstrate adding offers in the App.
Registration and adding offers is free.
Should be able to generate the leads and close them as subscribers.
Any Graduate / Qualification is not a criteria for 2+ years of experience in marketing M.B.A in Marketing are preferred.
We have Part time option for the Students.
Job Location: Kakinada, Nellore and Tirupati.
Salary : 10000 to 15000 /- Plus incentives upon performance.
Online reputation management, social listening and responses Managing & maintaining a brand identity on forums, review sites, blog listings etc.
Responding to incoming queries on Social Media & coordinating with internal teams to ensure closure of queries as well as maintain good response rate turnarounds.
Collaborating with in-house designers for building out creatives for Social platforms.
Contributing to the marketing of brand with articles & ensuring all posts are regularly pushed out through social media channels .
Qualifications: Any Graduate with experience in Social Media marketing conceptsare preferred.
Identify prospects by lead generation on the field like reference from CA, existing customers etc.
Informing about installation of mobile apps to new customersabout registrationand adding offers or managing offers.
Qualifications: Any Graduate or +2 candidates with experience in tele-calling experience are preferred.
Dhub is an informative app for users to know about discounts or offers or new promotions available in their city. Dhub services are meant to bridge and develop new alternative model for users to shop products or use services within the city at a reduced or customized price offers from the retailers, shopkeepers, merchants and service providers from all the major cities of Andhra Pradesh.
Q Is D-Hub a free platform?
Yes, D-Hub remains free forever for its customers who continue to shop at discounted prices in major cities of Andhra Pradesh.
Q Is D-Hub limited to search discounts where user is located?
No, D-Hub would use the customers saved location settings in account to search. If customer intents to search discounts that are available in other major cities of Andhra Pradesh, customer can do so by selecting the city from the drop down box. D-Hub has covered for you almost all of the major cities of Andhra Pradesh.
Q How to register on D-Hub?
Customer can register on D-Hub using "Get registered on Dhub" tab with credentials of Email and mobile number. On input of Email ID, mobile number and desired Password in sign up page, it would generate access to account services on D-Hub after an OTP confirmation on mobile.
Q Can I as shopping customer earn redeemable balance on D-Hub?
Yes, as upcoming feature D-Hub would support customers to earn balances on app by referring friends. Once your referred friend is registered on our app and active on D-Hub then a specific balance will be added to your account. We also would come up with new service, by associating with Gaming organizations for developing a gaming zone in our app. It would require the customer to download an app and install it in their mobile to play the games.
T& C will be applicable as per the requirements of downloadable apps.
Q Being a merchant can I use D-Hub?
New Merchants or new outlet holders need to contact the Accounts department of D-Hub for enabling them with a new account or they could freely register on our app as shopkeeper to promote their products / services freely for a limited period. Merchants or shopkeepers can use their account to add discounts available for the products in the outlet. Also they could edit or else they could block the discount promotion, if they run out of stocks.
Q Can I as shopping customer use the balance for redemption in purchases?
Balance earned by the customer can be used in two ways. One is to top up as talk time to any of their mobile devices as per your balance permits. Customer can also use his balance to pay the merchant towards purchase done in the outlet for the specific discounts mentioned on D-Hub.
Q How can a Merchant use his balance on D-Hub?
Balances accumulated by the merchant can use it for mobile top up as talktime. Merchants also have a facility to use the balance for redemption in their subscriptions or to avail new advertisements in DHub.
Q Are Advertisements available for merchants to promote in D-Hub?
Yes advertisements are available as paid services for shopkeepers, retailers, merchants or service providers to promote their advertisement on landing page or category page as per their requirement. These advertisements are available on our app for each city of Andhra Pradesh.


COURTNEY, G.W., T. PAPE, J.H. SKEVINGTON & B.J. SINCLAIR. 2017. Biodiversity of Diptera. pp. 229-278 (+ 2 plates) in R.G. Foottit & P.H. Adler (editors). Insect Biodiversity: Science and Society. Volume 1, 2nd Edition. John Wiley & Sons Ltd, Chichester, UK. 904 pp.
COURTNEY, G.W. & P.S. CRANSTON. 2015. Section VI: Phylum Arthropoda. Chapter 40: Order Diptera. pp. 1043-1058 in J.H. Thorp & D.C. Rogers (editors). Thorp and Covich's Freshwater Invertebrates Volume I: Ecology and General Biology. Academic Press, London, UK.
COURTNEY, G.W. 2009. Blephariceridae (net-winged midges). pp. 237-243 in B.V. Brown, A. Borkent, D.M. Wood & M. Zumbado (editors). Manual of Central American Diptera. National Research Council Press, Ottawa, Ontario, Canada.
COURTNEY, G.W. & R.W. MERRITT. 2009. Diptera (non-biting flies). pp. 288-298 in G.E. Likens (editor). Encyclopedia of Inland Waters. Volume 2. Elsevier Limited, Oxford.
COURTNEY, G.W. & R.W. MERRITT. 2008. Aquatic Diptera: Part one: Larvae of aquatic Diptera. pp. 687-722 in R.W. Merritt, K.W. Cummins & M.B. Berg (editors). An Introduction to the Aquatic Insects of North America. Fourth Edition. Kendall / Hunt Publishing Co., Dubuque, Iowa.
COURTNEY, G.W. 2003. Blephariceridae. pp. 702-708 in S.M. Goodman & J.P. Benstead (editors). The Natural History of Madagascar. The University of Chicago Press, Chicago.
COURTNEY, G.W. 2000. Revision of the net-winged midges of the genus Blepharicera Macquart (Diptera: Blephariceridae) of eastern North America. Memoirs of the Entomological Society of Washington 23: 1-99.
COURTNEY, G.W. 2000. A.1. Family Blephariceridae. pp. 7-30 in L. Papp & B. Darvas (editors). Contributions to a Manual of Palaearctic Diptera. Appendix. Science Herald, Budapest.
COURTNEY, G.W., B. J. SINCLAIR & R. MEIER. 2000. 1.4. Morphology and terminology of Diptera larvae. pp. 85-161 in L. Papp & B. Darvas (editors). Contributions to a Manual of Palaearctic Diptera. Volume 1. Science Herald, Budapest.
OOSTERBROEK, P. & G.W. COURTNEY. 1995. Phylogeny of the nematocerous families of Diptera (Insecta). Zoological Journal of the Linnean Society 115: 267-311.
COURTNEY, G.W. 1993. Archaic black flies and ancient forests: conservation of Parasimulium habitats in the Pacific Northwest. Aquatic Conservation: Marine and Freshwater Ecosystems 3: 361-373.
COURTNEY, G.W. 1990. Cuticular morphology of larval mountain midges (Diptera: Deuterophlebiidae): implications for the phylogenetic relationships of Nematocera. Canadian Journal of Zoology 68: 556-578.
COURTNEY, G.W. 1990. Revision of Nearctic mountain midges (Diptera: Deuterophlebiidae). Journal of Natural History 24: 81-118.


text:
What It Actually Means To Have A "Shallow" Vagina
By Sara Coughlin
Julian Birchman
Whether you read about them online or hear them through word of mouth, shameful beliefs and misconceptions (if not total falsehoods) about vaginas abound. Amid this long list of frustrating myths is the subject of vaginal depth. Google "shallow vagina" and you'll see what we mean. For example, Urban Dictionary's top-ranking definition for the term suggests that it's actually the result of a tampon being stuck in one's vagina — and primarily a barrier to male pleasure. Sounds legit, right?
Wrong. However, there is such a thing as a short vagina — but it isn't a joke, and it's not something that's easily defined. (And, for the record, you can't get a tampon "stuck" in there).
For starters, there is no hard and fast rule we can use to deem a vagina "shallow" (or "deep," for that matter). Rather, the length of a "normal" vaginal canal ranges from about three to six inches, Susan Loeb-Zeitlin, MD, FACOG, a gynecologist at New York-Presbyterian/ Weill Cornell Medicine, tells InStyle.
Similarly, there isn't one single explanation for why someone's vagina would fall short of this measurement range. Dr. Loeb-Zeitlin explains that some people are born without a vagina, or with a vaginal septum — the latter occurs when the vagina doesn't develop properly and a barrier of tissue forms that shortens or even blocks it. Depending on their severity, these conditions may prevent someone from having comfortable penetrative sex, menstruating normally, or giving birth vaginally.
RELATED: Why Sex Hurts
There are other factors that could cause the length of your vagina to change later in life, too. Dr. Loeb-Zeitlin says that radiation treatments for cancer and menopause can affect vaginal depth or width. How, exactly? In cases where it's being used to treat endometrial or vaginal cancer, radiation can dry out the vagina's lining, leading to the formation of scar tissue, which causes the canal to narrow or shorten. Additionally, the decline in hormone production that comes with menopause often leads to thinner, dryer, and shrunken vaginal tissue. These conditions also involve some pain or discomfort during penetrative sex (although, for the record, arousal can actually cause the vagina to elongate somewhat) and could make it difficult to insert a tampon.
VIDEO: Keep Your Vagina Healthy By Checking Out This Essential List of Facts
Luckily, there are treatments that may aid in stretching a shallow vaginal canal, Dr. Loeb-Zeitlin says. Namely, pelvic floor exercises can help in general and, if one's vagina has become shorter because of menopause, vaginal estrogen therapy may be an option. Meanwhile, a vaginal septum can usually be addressed with surgery.
If you think you may have a short vagina, talk to your doctor. They'll help identify your condition, determine how best to treat it, and, blessedly, alleviate any concerns that that Urban Dictionary definition may have inspired, once and for all.


text:
Eleven German MPs under police protection over Armenian vote
Foreign ministry also warns they would not be safe in Turkey.
Green Party members of the Bundestag, with party leader Cem Özdemir in the center, vote on June 2 the resolution on the Armeniain massacre
By Arnau Busquets Guàrdia
Eleven German MPs of Turkish origin have been put under police protection after receiving death threats for supporting a parliamentary resolution that calls the 1915 massacre of Armenians in Turkey a genocide, the BBC reports.
The German foreign ministry also advised the MPs against traveling to Turkey, saying that Berlin can not guarantee their safety there.
Cem Özdemir, one of the champions of the resolution said death threats and insults are nothing new, but they have intensified after the vote.
The 11 MPs have suffered criticism both from Germany's Turkish community and from authorities in Turkey.
"Their blood is impure and we know whose mouthpiece they are," Turkish president Recep Tayyip Erdoğan said in Istanbul. They are "the long arm of the separatist terrorists placed in Germany," he said of the 11 MPs.
Ankara withdrew its ambassador to Berlin following the Bundestag vote.
Ankara's Mayor İbrahim Melih Gökçek tweeted a montage of photos of the 11 German-Turkish MPs who backed the genocide resolution, accusing them of "stabbing us in the back."
#ihanetcilervatandasliktanatilsin pic.twitter.com/3F2OOaCJzn
— İbrahim Melih Gökçek (@06melihgokcek) June 5, 2016
Turkey opposes the term "genocide" being attached to the deportation and murder of members of the Christian Armenian authority by Ottoman Empire authorities during World War I, when Turkey was a German ally. While acknowledging there were deaths and deportations, Turkey rejects as exaggerated estimates that 800,000-1.5 million people died between 1915-16.
Angela Merkel's response, during a news conference Tuesday, was to call the Turkish response "incomprehensible" and defend the MPs in question as "freely elected parliamentarians."
Janosch Delcker contributed to this article.
More from ... Arnau Busquets Guàrdia
Germany	Turkey
Angela Merkel	Recep Tayyip Erdoğan


text:
var Header = require('../../lib/ssdpHeader')
var expect = require('chai').expect

describe('SSDP Header class', function () {
  context('constructor', function () {
    it('sets method, headers and isResponse', function () {
      var h = new Header('method', {foo: 'bar'}, true)

      expect(h._method).to.equal('method')
      expect(h._headers.foo).to.equal('bar')
      expect(h._isResponse).to.be.true
    })

    it('throws when method is not given', function () {
      try {
        new Header('method', {foo: 'bar'}, true)
      } catch (e) {
        expect(e.message).to.contain('header requires method')
      }
    })

    it('generates random ID', function () {
      var h1 = new Header('method')
      var h2 = new Header('method')

      expect(h1._id).to.exist
      expect(h2._id).to.exist
      expect(h1._id).to.not.equal(h2._id)
    })
  })

  context('#id', function () {
    it('returns ID', function () {
      expect(new Header('method').id()).to.exist
      expect(new Header('method').id()).to.be.a.string
    })
  })

  context('#setHeader', function () {
    it('sets header', function () {
      var h = new Header('method')

      expect(h._headers).to.deep.equal({})

      h.setHeader('foo', '1')
      h.setHeader('bar', '2')

      expect(h._headers).to.deep.equal({foo: '1', bar: '2'})
    })

    it('does not set header when called with != 2 arguments', function () {
      var h = new Header('method')

      expect(h._headers).to.deep.equal({})

      h.setHeader('foo')

      expect(h._headers).to.deep.equal({})
    })

    it('overwrites existing header', function () {
      var h = new Header('method')

      expect(h._headers).to.deep.equal({})

      h.setHeader('foo', 'bar')

      expect(h._headers).to.deep.equal({foo: 'bar'})

      h.setHeader('foo', 'not bar')

      expect(h._headers).to.deep.equal({foo: 'not bar'})
    })
  })

  context('#setHeaders', function () {
    it('sets headers', function () {
      var h = new Header('method')

      expect(h._headers).to.deep.equal({})

      h.setHeaders({
        foo: 1,
        bar: 2
      })

      expect(h._headers).to.deep.equal({foo: 1, bar: 2})
    })

    it('does not set header when called with non-object', function () {
      var h = new Header('method')

      expect(h._headers).to.deep.equal({})

      h.setHeaders()
      h.setHeaders([])
      h.setHeaders(/sdf/)
      h.setHeaders(function(){})
      h.setHeaders('zxc')
      h.setHeaders(123)

      expect(h._headers).to.deep.equal({})
    })

    it('overwrites existing headers', function () {
      var h = new Header('method')

      expect(h._headers).to.deep.equal({})

      h.setHeaders({
        foo: 1,
        bar: 2
      })

      expect(h._headers).to.deep.equal({foo: 1, bar: 2})

      h.setHeaders({
        foo: 13,
        bar: 14
      })

      expect(h._headers).to.deep.equal({foo: 13, bar: 14})
    })
  })

  context('#isResponse', function () {
    it('returns isResponse', function () {
      var h = new Header('method')
      expect(h.isResponse()).to.be.false

      h = new Header('method', {}, false)
      expect(h.isResponse()).to.be.false

      h = new Header('method', {}, true)
      expect(h.isResponse()).to.be.true
    })
  })

  context('#overrideLocationOnSend', function () {
    it('sets overrideLocationOnSend to true', function () {
      var h = new Header('method')
      expect(h._overrideLocationOnSend).to.be.not.ok

      h.overrideLocationOnSend()
      expect(h._overrideLocationOnSend).to.be.true
    })
  })

  context('#isOverrideLocationOnSend', function () {
    it('returns overrideLocationOnSend', function () {
      var h = new Header('method')
      expect(h.isOverrideLocationOnSend()).to.be.false

      h.overrideLocationOnSend()
      expect(h.isOverrideLocationOnSend()).to.be.true
    })
  })

  context('#toString', function () {
    it('returns a string', function () {
      var hRequest = new Header('method', {foo: 1, BAR: 'two'})

      var expectedRequestString = 'METHOD * HTTP/1.1\r\nfoo: 1\r\nBAR: two\r\n\r\n'
      expect(hRequest.toString()).to.equal(expectedRequestString)

      var hResponse = new Header('method', {foo: 1, BAR: 'two'}, true)

      var expectedResponseString = 'HTTP/1.1 METHOD\r\nfoo: 1\r\nBAR: two\r\n\r\n'
      expect(hResponse.toString()).to.equal(expectedResponseString)
    })

    it('accepts override headers', function () {
      var hRequest = new Header('method', {foo: 1, BAR: 'two'})

      var expectedRequestString = 'METHOD * HTTP/1.1\r\nfoo: 1\r\nBAR: three\r\nBoo: yes\r\n\r\n'
      expect(hRequest.toString({Boo: 'yes', BAR: 'three'})).to.equal(expectedRequestString)
    })
  })

  context('#toBuffer', function () {
    it('returns a buffer', function () {
      var hRequest = new Header('method', {foo: 1, BAR: 'two'})

      var expectedRequestBuffer = Buffer.from('METHOD * HTTP/1.1\r\nfoo: 1\r\nBAR: two\r\n\r\n')
      expect(hRequest.toBuffer()).to.deep.equal(expectedRequestBuffer)
    })

    it('accepts override headers', function () {
      var hRequest = new Header('method', {foo: 1, BAR: 'two'})

      var expectedRequestBuffer = Buffer.from('METHOD * HTTP/1.1\r\nfoo: 1\r\nBAR: three\r\nBoo: yes\r\n\r\n')
      expect(hRequest.toBuffer({Boo: 'yes', BAR: 'three'})).to.deep.equal(expectedRequestBuffer)
    })
  })
})


Your magnetic vehicle is ready, but so is the delivery truck. Get the right crates and place them carefully in the truck. Truck Loader 2 is provided to you by FunLand.com and is categorized into our puzzle games. This game was played 252,488 times and currently has a rating of 4.28 out of 5.00 after 509 votes.
*Truck Loader 2 is not compatible with a mobile device.


Typically we have a harsh winter, but this winter's been pretty mild, and we are heading into the real estate market with home prices increasing and more buyers flooding the market. This is been a great year and we expected to grow even more as we headed to spring and summer. One school lets out more homes will be available so if you're interested in a great deal right now, buyers need to jump on the ball. Home prices are still low, rates are still available, and our agents are ready to help you buy the right home at the right price.


text:
« BELLEVILLE EDUCATION FOUNDATION TO SPONSOR 2010 WALL OF RECOGNITION BANQUET | Main | Reader Compares "Bad News on the Doorstep" to "Bronx Tale." »
Cervasio's "Bad News on the Doorstep" now in Kindle Edition at Amazon
Authorhouse, the print-on-demand publisher of Bad News on the Doorstep, has announced that the Kindle editon of Joe Cervasio's fictionalized memoire is now available at Amazon.
Go directly to www.amazon.com and search the book title, and you will find the $5.95 product.
Barnes and Noble will soon follow suit on their shopping website.
FIRST REVIEW:
"I found your book on Amazon and downloaded it to my iphone. I'm about ½ way thru it. I can't stop reading it. It is really great."
Anthony (Vinnie) Giampietro
From the desk of.......
Anthony T. Giampietro, SLRREA
605 Passaic Ave., Suite 101
Nutley, NJ 07110-1224
Office/Cell: 201-820-1272
E-mail: 1century@optonline.net
Web Site: www.firstcenturyappraisal.com
Diversified Global Stategies.
PS: Go to "Bad News on the Doorstep" in this blog, as far back as 2005, and be introduced to this novel whose story has been compared to "American Graffiti," and also described as "Happy Days" meets "The Sopranos." The late fifties will come alive for all readers who miss them.
09:51 AM in Bad News on the Doorstep, Books, Current Affairs | Permalink


text:
Joan Mar Sauqué
Download 300ppp
"Joan triumphs throughout."
(Marc Myers, JazzWax)
"He's heard many people but — hooray! — he sounds like himself."
(Michael Steinman, Jazz Lives)
"He sounds like a player of an earlier generation [but] the results never sound anything but brand new."
(Brian Priestley, Jazzwise)
"Sauqué is a serious scholar of his favourite music, an explorer of melodies with a definite approach."
(Fernando O. de Urbina, Easy Does It)
Joan Mar Sauqué was born in 1996 in the small town of Garrigoles, province of Girona in Spain. He got started in music aged seven, with a trombone that was lying around at his grandparents'. He soon switched to trumpet and was enrolled in the Municipal School of Music of nearby Torroella de Mongrí, where he was taught trumpet, musical language, combo, big band and improvisation.
In 2011, he began studying with David Pastor, who introduced him to Joan Chamorro's Sant Andreu Jazz Band shortly thereafter. With them, he has had the chance to play and/or record with top players such as Scott Robinson, Dick Oatts, Jon-Erik Kellso, and Scott Hamilton. He settled in Barcelona in 2012, where he did two years of classical trumpet and later studied jazz trumpet at ESMUC.
Sauqué's most salient source of inspiration is the 1950s US East Coast group of players that went through the ranks of Lionel Hampton's orchestra of 1953, a network of musical styles and personal friendships which includes people like Tadd Dameron, Gigi Gryce, Art Farmer, Clifford Brown, and Benny Golson.
That network of musical friendships informs Sauqué's new album, "Gone with the Wind" (The Changes, 2021). The twelve tracks presented in the CD are related to those musicians and, in most cases, they have seldom been recorded before.
Sauqué's selection of tunes stems from, first, being appealed by a particular recording of a composition and, second, exploring his own way to make each of those compositions shine brighter. Thus, far from being facile homages to past trumpet masters, the careful selection of tunes has been guided by the melodic content of those pieces as the foundation of his own interpretations.
As for the line-up of the group, a trio of trumpet, guitar, and bass, even though it has its historical precedents too, the leader's motivation is here, again, his own, i. e., the search for maximum clarity when it comes to presenting this music.
The relationship of Jazz with its past is complex. Not for Sauqué: it just provides his preferred aesthetic framework to express himself.
Gone with the Wind is Sauqué's third release, after Joan Chamorro Presenta Joan Mar Sauqué (Jazz to Jazz, 2016),and Vou onde o vento (self-produced, 2018).