Готові списки джерел за темами / Huge Pages

Добірка наукової літератури з теми "Huge Pages"

Автор: Grafiati
Опубліковано: 6 вересня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Huge Pages".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Huge Pages"

1

Panwar, Ashish, Aravinda Prasad, and K. Gopinath. "Making Huge Pages Actually Useful." ACM SIGPLAN Notices 53, no. 2 (November 30, 2018): 679–92. http://dx.doi.org/10.1145/3296957.3173203.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Al-Kabi, Mohammed, Heider Wahsheh, Izzat Alsmadi, Emad Al-Shawakfa, Abdullah Wahbeh, and Ahmed Al-Hmoud. "Content-based analysis to detect Arabic web spam." Journal of Information Science 38, no. 3 (April 19, 2012): 284–96. http://dx.doi.org/10.1177/0165551512439173.

Повний текст джерела
Анотація:
Search engines are important outlets for information query and retrieval. They have to deal with the continual increase of information available on the web, and provide users with convenient access to such huge amounts of information. Furthermore, with this huge amount of information, a more complex challenge that continuously gets more and more difficult to illuminate is the spam in web pages. For several reasons, web spammers try to intrude in the search results and inject artificially biased results in favour of their websites or pages. Spam pages are added to the internet on a daily basis, thus making it difficult for search engines to keep up with the fast-growing and dynamic nature of the web, especially since spammers tend to add more keywords to their websites to deceive the search engines and increase the rank of their pages. In this research, we have investigated four different classification algorithms (naïve Bayes, decision tree, SVM and K-NN) to detect Arabic web spam pages, based on content. The three groups of datasets used, with 1%, 15% and 50% spam contents, were collected using a crawler that was customized for this study. Spam pages were classified manually. Different tests and comparisons have revealed that the Decision Tree was the best classifier for this purpose.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Feliu, Josué, Julio Sahuquillo, Salvador Petit, and José Duato. "Using Huge Pages and Performance Counters to Determine the LLC Architecture." Procedia Computer Science 18 (2013): 2557–60. http://dx.doi.org/10.1016/j.procs.2013.05.440.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Hioual, Ouided, Sofiane Mounine Hemam, Ouassila Hioual, and Lyes Maif. "A Hybrid Approach for Web Pages Classification." Ingénierie des systèmes d information 27, no. 5 (October 31, 2022): 747–55. http://dx.doi.org/10.18280/isi.270507.

Повний текст джерела
Анотація:
Currently, the internet is growing at an exponential rate and can cover just some required data. However, the immense amount of web pages makes the discovery of the target data more difficult for the user. Therefore, an efficient method to classify this huge amount of data is essential where web pages can be exploited to their full potential. In this paper, we propose an approach to classify Web pages based on their textual content. This approach is based on an unsupervised statistical technique (TF-IDF) for keyword extraction (textual content) combined with a supervised machine learning approach, namely recurrent neural networks.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Kumar, Santosh, and Ravi Kumar. "WDPMA." International Journal of Information Technology and Web Engineering 16, no. 2 (April 2021): 1–24. http://dx.doi.org/10.4018/ijitwe.2021040101.

Повний текст джерела
Анотація:
The internet is very huge in size and increasing exponentially. Finding any relevant information from such a huge information source is now becoming very difficult. Millions of web pages are returned in response to a user's ordinary query. Displaying these web pages without ranking makes it very challenging for the user to find the relevant results of a query. This paper has proposed a novel approach that utilizes web content, usage, and structure data to prioritize web documents. The proposed approach has applications in several major areas like web personalization, adaptive website development, recommendation systems, search engine optimization, business intelligence solutions, etc. Further, the proposed approach has been compared experimentally by other approaches, WDPGA, WDPSA, and WDPII, and it has been observed that with a little trade off time, it has an edge over these approaches.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Ahamed, B. Bazeer, D. Yuvaraj, S. Shitharth, Olfat M. Mizra, Aisha Alsobhi, and Ayman Yafoz. "An Efficient Mechanism for Deep Web Data Extraction Based on Tree-Structured Web Pattern Matching." Wireless Communications and Mobile Computing 2022 (May 27, 2022): 1–10. http://dx.doi.org/10.1155/2022/6335201.

