A dynamic knowledge base based search engine

Search engines have greatly helped us to find thedesired information from the Intemet. Most search engines use keywords matching technique. This paper discusses a Dynamic Knowledge Base based Search Engine (DKBSE), which can expand the user's query using the keywords' concept or meaning. To do this, the DKBSE needs to construct and maintain the knowledge base dynamically via the system's searching results and the user's feedback information. The DKBSE expands the user's initial query using the knowledge base, and returns the searched information after the expanded query.

A Personalized Search Model Using Online Social Network Data Based on a Holonic Multiagent System

Personalized search utilizes user preferences to optimize search results,and most existing studies obtain user preferences by analyzing user behaviors in search engines that provide click-through data.However,the behavioral data are noisy because users often clicked some irrelevant documents to find their required information,and the new user cold start issue represents a serious problem,greatly reducing the performance of personalized search.This paper attempts to utilize online social network data to obtain user preferences that can be used to personalize search results,mine the knowledge of user interests,user influence and user relationships from online social networks,and use this knowledge to optimize the results returned by search engines.The proposed model is based on a holonic multiagent system that improves the adaptability and scalability of the model.The experimental results show that utilizing online social network data to implement personalized search is feasible and that online social network data are significant for personalized search.

Opportunities for Remote Collaboration in a Social Web Search Model That Integrates Parents and Children

Traditionally, search engines are designed to support a single user working alone. However, the construction of knowledge is enriched when one adds collaboration to search tasks. We identified opportunities for remote collaboration in a Social Web search model that integrates parents and children guided by 5W + 1H (who, what, where, when, why, how) dimensions. Our social search model aims at improving the search process for children. We found 7 opportunities for remote collaboration on the search process, based on implicit-explicit interactions.

Refining the structure and process of social search behavior: An activity theory perspective

As a way of searching information in the social context,social search has the characteristics of complexity and diversity,and it shows great differences from traditional Web search.In terms of the prior studies on social search behaviors.

Web search engine:characteristics of user behaviors and their implication

In this paper, first studied are the distribution characteristics of user behaviors based on log data from a massive web search engine. Analysis shows that stochastic distribution of user queries accords with the characteristics of power-law function and exhibits strong similarity, and the user' s queries and clicked URLs present dramatic locality, which implies that query cache and 'hot click' cache can be employed to improve system performance. Then three typical cache replacement policies are compared, including LRU, FIFO, and LFU with attenuation. In addition, the distribution character-istics of web information are also analyzed, which demonstrates that the link popularity and replica pop-ularity of a URL have positive influence on its importance. Finally, variance between the link popularity and user popularity, and variance between replica popularity and user popularity are analyzed, which give us some important insight that helps us improve the ranking algorithms in a search engine.

Intelligent Service Search Model Using Emerging Technologies

In recent years,the Internet of Things(IoT)has played a vital role in providing various services to users in a smart city.However,searching for services,objects,data,and frameworks remains a concern.The technological advancements in Cyber-Physical Systems(CPSs)and the Social Internet of Things(SIoT)open a new era of research.Thus,we propose a Cyber-Physical-Social Systems(CPSs)for service search.Herein,service search and object discovery operation carries with the suitable selection of friends in the network.Our proposed model constructs a graph and performs social network analysis(SNA).We suggest degree centrality,clustering,and scalefree emergence and show that a rational selection of friends per service exploration increases the overall network navigability.The efficiency of our proposed system is verified using real-world datasets based on service processing time,path length,giant component,and network diameter.The simulation results proved that our proposed system is efficient,robust,and scalable.

Search and Rescue Optimization with Machine Learning Enabled Cybersecurity Model

Presently,smart cities play a vital role to enhance the quality of living among human beings in several ways such as online shopping,e-learning,ehealthcare,etc.Despite the benefits of advanced technologies,issues are also existed from the transformation of the physical word into digital word,particularly in online social networks(OSN).Cyberbullying(CB)is a major problem in OSN which needs to be addressed by the use of automated natural language processing(NLP)and machine learning(ML)approaches.This article devises a novel search and rescue optimization with machine learning enabled cybersecurity model for online social networks,named SRO-MLCOSN model.The presented SRO-MLCOSN model focuses on the identification of CB that occurred in social networking sites.The SRO-MLCOSN model initially employs Glove technique for word embedding process.Besides,a multiclass-weighted kernel extreme learning machine(M-WKELM)model is utilized for effectual identification and categorization of CB.Finally,Search and Rescue Optimization(SRO)algorithm is exploited to fine tune the parameters involved in the M-WKELM model.The experimental validation of the SRO-MLCOSN model on the benchmark dataset reported significant outcomes over the other approaches with precision,recall,and F1-score of 96.24%,98.71%,and 97.46%respectively.

An Efficient Character-Level Adversarial Attack Inspired by Textual Variations in Online Social Media Platforms

In recent years,the growing popularity of social media platforms has led to several interesting natural language processing(NLP)applications.However,these social media-based NLP applications are subject to different types of adversarial attacks due to the vulnerabilities of machine learning(ML)and NLP techniques.This work presents a new low-level adversarial attack recipe inspired by textual variations in online social media communication.These variations are generated to convey the message using out-of-vocabulary words based on visual and phonetic similarities of characters and words in the shortest possible form.The intuition of the proposed scheme is to generate adversarial examples influenced by human cognition in text generation on social media platforms while preserving human robustness in text understanding with the fewest possible perturbations.The intentional textual variations introduced by users in online communication motivate us to replicate such trends in attacking text to see the effects of such widely used textual variations on the deep learning classifiers.In this work,the four most commonly used textual variations are chosen to generate adversarial examples.Moreover,this article introduced a word importance ranking-based beam search algorithm as a searching method for the best possible perturbation selection.The effectiveness of the proposed adversarial attacks has been demonstrated on four benchmark datasets in an extensive experimental setup.

基于ElasticSearch分布式搜索引擎的信息检索方法研究

随着信息量的骤增,传统关系型数据库很难做到实时高效地检索用户需要的信息,并且无法对信息进行分词及关键词组合的短文本搜索,从而很难优化信息检索结果的推荐展示。针对大量信息频繁检索的问题,采取一种基于ElasticSearch分布式搜索引擎,并采用分词器和倒排索引等技术,能较好地解决这些问题。同时在研究过程中利用代码实现了基础功能搜索、地理位置搜索以及通过算分排序推荐展示等功能。

CSRecommender: A Cloud Service Searching and Recommendation System

Cloud Computing and in particular cloud services have become widely used in both the technology and business industries. Despite this significant use, very little research or commercial solutions exist that focus on the discovery of cloud services. This paper introduces CSRecommender—a search engine and recommender system specifically designed for the discovery of these services. To engineer the system to scale, we also describe the implementation of a Cloud Service Identifier which enables the system to crawl the Internet without human involvement. Finally, we examine the effectiveness and usefulness of the system using real-world use cases and users.

因特网多元搜索引擎Search X2000的研究

介绍了Internet网络多元搜索引擎SearchX2 0 0 0的基本情况 ,研究了该搜索引擎的使用方法与技巧 ,同时客观地评价了它的优劣得失 。

中文元搜索工具MetaSearcher的实现

论文讨论当前搜索引擎在检全率、检准率等方面存在的问题,提出一种基于C/S模式的中文元搜索工具MetaSearcher来解决上述问题,重点介绍了该工具的关键技术和排序算法。接着对该元搜索工具进行性能评估,得出该元搜索工具在响应速度和排序客观性方面比一般搜索引擎具有一定优势的结论。论文同时指出了后续研究方向。

WWW上Meta-Search的研究与实现

1 引言 World Wide Web是目前全球最大的信息系统,在WWW上查询Web文档主要依赖于Internet上的索引信息系统,如Yahoo、Infoseek、AltaVista、WebCrawler、Excite、Lycos等等。由于WWW太大又没有良好的结构且Web服务器的自治性,所以Web文档的查询难以做到全面而精确。衡量Web文档查询的质量主要有两个方面:①是否能把所有相关的文档资源找出来,不要有所遗漏。

