ppxscal/embedding_network huggingface dataset:
Improving Flexibility and Reusage of Business Process Management: the Role of Cased-based Reasoning Technique
Authors: Qing Yao, Zhumin Chen, Haiyang Wang
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

This paper discusses a solution to improve flexibility of BPMS and promote its reuse by using an AI technique: Case-based Reasoning, that is, to solve a new problem by remembering a previous similar situation and by reusing information and knowledge of that situation. The main interest in CBR relies on its allowance of a system to avoid past failures and exploit past successes. The focus of our business process management depicted is on the transformation of a business goal's states, which are the most important scenarios of enterprises. A case is a template of common business processes, which combines a series of activities to meet some special goals, in another word, to complete goal's states transformation. Cases can be modified to meet the new business goals specification, and restored in repository, which contributes to knowledge base. The paper discusses cases retrieval, reusing, revising, and retaining based on a goal's states transformation and gives cases representation. It emphasizes the similarity measure of cases and gives match arithmetic.
Source detection and DOA estimation from two observations of a finite line aperture
Authors: B. Champagne
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The author deals with the joint problem of source detection and direction of arrival (DOA) estimation from the observation of a line aperture of finite length at two distinct times. The emphasis is on the practical case of small KL product, where K is the bandwidth of the spatial signal and L is the aperture length. The optimum (log-likelihood) processor for detection and DOA estimation is derived. A suboptimum processor with reduced computational complexity is also obtained based on a high signal-to-noise ratio (SNR) approximation. Computer simulations indicate that significant improvements in performance are possible with these processors when compared with more conventional correlation-based processing techniques.
Complying with Compliance
Authors: Eric Allman
Venue: Queue (2006)

&ldquo;Hey, compliance is boring. Really, really boring. And besides, I work neither in the financial industry nor in health care. Why should I care about SOX and HIPAA?&rdquo; Yep, you&rsquo;re absolutely right. You write payroll applications, or operating systems, or user interfaces, or (heaven forbid) e-mail servers. Why should you worry about compliance issues?
An Application of IDD Spectrum Testing Method to the Fault Analysis
Authors: Kazuhiro Sakaguchi
Venue: Proceedings of the 15th Asian Test Symposium (2006)

IDDQ information is very useful to localize faults in a LSI. But it is time consuming to discover test vectors which induce abnormal IDDQ. Since the IDD spectrum testing method can detect abnormal supply current easily, we can acquire the test vector information in a short time by the method. An application of the method is introduced and we show experimental results.
A band-pass Gm-C Filter design based on gm/ID methodology and characterization
Authors: Fernando Paixao Cortes, Eric Fabris, Sergio Bampi
Venue: Proceedings of the 19th annual symposium on Integrated circuits and systems design (2006)

This paper addresses the design of continuous-time CMOS Band-pass Gm-C Filter using a design methodology based on the gm/ID transistor characteristics. This analog module was analyzed, designed and prototyped in AMS 0.35μm CMOS technology. Experimental results are presented, in order to validate the methodology. The filter has a pass-band central frequency of about 5MHz (with a small tuning range), quality factor of 25 and a current consumption of 263μA.
Performance Evaluation of the . Accrual Failure Detector
Authors: Naohiro Hayashibara, Makoto Takizawa
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

In this paper, we explain an implementation of an accrual failure detector, that we call the . failure detector. The particularity of the . failure detector is that it dynamically adjusts to current network conditions the scale on which the suspicion level is expressed. We have done the experiment in a LAN in a whole day and evaluated the behavior of our . failure detector. Then we discuss on the parameters of the failure detector based on our experimental result.
Using dynamic multiresolution modelling to analyze large material flow systems
Authors: Wilhelm Dangelmaier, Bengt Mueck
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The interactive, simulation-aided analysis of material flow systems is often done with the help of virtual reality. If a user wants to influence the simulation run, the simulation and the visualization have to be computed simultaneously. Large, detailed simulation models, which can not be calculated fast enough, can not be analyzed interactively. This paper presents a method which only computes those parts of simulation models that are visited by the user. If a user shifts its attention, the area being simulated in detail is up-dated. Since the major part of the simulation is not detailed, the necessary calculating complexity is reduced. On the basis of models allowing a multiresolution simulation methods are introduced which regulate the level of detail based on the evaluation of the user's attention. Changing the levels of details leads to the exchange of models with different level of details.
Self-adjoint difference operators and classical solutions to the Stieltjes-Wigert moment problem
Authors: Jacob S. Christiansen, Erik Koelink
Venue: Journal of Approximation Theory (2006)

The Stieltjes-Wigert polynomials, which correspond to an indeterminate moment problem on the positive half-line, are eigenfunctions of a second order q-difference operator. We consider the orthogonality measures for which the difference operator is symmetric in the corresponding weighted L2-spaces. Under some additional assumptions these measures are exactly the solutions to the q-Pearson equation. In the case of discrete and absolutely continuous measures the difference operator is essentially self-adjoint, and the corresponding spectral decomposition is given explicitly. In particular, we find an orthogonal set of q-Bessel functions complementing the Stieltjes-Wigert polynomials to an orthogonal basis for L2(µ) when µ is a discrete orthogonality measure solving the q-Pearson equation. To obtain the spectral decomposition of the difference operator in case of an absolutely continuous orthogonality measure we use the results from the discrete case combined with direct integral techniques.
A view on full-diversity modulus-preserving rate-one linear space-time block codes
Authors: Shengli Zhou, Xiaoli Ma, Krishna Pattipati
Venue: Signal Processing (2006)

In this paper, we consider the class of linear space time block codes (STBCs) that possess the following properties: (i) enabling full antenna diversity, (ii) preserving the modulus of information symbols, and (iii) achieving the maximum rate of one symbol per channel use under (i) and (ii). We first provide an alternative construction for full-diversity rate-one STBCs that are based on linear constellation precoding (LCP). In sharp contrast to existing LCP-based designs, the proposed construction is modulus-preserving, thanks to an explicit unitary diagonal precoding on symbol blocks combined with an implicit fast-Fourier-transform (FFT) precoding via circularly shifted transmissions over multiple antennas. Our proposed construction also allows flexible choices on the precoder size, a feature not available in the original design. We then demonstrate that quasi-orthogonal (QO) STBCs can be constructed by embedding modulus-preserving LCP designs into orthogonal structures. Interestingly, QO-STBCs can be interpreted as space-time-frequency (STF) block codes, that were originally developed for multi-antenna multi-carrier systems, up to FFT transformations.
Multi-Camera Scene Flow by Tracking 3-D Points and Surfels
Authors: Frederic Devernay, Diana Mateus, Matthieu Guilbert
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Scene flow represents the 3-D motion of points in the scene, just as optical flow is related to their 2-D motion in the images. As opposed to classical methods which compute scene flow from optical flow, we propose to compute it by tracking 3-D points and surface elements (surfels) in a multi-camera setup (at least two cameras are needed). Two methods are proposed: in the first one, the translation of each 3-D point is found by matching the neighborhoods of its 2-D projections in each camera between two time steps; in the second one, the full pose of a surfel is recovered by matching the image of its projection with a texture template attached to the surfel, and visibility changes caused by occlusion or rotation of surfels are handled. Both methods detect lost or untrackable points and surfels. They were designed for real-time execution and can be used for fast extraction of scene flow from multi-camera sequences.
Motivation in project-based classrooms: new measures better coupled to students' experiences
Authors: Phillip Herman, Louis Gomez
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Project-Based Science (PBS) has traditionally been proposed as a comprehensive approach to classroom teaching and learning that is designed, in part, to better motivate students to learn. As PBS units became more widespread in schools, initial evaluations of their impact focused primarily on documenting important learning outcomes such as performance on unit assessments and standardized exams (Herman, Mackenzie, Sherin, & Reiser, 2002). The motivational impact of PBS units is not so well documented. In particular, little has been done to study motivation across PBS units or across school years. Traditional measures of motivation, first developed primarily by educational and developmental psychologists, were essentially inherited by the learning sciences community and have not been efficient indicators of the impact of curricular innovations on student motivation. We argue for new motivation-related measures that are more closely coupled to the actual experiences of students in projects and report on our initial attempts to develop such measures.
Plagiarism detection across programming languages
Authors: Christian Arwin, S. M. M. Tahaghoghi
Venue: Proceedings of the 29th Australasian Computer Science Conference - Volume 48 (2006)

Plagiarism is a widespread problem in assessment tasks; in computing courses, students often plagiarise source code. For all but the smallest classes, manual detection of such plagiarism is impractical, and, while automated tools are available, none has been applied to detect inter-lingual plagiarism, where source code is copied from one language to another. In this work, we propose a novel approach, XPlag, to detect plagiarism involving multiple languages using intermediate program code produced by a compiler suite. We describe experiments to evaluate XPlag, and show that we can detect inter-lingual plagiarism with reasonably good precision.
Curve-Based Secure Routing Algorithm for Sensor Network
Authors: Fen-hua Cheng, Jin Zhang, Zheng Ma
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

According to curve-based greedy routing algorithm and suitable encrypting algorithm, a secure routing algorithm is proposed. The algorithm encrypts each forwarded packets using different encryption keys. According to some defined metrics, the complexity and security are analyzed. It is shown that the proposed algorithm has low complexity and can provide the reliability to some extent.
Properties of four partial orders on standard Young tableaux
Authors: Müge Taskin
Venue: Journal of Combinatorial Theory Series A (2006)

Let SYTn be the set of all standard Young tableaux with n cells. After recalling the definitions of four partial orders, the weak, KL, geometric and chain orders on SYTn and some of their crucial properties, we prove three main results: • Intervals in any of these four orders essentially describe the product in a Hopf algebra of tableaux defined by Poirier and Reutenauer. • The map sending a tableau to its descent set induces a homotopy equivalence of the proper parts of all of these orders on tableaux with that of the Boolean algebra 2[n-1]. In particular, the Möbius function of these orders on tableaux is (-1)n-3. • For two of the four orders, one can define a more general order on skew tableaux having fixed inner boundary, and similarly analyze their homotopy type and Möbius function.
Transient wave propagation in inhomogeneous porous materials: application of fractional derivatives
Authors: M. Fellah, Z. E. A. Fellah, C. Depollier
Venue: Signal Processing (2006)

Acoustic wave propagation in inhomogeneous porous material is studied in the time domain. Fractional calculus is used to describe the inertial, viscous and thermal interactions between fluid and structure. A generalized hyperbolic fractional equation (generalized Telegraph equation) for transient sound wave propagation in inhomogeneous material is established. A wave-splitting technique is presented formally for the description of the dynamic equation of the reflection scattering operator.
Real-time retinex image enhancement: algorithm and architecture optimizations
Authors: J. Philip Kearns
Venue:  (2006)

The field of digital image processing encompasses the study of algorithms applied to two-dimensional digital images, such as photographs, or three-dimensional signals, such as digital video. Digital image processing algorithms are generally divided into several distinct branches including image analysis, synthesis, segmentation, compression, restoration, and enhancement. One particular image enhancement algorithm that is rapidly gaining widespread acceptance as a near optimal solution for providing good visual representations of scenes is the Retinex. The Retinex algorithm performs a non-linear transform that improves the brightness, contrast and sharpness of an image. It simultaneously provides dynamic range compression, color constancy, and color rendition. It has been successfully applied to still imagery---captured from a wide variety of sources including medical radiometry, forensic investigations, and consumer photography. Many potential users require a real-time implementation of the algorithm. However, prior to this research effort, no real-time version of the algorithm had ever been achieved. In this dissertation, we research and provide solutions to the issues associated with performing real-time Retinex image enhancement. We design, develop, test, and evaluate the algorithm and architecture optimizations that we developed to enable the implementation of the real-time Retinex specifically targeting specialized, embedded digital signal processors (DSPs). This includes optimization and mapping of the algorithm to different DSPs, and configuration of these architectures to support real-time processing. First, we developed and implemented the single-scale monochrome Retinex on a Texas Instruments TMS320C6711 floating-point DSP and attained 21 frames per second (fps) performance. This design was then transferred to the faster TMS320C6713 floating-point DSP and ran at 28 fps. Then we modified our design for the fixed-point TMS320DM642 DSP and achieved an execution rate of 70 fps. Finally, we migrated this design to the fixed-point TMS320C6416 DSP. After making several additional optimizations and exploiting the enhanced architecture of the TMS320C6416, we achieved 108 fps and 20 fps performance for the single-scale, monochrome Retinex and three-scale, color Retinex, respectively. We also applied a version of our real-time Retinex in an Enhanced Vision System. This provides a general basis for using the algorithm in other applications.
Fuzzy Iterative Learning Control for Nonlinear Systems with Missing Data
Authors: Fenghuang Cai, Wu Wang, Fuwen Yang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

For packet-based transmission of data over a network, or temporary sensor failure, etc., data samples may be missing in the measured signals. The missing measurements will happen at any sample time, and the probability of the occurrence of missing data was assumed to be known. The series which fulfils Bernoulli distribution was used to describe the missing measurements. Based on the Takagi-Sugeno fuzzy model, nonlinear system was represent by T-S fuzzy model via the so-called parallel distributed compensation(PDC) approach. The fuzzy iterative learning controller was developed to guarantee the expected convergence of the tracking error and with quadratic performance index. A numerical example was provided to demonstrate the validity of the proposed design approach.
A Case Study: Hybrid Simulation on the KOCEDgrid System
Authors: Donggeon Noh, Song-Yi Yi, Hyuntaek Kwon
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

The KOCED (Korea construction engineering development) collaboration was formed to provide a shared infrastructure for construction and civil engineering research and education facilities, which are distributed over different locations in Korea. The Internet-based grid system and various applications on KOCED enable remote users to perform experiments on several distributed facilities. KOCED has been working on hybrid simulations on this Internet-based grid systems. Hybrid simulation supports experiments on distributed components, which are software codes or physical devices. We describe how our mini-MOST hybrid simulation is implemented on the KOCED grid system, and we discuss techniques to improve the speed and efficiency of these hybrid experiments.
An analytical model for the investigation of axial wall forces generated by an arterial stenosis
Authors: P.-A. Doriot, P.-A. Dorsaz
Venue: Technology and Health Care (2006)

The causes of arteriosclerosis are intensively investigated since many decades. While circumferential wall stress has received a lot of attention, axial stress (also called "longitudinal" stress) has been largely neglected, and practically never incriminated. However, it has been suggested in 2003 that moderate and severe arterial stenoses may induce non negligible axial forces cyclically in the vessel segment just proximal to the constriction cone. In the present contribution, we describe a simple analytical model that allows to study the distribution of these forces along the vessel in dependence of the respective axial elasticities of vessel and surrounding tissues, and of the stenosis length.
Diverse Soft Real-Time Processing in an Integrated System
Authors: Caixue Lin, Tim Kaldewey, Anna Povzner, Scott A. Brandt
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

The simple notion of soft real-time processing has fractured into a spectrum of diverse soft real-time types with a variety of different resource and time constraints. Schedulers have been developed for each of these types, but these are essentially point solutions in the space of soft real-time and no detailed unified definition of soft real-time has previously been provided that includes all types of soft realtime processing. We present a complete real-time taxonomy covering the spectrum of processes from best-effort to hard real-time. The taxonomy divides processes into nine classes based on their resource and timeliness requirements and includes four soft real-time classes, each of which captures a group of soft real-time applications with similar characteristics. We exploit the different features of each of the soft real-time classes to integrate all of them into a single scheduler together with hard real-time and best-effort processes and present results demonstrating their performance.
Research on the Integration in E-government Based on Multi-agent
Authors: Peng Zhang, Yanzhang Wang, Xuehua Wang
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

The final destination of Chinese E-government is to establish the "one-stop" pattern, which is on the basis of the construction of integration among different units and application systems. In this paper, the techniques of Multi-Agent and computer-supported cooperative work are used as the key technology to realize the integration among units at different levels. Based on the analysis of the requirement for integration, the systematic structure, the organization structure of Multi-Agent and the structure of integration based on Multi-Agent for general use are designed. This study is useful for the construction of Chinese E-government and reused by the integration of the applications in E-government.
Mobile computing, visual diaries, learning and communication: changes to the communicative ecology of design students through mobile computing
Authors: Marsha Berry, Margaret Hamilton
Venue: Proceedings of the 8th Austalian conference on Computing education - Volume 52 (2006)

How students learn and what encourages them to communicate and reflect on their learning provide continual challenges for teachers. If we can find ways to enlighten this process, we can encourage and foster a better learning environment for all concerned. In this paper, we discuss the influence that Tablet PCs have had on the way multimedia students learn concepts and approach their design development work through their communicative ecology. As part of their course, these students are required to write visual diaries as reflective practice on their design process. Among other things, access to the Tablet PCs greatly enhances their contributions to their visual diaries by allowing them to develop their draft diagrams quickly and easily and integrate them into their blogs to achieve a comprehensive work portfolio..
Approximate data mining in very large relational data
Authors: James C. Bezdek, Richard J. Hathaway, Christopher Leckie, Ramamohanarao Kotagiri
Venue: Proceedings of the 17th Australasian Database Conference - Volume 49 (2006)

In this paper we discuss eNERF, an extended version of non-Euclidean relational fuzzy c-means (NERFCM) for approximate clustering in very large (unloadable) relational data. The eNERF procedure consists of four parts: (i) selection of distinguished features by algorithm DF to be monitored during progressive sampling; (ii) progressively sampling a square N×N relation matrix RN by algorithm PS until an n×n sample relation Rn passes a goodness of fit test; (iii) Clustering Rn using algorithm LNERF; and (iv), extension of the LNERF results to RN-Rn by algorithm xNERF, which uses an iterative procedure based on LNERF to compute fuzzy membership values for all of the objects remaining after LNERF clustering of the accepted sample. Three of the four algorithms are new - only LNERF (called NERFCM in the original literature) precedes this article.