Search

Considering the total number of citations as the sole indicator of a research paper’s success is not always correct. Furthermore, considering the total number of reads (downloads, views, and usage) is not always correct either. Therefore, this paper proposes a new measure called paper impact effectiveness (PIE) that combines both indicators to evaluate the impact of research papers in order to provide a more realistic and fair indicator. Therefore, the total number of downloads for the most popular papers, selected from a single journal, in addition to total citations from Google Scholar were obtained to prove this paper’s argument. Universities, research ranking agencies, and researchers can use the PIE value to assess the impact (i.e., value) of research papers. [ABSTRACT FROM AUTHOR]

Phishing is a fraud attempt in which an attacker acts as a trusted person or entity to obtain sensitive information from an internet user. In this Systematic Literature Survey (SLR), different phishing detection approaches, namely Lists Based, Visual Similarity, Heuristic, Machine Learning, and Deep Learning based techniques, are studied and compared. For this purpose, several algorithms, data sets, and techniques for phishing website detection are revealed with the proposed research questions. A systematic Literature survey was conducted on 80 scientific papers published in the last five years in research journals, conferences, leading workshops, the thesis of researchers, book chapters, and from high-rank websites. The work carried out in this study is an update in the previous systematic literature surveys with more focus on the latest trends in phishing detection techniques. This study enhances readers' understanding of different types of phishing website detection techniques, the data sets used, and the comparative performance of algorithms used. Machine Learning techniques have been applied the most, i.e., 57 as per studies, according to the SLR. In addition, the survey revealed that while gathering the data sets, researchers primarily accessed two sources: 53 studies accessed the PhishTank website (53 for the phishing data set) and 29 studies used Alexa's website for downloading legitimate data sets. Also, as per the literature survey, most studies used Machine Learning techniques; 31 used Random Forest Classifier. Finally, as per different studies, Convolution Neural Network (CNN) achieved the highest Accuracy, 99.98%, for detecting phishing websites. [ABSTRACT FROM AUTHOR]

Multimedia content providers (such as cyberlockers) are overwhelmed by huge volumes and large sizes of multimedia files. Cyberlockers provide Quality-of-Service (QoS) downloading to end users as the files are split into fragments. However, merging these fragments on the fly for streaming harms Quality-of-Experience (QoE) of users and overwhelms computational capacity. As a solution, this paper proposes a FUSE based file system, namely fumy , for efficient storage of large multimedia files as small sized fragments (for downloading) and virtually unifying them for their efficient retrieval (for streaming). We discuss virtual unification, namespace manipulation and operation redirection employed by fumy to achieve its goal. We also discuss the implementation details of fumy as a FUSE file system. We evaluated fumy for its performance on extended file systems in various operational and benchmarking configurations. Our results suggest that fumy adds minimal performance overhead to extended file systems when the fragment size is 512 MiB or higher, imposes least performance tax on ext4 file system, and even enhances the performance of extended file systems for specific workloads and fragments sizes. We recommend using ext4 file system with fragment size of 512 MiB for different workloads to achieve optimal performance of fumy. [ABSTRACT FROM AUTHOR]

Content downloading in vehicular ad hoc networks supports the large file sharing, the entertainment experience and the mobile office. However, because of the high velocity, the frequent topology change, the limited bandwidth and a small number of roadside units, it is difficult to directly transmit the contents to their requesters through only one hop. This paper proposes a cooperative content downloading scheme in vehicular ad hoc networks, named CCD. It introduces the direction, range and timing constraints to select appropriate cooperative nodes, which improve the contact probability between the cooperative nodes and the request senders. Additionally, CCD computes the number of copies for each block according to its importance and urgency, and then schedules the block transmission accordingly. Experiments show that compared with existing schemes, CCD has a short delay and a small transmission overhead. [ABSTRACT FROM AUTHOR]

