ppxscal/embedding_network huggingface dataset:
Diagnosis of Parkinson's disease using evolutionary algorithms
Authors: Stephen L. Smith, Patrick Gaughan, David M. Halliday, Quan Ju, Nabil M. Aly, Jeremy R. Playfer
Venue: Genetic Programming and Evolvable Machines (2007)

This paper describes the novel application of an evolutionary algorithm to discriminate Parkinson's patients from age-matched controls in their response to simple figure-copying tasks. The reliable diagnosis of Parkinson's disease is notoriously difficult to achieve with misdiagnosis reported to be as high as 25% of cases. The approach described in this paper aims to distinguish between the velocity profiles of pen movements of patients and controls to identify distinguishing artifacts that may be indicative of the Parkinson's symptom bradykinesia. Results are presented for 12 patients with Parkinson's disease and 10 age-match controls. An algorithm was evolved using half the patient and age-matched control responses, which was then successfully used to correctly classify the remaining responses. A more rigorous "leave one out" strategy was also applied to the test data with encouraging results.
Massive-Model Rendering Techniques: A Tutorial
Authors: Andreas Dietrich, Enrico Gobbetti, Sung-Eui Yoon
Venue: IEEE Computer Graphics and Applications (2007)

The currently observed exponentially increasing size of 3D models prohibits rendering them using brute force methods. Researchers have proposed various outputsensitive rendering algorithms to overcome this challenge. This article provides an overview of this technology.
Processing lichen images for ANN classification
Authors: M. Sapiyan, Mak Yoke Lai
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Biologists data are often in the form of images. Much information can be extracted from such images. To extract the necessary information, biologist have to spent long and labourious hours studying the images. Computers can now be trained or programmed to perform such task. One way to achieve this is to apply Artifical Neural Networks (ANN). However, before ANN may be applied to the digitized images must be pre-processed to ensure the images are relatively clean. In this research, we investigate the feasibility of classifying lichen images into the different species using ANN. The process involves the extraction of classification features from the images for the input to a template matching technique employing an ANN algorithm. The images studied are pre-processed to improve its quality prior to the feature extraction phase. The pre-processing stage deals with problems related to variable shape sizes, colour, background noise and variable placement angles of the shapes. With the implementation of the above techniques, we are able to achieve an accuracy more than 90% for the classification the lichen images into their species.
A Three-Layered Approach to Model Web Accessibility for Blind Users
Authors: Adriana Martin, Alejandra Cechich, Silvia Gordillo, Gustavo Rossi
Venue: Proceedings of the 2007 Latin American Web Conference (2007)

The lack of adequate Accessibility of Web sites remains a problem for blind users and other people with disabilities. The process of engineering accessible Web applications involves several issues, which include content, presentation and pragmatic issues that, fortunately, are currently addressed by some standard models such as the W3C's Accessibility guidelines. In this context, our work proposes an approach to better model Accessibility as a concern specified at different abstraction levels. This paper introduces the approach and illustrates its use through a case study, which includes specific guidelines and techniques.
Mixture cure models for multivariate survival data
Authors: Binbing Yu, Yingwei Peng
Venue: Computational Statistics Data Analysis (2008)

Mixture cure models (MCMs) have been widely used to analyze survival data with a cure fraction. The MCMs postulate that a fraction of the patients are cured from the disease and that the failure time for the uncured patients follows a proper survival distribution, referred to as latency distribution. The MCMs have been extended to bivariate survival data by modeling the marginal distributions. In this paper, the marginal MCM is extended to multivariate survival data. The new model is applicable to the survival data with varied cluster size and interval censoring. The proposed model allows covariates to be incorporated into both the cure fraction and the latency distribution for the uncured patients. The primary interest is to estimate the marginal parameters in the mean structure, where the correlation structure is treated as nuisance parameters. The marginal parameters are estimated consistently by treating the observations within the cluster as independent. The variances of the parameters are estimated by the one-step jackknife method. The proposed method does not depend on the specification of correlation structure. Simulation studies show that the new method works well when the marginal model is correct. The performance of the MCM is also examined when the clustered survival times share common random effect. The MCM is applied to the data from a smoking cessation study.
An Availability Model for Distributed Transaction Systems
Authors: G. Martella
Venue: IEEE Transactions on Software Engineering (1985)

A method is proposed for quantitatively evaluating the availability of a distributed transaction system (DTS). The DTS dynamics can be modeled as a Markov process. The problem of formulating the set of linear homogeneous equations is considered, obtaining the related coefficient matrix, that is, the transition rate matrices of the DTS elements. Such operations can be performed according to the rules of Kronecker algebra. The transition rate matrices are used to calculate the probabilities of the different possible states of the DTS. The availability with respect to a transaction T is computed through its representation by means of a structure graph and a structure vector related to the probabilistic state of the DTS element relevant to the transaction T itself.
Decisional style and eParticipation
Authors: J. G. Phillips, M. Jory, N. Mogford
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

Decisional style may predict eParticipation tendencies. The vigilance, procrastination, buck-passing, and hypervigilance of 77 undergraduates was measured using the Melbourne Decision Making Scale and related to use of WebCT. Decisional style predicted grades, participation in discussion groups and course evaluations.
TA-PFP: A Transgenetic Algorithm to Solve the Protein Folding Problem
Authors: Carolina P. Almeida, Richard A. Goncalves, Marco C. Goldbarg, Elizabeth F. G. Goldbarg, Myriam R. Delgado
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This work reports the application of a transgenetic algorithm to the Protein Folding Problem in the 3D HP model, which is a particular instance of the string folding problem and is known to be NP-Hard. The proposed algorithm uses two kinds of plasmids, two kinds of transposons, two information sources, adaptation of parameters and is hybridized with tabu search. The computational experiments consider seven instances of the Tortilla benchmark. The results are favorably comparable with that reported in the literature, attesting the efficiency of the methodology.
Weighted Gray Correlation Analysis Model Based on DEA and Its Application to Highway Network Evaluation
Authors: Wei Nie, Chunfu Shao
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

A new model combined weighted gray correlation analysis with DEA (Data Envelopment Analysis) was presented in this paper. It integrates the advantages of both DEA and gray correlation analysis, and takes the latter as a central model. In the model, DEA determines the weight vector of correlation coefficients for each Decision-Making Unit ( DMU ) to calculate the relatively optimal correlation degrees and then realizes the priority order of the objects to be evaluated. This method can avoid the subjectivity when the weight vector is determined and obtain the optimal results by non-uniform weight. Finally, an example of some provincial highway networks assessment in China was given to prove the validity of the model.
Deadline Scheduling with Processor Affinity and Feasibility Check on Uniform Parallel Machines
Authors: Vahid Salmani, Mahmoud Naghibzadeh, Mohsen Kahani
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

It has been proved that there is no optimal online scheduler for uniform parallel machines. Despite its non-optimality, EDF is an appropriate algorithm to use in such environments. However, its performance significantly degrades in overloaded situations. Moreover, EDF produces a relatively large number of migrations which may prove unacceptable for use on some parallel machines. In this paper a new deadline- based algorithm for scheduling real-time tasks on uniform parallel machines is presented. The performance of this algorithm is then compared with that of EDF algorithm. It is shown that our proposed approach not only demonstrates a performance close to that of EDF in non-overloaded conditions but also has supremacy over EDF in overloaded situations in many aspects. Furthermore, it imposes much less overhead on the system.
Fixing Design Errors with Counterexamples and Resynthesis
Authors: Kai-Hui Chang, I. L. Markov, V. Bertacco
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

In this work we propose a new error-correction framework, called CoRe, which uses counterexamples, or bug traces, generated in verification to automatically correct errors in digital designs. CoRe is powered by two innovative resynthesis techniques, goal-directed search (GDS) and entropy-guided search (EGS), which modify the functionality of internal circuit's nodes to match the desired specification. We evaluate our solution to designs and errors arising during combinational equivalence-checking, as well as simulation-based verification of digital systems. Compared with previously proposed techniques, CoRe is more powerful in that: (1) it can fix a broader range of error types because it does not rely on specific error models; (2) it derives the correct functionality from simulation vectors, hence not requiring golden netlists; and (3) it can be applied to a range of verification flows, including formal and simulation-based.
Application note: SelGen: System to dynamically evaluate and compare the agronomic behavior of genotypes that participate in networks of comparative yield trials
Authors: Gustavo Giambastiani
Venue: Computers and Electronics in Agriculture (2008)

One of the decisions of major impact on crop profitability is the selection of the genotype to sow. SelGen is a software that makes it possible to evaluate and dynamically compare genotypes; this allows a faster selection of the suitable genotype. The software processes, according to the options selected by the user, the information contained in a database regarding the genotype yield in different environments. The results are shown in graphs and tables. The database included in the program is updated twice a year. Users can analyze their own databases.
Is Bloom's taxonomy appropriate for computer science?
Authors: Colin G. Johnson, Ursula Fuller
Venue: Proceedings of the 6th Baltic Sea conference on Computing education research: Koli Calling 2006 (2006)

Bloom's taxonomy attempts to provide a set of levels of cognitive engagement with material being learned. It is usually presented as a generic framework. In this paper we outline some studies which examine whether the taxonomy is appropriate for computing, and how its application in computing might differ from its application elsewhere. We place this in the context of ongoing debates concerning graduateness and attempts to 'benchmark' the content of a computing degree.
Studying Baskakov--Durrmeyer operators and quasi-interpolants via special functions
Authors: Elena E. Berdysheva
Venue: Journal of Approximation Theory (2007)

We prove that the kernels of the Baskakov-Durrmeyer and the Szasz-Mirakjan-Durrmeyer operators are completely monotonic functions. We establish a Bernstein type inequality for these operators and apply the results to the quasi-interpolants recently introduced by Abel. For the Baskakov-Durrmeyer quasi-interpolants, we give a representation as linear combinations of the original Baskakov-Durrmeyer operators and prove an estimate of Jackson-Favard type and a direct theorem in terms of an appropriate K-functional.
Bootstrap confidence intervals for principal response curves
Authors: Marieke E. Timmerman, Cajo J. F. Ter Braak
Venue: Computational Statistics Data Analysis (2008)

The principal response curve (PRC) model is of use to analyse multivariate data resulting from experiments involving repeated sampling in time. The time-dependent treatment effects are represented by PRCs, which are functional in nature. The sample PRCs can be estimated using a raw approach, or the newly proposed smooth approach. The generalisability of the sample PRCs can be judged using confidence bands. The quality of various bootstrap strategies to estimate such confidence bands for PRCs is evaluated. The best coverage was obtained with BC"a intervals using a non-parametric bootstrap. The coverage appeared to be generally good, except for the case of exactly zero population PRCs for all conditions. Then, the behaviour is irregular, which is caused by the sign indeterminacy of the PRCs. The insights obtained into the optimal bootstrap strategy are useful to apply in the PRC model, and more generally for estimating confidence intervals in singular value decomposition based methods.
Models of DASD Subsystems with Multiple Access Paths: A Throughput-Driven Approach
Authors: A. Brandwajn
Venue: IEEE Transactions on Computers (1983)

A throughput-driven approach to the performance analysis of direct access storage devices (DASD's), i.e., disks, is presented for a model of a block-multiplexor channel system with multiple transfer paths. The approach relies on a step-wise analysis of shared components within the data transfer path: head of string, control unit, channel, referred to as blocking points. In order to derive the service time of an I/O request, each blocking point is analyzed separately, using essentially a classical loss-system model. The advantages of the method are its relative simplicity and applicability to a large number of configurations. Transient and boundary effects, including the miss probability on second and subsequent reconnection attempts, and the device reconnection window (lead time), are also discussed. The inclusion of the approach in a larger system model, as well as its relationship with previous work on DASD analysis is considered. Numerical results illustrate the accuracy of the method.
An Efficient Multigrid Method for Overlapped Grid System to Integrated System Analysis
Authors: Soo Hyung Park, Yung Hoon Yu, Kum Won Cho
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

A technique for the generation of overlapped grid using a simple shooting method, that is a cut-paste algorithm, is presented. It makes possible to generate overlapping grids with moderate mesh interface region. To generate overlapped grids with minimal amount of user inputs, the advancing-front technique using the fringe points as facets is used. To remove hole points initially, fronts using solid bodies and the zones of interference algorithm are used. The overlapped grids are generated for several cases using present algorithms and Euler equations are solved for two/three-dimensional steady state flow fields. To demonstrate the capability of present method, the two dimensional store separation with trajectory mode of three-DOF is computed in an unsteady flow field.
The Impact of Personally Identifiable Information
Authors: Linda Wilbanks
Venue: IT Professional (2007)

We all have an obligation to protect personal information. The author discusses what that can mean to us as individuals or asIT managers.
Optimized-Hilbert for Mobility in Wireless Sensor Networks
Authors: Maznah Kamat, Abdul Samad Ismail, Stephan Olariu
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

In wireless sensor networks (WSNs), mobilizing sink node for data collection can minimize communication and maximize network lifetime. Several mobility algorithms have been proposed to control sink node's movement. However, they do not consider mobility for coverage area problem. Hilbert space-filling curves technique is modified to navigate mobile sink in traversing specfiic area of the sensor field. The algorithm is called optimized-Hilbert, which provides mobility pattern of a sink node in covering an ellipsoidal monitoring area during data collection for a specific mission by traversing the entire area from an entry point and finish at an exit point of square grids. The optimized-Hilbert requires less number of steps as compared to conventional Hilbert. Additionally, it is also compared with circular mobility, and result indicates the efficiency of optimized Hilbert.
General cardinality genetic algorithms
Authors: Gary J. Koehler, Siddhartha Bhattacharyya, Michael D. Vose
Venue: Evolutionary Computation (1997)

A complete generalization of the Vose genetic algorithm model from the binary to higher cardinality case is provided. Boolean AND and EXCLUSIVE-OR operators are replaced by multiplication and addition over rings of integers. Walsh matrices are generalized with finite Fourier transforms for higher cardinality usage. Comparison of results to the binary case are provided.
Video Object Segmentation by 2-D Mesh-Based Motion Analysis According to Motion Connectivity
Authors: Yujian Wang, Zhenyang Wu
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Video object extraction is a key technology in the content-based video coding. A new temporal-spatial video object segmentation algorithm is proposed in this paper. This algorithm is based on 2-D mesh-based motion analysis according to motion connectivity. Firstly, a 2-D adaptive mesh fitting the original frame image is obtained via feature detection algorithm. Then, higher order statistics motion analysis according to motion connectivity is applied on the 2-D mesh representation to get a coarse motion boundary layer. After refining the coarse boundary layer and post-processing the labeled maximal connected region, the final segmenting mask is quickly obtained. Hence the video object is effectively extracted. Experimental results show that the proposed algorithm combines the merits of the mesh-based segmentation algorithms and the pixel-based segmentation algorithms, and therefore achieves satisfactory subjective and objective performance as well as dramatically increasing the segmenting speed.
Robust M-estimation techniques for non-Gaussian CDMA wireless channels with phased array antenna
Authors: Vladimir Katkovnik, Moon-Sik Lee, Yong-Hoon Kim
Venue: Signal Processing (2008)

A new robust M-estimation technique is developed for combating impulsive noise and multiuser interference in code-division multiple-access (CDMA) communication channels with a phased array receiver. A special power function of the proposed robust estimator is derived from the Huber's minimax robust estimation theory by minimizing a non-quadratic loss function of estimation residuals. Maximum peaks of this power function are used for estimation of communication signals as well as the direction-of-arrival (DOA). The produced theoretical analysis of the asymptotic accuracy of estimation is used for selection of the optimal minimax loss function. A strong advantage of the developed robust algorithm is a decreased sensitivity of the estimates with respect to actually unknown distributions of random noise and interferences. Simulation demonstrates that the proposed robust algorithms offer significant performance gain over the conventional least squares (LS) based estimator in terms of both BER and maximum user capacity.
Parallel Software Configuration Management in a Network Environment
Authors: D. B. Leblang
Venue: IEEE Software (1987)

DSEE provides the best of networks and parallel ism. It lets resources be shared flexibly, and can reduce system build time from overnight to over lunch.
A Case for Non-Two-Phase Locking Protocols that Ensure Atomicity
Authors: A. Silberschatz
Venue: IEEE Transactions on Software Engineering (1983)

A transaction is atomic if it can be considered, as far as other transactions are concerned, to be indivisible and instantaneous even in the case of failure. An almost universally accepted way to ensure atomicity is to use a strict two-phase locking protocol with a roll-back scheme for recovery in case of deadlock or failure. In this note, we argue that this method is not the most economical way to achieve this end. We develop a Dependency Graph model which is used to analyze the two-phase and non-two-phase locking schemes. It is shown that one way of choosing between the two types of schemes is to estimate the number of rollbacks required. If this number is large, a two-phase scheme is preferable; if small, a non-two-phase scheme should be selected. We demonstrate that with reasonable discipline, the number of such rollbacks can be minimized. Thus, contrary to common practice and belief, non-two-phase protocols can be effectively used in guaranteeing atomicity.
Wyner-Ziv Video Coding with Part Intracoding
Authors: Guiguang Ding
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In Wyner-Ziv video coding, efficient compression is achieved by exploiting source statistics at the decoder only, which is radically different from conventional video coding. Prior works on this topic generally use channel coding to implement Slepian-Wolf codec. However, the correlation between some bitplanes of source and that of side information may be very weak. At that time, the coding performance of Slepian-Wolf codec should be lower than that of intracoding codec. If we can divide the video data into strongly correlative data encoded by Slepian-Wolf codec and weakly correlative data encoded by Intracoding codec, the coding performance of video codec would be improved. In this paper, we proposed a novel distributed video coding scheme with part Intracoding. Simulation results show that the proposed scheme can achieve better compression efficiency while keeping the simple encoding property.