ppxscal/embedding_network huggingface dataset:
Constrained torsion of prismatic bars
Authors: Steven W. Reagan, Walter D. Pilkey
Venue: Finite Elements in Analysis and Design (2002)

A theory is developed that allows the determination of three-dimensional displacements and stresses within finite length prismatic bars of arbitrary cross-section experiencing restrained torsion. This restraint arises from the twisting of a bar where one of its cross-sections is subject to displacement and slope constraints. The deformations within this bar are represented by an exponentially decaying residual solution superimposed on the classical Saint-Venant solution. Galerkin's method is used to solve the boundary value problem resulting from a simultaneous system of three quadratic eigenproblems subject to the stress free boundary condition due to the traction-free lateral surface of the bar. A three-dimensional finite element model is used for validation.
A proof of the q, t-Catalan positivity conjecture
Authors: A. M. Garsia, J. Haglund
Venue: Discrete Mathematics (2002)

We present here a proof that a certain rational function Cn(q, t) which has come to be known as the "q,t-Catalan" is in fact a polynomial with positive integer coefficients. This has been an open problem since 1994. The precise form of the conjecture is given in Garsia and Haiman (J. Algebraic Combin. 5(3) (1996) 191), where it is further conjectured that Cn(q, t) is the Hilbert series of the diagonal harmonic alternants in the variables (x1,x2,...,xn;y1,y2,...,yn). Since Cn(q,t) evaluates to the Catalan number at t = q = 1, it has also been an open problem to find a pair of statistics a(π), b(π) on Dyck paths π in the n × n square yielding Cn(q, t) = Σπta(π)qb(π). Our proof is based on a recursion for Cn(q, t) suggested by a pair of statistics a(π), b(π) recently proposed by Haglund. Thus, one of the byproducts of our developments is a proof of the validity of Haglund's conjecture. It should also be noted that our arguments rely and expand on the plethystic machinery developed in Bergeron et al. (Methods and Applications of Analysis, Vol. VII(3), 1999, p. 363).
Specifying and Enforcing Association Semantics via ORN in the Presence of Association Cycles
Authors: Bryon K. Ehlmann, Gregory A. Riccardi, Naphtali D. Rishe, Jinyu Shi
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Object Relationship Notation (ORN) is a declarative scheme that allows a variety of common relationship types to be conveniently specified to a Database Management System (DBMS), thereby allowing their semantics to be automatically enforced by the DBMS. ORN can be integrated into any data model that represents binary associations or DBMS that implements them. In this paper, we give a brief description of ORN syntax and semantics and provide algorithms that can be used to implement ORN. These algorithms must deal with the presence of association cycles in the database. We explore in detail the problems caused by such cycles and how ORN and its implementation deal with them, and we show that ORN semantics are noncircular and unambiguous.
On Scheduling Atomic and Composite Continuous Media Objects
Authors: C. Shahabi, S. Ghandeharizadeh, S. Chaudhuri
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

In multiuser multimedia information systems (e.g., movie-on-demand, digital-editing), scheduling the retrievals of continuous media objects becomes a challenging task. This is because of both intra and inter Iobject time dependencies. Intraobject time dependency refers to the real-time display requirement of a continuous media object. Interobject time dependency is the temporal relationships defined among multiple continuous media objects. In order to compose tailored multimedia presentations, a user might define complex time dependencies among multiple continuous media objects with various lengths and display bandwidths. Scheduling the retrieval tasks corresponding to the components of such a presentation in order to respect both inter and intra task time dependencies is the focus of this study. To tackle this task scheduling problem (CRS), we start with a simpler scheduling problem (ARS) where there is no inter task time dependency (e.g., movie-on-demand). Next, we investigate an augmented version of ARS (termed $ARS^+$) where requests reserve displays in advance (e.g., reservation-based movie-on-demand). Finally, we extend our techniques proposed for $ARS$ and $ARS^+$ to address the $CRS$ problem. We also provide formal definition of these scheduling problems and proof of their NP-hardness.
Y-Invalidate: A New Protocol for Implementing Weak Consistency in DSM Systems
Authors: Yosi Ben-Asher, Dimitry Podvolny
Venue: International Journal of Parallel Programming (2001)

In this work we propose and implement a new variant of the well-known write invalidate protocol called &ldquo;Y-invalidate.&rdquo; Whereas the former protocol required that every copy of a page be invalidated every time that page is updated, our variant invalidates a copy of a page at process A only at the next synchronization point which is relevant to A and or if the copy was modified by the owner's process after the page was copied to A. We thus avoid invalidating copies of pages that were modified but never read after modification, and avoid, of course, the associated overhead. Y-Invalidate is basically a weak-consistency protocol. Its main advantage is that it implements weak consistency without the need to &ldquo;merge&rdquo; copies of a page that were updated in different machines. To the best of our knowledge, this is the first variant of weak consistency protocols which does not &ldquo;merge&rdquo; multiple copies of pages. Unlike other variants of weak consistency, Y-invalidate supports implicit synchronization points in the program by invalidating copies of shared memory pages that are referenced by while-loops. In this way, Y-invalidate approximates strict consistency. The Y-invalidate protocol was implemented in the ParC system, which is a powerful parallel extension of the C language. The ParC compiler was modified to detect some of the implicit synchronization points in the source code. Experimental results show significant improvement compared to both the traditional write-invalidate protocol and weak consistency.
Test Development for a Third-Version ColdFire Microprocessor
Authors: Alfred L. Crouch, Michael Mateja, Teresa L. McLaurin, John C. Potter, Dat Tran
Venue: IEEE Design Test (2000)

The ColdFire microprocessor is Motorola' s variable instruction length RISC family of microprocessors and embeddable cores. The MCF5307 is a third generation member of the family (known as version 3). The version 3 ColdFire core with memories is also sold as a stand- alone core and has been incorporated into many devices in the industry. The MCF5307 consists of the version 3 microprocessor core, a Multiply Accumulate (MAC) unit, a DRAM controller, a DMA controller, timers, parallel and serial interfaces, some system integration logic, an 8k unified cache, a general purpose 4K SRAM, an IEEE 1149.1 (JTAG) boundary scan architecture, and an on- chip PLL. The maximum bus interface frequency rating is 45MHz, and the maximum embedded microprocessor core frequency rating is 90MHz
Analysis of the Clustering Properties of the Hilbert Space-Filling Curve
Authors: Bongki Moon, H. v. Jagadish, Christos Faloutsos, Joel H. Saltz
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

Several schemes for the linear mapping of a multidimensional space have been proposed for various applications, such as access methods for spatio-temporal databases and image compression. In these applications, one of the most desired properties from such linear mappings is clustering, which means the locality between objects in the multidimensional space being preserved in the linear space. It is widely believed that the Hilbert space-filling curve achieves the best clustering [1], [14]. In this paper, we analyze the clustering property of the Hilbert space-filling curve by deriving closed-form formulas for the number of clusters in a given query region of an arbitrary shape (e.g., polygons and polyhedra). Both the asymptotic solution for the general case and the exact solution for a special case generalize previous work [14]. They agree with the empirical results that the number of clusters depends on the hypersurface area of the query region and not on its hypervolume. We also show that the Hilbert curve achieves better clustering than the z curve. From a practical point of view, the formulas given in this paper provide a simple measure that can be used to predict the required disk access behaviors and, hence, the total access time.
Planning and Certifying Software System Reliability
Authors: J. H. Poore, Harlan D. Mills, David Mutchler
Venue: IEEE Software (1993)

