Abstract: In an example embodiment, a solution is provided that aggregates records as they are submitted to a third party (on the write path) rather than performing a real-time aggregation when a request is processed that needs the aggregation (read path). More particularly, in an example embodiment, a caching layer is introduced that avoids having to read all usage events to compute an aggregation when a request is received for aggregated data. The caching layer maintains values for various metrics that require aggregation.

Abstract: A method and apparatus for deleting resources are described.

Abstract: Privacy cells can be configured to enable segmented control. A privacy cell can include a segmented array of electrodes that allow segments of liquid crystal to be independently controlled. By independently applying a voltage to each electrode, the liquid crystal within each segment can be independently oriented at a desired angle for a particular mode of operation.

Abstract: Methods, computer program products, and/or systems are provided that perform the following operations: determining that a log multi-process debug mode is specified; obtaining a log file for debugging a source code, wherein the log file includes a plurality of log records; inserting a plurality of process identifier fields into each current log record in the log file; inserting a new log record into the log file for a created new process; and providing for performance of debugging for the source code based in part on the plurality of process identifier fields inserted into each current log record.

Abstract: A device capability discovery method and a P2P device are provided, and relate to the communications field and the distributed hardware field, to shorten time consumed to obtain capability information of a discovered device. A P2P device receives a probe request frame from another device. The P2P device returns a probe response frame including capability information of the P2P device. A device that receives the probe response frame can obtain a capability of the device in a device discovery phase. Alternatively, a P2P device sends a probe request frame including capability information of the P2P device to another device, so that the another device can obtain a capability of the device in a device discovery phase.

Abstract: A computer-implemented method includes receiving, by a processor, an updated version of a computer program that includes several source code changes. A compiler preprocesses the source code changes for a target computing platform. The preprocessing includes identifying a compile time condition associated with one or more computer instructions enclosed by a macro, determining a current value of the compile time condition at the time of compiling, and determining corresponding object code based on the current value. Further, a macro information record for the macro is generated that includes the compile time condition, the current value, and an identification of the computer instructions. Further, a linker preprocesses the source code changes. This preprocessing includes determining that the object code is not included in an executable file, and updating the macro information record to indicate that the macro is not included in the executable file.

Abstract: Data services for workloads are often provided with a service level agreement specifying various performance guarantees (e.g., latency, availability, scalability, and consistency). Single-master architectures, in which updates t the data set are constrained to a single server, may limit the fulfillment of some performance guarantees. Presented herein are multi-master architectures, in which the server set is partitioned into at least two masters are permitted to update the data set and at least one non-master that is not permitted to update the data set. Non-masters that receive a request to update the data set forward the request to a master server for application to the data set. A master that receives the request applies it to the data set and propagates the update to other master and non-master servers. Conflicting updates may be resolved through a variety of conflict resolution techniques, optionally designating one master server as a conflict resolution server.

Abstract: A dock data structure is introduced. An instance of the clock data structure can be attached to a billing data structure, such as a billing data structure that corresponds to a recurring payment. The instance of the clock data structure has a value that represents a frozen time—i.e., a specific time that does not change unless instructed to. The billing data structures to which the clock data structure is attached operate as if the real time is the frozen time on the clock. Since the time is frozen, users wishing to test the billing data structure can update their system configurations at specific times, and subsequently advance the time in the clock data structure instance to see the effects on those configurations, as well as on other parts of the system, including asynchronous messaging and processing, and processes that involve other entities.

Abstract: A method and apparatus for performing cross-platform contract validation are described. In one embodiment, the method for validating compatibility between first and second endpoints, the method comprising: accessing a memory storing a machine-readable contract specifying a request-response pair in a file, the request-response pair consisting of an expected request that the second endpoint expects to receive from the first endpoint and an expected response that should be provided by the second endpoint according to the expected request from the first endpoint; and performing multi-platform contract validation by performing independent tests for the first and second endpoints, using the expected request and expected response specified in the machine-readable contract.

Abstract: A method and apparatus for a first service processing system receiving and responding to a service request using a time context of a service time protocol is described. The method may include receiving a network based message associated with a service. The method may also include determining whether a service time context has been passed to the first service processing system from a second service processing system in the request. Furthermore, the method can include when no service time context is determined to have been passed to the first service processing system in the request, generating a current service time from a combination of a current physical time of the first service processing system and an initial counter time, performing a task associated with the service, and transmitting a second network based message that comprises the current service time as time context metadata associated with the performance of the task to a second service processing system.

Abstract: Privacy cells can be configured to enable segmented control. A privacy cell can include a segmented array of electrodes that allow segments of liquid crystal to be independently controlled. By independently applying a voltage to each electrode, the liquid crystal within each segment can be independently oriented at a desired angle for a particular mode of operation.

Abstract: A server set for a data set may designate a subset of “master” servers that update the data set in order to reduce data version conflicts involving mutually exclusive updates of the data set. Multi-master configurations may fulfill the performance constraints, and the subset of masters may detect and resolve data version conflicts. However, if multiple masters perform conflict resolution for a particular data version conflict, the resolution may produce inefficiency and redundancy (if the masters reach the same outcome) or additional data version conflicts (if the masters reach different outcomes). Instead, among the masters, a merge master may be identified that applies conflict resolution techniques to data version conflicts and forwards the conflict resolution outcome to the other masters for application to the data set to resolve the data version conflict. The other masters may temporarily store updates in a tentative update set until data version conflicts are resolved.

Abstract: A road traffic jam early warning method includes: performing characteristic classification according to acquired multi-source traffic data, and constructing a corresponding characteristic membership function, to obtain a first fuzzy weight; applying an expert evaluation method to the multi-source data to construct an artificial membership function, and calculating a second fuzzy weight; performing fuzzy weighted average on the characteristic membership function according to a fused fuzzy weight obtained by fusing the first fuzzy weight and the second fuzzy weight, and performing defuzzification on obtained weighted average membership functions having different characteristic quantities, to obtain fused multi-source traffic data; constructing a road traffic congestion model, and calculating an optimal road traffic congestion index; and acquiring current multi-source traffic data, predicting a current congestion index, and providing, by comparing the current congestion index with the optimal road traffic conges

Abstract: Data services for workloads are often provided with a service level agreement specifying various performance guarantees (e.g., latency, availability, scalability, and consistency). Single-master architectures, in which updates to the data set are constrained to a single server, may limit the fulfillment of some performance guarantees. Presented herein are multi-master architectures, in which the server set is partitioned into at least two masters are permitted to update the data set and at least one non-master that is not permitted to update the data set. Non-masters that receive a request to update the data set forward the request to a master server for application to the data set. A master that receives the request applies it to the data set and propagates the update to other master and non-master servers. Conflicting updates may be resolved through a variety of conflict resolution techniques, optionally designating one master server as a conflict resolution server.

Abstract: A display chassis for a portable information handling system. In various embodiments the display chassis includes a display cover portion, the display cover portion comprising a display and a bezel, the display comprising an infinity display and a rear cover portion, the rear cover portion comprising a timing controller (TCON), the timing controller comprising a first printed circuit board portion and a second printed circuit board portion, the first printed circuit board portion having a corresponding height, the second printed circuit board portion having a corresponding height, the corresponding height of the second printed circuit board portion being taller than the corresponding height of the first printed circuit board portion, the second printed circuit board portion being located within a dome center height area of the rear cover portion.

Abstract: A method, computer program product and system are provided for preloading debug information based on the presence of incremental source code files. Based on parsed input parameters to a source code debugger, a source code repository and a local storage area are searched for an incremental file. In response to the incremental file being located, a preload indicator in the incremental file, which is a source code file, is set. Based on the preload indicator being set, debug symbol data from the incremental file is merged to a preload symbol list. In response to receiving a command to examine the debug symbol data from the incremental file, the preload symbol list is searched for the requested debug symbol data.

Abstract: Data services are often provided with various performance guarantees. Multi-master architectures, in which multiple master servers are permitted to update a portion of the data set, may facilitate some performance requirements, but may also lead to data version conflicts in which different masters have written different versions of one or more data items. Moreover, conflicts involving different data items may have to be resolved using different conflict resolution techniques. Therefore, various data items of the data set may be associated with a conflict resolution technique selected from a conflict resolution technique set, such as manual conflict resolution; a write order policy, such as last writer wins; a conflict resolution logic; and conflict resolution based on data types. A data version conflict may be resolved by identifying and invoking the selected conflict resolution technique that is associated with the data item, and applying the conflict resolution outcome to the data item.

Abstract: A display chassis for a portable information handling system. In various embodiments the display chassis includes a display cover portion, the display cover portion comprising a display and a bezel, the display comprising an infinity display and a rear cover portion, the rear cover portion comprising a timing controller (TCON), the timing controller comprising a first printed circuit board portion and a second printed circuit board portion, the first printed circuit board portion having a corresponding height, the second printed circuit board portion having a corresponding height, the corresponding height of the second printed circuit board portion being taller than the corresponding height of the first printed circuit board portion, the second printed circuit board portion being located within a dome center height area of the rear cover portion.

Abstract: A computer receives a log file, where the log file comprises records associated with the instructions in a source code. The computer loads, using a debugger, the log file and the source code. The computer receives a loading address from the log file. The computer updates a debugging data format (DWARF) with the one or more records of the log file, where the DWARF is accessed using the loading address and comprises one or more data structure entries. The computer identifies a calling address from the log file and identifies the one or more data structure entries associated with the calling address.

Abstract: Distributed transactions are performed over a collection of servers operating as replicas of a data set, where a successful transaction involves meeting a quorum count of replicas that locally commit the transaction. However, performance constraints of data sets and consuming applications may vary (e.g., sensitivity to latency, scalability, and/or consistency), and the performance characteristics of the server set may be partly determined by the transactional commitment and quorum selection. The distributed transaction may be applied by designating the replicas as a set of followers and a leader that initiates the transaction and receives acknowledgments of local commits by each follower. On condition of the acknowledgments meeting a quorum count for the data set according to the performance characteristics of the application, the leader locally commits the transaction and delivers a result.