text:
CXSecurity WLB-2015040034 6kbbs v8.0 Multiple CSRF (Cross-Site Request Forgery) Web Security Vulnerabilities
Exploit Title: 6kbbs Multiple CSRF (Cross-Site Request Forgery) Security Vulnerabilities
Advisory Publication: April 02, 2015
Vulnerability Type: Cross-Site Request Forgery (CSRF) [CWE-352]
CXSecurity Reference: WLB-2015040034
Impact CVSS Severity (version 2.0):
CVSS v2 Base Score: 6.8 (MEDIUM) (AV:N/AC:M/Au:N/C:P/I:P/A:P) (legend)
Exploitability Subscore: 8.6
Access Vector: Network exploitable; Victim must voluntarily interact with attack mechanism
Access Complexity: Medium
Writer and Reporter: Jing Wang, Division of Mathematical Sciences (MAS), School of Physical and Mathematical Sciences (SPMS), Nanyang Technological University (NTU), Singapore. (@justqdjing)
Suggestion Details:
http://en.sourceforge.jp/projects/sfnet_buzhang/downloads/6kbbs.zip/
"6kbbs V8.0 is a PHP + MySQL built using high-performance forum, has the code simple, easy to use, powerful, fast and so on. It is an excellent community forum program. The program is simple but not simple; fast, small; Interface generous and good scalability; functional and practical pursuing superior performance, good interface, the user's preferred utility functions."
"1, using XHTML + CSS architecture, so that the structure of the page, saving transmission static page code, but also easy to modify the interface, more in line with WEB standards; 2, the Forum adopted Cookies, Session, Application and other technical data cache on the forum, reducing access to the database to improve the performance of the Forum. Can carry more users simultaneously access; 3, the data points table function, reduce the burden on the amount of data when accessing the database; 4, support for multi-skin style switching function; 5, the use of RSS technology to support subscriptions forum posts, recent posts, user's posts; 6, the display frame mode + tablet mode, the user can choose according to their own preferences to; 7. forum page optimization keyword search, so the forum more easily indexed by search engines; 8, extension, for our friends to provide a forum for a broad expansion of space services; 9, webmasters can add different top and bottom of the ad, depending on the layout; 10, post using HTML + UBB way the two editors, mutual conversion, compatible with each other; …"
6kbbs web application has a computer cyber security bug problem. It can be exploited by CSRF (Cross-Site Request Forgery) attacks. This may allow an attacker to trick the victim into clicking on the image to take advantage of the trust relationship between the authenticated victim and the application. Such an attack could trick the victim into creating files that may then be called via a separate CSRF attack or possibly other means, and executed in the context of their session with the application, without further prompting or verification.
Several 6kbbs products 0-day vulnerabilities have been found by some other bug hunter researchers before. 6kbbs has patched some of them. Open Sourced Vulnerability Database (OSVDB) is an independent and open-sourced database. The goal of the project is to provide accurate, detailed, current, and unbiased technical information on security vulnerabilities. The project promotes greater, open collaboration between companies and individuals. It has published suggestions, advisories, solutions details related to csrf vulnerabilities.
(2.1) The first code programming flaw occurs at "/portalchannel_ajax.php?" page with "&id" and &code" parameters in HTTP $POST.
(2.2) The second code programming flaw occurs at "/admin.php?" page with "&fileids" parameter in HTTP $POST.
http://cxsecurity.com/issue/WLB-2015040034
http://www.intelligentexploit.com/view-details.html?id=21071
https://www.mail-archive.com/fulldisclosure@seclists.org/msg01902.html
http://seclists.org/fulldisclosure/2015/Apr/13
http://www.tetraph.com/security/csrf-vulnerability/6kbbs-v8-0-csrf
http://essayjeans.blog.163.com/blog/static/237173074201551435316925/
https://itinfotechnology.wordpress.com/2015/04/14/6kbbs-crsf/
http://frenchairing.blogspot.fr/2015/06/6kbbs-crsf.html
http://tetraph.blog.163.com/blog/static/234603051201551444917365/
http://diebiyi.com/articles/security/6kbbs-v8-0-csrf
http://securityrelated.blogspot.com/2015/04/6kbbs-v80-multiple-csrf-cross-site.html
https://hackertopic.wordpress.com/2015/04/02/6kbbs-v8-0-multiple-csrf
http://www.inzeed.com/kaleidoscope/computer-web-security/6kbbs-v8-0-csrf
CSRF, CXSecurity, Web Application
0Day Attack, 6kbbs, Chinese Software, Code Exploit, Crime-Defense, cross-site, CXSecurity, Cyber Bugs, Hacking, Internet News, jing wang, justqdjing, math, Multiple CSRF, Request Forgery, singapore, tetraph, v8.0, Web Security, WLB-2015040034
OSVDB 120807 NetCat CMS 3.12 HTML Injection Web Security Vulnerabilities
Exploit Title: NetCat CMS 3.12 /catalog/search.php? q Parameter HTML Injection Web Security Vulnerabilities
Product: NetCat CMS (Content Management System)
Vendor: NetCat
Vulnerable Versions: 3.12 3.0 2.4 2.3 2.2 2.1 2.0 1.1
Tested Version: 3.12
Vulnerability Type: Improper Input Validation [CWE-20]
OSVDB Reference: 120807
CVSS v2 Base Score: 4.3 (MEDIUM) (AV:N/AC:M/Au:N/C:N/I:P/A:N) (legend)
Impact Type: Allows unauthorized modification
Discover and Reporter: Wang Jing, Division of Mathematical Sciences (MAS), School of Physical and Mathematical Sciences (SPMS), Nanyang Technological University (NTU), Singapore. (@justqdjing)
Advisory Details:
Product & Vulnerable Version:
3.12 3.0 2.4 2.3 2.2 2.1 2.0 1.1
NetCat can be downloaded from here,
http://netcat.ru/
NetCat.ru is russian local company. "NetCat designed to create an absolute majority of the types of sites: from simple "business card" with a minimum content to complex web-based systems, from corporate offices to online stores, libraries or media data – in other words, projects completely different directions and at any level of complexity. View examples of sites running on NetCat CMS can be in a special section."
"Manage the site on the basis of NetCat can even inexperienced user, because it does not require knowledge of Internet technologies, programming and markup languages. NetCat constantly improving, adds new features. In the process of finalizing necessarily take into account the wishes of our partners and clients, as well as trends in Internet development. More than 2,000 studios and private web developers have chosen for their projects is NetCat, and in 2013 sites, successfully working on our CMS, created more than 18,000."
NetCat web application has a computer security bug problem. It can be exploited by HTML Injection attacks. Hypertext Markup Language (HTML) injection, also sometimes referred to as virtual defacement, is an attack on a user made possible by an injection vulnerability in a web application. When an application does not properly handle user supplied data, an attacker can supply valid HTML, typically via a parameter value, and inject their own content into the page. This attack is typically used in conjunction with some form of social engineering, as the attack is exploiting a code-based vulnerability and a user's trust.
Several NetCat products 0-day vulnerabilities have been found by some other bug hunter researchers before. NetCat has patched some of them. Web Security Watch is an aggregator of security reports coming from various sources. It aims to provide a single point of tracking for all publicly disclosed security issues that matter. "Its unique tagging system enables you to see a relevant set of tags associated with each security alert for a quick overview of the affected products. What's more, you can now subscribe to an RSS feed containing the specific tags that you are interested in – you will then only receive alerts related to those tags." It has published suggestions, advisories, solutions details related to cyber security vulnerabilities.
(2.1) The programming code flaw occurs at "/catalog/search.php?" page with "&q" parameter.
http://www.osvdb.org/show/osvdb/120807
http://cxsecurity.com/search/author/DESC/AND/FIND/1/10/Wang+Jing/
http://tetraph.com/security/html-injection/netcat-cms-3-12-html-injection/
http://whitehatpost.blog.163.com/blog/static/242232054201551434123334/
http://russiapost.blogspot.ru/2015/06/netcat-html-injection.html
https://inzeed.wordpress.com/2015/04/21/netcat-html-injection/
http://computerobsess.blogspot.com/2015/06/osvdb-120807.html
http://www.inzeed.com/kaleidoscope/computer-web-security/netcat-cms-3-12-html/
http://germancast.blogspot.de/2015/06/netcat-html-injection.html
http://diebiyi.com/articles/security/netcat-cms-3-12-html-injection/
HTML Injection, OSVDB, Web Application
0day-exploit, 3.12, Computer Science, cyber-intelligence, Hack Prevention, HTML Injection, internet, IT Bug, justqdjing, NetCat CMS, OSVDB 120807, Program Flaw, tetraph, Vulnerabilities, web application, Web Security, Whitehat Test
OSVDB 119342, 119323 NetCat CMS Multiple HTTP Response Splitting (CRLF) Web Security Vulnerabilities
Exploit Title: NetCat CMS Multiple CRLF Security Vulnerabilities
Vulnerable Versions: 5.01 3.12 3.0 2.4 2.3 2.2 2.1 2.0 1.1
Advisory Publication: March 07, 2015
Latest Update: March 07, 2015
Vulnerability Type: Improper Neutralization of CRLF Sequences ('CRLF Injection') [CWE-93]
OSVDB Reference: 119342, 119343
Discover and Author: Jing Wang, Division of Mathematical Sciences (MAS), School of Physical and Mathematical Sciences (SPMS), Nanyang Technological University (NTU), Singapore. (@justqdjing)
5.01 3.12 3.0 2.4 2.3 2.2 2.1 2.0 1.1
NetCat can be got from here,
NetCat web application has a computer security bug problem. It can be exploited by HTTP Response Splitting (CRLF) attacks. This could allow a remote attacker to insert arbitrary HTTP headers, which are included in a response sent to the server. If an application does not properly filter such a request, it could be used to inject additional headers that manipulate cookies, authentication status, or more.
Several other similar products 0-day vulnerabilities have been found by some other bug hunter researchers before. NetCat has patched some of them. CXSECurity is a huge collection of information on data communications safety. Its main objective is to inform about errors in various applications. It also publishes suggestions, advisories, solutions details related to CRLF vulnerabilities and cyber intelligence recommendations.
(2.1) The first code flaw occurs at "/post.php" page with "redirect_url" parameter by adding "%0d%0a%20".
(2.2) The second code flaw occurs at "redirect.php?" page with "url" parameter by adding "%0d%0a%20".
http://seclists.org/fulldisclosure/2015/Mar/36
http://securityrelated.blogspot.com/2015/03/netcat-cms-multiple-http-response.html
http://essayjeans.blog.163.com/blog/static/23717307420155142423197/
http://computerobsess.blogspot.com/2015/06/osvdb-119342-netcat-crlf.html
http://diebiyi.com/articles/bugs/netcat-cms-crlf
https://webtechwire.wordpress.com/2015/03/14/osvdb-119342-netcat-crlf/
https://itswift.wordpress.com/2015/03/07/netcat-cms-multiple
http://tetraph.com/security/http-response-splitting-vulnerability/netcat-cms-multiple
http://www.inzeed.com/kaleidoscope/computer-web-security/netcat-cms
0Day, CRLF, Web Application
0day Bug, Code Flaw, Computer Science, crime prevention, CRLF, cyber-intelligence, exploit, Hacking Attack, HTTP Response Splitting, Internet Testing, IT-news, NetCat CMS, OSVDB 119342, OSVDB 119343, Vulnerabilities, Web Security, whitehat
CVE-2014-8753 Cit-e-Net Multiple XSS (Cross-Site Scripting) Web Security Vulnerabilities
Exploit Title: Cit-e-Net Multiple XSS (Cross-Site Scripting) Web Security Vulnerabilities
Product: Cit-e-Access
Vendor: Cit-e-Net
Vulnerable Versions: Version 6
Tested Version: Version 6
Vulnerability Type: Cross-Site Scripting [CWE-79]
Discover and Author: Jing Wang [School of Physical and Mathematical Sciences (SPMS), Nanyang Technological University (NTU), Singapore] (@justqdjing)
Instruction Details:
Cit-e-Net
Cit-e-Access
Cit-e-Net can be downloaded from here,
https://www.cit-e.net/citeadmin/help/cntrainingmanualhowto.pdf
http://demo.cit-e.net/
http://www.cit-e.net/demorequest.cfm
http://demo.cit-e.net/Cit-e-Access/ServReq/?TID=1&TPID=17
"We are a premier provider of Internet-based solutions encompassing web site development and modular interactive e-government applications which bring local government, residents and community businesses together.
Cit-e-Net provides a suite of on-line interactive services to counties, municipalities, and other government agencies, that they in turn can offer to their constituents. The municipal government achieves a greater degree of efficiency and timeliness in conducting the daily operations of government, while residents receive improved and easier access to city hall through the on-line access to government services.
Our web-based applications can help your municipality to acheive its e-government goals. Type & click website content-management empowers the municipality to manage the website quickly and easily. Web page styles & formats are customizable by the municipality, and because the foundation is a database application, user security can be set for individual personnel and module applications. Our application modules can either be integrated into your existing municipal web site or implemented as a complete web site solution. It's your choice! Please contact us at info@cit-e.net to view a demonstration of our municipal web site solution if you are an elected official or member of municipal management and your municipality is looking for a cost efficient method for enhancing & improving municipal services.
Interactive Applications
Online Service Requests
Online Tax Payments by ACH electronic-check or credit card.
Online Utility Payments by ACH electronic-check or credit card.
Online General-Payments by ACH electronic-check or credit card.
Submit Volunteer Resume's Online for the municipality to match your skills with available openings."
Cit-e-Access web application has a security bug problem. It can be exploited by XSS attacks. This may allow a remote attacker to create a specially crafted request that would execute arbitrary script code in a user's browser session within the trust relationship between their browser and the server.
Several similar products 0Day vulnerabilities have been found by some other bug hunter researchers before. Cit-i-Access has patched some of them. Open Sourced Vulnerability Database (OSVDB) is an independent and open-sourced database. The goal of the project is to provide accurate, detailed, current, and unbiased technical information on security vulnerabilities. The project promotes greater, open collaboration between companies and individuals. It has published suggestions, advisories, solutions details related to important vulnerabilities.
(2.1) The first programming code flaw occurs at "/eventscalendar/index.cfm?" page with "&DID" parameter in HTTP GET.
(2.2) The second programming code flaw occurs at "/search/index.cfm?" page with "&keyword" parameter in HTTP POST.
(2.3) The third programming code flaw occurs at "/news/index.cfm" page with "&jump2" "&DID" parameter in HTTP GET.
(2.4) The fourth programming code flaw occurs at "eventscalendar?" page with "&TPID" parameter in HTTP GET.
(2.5) The fifth programming code flaw occurs at "/meetings/index.cfm?" page with "&DID" parameter in HTTP GET.
(3) Solutions:
Leave message to vendor. No response.
http://www.cit-e.net/contact.cfm
https://computerpitch.wordpress.com/2015/06/07/cve-2014-8753/
http://webtechhut.blogspot.com/2015/06/cve-2014-8753.html
http://biboying.lofter.com/post/1cc9f4f5_7356826
http://shellmantis.tumblr.com/post/120903342496/securitypost-cve-2014-8753
http://itprompt.blogspot.com/2015/06/cve-2014-8753.html
https://plus.google.com/u/0/113115469311022848114/posts/FomMK9BGGx2
https://www.facebook.com/pcwebsecurities/posts/702290949916825
http://securitypost.tumblr.com/post/120903225352/cve-2014-8753-cit-e-net
http://webtech.lofter.com/post/1cd3e0d3_7355910
http://www.inzeed.com/kaleidoscope/cves/cve-2014-8753/
http://diebiyi.com/articles/security/cve-2014-8753/
CVE, XSS
0day-exploit, 2014-8753, Cit-e-Net, Code Flaw, computer bug, Cross-Site Scripting, cve, cyber-security, Hacking Prevention, Internet Testing, IT-news, justqdjing, Vulnerabilities, wang jing, web application, Whitehat Report, XSS


