摘要:
A reflective process algebra called the ρ-calculus facilitates the serialization of processes at the level of the reflective process algebra. The reflective process algebra because of its reflective properties, can be used on computing systems with finite resources. The reflective process calculus can be made to be sensitive to resources, such as memory and bandwidth, hence facilitating its use as a programming language at the machine level. The reflective process calculus causes the dual nature of a computation entity to be exposed. A name can be caused to become a process and a process can be caused to become a name.
摘要:
The systems and methods of the present invention utilize stochastic calculus (e.g., pi calculus) to determine (e.g., specify, predict, etc.) quality of service that includes at least one of rate, uptime and capacity. The quality of service can be indicative of a level of service provided and/or required by an agent (e.g., a web service). The quality of service can be obtained by representing an agent's contract via a model (e.g., state diagram or mathematical algorithm) and decorating the model with cost functions that are utilized to compute transition costs that are employed to predict associated rates for respective transitions. The model can further be decorated with error states to determine uptime and employed to determine channel capacity. In general, the quality service of a requesting agent and a providing agent can be compared to determine whether the providing agent can satisfy the level of performance of the requesting agent.
摘要:
An integrated circuit includes an array of memory cells, addressing circuitry, and timing and control logic. The array of memory cells is configured to store data bits. The addressing circuitry is configured to address multiple locations of memory cells in response to a clock signal. The timing and control logic is responsive to the clock signal and configured to control a read-modify-write operation to read a first group of data bits from a first address location, modify at least one of the bits of the first group, and write the modified first group to the first address location. The read-modify-write operation is performed within one cycle of the clock signal.
摘要:
A group identifier represents an association between each of a number of different abbreviated namespace identifiers with a corresponding hierarchical namespace (e.g., an XML namespace). A hierarchically-structured document (e.g., an XML document) is accessed by a computing system that determines that the group identifier is associated with the hierarchically-structured document. Hence, when using the abbreviated namespace identifiers in the hierarchically-structured document, the computing system knows that the corresponding namespace is associated with the designated portions of the hierarchically-structured document. Also, a schema description language document (e.g., an XSD document) may specify multiple target namespaces for a single element. Accordingly, groupings of elements may be included in different namespaces to creating overlapping or even nested namespaces.
摘要:
A method of hole defect repair includes removing one or more defects at or near a desired hole shape in a substrate by removing a non-concentric portion of the substrate proximate the desired hole shape, and welding a filler material to the substrate after removing the non-concentric portion of the substrate.
摘要:
Systems and methods for incorporating qualified, polymorphic, hedge-regular types into computer-programming languages are disclosed. A programming language having such a type system, and a typing system for such a programming language are also disclosed. Also described is Haxell, an effort to completely integrate regular hedge pattern-matching into Haskell. Haxell is a Haskell embodiment of a set of concepts that may be applied to any of a number of functional and/or traditional languages.
摘要:
A sortation conveyor has a divert guide path which is configured to guide pushers to engage articles disposed on an endless conveying surface at an initial impact which does not result in an out of control situation even at high speeds. The divert guide path is disposed at a plurality of divert angles, and guides pushers to engage articles at a low initial contact divert angle and first lateral speed and to accelerate the articles to a final divert angle and second, higher, lateral speed. The pushers may be undergoing lateral acceleration at the time initial contact is made with the articles.
摘要:
The system for pulling wire through a conduit includes a cable puller and a remote controller. The cable puller may pull a wire through a conduit. The wire may be removably coupled to a cable coupler located on the rear of the cable puller. The cable puller may be inserted into a first end of the conduit and may progress to a second end of the conduit under the influence of a plurality of tractors. A camera that is mounted on a faceplate at the front of a housing of the cable puller may transmit one or more images to the remote controller. One or more visible light sources and one or more infrared light sources may provide illumination for the camera. Movements of the cable puller may be controlled remotely using the remote controller.
摘要:
Described are techniques to facilitate temporal features in a semantic data store. Information about lifetimes of facts in a semantic store is maintained. Even when a fact is logically deleted, a physical record is kept available. The record of a logically deleted or invalid fact has associated lifetime information. For example, valid-from and valid-to time values. The record of a fact not yet deleted may have a valid-from time value indicating when it was created, became valid, etc. Queries against the semantic store may specify a timeslice (a point in time or a time range). The lifetime information can be used to satisfy such time-specific queries. Because records are maintained after they are logically deleted, it is also possible to accurately query a past state of the semantic store. Even if such a query is run at different times, same results may be obtained.