Search

Objective: This study aims to comprehensively review the use of graph neural networks (GNNs) for clinical risk prediction based on electronic health records (EHRs). The primary goal is to provide an overview of the state-of-the-art of this subject, highlighting ongoing research efforts and identifying existing challenges in developing effective GNNs for improved prediction of clinical risks. Methods: A search was conducted in the Scopus, PubMed, ACM Digital Library, and Embase databases to identify relevant English-language papers that used GNNs for clinical risk prediction based on EHR data. The study includes original research papers published between January 2009 and May 2023. Results: Following the initial screening process, 50 articles were included in the data collection. A significant increase in publications from 2020 was observed, with most selected papers focusing on diagnosis prediction (n = 36). The study revealed that the graph attention network (GAT) (n = 19) was the most prevalent architecture, and MIMIC-III (n = 23) was the most common data resource. Conclusion: GNNs are relevant tools for predicting clinical risk by accounting for the relational aspects among medical events and entities and managing large volumes of EHR data. Future studies in this area may address challenges such as EHR data heterogeneity, multimodality, and model interpretability, aiming to develop more holistic GNN models that can produce more accurate predictions, be effectively implemented in clinical settings, and ultimately improve patient care. © 2024 The Authors, Funding: This work was financed in part by the Swedish Council for Higher Education through the Linnaeus-Palme Partnership, Sweden (3.3.1.34.16456), Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES), Brazil - Finance Code 001, and Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq), Brazil through grants nr. 309505/2020-8 and 308075/2021-8. We also acknowledge the support from Fundação de Amparo à Pesquisa do Estado do Rio Grande do Sul (FAPERGS), Brazil through grants nr. 22/2551-0000390-7 (Project CIARS) and 21/2551-0002052-0.

In today's era along with the times, the internet network is needed in finding information because the internet is used as a source of information and exchange data in real time. Therefore, the internet is used in daily human activities, especially in the world of education. In the world of education, the internet is used as a means of online learning and as a source for finding learning materials related to education. In an educational institution, the number of users connected to the internet network is very large, making it possible for infiltration by malware and distribution. Malware activity is closely related to computer memory, computer performance and also network activity on computer systems making it difficult to access learning media sites in the network because there is no network security management that regulates the data exchange traffic of each user. The right solution to overcome this problem is to implement malware security and proxy server configurations as the method used to manage traffic for data exchange activities. The methodology used is dynamic analysis by analyzing malware on a system and looking at the activities or processes activated by the malware. By applying the security malware method and proxy server configuration, the quality of the network will be better because it minimizes malware traffic on the network system according to the configuration that is applied and also users will be restricted from accessing certain sites.

In today's era along with the times, the internet network is needed in finding information because the internet is used as a source of information and exchange data in real time. Therefore, the internet is used in daily human activities, especially in the world of education. In the world of education, the internet is used as a means of online learning and as a source for finding learning materials related to education. In an educational institution, the number of users connected to the internet network is very large, making it possible for infiltration by malware and distribution. Malware activity is closely related to computer memory, computer performance and also network activity on computer systems making it difficult to access learning media sites in the network because there is no network security management that regulates the data exchange traffic of each user. The right solution to overcome this problem is to implement malware security and proxy server configurations as the method used to manage traffic for data exchange activities. The methodology used is dynamic analysis by analyzing malware on a system and looking at the activities or processes activated by the malware. By applying the security malware method and proxy server configuration, the quality of the network will be better because it minimizes malware traffic on the network system according to the configuration that is applied and also users will be restricted from accessing certain sites.

В данной исследовательской статье на основе технологии визуализации CiteSpace и корпусного подхода к изучению ключевых слов и аннотаций к публикациям, размещенным в 2010–2021 годах в 25 основных журналах, посвященных вопросам высшего образования, анализируются тенденции и «горячие точки» интернационализации управления в области интернационализации высшего образования. Технология визуализации CiteSpace по ключевым словам показала, что фокус и «горячие точки» исследований интернационализации управления сосредоточены на управлении последипломным образованием, на проектах «Первоклассные университеты и специальности международного уровня», «Район Большого залива Гуандун – Гонконг – Макао», «Сотрудничество в сфере управления школами» и так далее. В будущем направлениями исследований могут стать «локальная интернационализация» университетского управления, интернационализация управления с точки зрения национализации первоклассных университетов и специальностей международного уровня, а также противоречия «эффекта перелива» между университетским управлением и межвузовским сотрудничеством. Исследование на основе применения корпусного подхода показало, что на протяжении последних 12 лет изучение интернационализации высшего образования и интернационализации управления высшим образованием осуществляется на фоне масштабного проекта «Один пояс – один путь» и экономической глобализации и включает в себя такие модули, как развитие университетов, университетское образование, академические исследования, стратегия школьного управления и т. д. С целью эффективного решения проблем, с которыми сталкивается управление интернационализацией высшего образования, авторы статьи предлагают воспользоваться преимуществами стабильного качества преподавания и задействовать региональные и местные ресурсы для создания многомерной платформы, взаимно связывающей таланты и пути их использования. Также при обобщении опыта необходимо учитывать исторический фон, чтобы данная платформа, задействующая государс, This research paper studies trends and hotspots of management internationalization in the sphere of higher education. The survey is based on CiteSpace visualization technology and on the corpus approach to studying keywords and annotations for 2010–2021 publications in 25 major higher education journals. Keywords analysis by CiteSpace showed that the hotspots of the management internationalization research are focused on postgraduate education management, on the projects «Double First Class University Plan», «Greater Bay Area», «Cooperation in Running Schools», etc. The future possible areas of investigation are the «local internationalization» of university management, the internationa lization of management in terms of international-level specialties and first-class universities’ nationalization, as well as the contradiction of the «spillover effect» between university management and cross-university cooperation. The corpus-based analysis showed that over the past 12 years the studies of internationalization of higher education and its mana gement have been carried out within the large-scale project «One Belt – One Road» and economic globalization. These studies include the modules of universities’ development, university education, academic research, school management strategy, etc. To effectively address the challenges faced by higher education internationalization management, the aut hors propose to take advantage of consistent teaching quality and to leverage regional and local resources, so as to create a multidimensional platform that would interconnect talents and ways to use them. Of no less importance, when summarizing such experience, is it to take into account the historical background, so that this platform, certainly engaging state policy, would allow a reform of higher education globalization for its further development.