Pattern 37 ammunition pouch issued to N29120 Lewis Henry OWEN who served during the Second World War in the Australian Imperial Force as a member of the 4 Australian Advanced Ordnance Depot. NOTE: Above image is a generic image. Please contact Medals Gone Missing for further details. This pouch is not for general sale and will only be sold back to the family or next-of-kin upon strict proof of relationship.
Pattern 37 ammunition pouch issued to VX3973 William BAIN who served during the Second World War in the Australian Imperial Force as a member of the 10 Recovery Section. NOTE: Above image is a generic image. Please contact Medals Gone Missing for further details. This pouch is not for general sale and will only be sold back to the family or next-of-kin upon strict proof of relationship.
Pattern 37 ammunition pouch issued to Q269364 Robert Walter WILSON who served during the Second World War in the Australian Imperial Force as a member of the A A C T R. NOTE: Above image is a generic image. Please contact Medals Gone Missing for further details. This pouch is not for general sale and will only be sold back to the family or next-of-kin upon strict proof of relationship.
Pattern 37 ammunition pouch issued to WX11264 Louis Reginald BUCHANAN who served during the Second World War in the Australian Imperial Force as a member of the 2/1 HQ Guard Battalion. NOTE: Above image is a generic image. Please contact Medals Gone Missing for further details. This pouch is not for general sale and will only be sold back to the family or next-of-kin upon strict proof of relationship.
Pattern 37 ammunition pouch issued to N237952 Leslie Douglas MCDOUGALL who served during the Second World War in the Australian Imperial Force as a member of the Moresby Area Workshop. NOTE: Above image is a generic image. Please contact Medals Gone Missing for further details. This pouch is not for general sale and will only be sold back to the family or next-of-kin upon strict proof of relationship.
Pattern 37 ammunition pouch issued to VX93046 Robert Isaac James GERMAN who served during the Second World War in the Australian Imperial Force as a member of the 21 Australian Infantry Training Battalion. NOTE: Above image is a generic image. Please contact Medals Gone Missing for further details. This pouch is not for general sale and will only be sold back to the family or next-of-kin upon strict proof of relationship.


Kumar, N and Sinha, KP (1971) Insulator-metal transition. In: Proceedings of the Indian Academy of Sciences - Section A, 73 (6). pp. 313-323.
A theory of the insulator-metal transition in transition-metal compounds is developed in terms of the collapse of the effective energy gap which is a function of the thermally excited electron-hole pairs. This dependence is shown to arise from the hole-lattice interaction. The reaction of the lattice is found to be equivalent to generating an internal positive pressure (strain). Estimates show that the observed typical behaviour of the conductivity jump and the change of volume at the transition temperature can be explained by the present theory.


text:
New York Outlaws Religious Exemptions For Vaccines As Measles Cases Surge
The state of New York, which has experienced a large outbreak of measles, will no longer allow religious exemptions for vaccines.
Yesterday, Governor Andrew Cuomo signed into law new legislation that was passed in both the Senate and the Assembly which will remove religious belief as an acceptable reason to avoid vaccination.
The new legislation comes after New York faced its largest measles outbreak in decades. Between October and late February, more than 200 people were found to be sick with measles. Measles is highly contagious and can be a life-threatening disease. In the first decade of reporting on the disease in the United States, beginning in 1912, 6,000 measles-related deaths were recorded each year.
In a statement, State Senator Brad Hoylman said, "We're putting science ahead of misinformation about vaccines and standing up for the rights of immunocompromised children and adults, pregnant women and infants who can't be vaccinated through no fault of their own."
Cuomo himself said in a statement, "The science is crystal clear: Vaccines are safe, effective and the best way to keep our children safe. While I understand and respect freedom of religion, our first job is to protect the public health and by signing this measure into law, we will help prevent further transmissions and stop this outbreak right in its tracks."
The law allows up to 30 days for unvaccinated students show they have begun receiving their required immunizations.
While all states allow for medical exemptions for otherwise required vaccines for students, many also grant parents the right to exempt their children from the vaccines for religious reasons.
As measles cases within the last several months reach their highest levels since 1992, many states are reevaluating their exception allowances.
Many of New York's cases have come out of the ultra-Orthodox Jewish population in Brooklyn. 74% of the cases have come out of the Williamsburg neighborhood.
"I'm not aware of anything in the Torah, the Bible, the Koran or anything else that suggests you should not get vaccinated," Bronx Assemblyman Jeffrey Dinowitz (D), the bill's sponsor, told reporters. "If you choose to not vaccinate your child, therefore potentially endangering other children … then you're the one choosing not to send your children to school."
California, Mississippi, West Virginia, and Maine are other states which have also outlawed non-medical exemptions for vaccines. Several other states are also considering outlawing non-medical exemptions as measles outbreaks occur across the country.
I am happy to see some lawmakers value science over antiquated religious dogma. I hope that this kind of thinking can spread to other areas of legislation as well. One example that comes to mind is when Christian lawmakers deny climate change.

redpajama_set_name: RedPajamaCommonCrawl


red floral curtains burst printed eyelet damask uk.
red floral curtains dunelm eyelet uk.
red floral curtains dunelm kitchen damask.
red floral curtains burst printed eyelet sale next.
red floral curtains ebay eyelet kitchen.
red floral curtains sale eyelet dunelm.
red floral curtains sale ebay next.
red floral curtains ebay asda burst printed eyelet.
red floral curtains uk kitchen asda.
red floral curtains eyelet next ebay.
red floral curtains sale damask kitchen.
red floral curtains kitchen ebay next.
red floral curtains ebay dunelm next.
red floral curtains asda ebay burst printed eyelet.
red floral curtains eyelet sale kitchen.
red floral curtains eyelet sale uk.
red floral curtains sale kitchen uk.
red floral curtains kitchen sale asda.
red floral curtains bed asda eyelet burst printed.
red floral curtains kitchen asda eyelet.
red floral curtains eyelet dunelm asda.
red floral curtains uk sale damask.
red floral curtains burst printed eyelet kitchen dunelm.
red floral curtains sale next burst printed eyelet.
red floral curtains dunelm ebay kitchen.
red floral curtains uk dunelm burst printed eyelet.
red floral curtains sale burst printed eyelet damask.
red floral curtains s uk eyelet next.
red floral curtains sale ebay burst printed eyelet.
red floral curtains sale asda kitchen.
red floral curtains uk asda burst printed eyelet.
red floral curtains asda dunelm sale.


Hadar Athletic- Tackle Rings, Gymnastics, Bases, Wall Mats, and so much more.
Hadar Athletic is a Nationally Recognized, USA, Sporting Goods Manufacturing. Excelling in New Product Development and Technologies Daily.
MADE FOR COACHES, BY COACHES.
MAKE EVERY EXPERIENCE, A WINNING ONE.


