Abstract: A method is provided for fabricating a transistor. According to the method, a second semiconductor layer is formed on a first semiconductor layer, and a dummy gate structure is formed on the second semiconductor layer. A gate spacer is formed on sidewalls of the dummy gate structure, and the dummy gate structure is removed to form a cavity. The second semiconductor layer beneath the cavity is removed. A gate dielectric is formed on the first portion of the first semiconductor layer and adjacent to the sidewalls of the second semiconductor layer and sidewalls of the gate spacer. A gate conductor is formed on the first portion of the gate dielectric and abutting the second portion of the gate dielectric. Raised source/drain regions are formed in the second semiconductor layer, with at least part of the raised source/drain regions being below the gate spacer.

Abstract: Techniques for encoded data processing which allow for continuous data processing as encoded data changes. Data is decomposed into one or more blocks with each block containing at least one data record. At least one data record within a given block is encoded with a first encoding process selected from one or more encoding processes. The first encoding process is associated with the given data block. Techniques evaluate whether or not to implement an encoding change for a given block when updating a given data record in the given block. Responsive to the evaluation, the given block is re-encoded with a second encoding process. Responsive to the re-encoding, the association of the given block is updated. A map is formed to convert the given data record encoded with the first encoding process to the second encoding process so as to preserve comparative relationships of the given data record.

Abstract: Integrated MEMS switches, design structures and methods of fabricating such switches are provided. The method includes forming at least one tab of sacrificial material on a side of a switching device which is embedded in the sacrificial material. The method further includes stripping the sacrificial material through at least one opening formed on the at least one tab which is on the side of the switching device, and sealing the at least one opening with a capping material.

Abstract: A modification method and system. The method includes retrieving by a computer processor of a computing system a list of features and plug-ins associated with an application. The features include features version metadata and the plug-ins include plug-ins version metadata. The computer processor compares features source code associated with the features with previous versions of associated source code. The computer processor generates modified features version metadata associated with the features version metadata. The modified features version metadata includes updated version labels differing from previous version labels of the previous versions of associated source code. The features are assembled into an application.

Abstract: An approach is provided for selecting a development resource to develop a component in a Unified Modeling Language (UML) software system architecture. Specifically, a request for a developer is received from an architect. A component for the developer is determined and candidate analytics is performed on the component. Based on the candidate analytics, a list of potential candidates is presented to the architect. A developer is then selected from the list of candidates.

Abstract: A method, apparatus, and product for partial instruction-by-instruction checking on acceleration platforms. The method comprising: obtaining a trace from an hardware accelerator, wherein the trace is generated by the hardware accelerator during simulation of an execution of a test case on a circuit design; identifying a synchronization point in the trace; simulating execution of the test case by a reference model until reaching the synchronization point; and performing instruction-by-instruction checking in order to identify an error in the circuit design based on the simulated execution by the hardware accelerator, wherein the instruction-by-instruction checking is performed with respect to a portion of the trace that relates to operation after executing the synchronization point, wherein the instruction-by-instruction checking utilizes the reference model to determine an expected outcome of each event recorded in the portion of the trace.

Abstract: A method of manufacturing an optical cable including plural waveguides each including plural optical channels and each of the waveguides and the optical channels having a first end and a second end. A central portion of each of the waveguides is displaced along a central longitudinal axis of the waveguides which traverses a central bifurcation line of the first and second connectors. A first optical channel connection pattern is formed on the first connector by the first ends of the optical channels of the waveguides connected thereto; and a second optical channel connection pattern formed on the second connector by the second ends of the optical channels of the waveguides connect to the second connector. The first optical channel connection pattern is a different pattern than the second optical channel connection pattern in relation to a connection hole pattern which is the same for both the first and second connectors.

Abstract: A mechanism is provided in a storage device for performing a write operation. The mechanism configures a write buffer memory with a plurality of write buffer portions. Each write buffer portion is dedicated to a predetermined block size category within a plurality of block size categories. For each write operation from an initiator, the mechanism determines a block size category of the write operation. The mechanism performs each write operation by writing to a write buffer portion within the plurality of write buffer portions corresponding to the block size category of the write operation.

Abstract: Systems and methods for are described herein for transforming project management application representations into business process models. An aspect provides for receiving at least one portion of a project management application representation; and generating at least one business process by applying at least one transformation pattern to the at least one project management representation. Other embodiments and aspects are also provided herein.

Abstract: Processing data packets from a receive queue is provided. It is determined whether packets are saved in a pre-fetched queue. In response to determining that packets are not saved in the pre-fetched queue, a number of packets within the receive queue is determined. In response to determining the number of packets within the receive queue, it is determined whether the number of packets within the receive queue is greater than a number of packets called for by an application. In response to determining that the number of packets within the receive queue is greater than the number of packets called for by the application, an excess number of packets that is above the number of packets called for by the application is saved in the pre-fetched queue. An indication is sent to the application of the excess number of packets. The predetermined number of packets is transferred to the application.