A Bibliometric study is considered as one of the measuring tools identifying for the growth rate of publications, collaborative countries, and territories, preferred subject areas and research work, prolific organizations and institutions and top-ranked journals and highly productive papers, etc. This paper focuses on the literature growth and development in fossil fuels in India. Data were collected from Web of Science Core Collection, the search string was ‘‘Fossil fuels'' and refined by Countries/Territories ‘'India'' and the time span between 1989 and 2016 which were indexed SCI-Expanded, A & HCI. A total number of research output was 943 and its h-index was 73 and average citations per item was 28.63, a total sum of times cited was 26,997, citing articles was 21,694, without self-citations was 21,324 scores.

En este vídeo se explica el uso de palabras clave y distintos tipos de dato para la programación con Python. Se trata de datos muy útiles para comprobar condiciones y para plantear estructuras de código condicional. En el vídeo se ejecutan ejemplos en el entorno de programación de Anaconda utilizando el IDE de Spyder. Los ejemplos explicados tratan de aclarar cualquier duda que pueda surgir al enfrentarse a estas acciones, especialmente con los comentarios añadidos durante la ejecución.

En este vídeo se explica el uso de palabras clave y distintos tipos de dato para la programación con Python. Se trata de datos muy útiles para comprobar condiciones y para plantear estructuras de código condicional. En el vídeo se ejecutan ejemplos en el entorno de programación de Anaconda utilizando el IDE de Spyder. Los ejemplos explicados tratan de aclarar cualquier duda que pueda surgir al enfrentarse a estas acciones, especialmente con los comentarios añadidos durante la ejecución.

En este vídeo se explica el uso de palabras clave y distintos tipos de dato para la programación con Python. Se trata de datos muy útiles para comprobar condiciones y para plantear estructuras de código condicional. En el vídeo se ejecutan ejemplos en el entorno de programación de Anaconda utilizando el IDE de Spyder. Los ejemplos explicados tratan de aclarar cualquier duda que pueda surgir al enfrentarse a estas acciones, especialmente con los comentarios añadidos durante la ejecución.

The present study focuses on information search and retrieval of the bibliographical data related to the key terms that fall in the subject chemistry. The search techniques include simple keywords, phrase terms and Boolean operator “AND”. Further, study encompasses the Lancaster’s 2 x 2 Table matrix to trace the recall (R) and precision (P) ratio for the obtained records that are retrieved from the bibliographic database using the same search techniques. To fulfil the aims of the present study, a bibliographic database which contains the doctoral theses belonging to various subjects submitted to Annamalai University has been vouched. The database consists of 1641 records and was built using Unesco’s Java CDS/ISIS (Jean-Claude Dauphin, 2016). The queries used in this study are acid, correlation, kinetics, oxidation, kinetics of oxidation, (acid AND chemistry), (kinetics AND oxidation), and (kinetics AND oxidation AND correlation).

Under 2000-talet har det producerats och spridits mängder av betydande forskning som publicerats via databaser. En betydelsefull länk i kunskapsspridningen utgörs av akademin som i dag står för den största andelen av vetenskapliga publikationer. I denna historiografiskt inriktade undersökning kartläggs och undersöks en del av svensk historieforskning och historieskrivning som ägt rum under 2000-talet. Den vetenskapliga disciplin som undersöks inom det humanistiska fältet är historievetenskapen, avgränsat till de resultat av forskning som studenter gjort runtom på de svenska universiteten och högskolorna, i ämnet historia. Källmaterialet består av studentuppsatser som publicerats i databasen Digitala vetenskapliga arkivet, DiVA vilket i dag ses som det nationellt mest använda systemet för publikationsdata, med över 400 tusen publicerade fulltexter varav antal nedladdade uppgår över 53 miljoner gånger. Genom empiriska och teoretiska studier och bruket av både kvantitativa och kvalitativa metoder analyseras metadata, för att ge svar och resultat över frågan om vad studenter i det svenska utbildningssystemet, på universitet och högskolor skriver historia om under 2000-talet. För att få fram svar fungerade bibliometri som kunskapsområde och frågan om vilka nyckelord som dominerar och var de mest frekvent använda i taggningen (definitionerna) av forskningsresultaten ställdes. Delfrågan om hur bruket av nyckelord ser ut över tid användes för att få fram och se trend över resultat. Teoretiskt ramverk i undersökningen och läsning av de kvantitativa resultaten utgick från Kuhns teori om paradigm. Resultat visar att Genus, Historiebruk, Arkeologi, Historiemedvetande, Historiedidaktik, Identitet, Osteologi, Andra världskriget, Diskursanalys, Kalla kriget, Samer, Laborativ arkeologi och Utbildningshistoria utgör några ledande sakområden som studenterna skrivit historia om under 2000-talet. Resultat visar också att det nationella paradigmet är ledande för studenternas historiefor, During the 2000s, numerous significant researches have been produced and disseminated through databases. An important link in the dissemination of knowledge consists of the academy, which today accounts for the largest proportion of scientific publications. In this historiographically oriented study, a part of Swedish history research and history writing that took place during the 2000s is mapped and examined. The scientific discipline that is investigated in the humanities field is the science of history, limited to the results of research that students have done around the Swedish universities and colleges, in the subject of history. The source material consists of student essays published in the database Digital Scientific Archive, DiVA, which today is seen as the nationally most used system for publication data, with over 400 thousand published full texts, of which the number downloaded is over 53 million times. Through empirical and theoretical studies and the use of both quantitative and qualitative methods, metadata is analyzed, to provide answers and results on the question of what students in the Swedish education system, at universities and colleges write history about during the 2000s. To obtain answers, bibliometrics functioned as an area of ​​knowledge and the question of which keywords dominated and were the most frequently used in the tagging (definitions) of the research results was asked. The sub-question about how the use of keywords looks over time was used to bring out and see the trend over results. Theoretical framework in the study and reading of the quantitative results was based on Kuhn's theory of paradigm. Results indicate that Gender, History Use, Archeology, History Consciousness, History Didactics, Identity, Osteology, World War II, Discourse Analysis, the Cold War, Sami, Laboratory Archeology and Educational History are some leading subject areas that students wrote history about during the 2000s. Results also point out that the nati

