Abstract: The disclosure involves wireless electric power sharing between vehicles. A first vehicle sends a charging request, wherein the first vehicle is at least partially powered by a first on-board rechargeable electricity storage. The first vehicle receives a response to the charging request from a second vehicle which is at least partially powered by a second on-board rechargeable electricity storage, and a communication channel is established between the first and second vehicles. The first on-board rechargeable electricity storage is charged using energy stored in the second on-board rechargeable electricity storage and wirelessly transferred from the second vehicle to the first vehicle. The charging is controlled with information exchanged between the first and second vehicles over the communication channel.

Abstract: Automated devices send messages of a first batch sequence individually to a target queue of a receiving node of a cluster of server nodes, the messages having a different sequence number indicative of their relative positions within the batch sequence, and each is associated with a first logic unit of work identifier. In response to determining that a message counter meets a threshold, a force commit packet is generated to include the sequence number of the last batch message sent to the target queue. If the force commit packet sequence number is not the last position number within the batch sequence, a second logic unit of work identifier is associated with a subset sequence of the batch of messages having sequence numbers spanning from the first number to the force commit packet sequence number, and the subset sequence messages are committed to the receiving node target queue.

Abstract: Automated devices send messages of a first batch sequence individually to a target queue of a receiving node of a cluster of server nodes, the messages having a different sequence number indicative of their relative positions within the batch sequence, and each is associated with a first logic unit of work identifier. In response to determining that a message counter meets a threshold, a force commit packet is generated to include the sequence number of the last batch message sent to the target queue. If the force commit packet sequence number is not the last position number within the batch sequence, a second logic unit of work identifier is associated with a subset sequence of the batch of messages having sequence numbers spanning from the first number to the force commit packet sequence number, and the subset sequence messages are committed to the receiving node target queue.

Abstract: A computer-implemented method includes detecting a first user is editing a first version of a content piece. A first feature set value is determined, describing a first set of values of one or more features of the first version. Based on the first feature set value, a first maturity score of the first version is determined, using a mapping. It is detected that a second user is editing a second version of the content piece in parallel with the first user editing the first version. A second feature set value is determined, describing a second set of values of the one or more features of the second version of the content piece. Based on the second feature set value, a second maturity score of the second version is determined, using the mapping. It is detected that the second maturity score meets a maturity threshold. Thus, a remedial action is performed.

Abstract: Systems and methods of the present disclosure provide a way to pinpoint where a target device associated with an IP address is physically located within a geographical region. Network-communication delays between landmark devices and the target device are determined and used to generate sequences capturing relative delay relationships between the landmark devices and the target device. The sequences are used to determine a ranking via a sequence-matching approach. For each pair of landmark devices, a geographical boundary that divides the geographical region into a target partition and a second partition is determined. The target partition includes a first landmark device of the pair and the second partition includes a second landmark device of the pair. The target device is located where the target partitions for the pairs overlap. Network tomography can be applied to increase accuracy.

Abstract: Provided are systems, methods, and media for concurrency conflict testing for shared resources. An example method includes identifying shared resources that are to be accessed by an application. Generating a plurality of concurrency test scenarios based on the shared resources. Analyzing a plurality of concurrency test cases to detect which concurrency test cases include a reference to the shared resources. Executing a concurrency test scenario.

Abstract: An example operation may include one or more of generating an initial seed and allocating one or more authorized bits of the initial seed to a plurality of blocks in a distributed ledger, storing the initial seed and an identification of which authorized bits of the initial seed are allocated to each block of the distributed ledger, receiving a final seed value that is partially generated by each of a plurality of nodes configured to access the distributed ledger based on authorized bits of respective blocks updated by each respective node, and generating a random sequence value based on the final seed value and storing the random sequence value in a block of the distributed ledger.

Abstract: In one embodiment, a method includes: obtaining location information and motion information of a wireless communication apparatus, and a data set from one or more information sources external to the wireless communication apparatus; and organizing data of the data set for display, where the organizing is based on the location and motion information of the wireless communication apparatus. Methods of other embodiments may also include defining a search radius based on the location information and motion information of the wireless communication apparatus, and the organizing may also include filtering the data set from the one or more information sources to exclude data from information sources outside the defined search radius.

Abstract: Systems and methods of the present disclosure provide a way to pinpoint where a target device associated with an IP address is physically located within a geographical region. Network-communication delays between landmark devices and the target device are determined and used to generate sequences capturing relative delay relationships between the landmark devices and the target device. The sequences are used to determine a ranking via a sequence-matching approach. For each pair of landmark devices, a geographical boundary that divides the geographical region into a target partition and a second partition is determined. The target partition includes a first landmark device of the pair and the second partition includes a second landmark device of the pair. The target device is located where the target partitions for the pairs overlap. Network tomography can be applied to increase accuracy.

Abstract: A system, method and computer program product to refine an original complex CFG into a simpler CFG showing interesting paths and reducing interfering paths with dynamic input for the state of program. The method receives/encodes dynamic user input in the form of annotations which encodes user's special interests or knowledge of the program at run time, e.g., some assumptions of any variables appeared, which can be equations of variable and value or relationships between variables. The method then simplifies all the branching points in a generated AST (Abstract Syntax Tree) whenever possible by querying a SMT (Satisfiability Modulo Theories) solver with branching condition and the user annotations and by evaluating immediate values of expressions or eliminate unreachable parts in the CFG. Finally, the method generates a simplified CFG by simplified AST. This can assist a programmer to understand the code and facilitates correlating different basic blocks under a same scenario.

