Earticle

In this paper, we introduce a method for the application of Bézier curve algorithms to lookup-table-based interpolations, particularly for the use of timing, power, and noise analysis in integrated circuit design. Bézier curves can replace conventional piecewise linear functions for accuracy enhancement. Selecting control points with physical implications and forcing curves to pass through sampled points are critical for achieving the envisioned improvements. This method can be easily applied to the interpolation of splines.

Ubiquitous learning and Calm Computing are hot research topics affecting the field of education for an information-rich world. Calm computing aims to reduce the "excitement" of information overload by letting the learner select what information is at the center of their attention and what information need to be at the peripheral. The objective of calm computing as a new delivery of education is to move e-learning and ubiquitous learning a step further from learning at anytime anywhere to be at the right time and right place with right learning resources and right learning functionalities and collaborative peers. In this paper we report on the adaptation of calm computing technologies in a ubiquitous educational setting with emphasis on the need to cater the preferences of the individual learner to respond to the challenge of providing truly- learner-centered, accessible, personalized and powered with the capability of collaborative learning within a social networking environment. Central to this vision is the development of Installable e-Learning Objects (Ie_LO) where learners are able to create, personalize or deploy them over the internet but they do not require the presence of the web browser.

It is difficult and troublesome to detect data races occurred in an execution of parallel programs. On-the-fly race detection techniques use monitoring to threads and events, which access to shared variables. Any of them using Lamport's happened-before relation needs a thread labeling scheme for generating unique identifiers which maintain logical concurrency information of the parallel threads. Previous labeling schemes for on-the-fly race detection in parallel programs with nested parallelism depend on the nesting depth on every fork and join operation. This paper presents e-NR (Extended Nest Region) labeling in which every thread generates and maintains its label in a constant amount of time and space. Experimental results using OpenMP programs show that presented labeling detects data races more efficiently, because it requires reduced time overhead about 10% and it 3.2 times smaller than previous labeling scheme in average space for race detection.

The paper aims to investigate the performance of the TCP variants in MANET and its behavior with respect to different routing protocols. In the performance evaluation two different routing protocols On-Demand Distance Vector (AODV) and Optimized Link State Routing (OLSR) have been considered with three different TCP variants Tahoe, Reno and New-Reno. Different scenarios that can achieve scalability, mobility and http traffic loading investigation in MANET have been considered in the evaluation. Depending on the variables delay and throughput the performances parameters of the routing protocols are graded. Conclusions are drawn based on the evaluation results using OPNET simulator. The results clearly show that the both AODV and OLSR achieve acceptable performance. However, the merits of AODV over OLSR or vise versa depend on the network environment such as TCP variant used, traffic load, number of nodes and mobile speed together with the required parameter in the evaluation delay or the throughput. The results clearly demonstrate that the AODV and OLSR achieve the same performance under low http traffic, small size network and low mobile speed. However, as the network size increases the OLSR achieves higher throughput whereas AODV achieves lower delay. The effect of Taho, Reno and New-Reno is small compared with the effect of routing protocol. Thus the paper recommends the use of expert system that can choose the optimum routing protocol for the required condition.