Abstract: Interview scheduling technologies are described. In one method, the interview-scheduling tool presents an interface to receive candidate availability information from a user for possible interview schedules for an interview candidate. The user interface permits the user to define an interview schedule framework that specifies desired criteria for a desired interview schedule for the interview candidate. The desired criteria of the interview schedule framework specify one or more interview sessions. The interview-scheduling tool receives the candidate availability information and the desired criteria and defines a data structure representing the interview schedule framework, wherein the data structure comprises a set of constraint satisfaction problems (CSPs). The interview-scheduling tool presents the interview schedule results that fit the desired interview schedule for selection by the user.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer-readable storage medium, including a method comprising: receiving a content item request from a resource, the resource associated with a resource sponsor; verifying the content item request including filtering out spam requests and determining if the content item request is valid; for any invalid requests, providing a content item in response to the content item request that is in conformance with an existing definition provided by the resource sponsor; and presenting information related to invalid requests to the resource sponsor in a user interface, the user interface including tools for enabling the resource sponsor to automatically accept and validate a content item request so that subsequent requests of the same type are validated upon receipt.

Abstract: A multi-threaded binary translation system performs atomic operations by a thread, such operations include processing a load linked instruction and a store conditional instruction. The store conditional instruction updates data stored in a shared memory address only when at least three conditions are satisfied. The conditions are: a copy of a load linked shared memory address of the load linked instruction is the same as the store conditional shared memory address, a reservation flag indicates that the thread has a valid reservation, and the copy of data stored by the load linked instruction is the same as data stored in the store conditional shared memory address.

Abstract: Techniques are provided for tracking and analyzing defect density by source file or module. Defect density is the number of distinct defects which required changes to be made (to fix the defect) to a particular file or module in a given period of time. This metric is very useful for identifying the most critical areas of weakness of the system and hence the areas where additional investment/action may be taken. For example, this metric can be used to prioritize the area in which unit tests should be written, for which additional automated system tests should be written or which a project should be undertaken to re-write the error prone file or module to improve its quality and maintainability.

Abstract: A multi-threaded binary translation system performs atomic operations by a thread, such operations include processing a load linked instruction and a store conditional instruction. The store conditional instruction updates data stored in a shared memory address only when at least three conditions are satisfied. The conditions are: a copy of a load linked shared memory address of the load linked instruction is the same as the store conditional shared memory address, a reservation flag indicates that the thread has a valid reservation, and the copy of data stored by the load linked instruction is the same as data stored in the store conditional shared memory address.

Abstract: The various embodiments herein provide a system and method for identifying, analyzing and integrating the risks associated with a source code. The system comprises a code coverage module for collecting and transforming the code coverage information by a file name, a source code analyzer module for collecting and transforming source code violations information by the file name, a software configuration management module for collecting and transforming the source code commit information by the file name, a risk analyzer processing module for receiving and relating the collected code coverage information, source code violations information and source code commit information with each other by the file name and a report generation module for publishing the processed result of the collected code coverage information, source code violations information and source code commit information in a report. The report is reviewed for identifying, analyzing and integrating risks associated with source code.

Abstract: A functional simulator with watchpoint support includes a CPU having a first-level DMI cache, a watchpoint manager having a second-level DMI cache, an interconnect module, and a memory controller. The simulator is operated by a front-end tool. Watchpoints corresponding to a predetermined memory addresses are set by the front-end tool and stored as a watchpoint address list in the watchpoint manager. When a memory access request is received by the first-level DMI cache, after a failure to complete the memory access request, the CPU transmits the request to the watchpoint manager. The watchpoint manager searches for a memory address associated with the memory access request in the watchpoint address list. If a match is found, the watchpoint manager generates a watchpoint hit signal and notifies the front-end tool.

Abstract: The various embodiments herein provide a method and system for synchronization of links and attachments during synchronization between source and target devices. The system for executing synchronization between the source and target devices comprises a connector framework, a process framework, a mapping manager, a recovery manager, a conflict manager and a failure manager. The method comprises getting the “as of state” of the attachment that is old and new attachment information list for the revisions, then the system having history for the attachment constructs “as of state” and send as part of the event and system not having history for the attachment, stores attachment information in the history state table with the source update time information in poller as well as the time of adding attachment from the adapter.

Abstract: A computer implemented system and method for synchronizing a plurality of changes from a source computing device to a destination computing device, have been disclosed. The method involves, determining an initial polling time and a last polled time, checking for an elapse of a preset polling interval from a maximum poll time, polling a source for fetching data after an elapse of a polling interval from the maximum poll time, selecting a plurality of changes from the source computing device, processing the fetched data, writing the processed data at a destination computing device and reporting a status of a synchronization process.

Abstract: Provided herein is a composition and a method for treating nucleic acid-related eye disease.

