Database Search Behaviors: Insight from a Survey of Information Retrieval Practices

This study examines the database search behaviors of individuals, focusing on gender differences and the impact of planning habits on information retrieval. Data were collected from a survey of 198 respondents, categorized by their discipline, schooling background, internet usage, and information retrieval preferences. Key findings indicate that females are more likely to plan their searches in advance and prefer structured methods of information retrieval, such as using library portals and leading university websites. Males, however, tend to use web search engines and self-archiving methods more frequently. This analysis provides valuable insights for educational institutions and libraries to optimize their resources and services based on user behavior patterns.

Ensuring Information Security in Electronic Health Record System Using Cryptography and Cuckoo Search Algorithm

In the contemporary era,the abundant availability of health information through internet and mobile technology raises concerns.Safeguarding and maintaining the confidentiality of patients’medical data becomes paramount when sharing such information with authorized healthcare providers.Although electronic patient records and the internet have facilitated the exchange of medical information among healthcare providers,concerns persist regarding the security of the data.The security of Electronic Health Record Systems(EHRS)can be improved by employing the Cuckoo Search Algorithm(CS),the SHA-256 algorithm,and the Elliptic Curve Cryptography(ECC),as proposed in this study.The suggested approach involves usingCS to generate the ECCprivate key,thereby enhancing the security of data storage in EHR.The study evaluates the proposed design by comparing encoding and decoding times with alternative techniques like ECC-GA-SHA-256.The research findings indicate that the proposed design achieves faster encoding and decoding times,completing 125 and 175 iterations,respectively.Furthermore,the proposed design surpasses other encoding techniques by exhibiting encoding and decoding times that are more than 15.17%faster.These results imply that the proposed design can significantly enhance the security and performance of EHRs.Through the utilization of CS,SHA-256,and ECC,this study presents promising methods for addressing the security challenges associated with EHRs.

A Parallel String Searching Algorithm for Information Filtering

Playing an increasingly important role in the security protection of the network information systems,the intrusion detection system(IDS) becomes a hotspot of research interest nowadays.However,this technology in the kernel to many of these systems,namely string searching algorithm,has not received enough attention.By utilizing the concurrent mechanisms(multi-threading) provided by modern operation systems,such work can be divided symmetrically and thus improve the throughput of the corresponding application effectively.Presented in this work is a paralleled string searching algorithm-PBM,an algorithm based on the famous Boyer-Moore(BM) string searching algorithm.Taken as a dividable process,the string searching work is distributed between many cooperating threads of execution in the PBM algorithm,while each of them searches the target pattern in their respective share of the target strings.As compared with the traditional string searching algorithms,the PBM algorithm can do the pattern matching work faster by increasing the data processing throughput,thus adapting better to the drastic increase in the network band width.A simplification of the PBM algorithm that can be used as a multi-string searching algorithm is also suggested with supporting simulations,which is a promising approach when the number of target patterns is limited.

Novel cued search strategy based on information gain for phased array radar

A search strategy based on the maximal information gain principle is presented for the cued search of phased array radars. First, the method for the determination of the cued search region, arrangement of beam positions, and the calculation of the prior probability distribution of each beam position is discussed. And then, two search algorithms based on information gain are proposed using Shannon entropy and Kullback-Leibler entropy, respectively. With the proposed strategy, the information gain of each beam position is predicted before the radar detection, and the observation is made in the beam position with the maximal information gain. Compared with the conventional method of sequential search and confirm search, simulation results show that the proposed search strategy can distinctly improve the search performance and save radar time resources with the same given detection probability.

基于SVMD-Informer-XGBoost的风电功率区间预测

为了提高风电功率区间预测的精度,文章提出逐次变分模态分解(SVMD)、Informer和XGBoost算法模型的结合,实现风电功率区间预测。首先,SVMD算法自适应地分解出风电功率数据的各模态分量(IMF)和残差分量。其次,通过网格搜索算法(CV)对Informer和XGBoost模型算法进行优化,并通过网格搜索算法确定Informer-XGBoost输出预测值的最优权重,构建基于SVMD-Informer-XGBoost的预测模型。最后,通过分位数回归法(Quantile regression)输出预测值和真实值的误差,得到风电功率的区间预测。实验结果表明,所提出的方法相较于传统单一模型,在区间预测的准确度和稳定性上有了显著提升。在95%置信度水平下,区间预测指标区间覆盖率(PICP)和区间平均宽度(PINAW)分别可达94.96%和0.0362。

Information searches by consumers of miniature automobiles

We studied the information search behaviors of Chinese consumers of miniature automobiles. First, we identified the main sources where consumers acquire or seek information about miniature automobiles and discussed their extent of information search. Then, based on logistic regression and optimal scaling regression of statistics, we studied the influences of characteristics of consumers of miniature automobiles on the extent of information search and on Internet usage. The results indicate that consumers often utilize four sources to obtain information about miniature automobiles. The dominant information source for consumers is their friends/family, followed by dealers, newspapers, and TV. Age, occupation, education and income significantly affect the extent of information search, but gender and city of residence do not have significant impacts. Age, city of residence, occupation, education and income produce significant influences on Internet usage. Gender has an insignificant influence on whether a consumer uses the Internet to search for information.