Повний текст джерела
Анотація:
The World Wide Web comprises of huge web databases where the data are searched using web query interface. Generally, the World Wide Web maintains a set of databases to store several data records. The distinct data records are extracted by the web query interface as per the user requests. The information maintained in the web database is hidden and retrieves deep web content even in dynamic script pages. In recent days, a web page offers a huge amount of structured data and is in need of various web-related latest applications. The challenge lies in extracting complicated structured data from deep web pages. Deep web contents are generally accessed by the web queries, but extracting the structured data from the web database is a complex problem. Moreover, making use of such retrieved information in combined structures needs significant efforts. No further techniques are established to address the complexity in data extraction of deep web data from various web pages. Despite the fact that several ways for deep web data extraction are offered, very few research address template-related issues at the page level. For effective web data extraction with a large number of online pages, a unique representation of page generation using tree-based pattern matches (TBPM) is proposed. The performance of the proposed technique TBPM is compared to that of existing techniques in terms of relativity, precision, recall, and time consumption. The performance metrics such as high relativity is about 17-26% are achieved when compared to FiVaTech approach.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Suleymanzade, Suleyman, and Fargana Abdullayeva. "Full Content-based Web Page Classification Methods by using Deep Neural Networks." Statistics, Optimization & Information Computing 9, no. 4 (July 30, 2021): 963–73. http://dx.doi.org/10.19139/soic-2310-5070-1056.

Повний текст джерела
Анотація:
The quality of the web page classification process has a huge impact on information retrieval systems. In this paper, we proposed to combine the results of text and image data classifiers to get an accurate representation of the web pages. To get and analyse the data we created the complicated classifier system with data miner, text classifier, and aggregator. The process of image and text data classification has been achieved by the deep learning models. In order to represent the common view onto the web pages, we proposed three aggregation techniques that combine the data from the classifiers.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

T, Anuradha, and Tayyaba Nousheen. "MACHINE LEARNING BASED SEARCH ENGINE WITH CRAWLING, INDEXING AND RANKING." International Journal of Computer Science and Mobile Computing 10, no. 7 (July 30, 2021): 76–83. http://dx.doi.org/10.47760/ijcsmc.2021.v10i07.011.

Повний текст джерела
Анотація:
The web is the heap and huge collection of wellspring of data. The Search Engine are used for retrieving the information from World Wide Web (WWW). Search Engines are helpful for searching user keywords and provide the accurate result in fraction of seconds. This paper proposed Machine Learning based search engine which will give more relevant user searches in the form of web pages. To display the user entered query search engine plays a major role of basic interface. Every site comprises of the heaps of site pages that are being made and sent on the server.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Pronskikh, A. A., and Y. S. Fedorov. "Report on the IV Plenum of the Association of Traumatologists and Orthopedists of Russia and the conference "Diagnostics and Treatment of Polytraumas"." N.N. Priorov Journal of Traumatology and Orthopedics 6, no. 4 (November 15, 1999): 72–74. http://dx.doi.org/10.17816/vto105624.

Повний текст джерела
Анотація:
The problem of polytrauma is increasingly becoming the subject of discussion in various medical forums and pages of special publications. However, many of its questions remain unresolved. This dictates the need to identify priority areas, the development of which will help a huge army of practitioners who constantly face serious injuries in their work.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Et. al., Shilpa Deshmukh,. "Efficient Methodology for Deep Web Data Extraction." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 1S (April 11, 2021): 286–93. http://dx.doi.org/10.17762/turcomat.v12i1s.1769.

Повний текст джерела
Анотація:
Deep Web substance are gotten to by inquiries submitted to Web information bases and the returned information records are enwrapped in progressively created Web pages (they will be called profound Web pages in this paper). Removing organized information from profound Web pages is a difficult issue because of the fundamental mind boggling structures of such pages. As of not long ago, an enormous number of strategies have been proposed to address this issue, however every one of them have characteristic impediments since they are Web-page-programming-language subordinate. As the mainstream two-dimensional media, the substance on Web pages are constantly shown routinely for clients to peruse. This inspires us to look for an alternate path for profound Web information extraction to beat the constraints of past works by using some fascinating normal visual highlights on the profound Web pages. In this paper, a novel vision-based methodology that is Visual Based Deep Web Data Extraction (VBDWDE) Algorithm is proposed. This methodology basically uses the visual highlights on the profound Web pages to execute profound Web information extraction, including information record extraction and information thing extraction. We additionally propose another assessment measure amendment to catch the measure of human exertion expected to create wonderful extraction. Our investigations on a huge arrangement of Web information bases show that the proposed vision-based methodology is exceptionally viable for profound Web information extraction.
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Дисертації з теми "Huge Pages"

