ppxscal/embedding_network huggingface dataset:
Selecting marker genes for cancer classification using supervised weighted kernel clustering and the support vector machine
Authors: Jooyong Shim, Insuk Sohn, Sujong Kim, Jae Won Lee, Paul E. Green, Changha Hwang
Venue: Computational Statistics Data Analysis (2009)

Due to recent interest in the analysis of DNA microarray data, new methods have been considered and developed in the area of statistical classification. In particular, according to the gene expression profile of existing data, the goal is to classify the sample into a relevant diagnostic category. However, when classifying outcomes into certain cancer types, it is often the case that some genes are not important, while some genes are more important than others. A novel algorithm is presented for selecting such relevant genes referred to as marker genes for cancer classification. This algorithm is based on the Support Vector Machine (SVM) and Supervised Weighted Kernel Clustering (SWKC). To investigate the performance of this algorithm, the methods were applied to a simulated data set and some real data sets. For comparison, some other well-known methods such as Prediction Analysis of Microarrays (PAM), Support Vector Machine-Recursive Feature Elimination (SVM-RFE), and a Structured Polychotomous Machine (SPM) were considered. The experimental results indicate that the proposed SWKC/SVM algorithm is conceptually much simpler and performs more efficiently than other existing methods used in identifying marker genes for cancer classification. Furthermore, the SWKC/SVM algorithm has the advantage that it requires much less computing time compared with the other existing methods.
The ExemplarBreakpointDistance for Non-trivial Genomes Cannot Be Approximated
Authors: Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette
Venue: Proceedings of the 3rd International Workshop on Algorithms and Computation (2009)

A promising and active field of comparative genomics consists in comparing two genomes by establishing a one-to-one correspondence (i.e., a matching) between their genes. This correspondence is usually chosen in order to optimize a predefined measure. One such problem is the Exemplar Breakpoint Distance problem (or EBD, for short), which asks, given two genomes modeled by signed sequences of characters, to keep and match exactly one occurrence of each character in the two genomes (a process called exemplarization), so as to minimize the number of breakpoints of the resulting genomes. Bryant [6] showed that EBD is NP-complete. In this paper, we close the study of the approximation of EBD by showing that no approximation factor can be derived for EBD considering non-trivial genomes --- i.e. genomes that contain duplicated genes.
Conflict driven scan chain configuration for high transition fault coverage and low test power
Authors: Zhen Chen, Boxue Yin, Dong Xiang
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Two conflict-driven schemes and a new scan architecture based on them are presented to improve fault coverage of transition fault. They make full use of the advantages of broadside, skewed-load and enhanced scan testing, and eliminate the disadvantages of them, such as low coverage, fast global scan enable signal and hardware overhead. Test power is also a challenge for delay testing, so our method tries to reduce the test power at the same time. By the analysis of the functional dependency between test vectors in broadside testing and the shift dependency between vectors in the skewed-load testing, some scan cells are selected to operate in the enhanced scan and skewed-load scan mode, while others operate in traditional broadside mode. In the architecture, scan cells with common successors are divided into one chain. With the efficient conflict driven selection methods and partition of scan cells, fault coverage can be improved greatly and test power can be reduced, without sacrificing the test time and test data. Experimental results show that the fault coverage of the proposed method can reach the level of enhanced scan design.
An event-related potential study on changes of violation and error responses during morphosyntactic learning
Authors: Douglas J. Davidson, Peter Indefrey
Venue: Journal of Cognitive Neuroscience (2009)

Based on recent findings showing electrophysiological changes in adult language learners after relatively short periods of training, we hypothesized that adult Dutch learners of German would show responses to German gender and adjective declension violations after brief instruction. Adjective declension in German differs from previously studied morphosyntactic regularities in that the required suffixes depend not only on the syntactic case, gender, and number features to be expressed, but also on whether or not these features are already expressed on linearly preceding elements in the noun phrase. Violation phrases and matched controls were presented over three test phases (pretest and training on the first day, and a posttest one week later). During the pretest, no electrophysiological differences were observed between violation and control conditions, and participants' classification performance was near chance. During the training and posttest phases, classification improved, and there was a P600-like violation response to declension but not gender violations. An error-related response during training was associated with improvement in grammatical discrimination from pretest to posttest. The results show that rapid changes in neuronal responses can be observed in adult learners of a complex morphosyntactic rule, and also that error-related electrophysiological responses may relate to grammar acquisition.
The system approach to grants and tax revenues of the Czech municipalities
Authors: Kašparová Miloslava
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

