ppxscal/embedding_network huggingface dataset:
Knowledge transfer between robots with identical tasks execution
Authors: Jean J. Saade
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

This paper considers the transfer of knowledge expressed in the form of a collection of fuzzy or linguistic inference rules, also called knowledge or rule-base, from one robot (teacher) to another robot (student) in the case where both robots are supposed to perform the same task. Some rules are assumed taught or transferred to the student; i.e., they are known, and others are missing. The objective of this study is to have the student robot uncover the missing rules through self-experience and using the transferred rules. This objective is achieved by devising a novel method that enables the student robot to complete the knowledge-base. The completed rule-base would not necessarily turn out to be identical to the one possessed by the teacher robot. But, once it is used in the execution of the same task, it leads to satisfactory performance from a comparative perspective.
Graph connectivity and monadic NP
Authors: T. Schwentick
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

Ehrenfeucht games are a useful tool in proving that certain properties of finite structures are not expressible by formulas of a certain type. In this paper a new method is introduced that allows the extension of a local winning strategy for Duplicator, one of the two players in Ehrenfeucht games, to a global winning strategy. As an application it is shown that graph connectivity cannot be expressed by existential second-order formulas, where the second-order quantification is restricted to unary relations (monadic NP), even, in the presence of a built-in linear order. As a second application it is stated, that, on the other hand, the presence of a linear order increases the power of monadic NP more than the presence of a successor relation.
Exploiting matrix sparsity for symbolic analysis
Authors: Zdenek Kolka, Viera Biolková, Dalibor Biolek
Venue: Proceedings of the 4th WSEAS International Conference on Systems Theory and Scientific Computation (2004)

This paper deals with a method for symbolic approximation that exploits the sparsity of circuit matrix to achieve an acceptable speed for large circuits. The method is based on a simplification of the equations of circuit models of linear or linearized circuits in the frequency domain. The simplified model is then analyzed symbolically. The algorithm proposed has been developed with the aim of obtaining maximum computational efficiency.
TMAinspect, an EGEE Framework for Tissue MicroArray Image Handling
Authors: Antonella Galizia, Federica Viti, Alessandro Orro, Daniele D'Agostino, Ivan Merelli, Luciano Milanesi, Andrea Clematis
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

The merging between molecular biology and computer science is becoming a key point in knowledge discovery, in particular when huge amount of datacoming from different laboratories need to be integrated and analyzed. For example Tissue MicroArray (TMA) is a high throughput technology that allows researchers to analyze several tissue samples in a parallel way. TMA is a good validation method of researcher’s hypothesis about pathological tissue morphology and biomarkers evaluation. In thiscontext, the Grid technology is a good opportunity to share data and solve intensive storage and computing problems. However, the exploitation of the Grid is nota trivial pursuit for many users. Nowadays, an important issue is to provide a simplified use of Grid resources, enabling the use of tools that scientists usually employ. In this paper, we present TMA inspect,a Web based system for Tissue Microarray experiment analysis that provides to not expert users a graphical interface to search for TMA images and to efficiently process them in EGEE. For the image elaboration we use PIMA(GE)2 Lib, the Parallel IMAGE processing GEnoa Library.
Adjoint-based optimization of PDE systems with alternative gradients
Authors: Bartosz Protas
Venue: Journal of Computational Physics (2008)

In this work we investigate a technique for accelerating convergence of adjoint-based optimization of PDE systems based on a nonlinear change of variables in the control space. This change of variables is accomplished in the ''differentiate - then - discretize'' approach by constructing the descent directions in a control space not equipped with the Hilbert structure. We show how such descent directions can be computed in general Lebesgue and Besov spaces, and argue that in the Besov space case determination of descent directions can be interpreted as nonlinear wavelet filtering of the adjoint field. The freedom involved in choosing parameters characterizing the spaces in which the steepest descent directions are constructed can be leveraged to accelerate convergence of iterations. Our computational examples involving state estimation problems for the 1D Kuramoto-Sivashinsky and 3D Navier-Stokes equations indeed show significantly improved performance of the proposed method as compared to the standard approaches.
Edge detection by wavelet scale correlation
Authors: Imran Touqir, Muhammad Saleem, Adil Masood Siddiqui
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