1

Patel, Naman. "A Case for Protecting Huge Pages from the Kernel." Thesis, 2016. http://etd.iisc.ernet.in/handle/2005/2936.

Повний текст джерела
Анотація:
Modern architectures support multiple size pages to facilitate applications that use large chunks of contiguous memory either for buffer allocation, application specific memory management, in-memory caching or garbage collection. Most general purpose processors support larger page sizes, for e.g. x86 architecture supports 2MB and 1GB pages while PowerPC architecture supports 64KB, 16MB, 16GB pages. Such larger size pages are also known as superpages or huge pages. With the help of huge pages TLB reach can be increased significantly. The Linux kernel can transparently use these huge pages to significantly bring down the cost of TLB translations. With Transparent Huge Pages (THP) support in Linux kernel the end users or the application developers need not make any change to their application. Memory fragmentation which has been one of the classical problems in computing systems for decades is a key problem for the allocation of huge pages. Ubiquitous huge page support across architectures makes effective fragmentation management even more critical for modern systems. Applications tend to stress system TLB in the absence of huge pages, for virtual to physical address translation, which adversely affects performance/energy characteristics in long running systems. Since most kernel pages tend to be unmovable, fragmentation created due to their misplacement is more problematic and nearly impossible to recover with memory compaction. In this work, we explore physical memory manager of Linux and the interaction of kernel page placement with fragmentation avoidance and recovery mechanisms. Our analysis reveals that not only a random kernel page layout thwarts the progress of memory compaction; it can actually induce more fragmentation in the system. To address this problem, we propose a new allocator which takes special care for the placement of kernel pages. We propose a new region which represents memory area having kernel as well as user pages. Using this new region we introduce a staged allocator which with change in fragmentation level adapts and optimizes the kernel page placement. Later we introduce Illuminator which with zero overhead outperforms default kernel in terms of huge page allocation success rate and compaction overhead with respect to each huge page. We also show that huge page allocation is not a one dimensional problem but a two fold concern with how the fragmentation recovery mechanism may potentially interfere with the page clustering policy of allocator and worsen the fragmentation. Our results show that with effective kernel page placements the mixed page block counts reduces upto 70%, which allows our system to allocate 3x-4x huge pages than the default Kernel. Using these additional huge pages we show up to 38% improvement in terms of energy consumed and reduction in execution time up to 39% on standard benchmarks.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Huang, Han-ping, and 黃瀚平. "Efficient On-Demand Hash-Based Page Mapping Schemefor Huge Capacity Flash-Memory Storage Systems." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/90841521331969647215.

Повний текст джерела
Анотація:
碩士
國立臺灣科技大學
資訊工程系
97
As capacity of flash memory chips increased constantly, efficient management for flash memory storage systems becomes a critical issue. The major challenge comes from the balance between performance and cost, i.e., internal RAM required for the management. Although hybrid mapping schemes, which combine block-level mapping and page-level mapping to largely reduce internal RAM requirement while guarantee performance, are widely discussed in academia, most of them cannot well satisfy the most stringent cost requirement in industry. This paper adopts an on-demand hash-based page mapping scheme for the management of huge capacity flash-memory storage systems with very limited internal RAM requirement. For a 80GB flash memory storage system, our scheme requires no more than 3KB internal RAM and provides similar performance compared with well-known hybrid mapping schemes, e.g. BAST and FAST. We must emphasize that the required internal RAM would increase slightly even apply our scheme to a much larger flash-memory storage system.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Huang, Liyi, and 黃立儀. "A Silent Film Leaping off the Page: A Study of the Crossover Strategies in The Invention of Hugo Cabret." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/83742559670599889069.

