ppxscal/embedding_network huggingface dataset:
CMAC neural network application on fault diagnosis of water circulation system
Authors: Chin-Pao Hung, Yi-Shin Lin, Wei-Ging Liu
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

In this paper, a CMAC (cerebellar model articulation controller) neural network application on fault diagnosis for water circulation system is proposed. Firstly, we build a CMAC neural network based diagnosis system depending on the fault types. Secondly, the fault patterns, obtained from the China scholar's technical data, would be employed to train the CMAC neural network off-line. Thirdly, the learning algorithm was developed to guarantee the learning convergence. Finally, combining the MATLAB program the trained neural network can be used to diagnose the possible fault types of water circulation system. Comparing with the traditional schemes, following advantages are obtained at least: (1)Eliminate the weights interference between different fault type patterns. (2) Improve the noise rejection ability. (3) Alleviate the dependency to expert's expertise. (4) Memory size can be reduced by new excited addresses coding technique. (5) High learning and diagnosis speed.
Generalized matching networks and their properties
Authors: Xiaofan Yang, Graham M. Megson, Xiaofeng Liao, Jianqiu Cao
Venue: International Journal of Parallel, Emergent and Distributed Systems (2007)

In this paper, we introduce two kinds of graphs: the generalized matching networks (GMNs) and the recursive generalized matching networks (RGMNs). The former generalize the hypercube-like networks (HLNs), while the latter include the generalized cubes and the star graphs. We prove that a GMN on a family of k-connected building graphs is [image omitted] -connected. We then prove that a GMN on a family of Hamiltonian-connected building graphs having at least three vertices each is Hamiltonian-connected. Our conclusions generalize some previously known results.
Undecidability of the Horn-clause implication problem
Authors: J. Marcinkowski
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors prove that the problem 'given two Horn clauses H/sub 1/=( alpha /sub 1/ V-product alpha /sub 2/ to beta ) and H/sub 2/=( gamma /sub 1/ V-product . . . V-product gamma /sub k/ to delta ), where alpha /sub i/, beta , gamma /sub i/, delta are atomic formulas, decide if H/sub 2/, is a consequence of H/sub 1/' is not recursive. This solves one of the last open decidability problems concerning formulas in pure predicate logic (i.e. without equality symbol). The proof depends on a thorough analysis of derivation trees of one rule of inference with two premisses and one conclusion, and it may have further applications.
Exploring power reduction options for a single-chip multiprocessor through system-level modeling
Authors: Patrick Anthony La Fratta, James M. Baker,  Jr.
Venue: Journal of Embedded Computing (2006)

Moore's law predicts that fabrication processes will soon yield over a billion transistors on a single die. Over the past twenty years, the gap between the amount of available real estate on a chip and designer productivity has widened and continues to grow, so that designers are less able to make effective use of the increasing number of transistors on a chip. The primary problem in system-on-a-chip (SoC) design is no longer the limit on the number of resources. Rather, the development of new methodologies and system-level design tools is the challenge that lies ahead, as these have become essential to keeping costs low in the planning and construction of these systems. Designers have realized that the consideration of the overwhelming details at register-transfer level (RTL) early in development restricts design space exploration, inhibits trade-off evaluation, and results in increased time-to-market. In order to effectively utilize the available resources, the entry point of design flows in recent methodologies is at higher levels of abstraction, with consideration to significantly fewer details of the final hardware implementation. In recent years, we have also seen the introduction of single-chip multiprocessors. As new tools and methodologies emerge for abstract system design, proposed solutions to the arising problems in the performance of single-chip multiprocessors can be implemented and evaluated more efficiently. For example, the amount of on-chip memory for such parallel systems continues to steadily rise, but so does the amount of power used by the memory system. In this work, we apply novel design methodology and tools to a single-chip multicore architecture, considering alternatives for power reduction of the storage components through system-level modeling.
Participation and genres of communication in online settings of higher education
Authors: Jimmy Jaldemark
Venue: Education and Information Technologies (2008)

This paper focuses on written utterances in online settings of higher education. It concerns the constitution of the initiation, turn taking and the steering of exchanges of utterances; and it describes these patterns in terms of different genres. The study also concerns participation in higher education and, specifically, participation in educational settings where students and teachers rarely meet face-to-face. Their participation is thus dependant on written utterances in online settings. Overall, this paper discusses constitutive aspects of these written utterances. The educational communication between students and teachers embraced both student- and teacher-centered genres. The distinction between these two genres relates to the functionality of the utterances, the main metaphor for learning and the responsibilities for the communication taken by students and teachers. The emergence of these genres seems to be affected by interplay between the composition of the study-groups, the structure of the task and other aspects of participation through online settings.
High-throughput multicast routing metrics in wireless mesh networks
Authors: Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, Y. Charlie Hu
Venue: Ad Hoc Networks (2008)

