ppxscal/embedding_network huggingface dataset:
Using OODB Modeling to Partition a Vocabulary in Structurally and Semantically Uniform Concept Groups
Authors: Li-min Liu, Michael Halper, James Geller, Yehoshua Perl
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Controlled Vocabularies (CVs) are networks of concepts that unify disparate terminologies and facilitate the process of information sharing within an application domain. We describe a general methodology for representing an existing CV as an object-oriented database (OODB), called an Object-Oriented Vocabulary Repository (OOVR). A formal description of the OOVR methodology, which is based on a structural abstraction technique, is given, along with an algorithmic description and a number of theorems pertaining to some of the methodology's formal characteristics. An OOVR offers a two-level view of a CV, with the schema-level view serving as an important abstraction that can aid in orientation to the CV's contents. While an OOVR can also assist in traversals of the CV, we have identified certain special CV configurations where such traversals can be problematic. To address this, we introduce¿based on the original methodology¿an enhanced OOVR methodology that utilizes both structural and semantic features to partition and model a CV's constituent concepts. With its basis in the notions of area and the recursively defined articulation concept, an enhanced OOVR representation provides users with an improved CV view comprising groups of concepts uniform both in their structure and semantics. An algorithmic description of the singly rooted OOVR methodology and theorems describing some of its formal properties are given. The results of applying it to a large existing CV are discussed.
Locally Adaptive Metric Nearest-Neighbor Classification
Authors: Carlotta Domeniconi, Jing Peng, Dimitrios Gunopulos
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

Nearest-neighbor classification assumes locally constant class conditional probabilities. This assumption becomes invalid in high dimensions with finite samples due to the curse of dimensionality. Severe bias can be introduced under these conditions when using the nearest-neighbor rule. We propose a locally adaptive nearest-neighbor classification method to try to minimize bias. We use a Chi-squared distance analysis to compute a flexible metric for producing neighborhoods that are highly adaptive to query locations. Neighborhoods are elongated along less relevant feature dimensions and constricted along most influential ones. As a result, the class conditional probabilities are smoother in the modified neighborhoods, whereby better classification performance can be achieved. The efficacy of our method is validated and compared against other techniques using both simulated and real-world data.
Complexity Measures for Rule-Based Programs
Authors: M. B. O'Neal, W. R. Edwards
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

Software complexity measures are quantitative estimates of the amount of effort required by a programmer to comprehend a piece of code. Many measures have been designed for standard procedural languages, but little work has been done to apply software complexity concepts to nontraditional programming paradigms. This paper presents a collection of software complexity measures that were specifically designed to quantify the conceptual complexity of rule-based programs. These measures are divided into two classes: bulk measures, which estimate complexity by examining aspects of program size, and rule measures, which gauge complexity based on the ways in which program rules interact with data and other rules. A pilot study was conducted to assess the effectiveness of these measures. Several measures were found to correlate well with the study participants' ratings of program difficulty and the time required by them to answer questions that required comprehension of program elements. The physical order of program rules was also shown to affect comprehension. The authors conclude that the development of software complexity measures for particular programming paradigms may lead to better tools for managing program development and predicting maintenance effort in nontraditional programming environments.
Developing a Usage-Based Software Certification Process
Authors: Jeffrey Voas
Venue: Computer (2000)

The methods for certifying software quality continue to multiply. Popular, process-based approaches-- such as ISO 9000 and SEI-CMM--make software publishers take oaths concerning which development standards and processes they will use. These approaches often require auditors to spot-check a publisher's documentation and oaths. Yet even if a certification auditor can verify the publisher's veracity, that verification alone does not guarantee high-quality software.Given these problems, the author proposes a certification methodology that does not employ publisher oaths and auditors. This certification method employs automated processes to greatly reduce liability while also eliminating the need to dispatch human auditors. The process harnesses the testing resources of end users, drawing upon proven tech-niques such as the methods that made Linux the most popular and reliable of all Unix flavors. Totally product-based, this proposed process assesses how well behaved the software is, not the maturity of the processes used to develop the code.
Fuzzy Inference on an Analog Fuzzy Chip
Authors: Tsutomu Miki, Takeshi Yamakawa
Venue: IEEE Micro (1995)

A high-speed analog fuzzy processor is described. The inference speed is more than 1 Mega fuzzy logical inferences per second, excluding defuzzification. We divided the system into two parts according to their functions, that is, the rule chip for fuzzy inference and the defuzzifier chip for defuzzification. This functional division facilitates flexible system configuration. The distinctive features of these chips are: high-speed fuzzy logic operation in parallel mode, compact fuzzy systems (chip saving) suitable for built-in application and adaptability of the fuzzy system based on a rule set during execution of fuzzy inference.
Dealing with the Expert Inconsistency in Probability Elicitation
Authors: Stefano Monti, Giuseppe Carenini
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

