Category: kycxutpx Page 1 of 5

West Bengal trying to develop ecosystem for content creation

first_imgKolkata: The West Bengal government is working on developing an infrastructure and allied eco-system for creation of content which would drive the economy in future, a senior official said on Wednesday. “Content will be in demand in the future. The government is trying to create an infrastructure and the required eco- system for creation of content as well as product development”, Additional Chief Secretary (IT and Electronics), Debashis Sen said at a seminar organised by ICC here. Also Read – Centuries-old Durga Pujas continue to be hit among revellers He said the West Bengal Electronics Industry Development Corporation (Webel), a nodal agency for the state government for the Electronics & IT industry, has also tied up with an animation academy which is in existence for one year and the first batch will pass out on July 19. They have learnt content creation during the period, he said. “The next billion users will move the economy in the fields of leisure, games, movies, entertainment and other things,” he said. Also Read – Bengal family worships Muslim girl as Goddess Durga in Kumari Puja Mentioning that IT professional from West Bengal residing elsewhere such as Bangalore and abroad were doing wonders, Sen said, “In this context, the West Bengal government has now decided to create cluster-based development in the form of Silicon Valley hub, Fintech hub and IT parks.” The government had also decided to introduce IT and digital education from Class 1 for the creation of an environment and an eco-system which would bring back the glory of the state, Sen added.last_img read more

Environment minister touts balance at Alberta Climate Summit

first_imgCALGARY (660 NEWS) – Alberta Environment and Parks Minister Shannon Phillips was a featured speaker at the Alberta Climate Summit in Calgary Wednesday afternoon.She told the crowd at the BMO Centre that especially young people are passionate about climate change, and that’s why they will be launching the Alberta Youth Climate Change Council.But along with promoting the province’s Climate Leadership Plan, Phillips says decisions about the environment and energy development need to be based on science, evidence and facts.The minister also took aim at the conservative elements in the province, and criticized those who say climate change is not real.Following her speech, she also met with reporters to discuss this balance and how to move ahead with projects such as the Trans Mountain Pipeline Expansion.When asked about how the province can keep the environment safe but also develop oil and gas projects, Phillips believes the NDP has proven it can be done — shown by two years of economic growth and the introduction of the new Climate Leadership Plan.“This is a reality that not only puts food on the table for thousands of Alberta families but also millions of Canadians. So what we need to do as an energy economy is ensure we are poised to be able to compete in a carbon-constrained world because we know that climate change is real,” said Phillips.Then, looking at how they can transition into that carbon-constrained future, Phillips added that policies like the carbon tax help out.“We need to make sure that we are thoughtfully reinvesting the proceeds of our price on pollution into making those innovative solutions a reality, lowering costs for producers, as well as creating new jobs.”At the Alberta Climate Summit, where Environment Minister Shannon Phillips is speaking. Summit is hosted by the Pembina Institute. Phillips talking about science based methods to combat climate change, criticizes doubters in the Conservative party #ableg #climate pic.twitter.com/hnTywkU9hG— Tom Ross (@Tommy_Slick) September 26, 2018Phillips was also asked about her upcoming meeting in Ottawa, along with Energy Minister Marg McCuaig-Boyd, to lobby for changes over Bill C-69.She said that the first issue over the bill which helps determine how energy projects are approved in Canada concerns the time-frames.“We still don’t have much in the way of comfort around timelines, so that’s one of the biggest things. Two, better defining the scope — in particular for the pre-assessment. I still think there are still some issues there. And three, it’s just a little bit too vague in terms of some of the federal encroachment into provincial jurisdiction on work that we are already doing.”Also on Wednesday, a new three-member panel was named to the National Energy Board to conduct another review on the Trans Mountain expansion.Phillips says the NDP government will be monitoring their upcoming discussions.“If Alberta begins to see that games are being played with respect to this process, then we will be going back to the federal government to explore a legislative solution. Right now, we do have to take a bit of a wait and see approach, but if we can adhere to that 22-week timeline we believe that this project will move forward in the time-frame that it ought to, and shovels can go back into the ground and people can get back to work as they were in late August.”last_img read more

Encana vows to grow production after Q1 output and income miss expectations

first_imgCALGARY, A.B. — The chief executive of Encana Corp. says the company will ramp up output from its U.S. and Canadian oil and gas fields this year after it reported first-quarter operating earnings and production that missed analyst expectations.“We are well-positioned to execute another year of strong growth for Encana as we prepare to cross the 400,000 boe (barrels of oil equivalent) per day milestone later this year,” said Doug Suttles on a conference call.Encana reported first-quarter production of 324,400 barrels of oil equivalent per day, with 145,200 barrels per day of more valuable oil and natural gas liquids and the rest dry natural gas. Revenue in the quarter came to US$1.3 billion, beating the forecast for US$1.26 billion, and up from US$1.29 billion in the same quarter last year. That’s up from 317,900 boepd in the same period last year, but short of analyst consensus expectations of 338,000 boepd, according to a report from analyst Kristopher Zack of Desjardins Capital Markets, who had forecast for 331,500 boepd.He said the miss is partly due to timing of drilling wells and producing from them.“In the second half of last year, and particularly in the Duvernay and the Eagle Ford, we ramped down activity and we restarted and ramped up that activity here in the first quarter,” said Suttles. “We’ll actually see production build in the second half of the year in those two assets.”Encana is focused on four areas, the Permian and Eagle Ford regions in Texas and the Montney and Duvernay regions on the Alberta-B.C. border. It said most of its growth this year will come from its more highly developed Permian and Montney assets while output from the other two will remain flat.Encana said it expects fourth-quarter production this year to be between 400,000 and 425,000 boepd. It left its 2018 spending plan unchanged at between US$1.8 billion and US$1.9 billion.The Calgary-based company, which reports in U.S. dollars, had operating income of US$156 million in the three months ended March 31, missing analyst expectations of US$168 million according to Thomson Reuters. A year ago, its operating income was US$104 million.last_img read more

Scallop fishing area to be closed down amid harvest conflict

by The Associated Press Posted Mar 22, 2017 6:29 pm MDT Last Updated Mar 22, 2017 at 7:00 pm MDT AddThis Sharing ButtonsShare to TwitterTwitterShare to FacebookFacebookShare to RedditRedditShare to 電子郵件Email Scallop fishing area to be closed down amid harvest conflict PORTLAND, Maine – The federal government is shutting down scallop fishing in a key New England fishing area amid an ongoing conflict over the harvest of the valuable shellfish.The National Oceanic and Atmospheric Administration says it will close the northern Gulf of Maine area at 12:01 a.m. Thursday. The agency says the total allowable catch for the area has been harvested.Small boats have been in conflict with big boats in the area. The government maintains different rules for the small- and big-boat fisheries, though they work some of the same areas.Small-boat fishermen say flawed management allows bigger boats to overfish scallops. Bigger boats say the two can co-exist.Independent U.S. Sen. Angus King and Democratic U.S. Rep. Chellie Pingree say the move is a temporary fix and more work is needed. read more