Under 2000-talet har det producerats och spridits mängder av betydande forskning som publicerats via databaser. En betydelsefull länk i kunskapsspridningen utgörs av akademin som i dag står för den största andelen av vetenskapliga publikationer. I denna historiografiskt inriktade undersökning kartläggs och undersöks en del av svensk historieforskning och historieskrivning som ägt rum under 2000-talet. Den vetenskapliga disciplin som undersöks inom det humanistiska fältet är historievetenskapen, avgränsat till de resultat av forskning som studenter gjort runtom på de svenska universiteten och högskolorna, i ämnet historia. Källmaterialet består av studentuppsatser som publicerats i databasen Digitala vetenskapliga arkivet, DiVA vilket i dag ses som det nationellt mest använda systemet för publikationsdata, med över 400 tusen publicerade fulltexter varav antal nedladdade uppgår över 53 miljoner gånger. Genom empiriska och teoretiska studier och bruket av både kvantitativa och kvalitativa metoder analyseras metadata, för att ge svar och resultat över frågan om vad studenter i det svenska utbildningssystemet, på universitet och högskolor skriver historia om under 2000-talet. För att få fram svar fungerade bibliometri som kunskapsområde och frågan om vilka nyckelord som dominerar och var de mest frekvent använda i taggningen (definitionerna) av forskningsresultaten ställdes. Delfrågan om hur bruket av nyckelord ser ut över tid användes för att få fram och se trend över resultat. Teoretiskt ramverk i undersökningen och läsning av de kvantitativa resultaten utgick från Kuhns teori om paradigm. Resultat visar att Genus, Historiebruk, Arkeologi, Historiemedvetande, Historiedidaktik, Identitet, Osteologi, Andra världskriget, Diskursanalys, Kalla kriget, Samer, Laborativ arkeologi och Utbildningshistoria utgör några ledande sakområden som studenterna skrivit historia om under 2000-talet. Resultat visar också att det nationella paradigmet är ledande för studenternas historiefor, During the 2000s, numerous significant researches have been produced and disseminated through databases. An important link in the dissemination of knowledge consists of the academy, which today accounts for the largest proportion of scientific publications. In this historiographically oriented study, a part of Swedish history research and history writing that took place during the 2000s is mapped and examined. The scientific discipline that is investigated in the humanities field is the science of history, limited to the results of research that students have done around the Swedish universities and colleges, in the subject of history. The source material consists of student essays published in the database Digital Scientific Archive, DiVA, which today is seen as the nationally most used system for publication data, with over 400 thousand published full texts, of which the number downloaded is over 53 million times. Through empirical and theoretical studies and the use of both quantitative and qualitative methods, metadata is analyzed, to provide answers and results on the question of what students in the Swedish education system, at universities and colleges write history about during the 2000s. To obtain answers, bibliometrics functioned as an area of ​​knowledge and the question of which keywords dominated and were the most frequently used in the tagging (definitions) of the research results was asked. The sub-question about how the use of keywords looks over time was used to bring out and see the trend over results. Theoretical framework in the study and reading of the quantitative results was based on Kuhn's theory of paradigm. Results indicate that Gender, History Use, Archeology, History Consciousness, History Didactics, Identity, Osteology, World War II, Discourse Analysis, the Cold War, Sami, Laboratory Archeology and Educational History are some leading subject areas that students wrote history about during the 2000s. Results also point out that the nati

Национальный менталитет выражается в языке, в частности, через ключевые слова, одно из которых надежда. Данные толковых словарей русского и китайского языков позволяют представить лексикографическое описание лексемы надежда, сравнить их значения в разных языках. Проведенный психолингвистический эксперимент среди русских и китайских респондентов позволил выявить лексические значения, существующие в реальном употреблении. Если для русских респондентов надежда – это ожидание, мечта и женское имя, то для китайских респондентов надежда – это успех, мотивация., National mentality is expressed in language, in particular, through keywords, one of which is hope. The data of the explanatory dictionaries of the Russian and Chinese languages allow us to present a lexicographical description of the lexeme hope, to compare their meanings in different languages. A psycholinguistic experiment conducted among Russian and Chinese respondents revealed lexical meanings that exist in actual use. If for Russian respondents hope is an expectation, a dream and a female name, then for Chinese respondents hope is a success, motivation.

[ES] Con el objetivo de analizar las posibles diferencias entre los distintas áreas geográficas dentro de Estados Unidos en cuanto a tendencias de búsqueda web sobre vino español, el presente trabajo se propone diseñar un sistema de información que permita extraer de manera automática datos de búsquedas para su posterior análisis. Para ello el trabajo parte de la obtención de un vocabulario de palabras clave en español relacionadas con el sector del vino (n= 300). Para cada término se extrae el Search Interest desde Google Trends geolocalizando la búsqueda para los 50 Estados de Estados Unidos, más el Distrito de Columbia. Los resultados muestran cómo el interés sobre estas palabras clave se localiza en los Estados con mayor población, que se encuentran en las Costas Este y Oeste, así como en algunos estados centrales (por ejemplo, Tejas). Dentro del vocabulario de palabras clave empleado, se detecta asimismo unos valores de interés más elevado en aquellos términos que hacen mención a los tipos de vino en general, y los vinos españoles en particular., [EN] With the aim of analysing the possible differences between the different geographical areas within the United States in terms of web search trends about Spanish wine, this work aims to design an information system that automatically extracts data from web searches for later analysis. For this, the work is based on obtaining a vocabulary of keywords in Spanish related to the wine sector (n = 300). For each term, Search Interest is extracted from Google Trends by geolocating the search for the 50 States of the United States, and the District of Columbia. The results show how the trends about this keywords are located in the states that have the most population in the country, being in the East and West Coast as well as a few central states like Texas. Obtaining a high interest in keyword related with wine types and in the case of spanish wine this high interest is in the áreas previously mentioned. In this vocabulary of keywords its detected that some interest values are higher in the terms that mention types of wines in general and spanish wine in particular.

