ppxscal/embedding_network huggingface dataset:
Adding data process feedback to the nonlinear autoregressive model
Authors: Hiroko Kato, Tohru Ozaki
Venue: Signal Processing (2002)

A nonlinear autoregressive model, the process feedback nonlinear autoregressive (PFNAR) model, in which the autoregressive coefficients are a function of the combination of past data, is proposed. The autoregressive coefficients of the PFNAR model consist of sequential autoregressive parts, and a data process feedback part that feeds back the influence from previous data points with "significant delays". Simulation data generated by the PFNAR model is introduced and compared with the ordinary autoregressive model and exponential autoregressive model. As a real example, the model is applied to ear pulse data for controlling respiration. Compared with some nonlinear models that do not address the process feedback part within autoregressive coefficients, the prediction error demonstrates distinct improvement. Autoregressive coefficients generally describe the transformed characteristics of the data, and the coefficients of the PFNAR model describe the characteristics at sample time intervals. The instantaneous transfer characteristics of the data show the complexity of the nonlinear dynamics of respiration. The PFNAR model may reveal the nonlinear dynamic system for pseudo-periodic biomedical oscillation generated by complex physiological phenomena. Furthermore, the model may be applied to determine the mechanisms of phenomena fed back to the data processes within a certain system.
Human-Computer Interaction Software: Lessons Learned, Challenges Ahead
Authors: Gerhard Fischer
Venue: IEEE Software (1989)

The author presents a knowledge-based approach to enhance and support communication between humans and computers. His system architecture has an explicit communication channel between the human and the hardware and an implicit communication channel between the human's knowledge base and the computer's stored knowledge. The author uses two intelligent support systems, Framer and Crack, to illustrate this concept. He concludes with a pragmatic description of lessons learned and problems ahead.
A Skill Refinement Learning Model for Rule-Based Expert Systems
Authors: Pi-Sheng Deng, Clyde W. Holsapple, Andrew B. Whinston
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

Research in equipping rule-based expert systems with skill refinement behavior by utilizing the recognize-act control mechanism is described. An overview of expert system skill refinement is provided. A skill refinement model for generating plans is then presented. Two closely coupled and mutually supportive mechanisms characterize this model: a rule-selecting mechanism (corresponding to a buyer-selecting procedure) that dynamically incorporates the concept of multiple selection/preference criteria into the conflict resolution process, and an economics-based credit assignment mechanism (corresponding to a capital reallocation procedure) that uses an inference engine's experiences to update the potentiality of each rule participating in the problem-solving process. A mathematical description of the model is given. An example is provided to illustrate the inference engine's skill refinement and the applicability of the model is discussed.
R++: Adding Path-Based Rules to C++
Authors: D. Litman, P. F. Patel-Schneider, A. Mishra, J. Crawford, D. Dvorak
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Object-oriented languages and rule-based languages offer two distinct and useful programming abstractions. However, previous attempts to integrate data-driven rules into object-oriented languages have typically achieved an uneasy union at best. R++ is a new, closer integration of the rule-based and object-oriented paradigms that extends C++ with a single programming construct, the path-based rule, as a new kind of class member. Path-based rules¿data-driven rules that are restricted to following pointers between objects¿are like automatic methods that are triggered by changes to the objects they monitor. Path-based rules provide a useful level of abstraction that encourages a more declarative style of programming and are valuable in object-oriented designs as a means of modeling dynamic collections of interdependent objects. Unlike more traditional pattern-matching rules, path-based rules are not at odds with the object-oriented paradigm and offer performance advantages for many natural applications.
Color Constant Color Indexing
Authors: Brian V. Funt, Graham D. Finlayson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