Повний текст джерела
Анотація:
碩士
國立臺東大學
兒童文學研究所
101
As a one-of-a-kind work of children’s literature, The Invention of Hugo Cabret not only crosses the genres of traditionally written novels, graphic novels and picture books, but also employs elements of camera movement mostly seen in movies, as if transforming into a paper movie. Owing to these stylistic features, the book has clinched many awards such as the Caldecott Medal. Such innovative attempts at genre-crossing have met with acclaim and recognition from around the globe. As common narrative themes blur the boundaries between various art forms, a new conceptual framework will gradually take shape. Therefore, this study aims to delve into the ideas and styles of crossover adopted by Brian Selznick, author and illustrator of the book, so as to shed light on how text, graphics and cinematic elements blend with one another. Based on Marshal McLuhan’s idea that the medium is the message, this study, rather than focusing on the text itself, tries to re-examine the effects of the book as a medium. First, the forms of media in the book are analyzed in order to show the similarities with and differences from its movie adaptation. Second, the representation of cinematic features in books since the beginning of film production is discussed, in the hope of illuminating how the author makes the connection. Third, from the perspective of postmodernism, the artistic implications of crossover are explored, further concluding with the author’s crossover strategies. As opposed to a digital platform across media, creativity constructs an ever-evolving internal platform that transcends the barriers set by techniques, and thus books have become an extension of artistic thinking. The Invention of Hugo Cabret exemplifies the complementary relationship between books and their film adaptations, and it is evident that the key to creating works of value lies in genre-crossing postmodern concepts. And the crossover strategies, from internal elements to external features, can serve as a precedent for creators in the future.
Стилі APA, Harvard, Vancouver, ISO та ін.

Книги з теми "Huge Pages"

1

Huge Coloring Book 355 Pages of Fun. Independently Published, 2022.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Notebook, charliemarinell. Notebook: Huge Cock - 50 Sheets, 100 Pages - 8 X 10 Inches. Independently Published, 2020.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Notebook, charliemarinell. Notebook: Huge Cock - 50 Sheets, 100 Pages - 6 X 9 Inches. Independently Published, 2020.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Huge Colouring Book of Sea Animals: 126 Pages to Color Now! Independently Published, 2022.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Mcgee, Jonas. Anime Milfs Coloring Book: Huge Collection of Anime Milfs Coloring Pages for Fans! Independently Published, 2022.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Nicholson, Helen. Anime Milfs Coloring Book: Huge Collection of Anime Milfs Coloring Pages for Fans! Independently Published, 2022.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Mannekt, Zakariyya. Anime Milfs Coloring Book: Huge Collection of Anime Milfs Coloring Pages for Fans! Independently Published, 2022.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

journals, Yobb. Giant Notebook: 600 Pages Journal, Huge Notebook with Lines for Composition and Appreciation Gift. Independently Published, 2020.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Limits, Pushin. XXXL Composition Notebook 500 Pages College Ruled: Grey Slate Design 8. 5x11 Huge Notebook. Independently Published, 2021.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Limits, Pushin. XXXL Composition Notebook 500 Pages College Ruled: Black Marble Design 8. 5x11 Huge Notebook. Independently Published, 2021.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Частини книг з теми "Huge Pages"

1

Fichte, Johannes K., Norbert Manthey, Julian Stecklina, and André Schidler. "Towards Faster Reasoners by Using Transparent Huge Pages." In Lecture Notes in Computer Science, 304–22. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-58475-7_18.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Malliotakis, Ioannis, Anastasios Papagiannis, Manolis Marazakis, and Angelos Bilas. "HugeMap: Optimizing Memory-Mapped I/O with Huge Pages for Fast Storage." In Euro-Par 2020: Parallel Processing Workshops, 344–55. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71593-9_27.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Li, Guoxi, Wenzhi Chen, Kui Su, Zhongyong Lu, and Zonghui Wang. "Hzmem: New Huge Page Allocator with Main Memory Compression." In Algorithms and Architectures for Parallel Processing, 51–64. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-65482-9_4.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Singh, Mahesh Kumar, Om Prakash Rishi, Anukrati Sharma, and Zaved Akhtar. "Knowledge Extraction Through Page Rank Using Web-Mining Techniques for E-Business." In Advances in Business Information Systems and Analytics, 1–36. IGI Global, 2017. http://dx.doi.org/10.4018/978-1-5225-2234-8.ch001.