[ES] Con el objetivo de analizar las posibles diferencias entre los distintas áreas geográficas dentro de Estados Unidos en cuanto a tendencias de búsqueda web sobre vino español, el presente trabajo se propone diseñar un sistema de información que permita extraer de manera automática datos de búsquedas para su posterior análisis. Para ello el trabajo parte de la obtención de un vocabulario de palabras clave en español relacionadas con el sector del vino (n= 300). Para cada término se extrae el Search Interest desde Google Trends geolocalizando la búsqueda para los 50 Estados de Estados Unidos, más el Distrito de Columbia. Los resultados muestran cómo el interés sobre estas palabras clave se localiza en los Estados con mayor población, que se encuentran en las Costas Este y Oeste, así como en algunos estados centrales (por ejemplo, Tejas). Dentro del vocabulario de palabras clave empleado, se detecta asimismo unos valores de interés más elevado en aquellos términos que hacen mención a los tipos de vino en general, y los vinos españoles en particular., [EN] With the aim of analysing the possible differences between the different geographical areas within the United States in terms of web search trends about Spanish wine, this work aims to design an information system that automatically extracts data from web searches for later analysis. For this, the work is based on obtaining a vocabulary of keywords in Spanish related to the wine sector (n = 300). For each term, Search Interest is extracted from Google Trends by geolocating the search for the 50 States of the United States, and the District of Columbia. The results show how the trends about this keywords are located in the states that have the most population in the country, being in the East and West Coast as well as a few central states like Texas. Obtaining a high interest in keyword related with wine types and in the case of spanish wine this high interest is in the áreas previously mentioned. In this vocabulary of keywords its detected that some interest values are higher in the terms that mention types of wines in general and spanish wine in particular.

Our institute has developed a broad program of school mediation that includes: various didactic departments, orientation department, the cloister approval, integration of their activities into the different center programs, specially all about tutorial action, creation of their own and specific activities and permanent training routes for teachers and students. We focus our program in mediation, as it is the main key to prevent bullying, facing the conflicts at its initial phases. Students are the active and benefited agents of the mediation., Nuestro instituto ha desarrollado un programa amplio de mediación escolar que incluye a diversos departamentos didácticos, departamento de orientación, cuenta con la aprobación del claustro, inserta sus actividades en los distintos programas del centro, sobre todo el de acción tutorial, crea sus propias actividades y tiene vías de formación permanentes para profesores y alumnos. La mediación es una de las claves para la prevención del acoso, y como tal enfocamos nuestro programa, atacando los conflictos en sus fases iniciales. Los alumnos son los agentes y los beneficiados de la mediación.

Aquest Treball Final de Grau implementa una eina per monitoritzar els comentaris i mencions que es fan sobre les fotografies que publiquem en la compte d'Instagram. Durant el procés de monitorització s'obtenen diverses dades i metadades associades als recursos monitoritzats (comentaris i mencions). Per tal d'obtindre major suport i fiabilitat, hem fet ús de l'API oficial d'Instagram (Facebook), la Graph API. Aquesta API està en constant evolució i va incorporant noves funcionalitats. L'arquitectura del sistema implementat permetrà que aquestes es puguin incorporar de manera fàcil, així com poder modificar les dades i metadades que s'obtenen durant el procés de monitorització. Així doncs, el nostre sistema és fàcil de mantenir i ampliar., Monitoring consists on continuously checking the status of a system due to ensure the reliability, security or, simply, giving information to the user. This is a process that requires many resources, both software and hardware. Depending on the information received by the system user, the user may decide one or another course of action. Assuming the fact of monitoring various social networks, how could an efficient software architecture be used and allow these social networks monitoring? Based on this premise, this TFG tries to give a response to this fact.

Реализация ФГОС НОО потребовала системных изменений в образовательной среде гимназии на уровне начального общего образования. Изменения коснулись всех компонентов среды: от цели до результатов образования. В статье рассматриваются новые формы организации образовательного процесса. Авторы рассказывают об организации образовательных событий деятельностной направленности, на которых учащиеся начальной школы решают разные проектные задачи – предметные, межпредметные, надпредметные, разновозрастные. Подчеркивается их роль в обеспечении метапредметных образовательных результатов, к примеру, контрольно-оценочной самостоятельности младших школьников как составляющей «умения учиться»., Annotation. The implementation of the educational standards have called for systemic changes in the educational environment of the gymnasium at the primary level of General education. The changes affected all components of the environment: from the goal to the results of education. The article considers new forms of educational process organization. The authors tell about the organization of educational events of activity orientation, in which primary school students solve different project tasks - subject, interdisciplinary, over-subject, of different ages ones. Their role in providing metasubject educational results is emphasized, for example, the control –and- assessment independence of younger schoolboys is becoming a component of "ability to study".

Реализация ФГОС НОО потребовала системных изменений в образовательной среде гимназии на уровне начального общего образования. Изменения коснулись всех компонентов среды: от цели до результатов образования. В статье рассматриваются новые формы организации образовательного процесса. Авторы рассказывают об организации образовательных событий деятельностной направленности, на которых учащиеся начальной школы решают разные проектные задачи – предметные, межпредметные, надпредметные, разновозрастные. Подчеркивается их роль в обеспечении метапредметных образовательных результатов, к примеру, контрольно-оценочной самостоятельности младших школьников как составляющей «умения учиться»., Annotation. The implementation of the educational standards have called for systemic changes in the educational environment of the gymnasium at the primary level of General education. The changes affected all components of the environment: from the goal to the results of education. The article considers new forms of educational process organization. The authors tell about the organization of educational events of activity orientation, in which primary school students solve different project tasks - subject, interdisciplinary, over-subject, of different ages ones. Their role in providing metasubject educational results is emphasized, for example, the control –and- assessment independence of younger schoolboys is becoming a component of "ability to study".