With the rapid growth of the smartphone and tablet market, mobile application (App) industry that provides a variety of functional devices is also growing at a striking speed. Product life cycle (PLC) theory, which has a long history, has been applied to a great number of industries and products and is widely used in the management domain. In this study, we apply classical PLC theory to mobile Apps on Apple smartphone and tablet devices (Apple App Store). Instead of trying to utilize often-unavailable sales or download volume data, we use open-access App daily download rankings as an indicator to characterize the normalized dynamic market popularity of an App. We also use this ranking information to generate an App life cycle model. By using this model, we compare paid and free Apps from 20 different categories. Our results show that Apps across various categories have different kinds of life cycles and exhibit various unique and unpredictable characteristics. Furthermore, as large-scale heterogeneous data (e.g., user App ratings, App hardware/software requirements, or App version updates) become available and are attached to each target App, an important contribution of this paper is that we perform in-depth studies to explore how such data correlate and affect the App life cycle. Using different regression techniques (i.e., logistic, ordinary least squares, and partial least squares), we built different models to investigate these relationships. The results indicate that some explicit and latent independent variables are more important than others for the characterization of App life cycle. In addition, we find that life cycle analysis for different App categories requires different tailored regression models, confirming that inner-category App life cycles are more predictable and comparable than App life cycles across different categories. [ABSTRACT FROM AUTHOR]

Abstract This paper proposes a flexible QC-LDPC decoder to support on-line matrix downloading. Its applications include IEEE 802.16e, 802.11n/ac/ax, and other advanced standards. Via TSMC 40-nm technology, the flexible architecture only has an area of 0.415 mm2. The according power dissipation is 84.68 mW at maximal clock frequency of 1.0 GHz. It is successfully verified with 3 LDPC codes pre-defined in IEEE 802.11n/ac/ax. [ABSTRACT FROM AUTHOR]

Abstract: Recently, the use of mobile-apps for self-monitoring is increasing rapidly. These apps are generally delivered through app stores that let users post reviews. These reviews provide a rich data source for user to select appropriate apps and developers as well as platform providers to understand user-reported issues. Asthma apps, though few in numbers, but are the most widely downloaded and used. Asthma is a lung disease that is affecting over 300 million people worldwide. It inflames and narrows the airways and produce extra mucus. There are very few medical apps developed for asthma self-care. In this paper, we present empirical study for exploring features, ratings and downloads of asthma apps. We study five thousands reviews of ten Asthma mobile apps, of the five top rated and five low rated at Google Play Store. [ABSTRACT FROM AUTHOR]

Reputation systems have been proposed to distinguish malicious peers and ensure the quality of services in P2P networks. How-ever, only relying on global reputation scores to assess the reliability of file providers can weaken the subjective opinions of file requesters, which is vulnerable to some malicious attacks, e.g., camouflage attack. To address this issue, in this paper, we propose a novel hybrid trust model, namely HTM, based on the EigenTrust reputation management system. In HTM, a file requester utilizes a two-phase reference method to take both the global reputation and the direct trust of a file provider into consideration when deciding whether to download from it or not. In particular, in the first phase, a requester selects a provider from the responders based on the roulette wheel selection algorithm; while in the second phase, the requester considers the direct trust on the selected provider with our proposed direct trust evaluation approach. The extended simulation results show that our mechanism can identify and isolate the malicious peers both under individual attack and camouflage attack effectively, thus improving the performance of P2P file sharing networks. [ABSTRACT FROM AUTHOR]

Recent experimental studies confirm the prevalence of the widely known performance anomaly problem in current Wi-Fi networks, and report on the severe network utility degradation caused by this phenomenon. Although a large body of work addressed this issue, we attribute the refusal of prior solutions to their poor implementation feasibility with off-the-shelf hardware and their imprecise modelling of the 802.11 protocol. Their applicability is further challenged today by very high throughput enhancements (802.11n/ac) whereby link speeds can vary by two orders of magnitude. Unlike earlier approaches, in this paper we introduce the first rigorous analytical model of 802.11 stations’ throughput and airtime in multi-rate settings, without sacrificing accuracy for tractability. We use the proportional-fair allocation criterion to formulate network utility maximisation as a convex optimisation problem for which we give a closed-form solution. We present a fully functional light-weight implementation of our scheme on commodity access points and evaluate this extensively via experiments in a real deployment, over a broad range of network conditions. Results demonstrate that our proposal achieves up to 100% utility gains, can double video streaming goodput and reduces TCP download by 8 × x . [ABSTRACT FROM AUTHOR]

This paper considers a vehicle edge computing system that uses nonOrthogonal multiple access technologies for task uploading and data packet downloading to solve the problems of insufficient computing power on the vehicle side, significant task processing delay, high energy consumption, and lack of wireless resources. The study looks into how to develop, compute offloading, and content caching queues under the vehicle edge computer network, with the help of NOMA, to decrease the total energy consumption at the MEC end. Regardless of the fact that there have been a lot of studies on computational offloading and content caching, the energy consumption of both is rarely investigated and dealt with simultaneously. The simulation findings demonstrate that, compared to typical orthogonal multiple access methods, the nonOrthogonal multiple access offload cache approach in the vehicle edge computing system may considerably lower the system energy consumption. [ABSTRACT FROM AUTHOR]