ED-SWE:Event detection based on scoring and word embedding in online social networks for the internet of people

Online social media networks are gaining attention worldwide,with an increasing number of people relying on them to connect,communicate and share their daily pertinent event-related information.Event detection is now increasingly leveraging online social networks for highlighting events happening around the world via the Internet of People.In this paper,a novel Event Detection model based on Scoring and Word Embedding(ED-SWE)is proposed for discovering key events from a large volume of data streams of tweets and for generating an event summary using keywords and top-k tweets.The proposed ED-SWE model can distill high-quality tweets,reduce the negative impact of the advent of spam,and identify latent events in the data streams automatically.Moreover,a word embedding algorithm is used to learn a real-valued vector representation for a predefined fixed-sized vocabulary from a corpus of Twitter data.In order to further improve the performance of the Expectation-Maximization(EM)iteration algorithm,a novel initialization method based on the authority values of the tweets is also proposed in this paper to detect live events efficiently and precisely.Finally,a novel automatic identification method based on the cosine measure is used to automatically evaluate whether a given topic can form a live event.Experiments conducted on a real-world dataset demonstrate that the ED-SWE model exhibits better efficiency and accuracy than several state-of-art event detection models.

Geo-Social Profile Matching Algorithm for Dynamic Interests in Ad-Hoc Social Network

Among mobile users, ad-hoc social network (ASN) is becoming a popular platform to connect and share their interests anytime anywhere. Many researchers and computer scientists investigated ASN architecture, implementation, user experience, and different profile matching algorithms to provide better user experience in ad-hoc social network. We emphasize that strength of an ad-hoc social network depends on a good profile-matching algorithm that provides meaningful friend suggestions in proximity. Keeping browsing history is a good way to determine user’s interest, however, interests change with location. This paper presents a novel profile-matching algorithm for automatically building a user profile based on dynamic GPS (Global Positing System) location and browsing history of users. Building user profile based on GPS location of a user provides benefits to ASN users as this profile represents user’s dynamic interests that keep changing with location e.g. office, home, or some other location. Proposed profile-matching algorithm maintains multiple local profiles based on location of mobile device.

SNS model for providing social network channels through queries

Users can obtain the information through a basic web searching and find the answer to the questions directly,but maybe the expected answer does not exist.Besides,we do not know the update of new information in time.The online social networking services spread quickly and store many user data,but these data are worth less and may be unreliable answer to users’ questions.Users can obtain the simple answer but can not expect more additional information in knowledge question-answering(QA)system.In this paper,we design the system with the advantages of knowledge QA system,web searching and characteristics of social networking service for providing social network channel based on the query and answer without users’ contact network.The user can obtain real-time answers by the user network interested in users’ querires through the network channel of this system,get the additional information effectively and share it with others in the social network channel in this system.

A Hybrid Heuristic Algorithm for Solving COVID-19’s Social Distancing at Universities Campus

Social distancing during COVID-19 has become one of the most important measures in reducing the risks of the spread of the virus. Implementing thesemeasures at universities is crucial and directly related to the physical attendance ofthe populations of students, professors, employees, and other members on campus. This research proposes an automated scheduling approach that can help universities and schools comply with the social distancing regulations by providingassistance in avoiding huge assemblages of people. Furthermore, this paper proposes a novel course timetable-scheduling scheme based on four main constraints.First, a distance of two meters must be maintained between each student inside theclassroom. Second, no classrooms should contain more than 20% of their regularcapacity. Third, there would be no back-to-back classes. Lastly, no lectures shouldbe held simultaneously in adjacent classrooms. The proposed approach wasimplemented using a variable neighborhood search (VNS) approach with an adaptive neighborhood structure (AD-NS) to resolve the problem of scheduling coursetimetables at Al-Ahlyyia Amman University. However, the experimental resultsshow that the proposed techniques outperformed the standard VNS tested on university course timetabling benchmark dataset ITC2007-Track3. Meanwhile, theapproach was tested using datasets collected from the faculty of information technology at Al-Ahlyyia Amman University (Jordan). Where the results showed that,the proposed technique could help educational institutes to resume their regularoperations while complying with the social distancing guidelines.