摘要:
A method of forming a multi-doped junction on a substrate is disclosed. The method includes providing the substrate doped with boron atoms, the substrate comprising a front substrate surface, and depositing an ink on the front substrate surface in an ink pattern, the ink comprising a set of nanoparticles and a set of solvents. The method further includes heating the substrate in a baking ambient to a first temperature of between about 200° C. and about 800° C. and for a first time period of between about 3 minutes and about 20 minutes in order to create a densified film ink pattern. The method also includes exposing the substrate to a dopant source in a diffusion furnace with a deposition ambient, the deposition ambient comprising POCl3, a carrier N2 gas, a main N2 gas, and a reactive O2 gas, wherein a ratio of the carrier N2 gas to the reactive O2 gas is between about 1:1 to about 1.5:1, at a second temperature of between about 700° C. and about 1000° C., and for a second time period of about 5 minutes to about 35 minutes. The method also includes heating the substrate in a drive-in ambient to a third temperature of between about 800° C. and about 1100° C.
摘要:
One or more servers receive requests from clients and send responses. At least a subset of the responses including cookies produced by the one or more servers, and at least a subset of the received requests including cookies that were previously produced by the one or more servers and sent to the clients with responses to previously processed requests. Each of the cookies includes a respective user identifier. The one or more servers analyzing the received cookies to detect a first condition, which indicates that a respective plurality of clients may be using cookies that have a shared user identifier. Upon detecting the first condition, the one or more servers send at least one of the clients of the respective plurality of clients a response that includes a new cookie having a user identifier that is distinct from the shared user identifier.
摘要:
A tokenspace repository stores documents as a sequence of tokens. A first version of a document is stored in the repository, within an accessible range of the repository. When a second version of the document is received, the second version is also stored in the repository and the accessible range of the repository is modified to include both the first version and the second version of the document. Then the first version of the document is invalidated. Queries are executed against the repository in a plurality of threads without interruption during the operations of receiving the second version of the document, storing the second version of the document in the repository, modifying the accessible range of the repository, and invalidating the first version of the document.
摘要:
Each of a plurality of data items is stored in a table data structure. The table structure includes a plurality of columns. Each of the columns is associated with one of a plurality of locality groups. Each locality group is stored as one or more corresponding locality group files that include the data items in the columns associated with the respective locality group. In some embodiments, the columns of the table data structure may be grouped into groups of columns and each group of columns is associated with one of a plurality of locality groups. Each locality group is stored as one or more corresponding locality group files that include the data items in the group of columns associated with the respective locality group.
摘要:
In an embodiment of the present invention, the computational efficiency of decoding of block-sorted compressed data is improved by ensuring that more than one set of operations corresponding to a plurality of paths through a mapping array T are being handled by a processor. This sequence of operations, including instructions from the plurality of sets of operations, ensures that there is another operation in the pipeline if a cache miss on any given lookup operation in the mapping array results in a slower main memory access. In this way, the processor utilization is improved. While the sets of operations in the sequence of operations are independent of another other, there will be an overlap of a plurality of the main memory access operations due to the long time required for main memory access.
摘要:
A system for obtaining frequency domain interferometric super-resolution of a target scatterer, having a first and a second coherent transceivers, a mutual coherent sub-system and an estimation system. The first and second coherent transceivers are operative to produce a plurality of first and second sampling signals separated from each other by a predetermined frequency difference within the first and second sub-band, respectively. The mutual coherent sub-system is coupled to the first and second coherent transceivers to receive phase and amplitude of the first and second sampling signals, so as to evaluate an ambiguous range estimate from a pair of the first and second sampling signals and an unambiguous range estimate from a pair of the first and/or second sampling signals. The estimation system follows the mutual coherent sub-system to reconcile the ambiguous and unambiguous range estimates so as to obtain a target signature with a super-resolution defined by a frequency offset between the first and second sub-bands.
摘要:
A process for constructing a server for collecting, arranging and storing data that defines the connectivity of pages on the World Wide Web (Web). The process input is a set of compressed ASCII links files, wherein each links file is a series of source URLs and corresponding destination URLs. A temporary URLs_info Table is created and initialized. The links files and URLs metadata are read. Buffers of unique URLs are sorted and written from the links files into URL runs. An ID Index is created from the URL_info table. CS_ids are assigned to URLs and written to the ID Index. Both a compressed URL data structure and a URL Index are created. A Host Table is created. URL fingerprints are converted to CS_ids, and preliminary outstarts to CS_ids and preliminary outstarts and outlinks tables are created. Compressed outstarts and outlinks tables are created from the preliminary tables. Subsequently, compressed instarts and inlinks tables are created based on the outstarts and outlinks tables.
摘要:
A system and method for identifying free registers within a program. A depth first search of a flow diagram representing the execution of a program is performed. The search proceeds simultaneously for all the registers and identifies the free registers from the search. The free registers may then be utilized for various applications without saving and restoring the contents of these registers to memory. The system may limit the amount of time spent searching for free registers with a timer.
摘要:
A computerized method optimizes an index of information stored as records of a database in response to queries made to the index. The index is generated by storing index entries in a memory. Each index entry includes a word entry immediately followed by one or more location entries. The word entry encodes a unique portion of information of the records, and the location entries encode occurrences of the unique portion of information in the records. A query phrase is processed, the phrase corresponds to a concatenation of adjacent portions of indexed information. A measure of the amount of time required to process the phrase is recorded in a journal. Periodically, the journal is processed and new index entries are generated for the phrases if the processing of the phrase exceeds some predetermined threshold time.
摘要:
A computer implemented method maps an index of information of a database into an array of files. The information is stored as records of a database. Batches of records are parsed into words and locations, each word representing a portion of the information of a particular record, the locations are sequentially assigned to the words in the order of parsing the words. An index entry is generated for each unique word, each index entry including the unique word and all of the locations where the unique word occurs in the database. Each unique word is hashed to determine a bucket number. Index entries having identical bucket numbers are written to a single index file associated with the bucket number in a collating order of the unique words. A summary file is generated for each index file by periodically sampling the data being written to the index file. Index files and their associated summary files are grouped into a tier of files, there being one tier for each batch of records parsed.