ppxscal/embedding_network huggingface dataset:
A Stochastic Neural Model for Fast Identification of Spatiotemporal Sequences
Authors: Aluizio F. R. Araújo, André S. Henriques
Venue: Neural Processing Letters (2002)

In this Letter, a new approach to build a neural model for the fast identification of spatiotemporal sequences is proposed. Such a model, the Stochastic Neural Sequence Identifier (SNSI), is simple and rapidly learns and identifies a given sequence. The SNSI receives as input several patterns belonging to a particular spatiotemporal sequence and produces as output a label for the sequence identified and a probability of this classification being correct. The SNSI is able to identify a sequence from patterns learned during training or novel ones, i.e., combinations of the sequence items distinct from those belonging to the trained set. The SNSI was tested on a 2D set of both closed and open trajectories with varying levels of complexity. The results suggest that the SNSI is able to recognize all the patterns presented in the training and most of the novel patterns used for testing.
Interactive visual method for motion and model reuse
Authors: Akanksha Huang, Z. Huang, B. Prabhakaran, C. R. Ruiz,  Jr.
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

We consider a repository of animation models and motions that can be reused to generate new animation sequences. For instance, a user can retrieve an animation of a dog kicking its leg (in air) and manipulate the result to generate a new animation where the dog is kicking a ball. In this particular example, inverse kinematics technique can be used to retarget the kicking motion of a dog to a ball. This approach of reusing models and motions to generate new animation sequences can be facilitated by operations such as querying of animation databases for required models and motions, and manipulation of the query results to meet new constraints. However, manipulation operations such as motion retargeting are quite complex in nature. Hence, there is a need for visualizing the queries on animation databases as well as the manipulation operations on the query results.In this paper, we propose a visually interactive method for reusing motions and models, by adjusting the query results from animation databases for new situations while at the same time, keeping the desired properties of the original models and motions. Here, a user first queries for animation objects, i.e., geometric models and motions. Then, the user interactively makes new animations by visually manipulating the query results. Depending on the orders in which the GUIs (Graphical User Interfaces) are invoked and the parameters are changed, the system automatically generates a sequence of operations, a list of SQL-like syntax commands, and applies it to the query results of motions and models. With the help of visualization tools, the user can view the changes before accepting them.
On IEEE P1500's Standard for Embedded Core Test
Authors: Erik Jan Marinissen, Rohit Kapur, Maurice Lousberg, Teresa McLaurin, Mike Ricchetti, Yervant Zorian
Venue: Journal of Electronic Testing: Theory and Applications (2002)

The increased usage of embedded pre-designed reusable cores necessitates a core-based test strategy, in which cores are tested as separate entities. IEEE P1500 Standard for Embedded Core Test (SECT) is a standard-under-development that aims at improving ease of reuse and facilitating interoperability with respect to the test of core-based system chips, especially if they contain cores from different sources. This paper briefly describes IEEE P1500, and illustrates through a simplified example its scalable wrapper architecture, its test information transfer model described in a standardized Core Test Language, and its two compliance levels. The standard is still under development, and this paper only reflects the view of six active participants of the standardization committee on its current status.
Hashing Methods for Temporal Data
Authors: George Kollios, Vassilis J. Tsotras
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

External dynamic hashing has been used in traditional database systems as a fast method for answering membership queries. Given a dynamic set S of objects, a membership query asks whether an object with identity k is in (the most current state of) S. This paper addresses the more general problem of Temporal Hashing. In this setting, changes to the dynamic set are timestamped and the membership query has a temporal predicate, as in: "Find whether object with identity k was in set S at time t. " We present an efficient solution for this problem that takes an ephemeral hashing scheme and makes it partially persistent. Our solution, also termed partially persistent hashing, uses linear space on the total number of changes in the evolution of set S and has a small (O(\log_B(n/B))) query overhead. An experimental comparison of partially persistent hashing with various straightforward approaches (like external linear hashing, the Multiversion B-Tree, and the R*-tree) shows that it provides the faster membership query response time. Partially persistent hashing should be seen as an extension of traditional external dynamic hashing in a temporal environment. It is independent of the ephemeral dynamic hashing scheme used; while the paper concentrates on linear hashing, the methodology applies to other dynamic hashing schemes as well.
A Generalized Relational Model for Indefinite and Maybe Information
Authors: K. -C. Liu, R. Sunderraman
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

