Abstract: This disclosure describes techniques for providing instructions when receiving biometric data associated with a user. For instance, a device may detect a portion of a user, such as a hand. The device may then display a first graphical element indicating a target location for placing the portion of the user above the user-recognition device. Additionally, the device may determine locations of the portion of the user above the device. The device may then display a second graphical element indicating the locations, such as when the locations are not proximate to the target location. Additionally, the device may display instructions for moving the portion of the user to the target location. Based on detecting that the location of the portion of the user is proximate to the target location, the device may send data representing the portion of the user to a remote system.

Abstract: A neural network is trained to process input data and generate a classification value that characterizes the input with respect to an ordered continuum of classes. For example, the input data may comprise an image and the classification value may be indicative of a quality of the image. The ordered continuum of classes may represent classes of quality of the image ranging from “worst”, “bad”, “normal”, “good”, to “best”. During training, loss values are determined using an ordered classification loss function. The ordered classification loss function maintains monotonicity in the loss values that corresponds to placement in the continuum. For example, the classification value for a “bad” image will be less than the classification value indicative of a “best” image. The classification value may be used for subsequent processing. For example, biometric input data may be required to have a minimum classification value for further processing.

Abstract: Actors may be detected and tracked within a scene using multiple imaging devices provided in a network that are aligned with fields of view that overlap at least in part. Processors operating on the imaging devices may evaluate the images using one or more classifiers to recognize body parts within the images, and to associate the body parts with a common actor within the scene. Each of the imaging devices may generate records of the positions of the body parts and provide such records to a central server, that may correlate body parts appearing within images captured by two or more of the imaging devices and generate a three-dimensional model of an actor based on positions of the body parts. Motion of the body parts may be tracked in subsequent images, and the model of the actor may be updated based on the motion.

Abstract: This disclosure describes techniques for identifying users that are enrolled for use of a user-recognition system and updating identification data of these users over time. To enroll in the user-recognition system, the user may initially scan his or her palm. The resulting image data may later be used when the user requests to be identified by the system by again scanning his or her palm. However, because the characteristics of user palms may change over the time, the user-recognition system may periodically perform processes for updating the identification data stored in association with the user in order to maintain or increase an accuracy of the user-recognition system.

Abstract: Techniques for an identity-verification system to analyze image data representing palms of users using a segmented, characteristic-based approach. The system may compare palm-feature data representing characteristics of a palm of a user (or “query palm”) with stored palm-feature data of palms for user profiles (or “stored palms”). For instance, the system may identify characteristics of the query palm having salient or discriminative features, and compare palm-feature data for those discriminative characteristics to palm-feature data representing corresponding characteristics of stored palms of enrolled users. Additionally, the system may compare characteristics of the query palm with corresponding characteristics of stored palms until the system is confident that the query palm corresponds to a stored palm of a user profile.

Abstract: This disclosure describes a user-recognition system that may perform one or more verification methods upon identifying a previous image that matches a current image of a palm of a user. For instance, the user-recognition system may perform the verification method(s) as part of the recognition method (e.g., after recognizing a matching image), in response to an audit process, in response to a request to re-analyze the image data (e.g., because a user indicates that he or she was not associated with a particular purchase or shopping session), and/or the like.

Abstract: Actors may be detected and tracked within a scene using multiple imaging devices provided in a network that are aligned with fields of view that overlap at least in part. Processors operating on the imaging devices may evaluate the images using one or more classifiers to recognize body parts within the images, and to associate the body parts with a common actor within the scene. Each of the imaging devices may generate records of the positions of the body parts and provide such records to a central server, that may correlate body parts appearing within images captured by two or more of the imaging devices and generate a three-dimensional model of an actor based on positions of the body parts. Motion of the body parts may be tracked in subsequent images, and the model of the actor may be updated based on the motion.

Abstract: This disclosure describes techniques for providing instructions when receiving biometric data associated with a user. For instance, a user-recognition device may detect a portion of a user, such as a hand. The user-recognition device may then display a first graphical element indicating a target location for placing the portion of the user above the user-recognition device. Additionally, the user-recognition device may determine locations of the portion of the user above the user-recognition device. The user-recognition device may then display a second graphical element indicating the locations, such as when the locations are not proximate to the target location. Additionally, the user-recognition device may display instructions for moving the portion of the user to the target location. Based on detecting that the location of the portion of the user is proximate to the target location, the user-recognition device may send data representing the portion of the user to a remote system.

Abstract: Described is a multiple-camera system and process for re-identifying a user located in a materials handling facility based on user patterns and/or descriptors representative of the user. In one implementation, a user pattern and/or a plurality of descriptors representative of a user are maintained as a position of a user is tracked through a materials handling facility. If the tracking of the user is lost, the last known position is stored with the user pattern and/or descriptors. If a new object is detected and confirmed to be a user, a user pattern and/or descriptors of the new object are compared with the stored user pattern and/or descriptors to determine if the new object is the user.