Objects can be recognized on the basis of their color alone by color indexing, a technique developed by Swain and Ballard [15] which involves matching color-space histograms. Color indexing fails, however, when the incident illumination varies either spatially or spectrally. Although this limitation might be overcome by preprocessing with a color constancy algorithm, we instead propose histogramming color ratios. Since the ratios of color RGB triples from neighboring locations are relatively insensitive to changes in the incident illumination, this circumvents the need for color constancy preprocessing. Results of tests with the new color-constant-color-indexing algorithm on synthetic and real images show that it works very well even when the illumination varies spatially in its intensity and color.
Official SYBASE Internals: Designing and Troubleshooting for High Performance, 1st edition
Authors: John E. Kirkwood
Venue:  (1997)

:Master SQL Server high-level features to develop an efficient system - and keep it that way. With a focus on practical issues, problems, and solutions, this professional guide's convenient FAQ format provides quick answers and a methodical approach to identifying and quickly resolving performance issues. 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
Deposition of Cu films from supercritical fluids using Cu(I) &#x03B2;-diketonate precursors
Authors: Albertina Cabañas, Jason M. Blackburn, James J. Watkins
Venue: Microelectronic Engineering (2002)

Cu films were deposited onto planar and etched silicon substrates by the hydrogen-assisted reduction of a series of copper(I)(1,1,1,5,5,5-hexafluoro-2,4-acetylacetonate)L compounds [Cu(I)(hfac)L] where L is (2- butyne), (1,5-cyclooctadiene), (vinyltrimethylsilane) or (2-methyl-1-hexene-3-yne) in supercritical solvents using a cold wall, high pressure reactor. At substrate temperatures of 225 °C and a pressure of 200 bar, H2 reduction of Cu(I)(hfac)(2-butyne) in CO2 yielded high purity films with exceptional step coverage in features as narrow as 100 nm with an aspect ratio of eight. Planar films deposited by H2 reduction of each of the precursors in supercritical CO2 and Cu(I)(hfac)(2-butyne) in supercritical C2F6 exhibited little carbon or oxygen contamination. Attempts to deposit high purity Cu films by the thermal disproportionation of the Cu(I)(hfac)L precursors in supercritical CO2 in the absence of H2 at 225 °C were unsuccessful and yielded highly oxidized Cu films in each case. Thermal disproportionation of Cu(I)(hfac)(2-butyne) in supercritical C2F6 also yielded poor quality films, although oxygen contamination was less severe than in CO2.
Computation of Stable Models and Its Integration with Logical Query Processing
Authors: Weidong Chen, David Scott Warren
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

The well-founded semantics and the stable model semantics capture intuitions of the skeptical and credulous semantics in nonmonotonic reasoning, respectively. They represent the two dominant proposals for the declarative semantics of deductive databases and logic programs. However, neither semantics seems to be suitable for all applications. We have developed an efficient implementation of goal-oriented effective query evaluation under the well-founded semantics. It produces a residual program for subgoals that are relevant to a query, which contains facts for true instances and clauses with body literals for undefined instances. This paper presents a simple method of stable model computation that can be applied to the residual program of a query to derive answers with respect to stable models. The method incorporates both forward and backward chaining to propagate the assumed truth values of ground atoms, and derives multiple stable models through backtracking. Users are able to request that only stable models satisfying certain conditions be computed. A prototype has been developed that provides integrated query evaluation under the well-founded semantics, the stable models, and ordinary Prolog execution. We describe the user interface of the prototype and present some experimental results.
Fuzzy Rule-Based Systems on General-Purpose Processors
Authors: Hartmut Surmann, Ansgar P. Ungering
Venue: IEEE Micro (1995)

Fast implementations of fuzzy rule based systems on general purpose processors are required during the simulation and optimization of fuzzy systems with neural networks or genetic algorithms. In this paper we present several adapted concepts for the implementation of FRBS on general purpose processors on the basis of a precise analysis of the fuzzy algorithm. These concepts are based on look-up tables, optimized rule processing and digital pulse-duration modulation. Using these concepts, general purpose processors can procduce solutions quicker than the second generation of special fuzzy processors could.
Spectral stability of small-amplitude shock profiles for dissipative symmetric hyperbolic-parabolic systems
Authors: Jeffrey Humpherys, Kevin Zumbrun
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2002)

We prove one-dimensional spectral stability of small amplitude shock profiles for degenerate viscosity conservation laws that are dissipative symmetric hyperbolic-parabolic in the sense of Kawashima [Ka.1], generalizing well-known results of Matsumura and Nishihara [MN] and of Kawashima, Matsumura, and Nishihara [KM,KMN] for the case of compressible gas dynamics. The proof follows an approach different from that of [MN,KM,KMN], instead combining the weighted energy method of Goodman [Go.2] with the auxiliary derivative estimates of Kawashima [Ka.1].
Calculating thermal radiation fields from 3D flame reconstruction
Authors: Paul Mason, Chris Rogers
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

Designing fire safety into a building requires a designer to think through issues that include fire ignition, growth and spread. Radiative heat transfer from flames is the dominant method of spread. It is, therefore, necessary to determine the thermal radiation field surrounding a fire. This can be estimated from the size and shape of the flame. In this paper we present a method to determine flame size and shape using image-processing techniques. The images of the fire are recorded using multiple cameras. Once the surface of the flame has been defined it is possible to calculate the heat flux at a given target. By repeating this process for multiple targets we can build up a thermal radiation field. This can then be used to find out which adjacent objects are threatened and which are safe.
Dedicated Digital Fuzzy Hardware
Authors: Donald L. Hung
Venue: IEEE Micro (1995)

Fuzzy systems based on dedicated digital hardware can deliver much higher performance than those based on general-purpose computing machines. The simplicity and versatility of some successful fuzzy inference algorithms, the advent of high-density, user programmable logic devices, together with the powerful CAD tools, made dedicated digital fuzzy hardware a feasible solution for implementing high-performance fuzzy systems.
Bar Code Waveform Recognition Using Peak Locations
Authors: E. Joseph, T. Pavlidis
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Traditionally, zero crossings of the second derivative provide edge features for the classification of blurred waveforms. The accuracy of these edge features deteriorates in the case of severely blurred images. In this paper, a new feature is presented that is more resistant to the blurring process, the image, and waveform peaks. In addition, an estimate of the standard deviation /spl sigma/ of the blurring kernel is used to perform minor deblurring of the waveform. Statistical pattern recognition is used to classify the peaks as bar code characters. The noise tolerance of this recognition algorithm is increased by using an adaptive, histogram-based technique to remove the noise. In a bar code environment that requires a misclassification rate of less than one in a million, the recognition algorithm showed a 43% performance improvement over current commercial bar code reading equipment.
ULSI Architectures for Artificial Neural Networks
Authors: Ulrich Rückert
Venue: IEEE Micro (2002)

No clear consensus exists about how to exploit the potential for massively parallel implementations of artificial neural networks. Three hardware implementations demonstrate key issues surrounding their use.
Compiler Support for Array Distribution onNUMA Shared Memory Multiprocessors
Authors: Tarek S. Abdelrahman, Thomas N. Wong
Venue: The Journal of Supercomputing (1998)

Management of program data to improve data locality and reduce false sharing is critical for scaling performance on NUMA shared memory multiprocessors. We use HPF-like data decomposition directives to partition and place arrays in data-parallel applications on Hector, a shared-memory NUMA multiprocessor. We describe a compiler system for automating the partitioning and placement of arrays. The compiler exploits Hectors shared memory architecture to efficiently implement distributed arrays. Experimental results from a prototype implementation demonstrate the effectiveness of these techniques. They also demonstrate the magnitude of the performance improvement attainable when our compiler-based data management schemes are used instead of operating system data management policies; performance improves by up to a factor of 5.
Antichain Codes
Authors: Gérard D. Cohen, Sylvia B. Encheva, Gilles Zémor
Venue: Designs, Codes and Cryptography (1999)

We show that almost all codes satisfy an antichain condition. This states that the minimum length of a two dimensional subcode of a code C increases if the subcode is constrained to contain a minimum weight codeword. In particular, almost no code satisfies the chain condition. In passing, we study the typical behaviour of codes with respect to generalized distances and show that almost all lie on a generalized Varshamov-Gilbert bound.
An Efficient Algorithm-Based Concurrent Error Detection for FFT Networks
Authors: Hee Yong Youn, Choong Gun Oh, Vijay K. Raj
Venue: IEEE Transactions on Computers (1995)

In this brief contribution a new algorithm-based concurrent error detection scheme employing the checksum approach is proposed for FFT networks. Our design allows high error coverage with low false alarm rate by applying the linear weight factors to the checksums. Due to the simplicity, the hardware overhead is relatively small and errors can be quickly detected. The design is also shown to be easily expanded for multidimensional FFT networks.
Neural Network Ensembles
Authors: L. K. Hansen, P. Salamon
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

Several means for improving the performance and training of neural networks for classification are proposed. Crossvalidation is used as a tool for optimizing network parameters and architecture. It is shown that the remaining residual generalization error can be reduced by invoking ensembles of similar networks.
Location-Independent Access in Mobile Systems
Authors: Zygmunt J. Haas
Venue: Wireless Personal Communications: An International Journal (1997)

In this paper, we report on the design of a protocol for transparent, location-independent access in mobile systems. The protocol, termed by us Mobile Client/Server Protocol (MCSP) is an implementation of a communication layer on a mobile host and a stationary machine within the wireline network, and provides middleware functionality. The MCSP supports communication services through the client/server paradigm to transaction-oriented applications distributed between the mobile and a set of service and information brokers. To support the mobile and the wireless environment, a surrogate process is created within the fixed network to perform operations on behalf of the mobile within the fixed network. The MCSP then loosely couples the communicating entities, thus reducing the overhead associated with handoffs and disconnects, so characteristic of the mobile environment. Of particular interest is the application of the MCSP to location-based services, for example, the Intelligent Vehicle Highway Systems [1].
On vertex-degree restricted subgraphs in polyhedral graphs
Authors: Igor Fabrici
Venue: Discrete Mathematics (2002)

First a brief survey of known facts is given. Main result of this paper: every polyhedral (i.e. 3-connected planar) graph G with minimum degree at least 4 and order at least k (k ≤ 4) contains a connected subgraph on k vertices having degrees (in G) at most 4k - 1, the bound 4k- 1 being best possible.
Detecting Binocular Half-Occlusions: Empirical Comparisons of Five Approaches
Authors: Geoffrey Egnal, Richard P. Wildes
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

Binocular half-occlusion points are those that are visible in one of the two views provided by a binocular imaging system. Due to their importance in binocular matching as well as, subsequent interpretation tasks, a number of approaches have been developed for dealing with such points. In the current paper, we consider five methods that explicitly detect half-occlusions and report on a more uniform comparison than has previously been performed. Taking a disparity image and its associated match goodness image as input, we generate images that show the half-occluded points in the underlying scene. We quantitatively and qualitatively compare these methods under a variety of conditions.
Coupling-driven signal encoding scheme for low-power interface design
Authors: Ki Wook Kim, Kwang Hyun Baek, Naresh Shanbhag, C. L. Liu, Sung Mo Kang
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

Coupling effects between on-chip interconnects must be addressed in ultra deep submicron VLSI and system-on-a-chip (SoC) designs. A new low-power bus encoding scheme is proposed to minimize coupled switchings which dominate the on-chip bus power consumption. The coupling-driven bus invert method use slim encoder and decoder architecture to minimize the hardware overhead. Experimental results indicate that our encoding methods save effective switchings as much as 30% in an 8-bit bus with one-cycle redundancy.
Noise Performance of Linear Associative Memories
Authors: K. J. Raghunath, V. Cherkassky
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

The performance of two commonly used linear models of associative memories, generalized inverse (GI) and correlation matrix memory (CMM) is studied analytically in the presence of a new type of noise (training noise due to noisy training patterns). Theoretical expressions are determined for the S/N ratio gain of the GI and CMM memories in the auto-associative and hetero-associative modes of operation. It is found that the GI method performance degrades significantly in the presence of training noise while the CMM method is relatively unaffected by it. The theoretical expressions are plotted and compared with the results obtained from Monte Carlo simulations and the two are found to be in excellent agreement.
Modeling, Analysis, and Visualization of Left Ventricle Shape and Motion by Hierarchical Decomposition
Authors: C. W. Chen, T. S. Huang, M. Arrott
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

This paper presents an approach to the modeling, analysis, and visualization of left ventricle motion and deformation. The authors' modeling of left ventricle shape and motion as a hierarchical representation enables them to develop a promising noninvasive technique for monitoring heart dynamics where both image analysis and image synthesis are involved. The proposed hierarchical motion model of left ventricle is constructed by combining several existing simple models and is able to capture major motion and deformation components of the left ventricle. The hierarchical decomposition characterizes the left ventricle motion and deformation in a coarse-to-fine fashion and leads to computationally efficient estimation algorithms. The authors estimate the global rigid motion of the left ventricle by establishing a time-varying object-centered coordinate system. The global deformations of the left ventricle are obtained by fitting the given data to superquadric modeling primitives. The local deformations are estimated by a tensor-description approach that is based on the locally deformable surface obtained by constructing spherical harmonic local surface from the residues of global shape estimation. The authors also describe in this paper methods of image synthesis and dynamic animation for visualizing the estimated results of the time-varying left ventricle shape, motion, and deformations. These animation results are consistent with the apparent motion pattern of the left ventricle and therefore show the success of the authors' hierarchical decomposition based approach.
Managing Multiple Requirements Perspectives with Metamodels
Authors: Hans W. Nissen, Manfred A. Jeusfeld, Matthias Jarke, Georg V. Zemanek, Harald Huber
Venue: IEEE Software (1996)

Stakeholder conflicts can be productive in requirements engineering. A requirements-engineering project should ensure that crucial requirements are captured from at least two perspectives, preferably in a notation of the customer's choosing. Capturing, monitoring, and resolving multiple perspectives is difficult and time-consuming when done by hand. Our experience with ConceptBase, a meta-data-management system, shows that a simple but customizable metamodeling approach, combined with an advanced query facility, produces higher quality requirements documents in less time. Our experience shows that conceptual metamodeling technology can be a valuable complement to informal teamwork methods of business analysis and requirements engineering. In particular, the use of representations and cross-perspective analysis can help identify a wide variety of conflicts and, perhaps more important, monitor them.
An Example of Modeling and Evaluation of a Concurrent Program Using Colored Stochastic Petri Nets: Lamport's Fast Mutual Exclusion Algorithm
Authors: G. Balbo, G. Chiola, S. C. Bruell, P. Chen
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

A colored generalized stochastic Petri net (CGSPN) model was used to study the correctness and performance of the Lamport concurrent algorithm to solve the mutual exclusion problem on machines lacking an atomic test and set instruction. In particular, a parametric formal proof of liveness is developed based on the structure and initial state of the model. The performance evaluation is based on a Markovian analysis that exploits the symmetries of the model to reduce the cost of the numerical solution. Both kinds of analysis are supported by efficient algorithms. The potential of the GSPN modeling technique is illustrated on an academic but nontrivial example of an application from distributed systems.
Model-Based System Development: An Approach to Building X-by-Wire Applications
Authors: Roman Nossal, Roland Lang
Venue: IEEE Micro (2002)

The "A" development process uses a set of models to support the development life cycle of X-by-wire applications. Each model has a specific purpose and builds on its predecessors.