| ORACLE INTERNATIONAL CORPORATION Patent applications |
| Patent application number | Title | Published |
|---|
| 20160142379 | ASSOCIATING ANONYMOUS INFORMATION TO PERSONALLY IDENTIFIABLE INFORMATION IN A NON-IDENTIFIABLE MANNER - The present disclosure provides a detailed description of techniques used in methods, systems, and computer program products for associating anonymous information to personally identifiable information without sharing any personally identifiable information. A method receives a specification record comprising one or more specified demographic attributes to be used in user record selection operations, the results of which operations include user records that comprise a user identifier and at least some non-personally-identifiable information. A candidate group is formed by applying a set of rules over the retrieved user records to reject-out one or more user records that comprise mutually-exclusive characteristics with respect to the other user records in the candidate group. An anonymity measure is calculated over the candidate group to satisfy a threshold of anonymity. If needed to satisfy the threshold of anonymity, additional user records are added to the group before any sharing operations. Anonymity of the users is preserved. | 05-19-2016 |
| 20160140231 | TERM SELECTION FROM A DOCUMENT TO FIND SIMILAR CONTENT - Methods, devices, and systems are described for creating and implementing search query vectors for knowledge base articles or other formal articles, the query vectors automatically created from informal correspondence such as a service request email to an information technology (IT) department. Term frequency-inverse document frequency (TF-IDF) scores are calculated for rarewords in the correspondence with respect to a corpus of other service requests. High scoring terms with the same neighbors as those in the corpus of formal articles are added to the search query vector, while high scoring terms that do not share the same neighbors are thrown out. The query vector is then used to run a search of the knowledge base for relevant articles. | 05-19-2016 |
| 20160140033 | Test Bundling and Batching Optimizations - Test bundling and batching by a test execution framework may be customized in accordance with test suite requirements for testing platform implementations on network-connected, resource-limited devices. Tests, test data and test results may be communicated in bundles or batches. Multiple tests may be bundled into a test application bundle and communicated over a single data connection. Test data for the tests in a bundle may be packaged into a single batch and transferred using a single data connection. Similarly, results from executing the tests in a test application bundle may be batched and transferred together over a single connection. Additionally, a custom user interface may be utilized to allow for customizing the test bundling policy for individual test suites. Providing the ability for a user to customize the test bundling policy may significantly reduce the number of data connections required during test suite execution. | 05-19-2016 |
| 20160133140 | USING GROCERY STORE POINT-OF-SALE DATA TO CORRELATE CONSUMER PURCHASE HABITS TO NUTRITION TARGETS - A method, system, and computer program product for wellness program management. Embodiments commence upon identifying a person as a wellness program participant and associating the person with a repository of grocer POS data using a personal identifier that is used to access the grocer POS data that comprises at least some food items purchased in a particular shopping trip. A set of consumer purchase records are retrieved from the POS data, then at least one aspect of a wellness profile pertaining to the wellness program participant is retrieved from wellness program data. The consumer purchase records can be analyzed to determine a nutrition value that is associated with at least one aspect of the wellness program participant's wellness profile. An alert is sent to the wellness program participant when certain events occur or when wellness profile thresholds are met. | 05-12-2016 |
| 20160132938 | EXTENDING AUDIENCE REACH IN MESSAGING CAMPAIGNS USING PROBABILISTIC ID LINKING - A server receives incoming data records comprising an ID value and respective user attributes corresponding to a user activity that originates at a user device. Characteristics of the activity and/or characteristics of the user device are considered in order to assign a probabilistic confidence value, which is in turn used to generate links from an incoming data record to other previously-received data records, and in so doing, generates a probabilistic link between one set of user attributes from the incoming data record and another set of user attributes from previously-received data records. A messaging campaign specification that describes target user attributes is used to identify a matching set of target audience member records. The determination of a match or not is based on the probabilistic confidence value and a threshold can be varied to extend audience reach. The identified set of target audience member records are transmitted over a network. | 05-12-2016 |
| 20160132487 | LEMMA MAPPING TO UNIVERSAL ONTOLOGIES IN COMPUTER NATURAL LANGUAGE PROCESSING - A method of mapping ontologies between languages may include receiving a first ontology in a first language, where the first ontology includes a first plurality of lemmas and a plurality of relationships between the plurality of lemmas. The method may also include receiving a second plurality of lemmas in a second language, and mapping each of the second plurality of lemmas in the second language to a respective lemma in the first plurality of lemmas in the first language. The method may additionally include generating a second ontology in the second language by using the plurality of relationships in the first ontology to create relationships between the second plurality of lemmas in the second language. | 05-12-2016 |
| 20160132484 | AUTOMATIC GENERATION OF N-GRAMS AND CONCEPT RELATIONS FROM LINGUISTIC INPUT DATA - A method of automatically generating a lemma dictionary from a web resource may include extracting a plurality of tokens from text-based documents within the web resource, and generating a plurality of N-grams from the plurality of tokens. The method may additionally include receiving one or more filter definitions that identify valid N-grams, and filtering the plurality of N-grams using the one or more filter definitions to generate a lemma dictionary. The method may further include generating an ontology that comprises the lemma dictionary. | 05-12-2016 |
| 20160132482 | AUTOMATIC ONTOLOGY GENERATION FOR NATURAL-LANGUAGE PROCESSING APPLICATIONS - A method of generating ontologies for a Virtual Assistant across different languages may include extracting a plurality of tokens in a first language from a plurality of web resources in a web domain that includes the Virtual Assistant. The web resources may be made available in a first language and a second language. The method may also include determining a first part-of-speech (POS) for each of the plurality of tokens, where the first POS may be specific to the first language. The method may additionally include mapping the first POS to a second POS from a standardized set of POS's that are general across the first language and the second language, and generating a plurality of lemmas from the plurality of tokens. The method may further include displaying a network representing the ontology. | 05-12-2016 |
| 20160131711 | MIXING OF LOW SPEED AND HIGH SPEED CLOCKS TO IMPROVE TEST PRECISION OF A DIGITAL INTEGRATED CIRCUIT - Implementations of the present disclosure involve an apparatus and/or method for mixing high speed and low speed clock signals during structural testing of a digital integrated circuit to improve the test precision and efficiency. In particular, the apparatus and/or method allow for a testing device to perform stuck-bit testing of the circuit by releasing one or more clock cycles of a low speed clock signal. Further, without having to reset the testing of the circuit, at-speed testing of the circuit may be conducted by the testing device. In one embodiment, at-speed testing occurs by activating a mode signal associated with the circuit design that instructs one or more clock cycles from an internal clock signal to the circuit to be released. The testing device may return to stuck-bit testing at a low speed clock signal, or continue with at-speed testing using the high speed internal clock signal. | 05-12-2016 |
| 20160127289 | OPERATING A MATCH COOPERATIVE WITHOUT HANDLING PERSONALLY IDENTIFIABLE INFORMATION - The present disclosure provides a detailed description of techniques used in systems, methods, and in computer program products for building and operating a match cooperative without handling personally identifiable information. The various embodiments address the problem of discovering attributes pertaining to a particular user without sharing personally identifiable information pertaining to that particular user. More specifically, the claimed embodiments are directed to approaches for receiving online and offline PII and NPII associated with various users, obfuscating (e.g., hashing) the PII, and matching the obfuscated PII to the NPII based on various data (e.g., common attributes, etc.) and methods (e.g., deterministic matching, probabilistic matching, etc.). The matched NPII attributes can then be used to target the user associated with the obfuscated PII in online advertising campaigns. | 05-05-2016 |
| 20160125471 | REAL-TIME CROSS-DEVICE USER CATEGORY SYNCHRONIZATION IN AN ADVERTISING CAMPAIGN - The present disclosure provides systems, methods, and computer program products for real-time cross-device user category synchronization. Embodiments commence upon allocating or identifying user data records comprising two user profiles. The user profiles are populated with information by receiving electronic communications over a network, where the information comprises user category information and device attributes found in data records that originate from user devices. Steps are taken to associate a first device data record with a second device data record, wherein the association is based at least in part on a match between selected attributes among the user devices. User category information within the user profiles are synchronized to form updated user profiles. Some embodiments further execute steps for forming a cross-device map that identifies an association between an updated first user profile and a second user profile. | 05-05-2016 |
| 20160125467 | CLASSIFYING USER INTENT BASED ON LOCATION INFORMATION ELECTRONICALLY COMMUNICATED FROM A MOBILE DEVICE - A method, system, and computer program product for classifying user intent based on spatial information relayed via a mobile device. Embodiments commence upon receiving a location beacon identification value originating from a location beacon, which location beacon identification value is then relayed to the server from the mobile device. The server determines a set of one or more rules based at least in part on the location beacon identification value, and then transmits at least a portion of a set of one or more rules to the mobile device, (e.g., using a mobile device carrier's infrastructure). The rules comprise triggers, and when a trigger fires, user categorization is determined and user intent is predicted. The user categorization and/or predicted user intent is used to select an advertising message. | 05-05-2016 |
| 20160125360 | CANDIDATE PIPELINE BUILDER - Embodiments of the invention provide for identifying candidates for an open position. More specifically, embodiments provide for matching, comparing and sorting candidates based on skill set, job title, education, and/or other attributes described in a candidate profile with a requisition in a recruiting application. Embodiments of the present invention can build candidate pools for current or future openings without manual intervention. Embodiments can segment candidate profiles, e.g., which can be built from collected resumes, based on skill set, education, job title match, and/or other criteria. Matches can be found between these profiles and a set of requirements for a position based on one or more searches including but not limited to a keyword search, a synonym replacement search, a distance matching search, etc. Results of these searches can be weighted and combined into an ordered candidate list or pipeline presented to the recruiter or other user for review. | 05-05-2016 |
| 20160119321 | FLEXIBLE AUTHENTICATION FRAMEWORK - A flexible and extensible architecture allows for secure searching across an enterprise. Such an architecture can provide a simple Internet-like search experience to users searching secure content inside (and outside) the enterprise. The architecture allows for the crawling and searching of a variety of sources across an enterprise, regardless of whether any of these sources conform to a conventional user role model. The architecture further allows for security attributes to be received at query time, for example, in order to provide real-time secure access to enterprise resources. The user query also can be transformed to provide for dynamic querying that provides for a more current result list than can be obtained for static queries. | 04-28-2016 |
| 20160117566 | SCREENSHOT DATABASE FOR APPLICATION VERIFICATION - Methods, systems, and computer-readable mediums are presented that process and store images efficiently in a memory system. When a new image is received, it is compared to a plurality of reference images. The most similar reference image is located, and a delta image is generated representing a difference between the reference image and the new image. Instead of storing the entirety of the new image, the delta image can be stored along with a reference to the corresponding reference image, such that the new image can be restored from the delta image and the reference image. The total number of reference images and delta images can be dynamically balanced such that predetermined ratios of image numbers or image sizes can be maintained. | 04-28-2016 |
| 20160117351 | CONCURRENT ACCESS FOR HIERARCHICAL DATA STORAGE - Methods, systems, and computer-readable storage mediums are presented for aggregating multiple values for an object using database rows. Each value added to the database for the object may include a same primary key and a unique sequence key. This allows multiple values to be added for an object concurrently by simply adding additional rows to the database table. After values have been added, a process can identify multiple rows having the same primary key and aggregate the values stored in those rows together into a single database row having the primary key. This can be done as part of a garbage-collection routine or in response to other processes attempting to add additional values for the object. | 04-28-2016 |
| 20160116821 | OPTICAL REFLECTOR BASED ON A DIRECTIONAL COUPLER AND A COUPLED OPTICAL LOOP - An optical device includes an optical reflector based on a coupled-loopback optical waveguide. In particular, an input port, an output port and an optical loop in arms of the optical reflector are optically coupled to a directional coupler. The directional coupler evanescently couples an optical signal between the arms. For example, the directional coupler may include: a multimode interference coupler and/or a Mach-Zehnder Interferometer (MZI). Moreover, destructive interference during the evanescent coupling determines the reflection and transmission power coefficients of the optical reflector. | 04-28-2016 |
| 20160112458 | ESTABLISHING TRUST BETWEEN APPLICATIONS ON A COMPUTER - Systems, methods and machine-readable media for providing a security service are disclosed. The methods include receiving a modification of the application object code to allow the software application to transmit a request for the security service; retrieving the modified application object code corresponding to the software application from memory; receiving, via a processor, the request for the security service from the modified application object code; and providing, via the processor, the security service. The systems and machine-readable media performing operations according to the methods disclosed. | 04-21-2016 |
| 20160110055 | EVENT-BASED ARCHITECTURE FOR EXPAND-COLLAPSE OPERATIONS - Techniques are disclosed for event-based architectures for implementing expand-collapse input-output operations in user interfaces. Certain techniques are disclosed herein that allow for a expand and/or collapse functionality via passing asynchronous events to a datasource module, which may or may not be routed through a view module. The datasource module determines what data is to be shown or hidden and issues an insert/delete event back to the view module. The insert/delete event may include additional data to be inserted into the user interface, and may include an identifier of where, within the displayed user interface, data is to be inserted or deleted. A view module may be configured to receive insert or delete events, and, in response, cause the user interface to be modified based upon the event. The view module may perform these updates by inserting or removing Document Object Model (DOM) nodes from a DOM associated with the user interface. | 04-21-2016 |
| 20160094690 | PACKET TRANSPORT PROTOCOL PROCESSING - A method of implementing a packet transport protocol between a source and a receiver may include receiving input from a source system including data fields indicating whether the source system will allow packet transport to be handled by the receiver. The method may also include receiving input indicating that a packet from the source is required by the receiver. The input can include a first timing requirement indicating at time when the packet is required at the receiver, and a selection between first and second protocols that mandate, respectively, that packet transport is handled by the receiver in the first protocol and by the source in the second protocol. The method may also include determining, based on the data fields, whether the source will allow use of the selected protocol. The method may also include transmitting a request for the packet, in which the request includes a second timing requirement. | 03-31-2016 |
| 20160094615 | REDUCING WEB PAGE LOAD LATENCY BY SCHEDULING SETS OF SUCCESSIVE OUTGOING HTTP CALLS - A system, method, and computer program product for reducing web page load latency by scheduling sets of successive outgoing HTTP calls. Some embodiments commence upon receiving from a requesting client device, a request for content of a web page, wherein the content comprises two or more portions of dynamic content. Operations are performed to determine that the two or more portions of dynamic content are to be processed separately. A scheduling script to be executed by the requestor is generated and sent to the client device. The scheduling script comprises instructions to process a first subset of the two or more dynamic portions of content and also comprises instructions to process a second subset of the two or more portions of dynamic content. The scheduling script, when executed by requesting client device, causes the first subset of dynamic content and the second subset of dynamic content to be processed separately. | 03-31-2016 |
| 20160094497 | BUILDING MESSAGE RELATIONSHIPS FOR OFFLINE OPERATION OF AN ENTERPRISE APPLICATION - A system, method, and computer program product for building JSON message relationships for offline operation of an enterprise application is presented. The claimed embodiments address the problem of mobile application behavior during periods of limited access to backend application services and data. More specifically, some embodiments are directed to approaches for capturing request and response information communicated between a client device and application server when connected by a network, and storing respective relationships using the captured information. The stored requests and responses and respective relationships are used to emulate the backend services provided by the application server when the client device is disconnected from the network. In one or more embodiments, a crawler on the client device can generate simulated online requests to build a set of information for use by the emulator when the client device is disconnected from the application server. | 03-31-2016 |
| 20160094422 | STATISTICAL PATTERN CORRELATION OF EVENTS IN CLOUD DEPLOYMENTS USING CODEBOOK APPROACH - Correlations between patterns of events generated by various separate components within a cloud deployment are statistically determined. The determinations of the correlations can be based on dependencies between the components as indicated by a system topology graph including the components. The patterns correlated can be patterns of events from event streams generated by monitoring systems that monitor the components. The events in the event streams can represent changes over time in component state, behavior, or problem occurrence. Because the quantity of components within such a cloud deployment can be enormous, the quantity of events generated by the monitoring systems over a significant period of time can be voluminous. | 03-31-2016 |
| 20160094421 | PLATFORM FOR CAPTURING, PROCESSING, STORAGING, AND PRESENTATION OF GENERIC SENSOR DATA FROM REMOTE ARBITRARY LOCATIONS - Disclosed is a method and mechanism to implement a unified infrastructure for handling IoT components and devices. A platform is provided to integrate, access, and control any type of local device, and to use any type of back-end application to processed collected data from the local devices. | 03-31-2016 |
| 20160092914 | EVALUATING PAGE CONTENT TO DETERMINE USER INTEREST - The disclosure is directed to approaches for combining server-side decisions based on user attributes and/or demographics with client-side decisions based on expressed or implied user interests determined based on the contents of a web page being visited by the user. A server is responsive to an occurrence of an operation of a client device at the web page. Processing steps determine particular executable web page content to send to the client device (e.g., where the particular executable web page content is determined in response to a particular client-side operation). The web page is rendered with the aforementioned executable web page content. Server-side processing receives messages that are emitted conditionally, based on the occurrence of a user event. An event log message comprises a portion of the web page, such as a string, indicating or implying user interest. A targeted advertisement is presented to the user based on the user interest. | 03-31-2016 |
| 20160092837 | METHOD AND SYSTEM FOR SUPPLEMENTING JOB POSTINGS WITH SOCIAL NETWORK DATA - The present application present systems and methods for leveraging existing sources of information to supplement and enhance job opening postings and other types of business postings. A plurality of sources, including social network sites, talent profiles, and/or surveys and questionnaires are accessed in order to retrieve data relating to a business object. The retrieved data is transformed, such that it may be used to supplement job opening postings and other types of postings with job description data, work culture data, and other business-related data in order to build a social brand for the business. | 03-31-2016 |
| 20160092818 | METHOD AND SYSTEM FOR IMPLEMENTING AN ADAPTIVE DATA GOVERNANCE SYSTEM - Disclosed is a method, system, and computer program product for implementing adaptive business workflows, where the context is coordinated with a hierarchy. The adaptive workflow may include conditional stages that are also coordinated with the hierarchy. | 03-31-2016 |
| 20160092554 | METHOD AND SYSTEM FOR VISUALIZING RELATIONAL DATA AS RDF GRAPHS WITH INTERACTIVE RESPONSE TIME - Systems and methods for visualizing relational data as RDF graphs in order to explore connections between data in the relational schema. The relational data is first converted into an initial RDF graph. Referential constraints between tables in the relational data, including unasserted referential constraints and pseudo-referential constraints, are automatically detected and used to augment the RDF graph. In addition, datatype properties in the RDF graph may be folded into annotation objects for better visualization. The resulting graph may be an edge-node graph, with edges corresponding to referential constraints between nodes corresponding to relational table rows. | 03-31-2016 |
| 20160092552 | METHOD AND SYSTEM FOR IMPLEMENTING EFFICIENT CLASSIFICATION AND EXPLORATION OF DATA - Disclosed is a system, method, and computer program product for analyzing sets of data in an efficient manner, such that analytics can be effectively performed over that data. Classification operations can be performed to generate groups of similar log records. This permits classification of the log records in a cohesive and informative manner. | 03-31-2016 |
| 20160092551 | METHOD AND SYSTEM FOR CREATING FILTERS FOR SOCIAL DATA TOPIC CREATION - Disclosed is a system, method, and computer program product for performing semantic analysis and creating topics with regards to social data. A user interface is provided that allows the user to view and interact with to view and control the process/mechanism or creating topics. The user interface allows the user to create one or more text-based filters and metadata filters based on which social data for each topic is filtered. | 03-31-2016 |
| 20160092535 | METHOD AND SYSTEM FOR IMPLEMENTING A UNIFIED DB CLONE SYSTEM - Disclosed are a system, method, and computer program product for a unified system for implementing clones. The unified system includes the appropriate infrastructure to create, maintain, and administer clones and supporting data sources in the computing environment. In addition, a user interface is provided that is capable of visually displaying relationships and lineages of sources and clones in the system. The user interface provides functionality to select any given object, and to trace its parent-child relationships to highlight its related parent and/or child source/clone. | 03-31-2016 |
| 20160092516 | METRIC TIME SERIES CORRELATION BY OUTLIER REMOVAL BASED ON MAXIMUM CONCENTRATION INTERVAL - A correlation relationship between two metric time series is determined after removing the impact of outlying metric values (“outliers”) that are unimportant for analytical purposes. Each of the metric time series can represent values of different system metrics obtained by mining data gathered through the monitoring of cloud deployments. The outliers can be determined based on a maximum concentration interval of the data. Removing the impact of the outliers enhances the correlation of the metric time series and provides a better representation of the correlation relationship. | 03-31-2016 |
| 20160092499 | OBJECT MAPPING USING INTRINSIC PERSISTENCE METADATA AND PATTERN-BASED RULES FOR MAPPING TRANSFORMATION - The present disclosure relates generally to a data integration system that may provide techniques for capturing definitions from business entities and how the business entities are implemented in a set of tables. This enables the data integration system to transform a data flow defined using business entities into code that may be used to transform the underlying tables and columns. Additionally to generate tables, classes and APIs to provide persistence of and manipulation for the definitions of these business entities. Additionally to dynamically generate a GUI editor for an object model of arbitrary complexity while maintaining GUI usability. This reduces development time and supports editing of an arbitrary object model. A dynamically generated GUI may be generated from an object model definition that is received from a user and/or is derived from the user's code. | 03-31-2016 |
| 20160092487 | CONCURRENT MULTIPLE HIERARCHICAL DATA STRUCTURES WITH CONSISTENT DATA - A method may include maintaining first data structure with records organized in a first hierarchy, and maintaining a second data structure with records organized in a second hierarchy. The method may also include receiving a first change request for a value stored in a first record. The first change request may be received from a parent in the first data structure of the first record. The method may additionally include changing the first value according to the first change request, and receiving a second change request for the value stored in the first record. The second change request may be received from a parent in the second data structure of the first record. The method may further include sending a notification to the parent in the first data structure that the parent in the second data structure is attempting to change the first record. | 03-31-2016 |
| 20160092443 | ELECTRONIC PRESENTATION REPOSITORY AND INTERFACE - Embodiments of the invention include techniques for storing and managing repositories of electronic presentation documents. Presentation storage repositories may be implemented in various storage systems including individual computer servers, distributed storage networks, cloud-based storage systems, and the like. Presentation search interfaces may support various searching and customization capabilities. Search interface and search engine components may be implemented to receive search requests from client devices, retrieve electronic presentation data from one or more storage repositories, and generate customized search results based on the retrieved electronic presentation data. Search and presentation capabilities may include storing user-specific selections of presentation cover slides, and then retrieving and/or generating user-specific thumbnails for search results interfaces. Additionally, presentation access and usage statistics may be tracked and stored within the storage repository and may be incorporated into the customized searching and presentation capabilities. | 03-31-2016 |
| 20160092295 | ADAPTIVE APPLICATION LOGGER - Embodiments of the invention provide systems and methods for logging of messages in a development environment. More specifically, embodiments of the present invention provide dynamically adaptive logging of runtime messages generated by an application. These embodiments provide a way to handle the volume of information stored in the logs by dynamically changing the severity associated with generated messages based on previous code path execution. Embodiments can use a set of metrics to replace the usual static log level associated with the code by the developer. For example, such metrics can include but are not limited to a cost-based (storage volume on disk), an exception-based (weight increase in catch block), and/or a crowd-based (community can vote down noise). As a result, embodiments can provide more detailed information when the error is recurring for a particular user but without generating so much information as to make the log difficult to use. | 03-31-2016 |
| 20160092265 | Systems and Methods for Utilizing Futures for Constructing Scalable Shared Data Structures - A multithreaded application that includes operations on a shared data structure may exploit futures to improve performance. For each operation that targets the shared data structure, a thread of the application may create a future and store it in a thread-local list of futures (under weak or medium futures linearizability policies) or in a shared queue of futures (under strong futures linearizability policies). Prior to a thread evaluating a future, type-specific optimizations may be performed on the list or queue of pending futures. For example, futures may be sorted temporally or by key, or multiple operations indicated in the futures may be combined or eliminated. During an evaluation of a future, a thread may compute the results of the operations indicated in one or more other futures. The order in which operations take effect and the optimization operations performed may be dependent on the futures linearizability policy. | 03-31-2016 |
| 20160092245 | DATA RICH TOOLTIP FOR FAVORITE ITEMS - Embodiments of the present invention can comprise a data rich tooltip or other graphical or textual preview of a selected object of interest. This preview can provide the user with additional information about the object so that the user does not need to waste time opening multiple objects or records in order to find the desired one. Instead, the summary view can provide enough information that the user does not need to open the record; the tooltip has the information that they want to know about the item. According to one embodiment, the summary view can be generated for each record based on a pre-configured template. Content presented in the summary view can be defined by the template and may be text about the object (e.g., object field values), about other related objects, images, or other information that would help the user find the desired object without opening it. | 03-31-2016 |
| 20160092036 | RECASTING A FORM-BASED USER INTERFACE INTO A MOBILE DEVICE USER INTERFACE USING COMMON DATA - A method, system, and computer program product for mobile device interface generation. Embodiments commence upon receiving electronic communication comprising form metadata describing a user interface form. The form metadata comprises one or more field identifiers, which fields of the user interface form are bound to JSON messages (e.g., to receive field data). The form metadata further describes data types pertaining to the form fields, and the data types pertaining to the fields are used to select one or more user interface screen devices from a repository. One or more of the user interface screen devices are associated (e.g., bound) to occurrences of the same JSON message as were bound to fields of the user interface form. The selected one or more interface screen devices are output in a format of data that describes the selected interface screen devices in a manner for deployment on corresponding a mobile device or devices. | 03-31-2016 |
| 20160091565 | CYCLE DETERMINISTIC FUNCTIONAL TESTING OF A CHIP WITH ASYNCHRONOUS CLOCK DOMAINS - Implementations of the present disclosure involve an apparatus and/or method for performing cycle deterministic functional testing of a microprocessor or other computing design with one or more asynchronous clock domains. In general, the method/apparatus involves utilizing an observe bus within the microprocessor design to funnel data from within the chip design to an output bus. In addition, to ensure that the output from the chip is synchronized to a tester clock, the observe bus may feed the information from the observe bus to one or more first-in first-out (FIFO) data buffers. During testing, the data stored in the data buffers may be provided to the output pins of the chip at a rate synchronized to the tester clock such that the output appears to the testing apparatus as being cycle deterministic. Further, one or more mechanisms may be employed within the observe bus or circuit design to control the rate of input of data into the data buffers. | 03-31-2016 |
| 20160089606 | GAMIFICATION PLATFORM - Systems to gamify a data processing application using auditing data. Processing commences upon accessing electronic records comprising a set of application auditing specifications that identify one or more transaction types to be executed by a data processing application. Certain transactions corresponding to the identified transaction types are observed by an auditing facility during operation of the data processing application. At least some of the identified transaction types and measured audit parameters corresponding to the transactions are recorded. A gamification module associates the measured audit parameters with game parameters. Motivational imagery such as a scoreboard is generated for display. | 03-31-2016 |
| 20160088464 | Managing Selection and Triggering of Applications on a Card Computing Device - A card computing device may include and manage multiple virtualized universal integrated circuit cards (UICCs) for use with mobile communications. The card computing device may be capable of storing information, and executing applications, for multiple mobile networks (e.g., using multiple virtual UICCs) and of managing switches among those mobile networks. A mobile network operator (MNO) may be represented by a MNO profile, which, when enabled, may look and behave like a dedicated UICC. One or more applications may be deployed on the card computing device and each may be associated with a MNO profile. When a MNO profile is enabled, one or more applications may be activated and when a MNO profile is disabled, one or more active applications may be deactivated, according to some embodiments. Thus, a card computing device may be configured to activate and deactivate applications as part of managing MNO profiles. | 03-24-2016 |
| 20160088023 | SERVICES WITHIN REVERSE PROXY SERVERS - Embodiments of the invention provide techniques for processing messages transmitted between computer networks. Messages, such as requests from client devices for web services and other web content may be transmitted between multiple computer networks. Intermediary devices or applications such as proxy servers may receive, process, and transmit the messages between the communication endpoints. In some embodiments, a reverse proxy server may be configured to dynamically generate Representational State Transfer (REST) services and REST resources within the reverse proxy server. The REST services and REST resources within the reverse proxy server may handle incoming requests from client devices and invoke backend web services, thereby allowing design abstraction and/or enforcement of various security policies on the reverse proxy server. | 03-24-2016 |
| 20160088022 | PROXY SERVERS WITHIN COMPUTER SUBNETWORKS - Embodiments of the invention include techniques for processing messages transmitted between computer networks. In some embodiments, messages such as requests and responses for various types of web services, applications, and other web content may be transmitted between multiple computer networks. One or more intermediary devices or applications, such as a proxy server implemented within a physical or logical subnetwork, may receive, process, and transmit the messages between the communication endpoints. In some embodiments, a proxy server may be configured to operate within a subnetwork of an internal computer network, exposing various web applications and/or services of the internal computer network to external computer networks. Such a proxy server may select specific policies for processing messages based on various message characteristics and the current point in a predetermined processing flow for the message. After selecting the specific policies to be applied to the message, the proxy server may process the message in accordance with the policies and forward the message to its intended destination. | 03-24-2016 |
| 20160087955 | GENERIC SERVER FRAMEWORK FOR DEVICE AUTHENTICATION AND MANAGEMENT AND A GENERIC FRAMEWORK FOR ENDPOINT COMMAND DISPATCH - Methods, devices, and systems are described for enrolling a user's bring-your-own-device for secure connection to a company's enterprise computer network. From her mobile device, user clicks on a uniform resource locator (URL) to connect with the login web page on the enterprise network. After authentication, checks are performed to verify that the user has authorization to enroll the type of electronic device, and the profile is installed on the device. A notification is sent to the device by a server on the enterprise network, and a secure workspace application is pushed to the device along with configuration data that automatically links the workspace with the parent device enrollment. Once the user launches the secure workspace application the workspace access configuration data and initializes enrollment with the enterprise network, resulting in a linking of the secure workspace application with its parent device enrollment. The workspace is registered as a child of the parent device, and the lifecycle of the workspace is thus linked to that of the parent. | 03-24-2016 |
| 20160087953 | METHOD TO MODIFY ANDROID APPLICATION LIFE CYCLE TO CONTROL ITS EXECUTION IN A CONTAINERIZED WORKSPACE ENVIRONMENT - Methods, devices, and systems are described to modify the life cycle of a Google Android® application, in its application manifest file and byte code, such that the execution of the application can be controlled via policies and security governed by a workspace application installed on an Android-based device. Dummy wrapper classes are inserted into the byte code for network and I/O system calls that call security code before calling the original classes. | 03-24-2016 |
| 20160087902 | FLOW TO PORT AFFINITY MANAGEMENT FOR LINK AGGREGATION IN A FABRIC SWITCH - Implementations of the present disclosure involve an apparatus, device, component, and/or method for a hardware efficient flow to port affinity management table for link aggregation for a network fabric switch with Ethernet Gateway functionality. Rather than maintaining a state per traffic flow list, the present disclosure utilizes a handle or hash value derived from the traffic flow and associates an output port state to the hash value. The output port state for the hash value is further associated with a portlist that is based on at least a traffic flow policy of the server or group of servers associated with the traffic flow. In addition, the management table may be adjusted based on state changes to one or more of the output ports such that, if a port becomes unavailable, the management table may be adjusted to account for the unavailability of the port. | 03-24-2016 |
| 20160080524 | MOBILE RUNTIME CONDITIONAL SECTIONS FOR SURVEYS - Embodiments of the invention provide for dynamically generating an interface including conditional content based on runtime variables related to the device on which the content will be presented. Embodiments provide for creating and using runtime variables for showing or hiding data, depending on the type of device that the interface is accessed from. In other words, embodiments allow a designer of the interface to define conditional sections within the interface and the conditions, i.e., values of the runtime variables, upon which those section should be included or excluded from the interface. Based on the definition of these sections and the runtime values of variables associated with those sections, e.g., variables representing a device type, application type, mode, etc. of a client device on which the content will be presented, embodiments can provide an interface tailored to be presented on that type of device. | 03-17-2016 |
| 20160078557 | SETUP OF A COMPUTER SYSTEM THAT EXECUTES AN ACCOUNTING PROGRAM - Setup of accounts in accounting software is automated, based on user input on (1) a name of an account of a specific type, and (2) a specific value to be used to identify the account uniquely, among other accounts of the specific type. The account's name is used by one or more computers to automatically look up N unique values that identify N entities of an organization. Then, a pattern of segments that defines an account identifier is automatically used by the one or more computers, to insert into the pattern the specific value and each of the N unique values, to obtain N account identifiers. Thereafter, N tuples are automatically formed by the one or more computers and stored in a table, each tuple comprising one of the N account identifiers, and the account's name. Subsequently, N accounts are setup in the accounting program, based on the N tuples. | 03-17-2016 |
| 20160078015 | REPRESENTATION OF DATA RECORDS IN GRAPHIC TABLES - Various arrangements for creating a pivot table are presented. A set of stored records may be accessed. A plurality of stored records from the set of stored records may be selected to be represented in a plurality of cells of the pivot table. A graphical representation may be generated for display for each stored record of the plurality of stored records. Each graphical representation may be generated for display within a cell of the plurality of cells of the pivot table. Each graphical representation of the pivot table is actively linked with the corresponding stored record. | 03-17-2016 |
| 20160072255 | MULTIPLE-WAVELENGTH LASER - In a multiple-wavelength laser source, a multiple-mode laser outputs a set of wavelengths in a range of wavelengths onto an optical waveguide, where a spacing between adjacent wavelengths in the set of wavelengths is smaller than a width of channels in an optical link. Furthermore, a set of ring-resonator filters in the multiple-wavelength laser source, which are optically coupled to the optical waveguide, output corresponding subsets of the set of wavelengths for use in the optical link based on free spectral ranges and quality factors of the set of ring-resonator filters. These subsets may include one or more groups of wavelengths, with another spacing between adjacent groups of wavelengths that is larger than the width of the given channel in the optical link. In addition, the one or more groups of wavelengths may include one or more wavelengths, with the spacing between adjacent wavelengths in the given group of wavelengths. | 03-10-2016 |
| 20160071233 | Graph Processing Using a Mutable Multilevel Graph Representation - A mutable multilevel data structure representing a graph structure may include multiple read-only levels and a single writable level. Each read-only level may include a vertex table (which includes references to edge tables on the same level or a different level containing elements of adjacency lists for some vertices) and an edge table (which includes elements of adjacency lists that changed since the previous read-only level). A hybrid variant may switch between a performance-optimized variant (whose edge tables include complete adjacency lists for vertices whose edge sets were modified) and a space-optimized variant (whose edge tables include only newly added adjacency list elements). The vertex tables and/or the writable level may be implemented using copy-on-write arrays, each including an indirection table and multiple fixed-sized data pages. Computations may be run on the read-only levels or on the writable level and read-only levels. | 03-10-2016 |
| 20160063442 | USING AN EMPLOYEE DATABASE WITH SOCIAL MEDIA CONNECTIONS TO CALCULATE JOB CANDIDATE REPUTATION SCORES - Systems for using social media sites in recruiting activities. Potential candidates for job openings are considered using computer-implemented analysis of an online social referral graph and a rule base. Content from one or more social data sources is retrieved and analyzed to identify potential candidates for a job opening. The potential candidate's social data comprises information used as a reputation score pertaining to the potential candidate and as a reputation score pertaining to the potential candidate's social connections. An employee database is cross referenced to find a match between employees and any of the potential candidate's social connections. A referral score based on an influence contribution measure, a clout contribution measure, a generosity contribution measure, an activity contribution measure, an impact contribution measure, or an engagement contribution measure is calculated. When the reputation score and/or the referral score meets or exceeds a threshold, the potential candidate is considered for outreach. | 03-03-2016 |
| 20160062894 | System and Method for Performing Message Driven Prefetching at the Network Interface - Each computing node of a distributed computing system may implement a hardware mechanism at the network interface for message driven prefetching of application data. For example, a parallel data-intensive application that employs function shipping may distribute respective portions of a large data set to main memory on multiple computing nodes. The application may send messages to one of the computing nodes referencing data that is stored locally on the node. For each received message, the network interface on the recipient node may extract the reference, initiate the prefetching of referenced data into a local cache (e.g., an LLC), and then store the message for subsequent interpretation and processing by a local processor core. When the processor core retrieves a stored message for processing, the referenced data may already be in the LLC, avoiding a CPU stall while retrieving it from memory. The hardware mechanism may be configured via software. | 03-03-2016 |
| 20160062818 | TRAFFIC CAPACITY BASED OPTIMIZATION OF SOA FAULT RECOVERY USING LINEAR PROGRAMMING MODEL - Various embodiments are presented for bulk recovery or faults in a service oriented architecture system. The number of faults submitted for recovery is determined based on the capacity of the system. A linear programming model is used to determine the maximum recovery capacity of the system. The maximum recovery capacity is configured to be below the capacity of the system. | 03-03-2016 |
| 20160062796 | Systems and Methods for Adaptive Integration of Hardware and Software Lock Elision Techniques - Particular techniques for improving the scalability of concurrent programs (e.g., lock-based applications) may be effective in some environments and for some workloads, but not others. The systems described herein may automatically choose appropriate ones of these techniques to apply when executing lock-based applications at runtime, based on observations of the application in the current environment and with the current workload. In one example, two techniques for improving lock scalability (e.g., transactional lock elision using hardware transactional memory, and optimistic software techniques) may be integrated together. A lightweight runtime library built for this purpose may adapt its approach to managing concurrency by dynamically selecting one or more of these techniques (at different times) during execution of a given application. In this Adaptive Lock Elision approach, the techniques may be selected (based on pluggable policies) at runtime to achieve good performance on different platforms and for different workloads. | 03-03-2016 |
| 20160055546 | MANAGING PROGRESSIVE STATISTICAL IDS - A method, system, and computer program product for managing user identification codes in an internet advertising environment. One aspect implements a system including a database engine to store a plurality of signals comprising characteristics and/or values received from a user device. A user ID generator calculates collision statistics and/or fragmentation statistics to form a first mapping function that is in turn used to generate a plurality of identification codes based at least in part a first set of selected signals. A calibration module produces measurements determined from collision quantities and/or fragmentation quantities using the first mapping function, wherein the measurements are determined by comparing the plurality of identification codes to entries in a known ID database. A sequencing module generates updated sequences of mapping functions. | 02-25-2016 |
| 20160055542 | EXTENDING AUDIENCE REACH IN MESSAGING CAMPAIGNS USING SUPER PROFILES - A server receives incoming data records comprising an ID value and respective user attributes corresponding to a user activity that originates at a user device. Characteristics of the activity and/or characteristics of the user device are considered in order to assign a probabilistic confidence value, which is in turn used to generate links from an incoming data record to other previously-received data records, and in so doing, generates a probabilistic link between one set of user attributes from the incoming data record and another set of user attributes from previously-received data records. A messaging campaign specification that describes target user attributes is used to identify a matching set of target audience member records. The determination of a match or not is based on the probabilistic confidence value and a threshold can be varied to extend audience reach. The identified set of target audience member records are transmitted over a network. | 02-25-2016 |
| 20160055540 | TUNABLE STATISTICAL IDS - A method, system, and computer program product for managing user identification codes in an internet advertising environment. One aspect implements a system including a database engine to store a plurality of signals comprising characteristics and/or values received from a user device. A user ID generator calculates collision statistics and/or fragmentation statistics to form a first mapping function that is in turn used to generate a plurality of identification codes based at least in part a first set of selected signals. A calibration module produces measurements determined from collision quantities and/or fragmentation quantities using the first mapping function, wherein the measurements are determined by comparing the plurality of identification codes to entries in a known ID database. A sequencing module generates updated sequences of mapping functions. | 02-25-2016 |
| 20160055527 | EXTENDING AUDIENCE REACH IN MESSAGING CAMPAIGNS USING PROBABILISTIC ID LINKING - A server receives incoming data records comprising an ID value and respective user attributes corresponding to a user activity that originates at a user device. Characteristics of the activity and/or characteristics of the user device are considered in order to assign a probabilistic confidence value, which is in turn used to generate links from an incoming data record to other previously-received data records, and in so doing, generates a probabilistic link between one set of user attributes from the incoming data record and another set of user attributes from previously-received data records. A messaging campaign specification that describes target user attributes is used to identify a matching set of target audience member records. The determination of a match or not is based on the probabilistic confidence value and a threshold can be varied to extend audience reach. The identified set of target audience member records are transmitted over a network. | 02-25-2016 |
| 20160055262 | MULTIDIMENSIONAL SPATIAL SEARCHING FOR IDENTIFYING DUPLICATE CRASH DUMPS - A method of identifying duplicate crash dumps in a computer system may include receiving a first crash dump caused by an application crash, extracting a first function signature of a function that caused the first crash dump, and searching a datastore of crash dumps for function signatures that substantially match the first function signature. The searching may include performing an approximate string-match between each of the function signatures the first function signature and performing an exact string match between each of the function signatures and the first function signature. The searching may also include combining weighted results of the approximate string-match with weighted results of the exact string match to generate match scores for each of the function signatures, and identifying the function signatures that substantially match the first function signature based on the match scores. | 02-25-2016 |
| 20160055209 | FLEXIBLE AUTHENTICATION FRAMEWORK - A flexible and extensible architecture allows for secure searching across an enterprise. Such an architecture can provide a simple Internet-like search experience to users searching secure content inside (and outside) the enterprise. The architecture allows for the crawling and searching of a variety of sources across an enterprise, regardless of whether any of these sources conform to a conventional user role model. The architecture further allows for security attributes to be received at query time, for example, in order to provide real-time secure access to enterprise resources. The user query also can be transformed to provide for dynamic querying that provides for a more current result list than can be obtained for static queries. | 02-25-2016 |
| 20160055043 | PATTERN ANALYSIS FOR TRIAGING MEMORY LEAKS - A method of analyzing out-of-memory errors may include receiving a memory dump generated in response to an out-of-memory error, receiving an identification of an object class in the memory dump as a leak suspect that may be responsible for the out-of-memory error, matching the leak suspect with an analysis pattern specific to the object class, and extracting usage information from the memory dump using the analysis pattern. | 02-25-2016 |
| 20160048317 | METHOD AND SYSTEM FOR IMPLEMENTING A CUSTOM WORKSPACE FOR A SOCIAL RELATIONSHIP MANAGEMENT SYSTEM - Disclosed is a system, method, and computer program product for implementing a marketing automation tool that provides an improved approach for an integrated and/or customized workspace for a social relationship management system. The present invention provides a mechanism to allow the user of a SRM system to configure a workspace for the SRM product, to choose the specific functionality from the SRM suite to be displayed and executed for the user and to post a message while simultaneously viewing the workspace. | 02-18-2016 |
| 20160042762 | DETECTION OF LOGICAL CORRUPTION IN PERSISTENT STORAGE AND AUTOMATIC RECOVERY THEREFROM - A method, system, and computer program product for restoring blocks of data stored at a corrupted data site using two or more mirror sites. The method commences by receiving a trigger event from a component within an application server environment where the trigger event indicates detection of a corrupted data site. The trigger is classified into at least one of a plurality of trigger event types, which trigger event type signals further processing for retrieving from at least two mirror sites, a first stored data block and a second stored data block corresponding to the same logical block identifier from the first mirror site. The retrieved blocks are compared to determine a match value, and when the match value is greater than a confidence threshold, then writing good data to the corrupted data site before performing consistency checks on blocks in physical or logical proximity to the corrupted data site. | 02-11-2016 |
| 20160042289 | SYSTEMS AND METHODS FOR ADAPTIVE THRESHOLDING USING MAXIMUM CONCENTRATION INTERVALS - Aspects of the present disclosure provide a generic and adaptive approach to adaptive thresholding by using a maximum concentration interval of data to determine one or more adaptive thresholds for any type of operational metric. The generated adaptive thresholds and operational metrics may be used to calculate or otherwise perform a statistical analysis that provides a confidence-level for any changes detected in the operational metric behavior. | 02-11-2016 |
| 20160041843 | INVOCATION OF WEB SERVICES BASED ON A POLICY FILE INCLUDING PROCESSES OF WORKFLOW ASSOCIATED WITH USER ROLES - Techniques for orchestrating workflows are disclosed herein. In an embodiment, a method of orchestrating a workflow is disclosed. In an embodiment, data is stored in a policy file which associates attributes with processes. User input is received. A process associated with an attribute is selected, where the attribute is based on the user input. The selected process is performed as part of the workflow. Also, processes may be added dynamically as part of any category inside the policy file without having to recompile or redesign the logic of the BPEL project. | 02-11-2016 |
| 20160036977 | DYNAMIC SELECTION OF OPTIMUM CUSTOMER ENGAGEMENT CHANNEL - Embodiments of the invention provide systems and methods for handling a customer contact in a Customer Relationship Management (CRM) system by defining one or more channel models, each channel model mapping one or more contact purposes or one or more contact types to one or more of the plurality of channels. Real-time information about a received customer contact can be collected and one or more of a plurality of channels can be selected to handle the customer contact based at least in part on a predictive analysis of the collected real-time information. A contact purpose or a contact type for the received customer contact can be determined based on the collected real-time information. In such cases, selecting one or more of the plurality of channels can be further based on the determined contact purpose or contact type for the received customer contact and the defined one or more channel models. | 02-04-2016 |
| 20160036911 | POWER AND NETWORK TRAFFIC OPTIMIZATION IN COMMUNICATION SYNCHRONIZATION - A method of syncing emails between an email server and a client device may include storing a plurality of emails for a user account. The method may also include receiving a request to sync emails between the email server and the client device. The request may include one or more discrete time intervals. The method may additionally include selecting, from the plurality of emails, emails associated with the one or more discrete time intervals. The method may further include sending at least some of the emails associated with the one or more time discrete intervals to the client device. | 02-04-2016 |
| 20160036733 | PACKET QUEUE DEPTH SORTING SCHEME FOR SWITCH FABRIC - Implementations of the present disclosure involve an apparatus and/or method for an efficient packet queue depth sorting scheme for a ‘longest queue first’ based switch fabric device. In general, the sorting scheme compares a data queue length on an incoming port to a sorted queue of available ports based on longest queue. Based at least on the results of the comparison of the data queue length on the input port, a port designator is inserted into a re-sorted longest queue available port list in the proper position based on the incoming or outgoing port data length. The remaining entries are then sorted around the inserted port designator. Because the comparison and insertion of the port designator can occur in one clock cycle of the switch fabric device, efficiency of the switch is improved. | 02-04-2016 |
| 20160036731 | VIRTUAL OUTPUT QUEUE LINKED LIST MANAGEMENT SCHEME FOR SWITCH FABRIC - Implementations of the present disclosure involve an apparatus, device, component, and/or method for a virtual output queue linked list management scheme for a high-performance network switch. In general, the linked list management scheme utilizes one or more look-ahead links associated with one or more descriptors in the linked list of descriptors that describe the storage of the incoming data packets to the switch. The look-ahead links allow the switch to schedule reads of memory locations included in the descriptors at the same speed at which the data packets are stored in memory. | 02-04-2016 |
| 20160036587 | Secure Key Derivation Functions - Secure key derivation within a virtualized execution environment may involve a key derivation module executing within a platform layer of the execution environment. An application executing within an application layer of the execution environment may access the key derivation module in order to generate a cryptographic key according to a key derivation function. Instead of being returned to the application, the derived key may be stored within a secure storage area of the execution environment without being stored, even temporarily in the application layer, or other non-secure areas, of the execution environment. The application may receive a reference to the derived key usable by other cryptographic processes. The application may pass the key reference to a method of a cryptographic module and the cryptographic module may use the key reference to access the derived key from the secure storage for use in performing any of various cryptographic processes. | 02-04-2016 |
| 20160034961 | DELIVERING GEO-CONTEXT INFORMATION TO A MOBILE DEVICE BASED ON PREDICTED MOBILE DEVICE LOCATIONS - A server communicates with a mobile device to deliver a mobile application to the mobile device. Software instructions of the mobile application are executed on the mobile device. Then, responsive to operations of the software instructions on the mobile device, the mobile device sends messages comprising location data such as GPS data or other location point attributes. The server receives the location data describing the location of the mobile device and performs logic and computations to determine predicted location points, which are in turn used to determine predicted regions or areas surrounding the predicted location points. The server selects geo-specific notifications (e.g., advertisements, coupons, etc.) based at least in part on the predicted region, and transmits the geo-specific notifications electronically through the network to the mobile device. The notifications are determined based on geo-specific predictions, geo-specific rules, geo-specific triggers, geo-specific user data, geo-specific promotional data, and/or geo-specific context data. | 02-04-2016 |
| 20160034714 | APPARATUS AND METHOD FOR DATA MATCHING AND ANONYMIZATION - A method includes receiving a plurality of data sets. Each data set includes a customer identifier field specifying a unique customer identifier associated with each entry in each data set. The plurality of data sets includes a first group of data sets and a second group of data sets. The method further includes storing the plurality of data sets, and generating a key map including the customer identifier field including unique customer identifiers of the first group of data sets of the plurality of data sets, and an anonymous identifier field including unique anonymous identifiers. Each anonymous identifier corresponds to a customer identifier of the key map. The method further includes replacing each unique customer identifier in the second group of data sets with the corresponding anonymous identifier. | 02-04-2016 |
| 20160034571 | METHOD AND SYSTEM FOR IMPLEMENTING ALERTS IN SEMANTIC ANALYSIS TECHNOLOGY - Disclosed is an approach for allowing an entity to perform semantic analysis upon data associated with an entity, and to automatically perform categorization of that data and to generate alerts based on a set of predefined rules. A topic is created based on which to categorize a set of semantically analyzed messages. A set of rules is defined, wherein an alert is generated when the set of rules is satisfied for the semantically analyzed messages. | 02-04-2016 |
| 20160034560 | METHOD AND SYSTEM FOR SECURELY STORING PRIVATE DATA IN A SEMANTIC ANALYSIS SYSTEM - Disclosed is an approach for allowing an entity to perform semantic analysis in a SaaS semantic analysis platform upon private data possessed by one or more entities. In one or more embodiments, separate processing pipelines may be provided to the plurality of entities thereby keeping private data secure within the semantic analysis platform. In one or more embodiments, a common processing pipeline is provide with data associated a first entity being assigned a first identification code, and data associated with a second entity being assigned a second identification code. | 02-04-2016 |
| 20160034445 | METHOD AND SYSTEM FOR IMPLEMENTING SEMANTIC TECHNOLOGY - Disclosed is an approach for allowing an entity to perform semantic analysis upon private data possessed by an enterprise, and to automatically perform categorization of that data for processing within the enterprise. A semantic API can be provided to allow the enterprise to provide the private data to a sematic analysis system, even when the semantic analysis system is configured as a multi-tenant system that handles other items of public or private data. A rules-based routing architecture may be provided to facilitate analysis and routing of analyzed messages to the appropriate destination within the organization. | 02-04-2016 |
| 20160034443 | METHOD AND APPARATUS FOR DISPLAYING DATA GRIDS - A system and method for facilitating displaying data in a table via a web-based data grid. The example method includes rendering a first table and then rendering a second table via a layer overlaid on the first table. The second table replicates a user selected portion of the first table. In a specific embodiment, the example method further includes providing a first user option to horizontally scroll the first table. One or more columns of the second table remain static in response to horizontal scrolling of the first table. A second user option enables vertical scrolling of the first table. Vertical scrolling of the first table causes concurrent vertical scrolling of the second table. A third user option enables repositioning of the second table relative to the first table. The first table and overlaid second table, called the frozen section, may be implemented via client-side scripting. | 02-04-2016 |
| 20160034328 | SYSTEMS AND METHODS FOR SPATIALLY DISPLACED CORRELATION FOR DETECTING VALUE RANGES OF TRANSIENT CORRELATION IN MACHINE DATA OF ENTERPRISE SYSTEMS - Aspects of the present disclosure include systems and/or methods for detecting ranges of data that represent transient correlations in machine data corresponding to various hardware and/or software systems, such as enterprise systems employed by an information technology (“IT”) organization. In various aspects, the machine data may comprise one or more operational metrics that represent system performance, usage, and/or business activity of the enterprise system. The operational metrics may be used to identify operational issues within the enterprise system. | 02-04-2016 |
| 20160034014 | DIGITAL VOLTAGE DROOP MONITOR WITH CLOCK JITTER ADJUSTMENT - Implementations of the present disclosure involve a system and/or method for measuring on-die voltage levels of an integrated circuit through a digital sampling circuit. In particular, the system and/or method utilize a delay line based analog-to-digital sampling circuit that produces a voltage reading over time, such as at every high frequency clock cycle. In one embodiment, the digital sampling circuit may include a clock jitter monitor circuit configured with a constant supply voltage. This clock jitter monitor is configured to measure the clock jitter that is experienced by the digital voltage monitor circuit and, when compared to measured voltage captured by the circuit, may be used to calibrate or otherwise correct the readings provided by the digital voltage monitor circuit. | 02-04-2016 |
| 20160033576 | HIGH SENSITIVITY DIGITAL VOLTAGE DROOP MONITOR FOR INTEGRATED CIRCUITS - Implementations of the present disclosure involve a system and/or method for measuring on-die voltage levels of an integrated circuit through a digital sampling circuit. In particular, the system and/or method utilize a delay line based analog-to-digital sampling circuit that produces a voltage reading over time, such as at every high frequency clock cycle. In one embodiment, the digital sampling circuit or digital voltage monitor circuit includes a coarse delay component or circuit that further delays the propagation of a clock signal through the delay line. The coarse delay circuit may be programmed to delay the propagation of the signal through the delay line in such a manner as to allow for multiple edges of a clock or test signal to travel simultaneously down the delay line and increase the sensitivity of the circuit. Additional sensitivity of the digital voltage monitor circuit may also be obtained through selection of the types of components that comprise the circuit and a clock jitter monitor circuit configured with a constant supply voltage. | 02-04-2016 |
| 20160028688 | ON-PREMISES AGENT FOR MOBILE CLOUD SERVICE - Systems, devices, and methods are disclosed for an agent device within a company's network firewall to initiate an HTTP connection with a cloud-based gateway and then upgrade the connection to a WebSockets protocol in order to have an interactive session. Over this interactive session, a mobile device, which connects to the cloud-based intermediary, can request data from servers inside the company's firewalls. Because the firewall is traversed using HTTP protocols (with WebSockets), it can be as safe as letting employees browse the web from inside the company's network. | 01-28-2016 |
| 20160026963 | FUNCTIONING OF A COMPUTER SYSTEM THAT FACILITATES DISTRIBUTION OF WORK - A request is transmitted to a computer operated by an approver, to respond with approval or disapproval for an employee to work on a project, before a bid identifying that employee can be accepted. Requests for approval or disapproval are transmitted based on one or more employees identified in a bid, by looking up a database, to identify the approver of each employee. To facilitate the look up, each employee to be identified in a bid is required to have a profile in a set of profiles of employees in an organization. After responses of approval are received for employees identified in bids, those bids are transmitted to a computer operated by a project manager. Obtaining approval(s) before a bid can be accepted increases the likelihood of work being done in a timely manner, thus improving the functioning of a computer system that facilitates distribution of work. | 01-28-2016 |
| 20160020917 | COMMUNICATION GATEWAY SERVICES IN A NETWORKED MESSAGE DISTRIBUTION SYSTEM - Systems for specialized high-performance electronic messaging campaigns using multiple communication partner channels. Electronic messages are sent to a plurality of differing electronic messaging communication systems using a network communication interface component that is configured to interface with individual ones of the plurality of differing electronic messaging communication systems using individualized script files and individualized parameter files. A network communication interface component is initialized with a first set of configuration instructions using a script input port and a parameter input port. The configured network communication interface component sends an electronic message to a first electronic messaging communication system using the first set of configuration instructions. The network communication interface component is initialized using a second set of configuration instructions, after which electronic messages are sent to a second electronic messaging communication system using the second set of configuration instructions. | 01-21-2016 |
| 20160019662 | Methods and Systems for Performing Cost Comparisons - Various arrangements are presented for performing comparisons of indented cost BOM (bill of material) structures of two or more items in a supply chain management system. By understanding the hierarchical nature of the indented cost BOM structure of each item and various nested relationships, it may be possible to perform complex comparisons that involve multi-level structures. | 01-21-2016 |
| 20160019576 | CONTROLLING REAL-TIME EXECUTION OF INTERNET COMMUNICATION CAMPAIGNS WITH PARAMETERIZABLE FLOW CONTROL STRUCTURES - Systems and methods for real-time control of Internet messaging campaigns. Processing commences upon retrieving a computer-readable schematic capture or other computer representation of an Internet messaging campaign or marketing campaign flow. During execution of the campaign flow, decision points in the form of program stage gates as given in the schematic are reached, and corresponding program stage gate expressions are evaluated based on then-current real-time conditions or values. When the program stage gate expression evaluates to one of a set of alternative values (e.g., “take forward path” or “take alternative path1” or “take alternative path2”), then the program execution will initiate a set of execution actions given in the marketing campaign schematic. In cases when then-current real-time conditions or values evaluate to an alternate value or in cases when the real-time conditions or values are not available or cannot be evaluated within a timeout period, then remedial action is initiated. | 01-21-2016 |
| 20160019563 | Cost Impact Simulator and Gross Profit Analyzer - Changes in the supply chain of one product may affect the price and availability of many other products. Likewise, a product may be composed of a number of smaller parts. Changes in the cost or availability of any of the parts that comprise a product may result in changes in cost or availability of the product as well as many other related products. A supply chain analysis engine is used to model a supply chain. The supply chain analysis engine may identify dependencies between products, sub products, and supply chains. The dependencies may be used to analyze the impact of a change in the supply chain on all relevant products. | 01-21-2016 |
| 20160019464 | ADAPTING DIGITAL CONTENT BASED UPON USAGE PATTERNS - Techniques are disclosed for adapting digital content responsive to the manner in which the digital content is consumed by its users or consumers. Certain techniques are disclosed for changing the organization and/or behavior of a document, such as a webpage, in response to user interactions with the document. For example, the manner in which a webpage is consumed by its consumers is monitored and usage patterns determined therefrom. The webpage is then dynamically adapted or modified responsive to the usage patterns. In certain embodiments, the adaptations involve dynamically modifying the organization and/or behavior of the webpage responsive to the usage patterns. Since the usage patterns for different sets of users can be different, the modification made to the document for a first set of users may be different from the modifications made for a second set of users. | 01-21-2016 |
| 20160019309 | MODIFYING DIGITAL CONTENT BASED UPON USAGE PATTERNS - Techniques are disclosed for adapting digital content responsive to the manner in which the digital content is consumed by its users or consumers. Certain techniques are disclosed for changing the organization and/or behavior of a document, such as a webpage, in response to user interactions with the document. For example, the manner in which a webpage is consumed by its consumers is monitored and usage patterns determined therefrom. The webpage is then dynamically adapted or modified responsive to the usage patterns. In certain embodiments, the adaptations involve dynamically modifying the organization and/or behavior of the webpage responsive to the usage patterns. Since the usage patterns for different sets of users can be different, the modification made to the document for a first set of users may be different from the modifications made for a second set of users. | 01-21-2016 |
| 20160019308 | MODIFYING THE ORDER OF ITEMS IN A DIGITAL DOCUMENT BASED UPON USAGE PATTERNS - Techniques are disclosed for adapting digital content responsive to the manner in which the digital content is consumed by its users or consumers. Certain techniques are disclosed for changing the organization and/or behavior of a document, such as a webpage, in response to user interactions with the document. For example, the manner in which a webpage is consumed by its consumers is monitored and usage patterns determined therefrom. The webpage is then dynamically adapted or modified responsive to the usage patterns. In certain embodiments, the adaptations involve dynamically modifying the organization and/or behavior of the webpage responsive to the usage patterns. Since the usage patterns for different sets of users can be different, the modification made to the document for a first set of users may be different from the modifications made for a second set of users. | 01-21-2016 |
| 20160019281 | Interfacing with a Relational Database for Multi-Dimensional Analysis via a Spreadsheet Application - Systems, methods, and computer-readable mediums are presented that may provide for an interface to a relational database. A request may be received for data stored in a relationship database, wherein the request is received from a spreadsheet application. In response to the request for data stored in the relational database, a plurality of tables in the relational database may be accessed to retrieve the data indicated in the request. The retrieved data may be translated from the plurality of tables of the relational database into a format for output to the spreadsheet application. The translated data may be output to the spreadsheet application. | 01-21-2016 |
| 20160019051 | FORCIBLY COMPLETING UPGRADE OF DISTRIBUTED SOFTWARE IN PRESENCE OF FAILURES - One embodiment of the present invention provides a system for facilitating an upgrade of a cluster of servers in the presence of one or more inaccessible nodes in the cluster. During operation, the system upgrades a version of a distributed software program on each of a plurality of nodes in the cluster. The system may detect that one or more nodes of the cluster are inaccessible. The system continues to upgrade nodes in the cluster other than the one or more nodes that were detected to be inaccessible, in which upgrading involves installing and activating a newer version of the distributed software on the nodes being upgraded. The system then upgrades an acting version of the cluster. | 01-21-2016 |
| 20160019043 | AUTOMATIC GENERATION AND EXECUTION OF SERVER UPDATE PROCESSES - A method of updating a plurality of servers may include receiving a plurality of patch requests, receiving a selection of a computing environment from a plurality of computing environments, and selecting patch requests from the plurality of patch requests that are associated with the selected computing environment. The method may also include accessing a configuration for the selected computing environment, and generating patch command scripts for each of the selected patch requests. The patch command scripts may be generated based on the configuration of the selected computing environment and a respective selected patch request. The method may additionally include executing each of the patch command scripts to update the plurality of servers. | 01-21-2016 |
| 20160005073 | SIMULATING ONLINE USER ACTIVITY TO GENERATE AN ADVERTISING CAMPAIGN TARGET AUDIENCE LIST - The present disclosure provides a detailed description of techniques used in methods, systems, and computer program products for simulating user web page visits to generate an advertising campaign target audience list. The claimed embodiments address the problem of efficiently and quickly processing voluminous amounts of user data to enable rapid initiation of an advertising campaign. More specifically, the claimed embodiments are directed to approaches for a receiving user web page visit records (e.g., user ID, URL, timestamp, etc.), preparing batches of the visit records, and iterating through the batches of visits to simulate a user's re-visit to the web page. The simulated user visits and associated user attributes (e.g., from on line and off line activities) can then be tested against advertising campaign specifications to generate a target audience list. | 01-07-2016 |
| 20160004737 | RESOLVING IN-MEMORY FOREIGN KEYS IN TRANSMITTED DATA PACKETS FROM SINGLE-PARENT HIERARCHIES - A web service interface may receive a web service request that describes multiple objects. Each of the multiple objects may be associated with a common object, such as in a parent-child relationship. The web service can identify the common object and the multiple relationships between objects, and instead of creating duplicate versions of the common object, the web service can create a single record representing the common object in, for example, a database. Records for each of the multiple objects referring to the common object can reference the common object record in the database using, for example, foreign keys. | 01-07-2016 |
| 20150379536 | CONSUMPTION-DRIVEN FORECASTING USING MULTI-LEVEL HETEROGENEOUS INPUT DATA - A method, system, and computer program product for generating forecasts and replenishment plans. Some embodiments commence upon receiving point-of-sale data, then receiving distribution-level order data in a second data format. The first point-of-sale data comprises an item identifier and a first date or first date range, and the distribution-level order data comprises the item identifier and a second date or second date range. The originators of the order data are determined using address identifiers (e.g., network location identifiers). The received data is combined wherein at least a portion of the point-of-sale data is combined with at least a portion of the distribution-level order data to generate a combined forecast for the item. Further processing includes receiving an inventory model parameter and combining at least a portion of the first point-of-sale consumption data with at least a portion of the distribution-level order data to generate a replenishment plan for the item. | 12-31-2015 |
| 20150379449 | USING CONSUMPTION DATA AND AN INVENTORY MODEL TO GENERATE A REPLENISHMENT PLAN - A method, system, and computer program product for generating forecasts and replenishment plans. Some embodiments commence upon receiving point-of-sale data, then receiving distribution-level order data in a second data format. The first point-of-sale data comprises an item identifier and a first date or first date range, and the distribution-level order data comprises the item identifier and a second date or second date range. The originators of the order data are determined using address identifiers (e.g., network location identifiers). The received data is combined wherein at least a portion of the point-of-sale data is combined with at least a portion of the distribution-level order data to generate a combined forecast for the item. Further processing includes receiving an inventory model parameter and combining at least a portion of the first point-of-sale consumption data with at least a portion of the distribution-level order data to generate a replenishment plan for the item. | 12-31-2015 |
| 20150378987 | INSIGHT ENGINE - Embodiments of the invention provide systems and methods for generating natural language insights about a set of data. More specifically, embodiments of the present invention are directed to methods and systems that transform data into insights or actionable information. The output generated by embodiments of the present invention would be equivalent to that of an observation made or insights gathered by a qualified data scientist presented with the same data. Embodiments as described herein can include an insight engine that can analyze both structured and unstructured data and generate information in a natural language of the user's choice. Insights provided by embodiments described herein can be supported by an ability to drilldown to graphs/tables and atomic data and provide a good starting point for further analysis. | 12-31-2015 |
| 20150378694 | Optimistically Assuming Types in a Dynamically Typed Language - Optimistically type assumptions in a dynamically typed language may involve a compiler parsing code and detecting a program element that results from an operation of the code that has an unspecified type. In response, the compiler may make a first type assumption treating the element as a first type. The assumed type may be selected from multiple types as expected to have a lowest performance cost of the multiple types. The compiler may generate compiled code using the first (assumed) type. During runtime of the compiled code, it may be detected that the first type assumption is invalid for the compiled code and in response a portion of the compiled code may be replaced with other compiled code. The other compiled code may treat the element according to a second type assumption that may be selected as a type expected to have the second lowest performance cost. | 12-31-2015 |
| 20150377960 | SIMULTANEOUS TRANSITION TESTING OF DIFFERENT CLOCK DOMAINS IN A DIGITAL INTEGRATED CIRCUIT - Implementations of the present disclosure involve an apparatus and/or method for conducting simultaneous transition testing of different clock domains of a microprocessor design at different frequencies through a controlled order of clock pulses in each domain. In general, a microelectronic design utilizes test control circuitry associated with each clock domain of the design to conduct simultaneous transition testing of the clock domains. The testing control circuitry associated with each clock domain of the microelectronic design further allows for the testing device to delay testing within a particular clock domain. By delaying the testing within a particular clock domain, the testing of the various clock domains can be synchronized. Through these testing procedures, the amount of time required to perform the ATPG testing of a microelectronic design may be greatly reduced. | 12-31-2015 |
| 20150373011 | CREDENTIAL COLLECTION IN AN AUTHENTICATION SERVER EMPLOYING DIVERSE AUTHENTICATION SCHEMES - An aspect of the present invention facilitates flexible credential collection in an authentication server employing diverse authentication schemes. In an embodiment, an access manager in the authentication server determines that an authentication scheme is to be used for allowing access to a resource requested by a user. A custom module (implementing the authentication scheme) in the authentication server then sends to the access manager commands indicating corresponding sets of credentials to be collected. The access manager, in response to receiving each command, collects the corresponding credentials from the user and checks whether the collected credentials authenticates the user. The custom module sends each command after the checking of the previously collected credentials. Accordingly, a developer of the custom module is enabled to request for and to perform the authentication of the user based on different sets of credentials. | 12-24-2015 |
| 20150371045 | METHODS, SYSTEMS AND MACHINE-READABLE MEDIA FOR PROVIDING SECURITY SERVICES - Systems, methods and machine-readable media for providing a security service are disclosed. The methods include receiving a modification of the application object code to allow the software application to transmit a request for the security service; retrieving the modified application object code corresponding to the software application from memory; receiving, via a processor, the request for the security service from the modified application object code; and providing, via the processor, the security service. The systems and machine-readable media performing operations according to the methods disclosed. | 12-24-2015 |
| 20150363191 | CONFIGURATION-BASED PROCESSING OF REQUESTS BY CONDITIONAL EXECUTION OF SOFTWARE CODE TO RENDER REGIONS IN A DISPLAY - Server(s) prepare requests to obtain user input indicative of at least one of approval or disapproval by conditionally including therein one or more regions based on rules. The rules are configurable, and each rule is associated with an identifier of a software code. On receipt of a message identifying a request, rules corresponding to regions includable in the request are evaluated to identify regions to be rendered. For a to-be-rendered region a software code identified in a rule action pair is executed to obtain one or more rows, each row including multiple name value pairs. The server(s) prepare content of the request, by including each name value pair in a single line among multiple lines for a row, the multiple lines being sequenced relative to one another in a specific sequence to be displayed by a mobile device, the specific sequence being configurable. | 12-17-2015 |
| 20150362673 | SURFACE-NORMAL COUPLER FOR SILICON-ON-INSULATOR PLATFORMS - A photonic integrated circuit (PIC) is described. This PIC includes an inverse facet mirror on a silicon optical waveguide for optical proximity coupling between two silicon-on-insulator (SOI) chips placed face to face. Accurate mirror facets may be fabricated in etch pits using a silicon micro-machining technique, with wet etching of the silicon <110> facet at an angle of 45° when etched through the <100> surface. Moreover, by filling the etch pit with polycrystalline silicon or another filling material that has an index of refraction similar to silicon (such as a silicon-germanium alloy), a reflecting mirror with an accurate angle can be formed at the end of the silicon optical waveguide using: a metal coating, a dielectric coating, thermal oxidation, or selective silicon dry etching removal of one side of the etch pit to define a cavity. | 12-17-2015 |
| 20150357260 | DESIGN OF A HEAT DISSIPATION STRUCTURE FOR AN INTEGRATED CIRCUIT (IC) CHIP - An apparatus for cooling an integrated circuit (IC) die is described. The apparatus includes an adhesion layer coated on a surface of the IC die, wherein the adhesion layer has high thermal conductivity. The apparatus also includes a heat dissipation structure affixed onto the adhesion layer. This heat dissipation structure further includes a set of discrete heat dissipation elements which are substantially mechanically isolated from each other. This set of discrete heat dissipation elements provides an extended heat dissipation surface for the IC die. Moreover, each of the set of discrete heat dissipation elements has high compliance, which allows the adhesion layer to be sufficiently thin, thereby reducing a thermal conductivity of the adhesion layer. | 12-10-2015 |
| 20150355968 | SYSTEMS AND METHODS FOR SEQUENTIAL RESILVERING - Implementations claimed and described herein provide systems and methods for the efficient rebuilding of a failed storage device through sequential resilvering. In one implementation, blocks for resilvering are discovered. The blocks correspond to input/output requests not successfully completed for a failed storage device. A coarse grained sorting of the blocks is performed based on a block location of each of the blocks on the failed storage device. The block locations of the blocks are stored in memory according to the coarse grained sorting. A fine grained sorting of the blocks is performed based on the coarse grained sorting of the blocks. The blocks are sequentially resilvered based on the fine grained sorting. | 12-10-2015 |
| 20150350186 | AUTHORIZATION TOKEN CACHE SYSTEM AND METHOD - A system includes one or more processors to request access tokens from a token service computer, cache the access tokens and related information in a token cache, transmit the access tokens with a resource request to a resource server, and receive requested resources in response to the resource request. The resource server transmits representations of requested resources to computing devices having valid tokens. The access tokens and related information including credentials information and token metadata are stored in the token cache. | 12-03-2015 |
| 20150350039 | DEEP PACKET INSPECTION (DPI) OF NETWORK PACKETS FOR KEYWORDS OF A VOCABULARY - An aspect of the present disclosure provides deep packet inspection (DPI) of network packets for keywords of a vocabulary. In one embodiment, a mapping specifying association of respective keywords to corresponding unique pattern codes is maintained, with each pattern code being shorter in length compared to the corresponding keyword and being computed based on a formula. Upon receiving a network packet, a token (containing a sequence of characters) present in the network packet is first identified and the formula then applied to the identified token to generate a token code. The token is determined to match a specific keyword when the token code equals the pattern code corresponding to the specific keyword in the mapping. | 12-03-2015 |
| 20150348586 | LINEAR ACTUATOR WITH COIL WINDING PORTIONS HAVING OPPOSING CURRENT FLOW DIRECTIONS - A linear actuator for linearly positioning a recording head in a data storage mechanism. The disclosed linear actuator includes an electrically conductive coil having first and second parts that are both wound in the same rotary direction about an axis, and a magnet spaced from the electrically conductive coil by an air gap. Transmission of an electric current through the first part of the electrically conductive coil in a first current flow direction about the axis and through the second part of the electrically conductive coil in an opposite second current flow direction about the axis induces linear movement of one of the electrically conductive coil and magnet relative to the other of the electrically conductive coil and magnet. | 12-03-2015 |
| 20150347977 | OPTIMIZING WELLNESS PROGRAM SPENDING - A method, system, and computer program product for managing employee wellness incentive programs. Some embodiments commence by accessing databases to retrieve a set of wellness program spending amount datapoints, and then organizing those datapoints into a series of successively increasing wellness program spending amounts. The wellness program spending amounts are historical amounts or prospective amounts. A calculator or predictor generates a respective series of wellness program savings amounts, wherein individual ones of the series of the wellness program savings amounts comprise at least calculated or predicted healthcare cost savings. A net benefit is determined and used as a desired wellness program spending amount. The desired wellness program spending amount is the spending amount at which point an incremental amount of additional wellness program spending results in only an equal or lesser amount of incremental calculated or predicted wellness program savings. Wellness incentive spending can be accordingly adjusted up or down. | 12-03-2015 |
| 20150347944 | VISUAL RESOURCE ALLOCATION SYSTEM - A system is provided that visualizes an allocation of resources. The system displays a chart, where the chart includes a list of tasks and a timeline including time units. The system further displays task indicators within the timeline of the chart, where a task indicator includes task indicator segments, and where an area of a task indicator segment is proportional to a work scope of a resource allocated to a corresponding task. The system further receives a user interaction that includes a movement of the task indicator segment from a first task indicator that corresponds to a first task to a second task indicator that corresponds to a second task. The system further allocates the resource from the first task to the second task. The system further modifies the display of at least one task indicator within the timeline of the chart based on the allocation of the resource. | 12-03-2015 |
| 20150347939 | FORMING RECOMMENDATIONS USING CORRELATIONS BETWEEN WELLNESS AND PRODUCTIVITY - A method, system, and computer program product for computer-aided administration of wellness programs. Processing commences upon collecting first observations based on direct or indirect productivity measurements, then collecting second observations pertaining based on direct or indirect employee wellness measurements. Correlations between the first observations and the second observations are made, and based on the correlations, recommendations are formed. Recommendations can be emitted to an employee or to a program manager. The employee productivity measurements comprise working hours per time period, absentee hours per time period, units produced over a time period, revenue per employee, profit per employee, revenue per work hour, and/or profit per work hour. The employee wellness measurements comprise an assessment of a number of hours of exercise per time period, a number of steps taken per time period, a nutrition intake per time period, a body characteristic, and/or a quantity of caffeine-fortified beverages consumed per time period. | 12-03-2015 |
| 20150347520 | USING CROWDSOURCING CONSENSUS TO DETERMINE NUTRITIONAL CONTENT OF FOODS DEPICTED IN AN IMAGE - A method, system, and computer program product for wellness maintenance programs configured for user-specific tracking of food consumption to goals. Upon receiving a digital image of food or beverage items, the digital image is transmitted to a repository configured to serve a plurality of accesses by a plurality of human members (e.g., a crowdsource repository). Members of the crowd generate food description annotations pertaining to aspects of the pictured food or beverage items. The food description annotations (e.g., menu picks, text descriptions) are used to look-up nutrition records. Some use cases correlate a set of food description annotations that are shared between two or more of the human members to generate a confidence score, and some use cases also receive food intake recommendations from the human members. The food intake recommendations can be recorded in a wellness profile which in turn can be used for progress tracking against nutrition goals. | 12-03-2015 |
| 20150347498 | TRANSPARENTLY UPGRADING DERIVED DATABASE OBJECTS - A method for transparently upgrading derived database objects commences upon analysis of the data dictionary definition for an initial derived database object as compared to the data dictionary definition for a patched derived database object, then determining if a regenerated instance of the derived database object would be logically different from the initial derived database object. The determination is based on comparisons of the definitions of the initial derived database objects and patched definitions of respective database objects. The method produces a regenerated instance of the derived database object when a regenerated instance of the patched derived database object would be logically different from the initial derived database object. The method will suppress the production of a regenerated instance when a regenerated instance of the derived database object would not be logically different from the initial derived database object. Once regenerated or suppressed, a post-upgrade software application accesses the regenerated derived database object instance (if regenerated) or the initial derived database object if the regenerated instance was suppressed. | 12-03-2015 |
| 20150347401 | MOVING DATA BETWEEN PARTITIONS - Techniques are provided for moving data between partitions. Such a process may be performed without requiring any locks that block transactions that target a partition from being executed. Instead, such transactions may proceed while a move operation is being performed. The move operation involves copying data from the targeted partition to another partition that is hidden from (or “invisible” to) those transactions that attempt to read from or write to the partition. During the move operation, changes that are made to the partition are also reflected in a journal. Eventually, the changes reflected in the journal are drained and applied to the hidden partition. Once the partition and the hidden partition are synchronized, the identities of the partitions are swapped so that future transactions will target the previously-hidden partition instead of the previously-viewable partition. | 12-03-2015 |
| 20150347254 | MEMORY ERROR PROPAGATION FOR FASTER ERROR RECOVERY - A method for managing a corrupted memory block. The method includes detecting the corrupted memory block, and removing, after detecting the corrupted memory block, references to the corrupted memory block. The method further includes identifying, after detecting the corrupted memory block, an uncorrupted memory block and analyzing each cache line. The method further includes determining, while analyzing each cache line, that a first cache line includes an uncorrectable error and creating, based on determining the first cache line includes the uncorrectable error, a second cache line including an artificial error, and migrating the second cache line to the uncorrupted memory block, where a layout of the corrupted memory block is maintained. | 12-03-2015 |
| 20150347239 | GLOBAL BACKUP LOCK MANAGER - Techniques for mastering resources in a cluster of nodes are provided. A global backup lock manager (GBLM) is maintained for a cluster of nodes that implement distributed lock management. Before a server instance is taken down, for example, for maintenance purposes, such as installing a new version of the server instance code, the mastership information that the server instance stores is reflected in the mastership information maintained by the GBLM. Thus, shutting down the server instance does not involve remastering the resources mastered by the server instance. As a result, shutting down the server instance may take minimal time. | 12-03-2015 |
| 20150347034 | TAPE DRIVES GENERATING BEST ACCESS ORDER OF RANDOMLY STORED FILES ON A TAPE - A tape drive adapted for providing a best access order for files or data sets on a tape loaded into the tape drive. The tape drive includes a processor and memory storing a file location table for the tape. The file location table includes identifiers for a plurality of files on the tape and location information for the plurality of files on the tape. The tape drive includes an order determination module, executed by the processor, processing an order request. The order request, from a host or user, includes a list of the files on the tape from which to generate, based on the location information in the file location table, a reordered list defining an order for accessing the files on the tape. The reordered list or best access order has (or produces via tape drive access) an access time for the files that is minimal or reduced. | 12-03-2015 |
| 20150339677 | CUSTOMER INSIGHT HUB FOR MULTI-CHANNEL CUSTOMER ENGAGEMENT SOLUTIONS - Embodiments provide systems and methods for providing customer insights across multiple channels based on cross-channel interactions with the customer. More specifically, embodiments of the present invention are directed to a customer insight hub that leverages data sources across a Customer Relationship Management (CRM) product suite of a plurality of different CRM applications to generate rich customer insights that can be easily leveraged across customer channels including but not limited to web, telephony, chat, emails, social, etc. These insights can be used by different processes and/or provided on an agent desktop to facilitate the delivery of a personalized, efficient, and consistent end customer experience across customer touch points or channels. Embodiments include defining and generating commonly used customer insights, including but not limited to customer identity, customer intent, customer priority, and customer preferences, as well as custom insights. | 11-26-2015 |
| 20150339419 | EFFICIENT POWER GRID ANALYSIS ON MULTIPLE CPU CORES WITH STATES ELIMINATION - A method for calculating voltage values in a power grid, including: obtaining a primary circuit representation (PCR) corresponding to the power grid and including: multiple nodes separated by multiple impedances; and an independent source connected to one node; identifying a high degree node; obtaining a modified circuit representation (MCR) by connecting, in the PCR, an auxiliary voltage source having an auxiliary voltage value to the high degree node, the MCR including a modified characteristic matrix and a modified source vector; calculating a modified state vector based on the modified characteristic matrix and the modified source vector; generating an admittance matrix based on the multiple impedances and the auxiliary voltage; obtaining an auxiliary voltage adjustment value using the admittance matrix; obtaining a primary state vector by adjusting the modified state vector using the admittance matrix and the auxiliary voltage adjustment value; and obtaining the voltage values from the primary state vector. | 11-26-2015 |
| 20150339158 | Dynamic Co-Scheduling of Hardware Contexts for Parallel Runtime Systems on Shared Machines - Multi-core computers may implement a resource management layer between the operating system and resource-management-enabled parallel runtime systems. The resource management components and runtime systems may collectively implement dynamic co-scheduling of hardware contexts when executing multiple parallel applications, using a spatial scheduling policy that grants high priority to one application per hardware context and a temporal scheduling policy for re-allocating unused hardware contexts. The runtime systems may receive resources on a varying number of hardware contexts as demands of the applications change over time, and the resource management components may co-ordinate to leave one runnable software thread for each hardware context. Periodic check-in operations may be used to determine (at times convenient to the applications) when hardware contexts should be re-allocated. Over-subscription of worker threads may reduce load imbalances between applications. A co-ordination table may store per-hardware-context information about resource demands and allocations. | 11-26-2015 |
| 20150339107 | GENERATING RUNTIME COMPONENTS - Embodiments of the invention provide systems and methods for generating runtime components in various hardware and software computer systems. More specifically, certain embodiments of the present invention describe a design-time interface by which applications may be designed, generated, and deployed in accordance within the underlying source systems of a computer system. Components may be selected, customized, and linked together to form a functional end-to-end application based on a multitude of underlying technologies within a system. Upon completion of the application design, application metadata and/or runtime components may be generated and deployed within the computer system. During execution, such the runtime components deployed within the system may collaborate to receive and process event streams from various event sources, analyze incoming data, and generate logical transaction objects, alerts, and other responses using various source systems. | 11-26-2015 |
| 20150331683 | Automatic Selection Of An Abstract Data Type - An implementation of an abstract data type is automatically selected by a compiler. The compiler chooses an implementation for each instance of an abstract data type in a program based on operations performed in the instance within the program. | 11-19-2015 |
| 20150331596 | UI-DRIVEN MODEL EXTENSIBILITY IN MULTI-TIER APPLICATIONS - A system and method for facilitating modifying a runtime application behavior and/or functionality of a networked software application, whereby UI-driven data model modifications effectively propagate back to the UI of the runtime application. The example method includes employing the runtime user interface display screen to present one or more indicators for one or more customizable user interface features of the runtime user interface display screen; generating one or more signals based upon user input, wherein the user input indicates a modification to be made to the one or more customizable user interface features; initiating one or more changes to a computing object and data model associated with the computing object in accordance with the one or more signals; and displaying a modified user interface display screen in accordance with the one or more changes. | 11-19-2015 |
| 20150326497 | GROUP BASED POLICY MANAGEMENT - The present disclosure provides for managing policies within a group. A group, which includes numerous group members, is configured to share resources from a single pool of resources. In addition, a group of policies applicable to the group are also identified. Whenever a request is received from one of the group members, a determination is made as to whether such a request violates the policies applicable to the group. | 11-12-2015 |
| 20150324728 | DYNAMIC TASK DISTRIBUTION SYSTEM - A system is provided that that dynamically distributes tasks. The system calculates scores for tasks, where each score is calculated based on a finish-by date-time for each task, a planned finish date-time for each task, a planned effort for each task, and a base priority for each task. The system further determines an order that the tasks are executed based on the scores. The system further displays the tasks and a project plan timeline within a user interface, where the tasks are displayed within the project plan timeline based on the order that the plurality of tasks are executed. The system further determines a buffer time distribution for the tasks based on the scores. The system further displays the tasks within the project plan timeline based on the buffer time distribution for the tasks. | 11-12-2015 |
| 20150324259 | METHOD AND SYSTEM FOR AUTOMATIC FAILOVER FOR CLIENTS ACCESSING A RESOURCE THROUGH A SERVER USING HYBRID CHECKSUM LOCATION - Some embodiments are directed to a method and apparatus for implementing an automatic failover mechanism for a resource. A client accesses a source through a first server using a first session. During the session, the client stores checksum information corresponding to data received via the session with the first server. When it is detected that the session between the first server and the client has failed, the client is automatically connected with second server that has access to the resource. The checksum information is transmitted from the client to the second server, where it is compared with checksum information calculated at the second server, so that a determination can be made as to whether the client can continue processing where it left off when connected to the second server. | 11-12-2015 |
| 20150319879 | SELF-DETERMINATION OF EQUIPMENT RACK CONSUMPTION BY RACK-MOUNTED APPLIANCES - Embodiments include systems and methods for self-determination of equipment rack consumption by rack-mounted appliances. Some embodiments operate in context of pre-integrated systems having a number of rack-mounted appliances installed in an equipment rack. The equipment rack can include a number of passive location designators, each positioned on the equipment rack in a physical location corresponding to a mounting location for a rack-mounted appliance, and each including a code that indicates its associated mounting location. Each rack-mounted appliance can include a sensor which, when the rack-mounted appliance is installed in a mounting location of the equipment rack, can read the code on the passive location designator associated with that mounting location. This reading can be used by the rack-mounted appliance to self-determine its rack consumption. | 11-05-2015 |
| 20150319267 | METHODS, SYSTEMS, AND COMPUTER READABLE MEDIA FOR CONTROLLING DEEP PARSING OF DIAMETER MESSAGES - A system for controlling deep parsing of Diameter messages comprises a Diameter node. The Diameter node includes at least one processor and a Diameter parsing engine for receiving a Diameter message, determining whether the message includes a Diameter deep parse indicator, for determining whether or not to perform deep parsing of the message based on the presence, absence, or value the Diameter deep parse indicator, and performing or refraining from performing deep parsing of the message based on results of the determining. | 11-05-2015 |
| 20150319091 | WI-FI OFFLOAD OF CELLULAR DATA - A security gateway system offloads cellular data from user equipment (“UE”). The system receives a dynamic host configuration protocol (“DHCP”) message from a Wi-Fi access point (“AP”) in communication with the UE. The system converts the DHCP message into an authentication, authorization and accounting (“AAA”) access request and sends the AAA access request to an AAA server. The system receives an AAA access accept from the AAA server and initiates a gateway general packet radio service tunneling protocol tunnel setup with a setup node. | 11-05-2015 |
| 20150318254 | ELECTROPLATED SOLDER WITH EUTECTIC CHEMICAL COMPOSITION - This chip package includes a substrate having a gold (or tin) layer disposed on a surface of the substrate. The gold (or tin) layer may couple to a tin (or gold) layer disposed on a surface of a second substrate. When melted, the gold layer and the tin layer result in an interconnect with a chemical composition having a subsequent melting temperature to reflow the bump that is higher than the initial melting temperature. For example, the chemical composition may correspond to a non-equilibrium gold-tin alloy. | 11-05-2015 |
| 20150317595 | AUTOMATIC TASK ASSIGNMENT SYSTEM - A system is provided that automatically assigns tasks to resources. The system receives a notification that a resource is about to enter an idle period or has entered the idle period. The system further automatically assigns a filler task or a portion of the filler task to the resource, where the filler task is a task that can be split into multiple portions. The system further receives a notification that the resource is about to exit the idle period or has exited the idle period. The system further automatically un-assigns the filler task or the portion of the filler task from the resource. | 11-05-2015 |
| 20150317425 | METHOD AND APPARATUS FOR DUMMY CELL PLACEMENT MANAGEMENT - A method for manipulating a circuit design includes receiving multiple dummy cell modification parameters, selecting, by a computer processor and based on the dummy cell modification parameters, a dummy cell insertion region on a circuit design, and generating, in the dummy cell insertion region, multiple dummy cells. The method further includes selecting a first dummy cell from the dummy cells, determining, by the computer processor and based on a location of the first dummy cell, an illegal overlap with the first dummy cell, and removing, by the computer processor and from the dummy cells, the first dummy cell. The method further includes inserting, by the computer processor, on the circuit design, and after removing the first dummy cell, the dummy cells to obtain a modified circuit design, and presenting the modified circuit design. | 11-05-2015 |
| 20150317338 | PRECISE EXCECUTION OF VERSIONED STORE INSTRUCTIONS - Techniques for executing versioned memory access instructions. In one embodiment, a processor is configured to execute versioned store instructions of a first thread within a first mode of operation. In this embodiment, in the first mode of operation, the processor is configured to retire a versioned store instruction only after a version comparison has been performed for the versioned store instruction. In this embodiment the processor is configured to suppress retirement of instructions in the first thread that are younger than an oldest versioned store instruction until the oldest versioned store instruction has retired. In some embodiments, the processor is configured to execute versioned store instructions of a given thread within a second mode of operation, in which the processor is configured to retire outstanding versioned store instructions before a version comparison has been performed. | 11-05-2015 |
| 20150317183 | SYSTEM AND METHOD FOR PROVIDING A DISTRIBUTED TRANSACTION LOCK IN A TRANSACTIONAL MIDDLEWARE MACHINE ENVIRONMENT - A system and method can support a distributed transaction lock in a transactional middleware machine environment. The system can use a global transaction identifier to locate a hash bucket in a transaction hash table, wherein the transaction hash table contains a plurality of hash buckets. Then, the system can lock said hash bucket in the transaction hash table, and allow only one process to access one or more global transaction entry structures in the transaction table before said hash bucket is unlocked, wherein said one or more global transaction entry structures are associated with the locked hash bucket in the transaction hash table. | 11-05-2015 |
| 20150317167 | MECHANISM FOR CLASS DATA SHARING USING EXTENSION AND APPLICATION CLASS-LOADERS - The present disclosure involves systems, methods, and/or computer-readable mediums for reducing load time of an application. The systems, methods, and/or computer-readable mediums store metadata in an archive prior to execution of an application. The metadata corresponds to a type of class loading operation used to load a class required by the application, where different types of class loading operations perform different security checks as a part of loading classes. During execution of the application, based on the metadata and based in part on a request for the class loading operation to load the class, it is determined whether the class is stored in the archive. When the class is stored in the archive, a particular type of class loading operation loads the class from the archive and the system checks that the particular type of the class loading operation matches the type of the class loading operation in the metadata. | 11-05-2015 |
| 20150317154 | CUSTOMIZATION MANAGER - A customization includes a name of a module of source code in an existing generic version of application software, a specific position within the module, and a name of a file which contains additional software. An existing customized version of the application software is then prepared, to execute the additional software in executing the existing generic version at the existing specific position. When a new generic version of the application software is received, the existing customization is displayed if applicable to a module in the new generic version, followed optionally by receipt of an update to the existing specific position. On indication of user approval, a new customized version of the application software is prepared, to execute the additional software in executing the module in the new generic version, at the existing specific position or at an updated specific position, which depends on the optional receipt of the update. | 11-05-2015 |
| 20150310533 | CONSIGNED INVENTORY PROCUREMENT SYSTEM - A system is provided that manages consigned inventory procurement. The system generates an agreement including consignment terms and purchasing terms. The system further generates a consignment order for consigned inventory items, where the consignment order references the agreement. The system further generates a receipt in response to receiving the consigned inventory items, where the receipt references the consignment order. The system further generates a consumption advice in response to a consumption of a consigned inventory item, where the consumption advice references the agreement and the receipt. The system further sends the consumption advice to a supplier. The system further generates an invoice for the consigned inventory item in response to receiving a supplier invoice from the supplier, where the invoice references the consumption advice. The system further generates a payment for the consigned inventory item in response to a receipt of the invoice, where the payment references the invoice. | 10-29-2015 |
| 20150310512 | Method and Apparatus for Enabling Concurrent Rating During a Re-Rating Operation - The present disclosure provides for enabling concurrent rating during a re-rating operation. A first notification is received. The first notification indicates that a re-rating process, which comprises a modification to a customer state for a customer service account, has been initiated for the customer service account. A concurrent usage request is received while the re-rating process is ongoing. The concurrent usage request comprises a request to perform a transaction affecting the customer service account. The concurrent usage request is then processed. | 10-29-2015 |
| 20150310445 | DYNAMICALLY SELECTING CONTACT CENTER WORKFLOWS BASED ON WORKFLOW INSIGHTS - Embodiments of the invention provide systems and methods for managing workflows in a contact center. More specifically, embodiments of the present invention are directed to dynamically influencing workflows based on learned insights into those workflows. With end-to-end Customer Relationship Management (CRM) suites, which manage the entire customer service journey from consumer website to knowledge base to escalation to a live agent via a communication channel to incident creation and incident resolution, it is possible to provide an out-of-the-box, simple-to-use solution to the above problems that offers unique advantages over the expensive, custom, bolt-on solutions. | 10-29-2015 |
| 20150309714 | NAVIGATING INTERACTIVE VISUALIZATIONS WITH COLLABORATIVE FILTERING - Embodiments of the invention provide systems and methods for navigating interactive visualizations of a business analysis application based on collaborative filtering. More specifically, embodiments of the present invention provide a recommender that functions together with a visualization tool and business analytics application. This recommender can track use of interactive visualizations provided by the visualization tool, e.g., views selected, functions performed, navigation between views, etc., by various users to build a set of inquiry histories. Then, based on these histories and possibly other considerations, recommendations can be made to a current user as to which views, functions, etc. might be useful or insightful. In other words, embodiments of the present invention track the analysis behavior of each user and recommend which views may be of interest for the corresponding analysis task based on the behavior of similar users in similar situations. | 10-29-2015 |
| 20150302049 | METHOD AND APPARATUS FOR MODIFYING A ROW IN A DATABASE TABLE TO INCLUDE META-DATA - One embodiment of the present invention provides a database system that facilitates modifying a row in a database table to include meta-data about operations performed on the row. During operation, the database system receives a definition for an extensible row descriptor, the extensible row descriptor indicating meta-data associated with operations performed on a row in a database table. The system then receives a condition for updating the extensible row descriptor. The system determines that executing a command satisfies the condition for updating the extensible row descriptor, and updates the extensible row descriptor. | 10-22-2015 |
| 20150302035 | PARTIAL INDEXES FOR PARTITIONED TABLES - Techniques for creating and using partial indexes are provided. A partial index is an index that indexes one or more partitions of a partitioned table and does not index one or more other partitions of the partitioned table. Thus, if a partition of a partitioned table is rarely used, then an index may index all other partitions of the partitioned table or at least only those partitions that are written to or read from relatively frequently. Also, in preparation for loading data into a partition, indexing for the partition may be “turned off”, effectively making a full index a partial index. While the data is loaded into the partition, the partial index is still available for query processing. After the data is loaded into the partition, indexing for the partition is “turned on”, which causes the data in the partition to be indexed by the partial index. | 10-22-2015 |
| 20150302026 | SYSTEMS AND METHODS FOR MULTI-THREADED SHADOW MIGRATION - Implementations described and claimed herein provide systems and methods for migration data from a source to a target in the background using an optimal number of threads. In one implementation, a file system operation request is received at the target. The file system operation request specifying a read request for a directory having a directory level migration attribute on the target that is marked. An optimal number of threads is allocated for migrating the directory. Metadata for content in the directory is obtained from the source using the optimal number of threads. A directory entry for a file in the directory is created on the target using the metadata, the directory entry for the file associated with a file level migration attribute that is marked. | 10-22-2015 |
| 20150302016 | SYSTEMS AND METHODS FOR MULTI-THREADED SHADOW MIGRATION - Implementations described and claimed herein provide systems and methods for migration data from a source to a target in the background using an optimal number of threads. In one implementation, a directory entry in a source file system is compared to a size threshold. An optimal number of threads for a migration associated with the directory entry is allocated. The optimal number of threads is determined based on a degree of parallelism available for the migration and the comparison of the directory entry to the size threshold. The directory entry is migrated from the source file system to a target file system using the optimal number of threads. | 10-22-2015 |
| 20150301949 | USING BROADCAST-BASED TLB SHARING TO REDUCE ADDRESS-TRANSLATION LATENCY IN A SHARED-MEMORY SYSTEM WITH OPTICAL INTERCONNECT - The disclosed embodiments provide a system that uses broadcast-based TLB sharing to reduce address-translation latency in a shared-memory multiprocessor system with two or more nodes that are connected by an optical interconnect. During operation, a first node receives a memory operation that includes a virtual address. Upon determining that one or more TLB levels of the first node will miss for the virtual address, the first node uses the optical interconnect to broadcast a TLB request to one or more additional nodes of the shared-memory multiprocessor in parallel with scheduling a speculative page-table walk for the virtual address. If the first node receives a TLB entry from another node of the shared-memory multiprocessor via the optical interconnect in response to the TLB request, the first node cancels the speculative page-table walk. Otherwise, if no response is received, the first node instead waits for the completion of the page-table walk. | 10-22-2015 |
| 20150301844 | SHADOW VNICS FOR THE CONTROL AND OBSERVABILITY OF IO VIRTUAL FUNCTIONS - A method for controlling a network interface controller (NIC). The method includes receiving, by a host operating system (OS) executing on a computer system, an instruction to map the NIC virtual function (VF) to a first virtual machine executing on the computer system. The method further includes allocating, according to the NIC VF, first NIC resources on a physical NIC operatively connected to the computer system, mapping the NIC VF to the first virtual machine, creating, in the host OS, a shadow virtual NIC for the first NIC resources allocated to the NIC VF, assigning the shadow virtual NIC to the first virtual machine, receiving, by the physical NIC, a first packet targeting the first virtual machine, and sending the first packet directly to the first virtual machine. | 10-22-2015 |
| 20150294113 | METHOD AND SYSTEM FOR PERFORMING A MEMORY SAFETY CHECK OF A PROGRAM WRITTEN IN AN UNMANAGED PROGRAMMING LANGUAGE - A method for performing a memory safety check of a program coded in an unmanaged programming language includes receiving an intermediate representation (IR) of the program and performing a static analysis pass of the IR to generate annotations including a safe pointer and an unsafe pointer. The method further includes removing, during a static analysis pass of the IR, the safe pointer from the annotations, inserting, into the IR using the annotations, a sandbox function call at the unsafe pointer to generate a modified IR, compiling the modified IR to generate an executable version of the program, executing, inside a sandbox framework, the executable version of the program, generating, during runtime and upon reaching the sandbox function call, a metadata entry and an enhanced pointer for atomicity, and comparing, during runtime and upon reaching a use of the unsafe pointer, the metadata entry with the enhanced pointer. | 10-15-2015 |
| 20150293964 | APPLICATIONS OF AUTOMATED DISCOVERY OF TEMPLATE PATTERNS BASED ON RECEIVED REQUESTS - Techniques for leveraging frequent patterns identified in a captured workload are provided. In one approach, multiple frequent patterns detected in a captured workload may be ordered by frequency to determine, for example, which patterns should be targeted for optimization. In another approach, a model of a captured workload is created, where the model comprises nodes that represent templates (which in turn correspond to requests) and edges that represent transitions between templates. The model is used to create an artificial workload, such as a workload that is twice as large as the originally-captured workload. The model may also be edited before creating the artificial workload. In another approach, workload models are compared to identify errors, regressions, or security issues. In another approach, an artificial workload is created for an application that is not yet deployed and then executed to determine whether the artificial workload or the originally-captured workload executed faster. | 10-15-2015 |
| 20150293900 | INFORMATION RETRIEVAL SYSTEM BASED ON A UNIFIED LANGUAGE MODEL - Embodiments of the invention provide systems and methods for representing a plurality of languages in a lexicon based on a unified language model. More specifically, embodiments of the present invention utilize a language model that focuses on commonalities within a particular language and between languages. Such commonalities may be based on rhyming of the words, other patterns within the words, and more generally, prosody of the words, phrases, and/or language overall. Prosody is commonly defined as the rhythm, stress, and intonation of the language when spoken. Using a language model defining such characteristics for one or more languages, embodiments of the present invention can define a lexicon for those one or more languages. In this lexicon, words and phrases of the one or more languages can be represented and classified into groups based on the commonalities between them | 10-15-2015 |
| 20150293895 | ADAPTIVE NAVIGATION FUNCTIONALITY IN A WEB-BASED DATA-ENTRY GRID - Techniques for facilitating navigation in a web-based data entry grid. In one set of embodiments, when a user navigates into a cell of the data entry grid, the user's web browser can wait for a predetermined time period before accessing an application server to retrieve input control information for the cell. If the user enters a command to navigate away from the cell before the predetermined time period has passed, the server access can be avoided, and thus the navigation event can be processed immediately. If no navigation command is received from the user before the predetermined time period has passed, the input control information can be retrieved from the application server and rendered. | 10-15-2015 |
| 20150293795 | METHOD OF SOA PERFORMANCE TUNING - Systems and methods of SOA performance tuning are provided. In accordance with an embodiment, one such method can comprise monitoring a plurality of processing stages, calculating a processing speed for each of the processing stages, and tuning a slowest processing stage of the plurality of processing stages. | 10-15-2015 |
| 20150293383 | INTEGRATED ELECTRO-ABSORPTION MODULATOR - An integrated optical device includes an electro-absorption modulator disposed on a top surface of an optical waveguide. The electro-absorption modulator includes germanium disposed in a cavity between an n-type doped silicon sidewall and a p-type doped silicon sidewall. By applying a voltage between the n-type doped silicon sidewall and the p-type doped silicon sidewall, an electric field can be generated in a plane of the optical waveguide, but perpendicular to a propagation direction of the optical signal. This electric field shifts a band gap of the germanium, thereby modulating the optical signal. | 10-15-2015 |
| 20150288655 | NEIGHBOR LOOKUP OPERATIONS IN A NETWORK NODE - A network node maintains a neighbor data structure in the form of a hash table containing multiple buckets for storing mapping entries, with each entry specifying a local address corresponding to a global address. The table is based on a hash function that generates a corresponding hash value for each global address. Each bucket is associated with a unique hash value and is implemented as a corresponding balanced tree containing a corresponding set of nodes, with each node storing a corresponding mapping entry. Upon receiving a lookup request containing a first global address, the node determines a first bucket by applying the hash function to the first global address, and then traverses a first tree corresponding to the first bucket to find a first entry having a global address equaling the first global address. Concurrent non-blocking access is permitted to various portions of the tree during changes in the tree. | 10-08-2015 |
| 20150286682 | TECHNIQUES FOR USING ZONE MAP INFORMATION FOR POST INDEX ACCESS PRUNING - Techniques for using zone map information for post index access pruning. In one embodiment, for example, a method for using zone map information for post index access pruning comprises: receiving a query statement comprising a first filter predicate on an indexed column of a database table and a second filter predicate on a zoned column of a database table; identifying zero or more pruneable zones of a zone map based on a value for the zoned column in the second filter predicate; obtaining a set of data record addresses from an index on the indexed column based on a value for the indexed column in the first filter predicate; and pruning, from access paths for processing the query statement, any data records, corresponding to data record addresses in the set of data record addresses, that are physically located in one of the pruneable zones. | 10-08-2015 |
| 20150286681 | TECHNIQUES FOR PARTITION PRUNING BASED ON AGGREGATED ZONE MAP INFORMATION - Techniques for partition pruning based on aggregated zone map information. In one embodiment, for example, a method for pruning partitions based on aggregated zone map information comprises: receiving a query statement comprising a filter predicate on a column of a database table; and pruning one or more partitions of the database table from access paths for processing the query statement based on determining, based on aggregated zone map information associated with the one or more partitions, that the filter predicate cannot be satisfied by data stored in the one or more partitions. | 10-08-2015 |
| 20150286664 | REDUCING BLOCKING INSTANCES IN PARALLEL PROCESSING SYSTEMS PERFORMING OPERATIONS ON TREES - An aspect of the present invention reduces blocking instances in parallel processing systems performing operations on trees. In one embodiment, a change operation is performed in a first execution entity and a traversal operation is performed in a second execution entity, with both the change operation and the traversal operation being designed to operate on a same node of a tree, and with the first execution entity and the second execution entity being executed concurrently in a digital processing system. A non-blocking access of the same node to both of the first execution entity and the second execution entity is permitted, thereby enabling the change operation and the traversal operation to be performed concurrently. | 10-08-2015 |
| 20150286649 | TECHNIQUES TO TAKE CLEAN DATABASE FILE SNAPSHOT IN AN ONLINE DATABASE - Techniques are described herein for making a clean file snapshot of a target file. The techniques may be applied to a single target file, to a set of target files, or to an entire database The techniques involve transitioning the target file through a series of states. During each state, particular actions are performed and/or prevented. In the final state of each approach, a clean file snapshot of the target file exists. Transitioning through the states, only one of which does not allow new changes to be made to the target file, allows the database to remain online and available to a greater extent than is possible with an approach that prevents database changes for the duration of the clean file snapshot creation operation. | 10-08-2015 |
| 20150286586 | System and Method for Implementing Scalable Adaptive Reader-Writer Locks - NUMA-aware reader-writer locks may leverage lock cohorting techniques and may support reader re-entrancy. They may implement a delayed sleep mechanism by which a thread that fails to acquire a lock spins briefly, hoping the lock will be released soon, before blocking on the lock (sleeping). The maximum spin time may be based on the time needed to put a thread to sleep and wake it up. If a lock holder is not executing on a processor, an acquiring thread may go to sleep without first spinning. Threads put in a sleep state may be placed on a turnstile sleep queue associated with the lock. When a writer thread that holds the lock exits a critical section protected by the lock, it may wake all sleeping reader threads and one sleeping writer thread. Reader threads may increment and decrement node-local reader counters upon arrival and departure, respectively. | 10-08-2015 |
| 20150286563 | READ AND WRITE OPERATIONS ON SHARED DATA RESOURCES IN PARALLEL PROCESSING SYSTEMS - Providing unblocked read operations concurrent with write operations with respect to shared data resources in parallel processing systems. In an embodiment, for each data resource, a pair of fields and an index field is maintained. The index field indicates which of the two fields (e.g., first field) stores a current value for the data resource. However, when a new value is to be stored for the data resource, the value is first stored in the second field using a execution entity, while ensuring exclusive access for the execution entity to the second field. The index field is then updated to indicate that the second field stores the current value, such that the new value in the second field is thereafter available as the current value for read operations. All read operations by any corresponding concurrent execution entities, during the write operation, are continued unblocked. | 10-08-2015 |
| 20150286557 | EMBEDDED INSTRUCTION SETS FOR USE IN TESTING AND ERROR SIMULATION OF COMPUTING PROGRAMS - Systems and methods for allowing software developers and the like to embed various different types of code and/or data manipulations into a software product. The embedded code manipulation instructions may be accessed and executed by test engineers or other users to induce fault paths and the like in the software product at run-time for analyzing the software's response to the induced fault paths. For instance, a user application of a software manipulation framework may expose a list of all of the instruction sets to a test engineer or the like in conjunction with one or more testing procedures to be performed on the software. Unless accessed by the test engineer, all of the testing probes may be represented by noops or placeholders at runtime to limit performance impact on the software. | 10-08-2015 |
| 20150280403 | VERTICAL INTEGRATION OF A HYBRID OPTICAL SOURCE - A hybrid optical source includes a substrate with an optical amplifier (such as a III-V semiconductor optical amplifier). The substrate is coupled at an angle (such as an angle between 0 and 90°) to a silicon-on-insulator chip. In particular, the substrate may be optically coupled to the silicon-on-insulator chip by an optical coupler (such as a diffraction grating or a mirror) that efficiently couples (i.e., with low optical loss) an optical signal into a sub-micron silicon-on-insulator optical waveguide. Moreover, the silicon-on-insulator optical waveguide optically couples the light to a reflector to complete the hybrid optical source. | 10-01-2015 |
| 20150279078 | GRID AND TABLE ANIMATIONS TO PROVIDE CONTEXT DURING SORT OPERATIONS - A table display presents animation to show changes in sorting and/or filtering criteria, providing users with visual references about the sorting operation and illustrating relationships between data elements before and after sorting, including data that was off-screen prior to sorting. A table presents a portion of a data element set arranged according to a first sorting criteria, such as the data field value in each data element. Upon receiving a second sorting criteria, a new arrangement of the data elements visible in the table is determined. Animation data is determined to specify the motion of visible and non-visible data elements from their locations under the first sorting criteria to their locations under the second sorting criteria. The transition animation is then initiated to show the movement of data elements from their locations under the first sorting criteria to their locations under the second sorting criteria. | 10-01-2015 |
| 20150278327 | ASYNCHRONOUS GLOBAL INDEX MAINTENANCE DURING PARTITION MAINTENANCE - Techniques for maintaining a global index in response to a partition being dropped are provided. In response to an instruction to drop a partition, partition identification data that identifies the partition is stored. Index entries, in the global index, that correspond to the dropped partition become “orphaned” entries. Later, an execution plan for a query is processed, where the execution plan targets a global index. During execution of the execution plan, one or more index entries are accessed. For each accessed index entry, the partition identification data is analyzed to determine if the index entry is an orphaned entry. If so, then the index entry is ignored for purposes of the query. Later, the global index may be updated to delete each orphaned entry. Such deletion may occur much later, such as during a time when the database is not queried or updated frequently. | 10-01-2015 |
| 20150278314 | DYNAMIC GENERATION OF DATABASE VIEWS AND CLASS OBJECTS FOR PROVIDING ACCESS TO REPOSITORY DATA - Techniques for dynamically generating database views and class objects for allowing access to domain data stored in a repository are provided. A computer-implemented method, a system, and/or a machine-readable medium storing instructions executable by one or more processors may include generating a database view and a class object using metadata included in a domain model, and retrieving domain data from a repository using the database view and the class object. For example, a method may include obtaining a domain model from a repository, the domain model including metadata corresponding to a set of domain data stored in the repository, generating a database view of a subset of the set of domain data using the metadata, generating a class object for the subset using the metadata, generating mapping information, and retrieving the subset of domain data from the repository using the database view, the class object, and the mapping information. | 10-01-2015 |
| 20150278275 | DROPPING AN INDEX WITHOUT BLOCKING LOCKS - Techniques for processing “destructive” database statements are provided. Destructive database statements, when processed, cause metadata of a database object to be changed. Examples of such database statements include ones that delete an index, that set a column as unused, and that drop a constraint on a column. When such a statement is received, a change is made to metadata of a database object. Such a metadata change may involve setting an index as unusable, disabling a constraint, or invalidating a cursor. After the metadata change, a first time is determined. Then, it is determined when one or more database transactions that were pending at the first time have committed. After those database transaction(s) have committed, one or more operations are performed, such as dropping an index or dropping a constraint. | 10-01-2015 |
| 20150278245 | INFRASTRUCTURE FOR SYNCHRONIZATION OF MOBILE DEVICE WITH MOBILE CLOUD SERVICE - Techniques are described for implementing a cloud computer system (e.g., “a cloud service”) for facilitating the synchronization of enterprise data between mobile computing devices and enterprise computing systems (e.g., human resource management systems, business management systems, or the like). The cloud service may convert enterprise data received from different enterprise computing systems to a format that can be managed and updated easily by mobile computing devices. The converted format may enable distinct information to be easily identified. The enterprise data may be associated with policy information and version information to manage synchronization of the enterprise data. In some embodiments, the cloud service may manage synchronization with mobile computing devices based on classification of a communication connection the mobile computing devices have to a wireless network. The communication connection may be used to determine a manner for synchronizing enterprise data between the mobile computing devices and the cloud computer system. | 10-01-2015 |
| 20150278109 | MEMORY MIGRATION IN PRESENCE OF LIVE MEMORY TRAFFIC - A method for memory migration between addressing schemes, including: receiving a first request to access a first memory address and a second request to access a second memory address; comparing the first memory address and the second memory address with a barrier pointer referencing a barrier address and separating migrated addresses and un-migrated addresses; tagging the first request with a first tag indicative of the first addressing scheme in response to the first memory address being on an un-migrated side of the barrier address; tagging the second request with a second tag indicative of the second addressing scheme in response to the second memory address being on a migrated side of the barrier address; and sending the first request to a first memory controller unit (MCU) and the second request to a second MCU. | 10-01-2015 |
| 20150278053 | MANAGING MEMORY MODULES - A method for managing a failed memory module, including: receiving a first request to access a first memory address; identifying a memory module identifier (ID) from an end bit segment of the first memory address in the first request; generating, based on the memory module ID matching the failed memory module, a first revised memory address from the first memory address; and sending the first request with the first revised memory address to a memory controller for interpretation. | 10-01-2015 |
| 20150277053 | WAVELENGTH-LOCKING A RING-RESONATOR FILTER - In an optical device, a ring resonator, having a resonance wavelength, optically couples an optical signal that includes a wavelength from an input optical waveguide to an output optical waveguide. A monitoring mechanism in the optical device, which is optically coupled to the output optical waveguide, monitors an output optical signal on the output optical waveguide. For example, the monitoring mechanism may dither a temperature of the ring resonator at a frequency using a heater, and the output optical signal may be monitored by determining amplitude and phase information of the output optical signal at the frequency and twice the frequency. Moreover, control logic in the optical device adjusts the resonance wavelength based on the monitored output optical signal, where the adjustment is made without monitoring an input optical signal on the input optical waveguide. | 10-01-2015 |
| 20150271160 | SYSTEM AND METHOD FOR PROVISIONING SECRETS TO AN APPLICATION (TA) ON A DEVICE - A system and method can support device management. An authorization entity can pass one or more secrets that are wrapped with a first key to a communication entity. Furthermore, the communication entity can use a second key to establish a secure channel with an application on a device, and pass the one or more secrets that are wrapped with the first key to the application on the device using the secure channel. Then, the device can use the first key to unwrap the received wrapped secret. | 09-24-2015 |
| 20150270960 | SYSTEM AND METHOD FOR DERIVING SECRETS FROM A MASTER KEY BOUND TO AN APPLICATION ON A DEVICE - A system and method can support device management. A trusted application can be deployed in a trusted execution environment on a device, wherein the trusted execution environment includes a trusted operating system (OS) and the trusted application is associated with an identifier. Then, the system can derive one or more secrets bound to said trusted application based on the identifier and a master key maintained by the trusted OS. Additionally, the secret derivation can take into account binary code/data for the trusted application. Thus, the system can prevent another trusted application in the trusted execution environment from retrieving said one or more secrets using the same identifier. | 09-24-2015 |
| 20150269215 | DEPENDENCY-AWARE TRANSACTION BATCHING FOR DATA REPLICATION - Techniques are provided for dependency-aware transaction batching for data replication. A plurality of change records corresponding to a plurality of transactions is read. Inter-transaction dependency data is generated, the inter-transaction dependency data including at least one inter-transaction dependency relationship between a plurality of pending transactions. Each inter-transaction dependency relationship indicates that a first transaction is dependent on a second transaction. A batch transaction is generated based on the inter-transaction dependency data. The batch transaction includes at least one pending transaction of the plurality of pending transactions. The batch transaction is assigned to an apply process of a plurality of apply processes configured to apply batch transactions in parallel. | 09-24-2015 |
| 20150269061 | METHOD AND SYSTEM FOR CODE ANALYSIS USING SYMBOLIC TYPES - A method for code analysis includes generating, by a computer processor, an execution path through software code. Generating the execution path includes adding, for an object having an undefined class, a first symbolic type constraint to a path condition of the first execution path based on a first statement in the execution path, and adding, for the object having the undefined class, a second symbolic type constraint to the path condition of the execution path based on a second statement in the first execution path. The method further includes the computer processor making a determination that the path condition of the execution path is infeasible based on the first symbolic type constraint of the object being inconsistent with the second symbolic type constraint of the object, and discarding the execution path based on the determination. | 09-24-2015 |
| 20150268952 | SYSTEM AND METHOD FOR UPDATING A TRUSTED APPLICATION (TA) ON A DEVICE - A system and method can support device management. A trusted operating system (OS) in a trusted execution environment can store a digest for one or more binary files, which are associated with a trusted application that is deployed in the trusted execution environment. Then, the system can update the trusted application based on one or more updates received from a service provider. Furthermore, the system allows the trusted OS to derive at least one secret bound to the updated trusted application using the digest stored by the trusted OS in the trusted execution environment. | 09-24-2015 |
| 20150263975 | VIRTUAL PORT MAPPINGS FOR NON-BLOCKING BEHAVIOR AMONG PHYSICAL PORTS - The disclosed embodiments provide a system that operates a switch fabric. During operation, the system creates a set of virtual links for a first set of physical ports in the switch fabric. Next, the system uses a set of virtual port numbers to create a set of mappings between the set of virtual links and a second set of physical ports in the switch fabric, wherein the second set of physical ports is connected to the first set of physical ports using a single physical link. The system then uses the mappings to provide non-blocking behavior in traffic from the first set of physical ports to the second set of physical ports. | 09-17-2015 |
| 20150262608 | BUCKLING MECHANISM FOR A TAPE DRIVE LOADER - Embodiments include systems and methods for buckling in a loader assembly of a tape storage drive. Some implementations translate driving forces of an elevator of the loader assembly into driving forces that act on a pusher plate of a buckling mechanism in both buckling and unbuckling directions. For example, a plate interface can couple the pusher plate with the elevator in a manner that translates rotational motion of the elevator's drive gear into a lateral driving force that drives the pusher plate between its home and buckling positions. Certain implementations also include a home holding mechanism for removably securing the pusher plate in the home position when the elevator is in its unloaded position. | 09-17-2015 |
| 20150260914 | POLARIZATION-INSENSITIVE SILICON-PHOTOTONIC OPTICAL RECEIVER - Using silicon photonic components that support a single polarization, the output of an optical receiver is independent of the polarization of an optical signal. In particular, using a polarization-diversity technique, the two orthogonal polarizations in a single-mode optical fiber are split in two and processed independently. For example, the two optical signals are provided by a polarizing splitting grating coupler. Subsequently, a wavelength channel in the two optical signals is selected using a wavelength-selective filter (for example, using a ring resonator or an echelle grating) and combined at an optical detector (such as a photo-detector) to achieve polarization-independent operation. | 09-17-2015 |
| 20150260913 | GRATING COUPLER FOR INTER-CHIP OPTICAL COUPLING - A photonic integrated circuit (PIC) that includes an optical source that provides an optical signal having a wavelength is described. This optical source includes a reflecting layer, a bottom cladding layer, an active layer (such as a III-V semiconductor) having a bandgap wavelength that exceeds that of silicon, and a top cladding layer. Moreover, an optical coupler (such as a grating coupler) that couples the optical signal out of a plane of the active layer is included in a region of the active layer. In this region, the top cladding layer is absent. Furthermore, in an adjacent region, the top cladding layer includes an inverse taper so that the top cladding layer is tapered down from a width distal from the region. In conjunction with the optical coupler, the inverse taper may facilitate low-loss optical coupling of the optical signal between the PIC and another PIC. | 09-17-2015 |
| 20150256990 | AUTONOMOUS EVENT COMMUNICATION USING WEARABLE EMERGENCY RESPONDER EQUIPMENT - A system processes a series of incoming message to generate an outgoing message. In exemplary embodiments, the incoming messages comprise a first event from a wearable holster configured to accept a weapon, then receiving a second event from the wearable holster. The first signal and second signal are compared based on their respective content. The received signals derive from sensor data such as a switch, an accelerometer, a GPS sensor, a wrist device, a head device. The comparison invokes additional processing to determine the contents of a message to be sent to at least one recipient. Contents of messages are captured into a learning model, and when comparing contents of the first signal to contents of the second signal comprises the learning model is used to generate a prediction that causes an alert to be emitted. | 09-10-2015 |
| 20150254373 | GRAPHICAL TOP-DOWN PLANNING SYSTEM - A system is provided that visually represents a planning structure. The system displays a node that represents an element of the planning structure and a value associated with the element within a user interface. The system further receives a first user interaction that is a movement of a cursor over the node in a direction. The system further generates child elements within the planning structure in response to the first user interaction, where the child elements are children of the element. The system further generates values associated with the child elements, where a combination of the values is equal to the original value. The system further displays child nodes that represent the child elements and the values within the user interface. The system further displays lines between the node and the child nodes, where each line represents a parent-child relationship. | 09-10-2015 |
| 20150254330 | KNOWLEDGE-INTENSIVE DATA PROCESSING SYSTEM - Embodiments of the invention provide systems and methods for managing and processing large amounts of complex and high-velocity data by capturing and extracting high-value data from low value data using big data and related technologies. Illustrative database systems described herein may collect and process data while extracting or generating high-value data. The high-value data may be handled by databases providing functions such as multi-temporality, provenance, flashback, and registered queries. In some examples, computing models and system may be implemented to combine knowledge and process management aspects with the near real-time data processing frameworks in a data-driven situation aware computing system. | 09-10-2015 |
| 20150254240 | Instantaneous Unplug of Pluggable Database From One Container Database and Plug Into Another Container Database - A pluggable database is transported between a source DBMS and a destination DBMS, in a way that minimizes downtime of the pluggable database. While a copy of the pluggable database is being made at the destination DBMS, transactions continue to execute against the pluggable database at the source DBMS and change the pluggable database. Eventually, the transactions terminate or cease executing. Redo records generated for the transactions are applied to the copy of the pluggable database at the source DBMS. Undo records generated for at least some of the transactions may be stored in a separate undo log and transported to the destination DBMS. The transported pluggable database is synchronized at a destination DBMS in a “pluggable-ready state”, where it may be plugged into the destination container DBMS. | 09-10-2015 |
| 20150254141 | CENTRALIZED TAPE MANAGEMENT FOR DATABASES - A method, apparatus, and system for centralized tape management are provided for databases. A centralized availability machine or disk and tape backup server maintains working backup data for a plurality of database management systems (DBMSs) based on receiving, from each of the plurality of DBMSs, differential incremental updates. The updates may be at the database block level, with an index maintained to identify different versions of the blocks for snapshot recovery. The availability machine then determines a utilization schedule for distributing the working backup data to a plurality of tapes using a plurality of tape drives, and stores the working backup data as archived backup data on the plurality of tapes according to the utilization schedule. By placing each DBMS within a protection policy that indicates criteria to meet business goals with respect to tape backups, the utilization schedule can automatically schedule tape backup jobs with optimized hardware resource assignments. | 09-10-2015 |
| 20150253967 | AUTOMATIC VARIABLE ZOOMING SYSTEM FOR A PROJECT PLAN TIMELINE - A system is provided that performs automatic variable zooming. The system displays a project plan timeline within a user interface, where a project plan timeline includes one or more tasks and a timeline includes one or more time units. The system further receives an instruction to invoke automatic variable zooming on the displayed project plan timeline. The system further receives a criteria. The system further calculates one or more scores for the one or more time units of the project plan timeline based on the criteria. The system further adjusts a zoom level for one or more portions of the project plan timeline based on the one or more calculated scores. | 09-10-2015 |
| 20150244817 | SYSTEM AND METHOD FOR PREVENTING DENIAL OF SERVICE (DOS) ATTACK ON SUBNET ADMINISTRATOR (SA) ACCESS IN AN ENGINEERED SYSTEM FOR MIDDLEWARE AND APPLICATION EXECUTION - A system and method can support subnet management in a network environment, such as an engineered system for middleware and application execution or a middleware machine environment. The system can associate a subnet administrator (SA) in a subnet with one or more SA proxies. Furthermore, said one or more SA proxies can receive one or more requests from one or more client nodes. Then, said SA can handle said one or more requests, which are forwarded from said one or more SA proxies. Additionally, a dedicated queue pair (QP) number can be allocated for each client node, so that there is no need for always sending an initial request to a pre-defined well-known QP number. | 08-27-2015 |
| 20150244814 | ADAPTIVE CO-BROWSING - Embodiments of the invention provide systems and methods for adaptively and dynamically providing image-capture screen sharing or co-browsing within a screen sharing session. More specifically, screen sharing systems and methods described herein combine both HTML co-browsing and image-capture screen sharing technologies within a single screen sharing session, that is, without having to terminate the current screen sharing session to switch from one screen sharing technology to another screen sharing technology. As used herein, “screen sharing” encompasses both image-capture screen sharing and HTML co-browsing, and “a screen sharing session” can refer to either an image-capture screen sharing session or a HTML co-browsing session. | 08-27-2015 |
| 20150244572 | SYSTEM AND METHOD FOR SUPPORTING RELIABLE CONNECTION (RC) BASED SUBNET ADMINISTRATOR (SA) ACCESS IN AN ENGINEERED SYSTEM FOR MIDDLEWARE AND APPLICATION EXECUTION - A system and method can support subnet management in a network environment, such as an engineered system for middleware and application execution or a middleware machine environment. A subnet manager (SM) can retrieve information for setting up a reliable connection (RC) between a subnet administrator (SA) and a client node in a subnet. Furthermore, the system can set up one or more connection states for a port associated with the SM node to establish the RC connection between the port associated with the SM node and a port associated with said client node. Then, the SM can activate the port associated with said client node. | 08-27-2015 |
| 20150242209 | PROCESSOR EFFICIENCY BY COMBINING WORKING AND ARCHITECTURAL REGISTER FILES - A processor includes an execution pipeline configured to execute instructions for threads, wherein the architectural state of a thread includes a set of register windows for the thread. The processor also includes a physical register file (PRF) containing both speculative and architectural versions of registers for each thread. When an instruction that writes to a destination register enters a rename stage, the rename stage allocates an entry for the destination register in the PRF. When an instruction that has written to a speculative version of a destination register enters a commit stage, the commit stage converts the speculative version into an architectural version. It also deallocates an entry for a previous version of the destination register from the PRF. When a register-window-restore instruction that deallocates a register window enters the commit stage, the commit stage deallocates local and output registers for the deallocated register window from the PRF. | 08-27-2015 |
| 20150237669 | DIAMETER BASED COMMUNICATION SESSION DISCOVERY AND RECOVERY - A Diameter based network that includes nodes and accommodates Diameter communication sessions between nodes establishes a first Diameter communication session between a first node and a second node, and at some point determines that the first Diameter communication session is lost. The first node generates a query using a second Diameter communication session that is a different session than the first Diameter communication session. The first node transmits the query to the second node, where the query includes a session type and key identifiers for the first Diameter communication session. The second node re-establishes the first Diameter communication session with the first node and transmits, in response to the query, an indication that the first Diameter communication session exists. | 08-20-2015 |
| 20150237016 | PGP ENCRYPTED DATA TRANSFER - Example embodiments perform on-the-fly delivery of PGP encrypted data. A large data file is broken into chunks which are encrypted and delivered to a pipe object. The bytes of a chunk are read from the pipe object in the same order as they were written. Header and footer packets are prepared and delivered. | 08-20-2015 |
| 20150235299 | RULE BASED CLOSURE OF PURCHASE ORDERS - One or more computers may close a purchase order by use of rules. Certain embodiments use values of attributes of a line in a purchase order (PO) to identify a rule among multiple rules. The PO line's attributes which are used to identify the rule are internal to a buyer. When the rule which is identified is disabled, the line is retained unchanged in the purchase order. When the identified rule is not disabled, a user-specified logic which is identified in the rule is used to determine a new value of a numeric term, the numeric term having a preexisting value previously agreed upon by the buyer and the seller, e.g. in units of quantity or units of money. Subsequently, an indication of the line being changed in the purchase order is transmitted to the seller. User may specify different logics in different sets of rules, for different business units. | 08-20-2015 |
| 20150234933 | METHODS, SYSTEMS, AND COMPUTER READABLE MEDIA FOR A MULTI-VIEW DATA CONSTRUCT FOR LOCK-FREE OPERATIONS AND DIRECT ACCESS - Methods, systems, and computer readable media for a multi-view data construct that supports lock-free operations and direct access are disclosed. According to one aspect, a system includes a multi-view data construct including a persistent collection of elements, each element being associated with a unique identifier. Each element includes at least one pointer for configuring the element as a member of a linked list that contains as members elements of the multi-view data construct, data that indicates access status, and a data area within the collection itself or a pointer to a statically or dynamically allocated data area outside of the collection. A control module can identify elements in the collection by each element's respective identifier and can traverse elements in the collection using the pointers contained in each element. Concurrent access to an element by multiple entities is mediated using that element's access status and without using locks or locking operations. | 08-20-2015 |
| 20150234888 | Selecting From OR-Expansion States Of A Query - Methods, stored instructions, and computer systems are described for selecting an OR-expansion state of a query. A query processor accesses a certain query and a control parameter. The certain query comprises disjunctive predicates, and the control parameter indicates a certain procedure of a plurality of alternative stored procedures for expanding queries comprising disjunctive predicates into semantically equivalent candidate queries comprising combinations of subqueries. Based at least in part on the control parameter, the query processor selects the certain procedure to expand the certain query into one or more certain semantically equivalent candidate queries, each comprising a different combination of two or more subqueries. The query processor causes cost-based evaluation of subject queries, including the certain query and the one or more certain semantically equivalent candidate queries. The query processor then selects a query of the subject queries for execution or for further evaluation or transformation. | 08-20-2015 |
| 20150234869 | SEASONAL TRENDING, FORECASTING, ANOMALY DETECTION, AND ENDPOINT PREDICTION OF JAVA HEAP USAGE - Data can be categorized into facts, information, hypothesis, and directives. Activities that generate certain categories of data based on other categories of data through the application of knowledge which can be categorized into classifications, assessments, resolutions, and enactments. Activities can be driven by a Classification-Assessment-Resolution-Enactment (CARE) control engine. The CARE control and these categorizations can be used to enhance a multitude of systems, for example diagnostic system, such as through historical record keeping, machine learning, and automation. Such a diagnostic system can include a system that forecasts computing system failures based on the application of knowledge to system vital signs such as thread or stack segment intensity and memory heap usage. These vital signs are facts that can be classified to produce information such as memory leaks, convoy effects, or other problems. Classification can involve the automatic generation of classes, states, observations, predictions, norms, objectives, and the processing of sample intervals having irregular durations. | 08-20-2015 |
| 20150234686 | EXPLOITING PARALLELISM IN EXPONENTIAL SMOOTHING OF LARGE-SCALE DISCRETE DATASETS - A system, and computer program product for large-scale data transformations. Embodiments include a smoothing engine within an R environment to configure at least one master task and at least two worker tasks. A chunk calculator receives a series of data values and divides the series of data values into portions of data values which are in turn assigned as workloads to at least two worker tasks. The worker tasks serve to calculate a first state value of a first one of the portions of data values, and calculate a second state value of a second one of the portions of data values. The workloads are selected such that calculating a second state value does not depend on the first state value. The results of the workload calculations are used to calculate a smoothing factor used to predict a trend. | 08-20-2015 |
| 20150229768 | DYNAMIC AGENT WORKFLOW BASED ON CONTACT CENTER LOAD - Embodiments of the invention provide systems and methods for dynamically selecting a customer agent workflow for handling a customer contact in a contact center based on current contact center load. According to one embodiment, managing agent workflows in a contact center can comprise receiving a customer contact and selecting an agent from a plurality of agents to handle the customer contact. A current load of the contact center can be determined and a workflow for the selected agent to handle the customer contact can be dynamically selected from a plurality of workflows based on the determined current contact center load. | 08-13-2015 |
| 20150228005 | DISTRIBUTION MANAGEMENT FOR PURCHASE REQUISITIONS - Embodiments of the present invention are directed to techniques (e.g., systems and methods) for management and tracking of distribution and schedules of a purchase order associated with a purchase requisition. In certain embodiments, a procurement management system can manage information and relationships between split or new distribution and/or schedule requirements for a purchase order in fulfillment of a purchase requisition. In particular, information about a purchase requisition, such as a requisition identifier (requisition ID), can be stored and used later to manage and track distribution and/or schedules for fulfillment of one or more purchase orders. Using information stored about a relationship between a purchase requisition and the distributions and the schedules for a purchase order, a procurement management system can ascertain details about distribution and schedules of a purchase order for fulfillment of a purchase requisition. | 08-13-2015 |
| 20150227660 | INTEGRATED CIRCUIT CLOCK TREE VISUALIZER - A system that visualizes a clock tree for an integrated circuit receives an extracted cell library, an extracted clock netlist including clock headers and interconnects, and simulation results. The system generates an internal data structure for the clock headers, and divides the clock headers into a plurality of levels based on the interconnects. The system then orders the clock headers from a lowest level to a highest level, and displays the ordered clock headers in an untangled manner. | 08-13-2015 |
| 20150227597 | MECHANISM FOR SYNCHRONIZING OLAP SYSTEM STRUCTURE AND OLTP SYSTEM STRUCTURE - In an embodiment, for any structural change that is made to a relational database, a corresponding change is also made to the multidimensional database. In an embodiment, the system determines that a particular structure is not implemented on the multidimensional database system. Based on metadata that defines the structure that is supposed to exist in the multidimensional database, the appropriate structure is created. | 08-13-2015 |