Abstract: A parallel-code optimization system includes a Procedural Concurrency Graph (PCG) generator. The PCG generator produces an initial PCG of a computer program including parallel code, and determines a refined PCG from the initial PCG by applying concurrency-type refinements and interference-type refinements to the initial PCG. The initial PCG and the refined PCG include nodes and edges connecting pairs of the nodes. The nodes represent defined procedures in the parallel code, and each edge represents a may-happen-in-parallel relation, and is associated with a set of lvalues that represents the immediate interference between the corresponding pair of nodes.

Abstract: The embodiments herein provide a method and system for presenting a sales pitch. The method comprises receiving information about a client from a plurality of sources, creating a client profile based on the received information about the client, training one or more sales personnel based on the client profile, generating one or more demonstrations of a sales pitch, wherein the one or more sales pitch is demonstrated by the sales personnel, posting the one or more generated demonstrations of the sales pitch to a server, verifying the one or more similar presentations having a favorable outcome and presenting the one or more posted presentations of the sales pitch by the sales personnel to the client, wherein the presentations are recorded in real-time, geo-stamped, and time-stamped.

Abstract: A parallel-code optimization system includes a siloed program reference-identifier and an intermediate representation (IR) updater. The siloed program reference identifier determines siloed program references in parallel code, wherein siloed program references are free of cross-thread interference. The IR updater modifies data-flow abstractions based on the identified siloed program references.

Abstract: There is provided a computer-implemented method of performing ownership acquire policy selection. The method includes compiling an atomic section to generate an instrumented executable. The instrumented executable is configured to generate a runtime abort graph describing a plurality of computer memory accesses made by the instrumented executable. The method also includes selecting each of a plurality of policies based on the runtime abort graph. The plurality of policies include a first policy and a second policy. The first policy is different from the second policy. The method further includes compiling the atomic section to generate a modified executable. The modified executable is configured to perform the computer memory accesses according to the selected policies.

Abstract: A parallel-code optimization system includes a Procedural Concurrency Graph (PCG) generator. The PCG generator produces an initial PCG of a computer program including parallel code, and determines a refined PCG from the initial PCG by applying concurrency-type refinements and interference-type refinements to the initial PCG. The initial PCG and the refined PCG include nodes and edges connecting pairs of the nodes. The nodes represent defined procedures in the parallel code, and each edge represents a may-happen-in-parallel relation, and is associated with a set of lvalues that represents the immediate interference between the corresponding pair of nodes.

Abstract: A parallel-code optimization system includes a siloed program reference-identifier and an intermediate representation (IR) updater. The siloed program reference identifier determines siloed program references in parallel code, wherein siloed program references are free of cross-thread interference. The IR updater modifies data-flow abstractions based on the identified siloed program references.

Abstract: Electronic design automation tool specifies an architecture at a system level and its component (which include intellectual property (IP) cores like embedded processors, arithmetic logic units (ALU), multipliers, dividers, embedded memory element, programmable logic cells, etc.); specifies IP-cores and their interface; and understands IP-cores and functions via their interface. Further, techniques are provided for modeling the timing behavior of a function or functional block without drawing a timing diagram; understanding the interface behavior of a function block which captures the timing waveforms; specifying virtual functions which are built using basic functional units and their timing behavior; parsing and creating an internal graphical form for analyzing a specification for compilation; matching the components in the architecture specification and their instantiation to map the computations in the input graph produced from an application; and mapping the specification onto the target's components.

Abstract: A method for inferring the shape and dimension of arrays for high-level, array-based languages such as MATLAB is presented. The method uses the algebraic properties that underlie MATLAB's shape semantics and infers the shape that the program expression assumes. In one embodiment, a shape-tuple of the result of a program expression is inferred by creating a shape-tuple expression comprising the shape-tuples of the operands and the shape-tuple operator.

Abstract: Digital circuit is synthesized from algorithm described in the MATLAB programming language. A MATLAB program is compiled into RTL-VHDL, which is synthesizable using system-specific tools to develop ASIC or FPGA configuration. Intermediate transformations and optimizations are performed to obtain highly optimized description in RTL-VHDL or RTL Verilog of given MATLAB program. Optimizations include levelization, scalarization, pipelining, type-shape analysis, memory optimizations, precision analysis and scheduling.

Abstract: An improved method and process for array shape inferencing for high-level array-based languages such as MATLAB and APL. The process is based on a framework that algebraically describes the shape of an expression at compile time. The method leverages on algebraic properties that underlie MATLAB's shape semantics and exactly captures the shape that the expression assumes at run time. Other highlights of this method are its generality and the uniformity of its approach. Compared with the traditional shadow variable scheme, the algebraic view permits powerful shape-related assertions and optimizations not possible in the conventional approach.

Abstract: Digital circuit is synthesized from algorithm described in the MATLAB programming language. A MATLAB program is compiled into RTL-VHDL, which is synthesizable using system-specific tools to develop ASIC or FPGA configuration. Intermediate transformations and optimizations are performed to obtain highly optimized description in RTL-VHDL or RTL Verilog of given MATLAB program. Optimizations include levelization, scalarization, pipelining, type-shape analysis, memory optimizations, precision analysis and scheduling.