In this paper, we present and discuss our experience in the task of probability elicitation from experts for the purpose of belief network construction. In our study, we applied four techniques. Three of these techniques are available from the literature, whereas the fourth one is a technique that we developed by adapting a method for the assessment of preferences to the task of probability elicitation. The new technique is based on the Analytic Hierarchy Process (AHP) proposed by Saaty [12], [13], and it allows for the quantitative assessment of the expert inconsistency. The method is, in our opinion, very promising and lends itself to be applied more extensively to the task of probability elicitation.
Reconfiguration and Analysis of a Fault-Tolerant Circular Butterfly Parallel System
Authors: N. F. Tzeng
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

The butterfly parallel system has a regular and simple interconnection pattern, making itsuitable for VLSI or WSI implementation. The authors propose an effective fault-toleranttechnique for the circular butterfly parallel system to ensure its rigid full butterflystructure even in the presence of failures, addressing reconfiguration in detail. Theresulting butterfly system has L levels, involves (1/log/sub 2/ L)% spare processingelements (PEs), and approximately 50% additional links. The reconfiguration process ofthe design in response to any operational fault is easy and can be performed in adistributed manner. The reliability and layout of this proposed design are evaluatedanalytically. This design, due to its specific configuration, exhibits significant improvement in reliability while taking only moderately more layout area.
Dynamic scaling laws in two types of extended Hamiltonian systems at dissipation onset
Authors: Chi-Tuong Pham, Marc Brachet
Venue: Physica D (2002)

The transition to dissipation in one-dimensional extended Hamiltonian systems with saddle-node bifurcations of stationary solutions is characterized. Three different systems are studied: (i) nonlinear Schrödinger flow past a localized obstacle; (ii) sine-Gordon pendulum chains forced by a local torque; (iii) electrically charged nonlinear Schrödinger flows. In case (i), no frequency gap is present in the dispersion relation. In contrast, in cases (ii) and (iii) a minimum frequency for propagating waves exists. In the gapless case, the growth rates of the unstable modes and the frequency of supercritical soliton emission are found to scale as the square root of the bifurcation parameter. No subcriticality is observed. In contrast, when a frequency gap is present, subcritical soliton emission takes place. Logarithmic and one-fourth power scaling laws are found, respectively, at the bottom and top of the subcriticality window.
On order invariant aggregation functionals
Authors: Sergei Ovchinnikov, Alexander Dukhovny
Venue: Journal of Mathematical Psychology (2002)

This paper deals with aggregation functionals defined on arbitrary sets of ordinal numerical values in the framework of representational measurement theory. Our basic assumption is that such a functional represents a meaningful relation between variables; i.e., it is invariant under actions from an appropriate automorphism group. We prove that an aggregation functional is continuous, idempotent, and invariant if and only if it can be represented in the form of the Choquet integral with respect to a monotonic {0, 1}- valued set function. We also establish a polynomial representation for these functionals.
On the smoothness constraints for four-dimensional data assimilation
Authors: Ching-Long Lin, Tianfeng Chai, Juanzhen Sun
Venue: Journal of Computational Physics (2002)

An algorithm for determination of the weights of smoothness penalty constraints for the four-dimensional variational data assimilation technique is proposed and evaluated. To study the nature of smoothness penalty constraints, a simple nonlinear harmonic oscillator problem is first considered. Penalizing smoothness constraints is found to make the modified Hessian matrix of the cost function more positive definite, akin to the idea behind the modified line search Newton's methods. However, the use of the derivative smoothness constraints with a fixed coefficient does not warrant uniform imposition of these constraints at every iteration. A remedy is to control the ratio of the smoothness penalty function over the cost function, which can dramatically increase the positive definite area. On the other hand, the large smoothness coefficients obtained from this approach can deteriorate the convergence property of the minimization problem. Based on these observations, an algorithm for tuning the weights of smoothness constraints is proposed to overcome the aforementioned problems. The algorithm is first applied to a simple dynamic problem. It is then tested on the retrieval of microscale turbulent structures in a simulated convective boundary layer. This method is further evaluated on the retrieval of a strong meso-scale thunderstorm outflow from Doppler radar data. The results show that the algorithm yields efficient retrieval.
Practical Cellular and PCS Design
Authors: Clint Smith
Venue:  (1997)

:Finally  a practical guide that explains the numerous RF engineering concepts and technical terms and shows you the reader how they link together into a system design or specific application. Dozens of practical examples and case studies help turn theory into ready-to-implement knowledge. Critical issues such as link budgets,modulation,antennas,filters,receivers,transmitters,communication sites,system design,and technology- specific design guidelines are expertly detailed. By providing the framework for putting together a network design and detailing the real-world factors that need to be considered,this book gives engineers the tools they need to succeed in the rapidly emerging wireless work environment. A "nuts and bolts" guide to working with wireless! Here is all the pertinent and practical information that an RF engineer needs to know and understand in day-to-day wireless work. This book clearly explains RF engineering concepts and technical terms and shows how they link together into a system design or specific application. Dozens of practical examples and case studies help turn theory into ready-to-implement knowledge. This hands-on reference covers such critical issues as: radio engineering topicsradio systems,technology platforms,spread spectrum,conventional radio systems,paging,AMPS,TACS,CDMA,IS-136,GSM,and CDPD; link budget componentsvarious propagation models,terrain,diffraction,multipath,delay spread,coverage,ERP,link budget design guidelines; modulation formatsinformation bandwidth,AM,ASK,sideband,FM,pre- and de-emphasis,FSK,MSK,GMSK,PM,BPSK,QPSK,DQPSK,I&O diagram; antennastypes,base station antennas,performance criteria;filterstypes and classifications,filter performance criteria,control theory,filter selection; receiversAM,FM,PM,receiver system blocks,diversity reception,performance criteria; transmitterstransmitter building blocks,types and classes,modulation,isolation; communication sitesmacrocells,microcells,installation,path clearance; system designRF system design procedures,methodology,technology decision; technology-specific design guidelinesAMPS,CDMA,IS-136,GSM,sample system designs for both cellular and PCS. By providing the framework for putting together a network design and detailing the real-world factors that need to be considered,this book gives directors,managers and RF engineers the tools they will need to succeed in the rapidly emerging wireless work environment,all in one convenient source. ABOUT THE AUTHOR: Clint Smith,P. E. is the Vice President of Communications Consulting Service and the co-author of Cellular System Design and Optimization. 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
We'd like to ask you some questions, but we have to find you first: an internet-based study of lesbian clients in therapy with lesbian feminist therapists
Authors: Georgia K. Quartaro, Terry E. Spier
Venue: Journal of Technology in Human Services (2002)

This paper explores some issues related to an Internet-based study dealing with lesbian clients' perceptions of their lesbian feminist therapists. A 60-item questionnaire was posted on a Web site so respondents could complete it online, submitting answers anonymously through a forwarding service. Respondents were recruited through postings to 20 listservs that focus on gay/lesbian/bisexual issues or the psychology of women. Data collection proceeded rapidly, with 182 responses within seven weeks. Results indicated that the therapist's sexual and philosophical orientation was important to the client, but that the clients tended to make assumptions about the latter. Specific activities typical of feminist therapy were often missing or were not recollected by clients. The advantages of using the Internet to draw a wide range of respondents is set against the problems of generalizability, the difficulty in communicating directly with respondents, and the sample bias inevitable in using self-identified volunteers who have Internet access.
Finite Precision Error Analysis of Neural Network Hardware Implementations
Authors: J. L. Holi, J. -N. Hwang
Venue: IEEE Transactions on Computers (1993)

Through parallel processing, low precision fixed point hardware can be used to build a very high speed neural network computing engine where the low precision results in a drastic reduction in system cost. The reduced silicon area required to implement a single processing unit is taken advantage of by implementing multiple processing units on a single piece of silicon and operating them in parallel. The important question which arises is how much precision is required to implement neural network algorithms on this low precision hardware. A theoretical analysis of error due to finite precision computation was undertaken to determine the necessary precision for successful forward retrieving and back-propagation learning in a multilayer perceptron. This analysis can easily be further extended to provide a general finite precision analysis technique by which most neural network algorithms under any set of hardware constraints may be evaluated.
Activity coefficients of individual ions
Authors: V. Taghikhani, H. Modarress, J. H. Vera
Venue: Iranian Journal of Science and Technology (2002)

In this work, a new procedure for calculating the individual ionic activity coefficients from the emf data is presented. These data are collected by the Ion Selective Electrode (ISE) method. The potentials of the ISE's against a single junction reference electrode are recorded and used to generate the individual ionic values for electrolyte solutions. The liquid junction potential is calculated using an approximation made by Henderson. The Khoshkbarchi-Vera equation, which is based on the Pitzer's model, is introduced to predict the individual ionic as well as the mean ionic activity coefficients of electrolytes.
Texture Segmentation using 2-D Gabor Elementary Functions
Authors: D. Dunn, W. E. Higgins, J. Wakeley
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Many texture-segmentation schemes use an elaborate bank of filters to decompose a textured image into a joint space/spatial-frequency representation. Although these schemes show promise, and although some analytical work has been done, the relationship between texture differences and the filter configurations required to distinguish them remain largely unknown. This paper examines the issue of designing individual filters. Using a 2-D texture model, we show analytically that applying a properly configured bandpass filter to a textured image produces distinct output discontinuities at texture boundaries; the analysis is based on Gabor elementary functions, but it is the bandpass nature of the filter that is essential. Depending on the type of texture difference, these discontinuities form one of four characteristic signatures: a step, ridge, valley, or a step change in average local output variation. Accompanying experimental evidence indicates that these signatures are useful for segmenting an image. The analysis indicates those texture characteristics that are responsible for each signature type. Detailed criteria are provided for designing filters that can produce quality output signatures. We also illustrate occasions when asymmetric filters are beneficial, an issue not previously addressed.
Nodal high-order discontinuous Galerkin methods for the spherical shallow water equations
Authors: F. X. Giraldo, J. S. Hesthaven, T. Warburton
Venue: Journal of Computational Physics (2002)

We present a high-order discontinuous Galerkin method for the solution of the shallow water equations on the sphere. To overcome well-known problems with polar singularities, we consider the shallow water equations in Cartesian coordinates, augmented with a Lagrange multiplier to ensure that fluid particles are constrained to the spherical surface. The global solutions are represented by a collection of curvilinear quadrilaterals from an icosahedral grid. On each of these elements the local solutions are assumed to be well approximated by a high-order nodal Lagrange polynomial, constructed from a tensor-product of the Legendre-Gauss-Lobatto points, which also supplies a high-order quadrature. The shallow water equations are satisfied in a local discontinuous element fashion with solution continuity being enforced weakly. The numerical experiments, involving a comparison of weak and strong conservation forms and the impact of over-integration and filtering, confirm the expected high-order accuracy and the potential for using such highly parallel formulations in numerical weather prediction.
A GIS application to enhance cell-based information modeling
Authors: Josef Benedikt, Sebastian Reinberg, Leopold Riedl
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2002)

Maps have been major sources of information for a long time. Geographic Information Systems (GIS) use digital data, elevation models, satellite images, expert systems and related open source information for planning, detection, evaluation and decision making. Maps as well as GIS use spatial attributes of data in particular. Spatial Information derived is a feature of both data and language to communicate results of analysis and interpretation.A natural language approach to geographic concepts is discussed focusing on the cognitive aspects of categorizing spatial terms, which are represented by vague descriptions. Scientific analysis, however, requires a formal representation of spatial terms. The translation of linguistic concepts to spatial terms like "steep slopes" involves in herent uncertainties that are dealt with by implementing fuzzy logic tools to computer-based GIS. MapModels is a programming language based on ArcView® GIS that allows users easily to comprehend geographical (spatial) terms by means of analytical tools including membership models. A flowchart interface is preferred to a line-code oriented programming language thus enabling the user to focus on a particular problem rather than a complex programming exercise. Examples are given on how MapModels utilizes the vagueness of geographic description in GIS analysis. This paper shows, how MapModels enhances the powerful options of GIS-based spatial analysis in obtaining information from cell-based images.
Almost Sure Diagnosis of Almost Every Good Element
Authors: L. E. La Forge, Kaiyuan Huang, V. K. Agarwal
Venue: IEEE Transactions on Computers (1994)

We demonstrate a structure for mutual test among N processing elements. We indicate how this structure might be used to identify the good dice on a semiconductor wafer at a cost below that of current techniques. Under either a digraph or a comparison model, our proposed test structure has the following properties: 1) It is nearly regular. 2) It can be laid out in area O(/spl ominus/(n). 3) In time /spl ominus/(N) and with high probability, all but at most an arbitrarily small fraction of the good elements can be identified. 4) The number of tests or comparisons per element is bounded by a constant. We approximate this constant analytically. The result is a substantial savings over the /spl ominus/(log N) tests per element in regular structures whose purpose is to identify, with high probability, every good element. In contrast with the majority of previous work, our results apply even when less than half of the elements are good.
2D Silicon/Ferroelectric Liquid Crystal Spatial Light Modulators
Authors: Timothy J. Drabik, Albert H. Titus, Mark A. Handschy, David Banas, Stephen D. Gaalema, David J. Ward
Venue: IEEE Micro (1995)

We have developed a spatial light modulator technology based on foundry silicon fabrication processes, that employs a thin, ferroelectric liquid crystal light modulating layer at the substrate's surface. We have realized electrically addressed display devices with resolutions up to 256\times 256 and frame rates up to 10\thinspace kHz, as well as optically addressed "smart pixel" arrays for low-level image processing. In the course of our investigations, there have emerged not only theoretical principles that govern the performance of this class of devices, but practical limitations and also bonuses. Design innovations and effective use of modern process features have advanced performance rapidly. There is yet significant potential for further extending the speed, resolution, and functionality of this class of devices.