There is a growing number of electronic smart devices, a decentralized peer-to- peer file storage system can innovate the way we detach from centralized file storage. The objective of developing a completely decentralized peer-to-peer net- work is the significant performance, scalability, cost, and reliability advantages over centralized single site systems. In this paper, we propose a completely decentralized peer-to-peer network model that utilizes state of the art set membership data structures to achieve a bandwidth efficient multi-keyword search. A multi- keyword search allows users to quickly find desired files without directly addressing the files. The network model extends consistent hashing to replicate files quickly across the network allowing for a swift bandwidth efficient multi-keyword search. Our file system is called the Peer-to-Peer Bandwidth Efficient Keyword Search File Storage System (BEKSFSS).This peer-to-peer distributed file system combines a Distributed Hash table with cuckoo filters optimized for high throughput, low latency, and accurate search results. We propose an improvement on an existing P2P file system that utilizesconsistent hashing to replicate files quickly across the network allowing economical multi-keyword searches. Files within the system are replicated across the large P2P network which allows for high availability without bottlenecks of centralized data storage. This infrastructure considers data reliability, availability, and storage overhead through highly distributed file storage.

Реализация ФГОС НОО потребовала системных изменений в образовательной среде гимназии на уровне начального общего образования. Изменения коснулись всех компонентов среды: от цели до результатов образования. В статье рассматриваются новые формы организации образовательного процесса. Авторы рассказывают об организации образовательных событий деятельностной направленности, на которых учащиеся начальной школы решают разные проектные задачи – предметные, межпредметные, надпредметные, разновозрастные. Подчеркивается их роль в обеспечении метапредметных образовательных результатов, к примеру, контрольно-оценочной самостоятельности младших школьников как составляющей «умения учиться»., Annotation. The implementation of the educational standards have called for systemic changes in the educational environment of the gymnasium at the primary level of General education. The changes affected all components of the environment: from the goal to the results of education. The article considers new forms of educational process organization. The authors tell about the organization of educational events of activity orientation, in which primary school students solve different project tasks - subject, interdisciplinary, over-subject, of different ages ones. Their role in providing metasubject educational results is emphasized, for example, the control –and- assessment independence of younger schoolboys is becoming a component of "ability to study".

There is a growing number of electronic smart devices, a decentralized peer-to- peer file storage system can innovate the way we detach from centralized file storage. The objective of developing a completely decentralized peer-to-peer net- work is the significant performance, scalability, cost, and reliability advantages over centralized single site systems. In this paper, we propose a completely decentralized peer-to-peer network model that utilizes state of the art set membership data structures to achieve a bandwidth efficient multi-keyword search. A multi- keyword search allows users to quickly find desired files without directly addressing the files. The network model extends consistent hashing to replicate files quickly across the network allowing for a swift bandwidth efficient multi-keyword search. Our file system is called the Peer-to-Peer Bandwidth Efficient Keyword Search File Storage System (BEKSFSS).This peer-to-peer distributed file system combines a Distributed Hash table with cuckoo filters optimized for high throughput, low latency, and accurate search results. We propose an improvement on an existing P2P file system that utilizesconsistent hashing to replicate files quickly across the network allowing economical multi-keyword searches. Files within the system are replicated across the large P2P network which allows for high availability without bottlenecks of centralized data storage. This infrastructure considers data reliability, availability, and storage overhead through highly distributed file storage.

[ES] Dada la importancia de una correcta estrategia SEO para conseguir visibilidad en el mundo de Internet, el primer paso en cualquier estrategia de posicionamiento será la búsqueda de las mejores palabras claves o Keyword Research para un negocio o sitio web Puesto que el Keyword Discovery es la base de esta estrategia, se deberán escoger correctamente las herramientas empleadas en dicha tarea. Y de este caso surge nuestro objeto de estudio. Este trabajo ha sido creado con el objetivo de conseguir, dar forma o elaborar un comparador o tabla comparativa de las herramientas destinadas al Keyword Discovery más populares entre los profesionales del SEO. Así pues, se ha procedido al estudio, análisis y descripción por separado de cada una de ellas, con el objetivo de aunar, reunir, y plasmar sus principales características y funcionalidades en una misma tabla, en la que poder consultar con posterioridad cualquier aspecto relevante de cada herramienta, así como buscar y decidir qué herramienta será más adecuada para según qué casos, [EN] Due to the large importance of a correct SEO-strategy for an enterprise or a web site to gain visibility on the Internet, the first step in every positioning strategy is to determine the most suitable key words, a process known as Keyword Research. As Keyword Research is the foundation of this strategy, the most accurate tools should be used. This is the case this study wants to explore by analyzing and ultimately creating a comparative table of the most popular tools of Keyword Discovery among the SEOprofessionals. All in all, each of the mechanisms included in this study is explained separately in order to examine their features and functions on a case-by-case basis. Nevertheless, all of them are finally summarized in a table to ease the comparison between them to facilitate further possible usage of any of them depending on each particular context

[ES] Dada la importancia de una correcta estrategia SEO para conseguir visibilidad en el mundo de Internet, el primer paso en cualquier estrategia de posicionamiento será la búsqueda de las mejores palabras claves o Keyword Research para un negocio o sitio web Puesto que el Keyword Discovery es la base de esta estrategia, se deberán escoger correctamente las herramientas empleadas en dicha tarea. Y de este caso surge nuestro objeto de estudio. Este trabajo ha sido creado con el objetivo de conseguir, dar forma o elaborar un comparador o tabla comparativa de las herramientas destinadas al Keyword Discovery más populares entre los profesionales del SEO. Así pues, se ha procedido al estudio, análisis y descripción por separado de cada una de ellas, con el objetivo de aunar, reunir, y plasmar sus principales características y funcionalidades en una misma tabla, en la que poder consultar con posterioridad cualquier aspecto relevante de cada herramienta, así como buscar y decidir qué herramienta será más adecuada para según qué casos, [EN] Due to the large importance of a correct SEO-strategy for an enterprise or a web site to gain visibility on the Internet, the first step in every positioning strategy is to determine the most suitable key words, a process known as Keyword Research. As Keyword Research is the foundation of this strategy, the most accurate tools should be used. This is the case this study wants to explore by analyzing and ultimately creating a comparative table of the most popular tools of Keyword Discovery among the SEOprofessionals. All in all, each of the mechanisms included in this study is explained separately in order to examine their features and functions on a case-by-case basis. Nevertheless, all of them are finally summarized in a table to ease the comparison between them to facilitate further possible usage of any of them depending on each particular context