The stationary nature of nodes in a mesh network has shifted the main design goal of routing protocols from maintaining connectivity between source and destination nodes to finding high-throughput paths between them. Numerous link-quality-based routing metrics have been proposed for choosing high-throughput routing paths in recent years. In this paper, we study routing metrics for high-throughput tree or mesh construction in multicast protocols. We show that there is a fundamental difference between unicast and multicast routing in how data packets are transmitted at the link layer, and accordingly how the routing metrics for unicast routing should be adapted for high-throughput multicast routing. We propose a low-overhead adaptive online algorithm to incorporate link-quality metrics to a representative multicast routing protocol. We then study the performance improvement achieved by using different link-quality-based routing metrics via extensive simulation and experiments on a mesh-network testbed, using ODMRP as a representative multicast protocol. Our extensive simulation studies show that: (1) ODMRP equipped with any of the link-quality-based routing metrics can achieve higher throughput than the original ODMRP. In particular, under a tree topology, on average, ODMRP enhanced with link-quality routing metrics achieve up to 34% higher throughput than the original ODMRP under low multicast sending rate; (2) the improvement reduces to 21% under high multicast sending rate due to higher interference experienced by the data packets from the probe packets; (3) heavily penalizing lossy links is an effective way in the link-quality metric design to avoid low-throughput paths; and (4) the path redundancy from a mesh data dissemination topology in mesh-based multicast protocols provides another degree of robustness to link characteristics and reduces the additional throughput gain achieved by using link-quality-based routing metrics. Finally, our experiments on an eight-node testbed show that on average, ODMRP using SPP and PP achieves 14% and 17% higher throughput over ODMRP, respectively, validating the simulation results.
Explicit frequency domain noise compensation for time delay estimation
Authors: Xiaoshan He, Jonah Gamba, Tetsuya Shimamura
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

This paper proposes a new approach to static time delay estimation in the presence of white Gaussian noise. The ambiguities and thresholding effects caused by noise are considered. We also consider the case where the delayed time can be a non-integer multiple of the sampling period. The proposed method is based on performing both noise variance estimation and compensation in the frequency domain. A simplified order statistic basd noise variance estimation technique is combined with a phase reconvery technique to effectively extract the source signal before time delay estimation by using bandlimited interpolation and cross-correlation. Simulation results confirm the effectivencess of the proposed method.
Deriving minimal solutions for fuzzy relation equations with max-product composition
Authors: Bih-Sheue Shieh
Venue: Information Sciences: an International Journal (2008)

This work considers fuzzy relation equations with max-product composition. The critical problem in solving such equations is to determine the minimal solutions when an equation is solvable. However, this problem is NP-hard and difficult to solve [A.V. Markovskii, On the relation between equations with max-product composition and the covering problem, Fuzzy Sets and Systems 153 (2005) 261-273]. This work first examines the attributes of a solvable equation and characteristics of minimal solutions, then reduces the equation to an irreducible form, and converts the problem into a covering problem, for which minimal solutions are correspondingly determined. Furthermore, for theoretical and practical applications, this work presents a novel method for obtaining minimal solutions. The proposed method easily derives a minimal solution, and obtains other minimal solutions from this predecessor using a back-tracking step. The proposed method is compared with an existing algorithm, and some applications are described in detail.
On the automation of fixing software bugs
Authors: Andrea Arcuri
Venue: Companion of the 30th international conference on Software engineering (2008)

Software Testing can take up to half of the resources of the development of new software. Although there has been a lot of work on automating the testing phase, fixing a bug after its presence has been discovered is still a duty of the programmers. Techniques to help the software developers for locating bugs exist though, and they take name of Automated Debugging. However, to our best knowledge, there has been only little attempt in the past to completely automate the actual changing of the software for fixing the bugs. Therefore, in this paper we propose an evolutionary approach to automate the task of fixing bugs. The basic idea is to evolve the programs (e.g., by using Genetic Programming) with a fitness function that is based on how many unit tests they are able to pass. If a formal specification of the buggy software is given, more sophisticated fitness functions can be designed. Moreover, by using the formal specification as an oracle, we can generate as many unit tests as we want. Hence, a co-evolution between programs and unit tests might take place to give even better results. It is important to know that, to fix the bugs in a program with this novel approach, a user needs only to provide either a formal specification or a set of unit tests. No other information is required.
Python first: a lab-based introduction to computer science tutorial presentation
Authors: Atanas Radenski
Venue: Journal of Computing Sciences in Colleges (2008)

This tutorial is intended for computer science educators who seek alternatives to either purely commercial languages, such as Java or C++, or purely educational environments, such as Scheme and Alice, for introductory computing courses. Participants will learn how to make introductory computer courses more attractive to students (1) by teaching an easy to learn yet practical OO language - Python, (2) by making all course resources available in a comprehensive online study pack, and (3) by using an extensive set of detailed and easy to follow self-guided labs. Prior knowledge of the Python language is not required.
The Reference Model SimPan - Agent-Based Modelling of Human Behaviour in Panic Situations
Authors: Bernhard Schneider
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

The reference model SimPan describes an agent-based modelling approach for human panic behaviour based upon established psychological theories and findings. The reference model perceives the human being as a psychosomatic, autonomous acting creature with cognitive capabilities that is embedded in a dynamic social environment. The occurrence of different patterns of human behaviour in panic situations is explained by a human's internal state being composed of physical, emotional, cognitive and social aspects. SimPan defines modelling solutions for common environmental, socio-psychological and behavioural phenomena in the context of panic situations, defines their interrelation and impact on an individual's internal state and integrates them into a comprehensive modelling approach. The set of considered phenomena contains physical pressure, crowding, social influence on emergence of emotion, attitude and action, but also the concept of emotional intelligence and the ability of consciously controlling emotion. The presented approach is interdisciplinary and touches on research areas in computer science and psychology.
BibPro: A Citation Parser Based on Sequence Alignment Techniques
Authors: Chien-Chih Chen, Kai-Hsiang Yang, Hung-Yu Kao, Jan-Ming Ho
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The dramatic increase in the number of academic publications has led to a growing demand for efficient organization of the resources to meet researchers’ specific needs. As a result, a number of network services have compiled databases from the public resources scattered over the Internet. However, publications in different conferences and journals follow different citation formats, so the problem of accurately extracting metadata from a publication string has also attracted a great deal of attention in recent years. In this paper, we extend our previous work to propose a new tool called BibPro for extracting metadata from citation strings by using a gene sequence alignment tool. The main enhancement of BibPro to our previously tool is that BibPro does not need knowledge databases (e.g., an author name database) to generate feature indices for citation strings. Instead, only the order of punctuation marks in a citation string is used to represent its format. Second, BibPro employs the Basic Local Alignment Search Tool (BLAST) to find the most similar citation formats in database and then uses the Needleman-Wunsch algorithm to choose the best-fit citation format as the extraction template. Our experimental results show that, in terms of precision and recall, BibPro outperforms other existent systems (e.g., INFOMAP and ParaCite), and BibPro can scale well.
Bright-band detection from radar vertical reflectivity profiles
Authors: M. A. Rico-Ramirez, I. D. Cluckie
Venue: International Journal of Remote Sensing (2007)

The use of quantitative scanning weather radar for precipitation measurements is a vital element of modern hydrology and limits the development of all distributed models of catchment behaviour. The presence of the so-called bright band (or melting layer) contaminates the quantitative precipitation estimates and has delayed the widespread take-up of radar-based precipitation estimates in operational models. The study of the Vertical Reflectivity Profile (VRP) of precipitation is important in order to develop algorithms to correct scanning weather radar measurements for the variation of the VRP at long ranges. Therefore, this paper presents an algorithm to detect the extent of the bright band using high-resolution VRP's. The boundaries of the bright band are identified by a new algorithm which utilizes a rotational coordinate system for identifying the upper and lower parts of the bright band. This overcomes some of the difficulties experienced when using the gradient of the reflectivity in conventional bright-band detection algorithms. The reflectivities above, within, and below the bright band are then used to construct idealized VRP's to correct scanning weather radar measurements.
Programmable logic circuits based on ambipolar CNFET
Authors: M. Haykel Ben Jamaa, David Atienza, Yusuf Leblebici, Giovanni De Micheli
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Recently, it was demonstrated that the polarity of carbon nanotube field effect transistors can be electrically controlled. In this paper we show how Programmable Logic Arrays (PLA) can be built out of these devices, and we illustrate how they outperform usual PLA by internal signal inversion. The simulations show an area saving up to ~ 21% and decrease of the delay in PLA-based FPGA by 50%. We also show that this architecture is suitable for high-performance design tools and defect-tolerance approaches.
Adaptive processing for beamforming with coherent interference using uniform circular arrays
Authors: Ju-Hong Lee, Shuo-Wei Hsiao
Venue: Digital Signal Processing (2008)

