Entity

Time filter

Source Type


Bartol T.,University of Ljubljana | Budimir G.,Institute of Information Science | Juznic P.,University of Ljubljana | Stopar K.,University of Ljubljana
Scientometrics | Year: 2016

Fields of science (FOS) can be used for the assessment of publishing patterns and scientific output. To this end, WOS JCR (Web of Science/Journal Citation Reports) subject categories are often mapped to Frascati-related OECD FOS (Organization for Economic Co-operation and Development). Although WOS categories are widely employed, they reflect agriculture (one of six major FOS) less comprehensively. Other fields may benefit from agricultural WOS mapping. The aim was to map all articles produced nationally (Slovenia) by agricultural research groups, over two decades, to their corresponding journals and categories in order to visualize the strength of links between the categories and scatter of articles, based on WOS-linked raw data in COBISS/SciMet portal (Co-operative Online Bibliographic System and Services/Science Metrics) and national CRIS—Slovenian Current Research Information System. Agricultural groups are mapped into four subfields: Forestry and Wood Science, Plant Production, Animal Production, and Veterinary Science. Food science is comprised as either plant- or animal-product-related. On average, 50 % of relevant articles are published outside the scope of journals mapped to WOS agricultural categories. The other half are mapped mostly to OECD Natural-, Medical- and Health Sciences, and Engineering-and-Technology. A few selected journals and principal categories account for an important part of all relevant documents (core). Even many core journals/categories as ascertained with power laws (Bradford’s law) are not mapped to agriculture. Research-evaluation based on these classifications may underestimate multidisciplinary dimensions of agriculture, affecting its position among scientific fields and also subsequent funding if established on such ranking. © 2016 Akadémiai Kiadó, Budapest, Hungary Source


Lin J.-W.,Tunghai University | Lin F.-S.,Institute of Information Science
11th International Symposium on Communications and Information Technologies, ISCIT 2011 | Year: 2011

Most legacy computer systems only well support input and display of 20,902 Han characters (Hanzis for short) encoded in Unicode 1.0. In 2010, Unicode 6.0 has encoded 75,616 Hanzis. However, it is not easy to use these newly encoded Hanzis, even in the latest computers. Most of these newly encoded Hanzis are rarely used in daily lives. Some are only used in ancient literature or individual Sinospherical countries. Users may have confusion of their glyph shapes, pronunciations, meanings, and usages. Most Chinese IMEs (input method editors) require users to have good knowledge of Hanzis. As a result, users cannot input these Hanzis. We present an auxiliary Unicode Hanzi lookup service based on glyph shape similarity. One can key in a similar Hanzi by any IME to look up the wanted Hanzi. Each Unicode Hanzi is decomposed as a glyph expression. The similarity of glyph shapes of two Hanzis is calculated based on a derived edit distance on their glyph expressions. As a result, the system provides users a convenient way to look up unfamiliar Hanzis. © 2011 IEEE. Source


Chen S.C.-C.,National Yang Ming University | Chen S.C.-C.,Institute of Information Science | Chen S.C.-C.,Academia Sinica, Taiwan | Chuang T.-J.,Academia Sinica, Taiwan | And 2 more authors.
Molecular Biology and Evolution | Year: 2011

Many indicators of protein evolutionary rate have been proposed, but some of them are interrelated. The purpose of this study is to disentangle their correlations. We assess the strength of each indicator by controlling for the other indicators under study. We find that the number of microRNA (miRNA) types that regulate a gene is the strongest rate indicator (a negative correlation), followed by disorder content (the percentage of disordered regions in a protein, a positive correlation); the strength of disorder content as a rate indicator is substantially increased after controlling for the number of miRNA types. By dividing proteins into lowly and highly intrinsically disordered proteins (L-IDPs and H-IDPs), we find that proteins interacting with more H-IDPs tend to evolve more slowly, which largely explains the previous observation of a negative correlation between the number of protein-protein interactions and evolutionary rate. Moreover, all of the indicators examined here, except for the number of miRNA types, have different strengths in L-IDPs and in H-IDPs. Finally, the number of phosphorylation sites is weakly correlated with the number of miRNA types, and its strength as a rate indicator is substantially reduced when other indicators are considered. Our study reveals the relative strength of each rate indicator and increases our understanding of protein evolution. © 2011 The Author. Source


Shiu C.-W.,Sun Yat Sen University | Chen Y.-C.,Institute of Information Science | Hong W.,Sun Yat Sen University
Signal Processing: Image Communication | Year: 2015

Encrypted image-based reversible data hiding (EIRDH) is a well-known notion of information hiding. In EIRDH, there are three entities, image provider (also called "context owner"), data hider, and receiver, where particularly they have to hold a shared key. The image provider sends the data hider the encrypted image by encrypting a chosen cover-image. Then, the hider generates the message-embedded encrypted image to the receiver by embedding the secret message. The receiver can simultaneously recover the original cover-image and extract the correct secret message. However, the data hider and image provider must be designated parties; this is, encrypted image-based reversible data hiding with public key cryptography (EIRDH-P) is a natural issue to eliminate the above limitation. In this paper, we construct the new EIRDH-P scheme from difference expansion (DE). We also analyze our scheme with respect to computation and communication. Finally, the experimental results show the effectiveness of this scheme. As pure image-based reversible data hiding from DE, the proposed EIRDH-P from DE also enjoys the advantages of DE. © 2015 Elsevier B.V. Source


Wu C.-J.,National Taiwan University | Wu C.-J.,Institute of Information Science | Ho J.-M.,Academia Sinica, Taiwan | Chen M.-S.,Academia Sinica, Taiwan | Chen M.-S.,National Taiwan University
IEEE Transactions on Mobile Computing | Year: 2013

Social network applications are becoming increasingly popular on mobile devices. A mobile presence service is an essential component of a social network application because it maintains each mobile user's presence information, such as the current status (online/offline), GPS location and network address, and also updates the user's online friends with the information continually. If presence updates occur frequently, the enormous number of messages distributed by presence servers may lead to a scalability problem in a large-scale mobile presence service. To address the problem, we propose an efficient and scalable server architecture, called PresenceCloud, which enables mobile presence services to support large-scale social network applications. When a mobile user joins a network, PresenceCloud searches for the presence of his/her friends and notifies them of his/her arrival. PresenceCloud organizes presence servers into a quorum-based server-to-server architecture for efficient presence searching. It also leverages a directed search algorithm and a one-hop caching strategy to achieve small constant search latency. We analyze the performance of PresenceCloud in terms of the search cost and search satisfaction level. The search cost is defined as the total number of messages generated by the presence server when a user arrives; and search satisfaction level is defined as the time it takes to search for the arriving user's friend list. The results of simulations demonstrate that PresenceCloud achieves performance gains in the search cost without compromising search satisfaction. © 2012 IEEE. Source

Discover hidden collaborations