Public administration structure, financing and activities of self-governments can be different in other countries, but goals of every public administration are similar. Briefly speaking the main goal is to security adequate and continuous financing inside. This paper deals with the system approach to grant and tax revenues of the Czech municipalities. It focuses on public administration system, describing of tax revenues, grants, and situation in the Czech Republic and shows a process of grant realization. Creation of design of grant criteria objectification model is part of this paper too.
Thinking about computational thinking
Authors: James J. Lu, George H.L. Fletcher
Venue: ACM SIGCSE Bulletin (2009)

Jeannette Wing's call for teaching Computational Thinking (CT) as a formative skill on par with reading, writing, and arithmetic places computer science in the category of basic knowledge. Just as proficiency in basic language arts helps us to effectively communicate and in basic math helps us to successfully quantitate, proficiency in computational thinking helps us to systematically and efficiently process information and tasks. But while teaching everyone to think computationally is a noble goal, there are pedagogical challenges. Perhaps the most confounding issue is the role of programming, and whether we can separate it from teaching basic computer science. How much programming, if any, should be required for CT proficiency? We believe that to successfully broaden participation in computer science, efforts must be made to lay the foundations of CT long before students experience their first programming language. We posit that programming is to Computer Science what proof construction is to mathematics, and what literary analysis is to English. Hence by analogy, programming should be the entrance into higher CS, and not the student's first encounter in CS. We argue that in the absence of programming, teaching CT should focus on establishing vocabularies and symbols that can be used to annotate and describe computation and abstraction, suggest information and execution, and provide notation around which mental models of processes can be built. Lastly, we conjecture that students with sustained exposure to CT in their formative education will be better prepared for programming and the CS curriculum, and, furthermore, that they might choose to major in CS not only for career opportunities, but also for its intellectual content.
Modeling and Simulation for Fuel Cell-Battery Hybrid Electric Vehicle
Authors: Qian Ning, Dong-ji Xuan, Yang-hai Nan, Young-bae Kim
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

a model for the Fuel Cell-Battery Hybrid Electric Vehicle (FCHEV) power train in parallel configuration simulation based on the empirical formulation and MATLAB/Simulink blocks has been constructed with the power control strategy using logic threshold approach. Using accelerator pedal signal generated by the driving schedule as the primary input, the simulation implements difference power flow and management under the vehicle operating modes: start, cruise, accelerate and pause. It also incorporates regenerative braking for battery capacity recovery. Main control variables and three group threshold values are evaluated for the vehicle driven under the New Europe Driving Cycle (NEDC) schedule. The results indicate that this configuration of the FCHEV model has capability for battery state of charge (SOC) recovery while meeting vehicle speed and drive power request. The effect that the control thresholds impact on the power distribution and fuel consumption has also been simulated.
Specification mining of symbolic scenario-based models
Authors: David Lo, Shahar Maoz
Venue: Proceedings of the 8th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (2008)

Many dynamic analysis approaches to specification mining, which extract behavioral models from execution traces, do not consider object identities. This limits their power when used to analyze traces of general object oriented programs. In this work we present a novel specification mining approach that considers object identities, and, moreover, generalizes from specifications involving concrete objects to their symbolic class-level abstractions. Our approach uses data mining methods to extract significant scenario-based specifications in the form of Damm and Harel's live sequence charts (LSC), a formal and expressive extension of classic sequence diagrams. We guarantee that all mined symbolic LSCs are significant (statistically sound) and all significant symbolic LSCs are mined (statistically complete). The technique can potentially be applied to general object oriented programs to reveal expressive and useful reverse-engineered candidate specifications.
A conceptual framework for metadata quality assessment
Authors: Thomas Margaritopoulos, Merkourios Margaritopoulos, Ioannis Mavridis, Athanasios Manitsaris
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

Metadata quality of digital resources in a repository is an issue directly associated with the repository's efficiency and value. In this paper, the subject of metadata quality is approached by introducing a new conceptual framework that defines it in terms of its fundamental components. Additionally, a method for assessing these components by exploiting structural and semantic relations among the resources is presented. These relations can be used to generate implied logic rules, which include, impose or prohibit certain values in the fields of a metadata record. The use of such rules can serve as a tool for conducting quality control in the records, in order to diagnose deficiencies and errors.
WBLS: A signal presence-based Wi-Fi localisation system for mobile devices in smart environments
Authors: André Iasi Moura, Carlos Henrique Costa Ribeiro, Anna Helena Reali Costa
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2009)

The proliferation of mobile computing devices and wireless networks has set the stage for the development of smart environments rich in computing and communication capabilities, yet gracefully integrated with human users. This paradigm has fostered a growing interest in localisation-based systems and services for portable devices, especially in indoor environments. However, designing indoor localisation systems with increasing estimation capabilities and decreasing cost installation is a challenge. An interesting approach to reach such requirements consists in using the wireless local area network (WLan) infrastructure that is already installed in many places. Most reported WLan localisation approaches use a map of received signal strength and signal presence frequency collected from multiple channels at different physical localisations in the environment, which can be very noisy. This work proposes a new localisation system, WBLS (Wireless Based Localisation System), that considers the unreliability of information on signal presence frequency in the estimation process, in an attempt to eliminate its associated noise. Experiments considering mobile agents carrying devices and moving at human walk speeds show that the most important feature of WBLS is a robustness to access points shutdowns that may happen without any warning in an environment where there is little control over the infrastructure.
Indoor Space: A New Notion of Space
Authors: Ki-Joune Li
Venue: Proceedings of the 8th International Symposium on Web and Wireless Geographical Information Systems (2008)

With the rapid progress of GIS and ubiquitous computing technologies, the space that we are dealing with is no longer limited to outdoor space but being extended to indoor space. Indoor spaces has a number of differences from outdoor space, which make it difficult to realize GIS for indoor space. In order to extend the scope of GIS to indoor space, and provide integrated and seamless services, it is required to establish new theories, data models, database management systems for indoor spatial data, and applications for indoor space. In this paper, we investigate the research issues of indoor space and indoor GIS.
PowerDriverDTSS: The Advanced Demand Responsive Transport Service System
Authors: C. Lastrucci, L. Lastrucci, F. Casati
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Powersoft has developed PowerDriverDTSS (r) , an hardware and software architecture based on proprietary algorithm for demand transport services with undefined timetable, route and stops. PowerDriverDTSS (r) resolves the major problems of this type of service as the real time customers booking with the optimization of the vehicle path, guarantying an high quality standard for the service. This system is under evaluation by an Italian public bus transport operator.
AJAX design and usability
Authors: William Hudson
Venue: Proceedings of the 21st British HCI Group Annual Conference on HCI 2008: People and Computers XXI: HCI...but not as we know it - Volume 2 (2007)

AJAX, and related approaches that enable greater levels of interaction within web pages, have the potential to both help and hinder usability. This half-day interactive tutorial examines the issues, providing examples and guidance on appropriate application of these technologies.
Robust F0 Estimation Using ELS-Based Robust Complex Speech Analysis
Authors: Keiichi Funaki, Tatsuhiko Kinjo
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Complex speech analysis for an analytic speech signal can accurately estimate the spectrum in low frequencies since the analytic signal provides spectrum only over positive frequencies. The remarkable feature makes it possible to realize more accurate F0 estimation using complex residual signal extracted by complex-valued speech analysis. We have already proposed F0 estimation using complex LPC residual, in which the autocorrelation function weighted by AMDF was adopted as the criterion. The method adopted MMSE-based complex LPC analysis and it has been reported that it can estimate more accurate F0 for IRS filtered speech corrupted by white Gauss noise although it can not work better for the IRS filtered speech corrupted by pink noise. In this paper, robust complex speech analysis based on ELS (Extended Least Square) method is introduced in order to overcome the drawback. The experimental results for additive white Gauss or pink noise demonstrate that the proposed algorithm based on robust ELS-based complex AR analysis can perform better than other methods.
GIS-Enabled Desktop Software Development Pardigms
Authors: Ahmad O. Aburizaiza, Daniel P. Ames
Venue: Proceedings of the 2009 International Conference on Advanced Geographic Information Systems & Web Services (2009)

In the world of GIS enabled desktop software development, there are two commonly used development paradigms: the plug-in (or extension) approach and the standalone application approach. A plug-in based application runs on and interacts directly with a host application. Alternatively, standalone GIS-enabled software applications typically use modular GIS components and run independently of any host application. Each of these methods has its own advantages and disadvantages for both the end-user and the developer. Some of these are presented in this paper. Additionally, a case study is presented exploring both software development paradigms in the context of the MapWindow GIS open source software package.
Ephemeral adaptation: the use of gradual onset to improve menu selection performance
Authors: Leah Findlater, Karyn Moffatt, Joanna McGrenere, Jessica Dawson
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

