Abstract:This paper proposes several factors for computational models of early child language acquisition, giving a better explanation on how external language input and intrinsic parameter affect learning, comprehension and production of simple syntax. Taking a model simulating transition from one-word stage to two-word stage (O2T) as beginning, the paper gives quantitative simulation based investigations on how the language input and parameter affect the volume of system (i.e. how much is learned) and evaluation output (i.e. how well the learned can be used by the system to comprehend or produce simple syntax). Factors including contributing word, related string/concept and critical abstract factor, have been figured out to uncover underlying reasons. Contributing words bring syntax information from language input to the system; related strings/concepts relate the learned syntax to new syntax; and abstract factor is crucial for the ability of generative learning. Experiment results show that contributing word and related string/concept have much greater influence respectively on the volume of system and evaluation output, compared to other information the language input contains. Jointly with related string/concept, critical abstract factor controls evaluation output. And there exists value ranges of critical abstract factor for the occurrence of under-extension and over-extension. After that, the paper makes similar investigation on MOSAIC (i.e. a mature and widely-accepted computational model of syntax acquisition), and get similar results, which indicate some degree of generality of the factors. In the light of discrepancies between the results, the paper also gets a clearer image of MOSAIC by discussing its differences from O2T model.

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.


	1. Factors Analysis for a Computational Model of Emergent Simple Syntax
	Yu Hao,Wang Xiaojie
	Computer Science and Technology 07 November 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:This paper proposes several factors for computational models of early child language acquisition, giving a better explanation on how external language input and intrinsic parameter affect learning, comprehension and production of simple syntax. Taking a model simulating transition from one-word stage to two-word stage (O2T) as beginning, the paper gives quantitative simulation based investigations on how the language input and parameter affect the volume of system (i.e. how much is learned) and evaluation output (i.e. how well the learned can be used by the system to comprehend or produce simple syntax). Factors including contributing word, related string/concept and critical abstract factor, have been figured out to uncover underlying reasons. Contributing words bring syntax information from language input to the system; related strings/concepts relate the learned syntax to new syntax; and abstract factor is crucial for the ability of generative learning. Experiment results show that contributing word and related string/concept have much greater influence respectively on the volume of system and evaluation output, compared to other information the language input contains. Jointly with related string/concept, critical abstract factor controls evaluation output. And there exists value ranges of critical abstract factor for the occurrence of under-extension and over-extension. After that, the paper makes similar investigation on MOSAIC (i.e. a mature and widely-accepted computational model of syntax acquisition), and get similar results, which indicate some degree of generality of the factors. In the light of discrepancies between the results, the paper also gets a clearer image of MOSAIC by discussing its differences from O2T model.
	TO cite this article:Yu Hao,Wang Xiaojie. Factors Analysis for a Computational Model of Emergent Simple Syntax[OL].[ 7 November 2010] http://en.paper.edu.cn/en_releasepaper/content/4390755


	2. Refining Graph Partitioning for Community Detection
	Qian Tieyun,Yang Yang,Wang Shuo
	Computer Science and Technology 29 September 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Graph partitioning is traditionally designed for dividing the vertices into clusters such that a predefined quality function, for example, normalized cut or ratio cut, is approximately optimized. Recently, demand for social network analysis arouses the new research interest on graph clustering with no constraint on the size of partitions. Social network exhibits some key properties such as power-law and small-world. This paper presents a new definition for measuring the small world weight between two vertices, then a refinement strategy is designed for improving results obtained by traditional graph partitioning algorithm. Experimental evaluation demonstrates that the proposed algorithm can effectively enhance the objective functions.
	TO cite this article:Qian Tieyun,Yang Yang,Wang Shuo. Refining Graph Partitioning for Community Detection[OL].[29 September 2010] http://en.paper.edu.cn/en_releasepaper/content/4387034

Saved Papers