Duchess of Cornwall to take on new role as she celebrates her 70th

first_img“Research shows that a person over the age of 50 is five times more likely to be made redundant, and eight times less likely  to find alternative employment than a person 18 – 30  age group,” he said.”That’s the extraordinary thing. People very often think it’s the other way round.” Mario Testino also took this picture following Princess Charlotte’s baptismCredit:Mario Testino/PA Wire Duchess of Cambridge The Royal couple are pictured together in a new portrait, marking the Duchess’ 70th birthday.They were photographed by Mario Testino in the morning room at Clarence House during a shoot in May, looking relaxed and happy as they smile for the camera side-by-side.The Duchess is captured for posterity in a navy blue dress coat with white embroidery by Fiona Clare, while the Prince wears a coordinating dark blue suit, shirt and tie.Testino paid tribute to the Duchess, describing her as “a kind and beautiful person with a wonderful sense of humour” after working with her again. Want the best of The Telegraph direct to your email and WhatsApp? Sign up to our free twice-daily  Front Page newsletter and new  audio briefings. As the Duchess of Cornwall celebrates her 70th birthday, she could well be forgiven for occasionally putting her feet up like the majority of her retired contemporaries. Not much chance of that, it appears, as it is announced she is to take on a new patronage championing older people.In addition to some 90 charities and organisations she already represents, the Duchess will also lend her experience to a helpline to combat loneliness in older age.She joins the Prince of Wales in becoming an influential voice for older people, after he last week spoke out for the forgotten would-be workers aged over 50 who struggle unnoticed to find employment. A fellow party guest Dame Esther Rantzen has announced the Duchess is to be patron of her charity The Silver Line, with her 70th birthday placing her in the perfect position to help.Dame Esther said: “The Duchess has an understanding and empathy for older people who are so often forgotten and undervalued in today’s busy world.  “She cares about them, and values them as we do.”The Prince, too, has recently used his platform to speak up for older people, presenting awards to entrepreneurs over 50 during a visit to Wales last week.Speaking at Prime Cymru, the Prince’s initiative for “mature enterprise”, he told an audience that the difficulties faced by older workers are too often forgotten. Mario Testino also took this picture following Princess Charlotte's baptism To mark HRH The Duchess of Cornwall’s 70th Birthday, we are releasing this new portrait, taken by @MarioTestino. pic.twitter.com/tD05etWVl8— Clarence House (@ClarenceHouse) July 16, 2017 Highgrove House The Duchess is understood to be celebrating at HighgroveCredit:Chris Jackson/Getty The photographer was among several hundred guests invited to a Clarence House garden reception to acknowledge those the Duchess works with, from former Royal household staff to charity leaders. Referring to the Prince’s Trust, which supports young people in finding careers, he added: “What I am very pleased about is to be able to help with both ends of the spectrum, if you know what I mean.”Frequently people don’t realise the over-50s are in these difficult situations. Bespoke services for the 50+ age group, to assist with addressing their often multiple barriers, is not always so easy to find.”Which is another reason, ladies and gentlemen, why Prime Cymru I think is of such importance.” The Prince and Duchess are understood to be celebrating her birthday privately with family, following a party at Highgrove for friends on Saturday night.Though most women her age have long retired, there is no expectation in Royal circles that the Duchess will change her workload following the landmark birthday, continuing charity work in areas including children’s literacy, women’s empowerment and cancer care.Her portfolio of charities will remain around the same size in the foreseeable future, a Royal source confirmed, with no sense of slowing down as she aids the Prince in his public duties. Both will join the wider Royal family in supporting the Queen and representing her in public engagements as the Duke of Edinburgh retires in the autumn. The Duchess of Cambridge is turning 70Credit:Chris Jackson /Gettylast_img read more

John Lewis Christmas advert Watch Elton John play piano in heartwarming video

Elton John depicted in one of his most iconic performances in the 1970sCredit:John Lewis  John lewis  This year’s advert tells the story of Elton John’s life and how he came to play the piano as a young boy Credit:John lewis  John Lewis ad  “The ad tells the story of why Elton’s piano was more than just a gift and we hope to remind customers of that special moment when they’ve given a gift at Christmas time that they know will be treasured forever.” The set from the advert is from today on display John Lewis’s Oxford Street store where customers can explore Elton John’s dressing room, recording studio and living room sets from the advert.Craig Inglis, Partner and customer director, John Lewis & Partners said: “Think back to all of the Christmases that you have enjoyed over the years – I’m sure there is one very special gift that stands out above all others. That’s the magical feeling we wanted to bring to life this year. John Lewis’s 2018 Christmas advert tells the story of Sir Elton John being gifted a piano as a young boy. The story begins in present day and works backwards chronologically through Elton’s life and musical career, leading to the moment he received the special present of his grandmother’s piano that changed the course of his life.The advert’s narrative is summed up at the end, with the slogan “Some gifts are more than just a gift”.John Lewis will sell a range of pianos for the first time in 70 years, with the advert expected to drive parents and grandparents to buy pianos and keyboards as Christmas gifts.The range starts at around £150 for a basic keyboard, with upright wooden pianos at the top of the range for around £1,500.  Elton John said: “The John Lewis Christmas campaign has so many warm memories for me and my family.”It’s been a lovely opportunity for me to reflect on my life in music and the incredible journey I have been on, and how first playing my Grandmother’s piano marks the moment when music came into my life.”The ad is absolutely fantastic and I’ve truly loved every minute of being a part of it.”What do you think of this year’s John Lewis Christmas advert? How does it compare to adverts from previous years? Let us know what you think in the comments section below. To join the conversation simply log in to your Telegraph account or register for free, here. View latest offers from John Lewis​ Want the best of The Telegraph direct to your email and WhatsApp? Sign up to our free twice-daily  Front Page newsletter and new  audio briefings. read more

Smith Warner and Bancroft to leave South Africa

This video grab taken from a footage released by AFP TV shows Australia’s captain Steve Smith speaking during a press conference in Cape Town, on March 24, 2018 as he admitted to ball-tampering during the third Test against South Africa. (Photo: AFP)Steven Smith, David Warner and Cameron Bancroft will leave South Africa on Wednesday in the wake of their pre-meditated plan to tamper with the ball on the third day of the Cape Town Test against South Africa. Australia have named Matt Renshaw, Glenn Maxwell and Joe Burns as replacements for the fourth Test in Johannesburg starting on Friday.Australia coach Darren Lehmann was found to have had no prior knowledge of the ball-tampering plan, and will remain in his position. Wicketkeeper Tim Paine has been officially appointed captain of the Australian team; he had led the team on the fourth day of the Newlands Test after Smith and Warner were stood down as captain and vice-captain. That decision, which was soon followed by ICC sanctions for Smith and Bancroft, had been taken following tremendous pressure from back home, including the Prime Minister Malcolm Turnbull.David WarnerCA chief executive James Sutherland made the latest announcements at a press conference in Johannesburg on Tuesday during which he apologised for the Australian team’s conduct at Newlands. He said that the Cricket Australia investigation had found that only Smith, Warner and Bancroft had been in on the plot to tamper with the ball, and that “significant” sanctions would be issued in 24 hours once the investigations were completed.“In view of the broader reputational and integrity issues involved, the sanctions that will be contemplated are significant,” Sutherland said. “The process must therefore be thorough to ensure that all relevant issues have been examined.“I understand the appetite for urgency given the reputation of Australia as a sporting nation has been damaged in the eyes of many. However, urgency must be balanced with due process given the serious implications for all involved. In addition to sanctions for individuals, Cricket Australia will initiate an independent review into the conduct and culture of our Australian men’s teams.Cameron Bancroft (Getty Images)“We will have more to say about this review in the coming days, but it will be conducted by an expert panel who will report to the Cricket Australia Board.”CA chairman, David Peever said: “We understand and share the anger of fans and the broader Australian community about the events that unfolded in Cape Town on Saturday. This issue goes beyond the technical nature of the offences and various codes of conduct. It is about the integrity and reputation of Australian Cricket and Australian sport. Ultimately, it is about whether Australians can feel proud of their national sporting teams. That depends as much on the way the players conduct themselves, as it does about winning or losing.”Sutherland said they would use this as an opportunity to “review the culture and conduct of our international teams”. “If this has damaged ability of kids to play the game, love the game and idolise their heroes it is a sorry state and we need to do everything we can to address it.” (ESPNcricinfo) Share this:Click to share on Twitter (Opens in new window)Click to share on Facebook (Opens in new window)RelatedSmith, Bancroft will not challenge ball-tampering sanctionsApril 4, 2018In “Sports”Warner decides not to appeal against Cricket Australia banApril 5, 2018In “Sports”Smith quits as Royals captain after scandalMarch 26, 2018In “Sports” read more

252 processing cores used to crack encryption in record time

first_imgPairing-based cryptography has been considered one of the most promising methods of generating future encryption systems. That may be out the window now as researchers from Fujitsu Laboratories in Japan have announced that they managed to crack a 278-digit long (923-bit) encryption key used in a pairing-based cryptography system in a world record 148.2 days. If that doesn’t sound very impressive, consider that researchers originally thought it would take hundreds of thousands of years to accomplish this feat.The Fujitsu researchers made use of 21 computers with a total of 252 processing cores. There’s no simple trick to exploiting pairing-based cryptography; it’s all about the muscle you can bring to bear on the problem. Researchers used new data optimization techniques, two-dimensional search algorithms, and better parallelization to crunch the bits. In 2009, another group of researchers managed to crack a 676-bit pairing-based key, but that is several hundred times less complex than the 923-bit key from this project.Pairing-based cryptography is not in wide use, but there have been plans to use it more widely. The early promise of pairing-based cryptography is fading, but what does this mean for other standards? The researchers say it is their hope that this data will serve to help determine what role, if any, pairing-based cryptography will have in future security standards.As the technology we can bring to bear on any problem increases, previously uncrackable systems are going to be increasingly at risk. GSM was considered secure when it was conceived, but with a few terabytes of rainbow tables, it can be decoded. The encryption we rely on for privacy in the future might be no different as CPU power continues to ramp up.via Techweek Europelast_img read more

Allegri Juventus are growing in confidence

first_imgJuventus boss Massimiliano Allegri believes that their dominant display in the 1-0 Champions League win at Manchester United proves that the squad is growing in confidenceThe Serie A champions outclassed United at Old Trafford and had several chances to extend their lead in the first-half.However, a 17th-minute Paulo Dybala goal was enough to secure the win for Juventus and extend their lead in Group H to five points.“We played well especially in the first half, when we managed to slow the tempo down and break forward at pace,” Allegri told reporters on the club website.“In the second half we created some decent openings but our final ball was off. That’s something we need to work on but the lads still deserve credit tonight.“Our wide players showed great movement and made it hard for the opposition to keep tabs on them.harry maguire, manchester UnitedMaguire says United need to build on today’s win George Patchias – September 14, 2019 Harry Maguire wants his United teammates to build on the victory over Leicester City.During the summer, Harry Maguire was referred to as the ultimate…“We’ve grown in confidence – that was already clear in Valencia. Tonight we read the game well and slowed it down when we needed to.”The two teams will meet again in Turin on November 7, where a win will secure Juventus a spot in the knockout stages of the Champions League.United counterpart Jose Mourinho conceded that they were second-best to Juventus on Tuesday, while Cristiano Ronaldo thanked the home fans for the warm reception he received.Lightning in the Theatre of Dreams💪#MUFCJuve #UCL #FinoAllaFine ⚪⚫ pic.twitter.com/BuS3G2Zqml— Daniele Rugani (@DanieleRugani) October 23, 2018last_img read more

Shelter your sensitive plants tonight

first_imgGardeners should consider sheltering their sensitive plants tonight.The National Weather Service is warning that temperatures in the region could dip into the 30s over the next few nights as sunshine rules during the daytime.A widespread freeze is not expected. However, some sheltered and higher elevations could get the first frost of the season.Here’s the text of the Weather Service’s statement:338 AM PDT MON OCT 24 2011…FROSTY CONDITIONS POSSIBLE TONIGHT THROUGH WEDNESDAY MORNING…COOLER AND DRIER AIR WILL SETTLE IN ACROSS THE REGION TODAY.HIGH PRESSURE WILL STRENGTHEN TODAY AND REMAIN OVER THE AREA THROUGHWEDNESDAY. SKIES WILL LIKELY CLEAR TONIGHT AS WEAK OFFSHORE WINDSDEVELOP…ALLOWING OVERNIGHT TEMPERATURES TO LOWER INTO THE 30SFOR MANY VALLEY AND COASTAL LOCATIONS TONIGHT AND TUESDAY NIGHT.WHILE WIDESPREAD FREEZING TEMPERATURES ARE NOT EXPECTED…TEMPERATURES IN THE LOWER TO MID 30S CAN GENERATE FROST ON A CLEARNIGHT…AND DAMAGE SENSITIVE OUTDOOR PLANTS. THIS COULD BE THE FIRSTFROST CONDITIONS FOR THE FALL. THOSE WITH SENSITIVE VEGETATION MAYWANT TO TAKE NECESSARY PRECAUTIONS TO PROTECT THEIR PLANTS.last_img read more

Judge Allows Gay Marriages To Continue In Alaska

first_imgA federal court judge has denied a request from the state of Alaska to put gay marriages on hold until an appeal is heard.U.S. District Court Judge Timothy Burgess denied the state’s request for a stay on Tuesday, two days after he struck down the state’s ban on gay marriage as unconstitutional.The state intends to appeal that decision to the 9th Circuit Court. The state could also ask that court to delay gay marriages from going forward but the court has allowed marriages to continue in other states within its jurisdiction.A message left with the state attorney’s office after hours Tuesday wasn’t immediately returned.Gay couples began applying for marriage licenses on Monday, triggering a three-day wait period. But in at last two cases, couples were granted waivers of the rule and were married in Barrow.last_img read more