Abstract: The present invention belongs to the information processing field and discloses a method and apparatus for associating information. The method for associating information comprises: obtaining identification information of a first content; associating the identification information of the first content with a second content, wherein the second content is created for the first content; obtaining identification information of a third content, wherein the third content is an updated version of the first content, the third content containing revision made according to the second content; and associating the identification information of the third content with the second content. With the method and system for associating information as provided by the present invention, contents of a plurality of versions can be managed and traced efficiently without a need to modify the existing code review flow.

Abstract: An approach is provided that receives, from a radio frequency identification (RFID) tag included with a device, at least three different charge times. Each of the charge times corresponds to a different RFID reader that separately charges the RFID tag with each of the RFID readers being at a different geographic location. A distance between each of the RFID readers and the RFID tag is approximated based on the respective charge times and these approximate distances are used to identify a geographic position of the RFID tag using trilateration. The geographic position of the RFID tag is then used to determine whether to allow the device wireless access to a computer network.

Abstract: A computer-implemented method according to one embodiment includes identifying a mobile detection device, requesting the mobile detection device to travel to a predetermined location, requesting the mobile detection device to retrieve location information and supplementary information from a radio frequency identification (RFID) tag at the predetermined location, receiving the location information and the supplementary information from the mobile detection device, determining a three-dimensional location of the RFID tag, based on the location information, and creating a three-dimensional map that includes the three-dimensional location of the RFID tag and the supplementary information from the RFID tag.

Abstract: Disclosed embodiments provide techniques for intelligent media sharing with visualized positioning layout in real time. A floor plan is retrieved corresponding to the physical location of a sender electronic device. A zone boundary corresponding to the physical location of the sender electronic device is determined. A list of potential recipient electronic devices within the zone boundary is generated. A floor plan view is rendered on the sender electronic device. A graphical representation of the potential recipient electronic devices on the floor plan view is rendered, overlaid in a semi-transparent manner with a media selection interface on the sender electronic device. A selection is received for one or more media items using the media selection interface. A send request is received for one or more potential recipients, resulting in sending the one or more media items to at least one potential recipient in response to receiving a user interface request action.

Abstract: A method for indexing with redundant information. The method may identify unknown code points for a document in response to an indexing request for the document. The method may further convert the identified unknown code points into a plurality of converted code points. Each set of converted code points of the plurality uses a different codepage. The method may further identify sets of same code points and sets of redundant code points from the plurality of converted code points. The method may build an index based on the sets of same code points and the sets of redundant code points.

Abstract: A method for verifying data consistency between update-in-place data structures and append-only data structures containing change histories associated with the update-in-place data structures is provided. The method includes loading data from an update-in-place data structure to a first set of hash buckets in a processing platform, loading data from append-only data structures to a second set of hash buckets in the processing platform, performing a bucket-level comparison between the data in the first set of hash buckets and the data in the second set of has buckets, and generating a report based on the bucket-level comparison.

Abstract: A method for indexing with redundant information. The method may identify unknown code points for a document in response to an indexing request for the document. The method may further convert the identified unknown code points into a plurality of converted code points. Each set of converted code points of the plurality uses a different codepage. The method may further identify sets of same code points and sets of redundant code points from the plurality of converted code points. The method may build an index based on the sets of same code points and the sets of redundant code points.

Abstract: In one embodiment, a method includes: obtaining location information and motion information of a wireless communication apparatus, and a data set from one or more information sources external to the wireless communication apparatus; and organizing data of the data set for display, where the organizing is based on the location and motion information of the wireless communication apparatus. Methods of other embodiments may also include defining a search radius based on the location information and motion information of the wireless communication apparatus, and the organizing may also include filtering the data set from the one or more information sources to exclude data from information sources outside the defined search radius.

Abstract: A computer implemented method for selecting breakpoints for cross-layer debugging is provided. The method includes receiving code comprising a plurality of layers, and executing a static analysis of the code to obtain a use-definition (UD) chain, alias information, and a parameter mapping for each of the plurality of layers. The method also includes determining a statement of the code that produces one of an error and a failure, and generating a table comprising a plurality of fields including a working statement field, watching variable field, and a watching function field. The method includes adding the determined statement to the working statement field and performing a cross-layer analysis includes identifying at least one used variable and its associated alias as watching variables from the added working statement, searching the code based on the watching variable field. The method includes generating cross-layer suspect code points based on the cross-layer analysis.

Abstract: A method for verifying data consistency between update-in-place data structures and append-only data structures containing change histories associated with the update-in-place data structures is provided. The method includes loading data from an update-in-place data structure to a first set of hash buckets in a processing platform, loading data from append-only data structures to a second set of hash buckets in the processing platform, performing a bucket-level comparison between the data in the first set of hash buckets and the data in the second set of has buckets, and generating a report based on the bucket-level comparison.