Gotowa bibliografia na temat „Index update”

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Index update”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Index update"

1

Squire, Peverill. "A Squire Index Update". State Politics & Policy Quarterly 17, nr 4 (8.06.2017): 361–71. http://dx.doi.org/10.1177/1532440017713314.

Pełny tekst źródła
Streszczenie:
The measure of legislative professionalization I developed was first published a quarter century ago. Since then, updates have appeared periodically. In this note, I briefly document the measure’s usefulness in academic research and then calculate it for 2015. For reasons I detail, the updated measure is corrected for a misestimate of days in session for some states.
Style APA, Harvard, Vancouver, ISO itp.
2

Sowers, James R. "Index Medicus Update". Journal of the CardioMetabolic Syndrome 2, nr 3 (czerwiec 2007): 157. http://dx.doi.org/10.1111/j.1559-4564.2007.07538.x.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Chattaraj, Pratim Kumar, i Debesh Ranjan Roy. "Update 1 of: Electrophilicity Index". Chemical Reviews 107, nr 9 (wrzesień 2007): PR46—PR74. http://dx.doi.org/10.1021/cr078014b.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Chattaraj, Pratim Kumar, Santanab Giri i Soma Duley. "Update 2 of: Electrophilicity Index". Chemical Reviews 111, nr 2 (9.02.2011): PR43—PR75. http://dx.doi.org/10.1021/cr100149p.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Johansen, Jay W. "Update on Bispectral Index monitoring". Best Practice & Research Clinical Anaesthesiology 20, nr 1 (marzec 2006): 81–99. http://dx.doi.org/10.1016/j.bpa.2005.08.004.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Kirkland, Alice. "Index around the World: News update from Index". Index on Censorship 43, nr 3 (wrzesień 2014): 145–47. http://dx.doi.org/10.1177/0306422014548969.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Kirkland, Alice. "Index around the world: News update from Index". Index on Censorship 43, nr 2 (czerwiec 2014): 186–88. http://dx.doi.org/10.1177/0306422014536492.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Nguyen, Thang Trung, Dieu Ngoc Vo, Hai Van Tran i Le Van Dai. "Optimal Dispatch of Reactive Power Using Modified Stochastic Fractal Search Algorithm". Complexity 2019 (28.05.2019): 1–28. http://dx.doi.org/10.1155/2019/4670820.

Pełny tekst źródła
Streszczenie:
This paper applies a proposed modified stochastic fractal search algorithm (MSFS) for dealing with all constraints of optimal reactive power dispatch (ORPD) and finding optimal solutions for three different cases including power loss optimization, voltage deviation optimization, and L-index optimization. The proposed MSFS method is newly constructed in the paper by modifying three new solution update mechanisms on standard stochastic fractal search algorithm (SSFS). The first modification is to keep only one formula and abandon one formula in the diffusion process while the second modification and the third modification are used in the first update and the second update. In two updates of SSFS, solutions with low quality are updated with high probability while other solutions with high quality do not get chances to be updated. This manner results in the fact that some promising solutions around the high quality solutions can be missed. In order to tackle this restriction, the second modification of MSFS is to newly update the worst solutions in the first update and the best solutions in the second update. In the third modification, all existing formulas of SSFS in the two updates are abandoned and the same new proposed technique is used for updating such solutions in two updates. Compared to SSFS, the three modifications can bring advantages to MSFS such as using smaller number of produced solutions per iteration, spending shorter execution time, finding better optimal solutions, and owning more stable search ability. Furthermore, the proposed method also sees its effectiveness and robustness over SSFS by testing on IEEE 30-bus system and IEEE 118-bus system with three different single objectives for each system. The proposed method can find less minimum, average, and maximum for all the cases in addition to faster search speed. Besides, the proposed method is also compared to other methods such as PSO-based method group, GA-based method group, DE-based method group, and other recent methods. Result comparisons also indicate that the proposed method can be more efficient than almost all these methods with respect to less minimum and smaller values of control parameters. As a result, evaluation of the performance of the proposed method is that it should be used for seeking solutions of ORPD problem.
Style APA, Harvard, Vancouver, ISO itp.
9