An approach to software reliability and certification is presented that is based on the use of three mathematical models: the sampling, component, and certification models. The approach helps reduce reliability analysis to a problem that can be evaluated and manipulated through a series of spreadsheets. This approach was motivated by interest in applying the cleanroom software-engineering method in environments that require extensive code reuse.
Sharp integral inequalities of the Hermite---Hadamard type
Authors: Allal Guessab, Gerhard Schmeisser
Venue: Journal of Approximation Theory (2002)

We consider a family of two-point quadrature formulae and establish sharp estimates for the remainders under various regularity conditions. Improved forms of certain integral inequalities due to Hermite and Hadamard, Iyengar, Milovanović and Pecarić, and others are obtained as special cases. Our results can also be interpreted as analogues to a theorem of Ostrowski on the deviation of a function from its averages. Furthermore, we establish a generalization of a result of Fink concerning Lp estimates for the remainder of the trapezoidal rule and present the best constants in the error bounds.
Comments on 'A Critical Look'
Authors: Watts S. Humphrey, Bill Curtis
Venue: IEEE Software (1991)

It is maintained that the article by T. Bollinger and C. McGowan, entitled 'A critical look at software capability evaluation', see ibid., p.25-41 (1991), contains a serious flaw. The article argues that the process-maturity grading system used by the Software Engineering Institute (SEI) is unfair and provides too narrow a basis for evaluating software organizations. The present authors point out that SEI instructs Software Capability Evaluation (SCE) auditors not to base their compact-award recommendations on maturity grades for software vendors. Other common misconceptions about the SEI assessment method communicated by the article are addressed. They fall into six categories: SCE's purpose, especially in relation to process assessment; how the SCE method works in practice; the statistical methods used to determine levels; the ongoing process of refining the method; the maturity framework; and the coverage of technology issues.
System-Guided View Integration for Object-Oriented Databases
Authors: W. Gotthard, P. C. Lockemann, A. Neufeld
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

Some of the shortcomings of current view integration methodologies, namely, a low emphasis on full-scale automated systems, a lack of algorithmic specifications of the integration activities, inattention to the design of databases with new properties such as databases for computer-aided design, and insufficient experience with data models with a rich set of type and abstraction mechanisms, are attacked simultaneously. The focus is on design databases for software engineering applications. The approach relies on a semantic model based on structural object-orientation with various features tailored to these applications. The expressiveness of the model is used to take the first steps toward algorithmic solutions, and it is demonstrated how corresponding tools could be embedded methodically within the view integration process and technically within a database design environment. The central ideal is to compute so-called assumption predicates that express suggested similarities between structures in two schemas to be integrated, and then have a human integrator confirm or reject them. The basic method is exemplified for the CERM data model that includes molecular aggregation, generalization, and versioning.
An Optimal Algorithm for Permutation Admissibility to Multistage Interconnection Networks
Authors: Mao Xu, Xiaojun Shen, Xiangzu Wang
Venue: IEEE Transactions on Computers (1995)

This paper introduces a simple O(NlogN) sequential algorithm that determines the admissibility of an arbitrary permutation to an N×N Multistage Cube-Type Network (MCTN) implemented by 2 × 2 switching elements (SEs) in contrast to previous O(Nlog2N) algorithms. It is proven that the new algorithm is optimal in the sense that any algorithm, based on bit-operations, has to examine at least (N/4)logN different bits among the total NlogN bits in the binary representations of the destinations numbered from 0 through N¿1.
Redundancy Detection in Semistructured Case Bases
Authors: Kirsti Racine, Qiang Yang
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

With the dramatic proliferation of case-based reasoning systems in commercial applications, many case bases are now becoming legacy systems. They represent a significant portion of an organization's assets, but they are large and difficult to maintain. One of the contributing factors is that these case bases are often large and yet unstructured or semistructured; they are represented in natural language text. Adding to the complexity is the fact that the case bases are often authored and updated by different people from a variety of knowledge sources, making it highly likely for a case base to contain redundant and inconsistent knowledge. In this paper, we present methods and a system for maintaining large and semistructured case bases. We focus on a difficult problem in case base maintenance: redundancy detection. This problem is particularly pervasive when one deals with a semistructured case base. We will discuss an information-retrieval-based algorithm and an implemented system for solving this problem. As the ability to contain the knowledge acquisition problem is of paramount importance, our method allows one to express relevant domain expertise for detecting redundancy naturally and effortlessly. Empirical evaluations of the system demonstrate the effectiveness of the methods in several large domains.
Generating Decision Trees from Otoneurological Data with a Variable Grouping Method
Authors: Kati Viikki, Erna Kentala, Martti Juhola, Ilmari Pyykkö, Pekka Honkavaara
Venue: Journal of Medical Systems (2002)

When medical data sets are modelled by machine learning methods, wealth of variables may be available. This paper deals with variable selection for decision tree induction in the context of two otoneurological data sets: vertigo data, and postoperative nausea and vomiting data. First, a variable grouping method based on measures of association and graph theoretic techniques was used to gain insight into data. Then, representations of learning data were defined using the information from discovered variable groups, and decision trees were generated. The use of variable grouping method was beneficial by revealing interesting associations between variables and enabling generation of accurate and reasonable decision trees that modelled the application areas from different viewpoints.
Improving Public Switched Network Security in an Open Environment
Authors: Richard Kuhn, Patricia Edfors, Victoria Howard, Chuck Caputo, Ted S. Phillips
Venue: Computer (1993)

Government studies have identified potential vulnerabilities in the public switched network that could be exploited by hostile users. As the telecommunications industry moves toward greater openness and more services are added, the potential for abuse is likely to increase. The US government's efforts to maintain the integrity of telecommunications services in this new open environment are summarized. The authors outline major government concerns and describe how federal agencies are responding. Key elements of the response include cooperation between government and industry, additional research and development, and an emphasis on building secure systems using open system software.
The Study of Chaotic Neural Network and its Applications in Associative Memory
Authors: Zhenya He, Yifeng Zhang, Luxi Yang
Venue: Neural Processing Letters (1999)

Based on an analysis of current principal chaotic neural network models and their applications in information processing, we propose a one-dimensional, two-way coupled map network and a modified definition of an auto-associative matrix. The two-way coupled map network overcomes the weakness of the globally coupled map network and has the same abilities in pattern classification. Numerical simulation experiments have shown that the associative success rate and recall speed of our modified definition of the auto-associative matrix are an improvement them over existing methods. Moreover, the associative recall process of the network is analyzed in detail and explanations of improvement are given, basd on our theoretical analysis.
Fast extraction of adaptive multiresolution meshes with guaranteed properties from volumetric data
Authors: Marcel Gavriliu, Joel Carranza, David E. Breen, Alan H. Barr
Venue: Proceedings of the conference on Visualization '01 (2001)

We present a new algorithm for extracting adaptive multiresolution triangle meshes from volume datasets. The algorithm guarantees that the topological genus of the generated mesh is the same as the genus of the surface embedded in the volume dataset at all levels of detail. In addition to this "hard constraint" on the genus of the mesh, the user can choose to specify some number of soft geometric constraints, such as triangle aspect ratio, minimum or maximum total number of vertices, minimum and/or maximum triangle edge lengths, maximum magnitude of various error metrics per triangle or vertex, including maximum curvature (area) error, maximum distance to the surface, and others. The mesh extraction process is fully automatic and does not require manual adjusting of parameters to produce the desired results as long as the user does not specify incompatible constraints. The algorithm robustly handles special topological cases, such as trimmed surfaces (intersections of the surface with the volume boundary), and manifolds with multiple disconnected components (several closed surfaces embedded in the same volume dataset). The meshes may self-intersect at coarse resolutions. However, the self-intersections are corrected automatically as the resolution of the meshes increase. We show several examples of meshes extracted from complex volume datasets.
A case study on automatic camera placement and motion for visualizing historical data
Authors: Stanislav L. Stoev, Wolfgang Straßer
Venue: Proceedings of the conference on Visualization '02 (2002)

In this paper, we address the problem of automatic camera positioning and automatic camera path generation in the context of historical data visualization. After short description of the given data, we elaborate on the constraints for the positioning of a virtual camera in such a way that not only the projected area is maximized, but also the depth of the displayed scene. This is especially important when displaying terrain models, which do not provide good 3D impression when only the projected area is maximized. Based on this concept, we present a method for computing an optimal camera position for each instant of time.Since the explored data are not static, but change depending on the explored scene time, we also discuss a method for animation generation. In order to avoid sudden changes of the camera position, when the previous method is applied for each frame (point in time), we introduce pseudo-events in time, which expand the bounding box defined by the currently active events of interest. In particular, this technique allows events happening in a future point in time to be taken into account such that when this time becomes current, all events of interest are already within the current viewing frustum of the camera.
On the identity of the sandpile group
Authors: Yvan Le Borgne, Dominique Rossin
Venue: Discrete Mathematics (2002)

The sandpile automaton was introduced by physicists in 1987. This cellular automaton presents the same critical exponents as some natural systems. Moreover, this is the simplest model known. Dhar et al. show that the recurrent configurations of this automaton form an finite abelian group. We study here the identity of this group if the automaton is defined on rectangular grids. We prove that the identity on such grids of size p × q with p > √2q can be decomposed into three parts. This proof is based on the study of the toppling of a single pile of chips on an infinite grid filled uniformly.
On TSC Checkers for m-out-of-n Codes
Authors: G. Sourtziotis, V. V. Dimakopoulos, A. Paschalis, D. Nikolos
Venue: IEEE Transactions on Computers (1995)

Paschalis et al. in [12] have given a structured method to design TSC m-out-of-2m code checkers suitable for VLSI implementation. In this correspondence we give sufficient conditions so that the method given in [12] can be used to design checkers for classes of m-out-of-n codes with n¿ 2m.
Skew-morphisms of regular Cayley maps
Authors: Robert Jajcay, Jozef Sirán
Venue: Discrete Mathematics (2002)

A Cayley map M is a 2-cell embedding of a Cayley graph in an orientable surface with the same orientation (the induced permutation of generators) at each vertex. The concept of a skew-morphism generalizes several concepts previously studied with respect to regular Cayley maps, and allows for a unified theory of regular Cayley maps and their automorphism groups. Using algebraic properties of skew-morphisms of groups we reprove or extend some previously known results and obtain several new ones.
Analog VLSI Synaptic Matrices as Building Blocks for Neural Networks
Authors: Olivier Rossetto, Christian Jutten, Jeanny Herault, Ingo Kreuzer
Venue: IEEE Micro (1989)

An associative memory circuit that may let designers expand neural networks around a matrix of analog synapses is described. The architecture of the chip and its basic cell are discussed, and some SPICE simulation results are presented and compared with measures provided by the first prototype. In particular, the linearity and dynamic response of the complete chip, which includes an array of 25 synapses and two address decoders used for programming the weights, are examined.
Application of VisAD in hydrological modeling and simulation
Authors: Ugo Taddei, Olaf David, Christian Michl
Venue: ACM SIGGRAPH Computer Graphics (2000)

For visualization of distributed hydrological phenomena, a multidimensional visualization tool such as VisAD embeds sophisticated visualization techniques in hydrological models. Heterogeneous hydrological properties can be visualized draped on top of a digital elevation model (DEM), in order to model parametrization or results. This article discusses how the VisAD library was applied to hydrology related information in the headwater catchments of the Schm&uuml;cker Graben and the Steinbach utilizing DEMViewer.
Conference Reports
Authors: Adam Osseiran
Venue: IEEE Design Test (2002)

8th International Mixed-Signal Testing Workshop