[ES] Dada la importancia de una correcta estrategia SEO para conseguir visibilidad en el mundo de Internet, el primer paso en cualquier estrategia de posicionamiento será la búsqueda de las mejores palabras claves o Keyword Research para un negocio o sitio web Puesto que el Keyword Discovery es la base de esta estrategia, se deberán escoger correctamente las herramientas empleadas en dicha tarea. Y de este caso surge nuestro objeto de estudio. Este trabajo ha sido creado con el objetivo de conseguir, dar forma o elaborar un comparador o tabla comparativa de las herramientas destinadas al Keyword Discovery más populares entre los profesionales del SEO. Así pues, se ha procedido al estudio, análisis y descripción por separado de cada una de ellas, con el objetivo de aunar, reunir, y plasmar sus principales características y funcionalidades en una misma tabla, en la que poder consultar con posterioridad cualquier aspecto relevante de cada herramienta, así como buscar y decidir qué herramienta será más adecuada para según qué casos, [EN] Due to the large importance of a correct SEO-strategy for an enterprise or a web site to gain visibility on the Internet, the first step in every positioning strategy is to determine the most suitable key words, a process known as Keyword Research. As Keyword Research is the foundation of this strategy, the most accurate tools should be used. This is the case this study wants to explore by analyzing and ultimately creating a comparative table of the most popular tools of Keyword Discovery among the SEOprofessionals. All in all, each of the mechanisms included in this study is explained separately in order to examine their features and functions on a case-by-case basis. Nevertheless, all of them are finally summarized in a table to ease the comparison between them to facilitate further possible usage of any of them depending on each particular context

Keyword merupakan kata kunci yang digunakan untuk mempermudah dalam pencarian sumber bahan pustaka. Proses pencarian melalui keyword untuk menemukan judul buku atau bahan pustaka telah menjadi kebutuhan pokok dalam suatu sistem. Namun terkadang saat pengetikan keyword, masih banyak terjadi kesalahan penulisan atau typo. Tujuan dari penelitian ini adalah membuat suatu aplikasi dalam bentuk prototype yang memberikan koreksi atau Suggestion word pada keyword sebuah bahan pustaka.Metode Jaro-winkler merupakan metode string matching yang berguna untuk mencocokan dua buah string, dengan masing-masing rumus algoritma dan juga proses yang berbeda. Pengambilan data dilakukan dengan cara mengambil data buku dari perpustakaan kemudian digunakan sebagai sample dalam proses pencarian keyword. Hasil dari penelitian ini adalah sistem yang mampu memberikan koreksi dan Suggestion word jika dalam pencarian data buku terjadi kesalahan pengetikan. Diharapkan dengan dibangunnya sistem ini dapat mempermudah pengguna perpustakaan dalam mencari buku.

The abundance and ubiquity of graphs (e.g., online social networks such as Google+" style="position: relative;" tabindex="0" id="MathJax-Element-1-Frame" class="MathJax">+ and Facebook; bibliographic graphs such as DBLP) necessitates the effective and efficient search over them. Given a set of keywords that can identify a data subject (DS), a recently proposed keyword search paradigm produces a set of object summaries (OSs) as results. An OS is a tree structure rooted at the DS node (i.e., a node containing the keywords) with surrounding nodes that summarize all data held on the graph about the DS. OS snippets, denoted as size-l OSs, have also been investigated. A size-l OS is a partial OS containing l nodes such that the summation of their importance scores results in the maximum possible total score. However, the set of nodes that maximize the total importance score may result in an uninformative size-l OSs, as very important nodes may be repeated in it, dominating other representative information. In view of this limitation, in this paper, we investigate the effective and efficient generation of two novel types of OS snippets, i.e., diverse and proportional size-l OSs, denoted as DSize-l and PSize-l OSs. Namely, besides the importance of each node, we also consider its pairwise relevance (similarity) to the other nodes in the OS and the snippet. We conduct an extensive evaluation on two real graphs (DBLP and Google+" style="position: relative;" tabindex="0" id="MathJax-Element-2-Frame" class="MathJax">+). We verify effectiveness by collecting user feedback, e.g., by asking DBLP authors (i.e., the DSs themselves) to evaluate our results. In addition, we verify the efficiency of our algorithms and evaluate the quality of the snippets that they produce.

Attribute-based keyword search (ABKS) was proposed to enable a third party to search encrypted keywords without compromising the security of the original data. Because it can express flexible access policy, ABKS has attracted a lot of attention. Existing ABKS schemes mainly focused on the expression of access structures, while the computation cost and communication cost are linear with the number of required attributes. Therefore, existing ABKS schemes are unsuitable to the devices that have constrained space and computing power, such as smart phone and tablet.

Many users store their data in a cloud, which might not be fully trusted, for the purpose of convenient data access and sharing. For efficiently accessing the stored data, keyword search can be performed by the cloud server remotely with a single query from the user. However, the cloud server cannot directly search the data if it is encrypted. One of solutions could be to allow the user to download the encrypted data, in order to carry out a search; however, it might consume huge network bandwidth. To solve this problem, the notion of keyword search on encrypted data (searchable encryption) has been proposed. In this paper, a special variant of searchable encryption with threshold access is studied. Unlike some previous proposals which have fixed group and fixed threshold value, we define a new notion named Threshold Broadcast Encryption with Keyword Search (TBEKS) for dynamic groups and flexible threshold values. We formalize the security of a TBEKS scheme via a new security model named IND-T-CKA which captures indistinguishability against chosen keyword attacks in the threshold setting. We also propose the first practical TBEKS scheme with provable security in our IND-T-CKA security model, assuming the hardness of the Decisional Bilinear Diffie-Hellman problem.