Saved Papers


	3. Some Basic Principles for Proxy Signature Schemes Based on DLP
	Xue Qingshui ,Li Fengying,Cao Zhenfu
	Computer Science and Technology 06 April 2010
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Nowadays, most proxy signature schemes are based on the difficulty of DLP (Discrete Logarithm Problem) or ECDLP (Elliptical Curve Discrete Logarithm Problem). As though many proxy signature schemes based on DLP or ECDLP have been proposed, it makes us discouraged that some disadvantages can be found after a new or modified proxy signature scheme was designed after short time. How to solve the question? How to design secure and valid proxy signature schemes? How to prove them secure? Now, it is too difficult for us to prove one scheme secure, but if we can have some principles to conform to when designing some proxy signature schemes based on DLP or ECDLP, it will be helpful. It will be able to make scheme designers to make few mistakes, that’s to say, by these principles, they can judge whether their schemes meet these basic secure conditions or not. If designers don’t abide by these principles, it can easily be seen that their schemes are definitely insecure. It is all known that until now there are no such principles in the real life. The first principle is that the existent forms of public parameters in proxy signatures in the proxy signature verification congruence make a key role on the security property of unforgeability; the second principle is that any public parameter in the proxy signature can’t lonely exist in the proxy signature verification congruence in the form of bases or exponents; the third principle is that any public parameter in the proxy signature should exist in the proxy signature verification equation in the form of not only exponents and bases, but also hashes. About these principles, they are described. In addition, some examples are made to make them clear.
	TO cite this article:Xue Qingshui ,Li Fengying,Cao Zhenfu . Some Basic Principles for Proxy Signature Schemes Based on DLP[OL].[ 6 April 2010] http://en.paper.edu.cn/en_releasepaper/content/41553


	4. An Improvement of the Route Discovery Process in AODV for Ad Hoc Network
	Yongjun Hu,Junliang Shen
	Computer Science and Technology 03 November 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Ad hoc networks are composed of a set of mobile and wireless nodes. They have several characteristics such as being self-organized, dynamically changing topology and multi-hop connectivity. Ad-Hoc On-Demand Distance Vector Routing (AODV) is one of the most widely researched on-demand ad hoc routing protocols. An improvement of the route discovery process in AODV (IMAODV) is proposed to decrease the delay and the routing overload in this paper. The performance of IMAODV is compared with AODV in terms of routing load and average end-to-end delay. The simulation results show that IMAODV has less the average end-to-end delay and the routing load than AODV in the network.
	TO cite this article:Yongjun Hu,Junliang Shen. An Improvement of the Route Discovery Process in AODV for Ad Hoc Network[OL].[ 3 November 2009] http://en.paper.edu.cn/en_releasepaper/content/36374


	5. Limitation of object-oriented language’s polymorphism
	Elias Yu,Zeng XiJun
	Computer Science and Technology 28 July 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:The polymorphism of object-oriented language is the key technology, the use of the method and internal principle is one of the most difficult technologies. In this paper, C + + as an example, analyzed the theory of Polymorphism and pointed out the limitation when rewrite few virtual function in derived class, and put forward a kind of solving method with the string matches to replace the seek address.
	TO cite this article:Elias Yu,Zeng XiJun. Limitation of object-oriented language’s polymorphism[OL].[28 July 2009] http://en.paper.edu.cn/en_releasepaper/content/34133


	6. A Novel Fast and Effective Hierarchical Thermal-Aware Floorplanning Algorithm
	Pingjie Cheng,Ning Xu
	Computer Science and Technology 24 February 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Hierarchical approaches are employed in current ﬂoorplanning algorithms for scaling to large number modules. With the development of VLSI technology, the thermal problem has been emerged as one of the key issues for IC design. In this paper, we propose a novel power density clustering method to guide the optimization of ﬂoorplanning, which aims to efﬁciently reduce the hotspots while optimizing design metrics such as area and total wirelength.The experimental results with GSRC benchmarks show that the thermal effect is well controlled so that the temperature of ”hot spots” has decreased on the chip. Our algorithm is compared with the state-of-the-art thermal-aware floorplanning algorithm Hotspot Floorplan, it can reduce the max temperature by 3% while saving time by about 300%.
	TO cite this article:Pingjie Cheng,Ning Xu. A Novel Fast and Effective Hierarchical Thermal-Aware Floorplanning Algorithm[OL].[24 February 2009] http://en.paper.edu.cn/en_releasepaper/content/29596


	7. DHT based context information disseminating method in autonomic network
	WangHao
	Computer Science and Technology 11 February 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In autonomic network, context information given by monitor is the main foundation of decision. In order to make good use of network context information, the dissemination sub-system is needed to be scalable (support large scale of autonomic network) and distributed(deal with issue of single point of failure). In response to these demands, we propose a method to construct a context information dissemination model based on DHT. In our targeted application, an overlay network is built upon the lower network consist of autonomic nodes. The context information can be published and located using DHT lookup mechanism in the structured distributed network environment. To deal with the mismatch between the overlay-level network and physical network, we present a self-adjust scheme to reduce the lookup routing latency during the process agents apply for the context information. In the strategy, we aim to make node themselves adjust node identifiers in a geographically manner. This self-adjust operation only takes place when the autonomic node access to DHT overlay network.
	TO cite this article:WangHao. DHT based context information disseminating method in autonomic network[OL].[11 February 2009] http://en.paper.edu.cn/en_releasepaper/content/28818


	8. An Adaptive Watermarking Algorithm Based on Multi-scale Morphological Gradient and Fussy theory in Wavelet Domain
	Chen Wenyong,Fan Yanbin
	Computer Science and Technology 22 January 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:A novel adaptive watermarking algorithm based on multi-scale morphological gradient and fussy theory in wavelet domain is proposed in this paper. Using multi-scale morphological gradient, analyze the distribution and the strength of the sub-block texture after the wavelet package decomposition, and sort the sub-blocks by textures. According to the texture and energy feature of the sub-block, the sub-block thresholds are determined adaptively, and the coefficients are classified by fuzzy theory. Then, based on the classified result, the strength of the position is modulated adaptively through Noise Visibility Function (NVF), which is the best strength to ensure good visual effect of masking to achieve the best balance between robustness and imperceptibility. A large amount of experimental results show that the proposed algorithm is effective and robust to be resistant to common image processing operations.
	TO cite this article:Chen Wenyong,Fan Yanbin. An Adaptive Watermarking Algorithm Based on Multi-scale Morphological Gradient and Fussy theory in Wavelet Domain[OL].[22 January 2009] http://en.paper.edu.cn/en_releasepaper/content/28229


	9. Design of Embedded Wireless Vehicle Manage System Based on GPRS
	Zhifeng Pang,HuanMing Yu
	Computer Science and Technology 28 August 2008
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Unifying the embedded system, the GPRS networking and the car license recognition technology, this article designs and realizes one kind of embedded wireless vehicle management system using the ARM9 microprocessor\\\\\\\
	TO cite this article:Zhifeng Pang,HuanMing Yu. Design of Embedded Wireless Vehicle Manage System Based on GPRS[OL].[28 August 2008] http://en.paper.edu.cn/en_releasepaper/content/23585


	10. An Adaptive Watermarking Algorithm in DWT Domain Based on Multi-scale Morphological Gradient
	Chen Wenyong,Fan Yanbin
	Computer Science and Technology 30 June 2008
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:An adaptive watermarking algorithm in the wavelet domain based on multi-scale morphological gradient is proposed in this paper. Using multi-scale morphological gradient, the distribution and the strength of the sub-block texture after the wavelet package decomposition are analyzed, and the textures of sub-blocks are sorted. According to the texture feature of the sub-block, the sub-block threshold is determined adaptively and the position which is bigger than its threshold is selected as the important coefficient position where the watermarking is embedded. Then, the strength of the position is modulated adaptively through Noise Visibility Function (NVF), which is the best strength to ensure good visual effect of masking to achieve the best effect between robustness and imperceptibility. A large amount of experiments show that the proposed algorithm is effective and robust to common image processing operations.
	TO cite this article:Chen Wenyong,Fan Yanbin. An Adaptive Watermarking Algorithm in DWT Domain Based on Multi-scale Morphological Gradient[OL].[30 June 2008] http://en.paper.edu.cn/en_releasepaper/content/22550

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