ppxscal/embedding_network huggingface dataset:
LMI Based Global Asymptotic Stability Criterion for Recurrent Neural Networks with Infinite Distributed Delays
Authors: Zhanshan Wang, Huaguang Zhang, Derong Liu, Jian Feng
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

Global asymptotic stability problem for a class of recurrent neural networks with infinite distributed delay is investigated based on the linear matrix inequality (LMI) technique. Using a matrix decomposition method, a vector-matrix form of recurrent neural networks with infinite distributed delay is obtained. Then by constructing a suitable Lyapunov functional and using an inequality, new LMI-based criteria are established to ensure the global asymptotic stability of the class of neural networks, which considers the effects of neuron's excitatory and inhibitory action in the term of infinite delay on the networks. The obtained results are independent of the size of delay and are easily verified. Numerical example shows the effectiveness of the obtained results.
Social networking -- technology, tools, and applications: a hands-on tutorial to make the most of the conference
Authors: Janice Warner
Venue: Proceedings of the 10th Annual International Conference on Digital Government Research: Social Networks: Making Connections between Citizens, Data and Government (2009)

Types and applications for social networking have exploded. This tutorial will give participants a working knowledge of the technology, tools and applications with examples of how they are being used by governments and in support of the dg.o 2009 conference itself.
SAP BW Performance Tuning, 1st edition
Authors: Shreekant Shiralkar, Bharat Patel, Thomas Becker, Tracey Edge, Heila Rowan, Elaine Lanmon
Venue:  (2007)

Business environment is changing at a rapid pace and so is the fierceness in competition. Today's business demands decision at the speed of thought . It is obvious that such decisions need most efficient information acquisition, integration, transformation and finally presentation in the most efficient way at a matching speed and without increasing the cost of doing so. A data warehouse is set up in a company with a clear focus to support the decision support system, involving collecting useful information, harmonizing it and transforming and finally presenting it for answering business questions. For instance, What is the sales trend of a specific material? It is an established fact that most SAP BW projects succeed when they deliver the above objectives by providing: 1. The ability to acquire data from various data sources such as the OLTP system and present accurate information. 2. A capacity to provide drill-down or slice-n-dice capability for analyzing the different perspectives of the information. 3. Decision support enablers such as self-service options, exception reporting etc. However, these parameters are primarily of academic interest and translate into real success only when a decision maker finds it acceptable. Performance tuning directly influences the degree of user acceptance as it delivers a quick response to a user's call. More specifically, performance influences, on time availability of data, response time to query execution, response time for drill down and so on. The performance is also an important criterion for reducing the TCO, as performance here relates to efficient use of database, lower load on system resources, availability of system, and availability of bandwidth. In this book the authors have listed performance tuning parameters right through the data model, including extraction of data, data loading, fine tuning of the database, concluding with proactive operational maintenance mode (e.g. review aggregates, build new ones, delete unused ones, find problem queries) as an ongoing cycle. Also covered in this book is how to go about evaluating the actual performance; whether there is scope for improvement or other avenues of performance tuning need to be explored. This book is written specifically with reference to the subject of Performance for SAP BW version 3.X on an Oracle database, but most of the content is equally applicable for any versions of BW.
Eyelid Localization in Iris Images Captured in Less Constrained Environment
Authors: Xiaomin Liu, Peihua Li, Qi Song
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

Eyelid localization plays an important role in an accurate iris recognition system. In less constrained environment where the subjects are less cooperative, the problem becomes very difficult due to interference of eyelashes, eyebrows, glasses, hair and diverse variation of eye size and position. To determine upper eyelid boundary accurately, the paper proposes an integro-differential parabolic arc operator combined with a RANSAC-like algorithm. The integro-differential operator works as a parabolic arc edge detector. During search process of the operator, the potential candidate parabolas should near at least certain percentage of edgels of upper eyelid boundary, detected by 1D edge detector. The RANSAC-like algorithm functions as a constraint that not only makes eyelid localization more accurate, but also enables it more efficient by excluding invalid candidates for further processing. Lower eyelid localization is much simpler due to very less interference involved, and a method is presented that exploits 1D edgels detection and an RANSAC algorithm for parabolic fitting. Experiments are made on UBIRIS.v2 where images were captured at-a-distance and on-the-move. The comparison shows that the proposed algorithm is quite effective in localizing eyelids in heterogeneous images.
Argument Schemes for Legal Case-based Reasoning
Authors: Adam Wyner, Trevor Bench-Capon
Venue: Proceeding of the 2007 conference on Legal Knowledge and Information Systems: JURIX 2007: The Twentieth Annual Conference (2007)

In this paper we use the notion of argument schemes to analyse some leading approaches to case-based reasoning in Law. We identify a set of argument schemes that can express the argument provided by such systems and draw attention to some important differences between the various approaches.
The reduction to normal form of a non-normal system of differential equations: De &#x00e6;quationum differentialium systemate non normali ad formam normalem revocando
Authors: Fran&#x00e7;ois Ollivier
Venue: Applicable Algebra in Engineering, Communication and Computing (2009)

This paper was edited by Sigismund Cohn, C. W. Borchardt and A. Clebsch from posthumous manuscripts of C. G. J. Jacobi. The solution of the following problem: &#x201c;to transform a square table of m 2 numbers by adding minimal numbers &#x2113; i to each horizontal row, in such a way that it possess m transversal maxima&#x201d;, determines the order and the shortest normal form reduction of the system: the equations u i =&#x00a0;0 must be respectively differentiated &#x2113; i times. One also determines the number of differentiations of each equation of the given system needed to produce the differential equations necessary to reduce the proposed system to a single equation.
An efficient placement and routing technique for fault-tolerant distributed embedded computing
Authors: Roozbeh Jafari, Hassan Ghasemzadeh, Foad Dabiri, Ani Nahapetian, Majid Sarrafzadeh
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2009)

This article presents an efficient technique for placement and routing of sensors/actuators and processing units in a grid network. The driver application that we present is a medical jacket, which requires an extremely high level of robustness and fault tolerance. The power consumption of such jacket is another key technological constraint. Our proposed interconnection network is a mesh of wires. A jacket made of fabric and wires would be susceptible to accidental damage via tears. By modeling the tears, we evaluate the probability of having failures on every segment of wires in our mesh interconnection network. Then, we study two problems of placement and routing in the sensor networks such that the fault tolerance is maximized while the power consumption is minimized. We develop efficient integer linear programming (ILP) formulations to address these problems and perform both placement and routing, simultaneously. This ensures that the solution is a lower bound for both problems. We evaluate the effectiveness of our proposed techniques on a variety of benchmarks.
Computational method for inverse dynamics control of rapid reorientation maneuvers of combat airplanes
Authors: Bogdan C. Teodorescu
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

An original differential method is proposed for solving inverse problems related to the control of rapid reorientation maneuvers of combat airplanes. In the present paper, such maneuvers are defined by prescribing, in a suitable mathematical form, the time-variations of the airplane's azimuth angle, longitudinal attitude angle, and sideslip angle. The control functions corresponding to the prescribed reorientation maneuver are determined. The computational process involves two iterated steps: solving a second-order nonlinear differential system; solving a linear time-variant algebraic system. A relevant numerical simulation case is presented.
Serious Use of a Serious Game for Language Learning
Authors: W. Lewis Johnson
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

The Tactical Language and Culture Training System (TLCTS) helps learners acquire basic communicative skills in foreign languages and cultures. Learners acquire communication skills through a combination of interactive lessons and serious games. Artificial intelligence plays multiple roles in this learning environment: to process the learner's speech, to interpret and evaluate learner actions, to control the response of non-player characters, to generate hints, and to assess the trainee's mastery of the skills. AI is also used to assist in the authoring process to assist in the generation and validation of lesson content. This paper gives an overview of the current system, and describes the experience to date in transitioning the system from research prototype into a training system that is in regular use by thousands of users in the United States and elsewhere.
Development and Validation of an Animation-Based Test in the Area of Earth Sciences
Authors: Huang-Ching Wu, Chun-Yen Chang
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

This study tries to develop an animation-based test (ABT) in the area of Earth science. The advantages of ABT includes: (1) To present more authentic situation in an animated testing environment; (2) To assess the learning outcomes with appropriate validity and reliability; (3) To be a more attractive way of testing. The content of the test focuses on four domains in Earth science including astronomy, meteorology, oceanography and geology. “Attitude toward Animated Assessment Scale” (AAAS) was adapted in this study in order to explore examinees' perceptions and attitudes toward ABT. This study found the ABT to be generally validate and reliable and test-takers had better performance in the animation-based testing environment.
System design for a long-line quantum repeater
Authors: Rodney Van Meter, Thaddeus D. Ladd, W. J. Munro, Kae Nemoto
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

We present a new control algorithm and system design for a network of quantum repeaters, and outline the end-to-end protocol architecture. Such a network will create long-distance quantum states, supporting quantum key distribution as well as distributed quantum computation. Quantum repeaters improve the reduction of quantum-communication throughput with distance from exponential to polynomial. Because a quantum state cannot be copied, a quantum repeater is not a signal amplifier. Rather, it executes algorithms for quantum teleportation in conjunction with a specialized type of quantum error correction called purification to raise the fidelity of the quantum states. We introduce our banded purification scheme, which is especially effective when the fidelity of coupled qubits is low, improving the prospects for experimental realization of such systems. The resulting throughput is calculated via detailed simulations of a long line composed of shorter hops. Our algorithmic improvements increase throughput by a factor of up to 50 compared to earlier approaches, for a broad range of physical characteristics.
A new automated quality assessment algorithm for image fusion
Authors: Yin Chen, Rick S. Blum
Venue: Image and Vision Computing (2009)

Automated image quality assessment is highly desirable to evaluate the performance of various image fusion algorithms for night vision applications. In this paper we propose a perceptual quality evaluation method for image fusion which is based on human visual system (HVS) models. Our method assesses the image quality of a fused image using the following steps. First, the source and fused images are filtered by a contrast sensitivity function (CSF) after which a local contrast map is computed for each image. Second, a contrast preservation map is generated to describe the relationship between the fused image and each source image. Finally, the preservation maps are weighted by a saliency map to obtain an overall quality map. The mean of the quality map indicates the quality of the fused image. Experimental results compare the predictions made by our algorithm with human perceptual evaluations for several different parameter settings in our algorithm. The most popular existing algorithms are also evaluated. For some specific parameter settings, we find our algorithm provides better predictions, which are more closely matched to human perceptual evaluations, than the existing algorithms. The evaluations focus on the night vision application, but the algorithm we propose is applicable to other applications also.
Criteria and Evaluation for Ontology Modularization Techniques
Authors: Mathieu D'Aquin, Anne Schlicht, Heiner Stuckenschmidt, Marta Sabou
Venue: Modular Ontologies: Concepts, Theories and Techniques for Knowledge Modularization (2009)

While many authors have argued for the benefits of applying principles of modularization to ontologies, there is not yet a common understanding of how modules are defined and what properties they should have. In the previous section, this question was addressed from a purely logical point of view. In this chapter, we take a broader view on possible criteria that can be used to determine the quality of a modules. Such criteria include logic-based, but also structural and application-dependent criteria, sometimes borrowing from related fields such as software engineering. We give an overview of possible criteria and identify a lack of application-dependent quality measures. We further report some modularization experiments and discuss the role of quality criteria and evaluation in the context of these experiments.
Adobe InDesign CS3 Training DVD
Authors: Noble Desktop
Venue:  (2007)

This DVD video training and Workbook combo is based on the 3-day intensive class we give in New York City. You learn by watching the video, then you get hands on practice by doing step-by-step exercises in the workbook. We have a practical approach to teaching: you learn tools and features by using them in projects such as posters, books, magazines, and more. That way you learn a lot about InDesign in a short amount of time. It's the next best thing to being in one of our classes! You Will Learn Styling Type Working with Graphics Defining & Using Colors Hyphenation Baseline Grid Style Sheets Master Pages Tables Anchored Graphics How to Send Files to the Printer Keyboard Shortcuts And More... This Training Package Contains DVD with 6 hours of video training (to be viewed on Mac or PC) 103 page Course Workbook with step-by-step exercises Practice files to use with the exercises Requirements Quicktime 6 or higher Minimum display resolution of 1024 X 768 Mac: minimum G4 800mhz with 384mb of RAM PC: minimum Pentium 4 1Ghz with 384mb of RAM Since we use hi-resolution video, these DVDs are for your computer only, not your TV DVD player. 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
A flexible arithmetic system for simulation
Authors: Philip H. Leong
Venue:  (2008)

Custom hardware accelerators are commonly used in simulation systems requiring high computational power. Such applications often have few data dependencies, allowing implementation using parallel datapaths. For such problems, optimization of the datapath of the circuits leads to significant improvements in overall performance. The Computer Arithmetic Synthesis Technology (CAST) framework, developed in this work, allows one to quickly explore the design space in three dimensions: the number system, the operator architecture and the configuration of individual operators. It utilizes sophisticated arithmetic algorithms and reconfigurable architectures, captured in the object libraries. The final result is an optimized datapath satisfying user requirements, and the output can be controlled at different levels. To demonstrate its ability, the CAST framework is used to implement a number of simulation systems including the datapath for the force computation pipeline of N-body simulation and Monte Carlo simulation for interest rate financial derivatives. A novel multiplier generator and an efficient random number generator are also presented as basic building blocks for simulation. Together, these tools provide an easy way to describe simulation system in a number system independent manner, and generate implementation to satisfy different performance, area and accuracy constraints.
Binary Biometric Representation through Pairwise Polar Quantization
Authors: Chun Chen, Raymond Veldhuis
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

Binary biometric representations have great significance for data compression and template protection. In this paper, we introduce pairwise polar quantization. Furthermore, aiming to optimize the discrimination between the genuine Hamming distance (GHD) and the imposter Hamming distance (IHD), we propose two feature pairing strategies: the long-short (LS) strategy for phase quantization, as well as the long-long (LL) strategy for magnitude quantization. Experimental results for the FRGC face database and the FVC2000 fingerprint database show that phase bits provide reasonably good performance, whereas magnitude bits obtain poor performance.
Low Complexity Decoder Architecture for Low-Density Parity-Check Codes
Authors: Daesun Oh, Keshab K. Parhi
Venue: Journal of Signal Processing Systems (2009)

In this paper, we propose a low complexity decoder architecture for low-density parity-check (LDPC) codes using a variable quantization scheme as well as an efficient highly-parallel decoding scheme. In the sum-product algorithm for decoding LDPC codes, the finite precision implementations have an important tradeoff between decoding performance and hardware complexity caused by two dominant area-consuming factors: one is the memory for updated messages storage and the other is the look-up table (LUT) for implementation of the nonlinear function ¿(x). The proposed variable quantization schemes offer a large reduction in the hardware complexities for LUT and memory. Also, an efficient highly-parallel decoder architecture for quasi-cyclic (QC) LDPC codes can be implemented with the reduced hardware complexity by using the partially block overlapped decoding scheme and the minimized power consumption by reducing the total number of memory accesses for updated messages. For (3, 6) QC LDPC codes, our proposed schemes in implementing the highly-parallel decoder architecture offer a great reduction of implementation area by 33% for memory area and approximately by 28% for the check node unit and variable node unit computation units without significant performance degradation. Also, the memory accesses are reduced by 20%.
Beyond blacklists: learning to detect malicious web sites from suspicious URLs
Authors: Justin Ma, Lawrence K. Saul, Stefan Savage, Geoffrey M. Voelker
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Malicious Web sites are a cornerstone of Internet criminal activities. As a result, there has been broad interest in developing systems to prevent the end user from visiting such sites. In this paper, we describe an approach to this problem based on automated URL classification, using statistical methods to discover the tell-tale lexical and host-based properties of malicious Web site URLs. These methods are able to learn highly predictive models by extracting and automatically analyzing tens of thousands of features potentially indicative of suspicious URLs. The resulting classifiers obtain 95-99% accuracy, detecting large numbers of malicious Web sites from their URLs, with only modest false positives.
Multi-channel PWM signal generation method and its application on robot toy control
Authors: Chin-Pao Hung, Wei-Ging Liu, Hong-Jhe Su, Shun-Tzai Chen
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

The aim of this research considered in this paper is to show a novel multi-channel PWM (pulse width modulation) signal generation method for the multi-joint RC robot driving. Integrating the I/O pins of the microcontroller and the interrupt function of the built-in timer, the maximum PWM channel number is identical to the number of I/O pins and can be used to drive the multi-joint robot. Firstly, configure the timer to generate a preset period clock as the interrupt time base and preset the I/O pins at HIGH level. Secondly, design a corresponding interrupt subroutine to control the duty cycle of each PWM channel. In the interrupt subroutine, an interrupt counter is incremented for every interrupt happened and can be used for the duration calculation of each pin's HIGH level output. Assume the duty cycle of each PWM channel is calculated in each control cycle beginning. Comparing the preset duty cycle of each channel and the time of duration, the corresponding pin will be reset as zero if the equal condition is achieved. Therefore, the duty cycle of each PWM channel is under control. Also, based on the precise time base, a preset interrupt counter bound is used to tune the PWM period. Once the upper bound of interrupt counter is achieved, the interrupt counter will be reset as zero and all the pins' outputs are reset as HIGH level again. Applying this novel scheme to the 18 joints RC robot control, without any other extra chips or components, the smoothing motion control demonstrated the feasibility of the proposed scheme.