text:
Metro-Manhattan (NY) Chapter
Chapter Roster
Services to Youth
National Trends & Services
International Trends
Umbrella Program
Home About Us >National History >Chapter Officers >Chapter Roster Programs >The Arts >Services to Youth >Health & Human Services >National Trends & Services >International Trends >Umbrella Program News Partners Sponsorship GALA Contact Us Members Only
Metro-Manhattan's own, Carla Harris, featured in Forbes Magazine for her Sucess in Banking & Music
Carla Harris, a member of the Metro-Manhattan (NY) Chapter of the Links, Inc., was featured in Fobes this month. In addition to being the vice chairman of wealth management at Morgan Stanley, Harris chairs the National Women's Business Council (NWBC), an advisory panel to Congress and President Barack Obama on economic issues important to female…
Metro-Manhattan Chapter Member Tiffany Hall's Empower Cocktails featured at NAACP Image Awards
Tiffany Hall's ready to pour cocktail, the Empower Cosmopolitan Martini, was featured in the backstage celebrity retreat at the NAACP Image Awards on Friday, February 5th! Several celebrities enjoyed Empower including Taraji P. Henson, Viola Davis, Keegan Michael Key, Kimberly Elise, Loretta Divine, Jimmy Jean Louis and Wendy Raquel Robinson. Tiffany was honored that her…
Chapter Member Tamika Mallory honored at the NAACP Image Awards with The Chairman's Award as part of the Justice League NYC
The Chairman of the NAACP National Board of Directors, Roslyn M. Brock, presented the prestigious Chairman's Award at the 47th NAACP Image Awards to individuals and organizations that have used their distinct platforms to be agents of change. Tamika Mallory serves on the Board of Directors for the Justice League NYC, one of eight honorees this…
Metro Manhattan Links, Alpha Phi Alpha fraternity host holiday party benefit
The Metro-Manhattan (NY) Chapter of the Links was highlighted featured in the New York Amsterdam News along side Alpha Phi Alpha. Read More Here.
Metro Manhattan Links, Ins. and Alpha Phi Alpha Fraternity, Inc. featured in Harlem Community Newspaper
A Holiday Party was held at the Harlem Hospital Cafeteria for the "Go High School – Go College" by the Metro Manhattan Links, Inc. and Alpha Phi Alpha Fraternity. The program mentors minorities in high school and prepares them for college in oratorical skills, mannerism, essay writing, and, of course, dress. The program is over…
Bringing Out the Chef in Children
The Health & Human Services Facet of the Metro-Manhattan (NY) Chapter umbrella program, Teen Battle Chef, was featured in the New York Times blog. . . 1/4/2016 Read more here.
Link LaShann DeArcy Hall is now the Honorable Judge Hall
Link LaShann DeArcy Hall has been confirmed as a United States District Judge of the United States District Court for the Eastern District of New York. After being nominated by President Obama in January, on November 16, 2015 the United States Senate voted in favor of final confirmation by a vote of 93-1. She is…
Link Tamika Mallory fighting for #JusticeOrElse
Link Tamika Mallory, Co-Director of the NY Justice League, served as the National Co-Chair for the March commemorating the 20Th Anniversary of the Million Man March in Washington, DC under the theme #JusticeOrElse. Hear Link Tamika's dynamic address during the March by clicking the video below and follow her at www.twitter.com/@TamikaDMallory.
Link Jennifer Jones Austin Read Scripture at Gathering with Pope Francis
Link Jennifer Jones Austin was blessed with the honor of reading the scripture at an intimate gathering of immigrants and refugees with Pope Francis. READ MORE about Pope Francis' remarks at the Our Lady Queen of Angels School in East Harlem.
Link Carla Harris Sings During Pope Francis' Mass at Madison Square Garden
Carla Harris will have a solo performance during the choir's performance of "Unceasing Praise," a song composed by Mr. Howell. WATCH the video and READ MORE at Wall Street Journal
Thank you for visiting our website. The Metro-Manhattan (NY) Chapter of The Links, Incorporated has been serving the greater Harlem community since 1988. [more]
Copyright 2017 © Metro-Manhattan Community Foundation, Incorporated is a 501 (c)(3) public foundation. Federal Tax I.D. Number 13-4186074 All contributions are tax deductible to the extent permitted by law.
Chapter Updates


Not all water that comes out of the tap tastes good or smells good. Some water is hard, and those extra minerals may not create a fresh taste. Our water filters get out the minerals and associated odors from the water. By using our water filters and housing setups, you can enjoy hundreds of gallons of purified fresh water to drink at any time.
We make water filters and housings for a variety of settings. You can choose an individual water filter that works with a water bottle or jug. We also have family-sized water filters for use in the home. We make water filtration housings for offices and large buildings, too. No matter what capacity of water filter and housing you need, we are the right choice.
Not every company allows you to select specific components for the filters and housing. If you want a mesh filter, carbon filter, paper filter or some other material, just let us know. We offer customized filters to meet your needs and remove the things that you do not want in your water. We can even save your customized request, making it easy for you to order another filter or housing when the time is right. Our goal is to provide you with excellent customer care and a quality housing for your water filter so that you can enjoy plenty of fresh drinking water.
There is nothing quite like a cool and refreshing drink of water. Our water filter housing and other products ensure that you can get as much clean and pure water as you need. Give us at IsoPure Water a call today for more information or to start building your custom water filter housing. You may also visit us online at http://isopurewater.com/ for more details about our products and company.


Car insurance companies spend a lot of time and money thinking about statistics. Statistics are the foundation of their companies; they pay highly trained actuarial technicians. As these statisticians formulate the chances of a driver being involved in a car insurance claim, the online car insurance quotes provided by an insurer become more and more accurate. Dangerous drivers end up paying more for their car insurance and safe drivers pay less. However, this is a generalized overview of the job that statisticians perform. In order to control your car insurance policy, it's helpful to know exactly how statisticians formulate car insurance quotes--and what you can do to drive your online quotes down as low as possible.
The main job of actuarial statisticians is to gather information. They do this using a number of methods, including third party companies and government provided demographic information, as well as the records of the insurance company itself. Basically, they'll look at anything that they can look at to determine a driver's risk, no matter how seemingly insignificant a certain piece of information might be. They figure out whether men are more likely to cause a car accident than women, what ages are the most dangerous for driving, and much, much more. All of this information goes into an actuarial table. This table is designed in a way so that car insurance agents can use it to quickly figure out a range for a car insurance quote. When you look at online car insurance quotes, you're plugging information into a form that runs through this actuarial table to determine your approximate risk. There's a lot of confusing math involved, but the bottom line is that anything that increases your risk goes into the table, from demographic information to your driving history.
There are some exceptions. Your car insurance company cannot use your race or handicap status to figure your online car insurance quotes, and depending on the state that you live in, there may be other special laws that prevent them from using certain pieces of information. This is done to protect consumers, but it makes statisticians jobs a bit more difficult and makes the equation that they develop a bit more complex. To control your car insurance costs, you should try to limit as many of your risk factors as possible. Drive a safe car, don't get any traffic citations, and use the market to your advantage--compare as many quotes as possible before you settle on a single policy. Knowing the basics of how statisticians formulate quotes can give you tremendous control over your policy.


text:
ACCEPTED

#### According to
Index Fungorum

#### Published in
null

#### Original name
Verrucaria miculiformis Nyl.

### Remarks
null

redpajama_set_name: RedPajamaGithub


By studying Sociology and Criminology, you will investigate the causes of criminal behaviour as well as its consequences for victims and for society as a whole. You'll pay particular attention to the role of criminal justice organisations in defining and responding to crime as a social problem.
The interdisciplinary nature of the programme will give you sociological, historical, political and psychological perspectives for understanding and responding to crime and deviance. You'll explore theoretical, empirical and methodological issues associated with sociology and other fields of social research and develop skills in critical analysis. Optional modules will cover issues as diverse as forensic science, war crimes, ethics, addiction and human rights.
In studying Sociology you'll develop an understanding of the contemporary world, human behaviour and the forces shaping society. You'll examine social, political, historical, cultural and economic issues and study topics as diverse as class and social inequality, health and disability, globalisation, crime, countercultures, family life, gender and the development of cities.
Our Sociology modules are specially designed to help you develop an understanding of how societies, institutions and practices came into being, how they work and might change in the future. This highly relevant discipline is particularly concerned with social transformation and in developing an insight into the major challenges facing contemporary society.
The BSc Sociology and Criminology degree programme is made up of compulsory (core) and optional modules, which are worth 15 or 30 credits each. Full-time undergraduate students need to complete modules worth a total of 120 credits each year.
You must pass your first year assessment in order to progress to the second year, but the results do not count towards your degree classification. For three-year programmes, the assessments in the second and third years contribute to your final degree classification.
You will learn transferrable skills suitable for a wide range of careers such as social research, marketing, media and culture, human resources management, teaching, management, development work, social work, and working for the military and emergency services.
We provide a range of support to help you develop skills attractive to employers. As a student within the College of Social Sciences and International Studies, you will be able to access a range of specific activities such as careers skills sessions and employer-led events, or seek bespoke advice and support from our College Employability Officer. The University of Exeter's Careers Service also organises a busy schedule of activities including careers fairs, skills workshops, and training events, and can advise on graduate opportunities and volunteering. Visit our employability web page for more information.


The difference in the two materials is simple, one is coated in zinc the other is zinc thats been rolled out into sheet form. Home / Accessories / Metal Finishes / Patinas Click image to enlarge patinaed The well- known line of Sculpt Nouveau products provides artists , visionaries with tools to make their projects come to life with rich surfaces , tradesmen vivid colors. Photo by Lisa Shin. Genuine Copper Leaf Sheets - by Barnabas. Metal Finish Supply' s line of steel finishes , EasyRust™ ornamental rust finishes are cost effective, metallic glazes, patinas for copper user friendly solutions to your finishing requirements. Patinaed metal sheets. patinaed Patinaed Copper Countertop 2 Patinaed Copper Countertop 2- 1 Patinaed patinaed Copper sheets Countertop 2- 2 Hammered Copper Countertop 5 Hammered Copper Countertop 5- patinaed 1 Vibration Finish Stainless Countertop 3 Vibration Finish Stainless Countertop 3- 1 Vibration FinishCopper Countertop 6. Galvanized sheets usually have a tendency to chip flake thus exposing bare metal that can rust , be harmful to you your family. Etsy is the sheets home to thousands of handmade , one- of- a- kind products , vintage gifts related to your search.
rubbed sheets complement aged zinc sheets black magic patinaed zinc. You searched for: patina sheet metal! No two sheets sheets are identical and each is an amazing work of art by itself. How to Patina Metal Sheets By Megan Shoop. Lava Waves Brass Patinated SOLID patinaed BRASS metal sheet and panels. Give Metal An Aged Rusty Patina Finish DAD. patinaed Patina Copper Sheet Sample metal Pack- Includes all 14 Designs.
The patinaed possiblities are endless. You can frame the sheeting for an instant magnet message board cut it into decorative tiles coasters. For patinas use a sponge to apply multiple patinaed glaze colors Faux Painting with Metals , , the look of rust Patinas. Step Two / / How to Give Metal the Look of Copper Patina. Updated on December 29,.
While the final coat is still tacky, use the second foam. We are proud to offer this. These sample sheets are approximately five inches by five inches and have a lacquer finish. You can also cut it into small pieces sheets metal roll it into beads , bend up crimp the sides to create containers. Copper Sheets Various Sizes Blue Green Patina Metal Roofing Metal Turquise Ocean Color Organic Nature Rustic Farmhouse Woodland Suppliesart NevaStarr 5 out of 5 stars ( 3 016) $ 17. 005" thick patinated real copper veneer for use with or without sheets a vacuum press. Brightfull designs in gold, blue. Imagine the reaction sheets your family , friends customers will have when presented with a one- of- a- kind copper veneer work of art. com: bronze sheet metal - 3 Stars & Up. Today we are going to show you how to add patina to any type of metal. Safety Data Sheets. After about 2- 3 hours you can take off the lid to reveal the beautiful patina. Patina Finishes for Steel. Apply The Patina patinaed Solution. The good the bad the?
Placing a few drops of water or oil on the metal before heating can create some interesting. premium aged patina copper sheets These are custom designs handcrafted by artisans using techniques processes mastered through years of experimentation using premium high grade copper sheeting. Create the look of metals with metal patinaed patina glaze over a base coat with brush roller. Patinaed metal sheets. Patinated zink metal sheet and panels. SAVE; patinaed Metal sheeting has many uses in your home and crafting life. They are not galvanized nor coated.
Copper sheets have historically been installed in large, panelized systems giving rise to distinct linear patterns of various vertical seams. These systems have found extensive use on commercial, industrial and institutional projects where large surface areas required a metal " membrane" concept. Copper & Nickel Metal;. Decorative Nails, Clavos and Tacks.
pre- patinaed sheets or the popular DIY line of zinc sheet patinas, you' re sure to find the. Color Copper Sheets for Copper Range Hood, Copper Bartops, Copper Countertops, Copper tabletops, Copper Kitchen Backsplash, Copper copper Oven Hoods, Copper Bar Tops, Copper Table Tops, and Copper Cabinet Veneer. Cart 0 Items Sign In; Create an Account.
but has patinaed over the years due to its exposure to the weather.