Abstract: A computer implemented method delivers information technology services according to a set of service level agreements. A service request class having a largest control error is identified from a plurality of service request classes. The service request priority of the service request class having the largest control error is then increased to form an updated priority. Service requests for the plurality of service request classes are dispatched in a next control iteration based upon the updated priority.

Abstract: Some embodiments of the inventive subject matter include a computer-implemented method for processing text received in an input filed. The method can include presenting, under control of a processor, the input field configured to receive text, wherein the input field has a character limit defining a maximum number of characters that will appear in the input field. The method can also include receiving a first group of text in the input field, wherein the first group of text does not exceed the character limit. The method can also include receiving a second group of text in the input field. The method can also include detecting that the second group of text combined with the first group of text exceeds the character limit, and presenting, in response to the detecting, an input viewer including the first and second groups of text.

Abstract: A confidence-based authentication discovery scheme is implemented at a proxy. The scheme assumes that some level of unauthenticated browsing is allowed prior to enforcing authentication at the proxy. Once a known and trusted set of identity providers has been accessed and the user is required to authenticate at the proxy (e.g., as a result of policy), the proxy initiates Federated Single Sign-On (F-SSO) to one or more (or, preferably, all) known sites accessed by the browser. This F-SSO operation is performed seamlessly, preferably without the user's knowledge (after the user allows an initial trust decision between the proxy acting as a service provider and the external identity provider). The proxy collates the results and, based on the trust it has with those sites, produces a confidence score. That score is then used as input into policy around whether or not a user should be permitted to access a particular site.

Abstract: A multi-chip module (MCM) package is provided and includes a substrate and a hat assembly. The substrate includes a surface on which chips of the MCM are re-workable. The hat assembly is configured to be non-hermetically sealed to the substrate. The hat assembly and the substrate are configured for tension-type disassembly in a dimension oriented substantially normally with respect to a plane of the substrate surface.

Abstract: Techniques are provided for encoded data processing which allows for continuous data processing as encoded data changes. Data is decomposed into one or more blocks with each block containing at least one data record. At least one data record within a given block is encoded with a first encoding process selected from one or more encoding processes. The first encoding process is associated with the given data block. Techniques evaluate whether or not to implement an encoding change for a given block when updating a given data record in the given block. Responsive to the evaluation, the given block is re-encoded with a second encoding process. Responsive to the re-encoding, the association of the given block is updated. A map is formed to convert the given data record encoded with the first encoding process to the second encoding process so as to preserve comparative relationships of the given data record.

Abstract: Methods and apparatus are provided for automatic un-muting of a telephone call. A muted telephone of a user is automatically un-muted during a telephone call by evaluating whether the user is facing the telephone while speaking during the telephone call. The telephone can optionally be automatically muted when the user stops speaking and is not facing the telephone. A telephone call of a user can also be processed by evaluating whether the user is facing the telephone while speaking during the telephone call; and providing a message to the user indicating that the telephone is muted if the user is facing the telephone while speaking during the telephone call.

Abstract: A scheme referred to as a “Region-based cache restoration prefetcher” (RECAP) is employed for cache preloading on a partition or a context switch. The RECAP exploits spatial locality to provide a bandwidth-efficient prefetcher to reduce the “cold” cache effect caused by multiprogrammed virtualization. The RECAP groups cache blocks into coarse-grain regions of memory, and predicts which regions contain useful blocks that should be prefetched the next time the current virtual machine executes. Based on these predictions, and using a simple compression technique that also exploits spatial locality, the RECAP provides a robust prefetcher that improves performance without excessive bandwidth overhead or slowdown.

Abstract: An apparatus for reducing EMI at the micro-electronic-component level includes a substrate having a ground conductor integrated therein. A micro-electronic component such as an integrated circuit is mounted to the substrate. An electrically conductive lid is mounted to the substrate, thereby forming a physical interface with the substrate. The electrically conductive lid substantially covers the micro-electronic component. A conductive link is provided to create an electrical connection between the electrically conductive lid and the ground conductor at the physical interface.

Abstract: In one embodiment, a system for classifying traffic in an overlay network includes a processor adapted for executing logic, logic adapted for receiving an overlay packet, logic adapted for determining at least one characteristic of the overlay packet and/or one or more inner packets of the overlay packet in order to classify the overlay packet, logic adapted for associating a flow identifier to the overlay packet, logic adapted for determining one or more policies to associate with the flow identifier, wherein the one or more policies are based on the at least one characteristic of the overlay packet and/or the one or more inner packets of the overlay packet, and logic adapted for storing the flow identifier in a header of the overlay packet. More systems, methods, and computer program products for classifying traffic in an overlay network are presented in accordance with other embodiments.

Abstract: A method and associated systems for the efficient selection of runtime rules for programmable search engines, in which a processor of a computer system translates a set of programmable search-engine runtime rules into a set of fielded documents and then partitions the fielded documents into optimized clusters that are each in turn converted into an inverted index. When a user submits a query, the search engine converts the query into a set of fielded queries and uses the set of inverted indices and the set of fielded queries to identify a candidate subset of the runtime rules. The search engine matches this candidate subset against the input query to select a final set of applicable runtime rules.