Mason, Pamela R. "CD-ROM price index: An update". Library Acquisitions: Practice & Theory 14, nr 2 (styczeń 1990): 179–82. http://dx.doi.org/10.1016/0364-6408(90)90060-8.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Hamilton, Aimée. "Index around the world: Update on Index on Censorship’s work". Index on Censorship 43, nr 4 (grudzień 2014): 131–33. http://dx.doi.org/10.1177/0306422014560521.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Rozprawy doktorskie na temat "Index update"

1

Valdivia, Peralta Maruzzella Paola, i Bravo Luis Antonio González. "Violence in dating: An update for adolescence". Pontificia Universidad Católica del Perú, 2014. http://repositorio.pucp.edu.pe/index/handle/123456789/102156.

Pełny tekst źródła
Streszczenie:
This literature review updates evidence about intimate partner violence in dating relationships, revealing a particular phenomenon, emphasizing issues such as the prevalence for both sexes, which according to various reviewed studies may range from 0.8% for sexual violence to 98% for psychological aggression. Factors associated with abuse or early sexual initiation, temporal extent of the relationship, role of parents and peers, among others; and the consequences as dropouts: teenage pregnancy, eating disorders, victimization and expression of anger primarily in men, etc. are anayzed. This review demonstrates that this phenomenon has certain peculiarities that justify a more targeted research particularly during adolescence.
La presente revisión bibliográfica actualiza evidencia en torno a la violencia de pareja en relaciones de noviazgo, mostrándolo como un fenómeno particular, enfatizando aspectos como la prevalencia, para ambos sexos, que según lo expuesto en los distintos estudios revisados puede oscilar desde un 0.8% para la violencia sexual hasta un 98% para la agresión psicológica; factores asociados como abuso o iniciación sexual precoz, extensión temporal de la relación, rol de los padres y de los pares, entre otros y las consecuencias tales como: deserción esco- lar, embarazo precoz, trastornos alimentarios, victimización y expresión de rabia esto último fundamentalmente en los hombres. Se demuestra cómo el fenómeno presenta ciertas singularidades que justifican investigación más focalizada en particular durante la adolescencia.
Style APA, Harvard, Vancouver, ISO itp.
2

Lester, Nicholas, i nml@cs rmit edu au. "Efficient Index Maintenance for Text Databases". RMIT University. Computer Science and Information Technology, 2006. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20070214.154933.

Pełny tekst źródła
Streszczenie:
All practical text search systems use inverted indexes to quickly resolve user queries. Offline index construction algorithms, where queries are not accepted during construction, have been the subject of much prior research. As a result, current techniques can invert virtually unlimited amounts of text in limited main memory, making efficient use of both time and disk space. However, these algorithms assume that the collection does not change during the use of the index. This thesis examines the task of index maintenance, the problem of adapting an inverted index to reflect changes in the collection it describes. Existing approaches to index maintenance are discussed, including proposed optimisations. We present analysis and empirical evidence suggesting that existing maintenance algorithms either scale poorly to large collections, or significantly degrade query resolution speed. In addition, we propose a new strategy for index maintenance that trades a strictly controlled amount of querying efficiency for greatly increased maintenance speed and scalability. Analysis and empirical results are presented that show that this new algorithm is a useful trade-off between indexing and querying efficiency. In scenarios described in Chapter 7, the use of the new maintenance algorithm reduces the time required to construct an index to under one sixth of the time taken by algorithms that maintain contiguous inverted lists. In addition to work on index maintenance, we present a new technique for accumulator pruning during ranked query evaluation, as well as providing evidence that existing approaches are unsatisfactory for collections of large size. Accumulator pruning is a key problem in both querying efficiency and overall text search system efficiency. Existing approaches either fail to bound the memory footprint required for query evaluation, or suffer loss of retrieval accuracy. In contrast, the new pruning algorithm can be used to limit the memory footprint of ranked query evaluation, and in our experiments gives retrieval accuracy not worse than previous alternatives. The results presented in this thesis are validated with robust experiments, which utilise collections of significant size, containing real data, and tested using appropriate numbers of real queries. The techniques presented in this thesis allow information retrieval applications to efficiently index and search changing collections, a task that has been historically problematic.
Style APA, Harvard, Vancouver, ISO itp.
3

