摘要:
Systems and methods for solving a constraint satisfaction problem (CSP) defined by one or more variables, constraints and probabilistic requests (PRs) are provided. In one embodiment, each PR is mapped onto a set of constraints that implement the PR. The CSP solver then finds a series of solutions to the CSP. For each solution, if a constraint associated with a PR is satisfied, then a success counter for that PR is incremented; else a failure counter for that PR is incremented. If the constraint was not considered for the purpose of solving the CSP, then the failure counter for the PR associated with the constraint is incremented.
摘要:
A surgical head support to be used for positioning and holding a patient's head during a surgical procedure in the head area. The head support includes an arcuate support having two arcuate arms, each of the arcuate arms having a free end and provided with head engaging elements for gripping the patient's head. The head support further includes a base member provided with concave semispherical recess matching a central portion of the arcuate support. The base member includes two bases adapted to slide one on top of the other perpendicular to a longitudinal axis of the arcuate support. A connecting bolt connects the arcuate support and the base member so that two positions are possible: in the first position, relative motion between the arcuate support and the base member allows rearrangement of the arcuate support with respect to the base member while defining a hemispherical plane and relative motion between the bases is allowed; in the second position, the connecting bolt firmly secures the arcuate support to the base member.
摘要:
A computer-implemented method for modeling a target system includes defining a cloned constraint satisfaction problem (CSP) that characterizes the target system in terms of a set of variables and constraints applicable to the variables. The cloned CSP includes a non-predetermined number of duplicate sub-problems corresponding to instances of a repeating feature of the target system. The variables are partitioned so as to define an abstract CSP containing a subset of the variables relating to the duplicate sub-problems. The abstract CSP is solved to generate an abstract solution indicating the number of duplicate sub-problems to use in the cloned CSP. A concrete solution to the cloned CSP is found using the abstract solution.
摘要:
An apparatus is provided for constructing a segmented annular permanent magnet from a predetermined number of previously magnetized segments of predetermined shape and size comprising a rotateable carrousel, at least two of a plurality of removable ferromagnetic segments, an introducing means and a removing means.
摘要:
A method, apparatus and product for generating elements based on generation streams. The method comprises: obtaining one or more generation streams, wherein the streams comprise elements, wherein each element is a formal specification of an operation that stimulates a system, wherein based on each of the generation streams one or more alternative stimuli for the system can be generated, which stimuli comprises operations according to the elements; and generating a stimuli in accordance with the one or more generation streams, wherein the stimuli comprises at least one hybrid operation, wherein the hybrid operation complies simultaneously with two or more elements of the one or more generation stream, whereby the stimuli is comprised of a number of operations that is smaller than a sum of the numbers of elements of the one or more generation streams.
摘要:
Systems and methods for solving a constraint satisfaction problem (CSP) defined by one or more variables, constraints and probabilistic requests (PRs) are provided. In one embodiment, each PR is mapped onto a set of constraints that implement the PR. The CSP solver then finds a series of solutions to the CSP. For each solution, if a constraint associated with a PR is satisfied, then a success counter for that PR is incremented; else a failure counter for that PR is incremented. If the constraint was not considered for the purpose of solving the CSP, then the failure counter for the PR associated with the constraint is incremented.
摘要:
Magnetic apparatus for MRI/MRT probes and methods for construction thereof are disclosed. One embodiment includes a pair of opposed magnet assemblies defining an open region therebetween, a transmitting RF coil having at least a portion thereof disposed within the open region, at least one receiving RF coil disposed within the open region and X,Y and Z gradient coils. At least one of the X,Y and Z gradient coils is disposed outside of the open region. Another embodiment of the apparatus includes a single magnet assembly having a first surface and a second surface opposing the first surface, a transmitting RF coil having at least a portion thereof opposing the first surface, at least one receiving RF coil and X,Y and Z gradient coils. At least one of the X,Y and Z gradient coils opposes the second surface. In another embodiment the magnet assembly generates a permanent z-gradient magnetic field and therefore includes only X and Y gradient coils, at least one of which opposes the second surface. The apparatuses may also include one or more shim coils.
摘要:
A method, apparatus and product. The method comprising automatically determining an abstract CSP based on a formally defined problem having interconnected sub-problems, wherein the abstract CSP corresponds to the problem, wherein the abstract CSP has a reduced complexity in comparison to a CSP representing the problem, wherein the abstract CSP captures the interconnection between the sub-problems and reduces the details of each sub-problem, wherein the abstract CSP comprises constraints over variables, wherein each variable having an associated domain; and repeatedly: (1) propagating constraints of the abstract CSP to reduce domains of the abstract CSP; (2) selecting a sub-problem to solve; (3) solving the sub-problem; and (4) updating the abstract CSP with values in accordance with the solution of the sub-problem. Whereby, a solution to the formally defined problem is determined based on the solutions to the sub-problems.
摘要:
Systems and methods for solving a constraint satisfaction problem (CSP) defined by one or more variables, constraints and probabilistic requests (PRs) are provided. In one embodiment, each PR is mapped onto a set of constraints that implement the PR. The CSP solver then finds a series of solutions to the CSP. For each solution, if a constraint associated with a PR is satisfied, then a success counter for that PR is incremented; else a failure counter for that PR is incremented. If the constraint was not considered for the purpose of solving the CSP, then the failure counter for the PR associated with the constraint is incremented.
摘要:
A computer-implemented method for modeling a target system includes defining a cloned constraint satisfaction problem (CSP) that characterizes the target system in terms of a set of variables and constraints applicable to the variables. The cloned CSP includes a non-predetermined number of duplicate sub-problems corresponding to instances of a repeating feature of the target system. The variables are partitioned so as to define an abstract CSP containing a subset of the variables relating to the duplicate sub-problems. The abstract CSP is solved to generate an abstract solution indicating the number of duplicate sub-problems to use in the cloned CSP. A concrete solution to the cloned CSP is found using the abstract solution.