Abstract: The present disclosure relates to a method for enhancing quality of requirements for an application development. The method comprises retrieving expertise information of each user of groups involved in identifying requirements, domain knowledge of each user, information on number of defects associated with requirements and information of requirements for application development from sources. Then, skill score of the groups is computed using expertise information and domain knowledge of each user of corresponding groups. Solidity score of each of requirements is determined using information of requirements and predetermined threshold solidity score. Weightage score of each of requirements is computed based on information of requirements and information on number of defects. The, using skill score of groups, solidity score of each of requirements and weightage score, strength score of each of requirements is computed for enhancing quality of requirements.

Abstract: The management of applications in a computing environment often involves a significant number of computing operations, such as acquiring the application, deploying data objects in various locations, and configuring the application with respect to the deployed device. Conventional computing environments may provide inadequate support throughout a typical application life cycle, especially for a computing environment distributed across many devices. Instead, the computing environment may be represented in a deployable object hierarchy that may be distributed to various devices. An application management service may therefore be provided to install representations of the application in the object hierarchy, and to support many other aspects of the application life cycle, such as application discovery, sharing, updating, and removal.

Abstract: A stream of tuples is received to be processed by processing elements operating on one or more computer processors with each processing element having one or more stream operators. A breakpoint is identified for a stream operator that is configured to be triggered when time for processing of a tuple by the first stream operator is predicted to exceed a threshold time. A tuple is received at the stream operator having a set of attributes. A predicted time to process the tuple is determined based on the set of attributes. It is determined that the predicted time exceeds the threshold time. The breakpoint is triggered, in response to determining that the predicted time exceeds the threshold time, to pause processing of the tuple by the first stream operator.

Abstract: Systems, methods, and software described herein provide enhancements for deploying software applications in satellites. In one example, a control system may receive user input indicative of deployment requirements for a software application, and identify an availability of resources in a plurality of satellites deployed as an orbiting satellite platform. The control system further determines deployment options for deployment of the software application based on the deployment requirements and the availability of resources in the plurality of satellites, and provides the deployment options to a developer of the software application.

Abstract: System and method for creating a program. A program may be compiled, including determining one or more value transfer operations in the program. Each value transfer operation may specify a value transfer between a respective one or more source variables and a destination variable. For each of the one or more value transfer operations, the value transfer operation may be implemented, where the implementation of the value transfer operation may be executable to assign each variable of the value transfer operation to a respective memory resource, thereby mapping the variables to the memory resources, and dynamically change the mapping, including assigning the destination variable to the memory resource of a first source variable of the one or more source variables, thereby transferring the value from the first source variable to the destination variable without copying the value between the memory resources.

Abstract: In an approach for determining compatibility between a computing device and a software application, a processor receives code of a software application. A processor generates a call graph for the software application using the code, wherein the call graph describes at least a first type of hardware component required to execute the software application. A processor identifies a set of one or more hardware components included within a computing device. A processor determines whether the computing device is compatible with the software application based on, at least, the call graph and the determined set of one or more hardware components included within the computing device.

Abstract: A hierarchy of controls and parts, that are each in accordance with constraints of a computing executing context. A control is executable code that performs a function and which may impart a visualization. A part is a unit of visualization container that has its own visualization and/or shows visualizations from one or more compliant controls associated with the part.

Abstract: One or more processors determine whether a first procedure within a first program meets a first criterion. The first criterion is included in a plurality of criteria that are configured for pessimistic aliasing. Responsive to the determination, one or more processors determine whether to flag the first procedure for pessimistic aliasing.

Abstract: An application creation method, includes receiving, by the terminal, a property value of a component property configured by a user, generating a component model according to the property value of the component property, generating a component interface graphical element corresponding to the property value of the component property; mapping the component model as a function component model, graphically displaying the function component model as a function component graphical element according to the component interface graphical element, establishing an association relationship between different function component graphical elements in a to-be-created application according to an operation performed by the user on the function component graphical element, and generating a service function model according to the association relationship between the different function component graphical elements in the to-be-created application; and generating executable code of the to-be-created application according to the com

Abstract: A stream of tuples is received to be processed by processing elements operating on one or more computer processors with each processing element having one or more stream operators. A breakpoint is identified for a stream operator that is configured to be triggered when time for processing of a tuple by the first stream operator is predicted to exceed a threshold time. A tuple is received at the stream operator having a set of attributes. A predicted time to process the tuple is determined based on the set of attributes. It is determined that the predicted time exceeds the threshold time. The breakpoint is triggered, in response to determining that the predicted time exceeds the threshold time, to pause processing of the tuple by the first stream operator.

