• Title/Summary/Keyword: Searching

Search Result 5,578, Processing Time 0.031 seconds

Concealed Policy and Ciphertext Cryptography of Attributes with Keyword Searching for Searching and Filtering Encrypted Cloud Email

  • Alhumaidi, Hind;Alsuwat, Hatim
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.6
    • /
    • pp.212-222
    • /
    • 2022
  • There has been a rapid increase in the use of cloud email services. As a result, email encryption has become more commonplace as concerns about cloud privacy and security grow. Nevertheless, this increase in usage is creating the challenge of how to effectively be searching and filtering the encrypted emails. They are popular technologies of solving the issue of the encrypted emails searching through searchable public key encryption. However, the problem of encrypted email filtering remains to be solved. As a new approach to finding and filtering encrypted emails in the cloud, we propose a ciphertext-based encrypted policy attribute-based encryption scheme and keyword search procedure based on hidden policy ciphertext. This feature allows the user of searching using some encrypted emails keywords in the cloud as well as allowing the emails filter-based server toward filter the content of the encrypted emails, similar to the traditional email keyword filtering service. By utilizing composite order bilinear groups, a hidden policy system has been successfully demonstrated to be secure by our dual system encryption process. Proposed system can be used with other scenarios such as searching and filtering files as an applicable method.

An Efficient Web Search Method Based on a Style-based Keyword Extraction and a Keyword Mining Profile (스타일 기반 키워드 추출 및 키워드 마이닝 프로파일 기반 웹 검색 방법)

  • Joo, Kil-Hong;Lee, Jun-Hwl;Lee, Won-Suk
    • The KIPS Transactions:PartD
    • /
    • v.11D no.5
    • /
    • pp.1049-1062
    • /
    • 2004
  • With the popularization of a World Wide Web (WWW), the quantity of web information has been increased. Therefore, an efficient searching system is needed to offer the exact result of diverse Information to user. Due to this reason, it is important to extract and analysis of user requirements in the distributed information environment. The conventional searching method used the only keyword for the web searching. However, the searching method proposed in this paper adds the context information of keyword for the effective searching. In addition, this searching method extracts keywords by the new keyword extraction method proposed in this paper and it executes the web searching based on a keyword mining profile generated by the extracted keywords. Unlike the conventional searching method which searched for information by a representative word, this searching method proposed in this paper is much more efficient and exact. This is because this searching method proposed in this paper is searched by the example based query included content information as well as a representative word. Moreover, this searching method makes a domain keyword list in order to perform search quietly. The domain keyword is a representative word of a special domain. The performance of the proposed algorithm is analyzed by a series of experiments to identify its various characteristic.

On a Reduction of Codebook Searching Time by using RPE Searching Tchnique in the CELP Vocoder (RPE 검색을 이용한 CELP 보코더의 불규칙 코드북 검색)

  • 김대식
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1995.06a
    • /
    • pp.141-145
    • /
    • 1995
  • Code excited linear prediction speech coders exhibit good performance at data rates as low as 4800 bps. The major drawback to CELP type coders is their large computational requirements. In this paper, we propose a new codebook search method that preserves the quality of the CELP vocoder with reduced complexity. The basic idea is to restrict the searching range of the random codebook by using a searching technique of the regular pulse excitation. Applying the proposed method to the CELP vocoder, we can get approximately 48% complexity reduction in the codebook search.

  • PDF

End User Online Searching (최종이용자 온라인 탐색)

  • 장우권
    • Proceedings of the Korean Society for Information Management Conference
    • /
    • 1995.08a
    • /
    • pp.45-48
    • /
    • 1995
  • Since the early 1970s online searching has provided end-users with commercial and governmental bibliographic databases by trained intermediaries through the developed Vendor/Agency Systems. Recently, the situation has begun to change. The era of end-user searching is coming. End Users are the “information consumers” as the final user of an IT product or set of information. This study on end-user online searching is presented with the following aspects: development, characterization, training, end user online search services in university libraries, role of the intermediaries and librarians, the future.

  • PDF

