ppxscal/embedding_network huggingface dataset:
A New Look at Nonlinear Time Series Prediction with NARX Recurrent Neural Network
Authors: Jose M. P. Menezes Jr., Guilherme A. Barreto
Venue: Proceedings of the Ninth Brazilian Symposium on Neural Networks (2006)

The NARX network is a recurrent neural architecture commonly used for input-output modeling of nonlinear systems. The input of the NARX network is formed by two tapped-delay lines, one sliding over the input signal and the other one over the output signal. Currently, when applied to chaotic time series prediction, the NARX architecture is designed as a plain Focused Time Delay Neural Network (FTDNN); thus, limiting its predictive abilities. In this paper, we propose a strategy that allows the original architecture of the NARX network to fully explore its computational power to improve prediction performance. We use the well-known chaotic laser time series to evaluate the proposed approach in multi-step-ahead prediction tasks. The results show that the proposed approach consistently outperforms standard neural network based predictors, such as the FTDNN and Elman architectures.
Analysis of improved signcryption scheme with key privacy
Authors: Chik How Tan
Venue: Information Processing Letters (2006)

In this paper, we analyse the Yang-Wong-Deng signcryption scheme [G. Yang, D.S. Wong, X. Deng, Analysis and improvement of a signcryption scheme with key privacy, in: Information Security Conference--ISC'05, in: Lecture Notes in Comput. Sci., vol. 3650, Springer-Verlag, Berlin, 2005, pp. 218-232] proposed in ISC'05, which is the improvement and enhancement of the security of Libert-Quisquater signcryption scheme [B. Libert, J.J. Quisquater, Efficient signcryption with key privacy from gap Diffie-Hellman groups, in: Public Key Cryptography--PKC'04, in: Lecture Notes in Comput. Sci., vol. 2947, Springer-Verlag, Berlin, 2004, pp. 187-200]. Although Yang et al. [G. Yang, D.S. Wong, X. Deng, Analysis and improvement of a signcryption scheme with key privacy, in: Information Security Conference--ISC'05, in: Lecture Notes in Comput. Sci., vol. 3650, Springer-Verlag, Berlin, 2005, pp. 218-232] proved that their scheme is secure against adaptive chosen ciphertext attacks and achieves ciphertext anonymity (which is also called key privacy) in the random oracle model; we disprove all their claims and show that their scheme is not semantically secure and does not achieve ciphertext anonymity.
MHP Meets the Web: Bringing Web Contents to Digital TV for Interactive Entertainment
Authors: Stefano Ferretti, Marco Roccetti
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

TV still remains the preferred medium for entertainment. With the introduction of Interactive Digital Television (IDTV), new digital services can be now conveyed through this communication technology. In particular, bringing the Web to IDTV may represent an attractive opportunity to inject new fuel into the TV world, thus creating a wider and accessible container of digital services for entertainment. Yet, this raises several technical issues that need to be addressed. While a lot of research has been done with the aim of adjusting the content of a Web page so that it fits to a target computing environment, scarce efforts have been devoted to the specific TV target. Further, effective interfaces for digital TV must be devised which guarantee the same level of usability available through common PCs. In particular, contents must be structured such that: i) their management is facilitated on low-end Set Top Boxes, and ii) their visualization is made effective for standard TV displays. In this context, we propose a new technique for the automatic transcoding of Web contents which enables their delivery over IDTV broadcast channels and allows a proper visualization on IDTV screens. Our system is based on the Digital Video Broadcasting -- Multimedia Home Platform (DVB-MHP) standard. We also developed a client application which permits to browse our transcoded contents on a TV set via the remote control. Results gathered from real world experiments demonstrate the viability of our approach.
Graphical user interfaces as documents
Authors: Dirk Draheim, Christof Lutteroth, Gerald Weber
Venue: Proceedings of the 7th ACM SIGCHI New Zealand chapter's international conference on Computer-human interaction: design centered HCI (2006)

The representation of GUIs as documents is a technological trend that has been present for some years, but is only now about to significantly change the way in which most user interfaces are developed. This paper examines this change, explains the reasons behind it and the concepts involved. It compares the old fashioned way of programming user interfaces as code units with the document-based paradigm, explaining why the latter is preferable. Furthermore, it discusses how the document-based paradigm can be extended to a very comprehensive and well defined customization approach for GUIs, the document-oriented approach, which supports the paradigms of end-user development and robust content.
Timing Analysis of the FlexRay Communication Protocol
Authors: Traian Pop, Paul Pop, Petru Eles, Zebo Peng, Alexandru Andrei
Venue: Proceedings of the 18th Euromicro Conference on Real-Time Systems (2006)