We introduce ephemeral adaptation, a new adaptive GUI technique that improves performance by reducing visual search time while maintaining spatial consistency. Ephemeral adaptive interfaces employ gradual onset to draw the user's attention to predicted items: adaptively predicted items appear abruptly when the menu is opened, but non-predicted items fade in gradually. To demonstrate the benefit of ephemeral adaptation we conducted two experiments with a total of 48 users to show: (1) that ephemeral adaptive menus are faster than static menus when accuracy is high, and are not significantly slower when it is low and (2) that ephemeral adaptive menus are also faster than adaptive highlighting. While we focused on user-adaptive GUIs, ephemeral adaptation should be applicable to a broad range of visually complex tasks.
An iterative SNR estimation algorithm for wiener deconvolution of self-similar images distorted by camera shake blurring
Authors: A. Pereyra Marcelo, Jacoby Daniel
Venue: Proceedings of the 8th conference on Signal, Speech and image processing (2008)

The Wiener deconvolution technique can successfully restore real world images distorted by camera shake blurring. However, its performance is highly sensitive to the estimated SNR, a parameter that is hard to estimate correctly a priori. An iterative algorithm is proposed to find a suitable SNR by gradually testing the Wiener deconvolution on a fragment of the blurred image and observing the self-symmetry of the result, a quality measure that can be estimated by comparing the vertical and horizontal gradient distributions.
A QoS Middle-Ware for Network Adaptive Applications
Authors: Nikos A. Nikolaou, Charilaos A. Tsetsekas, Iakovos S. Venieris
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Multimedia applications introduce new requirements, in terms of network resources. Applications need to be capable of specifying and requesting network resources. Many protocols for Quality of Service (QoS) provision exist. Rendering an application independent from the underlying network reservation protocol constitutes the major motivation for this paper. A QoS Middle-Ware is required that will provide a generalised interface for reservations and, at the same time, will take the role of an umbrella, under which a number of different reservation mechanisms can be placed. This paper presents a layered QoS Middle-Ware architecture and gives details on the specification and implementation of this architecture in terminals supporting IP and ATM-based applications
Multi-connection networks
Authors: Gerald M. Masson
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Many applications involving the manipulation of large amounts of data or the interconnection of various subsystems into specific configurations employ the use of connection networks. Accordingly, a number of impressive results have been developed by the researchers in this field concerning the analysis and design of such networks. However, the vast majority of this work has dealt almost exclusively with a class of connection requirements for which at any time each input to the network is required to have at most one connection to the outputs of the network. It is becoming increasingly evident that there are a significant number of important applications for which this one-to-one type of connecting capability is not sufficient and for which a one-to-many or many-to-many type of connecting capability is needed instead. Networks capable of handling such requirements will be referred to as multi-connection networks, and this paper will consider their analysis and design. Aspects of the extension of existing work concerning the one-to-one type networks will be discussed. In addition, an approach will be described to the design of such networks which results in a new class of structures having multiple connection capability.
Asymmetric periodic orbits in the photogravitational Copenhagen problem
Authors: K. Papadakis, O. Ragos, C. Litzerinos
Venue: Journal of Computational and Applied Mathematics (2009)

In this paper we study the Ox-asymmetric solutions of the planar photogravitational restricted three-body problem in the case of primaries with equal masses and equal values of the radiation pressure parameters. In particular, we are concerned with the families of asymmetric orbits which bifurcate from the well known families a, b, and c. Their evolution is examined via the numerical construction of series of the critical bifurcation points of a, b, and c with respect to the variation of the common radiation parameter q. We also present some illustrative cases of these families for several values of this parameter. In order to avoid the singularity due to binary collisions between the third body and one of the primaries, the equations of motion of the problem are regularized by using the Levi-Civita transformations.
Learning consistent, complete and compact sets of fuzzy rules in conjunctive normal form for regression problems
Authors: Jorge Casillas, Pedro Mart&#x00ed;nez, Alicia D. Ben&#x00ed;tez
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2008)

When a flexible fuzzy rule structure such as those with antecedent in conjunctive normal form is used, the interpretability of the obtained fuzzy model is significantly improved. However, some important problems appear related to the interaction among this set of rules. Indeed, it is relatively easy to get inconsistencies, lack of completeness, redundancies, etc. Generally, these properties are ignored or mildly faced. This paper, however, focuses on the design of a multiobjective genetic algorithm that properly considers all these properties thus ensuring an effective search space exploration and generation of highly legible and accurate fuzzy models.