Abstract: Systems, methods, and devices of the various aspects enable identification of anomalous application behavior by monitoring memory accesses by an application running on a computing device. In various aspects, a level of memory access monitoring may be based on a risk level of an application running on the computing device. The risk level may be determined based on memory address accesses of the application monitored by an address monitoring unit of one or more selected memory hierarchy layers of the computing device. The memory hierarchy layers selected for monitoring for memory address accesses of the application may be based on the determined risk level of the application. Selected memory hierarchy layers may be monitored by enabling one or more address monitoring units (AMUs) associated with the selected one or more memory hierarchy layers. The enabling of selected AMUs may be accomplished by an AMU selection module.

Abstract: Systems, methods, and devices of the various aspects enable identification of anomalous application behavior by monitoring memory accesses by an application running on a computing device. In various aspects, a level of memory access monitoring may be based on a risk level of an application running on the computing device. The risk level may be determined based on memory address accesses of the application monitored by an address monitoring unit of one or more selected memory hierarchy layers of the computing device. The memory hierarchy layers selected for monitoring for memory address accesses of the application may be based on the determined risk level of the application. Selected memory hierarchy layers may be monitored by enabling one or more address monitoring units (AMUs) associated with the selected one or more memory hierarchy layers. The enabling of selected AMUs may be accomplished by an AMU selection module.

Abstract: Aspects include computing devices, systems, and methods for implementing detecting return oriented programming (ROP) attacks on a computing device. A memory traversal map for a program called to run on the computing device may be loaded. A memory access request of the program to a memory of the computing device may be monitored and a memory address of the memory from the memory access request may be retrieved. The retrieved memory address may be compared to the memory traversal map and a determination of whether the memory access request indicates a ROP attack may be made. The memory traversal map may include a next memory address adjacent to a previous memory address in the memory traversal map. A cumulative anomaly score based on mismatches between the retrieved memory address and the memory traversal map may be calculated and used to determine whether to load a finer grain memory traversal map.

Abstract: The system enables a user to select and order media objects, such as sound files, image files, animations, and text into a media presentation. The media presentation is then associated with a trigger or other interrupt event. Upon an occurrence of the event, the system plays the media presentation on system output devices. In one example of the system, the selected media files, ordering information, and other properties are assembled into a media package. The media package may be published to a remote device so that a remote device may play the media presentation.

Abstract: A memory manager acts on a memory that has been arranged with a predetermined number of fixed memory blocks, with each memory block set to a predefined size. These fixed blocks have been initialized to accelerate the allocation process. When a memory manger receives an allocation request, the size of the request is compared to the predefined size. If the memory manager determines that the fixed memory block handles the memory request, then the memory manager allocates one of the fixed blocks to the pending memory request. If no fixed block is available to handle the request, then the memory manager may allocate the memory from a free memory pool. The memory manager may search the available free memory blocks to identify and allocate the optimum free block that satisfies the pending allocation request.

Abstract: A method of displaying a long animation is provided. The animation is defined in an animation file, which identifies a set of images that form the animation when sequentially displayed. A batch processor segments the set of images into sequential subsets, with each subset sized smaller than a maximum size. In this way, all of the images identified in a particular subset may be loaded into memory. Each subset of images is associated with a respective segment identifier, and an instruction is provided along with the images to order the subsets. In this way, a first subset of images provides for the loading of a second subset of images, thereby enabling the display of long animations.

Abstract: A method of displaying a long animation is provided. The animation is defined in an animation file, which identifies a set of images that form the animation when sequentially displayed. A batch processor segments the set of images into sequential subsets, with each subset sized smaller than a maximum size. In this way, all of the images identified in a particular subset may be loaded into memory. Each subset of images is associated with a respective segment identifier, and an instruction is provided along with the images to order the subsets. In this way, a first subset of images provides for the loading of a second subset of images, thereby enabling the display of long animations.

Abstract: Methods to manipulate the mobile wireless device screen more efficiently are provided. The method and devices allow a graphical user interface to be used more efficiently on a mobile handset with limited processing ability. A graphical user interface can be implemented on a mobile wireless device efficiently by limiting processing to only the areas of the display screen on the mobile wireless device that is changing. For example, if a graphical item is to be displayed on the display screen the value in the display screen memory location that will be covered by the graphical item can be stored for future use. If the graphical item is later moved the stored value can be retrieved and efficiently written to the display without the need to recalculate what was behind the graphical item.

