Select Subject

All (8831)

Agronomy (158)

Animal Husbandry,... (64)

Aquatic Science (16)

Astronomy (36)

Aviation (22)

Basic Medicine (184)

Biology (504)

Chemical Engineering (103)

Chemistry (635)

Civil and Archite... (105)

Clinical Medicine (236)

Computer Science ... (924)

Dynamic and Elect... (121)

Earth Science (119)

Economics (67)

Education (31)

Electrics, Commun... (927)

Energy Science an... (67)

Engineering and T... (15)

Environmental Sci... (140)

Food Science and ... (63)

Forestry (36)

Hydraulic Enginee... (40)

Mechanics (240)

Metallurgical Eng... (32)

Mine Engineering ... (38)

Nuclear Science a... (21)

Pharmacy (98)

Physics (920)

Preventive Medici... (37)

Psychology (20)

Security Science ... (17)

Sports Science (6)

Surveying and Map... (15)

Textile Science a... (16)

Traditional Chine... (56)

Transportation En... (57)

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. 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


	3. 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

Select/Unselect all

For Selected Papers

Saved Papers

Please enter a name for this paper to be shown in your personalized Saved Papers list

Rank

Alert Name:
Alerting to:
Authentication email will be sent to your email address in 24 hours
Frequency:
Email Message Format:	Plain text Graphical(HTML)

Complete the form below and we will recommend the selected titles to your friends on your behalf. * Indicates a required field.
Your name*:
Your email address*:
Recipient's name*:
Recipient's email address*:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find the page(s) useful.

Your name:
Your email address:
Recipient's name:
Recipient's email address:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find this page useful.

Disclaimer: This message was sent to your friend using the "Send it to a friend" facility on the Sciencepaper Online’ WWW site, http://www.paper.edu.cn/en. The Sciencepaper Online is not responsible for the content of this email, and anything said in this email does not necessarily reflect the Sciencepaper Online's views.

	Check out RSS, or use RSS reader to subscribe this item