In recent years the combination of databases, data and internet technologies has greatly enhanced the functionality of many systems based on spatial data, and facilitated the dissemination of such information. In this paper, we propose a web-based data visualisation and analysis system for stratigraphic data from a Polish mine, with visualisation and analysis tools which can be accessed via the Internet. WWW technologies such as active web pages and WebGL technology provide a user-friendly interface for browsing, plotting, comparing, and downloading information of interest, without the need for dedicated mining industry software. [ABSTRACT FROM AUTHOR]

The visible success of the Peer to Peer (P2P) paradigm is associated with many challenges in finding trustworthy peers as reliable communication partners. Reputation management systems are emerging in the face of these challenges. The EigenTrust reputation management system is among the most known and successful reputation systems. On the other hand, a main drawback of this system is its reliance on a set of pre-trusted peers which causes nodes to center around them. As a consequence, other peers are ranked low despite being honest, marginalizing their effect in the system. To tackle this problem, this paper proposed enhancing the EigenTrust algorithm by giving peers with high reputation values (honest peers) a role in calculating the global reputation of other peers. Rather than solely depending on the static group of pre-trusted peers, the proposed algorithm, HonestPeer, selects the most reputable nodes, honest peers, dynamically based on the quality of the provided files. This makes HonestPeer more robust to the increase in the number of files and nodes in the system. Through simulation, it has been shown that HonestPeer has successfully maintained higher success rate and lower percentage of inauthentic downloads when compared to the original algorithm. [ABSTRACT FROM AUTHOR]

The rapid development of cloud storage services brings many security challenges. Data integrity, as the top priority of these security challenges, has always been a research hotspot. Data integrity verification protocols enable verifiers to verify remote data integrity by employing sample auditing and homomorphic authenticators without downloading outsourced data. The existing fuzzy identity-based public verification schemes have multiple security vulnerabilities, which are easily exploited by malicious participants to attack the security of the scheme, posing a great threat to the practical application of the scheme. In the paper, we give a secure fuzzy identity-based public verification scheme that simultaneously supports fuzzy identity-based public verification and resists the attacks by various involved parties. In addition, the security and usability of the scheme are verified by detailed security proofs and implementations. Compared with existing fuzzy identity-based public verification schemes, our scheme fixes the security vulnerabilities of fuzzy identity-based public verification schemes and provides stronger security. [ABSTRACT FROM AUTHOR]

Abstract: In order to supply better service for network customers, deeply analyzing customers’ behavior is required. This paper extracts three features from customers’ network behavior which is divided into different categories, such as browsing news, downloading shared resources and real-time communications etc. Support vector machine is used to perform clustering, thanks to its fast and valid executing, especially in the situation of small datasets. Using the analysis results, we can make our applications and services more personalized and easier to be used. [Copyright &y& Elsevier]

Abstract: Users face the information overload problem when downloading applications in markets. This is mainly due to (i) the increasing unmanageable number of applications and (ii) the lack of an accurate and fine-grained categorization of the applications in the markets. To address this issue, we present an integrated solution which recommends to the users applications by considering a big amount of information: that is, according to their previously consumed applications, use pattern, tags used to annotate resources and history of ratings. We focus this paper on the service for monitoring users’ interaction. [Copyright &y& Elsevier]

Abstract: The software industry is in the middle of a paradigm shift from desktop to mobile and web-based software. In the new era, applications increasingly live on the Web as services that lend themselves for runtime configuration. The associated delivery model, referred to on-demand software, or Software-as-a-Service (SaaS), implies that applications do not require installation or manual upgrades by the end users, as they are loaded on the fly. Furthermore, applications that build on resources offered by other applications, referred to as mashups, offer increasingly interesting opportunities. We believe that the trend towards using the web as an application platform will only strengthen in the future, and that instead of individual applications, it will also be possible to use application components in the same way we today download complete applications – in essence the Web is used as an architecture and transport for distributed applications, similarly to e.g. Corba at the level of principal idea. In this paper, we provide an overview for mashware computing, where downloadable components form applications in a piecemeal fashion, and enable rich access to resources of devices in a programmer-friendly way. Furthermore, applications can be easily built by components created by others and available as services. Finally, we demonstrate the capabilities of the concept with a sample application and discuss the lessons learned during the design process. [Copyright &y& Elsevier]