A generalized relational model which is capable of representing and manipulating disjunctive and maybe kinds of information is presented. A data structure, called M-table, is defined, and the information contained in the M-table is precisely stated. Redundant information in M-tables is characterized, and an operator to remove this redundant information is presented. The relational algebra is suitably generalized to deal with M-tables. Additional operators, R-projection and merge, are presented. Queries can be expressed as a combination of the various generalized relational algebraic operators. The M-table accurately models the two bounds on the external interpretation of a query. The sure component of an M-table corresponds to one of the bounds which is the set of objects which belong to the external interpretation of the query. The maybe component of an M-table corresponds to the other bound which is the set of objects for which the possibility of belonging to the external interpretation of the query cannot be ruled out.
In situ SEM observation of electromigration phenomena in fully embedded copper interconnect structures
Authors: M. A. Meyer, M. Herrmann, E. Langer, E. Zschech
Venue: Microelectronic Engineering (2002)

An experimental set-up is presented, that allows in situ scanning electron microscope (SEM) investigations of the progress of electromigration damage in fully embedded copper interconnect structures. A LEO Gemini 1550 SEM has been equipped with a heating stage and electrical connections for the experiment. The studied interconnect structures are usually used for reliability testing in electromigration ovens. These test structures are located within the scribelines of wafers. Therefore, they allow the characterization of the electromigration behaviour of products on the wafer. To enable the SEM observation, focused ion beam (FIB) was used to prepare cross-sections of the samples maintaining their electrical functionality. Thereby, a thin layer of passivation was left over in front of the interconnects to keep them fully embedded. The SEM images which were taken at an angle of 60° allow the observation of both the entire via/contact and the connecting lines. Multiple images were recorded during the degradation experiments. The resulting video sequences provide a good visualization of the formation, growth and motion of voids at the stressed interconnects. The dominant diffusion path has been identified.
10 Potholes in the Road to Information Quality
Authors: Diane M. Strong, Yang W. Lee, Richard Y. Wang
Venue: Computer (1997)

When spring finally comes to New England, it brings with it gaping holes in roads. The larger of these potholes are patched, but the road can never be made smooth again. Smaller potholes, although a daily nuisance, are often not repaired at all. Something similar is happening in the area of information systems: People who need information to accomplish their tasks are finally being provided with easy online access to relevant information. But the information highway has potholes. Like New England drivers in the spring, information consumers must dodge quality problems, large and small, in their quest for high-quality information. Like road crews, the people who produce, store, and maintain information achieve minimal quality through a never-ending process of patching rather than repairing potholes. Poor information quality can create chaos. Unless its root cause is diagnosed, efforts to address it are akin to patching potholes. This article describes 10 key causes, the warning signs, and typical patches. With this knowledge, organizations can identify and address these problems before they have financial and legal consequences. Until recently, there has been little awareness of the pervasiveness of IQ problems and their severe financial and operational costs to organizations. With the increasing dependence of organizations on the quality of information for managerial and operational decision-making, patching IQ potholes is no longer a viable approach. #1 Multiple sources of the same information produce different values. #2 Information is produced using subjective judgments, leading to bias. #3. Systemic errors in information production lead to lost information. #4. Large volumes of stored information make it difficult to access information in a reasonable time. #5. Distributed heterogeneous systems lead to inconsistent definitions, formats, and values. #6. Nonnumeric information is difficult to index. #7. Automated content analysis across information collections is not yet available. #8. As information consumers' tasks and the organizational environment change, the information that is relevant and useful changes. #9. Easy access to information may conflict with requirements for security, privacy, and confidentiality. #10. Lack of sufficient computing resources limits access.
Using the WinWin Spiral Model: A Case Study
Authors: Barry Boehm, Alexander Egyed, Julie Kwan, Dan Port, Archita Shah, Ray Madachy
Venue: Computer (1998)

At the 1996 and 1997 International Conferences on Software Engineering, three of the six keynote addresses identified negotiation techniques as the most critical success factor in improving the outcome of software projects. The USC Center for Software Engineering has been developing a negotiation-based approach to software system requirements engineering, architecture, development, and management. This approach has three primary elements: Theory W, a management theory and approach, which says that making winners of the system's key stakeholders is a necessary and sufficient condition for project success. The WinWin spiral model, which extends the spiral software development model by adding Theory W activities to the front of each cycle. WinWin, a groupware tool that makes it easier for distributed stakeholders to negotiate mutually satisfactory (win-win) system specifications. This article describes an experimental validation of this approach, focusing on the application of the WinWin spiral model. The case study involved extending USC's Integrated Library System to access multimedia archives, including films, maps, and videos. The study showed that the WinWin spiral model is a good match for multimedia applications and is likely to be useful for other applications with similar characteristics--rapidly moving technology, many candidate approaches, little user or developer experience with similar systems, and the need for rapid completion.
Adaptive H∞ robust beamforming for imperfect antenna array
Authors: Ann-Chen Chang, Ching-Tai Chiang
Venue: Signal Processing (2002)

The inherent robustness of the H∞ algorithm in dealing with modeling disturbances is used to improve the performance of imperfect antenna array with the generalized sidelobe canceller structure. The modeling disturbances include sensor gain perturbation, initial condition error, and colored noise contamination. The influence of modeling disturbances, which is not in volved in the recursive least squares (RLS) algorithm, is lumped into the estimation error minimization of the adaptive H∞ algorithm. Thus, an H∞-based beamformer converges faster and is more robust to imperfect antenna array than an RLS-based beamformer. Computer simulation results have been provided to show the robustness feature of the proposed technique when applied to an imperfect antenna array.
Reuse in Command-and-Control Systems
Authors: James O'Connor, Catharine Mansour, Jerri Turner-Harris, Grady H. Campbell,  Jr.
Venue: IEEE Software (1994)

Rockwell International's Command-and-Control Systems Division, assisted by the Software Productivity Consortium, initiated a pilot project to evaluate the applicability of SPC's Synthesis methodology. Synthesis is an approach based on domain-specific reuse, by which an organization can standardize its perceptions of customers' needs and effective solutions. We present CCSD's experience to date using Synthesis. Our application of Synthesis has resulted in a partially automated environment that supports the specification of a communications-control and -management system and the generation of corresponding software requirements, design, and code. A domain-specific notation, created by the project, lets an engineer describe one of these systems in terms of high-level requirements and engineering decisions. The engineer can then generate a product by mechanically selecting, adapting, and composing the relevant reusable components based on those decisions. We have used this environment to create parts of two products, and we are now using it on a CCSD project.
Geometric Primitive Extraction Using a Genetic Algorithm
Authors: G. Roth, M. D. Levine
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Extracting geometric primitives from geometric sensor data is an important problem in model-based vision. A minimal subset is the smallest number of points necessary to define a unique instance of a geometric primitive. A genetic algorithm based on a minimal subset representation is used to perform primitive extraction. It is shown that the genetic approach is an improvement over random search and is capable of extracting more complex primitives than the Hough transform.
A Strahler bijection between Dyck paths and planar trees
Authors: Xavier Gérard Viennot
Venue: Discrete Mathematics (2002)

The Strahler number of binary trees has been introduced by hydrogeologists and rediscovered in computer science in relation with some optimization problems. Explicit expressions have been given for the Strahler distribution, i.e. binary trees enumerated by number of vertices and Strahler number. Two other Strahler distributions have been discovered with the logarithmic height of Dyck paths and the pruning number of forests of planar trees in relation with molecular biology. Each of these three classes are enumerated by the Catalan numbers, but only two bijections preserving the Strahler parameters have been explicited: by Françon between binary trees and Dyck paths, by Zeilberger between binary trees and forests of planar trees. We present here the missing bijection between forests of planar trees and Dyck paths sending the pruning number onto the logarithmic height. A new functional equation for the Strahler generating function is deduced. Some orthogonal polynomials appear, they are one parameter Tchebycheff polynomials.
A Neural Network Approach to CSG-Based 3-D Object Recognition
Authors: T. W. Chen, W. C. Lin
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Describes the recognition subsystem of a computer vision system based on constructive solid geometry (CSG) representation scheme. Instead of using the conventional CSG trees to represent objects, the proposed system uses an equivalent representation scheme-precedence graphs-for object representation. Each node in the graph represents a primitive volume and each are between two nodes represents the relation between them. Object recognition is achieved by matching the scene precedence graph to the model precedence graph. A constraint satisfaction network is proposed to implement the matching process. The energy function associated with the network is used to enforce the matching constraints including match validity, primitive similarity, precedence graph preservation, and geometric structure preservation. The energy level is at its minimum only when the optimal match is reached. Experimental results on several range images are presented to demonstrate the proposed approach.
A Knowledge-Based Approach for Script Recognition without Training
Authors: P. v. s. Rao
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

The approach is based on an empirical parametric model for the writing hand system. The parameters are so chosen and quantized as to retain only broad shape information ignoring writer-dependent and other variability. Concatenation of character prototypes generates archetypal reference words for recognition; training is unnecessary. Recognition scores exceed 90%.
Cascaded Design of the State Observer for Nonlinear Systems in the Presence of External Perturbations
Authors: S. A. Krasnova
Venue: Automation and Remote Control (2003)

Applicability of the block approach to the problem of observation of nonlinear systems in the presence of uncontrollable external perturbations was demonstrated. A block-observable form of the general nonlinear systems was obtained with regard for perturbations. It underlies two types of cascaded procedures for designing the state observers in the class of systems with separable motions: (i) with discontinuous controls and (ii) with high-gain feedbacks. The first procedure relies on the method of equivalent control to restore in a finite time the nonmeasurable components of the state vector and also perturbations. The second procedure estimates the nonmeasurable components of the state vector in the prelimit situation with a given accuracy and retention of the decomposition of the design procedure.
Software Engineering Programs: Dispelling the Myths and Misconceptions
Authors: Hossein Saiedian, Donald J. Bagert, Nancy R. Mead
Venue: IEEE Software (2002)

