Abstract: An integrated circuit includes a complimentary field effect transistor (CFET). The CFET includes a first transistor and a second transistor stacked vertically. A conductive via extends vertically from a first source/drain region of the first transistor past the second transistor. The second transistor includes an asymmetric second source/drain region. The asymmetry of the second source/drain region helps ensure that the second source/drain region does not contact the conductive via.

Abstract: A device includes: a complementary transistor including: a first transistor having a first source/drain region and a second source/drain region; and a second transistor stacked on the first transistor, and having a third source/drain region and a fourth source/drain region, the third source/drain region overlapping the first source/drain region, the fourth source/drain region overlapping the second source/drain region. The device further includes: a first source/drain contact electrically coupled to the third source/drain region; a second source/drain contact electrically coupled to the second source/drain region; a gate isolation structure adjacent the first and second transistors; and an interconnect structure electrically coupled to the first source/drain contact and the second source/drain contact.

Abstract: Exemplary methods of semiconductor processing may include forming a layer of silicon-containing material on a semiconductor substrate. The methods may include performing a post-formation treatment on the layer of silicon-containing material to yield a treated layer of silicon-containing material. The methods may include contacting the treated layer of silicon-containing material with an adhesion agent. The methods may include forming a layer of a resist material on the treated layer of silicon-containing material.

Abstract: One or more computing devices, systems, and/or methods for cross-domain action prediction are provided. Action sequence embeddings are generated based upon a textual embedding and a graph embedding utilizing past user action sequences corresponding to sequences of past actions performed by users across a plurality of domains. An autoencoder is trained to utilize the action sequence embeddings to project the action sequence embeddings to obtain intent space vectors. A service switch classifier is trained using the intent space vectors. In response to the service switch classifier predicting that a current user will switch from a current domain to a next domain, the current user is provided with a recommendation of an action corresponding to the next domain.

Abstract: The present disclosure discloses a second-degree friend query method. The method includes storing a first-degree friend of each account, querying for the first-degree friend after receiving a second-degree friend query command, and query the first-degree friend to obtain a second-degree friend. A storage module stores the first-degree friend relationships. The second-degree friend is obtained through a query according to the first-degree friend in real time. The present disclosure further discloses a second-degree friend query apparatus and system corresponding to the foregoing method and a storage medium. The system includes a processing server and a storage server. The storage server stores a first-degree friend for each account, and queries for and returns the first-degree friend at the request of the processing server. The processing server controls an entire query procedure, and obtains a second-degree friend after twice queries.

Abstract: The present disclosure discloses a second-degree friend query method. The method includes storing a first-degree friend of each account, querying for the first-degree friend after receiving a second-degree friend query command, and query the first-degree friend to obtain a second-degree friend. A storage module stores the first-degree friend relationships. The second-degree friend is obtained through a query according to the first-degree friend in real time. The present disclosure further discloses a second-degree friend query apparatus and system corresponding to the foregoing method and a storage medium. The system includes a processing server and a storage server. The storage server stores a first-degree friend for each account, and queries for and returns the first-degree friend at the request of the processing server. The processing server controls an entire query procedure, and obtains a second-degree friend after twice queries.

Abstract: The present disclosure discloses a second-degree friend query method. The method includes storing a first-degree friend of each account, querying for the first-degree friend after receiving a second-degree friend query command, and query the first-degree friend to obtain a second-degree friend. A storage module stores the first-degree friend relationships. The second-degree friend is obtained through a query according to the first-degree friend in real time. The present disclosure further discloses a second-degree friend query apparatus and system corresponding to the foregoing method and a storage medium. The system includes a processing server and a storage server. The storage server stores a first-degree friend for each account, and queries for and returns the first-degree friend at the request of the processing server. The processing server controls an entire query procedure, and obtains a second-degree friend after twice queries.

Abstract: The present disclosure discloses a second-degree friend query method. The method includes storing a first-degree friend of each account, querying for the first-degree friend after receiving a second-degree friend query command, and query the first-degree friend to obtain a second-degree friend. A storage module stores the first-degree friend relationships. The second-degree friend is obtained through a query according to the first-degree friend in real time. The present disclosure further discloses a second-degree friend query apparatus and system corresponding to the foregoing method and a storage medium. The system includes a processing server and a storage server. The storage server stores a first-degree friend for each account, and queries for and returns the first-degree friend at the request of the processing server. The processing server controls an entire query procedure, and obtains a second-degree friend after twice queries.

Abstract: A method for presenting social network search results, includes: obtaining a keyword, and obtaining search results according to the keyword; obtaining a social attribute type; obtaining information corresponding to the social attribute type in the search results according to the social attribute type, and statistically analyzing the information according to the social attribute type to obtain an analysis result; presenting the analysis result according to the social attribute type. In addition, a device for presenting social network search results and a storage medium are also provided. The method and the device for presenting social network search results and the storage medium can make operations of a user more convenient.

Abstract: According to an example, a search request is received, and the search request comprises a search keyword and information of a current user; interpersonal relationship chain data of the current user are obtained according to the information of the current user; person information corresponding to the interpersonal relationship chain data of the current user is searched for a person matching the search keyword; and the person matching the search keyword is taken as a search result.