Abstract: Embodiments of the present invention provide a method and a device for allocating an air interface resource. The embodiments of the present invention are capable of solving the problem in the prior art that a method for allocating an air interface resource can provide transmission guarantee only for downlink service data on an air interface. By means of the technical solutions provided in the present invention, the end-to-end transmission guarantee between a service server and a UE can be provided for the downlink service data, thereby improving the service quality of the end-to-end transmission.

Abstract: Systems, methods, and/or computer program products for publishing a spot for display on digital signage at a target location and a target time according to a rule set are disclosed. Certain implementations relate to updating the spot, target digital signage location, and target playback time based on input received from a user. The updates to the spot may be verified by comparing a permissions level of the user to rules regarding the modification of the spot.

Abstract: Concepts and technologies disclosed herein are directed to context-aware virtualized control decision support system (“DSS”) for providing quality of experience (“QoE”) assurance for Internet protocol (“IP”) streaming video services. A QoE assurance DSS can monitor QoE event and context data to be utilized for QoE assurance analytics, measure QoE performance, perform QoE assurance analytics, and determine whether the QoE assurance analytics indicate that the QoE has been degraded, and if so, construct a fault correlation information model to be utilized for root cause analysis to determine a root cause of the QoE being degraded. The QoE assurance DSS also can determine, based upon the fault correlation information model, whether the root cause of the QoE being degraded is due to a capacity reduction, and if so, the QoE assurance DSS can identify a new network resource for capacity reallocation to accommodate a virtual machine migration.

Abstract: The present disclosure relates to systems and methods for facilitating trusted handling of genomic and/or other bioinformatic information. Certain embodiments may facilitate policy-based governance of access to and/or use of bioinformatic information, improved interaction with and/or use of distributed bioinformatic information, parallelization of various processes involving bioinformatic information, and/or reduced user involvement in bioinformatic workflow processes, and/or the like. Further embodiments may provide for memoization processes that may persistently store final and/or intermediate results of computations performed using genomic data for use in connection with future computations.

Abstract: A system for a distributed repository includes an input interface and a processor. The input interface is to receive a request to change a portion of code. The processor is to determine a change reference and an existing reference, indicate to lock one or more repositories, determine whether swapping references is approved by a vote, and in the event that swapping references is approved by a vote, swap the references and indicate to unlock the one or more repositories.

Abstract: Mechanisms can be provided for locking a component and extending the lock to one or more additional component(s) in a visual analyzer application. Embodiments can receive a request for a first component of a document for a first thread where the document is displayed by a graphical user interface (GUI) and has components including the first component and a second component. A lock manager may lock the first component. An action handler can determine, based on code associated with an event pertaining to the request, that the second component also needs to be locked. The lock manager may lock the second component for a same thread, if the first and second components are not currently locked. Additional user actions directed to other components of the application not currently locked may still proceed, permitting asynchronous calls to be processed without interference with a previous action that has already started.

Abstract: Embodiments are directed towards a dynamic change evaluation mechanism, whereby items having a detected possible change are scheduled for re-evaluation for possible changes at a higher frequency than items detected to not have previously changed, while those items detected as not to have changed are dynamically scheduled for re-evaluation based on an evaluation backlog that may be in turn based, in part, on a time from when an item is assigned an expiration time to when the item is evaluated. In one embodiment, a possibly changed item may be assigned a new expiration time independent of the evaluation backlog. In another embodiment, if no change is detected, then the item may be assigned a new expiration time as a function of a previous expiration time and on the evaluation backlog.

Abstract: A knowledge base system is provided for storing and retrieving temporal knowledge in the form of RDF triples without reification. Any resource in an RDF triple (subject predicate object) is converted into a temporal resource that includes a name and a time period components. Hence, a temporal RDF triple (temporal subject temporal predicate temporal object) is formed. The knowledge base system includes three tables for storing temporal triples: A triple Table, An Entity Table, and a Predicate Table. A temporal triple is stored in Subject, Temporal Predicate, and Object columns of the Triple Table and in the Temporal Entity column of the Entity Table. In various embodiments, an object relational, a relational, or NoSQL DBMS or a native RDF triple store system can implement the knowledge base.

Abstract: It is enabled to arrange transaction targets by using variations of attribute into a table and cause the table to be displayed. An information processing apparatus determines, for a transaction target group identified based on a user operation related to search for transaction targets, whether or not there are two or more attribute values for each attribute item. The information processing apparatus associates an attribute item where it is determined that there are two or more attribute values with tables, rows, or columns. The information processing apparatus identifies a transaction target having an attribute indicated by an attribute value corresponding to a cell from among the transaction target group for each cell. The information processing apparatus causes a table in which each cell includes display information indicating the identified transaction target to be displayed.

Abstract: A system for a distributed repository includes an input interface and a processor. The input interface is to receive a request to change a portion of code. The processor is to determine a change reference and an existing reference, indicate to lock one or more repositories, determine whether swapping references is approved by a vote, and in the event that swapping references is approved by a vote, swap the references and indicate to unlock the one or more repositories.

Abstract: A system, method and program product for implementing a garbage collection (GC) process that manages dynamically allocated memory in a multithreaded runtime environment. A method is disclosed that includes defining a threshold value, wherein the threshold value defines a number of GC cycles an object must be observed as unreferenced before being reclaimed; traversing objects in an object graph; and reclaiming a traversed object from the dynamically allocated memory if the traversed object has been observed as unreferenced for more than the threshold value.

Abstract: Apparatus, method, and a program for causing a computer to function as an apparatus, for realizing a runtime system for programming language. The apparatus includes a storage unit for storing a first class that is an existing class in the object-oriented programming language, a second class that is a class that includes a member accessible from outside of the first class and is a class which is specialized for specific use; and a processing unit for performing processing using the second class with a predetermined instruction in software that realizes the runtime system, and performing processing using the first class with an instruction to check an identity of the second class in a user program product that is executed by the runtime system.

Abstract: Disclosed are various embodiments for prefetching of objects referenced on a network page. An encoded network page referring to at least one item is retrieved. The same item is included on a second network page. In response to an indication of user interest in the item on the first network page, at least an initial portion of a video resource associated with the indicated item and included on the second network page is retrieved. In response to a user selection of the same item, the retrieved initial portion of the video resource is rendered on the second network page.

Abstract: A network-based data store may implement retention-based management techniques for data stored at the network-based data store. When data is received for storage at the network-based data store, a retention time for the data may be determined. Storage locations at persistent storage devices of the network-based data store may be selected according to the retention time. The data may then be placed at the storage locations. When a request to delete data is received, retention times of co-located data may be evaluated to determine whether the deletion may be delayed. Delayed deletions may allow the data to be subsequently deleted with at least some of the co-located data. Repair operations to maintain the data according to a durability policy may be modified according to retention time for a data suffering a loss of redundancy.

Abstract: A system, method, and computer program product are provided for conditionally performing an action based on an attribute. In use, at least one attribute associated with an object is determined. Additionally, an event associated with the object is identified. Further, at least one action is conditionally performed in association with the event, based on the at least one attribute.

Abstract: A system includes one or more network media service devices, with each network media node operably connected upstream to one or more gateway devices. At least one of the network media service devices is configured to intercept an ABR-related request to receive digital media content for a media channel sent from a client set top box to a remote ABR server located upstream from the at least one network media device, identify a second gateway device that is storing the digital media content, the second gateway device having previously received the digital media content from the remote ABR server, and return a network address of the second gateway device to the client set top box for use by the client set top box to receive the digital media content from the second gateway device. In various implementations, the network address is returned in connection with an HTTP response indicating a redirection to the network address.