Abstract: In order to facilitate Bluetooth function realization and information can be effectively tracked in the process of production, the vehicle Bluetooth hands-free devices need to download such key parameters as Bluetooth address, CVC license and base plate numbers, etc. Therefore, it is the aim to search simple and effective methods to download parameters for each vehicle Bluetooth hands-free device, and to control and record the use of parameters. In this paper, by means of Bluetooth Serial Peripheral Interface programmer device, the parallel port is switched to SPI. The first step is to download parameters is simulating SPI with the parallel port. To perform SPI function, operating the parallel port in accordance with the SPI timing. The next step is to achieve SPI data transceiver functions according to the programming parameters of options. Utilizing the new method, downloading parameters is fast and accurate. It fully meets vehicle Bluetooth hands-free devices production requirements. In the production line, it has played a large role. [Copyright &y& Elsevier]

Abstract: The paper illustrates the process of developing and implementing teaching platform for documentation retrieval course based on WEB. The whole platform adopts B/S structure to design, whose language is ASP and whose database is SQL Server 2000. The platform is to help students broaden learning approaches and their view to some degree, strengthen students’ self-study ability and independency and enlarge their free space of study. The platform implements login by system administrator, teacher and student. After login, they can operate according to their corresponding roles and authority. The principal functions implemented in the platform include user management, files upload and download, announcement management, answer question online and interactive communication. [Copyright &y& Elsevier]

Abstract: Mashups that combine data from numerous web sites into an integrated experience have rapidly become state-of-the-practice way to develop new compelling applications. However, their use has been somewhat restricted, since it is common that such applications can only be run inside the browser, not in a fashion where they would be directly associated with operating system concepts. Consequently their access to the resources of the hosting system has been limited, which forms a practical obstacle for numerous applications that could benefit from e.g. context information available in mobile context. The limitations are not something that is a fundamental restriction of web technologies, but only related to the existing implementations. In this paper, we show how we have implemented a mashup desktop, where applications that download data – and even complete web applications – from the web can be used in the same way as thumbnails are commonly used. Furthermore, instead of being static, the thumbnails can be alive in a fashion that has been made popular by newer desktop systems, such as Windows 7. The implementation is based on our earlier research on composing applications using JavaScript, the Qt framework, and the K Desktop Environment, whose innovative combination has been an enabler for this work. [Copyright &y& Elsevier]

Abstract: This paper describes the extension work from the last Digital Holography Projector System. From the developed works shows that, some unforeseen factors have created the difficulties for the system alignment. Such factors are the DMD frame rate, light source and diffractive zero order. It is really the challenging development works to achieve the virtual 3D model display on the high speed rotation screen. The three most key factors are emphasizing: 1) The display device''s frame rate; 2) The light source orientation angle; and 3) The zero order filtering optic. 1) This device''s is the digital micro mirror, in short is DMD. It is the high speed switching device has developed by the most recent technology. The switching frame rate can go up as high as 291fps. At first, the 8 bits depth file must be digitalized and stored for DMD onboard Ram. The digitalized data are transmitting from the PC USB to DMD onboard Ram. Instead of the data are downloading directly from the PC to DVI or VGA during display, this downloading method cause slower down the display speed, which is the common frame rate of 30Hz. Next, the onboard Ram data then transfer to the DMD mirror''s for display, at the 8 bits 291 fps speed. At this frame rate, the display 2D image can almost cover for 10 of out of the 360 0 in 1 revolution. 2) This laser light source must be installed such that free for orientated in any arbitrary angle from 220 to 450. Which is normalized to the DMD mirrors and the brief sketch show on figure (a). The purpose of orientated the light source is ensure that multi diffractive order would be reflected straight from the mirrors. (This multi diffractive order is the phenomenon of the digital micro mirror''s characteristic). This mean, the reconstruct images would be followed the DMD normalized direction reflected up to fibre conduit. Moreover, this orientated method install of the laser light source is making space for other optical lenses or device driver/controller. Because, all equipments and components can be easy line up and mounted in the compartment. 3) This solid 6mm diameter fibre conduit is implemented to transmit the higher diffractive image, it is also the brightest and clearer image as compare to other lower order images. This means many of the lower order and blurred images would be neglected for display and consider as the energy lost. [Copyright &y& Elsevier]

