ppxscal/embedding_network huggingface dataset:
A new reduced-order sliding mode observer design method: a triple transformations approach
Authors: Elbrous M. Jafarov
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

In this paper, a triple state and output variable transformations based method to design a new reduced-order sliding mode observer for perturbed MIMO systems is developed. The state and output variables of original system is triple transformed in to suitable canonical form coordinates where the dynamical reduced order observer can be successfully designed. Existing reduced-order observer design techniques and state-output variables transformations are summarized in this study and presented systematically. A new combined observer configuration is proposed. Some new adequate evolution of matrix inequalities is adopted. Global sufficient asymptotical stability and sliding conditions for the coupled observer error system are established by using Lyapunov full quadratic form and formulated in terms of Lyapunov matrix equations and matrix inequalities. Reduced analysis of separated reaching and sliding modes of motion of decoupled observer error system is discussed also. A numerical example is given to illustrate the usefulness of proposed design method.
Multilevel algorithm for a Poisson noise removal model with total-variation regularization
Authors: Raymond H. Chan, Ke Chen
Venue: International Journal of Computer Mathematics (2007)

Many commonly used models for the fundamental image processing task of noise removal can deal with Gaussian white noise. However, such Gaussian models are not effective in restoring images with Poisson noise, which is ubiquitous in certain applications. Recently, Le-Chartrand-Asaki derived a new data-fitting term in the variational model for Poisson noise. This paper proposes a multilevel algorithm for efficiently solving this variational model. As expected of a multilevel method, it delivers the same numerical solution many orders of magnitude faster than the standard single-level method of coordinate descent time-marching. Supporting numerical experiments on 2D gray scale images are presented.
Incremental application of knowledge to continuously arriving time-oriented data
Authors: Alex Spokoiny, Yuval Shahar
Venue: Journal of Intelligent Information Systems (2008)

In our previous work, we introduced a computational architecture that effectively supports the tasks of continuous monitoring and of aggregation querying of complex domain meaningful time-oriented concepts and patterns (temporal abstractions), in environments featuring large volumes of continuously arriving and accumulating time-oriented raw data. Examples include provision of decision support in clinical medicine, making financial decisions, detecting anomalies and potential threats in communication networks, integrating intelligence information from multiple sources, etc. In this paper, we describe the general, domain-independent but task-specific problem-solving method underling our computational architecture, which we refer to as incremental knowledge-based temporal abstraction (IKBTA). The IKBTA method incrementally computes temporal abstractions by maintaining persistence and validity of continuously computed temporal abstractions from arriving time-stamped data. We focus on the computational framework underlying our reasoning method, provide well-defined semantic and knowledge requirements for incremental inference, which utilizes a logical model of time, data, and high-level abstract concepts, and provide a detailed analysis of the computational complexity of our approach.
A model to integrate the science of design into undergraduate computing education: conference workshop
Authors: Guy-Alain Amoussou, Eileen Cashman, Steve Steinberg
Venue: Journal of Computing Sciences in Colleges (2008)

The Science of Design is a new area of inquiry with little existing theory or foundation within the Computer Science discipline. In response to this need, the National Science Foundation has initiated an effort to support this area of inquiry. An important contribution to this educational and research initiative is the creation of a community of individuals from diverse disciplinary and cultural perspectives who can contribute to a foundation. Establishing such a culture will facilitate building on what is already known about design in other disciplines and transferring that knowledge to the computer science community. Our specific efforts have been on the creation and implementation of an undergraduate level, curricular curriculum. In this workshop we will present participants with some of the key tools and curricular activities developed and refined through the course of our work. Our workshop furthers our goal of building community by sharing the curriculum with participants outside the Humboldt State community. The ultimate goal is to build a community for a lasting impact to benefit the advancement of creativity, design and innovation in computing research and education.
Managed service paradox
Authors: N. Leon, A. Davies
Venue: IBM Systems Journal (2008)

