Abstract: An action history maintains a set of ordered application actions associated with a user. A user interface of a software application can include a back control and a forward control, which utilize the action history. Specifically, the back control revokes a most recent action and the forward control reapplies a previously revoked action. Thus, the forward and backward controls change which page is rendered in the software application. Unlike traditional implementations, the invention maintains a complete set of actions within the action history in a non-linear context. That is, when a new action is inserted into a history from a non-terminal state (i.e., actions able to be reapplied are available upon a selection of the forward control) then the new action is inserted immediately after the current action. The historic actions are maintained in order after the new action in the action history.

Abstract: A post-crosslinked adsorbent comprises: monomer units of (a) at least 47 wt % at least one polyvinylaromatic monomer and (b) up to 53 wt % at least one monovinylaromatic monomer; and 0-0.2 mmol/g pendent vinyl groups; wherein the dry adsorbent has BET specific surface area in the range of about 700-1500 m2/g, BET average pore diameter 6.0-11.8 nm, BET porosity 1.2-3.5 mL/g, BJH adsorption micropore volume less than 20% of total BJH adsorption pore volume, and HK micropore volume less than 24% of total BJH adsorption pore volume. The invention is also directed to a preparation method for the polymeric adsorbent.

Abstract: Techniques for separating application processes into a system space and a replay space are described in a record and replay tool. The technique permits applications to run in the replay space while a record and replay library runs and manages resources in system space ensuring accurate replay of saved data that are used by applications.

Abstract: Described techniques increase runtime performance of software running in user space by analyzing and detecting soft hang program errors and giving suggestions for cures. This disclosure pertains to techniques for the analysis, detection, and cure of soft hang program errors.

Abstract: An enhancement to a web browser offers an extension mechanism for web applications to utilize client-side resources, thereby moving more extensibility and flexibility to the client-side. The web browser may expose some control interfaces to meet various requirements from web applications. Using the extension mechanism, the web applications are able to offload the cloud servers, function when offline, and improve performance. The extension mechanism also provides users with full control to the data passing through their web browsers.

Abstract: A hinge assembly includes a first connecting member, a second connecting member, a third connecting member, and a fourth connecting member. One end of the second connecting member is slidably connected to the first connecting member and the other end is rotatably connected to the fourth connecting member. The second connecting member is rotatably connected to the third connecting member. One end of the third connecting member is slidably connected to the fourth connecting member and the other end rotatably connected to the first connecting member.

Abstract: Predicate checking in conjunction with distributed systems can enable an investigating user to check predicates in the context of instance states and/or distributed states of a distributed system. In an example embodiment, a method entails accepting distributed system simulation data and performing a simulation of a distributed system using the distributed system simulation data to create distributed system simulated states. At least a portion of the distributed system simulated states are exposed. The exposed portion of the distributed system simulated states is retrieved and stored as exposed states for the distributed system. The exposed states for the distributed system are compared to predicate states for the distributed system. If an inconsistency is detected between the exposed states and the predicate states based on the comparing at least one alarm is issued.

Abstract: Distributed system simulation is enhanced by extending the simulation window. In a described implementation, the simulation window extension is facilitated with a slow message relaxation scheme. For example, especially when the simulation window is extended, slow unscheduled events can arrive at a logical process with a timestamp that is prior to (e.g., less than) the local time of a receiving logical process that is participating in a simulation. To ameliorate issues created by a slow unscheduled message and its corresponding slow unscheduled event, a current logical time of the receiving logical process is substituted for the original timestamp of the slow unscheduled event to transform it into a punctual unscheduled event.

Abstract: Systems and methods for processing dynamic content are described herein. A system receives a request for content that includes an item cached by a proxy. The system issues another request to a content server to generate the other items that are not cached, without disrupting the process workflow of the original request. The system combines the items generated by the content server with the item cached by the proxy and sends the combined content to a destination.

Abstract: An information product and a method for interacting with a user are disclosed. The information product comprises: an input module, a storage module, a detecting module, and a comparing module. In the method for interacting with the user, the user firstly affects the input module. Then, a predetermined input value is provided, wherein the predetermined input value corresponds to a predetermined message. Thereafter, a user input value corresponding to the user's affecting the input module is produced. Then, if the user input value substantially matches the predetermined input value is determined. When the user input value substantially matches the predetermined input value, the use of the predetermined message is controlled.

Abstract: A peer-to-peer system includes a plurality of nodes. The plurality of nodes includes at least an initial node and a neighboring node. The initial node is operable to determine whether to place an object at either the initial node or another node in the system based on a comparison of storage utilizations for the initial node and the neighboring node.