FlexRay will very likely become the de-facto standard for in-vehicle communications. However, before it can be successfully used for safety-critical applications that require predictability, timing analysis techniques are necessary for providing bounds for the message communication times. In this paper, we propose techniques for determining the timing properties of messages transmitted in both the static (ST) and the dynamic (DYN) segments of a FlexRay communication cycle. The analysis techniques for messages are integrated in the context of a holistic schedulability analysis that computes the worst-case response times of all the tasks and messages in the system. We have evaluated the proposed analysis techniques using extensive experiments.
Liveness and Boundedness of Synchronous Data Flow Graphs
Authors: A. H. Ghamarian, M. C. W. Geilen, T. Basten, B. D. Theelen, M. R. Mousavi, S. Stuijk
Venue: Proceedings of the Formal Methods in Computer Aided Design (2006)

Synchronous Data Flow Graphs (SDFGs) have proven to be suitable for specifying and analyzing streaming applications that run on single- or multi-processor platforms. Streaming applications essentially continue their execution indefinitely. Therefore, one of the key properties of an SDFG is liveness, i.e., whether all parts of the SDFG can run infinitely often. Another elementary requirement is whether an implementation of an SDFG is feasible using a limited amount of memory. In this paper, we study two interpretations of this property, called boundedness and strict boundedness, that were either already introduced in the SDFG literature or studied for other models. A third and new definition is introduced, namely self-timed boundedness, which is very important to SDFGs, because self-timed execution results in the maximal throughput of an SDFG. Necessary and sufficient conditions for liveness in combination with all variants of boundedness are given, as well as algorithms for checking those conditions. As a by-product, we obtain an algorithm to compute the maximal achievable throughput of an SDFG that relaxes the requirement of strong connectedness in earlier work on throughput analysis.
Distributed Biomedical Database for Public Health Research
Authors: Yavuz Tor, Richard H. Fowler, Charles A. Harlow, Chaitanya Jasti, Zhixiang Chen
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Results of research in public health highly depend on the validity of data collection and internal research processes. To ensure validity, maintaining records of all assets in the research is very important. Researchers should be able to diagnose problems by tracing back the processes that leads to the problem. In this study, we design and implement BioRio system, a portable, flexible and secure information system for public health research that will reduce human errors, and increase traceability and efficiency.
2005 Special Issue: Emotion understanding from the perspective of autonomous robots research
Authors: Lola Cañamero
Venue: Neural Networks (2005)

In this paper, I discuss some of the contributions that modeling emotions in autonomous robots can make towards understanding human emotions-'as sited in the brain' and as used in our interactions with the environment-and emotions in general. Such contributions are linked, on the one hand, to the potential use of such robotic models as tools and 'virtual laboratories' to test and explore systematically theories and models of human emotions, and on the other hand to a modeling approach that fosters conceptual clarification and operationalization of the relevant aspects of theoretical notions and models. As illustrated by an overview of recent advances in the field, this area is still in its infancy. However, the work carried out already shows that we share many conceptual problems and interests with other disciplines in the affective sciences and that sound progress necessitates multidisciplinary efforts.
Existence and impulsive stability for second order retarded differential equations
Authors: L. P. Gimenes, M. Federson
Venue: Applied Mathematics and Computation (2006)

We consider certain impulsive second order delay differential equations and give conditions for the existence of solutions. Moreover we prove that the non-impulsive equations can be stabilized by the imposition of proper impulse controls generalizing recent results by Li and Weng. We also comment on some possible applications and give examples.
On the performance of subspace methods with array model errors and spatial smoothing
Authors: K. V. S. Hari, U. Gummadavelli
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The effect of spatial smoothing (forward smoothing and forward-backward smoothing) on the performance of subspace methods in the presence of array model errors for direction-of-arrival (DOA) estimation is studied. Theoretical expressions for the mean squared error (MSE) in DOA are obtained, based on a common framework of analysis. Simulations were carried out to substantiate the theory developed. For the cases considered, smoothing improves the performance of the ESPRIT and minimum-norm method while it is not so for the multiple signal classification (MUSIC) technique.
Using Medical Test Collection Relevance Judgements to Identify Ontological Relationships Useful for Query Expansion
Authors: D. Wollersheim, W. J. Rahayu
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

In this paper we describe an innovative query expansion evaluation framework (QEEF) which discovers the ontological and algorithmic characteristics that drive successful query expansion. The method consists of identifying UMLS (Unified Medical Language System) concepts in the Ohsumed corpus queries and documents, and then applying variety of query expansion algorithms to the query concepts, both individually and at the query level. We analyse the results, discovering the characteristics of high relevance medical query expansions. We directly evaluate query expansion success, and this enables discovery of the relationship between the UMLS facets and this success. The paper details the methods used, and then discusses the influence of both UMLS attributes, and choice of query expansion algorithm, on query expansion success.
\delta-Tolerance Closed Frequent Itemsets
Authors: James Cheng, Yiping Ke, Wilfred Ng
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