The paper deals with the problem of adaptive array beamforming using a uniform circular array (UCA) in the presence of coherent interference. The well-known scheme of spatial smoothing (SS) widely used to tackle the coherent problem in the cases of 1-D uniform linear array (ULA) and uniform rectangular array (URA) cannot work for the UCA case. This is mainly due to the fact that the direction vector of each signal received by a UCA does not possess a Vandermonde structure. In this paper, we present a method based on subarray beamforming in conjunction with an averaging scheme to effectively mitigate the effect due to coherent interference in the UCA case. Theoretical analysis regarding the validity of the proposed method is also presented. Several simulation examples are provided for showing the effectiveness of the proposed method.
Pervasive and Trustworthy Healthcare
Authors: Kai Wang, Yan Sui, Xukai Zou, Arjan Durresi, Shiaofen Fang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Healthcare is an information intensive industry. Pervasive computing, as the third wave of computing technology and when applied to healthcare systems, could potentially revolutionize next generation medical applications and significantly improve the quality of healthcare services. Healthcare information is very sensitive and security, privacy, and trust have been critical issues in health care and Medical Information Systems. Due to the specific features of pervasive computing, these issues become much more challenging in pervasive healthcare. In this paper, we summarize some typical healthcare services pervasive healthcare can provide, identify integration and security challenges facing pervasive healthcare systems, and propose some solutions to (some) of these challenging problems.
Wave analysis of different splitting methods in the linearised shallow water equations
Authors: A. Havasi
Venue: International Journal of Computational Science and Engineering (2007)

The shallow water equations describe motions in a shallow, incompressible and nonviscous fluid layer on the rotating Earth. Due to their relative simplicity, they are widely used for testing and analysing new numerical methods developed for weather prediction models. In this paper, we apply different operator splittings, based on directional decomposition, to the linearised form of the shallow water equations obtained by the method of small perturbations. This system has three types of harmonic wave solutions with known dispersion relations and phase velocities. We investigate how the application of operator splitting modifies these important characteristics, and compare the performance of different splitting methods from this point of view.
Using Security Patterns to Combine Security Metrics
Authors: Thomas Heyman, Riccardo Scandariato, Christophe Huygens, Wouter Joosen
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Measuring security is an important step in creating and deploying secure applications. In order to efficiently measure the level of security that an application provides, three problems need to be solved: obviously metrics need to be available, a suitable metrics framework needs to be chosen and implemented, and the resulting measurements need to be interpreted. This work focuses on the second and third problem. We propose an approach to facilitate the selection and integration of appropriate security metrics, and to support the aggregation and interpretation of measurements. Our approach associates security metrics to security patterns, and we exploit the relationships between security patterns and security objectives to enable the interpretation of measurements. The approach is illustrated in a case study.
Full-Chip Leakage Verification for Manufacturing Considering Process Variations
Authors: Tao Li, Zhiping Yu
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

A novel compact model for subthreshold leakage Isub including its extraction scheme has been developed in this paper. Both quantum and stress effects have been covered in this model, and it accurately fits experiment data for both nMOSFETs and pMOSFETs. A study of subthreshold leakage variations (SLVs) for the 65nm technology has been reported for the first time. Gate length (L) roughness and variations in Vth are found to account for most of the SLVs. With the proposed model, a statistical methodology has been developed to address the growing issue of full-chip leakage verification for actual-fabrication circuits.
Due date quoting and scheduling interaction in production lines
Authors: A. Alfieri
Venue: International Journal of Computer Integrated Manufacturing (2007)

Scheduling is one of the most important activities of many firms, especially in a make-to-order environment, since it is used for planning external activities (e.g. material procurement) and quoting customers' due dates. Changes in schedules (owing, for example, to a machine failure) may delay activities and decrease the customer service level. Our work combines lead time quoting with scheduling decisions. We use a computer-based simulation to study a production line in a dynamic context, with multiple job types, stochastic job arrivals and random machine failures. The results of our experiment show a strict relationship among lead time quoting policies, scheduling algorithms, customer service level and cost function used to evaluate the performance of the firm and this relationship itself is shown to represent a powerful tool for production managers.