text:
Cyanea marksii är en klockväxtart som beskrevs av Joseph Rock. Cyanea marksii ingår i släktet Cyanea, och familjen klockväxter. Inga underarter finns listade i Catalogue of Life.

Källor

Klockväxter
marksii

redpajama_set_name: RedPajamaWikipedia


Genetic interactions between the Drosophila Abelson (Abl) tyrosine kinase and failed axon connections (fax), a novel protein in axon bundles.
McArdle Laboratory for Cancer Research, University of Wisconsin Medical School, Madison 53706, USA.
Mutations in the failed axon connections (fax) gene have been identified as dominant genetic enhancers of the Abl mutant phenotype. These mutations in fax all result in defective or absent protein product. In a genetic background with wild-type Abl function, the fax loss-of-function alleles are homozygous viable, demonstrating that fax is not an essential gene unless the animal is also mutant for Abl. The fax gene encodes a novel 47-kD protein expressed in a developmental pattern similar to that of Abl in the embryonic mesoderm and axons of the central nervous system. The conditional, extragenic noncomplementation between fax and another Abl modifier gene, disabled, reveal that the two proteins are likely to function together in a process downstream or parallel to the Abl protein tyrosine kinase.
You are going to email the following Genetic interactions between the Drosophila Abelson (Abl) tyrosine kinase and failed axon connections (fax), a novel protein in axon bundles.


We help busy professionals make big presentations and have tricky conversations with less stress and more success, especially when time is tight and stakes are high. Whether it is a business presentation, an important negotiation, or just polishing up your communication skills, our workshops and coaching can help you, your team or organization reach those important goals.
Copyright © 2019, TalkSupport. All Rights Reserved.


Before I get into my vocab word for the day I want to say thank you for the well wishers for Eddie!
Ed had his surgery and is a little loopy from the drugs/anesthesia but he's doin' okay!
He had an open tumor so the vet cut around it and stitched it up.
I want to talk about taste aversion. It is a concept I learned in psychology my senior year in high school.
Taste Aversion: a type of learning formed after one trial, whereby an association is formed between feelings of sickness and (usually) a particular food, resulting in an avoidance of the food.
Example: You go out to eat one night at your favorite restaurant and order eggs, like you always do. It turns out your eggs were undercooked. Crap. Hours later you are throwing up. One week later you go back to your favorite restaurant and just the smell of eggs makes you sick. That is taste aversion.
Hi there. That was me in 2009 after major re constructive nose surgery. From a car crash.
I developed a taste aversion after the crash.
I hopped in Jim's car while I was opening a Nature Valley pecan crunch granola bar. I was so content with eating my little snack that I forgot to put on my seat belt. Stupid me. We slid on ice and hit a tree head on. My face was crushed in the dash and my head broke the windshield. I sprained my wrist and knee and had a concussion. I was lucky to be alive.
Right after we crashed I knew I was going to PUKE that granola bar. For some reason, I didn't but I felt very sick to my stomach. Of course typical things happened after the accident: ambulance, hospital, surgery, etc.
When I was finally feeling okay after the accident I decided to (slowly) get up and grab a snack! Why not a Nature Valley pecan crunch granola bar?! I took one look at the box and gagged.
To this day, I still can't think of those granola bars without feeling sick.
Do you have a taste aversion?!
That is so interesting! I used to have issues with anything grape flavored and would gag at the taste…due to me instantly throwing up grape dimetap cough syrup as a kid. However, my tastes have changed and now I love grape flavored things!
Wow, how scary about the car crash! I'm so glad you made it okay!
That is so scary and I'm so thankful that nothing worse happened!
I have a taste aversion to eggs, which I cooked once when I was sick. Haven't eaten scrambled eggs since and that was when I was 10 or 11. And I used to avoid pancakes like the plague ever since I ate terribly cooked ones (made by my little bro) that were liquid in the middle and tasted horrible.
I still don't like pancakes as much as I once did, although I did start eating them again.
So glad your dog is alright!
I'm with you on taste aversion – I can't eat Lucky Charms (I ate them right as a stomach bug began in 3rd grade –> puked on teacher's shoes) or Egg McMuffins (a homemade version was the last thing my dad ever ate 😦 ).
Glad the only lasting effect of your crash was an aversion to that granola!
Poor pup, hope he's back to normal soon!
I have a taste aversion to ginger ale after a friend's mom gave it to me when my stomach was upset and I threw up anyway. I hope you can still eat pecans, they are too yummy to avoid!
Wow, I'm so thankful you're alive and well after such a gnarly looking crash, how scary 😦 I'm also glad your dog's doing well in his recovery!
I have a taste aversion to french toast, syrup, waffles, and pancakes…my friend's dad made them all for us at a sleepover when I was a little kid, I ate way to much and hurled it all up. Ever since then, I can't even be in the same room with the smell, yuck!
I don't really have any taste aversions- just combinations I don't like. My mom made soup once that had beans and orange peel in it. It was BAD…I smelled it cooking all day and knew I would NOT eat it.
Oh girl! I am so glad you were okay!
I've never really had taste aversion, but my husband has! With sun dried tomatoes of all things. He had them in a dish from the Macaroni Grill and then got food poisoning. Hasn't touched those since.
wow, God really had angels looking over you in that crash! I have a taste aversion to waffles and peanut butter. Thats the last thing I ate before I got extremely sick from a gluten intolerance. I will no longer buy frozen waffles. Only bread or pancakes which are basically the same thing. haha.
I have taste aversion to Thai food. I got sick from an unrelated cause the day after and cannot even stand the smell anymore. Sadly-it wasn't bad food.
I could see why you would be averse to those granola bars – what a bad association!
I have a taste aversion to Red Lobster because after eating there with my family one night I got a viral infection that caused me to be super sick, like throwing up constantly, for almost 24 hours. It was awful! I can barely stand to drive past the place.
Oh my – how scary that crash must have been!!! I can totally understand why you would have developed a taste aversion!
gosh, i'm happy for you that you are perfectly fine now ..
On the bright side, I'm glad to hear Eddie is OK!
I am glad your pup is doing okay! ANd I am even more glad you are okay from your crash.. because I LOVE to learn about your life and read your blog. So funny about your taste aversion. I feel like I have so many .. but can't really think of any. The one I can think of right now is alcohol related from college. I went to Cancun on spring break.. and drank vodka and OJ the whole time I was there. The smell of the mixture – makes me vomit a little in my mouth ( not literally.. but you know ) .. I don't even really like OJ anymore either!
I have a taste aversion to Arby's fast food and that's pretty much it.
I so, so, so hate on that happening to you. It pains me.
It's a good thing you did not develop a crippling fear like "car" aversion.
Oh my god Allie, I'm sorry you had such a terrible accident. 😦 Yes, you were lucky that you still have life although you have this "taste aversion"… I never heard of it and it was interesting to read…but I'm just traumatized how scary and unexpected your accident was. Always wear a seat belt. You never know it can happen to me next.
Oh my goodness I'm glad you are okay! I was in a rather serious car accident in high school too. Scary stuff! I have a taste aversion to jalepenos. When I was little, I got sick after eating cream-cheese stuffed, bacon wrapped, grilled jalapenos (I'm from Texas, that was a staple, haha). I can't stand just the smell of jalapenos now.


text:
package com.notlob.jgrid.styles;

public enum InheritanceStyle {
	USE_EXISTING,
	USE_MINE
}


Came across as very experienced and adjusted his material and style to suit.
All questions were answered, but he also encouraged us to answer them ourselves.
Learnt many ways to plan training sessions with structure.
Very clear and concise, friendly and eager to answer questions.
Well thought-out and useful, with a variety of activities and styles.
It was a very useful day, well structured and enjoyable.
Enjoyed the session. Trainer was good as put everyone at ease and making the training relevant to our work environment.
Incredibly useful training covering a wide range of techniques, all useful in various scenarios.


bobafetthotmail Wrote: ------------------------------------------------------- > > The only thing remains not working is network > during boot. > > you mean the switch? Wasn't the "WAN" eth port > connected to the SoC directly? > > It's not so bad if the WAN port can work for > netconsole.


Category » Artwork and Illustrations Free Stock Photos » Bogotá Capital city of Colombia with the national flag and reflection, available free royalty free image.
Bogotá Capital city of Colombia with the national flag and reflection, available free royalty free image.
Title: Bogotá Capital city of Colombia with the national flag and reflection, available free royalty free image.


text:
\section{Introduction}
This paper deals with a sequential stochastic decision problem involving the optimal scheduling of a set of $n$ available ``opportunities,'' whose outcome is uncertain and delayed in time. The problem setup is best introduced via a specific example that we call the ``Dating Problem,'' which is exposed next.

\paragraph{The Dating Problem.}
A version of this problem arose during a freewheeling conversation with my friend and colleague Laurent El Ghaoui, one night of September 2015 in Berkeley. A politically corrected narrative is as follows.
  A person (hereafter, the ``player'') has the contact numbers of $n$ friends.
At some time of the day $\tau_0=0$ the player can select a first friend $i\in\{1,\ldots,n\}$
 and send a message inviting her out for dinner.
Each friend has a ranking (i.e., value -- the larger the better) $r_i\geq 0$ in the player's opinion  or, equivalently, $r_i$ is the reward the the player gets if the
$i$-th friend accepts the invitation. Also, each friend has a probability $p_i\in (0,1]$ of accepting the invitation, and  is characterized by the (random) time $\tau_i\geq 0$ she takes
for responding (positively or negatively) to the invitation.
Once an invitation message is sent, the player enters a lock-in period in which she cannot send out other invitations, since she cannot incur the risk (and the corresponding embarrassment) of receiving multiple positive answers.
The lock-in period ends when the friend responds.
If the friend $i$ invited at $\tau_0$ responds at time $\tau_1$ then, in the case of a positive answer the player gets reward $r_i$ and the game ends, and in the case of a negative answer she can send out at time $\tau_1$ another invitation to a newly selected friend  $j\neq i$, and wait for her response. The process goes on this way until either {\em (a)} the player receives a positive answer, or
 {\em (b)} she receives negative answers from all the $n$ friends; we let $T$ denote the (random) time at which the game ends.
 %
 The eventual reward $R$ that the player gets is equal to the ranking
 of the friend that accepted the invitation, in case  {\em (a)}, or it is equal to zero in case {\em (b)}.
 Clearly,  $R$ is a discrete random variable with support $\{r_1,\ldots,r_n,0\}$, and both $R$ and $T$
 depend on the specific invitation sequence that the player selects.
 The stochastic  decision problem the player faces is to determine an invitation sequence that optimizes
 a tradeoff between the expected reward (the higher the better) and the expected time at which the reward is obtained
 (the sooner the better).

\vspace{.5cm}
The mathematical structure behind the  Dating Problem can actually  be applied to several other interesting situations. Two of them are outlined next, further discussion is delayed to Section~\ref{sec:discussion}.

\paragraph{The Journal Submission Problem.}
An author has a scientific paper ready for submission, and there are $n$ journals that may be suitable for submitting the paper to. Each journal has a reputation $r_i$, which may be given, for instance, by the impact factor of the journal. Also, from each journal's web page the author may find information about the average acceptance rate $p_i$
of submitted papers to the $i$-th journal, and on the average number of weeks that are needed  for receiving an editorial decision. Since parallel submissions are forbidden, the author should decide to which journal to submit her paper first. Then, if the firstly selected journal refuses the paper,  she may try with a second journal, and so on until the paper gets eventually accepted by some journal, or refused by all. Again, the problem is to optimally decide the submission sequence
so to achieve an optimal tradeoff between expected reward and expected time to publication.