The Effect of Deal-Proneness in the Searching Pattern on the Purchase Probability of Customer in Online Travel Services (소비자 키워드광고 탐색패턴에 나타난 촉진지향성이 온라인 여행상품 구매확률에 미치는 영향)

  • Kim, Hyun Gyo;Lee, Dong Il
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.39 no.1
    • /
    • pp.29-48
    • /
    • 2014
  • The recent keyword advertising does not reflect the individual customer searching pattern because it is focused on each keyword at the aggregate level. The purpose of this research is to observe processes of customer searching patterns. To be specific, individual deal-proneness is mainly concerned. This study incorporates location as a control variable. This paper examines the relationship between customers' searching patterns and probability of purchase. A customer searching session, which is the collection of sequence of keyword queries, is utilized as the unit of analysis. The degree of deal-proneness is measured using customer behavior which is revealed by customer searching keywords in the session. Deal-proneness measuring function calculates the discount of deal prone keyword leverage in accordance with customer searching order. Location searching specificity function is also calculated by the same logic. The analyzed data is narrowed down to the customer query session which has more than two keyword queries. The number of the data is 218,305 by session, which is derived from Internet advertising agency's (COMAS) advertisement managing data and the travel business advertisement revenue data from advertiser's. As a research result, there are three types of the deal-prone customer. At first, there is an unconditional active deal-proneness customer. It is the customer who has lower deal-proneness which means that he/she utilizes deal-prone keywords in the last phase. He/she starts searching a keyword like general ones and then finally purchased appropriate products by utilizing deal-prone keywords in the last time. Those two types of customers have the similar rates of purchase. However, the last type of the customer has middle deal-proneness; who utilizes deal-prone keywords in the middle of the process. This type of a customer closely gets into the information by employing deal-prone keywords but he/she could not find out appropriate alternative then would modify other keywords to look for other alternatives. That is the reason why the purchase probability in this case would be decreased Also, this research confirmed that there is a loyalty effect using location searching specificity. The customer who has higher trip loyalty for specificity location responds to selected promotion rather than general promotion. So, this customer has a lower probability to purchase.

Design and Implementation of the Graphical Relational Searching for Folksonomy Tags in the Participational Architecture of Web 2.0 (웹2.0의 참여형 아키텍쳐 환경에서 그래픽 기반 포크소노미 태그 연관 검색의 설계 및 구현)

  • Kim, Woon-Yong;Park, Seok-Gyu
    • Journal of Internet Computing and Services
    • /
    • v.8 no.5
    • /
    • pp.1-10
    • /
    • 2007
  • Recently, the web 2.0 services which appear by exponential extension of the Internet can be expressed with the changes in the quality of structural evolution and in the quantity of increasing users. The structural base is in user participational architecture, the web 2.0 services such as Blog, UCC, SNS(Social Networking Service), Mash-up, Long tail, etc. play a important role in organization of web, and grouping and searching of user participational data in web 2.0 is broadly used by folksonomy. Folksonomy is a new form that categorizes by tags, not classic taxonomy skill. it is made by user participation. Searching based on tag is now done by a simple text or a tag cloud method. But searching to consider and express the relations among each tags is imperfect yet. Thus, this paper provides the relational searching based on tags using the relational graph of tags. It should improve the trust of the searching and provide the convenience of the searching.

  • PDF

A study of the searching behavior at the catalog in a university library : case study of Jeonbug national university library (대학도서관의 목록이용행태의 일고찰)

  • 강혜영
    • Journal of Korean Library and Information Science Society
    • /
    • v.9
    • /
    • pp.1-31
    • /
    • 1982
  • A library catalog is most important finding tool to a library collection. This tool should be so designed as to enable users to handle with ease and convenience. Library catalog use study is necessary in order to identify the demands made on the catalog by its actual users and to measure the adequacy with which the catalog is meeting these demands. Many major catalog use surveys were performed by means of questionnaire and interview, but these methods are so difficult and perverse that the results of catalog use studies might often be far from scientific precision. The aim of this paper is to seek the guidelines with which one might assist the catalogers in providing an effective library catalog for their patrons. In order to get the first-hand information an actual survey was undertaken on searching behavior at the catalog of Jeonbug National University Library from November 30 to December 5, 1981 and from May 17 to May 22, 1982. The results of the survey can be summarized as follows: 1. Most of the students (79.77%) use the library. 2. Most of the library patrons (74.52%) use the public catalog as the searching tool to the library collection. 3. 67.85% of the catalog users are interested in searching materials written in Korean, Japanese, and Chinese. 4. 72.86% of the catalog users are interested in searching known items at catalog. 5. In known item searching, 49.44% of the catalog users choose title entry. 6. 20.17% of the catalog users are interested subject searching at the catalog. 7. Reference card is not utilized in searching. 8. For the translated items users want double entries in both vernacular and Korean. 9. At current catalog description, author, title, call number, translator, publisher and joint author are useful entry. Edition, author's date of birth and death, illustrative, size of book and bibliographical notes are not much utilized. 10. 55.39% of the catalog user need systematic guidance on how to use the library catalog and collection.

  • PDF

