Abstract: A computer-implemented method for mapping a texture on one or more points in a 3D scene. The one or more points in the 3D scene are obtained from a user-input with an input device. The method includes determining, from the user-input performed with the input device, the one or more points in the 3D scene to be textured. The method includes computing a 3D support comprising the determined one or more points to be textured. The method includes computing a texture based on the determined one or more points. The method includes rendering the computed texture on the computed 3D support. The method forms an improved solution for rendering a 3D scene.

Abstract: A method for projecting onto a real workpiece an image calculated on the basis of a digital mockup recorded on a digital information server associated with the real workpiece, for the viewing of the workpiece under augmented reality, comprises the following steps: capture by a camera of the image of the real workpiece, real-time alignment of the reference frame associated with the digital mockup with the reference frame of the video capture system and the reference frame of the real workpiece, comprising a step of reprocessing of the image calculated as a function of the topology of the digital mockup and as a function of the orientation of the projection means with respect to the real workpiece.

Abstract: A computer-implemented method for automatically positioning an input 3D object representing a real object in an input 3D scene representing a room. The method includes obtaining a dataset having information about objects of a plurality of rooms. The method includes executing computer program instructions that cause attempting to identify first, second and/or third pairs. The method includes outputting one or more pairs among the set consisting of each identified pair and the counts of the one or more identified pairs. The method includes, for each outputted pair, determining a respective position of the input 3D object in the input 3D scene. The method includes positioning the input 3D object according to the respective position determined for one of the one or more outputted pairs. The method improves the positioning of an input 3D object in an input 3D scene.

Abstract: A three dimensional user interface feature which defines an spatial envelope with respect to a feature of a three dimensional object in a virtual space, the size of the envelope depending on the speed of motion of an element moved by a user in a virtual space such as a cursor, for example using a conventional “drag” operation or the like. If the envelope is determined to encompass a feature of the mobile element in the space, the mobile element is brought into alignment with the three dimensional element. The size of the envelope may additionally be determined as a function of other factors such as the density of elements in the environment, system processing capacity, the size of the other elements, and the like.

Abstract: A computer-implemented method for segmenting a discrete 3D model representing a mechanical part. The method includes obtaining the discrete 3D model, and applying a hierarchical segmentation to the discrete 3D model. The hierarchical segmentation comprises a first segmentation which comprises identifying, among elements of the discrete 3D model, first segments. Each of the first segments corresponds to a primitive exhibiting at least one slippable motion. The hierarchical segmentation then comprises a second segmentation which comprises identifying, among non-identified elements of the discrete 3D model, second segments. Each of the second segments corresponds to a surface produced by a CAD feature. The hierarchical segmentation then comprises a third segmentation which comprises identifying, among non-identified elements of the discrete 3D model, third segments. Each of the third segments corresponds to a free-form surface of the discrete 3D model.

Abstract: A method of segmentation of a medical image of a human brain including obtaining a voxelized 3D medical image of the human brain, computing at least two surface models of the human brain using a BET method, each surface model being computed for a unique fractional constant bt. For each computed surface model, determining a volume included in the computed surface model, thereby obtaining a set of sample pairs, fitting a curve to the sample pairs of the set, determining an inflection point of the curve, identifying a fractional constant bt corresponding to the determined inflection point, and computing the surface model of the human brain using the BET method that is dependent of bt.

Abstract: A computer-implemented method for CAD volume draft operator detection in a discrete 3D model representing a mechanical part. The method includes obtaining a segmentation of the discrete 3D model, iteratively grouping segments of the segmentation, and determining one or more CAD volume draft operators, each CAD volume draft operator corresponding to a respective group. Two segments of a pair of segments are grouped if: each segment of the pair is a drafted surface and both segments have a same respective drafting axis, and both segments have a same respective draft angle relative to the respective drafting axis, or at least one segment has a zero angle relative to the respective drafting axis; or one segment of the pair is a drafted surface and the other segment is a closing plane.

Abstract: A computer-implemented method for calibration of a Boolean network. The Boolean network has Boolean functions. The Boolean network models a biological process. The method comprises providing the Boolean network. The method further includes obtaining experimental data related to the biological process. The method further includes calibrating the Boolean network according to the experimental data. The calibration includes converting the Boolean functions into Zhegalkin polynomials. The calibration further includes building, based on the Zhegalkin polynomials, on the Boolean network, and on the experimental data, a calibration Boolean proposition. The calibration Boolean proposition represents a transition system of the Boolean network and the experimental data. The calibration further includes applying a SAT solver to the calibration Boolean proposition.

Abstract: A computer-implemented method for segmenting an object in at least one image acquired by a camera including computing an edge probabilities image based on the image, said edge probabilities image comprising, for each pixel of the image, the probability that said pixel is an edge, computing a segmentation probabilities image based on the image (IM), said segmentation probabilities image comprising, for each pixel of the image (IM), the probability that said pixel belongs to the object (OBJ), and computing a binary mask of the object based on the edge probabilities image and based on the segmentation probabilities image.

Abstract: A computer implemented method for improving search engine queries including receiving a text corpus, determining a list of n-gram candidates, each being a series of consecutive words of said text corpus, the number of said consecutive words within said series being an integer n superior or equal to two, modifying at least partially said text corpus based on said list of n-gram candidates, performing a machine learning embedding on the resulting text corpus, for each element in said list of n-gram candidates, computing a score based on the embedding of said element and the embeddings of the words making up said element, adding one or more of the n-gram candidates to a search engine queries items list based on their respective scores.