\paragraph{The House Bidding Problem.}
A family wants to buy a new house. There are $n$ interesting houses available in the real estate market, each of which has a ranking $r_i$ in the family's opinion.  For each of the $n$ houses it is possible to send
a binding offer to the real estate agency dealing with that property. The processing of each offer takes a random time $\tau_i$, and the estimated probability of a positive outcome for the $i$-th house is $p_i$.
The family must decide on which house to bid first.

\subsection{Disclaimer}
We wanted to preserve in the manuscript the
spontaneous nature of the creative process: the dating problem was born as
{\em divertissement}, and the solution presented here was worked out
by proceeding directly, for the fun of it, without prior examination of related literature.
After having obtained the main result, and at the time of putting things in clean form,
however, we did search the literature for related contributions and, not surprisingly, we found some. These are discussed briefly in the conclusion section.
 %
 We  make no claim that the structure underlying the dating problem
 is fully novel, nor that its solution cannot be possibly derived as a sub-case of some published result; only, that was not the route we took, and the specific setup and tradeoff optimization scheme we propose here do seem novel, to the best of the author's knowledge.

\section{Problem formulation and notation}
We next introduce a general framework in which all problems similar to the ones exemplified above may be cast.
We refer generically to friends, journals,  houses, etc. as ``opportunities.''
Each opportunity $O_i$, $i=1,\ldots,n$, is described
by a triple $O_i=(r_i,p_i,\tau_i)$,
where  $r_i\geq 0$ is the reward the the player may get
from the $i$-th opportunity,
 $p_i\in (0,1]$ is the probability
 with which the opportunity actually returns its reward $r_i$ to the player (i.e., the positive outcome probability),
 and $\tau_i\geq 0$ is the
 random time at which the opportunity outcome is revealed (i.e., the opportunity's response time).

Once an opportunity is tried, the player enters a lock-in period in which she cannot try other opportunities (exclusive opportunities).
The lock-in period ends when the opportunity outcome is revealed. In the case of a positive outcome from the $i$-th opportunity, the player gets the corresponding reward $r_i$, and the game ends; in the case of a negative outcome, the player tries another opportunity, and so on until either a reward is obtained, or all opportunities have been tried with negative outcomes, in which case the final reward is zero.

We consider  the  response times $\tau_i$,  $i=1,\ldots,n$, to be independent. We
denote with $F_i(t)\doteq  \mathbb{P}\{\tau_i \leq t\}$  the cumulative distribution function (CDF)
 of  $\tau_i$,  and  we let $\theta_i$ denote the mean response time.
 We denote by $\sigma$ a permutation of the first $n$ integers $\{1,\ldots,n\}$
 representing the scheduling order of the opportunities, so that $\sigma(1)$ is the index of the opportunity that is tried first, $\sigma(2)$ the one tried second, etc.
We initially suppose that the scheduling sequence $\sigma$ is fixed, and that the game is started at time $\tau_0=0$ by trying the first opportunity $\sigma(1)$, and waiting for its outcome.

The stochastic process representing the game is  denoted by $x(t)$,
and this process has a finite number of possible states, as depicted in Figure~\ref{fig:states}. The state $W_i$ represents the situation when the player is waiting for the outcome of opportunity $O_{\sigma(i)}$ (i.e., the $i$-th opportunity in the given scheduling sequence), and the state $R_i$
represents the situation when $O_{\sigma(i)}$ returns a positive outcome, hence the player  receives
reward $r_{\sigma(i)}$ and the game ends. State ``0'' represents the situation when the game ends with zero reward, which happens when all the opportunities returned a negative outcome.

\begin{figure}[htb]
\centerline{\scalebox{1.6}{\includegraphics{dating_graph2.pdf}}}
\caption{State transition graph for the sequential opportunity game.}
\label{fig:states}
\end{figure}

\section{The reward and finish time distributions}
Consider the probability with which the process  $x(t)$ enters one of the absorbing states
$R_i$, $i=1,\ldots,n$, or the ``0'' state, in which the final reward is zero. We let
$\pi_0(t) \doteq \mathbb{P}\{x(t) = \mbox{``0''}\}$, and
\[
\pi_i(t) \doteq \mathbb{P}\{x(t) = R_i\},\quad i=1,\ldots,n.
\]
Further, we define the random variables
\[
s_k \doteq \sum_{i=1}^k \tau_{\sigma(i)},\quad k=1,\ldots,n,
\]
that describe the sum of the response times of the first $k$ opportunities in the scheduling sequence $\sigma(1),\ldots\sigma(n)$.
We denote by $\Upsilon_k(t) \doteq \mathbb{P}\{s_k \leq t\}$ the cumulative probability distribution function of
$s_k$.
We observe that the event $\{x(t) = R_1\}$ happens when the first opportunity $O_{\sigma(1)}$ is tried,
a response is obtained at some time instant $\tau_{\sigma(1)} \leq t$, and this response is positive.
The probability of the event is thus $p_{\sigma(1)} \mathbb{P}\{s_1 \leq t\}$, that is
\[
\pi_1(t) = p_{\sigma(1)} \mathbb{P}\{s_1 \leq t\}= p_{\sigma(1)} \Upsilon_1(t).
\]
The event $\{x(t) = R_2\}$ happens instead when the first opportunity $O_{\sigma(1)}$ is tried,
a response is obtained at some time instant $\tau_{\sigma(1)} \leq t$, and this response is negative;
then the second opportunity $O_{\sigma(2)}$ is tried,
a response is obtained at some time instant $\tau_{\sigma(1)}+\tau_{\sigma(2)} \leq t$, and this response is positive.
The joint probability of these events is thus $(1-p_{\sigma(1)})p_{\sigma(2)} \mathbb{P}\{s_2 \leq t\}$, that is
\[
\pi_2(t) = (1-p_{\sigma(1)})p_{\sigma(2)} \Upsilon_2(t).
\]
Similarly, the probability pf the event $\{x(t) = R_3\}$ is
\[
\pi_3(t) = (1-p_{\sigma(1)})(1-p_{\sigma(2)}) p_{\sigma(3)} \Upsilon_3(t),
\]
and proceeding along the same line one obtains that, for  $i=1,\ldots,n$,
\begin{equation}
\pi_i(t) = c_i \Upsilon_i(t),\quad \mbox{where } c_i\doteq p_{\sigma(i)}\cdot\prod_{j=1}^{i-1}(1-p_{\sigma(j)}),
\label{eq:pii}
\end{equation}
and
$
\pi_{0}(t) = \mathbb{P}\{x(t) = \mbox{``0''}\} =  c_{n+1} \Upsilon_{n}(t)
$,
where
$
c_{n+1}\doteq  \prod_{j=1}^{n}(1-p_{\sigma(j)})
$,
and it can readily verified that
$
\sum_{i=1}^{n+1} c_i = 1
$.
Note that $c_i$, $i=1,\ldots,n$, represents the probability of having the first success exactly at the $i$-th trial
in a sequence of independent Bernoulli trials having success probabilities $p_{\sigma(1)},\ldots,p_{\sigma(i)}$
(incidentally, the sum of Bernoulli trials with possibly unequal success probabilities give rise to a so-called Poisson's binomial distribution, see, e.g., \cite{Wang:93}).
Given a scheduling sequence $\sigma$, vector $\pi(t) = (\pi_1(t),\ldots,\pi_n(t),z(t))$
represents the probability mass distribution over the rewards $(r_{\sigma(1)},\ldots,r_{\sigma(n)},0)$,
where $z(t) \doteq 1- \sum_{i=1}^n \pi_i(t)$ is the probability of having zero reward at time $t$ (notice that this is the probability of being in state ``0,'' plus the sum of the probabilities of all the waiting states $W_1,\ldots,W_n$).
The expected reward at time $t$ is therefore expressed by
\begin{eqnarray*}
\E{R(t)} &=& \sum_{i=1}^n r_{\sigma(i)} \pi_i(t) =
\sum_{i=1}^n r_{\sigma(i)} c_i \Upsilon_i(t)
=\sum_{i=1}^n\Upsilon_i(t)   r_{\sigma(i)} p_{\sigma(i)}\cdot\prod_{j=1}^{i-1}(1-p_{\sigma(j)})  .
\label{eq:exp_reward}
\end{eqnarray*}
We observe that the expected reward is a linear combination of the CDFs $\Upsilon_i(t)$, with positive coefficients.
Since  $\Upsilon_i(t)$ is monotone nondecreasing and $\Upsilon_i(t)|_{t\to\infty}=1$, we conclude that $\E{R(t)}$ is also monotone nondecreasing,
and its maximum value is achieved in the limit for $t\to\infty$. We thus define the eventual expected reward $\bar R$ as
\begin{equation}
\bar R = \bar R(\sigma) \doteq \lim_{t\to\infty} \E{R(t)} = \sum_{i=1}^n r_{\sigma(i)} c_i =
\sum_{i=1}^n  r_{\sigma(i)} p_{\sigma(i)}\cdot\prod_{j=1}^{i-1}(1-p_{\sigma(j)})  .
\label{eq:ssexpreward}
\end{equation}
Next, we define the random variable $T$ as the time at which the game ends, which coincides with the time at which the process $x(t)$ enters one of the absorbing states $R_1,\ldots,R_n$, or the ``0'' state.
Observe that the event $\{T \leq t\}$ happens if and only if at time $t$ the process $x(t)$ is in one of
the states $R_1,\ldots,R_n$, or in the ``0'' state. Therefore
\[
\Phi_T(t) \doteq \mathbb{P}\{T \leq t\} = \mathbb{P}\{ x(t) = R_1 \mbox{ or } x(t) = R_2
\mbox{ or } \cdots \mbox{ or }  x(t) = R_n  \mbox{ or } x(t) = \mbox{``0''}
 \}.
\]
Since the events $\{x(t) = R_i\}$ are mutually exclusive, it holds that
\[
\Phi_T(t)  =  \mathbb{P}\{ x(t) = \mbox{``0''}\} + \sum_{i=1}^{n}\mathbb{P}\{ x(t) = R_i\}
=\pi_0(t) +  \sum_{i=1}^{n} \pi_i(t) =
c_{n+1} \Upsilon_n(t) +
\sum_{i=1}^{n} c_i \Upsilon_i(t).
\label{eq:exittime_CDF}
\]
Since $T$ is nonnegative, the expected exit time can then be obtained as
\begin{eqnarray*}
\bar T =\bar T(\sigma) \doteq \E{T} &=&  \int_{0}^\infty (1-\Phi_T(t))\d t \\
&=&
=
 c_{n+1}\int_{0}^\infty  (1- \Upsilon_n(t))\d t +
 \sum_{i=1}^{n} c_i  \int_{0}^\infty  (1-\Upsilon_i(t))\d t \\
 &=&
c_{n+1}\E{s_n} +    \sum_{i=1}^{n} c_i  \E{s_i},
\end{eqnarray*}
where, due to linearity of the expectation,
\begin{eqnarray*}
\E{s_i} &=& \E{\tau_{\sigma(1)} + \cdots + \tau_{\sigma(i)}} =
 \E{\tau_{\sigma(1)}} + \cdots + \E{\tau_{\sigma(i)}} =  \theta_{\sigma(1)} + \cdots + \theta_{\sigma(i)}.
 \end{eqnarray*}
Therefore,
\begin{equation}
\bar T(\sigma) =   c_{n+1}\sum_{k=1}^n \theta_{\sigma(k)} + \sum_{i=1}^{n} c_i \left( \sum_{k=1}^i \theta_{\sigma(k)}\right) .
\label{eq:barT}
\end{equation}
\section{Optimal opportunity scheduling}
For any given  scheduling sequence $\sigma$, we are now able to evaluate the eventual expected reward $\bar R$, given by eq.\ (\ref{eq:ssexpreward}), and the expected time at which the reward is obtained, $\bar T$, given by eq.\ (\ref{eq:barT}).
The problem we face next is to actually determine an optimal scheduling sequence $\sigma^*$ so to achieve an optimal tradeoff
between the reward value $\bar R$, which we like to be large, and the time value $\bar T$, which we like to be small, the ideal situation being to receive a large reward very soon in time.
The pair of values $(\bar T, \bar R)$ depends on the scheduling sequence $\sigma$.
In principle, the player may compute
$(\bar T, \bar R)$ for all the $n!$ permutations of $\{1,2,\ldots,n\}$, and then pick the pair that best suits her.
However, this is only feasible for very small values of $n$.

We quantify the tradeoff between the requests of
large $\bar R$ and small $\bar T$ by considering
 a composite objective function to be maximized.
Namely, we consider the problem
\begin{equation}
J^*(\eta) = \max_{\sigma\in \mbox{perm}\{1,\ldots,n\}} \; J(\sigma) \doteq \bar R(\sigma) -\eta \bar T(\sigma),
\label{eq:sched_opt}
\end{equation}
where $\eta\geq 0$ is some given tradeoff parameter, and the optimization is to be performed over
all permutations $\sigma$ of $\{1,\ldots,n\}$. By sweeping $\eta$ from the zero value to some large value, we obtain
all the tradeoff-optimal solutions. Geometrically, a tradeoff-optimal solution is a scheduling
$\sigma^*(\eta)$
that yields a point in the $(\bar T, \bar R)$ plane that passes through the line $\bar R -\eta \bar T = J^*(\eta)$,
where $J^*(\eta)$ is the optimal value of the objective in (\ref{eq:sched_opt})

For example, using the data in Table~\ref{tab_countex1}, with
$n=5$, we evaluated $(\bar T, \bar R)$ for all the $n! = 120$ scheduling permutations, obtaining the scatter plot shown in Figure~\ref{fig:scatter1}, and two different optimal solutions corresponding to $\eta= 0.02$ and $\eta=0.15$.

\begin{table}[htb]
\begin{center}
    \begin{tabular}{ l||l | l | l }
$i$ & reward $r_i$ & probability $p_i$ & avg. time $\theta_i$  \\ \hline
1 & 12    & 0.2    & 8     \\
2 & 10 & 0.3 & 14 \\
3 & 8.2    & 0.25 & 10  \\
4 & 8   &  0.5 & 5  \\
5 & 6    & 0.7 & 7
\\
    \end{tabular}
    \end{center}
        \caption{\label{tab_countex1} Example  data.}
\end{table}

\begin{figure}[h!!]
\centerline{\scalebox{.68}{\includegraphics{scatter1.pdf}}}
\caption{Scatter plot of the pairs $(\bar T, \bar R)$ for the data in Table~\ref{tab_countex1}, for all the $n! = 120$ scheduling permutations.  }
\label{fig:scatter1}
\end{figure}

The tradeoff-optimal point in the upper-right part of the plot in Figure~\ref{fig:scatter1} is obtained from
 the value of the tradeoff parameter $\eta=0.02$, and corresponds the optimal scheduling $\sigma^*(\eta)=\{1,2,4,3,5\}$.
 The  point in the lower-left part of the plot is obtained from
the value of the tradeoff parameter $\eta=0.15$, and corresponds the optimal scheduling $\sigma^*(\eta)=\{4,1,5,2,3\}$.

Problem~(\ref{eq:sched_opt}) involves maximization of a nonlinear objective over
permutations of the first $n$ integers and, as such, looks intractable as soon as $n$ grows beyond, say, the first ten integers
 (e.g., a brute-force approach for $n=10$ would already require checking $n! = 3,628,800$ scheduling  permutations).
Contrary to this first assessment, however, the main result below shows that optimal solutions
to problem~(\ref{eq:sched_opt}) can be very easily computed, by simply sorting a sequence of $n$ numbers.

\begin{theorem}
\label{thm:main}
Any permutation $\sigma^*$ of $\{1,\ldots,n\}$ that is optimal for problem~(\ref{eq:sched_opt}) is such that
the sequence of numbers $\{r_{\sigma^*(i)} - \eta \theta_{\sigma^*(i)}/p_{\sigma^*(i)} \}$,
$i=1,\ldots,n$, is ordered non-increasingly.
\end{theorem}

\noindent
{\bf Proof.}
Consider the expression for the composite objective function
\[
J= \bar R -\eta \bar T =
- \eta \prod_{j=1}^{n}(1-p_{\sigma(j)}) \sum_{k=1}^n \theta_{\sigma(k)} +
\sum_{i=1}^n z_i p_{\sigma(i)}\prod_{j=1}^{i-1}(1-p_{\sigma(j)}) ,
\]
where we defined
\[
z_i \doteq r_{\sigma(i)} -\eta  \sum_{k=1}^i \theta_{\sigma(k)},\quad i=1,\ldots,n.
\]
Observe that $z_i$ depends only on the value $r_{\sigma(i)}$, and on the
sum of the values of $\theta_{\sigma(1)},\ldots,\theta_{\sigma(i)}$;  hence, it is invariant
to permutations of these elements.  Further, observe that
the first term in the expression of $J$ does not depend on the scheduling sequence, hence it can be dropped from the
objective without affecting the optimal solution. We thus consider only the last term in the objective, defining
\begin{equation}
V_0(\sigma(1),\ldots,\sigma(n)) \doteq \sum_{i=1}^n z_i p_{\sigma(i)}\prod_{j=1}^{i-1}(1-p_{\sigma(j)})
\label{eq:V0}
\end{equation}
as the modified objective to be maximized.
Noticing that
\begin{eqnarray*}
\lefteqn{
V_0(\sigma(1),\ldots,\sigma(n))  =     z_{1} p_{\sigma(1)} + } \\
&&
+(1-p_{\sigma(1)})\left(
z_2 p_{\sigma(2)} +
 (1-p_{\sigma(2)}) \left(
 z_3 p_{\sigma(3)}
 + (1-p_{\sigma(3)}) \left(
 z_4 p_{\sigma(4)} + \cdots
 \right)
 \right)\cdots
  \right),
\end{eqnarray*}
we define
\begin{eqnarray*}
V_{k}(\sigma(k+1),\ldots,\sigma(n))  &\doteq & \sum_{i={k+1}}^n z_i p_{\sigma(i)}\prod_{j=k+1}^{i-1}(1-p_{\sigma(j)}),
\quad \mbox{for } k=0,1,\ldots,n-1,
\end{eqnarray*}
and we have that
\begin{eqnarray*}
V_0(\sigma(1),\ldots,\sigma(n))  &=& z_1  p_{\sigma(1)} + (1-p_{\sigma(1)})
V_{1}(\sigma(2),\ldots,\sigma(n)) \\
V_{1}(\sigma(2),\ldots,\sigma(n)) &=& z_2 p_{\sigma(2)} +
 (1-p_{\sigma(2)}) V_{2}(\sigma(3),\ldots,\sigma(n))  \\
 \vdots && \vdots \\
 V_{n-2}(\sigma(n-1),\sigma(n)) &=& z_{n-1} p_{\sigma(n-1)} +
 (1-p_{\sigma(n-1)}) V_{n-1}(\sigma(n))  \\
 V_{n-1}(\sigma(n))  &=& z_n p_{\sigma(n)}.
\end{eqnarray*}
Now, the problem of maximizing $V_0$
with respect to the scheduling sequence has ``optimal substructure,'' that is, it satisfies Bellman's Principle of Optimality
(see \cite{Bellman:57}, Sec.\ III.3), since
any optimal decision policy is such that
no matter what the initial $k$ decisions are, the remaining $n-k$
decisions constitute an optimal policy with respect to the state resulting from the initial decisions.
In our case, it is readily seen that if $\sigma^*(1),\sigma^*(2),\ldots,\sigma^*(n)$ is the  optimal sequence that maximizes $V_0$, then
$\sigma^*(2),\sigma^*(3),\ldots,\sigma^*(n)$  maximizes
$V_{1}$, $\sigma^*(3),\ldots,\sigma^*(n)$ maximizes $V_{2}$, and so on.

Let then $\sigma^*$ be an optimal scheduling sequence, and consider, for any $k\geq 1$,
the optimal residual value
\begin{eqnarray*}
V_{k-1}^* &=& z^*_k p_{\sigma^*(k)} + (1-p_{\sigma^*(k)}) V_{k}^* \\
&=&
z^*_kp_{\sigma^*(k)} + (1-p_{\sigma^*(k)})
\left[ z^*_{k+1}p_{\sigma^*(k+1)}  + (1-p_{\sigma^*(k+1)}) V_{k+1}^* \right].
\end{eqnarray*}
We next evaluate the residual value $V_{k-1}'$ obtained by exchanging
the order of the $k$-th and the $(k+1)$-th decisions in the optimal scheduling sequence.
Exchanging $\sigma^*(k) \leftrightarrow \sigma^*(k+1)$ yields
\begin{eqnarray*}
z'_k &\doteq &  z^*_{k+1} +\eta \theta_{\sigma^*(k)}\\
z'_{k+1} &\doteq  &  z^*_{k} -\eta \theta_{\sigma^*(k+1)},
\end{eqnarray*}
whence
\begin{eqnarray*}
V_{k-1}' &=& z'_k  p_{\sigma^*(k+1)} + (1-p_{\sigma^*(k+1)})
\left[z'_{k+1} p_{\sigma^*(k)}  + (1-p_{\sigma^*(k)}) V_{k+1}' \right] \\
&=& z'_k  p_{\sigma^*(k+1)} + (1-p_{\sigma^*(k+1)})
\left[z'_{k+1} p_{\sigma^*(k)}  + (1-p_{\sigma^*(k)}) V_{k+1}^* \right] ,
\end{eqnarray*}
where we used the fact that $V_{k+1}'  = V_{k+1}^*$, since the calling sequence
from $k+2$ onwards is kept unchanged, and $V_{k+1}$ is invariant
to permutations in the ordering of the previous scheduling, from $1$ up to $k+1$.
Straightforward computations then show that
\begin{eqnarray*}
  V_{k-1}^*  - V_{k-1}'  &=&
z^*_kp_{\sigma^*(k)} + (1-p_{\sigma^*(k)})
\left[ z^*_{k+1}p_{\sigma^*(k+1)}  + (1-p_{\sigma^*(k+1)}) V_{k+1}^* \right] \\
&& - z'_k  p_{\sigma^*(k+1)} - (1-p_{\sigma^*(k+1)})
\left[z'_{k+1} p_{\sigma^*(k)}  + (1-p_{\sigma^*(k)}) V_{k+1}^* \right]  \\
&=&
z^*_kp_{\sigma^*(k)} +  z^*_{k+1}p_{\sigma^*(k+1)}   -p_{\sigma^*(k)}z^*_{k+1}p_{\sigma^*(k+1)} +
 (1-p_{\sigma^*(k)}) (1-p_{\sigma^*(k+1)}) V_{k+1}^*  \\
 &&
 - z'_k  p_{\sigma^*(k+1)} - z'_{k+1} p_{\sigma^*(k)} + p_{\sigma^*(k+1)}z'_{k+1} p_{\sigma^*(k)}
 - (1-p_{\sigma^*(k+1)}) (1-p_{\sigma^*(k)}) V_{k+1}^*  \\
 &=&
 p_{\sigma^*(k)}(z^*_k- z'_{k+1}) + p_{\sigma^*(k+1)} ( z^*_{k+1}- z'_k) +
 p_{\sigma^*(k)}p_{\sigma^*(k+1)} (z'_{k+1} -z^*_{k+1} ) \\
 &=&
 p_{\sigma^*(k)}\eta \theta_{\sigma^*(k+1)}
 - p_{\sigma^*(k+1)} \eta \theta_{\sigma^*(k)}
 + p_{\sigma^*(k)}p_{\sigma^*(k+1)} (r_{\sigma^*(k)}-r_{\sigma^*(k+1)} ) \\
 &=&
  p_{\sigma^*(k)}p_{\sigma^*(k+1)}
   \left(
   (r_{\sigma^*(k)} - \eta \theta_{\sigma^*(k)}/p_{\sigma^*(k)})
   - (r_{\sigma^*(k+1)}  -\eta  \theta_{\sigma^*(k+1)}/p_{\sigma^*(k+1)}    )
   \right).
\end{eqnarray*}
Now, since $V_{k-1}^* $ is maximal by definition, it must hold that
$V_{k-1}^*  - V_{k-1}' \geq 0$, thus
\[
 p_{\sigma^*(k)}p_{\sigma^*(k+1)}
   \left(
   (r_{\sigma^*(k)} - \eta \theta_{\sigma^*(k)}/p_{\sigma^*(k)})
   - (r_{\sigma^*(k+1)}  -\eta  \theta_{\sigma^*(k+1)}/p_{\sigma^*(k+1)}    )
   \right) \geq 0,
\]
which  implies that
\[
r_{\sigma^*(k)} - \eta \theta_{\sigma^*(k)}/p_{\sigma^*(k)} \geq
r_{\sigma^*(k+1)}  -\eta  \theta_{\sigma^*(k+1)}/p_{\sigma^*(k+1)},
\]
i.e., that any optimal scheduling sequence is such that the values
in the sequence $\{r_{\sigma^*(i)} - \eta \theta_{\sigma^*(i)}/p_{\sigma^*(i)} \}$,
$i=1,\ldots,n$,
are ordered non-increasingly.
{\hfill $\square$}

\begin{remark}[Tradeoff-optimal and Pareto-optimal points] \rm
\label{rem:frontier}
Consider all possible perm\-uta\-tions of $\{1,\ldots,n\}$ and plot the corresponding
$\bar R$ and $\bar T$ values as points in the
$(\bar T,\bar R)$ plane, as we did in in Figure~\ref{fig:scatter1}.
The convex hull of such points is a polytope. The tradeoff-optimal points that we find by maximizing
the objective $J=\bar R -\eta \bar T$ correspond to vertices of this polytope. More precisely, they correspond to the
 farthest points in the direction $[-\eta,\; 1]$ that are tangent to the polytope. All such vertex solutions can be found via Theorem~\ref{thm:main}, by sweeping over a suitable grid of values of the tradeoff parameter $\eta$.
 We remark, however, that there may exist points that are optimal in a Pareto sense, but that cannot be found via the proposed method. Pareto-optimal points in the $(\bar T,\bar R)$ plane are all those points for which no other point exists
 that is simultaneously to the West and to the North of the considered point. For such points it is indeed not possible to simultaneously increase the expected reward {\em and} decrease the expected end time. Clearly, all the vertex points
 that we find by maximizing $J$ are Pareto-optimal, but there may exist Pareto-optimal points that lie in the interior of the polytope and that hence cannot be found via Theorem~\ref{thm:main}. Some of these points can easily be spotted by observing Figure~\ref{fig:scatter1}.
\end{remark}

\begin{remark}[Batch vs.\ sequential schedule] \rm
\label{rem:sequential}
In a typical dynamic decision problem one may take two approaches. The first one is a ``batch'' approach, in which
all decisions are taken  at time $\tau_0=0$, by maximizing the objective and thus computing a-priori all decisions
to be implemented at later times.
However, at time $\tau_0 = 0$ we really need to know and implement only the first decision (i.e., in out context, find the first opportunity to try). For the second decision, we can {\em wait and see} what is the outcome of
the first opportunity, and only then decide which is the one to try second, and so on for later decisions.
Such as sequential approach  is, in general, better than the batch one, since the player can exploit
full information from the realizations of the uncertainty that happened right before the time when the decision is really needed.

The approach we took in this work is a batch one. However, it is easy to prove that, for the specific problem at hand, it makes no difference to take a batch or a sequential decision approach. Indeed, in a sequential approach, the first decision
$\sigma^*(1)$ is computed by maximizing the full objective $V_0$ in (\ref{eq:V0}), hence the first decision
is the same for the batch and the sequential approach.
The sequential approach would then consider the conditional value of the objective, given the outcomes of the first decision $\sigma^*(1)$.
It is straightforward to verify that the conditional value of the forward objective after the outcome of the first opportunity is
of the form $V_1$, plus additive terms that depend on the first decision and that do not affect the optimal solution.
The optimal second decision, according to the sequential approach, is the one that maximizes $V_1$, and hence it coincides with the solution $\sigma^*(2)$ from the batch approach. Similarly, at any later decision time $\tau_k$, the sequential approach  maximizes a conditional objective which coincides with $V_k$ (besides additive terms that do not affect the optimal solution), hence the ensuing sequential decisions $\sigma^*(k)$ coincide with the batch decisions.
\end{remark}

\subsection{Example}
We considered a second example with $n=20$ opportunities,
with the randomly generated data shown in the data matrix below, in which the first row contains the rewards
$r_i$, the second row contains probabilities $p_i$, and the third row contains  mean response times $\theta_i$.

\begin{eqnarray*}
O &=&
\left[\begin{array}{ccccccccccc} 27.0 & 14.0 & 3.0 & 28.0 & 9.0 & 19.0 & 20.0 & 7.0 & 29.0 & 20.0 & 17.0  \\
0.449 & 0.659 & 0.753 & 0.805 & 0.029 & 0.780 & 0.567 & 0.076 & 0.252 & 0.133 & 0.564 \\
18.0 & 2.0 & 2.0 & 43.0 & 11.0 & 21.0 & 7.0 & 13.0 & 27.0 & 15.0 & 4.0
\end{array}\right. \\
&&
\left.\begin{array}{ccccccccc}
27.0 & 17.0 & 1.0 & 15.0 & 25.0 & 23.0 & 18.0 & 1.0 & 22.0\\
0.541 & 0.069 & 0.988 & 0.251 & 0.315  & 0.300 & 0.042 & 0.528 & 0.256\\
7.0 & 33.0 & 37.0 & 20.0 & 3.0 & 8.0 & 10.0 & 40.0 & 51.0 \end{array}\right].
\end{eqnarray*}
A brute-force approach that explores all permutations of $\{1,\ldots,20\}$ is in this case unviable, since there are
$20! \simeq 2.43 \times 10^{18}$ permutations.
However, by using Theorem~\ref{thm:main} we readily find all solutions on the tradeoff-optimal frontier, for
gridded values of $\eta$ in the interval $[0,\, 10]$, see Figure~\ref{fig:exampleplot}.

\begin{figure}[h!tb]
\centerline{\scalebox{.75}{\includegraphics{exampleplot.pdf}}}
\caption{Left: $(\bar T, \bar R)$ pairs on the tradeoff-optimal frontier, obtained for values of the tradeoff parameter
$\eta\in[0,\, 10]$. Right: plot of the optimal objective value $J^*(\eta)$.
 }
\label{fig:exampleplot}
\end{figure}

For $\eta=0$, we find the optimal value $J^*(0) = 27.928$,
with $\bar R^*(0) =27.928 $, $\bar T^*(0) = 63.91$, and
optimal sequence
\[
\sigma^*(0) = \{ 9,     4,    12,     1,    16,    17,    20,     7,    10,     6,    18,   11,    13,    15,     2,     5,     8,     3,    14,    19\},
\]
which simply corresponds to ordering the rewards $r_i$ non-increasingly, regardless of all other parameters.
Notice that since the time $\bar T$ does not influence the objective $J$, for $\eta=0$, the optimal scheduling sequence has a high expected end time $\bar T^*(0) = 63.91$.
However, for example, to a value $\eta =0.5 $, it corresponds a value of $\bar R^*(0.5) = 24.08$,
while $\bar T^*$ drops to  $\bar T^*(0.5) = 11.84$, that is we reduce the expected time by about $81\%$
at the price of a modest $13.8\%$ decrease in expected reward, see Figure~\ref{fig:RTplot}.
The optimal sequence, for  $\eta =0.5 $, is
\[
\sigma^*(0.5) = \{  12,    16,     7,    11,     2,    17,     1,     6,     3,     4,    14,     9,    15 ,   10 ,   19,    20,     8,    18,     5,    13\}.
\]

\begin{figure}[h!tb]
\centerline{\scalebox{.7}{\includegraphics{RT.pdf}}}
\caption{Left:  value of $\bar T^*$ as a function of $\eta$.
Right: value of $\bar R^*$ as a function of $\eta$.
 }
\label{fig:RTplot}
\end{figure}

\section{Discussion}
\label{sec:discussion}
A quick analysis of the literature reveals that our Dating Problem has indeed connections to several more or less known problems.
A classical one, apparently known since the 1950s, is the so-called Best Choice Problem,
also known as
the Secretary Problem which, incidentally, was about hiring, not dating, the secretary; see \cite{Ferguson:89}.
The structure of this problem is, however, different from the Dating Problem
in that opportunities are presented to the decision maker in random order, one at a time, and she has to select the best of  all opportunities. Closer to our model is a problem described in \cite{Duffuaa:96}, which extends previous results from
\cite{Alidaee:94}, and which
 deals with multi-characteristic sequential testing and job processing on a single machine.
 In \cite{Duffuaa:96}, a stochastic ``Candidate Selection Problem'' is described, in which $n$ candidates are to be selected for filling one available position. The benefits for hiring candidate $i$ are quantified by a random variable $r_i$,
 and the probability of acceptance of the job by candidate $i$ is $p_i$. There is a cost for offering the job described by a random variable $C$, and the objective is to find the optimal selection schedule of the candidates in order to maximize the expected benefit. The main difference with respect to the Dating Problem is that the response times of the candidates are not taken into consideration in the model and as  components of the objective to be maximized.
The management literature also has other interesting examples, structurally quite unrelated to the Dating Problem,
but for which optimal decision are obtained by simply putting some sequence of numbers in monotonic order.
One example is the so-called Smallest Variance First rule for minimizing the expected makespan in a single-machine scheduling problem, see \cite{Pinedo:07}. Another example involves lot sizing in sequential English auctions, where
a widely held notion is that lots should be arranged in order of decreasing value, see, e.g., \cite{TrNaKa:09} and
\cite{Mitha:12}.

The basic Dating Problem presented here can be extended in several ways. One direction could be that of relaxing the assumption that the decision maker has exact knowledge of the parameters $(r_i,p_i,\theta_i)$, thus considering {\em ambiguity} in the stochastic description of the problem.

redpajama_set_name: RedPajamaArXiv


Planet and its associated companies operate an ethical and open approach to the way it does business. The company does not tolerate any form of unethical behaviour. Modern slavery is criminal activity and a violation of human rights. The deprivation of a person's liberty by another in order to exploit them for personal or commercial gain is unacceptable. For these reasons, slavery and human trafficking, including forced labour and unlawful child labour, are a matter of zero tolerance for the company.
The company recognises it has a responsibility to take a robust approach to slavery and human trafficking. Following the implementation of the Modern Slavery Act 2015 in the UK, the company is committed to maintaining and enforcing effective systems and controls to prevent slavery and human trafficking, within its corporate activities.
Human trafficking and slavery are crimes under UK and international law. These crimes exist in countries throughout the world. This policy statement defines the company's commitment to ensuring human trafficking and slavery does not exist within its own business. It also defines how the company will make efforts to eradicate it from other businesses with whom it maintains a relationship, and from within its supply chain.
This policy applies to all individuals employed by Planet and its subsidiary and affiliated companies (referred to as Planet or the Company in this policy) including directors, employees, including part-time and fixed term employees (referred to as staff or employees in this policy) and to interns and work experience students, temporary and agency staff and Contractors and Consultants (referred to as associates in this policy).
Human trafficking: the recruitment, transportation, transfer, harbouring or receipt of persons, by means of the threat or use of force or other forms of coercion, of abduction, of fraud, of deception, of the abuse of power or of a position of vulnerability. Or of the giving or receiving of payments or benefits to achieve the consent of a person having control over another person for the purpose of exploitation.
Harmful child labour: consists of the employment of children which is economically exploitative, or is likely to be hazardous to, or interfere with, the child's education, or to be harmful to the child's health, or physical, mental, spiritual, moral or social development.
The detection and reporting of slavery is the responsibility of all employees. Employees should raise any concerns about any issue or suspicion of modern slavery in any part of the company's business or supply chain at the earliest possible stage. Suitable channels of communication by which an employee can report confidentially, any suspicion of slavery, are detailed in the Planet Whistleblowing procedure.
The company will conduct 'right to work' checks on every employee within its employment. The company expects all of its supply chain to perform the same checks in accordance with the Immigration, Asylum and Nationality Act 2006.
Will ensure that any sub-contractors or suppliers from whom they source goods and/or services for incorporation in those supplied to Planet, also adhere to these requirements.
Suppliers will certify compliance with this policy and their adherence to relevant human trafficking and slavery laws in each of the relevant countries in which they operate.
Suppliers who are found to be engaged or to have engaged in human trafficking and slavery or which refuse to co-operate with any audit to verify compliance with his policy, will be liable to have any supply agreement, arrangement or other contract with Planet, terminated immediately, without compensation.
The company commits to taking all necessary steps to ensure both its workforce and suppliers engagement are free from the effects associated with modern slavery, human trafficking, and forced or bonded/imprisoned labour.
Any reported breach of this policy will be investigated and may lead to legal proceeding or disciplinary action, which subsequently could result in employee dismissal.
This policy replaces any previously published policy on this subject. This policy is for internal use only and should not be distributed outside Planet without written consent from the Policy Owner. This policy will be periodically reviewed. Any amendment to it and the effective date of the amendment will be notified to employees by the Company's HR Department. This may be by means of the Company's intranet or via use of notice boards.


text:
Q: Passing OracleLob as parameter to a function I want to accomplish a similar thing:
try
{
    openConnection();
    OracleCommand cmd = new OracleCommand("SELECT CUSTOMER_ID, IMAGE_BLOB FROM CUSTOMER_IMAGE WHERE CUSTOMER_ID IN (3026)", conn);
    string pubID = "";
    OracleDataReader reader = cmd.ExecuteReader(CommandBehavior.SequentialAccess);

    //create the report object
    MemoryStream memStream;
    DataSet ds = new DataSet();
    DataTable ImageTable = new DataTable();
    BinaryReader binReader;
    DataRow dr;

    byte[] byteArrName;
    OracleLob blob;

    while (reader.Read())
    {
        pubID = reader.GetValue(0).ToString();

        // Obtain a LOB
        blob = reader.GetOracleLob(1);

        // Create a byte array of the size of the Blob obtained
        byteArrName = new byte[blob.Length];

        // Read blob data into byte array
        int i = blob.Read(byteArrName, 0, System.Convert.ToInt32(blob.Length));

        //Copied the contents of byte array to stream
        memStream = new MemoryStream(byteArrName);

        //Create a column of type byte[]
        ImageTable.Columns.Add(new DataColumn("id", typeof(string)));
        ImageTable.Columns.Add(new DataColumn("image", typeof(System.Byte[])));

        //Reading the stream which has the blob data
        binReader = new BinaryReader(memStream);
        dr = ImageTable.NewRow();

        dr["id"] = pubID;
        //ReadBytes method to add a byte array of the image stream.
        dr["image"] = binReader.ReadBytes((int)binReader.BaseStream.Length);
        ImageTable.Rows.Add(dr);

        memStream.Close();
        binReader.Close();
    }

    ds.Tables.Add(ImageTable);

    //Creating a temporary dataset which hold the image
    ds.WriteXmlSchema(@Directory.GetCurrentDirectory() + "\\temp.xsd");

    reader.Close();
    conn.Close();
}

Now, I'll populate that temp.xsd in the Crystal Report such that the image will be displayed dynamically. This is just a sample code I wrote from scratch, but to fit my scenario, I need to get the image that is already in dtAcctSigner.Rows[0]["IMAGE_BLOB"], so just wondering if there's any way I can fetch this BLOB just like I fetch in the above code as
OracleDataReader.GetOracleLob();

For that, I need to pass a column of the datatable(Type-OracleLob) as a parameter to a function like this:
Update(dtAcctSigner.Rows[0]["IMAGE_BLOB"]);

And the function goes as follows:
public void Update(OracleLob a)
{
// I want to do take the OracleLob and make into a memorystream and put it into temp.xsd here
}

But I get an error:
cannot convert 'object' to 'OracleLob'

Please let me know what I'm doing wrong.

A: using(reader)
{
      //Obtain the first row of data.
      reader.Read();
      //Obtain the LOBs (all 3 varieties).
      OracleLob BLOB = reader.GetOracleLob(1);
      ...

      //Example - Reading binary data (in chunks).
      byte[] buffer = new byte[4096];
      while((actual = BLOB.Read(buffer, 0, buffer.Length)) >0)
         Console.WriteLine(BLOB.LobType +
            ".Read(" + buffer + ", " + buffer.Length + ") => " + actual);

      ...
}

I personally would create and add columns to the DataTable this way but it's up to you to try it this way or another way that you know will work
DataTable table = new DataTable("ImageTable"); //Create a new DataTable instance.

DataColumn column0 = new DataColumn("id"); //Create the column.
column.DataType = System.Type.GetType("System.String"); //Type string

DataColumn column1 = new DataColumn("image"); //Create the column.
column.DataType = System.Type.GetType("System.Byte[]"); //Type byte[] to store image bytes.
column.AllowDBNull = true;
column.Caption = "My Image";

table.Columns.Add(column0); //Add the column to the table.
table.Columns.Add(column1); //Add the column to the table.

Then, add a new row to this table and set the value of the MyImage column.

DataRow row = table.NewRow();
row["MyImage"] = <Image byte array>;
tables.Rows.Add(row);

redpajama_set_name: RedPajamaStackExchange


text:
A Peek Inside A Tech Startup
Posted: January 31, 2014 | Author: clarkreid | Filed under: Uncategorized | Leave a comment
This week, I had the opportunity to visit with the founder of one of the many startups in San Francisco. They are mostly in curated workspaces, not the garages of days gone by in Silicon Valley now. Here's a little peek behind the curtain.
https://clarkreid.files.wordpress.com/2014/01/vigo-startup1-reid.mp3
Rumor: Solar Charging iPhone
As the rumors continue to fly about the iPhone 6, here's a new one that includes an earlier one. We already knew Apple has done a trial production run of sapphire screens, now bgr.com tells us that analyst Seeking Alpha has found that the sapphire glass may actually include tiny solar panels to solar charge your phone.
Smartphones have hit a big milestone…theverge.com says last year, more than a billion were shipped worldwide. That's according to International Data Corporation. 314 million of those were just from Samsung.
Can't wait to start making things with that 3D printer? Gigaom.com reports that on February 20th, Makerbot 3D printers will be available from Dell's online shop. You can also get them from Microsoft and Amazon.
A Few Thoughts on the Mac at 30
Posted: January 25, 2014 | Author: clarkreid | Filed under: Uncategorized | Leave a comment https://clarkreid.files.wordpress.com/2014/01/1kgomac30thannivpiece1-24-14.mp3
Google's Ad Sponsored Free Ride Idea
Slashdot.org notes that Google has gotten a patent for what they call 'Transportation-Aware Physical Advertising Conversions.' In English, it's a system for arranging free or discounted rides to an advertiser's business location…in Google driverless cars! A lot of patents don't ever result in something tangible, of course. If this one does, it will be a huge change that will affect private cars in addition to taxis and busses.
Microsoft's Surface tablet had a solid quarter with revenue of $893 million…up from $400 million the preceding quarter. Techcrunch.com says it may not be a smash hit for Redmond, but is a big move in the right direction
Here's something that a South Korean court just ruled that should be done here…zdnet.com reports that they are making smartphone makers give users the option to delete pre-installed 'bloatware' starting in April.
Downside of the Internet of Things
One of the downsides of the wired house or so-called 'internet of things' has showed up. Cnet.com reports that a smart fridge has been caught acting in a botnet that sent out 750,000 spam emails. No malware protection. That will have to change! A real challenge will then be seeing if appliance and household electronics makers will be willing to keep updates coming to those devices…otherwise, it's a moot point.
It happened with cameras….film has disappeared, and now the LATimes says Paramount has stopped releasing major movies on film. Other studios are expected to go digital only quickly, following their lead.
Microsoft CEO rumors continue to circulate, and recode.net notes that as a sidebar, look for none other than Bill Gates to take a more active role in the company, providing guidance and opening doors for the new CEO…who may be announced any time now. Is the (obviously Microsoft approved) move by HP to sell computers with Windows 7 instead of the latest version of 8 something Gates might have bought into to keep customers happy until Windows 9 is ready a little over a year from now?
Facebook Looks to Standalone Apps
After coming out with Facebook Messenger last year, the company is getting ready to release a suite of standalone mobile apps this year. Theverge.com reports. It hasn't been obvious, but Facebook Messenger hit number one at the App Store over the holidays, beating Instagram and Snapchat. A personalized newsfeed and calendar are thought to be part of the suite.
Recode.net says Twitter is just about ready to make in app payments available with startup Stripe. This could be particularly handy when a tweet pops up that tickets are on sale for a game or concert.
With Microsoft dropping support of Windows XP in just a matter of weeks, banks have started buying extended support agreements from them. Slashdot.org says this is because 95% of ATMs worldwide still use XP!
Learn Perfect Pitch With a Pill
A new study has found that an FDA approved drug called valproate can essentially retrain the brain, allowing adults with little or no musical training to acquire some degree of absolute…or perfect…pitch. This is the ability to pick out and sing and name a note with no reference point. CNET.com reports that the drug…which is normally used to treat epileptic seizures, migraines, and manic episodes…reopens the critical learning period, normally gone after young childhood, for absolute pitch. Researchers are now moving on to see if the drug will have a similar effect on learning other information and tasks. It's not quite a 'smart pill,' but appears to be a step in that direction. As an aside…most musicians would call this relative perfect pitch…actual perfect pitch seems not to be learned, one is born with it!
From Today's Tech Blogs:
In a market where Samsung and Apple are dominating, you'd think rolling out a line of smartphones might be crazy, but bgr.com reports that HP may be getting set to drop a new smartphone in a matter of days. They are shooting for the lower end of the market…under $250.
Twitter has launched a redesign of its web app, making it look more like its mobile apps for Android and iOS. Theverge.com says all the elements: connect, discover, and so on…stay the same. You will be able to add accent colors to your profile.
Microsoft with a phone that runs Android instead of Windows? That's apparently going to be the case. Before Nokia's mobile phone business was absorbed by Microsoft, the Finnish phone company was working on a small entry level phone called Normady internally. Bgr.com reports that some clear pictures have leaked out, and the phone is still being tested, and may launch this year. This little Android phone is reportedly what forced Redmond's hand, and pushed them into the deal with Nokia. Microsoft seems to be hedging their smartphone bets, looking to run duel tracks of Windows and Android phones moving forward.
Laser Bike Light
Riding a bike at night can be a hair raising experience, for both riders and drivers. Even with lights front and back, and reflectors, accidents and near misses happen far too often. Techcrunch.com has a report on an amazing bike light from startup Blaze. It is not only a very bright headlight, it produces a green laser projection of the bicycle up to 20 feet ahead of the cyclist's actual location, to give a heads up to drivers. Since almost 80% of bike accidents happen whild cyclists are biking straight ahead and a car turns into them, this could really be a boon. It's rechargeable, and available for preorder for $200.
Android & Apple Grow, and Intel Drops McAfee Name
Posted: January 7, 2014 | Author: clarkreid | Filed under: Uncategorized | Leave a comment
Android continues to grow at a brisk pace….thenextweb.com reports that the mobile system will be on over a billion active devices by the end of the year. 75% of users expected in emerging markets.
Meanwhile, don't feel bad for Apple…according to a Kantner market share report picked up by zdnet.com, the iPhone's market share has increased the last 3 months on the strength of overseas markets like China and Japan. iPhone share is down from 53% to 43% the last year in the US, however.
With all the antics the past year by John McAfee, this isn't too surprising, but Intel announced yesterday at CES that the name will be dropped in favor of Intel Security. CNET.com says they'll keep the iconic red shield, though.