Abstract: Interview scheduling technologies are described. In one method, the interview-scheduling tool presents an interface to receive candidate availability information from a user for possible interview schedules for an interview candidate. The user interface permits the user to define an interview schedule framework that specifies desired criteria for a desired interview schedule for the interview candidate. The desired criteria of the interview schedule framework specify one or more interview sessions. The interview-scheduling tool receives the candidate availability information and the desired criteria and defines a data structure representing the interview schedule framework, wherein the data structure comprises a set of constraint satisfaction problems (CSPs). The interview-scheduling tool presents the interview schedule results that fit the desired interview schedule for selection by the user.

Abstract: Interview scheduling technologies are described. In one method of scheduling an interview with a candidate, the method receives scheduling information including constraint and parameter information for scheduling the interview with the candidate and receives candidate information including candidate availability. The method determines, by a computer system, at least one optimized interview schedule matching the constraint information, the parameter information, and the candidate availability, the at least one optimized interview schedule including at least one interview slot and at least one interviewer associated with the at least one interview slot. The method provides the at least one optimized interview schedule to a user.

Abstract: The various embodiments herein provide a method for merging results from multiple runs based on run inputs in a source system. The method comprises performing a first run on a first input to receive a first result, performing a second run on a second input to receive a second result, aggregating the first result and second result based on a set of rules and a plurality of merge scenarios to obtain a final result. A method is also provided for merging cobertura coverage and a source code.

Abstract: The embodiments herein provide a system and method for synchronization of data and recovery of failures during synchronization between two systems. The system for executing synchronization between the source and target systems comprises a connector framework, a process framework, a mapping manager, a recovery manager, a conflict manager and a failure manager. A method for bidirectional data synchronizing and integrating involves keeping information about integration user in integration database for each entity and update along with update time and audit id, only when the system does not keep information about the created and updated entity. A method of synchronizing only the entities qualifying a criterion, a method for failure recovery from a correct point during integration process, a method for handling recovery for changes coming from multiple end points and a method for recovery during server shutdown are also provided.

Abstract: Techniques are provided for capturing the ID of a work item, and the corresponding effort level information, as a part of the actual check-in process of the artifacts into the underlying change management system. This effort information can then be propagated to an external system for subsequent reporting and analysis. In one embodiment, tasks (or similar items such as issues or bugs) are entered into a common task or issue tracking system. As part of this process each task is assigned a unique identifier. A “call-out” is added to the source control management system which captures the effort level and task ID associated with the proposed change. The data entered is validated to ensure that the task ID is valid and that the effort entered is within a valid range. If the data entered is valid, the change to the underlying artifact is allowed to proceed and the effort and task information is stored for later analysis.

Abstract: A set of tools and other mechanisms automatically enforce software development change policies by providing a way to map physical source control system codelines to projects and by providing a way to maintain current project and codeline state information. The set of tools and other mechanisms also provide ways to define change management rules and policies, as well as, ways to evaluate and allow or deny each proposed change against the defined change policy.

Abstract: This invention relates to a natural oil based poly-urethane dispersion of water-based anionic polyurethane/urea polymer of high molecular weight by forming a water dispersible NCO-terminated polyurethane pre-polymer, consisting essentially of the reaction product of a polyol component and a polyisocyanate component, at a reduced temperature, which is then dispersed in solvent-free water after applying a neutralizing agent, and then reacted with a chain extender. The polyol component used in this invention comprises of a mixture of (a) ricinoleated natural ester based mono blocked polyol; and (c) carboxylic group-containing polyols. The polyisocyanate component used is an aromatic diisocyanate such as an isomer of toluene diicocyanate and/or methylene diphenyl diisocyanate. The dispersion produced as a result of the process described herein is biodegradable in nature and non-plastic. The dispersion is also free of volatile organic chemicals and/or leachable contaminants.

Abstract: The invention provides a transcorneal vision assistance device implantable in the eye of a patient. A preferred embodiment transcorneal microtelescope vision assistance device is implantable in the eye of a patient and includes a keratoprosthesis configured to replace a portion of the cornea of a patient and to secure the keratoprosthesis to a remaining front portion of the cornea. A microtelescope is carried by the keratoprosthesis for transcorneal mounting of the microtelescope.

Abstract: Scan chains are used to detect faults in integrated circuits but with the size of today's circuits, it is difficult to detect and locate scan chain faults, especially when the scan data in and scan data out have been compressed. A method for debugging scan chains includes selecting a scan chain for debugging using a scan chain selection block and then providing scan test vectors to the selected scan chain. The scan test vectors undergo various scan test stages to generate scan response vectors. The scan response vectors are compared with ideal response vectors to identify a failing scan chain.

Abstract: The embodiments herein provide a method and system for polling and processing data. The method comprises computing a maximum time from a source after a last update time, waiting for a preset time to ensure that all transactions with respect to a change in a data is completed, querying for a plurality of changes after an elapse of the preset waiting time since the last update time and up to the maximum time, generating a time window, collecting a list of changes occurred within the generated time window, sending the collected list of changes for processing; and updating the processed data at the destination. The time window comprises a time interval between the last update time and the maximum time.