Повний текст джерела
Анотація:
Internet plays a vital role for doing the business. It provides platform for creating huge number of customers for ease of business. E-business organizations are growing rapidly and doubly in every minute; World Wide Web (WWW) provides huge information for the Internet users. The accesses of user's behavior are recorded in web logs. This information seems to be very helpful in an E-business environment for analysis and decision making. Mining of web data come across many new challenges with enlarged amount of information on data stored in web logs. The search engines play key role for retrieving the relevant information from huge information. Nowadays, the well-known search engines, like Google, MSN, Yahoo, etc. have provided the users with good search results worked on special search strategies. In web search services the web page ranker component plays the main factor of the Google. This paper discusses the new challenges faced by web mining techniques, ranking of web pages using page ranking algorithms and its application in E-business analysis to improve the business operations.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Matthews, Clifford. "API RP 571: Damage Mechanisms." In The API ICP Exam Handbook: Complete Guide to Passing the API 510/570/653 ICP Exams, 149–75. ASME, 2023. http://dx.doi.org/10.1115/1.862api_ch10.

Повний текст джерела
Анотація:
API RP 571: Damage Mechanisms Affecting Fixed Equipment in the Refining Industry appears in all three ICP BoKs. It developed from old IRE (Inspection of Refinery Equipment) documents and has swelled in technical detail with each new edition. The 2020 edition now describes 67 DMs over 370+ pages and so contains huge amounts of technical detail.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Umamageswari, B., and R. Kalpana. "Web Harvesting." In The Dark Web, 199–226. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-3163-0.ch010.

Повний текст джерела
Анотація:
Web mining is done on huge amounts of data extracted from WWW. Many researchers have developed several state-of-the-art approaches for web data extraction. So far in the literature, the focus is mainly on the techniques used for data region extraction. Applications which are fed with the extracted data, require fetching data spread across multiple web pages which should be crawled automatically. For this to happen, we need to extract not only data regions, but also the navigation links. Data extraction techniques are designed for specific HTML tags; which questions their universal applicability for carrying out information extraction from differently formatted web pages. This chapter focuses on various web data extraction techniques available for different kinds of data rich pages, classification of web data extraction techniques and comparison of those techniques across many useful dimensions.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Umamageswari, B., and R. Kalpana. "Web Harvesting." In Advances in Data Mining and Database Management, 351–78. IGI Global, 2017. http://dx.doi.org/10.4018/978-1-5225-0613-3.ch014.

Повний текст джерела
Анотація:
Web mining is done on huge amounts of data extracted from WWW. Many researchers have developed several state-of-the-art approaches for web data extraction. So far in the literature, the focus is mainly on the techniques used for data region extraction. Applications which are fed with the extracted data, require fetching data spread across multiple web pages which should be crawled automatically. For this to happen, we need to extract not only data regions, but also the navigation links. Data extraction techniques are designed for specific HTML tags; which questions their universal applicability for carrying out information extraction from differently formatted web pages. This chapter focuses on various web data extraction techniques available for different kinds of data rich pages, classification of web data extraction techniques and comparison of those techniques across many useful dimensions.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Zhao, Jie, Jianfei Wang, Jia Yang, and Peiquan Jin. "Company Acquisition Relations Extraction From Web Pages." In Semantic Web Science and Real-World Applications, 1–17. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-7186-5.ch001.

Повний текст джерела
Анотація:
In this chapter, we study the problem of extracting company acquisition relation from huge amounts of webpages, and propose a novel algorithm for a company acquisition relation extraction. Our algorithm considers the tense feature of Web content and classification technology of semantic strength when extracting company acquisition relation from webpages. It first determines the tense of each sentence in a webpage, where a CRF model is employed. Then, the tense of sentences is applied to sentences classification so as to evaluate the semantic strength of the candidate sentences in describing company acquisition relation. After that, we rank the candidate acquisition relations and return the top-k company acquisition relation. We run experiments on 6144 pages crawled through Google, and measure the performance of our algorithm under different metrics. The experimental results show that our algorithm is effective in determining the tense of sentences as well as the company acquisition relation.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Gupta, Mansi, and Alka Sharma. "Enhance Customer Engagement via Facebook Fanpage for Increased Purchase Intentions." In Research Anthology on Social Media Advertising and Building Consumer Relationships, 1117–34. IGI Global, 2022. http://dx.doi.org/10.4018/978-1-6684-6287-4.ch060.