New software engineering programs are popular but controversial. Offering such degrees has been the subject of hype by some who believe a new SE program will address industrial software development problems (failing to realize exactly what a new program should offer and when it is most appropriate to be offered). New programs have also received deep criticism and subjective evaluation by many traditional computer scientists who see them merely as an opportunity to provide industrial training in programming (but who fail to understand the complexities of software). In many ways, the current situation involving SE programs mirrors that of their computer science counterparts in the 1960s and 1970s. While three or four decades ago electrical engineering and mathematics faculty resisted the growth of computer science degree programs, current computer science faculty are often treating SE in the same manner. This article highlights and addresses some of the most commonly held myths (both favorable and unfavorable) about the real and perceived purpose of introducing a new SE degree program. Those who plan to introduce such a degree program should understand the facts instead of basing their decision on these myths.
Efficient Modular Design of TSC Checkers for M-out-of-2M-Codes
Authors: A. M. Paschalis, D. Nikolos, C. Halatsis
Venue: IEEE Transactions on Computers (1988)

A design method of totally self-checking (TSC) m-out-of-2m code checkers is presented. The design is composed basically of two full-adder/half-adder trees, each summing up the ones received on m input lines, and a k-variable two-pair two-rail code tree that compares the outputs of the two-adder tree. The only modules used are full-adders, half-adders, and two-variable TSC two-rail code checkers. This method is well suited for VLSI MOS implementation and, compared to previous methods, it results in significant circuit cost reduction and smaller test set, without sacrificing performance. Also, the proposed design has the advantages of a modular design.
An optimizing prolog front-end to a relational query system
Authors: Matthias Jarke, Jim Clifford, Yannis Vassiliou
Venue: Proceedings of the 1984 ACM SIGMOD international conference on Management of data (1984)

An optimizing translation mechanism for the dynamic interaction between a logic-based expert system written in PROLOG and a relational database accessible through SQL is presented. The mechanism makes use of an intermediate language that decomposes the optimization problem and makes the proposed approach target-language independent. It can either facilitate expert system - database interaction, e.g., when integrating expert systems into business systems, or augment existing databases with (external) deductive capabilities.
Highly convergent simulations of transport dynamics in organic light-emitting diodes
Authors: J. C. deMello
Venue: Journal of Computational Physics (2002)

We present a method-of-lines solution procedure for modelling charge transport and recombination in organic light-emitting diodes operating in the trap-free space-charge-limited regime. The numerical procedure employs a spatial remeshing algorithm based on equidistribution principles as reported by Sanz-Serna and Christie (1986, J. Comput. Phys. 67, 348) and incorporates additional refinements proposed by Revilla (1986, Int. J. Numer Methods Eng. 23, 2263) and Saucez et al. (1996, J. Comput. Phys. 128, 274). The method, which does not give rise to ill-conditioned series of differential equations, offers rapid convergence to the steady state and is especially well suited to systems of equations displaying steep moving solution fronts. The technique is readily extended to more complex systems.
The Gmicro/100 32-Bit Microprocessor
Authors: Toyohiko Yoshida, Toru Shimisu, Shigeo Mizugaki, Junichi Hinata
Venue: IEEE Micro (1991)

A description is given of the Gmicro/100, a 32-b VLSI microprocessor based on the TRON specification. The Gmicro/100 five-stage pipeline, prejump mechanism, and bitmap manipulation are examined. Performance results are reported. They show that the prejump mechanism, implemented as a hardware solution for the jump problem, executes benchmark programs 16.8% faster on the average. Optimized microinstructions permit bitmap-manipulation instructions to perform two to five times faster than the software loops. The application-specific standard product approach used to implement Gmicro/100 is discussed.
Resistance dependence of transport properties in metal-multiwall carbon nanotube-metal structures
Authors: Akinobu Kanda, Kazuhito Tsukagoshi, Seiji Uryu, Youiti Ootuka, Yoshinobu Aoyagi
Venue: Microelectronic Engineering (2002)

We have studied current-voltage (I-V) characteristics of metal-on-tube metal-multiwall carbon nanotube-metal structures as a function of gate voltage. Device resistances ranged from about 10 kΩ to several MΩ, depending on the electrode metal and its deposition condition. When the resistance was much higher than the quantum resistance (RQ = h/4e2 ≈ 6.5 kΩ), samples showed clear Coulomb blockade. We find that the tunnel barrier is located in the interface between the MWNT and the metal electrode. As the resistance decreased, the Coulomb oscillations became irregular with respect to the gate voltage, but the high resistance region around V=0 and its dependence on gate voltage survived at resistance smaller than 10 kΩ