Abstract: Radiation doses are optimized by providing a model of the set of beams and a target dose in normalized forms. A Gram matrix is determined from the model. The target dose is subsampled to determine initial intensity values for the set of beams. Then, the following steps are iterated until convergence. A very small positive value, 0<?<<1, is added to each intensity value to ensure the intensity value is greater than zero. Each intensity value is multiplied by the Gram matrix to determine a product, which is divided element-wise into the normalized target dose to determine corresponding ratios. If the ratios are all close to 1, within a numerical error tolerance, the intensity values of the set of beam are output. Otherwise, the intensity values are multiplied by the ratios before a next iteration.

Abstract: A method determines an optimal route to deliver a packet from a source node via relay nodes to a destination node in a network. A graph of nodes connected by edges represents possible routes in the network. A probability that the packet arrives at the destination before a deadline time is assigned to each edge. A minimal delay route is selected from the possible routes, and an arrival time for delivering the packet using the minimal delay route is determined. The arrival time is comparing to a deadline time, and the probabilities are scaled accordingly until the minimal delay route is an optimal route.

Abstract: A battery pack is provided for a mobile communication device, comprising a casing defining a cavity that conforms, at least partially, to the outer shape of the mobile communication device and one or more rechargeable power cells housed within the thickness of the casing. An internal interface engages a corresponding interface on the mobile communication device to provide power from the one or more rechargeable cells to the mobile communication device. An external interface is electrically coupled to the internal interface in order to transmit signals from the mobile communication device to an external device and may further serve to recharge the one or more rechargeable power cells. The battery pack may also serve as an extendible platform by providing additional integrated communication interfaces and/or processors that can be utilized by the mobile communication device to extend its communication and/or processing capabilities.

Abstract: A location and orientation in an environment is determined by first acquiring a real omni-directional image of an unknown skyline in the environment. A set of virtual omni-directional images of known skylines are synthesized from a 3D model of the environment, wherein each virtual omni-directional image is associated with a known location and orientation. The real omni-directional image with each virtual omni-directional images to determine a best matching virtual omni-directional image with the associated known location and orientation.

Abstract: A method routs a packet from a source node, via relay nodes, to a destination node. The nodes are connected by wireless links x. A channel power gain ? is measured for each link x. Resource trade-off curves y=f(x) are constructed for each link x from the channel power gains ?, wherein y represents a set of resources. A hyperbolic upper bound h/x+c is fitted to each resource curve, such that h/x+c?f(x), wherein h is a scale factor, and c is an offset. A route with an optimal resource allocation is selected according to the hyperbolic upper bounds. Then, the packet is transmitted from the source node to the destination node using the route.

Abstract: A method edits editing an input image to produce an output image by first partitioning pixels of the input image into sets of adjacent pixels. Then, for each set, a trellis of nodes connected by directed links is defined. Each node corresponds to one of the pixels in the set of pixels, and an action and location of the pixel in the output image. Costs are assigned to the nodes and the links. A least cost path through the trellis is determined, and pixels corresponding to the nodes on the least cost path are edited according to the action and location to form the output image.

Abstract: A method determines an optimal route to deliver a packet from a source node via relay nodes to a destination node in a network. A graph of nodes connected by edges represents possible routes in the network. A probability that the packet arrives at the destination before a deadline time is assigned to each edge. A minimal delay route is selected from the possible routes, and an arrival time for delivering the packet using the minimal delay route is determined. The arrival time is comparing to a deadline time, and the probabilities are scaled accordingly until the minimal delay route is an optimal route.

Abstract: A method routs a packet from a source node, via relay nodes, to a destination node. The nodes are connected by wireless links x. A channel power gain ? is measured for each link x. Resource trade-off curves y=ƒ(x) are constructed for each link x from the channel power gains ?, wherein y represents a set of resources. A hyperbolic upper bound h/x+c is fitted to each resource curve, such that h/x+c?ƒ(x), wherein h is a scale factor, and c is an offset. A route with an optimal resource allocation is selected according to the hyperbolic upper bounds. Then, the packet is transmitted from the source node to the destination node using the route.

Abstract: A method schedules cars of an elevator system. Each possible assignment of a set of hall calls to a set of cars is represented by a solution vector maintained as a node in a search tree. Each solution vector is evaluated using an ESA-DP process according to an immediate policy to determine initially a best solution. A branch-and-bound process is applied to each solution vector using the initial best solution and the search tree to determine a globally optimal solution for scheduling the cars according to a reassignment policy.