Abstract: A binary search tree is provided for efficiently organizing values for a set of items, even when values are duplicated. In generating the binary search tree, the value of each item in a set of values is determined. If a particular value is unique and is found only once in the set, than that unique value is used as a node in the binary search tree. If a value is duplicative and is found two or more times in the set, then the duplicative value is used as a hook in the binary search tree. The hook element has a list branch that is used to identify items having a value equal to the duplicative value. A node tree may be extended from a second branch of the hook, with the node tree having a base node equal to the duplicative value. The base node may have a first branch for holding a value less than the duplicative value, and a second branch for holding a value greater than the duplicative value.

Abstract: A method of applying a frame to an image is provided, with the method operating on an image processor. The framing method uses a compact and flexible frame description for building a frame in a particular style. The frame description includes one or more graphical frame assets that are indicative of a portion of the frame. A frame rule provides instruction to the image processor on how to process and place the frame asset(s) into the frame, and how to apply the frame to the image. The framed image may then be published for local viewing, remote viewing, printing, or storing.

Abstract: A memory manger acts on a memory that has been arranged with a predetermined number of fixed memory blocks, with each memory block set to a predefined size. These fixed blocks have been initialized to accelerate the allocation process. When a memory manger receives an allocation request, the size of the request is compared to the predefined size. If the memory manager determines that the fixed memory block handles the memory request, then the memory manager allocates one of the fixed blocks to the pending memory request. If no fixed block is available to handle the request, then the memory manager may allocate the memory from a free memory pool. The memory manager may search the available free memory blocks to identify and allocate the optimum free block that satisfies the pending allocation request.

Abstract: A binary search tree is provided for efficiently organizing values for a set of items, even when values are duplicated. In generating the binary search tree, the value of each item in a set of values is determined. If a particular value is unique and is found only once in the set, than that unique value is used as a node in the binary search tree. If a value is duplicative and is found two or more times in the set, then the duplicative value is used as a hook in the binary search tree. The hook element has a list branch that is used to identify items having a value equal to the duplicative value. A node tree may be extended from a second branch of the hook, with the node tree having a base node equal to the duplicative value. The base node may have a first branch for holding a value less than the duplicative value, and a second branch for holding a value greater than the duplicative value.

Abstract: Methods to manipulate the mobile wireless device screen more efficiently are provided. The method and devices allow a graphical user interface to be used more efficiently on a mobile handset with limited processing ability. A graphical user interface can be implemented on a mobile wireless device efficiently by limiting processing to only the areas of the display screen on the mobile wireless device that is changing. For example, if a graphical item is to be displayed on the display screen the value in the display screen memory location that will be covered by the graphical item can be stored for future use. If the graphical item is later moved the stored value can be retrieved and efficiently written to the display without the need to recalculate what was behind the graphical item.

Abstract: The system enables a user to select and order media objects, such as sound files, image files, animations, and text into a media presentation. The media presentation is then associated with a trigger or other interrupt event. Upon an occurrence of the event, the system plays the media presentation on system output devices. In one example of the system, the selected media files, ordering information, and other properties are assembled into a media package. The media package may be published to a remote device so that a remote device may play the media presentation.

Abstract: A method of displaying a long animation is provided. The animation is defined in an animation file, which identifies a set of images that form the animation when sequentially displayed. A batch processor segments the set of images into sequential subsets, with each subset sized smaller than a maximum size. In this way, all of the images identified in a particular subset may be loaded into memory. Each subset of images is associated with a respective segment identifier, and an instruction is provided along with the images to order the subsets. In this way, a first subset of images provides for the loading of a second subset of images, thereby enabling the display of long animations.

Abstract: A method of applying a frame to an image is provided, with the method operating on an image processor. The framing method uses a compact and flexible frame description for building a frame in a particular style. The frame description includes one or more graphical frame assets that are indicative of a portion of the frame. A frame rule provides instruction to the image processor on how to process and place the frame asset(s) into the frame, and how to apply the frame to the image. The framed image may then be published for local viewing, remote viewing, printing, or storing.