Create and release your Profile on Zintellect – Postdoctoral applicants must create an account and complete a profile in the on-line application system. Please note: your resume/CV may not exceed 2 pages.
Complete your application – Enter the rest of the information required for the IC Postdoc Program Research Opportunity. The application itself contains detailed instructions for each one of these components: availability, citizenship, transcripts, dissertation abstract, publication and presentation plan, and information about your Research Advisor co-applicant.
Research Topic Description, including Problem Statement:
A regular expression (see Wikipedia), or REGEX, refers to a sequence of characters that defines a search pattern for use in a string searching algorithm. The complexity of regular expression matching was recently shown to depend on the expression’s depth2.
Suppose S is a large collection of text strings. In practice, elements of S will either be presented in a stream, or else will be accessible through Map Reduce operations.
There are n players, and player j creates a list Q(j, 1), Q(j, 2), …, Q(j, r) of REGEX queries against S. Each collection T of strings in S has a value V(T, j) to player j; this function make be taken as submodular, or not. Moreover query Q(j, k) has execution cost C(j, k).
The players do not collude, and the set of strings returned by Q(j, i) may have non-empty intersection with the set of strings returned by Q(j’, i’) for j different to j’.
As a metaphor, introduce a broker, whose task is to inspect the union of all the queries {Q(j,k), 1≤j≤n, k≥1} and to devise a new set B of REGEX queries, of approximately least cost, which collectively returns all (or perhaps nearly all) of the union, over j and k, of the set of strings in S returned by Q(j,k).
The broker’s profit consists in the sum of fees paid by each player for the fulfilment of their queries, less the cost of executing his own set B of queries. His algorithm aims to maximize this profit. Profit is here a metaphor for cost savings achieved by multi-query search optimization.
Consider strings as vertices in a hypergraph, and a query as a hyperedge (i.e. the set of strings returned by the query), whose weight is determined by the query cost. Then a set of queries is a hyperedge-weighted hypergraph.
If the broker does not construct new queries, but merely selects a least costly subset of queries supplied by all the players, then the problem above is an instance of the NP-complete problem called set cover (see Wikipedia). This means: find a lowest weight subset of hyperedges whose union is all the strings sought by all players. There are approximation algorithms for set cover3.
The broker is not restricted to finding a set cover consisting of a subset of the queries supplied by the players. He may construct new queries, which may be less costly to execute in total. Hence this problem is more general than set cover.
2 Arturs Backurs and Pitr Indyk, Which regular expressions are hard to match?, ArXiv:1511:07070, 26 September 2016
3 David P. Williamson, David B. Shmoys, The Design of Approximation Algorithms, Cambridge, 2011.
Example Approaches:
The ORISE GO mobile app helps you stay engaged, connected and informed during your ORISE experience – from application, to offer, through your appointment and even as an ORISE alum!
You gave a rating of 0 star(s)
SECURITY/PRIVACY NOTICE
By continuing to use this system you indicate your awareness of and consent to the following terms and conditions of use. LOGOUT IMMEDIATELY if you do not agree to the conditions stated in this warning.
SECURITY NOTICE
This system is part of a Federal information system. This system is monitored for security purposes to ensure it remains available to all users and to protect information in the system. The system employs software programs to monitor network traffic to identify unauthorized activities. By accessing this system, you are expressly consenting to these monitoring activities. Unauthorized attempts to defeat or circumvent security features; to use the system for other than intended purposes; to deny service to authorized users; to access, obtain, alter, damage, or destroy information; to upload or change information; to otherwise cause system or information damage; or otherwise to interfere with the system or its operation, is prohibited. Evidence of such acts may be dis-closed to law enforcement authorities and result in prosecution under the Computer Fraud and Abuse Act of 1986 and the National Information Infrastructure Protection Act of 1996, or other applicable laws.
PRIVACY NOTICE
This system is for authorized use only. Use of this system constitutes consent to security monitoring and testing. All activity is logged with your host name and IP address. Users (authorized or unauthorized) have no explicit or implicit expectation of privacy. Any or all uses of this system and all files on this system may be intercepted, monitored, recorded, copied, audited, inspected, and dis-closed to authorized site and law enforcement personnel, as well as authorized officials of other agencies, both domestic and foreign. By using this system, the user consents to such interception, monitoring, recording, copying, auditing, inspection, and disclosure at the discretion of authorized site or law enforcement personnel. Unauthorized or improper use of this system may result in administrative disciplinary action and civil and criminal penalties.
You have been inactive on this page for . You will be logged out after 03:00:00.
Select an icon below to visit the website and download an appropriate browser.
For help, please email Zintellect@orau.org.
Question: What is the deadline for submitting an application?
Answer: Not all opportunities have application deadlines. Some opportunities remain open until they are filled. If an opportunity has an application deadline, then it will be listed in the opportunity details or in the opportunity catalog.
Question: How do I reset my password?
Answer: If you have forgotten your password or wish to reset your password, use the "Forgot password or username?" tab on the login to reset it.
Question: I forgot my username. How do I retrieve it?
Answer: Use the "Forgot password or username?" tab on the login. You will receive an email containing your username.
Question: What do I need to submit an application?
Answer: Typically, applicants are required to submit a resume or CV, an official copy of their transcripts or academic record, and a minimum of two references at the time they apply. Additional requirements such as a writing sample, thesis or dissertation, etc. may be required. Review the opportunity details for additional information about the requirements for applying for an opportunity.
Question: Where do I upload my transcripts?
Answer: If required, you will be asked to upload your transcript as a part of the application process.
Question: Where do I submit a writing sample?
Answer: If required, you will be asked to upload a writing sample as part of the application process.
Question: Can a family member serve as a reference?
Answer: No; family members may not serve as references. References must be able to speak to your educational and/or professional experience. At least one academic reference is preferred.
Our Zintellect A.I. is constantly learning how to Match you to our opportunities! So, we want to know when we get it right or when we get it wrong. This will help us make our better! Plus, as a potential applicant to one of our many opportunities across the country, we value you and want to help you on your career path!