Sornil, Ohm. "Parallel Inverted Indices for Large-Scale, Dynamic Digital Libraries". Diss., Virginia Tech, 2001. http://hdl.handle.net/10919/26131.

Pełny tekst źródła
Streszczenie:
The dramatic increase in the amount of content available in digital forms gives rise to large-scale digital libraries, targeted to support millions of users and terabytes of data. Retrieving information from a system of this scale in an efficient manner is a challenging task due to the size of the collection as well as the index. This research deals with the design and implementation of an inverted index that supports searching for information in a large-scale digital library, implemented atop a massively parallel storage system. Inverted index partitioning is studied in a simulation environment, aiming at a terabyte of text. As a result, a high performance partitioning scheme is proposed. It combines the best qualities of the term and document partitioning approaches in a new Hybrid Partitioning Scheme. Simulation experiments show that this organization provides good performance over a wide range of conditions. Further, the issues of creation and incremental updates of the index are considered. A disk-based inversion algorithm and an extensible inverted index architecture are described, and experimental results with actual collections are presented. Finally, distributed algorithms to create a parallel inverted index partitioned according to the hybrid scheme are proposed, and performance is measured on a portion of the equipment that normally makes up the 100 node Virginia Tech PetaPlex™ system. NOTE: (02/2007) An updated copy of this ETD was added after there were patron reports of problems with the file.
Ph. D.
Style APA, Harvard, Vancouver, ISO itp.
4

Hung, Chien-Che, i 洪健哲. "Incremental Structured Index Update Mechanism and Path Expression Query for XML Documents". Thesis, 2002. http://ndltd.ncl.edu.tw/handle/31955121111529273317.

Pełny tekst źródła
Streszczenie:
碩士
國立交通大學
資訊科學系
90
XML documents contain abundant structural information that can be employed to better understand the XML documents. Structured queries are queries that search the structural information of XML documents. In order to support structured queries, k-ary trees are used in this thesis as an index structure to store structural information. Based on this index structure, this thesis proposes an incremental structured index update mechanism and implements a few functions of a SQL-like path expression query language, called Lorel. K-ary trees are a well-known index structure can be used to store structural information of XML documents, where k is a predefined maximum number of branches that a tree node can have. When an XML document is modified, its corresponding k-ary tree has to be updated as well for reflecting the modification. However, when a modification makes the number of branches of a tree node exceeds k, the k-ary tree is no longer workable and the whole k-ary tree has to be reconstructed. Reconstructing the whole k-ary tree is time-consuming when the structure information changes frequently. This thesis proposes an incremental structured index update mechanism called the Split Method to avoid reconstructing the k-ary tree when the number of branches of a node exceeds k. Through splitting nodes and defining an equivalent relationship, this mechanism can update k-ary trees efficiently. Several evaluations were conducted to assess the Split Method and the k-ary tree reconstruction. The evaluation shows that the Split Method only wastes a little more space than tree reconstruction, but it is more efficient than tree reconstruction in updating k-ary trees. In addition, based on the k-ary tree structured index, this thesis implements a few functions of a SQL-like path expression query language, called Lorel. Path expression queries facilitate user to issue structural queries when the document structure is irregular or unknown in advance. The results of queries are formatted as XML documents.
Style APA, Harvard, Vancouver, ISO itp.
5

Chia-YinHsu i 許家胤. "Multi-Index Hybrid Trie for IP lookup and Updates". Thesis, 2012. http://ndltd.ncl.edu.tw/handle/49453871349684573615.

Pełny tekst źródła
Streszczenie:
碩士
國立成功大學
資訊工程學系碩博士班
100
High performance routers require high-speed IP address lookup to achieve wire speed packet forwarding. In this thesis, a new data structure of dynamic router table is proposed for IP lookup and updates, called Multi-Index Hybrid Trie (MIHT). By associating each prefix with a key value, we can perform an IP lookup operation efficiently in a balanced search tree. Furthermore, because the tree height and the number of prefixes that need to be compared is reduced, the dynamic router-table operations can also be performed efficiently. To reduce the memory requirement, for each prefix we store its corresponding suffix in a node of MIHT instead of storing a full binary string. Experiments using real IPv4 routing databases indicate that, the proposed data structure is e±cient in memory usage and performs well in terms of lookup, insert and delete operations. We report the results of experiments conducted to compare the proposed data structure with other structures using the benchmark IPv4 prefix databases AS1221, AS4637, AS6447, and AS65000 with 407,067, 219,581, 417,995, and 406,973 prefixes, respectively.
Style APA, Harvard, Vancouver, ISO itp.
6