Spatial/temporal indexing and information visualization genre for environmental digital libraries

Protecting and preserving our environmental systems require the ability to understand the spatio-temporal distri- bution of soils, parent material, topography, and land cover as well as the effects of human activities on ecosystems. Space-time modelling of ecosystems in an environmental digital library is essential for visualizing past, present, and future impacts of changes occurring within such landscapes (e.g., shift in land use practices). In this paper, we describe three novel features, spa- tio-temporal indexing, visualization, and geostatistical genre, for the environmental digital library, Environmental Visualization and Geographic Enterprise System (ENVISAGE), currently in progress at the University of Florida.

Mutual Information for Image Registration

Image registration is the overlaying of two images of the same scene taken at different times or by different sensors. It is one of the essential steps in information processing in remote sensing. To attain a highly accurate, reliable and low computation cost in image registration a suitable and similarity metric and reduction in search data and search space is required. In this paper, the author shows that if the right bin size is chosen, mutual information can be more robust than correlation in the registration of multi-temporal images. The author also compares the sensitivity of mutual information and correlation to Gaussian and multiplicative speckle noise. The author investigates automatic subimage selection as a reduction in search data strategy. The author proposes a measure, called alienability, which shows the ability ofa subimage to provide reliable registration. Alternate subimage selection methods such as using gradient, entropy and variance are also investigated. The author furthermore looks into a search space strategy using a gradient approach to maximize mutual information and show our first results.

融合Informer和深度哈希的时序数据相似性搜索研究

针对工业大数据相似性搜索的效率和准确率不高的问题,提出了一种融合Informer和深度哈希算法的时序数据相似性搜索方法。首先,基于Informer搭建深度哈希数据特征提取模型;然后,通过贪婪哈希函数和层归一化构建深度哈希函数,通过对损失函数进行优化提高深度哈希算法的性能;最后,对M树(M-tree)进行改进,提高时序数据相似性搜索的效率。基于不同数据集的实验结果表明,该方法在保证较高准确性的前提下,可以有效提高时序数据相似性搜索的速度。

Cluster based hierarchical resource searching model in P2P network

For the problem of large network load generated by the Gnutella resource-searching model in Peer to Peer （P2P） network, a improved model to decrease the network expense is proposed, which establishes a duster in P2P network, auto-organizes logical layers, and applies a hybrid mechanism of directional searching and flooding. The performance analysis and simulation results show that the proposed hierarchical searching model has availably reduced the generated message load and that its searching-response time performance is as fairly good as that of the Gnutella model.

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.

Rapid Extraction of Target Information in Messy Multimedia Medical Data

The information work in the hospital is very complicated. The amount of data is huge, and the forms are various. It is very troublesome to organize and find the data you need. In order to solve the problem, which often appears in the process of analyzing medical case and data, we use Labview2017 to design the corresponding multimedia data calling system for the purpose of rapid searching and effective extraction. This program, which greatly improves work efficiency, can realize fast searching multimedia data in the folder. Since we use of this type of system, the work efficiency has been greatly improved, and the burden on the staff has been greatly reduced.

Topology and Position Aware Overlay Network Construction Protocol for Augmentation Information of Satellite Navigation System

It is an effective method to broadcast the augmentation information of satellite navigation system using GEO technology.However,it becomes difficult to receive GEO signal in some special situation,for example in cities or canyons,in which the signal will be sheltered by big buildings or mountains.In order to solve this problem,an Internet-based broadcast network has been proposed to utilize the infrastructure of the Internet to broadcast the augmentation information of satellite navigation system,which is based on application-layer multicast protocols.In this paper,a topology and position aware overlay network construction protocol is proposed to build the network for augmentation information of satellite navigation system.Simulation results show that the new algorithm is able to achieve better performance in terms of delay,depth and degree utilization.

Smart control plane for information centric network-internet service provider networks

The information centric network(ICN)has been widely discussed in current researches.The ICN interoperation with a traditional IP network and caching methods are one of the research topics of interest.For economic reasons,the capability of applying the ICN to internet service providers(ISPs)with various traditional IP protocols already implemented,especially IGP,MPLS,VRF,and TE,does not require any change on the IP network infrastructure.The biggest concern of ISPs is related to their customers’contents delivery speed.In this paper,we consider ICN caching locations in ISP by using the concept of locator/ID separation protocol(LISP)for interoperation between a traditional IP address and name-based ICN.To be more specific,we propose a new procedure to determine caching locations in the ICN by using the cuckoo search algorithm(CSA)for finding the best caching locations of information chunks.Moreover,we create the smart control plane(SCP)scheme which is an intelligent controlling,managing,and mapping system.Its function is similar to the software defined network concept.We show how the proposed SCP system works in both synthetic small network and real-world big network.Finally,we show and evaluate the performance of our algorithm comparison with the simple search method using the shortest path first algorithm.

