Abstract: Test cases are generated satisfying constraints from natural language descriptions in code by parsing source code to extract variables, and extracting constraints from a natural language description in the source code to retrieve boundary conditions on the variables. Mapping between the variables extracted from the source code and the constraints from the natural language description; and generating input variables satisfying the constraints provided from the natural language description. The method may further include executing the source code using the input variables satisfying the constraints provided from the natural language description.

Abstract: A method, system, and computer program product that is configured to: train at least one model based on a corpus of historical data comprising annotated historical tickets; extract a textual sequence of a historical ticket based on the at least one trained model; determine a sentiment of the textual sequence of the historical ticket; and generate mitigation guidance to mitigate an issue in a current ticket based on the textual sequence of the historical ticket and the determined sentiment of the textual sequence of the historical ticket.

Abstract: A method, computer program product and system are provided to generate perturbed text is provided. A processor receives a string of text from a user. A processor determines one or more classifications for at least one word in the string of text by a classification model. A processor determines a plurality of perturbations of the at least one word based on the one or more classifications, where the plurality of perturbations do not share the same one or more classifications as the least one word in the string of text. A processor selects a perturbation of the string of text based on (i) an edit distance between the string of text and the plurality of perturbations, and (ii) a fluency metric for each of the plurality of perturbations. A processor provides the perturbation of the string of text to the user.

Abstract: In an approach to risk prediction for bug-introducing changes, a computer retrieves one or more historic pull requests. A computer determines a unique file linking for each file included in the historic pull requests. A computer generates a file risk dataset. A computer performs chronological partitioning on the file risk dataset. A computer determines bug-introducing changes in the file risk dataset. A computer computes a collaborative file association between two or more of the files in the file risk dataset. A computer labels each of the files in the file risk dataset with an associated risk of introducing a bug. A computer generates a labelled file risk inducing ground truth dataset. A computer inputs the labelled file risk inducing ground truth dataset to a file risk prediction model. A computer extracts pull request features from the historic pull requests. A computer generates a pull request risk prediction model.

Abstract: In an approach to risk prediction for bug-introducing changes, a computer retrieves one or more historic pull requests. A computer determines a unique file linking for each file included in the historic pull requests. A computer generates a file risk dataset. A computer performs chronological partitioning on the file risk dataset. A computer determines bug-introducing changes in the file risk dataset. A computer computes a collaborative file association between two or more of the files in the file risk dataset. A computer labels each of the files in the file risk dataset with an associated risk of introducing a bug. A computer generates a labelled file risk inducing ground truth dataset. A computer inputs the labelled file risk inducing ground truth dataset to a file risk prediction model. A computer extracts pull request features from the historic pull requests. A computer generates a pull request risk prediction model.

Abstract: An approach for generating actionable explanations of change request classifications may be presented. A model may generate features associated with a change request may be disclosed. The model may be trained with historical change requests that have been labeled risky or not risky. The change request may be classified as risky or not risky. Candidate historical change requests with the same classification as the change request and occupying similar feature space as the change request may be identified from a historical change request repository. One or more features which had the most significant impact on the classification may be identified. A candidate historical change request with at least one significant feature impacting classification may be identified.

Abstract: Methods, computer program products, and/or systems are provided that perform the following operations: in an information technology (IT) management system, grouping one or more ongoing service failure events into a service failure record; identifying a representative event for the service failure record; identifying one or more conversations that relate to the one or more ongoing service events; computing, using a similarity algorithm, feature similarity scores for respective conversations of the one or more conversations based, at least in part, on the features associated with the representative event and features associated with the respective conversations; linking a subset of the one or more conversations to the one or more ongoing service events in the service failure record based, at least in part, on the computed feature similarity scores; and providing the service failure record to a collaboration platform utilized in addressing the one or more ongoing service events.

Abstract: One embodiment provides a method, including: receiving configuration input for a solar structure; the configuration input comprising (i) a geographical location, (ii) module configuration input, and (iii) reflector configuration input; identifying the position of the sun; determining an angle between the solar reflector and the solar module corresponding to a predetermined power gain for the solar module, wherein the determining comprises (i) identifying the corresponding area of the solar module that is illuminated by the solar reflector and (ii) totaling the contributions from each of the solar reflectors to calculate an irradiance for each solar cell; adjusting the angles of at least some of the solar reflectors with respect to the solar module to angles determined to correspond to the predetermined power gain using at least one actuator; and dynamically changing how the solar cells are electrically connected together to form a plurality of strings.

Abstract: A method and apparatus for optimizing channel access by an access point (AP) in a wireless local area network is provided, the method comprises transmitting first information to a station, and receiving second information from the station while transmitting the first information to the station, wherein the first information and the second information includes at least one of a request to send (RTS) frame, clear to send (CTS) frame, acknowledgement information, and data, respectively.