Abstract: A flash memory control technology with high reliability. In a power recovery process, a microcontroller is configured to duplicate a last write page of a run-time write block of a flash memory and thereby generate a duplicated page in the run-time write block. The microcontroller is further configured use the mapping information accessed from the duplicated page in rebuilding a physical-to-logical address mapping table rather than the mapping information accessed from the last write page. The microcontroller is configured to maintain the physical-to-logical address mapping table on a random access memory for the run-time write block and is further configured to use the physical-to-logical address mapping table to update a logical-to-physical address mapping table maintained in the flash memory.

Abstract: In a shared change set server, a receiving section receives information on an undetermined change set and information on users sharing the undetermined change set from a terminal device used by a developer who has developed the change set. Subsequently, a shared change set management section prepares a shared change set containing the undetermined change set and information on users sharing the undetermined change set, and stores the shared change set in a shared change set storage section. A transmitting section thereafter transmits information on the shared change set to a terminal device used by a developer sharing the shared change set.

Abstract: In a shared change set server, a receiving section receives information on an undetermined change set and information on users sharing the undetermined change set from a terminal device used by a developer who has developed the change set. Subsequently, a shared change set management section prepares a shared change set containing the undetermined change set and information on users sharing the undetermined change set, and stores the shared change set in a shared change set storage section. A transmitting section thereafter transmits information on the shared change set to a terminal device used by a developer sharing the shared change set.

Abstract: Systems and methods are disclosed for configuring a non-volatile memory (“NVM”). In some embodiments, each block of the NVM can include a block table-of-contents (“TOC”), which can be encoded (e.g., run-length encoded) and dynamically-sized. Thus, as user data is being programmed to a block, the size of a block TOC can be concurrently recalculated and increased only if necessary. In some embodiments, the NVM interface can use a weave sequence stored in the context information and at least one weave sequence associated with each page of a block to determine whether to replay across the pages of the block after system boot-up.

Abstract: An automatic runtime dependency lookup method may load a class, while executing a computer application program. A class loader determines if the class is found at a first location specified by classpath information. If the class is not found at the first location, the class loader automatically reads repository information to determine an alternate location for the class and locates the class at the alternate location.

Abstract: A template management apparatus includes a standard format classifying part, a group classifying part, and a replacing part. The standard format classifying part classifies a sample character string included in a template, as a standard format character string or a non-standard format character string. The group classifying part classifies the standard format character string into a standard format character string group according to its representation format, and classifies the non-standard format character string into a non-standard format character string group according to its content.

Abstract: A media server receives a first request to transmit the media program to the first device and streams the media program to the first device. The method monitors the streaming of the media program to the first device to generate media program streaming information and transmits the media program streaming information to a media program provider. A second request is received to resume transmission of the media program from a second device where the request includes a temporal location within the media program that was received from the media program provider. The media program provider determined the temporal location from the streaming information transmitted from the media server to the media program provider. The media server resumes transmission of the media program to the second device from the temporal location received from the media program provider.

Abstract: A software secure universal serial bus (USB) disk connected to a client may be redirected to a server. Requests to a virtual software secure USB disk may not be accessible because of network latency. For example, a client locking application may not verify required parameters before expiration of a time period. A client may be configured to unmount its file system (if present) and lock its disk stack. The server may load a virtual disk enumerator and file system stack to process transaction requests to the virtual software secure USB disk. The partition manager may create a partition associated with a hidden partition of the virtual software secure USB disk and associate a locking application in a separate virtual small partition. All requests to unlock the virtual hidden partition are processed at the server by the locking application instead of at the client which reduces the overall bandwidth.

Abstract: The technique relates to a system and method for assessing modularity of a program written in an object oriented language. This technique involves receiving information related to modularization of the program written in the object oriented language. Then the modularization of the program is assessed by calculating object encapsulation metrics, partial types metrics, extension method metrics, delegates metrics and static variable usage metrics. Further, an assessment report of the modularization is generated with respect to the said metrics.