Повний текст джерела
Анотація:
In recent times, social media has become a preferred marketing communication platform by the organisations with the consumers exhibiting an increased inclination towards the adaptation of this media. This paradigm shift justifies the positioning of brands in digital media platforms like Facebook, which provide an ideal platform for direct non-stop communication between organisations and customers. This builds a strong association between brands and consumers thereby generating brand trust through the sharing of consumer experiences and a positive word of mouth. Consumers do not make hasty decisions where there is the involvement of money, therefore trust plays a huge role in the usage of the services provided by eWallets. This study aims to investigate the effect of customer engagement through Facebook fan page usage on brand trust and purchase intentions. Results have revealed that consumer engagement through Facebook fan page usage generates trust for the eWallet brand in turn affecting purchase intentions indicating that Facebook fan pages can be utilised as an effective marketing tool.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Michie, Helena, and Robyn Warhol. "Introduction: adventures in the archives." In Love Among the Archives, 1–61. Edinburgh University Press, 2015. http://dx.doi.org/10.3366/edinburgh/9781474406635.003.0001.

Повний текст джерела
Анотація:
The album is huge. Depending on which librarian brings it to the circulation desk, you might be offered a cart to carry it to your seat in the British Library Reading Room or you might have to tote it yourself. Its vertical length is at least two feet; its width nearly as great. The covers are a dusty red-brown, faded and scratched, and the binding is broken so that the album must be tied with a flat cord to keep it from falling open when lifted. Inside, musty pages of heavy paper require you to stretch out your whole arm to turn them. Neatly affixed to the pages in rough chronological order are a variety of items in card stock: calling cards with the names of English dukes and duchesses in elaborate scripted fonts; handwritten menus for French meals served in grand country houses; seating charts for dinners large and small; printed bills of fare for restaurant banquets. The pages, despite their slight yellowing and a faint but perceptible yellowish smell, have an aura of faded opulence.
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Huge Pages"

1

Panwar, Ashish, Aravinda Prasad, and K. Gopinath. "Making Huge Pages Actually Useful." In ASPLOS '18: Architectural Support for Programming Languages and Operating Systems. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3173162.3173203.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Aksic, Milutin, Hasan Redzovic, and Aleksandra Smiljanic. "Application of huge pages to the netmap platform." In 2017 25th Telecommunication Forum (TELFOR). IEEE, 2017. http://dx.doi.org/10.1109/telfor.2017.8249300.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Panwar, Ashish, Naman Patel, and K. Gopinath. "A Case for Protecting Huge Pages from the Kernel." In APSys '16: 7th ACM SIGOPS Asia-Pacific Workshop on Systems. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2967360.2967371.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Calder, Alan C., Catherine Feldman, Eva Siegmann, John Dey, Anthony Curtis, Smeet Chheda, and Robert J. Harrison. "On Using Linux Kernel Huge Pages with FLASH, an Astrophysical Simulation Code." In 2022 IEEE International Conference on Cluster Computing (CLUSTER). IEEE, 2022. http://dx.doi.org/10.1109/cluster51413.2022.00070.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Teoh, Jessie Poh Lin, and Tong Ming Lim. "Click-Through Rate (Ctr) Prediction for Online Advertising." In International Conference on Digital Transformation and Applications (ICDXA 2020). Tunku Abdul Rahman University College, 2020. http://dx.doi.org/10.56453/icdxa.2020.1004.

Повний текст джерела
Анотація:
Click-Through Rate (CTR) prediction is used to estimate the probability of a user to click on an item in an online advertising. CTR provides insights in supporting effective online advertising that generates huge advertising revenues and also improve users’ satisfaction. Researchers use various features in their proposed CTR prediction models, and they can be generally classified as advertisement feature, user feature and ad-context feature. Advertisement feature explains “How” an ad serving is, user feature illustrates “Who” is browsing the web pages and lastly the ad-context feature describes “What” the product is, “Where” will an ad displayed and the “Mood” of the web contents from users’ comments. In recent years, there is a transformation on CTR models from the traditional methodologies into deep CTR models. Different studies have emphasized certain features and there is no consensus on the features used in the CTR prediction models to achieve better performance. This paper examines the features used by various CTR prediction models in the online advertising and the various opportunities that are available for future research. Keywords: Ad-context, Click-Through Rate, Deep Interest Evolution Network, Deep Interest Network, Deep Session Interest Network
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Cao, Wenqi, Ling LiuS, Gong Su, and Arun Iyengar. "Efficient Huge Page Management with Xpage." In 2021 IEEE International Conference on Big Data (Big Data). IEEE, 2021. http://dx.doi.org/10.1109/bigdata52589.2021.9672050.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Fukunaga, Takafumi, Hidenori Umeno, and Tomoo Aoyama. "Practical use of two kinds of Huge Page." In 2008 International Conference on Smart Manufacturing application (ICSMA). IEEE, 2008. http://dx.doi.org/10.1109/icsma.2008.4505662.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Xiaoxiong, Wang, Wu Jinchun, and Wang Haiyan. "The influence of color on web page complexity and color recommendation." In 13th International Conference on Applied Human Factors and Ergonomics (AHFE 2022). AHFE International, 2022. http://dx.doi.org/10.54941/ahfe1001721.

