Enhancing encoding capacity of combinational test stimulus decompressors

While scan-based compression is widely utilized in order to alleviate the test time and data volume problems,the overall compression level is dictated not only by the chain to channel ratio but also the ratio of encodable patterns.Aggressively increasing the number of scan chains in an effort to raise the compression levels may reduce the ratio of encodable patterns,degrading the overall compression level.In this paper,we present various methods to improve the ratio of encodable patterns.These methods are b...     

Thermodynamic studies on the complete phase diagram of aqueous two phase system containing polyethylene glycol dimethyl ether 2000 and di-potassium hydrogen phosphate at different temperatures

The liquid-liquid equilibrium of polyethylene glycol dimethyl ether 2000 (PEGDME₂₀₀₀)+K₂HPO₄+H₂O system has been determined experimentally at T=(298.15,303.15,308.15 and 318.15) K. The liquid-solid and complete phase diagram of this system was also obtained at T=(298.15 and 308.15) K. A nonlinear temperature dependent equation was successfully used for the correlation of the experimental binodal data. Furthermore, a temperature dependent Setschenow-type equation was successfully used for the correlation of the tie-lines of the studied system. Moreover, the effect of temperature on the binodal curves and the tie-lines for the investigated aqueous two-phase system have been studied. Also, the free energies of cloud points for this system and some previously studied systems containing PEGDME₂₀₀₀ were calculated from which it was concluded that the increase of the entropy is the driving force for formation of aqueous two-phase systems. Additionally, the calculated free energies for phase separation of the studied systems were used to investigate the salting-out ability of the salts having different anions. Furthermore, the complete phase diagram of the investigated system was compared with the corresponding phase diagrams of previously studied systems, in which the PEGDME₂₀₀₀ has been used, in order to obtain some information regarding the phase behavior of these PEGDME₂₀₀₀+salt+water systems.     

Exploring the relationship between Internet ethics in university students and the big five model of personality

The widespread use of the Internet and the convenient mechanism it provides, such as easy access, easy downloads, and easy copy and paste functions have made many types of unethical behaviors easier, particularly those involving students in academic settings. Among the issues in ethics within the academic environment that can be triggered by the Internet are fraudulence, plagiarism, falsification, delinquency, unauthorized help, and facility misuse. Given these issues, the study seeks to investigate the extent to which students at a public university in Malaysia engage in such unethical behavior and their relationship with the big five personality model. This study was conducted using a survey method of 252 students in three different academic faculties. The results of factor analyses confirm and refine the reliability of the scales for both big five personality variables and unethical Internet behaviors as conceptualized through Internet triggered academic dishonesty (ITADS). The findings indicate that personality traits such as (1) agreeableness, (2) conscientiousness and (3) emotional stability are significantly and negatively correlated with unethical Internet behavior in university students. Significant differences in facility misuse are also observed between the three academic faculties investigated. This research should provide significant contributions to educators in designing the computer ethics curriculum and in allowing for educational institutions as well as other organizations in developing relevant policies and guidelines on matters pertaining to academic conduct, utilization of computers and Internet, and recruitment exercises.     

Using cross-layer metrics to improve the performance of end-to-end handover mechanisms

Network centric handover solutions for all IP wireless networks usually require modifications to network infrastructure which can stifle any potential rollout. This has led researchers to begin looking at alternative approaches. Endpoint centric handover solutions do not require network infrastructure modification, thereby alleviating a large barrier to deployment. Current endpoint centric solutions capable of meeting the delay requirements of Voice over Internet Protocol (VoIP) fail to consider the Quality of Service (QoS) that will be achieved after handoff. The main contribution of this paper is to demonstrate that QoS aware handover mechanisms which do not require network support are possible. This work proposes a Stream Control Transmission Protocol (SCTP) based handover solution for VoIP called Endpoint Centric Handover (ECHO). ECHO incorporates cross-layer metrics and the ITU-T E-Model for voice quality assessment to accurately estimate the QoS of candidate handover networks, thus facilitating a more intelligent handoff decision. An experimental testbed was developed to analyse the performance of the ECHO scheme. Results are presented showing both the accuracy of ECHO at estimating the QoS and that the addition of the QoS capabilities significantly improves the handover decisions that are made.     

A semantic based Web page classification strategy using multi-layered domain ontology

World Wide Web is a continuously growing giant, and within the next few years, Web contents will surely increase tremendously. Hence, there is a great requirement to have algorithms that could accurately classify Web pages. Automatic Web page classification is significantly different from traditional text classification because of the presence of additional information, provided by the HTML structure. Recently, several techniques have been arisen from combinations of artificial intelligence and statistical approaches. However, it is not a simple matter to find an optimal classification technique for Web pages. This paper introduces a novel strategy for vertical Web page classification, which is called Classification using Multi-layered Domain Ontology (CMDO). It employs several Web mining techniques, and depends mainly on proposed multi-layered domain ontology. In order to promote the classification accuracy, CMDO implies a distiller to reject pages related to other domains. CMDO also employs a novel classification technique, which is called Graph Based Classification (GBC). The proposed GBC has pioneering features that other techniques do not have, such as outlier rejection and pruning. Experimental results have shown that CMDO outperforms recent techniques as it introduces better precision, recall, and classification accuracy.     

A training-free nose tip detection method from face range images

Nose tip detection in range images is a specific facial feature detection problem that is highly important for 3D face recognition. In this paper, we propose a nose tip detection method that has the following three characteristics. First, it does not require training and does not rely on any particular model. Second, it can deal with both frontal and non-frontal poses. Finally, it is quite fast, requiring only seconds to process an image of 100-200 pixels (in both x and y dimensions) with a MATLAB implementation. A complexity analysis shows that most of the computations involved in the proposed algorithm are simple. Thus, if implemented in hardware (such as a GPU implementation), the proposed method should be able to work in real time. We tested the proposed method extensively on synthetic image data rendered by a 3D head model and real data using FRGC v2.0 data set. Experimental results show that the proposed method is robust to many scenarios that are encountered in common face recognition applications (e.g., surveillance). A high detection rate of 99.43% was obtained on FRGC v2.0 data set. Furthermore, the proposed method can be used to coarsely estimate the roll, yaw, and pitch angles of the face pose.     

Finite element analysis on implicitly defined domains: An accurate representation based on arbitrary parametric surfaces

In this paper, we present some novel results and ideas for robust and accurate implicit representation of geometric surfaces in finite element analysis. The novel contributions of this paper are threefold: (1) describe and validate a method to represent arbitrary parametric surfaces implicitly; (2) represent arbitrary solids implicitly, including sharp features using level sets and boolean operations; (3) impose arbitrary Dirichlet and Neumann boundary conditions on the resulting implicitly defined boundaries. The methods proposed do not require local refinement of the finite element mesh in regions of high curvature, ensure the independence of the domain’s volume on the mesh, do not rely on boundary regularization, and are well suited to methods based on fixed grids such as the extended finite element method (XFEM). Numerical examples are presented to demonstrate the robustness and effectiveness of the proposed approach and show that it is possible to achieve optimal convergence rates using a fully implicit representation of object boundaries. This approach is one step in the desired direction of tying numerical simulations to computer aided design (CAD), similarly to the isogeometric analysis paradigm.     

SimClus: an effective algorithm for clustering with a lower bound on similarity

Clustering algorithms generally accept a parameter k from the user, which determines the number of clusters sought. However, in many application domains, like document categorization, social network clustering, and frequent pattern summarization, the proper value of k is difficult to guess. An alternative clustering formulation that does not require k is to impose a lower bound on the similarity between an object and its corresponding cluster representative. Such a formulation chooses exactly one representative for every cluster and minimizes the representative count. It has many additional benefits. For instance, it supports overlapping clusters in a natural way. Moreover, for every cluster, it selects a representative object, which can be effectively used in summarization or semi-supervised classification task. In this work, we propose an algorithm, SimClus, for clustering with lower bound on similarity. It achieves a O(log n) approximation bound on the number of clusters, whereas for the best previous algorithm the bound can be as poor as O(n). Experiments on real and synthetic data sets show that our algorithm produces more than 40% fewer representative objects, yet offers the same or better clustering quality. We also propose a dynamic variant of the algorithm, which can be effectively used in an on-line setting.     

A generalized least absolute deviation method for parameter estimation of autoregressive signals

This paper proposes a generalized least absolute deviation (GLAD) method for parameter estimation of autoregressive (AR) signals under non-Gaussian noise environments. The proposed GLAD method can improve the accuracy of the estimation of the conventional least absolute deviation (LAD) method by minimizing a new cost function with parameter variables and noise error variables. Compared with second- and high-order statistical methods, the proposed GLAD method can obtain robustly an optimal AR parameter estimation without requiring the measurement noise to be Gaussian. Moreover, the proposed GLAD method can be implemented by a cooperative neural network (NN) which is shown to converge globally to the optimal AR parameter estimation within a finite time. Simulation results show that the proposed GLAD method can obtain more accurate estimates than several well-known estimation methods in the presence of different noise distributions.