Sin-JieHuang i 黃信傑. "Multilevel Length-Based-Classified Index Table for IP Lookups and Updates". Thesis, 2015. http://ndltd.ncl.edu.tw/handle/34010787792922834045.

Pełny tekst źródła
Streszczenie:
碩士
國立成功大學
資訊工程學系
103
A good data structure design can provide high-speed IP lookups and updates. In this paper, a new data structure of dynamic router table is proposed for IP lookups and updates, called Multilevel Length-Based-Classified Index Table (MLIT). The prefix length distribution of a routing table is uneven situation. There is a large prefix number in certain prefix length. In MLIT, special operation for these prefixes is used to accelerate the average lookup speed. In addition, the multilevel structure with index tables can provide faster updates. And memory requirement utilization is improved by the ingenuity design in data structure. We experimented using real-world routing databases. Our experiments compare the proposed data structure with other structures using the benchmark IPv4 and IPv6 prefix databases AS1221, AS4637, AS6447, AS1221* with 407067, 219581, 417995, 20142 prefixes respectively, where AS1221* is a IPv6 BGP routing table. Both the average lookup time and the average update time are outstanding with other data structures, and the memory requirement less than the simple structure, like prefix trie and priority trie.
Style APA, Harvard, Vancouver, ISO itp.

Książki na temat "Index update"

1

Science experiments index for young people, update 91. Englewood, Colo: Libraries Unlimited, 1992.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Mason, Janet E. Upwelling index update, U.S. west coast, 33N-48N latitude. [Monterey, Calif.]: U.S. Department of Commerce, National Oceanic and Atmospheric Administration, National Marine Fisheries Service, Southwest Fisheries Center, 1986.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Mason, Janet E. Upwelling index update, U.S. west coast, 33N-48N latitude. [Monterey, Calif.]: U.S. Department of Commerce, National Oceanic and Atmospheric Administration, National Marine Fisheries Service, Southwest Fisheries Center, 1986.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Pratt, Craig. The Environmental Vulnerability Index (EVI): Update & final steps to completion. Suva, Fiji: South Pacific Applied Geoscience Commission, 2004.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Assel, Raymond A. Great Lakes degree-day and winter severity index update: 1897-1983. Ann Arbor, Mich: U.S. Dept. of Commerce, National Oceanic and Atmospheric Administration, Environmental Research Laboratories, 1986.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

United States. Health Care Financing Administration. Third update to the geographic practice cost index: Task order 0038. [Dallas, TX?]: KPMG, 2000.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Assel, Raymond A. Great Lakes degree-day and winter severity index update: 1897-1983. Ann Arbor, Mich: U.S. Dept. of Commerce, National Oceanic and Atmospheric Administration, Environmental Research Laboratories, 1986.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Assel, Raymond A. Great Lakes degree-day and winter severity index update: 1897-1983. Ann Arbor, Mich: U.S. Dept. of Commerce, National Oceanic and Atmospheric Administration, Environmental Research Laboratories, 1986.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Assel, Raymond A. Great Lakes degree-day and winter severity index update: 1897-1983. Ann Arbor, Mich: U.S. Dept. of Commerce, National Oceanic and Atmospheric Administration, Environmental Research Laboratories, 1986.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Assel, Raymond A. Great Lakes degree-day and winter severity index update: 1897-1983. Ann Arbor, Mich: U.S. Dept. of Commerce, National Oceanic and Atmospheric Administration, Environmental Research Laboratories, 1986.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Części książek na temat "Index update"

1