Abstract: A system and method optimizes hardware description generated from a graphical program or model having oversampling constraints automatically. The system may include a streaming optimizer, a resource sharing optimizer, a delay balancing engine, and a global scheduler. The streaming optimizer may transform vector data paths to scalar or smaller-sized vector data paths. The resource sharing optimizer may replace multiple, functionally equivalent blocks with a single shared block. The delay balancing may insert one or more elements to correct for data path misalignment. The global scheduler may place portions of the program or model into conditional execution sections and create control logic that controls the model sample times or steps that the portions are enabled. A validation model, a report, or hardware description code that utilizes fewer hardware resources may be generated from a modified version of the model that is created.

Abstract: A grammar of a first programming language is represented in member fields and data types of object-oriented classes of a second programming language as an empty program semantic tree. A parser builds a new program semantic tree that represents source code written in the first programming language. The new program semantic tree is built by a reflection technique in which the member fields and data types of the object-oriented classes of the second programming language as set out in the empty program semantic tree are modified during the building of the new program semantic tree.

Abstract: A debugger creates a lightweight process snapshot of a debuggee target process and performs in-process or function evaluation (func-eval) inspection against the copy. This allows most state in the debuggee process to stay intact because changes made by the func-eval are local to the process snapshot. Debugger operations that are too destructive to the original debuggee process can be performed on the process snapshot without threatening the real process. Process snapshots allow the debugger to perform a func-eval while isolating the debuggee process and not losing the actual state of the original debuggee process. A new process snapshot of the debuggee process is created when the current snapshot is corrupt due to a func-eval side effect. The debugger may also use a lightweight machine snapshot of the host debuggee machine and perform func-evals against that machine snapshot to further isolate kernel and other side effects.

Abstract: One or more processors determine whether a first procedure within a first program meets a first criterion. The first criterion is included in a plurality of criteria that are configured for pessimistic aliasing. Responsive to the determination, one or more processors determine whether to flag the first procedure for pessimistic aliasing.

Abstract: Examples of the disclosure provide for receiving a data set at a design surface from a data source, and inferring a first data type from the data set. A first control type is generated for the inferred first data type. A second data type is inferred from the data set and a second control type is generated for the inferred second data type, with the first control type and the second control type being different. A layout is generated for an application document that includes the first control type and the second control type.

Abstract: A Very Long Instruction Word (VLIW) processor having an instruction set with a reduced size resulting in a small number of bits being necessary to specify registers. The VLIW processor includes a register file, and first through third operation units, and executes a very long instruction word. Further, the very long instruction word includes a register specifying field which specifies a least one of the registers in the register file and a plurality of instructions. The operand of each instruction includes bits src1, src2, and dst, which indicate whether or not the registers specified by the register specifying field are to be used as the source register and the destination register.

Abstract: Embodiments of the present invention provide an application upgrade method and an apparatus. The application upgrade method includes: receiving an application deployment request; determining a deployment package of a to-be-deployed application; determining that a version of a first platform node is below a version requirement of a node template of the to-be-deployment application for a first platform node template; acquiring a first platform node upgrade package that meets the version requirement of the node template of the to-be-deployed application for the first platform node template; upgrading the first platform node indicated by an identifier of the first platform node by using the first platform node upgrade package; determining an identifier of a to-be-upgraded application node; and upgrading the application node indicated by the identifier of the to-be-upgraded application node by using the deployment package of the to-be-deployed application.

Abstract: More robust testing of computer module responses to processing errors using a flexible, lightweight solution that does not alter the computer module. Through modification of processing pointers, a wide variety of processing errors and delays are injected into a computer module without modifying the computer module.

Abstract: Systems, methods, and software are described herein for operating a data management system, including executing an attached application and application data on a first virtual machine running a first operating system, separating the attached application and application data from the first virtual machine, and dynamically attaching the application and application data to a second virtual machine running an updated version of the first operating system.

Abstract: A test-centric model of an application is constructed. Each resource specified by each test governing an application is added to the test-centric model. The test or tests specifying an resource are linked to the resource within the test-centric model. A composition of the application is defined using the one or more tests, as the resources specified by the one or more tests, within the test-centric model of the application.