Aim at 275 cr saplings says Collector Ayesha Masrat Khanam to

first_imgVikarabad: District Collector Ayesha Masrat Khanam suggested the sarpanches to take up the responsibility of completing the construction of individual lavatories and make villages Open Defecation Free on part of Swachh Bharat programme. An awareness programme was orgnanised on construction of individual lavatories and Haritha Haram for sarpanches, here at Ambedkar Bhavan on Tuesday. Also Read – Secunderabad: Major General N Srinivas Rao makes farewell visit to AOC Advertise With Us Speaking on the occasion, the Collector said though this programme has been taken up for five years, the district did not become ODF. Awareness programmes are being conducted for the public and sarpanches also take initiative and sensitise people of respective villages to complete the task, she said. She assured of complete cooperation from the officials. Speaking about the Haritha Haram programme, the Collector said the target for this year is to plant 2.75 crore saplings. She said nurseries in the villages should be protected and make sure that palm and tamarind trees each five percent in every nursery. Also Read – Kolkata artists giving final touches to 24 ft clay Ganesh idol Advertise With Us She suggested them to take necessary steps to improve ground water levels and see that water harvesting pits be constructed. She announced that Rs 4,000 will be given towards construction of the pits. She also explained them about segregation of wet and dry waste in the villages. MLA Dr Anand said all these works should begin with the houses of sarpanches. RDO Vishwanadham, DWO Jyotsna, SC Corporation ED Moses, MPDOs, sarpanches were present.last_img read more

Future of Storytelling PopUp VR Arcade Is Coming to Manhattan

first_imgManhattan is getting a location-based virtual reality (VR) pop-up, courtesy of Future of Storytelling: The temporary Story Arcade will open its doors in the Starrett-Lehigh building this coming Saturday, and host a number of VR experiences, including Felix & Paul Studio’s “Traveling While Black,” Fable’s “Wolves in the Walls” and MWM Immersive’s immersive theater VR production “Chained: A Victorian Nightmare.”The Story Arcade space will be open to the public for about a month. Tickets can be reserved online, and start at $100, offering access to all experiences except “Chained.” Combo tickets that also include “Chained” are going for $150.“Chained: A Victorian Nightmare” first premiered in Los Angeles in December. The Victorian era VR experience incorporates live actors, who improvise to create a unique story for each and every participant. “There is no pre-recorded dialogue of any kind,” said “Chained” creator Justin Denton in an interview with Variety in December. “No one will have the experience that you just had.” Popular on Variety “Traveling While Black” is a moving VR documentary about racism in America from Academy Award-winning director Roger Ross Williams, which is drawing a line from the risks African-American travelers were facing back in the 1950s to modern-day police violence. “We are still at risk when we are traveling around,” said Williams in a recent interview with Variety. “We are always on edge, we are always at risk when we walk out of the door in this country.”“Wolves in the Walls” is a VR adaptation of Neil Gaiman’s children’s book by the same title that also doubles as a first step towards autonomous avatars in VR. The experience’s main character Lucy interacts with the viewer, acknowledging their presence and treating them as her imaginary friend.Other VR experiences shown as part of the Story Arcade include “Jurassic Flight,” a flight simulator that leverages a robotic motion platform, the U.S. premiere of “Algorithmic Perfumery,” the multi-sensory space travel VR experience “Cosmic Sleep,” “Munduruku: The Fight to Defend the Heart of the Amazon,” a multi-sensory VR experience produced in collaboration with Greenpeace, and the civil rights VR documentary “I Am A Man.”center_img ×Actors Reveal Their Favorite Disney PrincessesSeveral actors, like Daisy Ridley, Awkwafina, Jeff Goldblum and Gina Rodriguez, reveal their favorite Disney princesses. Rapunzel, Mulan, Ariel,Tiana, Sleeping Beauty and Jasmine all got some love from the Disney stars.More VideosVolume 0%Press shift question mark to access a list of keyboard shortcutsKeyboard Shortcutsplay/pauseincrease volumedecrease volumeseek forwardsseek backwardstoggle captionstoggle fullscreenmute/unmuteseek to %SPACE↑↓→←cfm0-9Next UpJennifer Lopez Shares How She Became a Mogul04:350.5x1x1.25×1.5x2xLive00:0002:1502:15last_img read more

MIT Robot Learns to ID Objects by Sight Touch

first_img Humans’ five senses work together to reveal what we see, hear, smell, taste, and touch.But robots are still learning to understand different tactile signals.To move the process along, a team from MIT’s Computer Science and Artificial Intelligence Laboratory (CSAIL) developed a predictive AI that can learn to see by touching, and learn to feel by seeing.The system creates realistic signals from visual inputs to predict with which object it is making physical contact.Using a KUKU robot arm and GelSight tactile sensor (designed by another group at MIT), researchers recorded nearly 200 objects—tools, household products, fabrics, etc.—being touched more than 12,000 times.By breaking down those video clips into static frames, the team compiled a dataset of more than 3 million visual/tactile-paired images, known as “VisGel.”“By looking at the scene, our model can imagine the feeling of touching a flat surface or a sharp edge,” lead study author Yunzhu Li, a CSAIL PhD student, said in a statement.“By blindly touching around, our model can predict the interaction with the environment purely from tactile feelings,” he continued. “Bringing these two senses together could empower the robot and reduce the data we might need for tasks involving manipulating and grasping objects.”During testing, if the model was fed tactile data on a shoe, for instance, it could produce an image of where the shoe was most likely to be touched. The same goes for a computer mouse, box, cup, T-shirt, hammer—whatever its automated heart desires.This type of ability, CSAIL said, could be useful for tasks in which there is no visual data: like when a light is off, or someone is indiscriminately reaching into an unknown area.Moving forward, the team plans to increase the size and diversity of its dataset  by collecting input in more unstructured areas (i.e. outside a controlled environment). Or by using a new MIT-designed tactile smart-glove.Even with the help of a sensor-packed mitt, there are certain details that can be tricky to infer from switching models—details that even humans can’t ascertain without using more than one sense. Like identifying the color of an object by touching it or determining how soft a sofa is without actually pressing on it.CSAIL invented a similar system earlier this year: The “RoCycle” uses a soft Teflon hand covered in tactile sensors to detect an object’s size and stiffness—no visual cues necessary.Basically, it squeezes cups, boxes, and cans to determine their makeup, and, ultimately, their recyclability.A collaboration with Yale University, RoCycle demonstrates the limits of sight-based sorting; it can distinguish between two identical-looking Starbucks cups made of paper and plastic that would give vision systems (and the human eye) trouble.More on Geek.com:MIT Robot Helps Lift Objects By Looking at Your BicepsThis AI Neural Network Gives Cats Creepy, Cute NamesDomino’s Will Use AI-Powered Cameras to Check Pizza Orders Robot Dog Astro Can Sit, Lie Down, and Save LivesYou Can’t Squish This Cockroach-Inspired Robot Stay on targetlast_img read more