Abstract: In a method for creating expressway for overlay routing, an existing peer-to-peer network is organized into a plurality of zones. The plurality of zones is organized into a plurality of levels. Neighboring zones are identified for each zone of the plurality of zones. One or more representatives are identified for each neighboring zone. A routing table is created based the plurality of zones, the neighboring zones, the one or more representatives, and the plurality of levels.

Abstract: Compositions containing one or more types of membrane-targeting antimicrobial agents immobilized on a substrate with activity in relevant biological environments, and methods of making and using thereof, are described herein. The antimicrobial agents retain their activity in the presence of blood proteins and/or in vivo due to improved molecular structures which allow for cooperative action of immobilized agents and hydrophilic chemistries which resist non-specific protein adsorption. Suitable molecular structures include branched structures, such as dendrimers and randomly branched polymers. The molecule structures may also include hydrophilic tethers which provide both flexibility and resistance to non-specific protein adsorption. The membrane targeting antimicrobial agent coatings can be applied to a variety of different types of substrates including medical implants such as vascular grafts, orthopedic devices, dialysis access grafts, and catheters; surgical tools, surgical garments; and bandages.

Abstract: Cationic polymers hydrolyzable to zwitterionic polymers, monomers for making the cationic polymers, surfaces that include the polymers, therapeutic agent delivery systems that include the cationic polymers, methods for administering a therapeutic agent using the delivery systems, and methods for making and using the cationic polymers, monomers, surfaces, and therapeutic agent delivery systems.

Abstract: Synthetic amino acids containing one or more non-fouling groups or moieties are described herein. In one embodiment, the amino acid has the following chemical formula: where L is a linker group and Z is a non-fouling group including, but not limited to, polyethylene glycol (PEG); oligoethylene glycol (OEG); zwitterionic group, such as phosphorycholine, carboxybetaine, and sulfobetaine; groups that are hydrogen bond acceptors but not hydrogen bond donors. The non-fouling amino acids can be incorporated into a bioactive peptide as single amino acid residues, multiples amino acid residues, or as blocks of amino acids. The non-fouling amino acids, or peptides containing one or more non-fouling amino acids, can be applied to surfaces in order to improve biocompatibility, reduce thrombogenesis, and/or reduce fouling by proteins or bacteria present in solution.

Abstract: Described is the differentiation of replicas in a large distributed object store as either being smoothing replicas based on an amount of load on storage nodes (bricks), or as spreading replicas based on a substantially random distribution among the system's bricks. The smoothing replicas are placed among the lowest usage bricks, while the spreading replicas are placed randomly throughout other bricks in the system independent of load. As a result, fast, primarily parallel data repair is facilitated by selecting a spreading replica when repair is needed, while load balancing is facilitated by placing a smoothing replica on a low-usage brick when a new replica is checked in, and selecting a smoothing replica when load balancing is triggered by overloading of a brick and/or addition of a new brick. Check-in, data repair and load balancing policies specify how to use smoothing replicas and spreading replicas.

Abstract: Mutual exclusion techniques for use in a dynamic peer-to-peer environment are described. In an implementation, a method includes receiving, at each of a plurality of logical replicas, a request from a client. Each of the logical replicas includes a queue and is for exclusive association with one of the clients. The request is for accessing one of a plurality of resources. When a particular one of the logical replicas is exclusively associated with another one of the clients, the request is stored in the queue of the particular logical replica.

Abstract: A multimode storage system uses a global-placement and local-repair strategy for replica placement and repair of data objects. The data objects are initially placed randomly throughout the storage system, while the subsequent replacement replicas of any lost data objects are placed non-globally, for example within the same cluster as the repair source. This approach aggregates the bandwidth of all leaf switches/routers for repair and thus improves data repair bandwidth and repair speed. The approach also reserves more root switch bandwidth for tasks such as data rebalance, a process migrating data to the new nodes that have replaced failed ones.

Abstract: Replaying distributed systems involves playing a distributed system in a simulator using data from a real-world operation. In an example embodiment, a simulation process is to simulate a distributed system that has a first instance and a second instance. The simulation process includes a first simulation object corresponding to the first instance and a second simulation object corresponding to the second instance. In another example embodiment, communications between the first instance and the second instance are simulated within the simulation process using function calls between the first simulation object and the second simulation object.

Abstract: A analytical framework is described for quantitatively analyzing reliability of a multinode storage system, such as a brick storage system. The framework defines a multidimensional state space of the multinode storage system and uses a stochastic process (such as Markov process) to determine a transition time-based metric measuring the reliability of the multinode storage system. The analytical framework is highly scalable and may be used for quantitatively predicting or comparing the reliability of storage systems under various configurations without requiring experimentation and large-scale simulations.