Abstract: The present disclosure relates to systems and methods for facilitating trusted handling of genomic and/or other bioinformatic information. Certain embodiments may facilitate policy-based governance of access to and/or use of bioinformatic information, improved interaction with and/or use of distributed bioinformatic information, parallelization of various processes involving bioinformatic information, and/or reduced user involvement in bioinformatic workflow processes, and/or the like. Further embodiments may provide for memoization processes that may persistently store final and/or intermediate results of computations performed using genomic data for use in connection with future computations.

Abstract: Systems and methods for selective proxification of applications are disclosed. One or more computer readable storage media may be encoded with instructions executable by one or more processing units of a computing system. The instructions encoded on the computer readable storage media may comprise authenticating a single sign-on access at a proxy server, receiving a request at the proxy server to access an application on an application server requiring authentication, accessing the application on the application server, authenticating a user to the application without additional authentication input from the user, and selectively providing a proxified session between the user and the application.

Abstract: According to one technique, a virtual machine identifies a first instruction to create a variable handle instance, the first instruction including declaration information that identifies a type of receiver and a variable held by the receiver to which the variable handle instance is configured to provide access. If access to the variable is permissible, the virtual machine creates the variable handle instance comprising constrained functions configured to execute constrained operations on a memory location of the variable. The virtual machine identifies a second instruction that specifies a call to a particular constrained, wherein the second instruction specifies the receiver or is implicitly bound to the receiver. The virtual machine identifies a particular memory location where the instance of the variable is stored and performs the particular constrained function with respect to the particular memory location.

Abstract: A method relates to identifying, by a processing device, a plurality of source code objects associated with an open source product stored in a version-controlled code repository, determining a first subset of the plurality of source code objects associated with a respective commit identifier indicating that each of the first subset of the plurality of source code objects is committed to the version-controlled code repository, determining a second subset of the plurality of source code objects not associated with any commit identifier of the version-controlled code repository, labeling each of the first subset of the plurality of source code objects as an upstream source code object, and labeling each of the second subset of the plurality of source code objects as a non-upstream source code object.

Abstract: In one embodiment, a memory resource manager may pass data memory structures between application components on a computing device. A memory resource 306 may store a data memory structure for a holding application component 302. A processor 120 may pass a handle representing the data memory structure to a calling application component 308 upon access by the calling application component 308.

Abstract: A processor core of a data processing system receives a push instruction of a sending thread that requests that a message payload identified by at least one operand of the push instruction be pushed to a mailbox of a receiving thread. In response to receiving the push instruction, the processor core executes the push instruction of the sending thread. In response to executing the push instruction, the processor core initiates transmission of the message payload to the mailbox of the receiving thread. In one embodiment, the processor core initiates transmission of the message payload by transmitting a co-processor request to a switch of the data processing system via an interconnect fabric.

Abstract: A processor core of a data processing system receives a push instruction of a sending thread that requests that a message payload identified by at least one operand of the push instruction be pushed to a mailbox of a receiving thread. In response to receiving the push instruction, the processor core executes the push instruction of the sending thread. In response to executing the push instruction, the processor core initiates transmission of the message payload to the mailbox of the receiving thread. In one embodiment, the processor core initiates transmission of the message payload by transmitting a co-processor request to a switch of the data processing system via an interconnect fabric.

Abstract: Embodiments are directed towards a system and method for a cloud-based front end that may abstract and enable access to the underlying cloud-hosted elements and objects that may be part of a multi-tenant application, such as a search application. Search objects may be employed to access indexed objects. An amount of indexed data accessible to a user may be based on an index storage limit selected by the user, such that data that exceeds the index storage limit may continue to be indexed. Also, one or more projects can be elastically scaled for a user to provide resources that may meet the specific needs of each project.

Abstract: A system that allocates memory for immutable data on a computing device. The system allocates a memory region on the computing device to store immutable data for an executing application. This memory region is smaller than the immutable data for the application. When the system subsequently receives a request to access a block of immutable data for the application, the system allocates space in this memory region for the block, and proceeds to load the block into the memory region. If at a later time the space occupied by this first block is needed for another block, the system unloads and discards the first block. If a subsequent operation needs to use information in the first block, the system regenerates the block by transforming raw data associated with the block into a form that can be directly accessed by the application, and then reloads the block into the memory region.

Abstract: A system comprising a broadcast facility, one or more players, and an analytic service center. The broadcast facility may be configured to provide a plurality of streams. The one or more players may be configured to receive at least one of the plurality of streams and provide feedback on a user experience. The analytic service center may be configured to receive the feedback from the one or more players.

Abstract: Disclosed are systems and methods for fingerprint analysis for anti-virus scanning. In an embodiment, a method of scanning for infected data items is disclosed. The method provides identifying a plurality of changed data items on a server machine. The method further provides, from a data system in communication with the server machine, performing a virus scan on the plurality of changed data items. The method further provides that the data system maintains a list of data items that the virus scan found to be infected.

Abstract: A system is described for managing storage and access of confidential data downloaded from a server (e.g., an enterprise data server) onto a mobile device. The confidential data may be received over a network directly or be embedded as part of an email or other application. Instead of storing the data item locally, the data item may be communicated to a peripheral device that is communicatively coupled to the mobile device via a peripheral interface. The data item is encrypted and stored on the peripheral device.

Abstract: A mesh structure can be a type concept that extends internal tables or other data structures of a business programming languages (e.g., ABAP) by associations, as known from a data object meta-model. A mesh can include a set of operations, such as for example iteration via an iterator object and selection of instances expressed by a path language. A mesh structure can be optimized for read access and traversal, and can provide a working area that is processed with statements in the business programming language to implement one or more core services directly from the mesh data structure. Related methods, computer program products, and systems are described.

Abstract: A method to model a business object is disclosed. An analysis module analyzes elements of a business object. A modeling module models business object logic based on the elements of the business object. An implementation module implements the modeled business object logic. A repository stores the modeled business object logic. A business object runtime module executes the modeled business object logic.

Abstract: Locating program code units stored on digital data storage includes defining a software module fragment by assigning a software module fragment label to selected program code units, creating a module fragment list defining a software module, said list comprising a set of said software module fragments, receiving a request to retrieve the program code units of a specified software module from the digital data storage, and converting, using a processor, the module fragment list of the specified module into a list of physical locations for resolving the locations of the corresponding program code units on the digital data storage using said labels.

Abstract: A framework for developing and testing a software wizard formalizes, through constraint functions, relationships between different pages of the software wizard. A sequence of user interface (UI) pages of a software wizard is generated in accordance with this framework by carrying out the steps of displaying a first UI page that includes a first UI element for causing a transition to a next UI page of the software wizard, wherein the first UI page is associated with one or more constraint functions, detecting an input event that triggers the one or more constraint functions of the first UI page to produce an output that identifies the next UI page in the sequence of UI pages of the software wizard, and transitioning to the next UI page based on the output.

Abstract: A client updates a display of a user interface associated with a state-based client-server application in accordance with a client-side cache. The server supplies data for a new state and additional data for one or more subsequent states that possibly follow the new state if appropriate one or more operations are performed. When a client request is generated that indicates an operation that causes the application to transition to the new state, the client updates the display in accordance with the data that corresponds to the new state from the client-side cache, if available from the client-side cache. The new state data is available since the server has previously supplied the new state data.

Abstract: A method, an apparatus, and a system for locating sensor data. The method includes the steps of: obtaining an index table; intercepting a query for sensor data in runtime; extracting a characteristic parameter from a query condition; locating a block identifier of matching sensor data storage blocks in the index table by using the characteristic parameter; and loading the storage blocks into a memory space of a working processor; where the index table contains mapping relationships between block identifiers of sensor data storage blocks and characteristic attributes of sensor data.