In this paper we examine managed service in the information and communication technology (ICT) sector, characterized by the polarization between an infrastructure service that is growing in scale and increasingly becoming a commodity and customized or even one-of-a-kind projects. We refer to the approaches taken by three highly innovative advanced service companies, IBM, Ericsson, and Cable & Wireless, to package and deliver ICT service on a more industrialized basis. We identify the six-stage process that describes their journeys to date. We also describe some of the challenges they faced on that journey as well those currently facing them as they move to a higher degree of industrialization. To address these challenges, we propose a model with three axes: offering development, service delivery, and go to market. The model demonstrates how the increasing industrialization of managed service requires an approach integrating all three of these dimensions. We also show that strong governance is required to address the impacts of technological evolution, marketplace dynamics, and corporate culture.
A Calculus for Generation, Verification and Refinement of BPEL Specifications
Authors: Faisal Abouzaid, John Mullins
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Business Process Execution Language for Web Services (WS-BPEL) is the emerging standard for designing Web Services compositions. In this context, formal methods can contribute to increased reliability and consistency in the BPEL design process. In this paper we propose an approach based on the HAL Toolkit that allows verification of the correctness of the behavior of a @p-based specification of interacting Web Services, and generates the BPEL processes that have the same behavior. This correlation based on two-way mapping between the @p-based orchestration calculus and BPEL. This approach facilitates the verification and refinement process and may be applied to any BPEL implementation.
A unified framework for adaptive filter algorithms with variable step-size
Authors: Mohammad Shams Esfand Abadi, Ali Mahlooji Far
Venue: Computers and Electrical Engineering (2008)

Employing a recently introduced framework within which a large number of classical and modern adaptive filter algorithms can be viewed as special cases, we extend this framework to cover block normalized LMS (BNLMS) and normalized data reusing LMS (NDRLMS) adaptive filter algorithms. Accordingly, we develop a generic variable step-size adaptive filter. Variable step-size normalized LMS (VSSNLMS) and VSS affine projection algorithms (VSSAPA) are particular examples of adaptive algorithms covered by this generic variable step-size adaptive filter. In this paper we introduce two new VSS adaptive filter algorithms named the variable step-size BNLMS (VSSBNLMS) and the variable step-size NDRLMS (VSSNDRLMS) based on the generic VSS adaptive filter. The proposed algorithms show the higher convergence rate and lower steady-state mean square error compared to the ordinary BNLMS and NDRLMS algorithms.
Design of information distribution system for cellular phones based on preferences and movement records of user
Authors: Kazuya Tomizawa, Osamu Uchida
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

Accessing the Internet from cellular phones has become a widespread phenomenon, and regional information can now be accessed on a cellular phone anytime. However, it is difficult to obtain regional information by a simple operation. For example, in most information distribution systems, we cannot obtain regional information relevant to a specific user's preferences and current location. To solve this problem, we propose a method to find regional information relevant to each user by utilizing both the user's preferences and movements records. Moreover, based on the proposed method, we implement a regional information distribution system for cellular phones using the Global Positioning System.
A Networked Virtual Environment for Teaching Handwritten Characters Through Haptization of Human Motor Skills
Authors: Hiroaki Nishino, Akira Yamaguchi, Tsuneo Kagawa, Kouichi Utsumiya
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

We present an approach to realize a networked on-line education system among physically separated participants targeted at teaching handwritten characters. In addition to visual and acoustic information, our system provides a haptic channel to intuitively learn remote instructor’s fine motor skills through the sense of touch. The human touch sensation, however, is very sensitive for performance degradation caused by delays, packet losses, and jitters in the networked virtual reality (NVR) systems. Therefore, we show a method to efficiently share virtual space information by compensating for the performance degradation factors. We take a hybrid approach to implement both data consistency by client-server and scalability by peer-to-peer models. The handwritten character learning system is built on the hybrid architecture and realizes the participants to tightly share partners’ haptic motions. We also describe an experiment conducted to validate the effectiveness of the haptic modality for teaching handwritten characters.
A genetic algorithm calibration method based on convergence due to genetic drift
Authors: Matthew S. Gibbs, Graeme C. Dandy, Holger R. Maier
Venue: Information Sciences: an International Journal (2008)

The selection of Genetic Algorithm (GA) parameters is a difficult problem, and if not addressed adequately, solutions of good quality are unlikely to be found. A number of approaches have been developed to assist in the calibration of GAs, however there does not exist an accepted method to determine the parameter values. In this paper, a GA calibration methodology is proposed based on the convergence of the population due to genetic drift, to allow suitable GA parameter values to be determined without requiring a trial-and-error approach. The proposed GA calibration method is compared to another GA calibration method, as well as typical parameter values, and is found to regularly lead the GA to better solutions, on a wide range of test functions. The simplicity and general applicability of the proposed approach allows suitable GA parameter values to be estimated for a wide range of situations.
The twelve triangular matrix forms of the pascal triangle: a systematic approach with the set of circulant operators
Authors: Babiga Birregah, Prosper K. Doh, Kondo H. Adjallah
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

This work is devoted to a systematic investigation of triangular matrix forms of the Pascal Triangle. To start, the twelve matrix forms (collectively referred to as G-matrices) are presented. To highlight one way in which the G-matrices relate to each other, a set of four operators named circulant operators is introduced. These operators provide a new insight into the structure of the space of square matrices.
Robotic cell for custom finishing operations
Authors: B. Nemec, L. Zlajpah
Venue: International Journal of Computer Integrated Manufacturing (2008)