DEAON： dynamically-evolving active overlay networks for scalable information retrieval

In this paper, we propose the dynamically-evolving active overlay network （DEAON）, which is an efficient, scalable yet simple protocol to facilitate applications of decentralized information retrieval in P2P networks. DEAON consists of three novel components ： a Desirable Topology Construction and Adaptation algorithm to guide the evolution of the overlay topology towards a small-world-like graph; a Semantic-based Neighbor Selection scheme to conduct an online neighbor ranking; a Topology-aware Intelligent Search mechanism to forward incoming queries to deliberately selected neighbors. We deploy and compare DEAON with other several existing distributed search techniques over static and dynamic environments. The results indicate that DEAON outperforms its competitors by achieving higher recall rate while using much less network resources, in both of the above environments.

Prime Box Parallel Search Algorithm: Searching Dynamic Dictionary in O(lg m) Time

Hashing and Trie tree data structures are among the preeminent data mining techniques considered for the ideal search. Hashing techniques have the amortized time complexity of O(1). Although in worst case, searching a hash table can take as much as θ(n) time [1]. On the other hand, Trie tree data structure is also well renowned data structure. The ideal lookup time for searching a string of length m in database of n strings using Trie data structure is O(m) [2]. In the present study, we have proposed a novel Prime Box parallel search algorithm for searching a string of length m in a dictionary of dynamically increasing size, with a worst case search time complexity of O(log2m). We have exploited parallel techniques over this novel algorithm to achieve this search time complexity. Also this prime Box search is independent of the total words present in the dictionary, which makes it more suitable for dynamic dictionaries with increasing size.

Web Information Retrieval： Problem and Prospects

The information access is the rich data available for information retrieval, evolved to provide principle approaches or strategies for searching. For building the successful web retrieval search engine model, there are a number of prospects that arise at the different levels where techniques, such as Usenet, support vector machine are employed to have a significant impact. The present investigations explore the number of problems identified its level and related to finding information on web. The authors have attempted to examine the issues and prospects by applying different methods such as web graph analysis, the retrieval and analysis of newsgroup postings and statistical methods for inferring meaning in text. The proposed model thus assists the users in finding the existing formation of data they need. The study proposes three heuristics model to characterize the balancing between query and feedback information, so that adaptive relevance feedback. The authors have made an attempt to discuss the parameter factors that are responsible for the efficient searching. The important parameters can be taken care of for the future extension or development of search engines.

Dominant Meaning Method for Intelligent Topic-Based Information Agent towards More Flexible MOOCs

The use of agent technology in a dynamic environment is rapidly growing as one of the powerful technologies and the need to provide the benefits of the Intelligent Information Agent technique to massive open online courses, is very important from various aspects including the rapid growing of MOOCs environments, and the focusing more on static information than on updated information. One of the main problems in such environment is updating the information to the needs of the student who interacts at each moment. Using such technology can ensure more flexible information, lower waste time and hence higher earnings in learning. This paper presents Intelligent Topic-Based Information Agent to offer an updated knowledge including various types of resource for students. Using dominant meaning method, the agent searches the Internet, controls the metadata coming from the Internet, filters and shows them into a categorized content lists. There are two experiments conducted on the Intelligent Topic-Based Information Agent: one measures the improvement in the retrieval effectiveness and the other measures the impact of the agent on the learning. The experiment results indicate that our methodology to expand the query yields a considerable improvement in the retrieval effectiveness in all categories of Google Web Search API. On the other hand, there is a positive impact on the performance of learning session.

Adaptive allocation strategy for cooperatively jamming netted radar system based on improved cuckoo search algorithm

The jamming resource allocation problem of the aircraft formation cooperatively jamming netted radar system is investigated.An adaptive allocation strategy based on dynamic adaptive discrete cuckoo search algorithm(DADCS)is proposed,whose core is to adjust allocation scheme of limited jamming resource of aircraft formation in real time to maintain the best jamming effectiveness against netted radar system.Firstly,considering the information fusion rules and different working modes of the netted radar system,a two-factor jamming effectiveness evaluation function is constructed,detection probability and aiming probability are adopted to characterize jamming effectiveness against netted radar system in searching and tracking mode,respectively.Then a nonconvex optimization model for cooperatively jamming netted radar system is established.Finally,a dynamic adaptive discrete cuckoo search algorithm(DADCS)is constructed by improving path update strategies and introducing a global learning mechanism,and a three-step solution method is proposed subsequently.Simulation results are provided to demonstrate the advantages of the proposed optimization strategy and the effectiveness of the improved algorithm.