ppxscal/embedding_network huggingface dataset:
Application of homotopy analysis method for fin efficiency of convective straight fins with temperature-dependent thermal conductivity
Authors: Mustafa Inc
Venue: Mathematics and Computers in Simulation (2008)

In this paper, the homotopy analysis method (HAM) has been used to evaluate the efficiency of straight fins with temperature-dependent thermal conductivity and to determine the temperature distribution within the fin. The fin efficieny of the straight fins with temperature-dependent thermal conductivity has been obtained as a function of thermo-geometric fin parameter. It has been observed that the thermal conductivity parameter has a strong influence over the fin efficiency. The series solution is developed and the reccurance relations is given. Comparison of the results with those of the homotopy perturbation method (HPM) and the Adomian decomposition method (ADM), has led us to significant consequences. The analytic solution of the problem is obtained by using the HAM. The HAM contains the auxiliary parameter @?, which provides us with a simple way to adjust and control the convergence region of solution series. By suitable choice of the auxiliary parameter @?, we can obtain reasonable solution for large values of @t and @h.
Mobile Robots for an E-Mail Interface for People Who Are Blind
Authors: V. Estivill-Castro, S. Seymon
Venue: RoboCup 2006: Robot Soccer World Cup X (2006)

The availability of inexpensive robotic hardware has brought to realization the dream of having autonomous mobile robots around us. As such, the research community has recently manifested more interest in assisting robotic technology (see proceedings of the last two IEEE RO-MAN conferences, the emergence of the RoboCup@Home challenge at RoboCup and the first annual Human Computer Interaction Conference jointly sponsored by IEEE and ACM). Robots provide to the blind what was lost as textual interfaces were replaced by GUIs. This paper describes the design, implementation and testing of a first prototype of a multi-modal Human-Robot Interface for people with Vision Impairment. The robot used is the commercially available four legged SONY Aibo.
Regression Modeling with Fuzzy Relations
Authors: Rafał Scherer
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

In the paper relational neuro-fuzzy systems are described with additional fuzzy relation connecting input and output linguistic fuzzy terms. Thanks to this the fuzzy rules have more complicated structure and can be better suited the task. Fuzzy clustering and relational equations are used to obtain the initial set of fuzzy rules and systems are then learned by the backpropagation algorithm.Simulations shows excellent performance of the modified neuro-fuzzy systems.
Range Image Based Classification System Using Support Vector Machines
Authors: Seyed Eghbal Ghobadi, Klaus Hartmann, Otmar Loffeld, Wolfgang Weihs
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

This paper describes a classification system based on Support Vector Machines (SVM) and using 3D range images. Two kinds of camera systems are used to provide the classification system with 3D range images: Time-oF-Flight (TOF) camera and Stereo Vision System. While the former uses the modulated infrared lighting source to provide the range information in each pixel of a Photonic Mixer Device(PMD) sensor, the latter employs the disparity map from stereo images to calculate three dimensional data. The proposed detection and classification system is used to classify different 3D moving objects in a dynamic environment under varying lighting conditions. The images of each camera are first preprocessed and then two different approaches are applied to extract their features. The first approach is a Computer Generated method which uses the Principal Component Analysis (PCA) to get the most relevant projection of the data over the eigenvectors and the second approach is a Human Generated method which extracts the features based on some heuristic techniques. Two training data sets are derived from each image set based on heuristic and PCA features to train a multi class SVM classifier. The experimental results show that the proposed classifier based on range data from TOF camera is superior to that from the stereo system.
Design methodology for embedded computer vision systems
Authors: Shuvra S. Bhattacharyya
Venue:  (2007)