Abstract: A method schedules cars of an elevator system, the elevator system including a set of cars, and a set of hall calls. For each car, a waiting time is determined independently if the hall call is the only hall call assigned to the car. For each car, a mutual delay ?W(h|g) is determined for each possible pair of unassigned hall calls h and assigned hall calls g. The waiting time and mutual delays are summed. Then, the assignments are made to the set of cars so that the sum is a minimum.

Abstract: A particular model of a class of objects is selected from a set of models of the class, wherein the class models are graphs, each graph including a plurality of vertices representing objects in the class and edges connecting the vertices. Subsets of vertices of a selected set of graphs representing the class of objects are grouped to produce a subgraph. A set of anchor vertices is selected from the subgraph. Subgraph parameterizations are determined for the set of anchor vertices of the subgraph and the subgraph parameterizations are combined with the set of class models to identify a particular class model.

Abstract: A model of a class of objects is selected from a set of low-dimensional models of the class, wherein the models are graphs, each graph including a plurality of vertices representing objects in the class and edges connecting the vertices. First distances between a subset of high-dimensional samples of the objects in the class are measured. The first distances are combined with the set of low-dimensional models of the class to produce a subset of models constrained by the first distances and a particular model having vertices that are maximally dispersed is selected from the subset of models.

Abstract: A collaborative filtering method first converts a relational database to a graph of nodes connected by edges. The relational database includes consumer attributes, product attributes, and product ratings. Statistics of a Markov chain random walk on the graph are determined. Then, in response to a query state, states of the Markov chain are determined according to the statistics to make a recommendation.

Abstract: A method represents a class of objects. A set of samples for the objects in the class is acquired, there being one sample for each object, and each sample includes a plurality of data values representing characteristics of the object. The samples are grouped into subsets such that each subset intersects at least one other subset. For each subset, a low-dimensional parameterization is determined. Nullspaces of the low-dimensional parameterizations are averaged to obtain a matrix whose nullspace contains a low-dimensional representation of the class of objects.

Abstract: A method models a non-rigid three-dimensional object directly from a sequence of images. A shape of the object is represented as a matrix of 3D points, and a basis of possible deformations of the object is represented as a matrix of displacements of the 3D points. The matrices of 3D points and displacements forming a model of the object. Evidence for an optical flow is determined from image intensities in a local region near each 3D point. The evidence is factored into 3D rotation, translation, and deformation coefficients of the model to track the object in the video.

Abstract: A method constructs a variable multilinear model representing a class of deformable surfaces. First, meshes of deformable surfaces are acquired. The meshes include vertices. The meshes have different identities and different expressions. The meshes can be obtained from images of human faces, where facial features, such as eyes, eyebrows, cheeks, nose, mouth and chin, form the deformable surfaces. The meshes are stored in a memory as elements of a data tensor. The data tensor is selectively flattened to matrices composed of column vectors. An imputative incremental singular value decomposition is applied to each matrix to generate a set of orthogonal bases. Then, the orthogonal bases are applied to the data tensor, via tensor multiplication, to construct a core tensor, which is the variable multilinear model representing the class of surfaces.

Abstract: A method determines poses of a sensors distributed in an environment. A signal of the environment is acquired by each sensor. Features in each signal that correspond to the features in at least one other signal are identified. Directions between the sensors and the corresponding features are determined. Nullspaces of the directions are used to construct a matrix. A nullspace eigenvector is determined of the matrix, and then the nullspace eigenvector is reconfigured to a matrix specifying the locations of the sensors.

Abstract: A method recovers a 3D model of non-rigid 3D shape and motion of an object directly from an input video of the object by first identifying a set of features on the object in a reference image of the input video. Correspondences are then determined between the set of features in the reference image and corresponding features in each other image of the input video, These correspondences are factored by cascaded singular value decompositions into a motion matrix and a shape matrix. The 3D model can then be extracted from the factored motion matrix and shape matrix. The 3D model includes a linear basis for deformable shape of the object in the input video, and for each image a 3D rotations matrix, deformation coefficients, and translation vectors. A novel video can now be generated from the input video by manipulating the 3D model.

Abstract: A method constructs a super-resolution texture from a sequence of images of a non-rigid three-dimensional object. A shape of the object is represented as a matrix of vertices, and a basis of possible deformations of the object is represented as a matrix of displacements of the 3D points, the matrices of 3D points and displacements form a model of the object in the video. A set of correspondences between the points in model and the object in the images is formed. The points in each image are connected using the set of correspondences to form a triangle texture mesh for each image. Each triangle mesh is warped to a common coordinate system while super-sampling texture in each image. The warped and super-sampled triangle meshes are averaged to produce the super-sampled texture of the object in the image.