Finishing operations in the shoe manufacturing process comprises operations such as application of polishing wax, polishing cream and spray solvents, and brushing in order to achieve high gloss. These operations require skilled workers and are generally difficult to automate owing to the complex motion trajectories. This paper describes a robotic cell for finishing operations in a custom shoe production plant. Such customization of shoe production should allow production of small batches of shoes of the same type. This requires automatic set-up and adaptation of the production line. To meet these requirements, a computer aided design (CAD) system for automatic generation, optimization and validation of motion trajectories was integrated into a robotic cell. In automatic trajectory generation some of the major problems are limitations posed by the robot joint limits, robot singularities and environment obstacles. These problems were solved using the kinematic redundancy of the robot manipulator.
Real-time implementation of an adaptive gain equalizer for speech enhancement purposes
Authors: Nils Westerlund, Mattias Dahl, Ingvar Claesson
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

This paper presents a real time low-complexity implementation of a noise reduction method for speech communication where the input signal is divided into a number of subbands that are individually weighted in time domain according to the short time Signal-to-Noise Ratio estimate (SNR) in each subband at every time instant. Instead of focusing on suppression the noise, the method is focusing on speech enhancement. The method has proven to be advantageous when implemented in real time since it offers low complexity, low delay and low distortion.
Retrieving the median droplet diameter from Ka-and W-band dual-wavelength Doppler radar measurements
Authors: O. O. Bezvesilniy, D. M. Vavriv
Venue: International Journal of Remote Sensing (2007)

In this letter, a novel method is proposed for estimating the median droplet diameter by using the Ka-and W-band dual-wavelength differences of the mean Doppler velocity and the Doppler spectrum width. The estimated median diameter together with the dual-wavelength ratio of the radar reflectivity can be effectively used to measure and compensate the attenuation in precipitation or clouds. The estimate of the median diameter is not affected by the attenuation and does not require an accurate radar calibration. Furthermore, the vertical air flows and the turbulent broadening of the Doppler spectra have no influence on the estimate.
Himalayan glacier retreat using IRS 1C PAN stereo data
Authors: I. M. Bahuguna, A. V. Kulkarni, Shailesh Nayak, B. P. Rathore, H. S. Negi, P. Mathur
Venue: International Journal of Remote Sensing (2007)

A merged image of nadir viewing PAN and LISS III data of 2000 and PAN stereo data of 2000-2001 from Indian Remote Sensing satellite (IRS)-1C covering Gangotri glacier was interpreted to identify its snout or terminus and to measure the retreat of this glacier with respect to the position of snout in a topographical map of 1962. Elevations from the map and DEM generated from stereo data were compared to determine the thickness of the glacier ice across the section of retreat prior to year 1962. The annual retreat of the glacier at the end of the ablation season during the year 2000-2001 was measured using PAN orthoimages.
An Efficient Algorithm for Isomorphic Problem on Generic Simple Graphs
Authors: Ngoc Bao Tran, Dinh Thuc Nguyen
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Graph isomorphism has received considerable attention because of many of the practical applications of the problem. Also, researchers have not yet been able to discover where the graph isomorphism problem fits into the NP complexity model. In this paper, we establish necessary conditions for graph isomorphism problem. Based on these conditions, algorithms are proposed in order to solve the Graph Isomorphism problem in reasonable time. In the best-case time complexity for our algorithm is O(N) where N is the number of vertices. The proposed algorithm is applied to undirected simple graphs, i.e., graphs with undirected edges so that (u, v) and (v, u) are considered to be the same edge. This result can be used into authentication methods based on graph isomorphism.
PALLAS: Personalised Language Learning on Mobile Devices
Authors: Sobah Abbas Petersen, Jan-Kristian Markiewicz
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

Mobile and ubiquitous learning facilitates language learners to continue their learning process outside the formal classroom, when and where they desire. While more and more learning resources are accessible via a mobile device, there is a challenge in providing access to appropriate personalised learning resources. Personalisation and contextualisation are often used as synonyms. In our work, we distinguish between these two concepts and consider personalisation as a part of contextualisation. This paper describes the PALLAS system which enables real life language learning scenarios by providing personalised and contextualised access to learning resources via a mobile device. The dynamic and static parameters for contextualisation and personalisation of language learning resources are discussed.
Branch and bound-based scheduling of tasks on unrelated parallel multiprocessor systems using Petri nets
Authors: Abolfazl Jalilvand, Sohrab Khanmohammadi, Fereidoon Shabani Nia
Venue: Proceedings of the 9th International Conference on Circuits (2005)

This paper deals with scheduling n jobs in an m -machine job-shop environment to minimizes the maximum overall completion time of all jobs called make-span. In this multiprocessor scheduling problem we assume that the jobs are available at time zero and have no sequence- dependent setup times on machines. For solving the scheduling problem we develop a new Branch and bound algorithm which constructs its search tree gradually and doesn't need large size of memory. We will propose a lower bound cost for Branch and bound method. Furthermore for initializing the root node in the search tree a heuristic upper bound cost will be introduced which reduces the branch-and-bound computations. For applying the resultant optimum schedule on the manufacturing system a supervisor Petri net is introduced. The proposed methods will be verified through a computational experiment.
Finding the longest common subsequence for multiple biological sequences by ant colony optimization
Authors: Shyong Jian Shyu, Chun-Yuan Tsai
Venue: Computers and Operations Research (2009)

Finding the longest common subsequence (LCS) for a set of n (an arbitrary n>2) sequences is an NP-hard problem. It is an essential operation for a wide range of applications in the areas of computational biology, pattern recognition, string editing and data compression, to name a few. In this paper, we design a novel ant colony optimization (ACO) algorithm to find the approximate solution to the LCS problem for multiple biological sequences. The performances of our ACO algorithm, the known expansion algorithm [Bonizzoni P, Vedova GD, Mauri G. Experimenting an approximation algorithm for the LCS. Discrete Applied Mathematics 2001;110:13-24] and best next for maximal available symbol algorithm [Huang KS, Yang CB, Tseng KT. Fast algorithms for finding the common subsequence of multiple sequences. In: Proceedings of international computer symposium; 2004. p. 90-95] were tested and compared by using various sets of DNA and protein sequences. The experimental results demonstrate the effectiveness and efficiency of the proposed ACO algorithm in dealing with the LCS problem for multiple biological sequences.
Semantic Analysis and Video Event Mining in Sports Video
Authors: Lawrence Y. Deng, Yi-Jen Liu
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Video understanding is a gigantic potential for effective access the video content through content management system. Related technologies for to analysis and make event mining in video content processing issues are become more and more important. In this paper, we developed a shot ontology description based for the basketball video. Shot ontology is inferred by shot manipulations those included: shot detection, shot type classification, score board detection and motion statistics. This video content management system provided event feature manipulations at multiple levels: signal, structural, or semantic in order to meet user preferences while striking the overall utility of the video. The experiment results showed that our proposed methodologies could correctly detect interested events, long shots, and close-up shots and also achieved the purpose of video indexing and weaving for what user preferences.
Structural, morphological and microhardness characterization in polymer complex of laser dye rhodamine (Rh6G) doped polymethyl methacrylate
Authors: Pradeep Kumar Dubey, R. Bajpai, J. M. Keller
Venue: Microsystem Technologies (2008)

Polymer systems have various contents of rhodamine (Rh6G) doped Polymethyl methacrylate (PMMA) prepared by solution cast method. The structural and morphological properties were studied by Differential Scanning calorimetry (DSC), Fourier Transform Infrared spectroscopy (FTIR) Scanning Electron Microscopy (SEM) and X-ray diffraction methods. The induced effect on the strength of rhodamine (Rh6G) doped Polymethyl methacrylate (PMMA) samples were studied by measuring the surface microhardness using the Vicker&#x2019;s microhardness tester. Significant changes were observed in the Vickers microhardness number (Hv)
Neutrosophic logics: Prospects and problems
Authors: Umberto Rivieccio
Venue: Fuzzy Sets and Systems (2008)

Neutrosophy has been introduced some years ago by Florentin Smarandache as a new branch of philosophy dealing with ''the origin, nature and scope of neutralities, as well as their interactions with different ideational spectra''. A variety of new theories have been developed on the basic principles of neutrosophy: among them is neutrosophic logics, a family of many-valued systems that can be regarded as a generalization of fuzzy logics. In this paper we present a critical introduction to neutrosophic logics, focusing on the problem of defining suitable neutrosophic propositional connectives and discussing the relationship between neutrosophic logics and other well-known frameworks for reasoning with uncertainty and vagueness, such as (intuitionistic and interval-valued) fuzzy systems and Belnap's logic.
Filtering structures in pure current mode
Authors: Vít Novotny, Jiří Mišurec, Tomáš Lukl
Venue: Proceedings of the 9th International Conference on Circuits (2005)

Analog circuits used as an interface between analog world and a digital core of electronic structures are required to operate under more and more strict conditions, mainly as the supply voltage and frequency range is concerned. New circuit techniques are being sought. The networks working in the pure current mode seem to be one of the possible solutions of that problem. Within the paper the idea of pure current mode is expanded, basic elements for the design of the network structures are proposed and examples of filters are designed, simulations are realized and obtained results are evaluated.