Computer vision has emerged as one of the most popular domains of embedded applications. Though various new powerful embedded platforms to support such applications have emerged in recent years, there is a distinct lack of efficient domain-specific synthesis techniques for optimized implementation of such systems. In this thesis, four different aspects that contribute to efficient design and synthesis of such systems are explored: (1) Graph Transformations: Dataflow modeling is widely used in digital signal processing (DSP) systems. However, support for dynamic behavior in such systems exists mainly at the modeling level and there is a lack of optimized synthesis techniques for these models. New transformation techniques for efficient system-on-chip (SoC) design methods are proposed and implemented for cyclo-static dataflow and its parameterized version (parameterized cyclo-static dataflow)&mdash;two powerful models that allow dynamic reconfigurability and phased behavior in DSP systems. (2) Design Space Exploration: The broad range of target platforms along with the complexity of applications provides a vast design space, calling for efficient tools to explore this space and produce effective design choices. A novel architectural level design methodology based on a formalism called multirate synchronization graphs is presented along with methods for performance evaluation. (3) Multiprocessor Communication Interface: Efficient code synthesis for emerging new parallel architectures is an important and sparsely-explored problem. A widely-encountered problem in this regard is efficient communication between processors running different sub-systems. A widely used tool in the domain of general-purpose multiprocessor clusters is MPI (Message Passing Interface). However, this does not scale well for embedded DSP systems. A new, powerful and highly optimized communication interface for multiprocessor signal processing systems is presented in this work that is based on the integration of relevant properties of MPI with dataflow semantics. (4) Parameterized Design Framework for Particle Filters: Particle filter systems constitute an important class of applications used in a wide number of fields. An efficient design and implementation framework for such systems has been implemented based on the observation that a large number of such applications exhibit similar properties. The key properties of such applications are identified and parameterized appropriately to realize different systems that represent useful trade-off points in the space of possible implementations.
A Useful Undecidable Theory
Authors: Victor L. Selivanov
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

We show that many so called discrete weak semilattices considered earlier in a series of author's publications have hereditary undecidable first-order theories. Since such structures appear naturally in some parts of computability theory, we obtain several new undecidability results. This applies e.g. to the structures of complete numberings, of m-degrees of index sets and of the Wadge degrees of partitions in the Baire space and &omega;-algebraic domains.
New and Old Tools and Programming Models for High-Performance Computing
Authors: Ewing Lusk
Venue: Proceedings of the 14th European PVM/MPI User's Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2007)

The computing power to be made available to applications in the coming years continues to increase. Hardware vendors anticipate many cores on single chips and fast networks connecting them, enabling a bewildering array of new approaches to parallel programming whose superiority to "classical" approaches (MPI) remains uncertain. One certainty is that application developers will need tools that promote understanding of their parallel codes. In this talk we will review a number of approaches to application development, from Fortran77+MPI to the relatively exotic DARPA "high productivity" languages, together with a sampling of tools, both new and old, that aid programmers in application development.
Run-Time Adaptable Architectures for Heterogeneous Behavior Embedded Systems
Authors: Antonio Carlos Beck, Mateus B. Rutzig, Georgi Gaydadjiev, Luigi Carro
Venue: Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications (2008)

As embedded applications are getting more complex, they are also demanding highly diverse computational capabilities. The majority of all previously proposed reconfigurable architectures targets static data stream oriented applications, optimizing very specific computational kernels, corresponding to the typical embedded systems characteristics in the past. Modern embedded devices, however, impose totally new requirements. They are expected to support a wide variety of programs on a single platform. Besides getting more heterogeneous, these applications have very distinct behaviors. In this paper we explore this trend in more detail. First, we present a study about the behavioral difference of embedded applications based on the Mibench benchmark suite. Thereafter, we analyze the potential optimizations and constraints for two different run-time dynamic reconfigurable architectures with distinct programmability strategies: a fine-grain FPGA based accelerator and a coarse-grain array composed by ordinary functional units. Finally, we demonstrate that reconfigurable systems that are focused to single data stream behavior may not suffice anymore.
Representing program schemes in logic
Authors: John C. Cherniavsky, Robert L. Constable
Venue: Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972) (1972)

Our principle technical results are the development of a family of first order logics (called FILs), the translation of classes of program schemes into these logics and the development of routine decision procedures for these representations. We feel the results are interesting because the class of schemes include a previously studied important class (Paterson's monadic non-intersecting loops class), because the decision procedures are routine and the new logics are natural, and finally because this work provides information and tools for the important problem of designing and compiling highly declarative programming languages.
Influence of Reading Errors on the Text-Based Automatic Evaluation of Pathologic Voices
Authors: Tino Haderlein, Elmar Nöth, Andreas Maier, Maria Schuster, Frank Rosanowski
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

In speech therapy and rehabilitation, a patient's voice has to be evaluated by the therapist. Established methods for objective, automatic evaluation analyze only recordings of sustained vowels. However, an isolated vowel does not reflect a real communication situation. In this paper, a speech recognition system and a prosody module are used to analyze a text that was read out by the patients. The correlation between the perceptive evaluation of speech intelligibility by five medical experts and measures like word accuracy (WA), word recognition rate (WR), and prosodic features was examined. The focus was on the influence of reading errors on this correlation.The test speakers were 85 persons suffering from cancer in the larynx. 65 of them had undergone partial laryngectomy, i.e. partial removal of the larynx. The correlation between the human intelligibility ratings on a five-point scale and the machine was r = ---0.61 for WA, r ≈ 0.55 for WR, and r ≈ 0.60 for prosodic features based on word duration and energy. The reading errors did not have a significant influence on the results. Hence, no special preprocessing of the audio files is necessary.
Analysis the Impact of Genetic Operators in Evolution Strategies
Authors: Guangming Lin, Lishan Kang, Yongsheng Liang, Ruhul Sarker
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

Genetic operators play an important role in Evolution Strategies (ES). There are two important issues in the evolution process of the genetic search: exploration and exploitation. We analyze the impact ofthe genetic operators in ES. The Classical Evolution Strategies (CES) relies on Gaussian mutation, whereas Fast Evolution Strategies (FES) selects Cauchy distribution as the primary mutation operator. The basic genetic operators of ES, as well as their performances on a number of benchmark problems are analyzed. In this paper, we propose an Improve FES (IFES) in which the basic idea is to mix different search biases of Cauchy and Gaussian mutations. IFES generates two offspring from each parent, one is then chosen as the offspring. Extensive empirical studies have been carried out to evaluate the performances of IFES, FES and CES. From the experimental results on four widely used test functions, we can show that IFES outperforms both FES and CES. Finally we conclude that it is important to strike a balance between exploration and exploitation.
Beatrice Helen Worsley: Canada's Female Computer Pioneer
Authors: Scott M. Campbell
Venue: IEEE Annals of the History of Computing (2003)

When Beatrice Worsley died in 1972, Canada lost a computer pioneer and a witness to several great moments in computing history. This biography aims to provide insight into Worsley's obscure, but remarkable and all too short, career. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
DECP: A Distributed Election Clustering Protocol for Heterogeneous Wireless Sensor Networks
Authors: Xianghui Wang, Guoyin Zhang
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Heterogeneous wireless sensor networks are energy limited and imbalance networks, load balancing and energy efficiency is the most challenging task in these networks. In this paper, we propose a distributed election clustering protocol to prolong the stable region of wireless sensor networks, which is based on remaining energy and communication cost to elect suitable cluster-head nodes. Compared with classical clustering protocol, our protocol can maintain load balancing of networks, and extremely prolong the stable region of network lifetime.
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
Authors: Markus Maier, Steffen Mecke, Dorothea Wagner
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A polynomial algorithm which guarantees a factor-k-approximation for this problem has been presented before, but its complexity status was open. In this paper we prove that MEEP is NP-hard and give new lower and upper bounds on the approximation factor of the k-approximation algorithm. For MEEP on acyclic graphs we introduce an exact, polynomial algorithm which is then extended to a heuristic for arbitrary graphs.
Mathematical and Numerical Aspects of a Phase-field Approach to Critical Nuclei Morphology in Solids
Authors: Lei Zhang, Long-Qing Chen, Qiang Du
Venue: Journal of Scientific Computing (2008)

We investigate a phase-field model for homogeneous nucleation and critical nucleus morphology in solids. We analyze the mathematical properties of a free energy functional that includes the long-range, anisotropic elastic interactions. We describe the numerical algorithms used to search for the saddle points of such a free energy functional based on a minimax technique and the Fourier spectral implementation. It is demonstrated that the phase-field model is mathematically well defined and is able to efficiently predict the critical nucleus morphology in elastically anisotropic solids without making a priori assumptions.
Algorithms acceleration by a reconfigurable computing platform of fpga
Authors: Nader Bagherzadeh
Venue:  (2007)

Process technology's continual shrinking trend following Moore's Law will enable Field Programmable Gate Array (FPGA) to pack billions of smaller and faster transistors on the same chip by the end of this decade. Enormous capacity of this FPGA chip increases parallel processing power for algorithms. But that alone is not enough for performance boost of algorithms. We need innovative on-chip application configuration architecture design and efficient algorithms to transform the application originally meant for microprocessor for alternative hardware implementation. Bringing data from external memory to the hardware accelerator through bandwidth limited bus limits the acceleration power of the hardware itself. In this dissertation we analyze the cache memory requirements of many data intensive streaming applications. Accordingly we design on-chip memory architecture and memory interface with larger external off-chip memory depending on input data rate and required throughput of output data. The first contribution of this dissertation is an application configuration architecture called Memory-Aware Run-Time Reconfigurable Embedded System (MARTRES) for modern FPGAs like Xilinx's Virtex-4 and Virtex-5 devices to provide balanced amount of logic, memory blocks and interconnect bandwidth. The goal of the configuration architecture is to provide flexibility, performance improvement and increased resource utilization in the era of applications convergence on small battery powered mobile handsets. The second contribution of this dissertation is an online task placement algorithm based on bin packing for mapping a dynamic task list onto MARTRES configuration architecture, called Hierarchical Best Fit Ascending (HBFA) algorithm, which is more efficient than Best Fit (BF) algorithm. The time complexity of the proposed online placement algorithm, HBFA, is reduced to O(n) compared to BF algorithm's time complexity of O(n2), when the quality of the placement solution by HBFA is better than that of BF algorithm. The third contribution of this dissertation is a novel partitioning and scheduling algorithm for MARTRES configuration architecture, whose goal is to optimize hardware resource usage and execution time of streaming applications. We reduce the execution time of applications by exploiting the temporal parallelism in streaming applications to reduce the reconfiguration cost of the hardware.
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
Authors: Artur Jeż, Alexander Okhotin
Venue: Proceedings of the 2nd international symposium on Computer Science in Russia: Theory and Applications (2007)

It has recently been proved (Jeż, DLT 2007) that conjunctive grammars (that is, context-free grammars augmented by conjunction) generate some nonregular languages over a one-letter alphabet. The present paper improves this result by constructing conjunctive grammars for a larger class of unary languages. The results imply undecidability of a number of decision problems of unary conjunctive grammars, as well as nonexistence of an r.e. bound on the growth rate of generated languages. An essential step of the argument is a simulation of a cellular automaton recognizing positional notation of numbers using language equations.
From Anomaly Reports to Cases
Authors: Stewart Massie, Nirmalie Wiratunga, Susan Craw, Alessandro Donati, Emmanuel Vicari
Venue: Proceedings of the 7th international conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2007)

