With the development of Internet, Email has become an important interaction manner. At the same time, spam becomes a boring thing in our life, and people pay more and more attention to spam filter. In this paper, we p...
详细信息
With the development of Internet, Email has become an important interaction manner. At the same time, spam becomes a boring thing in our life, and people pay more and more attention to spam filter. In this paper, we propose a method that uses N-Gram to calculate characters and uses X statistical method to extract characters, and then uses incremental Native Bayes arithmetic to hold up spam. In order to arise accuracy we use the filter method over and over again. The experiments show that our method is very effective, which greatly raises the accurarcy while keeping a minor error ratio.
Quality of Experience (QoE) combines non-technical parameters such as user perception, experience and expectations with technical parameters such as application- and network-level Quality of Service (QoS). For service...
详细信息
Quality of Experience (QoE) combines non-technical parameters such as user perception, experience and expectations with technical parameters such as application- and network-level Quality of Service (QoS). For service or network providers, it is important to understand the quantitative relationship between QoE and these technical parameters in order to manage the user-perceived quality. This paper investigates the different impacts of a) provisioning and b) delivery problems due to insufficient resources on QoE, leading to the QoE provisioning-delivery hysteresis (QoE-PDH). We demonstrate the QoE-PDH for Voice-over-IP, live video streaming, and web browsing based on existing measurement studies. The results clearly quantify the necessity to control quality, instead of suffering from uncontrollable impacts like packet loss caused by congestion. The implementation and the limitations of the QoE-PDH in the current Internet is shown using the example of Skype. Afterwards we discuss how these results can be used to enhance energy-efficient service provisioning and delivery in the Future Internet.
As more and more Web applications emerging on sever end today, the Web browser on client end has become a host of a variety of applications other than just rendering static Web pages. This leads to more and more perfo...
详细信息
As more and more Web applications emerging on sever end today, the Web browser on client end has become a host of a variety of applications other than just rendering static Web pages. This leads to more and more performance requirements of a Web browser, for which user experience is very important. This situation may become more urgency when on handheld devices. Some efforts like redesign a new Web browser have been made to overcome this problem. In this paper, we address this issue by optimizing the main processes of the Web browser on a state-of-the-art 64-core architecture, Godson-T, which was developed at Chinese Academy of sciences, as multi-/many-core architecture to be the mainstream processor in the upcoming years. We start a new core to process a new tab when facing up to intensive URL requests, and we use scratch-pad memory (SPM) of each core as a local buffer to store the HTML source data to be processed to reduce off-chip memory access and exploit more data locality, otherwise, we use DTA to transfer HTML data for backup. Experiments conducted on the cycle-accurate simulator show that, starting each tab process by a new core could obtain 5.7% to 50% speedup with different number of cores used to process corresponding URL requests, with on-chip scratchpad memory of each core used to store the HTML data, more speedup could be achieved when number of cores increase. Also, as Data Transfer Agent (DTA) used to transfer the HTML data, the backup of HTML data can get 2X to 5X speedups according to different data amount.
In the mountain torrent disaster warning system, how to use high-performance embedded microcontroller controller and low consumption technology are the key problem. This paper designs a wireless sensor network (WSN) t...
详细信息
Dynamic Binary Translation (DBT) has been widely used in various applications. Although new architectures and micro-architectures often create performance opportunities for programmers and compilers, such performance ...
详细信息
ISBN:
(纸本)9781612843568
Dynamic Binary Translation (DBT) has been widely used in various applications. Although new architectures and micro-architectures often create performance opportunities for programmers and compilers, such performance opportunities may not be exploited by legacy executables. For example, the additional general-purpose and XMM registers in the Intel64 architecture do not benefit the IA-32 binaries. In this paper, we designed and developed a DBT system to dynamically promote stack variables in the source binaries to the additional registers of the target architecture. One of the most challenging problems is how to deal with the possible but rare memory aliases between promoted stack variables and other implicit memory references. We devised a runtime alias detection approach based on the page protection mechanism in Linux and a novel stack switching method to catch memory aliases at run-time. This approach is much less expensive than traditional approaches like inserting address checking instructions. On an Intel64 platform, our DBT system with speculative stack variable promotion has sped up several SPEC CPU2006 benchmarks in IA-32 code, with the largest performance gain over 45%.
Abstract A group of satellites can be classified as a constellation, formation or cluster. Multiple coordinated satellites are described as a formation, if a closed-loop control is adjusted, thus providing a coordinat...
Abstract A group of satellites can be classified as a constellation, formation or cluster. Multiple coordinated satellites are described as a formation, if a closed-loop control is adjusted, thus providing a coordinated motion control on basis of their relative positions to preserve the topology (Schilling [2009]). This technology enables various application scenarios, for example, interferometry or in-orbit servicing and it is subject to multiple technological requirements related to formation flying, limited resources or scientific payloads. In the framework of the feasibility study NaKoFo, this paper discusses the potential benefits, drawbacks and problems associated with intersatellite links and relative navigation with pico- and nanosatellites. The requirements of an intersatellite link are analyzed based on frequency, modulation, antenna, power and network protocol. A short overview of adequate communication systems for pico- and nanosatellites is also presented. Technologies for relative position determination are presented and discussed regarding their applicability in small satellite systems as well as their requirements on an intersatellite link.
Web workloads are known to vary dynamically with time which poses a challenge to resource allocation among the applications. In this paper, we argue that the existing dynamic resource allocation based on resource util...
详细信息
Web workloads are known to vary dynamically with time which poses a challenge to resource allocation among the applications. In this paper, we argue that the existing dynamic resource allocation based on resource utilization has some drawbacks in virtualized servers. Dynamic resource allocation directly based on real-time user experience is more reasonable and also has practical significance. To address the problem, we propose a system architecture that combines real time measurements and analysis of user experience for resource allocation. We evaluate our proposal using Webbench. The experiment results show that these techniques can judiciously allocate system resources.
We derive an instantaneous (per-round) data-dependent regret bound for stochastic multiarmed bandits with side information (also known as contextual bandits). The scaling of our regret bound with the number of states ...
详细信息
ISBN:
(纸本)9781618395993
We derive an instantaneous (per-round) data-dependent regret bound for stochastic multiarmed bandits with side information (also known as contextual bandits). The scaling of our regret bound with the number of states (contexts) N goes as NIpt(S;A)~1/2, where I_pt(S;A) is the mutual information between states and actions (the side information) used by the algorithm at round t. If the algorithm uses all the side information, the regret bound scales as N In K~1/2, where K is the number of actions (arms). However, if the side information I_pt(5;A) is not fully used, the regret bound is significantly tighter. In the extreme case, when I_pt (S;A) = 0, the dependence on the number of states reduces from linear to logarithmic. Our analysis allows to provide the algorithm large amount of side information, let the algorithm to decide which side information is relevant for the task, and penalize the algorithm only for the side information that it is using de facto. We also present an algorithm for multiarmed bandits with side information with O(K) computational complexity per game round.
Localized defects of gearbox tend to result in periodic impulses in the vibration signal, which contain important information for system dynamics analysis. So parameter identification of impulse provides an effective ...
详细信息
暂无评论