Little, R. A., D. Gorman i M. Allgöwer. "The Shock Index Revisited". W Update 1990, 505–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/978-3-642-84125-5_53.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Chambers, Larry W. "The McMaster Health Index Questionnaire: an update". W Quality of Life Assessment: Key Issues in the 1990s, 131–49. Dordrecht: Springer Netherlands, 1993. http://dx.doi.org/10.1007/978-94-011-2988-6_6.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Aebischer, C. Casaulta, i R. Kraemer. "The Lung Clearance Index (LCI) as an Estimate of Ventilation Inequalities in Patients with Cystic Fibrosis". W Update on Childhood Asthma, 73–83. Basel: Birkhäuser Basel, 1993. http://dx.doi.org/10.1007/978-3-0348-7385-7_7.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Giraud, R., N. Siegenthaler i K. Bendjelid. "Cardiac Index During Therapeutic Hypothermia: Which Target Value Is Optimal?" W Annual Update in Intensive Care and Emergency Medicine 2013, 321–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-35109-9_26.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Perel, A. "The Potential Value of Monitoring the Oxygen Reserve Index in Patients Receiving Oxygen". W Annual Update in Intensive Care and Emergency Medicine, 271–80. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-27349-5_22.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Futier, E., J. L. Teboul i B. Vallet. "How Can We Use Tissue Carbon Dioxide Measurement as an Index of Perfusion?" W Annual Update in Intensive Care and Emergency Medicine 2011, 366–74. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-18081-1_33.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Cosmadakis, Stavros, Kleoni Ioannidou i Stergios Stergiou. "View Serializable Updates of Concurrent Index Structures". W Database Programming Languages, 247–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-46093-4_15.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Devaty, R. P. "SiC: refractive index". W New Data and Updates for III-V, II-VI and I-VII Compounds, 348. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-540-92140-0_260.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Zhu, Yuean, Shan Wang, Xuan Zhou i Yansong Zhang. "RUM+-tree: A New Multidimensional Index Supporting Frequent Updates". W Web-Age Information Management, 235–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38562-9_24.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Fernandes da Silva, E. C. "AlAs: refractive index". W New Data and Updates for I-VII, III-V, III-VI and IV-VI Compounds, 179. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-48529-2_72.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Index update"

1

Nepomnyachiy, Sergey, i Torsten Suel. "Efficient index updates for mixed update and query loads". W 2016 IEEE International Conference on Big Data (Big Data). IEEE, 2016. http://dx.doi.org/10.1109/bigdata.2016.7840697.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Sato, N., i M. Uehara. "Differential index update in cooperative search engine". W Proceedings. 15th International Workshop on Database and Expert Systems Applications, 2004. IEEE, 2004. http://dx.doi.org/10.1109/dexa.2004.1333490.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

KELLER, J. "Update on the SCATR index - Validation at PROFS". W 24th Aerospace Sciences Meeting. Reston, Virigina: American Institute of Aeronautics and Astronautics, 1986. http://dx.doi.org/10.2514/6.1986-256.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Lu, Maohua, Dilip Simha i Tzi-cker Chiueh. "Scalable Index Update for Block-Level Continuous Data Protection". W 2011 6th IEEE International Conference on Networking, Architecture, and Storage (NAS). IEEE, 2011. http://dx.doi.org/10.1109/nas.2011.54.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Buell, R. S., i R. A. Maurer. "A Leading Index of Drilling Activity: Update and Improvements". W SPE Annual Technical Conference and Exhibition. Society of Petroleum Engineers, 1986. http://dx.doi.org/10.2118/15356-ms.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Rui Ding, Xiaofeng Meng i Yun Bai. "Efficient index update for moving objects with future trajectories". W Proceedings Eighth International Conference on Database Systems for Advanced Applications (DASFAA 2003). IEEE, 2003. http://dx.doi.org/10.1109/dasfaa.2003.1192382.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Henrich, Andreas. "The update of index structures in object-oriented DBMS". W the sixth international conference. New York, New York, USA: ACM Press, 1997. http://dx.doi.org/10.1145/266714.266883.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Chen, ShengQun, Qin Hong, ZhongJian Teng i Yang Lin. "A Novel Mixed Index Strategy for Real-Time Update". W 2008 International Conference on Computer Science and Software Engineering. IEEE, 2008. http://dx.doi.org/10.1109/csse.2008.1630.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Jang, Hyunchi, Youngil Kim i Dongwook Shin. "An effective mechanism for index update in structured documents". W the eighth international conference. New York, New York, USA: ACM Press, 1999. http://dx.doi.org/10.1145/319950.320031.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