A REVIEW OF STUDIES ON OPERATOR'S INFORMATION SEARCHING BEHAVIOR FOR HUMAN FACTORS STUDIES IN NPP MCRS

  • Ha, Jun-Su;Seong, Poong-Hyun
    • Nuclear Engineering and Technology
    • /
    • v.41 no.3
    • /
    • pp.247-270
    • /
    • 2009
  • This paper reviews studies on information searching behavior in process control systems and discusses some implications learned from previous studies for use in human factors studies on nuclear power plants (NPPs) main control rooms (MCRs). Information searching behavior in NPPs depends on expectancy, value, salience, and effort. The first quantitative scanning model developed by Senders for instrument panel monitoring considered bandwidth (change rate) of instruments as a determining factor in scanning behavior. Senders' model was subsequently elaborated by other researchers to account for value in addition to bandwidth. There is also another type of model based on the operator's situation awareness (SA) which has been developed for NPP application. In these SA-based models, situation-event relations or rules on system dynamics are considered the most significant factor forming expectancy. From the review of previous studies it is recommended that, for NPP application, (1) a set of symptomatic information sources including both changed and unchanged symptoms should be considered along with bandwidth as determining factors governing information searching (or visual sampling) behavior; (2) both data-driven monitoring and knowledge-driven monitoring should be considered and balanced in a systematic way; (3) sound models describing mechanisms of cognitive activities during information searching tasks should be developed so as to bridge studies on information searching behavior and design improvement in HMI; (4) the attention-situation awareness (A-SA) modeling approach should be recognized as a promising approach to be examined further; and (5) information displays should be expected to have totally different characteristics in advanced control rooms. Hence much attention should be devoted to information searching behavior including human-machine interface (HMI) design and human cognitive processes.

Development of Shortest Path Searching Network Reduction Algorithm (최단경로 탐색영역 축소 알고리즘 개발)

  • Ryu, Yeong-Geun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.12 no.2
    • /
    • pp.12-21
    • /
    • 2013
  • This study developed searching network reduction algorithm for reduce shortest path searching time. Developed algorithm is searching nodes that have the including possibility of less weights path than temporal path that consists minimum number of nodes and minimum sum of the straight line distances. The node that has the including possibility of shortest path is the node that the sum of straight line distance from start node and straight line distance to target node is less than the value that temporary path's weights divided by minimum weights units. If searching network reconstitutes only these nodes, the time of shortest path searching will be reduced. This developed algorithm has much effectiveness that start node and target node is close in large network.

Efficient Design of Web Searching Robot Engine Using Distributed Processing Method with Javascript Function (자바스크립트 함수처리 기능을 포함한 분산처리 방식의 웹 수집 로봇의 설계)

  • Kim, Dae-Yu;Kim, Jung-Tae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.12
    • /
    • pp.2595-2602
    • /
    • 2009
  • In this paper, we proposed and implemented web robot using active script engine with internet explore to process javascript function link, which is not processing in conventional web searching robot. This web searching robot is developed to measure collecting amount of web searching robot with processing of javascript function link. We analysed the architecture of web searching robot with google and naybot to develope web searching robot, implemented element of configuration applicable to searching robot and designed with distributed processing type. In addition to, we estimated the proposed web robot employing javascript processing model and analysed the comparison of collecting amount of web site board using javascript. We obtained the result of 1,000 web page collecting compared to conventional method in case of 1,000 web site board.