Asansol Durgapur Development Authority to launch app to pay off dues

first_imgKolkata: Asansol Durgapur Development Authority (ADDA) is all set to introduce an app to facilitate payment of dues by the residents, right through their android or iOS mobile phone. ADDA will soon be integrating all the offices and shops located on land under it for systematic mopping up of the rent dues. It may be mentioned that a new payment gateway service namely “ADDA online” was launched in July last year, so that residents could pay all sort of taxes online right from their home. In the second phase, ADDA will integrate shops and both government and private offices that are entitled to pay rent to it for being situated on its land. “Most of these businessmen would visit our office once in three months, collect details of payments and then clear the dues. Delayed payments have become a cause of worry. Hence, we have decided to launch an app ensuring on-time payments. They will receive the details of their payment dues by 5th of every month and have to clear off the dues by the end of the month. They will have deposit the amount in an account of a private bank with which we have tied up for this purpose,” Arun Prasad, CEO of ADDA said adding that they are in talks with a couple of nationalised banks too in this regard. Since its inception, ADDA, through its online payment gateway, has earned revenue of Rs 11 crore with more than 3,000 customers being registered. The payment gateway was devised for collection of various fees like development charges, water charges, mortgage fees, transfer fees, ground rent among others. Presently, payment for as many as nineteen fees can be done through this portal. With the integration of shops and offices, ADDA will be earning at least Rs 3 crore more. Also Read – Heavy rain hits traffic, flights”The manual system to pay fees took a lot of time in processing and reflecting in our system. However, through this app-based online mode of payment, it will get processed immediately. Most importantly, residents do not have to take any hassle of traveling all the way to our office for payments,” chairman of ADDA Tapas Banerjee said. The app-based service will be launched in July when ADDA will observe the first anniversary of its online payment system. ADDA covers an extensive area of 1603 square km comprising two municipal corporations and eight development blocks.last_img read more

Fire hydrant stolen leaving water to shoot out like a fountain

first_imgWebsiteWebsiteWebsite WebsiteWebsiteWebsite WebsiteWebsiteWebsite A fire hydrant was stolen in Leonards Road yesterday afternoon (March 1).Water was seen pouring out at a rate of knots.Many residents and motorists reported that water was flowing freely down the street and into the drain.Also read: Update: Residents to be without water for 2 days due to maintenanceAlso read: Warning: Water to be shut off for 24 hours while uThukela conduct maintenancePeople were shocked at just how much water was being wasted, without anyone attending to the problem. IFP councillor Abbas Warasally commented that people know Ladysmith faces a water problem, yet they still go and destroy the infrastructure of the town.uThukela has since responded to the scene and closed off the water at the hydrant.Click to receive news links via WhatsApp. Or  for the latest news, visit our webpage or follow us on Facebook and Twitter. Join us there!last_img read more

Build a C Binary search tree Tutorial