"THE INDEX UPDATE PROBLEM FOR XML DATA IN XDBMS". W 7th International Conference on Enterprise Information Systems. SciTePress - Science and and Technology Publications, 2005. http://dx.doi.org/10.5220/0002524600270034.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Index update"

1

Ricketts, H. D. Update of Coal Index For Yukon and District of Mackenzie, Northwest Territories. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 1988. http://dx.doi.org/10.4095/130716.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Mirel, Lisa, Cindy Zhang, Christine Cox, Ye Yeats, Félix Suad El Burai i Golden Cordell. Comparative analysis of the National Health and Nutrition Examination Survey public-use and restricted-use linked mortality files. Centers for Disease Control and Prevention (U.S.), maj 2021. http://dx.doi.org/10.15620/cdc:104744.

Pełny tekst źródła
Streszczenie:
"Objectives—Linking national survey data with administrative data sources enables researchers to conduct analyses that would not be possible with each data source alone. Recently, the Data Linkage Program at the National Center for Health Statistics (NCHS) released updated Linked Mortality Files, including the National Health and Nutrition Examination Survey data linked to the National Death Index mortality files. Two versions of the files were released: restricted-use files available through NCHS and Federal Statistical Research Data Centers and public-use files. To reduce the reidentification risk, statistical disclosure limitation methods were applied to the public-use files before they were released. This included limiting the amount of mortality information available and perturbing cause of death and follow-up time for select records. Methods—To assess the comparability of the restricted-use and public-use files, relative hazard ratios for all-cause and cause-specific mortality using Cox proportional hazards models were estimated and compared. Results—The comparative analysis found that the two data files yield similar descriptive and model results. Suggested citation: Mirel LB, Zhang C, Cox CS, Ye Y, El Burai Félix S, Golden C. Comparative analysis of the National Health and Nutrition Examination Survey public-use and restricted-use linked mortality files. National Health Statistics Reports; no 155. Hyattsville, MD: National Center for Health Statistics. 2021. DOI: https://doi.org/10.15620/cdc:104744. CS323656 nhsr155-508.pdf"
Style APA, Harvard, Vancouver, ISO itp.
3

Havrlant, David, i Abdulelah Darandary. Economic Diversification under Saudi Vision 2030. King Abdullah Petroleum Studies and Research Center, kwiecień 2021. http://dx.doi.org/10.30573/ks--2021-dp06.

Pełny tekst źródła
Streszczenie:
The last decade has brought a row of substantial changes that have profound implications for the traditional hydrocarbon resource-rich economies. Economic conditions may change radically either throughout a decade or within months. The question is whether there is no other option for a hydrocarbon resource-rich economy than to be held hostage to the fluctuations in global oil prices. The general answer to a changing environment is: Adapt! From the macroeconomic perspective, this means diversifying the economy to broaden the income base and significantly reduce the dependence on oil revenues. The Saudi Vision 2030 represents a complex plan for substantial socioeconomic adjustments that are about to move the economy toward a more diversified and sustainable one. This discussion paper examines the preferred diversification paths for the Saudi economy in more detail, with a focus on the foreseen adjustments in the sectoral composition of the economy along with broader macroeconomic shifts. The evaluation of the foreseen diversification impacts is based on the updated Vision 2030 Input-Output Table that maps the changing structure of the Saudi economy over the coming decade. We discuss the assumed expansion of the diversification frontrunners, their changing contribution to the overall economic activity and identify the preferred diversification paths for the Saudi economy. The advances in economic diversification are measured by applying the Shannon-Weaver index to sectoral GDP and household income. The expected sectoral changes are wide-reaching, so the basic macroeconomic relations are also subject to adjustments. We also conduct a sensitivity analysis to examine the effects of the foreseen diversification on the resilience of the Saudi economy to external shocks.
Style APA, Harvard, Vancouver, ISO itp.
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii