Select Subject

All (8830)

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. A Database Architecture of E-commerce System with High Availability and Scalability based on MySQL and Redis
	CUI Yansong,BAI Chunyu
	Computer Science and Technology 11 January 2021
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:With the continuous development of e-commerce systems, data storage has become a crucial technology in this era, and building a database environment with high-availability has become an urgent demand of many enterprises. In order to prevent web application crashes caused by database server downtime, this paper proposes a database architecture of e-commerce system with high availability and scalability based on MySQL and Redis. The architecture implements read-write separation and automatic switching when the server goes down to ensure high availability of e-commerce systems. It uses the sentinel to build Redis cluster, while reducing database access pressure and preventing cache invalidation caused by Redis server downtime. It builds a database cluster based on MySQL replication, which can ensure real-time synchronization and disaster recovery of data between database servers and improve scalability of system. Finally, this paper implemented an e-commerce system based on this architecture.
	TO cite this article:CUI Yansong,BAI Chunyu. A Database Architecture of E-commerce System with High Availability and Scalability based on MySQL and Redis[OL].[11 January 2021] http://en.paper.edu.cn/en_releasepaper/content/4753448


	2. The Research on Web AR Avatar Generation System
	Feng Jingyi,Liao Jianxin
	Computer Science and Technology 13 February 2020
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:With the development of virtual reality and augmented reality (AR) technology, new types of social media continue to emerge and develop rapidly. One of the most important technologies of these social media applications is to generate a virtual image similar to that for users. Existing virtual image generation technologies are mainly divided into methods based on 3D scanning equipment and methods based on model library matching. Among them, the method based on the three-dimensional scanning device has high requirements on the device, which is not convenient to use and popularize; and the method based on the model library matching method has small individual differences in results. In order to solve the shortcomings of the existing methods, this paper proposes a method for directly generating a virtual image based on a two-dimensional image and generates an exclusive virtual image with personal characteristics for the user.This paper proposes a virtual image generation method based on web 3D face reconstruction and 3D model texture reconstruction. Use Tensorflow.js to transform the trained deep learning model into a format that can be recognized by the browser and predict the 3D face information and facial feature points on the web. Then, based on Delaunay triangulation and image affine transformation, a virtual image texture is generated for the model.The experimental results show that the method proposed in this paper can generate personalized and exclusive three-dimensional avatars based on the user's two-dimensional face information. It provides a feasibility reference for web-based virtual image related research.
	TO cite this article:Feng Jingyi,Liao Jianxin. The Research on Web AR Avatar Generation System[OL].[13 February 2020] http://en.paper.edu.cn/en_releasepaper/content/4750730


	3. A Verilog Precompiler for Interactive Optimization of IP Core Design
	Donghua Wang,Yibo Fan,Kenny Q. Zhu,Wenjing Fang
	Computer Science and Technology 20 December 2015
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:SV+ is an interactive compiler that makes circuit designer do trade-offs between resource consuming and time cost easily, without rewriting the source code. A set of succinct SV+ syntaxes are proposed in this work. They can be used to embed with Verilog to describe the reconfigurable parts of a circuit. Users have opportunity to select optimization options during the compiling process. The compiler generates Verilog RTL codes, depends on these choices. And for different optimization choices, the circuits vary in architectures besides in time and resource. SV+ syntaxes can describe reconfigurable circuit structures in mathematical or functional level, so designers are liberated from putting much effort on concerning about module scheduling and wire connection. Unlike other circuit compilers, for example DFT compiler[13], which work on single kind of algorithm, SV+ syntaxes can be used in a range of Verilog programs as long as there are any reconfigurable components available in the design.
	TO cite this article:Donghua Wang,Yibo Fan,Kenny Q. Zhu, et al. A Verilog Precompiler for Interactive Optimization of IP Core Design[OL].[20 December 2015] http://en.paper.edu.cn/en_releasepaper/content/4666319


	4. Possibilistic Kripke Structure Decision Processes
	XUE Yan,LEI Hongxuan,LI Yongming
	Computer Science and Technology 14 November 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:We propose the concept of possibilistic Kripke structure decision process (PKSDP), PKSDP is a generalization of possibilistic Kripke structure (PKS), useful for modeling and quantifying the possible outcomes of random actions. We define the path in a PKSDP, scheduler, PKS of a PKSDP induced by a scheduler, memoryless scheduler, present the theory of reachability possibilities. We also address some examples of PKSDPs, Finally, we discuss the existence of optimal memoryless schedulers and value iteration for step-bounded reachability properties.
	TO cite this article:XUE Yan,LEI Hongxuan,LI Yongming. Possibilistic Kripke Structure Decision Processes[OL].[14 November 2011] http://en.paper.edu.cn/en_releasepaper/content/4449954


	5. An Overview of Mobile Information Presentation Techniques
	FENG Ling,QIAO Lin
	Computer Science and Technology 04 January 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The popularity of hand-held mobile devices is growing. Compared with traditional desktop computers, these mobile devices have distinct limitations, including tiny display, low resolution, scarce computing resources, bandwidth fluctuation, ad-hoc communication, voluntary disconnection, etc., presenting new challenges to mobile human-computer interaction. In this survey paper, we overview some recently developed techniques for diverse information presentation on mobile devices through visual, audio, and tactile channels.
	TO cite this article:FENG Ling,QIAO Lin. An Overview of Mobile Information Presentation Techniques[OL].[ 4 January 2011] http://en.paper.edu.cn/en_releasepaper/content/4403669


	6. Visualizing Java Software Structure and Evolution
	Zhao Haizhou ,Ye Qi
	Computer Science and Technology 15 December 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Knowing the overall structure of software is important for program understanding. Packages represent the coarse-grained structure of a software system. For the sake of program comprehension, in this paper we show the software evolution process through dynamic visualizing the package dependencies by using directed graphs. Through visualizing the evolution of package dependencies, programmers can get a better understanding of what the legacy system is trying to do and when it is trying to change. We also propose a methodology, which is based on the connectivity of packages in the network, to get the roles of different packages more measurable. Through this method, we can get the common used packages and specialized packages easily. We can get the overall dependency and packages roles more intuitively through visualization, and then we can get grasp the overall structure of the system.
	TO cite this article:Zhao Haizhou ,Ye Qi . Visualizing Java Software Structure and Evolution[OL].[15 December 2010] http://en.paper.edu.cn/en_releasepaper/content/4397377


	7. A High Performance Algorithm for Mining Frequent Patterns:LPS-Miner
	Xiaoyun Chen,Huiling Liu,Pengfei Chen,Longjie Li
	Computer Science and Technology 02 September 2008
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, we present a novel data-mining algorithm, called LPS-Miner, to mine the complete frequent patterns in the transaction database. LPS-Miner algorithm bases the pattern growth principle and uses two new data structures, LPS-FP-Tree (Light Partial-Support FP-Tree) and LPS-Forest (Light Partial-Support FP-Tree Forest) to present the database. LPS-FP-Tree is a variation of FP-Tree with lighter and unidirectional nodes and mining process depends on partial-support of the patterns. The algorithm adopts partition and divide-and-conquer strategies in maximum, which decomposes the mining task into a set of smaller tasks. The light data structure and the efficient memory management mechanism keep the memory usage stable and efficient. Moreover, other implementation-based optimizations, such as pruning and outputting-optimization, make the algorithm achieve high efficiency. We test our c++ implementation of this algorithm versus several other algorithms on four datasets. The experimental results show that our algorithm has better space and time efficiency.
	TO cite this article:Xiaoyun Chen,Huiling Liu,Pengfei Chen, et al. A High Performance Algorithm for Mining Frequent Patterns:LPS-Miner[OL].[ 2 September 2008] http://en.paper.edu.cn/en_releasepaper/content/23675

Select/Unselect all

For Selected Papers

Saved Papers

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

Third-level Subject

All Environment and Devel...(1)
Compiling System(3)
Database(14)
Operating System and Oper...(1)
Other Subjects of Compute...(4)
Programming and Languages(10)
Software Engineering(13)
Software Theory(10)

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