Patent application number | Description | Published |
20100281433 | Computer Method and Apparatus Specifying Avatar Entrance and Exit - Computer method and apparatus controls avatar relative to a subject virtual environment, in particular entrance to and/or exit from the subject environment. An entrance/exit specification engine provides a plurality of characteristics of the subject environment and/or of an avatar representing a corresponding user in the subject environment. A script generator responsive to the entrance/exit specification engine generates scripts as a function of the plurality of characteristics. The generated scripts form a script collection executable with the avatar. Execution of the generated scripts on a processor of the corresponding user controls avatar entrance to and/or exit from the subject environment. | 11-04-2010 |
20100298998 | Dynamic Specification of Power Supply Sources - A method, a system and a computer program product for specifying the source of power and provider of carbon offsets for an electrical device or service. A power supply specification (PSS) utility enables a user or program to specify a preferred blend of power sources and preferred carbon offset provider via a set of programmable requirements and the utility dynamically configures the electrical device or service, based on those requirements. The PSS utility determines the instantaneous power consumption of the device based on the outputs of sensors that measure voltages and currents associated with the operation of the device. The PSS utility compares the device's power consumption with the power from available power generating sources against the set of programmable requirements. When the available power is unable to satisfy the programmable requirements and/or is not sufficient to fully power the device, the PSS utility automatically places the device into a reduced power state. The PSS utility reports information about the device's power consumption to the power supplier. | 11-25-2010 |
20100321378 | Computer Method and Apparatus Providing Interactive Control and Remote Identity Through In-World Proxy - Computer method and apparatus render views of a computer generated virtual world to a remote viewer. The invention method and apparatus establish an avatar of a resident user as a proxy on behalf of the remote viewer. The computer node of the resident user exports proxy avatar views of the virtual world to the remote viewer. The remote viewer computer renders the exported virtual world views without executing virtual world application programs. | 12-23-2010 |
20110010309 | INTELLECTUAL PROPERTY ASSESSMENTS BASED ON COMPONENT BUSINESS MODELS - An embodiment of the invention provides a method for IP assessment based on a component business model (CBM). The method assesses components in the CBM via a component assessment module, which interrogates an entity (e.g., a user, a third party consultant, and an information database) with questions. Output (including answers to the questions) from the component assessment module is sent to a component detection module. Scores (e.g., numerical scores and/or low, medium, or high scores) are assigned to the components via the component detection module based on the output from the component assessment module. The output from the component assessment module and/or the scores are analyzed to determine whether a gap, a duplication, a conflict, and/or an over-investment exists in at least one of the components. | 01-13-2011 |
20110302144 | Dynamic Real-Time Reports Based on Social Networks - A system for analyzing social networks includes a memory storing a social network data structure, a correlation engine, a trigger function module, and a reporting module. The social network data structure includes a plurality of attributes, a plurality of nodes, each of the nodes corresponding to an entity and having at least one of the attributes associated with the entity, and at least one connection connecting at least two of the nodes. The system also includes at least one processor, coupled to the memory. The at least one processor is operative to execute the correlation engine to examine at least one of the nodes as a subject node. The subject node is coupled to at least one other one of the nodes, comprising a data node, by at least the at least one connection. The examination by the correlation engine is carried out to determine at least one of the attributes comprising a related attribute of the subject node and the at least one other one of the nodes, comprising the data node. The at least one processor is also operative to execute the trigger function module to determine if the reporting module should be executed to provide the report. Further, responsive to determining that the reporting module should be executed, the at least one processor is operative to execute the reporting module to provide a report indicating a correlation assessment to the subject node, the correlation assessment being related to the at least one related attribute. A method, apparatus, and computer program product are also provided. | 12-08-2011 |
20120113323 | COMPARING LOW QUALITY BROADCASTS TO HIGH QUALITY BRAODCASTS - A system, method, and computer program product for comparing a low quality broadcast to a high quality broadcast on a display device to show users the benefits of a high quality broadcast over a low quality broadcast. The display device capabilities are detected and compared to retrieved requirements for displaying a high quality broadcast. If the display requirements are met, retrieving the high quality broadcast and displaying the low quality and high quality broadcasts on a display device for user comparison. Then, the user accepts either the high quality or low quality broadcast and displays the high quality broadcast or the low quality broadcast in accordance with the user selection. | 05-10-2012 |
20120130872 | PARKING MANAGEMENT - A parking management approach includes associating a payment source with a vehicle identifier. The approach also includes receiving a message indicating initiation of a parking event at a parking location, and updating a parking database to indicate that a vehicle having the vehicle identifier is parked at the parking location. The message includes an identification of at least one of the payment source and the vehicle identifier. | 05-24-2012 |
20120131475 | SOCIAL NETWORK BASED ON VIDEO RECORDER PARENTAL CONTROL SYSTEM - A computer system, computer program product, and method of sharing and creating social network reviews of selected programs that may be viewed and shared over a social network. If a user agrees with a social network review already present for a selected program, the categorization and editing of inappropriate content of the selected program may be applied to the same program for that user. If a user disagrees with a social network review of a selected program already present, the user may review the selected program and edit any inappropriate content as desired and submit the review to the social network. | 05-24-2012 |
20120131631 | TRANSFERRING A BROADCAST TRANSMISSION TO A REMOTE DEVICE - An approach is described that includes determining that a remote device has moved outside of a pre-defined area associated with a digital video recorder (DVR), and transmitting program data from the DVR to the remote device while the remote device remains outside of the pre-defined area. Another approach includes a digital video recorder (DVR) having a memory and a processor. The DVR operates to: receive an incoming transmission signal; transmit a selected program to a primary display device; determine that a remote device has moved outside of a pre-defined area; and transmit program data corresponding to the selected program to the remote device while the remote device remains outside of the pre-defined area. | 05-24-2012 |
20120198489 | DETECTING FRAUD USING SET-TOP BOX INTERACTION BEHAVIOR - A processor can receive user interaction data indicative of interactions between a user and a set-top box device. The processor can compare a behavior pattern in the received user interaction data and a behavior pattern in previously stored data contained within a user profile for a human. The processor can generate a score indicative of a likelihood that the behavior pattern in the received data matches the behavior pattern in the previously stored data. Responsive to the generated score being below a threshold, the processor can generate an indication of a possible fraudulent action due to the user having a high likelihood of not being the human. | 08-02-2012 |
20120198491 | TRANSPARENTLY VERIFIYING USER IDENTITY DURING AN E-COMMERCE SESSION USING SET-TOP BOX INTERACTION BEHAVIOR - A set-top box device can detect a user interaction associated with a remote control proximate to the set-top box device. The set-top box device can store the user interaction within a storage device as user interaction data. The set-top box device can convey the user interaction data to a remotely located server. The set-top box device can receive a response from the remotely located server indicating that a behavior pattern in the interaction data is substantially equivalent to a behavior pattern in previously stored interaction data of a behavior profile. The response can verify the identity of the user. | 08-02-2012 |
20120204257 | DETECTING FRAUD USING TOUCHSCREEN INTERACTION BEHAVIOR - A processor can receive data indicative of interactions between a user and a touchscreen-equipped electronic device. The processor can compare a behavior pattern in the received data and a behavior pattern in previously stored data contained within a user profile for a human. The processor can generate a score indicative of a likelihood that the behavior pattern in the received data matches the behavior pattern in the previously stored data. Responsive to the generated score being below a threshold, the processor can generate an indication of a possible fraudulent action due to the user having a high likelihood of not being the human. | 08-09-2012 |
20120215832 | PUBLISHER-BASED MESSAGE DATA CASHING IN A PUBLISH-SUBSCRIPTION ENVIRONMENT - Embodiments of the present invention provide an approach for a broker-assisted, publisher side cache that can be utilized to reduce a volume of data (e.g., network traffic) delivered between a publisher and broker in a publication/subscription (pub/sub) environment. Specifically, in a typical embodiment, when a message is received on a broker system from a publisher system, the broker system analyzes the message for potentially repetitive data. Such data can be determined from historical messages (e.g., determining that a certain set of data appeared in multiple messages and is thus flagged in a database or the like), a set of rules (e.g., if data set “Y” appears, flag it as potentially repetitive), etc. Regardless, once such a set of data has been identified, a unique identifier/key corresponding thereto will be sent back to the publisher system and the set of data will be stored in a (data) cache. Upon receipt, the publisher system will cache/store the unique identifier in a (key) cache. Then, when the publisher system generates a future message that would contain the same set of data, the publisher system will substitute the unique identifier (as retrieved from the key cache) for the set of data to yield an abbreviated/truncated message. The abbreviated message would be sent to the broker system, which would: analyze the message; locate the unique identifier; retrieve the corresponding set of data from the (data) cache; replace the unique identifier with the set of data to yield a completed message; and then send the completed message to relevant subscriber system(s). | 08-23-2012 |
20120215858 | CACHING POTENTIALLY REPETITIVE MESSAGE DATA IN A PUBLISH-SUBSCRIPTION ENVIRONMENT - In general, embodiments of the present invention provide an approach for caching potentially repetitive data in a publication-subscription (pub/sub) system. Specifically, in a typical embodiment, when a message is received on a broker system from a publisher system, the broker system analyzes the message for potentially repetitive data. Such data can be determined from historical messages (e.g., determining that a certain set of data appeared in multiple messages and is thus flagged in a database or the like), a set of rules (e.g., if data set “Y” appears, flag it as potentially repetitive), etc. Regardless, once such a set of data has been identified, the set of data will be tagged/marked in the message with a unique identifier. The message and inserted unique identifier is then sent to the relevant subscriber system(s). Upon receiving the message, the subscriber system(s) will analyze the message, identify the unique identifier, and cache the tagged data. Thereafter, when the publisher system receives another message that contains the same set of data that was previously tagged, the publisher system will substitute the unique identifier for the repeated data to yield an abbreviated message. The publisher system will then send the abbreviated message to the subscriber system(s), which will analyze the abbreviated message, identify the unique identifier, and retrieve the associated data from cache. Thus, the substitution of unique identifiers for potentially repetitive data can avoid unnecessary communication of data and reduce overall network bandwidth consumption. | 08-23-2012 |
20120215859 | PUBLISHER-ASSISTED, BROKER-BASED CACHING IN A PUBLISH-SUBSCRIPTION ENVIRONMENT - Embodiments of the present invention provide an approach for a publisher-assisted, broker-based cache that can be utilized to reduce a volume of data (e.g., network traffic) delivered between a publisher and broker in a publication/subscription (pub/sub) environment. Specifically, in a typical embodiment, when a message is being generated on a publisher system, the publisher system will determine if the message includes a set of data that has a potential to be repeated in subsequent messages. Once such a set of data has been identified, the set of data will be associated/marked/tagged (e.g., in the message) with a unique identifier/cache key corresponding thereto (i.e., to yield a modified message). The modified message will be sent to a broker system, which will detect/locate the unique identifier, cache the corresponding data, and send the message along to any applicable subscriber systems. When a subsequent message that is supposed to contain the cached set of data is generated, the publisher system will instead substitute the unique identifier for the set of data to yield an abbreviated message and send the abbreviated message to the broker system. Upon receipt, the broker system will detect/locate the unique identifier, retrieve the corresponding set of data from the cache, replace the unique identifier with the set of data to yield a completed message, and then send the completed message to the applicable subscriber systems. | 08-23-2012 |
20120219136 | TELEPHONY SERVICES OPTIMIZATION THROUGH CALLING PLAN ANALYSIS - Embodiments of the present invention provide optimization of telephone services through telephone calling plan/card analysis. The least expensive rate is found for telephone calls at any given time and/or date, either through static pre-entry of data, or through dynamic querying of rates via a web-based look-up table, and places calls according to an optimized calling plan. Specifically, in a typical embodiment, an outgoing/target telephone number for an intended telephone call is captured, and a corresponding destination geographic region is identified. Based on the geographic region, a calling plan resulting in a lowest price for the telephone call is identified. This is typically accomplished by consulting at least one table (e.g., call information table) that associates (among other things) calling plans and/or calling cards with geographic regions. Once a calling plan and/or calling card is identified/selected, a corresponding set of dialing instructions will be obtained from the table and used to make/place the telephone call. | 08-30-2012 |
20120221650 | BROKER FACILITATED PEER-TO-PEER PUBLISHER COLLABORATION IN A PUBLISH-SUBSCRIPTION ENVIRONMENT - Embodiments of the present invention provide an approach for broker facilitated, publisher peer-to-peer (P | 08-30-2012 |
20120246008 | IMPLEMENTING COMPUTER INTERACTION RESPONSE TESTS - Embodiments of the present invention provide an approach for enhancing computer interaction challenge-response tests (e.g., Completely Automatic Public Turing Test to Tell Computers and Humans Apart, or CAPTCHA). Furthermore, embodiments of the present invention provide an approach for introducing advertising in such challenge-response tests, such that users are presented with opportunities to learn about or reinforce brands. In a typical embodiment, when a user attempts to access content (e.g., web content), the user will be presented with a CAPTCHA test. The CAPTCHA test typically includes an advertisement (e.g., logo, label, etc.) and an associated question for the user to answer. Along these lines, the advertisement is generally selected based on the user's demographics (e.g., interests, gender, age, etc.). If the user successfully responds to the question and/or responds within a certain amount of time, a reward can be determined (e.g., access to the content, preferred placement in a queue for computing resources, etc.). In one embodiment, a cumulative points total can be maintained for the user based on cumulative responses to CAPTCHA tests. In this embodiment, the CAPTCHA tests presented to the user can have increasing levels of difficulty with corresponding rewards. | 09-27-2012 |
20120246219 | SHARED CACHE FOR POTENTIALLY REPETITIVE MESSAGE DATA IN A PUBLISH-SUBSCRIPTION ENVIRONMENT - In general, embodiments of the present invention provide an approach for caching potentially repetitive data in a publication-subscription (pub/sub) environment. Specifically, in a typical embodiment, when a message is received on a broker system from a publisher system, the broker system analyzes the message for potentially repetitive data. Such data can be determined from historical messages (e.g., determining that a certain set of data appeared in multiple messages and is thus flagged in a database or the like), a set of rules (e.g., if data set “Y” appears, flag it as potentially repetitive), etc. Regardless, once such a set of data has been identified, the set of data will be cached, and a unique identifier/tag corresponding thereto will be sent to the publisher system and to applicable subscribers. Thereafter, any subsequent message including the same data will contain the unique identifier in place of the cached data (i.e., an abbreviated message). The abbreviated message can be sent from the publisher system to the broker system, and then onto the subscriber system, which will retrieve the data from the shared cache and replace the unique identifier in the abbreviated message with the cached data to yield a complete message. Thus, once data has been cached, there is only a need to send an abbreviated message, which will save network bandwidth. | 09-27-2012 |
20120290678 | DYNAMIC, USER-DRIVEN SERVICE CATALOG - Embodiments of the invention are directed to a dynamic, user-driven service catalog based on real-time inputs by an end-user based on an automated evaluation process. Authorized end-users may directly submit services into the service catalog that are of value to the end-user, his/her peers, departments, groups, etc. Each service is analyzed to determine its viability as it matches an organization's cost and product offerings. This approach allows for more complex IT service models, wherein concurrent service requests can be compared, analyzed, and eventually fulfilled. Specifically, a catalog update tool provides this capability. The catalog update tool includes a plausibility engine configured to receive a request to add a service to a service catalog and evaluate whether the request can be added to the service catalog based on an analysis of system-integrated criteria. The catalog update tool further includes a cost engine to determine a cost for fulfilling the request, and a service request management module configured to add the service to the service catalog based on the analysis of system-integrated criteria and the cost for fulfilling the request. | 11-15-2012 |
20130041989 | DYNAMICALLY RELOCATING WORKLOADS IN A NETWORKED COMPUTING ENVIRONMENT - Embodiments of the present invention provide an approach for dynamically relocating a set of workloads among geographic regions of a networked computing environment (e.g., a cloud computing environment) based on infrastructure/computing resource needs. In a typical embodiment, it is determined whether a first geographic region of the networked computing environment has a first set of computing resources with an available capacity that meets a needed capacity for handling a set of workloads that is initially associated with the first geographic region. If not, a second geographic region of the networked computing environment having a second set of computing resources with the needed capacity is identified. In general, this determination can be made based upon multiple factors such as: a set of performance requirements, stored in at least one computer data structure, needed to handle the set of workloads; a set of environmental parameters, stored in the at least one computer data structure, having a potential to affect the handling of the set of workloads; and/or a set of cost parameters, stored in the at least one computer data structure, associated with handling the set of workloads. Once the second geographic region has been identified, the set of workloads can be associated with and handled thereby. | 02-14-2013 |
20130042004 | DYNAMICALLY ACQUIRING COMPUTING RESOURCES IN A NETWORKED COMPUTING ENVIRONMENT - Embodiments of the present invention provide an approach for dynamically acquiring computing resources in a networked computing environment (e.g., a cloud computing environment) based on infrastructure/computing resource needs. In a typical embodiment, a set of computing resources (needed to process a set of workloads) external to a first portion of a networked computing environment is identified. Once identified, electronic negotiations with at least one provider of the set of computing resources may be held for utilizing the provider's set of computing resources to process the set of workloads. In general, the negotiations are based on at least one resource registration (setting forth terms for utilizing the set of computing resources such as usage rates, usage limitations, etc.) associated with the at least one provider stored in at least one computer data structure. Responsive to successful completion of the negotiations, the set of computing resources will be associated with the first portion. Such association can occur through various methods such as utilizing computing resources in public cloud environments, expanding the first portion to include the set of computing resources, etc. | 02-14-2013 |
20130042005 | DYNAMICALLY EXPANDING COMPUTING RESOURCES IN A NETWORKED COMPUTING ENVIRONMENT - Embodiments of the present invention provide an approach for dynamically expanding cloud capacity (e.g., computing resources), based on infrastructure needs. In a typical embodiment, an available capacity of a set (e.g., at least one) of computing resources in the networked computing environment will be determined. Then, a future capacity needed for processing a set of workloads in the networked computing environment will be forecasted. Such a forecast can be made based on multiple factors/approaches. For example, the forecast can be made based upon at least one of the following: an average consumption of the set of computing resources over a predetermined period of time, a periodic estimation of consumption of the set of computing resources, a scheduled consumption of the set of computing resources, and/or a potential capacity of the set of computing resources. In general, the scheduled consumption can be determined based on at least one resource consumption schedule stored in a computer data structure, while the potential capacity can be determined based upon a set of application events associated with the set of workloads. Regardless of the approach utilized, once the future capacity has been forecasted, it will be determined whether the future capacity exceeds the available capacity. If so, the available capacity of the set of computing resources will be expanded (e.g., hardware and/or software elements will be added to the networked computing infrastructure and/or made available) until the available capacity at least meets the future capacity. | 02-14-2013 |
20130124704 | RELEASING COMPUTING INFRASTRUCTURE COMPONENTS IN A NETWORKED COMPUTING ENVIRONMENT - Embodiments of the present invention relate to the release of computing infrastructure components (e.g., hardware, software, combinations thereof, etc.) from a networked computing environment for potential use by another networked computing environment. In a typical embodiment, a computing infrastructure component is identified from set of computing infrastructure components associated with a networked computing environment. It may then be determined whether the computing infrastructure component can be released from the networked computing environment. Then, responsive to the determination, the computing infrastructure component may be released from the networked computing environment. | 05-16-2013 |
20130173597 | COMPUTING RESOURCE ALLOCATION BASED ON QUERY RESPONSE ANALYSIS IN A NETWORKED COMPUTING ENVIRONMENT - An approach for allocating computing resources based on a confidence level associated with responses to queries is provided. In a typical embodiment, a query is received from a querying user, and a search for a response to the query is conducted. A confidence level associated with the response is then determined. If the confidence level of the response does not meet a predetermined threshold, additional computing resources are allocated, and the search and corresponding response are updated (e.g., iteratively). An updated confidence level based on the updated response is then determined. Once the predetermined threshold has been met by the confidence level of the response, the response can be returned to the querying user. | 07-04-2013 |
20130179230 | ORGANIZATIONAL AGILITY IMPROVEMENT AND PRIORITIZATION ACROSS MULTIPLE COMPUTING DOMAINS - Embodiments of the present invention provide an approach for determining and/or enhancing an organization's agility across one or more computing domains. Among other things, embodiments of the present invention parse and mine organizational documents for relevant data, calculate and weight business agility scores, determine improvements to optimize domain elements to ensure optimal outcomes for customers, prioritize improvements, and/or provide organization agility information for transfer to consultants or the like. It is understood that these functions may be used independently or in conjunction with each other depending on the scope of improvement desired for a particular organization. | 07-11-2013 |
20130179232 | ORGANIZATIONAL AGILITY DETERMINATION ACROSS MULTIPLE COMPUTING DOMAINS - Embodiments of the present invention provide an approach for determining and/or enhancing an organization's agility across one or more computing domains. Among other things, embodiments of the present invention parse and mine organizational documents for relevant data, calculate and weight business agility scores, optimize domain elements to ensure optimal outcomes for customers, and/or provide organization agility information for transfer to consultants or the like. It is understood that these functions may be used independently or in conjunction with each other depending on the scope of improvement desired for a particular organization. | 07-11-2013 |
20130185205 | SECURE TRANSACTION AUTHORIZATION - Provided is an approach for credit transaction authorization/approval. Specifically, a particular transaction payment device/mechanism (e.g., credit card, etc.) may be associated with a set of purchase authorization criteria/rules that sets forth specific conditions (e.g., an authorization protocol) under which the transaction payment device may be utilized. When a user later attempts to conduct a proposed credit transaction using the transaction payment device, it will be determined whether the proposed credit transaction complies with this set of purchase authorization criteria (e.g., the authorization protocol). Based on this determination, the proposed credit transaction can be approved or declined. | 07-18-2013 |
20130204963 | MIGRATING DATA BETWEEN NETWORKED COMPUTING ENVIRONMENTS - Embodiments of the present invention provide an approach for predictively migrating data between network computing environments (e.g., cloud computing environments). Specifically, in a typical embodiment, data access patterns for sets of data utilized by a set of services running in a first networked computing environment may be analyzed. Based on the analysis one or more of the sets of data may be identified as candidates to be migrated from the first networked computing environment to a second networked computing environment. Then, a data migration protocol for the one or more sets of data to be migrated to the second networked computing environment may be generated based on the data access patterns and a predicted data migration time. Based on the data migration protocol, the one or more sets of data may then be migrated to the second networked computing environment. | 08-08-2013 |
20130311535 | AGGREGATING INTERNET ADDRESSES IN A NETWORKED COMPUTING ENVIRONMENT - Embodiments of the present invention provide an approach for aggregating Internet addresses (e.g., Uniform Resource Locators (URLs)) in a networked computing environment. In a typical embodiment, a set of URLs is received (e.g., by a system/engine). Upon receipt, a composite URL comprising at least portions of each received URL is generated and associated with a newly generated web page. The received set of URLs are displayed on the web page in a list, or the like, that may be sorted according to a set of criteria. | 11-21-2013 |
20130311988 | MIGRATING VIRTUAL MACHINES BETWEEN NETWORKED COMPUTING ENVIRONMENTS BASED ON RESOURCE UTILIZATION - Embodiments of the present invention relate to the migration of virtual machines (VMs) between networked computing environments (e.g., cloud computing environments) based on resource utilization. Specifically, embodiments of the present invention provide an approach to select an optimal set (one or more) of VMs as candidates for pre-staged migration. In a typical embodiment, when a first cloud environment nears physical resource capacity, an optimal set of VMs will be identified for migration to a second cloud environment that has sufficient capacity to accommodate workload(s) from the first cloud environment. To make this process more efficient, data associated with the set of virtual machines may be “pre-stage” replicated from the first cloud environment to the second cloud environment (e.g., in advance of the migration of the identified set of VMs). | 11-21-2013 |
20130339365 | INTEGRATED DEVELOPMENT ENVIRONMENT-BASED REPOSITORY SEARCHING IN A NETWORKED COMPUTING ENVIRONMENT - Embodiments of the present invention provide an approach for integrated development environment (IDE)-based repository searching (e.g., for library elements such as classes and/or functions) in a networked computing environment. In a typical embodiment, a first program code file is received from a first integrated development environment (IDE). The first program file may be associated with a set of attributes as stored in an annotation, header, or the like. Regardless, the first program file may be parsed and indexed into a repository based on the set of attributes. A search request may then be received from a second IDE. Based on the search request and the set of attributes, a matching program code file may then be identified as stored in the repository. Once identified, the matching program code file may be transmitted/communicated to the second IDE to fulfill the search request. | 12-19-2013 |
20130339920 | INSTANTIATING A CODING COMPETITION TO DEVELOP A PROGRAM MODULE IN A NETWORKED COMPUTING ENVIRONMENT - Embodiments of the present invention relate to the instantiation of a coding competition to address problems in program modules. In a typical embodiment, a first annotation will be detected in a program code file having a set of program modules. The first annotation generally indicates a need for a functionality associated with at least one program module of the set of program modules. Responsive to a lack of an existing library comprising the solution, an indication to instantiate a coding competition among a set of developers will be received to provide the solution. In response to the indication, a second annotation will be inserted into the program code file. The coding competition may then be instantiated to identify a set of developer libraries having a potential to provide the solution. Based on the coding competition, the solution may then be identified and implemented. | 12-19-2013 |
20140019933 | SELECTING A DEVELOPMENT ASSOCIATE FOR WORK IN A UNIFIED MODELING LANGUAGE (UML) ENVIRONMENT - An approach is provided for selecting a development resource to develop a component in a Unified Modeling Language (UML) software system architecture. Specifically, a request for a developer is received from an architect. A component for the developer is determined and candidate analytics is performed on the component. Based on the candidate analytics, a list of potential candidates is presented to the architect. A developer is then selected from the list of candidates. | 01-16-2014 |
20140059127 | BROKER DESIGNATION AND SELECTION IN A PUBLISH-SUBSCRIPTION ENVIRONMENT - Approaches for designating and/or selecting broker systems in a publication-subscription (pub-sub) messaging environment are provided. In one approach, a subscriber system may be designated as a broker system based on a capability of the subscriber system to function as a broker system for its peers. In another approach, a broker system may be selected from among a plurality of broker systems based upon a cache directory that identifies the content/messages that each broker system may have cached. If a particular broker system has previously cached content that is at least similar to an intended message, that particular broker system may be selected for distributing the intended message to a set of subscriber systems. | 02-27-2014 |