Abstract: In recent years, the P2P (peer to peer) application has been the main research focus and has been gaining popularity for the download of large sized content such as multimedia resources. A great deal of P2P users, especially young students, have started to operate in broadband and campus networks. P2P applications then have a critical problem because they consume too much network bandwidth, causing trouble for other applications such as mail, news, search engines as well as E-commerce (Electronic Commerce). Thus, how to facilitate the side-effects of P2P applications will be one of the most important research topics for network or E-commerce managers. In this paper, merging technology and management, we propose a comprehensive scheme to the problem above. This scheme consists of P2P traffic control, P2P port blockage, P2P download incentive measure and improvement of P2P data piece selection. An example of a BT (BitTorrent) download shows that the scheme can not only reduce average access time and increase download speed when compared with the existing BT peer selection process with randomly selected peers. In a word, the scheme can help to insure less infection of E-commerce from P2P applications. [Copyright &y& Elsevier]

Abstract: The performance of a focused, or topic-specific Web robot can be improved by taking into consideration the structure of the documents downloaded by the robot. In the case of HTML, document structure is tree-like, defined by nested document elements (tags) and their attributes. By analysing this structure, a robot may use the text of certain HTML elements to prioritise documents for downloading and thus significantly improve the speed of convergence to a topic. Clear separation of the structure-aware document parser from the download scheduler provides flexibility but requires a standard interface and protocol between the two. The paper discusses such an interface in the context of an experimental Web robot, whose speed of convergence to a topic was observed to increase by a factor of 3 to 8, as measured by the number of documents downloaded to reach a given average relevance score. [ABSTRACT FROM AUTHOR]

Abstract: The video communication requires considerable large bandwidth – a scarce resource and thus it needs be used efficiently. It can be traded for buffer storage, i.e. for maintaining more buffer storage the data downloading rate (bandwidth) can be reduced. In order to transmitting the videos, they are divided into segments and the bandwidth of the physical channel is divided into logical channels. A logical channel transmits only one segment of each video. When there is switching of the segments, some time delay, called jitter delay, occurs. The jitter delay, being independent, memoryless, and positive, can be modeled as exponentially distributed random variable. In this paper, we propose a stochastic model incorporating jitter delay for estimating the storage space required in the user’s system in order to maintain continuous delivery of the video data to the users. [Copyright &y& Elsevier]

Abstract: Measuring association among variables is an important step for finding solutions to many data mining problems. An existing metric might not be effective to serve as a measure of association among a set of items in a database. In this paper, we propose two measures of association, A 1 and A 2. We introduce the notion of associative itemset in a database. We express the proposed measures in terms of supports of itemsets. In addition, we provide theoretical foundations of our work. We present experimental results on both real and synthetic databases to show the effectiveness of A 2. [Copyright &y& Elsevier]

Abstract: In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus, if such an algorithm were given the entire input in advance, it could give an optimal solution (in exponential time). Instead of giving the algorithm more knowledge about the input, in this paper we consider the effects of giving an online bin packing algorithm larger bins than the offline algorithm it is compared to. We give new algorithms for this problem that combine items in bins in an unusual way, and give bounds on their performance which improve upon the best possible bounded space algorithm. We also give general lower bounds for this problem which are nearly matching for bin sizes . [Copyright &y& Elsevier]

• We propose a multi-user updatable encryption scheme, in which a data owner can update the remote ciphertext to a new group of users. • We adopt the multi-user updatable encryption to construct a secure deduplication scheme supporting lightweight user revocation. • Our proposed deduplication scheme saves communication and computation costs dramatically. Secure deduplication is a promising solution to greatly reduce the storage space of the cloud. However, the encryption key is deterministically derived from the plaintext, such that who owns the plaintext has the derived key to decrypt the ciphertext. Therefore, how to revoke a user in deduplication schemes is a critical challenge. In the existing work, when updating the data authority, the data owner has to download the data from the cloud, decrypt, re-encrypt and finally upload them to the cloud. This process increases the communication and computation overheads. In this paper, we first propose a multi-user updatable encryption scheme. Specifically, the data owner can update the remote ciphertext under a new group key by sending an update token to the cloud. Then we adopt this technique to propose a new secure deduplication scheme supporting efficiently revoking an unauthorized user. In our scheme, the data owner just needs to send a token to the cloud to update the data authority, which saves the communication and computation costs. The security and efficiency analysis demonstrate that our proposed deduplication scheme can achieve the desired security properties with high efficiency. [ABSTRACT FROM AUTHOR]