The spatial and scale space domain techniques are used independently to detect edges the noisy images. When noise density surpasses a limit, classical operators are unable to detect the edges. The frequency domain filtering for edge detection in a noisy scenario is inadequate due to Fourier's global behavior. Wavelet analysis for noisy images also reveals dominance of noisy pixels over the edges. Even multiresolution analysis falls short to distinguish noise and edge points in the synthesized image for depleted signal to noise ratio. In this paper noisy images have been decomposed up to fourth level through multilevel wavelet decomposition. The wavelet details coefficients are thresholded by four times the mean value of the image matrix. The lower dimensional wavelet detail's coefficient matrices are interpolated up to the original size of the image. The noisy pixels are partially eliminated at each scale. However in the process, few edge points are also deteriorated. Independently multiplying each detail matrix by its three higher scale image matrices respectively significantly reduces the noise and enhances the directional edges. The reconstruction results in enhanced horizontal, vertical and diagonal details. The three images are synthesized to obtain the augmented edge map of the image.
On the Dynamic Ant Colony Algorithm Optimization Based on Multi-pheromones
Authors: Ya-mei Xia, Jun-liang Chen, Xiang-wu Meng
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

In this paper, an algorithm DACO (Dynamic Ant Colony Algorithm Optimization Based onMulti-pheromone) is put forward to apply to the dynamics of web services state and QoS in service composition optimization. Setting multiple pheromones to denote different QoS, this algorithm can apply to such conditions as service invalidation, service add, service QoS change, etc. The DACO is also improved based on experiment in order to make it better and faster converge to optimization value. Emulation experiment made in this paper shows that the DACO is more effective than Ant Colony Algorithm.
Fabrication of nano-hole array patterns on transparent conducting oxide layer using thermally curable nanoimprint lithography
Authors: Kyeong-Jae Byeon, Seon-Yong Hwang, Heon Lee
Venue: Microelectronic Engineering (2008)

A two-dimensional, periodic array of nano-sized holes was fabricated in an indium tin oxide (ITO) layer, deposited onto a glass substrate with nanoimprint lithography. As a result of a thermally curing imprint process, hole array patterns with a diameter of 130nm and a pitch of 520nm were formed on the ITO surface with a near zero residual layer. After inductively coupled plasma etching process of ITO using the imprinted polymer pattern as an etch mask, a tapered-hole array pattern was fabricated on the ITO layer, thereby producing a prominent diffusion phenomenon in the near ultraviolet region.
A full-body layered deformable model for automatic model-based gait recognition
Authors: Haiping Lu, Konstantinos N. Plataniotis, Anastasios N. Venetsanopoulos
Venue: EURASIP Journal on Advances in Signal Processing (2008)

This paper proposes a full-body layered deformable model (LDM) inspired by manually labeled silhouettes for automatic model-based gait recognition from part-level gait dynamics in monocular video sequences. The LDM is defined for the fronto-parallel gait with 22 parameters describing the human body part shapes (widths and lengths) and dynamics (positions and orientations). There are four layers in the LDM and the limbs are deformable. Algorithms for LDM-based human body pose recovery are then developed to estimate the LDM parameters from both manually labeled and automatically extracted silhouettes, where the automatic silhouette extraction is through a coarse-to-fine localization and extraction procedure. The estimated LDM parameters are used for model-based gait recognition by employing the dynamic time warping for matching and adopting the combination scheme in AdaBoost.M2. While the existing model-based gait recognition approaches focus primarily on the lower limbs, the estimated LDM parameters enable us to study full-body model-based gait recognition by utilizing the dynamics of the upper limbs, the shoulders and the head as well. In the experiments, the LDM-based gait recognition is tested on gait sequences with differences in shoe-type, surface, carrying condition and time. The results demonstrate that the recognition performance benefits from not only the lower limb dynamics, but also the dynamics of the upper limbs, the shoulders and the head. In addition, the LDM can serve as an analysis tool for studying factors affecting the gait under various conditions.
Analysis on Gender of Silkworms by MRI Technology
Authors: Cong Liu, Zhao Hui Ren, Hong Zhi Wang, Pei Qiang Yang, Xue Long Zhang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

At present silkworm cocoons, dried, boiled and reeled, are the female and male mix, so it's very difficult to produce high grade raw silk in large quantity. In the progress of the silk reeling what we can do to separate the complex of female and male silkworms still encounters presently certain difficulties. In this paper the intrinsic relaxation time of the free water and the bound water in silkworms was analyzed and the relaxation model of silkworm was established by use of the proportion difference of the free water and the bound water in the silk gland tissue of the midriff. Finally the gender of the silkworm has been distinguished exactly without destruction by the T2 weighted imaging of magnetic resonance imaging (MRI) technology in the experiment designed. The result of experiment has enormous instruction significance to the production of the silkworm cocoon mixed at the present time.
Back to the Future?
Authors: Norman Chonacky
Venue: Computing in Science and Engineering (2008)

Editor-in-chief Norman Chonacky draws attention to Greg Wilson's argument that we aren't preparing students to be computationalists who will be able to call their work science.
Encouraging blended learning and ICT use at Universitat de Val&egrave;ncia to improve the learning process with the .LRN platform: best practices and tools
Authors: Vicente Cerverón-Lleó, Paloma Moreno-Clari, Sergio Cubero, Darío Roig, Agustín Lopez-Bueno
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

The Universitat de Val&egrave;ncia, one of the largest, oldest and most varied in Spain, concerned about the efficiency of the learning processes in the context of the convergence process towards the Higher Education European Space, has conducted educative innovation experiences in several degrees, diversifying learning activities. Interested in enhancing traditional classroom learning by use of ICT (with progressive blended learning introduction) has established a learning management system to enhance the learning and communication processes for the whole university. The overall goal was to build skills in ICT use in order to improve learning process quality and student participation. This paper describes the starting point, the selection and implementation of an Open Source Learning Management System for the whole university, and the achievements on ICT use and expansion. Evaluation results of 2-years current campuswide use of LMS "Aula Virtual", conclusions and future work are also included.
Embedded Deterministic Test Exploiting Care Bit Clustering and Seed Borrowing
Authors: Adam B. Kinsman, Nicola Nicolici
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Embedded deterministic test is a manufacture test paradigm that combines the compression advantage of built-in self-test with the high fault coverage of deterministic stimuli, inherent to methods based on automatic test pattern generation and external testers. Despite enabling the use of low-cost testers for rapidly achieving high fault coverage, embedded deterministic test must consciously use the available tester channel bandwidth to ensure non-disruptive scaling to future devices of increased complexity. The focus of this paper is to show how exploitation of care bit clustering in a test set combined with a low cost implementation for on-chip decompressors based on seed borrowing, facilitates an increased utilization of the tester channel bandwidth, and hence improved compression of deterministic stimuli.
An Efficient Permutation Approach for Classical and Bioequivalence Hypothesis Testing of Biomedical Shape Study
Authors: Chunxiao Zhou, Yongmei Michelle Wang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

A new statistical permutation analysis method is presented in this paper to efficiently and accurately localize regionally specific shape differences between groups of 3D biomedical images. It can improve the system’s efficiency by approximating the permutation distribution of the test statistic with Pearson distribution series. This procedure involves the calculation of the first four moments of the permutation distribution, which are derived theoretically and analytically without any permutation. Furthermore,bioequivalence testing aims for practical significances between the two groups that are statistically significant with the shape differences larger than a desired threshold. Experimental results based on both classical and bioequivalence hypothesis tests using simulated data and real biomedical images are presented to demonstrate the advantages of the proposed approach.
An improved implementation of activity based costing using wireless mesh networks with MIMO channels
Authors: Lyonel Laulié, Ismael Soto, Rolando Carrasco
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

The next paper brings the development of an improve implementation of Activity-based costing using Wireless Mesh Networks with MIMO channels. The study of the efficiency of this implementation in MIMO channels, is simulated with Space-Time Block Coding with convolutional codification and BPSK modulation, to show that this way of manages costing and the correct exploitation of wireless technologies in communications, generate new value to enterprises. Also the monetary differences of the costs, the impact of the use of better channels are presented.
Configurable data memory for multimedia processing
Authors: Eero Aho, Jarno Vanne, Timo D. Hämäläinen
Venue: Journal of Signal Processing Systems (2008)

In modern multimedia applications, memory bottleneck can be alleviated with special stride data accesses. Data elements in stride access can be retrieved in parallel with parallel memories, in which the idea is to increase memory bandwidth with several memory modules working in parallel and feed the processor with only necessary data. Arbitrary stride access capability with interleaved memories is described in previous research where the skewing scheme is changed at run time according to the currently used stride. This paper presents the improved schemes which are adapted to parallel memories. The proposed novel parallel memory implementation allows conflict free accesses with all the constant strides which has not been possible in prior application specific parallel memories. Moreover, the possible access locations are unrestricted and the accessed data element count equals to the number of memory modules. Timing and area estimates are given for Altera Stratix FPGA and 0.18 micrometer CMOS process with memory module count from 2 to 32. The FPGA results show 129 MHz clock frequency for a system with 16 memory modules when read and write latencies are 3 and 2 clock cycles, respectively. The complexity of the proposed system is shown to be a trade-off between application specific and highly configurable parallel memory system.
EducationPaving the way for computational thinking
Authors: Mark Guzdial
Venue: Communications of the ACM (2008)

Drawing on methods from diverse disciplines---including computer science, education, sociology, and psychology---to improve computing education.
Leakage power-aware clock skew scheduling: converting stolen time into leakage power reduction
Authors: Min Ni, Seda Ogrenci Memik
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Clock skew scheduling has been traditionally considered as a tool for improving the clock period in a sequential circuit. Timing slack is "stolen" from fast combinational blocks to be used by slower blocks to meet a more stringent clock cycle time. Instead, we can leverage on the borrowed time to achieve leakage power reduction during gate sizing and/or dual Vth assignment. In this paper, we present the first approach to the best of our knowledge for integrating clock skew scheduling, threshold voltage assignment, and gate sizing into one optimization formulation. Over 29 circuits in the ISCAS89 benchmark suite, this integrated approach can reduce leakage power by as much as 55.83% and by 18.79% on average, compared to using combinational circuit based power optimization on each combinational block without considering clock skews. Using a 65nm dual Vth technology library, this corresponds to a 23.87% peak reduction (6.15% on average) in total power at the ambient operating temperature. The average total power reduction further increases to 9.83% if the high temperature library of the same process technology is used.
A simple and effective real-time eyes detection human detection without training procedure
Authors: Ching-Tang Hsieh, Eugene Lai, Chi-Liang Shen, Yeh-Kuang Wu
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

An effective and real-time eyes detection system based on the symmetric and geometric relationships of human-eyes region in gray-level images is presented. In order to reduce the search effort and eliminate the noise impact, we first perform the edge processing with Sobel filter. We then make use of the characteristics of symmetric relationship of human-eyes region to find out the possible regions of human eyes. Moreover, we use the geometric characteristic of human-eyes region to preliminarily exclude the region without eyes and reach the locations of possible eyes regions as quickly as we can,. Finally, to merge all possible regions with eyes into one and to exclude the regions without human eyes effectively, the eyes verification process is also proceeded. The superior performance of the eyes detection of the proposed method is justified in experiments on a large number of images. The demonstration of our work is available at: http://www.ee.tku.edu.tw/~dsp/tkufd
Modifying Contracts with Larissa Aspects
Authors: David Stauch
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

This paper combines two successful techniques from software engineering, aspect-oriented programming and design-by-contract, and applies them in the context of reactive systems. For the aspect language Larissa and contracts expressed with synchronous observers, we show how to apply an aspect asp to a contract C and derive a new contract C^', such that for any program P which fulfills C, P with asp fulfills C^'. We validate the approach on a medium-sized example.
Obtaining adaptation of virtual courses by using a collaborative tool and learning design
Authors: Luisa M. Romero-Moreno, F. Javier Ortega, José A. Troyano
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

In this work is described a collaborative tool Learning Activity Management System, LAMS (Macquarie University, Australia) which has been developed for designing, managing and delivering online collaborative learning activities. It provides teachers with a highly intuitive visual authoring environment for creating sequences of learning activities. These activities can include a range of individual tasks, small group work and whole class activities based on both content and collaboration. Then a methodology to apply this tool is described.
Kicking the tires of software transactional memory: why the going gets tough
Authors: Richard M. Yoo, Yang Ni, Adam Welc, Bratin Saha, Ali-Reza Adl-Tabatabai, Hsien-Hsin S. Lee
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

Transactional Memory (TM) promises to simplify concurrent programming, which has been notoriously difficult but crucial in realizing the performance benefit of multi-core processors. Software Transaction Memory (STM), in particular, represents a body of important TM technologies since it provides a mechanism to run transactional programs when hardware TM support is not available, or when hardware TM resources are exhausted. Nonetheless, most previous researches on STMs were constrained to executing trivial, small-scale workloads. The assumption was that the same techniques applied to small-scale workloads could readily be applied to real-life, large-scale workloads. However, by executing several nontrivial workloads such as particle dynamics simulation and game physics engine on a state of the art STM, we noticed that this assumption does not hold. Specifically, we identified four major performance bottlenecks that were unique to the case of executing large-scale workloads on an STM: false conflicts, over-instrumentation, privatization-safety cost, and poor amortization. We believe that these bottlenecks would be common for any STM targeting real-world applications. In this paper, we describe those identified bottlenecks in detail, and we propose novel solutions to alleviate the issues. We also thoroughly validate these approaches with experimental results on real machines.