Abstract: One embodiment provides a method, including: receiving configuration input for a solar structure; the configuration input comprising (i) a geographical location, (ii) module configuration input, and (iii) reflector configuration input; identifying the position of the sun; determining an angle between the solar reflector and the solar module corresponding to a predetermined power gain for the solar module, wherein the determining comprises (i) identifying the corresponding area of the solar module that is illuminated by the solar reflector and (ii) totaling the contributions from each of the solar reflectors to calculate an irradiance for each solar cell; adjusting the angles of at least some of the solar reflectors with respect to the solar module to angles determined to correspond to the predetermined power gain using at least one actuator; and dynamically changing how the solar cells are electrically connected together to form a plurality of strings.

Abstract: A method and apparatus for optimizing channel access by an access point (AP) in a wireless local area network is provided, the method comprises transmitting first information to a station, and receiving second information from the station while transmitting the first information to the station, wherein the first information and the second information includes at least one of a request to send (RTS) frame, clear to send (CTS) frame, acknowledgement information, and data, respectively.

Abstract: A method and apparatus for optimizing channel access by an access point (AP) in a wireless local area network is provided, the method comprises transmitting first information to a station, and receiving second information from the station while transmitting the first information to the station, wherein the first information and the second information includes at least one of a request to send (RTS) frame, clear to send (CTS) frame, acknowledgement information, and data, respectively.

Abstract: A method and apparatus for a collision-free carrier sense multiple access (CSMA) are provided. The method of a node associated with a beacon enabled carrier sense multiple access (CSMA)-based wireless communication network through an access point (AP) includes receiving a beacon from the AP, the beacon comprising a back-off prime number and a beacon random number, and generating a back-off interval based on the beacon random number, the back-off prime number, a mapped identification (ID) of the node, and a current time slot of a frame of the beacon. The method and apparatus provide a collision-free CSMA scheme for a beacon enabled CSMA-based wireless communication network. In the collision-free CSMA scheme, uniformly distributed back-off intervals may be generated in a distributed fashion at each node for a CSMA-based wireless communication network. The back-off intervals may be correlated among the nodes even though the nodes do not communicate with each other.

Abstract: A method and apparatus for optimizing channel access by an access point (AP) in a wireless local area network is provided, the method comprises transmitting first information to a station, and receiving second information from the station while transmitting the first information to the station, wherein the first information and the second information includes at least one of a request to send (RTS) frame, clear to send (CTS) frame, acknowledgement information, and data, respectively.

Abstract: A method and apparatus for a collision-free carrier sense multiple access (CSMA) are provided. The method of a node associated with a beacon enabled carrier sense multiple access (CSMA)-based wireless communication network through an access point (AP) includes receiving a beacon from the AP, the beacon comprising a back-off prime number and a beacon random number, and generating a back-off interval based on the beacon random number, the back-off prime number, a mapped identification (ID) of the node, and a current time slot of a frame of the beacon. The method and apparatus provide a collision-free CSMA scheme for a beacon enabled CSMA-based wireless communication network. In the collision-free CSMA scheme, uniformly distributed back-off intervals may be generated in a distributed fashion at each node for a CSMA-based wireless communication network. The back-off intervals may be correlated among the nodes even though the nodes do not communicate with each other.

Abstract: A method and apparatus of scheduling and transmitting uplink packets within uplink sub-frames of a wireless system is disclosed. The method includes determining a size of a standard data unit, and determining if the standard data unit can be transmitted within a single sub-channel of an uplink frame by comparing the size of the standard data unit with a number of bits that can be transmitted within the uplink frame as determined by an uplink quality. If the standard data unit is too large to be transmitted within a single sub-channel of an uplink frame, then the standard data unit is divided into sub-data units. The sub-data units are transmitted over multiple uplink frames.

Abstract: A method and apparatus of scheduling and transmitting uplink packets within uplink sub-frames of a wireless system is disclosed. The method includes determining a size of a standard data unit, and determining if the standard data unit can be transmitted within a single sub-channel of an uplink frame by comparing the size of the standard data unit with a number of bits that can be transmitted within the uplink frame as determined by an uplink quality. If the standard data unit is too large to be transmitted within a single sub-channel of an uplink frame, then the standard data unit is divided into sub-data units. The sub-data units are transmitted over multiple uplink frames.

Abstract: A method and apparatus of scheduling and transmitting uplink packets within uplink sub-frames of a wireless system is disclosed. The method includes determining a size of a standard data unit, and determining if the standard data unit can be transmitted within a single sub-channel of an uplink frame by comparing the size of the standard data unit with a number of bits that can be transmitted within the uplink frame as determined by an uplink quality. If the standard data unit is too large to be transmitted within a single sub-channel of an uplink frame, then the standard data unit is divided into sub-data units. The sub-data units are transmitted over multiple uplink frames.