In this paper, we study an inherent problem of mining Frequent Itemsets (FIs): the number of FIs mined is often too large. The large number of FIs not only affects the mining performance, but also severely thwarts the application of FI mining. In the literature, Closed FIs (CFIs) and Maximal FIs (MFIs) are proposed as concise representations of FIs. However, the number of CFIs is still too large in many cases, while MFIs lose information about the frequency of the FIs. To address this problem, we relax the restrictive definition of CFIs and propose the \delta-Tolerance CFIs (\delta- TCFIs). Mining \delta-TCFIs recursively removes all subsets of a \delta-TCFI that fall within a frequency distance bounded by \delta. We propose two algorithms, CFI2TCFI and MineTCFI, to mine \delta-TCFIs. CFI2TCFI achieves very high accuracy on the estimated frequency of the recovered FIs but is less efficient when the number of CFIs is large, since it is based on CFI mining. MineTCFI is significantly faster and consumes less memory than the algorithms of the state-of-the-art concise representations of FIs, while the accuracy of MineTCFI is only slightly lower than that of CFI2TCFI.
Service-oriented architecture on the Grid for integrated fault diagnostics: Research Articles
Authors: X. Ren, M. Ong, G. Allan, V. Kadirkamanathan, H. A. Thompson, P. J. Fleming
Venue: Concurrency and Computation: Practice Experience (2007)

For industrial fault diagnostics, many model-based fault diagnosis approaches have been proposed so far and some of them have been put into practice. However, for modern complex processes, owing to the variable nature of faults and model uncertainty, no single method can diagnose all faults and meet different contradictory criteria. In this paper, the importance of integration of different fault detection and isolation schemes in a generic problem-solving environment is emphasized. A service-oriented architecture for the integration is proposed, based on Grid technologies. As an engineering implementation, a decision support system for the gas turbine engine fault diagnosis is presented and some deployed services are discussed. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Moving Object Localization in Thermal Imagery by Forward-backward MHI
Authors: Zhaozheng Yin, Robert Collins
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Detecting moving objects automatically is a key component of an automatic visual surveillance and tracking system. In airborne thermal video, the moving objects may be small, color information is not available, and even intensity appearance may be camouflaged. Previous motionbased moving object detection approaches often use background subtraction, inter-frame difference or three-frame difference. In this paper, we describe a detection and localization method based on forward-backward motion history images (MHI). This method can accurately detect location and shape of moving objects for initializing a tracker. Using long and varied video sequences, we quantify the effectiveness of this method.
Human-Centered Webcasting of Interactive-Whiteboard Lectures
Authors: Gerald Friedland, Raul Rojas
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

In our system for recording and transmitting lectures over the Internet, the board content is transmitted as vector graphics, producing thus a high quality image, while the video of the lecturer is sent as a separate stream. It is easy for the viewer to read the board but the lecturer appears in a separate window. As a result, two areas of the screen are competing for the viewer's attention, causing the widely known split attention effect. To eliminate this problem, the lecturer is extracted from the video stream and his or her image is pasted onto the board image at video stream rates. The lecturer can be dimmed from opaque to semitransparent, or even transparent. The article presents a detailed analysis of the underlying psychological problems and explains the multimedia techniques that are applied to achieve the solution.
Structural and functional growth in self-reproducing cellular automata: Research Articles
Authors: Eleonora Bilotta, Pietro Pantano
Venue: Complexity (2006)

In this article, we analyze the dynamics of change in two-dimensional self-reproducers, identifying the processes that drive their evolution. We show that changes in self-reproducers structure and behavior depend on their genetic memory. This consists of distinct yet interlinked components determining their form and function. In some cases these components degrade gracefully, changing only slightly; in others the changes destroy the original structure and function of the self-reproducer. We sketch these processes at the genotype and the phenotype level&mdash;showing that they follow distinct trajectories within mutation space and quantifying the degree of change produced by different trajectories. We show that changes in structure and behavior depend on the interplay between the genotype and the phenotype. This determines universal structures, from which it is possible to construct a great number of self-reproducing systems, as we observe in biology. Creative processes of change produce divergent and&#x002F;or convergent methods for the generation of self-reproducers. Divergence involves the creation of completely new information convergence involves local change and specialization of the structures concerned. &copy; 2006 Wiley Periodicals, Inc. Complexity 11: 12&ndash;29, 2006This paper was submitted as an invited article resulting from the &ldquo;Understanding Complex Systems&rdquo; conference held at the University of Illinois&ndash;Urbana Champaign, May 2005
Simulation model for analyzing effects of employment tax incentive programs
Authors: Robert Yerex
Venue: Proceedings of the 37th conference on Winter simulation (2005)

In the United States, a variety of federal, state and local tax incentive programs exist for the purpose of encouraging private sector corporations to employee certain targeted classes of disadvantaged workers. This study demonstrates the use of OR modeling and simulation approaches in the analysis of the federal Work Opportunity Tax Credit (WOTC) program in terms of its impact, and the potential for increased value to corporations seeking to optimize their participation in the program. 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
Performance evaluation of real-time scheduling on a multicomputer architecture
Authors: L. F. Friedrich
Venue: Proceedings of the 2000 IEEE International Symposium on Performance Analysis of Systems and Software (2000)

The complexity of some real-time applications demands high performance computer architectures. Multicomputer architectures have a potential for high performance and reliability because of their expressive number of processors and communication channels. Therefore, they are natural candidates for supporting complex real-time computing. This paper presents a performance evaluation of real-time scheduling in a parallel/distributed environment which is based on a multicomputer architecture.
A recurrent neural network classifier for Doppler ultrasound blood flow signals
Authors: İnan Güler, Elif Derya íbeyli
Venue: Pattern Recognition Letters (2006)

The aim of this study is to evaluate the diagnostic accuracy of the recurrent neural networks (RNNs) trained with Levenberg-Marquardt algorithm on the Doppler ultrasound blood flow signals. The ophthalmic arterial (OA) and internal carotid arterial (ICA) Doppler signals were decomposed into time-frequency representations using discrete wavelet transform and statistical features were calculated to depict their distribution. The RNNs were implemented for diagnosis of OA and ICA diseases using the statistical features as inputs. We explored the ability of designed and trained Elman RNNs, combined with wavelet preprocessing, to discriminate the Doppler signals recorded from different healthy subjects and subjects suffering from OA and ICA diseases. The classification results demonstrated that the proposed combined wavelet/RNN approach can be useful in analyzing long-term Doppler signals for early recognition of arterial diseases.
Fast Relevance Discovery in Time Series
Authors: Chang-shing Perng, Haixun Wang, Sheng Ma
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

In this paper, we propose to model time series from a new angle: state transition points. When fluctuation of values in a time series crosses a certain point, it may trigger state transition in the system, which may lead to abrupt changes in many other time series. The concept of state transition points is essential in understanding the behavior of the time series and the behavior of the system. The new measure is robust and is capable of discovering correlations that Pearson's coefficient cannot reveal. We propose efficient algorithms to identify state transition points and to compute correlation between two time series. We also introduce some triangular inequalities to efficiently find highly correlated time series among many time series.
Generating web applications from process models
Authors: Jan Schulz-Hofen, Silvan Golega
Venue: Workshop proceedings of the sixth international conference on Web engineering (2006)

The business process has gained a lot of importance for design and development of software in general and web applications in particular. Moreover, a shift from individual and separate application development to customization of pre-engineered solutions promotes significant reductions in time-to-market and maintenance effort. Applying the concept of process-based software product lines to webdevelopment promises to enable the average business user to generate ready--to--run web applications from comprehensive business process models. This case-study attempts to validate the concepts of Process Family Engineering in a concrete application domain by developing a software generator for process-based web applications for e-business.
Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem
Authors: Zheng-Hai Huang, Hui Wang
Venue: Applied Mathematics and Computation (2006)

We present a smoothing-type algorithm for solving the linear program (LP) by making use of an augmented system of its optimality conditions. The algorithm is shown to be globally convergent without requiring any assumption. It only needs to solve one system of linear equations and to perform one line search at each iteration. In particular, if the LP has a solution (and hence it has a strictly complementary solution), then the algorithm will generate a strictly complementary solution of the LP; and if the LP is infeasible, then the algorithm will correctly detect infeasibility of the LP. To the best of our knowledge, this is the first smoothing-type algorithm for solving the LP having the above desired convergence features.
A Conceptual Model for Evaluating Aesthetic Effect within the User Experience of Information Visualization
Authors: Nick Cawthon, Andrew Vande Moere
Venue: Proceedings of the conference on Information Visualization (2006)

This paper proposes a conceptual model for which one might begin to assess aesthetic effect within the user experience of information visualization. Through first defining, then illustrating new dimensions of aesthetic that exist within the context of information visualization, this paper goes on to suggest that a user centered evaluation method not solely centered around task efficiency metrics is now imperative.