Creating case representations in unsupervised textual case-based reasoning applications is a challenging task because class knowledge is not available to aid selection of discriminatory features or to evaluate alternative system design configurations. Representation is considered as part of the development of a tool, called CAM, which supports an anomaly report processing task for the European Space Agency. Novel feature selection/extraction techniques are created which consider word co-occurrence patterns to calculate similarity between words. These are used together with existing techniques to create 5 different case representations. A new evaluation technique is introduced to compare these representations empirically, without the need for expensive, domain expert analysis. Alignment between the problem and solution space is measured at a local level and profiles of these local alignments used to evaluate the competence of the system design.
An alternative approach for computing the union and intersection of fuzzy sets: a basis for design of robust fuzzy controllers
Authors: V. O. S. Olunloyo, A. M. Ajofoyinbo, A. B. Badiru
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

The capability of fuzzy sets to express gradual transition from membership to non-membership and vice versa has broad utility. The overlap between two or more adjoining fuzzy sets create very important fuzzy "patch" that deserves special attention. In the existing literature, Zadeh, Mamdani and Tagaki-Sugeno have established that the Min- and Max- operators can effectively be used for fuzzy interpolative inference. But what has not been done is to define an explicit expression for determining membership function in the overlap region. This paper addresses that concern, as it proposes an alternative approach to determination of membership function based on the Fourier series representation of the envelope of the fuzzy "patch".
Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
Authors: Yoshiharu Kojima, Masahiko Sakai
Venue: Proceedings of the 19th international conference on Rewriting Techniques and Applications (2008)

A reachability problem is a problem used to decide whether s is reachable to t by R or not for a given two terms s, t and a term rewriting system R. Since it is known that this problem is undecidable, effort has been devoted to finding subclasses of term rewriting systems in which the reachability is decidable. However few works on decidability exist for innermost reduction strategy or context-sensitive rewriting.In this paper, we show that innermost reachability and contextsensitive reachability are decidable for linear right-shallow term rewriting systems. Our approach is based on the tree automata technique that is commonly used for analysis of reachability and its related properties.