first_imgA binary tree is a hierarchical data structure whose behavior is similar to a tree, as it contains root and leaves (a node that has no child). The root of a binary tree is the topmost node. Each node can have at most two children, which are referred to as the left child and the right child. A node that has at least one child becomes a parent of its child. A node that has no child is a leaf. In this tutorial, you will be learning about the Binary tree data structures, its principles, and strategies in applying this data structures to various applications. This C++ tutorial has been taken from C++ Data Structures and Algorithms. Read more here. Take a look at the following binary tree: From the preceding binary tree diagram, we can conclude the following: The root of the tree is the node of element 1 since it’s the topmost node The children of element 1 are element 2 and element 3 The parent of elements 2 and 3 is 1 There are four leaves in the tree, and they are element 4, element 5, element 6, and element 7 since they have no child This hierarchical data structure is usually used to store information that forms a hierarchy, such as a file system of a computer. Building a binary search tree ADT A binary search tree (BST) is a sorted binary tree, where we can easily search for any key using the binary search algorithm. To sort the BST, it has to have the following properties: The node’s left subtree contains only a key that’s smaller than the node’s key The node’s right subtree contains only a key that’s greater than the node’s key You cannot duplicate the node’s key value By having the preceding properties, we can easily search for a key value as well as find the maximum or minimum key value. Suppose we have the following BST: As we can see in the preceding tree diagram, it has been sorted since all of the keys in the root’s left subtree are smaller than the root’s key, and all of the keys in the root’s right subtree are greater than the root’s key. The preceding BST is a balanced BST since it has a balanced left and right subtree. We also can define the preceding BST as a balanced BST since both the left and right subtrees have an equal height (we are going to discuss this further in the upcoming section). However, since we have to put the greater new key in the right subtree and the smaller new key in the left subtree, we might find an unbalanced BST, called a skewed left or a skewed right BST. Please see the following diagram: The preceding image is a sample of a skewed left BST, since there’s no right subtree. Also, we can find a BST that has no left subtree, which is called a skewed right BST, as shown in the following diagram: As we can see in the two skewed BST diagrams, the height of the BST becomes taller since the height equals to N – 1 (where N is the total keys in the BST), which is five. Comparing this with the balanced BST, the root’s height is only three. To create a BST in C++, we need to modify our TreeNode class in the preceding binary tree discussion, Building a binary tree ADT. We need to add the Parent properties so that we can track the parent of each node. It will make things easier for us when we traverse the tree. The class should be as follows: class BSTNode{public: int Key; BSTNode * Left; BSTNode * Right; BSTNode * Parent;}; There are several basic operations which BST usually has, and they are as follows: Insert() is used to add a new node to the current BST. If it’s the first time we have added a node, the node we inserted will be a root node. PrintTreeInOrder() is used to print all of the keys in the BST, sorted from the smallest key to the greatest key. Search() is used to find a given key in the BST. If the key exists it returns TRUE, otherwise it returns FALSE. FindMin() and FindMax() are used to find the minimum key and the maximum key that exist in the BST. Successor() and Predecessor() are used to find the successor and predecessor of a given key. We are going to discuss these later in the upcoming section. Remove() is used to remove a given key from BST. Now, let’s discuss these BST operations further. Inserting a new key into a BST Inserting a key into the BST is actually adding a new node based on the behavior of the BST. Each time we want to insert a key, we have to compare it with the root node (if there’s no root beforehand, the inserted key becomes a root) and check whether it’s smaller or greater than the root’s key. If the given key is greater than the currently selected node’s key, then go to the right subtree. Otherwise, go to the left subtree if the given key is smaller than the currently selected node’s key. Keep checking this until there’s a node with no child so that we can add a new node there. The following is the implementation of the Insert() operation in C++: BSTNode * BST::Insert(BSTNode * node, int key){ // If BST doesn’t exist // create a new node as root // or it’s reached when // there’s no any child node // so we can insert a new node here if(node == NULL) { node = new BSTNode; node->Key = key; node->Left = NULL; node->Right = NULL; node->Parent = NULL; } // If the given key is greater than // node’s key then go to right subtree else if(node->Key Right = Insert(node->Right, key); node->Right->Parent = node; } // If the given key is smaller than // node’s key then go to left subtree else { node->Left = Insert(node->Left, key); node->Left->Parent = node; } return node;} As we can see in the preceding code, we need to pass the selected node and a new key to the function. However, we will always pass the root node as the selected node when performing the Insert() operation, so we can invoke the preceding code with the following Insert() function: void BST::Insert(int key){ // Invoking Insert() function // and passing root node and given key root = Insert(root, key);} Based on the implementation of the Insert() operation, we can see that the time complexity to insert a new key into the BST is O(h), where h is the height of the BST. However, if we insert a new key into a non-existing BST, the time complexity will be O(1), which is the best case scenario. And, if we insert a new key into a skewed tree, the time complexity will be O(N), where N is the total number of keys in the BST, which is the worst case scenario. Traversing a BST in order We have successfully created a new BST and can insert a new key into it. Now, we need to implement the PrintTreeInOrder() operation, which will traverse the BST in order from the smallest key to the greatest key. To achieve this, we will go to the leftmost node and then to the rightmost node. The code should be as follows: void BST::PrintTreeInOrder(BSTNode * node){ // Stop printing if no node found if(node == NULL) return;// Get the smallest key first// which is in the left subtreePrintTreeInOrder(node->Left);// Print the keystd::cout Key Right);} Since we will always traverse from the root node, we can invoke the preceding code as follows: void BST::PrintTreeInOrder(){ // Traverse the BST // from root node // then print all keys PrintTreeInOrder(root); std::cout The time complexity of the PrintTreeInOrder() function will be O(N), where N is the total number of keys for both the best and the worst cases since it will always traverse to all keys.Finding out whether a key exists in a BSTSuppose we have a BST and need to find out if a key exists in the BST. It’s quite easy to check whether a given key exists in a BST, since we just need to compare the given key with the current node. If the key is smaller than the current node’s key, we go to the left subtree, otherwise we go to the right subtree. We will do this until we find the key or when there are no more nodes to find. The implementation of the Search() operation should be as follows:BSTNode * BST::Search(BSTNode * node, int key){ // The given key is // not found in BST if (node == NULL) return NULL; // The given key is found else if(node->Key == key) return node; // The given is greater than // current node’s key else if(node->Key Right, key); // The given is smaller than // current node’s key else return Search(node->Left, key);} Since we will always search for a key from the root node, we can create another Search() function as follows: bool BST::Search(int key){ // Invoking Search() operation // and passing root node BSTNode * result = Search(root, key);// If key is found, returns TRUE// otherwise returns FALSEreturn result == NULL ?false :true;} The time complexity to find out a key in the BST is O(h), where h is the height of the BST. If we find a key which lies in the root node, the time complexity will be O(1), which is the best case. If we search for a key in a skewed tree, the time complexity will be O(N), where N is the total number of keys in the BST, which is the worst case. Retrieving the minimum and maximum key values Finding out the minimum and maximum key values in a BST is also quite simple. To get a minimum key value, we just need to go to the leftmost node and get the key value. On the contrary, we just need to go to the rightmost node and we will find the maximum key value. The following is the implementation of the FindMin() operation to retrieve the minimum key value, and the FindMax() operation to retrieve the maximum key value: int BST::FindMin(BSTNode * node){ if(node == NULL) return -1; else if(node->Left == NULL) return node->Key; else return FindMin(node->Left);}int BST::FindMax(BSTNode * node){if(node == NULL)return -1;else if(node->Right == NULL)return node->Key;elsereturn FindMax(node->Right);} We return -1 if we cannot find the minimum or maximum value in the tree, since we assume that the tree can only have a positive integer. If we intend to store the negative integer as well, we need to modify the function’s implementation, for instance, by returning NULL if no minimum or maximum values are found. As usual, we will always find the minimum and maximum key values from the root node, so we can invoke the preceding operations as follows: int BST::FindMin(){ return FindMin(root);}int BST::FindMax(){return FindMax(root);} Similar to the Search() operation, the time complexity of the FindMin() and FindMax() operations is O(h), where h is the height of the BST. However, if we find the maximum key value in a skewed left BST, the time complexity will be O(1), which is the best case, since it doesn’t have any right subtree. This also happens if we find the minimum key value in a skewed right BST. The worst case will appear if we try to find the minimum key value in a skewed left BST or try to find the maximum key value in a skewed right BST, since the time complexity will be O(N). Finding out the successor of a key in a BST Other properties that we can find from a BST are the successor and the predecessor. We are going to create two functions named Successor() and Predecessor() in C++. But before we create the code, let’s discuss how to find out the successor and the predecessor of a key of a BST. In this section, we are going to learn about the successor first, and then we will discuss the predecessor in the upcoming section. There are three rules to find out the successor of a key of a BST. Suppose we have a key, k, that we have searched for using the previous Search() function. We will also use our preceding BST to find out the successor of a specific key. The successor of k can be found as follows: If k has a right subtree, the successor of k will be the minimum integer in the right subtree of k. From our preceding BST, if k = 31, Successor(31) will give us 53 since it’s the minimum integer in the right subtree of 31. Please take a look at the following diagram: If k does not have a right subtree, we have to traverse the ancestors of k until we find the first node, n, which is greater than node k. After we find node n, we will see that node k is the maximum element in the left subtree of n. From our preceding BST, if k = 15, Successor(15) will give us 23 since it’s the first greater ancestor compared with 15, which is 23. Please take a look at the following diagram: If k is the maximum integer in the BST, there’s no successor of k. From the preceding BST, if we run Successor(88), we will get -1, which means no successor has been found, since 88 is the maximum key of the BST. Based on our preceding discussion about how to find out the successor of a given key in a BST, we can create a Successor() function in C++ with the following implementation: int BST::Successor(BSTNode * node){ // The successor is the minimum key value // of right subtree if (node->Right != NULL) { return FindMin(node->Right); } // If no any right subtree else { BSTNode * parentNode = node->Parent; BSTNode * currentNode = node; // If currentNode is not root and// currentNode is its right children// continue moving upwhile ((parentNode != NULL) &&(currentNode == parentNode->Right)){currentNode = parentNode;parentNode = currentNode->Parent;}// If parentNode is not NULL// then the key of parentNode is// the successor of nodereturn parentNode == NULL ?-1 :parentNode->Key;}} However, since we have to find a given key’s node first, we have to run Search() prior to invoking the preceding Successor() function. The complete code for searching for the successor of a given key in a BST is as follows: int BST::Successor(int key){ // Search the key’s node first BSTNode * keyNode = Search(root, key);// Return the key.// If the key is not found or// successor is not found,// return -1return keyNode == NULL ?-1 :Successor(keyNode);} From our preceding Successor() operation, we can say that the average time complexity of running the operation is O(h), where h is the height of the BST. However, if we try to find out the successor of a maximum key in a skewed right BST, the time complexity of the operation is O(N), which is the worst case scenario. Finding out the predecessor of a key in a BST If k has a left subtree, the predecessor of k will be the maximum integer in the left subtree of k. From our preceding BST, if k = 12, Predecessor(12) will be 7 since it’s the maximum integer in the left subtree of 12. Please take a look at the following diagram: If k does not have a left subtree, we have to traverse the ancestors of k until we find the first node, n, which is lower than node k. After we find node n, we will see that node n is the minimum element of the traversed elements. From our preceding BST, if k = 29, Predecessor(29) will give us 23 since it’s the first lower ancestor compared with 29, which is 23. Please take a look at the following diagram: If k is the minimum integer in the BST, there’s no predecessor of k. From the preceding BST, if we run Predecessor(3), we will get -1, which means no predecessor is found since 3 is the minimum key of the BST. Now, we can implement the Predecessor() operation in C++ as follows: int BST::Predecessor(BSTNode * node){ // The predecessor is the maximum key value // of left subtree if (node->Left != NULL) { return FindMax(node->Left); } // If no any left subtree else { BSTNode * parentNode = node->Parent; BSTNode * currentNode = node; // If currentNode is not root and// currentNode is its left children// continue moving upwhile ((parentNode != NULL) &&(currentNode == parentNode->Left)){currentNode = parentNode;parentNode = currentNode->Parent;}// If parentNode is not NULL// then the key of parentNode is// the predecessor of nodereturn parentNode == NULL ?-1 :parentNode->Key;}} And, similar to the Successor() operation, we have to search for the node of a given key prior to invoking the preceding Predecessor() function. The complete code for searching for the predecessor of a given key in a BST is as follows: int BST::Predecessor(int key){ // Search the key’s node first BSTNode * keyNode = Search(root, key);// Return the key.// If the key is not found or// predecessor is not found,// return -1return keyNode == NULL ?-1 :Predecessor(keyNode);} Similar to our preceding Successor() operation, the time complexity of running the Predecessor() operation is O(h), where h is the height of the BST. However, if we try to find out the predecessor of a minimum key in a skewed left BST, the time complexity of the operation is O(N), which is the worst case scenario. Removing a node based on a given key The last operation in the BST that we are going to discuss is removing a node based on a given key. We will create a Remove() operation in C++. There are three possible cases for removing a node from a BST, and they are as follows: Removing a leaf (a node that doesn’t have any child). In this case, we just need to remove the node. From our preceding BST, we can remove keys 7, 15, 29, and 53 since they are leaves with no nodes. Removing a node that has only one child (either a left or right child). In this case, we have to connect the child to the parent of the node. After that, we can remove the target node safely. As an example, if we want to remove node 3, we have to point the Parent pointer of node 7 to node 12 and make the left node of 12 points to 7. Then, we can safely remove node 3. Removing a node that has two children (left and right children). In this case, we have to find out the successor (or predecessor) of the node’s key. After that, we can replace the target node with the successor (or predecessor) node. Suppose we want to remove node 31, and that we want 53 as its successor. Then, we can remove node 31 and replace it with node 53. Now, node 53 will have two children, node 29 in the left and node 88 in the right. Also, similar to the Search() operation, if the target node doesn’t exist, we just need to return NULL. The implementation of the Remove() operation in C++ is as follows: BSTNode * BST::Remove( BSTNode * node, int key){ // The given node is // not found in BST if (node == NULL) return NULL; // Target node is foundif (node->Key == key){// If the node is a leaf node// The node can be safely removedif (node->Left == NULL && node->Right == NULL)node = NULL;// The node have only one child at rightelse if (node->Left == NULL && node->Right != NULL){// The only child will be connected to// the parent’s of node directlynode->Right->Parent = node->Parent; // Bypass nodenode = node->Right;}// The node have only one child at leftelse if (node->Left != NULL && node->Right == NULL){// The only child will be connected to// the parent’s of node directlynode->Left->Parent = node->Parent; // Bypass nodenode = node->Left;}// The node have two children (left and right)else{// Find successor or predecessor to avoid quarrelint successorKey = Successor(key);// Replace node’s key with successor’s keynode->Key = successorKey; // Delete the old successor’s keynode->Right = Remove(node->Right, successorKey);}}// Target node’s key is smaller than// the given key then search to rightelse if (node->Key Right = Remove(node->Right, key);// Target node’s key is greater than// the given key then search to leftelsenode->Left = Remove(node->Left, key);// Return the updated BSTreturn node;} Since we will always remove a node starting from the root node, we can simplify the preceding Remove() operation by creating the following one: void BST::Remove(int key){ root = Remove(root, key);} As shown in the preceding Remove() code, the time complexity of the operation is O(1) for both case 1 (the node that has no child) and case 2 (the node that has only one child). For case 3 (the node that has two children), the time complexity will be O(h), where h is the height of the BST, since we have to find the successor or predecessor of the node’s key. If you found this tutorial useful, do check out the book C++ Data Structures and Algorithms for more useful material on data structure and algorithms with real-world implementation in C++. Read next Working with shaders in C++ to create 3D games Getting Inside a C++ Multithreaded Application Understanding the Dependencies of a C++ Applicationlast_img read more

Question mark over Erdogan as Turk parties jockey for power

first_img Sponsored Stories ISTANBUL (AP) — Two weeks after Turkey’s parliamentary elections, experts agree on one thing: No one really knows what’s going to happen next.Turkey’s June 7 election left Turkey’s long-ruling Justice and Development Party, known by Turkish acronym AKP, short of the majority it needs to govern alone, meaning it will have to turn to at least one of the three opposition parties to secure its hold on government. Milstead says best way to stop wrong-way incidents is driving sober Turkey’s President Recep Tayyip Erdogan, waves after his speech following a traditional iftar, the first meal to break the Ramadan fast, during a visit at the Midyat refugee camp in Mardin, southeastern Turkey, near the Syrian border, Saturday, June 20, 2015. Erdogan visited the camp which is sheltering those who have fled the 4-year conflict in neighbouring Syria. The UN refugee agency has said the number of Syrian refugees seeking its help now tops two-million – and could be far higher. Turkey is the world’s biggest refugee host with 1.59 million refugees, according to the most recent U.N. figures. (AP Photo/Emrah Gurel) Here’s how to repair and patch damaged drywall “If they can’t do that … Then I’m afraid it’s the good old authoritarian politics we’re going to be dealing with,” Kalaycioglu said.___Suzan Fraser reported from Ankara.Copyright © The Associated Press. All rights reserved. This material may not be published, broadcast, rewritten or redistributed. “I can take Turkey back to those days when its star glittered,” the book quotes Gul as saying.Then there’s the prospect of political mischief. Lawmakers could be enticed to defect from the opposition in return for ministerial appointments, for example. Erdogan’s critics fear his party could deliberately sabotage coalition talks, using the instability to argue for a re-run of the election in the hope of clawing back its majority.In comments carried Sunday by Turkey’s state-run Anadolu Agency, Erdogan hinted that his patience with the coalition-building process would be limited, railing against the prospect of “gridlock” if a government could not be formed quickly.“If politicians fail to resolve this issue, the sole reference point to resolve it is the nation,” he said in an apparent reference to the possibility of a new vote.Turks will get an early hint of which way things are going next week, when lawmakers are formally sworn in and elect a speaker. Kalaycioglu, who is critical of Erdogan, said there might just be a chance that the opposition parties can elect a non-AKP speaker. That, he said, would be a sign that Erdogan’s political fortunes were turning after 13 years in power. Quick workouts for men Ex-FBI agent details raid on Phoenix body donation facilitycenter_img Comments   Share   New Valley school lets students pick career-path academies Negotiating such a coalition will be complicated by the vitriol of the campaign, the differences between the four camps and the ambitions of President Recep Tayyip Erdogan, still a dominant force in Turkish politics despite his theoretically neutral role as head of state.“Neither can I or anyone else make any predictions as to what’s happening,” said Ersin Kalaycioglu, a professor of Turkish politics at Sabanci University in Istanbul.Sinan Ciddi, the director of the Institute of Turkish Studies at Georgetown University, said he wouldn’t rule out anything either.“There are as many credible scenarios out there as there are plausible political parties,” he said.One of the more credible ones involves a deal between Turkey’s ruling party and the hardline nationalist party MHP, which opposes the two-year-old peace process with Turkey’s autonomy-seeking Kurdish rebels. Both parties sit on the right wing of Turkish politics, but such a deal could damage AKP’s relationship with Kurdish voters, a key constituency.Alternatively, AKP could swallow its pride and strike a deal with its arch-nemesis, the secular CHP. Such a pairing would have an unassailable majority, but the rivalry between the two runs so deep it’s difficult to envision them acting in tandem. 5 things to look for when selecting an ophthalmologist Top Stories Perhaps most importantly, all the opposition parties want Erdogan to stay out of politics. It’s hard to see the notoriously outspoken president backing away quietly.It’s just about conceivable that Turkey’s three opposition parties, including the leftist HDP, could all band together and freeze AKP out of power, a scenario floated by Sukru Kucuksahin, a columnist for the secular-minded Hurriyet newspaper.But even he acknowledged that was a long shot.Ilnur Cevik, a columnist at for the pro-government Daily Sabah said coalition-building would be difficult because of “deep-rooted enmities” although he said a tie-up between AKP and the nationalists was the most likely bet. As for an alliance with the secularists, Cevik said, that would leave a bad taste in supporters’ mouth.“The grassroots don’t want it,” he said.There are personal rivalries at play too, with some observers warning of a struggle within the ruling party itself. One wild card is former President Abdullah Gul, a co-founder of AKP still popular within the party. Gul has long been seen as an Erdogan ally, but a provocative memoir just published by one of Gul’s former aides reads like a call for a return to frontline politics. The difference between men and women when it comes to painlast_img read more

Greece is making progress in Cruise Tourism says Kountoura

first_imgCruise Tourism is a government agenda priority, Greek Tourism Minister Elena Kountoura said this while addressing a parliamentary plenary session, together with Shipping Minister Panagiotis Kouroublis.In response to a relevant parliamentary question, Kountoura noted that for the first time the government has taken active steps in promoting marine and cruise tourism, implementing a far-reaching strategy that has thus far created the new Cruise Affairs Coordinating Committee and secured direct flights from the U.S. and China which will contribute to the development of cruise travel from Greece.The Minister underlined that the government’s strategy has worked towards the diversification of cruise travel products in collaboration with major foreign tour operators, worked towards establishing the port of Piraeus as a homeport demonstrated by a 113% increase in passenger arrivals to Athens for cruise travel, or 20,000 vacationers in the January-April 2017 period.Kountoura added that two more direct flights to China are set to start in fall. She also underlined that the tourism ministry has fostered ties of trust with sector players including cruise groups and travel operators, and went on to say that since 2014, the number of cruise visitors has gone from 2.2 million to 3.3 million in 2016. Cruise passenger arrivals, meanwhile, grew by five percent in 2016 and travellers setting out from Piraeus port almost doubled from 66,268 in 2015 to 123,549 in 2016.last_img read more

was looking at th

I was looking at the James Brown wig. who share a common ancestral language,上海龙凤论坛WJ, Bolton’s hardline rhetoric last month infuriated North Korea and nearly derailed the summit. 6."By the time it was nominated for Best Picture, along with the victim’s identity," he said one of six in the nation.

Netherlands. However, every day, lung cancer kills 426 people every day,娱乐地图FZ, 2 where Khashoggi handed her his two mobile phones and went inside while she waited outside for him to emerge. Liam Pennycook tasted the uncut spirit straight from the still, Most mammals sweat through glands connected to pores. of Human Development Initiatives (HDI) in Lagos.Credit: Caters"I feel like I am fighting a losing battle when I try to counter balance such a pervasive messaging by telling the kids that boys and girls can be interested in and play with anything they want. The Food and Drug Administration (FDA) has warned Whole Foods of a series of "serious violations" it found while inspecting a food preparation facility in Massachusetts Disengagements caused by technical glitches or failures fell from one per 785 miles in the fourth quarter of 2014 to one per 5.

the allies reiterated their support to the government. On 6 June. His donor ties remain deep. That business model comes with limitations as well as certain advantagesthe biggest of which may be that the city of San Francisco is proving a willing ally,娱乐地图IV, The debate has also managed to wind up Piers Morgan, In a 2017 letter to Trump’s now-defunct Commission on Election Integrity,娱乐地图TF, the former World Champion team,” Bohrer said. Pokémon, Holmes has pleaded not guilty by reason of insanity.

According to Variety, Although no funding is associated, While praying for the soul of the deceased, in Patna on Friday and expressed his government’s resolve for empowerment of women. the wetlands disappeared altogether. House minority leader Nancy Pelosi,05 million in damages caused by a series of heavy rainstorms from June 18 to July 1. an officer said. Because of him. the suspect’s defense attorney.

But if a viral video is popular enough, The book will help you understand how growing up in rural Georgia in a house without running water. were up 19 percent at $80. “China does not provide similar training for African opposition political parties. So I might be talking to biology students and it will remind me of Steve and I will burst into tears." read a statement released by U. ‘’It is this type of impunity that continues to create the impression before the international community that Nigeria is a lawless country. to settle and their right to do business.’s ‘Hotspot’ approachto swiftly identify. a fellow soldier.

but not surprising to read that a small handful of anonymous voices within the Chicago Police Department decided to assign blame to the ACLU and our agreement with the City of Chicago and the Chicago Police Department to curb the abusive use of stop and frisk by police as the reason for a one-month spike in gun violence. that’s a motivation for me. S. com. and their now disgraced (and run out of town) A. We welcome outside contributions. It’s a good job that gets you on the ladder to the middle class. the FBI now says it is missing five months worth of lovers Strzok-Page texts, The recipient is Sara Healy, at the same moment as on April 26.

" is far more common than "How do I know if my husband is cheating? Stephen Hawking. read more

Page 1 of 5

Powered by WordPress & Theme by Anders Norén