Abstract: Disclosed are techniques for scalar solvers in flow simulations that include simulating using a scalar lattice velocity set in a computing system, movement of scalar particles representing a scalar quantity in a volume of fluid, with the scalar particles carried by flow particles of the volume of fluid, and with the movement of the scalar particles causing collisions among the scalar particles; and evaluating, a non-equilibrium post-collide scalar distribution function of a specified order that is representative of the scalar collision.

Abstract: A computer-implemented method of automatically determining an optimized design for manufacturing a real-world object includes: defining, in memory of a computer-based processor, a finite element model representing a real-world object, the finite element comprising a plurality of elements; evaluating, with the computer-based processor, a distribution of a design variable throughout a vicinity of the finite element model, using singular value decomposition (SVD), to produce a singular value for the design variable in each respective element in the vicinity of the finite element model; defining optimization constraints for the vicinity of the finite element model based on the singular values produced from the SVD; and optimizing the finite element model with respect to the design variable by locally enforcing a geometry of the real-world object in the vicinity based on the defined optimization constraints.

Abstract: A computer implemented method for consolidating at least one key indicator of a virtual object receiving a description of at least one key indicator of the virtual object, receiving a set of attributes (ATT) of the virtual object, receiving a data model (DM) for indexation of said virtual object, receiving a set of rules (RUL) to convert the attributes of the virtual object (OBJ) into the data model (DM) for indexation, applying the set of rules (RUL) to convert said attributes into the data model (DM) for indexation, transforming the data model (DM) for indexation into a directed acyclic graph, and consolidating said key indicator based on an expansion of the directed acyclic graph.

Abstract: A computer implemented method for consolidating at least one key indicator of a virtual object including, for a predefined configuration of the virtual object (OBJ), receiving a description of at least one key indicator of the virtual object, receiving a set of attributes of the virtual object, receiving a data model for indexation of said virtual object, receiving a set of rules to convert the attributes of the virtual object into the data model for indexation, applying the set of rules to convert said attributes into the data model for indexation, transforming, in an index, the data model for indexation into a directed acyclic graph, and consolidating, in a software component which is distinct from said index, said key indicator based on an expansion of the directed acyclic graph.

Abstract: A computer-implemented method for designing a manufacturing product having one or more mechanical functionalities. The method includes obtaining a first instance of a CAD model and a mesh representing a target boundary shape of the manufacturing product and determining a second instance of the CAD model. The CAD model includes a feature tree having a plurality of continuous CAD parameters, and a set of one or more parameterization constraints which specifies the one or more mechanical functionalities. The first instance includes a first value and the second instance includes a second value for each continuous CAD parameter, respectively. The determining of the second instance consists of computing the second values by modifying at least part of the first values to minimize a shape dissimilarity metric between a boundary shape represented by the first instance of the CAD model and the target boundary shape.

Abstract: Methods and systems to detect and resolve failure in a distributed database system is described herein. A first node in the distributed database system can detect an interruption in communication with at least one other node in the distributed database system. This indicates a network failure. In response to detection of this failure, the first node starts a failure resolution protocol. This invokes coordinated broadcasts of respective lists of suspicious nodes among neighbor nodes. Each node compares its own list of suspicious nodes with its neighbors' lists of suspicious nodes to determine which nodes are still directly connected to each other. Each node determines the largest group of these directly connected nodes and whether or not it is in that group. If a node isn't in that group, it fails itself to resolve the network failure.

Abstract: A distributed database processing system for a database composed of data records organized into tables which processes unique index atoms consistently and concurrently. Each attempt to insert a new key value into such a unique index atom in any given node is routed to a unique index atom chairman for processing. The chairman determines whether the request will be granted. If the request is not granted, the requesting unique index atom continues to try to submit the insert. If the request is granted, the requesting unique index atom modifies the content thereof and broadcasts a replicated given unique index atom all other nodes that contain the replicated unique index atom.

Abstract: A computer implemented method for comparing unsupervised embedding methods for a similarity based industrial component model requesting system including obtaining a text corpus relating to industrial component models and a list of testing words, modifying by altering some of the occurrences of each testing word, the modified text corpus containing, for each testing word, occurrences of a first version of each testing word, and occurrences of a second version of each testing word, running an unsupervised embedding method on the modified text corpus and obtaining vector representations, determining a scoring value, by comparing, for at least some of the testing words, the vector representations of the first version of these testing words, and the vector representations the second version of these testing words, running the obtaining, modifying with the text corpus and the list of testing words with another unsupervised embedding method and returning the respective scoring values.

Abstract: A filter design method isolates parasitic zeros in a modelled response by comparison with a representation of a target response, and computes an adjusted representation of the target response corresponding to an implementation of the adjusted target polynomial representation according to a desired filter type and incorporating the parasitic zeros thus isolated. The Parasitic zeros are then removed from this adjusted target polynomial representation, and also from the polynomial representation of the modelled response, and the two resulting representations used as the basis of an error function. This error function may then drive an iterative convergence minimising the error function, for example based on a stepwise convergence of parameters such as dimension values in a three dimensional model implementing each representation.

Abstract: A method for locating a center of rotation of an articulated joint connecting two bones or set of bones of an upper or lower limb of a user, including performing a series of repetitive movements of sweeping one of the bones or set of bones around the joint, and simultaneously acquiring 3D positions of the bone or set of bones during said series, thereby obtaining a 3D cloud of points, computing a point referred to as center point, said center point being a searching point of the 3D searching space for which the standard deviation is the lowest considering the set of distances between the searching point and each point of the 3D cloud of points, transforming the 3D cloud of points into a plane, projecting the center point on said plane, thereby obtaining the center of rotation of the joint.