Abstract: A computer processor collects information for a dominant data access loop and reference code patterns based on data reference pattern analysis, and for pointer aliasing and data shape based on pointer escape analysis. The computer processor selects a candidate array for data splitting wherein the candidate array is referenced by a dominant data access loop. The computer processor determines a data splitting mode by which to split the data of the candidate array, based on the reference code patterns, the pointer aliasing, and the data shape information, and splits the data into two or more split arrays. The computer processor creates a software cache that includes a portion of the data of the two or more split arrays in a transposed format, and maintains the portion of the transposed data within the software cache and consults the software cache during an access of the split arrays.

Abstract: Arrangements described herein relate to managing reusable artifacts. Responsive to receiving a request to create a placeholder for a reusable artifact representing a reusable unit, the placeholder for an appropriate version of the reusable artifact is created within a container and a first parameter identifying the reusable artifact is assigned to an artifact property of the placeholder. The placeholder further includes a branch property configured to indicate a first null value or a second parameter identifying a branch of the reusable artifact corresponding to a particular variant of the reusable artifact, and a version property configured to indicate a second null value or a third parameter identifying a particular version of the reusable artifact.

Abstract: Arrangements described herein relate to managing reusable artifacts. Responsive to receiving a request to create a placeholder for a reusable artifact representing a reusable unit, the placeholder for an appropriate version of the reusable artifact is created within a container and a first parameter identifying the reusable artifact is assigned to an artifact property of the placeholder. The placeholder further includes a branch property configured to indicate a first null value or a second parameter identifying a branch of the reusable artifact corresponding to a particular variant of the reusable artifact, and a version property configured to indicate a second null value or a third parameter identifying a particular version of the reusable artifact.

Abstract: A method for creating an enhanced array is provided. An enhanced compiler generates an instrumented class file for an enhanced array class. The enhanced array class comprises at least one element class. The enhanced runtime loads the instrumented class file of the enhanced array class. The enhanced runtime loads a class file corresponding to the element class of the enhanced array class, and builds an internal data structure corresponding to the enhanced array class. An amount of memory storage is calculated for storing the enhanced array instance, and the amount of memory storage is allocated.

Abstract: A method for creating an enhanced array is provided. An enhanced compiler generates an instrumented class file for an enhanced array class. The enhanced array class comprises at least one element class. The enhanced runtime loads the instrumented class file of the enhanced array class. The enhanced runtime loads a class file corresponding to the element class of the enhanced array class, and builds an internal data structure corresponding to the enhanced array class. An amount of memory storage is calculated for storing the enhanced array instance, and the amount of memory storage is allocated.

Abstract: Efficient SQL based multi-attribute clustering of data attributes may be used to identify the most relevant combination of data attributes to an outcome. A global outcome value may be calculated to represent an average of the outcome. A subset outcome value for each subset of data attributes of a plurality of attributes may be calculated to represent average of the outcome for the subset. For each subset of data attributes, a number of members associated with the subset may be compared to a threshold, and the subsets with less members than the threshold may be removed. The subset outcome value for each subset of data attributes may be compared to the global outcome value, and a report may be generated that identifies each subset for which the corresponding subset outcome value is greater than or less than the global outcome value.

Abstract: A method and search engine for classifying a source publishing a document on a portion of a network, includes steps of electronically receiving a document, based on the document, determining a source which published the document, and assigning a code to the document based on whether data associated with the document published by the source matches with data contained in a database. An intelligent geographic- and business topic-specific resource discovery system facilitates local commerce on the World-Wide Web and also reduces search time by accurately isolating information for end-users. Distinguishing and classifying business pages on the Web by business categories using Standard Industrial Classification (SIC) codes is achieved through an automatic iterative process.