@article {753, title = {How Much Difference in Earthquake Risk among China{\textquoteright}s Areas: A Study based on Pricing a Seismic Catastrophe Bond}, journal = {Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {03/2023}, pages = {18-23}, type = {Research}, chapter = {18}, abstract = {

Firstly, this paper gives a data aggregation algorithm based on learning automata to solve the problem that the existing data aggregation algorithm can{\^a}{\texteuro}{\texttrademark}t solve, the uneven energy cost, and the existing algorithm can{\^a}{\texteuro}{\texttrademark}t change the gathering path dynamically existing the overhead environment. In the proposed method, nodes can change its gathering path to adjust the overhead environment. All the nodes of WSN equipped with a learning automata. These leaning automata learn all the gathering path of the nodes. In the process of transmit information two kinds of data are transmitted, including data packet, knowledge packet .When the information of the nodes changes, according to the feedback of the nods, the learning automata gives the reward or punish to the current gathering path, which help to find the best gathering path. Secondly, this paper improved the wavelet data compression algorithm, which was brought out as the correlation between different data. The algorithm do not reduce much of the data relate to the original data. After the wavelet data compression, Huffman coding compression algorithm will improve the data compression ratio.

}, doi = {https://doi.org/10.6025/jdim/2023/21/1/18-23}, url = {http://www.dline.info/download.php?sn=3683}, author = {Yong Zhang and Wei Liu} } @article {810, title = {Hybrid Force-Based Model to Simulate Behavior of Human Crowd in Panic Situations-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {02/2019}, pages = {25-33}, type = {Research}, chapter = {25}, abstract = {

\ Modelling human behavior is important as it helps preparing for the situation of emergency to save lives. In this paper we present new methods to simulate crowd evacuation phenomena by using a physical model. We focus on applying more effective forces focusing on Spring-Force as general forces affecting agents as well as repulsive danger-force, in addition, we propose a new algorithm for an interaction behavior. We implement our algorithm in a real-world application which shows that our model provides results approaching reality and is promising compared to the other models.

}, doi = {https://doi.org/10.6025/jdim/2019/17/1/25-33}, url = {http://dline.info/fpaper/jdim/v17i1/jdimv17i1_3.pdf}, author = {Ammar Alnahhas and ElisaarBarri} } @article {707, title = {Hybrid Force-Based Model to Simulate Behavior of Human Crowd in Panic Situations}, journal = {Journal of Digital Information Management}, volume = {19}, year = {2019}, month = {02/2019}, type = {Research}, chapter = {25-33}, doi = {https://doi.org/10.6025/jdim/2019/1/25-33}, author = {Ammar Alnahhas and ElisaarBarri} } @article {713, title = {Hybrid SVR-ACNN Model: Proposed Video Super-Resolution Method for Video Enhancement}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {04/2019}, pages = {87-103}, type = {Research}, chapter = {87}, doi = {https://doi.org/10.6025/jdim/2019/17/2/87-103}, author = {Padma Reddy A. M and Udayarani} } @article {661, title = {Health Care Monitoring Using Wifi Through Mobile Devices}, journal = {Journal of Information Technology Review}, volume = {9}, year = {2018}, month = {02/2018}, pages = {18-25}, type = {Research}, author = {Krishna Chaitanya Gogineni and Lakshmi Soundharya Uppuluri} } @article {693, title = {A Hybrid Feature Selection Algorithm Based on Information Gain and Sequential Forward Floating Search}, journal = {Journal of Intelligent Computing}, volume = {9}, year = {2018}, month = {09/2018}, pages = {93-101}, type = {Research}, author = {Jianli Ding and Liyang Fu} } @article {648, title = {Hybrid Multi-Criteria Decision Making Approach for Product Ranking Using Customers Reviews}, journal = {Journal of Data Processing}, volume = {8}, year = {2018}, month = {03/2018}, pages = {1-17}, type = {Research}, author = {Rakesh Kumar and Aditi Sharan} } @article {476, title = {High level mammographic information fusion for real world ontology population}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {259 - 271}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85036660676\&partnerID=40\&md5=8f5bfd1dfc3fb6b38f1340484f42e5a9}, author = {Salem, Y.B. and Idodi, R. and Ettabaa, K.S. and Hamrouni, K. and Solaiman, B.} } @article {518, title = {High-performance computer system based on CPU/GPU isomeric architecture parallel algorithm}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {218 - 223}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982812315\&partnerID=40\&md5=30bd9688e827a922977566f2a2b0344d}, author = {Jiang, H.} } @article {520, title = {Hot topic extraction and public opinion classification of tibetan texts}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {160 - 167}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982786667\&partnerID=40\&md5=65894d6a0354bc43e13d953109c62b93}, author = {Xu, G. and Qiu, L. and Peng, X.} } @article {553, title = {Hybrid approach for project portfolio selection taking account of resources management and interactions between projects}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {451 - 461}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959232725\&partnerID=40\&md5=dfb8c730a2a801c9e09550897ae0f3d3}, author = {Benaija, K. and Kjiri, L.} } @article {576, title = {A hybrid method to extract triggers in biomedical events}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {300 - 305}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942513410\&partnerID=40\&md5=2e0586033f81cb3990ed8b5f9af40cb4}, author = {Wei, X. and Zhu, Q. and Lyu, C. and Ren, K. and Chen, B.} } @article {366, title = {Hierarchical clustering analysis method based on the grid with obstacle space}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {76 - 82}, abstract = {The advantage of grid-based clustering method is its fast processing speed. The speed of clustering algorithm and the number of data objects is unrelated. To discover any size and shape of the cluster{\"y}it is by the number of units on each dimension in the data space. In this method, the amount of data and computation time does not matter, calculations and data entry of the order does not matter, does not require the number of k-means algorithm to pre-specified cluster and so on. Clustering problem with obstacle constraints has very strong practical value in the spatial clustering analysis, and has become a research hotspot in recent years. Under the condition of existing obstacles constraints, the vast majority of the spatial clustering algorithm can{\textquoteright}t effectively solve the problem of irregular obstructions. Thus it has a greater impact on the accuracy of the algorithm clustering results, and reduces the efficiency of the algorithm. To solve this problem, an obstacle constraint space grid-based hierarchical clustering algorithm, which is GSHCO algorithm, is proposed. The algorithm inherits the advantages of gridbased clustering algorithm, by defining the concept of barriers to grid to deal effectively with the obstacles of arbitrary shape, to achieve the purpose of found clusters of arbitrary shape; At the same time, the algorithm uses a hierarchical strategy which can effectively reduce the complexity of the algorithm with obstacles clustering and the algorithm is improved operating efficiency. The experimental results show that the GSHCO algorithm can deal with obstacles constrained clustering, and with higher performance and better clustering quality.}, keywords = {Cluster ensemble, Grid spatial clustering, Multi-scale clustering, Spatial cluster analysis}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879084446\&partnerID=40\&md5=8173c506959188548e2182b57f3f31c2}, author = {Shan, D. and Yang, Z.} } @article {387, title = {High points recognition method of scraped surface based on background Subtraction}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {115 - 119}, abstract = {Using computer vision library OpenCV, a method of automatic recognition high points of scraped workpiece surface is presented. The image is dealt with by background subtraction, Median filtering, morphological processing, image negates, contour finding and drawing contours. In order to accurately and efficiently recognize the high-point contours and mark its center positions, mathematical morphology and specific processing function were used.}, keywords = {Background subtraction, Contour analysis, High points recognition, Image processing, Scrapping}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879125674\&partnerID=40\&md5=593c3c4ffe380889b98f09f916fa0b8c}, author = {Li, X. and Sun, L. and Liu, Y.} } @article {381, title = {A hybrid method to deformation force of high-speed cold roll-beating forming}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2013}, pages = {146 - 153}, abstract = {High-speed cold roll-beating forming technique is a new near-net plastic forming method that the intermittent high-speed roll-beating is used to achieve dynamic impact local loading, and that is fast, transient, high impact, large deformation of the complex forming process. For this forming process, the main stress method is employed to derive an analytic formula for the deformation force. Taking into account the main stress method can not reflect impact factors such as high-speed transient roll beating in process of this analytic solution, then the ABAQUS/Explicit is applied to simulate for highspeed cold roll- beating. The regression analysis is used to correct for the analytic formula based on simulation results, which makes the analytic formula more accurate reflection of deformation force of the different technological parameters of high-speed cold roll-beating. The forming experiments are carried out with self developed high-speed cold roll-beating experimental equipment and the experimental of deformation force is measured to verify the correctness of the corrected analytic formula.}, keywords = {Cold roll-beating, Deformation force, Experimental verification, Slab method}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879119848\&partnerID=40\&md5=beed77f3dd930748bf1900ffca1e5ad0}, author = {Yang, M.-S. and Li, Y. and Yuan, Q.-L.} } @article {234, title = {Harvesting pertinent resources from Linked Open Data}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2010}, pages = {205 - 212}, abstract = {Linked Open Data (LOD) is becoming an essential part of the Semantic Web. Although LOD has amassed large quantities of structured data from diverse, openly available data sources, there is still a lack of user-friendly interfaces and mechanisms for exploring this huge resource. In this paper, we describe a methodology for harvesting relevant information from the gigantic LOD cloud. The methodology is based on combination of information: identification, extraction, integration and presentation. Relevant information is identified by using a set of heuristics. The identified information resource is extracted by employing an intelligent URI discovery technique. The extracted information is further integrated with the help of a Concept Aggregation Framework. Then the information is presented to end users in logical informational aspects. Thereby, the proposed system is capable of hiding complex underlying semantic mechanics from end users and reducing the users{\textquoteright} cognitive load in locating relevant information. In this paper, we describe the methodology and its implementation in the CAF-SIAL system, and compare it with the state of the art.}, keywords = {CAF-SIAL, Information presentation, Information retrieval, Linked Open Data (LOD), Semantic web, URI, User interfaces}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960685735\&partnerID=40\&md5=cc886d4db44fdc4f20722b7621aca818}, author = {Latif, A. and Afzal, M.T. and Saeed, A.U. and Hoefler, P. and Tochtermann, K.} } @article {221, title = {Hierarchical clustering in medical document collections: The BIC-means method}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2010}, pages = {71 - 77}, abstract = {Hierarchical clustering of text collections is a key problem in document management and retrieval. In partitional hierarchical clustering, which is more efficient than its agglomerative counterpart, the entire collection is split into clusters and the individual clusters are further split until a heuristicallymotivated termination criterion is met. In this paper, we define the BIC-means algorithm, which applies the Bayesian Information Criterion (BIC) as a domain independent termination criterion for partitional hierarchical clustering. We evaluate the effectiveness of BIC-means in clustering and retrieval on medical document collections and we propose a dynamic version of the BIC-Means algorithm for adapting an existing clustering solution to document additions.}, keywords = {Bayesian information criterion (BIC), Document clustering, Document retrieval, Dynamic clustering, Performance, Termination criterion}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960667355\&partnerID=40\&md5=87c5599ab55c27b1d1ae1f1f2e76cd6b}, author = {Hourdakis, N. and Argyriou, M. and Petrakis, E.G.M. and Milios, E.E.} } @article {192, title = {HGOAAM: Facial analysis by active appearance model optimized by hybrid genetic algorithm}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2009}, pages = {193 - 201}, abstract = {Facial analysis is one of the challenges of a Human Machine Interactive (HMI) system. It includes face alignment, pose estimation, face recognition, facial expression detection etc. This paper proposes an efficient optimization technique by the hybridization of genetic algorithm (GA) with gradient descent (GD) to make a robust, efficient and real time face alignment system. It employs 2.5D Active Appearance Model (AAM) for the face search, in which the face model is generated by taking 3D landmarks and 2D texture of the facial image. Facial large lateral movements requires to optimize 6DOF (Degrees of Freedom) pose parameters which make the facial search space of AAM nonconvex. This nonconvex multidimensional search space requires an efficient optimization methodology. Gradient descent also known as deterministic optimization method can optimize the parameters as long as the search space remains convex. However in non-convex search space GA is able search face globally while GD can help GA to search face locally. In other words exploitation property of GD and exploration property of GA are combined to make an efficient optimization method. For this hybrid optimization we propose a gradient operator in GA, which functions in conjunction with the existing genetic operator of mutation. Thus it does not increase the computational cost of the system. We compare it with classical search algorithm by gradient descent and the hybrid optimization of GA with Simplex. Facial databases of SUPELEC{\textquoteright}08, Pointing{\textquoteright}04 and synthetic characters comprising of different facial poses are analyzed. Simulation results validate the efficiency, accuracy and robustness achieved.}, keywords = {Active appearance model (AAM), Facial analysis, Facial databases, Gradient descent, Hybrid genetic algorithm}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953263109\&partnerID=40\&md5=6f400ca83dfd110454d823df512347c5}, author = {Sattar, A. and Seguier, R.} } @article {116, title = {Hybrid clustering approach for term partitioning in document data sets}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {272 - 277}, abstract = {Information retrieval is one of the major research areas due to accumulation of huge information in digital form. Various techniques of Information retrieval are based on the fact that terms contained in a document along with their frequency of occurrence signify the semantics of the document. Recent attempts to find the relevant document for a context represents documents in a vector space model as document-term vector containing term weights for every index term in that document. As there will be enormous number of index terms this leads to high dimensionality problem. We can reduce the dimensionality based on the observation that groups of terms associated with related concepts occur together or do not occur in a document based on whether the document is relevant or not to that concept. Such a group of terms Is identified as an equivalence class and can be viewed as a single dimension in a Rough set based information retrieval system. In this paper we present a hybrid clustering approach for the formation of equivalence classes of terms associated with related concepts. It uses the outcome of hierarchical clustering to provide seed points for implementing Incremental K-means algorithm. Due to the sparsity of the term vector the cosine similarity estimate was found to be ineffective for term clustering. Another promising measure of proximity estimate used in information retrieval namely Euclidian distance has a drawback that It is biased towards changes in the term frequencies in larger documents when the term weights are represented by tf-ldf estimates. Hence we propose normalization for tf-idf estimates while representing a term as a vector in a document space before clustering the terms.}, keywords = {Dimensionality reduction, Hierarchical clustering, K means algorithm, Partitional clustering, Text mining}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350735762\&partnerID=40\&md5=911fe260f9a7d869bf7ee8660851cdac}, author = {Reddy, K.T. and Shashi, M. and Reddy, L.P.} } @article {62, title = {How to enhance competitive advantage of digital content industries? - A case study of Taiwan}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {256 - 259}, abstract = {On account for the rising of XDSL construction in Taiwan recent years, hundred of thousands people have become interested in digital content. Digital content is a creative industry, accompanied with emergence of rapid changed technologies and innovative business models, the government all over the world would be devoted to promoting the competitive advantage in digital content industries. From perspective of "digital independence", online game is regarded as the most cultural and innovative among them. While designing the online games architecture researchers provide due importance to technology. However, the present paper place emphasis on human element in architecture related to online games. The Taiwan experience is used to construct the online game architecture.}, keywords = {Digital content, Online games, Taiwan digital industry}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33845927549\&partnerID=40\&md5=1bc7801fbff9552e0e1cbbbc3589f047}, author = {Yeh, S.-W. and Shiue, Y.-C. and Horng, D.-J.} } @article {36, title = {A hybrid model to improve relevance in document retrieval}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2006}, pages = {73 - 81}, abstract = {In information retrieval community a lot of work is focused on increasing efficiency by capturing statistical features. The other dominant approach is to improve the relevance by capturing the semantic and contextual information which is invariably inefficient. Generally the two approaches are assumed to be diametrically opposite. In this paper we have tried to combine the two approaches by proposing a hybrid information retrieval model. The model works in two stages. The first stage is a statistical model and the second stage is based on semantics. We have first downsized the document collection for a given query using vector model and then used a conceptual graph (CG) based representation to rank the documents. Our main objective is to investigate the use of conceptual graphs as a precision tool in the second stage. The use of CGs brings semantic in the ranking process resulting in improved relevance. Three experiments have been conducted to demonstrate the feasibility and usefulness of our model. A test run is made on CACM-3204 collection. We observed 34.8\% increase in precision for a subset of CACM queries. The second experiment is performed on a test collection specifically designed to test the strength of our model in situation where the same terms are being used in different context. Improved relevance has been observed in this case also. The application of this approach on results retrieved from LYCOS shown significant improvement. The proposed model is both efficient, scalable and domain independent.}, keywords = {CG-based retrieval model, High precision information retrieval model, Intelligent retrieval, Two-stage retrieval model}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748252460\&partnerID=40\&md5=28fb109a6982827d4057e4947164916d}, author = {Siddiqui, T.J. and Tiwary, U.} } @article {30, title = {Hybrid storage scheme for RDF data management in Semantic Web}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {32 - 36}, abstract = {With the advent of the Semantic Web as the next-generation of Web technology, large volumes of Semantic Web data described in RDF will appear in the near future. Most previous approaches treat RDF data as a form of triple and store them in a large-sized relational table. Basically, since it always requires the whole table to be scanned for processing a query, it may degrade retrieval performance. In addition, it does not scale well. In this paper, we propose a hybrid storage approach for RDF data management. The proposed approach aims to provide good query performance, scalability, manageability, and flexibility. To achieve these goals, we distinguish some frequently appeared properties in RDF data. A set of RDF data with a distinguished property is independently treated and stored together in a corresponding property-based table. For processing a query having a specific property, we can avoid full scanning the whole data and only have to access a corresponding table. For queries having specific properties, the proposed scheme achieves better performance than the previous approach.}, keywords = {Data storage scheme, RDF data management, Semantic web}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748257249\&partnerID=40\&md5=6e21f3861ea8e8149f8df1878a0aaabc}, author = {Kim, S.W.} } @article {24, title = {HyperMap: A system to map the web}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {4 - 10}, abstract = {This paper presents the HyperMap system which dynamically structures information on the Web. The system is based on a framework resulting from multidisciplinary research, which is briefly discussed. This paper focuses work done to develop a new generation of computational tools able to support the extraction and the discovery of useful information on the Web, becoming agents of innovation and development.}, keywords = {Concept mapping, Hyper space, Information extraction, Knowledge discovery, Semantic web, Web knowledge discovery, Web navigation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748283744\&partnerID=40\&md5=0ae6894b5de7bbb54ba63e4ce6b1f95c}, author = {Ralha, C.G. and Ralha, J.C.L.} }