Nowadays an increasing amount of data stored in the public cloud need to be searched remotely for fast accessing. For the sake of privacy, the remote files are usually encrypted, which makes them difficult to be searched by remote servers. It is also harder to efficiently share encrypted data in the cloud than those in plaintext. In this paper, we develop a searchable encryption framework called Linear Encryption with Keyword Search (LEKS) that can semi-generically convert some existing encryption schemes meeting our Linear Encryption Template (LET) to be searchable without re-encrypting all the data. For allowing easy data sharing, we convert a Key-Policy Attributed-Based Encryption (KP-ABE) scheme to a Key-Policy Attributed-Based Keyword Search (KP-ABKS) scheme as a concrete instance of our LEKS framework, making both the encrypted data and the search functionality under fine-grained access control. Notably, the resulting KP-ABKS is the first proven secure ABKS scheme with IND-sCKA security in the random oracle model, assuming the hardness of the ℓ-DCBDH problem derived from the (P, f)-DBDH problem family.

Attribute-based keyword search (ABKS) was proposed to enable a third party to search encrypted keywords without compromising the security of the original data. Because it can express flexible access policy, ABKS has attracted a lot of attention. Existing ABKS schemes mainly focused on the expression of access structures, while the computation cost and communication cost are linear with the number of required attributes. Therefore, existing ABKS schemes are unsuitable to the devices that have constrained space and computing power, such as smart phone and tablet.

Many users store their data in a cloud, which might not be fully trusted, for the purpose of convenient data access and sharing. For efficiently accessing the stored data, keyword search can be performed by the cloud server remotely with a single query from the user. However, the cloud server cannot directly search the data if it is encrypted. One of solutions could be to allow the user to download the encrypted data, in order to carry out a search; however, it might consume huge network bandwidth. To solve this problem, the notion of keyword search on encrypted data (searchable encryption) has been proposed. In this paper, a special variant of searchable encryption with threshold access is studied. Unlike some previous proposals which have fixed group and fixed threshold value, we define a new notion named Threshold Broadcast Encryption with Keyword Search (TBEKS) for dynamic groups and flexible threshold values. We formalize the security of a TBEKS scheme via a new security model named IND-T-CKA which captures indistinguishability against chosen keyword attacks in the threshold setting. We also propose the first practical TBEKS scheme with provable security in our IND-T-CKA security model, assuming the hardness of the Decisional Bilinear Diffie-Hellman problem.

Nowadays an increasing amount of data stored in the public cloud need to be searched remotely for fast accessing. For the sake of privacy, the remote files are usually encrypted, which makes them difficult to be searched by remote servers. It is also harder to efficiently share encrypted data in the cloud than those in plaintext. In this paper, we develop a searchable encryption framework called Linear Encryption with Keyword Search (LEKS) that can semi-generically convert some existing encryption schemes meeting our Linear Encryption Template (LET) to be searchable without re-encrypting all the data. For allowing easy data sharing, we convert a Key-Policy Attributed-Based Encryption (KP-ABE) scheme to a Key-Policy Attributed-Based Keyword Search (KP-ABKS) scheme as a concrete instance of our LEKS framework, making both the encrypted data and the search functionality under fine-grained access control. Notably, the resulting KP-ABKS is the first proven secure ABKS scheme with IND-sCKA security in the random oracle model, assuming the hardness of the ℓ-DCBDH problem derived from the (P, f)-DBDH problem family.

Attribute-based keyword search (ABKS) was proposed to enable a third party to search encrypted keywords without compromising the security of the original data. Because it can express flexible access policy, ABKS has attracted a lot of attention. Existing ABKS schemes mainly focused on the expression of access structures, while the computation cost and communication cost are linear with the number of required attributes. Therefore, existing ABKS schemes are unsuitable to the devices that have constrained space and computing power, such as smart phone and tablet.

Many users store their data in a cloud, which might not be fully trusted, for the purpose of convenient data access and sharing. For efficiently accessing the stored data, keyword search can be performed by the cloud server remotely with a single query from the user. However, the cloud server cannot directly search the data if it is encrypted. One of solutions could be to allow the user to download the encrypted data, in order to carry out a search; however, it might consume huge network bandwidth. To solve this problem, the notion of keyword search on encrypted data (searchable encryption) has been proposed. In this paper, a special variant of searchable encryption with threshold access is studied. Unlike some previous proposals which have fixed group and fixed threshold value, we define a new notion named Threshold Broadcast Encryption with Keyword Search (TBEKS) for dynamic groups and flexible threshold values. We formalize the security of a TBEKS scheme via a new security model named IND-T-CKA which captures indistinguishability against chosen keyword attacks in the threshold setting. We also propose the first practical TBEKS scheme with provable security in our IND-T-CKA security model, assuming the hardness of the Decisional Bilinear Diffie-Hellman problem.

Nowadays an increasing amount of data stored in the public cloud need to be searched remotely for fast accessing. For the sake of privacy, the remote files are usually encrypted, which makes them difficult to be searched by remote servers. It is also harder to efficiently share encrypted data in the cloud than those in plaintext. In this paper, we develop a searchable encryption framework called Linear Encryption with Keyword Search (LEKS) that can semi-generically convert some existing encryption schemes meeting our Linear Encryption Template (LET) to be searchable without re-encrypting all the data. For allowing easy data sharing, we convert a Key-Policy Attributed-Based Encryption (KP-ABE) scheme to a Key-Policy Attributed-Based Keyword Search (KP-ABKS) scheme as a concrete instance of our LEKS framework, making both the encrypted data and the search functionality under fine-grained access control. Notably, the resulting KP-ABKS is the first proven secure ABKS scheme with IND-sCKA security in the random oracle model, assuming the hardness of the ℓ-DCBDH problem derived from the (P, f)-DBDH problem family.

Attribute-based keyword search (ABKS) was proposed to enable a third party to search encrypted keywords without compromising the security of the original data. Because it can express flexible access policy, ABKS has attracted a lot of attention. Existing ABKS schemes mainly focused on the expression of access structures, while the computation cost and communication cost are linear with the number of required attributes. Therefore, existing ABKS schemes are unsuitable to the devices that have constrained space and computing power, such as smart phone and tablet.

Nowadays an increasing amount of data stored in the public cloud need to be searched remotely for fast accessing. For the sake of privacy, the remote files are usually encrypted, which makes them difficult to be searched by remote servers. It is also harder to efficiently share encrypted data in the cloud than those in plaintext. In this paper, we develop a searchable encryption framework called Linear Encryption with Keyword Search (LEKS) that can semi-generically convert some existing encryption schemes meeting our Linear Encryption Template (LET) to be searchable without re-encrypting all the data. For allowing easy data sharing, we convert a Key-Policy Attributed-Based Encryption (KP-ABE) scheme to a Key-Policy Attributed-Based Keyword Search (KP-ABKS) scheme as a concrete instance of our LEKS framework, making both the encrypted data and the search functionality under fine-grained access control. Notably, the resulting KP-ABKS is the first proven secure ABKS scheme with IND-sCKA security in the random oracle model, assuming the hardness of the ℓ-DCBDH problem derived from the (P, f)-DBDH problem family.

Many users store their data in a cloud, which might not be fully trusted, for the purpose of convenient data access and sharing. For efficiently accessing the stored data, keyword search can be performed by the cloud server remotely with a single query from the user. However, the cloud server cannot directly search the data if it is encrypted. One of solutions could be to allow the user to download the encrypted data, in order to carry out a search; however, it might consume huge network bandwidth. To solve this problem, the notion of keyword search on encrypted data (searchable encryption) has been proposed. In this paper, a special variant of searchable encryption with threshold access is studied. Unlike some previous proposals which have fixed group and fixed threshold value, we define a new notion named Threshold Broadcast Encryption with Keyword Search (TBEKS) for dynamic groups and flexible threshold values. We formalize the security of a TBEKS scheme via a new security model named IND-T-CKA which captures indistinguishability against chosen keyword attacks in the threshold setting. We also propose the first practical TBEKS scheme with provable security in our IND-T-CKA security model, assuming the hardness of the Decisional Bilinear Diffie-Hellman problem.

Searchable encryption is of increasing interest for protecting the data privacy in secure searchable cloud storage. In this paper, we investigate the security of a well-known cryptographic primitive, namely, public key encryption with keyword search (PEKS) which is very useful in many applications of cloud storage. Unfortunately, it has been shown that the traditional PEKS framework suffers from an inherent insecurity called inside keyword guessing attack (KGA) launched by the malicious server. To address this security vulnerability, we propose a new PEKS framework named dual-server PEKS (DS-PEKS). As another main contribution, we define a new variant of the smooth projective hash functions (SPHFs) referred to as linear and homomorphic SPHF (LH-SPHF). We then show a generic construction of secure DS-PEKS from LH-SPHF. To illustrate the feasibility of our new framework, we provide an efficient instantiation of the general framework from a Decision Diffie-Hellman-based LH-SPHF and show that it can achieve the strong security against inside the KGA.

Public key encryption with keyword search (PEKS) provides an elegant mechanism for a user to identify the specific encrypted data. PEKS protects data against disclosure while making it searchable. In this paper, we propose a new cryptographic primitive called public key encryption with authorized keyword search (PEAKS). In PEAKS, keywords are encrypted with one public key and users without corresponding secret key need authorization from the authority to search keywords. We present a concrete PEAKS construction which allows the authority to authorize users to search different keyword sets. The proposed scheme features with the constant-size authorized token, independent of the size of keyword set size, which cuts down bandwidth consumption considerably. This property makes our PEAKS quite useful when the authorized token needs to be frequently updated with time for security purpose. The semantical security against chosen keyword attack and trapdoor unforgeability are formally proved.

Keyword merupakan kata kunci yang digunakan untuk mempermudah dalam pencarian sumber bahan pustaka. Proses pencarian melalui keyword untuk menemukan judul buku atau bahan pustaka telah menjadi kebutuhan pokok dalam suatu sistem. Namun terkadang saat pengetikan keyword, masih banyak terjadi kesalahan penulisan atau typo. Tujuan dari penelitian ini adalah membuat suatu aplikasi dalam bentuk prototype yang memberikan koreksi atau Suggestion word pada keyword sebuah bahan pustaka.Metode Jaro-winkler merupakan metode string matching yang berguna untuk mencocokan dua buah string, dengan masing-masing rumus algoritma dan juga proses yang berbeda. Pengambilan data dilakukan dengan cara mengambil data buku dari perpustakaan kemudian digunakan sebagai sample dalam proses pencarian keyword. Hasil dari penelitian ini adalah sistem yang mampu memberikan koreksi dan Suggestion word jika dalam pencarian data buku terjadi kesalahan pengetikan. Diharapkan dengan dibangunnya sistem ini dapat mempermudah pengguna perpustakaan dalam mencari buku.

In an e-Health scenario, we study how the practitioners are authorized when they are requesting access to medical documents containing sensitive information. Consider the following scenario. A clinician wants to access and retrieve a patient's Electronic Health Record (EHR), and this means that the clinician must acquire sufficient access right to access this document. As the EHR is within a collection of many other patients, the clinician would need to specify some requirements (such as a keyword) which match the patient's record, as well as having a valid access right. The complication begins when we do not want the server to learn anything from this query (as the server might be outsourced to other place). To encompass this situation, we define a new cryptographic primitive called Certificate-Based Encryption with Keyword Search (CBEKS), which will be suitable in this scenario. We also specify the corresponding security models, namely computational consistency, indistinguishability against chosen keyword and ciphertext attacks, indistinguishability against keyword-guessing attacks and collusion resistance. We provide a CBEKS construction that is proven secure in the standard model with respect to the aforementioned security models.

Abstrakt wystąpienia przygotowanego na konferencję "Nowoczesne systemy slawistycznej informacji bibliograficznej – dziś i jutro" (Warszawa, 8-9 października 2015 r.). Organizatorzy konferencji: Instytut Slawistyki PAN, Komisja Bibliograficzna przy Międzynarodowym Komitecie Slawistów.

Computers have become an integral part of our everyday existence. They are used to store and to send among students’ letters and sensitive documents, materials. In today's focused world, each Organization is endeavoring to enhance its proficiency and guarantee the nature of data asset. Computer networking technologies - intranet, web - have progressed to the point where data can be put away, transmitted, and available to people accessing the resource anytime and from anywhere. These advantages additionally push organizations into executing web based innovation without considering the security dangers that this involves.