Повний текст джерела
Анотація:
The complexity of a web page has a great influence on the user's understanding and comprehension. There are many factors that can affect page complexity, such as color, block number, number of texts, etc. Color is not only a factor that affects complexity, but also a factor that attracts the user's attention most on the page. Previous studies on color mainly focused on the basic attributes, such as hue, purity and brightness. However, there were few studies that utilized quantitative calculation methods to evaluate color complexity and webpage color matching calculation. Thus, the present study is set out to explore the impact of colors on page complexity, considering three main factors: the number of colors, color area and color ranges. In order to determine the upper limit of the number of colors for page complexity, a polit study was carried out using webpages as an example, then experiment was conducted within this number of colors to explore the most comfortable color area and color distance matching. The result revealed that: If the number of color is less than six, it will not feel very complicated. The average color area value of the entire web page should vary between 200-1100 pixels (assuming the area of each pixel is 1), the recommended color range is between 0.5-1. Finally, we proposed a page complexity calculation formula including the above three elements which are used as independent variables to calculate the page complexity value. Color matching of webpage can be recommended within this range. The complexity of the matching page obtained in this way is relatively moderate, and it looks comfortable and concise for users. The formula of this article can evaluate the complexity of existing pages, certainly it can also be utilized to develop a set of color complexity calculation model.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Petrescu, Anca. "TOWARDS EFFECTIVE PRESCHOOL TO PRIMARY SCHOOL TRANSITIONS - RECOGNIZING THE POTENTIAL OF ICT." In eLSE 2012. Editura Universitara, 2012. http://dx.doi.org/10.12753/2066-026x-12-044.

Повний текст джерела
Анотація:
Starting school has always been perceived as one of the most important transitions in a child’s life and as a major challenge for the adults around him/her. Measured in social and intelectual terms, the success of this initiation is deemed by many specialists a determining factor in the easy adaptation of the newly-student to the specific demands of the educational environment. Some reference books (Fabian & Dunlop, 2002; Dunlop & Fabian, 2003) even advance the idea of a long-term impact of this period, since all subsequent experiences of the child may be influenced by his/her initial success (or failure). The huge contribution of ICT in education, in a century when the technological boom is an unprecedented one in the history of mankind, thus becomes completely justifiable by the richness of contexts and learning experiences they make available to the preschool and young age school pupils. The studies performed in various states of the world have already emphasized the positive role of inserting such modern means in the educational process, while affirming at the same time the need to train the teaching staff in this respect. In this context, the present article focuses on a subject of topical interest: the impact of digital teaching resources on the beginning of school and the teacher’s role in developing some learning circumstances that should encourage the use of ICT. The debate is one with major implications in our area of interest, as ICT means can decisively influence, even during the kindergarten years, the training and development of intellectual work skills. In point of fact, the digital resources have many advantages from the point of view of improving the teaching-learning- assessment process, widely considered in the following pages, which comprise a critical and comparative analysis of the phenomenon, with a stress on the characteristics of the education system in Romania and on the benefits of exploiting, at national level, digital products that should support the transition from preschool to primary school.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Li, Xinyu, Lei Liu, Shengjie Yang, Lu Peng, and Jiefan Qiu. "Thinking about A New Mechanism for Huge Page Management." In the 10th ACM SIGOPS Asia-Pacific Workshop. New York, New York, USA: ACM Press, 2019. http://dx.doi.org/10.1145/3343737.3343745.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Також вас можуть зацікавити розширені добірки на тему "Huge Pages" для конкретних типів джерел:
Статті в журналах Книги
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії