Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 12 papers published in subject: > since this site started. |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. Optimizing data drilling with the user interaction weighted minimum description length principle | |||
Tao Fang,Shen Qiwei,Li Wei,Xu Tong | |||
Computer Science and Technology 13 December 2018 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Interaction exploration is an effective way to obtain potential information from the treemap that visualized large-scale data. Data exploration techniques that has been proposed (such as translation and scaling on a two-dimensional plane) provide limited context information only or provide excessive distortion. Query was proposed to get interested view, but it need clear destination. The method that get a detailed view according to scores evaluated by user interaction can\'t get a suitable initial view. To this, we propose an interactive exploration method that performs unbalanced weighting according to the user's focus and uses the minimum description length principle (MDL) for node aggregation. This method can freely expand the focus area in a good degree of aggregation, which can provide the necessary data information and reduce the visual confusion caused by the excessive data set. This enables efficient data mining in large-scale datasets. We further verify the availability of method by experiment. In addition, the interaction mode in this paper has no conflict with the existing interaction modes (such as zooming, rotating, etc.), and the better results can be achieved by selectively combining according to different scenarios. | |||
TO cite this article:Tao Fang,Shen Qiwei,Li Wei, et al. Optimizing data drilling with the user interaction weighted minimum description length principle[OL].[13 December 2018] http://en.paper.edu.cn/en_releasepaper/content/4746669 |
2. Learning to Query: Deep Learning Based Method for Improving Join Query in Hive | |||
Lixiang Huang,Tong Xu,WeiLi,Lei Zhang | |||
Computer Science and Technology 12 December 2018 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Improving join query is crucial for efficiency of processing queries over big data. Hive is a batch-oriented big data management engine that is well suited for data analysis and mining. In this paper, we introduced an innovative method to improve join query in Hive, from the perspective of users. In this solution, users only need to configure the entity attributes, filtering rules and join rules between the entities in the visual operation interface, and our intelligent model can decide the optimal query plan and execute it. We proposed a graph-based SQL generation model to generate Hive-based query plans for complex join query, and use deep learning technique LSTM for query cost prediction so as to pick out the optimal query plan. Moreover, through a comprehensive set of experiments, we demonstrate that our proposed method performs well and significantly improves join query in Hive. | |||
TO cite this article:Lixiang Huang,Tong Xu,WeiLi, et al. Learning to Query: Deep Learning Based Method for Improving Join Query in Hive[OL].[12 December 2018] http://en.paper.edu.cn/en_releasepaper/content/4746691 |
3. Approximate CTL model checking | |||
ZHU Weijun | |||
Computer Science and Technology 21 June 2018 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The state explosion problem restrict the further applications of Computational Tree LogicCTL model checking. To this end, this study tries to seek an acceptable approximate solution for CTL model checking by introducing the Machine Learning (ML) technique, and a method for predicting results of CTL model checking via the Boosted Tree (BT) algorithm is proposed in this paper. First, for a number of Kripke structures and CTL formulas, a data set A containing model checking results is obtained, using the existing CTL model checking algorithm. Second, the CTL model checking problem can be induced to a binary classification problem of machine learning. As a result, an approximate CTL model checking technique occurs. The experiments show that the new method has the average accuracy of 96%, and its average efficiency is 210 times higher than that of the representative model checking method, if the length of each of CTL formulas equals to 500.These results indicate that the new method can quickly and accurately determine results of CTL model checking for a given Kripke structure and a given long CTL formula since the new method avoid the famous state explosion problem. | |||
TO cite this article:ZHU Weijun. Approximate CTL model checking[OL].[21 June 2018] http://en.paper.edu.cn/en_releasepaper/content/4745478 |
4. Improved Rectangle Attack on SMS4 Reduced to 18 Rounds | |||
Kong Xianglong ,Wang Wei ,XU Qiuliang | |||
Computer Science and Technology 31 August 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:SMS4 is a 32-round block cipher with 128-bit block size and 128-bit secret key. It is used in WAPI, the Chinese WLAN national standard. This paper analyzes the security of SMS4 against the rectangle attack. First, this paper describes two properties of SMS4. Next, it proposes the 16-round rectangle distinguisher with probability 2^-250. Finally, the rectangle attack is then carried out on 18-round SMS4 with 2^127 chosen plaintexts and the time complexity is 2^103.83 18-round encryptions. In this process a hash table is used to reduce the time complexity. This attack is the best rectangle attack on SMS4 so far. | |||
TO cite this article:Kong Xianglong ,Wang Wei ,XU Qiuliang. Improved Rectangle Attack on SMS4 Reduced to 18 Rounds[OL].[31 August 2013] http://en.paper.edu.cn/en_releasepaper/content/4557323 |
5. Truthful Mechanisms for Randomized Rounding Approximation Schema | |||
WU Jing,BU Tianming | |||
Computer Science and Technology 26 February 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Algorithmic mechanism design, as an important research area in the theoretical computer science in recent years, is not only to give an efficient algorithm for the given problem, but also to prevent the rational agents from manipulating the input date for the problem. For many NP-hard problems, there have been a lot of good approximation algorithms. So, it’s a new task for us to design truthful mechanisms with the same approximation ratios for these NP-hard problems. This paper focuses on a large family of approximation algorithms based on the technique of randomized rounding which combines the techniques of randomized algorithms and linear/semi-definite programming. By giving an exact characterization of the randomized truthful mechanisms, the paper presents a general framework to efficiently transfer the family of approximation algorithms to the truthful mechanisms without a loss of approximation ratio. | |||
TO cite this article:WU Jing,BU Tianming. Truthful Mechanisms for Randomized Rounding Approximation Schema[OL].[26 February 2013] http://en.paper.edu.cn/en_releasepaper/content/4523793 |
6. Symmetric Bayesian-Nash Equilibrium of Simultaneous Vickrey Auctions with Perfect Substitutes | |||
Bu Tianming,Qi Qi | |||
Computer Science and Technology 08 January 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This paper studies the model that there are two simultaneous one-round sealed-bid second-price/Vickrey auctions. Each auction sells on eidentical object. For each bidder, there is no extra benefit from winning more than one object. This model is in spired by the similar phenomenon appears pervasively on eBay which is the world’s largest online marketplace for businesses and consumers to auction off goods through it. The paper focuses on the buyers’s trategic behavior in this model. The symmetric Bayesian-Nash equilibria under several constraints are characterized. In addition, the expected total revenue under the symmetric Bayesian-Nash equilibrium of simultaneous Vickrey auctions is analyzed. | |||
TO cite this article:Bu Tianming,Qi Qi. Symmetric Bayesian-Nash Equilibrium of Simultaneous Vickrey Auctions with Perfect Substitutes[OL].[ 8 January 2013] http://en.paper.edu.cn/en_releasepaper/content/4509967 |
7. VECTOR-MATRIX MULTIPLICATION IN TERNARY OPTICAL COMPUTER | |||
JIN Yi,WANG Xianchao,PENG Junjie,SHEN Zhangyi,OUYANG Shan | |||
Computer Science and Technology 21 February 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This paper proposes a new means to complete the optical vectormatrix multiplication (OVMM). The OVMM is implemented on a novel optical computing architecture, ternary optical computer (TOC) by using modified signed-digit (MSD) number system. In addition, this study realizes optical addition in three steps, independent of the length of the operands, by four transformations in MSD, and discuses the multiplication of two MSD numbers in detail. A preliminary experimentation about the OVMM is performed on TOC. It illustrates the proposed method for OVMM is feasible and correct. | |||
TO cite this article:JIN Yi,WANG Xianchao,PENG Junjie, et al. VECTOR-MATRIX MULTIPLICATION IN TERNARY OPTICAL COMPUTER[OL].[21 February 2012] http://en.paper.edu.cn/en_releasepaper/content/4467258 |
8. RESEARCH ON CREDIBILITY TECHNOLOGY IN SERVICE ENGINEERING | |||
YANG ZhiFang,YU YanHua,ZHU ChaoPing,XIAO Shan | |||
Computer Science and Technology 13 December 2011 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract: With the development of the Internet world, the service itself and the service environment are becoming more and more complex, service system which bases on service composition faces many new challenges, especially the security of services has become an important research problems. Typically, the service's credibility refer to the behavior and the result of the service are consistent with users' expectations, and its extension including availability, reliability, integrity, maintainability and survivability of service and so on. Intemet's attribute of openness, autonomy and free distribution of central control, heterogeneous and dynamic features of service system itself increase the difficulty of credibility. Relying solely on common services engineering method has been difficult to adapt to the credibility of security requirements.Therefore,we need apply related trusted computing technology to service engineering methodology,and security trust mechanisms should also be added, to dynamically protect the credibility of the service system. | |||
TO cite this article:YANG ZhiFang,YU YanHua,ZHU ChaoPing, et al. RESEARCH ON CREDIBILITY TECHNOLOGY IN SERVICE ENGINEERING[OL].[13 December 2011] http://en.paper.edu.cn/en_releasepaper/content/4455559 |
9. Small Universal Tissue P Systems with Symport/Antiport Rules | |||
ZHANG Xingyi,LUO Bin,PAN Linqiang | |||
Computer Science and Technology 29 November 2011 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this note, we consider the problem of looking for small universal one-symbol tissue P systems with symport/antiport rules.It is proved that six cells suffice to generate any recursively enumerable set of natural numbers by such a one-symbol tissue P systemwith symport/antiport rules,under the restriction that only one channel is allowed between two cells or between a cell and the environment.As for the case of allowing two channels between a cell and the environment,it is shown that the computational completeness can be obtained by one-symbol tissue P systems with symport/antiport rules having at most five cells.These results partially answer an open problem formulated by Artiom Alhazov, Rudolf Freund and Marion Oswald. | |||
TO cite this article:ZHANG Xingyi,LUO Bin,PAN Linqiang. Small Universal Tissue P Systems with Symport/Antiport Rules[OL].[29 November 2011] http://en.paper.edu.cn/en_releasepaper/content/4452660 |
10. Smaller Universal Spiking Neural P systems | |||
Zhang Xingyi ,Zeng Xiangxiang,Pan Linqiang | |||
Computer Science and Technology 29 October 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The problem of finding small universal spiking neural P systems was recently investigated by Andrei Puǎn and Gheorghe Pǎun,for spiking neural P systems used as devices computing functions and as devices generating sets of numbers. For the first case, a universal spiking neural P system was produced by using 84 neurons for standard rules and using 49 neurons for extended rules. For spiking neural P systems used as generators of sets of numbers, a universal system with standard rules having 76 neurons, and one with extended rules having 50 neurons were obtained. In this paper, we continue the study of small universal spiking neural P systems and we improve in the number of neurons as follows. The small universal spiking neural P systems use 67 neurons for standard rules and 41 neurons for extended rules in the case of computing functions, and 63 neurons for standard rules and 41 neurons for extended rules in the case of generating sets of numbers. | |||
TO cite this article:Zhang Xingyi ,Zeng Xiangxiang,Pan Linqiang. Smaller Universal Spiking Neural P systems[OL].[29 October 2008] http://en.paper.edu.cn/en_releasepaper/content/25248 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated